Searched refs:smallest (Results 1 - 25 of 36) sorted by relevance

12

/external/chromium_org/third_party/leveldatabase/src/db/
H A Dversion_edit.h22 InternalKey smallest; // Smallest internal key served by table member in struct:leveldb::FileMetaData
61 // REQUIRES: "smallest" and "largest" are smallest and largest keys in file
64 const InternalKey& smallest,
69 f.smallest = smallest;
62 AddFile(int level, uint64_t file, uint64_t file_size, const InternalKey& smallest, const InternalKey& largest) argument
H A Dversion_set_test.cc25 void Add(const char* smallest, const char* largest, argument
30 f->smallest = InternalKey(smallest, smallest_seq, kTypeValue);
41 bool Overlaps(const char* smallest, const char* largest) { argument
43 Slice s(smallest != NULL ? smallest : "");
46 (smallest != NULL ? &s : NULL),
H A Dversion_set.cc109 ucmp->Compare(*user_key, f->smallest.user_key()) < 0);
289 if (ucmp->Compare(user_key, f->smallest.user_key()) >= 0 &&
312 if (ucmp->Compare(user_key, f->smallest.user_key()) < 0) {
354 if (ucmp->Compare(user_key, f->smallest.user_key()) >= 0 &&
372 if (ucmp->Compare(user_key, tmp2->smallest.user_key()) < 0) {
540 const Slice file_start = f->smallest.user_key();
582 r.append(files[i]->smallest.DebugString());
596 // Helper to sort by v->files_[file_number].smallest
601 int r = internal_comparator->Compare(f1->smallest, f2->smallest);
[all...]
H A Dbuilder.cc36 meta->smallest.DecodeFrom(iter->key());
H A Dversion_edit.cc83 PutLengthPrefixedSlice(dst, f.smallest.Encode());
187 GetInternalKey(&input, &f.smallest) &&
258 r.append(f.smallest.DebugString());
H A Dversion_set.h39 // Return the smallest index i such that files[i]->largest >= key.
47 // [*smallest,*largest].
48 // smallest==NULL represents a key smaller than all keys in the DB.
280 InternalKey* smallest,
285 InternalKey* smallest,
H A Drepair.cc8 // (a) smallest/largest for the table
24 // Store per-table metadata (smallest, largest, largest-seq#, ...)
298 t.meta.smallest.DecodeFrom(key);
399 t.meta.smallest, t.meta.largest);
H A Ddb_impl.cc64 InternalKey smallest, largest; member in struct:leveldb::DBImpl::CompactionState::Output
487 const Slice min_user_key = meta.smallest.user_key();
493 meta.smallest, meta.largest);
692 f->smallest, f->largest);
767 out.smallest.Clear();
850 out.number, out.file_size, out.smallest, out.largest);
960 compact->current_output()->smallest.DecodeFrom(key);
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/objfmts/win64/tests/
H A Dsce4.asm2 [allocstack 8] ; smallest value
3 [setframe rbp, 0] ; smallest value
/external/chromium_org/third_party/leveldatabase/src/table/
H A Dmerger.cc65 // the smallest child and key() == current_->key(). Otherwise,
156 IteratorWrapper* smallest = NULL; local
160 if (smallest == NULL) {
161 smallest = child;
162 } else if (comparator_->Compare(child->key(), smallest->key()) < 0) {
163 smallest = child;
167 current_ = smallest;
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/svga/
H A Dsvga_draw_arrays.c135 unsigned smallest = 0; local
141 smallest = i;
144 else if (hwtnl->index_cache[prim][i].gen_nr < smallest)
146 smallest = i;
151 assert (smallest != IDX_CACHE_MAX);
153 pipe_resource_reference( &hwtnl->index_cache[prim][smallest].buffer,
157 debug_printf("%s discard smallest %d/%d\n", __FUNCTION__,
158 smallest, smallest_size);
160 i = smallest;
/external/mesa3d/src/gallium/drivers/svga/
H A Dsvga_draw_arrays.c135 unsigned smallest = 0; local
141 smallest = i;
144 else if (hwtnl->index_cache[prim][i].gen_nr < smallest)
146 smallest = i;
151 assert (smallest != IDX_CACHE_MAX);
153 pipe_resource_reference( &hwtnl->index_cache[prim][smallest].buffer,
157 debug_printf("%s discard smallest %d/%d\n", __FUNCTION__,
158 smallest, smallest_size);
160 i = smallest;
/external/chromium_org/third_party/speex/libspeex/
H A Dstereo.c151 spx_word32_t largest, smallest; local
178 smallest = e_right;
182 smallest = e_left;
189 smallest = VSHR32(smallest, shift);
190 balance = DIV32(largest, ADD32(smallest, 1));
195 balance=(largest+1.)/(smallest+1.);
216 /*fprintf (stderr, "%d %d %d %d\n", largest, smallest, balance_id, e_ratio);*/
/external/speex/libspeex/
H A Dstereo.c151 spx_word32_t largest, smallest; local
178 smallest = e_right;
182 smallest = e_left;
189 smallest = VSHR32(smallest, shift);
190 balance = DIV32(largest, ADD32(smallest, 1));
195 balance=(largest+1.)/(smallest+1.);
216 /*fprintf (stderr, "%d %d %d %d\n", largest, smallest, balance_id, e_ratio);*/
/external/glide/library/tests/src/com/bumptech/glide/load/engine/bitmap_recycle/
H A DSizeStrategyTest.java71 Bitmap smallest = Bitmap.createBitmap(100, 100, Bitmap.Config.ARGB_8888);
76 strategy.put(smallest);
79 assertEquals(smallest, strategy.get(99, 99, Bitmap.Config.ARGB_8888));
/external/chromium_org/third_party/skia/tests/
H A DPathOpsCubicLineIntersectionIdeas.cpp193 double smallest = SkTMin(allRoots[0], allRoots[1]); local
195 smallest = SkTMin(smallest, allRoots[2]);
197 SK_ALWAYSBREAK(smallest < 0);
198 SK_ALWAYSBREAK(smallest >= -1);
H A DPathOpsAngleIdeas.cpp53 int smallest = -1; local
65 smallest = idx;
69 REPORTER_ASSERT(reporter, smallest >= 0);
71 return i[1][smallest];
H A DSkpSkGrTest.cpp308 int smallest = SK_MaxS32; local
311 if (smallest > data->fError[index]) {
312 smallest = data->fError[index];
/external/skia/tests/
H A DPathOpsCubicLineIntersectionIdeas.cpp193 double smallest = SkTMin(allRoots[0], allRoots[1]); local
195 smallest = SkTMin(smallest, allRoots[2]);
197 SK_ALWAYSBREAK(smallest < 0);
198 SK_ALWAYSBREAK(smallest >= -1);
H A DPathOpsAngleIdeas.cpp53 int smallest = -1; local
65 smallest = idx;
69 REPORTER_ASSERT(reporter, smallest >= 0);
71 return i[1][smallest];
/external/chromium_org/content/browser/indexed_db/leveldb/
H A Dleveldb_transaction.cc407 LevelDBIterator* smallest = 0; local
410 smallest = data_iterator_.get();
413 if (!smallest ||
414 comparator_->Compare(db_iterator_->Key(), smallest->Key()) < 0)
415 smallest = db_iterator_.get();
418 current_ = smallest;
/external/chromium_org/chrome/installer/mac/third_party/bsdiff/
H A Dgoobsdiff.c238 /* Recompress buf of size buf_len using bzip2 or gzip. The smallest version is
239 * used. The original uncompressed variant may be the smallest. Returns a
242 * smallest, it is freed. The caller must free any buf after this function
254 char smallest; local
256 smallest = 1;
264 smallest = 2;
283 smallest = 3;
311 smallest = 4;
325 if (smallest != 1) {
329 return smallest;
[all...]
/external/chromium_org/tools/binary_size/template/
H A DD3SymbolTreeMap.js873 var smallest = undefined;
887 smallest = datum.value;
894 if (datum.value > smallest) { // array is already full
897 result.pop(); // get rid of smallest element
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
932 result.pop(); // get rid of smallest element
933 smallest
[all...]
/external/qemu/distrib/sdl-1.2.15/src/video/
H A DSDL_pixels.c316 unsigned int smallest; local
322 smallest = ~0;
328 if ( distance < smallest ) {
333 smallest = distance;
/external/libvorbis/doc/
H A D02-bitpacking.tex25 smallest integer storage representation offered by a platform. On
30 size that is a grouped multiple of this smallest size.

Completed in 470 milliseconds

12