| /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;
|
| /frameworks/ex/variablespeed/jni/ |
| sola_time_scaler.h | 30 // OverLap Add (SOLA).
88 // @param overlap_duration correlation overlap size, in seconds
143 int half_overlap_frames_; // half of the overlap
|
| /external/llvm/test/Transforms/SROA/ |
| basictest.ll | 113 ; Make a sequence of overlapping stores to the array. These overlap both in
115 %overlap.1.i8 = getelementptr [300 x i8]* %a, i64 0, i64 142
116 %overlap.2.i8 = getelementptr [300 x i8]* %a, i64 0, i64 143
117 %overlap.3.i8 = getelementptr [300 x i8]* %a, i64 0, i64 144
118 %overlap.4.i8 = getelementptr [300 x i8]* %a, i64 0, i64 145
119 %overlap.5.i8 = getelementptr [300 x i8]* %a, i64 0, i64 146
120 %overlap.6.i8 = getelementptr [300 x i8]* %a, i64 0, i64 147
121 %overlap.7.i8 = getelementptr [300 x i8]* %a, i64 0, i64 148
122 %overlap.8.i8 = getelementptr [300 x i8]* %a, i64 0, i64 149
123 %overlap.9.i8 = getelementptr [300 x i8]* %a, i64 0, i64 15
[all...] |
| /external/chromium_org/ui/views/bubble/ |
| bubble_frame_view_unittest.cc | 72 // arrow overlap.
83 // arrow overlap.
94 // arrow overlap.
105 // arrow overlap.
116 // arrow overlap.
127 // arrow overlap.
225 // arrow overlap.
|
| /frameworks/base/media/java/android/media/videoeditor/ |
| Transition.java | 287 * @return List of effects that overlap with the transition
360 * Check how many effects and overlays overlap with transition and
361 * generate effect clip first if there is any overlap
391 * Check how many effects and overlays overlap with transition and
392 * generate effect clip first if there is any overlap
413 * Check how many effects and overlays overlap with transition and
414 * generate effect clip first if there is any overlap
|
| /frameworks/av/media/libstagefright/codecs/mp3dec/src/ |
| pvmp3_imdct_synth.cpp | 39 int32 overlap[], Pointer to overlap values of current channel
53 The first half of the output values are added to the stored overlap
56 output values is stored for overlap with the next data granule.
217 int32 overlap[SUBBANDS_NUMBER*FILTERBANK_BANDS],
244 int32 * history = overlap + (band * FILTERBANK_BANDS);
285 /* next iteration overlap */
295 /* next iteration overlap */
335 int32 * history = overlap + (band * FILTERBANK_BANDS);
370 pv_memset(history, 0, FILTERBANK_BANDS*sizeof(*overlap));
[all...] |
| /external/chromium_org/third_party/icu/source/common/ |
| utrie.c | 580 * - overlaps adjacent blocks as much as possible (if overlap==TRUE)
582 * - moves and overlaps blocks that overlap with multiple values in the overlap region
585 * - try to move and overlap blocks that are not already adjacent
588 utrie_compact(UNewTrie *trie, UBool overlap, UErrorCode *pErrorCode) {
636 overlap ? UTRIE_DATA_GRANULARITY : UTRIE_DATA_BLOCK_LENGTH))
650 if(overlap && start>=overlapStart) {
651 /* look for maximum overlap (modulo granularity) with the previous, adjacent block */
660 /* some overlap */
669 /* no overlap, just move the indexes to their new positions *
[all...] |
| /external/icu4c/common/ |
| utrie.cpp | 580 * - overlaps adjacent blocks as much as possible (if overlap==TRUE)
582 * - moves and overlaps blocks that overlap with multiple values in the overlap region
585 * - try to move and overlap blocks that are not already adjacent
588 utrie_compact(UNewTrie *trie, UBool overlap, UErrorCode *pErrorCode) {
636 overlap ? UTRIE_DATA_GRANULARITY : UTRIE_DATA_BLOCK_LENGTH))
650 if(overlap && start>=overlapStart) {
651 /* look for maximum overlap (modulo granularity) with the previous, adjacent block */
660 /* some overlap */
669 /* no overlap, just move the indexes to their new positions *
[all...] |
| /external/valgrind/main/memcheck/tests/ |
| Makefile.in | 81 custom_alloc$(EXEEXT) custom-overlap$(EXEEXT) \
104 overlap$(EXEEXT) partiallydefinedeq$(EXEEXT) \
188 custom_overlap_SOURCES = custom-overlap.c
189 custom_overlap_OBJECTS = custom-overlap.$(OBJEXT)
398 overlap_SOURCES = overlap.c
399 overlap_OBJECTS = overlap-overlap.$(OBJEXT)
589 custom-overlap.c custom_alloc.c deep-backtrace.c \
604 overlap.c partial_load.c partiallydefinedeq.c pdb-realloc.c \
620 custom-overlap.c custom_alloc.c deep-backtrace.c
[all...] |
| /external/chromium_org/third_party/leveldatabase/src/db/ |
| version_set.cc | 139 // No overlap
141 return true; // Overlap
156 // beginning of range is after all files, so no overlap.
241 // Merge all level zero files together since they may overlap
318 // Level-0 files may overlap each other. Find all files that
319 // overlap user_key and process them in order from newest to oldest.
429 // Push to next level if there is no overlap in next level,
449 // Store in "*inputs" all files in "level" that overlap [begin,end]
475 // Level-0 files may overlap each other. So check if the newly
659 // Make sure there is no overlap in levels >
[all...] |
| /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/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/third_party/icu/source/common/unicode/ |
| ucasemap.h | 33 * Currently, the functionality provided here does not overlap with uchar.h
247 * The source string and the destination buffer must not overlap.
279 * The source string and the destination buffer must not overlap.
308 * The source string and the destination buffer must not overlap.
357 * The source string and the destination buffer must not overlap.
393 * The source string and the destination buffer must not overlap.
|
| /external/icu4c/common/unicode/ |
| ucasemap.h | 33 * Currently, the functionality provided here does not overlap with uchar.h
247 * The source string and the destination buffer must not overlap.
279 * The source string and the destination buffer must not overlap.
308 * The source string and the destination buffer must not overlap.
357 * The source string and the destination buffer must not overlap.
395 * The source string and the destination buffer must not overlap.
|
| /bionic/libc/arch-arm/bionic/ |
| strcmp.S | 173 /* Critical inner Loop: Block with 3 bytes initial overlap */
220 /* Critical inner Loop: Block with 2 bytes initial overlap */
266 /* Critical inner Loop: Block with 1 byte initial overlap */
|
| /bionic/libc/arch-arm/generic/bionic/ |
| strcmp.S | 173 /* Critical inner Loop: Block with 3 bytes initial overlap */
220 /* Critical inner Loop: Block with 2 bytes initial overlap */
266 /* Critical inner Loop: Block with 1 byte initial overlap */
|
| /external/chromium_org/third_party/WebKit/Source/core/platform/ |
| PODIntervalTree.h | 99 // Returns all intervals in the tree which overlap the given query
109 // Returns all intervals in the tree which overlap the given query
174 // Check for overlap with current node.
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkRTree.h | 25 * something resembling an R*-tree, which attempts to minimize area and overlap during insertion,
26 * and aims to minimize a combination of margin, overlap, and area when splitting.
31 * and reinserting nodes generally helps reduce overlap and make a better tree). Deletion of nodes
|
| /external/llvm/include/llvm/ADT/ |
| ImmutableIntervalMap.h | 59 // Assume L and R does not overlap.
151 // Remove one overlap from T.
157 // If current key does not overlap the inserted key.
|
| /external/llvm/lib/CodeGen/ |
| LiveIntervalUnion.cpp | 148 // This is an overlap, record the interfering register.
165 assert(VirtRegI->end <= LiveUnionI.start() && "Expected non-overlap");
172 // Detect overlap, handle above.
|
| /external/skia/src/core/ |
| SkRTree.h | 25 * something resembling an R*-tree, which attempts to minimize area and overlap during insertion,
26 * and aims to minimize a combination of margin, overlap, and area when splitting.
31 * and reinserting nodes generally helps reduce overlap and make a better tree). Deletion of nodes
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| ConstraintPainter.java | 364 * margins, or where the two nodes overlap horizontally and where they don't, etc.
367 * nodes do not overlap horizontally and the target node has a bottom margin:
402 // First see if the two views overlap horizontally. If so, we can just draw a direct
420 // Yes, the lines overlap -- just draw a straight arrow
474 // the overlap region, to ensure that it does not overlap the center selection
493 // Center the vertical line in the overlap region
500 // If there is no horizontal overlap in the vertical constraints, then we
531 // Compute overlap region and pick the middle
608 * or where the two nodes overlap horizontally and where they don't, etc
[all...] |
| /art/runtime/ |
| thread_android.cc | 34 // of the system. In some cases adjacent entries may overlap.
|
| well_known_classes.h | 29 // them up. Similar to libcore's JniConstants (except there's no overlap, so
|
| /bionic/tests/ |
| string_benchmark.cpp | 72 memmove(buf, buf + 1, nbytes); // Worst-case overlap.
|
