| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/svga/ |
| D | svga_draw_arrays.c | 135 unsigned smallest = 0; in retrieve_or_generate_indices() local
141 smallest = i; in retrieve_or_generate_indices()
144 else if (hwtnl->index_cache[prim][i].gen_nr < smallest) in retrieve_or_generate_indices()
146 smallest = i; in retrieve_or_generate_indices()
151 assert (smallest != IDX_CACHE_MAX); in retrieve_or_generate_indices()
153 pipe_resource_reference( &hwtnl->index_cache[prim][smallest].buffer, in retrieve_or_generate_indices()
158 smallest, smallest_size); in retrieve_or_generate_indices()
160 i = smallest; in retrieve_or_generate_indices()
|
| /external/mesa3d/src/gallium/drivers/svga/ |
| D | svga_draw_arrays.c | 135 unsigned smallest = 0; in retrieve_or_generate_indices() local
141 smallest = i; in retrieve_or_generate_indices()
144 else if (hwtnl->index_cache[prim][i].gen_nr < smallest) in retrieve_or_generate_indices()
146 smallest = i; in retrieve_or_generate_indices()
151 assert (smallest != IDX_CACHE_MAX); in retrieve_or_generate_indices()
153 pipe_resource_reference( &hwtnl->index_cache[prim][smallest].buffer, in retrieve_or_generate_indices()
158 smallest, smallest_size); in retrieve_or_generate_indices()
160 i = smallest; in retrieve_or_generate_indices()
|
| /external/chromium_org/third_party/leveldatabase/src/table/ |
| D | merger.cc | 156 IteratorWrapper* smallest = NULL; in FindSmallest() local
160 if (smallest == NULL) { in FindSmallest()
161 smallest = child; in FindSmallest()
162 } else if (comparator_->Compare(child->key(), smallest->key()) < 0) { in FindSmallest()
163 smallest = child; in FindSmallest()
167 current_ = smallest; in FindSmallest()
|
| /external/chromium_org/third_party/leveldatabase/src/db/ |
| D | version_set_test.cc | 25 void Add(const char* smallest, const char* largest, in Add() argument
30 f->smallest = InternalKey(smallest, smallest_seq, kTypeValue); in Add()
41 bool Overlaps(const char* smallest, const char* largest) { in Overlaps() argument
43 Slice s(smallest != NULL ? smallest : ""); in Overlaps()
46 (smallest != NULL ? &s : NULL), in Overlaps()
|
| D | version_set.cc | 109 ucmp->Compare(*user_key, f->smallest.user_key()) < 0); in BeforeFile()
289 if (ucmp->Compare(user_key, f->smallest.user_key()) >= 0 && in ForEachOverlapping()
312 if (ucmp->Compare(user_key, f->smallest.user_key()) < 0) { in ForEachOverlapping()
354 if (ucmp->Compare(user_key, f->smallest.user_key()) >= 0 && in Get()
372 if (ucmp->Compare(user_key, tmp2->smallest.user_key()) < 0) { in Get()
540 const Slice file_start = f->smallest.user_key(); in GetOverlappingInputs()
582 r.append(files[i]->smallest.DebugString()); in DebugString()
601 int r = internal_comparator->Compare(f1->smallest, f2->smallest); in operator ()()
737 const InternalKey& this_begin = v->files_[level][i]->smallest; in SaveTo()
758 f->smallest) < 0); in MaybeAddFile()
[all …]
|
| D | version_edit.h | 22 InternalKey smallest; // Smallest internal key served by table member
64 const InternalKey& smallest, in AddFile() argument
69 f.smallest = smallest; in AddFile()
|
| D | version_edit.cc | 83 PutLengthPrefixedSlice(dst, f.smallest.Encode()); in EncodeTo()
187 GetInternalKey(&input, &f.smallest) && in DecodeFrom()
258 r.append(f.smallest.DebugString()); in DebugString()
|
| D | version_set.h | 280 InternalKey* smallest,
285 InternalKey* smallest,
|
| D | builder.cc | 36 meta->smallest.DecodeFrom(iter->key()); in BuildTable()
|
| D | db_impl.cc | 64 InternalKey smallest, largest; member
487 const Slice min_user_key = meta.smallest.user_key(); in WriteLevel0Table()
493 meta.smallest, meta.largest); in WriteLevel0Table()
692 f->smallest, f->largest); in BackgroundCompaction()
767 out.smallest.Clear(); in OpenCompactionOutputFile()
850 out.number, out.file_size, out.smallest, out.largest); in InstallCompactionResults()
960 compact->current_output()->smallest.DecodeFrom(key); in DoCompactionWork()
|
| D | repair.cc | 298 t.meta.smallest.DecodeFrom(key); in ScanTable()
399 t.meta.smallest, t.meta.largest); in WriteDescriptor()
|
| /external/speex/libspeex/ |
| D | stereo.c | 151 spx_word32_t largest, smallest; in speex_encode_stereo_int() local
178 smallest = e_right; in speex_encode_stereo_int()
182 smallest = e_left; in speex_encode_stereo_int()
189 smallest = VSHR32(smallest, shift); in speex_encode_stereo_int()
190 balance = DIV32(largest, ADD32(smallest, 1)); in speex_encode_stereo_int()
195 balance=(largest+1.)/(smallest+1.); in speex_encode_stereo_int()
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/modules/objfmts/win64/tests/ |
| D | sce4.asm | 2 [allocstack 8] ; smallest value
3 [setframe rbp, 0] ; smallest value
|
| D | sce4.masm | 5 .allocstack 8 ; smallest value
6 .setframe rbp, 0 ; smallest value
|
| /external/chromium_org/third_party/skia/tests/ |
| D | PathOpsCubicLineIntersectionIdeas.cpp | 193 double smallest = SkTMin(allRoots[0], allRoots[1]); in DEF_TEST() local
195 smallest = SkTMin(smallest, allRoots[2]); in DEF_TEST()
197 SK_ALWAYSBREAK(smallest < 0); in DEF_TEST()
198 SK_ALWAYSBREAK(smallest >= -1); in DEF_TEST()
|
| /external/skia/tests/ |
| D | PathOpsCubicLineIntersectionIdeas.cpp | 193 double smallest = SkTMin(allRoots[0], allRoots[1]); in DEF_TEST() local
195 smallest = SkTMin(smallest, allRoots[2]); in DEF_TEST()
197 SK_ALWAYSBREAK(smallest < 0); in DEF_TEST()
198 SK_ALWAYSBREAK(smallest >= -1); in DEF_TEST()
|
| /external/glide/library/tests/src/com/bumptech/glide/load/engine/bitmap_recycle/ |
| D | SizeStrategyTest.java | 71 Bitmap smallest = Bitmap.createBitmap(100, 100, Bitmap.Config.ARGB_8888); in testSmallestMatchingSizeIsReturned() local
76 strategy.put(smallest); in testSmallestMatchingSizeIsReturned()
79 assertEquals(smallest, strategy.get(99, 99, Bitmap.Config.ARGB_8888)); in testSmallestMatchingSizeIsReturned()
|
| /external/chromium_org/content/browser/indexed_db/leveldb/ |
| D | leveldb_transaction.cc | 402 LevelDBIterator* smallest = 0; in SetCurrentIteratorToSmallestKey() local
405 smallest = data_iterator_.get(); in SetCurrentIteratorToSmallestKey()
408 if (!smallest || in SetCurrentIteratorToSmallestKey()
409 comparator_->Compare(db_iterator_->Key(), smallest->Key()) < 0) in SetCurrentIteratorToSmallestKey()
410 smallest = db_iterator_.get(); in SetCurrentIteratorToSmallestKey()
413 current_ = smallest; in SetCurrentIteratorToSmallestKey()
|
| /external/chromium_org/chrome/installer/mac/third_party/bsdiff/ |
| D | goobsdiff.c | 254 char smallest; in make_small() local
256 smallest = 1; in make_small()
264 smallest = 2; in make_small()
283 smallest = 3; in make_small()
311 smallest = 4; in make_small()
325 if (smallest != 1) { in make_small()
329 return smallest; in make_small()
|
| /external/chromium_org/tools/binary_size/template/ |
| D | D3SymbolTreeMap.js | 873 var smallest = undefined;
887 smallest = datum.value;
894 if (datum.value > smallest) { // array is already full
898 smallest = result[maxRecords - 1].value; // new threshold for entry
907 var smallest = undefined;
922 smallest = datum.value;
929 if (datum.value > smallest) { // array is already full
933 smallest = result[maxRecords - 1].value; // new threshold for entry
|
| /external/chromium_org/third_party/bintrees/ |
| D | README.txt | 115 …* ceiling_item(key) -> get (k, v) pair, where k is the smallest key greater than or equal to key, …
116 * ceiling_key(key) -> k, get the smallest key greater than or equal to key, O(log(n))
123 * min_item() -> get smallest (key, value) pair of T, O(log(n))
124 * min_key() -> get smallest key of T, O(log(n))
128 * nsmallest(i[,pop]) -> get list of i smallest items (k, v), O(i*log(n))
|
| /external/llvm/test/CodeGen/AArch64/ |
| D | setcc-takes-i32.ll | 8 ; It was expecting the smallest legal promotion of i1 to be the preferred SetCC
|
| /external/qemu/distrib/sdl-1.2.15/src/video/ |
| D | SDL_pixels.c | 316 unsigned int smallest; in SDL_FindColor() local
322 smallest = ~0; in SDL_FindColor()
328 if ( distance < smallest ) { in SDL_FindColor()
333 smallest = distance; in SDL_FindColor()
|
| /external/jemalloc/include/jemalloc/internal/ |
| D | jemalloc_internal.h.in | 229 /* Return the smallest quantum multiple that is >= a. */
236 /* Return the smallest long multiple that is >= a. */
243 /* Return the smallest (void *) multiple that is >= a. */
258 /* Return the smallest cacheline multiple that is >= s. */
270 /* Return the smallest pagesize multiple that is >= s. */
282 /* Return the smallest alignment multiple that is >= s. */
502 * size class, every object is aligned at the smallest power of two
|
| /external/bison/data/ |
| D | java.m4 | 102 # Return the smallest int type able to handle numbers ranging from
111 # Return the smallest int type able to handle numbers ranging from
|