| /frameworks/av/media/libstagefright/codecs/mp3dec/src/ |
| s_tmp3dec_chan.h | 88 int32 overlap[SUBBANDS_NUMBER*FILTERBANK_BANDS]; member in struct:__anon31535
|
| /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 | 22 int overlap; member in struct:__anon22997
|
| /external/aac/libFDK/include/ |
| mdct.h | 117 } overlap; /**< Pointer to overlap memory */ member in struct:__anon2559
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/third_party/WebKit/Source/core/rendering/shapes/ |
| ShapeInterval.cpp | 95 bool overlap = false; local
102 if (!overlap || !v12.intersect(interval, interval)) {
103 if (overlap)
106 overlap = true;
113 if (overlap)
115 overlap = false;
123 if (overlap)
|
| /external/chromium_org/webkit/browser/fileapi/ |
| sandbox_file_stream_writer.cc | 34 int64 overlap = file_size - file_offset; local
35 if (kint64max - overlap > quota)
36 quota += overlap;
|
| /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/chromium_org/chrome/browser/ui/window_sizer/ |
| window_sizer_common_unittest.cc | 46 gfx::Rect overlap = work_areas_[i]; local
47 overlap.Intersect(match_rect);
48 int area = overlap.width() * overlap.height();
|
| /external/chromium_org/ui/views/controls/ |
| styled_label.cc | 250 // Lay out the views to overlap by 1 pixel to compensate for their border
252 const int overlap = 1; local
254 DCHECK_EQ(line_height, view_size.height() - 2 * overlap);
257 gfx::Point(GetInsets().left() + x - overlap,
258 GetInsets().top() + line * line_height - overlap),
262 x += view_size.width() - 2 * overlap;
|
| /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:__anon2620
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/skia/src/core/ |
| SkRTree.cpp | 199 // root's child pointers do point to leaves, so minimize overlap increase
207 int32_t overlap = 0; local
211 // overlap, but computing overlaps is expensive and omitting it doesn't seem to
213 overlap += get_overlap(expandedBounds, root->child(j)->fBounds);
216 if (overlap < minOverlapIncrease || (overlap == minOverlapIncrease &&
219 minOverlapIncrease = overlap;
278 int32_t overlap = get_overlap(r1, r2); local
281 if (overlap < minOverlap || (overlap == minOverlap && area < minArea))
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| LiveIntervalUnion.h | 35 overlap(const LiveRange &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/qemu/ |
| os-win32.c | 251 OVERLAPPED overlap; local
253 memset(&overlap, 0, sizeof(overlap));
263 &overlap, NULL);
|
| /external/skia/src/core/ |
| SkRTree.cpp | 199 // root's child pointers do point to leaves, so minimize overlap increase
207 int32_t overlap = 0; local
211 // overlap, but computing overlaps is expensive and omitting it doesn't seem to
213 overlap += get_overlap(expandedBounds, root->child(j)->fBounds);
216 if (overlap < minOverlapIncrease || (overlap == minOverlapIncrease &&
219 minOverlapIncrease = overlap;
278 int32_t overlap = get_overlap(r1, r2); local
281 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;
|
| /external/chromium_org/third_party/WebKit/Source/core/platform/ |
| Scrollbar.cpp | 472 // Get our window resizer rect and see if we overlap. Adjust to avoid the overlap
481 int overlap = rect.maxX() - resizerRect.x(); local
482 if (overlap > 0 && resizerRect.maxX() >= rect.maxX()) {
483 adjustedRect.setWidth(rect.width() - overlap);
487 int overlap = rect.maxY() - resizerRect.y(); local
488 if (overlap > 0 && resizerRect.maxY() >= rect.maxY()) {
489 adjustedRect.setHeight(rect.height() - overlap);
|
| /external/chromium_org/third_party/icu/source/common/ |
| unisetspan.cpp | 563 * with a partial overlap because the recursive algorithm would have tried
611 * with a partial overlap because the standard algorithm would have tried
614 * must be matched with a full overlap because the longest-match algorithm
639 // Consider strings; they may overlap with the span.
650 int32_t overlap=spanLengths[i]; local
651 if(overlap==ALL_CP_CONTAINED) {
658 // Try to match this string at pos-overlap..pos.
659 if(overlap>=LONG_SPAN) {
660 overlap=length16;
662 U16_BACK_1(s16, 0, overlap); // Length of the string minus the last code point
689 int32_t overlap=spanLengths[i]; local
814 int32_t overlap=spanBackLengths[i]; local
855 int32_t overlap=spanBackLengths[i]; local
982 int32_t overlap=spanUTF8Lengths[i]; local
1030 int32_t overlap=spanUTF8Lengths[i]; local
1162 int32_t overlap=spanBackUTF8Lengths[i]; local
1211 int32_t overlap=spanBackUTF8Lengths[i]; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_blit.c | 371 * \return TRUE if two regions overlap, FALSE otherwise
391 return TRUE; /* some overlap */
447 boolean overlap; local
459 /* do the regions overlap? */
460 overlap = src_tex == dst->texture &&
494 !overlap) {
|
| /external/icu4c/common/ |
| unisetspan.cpp | 565 * with a partial overlap because the recursive algorithm would have tried
613 * with a partial overlap because the standard algorithm would have tried
616 * must be matched with a full overlap because the longest-match algorithm
641 // Consider strings; they may overlap with the span.
652 int32_t overlap=spanLengths[i]; local
653 if(overlap==ALL_CP_CONTAINED) {
660 // Try to match this string at pos-overlap..pos.
661 if(overlap>=LONG_SPAN) {
662 overlap=length16;
664 U16_BACK_1(s16, 0, overlap); // Length of the string minus the last code point
691 int32_t overlap=spanLengths[i]; local
816 int32_t overlap=spanBackLengths[i]; local
857 int32_t overlap=spanBackLengths[i]; local
984 int32_t overlap=spanUTF8Lengths[i]; local
1032 int32_t overlap=spanUTF8Lengths[i]; local
1164 int32_t overlap=spanBackUTF8Lengths[i]; local
1213 int32_t overlap=spanBackUTF8Lengths[i]; local
[all...] |
| /external/libvorbis/doc/ |
| 01-introduction.tex | 303 \item overlap/add left-hand output of transform with right-hand output of previous frame
305 \item if not first frame, return results of overlap/add as audio result of current frame
312 later before overlap/add with the next frame. This optimization
358 \captionof{figure}{overlap of two equal-sized windows}
366 \captionof{figure}{overlap of a long and a short window}
492 \paragraph{overlap/add data}
496 the window overlap diagram). At this point, the audio data between the
515 the returned range is not actually overlap. This does not damage
|
