/external/valgrind/main/none/tests/s390x/ |
mvc.c | 7 char overlap[]= "012345678901234567890"; variable 24 /* Destructive overlap #1 */ 25 printf("------- Destructive overlap #1\n"); 26 printf("before: |%s|\n", overlap); 28 ::"a" (overlap),"a" (overlap): "memory"); 29 printf("after: |%s|\n", overlap); 31 /* Destructive overlap #2 */ 32 printf("------- Destructive overlap #2\n"); 40 /* Destructive overlap #3 * [all...] |
/frameworks/av/media/libstagefright/codecs/mp3dec/src/ |
s_tmp3dec_chan.h | 88 int32 overlap[SUBBANDS_NUMBER*FILTERBANK_BANDS]; member in struct:__anon17987
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/decoder/ |
ec_types.h | 26 int overlap; member in struct:__anon17698
|
/external/chromium_org/ui/gfx/ |
break_list_unittest.cc | 94 std::vector<std::pair<size_t, bool> > overlap; local 95 overlap.push_back(std::pair<size_t, bool>(0, true)); 96 overlap.push_back(std::pair<size_t, bool>(2, false)); 97 overlap.push_back(std::pair<size_t, bool>(3, true)); 98 overlap.push_back(std::pair<size_t, bool>(6, false)); 99 overlap.push_back(std::pair<size_t, bool>(7, true)); 100 EXPECT_TRUE(breaks.EqualsForTesting(overlap));
|
/external/libvpx/libvpx/vp8/decoder/ |
ec_types.h | 26 int overlap; member in struct:__anon8562
|
/hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/decoder/ |
ec_types.h | 26 int overlap; member in struct:__anon19745
|
/external/aac/libFDK/include/ |
mdct.h | 117 } overlap; /**< Pointer to overlap memory */ member in struct:__anon4778 123 int ov_offset; /**< overlap time data fill level */ 124 int ov_size; /**< Overlap buffer size in words */ 134 * \param overlap pointer to FIXP_DBL overlap buffer. 135 * \param overlapBufferSize size in FIXP_DBLs of the given overlap buffer. 139 FIXP_DBL *overlap, 151 * \param fr right overlap window slope length 152 * \param wrs pointer to the right side overlap window coefficients [all...] |
/external/chromium_org/storage/browser/fileapi/ |
sandbox_file_stream_writer.cc | 33 int64 overlap = file_size - file_offset; local 34 if (kint64max - overlap > quota) 35 quota += overlap;
|
/external/chromium_org/chrome/browser/ui/window_sizer/ |
window_sizer_common_unittest.cc | 79 gfx::Rect overlap = displays_[i].bounds(); variable 80 overlap.Intersect(match_rect); 81 int area = overlap.width() * overlap.height();
|
/external/chromium_org/third_party/opus/src/celt/dump_modes/ |
dump_modes.c | 89 fprintf(file, "#ifndef DEF_WINDOW%d\n", mode->overlap); 90 fprintf(file, "#define DEF_WINDOW%d\n", mode->overlap); 91 fprintf (file, "static const opus_val16 window%d[%d] = {\n", mode->overlap, mode->overlap); 92 for (j=0;j<mode->overlap;j++) 207 fprintf(file, "static const CELTMode mode%d_%d_%d = {\n", mode->Fs, mdctSize, mode->overlap); 209 fprintf(file, "%d,\t/* overlap */\n", mode->overlap); 232 fprintf(file, "window%d,\t/* window */\n", mode->overlap); 251 fprintf(file, "&mode%d_%d_%d,\n", mode->Fs, mdctSize, mode->overlap); 261 int overlap = 0; local [all...] |
/external/chromium_org/third_party/opus/src/celt/ |
modes.h | 42 #ifndef OVERLAP 43 #define OVERLAP(mode) ((mode)->overlap) 62 int overlap; member in struct:OpusCustomMode
|
/external/libopus/celt/ |
modes.h | 42 #ifndef OVERLAP 43 #define OVERLAP(mode) ((mode)->overlap) 62 int overlap; member in struct:OpusCustomMode
|
/external/qemu/ |
os-win32.c | 128 OVERLAPPED overlap; local 130 memset(&overlap, 0, sizeof(overlap)); 140 &overlap, NULL);
|
/external/fio/lib/ |
prio_tree.c | 24 * i.e., selecting a set of stored intervals (vmas) that overlap with (map) a 27 * intervals (vmas) that overlap (map) with the input interval X (the set of 291 * overlap with the input interval X [radix_index, heap_index]. The enumeration 294 * 'm' is the number of prio_tree_nodes that overlap the interval X. 386 static inline int overlap(struct prio_tree_iter *iter, function 419 if (overlap(iter, r_index, h_index)) 447 if (overlap(iter, r_index, h_index)) 461 if (overlap(iter, r_index, h_index))
|
axmap.c | 220 unsigned long mask, overlap; local 228 * Mask off any potential overlap, only sets contig regions 230 overlap = al->map[offset] & mask; 231 if (overlap == mask) 234 while (overlap) { 235 unsigned long clear_mask = ~(1UL << ffz(~overlap)); 238 overlap &= clear_mask;
|
/bootable/recovery/applypatch/ |
bsdiff.c | 233 off_t overlap,Ss,lens; local 321 overlap=(lastscan+lenf)-(scan-lenb); 323 for(i=0;i<overlap;i++) { 324 if(new[lastscan+lenf-overlap+i]== 325 old[lastpos+lenf-overlap+i]) s++; 331 lenf+=lens-overlap;
|
/external/aac/libSBRdec/src/ |
lpp_tran.h | 181 UCHAR overlap; /*!< Overlap size */ member in struct:__anon4841 226 const int overlap);
|
/external/bsdiff/ |
bsdiff.c | 206 off_t overlap,Ss,lens; local 312 overlap=(lastscan+lenf)-(scan-lenb); 314 for(i=0;i<overlap;i++) { 315 if(new[lastscan+lenf-overlap+i]== 316 old[lastpos+lenf-overlap+i]) s++; 322 lenf+=lens-overlap;
|
/external/chromium_org/courgette/third_party/ |
bsdiff_create.cc | 358 // If the extended scans overlap, pick a position in the overlap region 361 int overlap = (lastscan + lenf) - (scan - lenb); local 364 for (int i = 0; i < overlap; i++) { 365 if (newbuf[lastscan + lenf - overlap + i] == 366 old[lastpos + lenf - overlap + i]) score++; 371 lenf += lens - overlap;
|
/external/chromium_org/third_party/WebKit/Source/core/page/ |
SpatialNavigation.cpp | 687 double overlap = (intersectionRect.width() * intersectionRect.height()).toDouble(); local 690 candidate.distance = sqrt(euclidianDistancePow2) + navigationAxisDistance+ orthogonalAxisDistance * 2 - sqrt(overlap); 745 // Area elements tend to overlap more than other focusable elements. We flatten the rect of the area elements
|
/external/llvm/include/llvm/CodeGen/ |
LiveIntervalUnion.h | 35 overlap(const LiveInterval::Segment &VRSeg, function in namespace:llvm 76 // Provide public access to the underlying map to allow overlap iteration.
|
/external/openfst/src/include/fst/ |
interval-set.h | 300 bool overlap = false; // point in both intervals_ and intervals local 303 if (it1->end <= it2->begin) { // no overlap - it1 first 306 } else if (it2->end <= it1->begin) { // no overlap - it2 first 310 overlap = true; 315 overlap = true; 319 overlap = true; 321 } else { // strict overlap 324 overlap = true; 326 if (only1 == true && only2 == true && overlap == true) 334 return only1 == true && only2 == true && overlap == true [all...] |
/external/skia/src/core/ |
SkRTree.cpp | 197 // root's child pointers do point to leaves, so minimize overlap increase 205 int32_t overlap = 0; local 209 // overlap, but computing overlaps is expensive and omitting it doesn't seem to 211 overlap += get_overlap(expandedBounds, root->child(j)->fBounds); 214 if (overlap < minOverlapIncrease || (overlap == minOverlapIncrease && 217 minOverlapIncrease = overlap; 276 int32_t overlap = get_overlap(r1, r2); local 279 if (overlap < minOverlap || (overlap == minOverlap && area < minArea)) [all...] |
/external/chromium_org/chrome/browser/ui/panels/ |
panel_drag_controller.cc | 27 // The minimum distance and overlap (in pixels) between two panels such that 37 // Check for no overlap. 41 // Check for complete overlap. 48 // Compute the overlap part. 54 // Check for no overlap. 58 // Check for complete overlap. 65 // Compute the overlap part. 689 int overlap; local 692 overlap = GetVerticalOverlap(potential_dragging_bounds, panel_bounds); 693 if (overlap > kGluePanelsOverlapThreshold) [all...] |
/external/chromium_org/chrome/installer/mac/third_party/bsdiff/ |
goobsdiff.c | 342 off_t overlap,Ss,lens; local 456 overlap=(lastscan+lenf)-(scan-lenb); 458 for(i=0;i<overlap;i++) { 459 if(new[lastscan+lenf-overlap+i]== 460 old[lastpos+lenf-overlap+i]) s++; 466 lenf+=lens-overlap;
|