/external/chromium_org/third_party/leveldatabase/src/db/ |
H A D | version_set_test.cc | 25 void Add(const char* smallest, const char* largest, argument 31 f->largest = InternalKey(largest, largest_seq, kTypeValue); 41 bool Overlaps(const char* smallest, const char* largest) { argument 44 Slice l(largest != NULL ? largest : ""); 47 (largest != NULL ? &l : NULL));
|
H A D | version_edit.h | 23 InternalKey largest; // Largest internal key served by table member in struct:leveldb::FileMetaData 61 // REQUIRES: "smallest" and "largest" are smallest and largest keys in file 65 const InternalKey& largest) { 70 f.largest = largest; 62 AddFile(int level, uint64_t file, uint64_t file_size, const InternalKey& smallest, const InternalKey& largest) argument
|
H A D | db_impl.cc | 64 InternalKey smallest, largest; member in struct:leveldb::DBImpl::CompactionState::Output 488 const Slice max_user_key = meta.largest.user_key(); 493 meta.smallest, meta.largest); 671 manual_end = c->input(0, c->num_input_files(0) - 1)->largest; 692 f->smallest, f->largest); 768 out.largest.Clear(); 850 out.number, out.file_size, out.smallest, out.largest); 962 compact->current_output()->largest.DecodeFrom(key);
|
H A D | db_test.cc | 440 void FillLevels(const std::string& smallest, const std::string& largest) { argument 441 MakeTables(config::kNumLevels, smallest, largest);
|
/external/chromium/chrome/common/extensions/docs/examples/extensions/app_launcher/ |
H A D | popup.js | 9 // Returns the largest size icon, or a default icon, for the given |app|. 14 var largest = {size:0}; 17 if (icon.size > largest.size) { 18 largest = icon; 21 return largest.url;
|
/external/chromium_org/chrome/common/extensions/docs/examples/extensions/app_launcher/ |
H A D | popup.js | 9 // Returns the largest size icon, or a default icon, for the given |app|. 14 var largest = {size:0}; 17 if (icon.size > largest.size) { 18 largest = icon; 21 return largest.url;
|
/external/chromium_org/third_party/leveldatabase/src/table/ |
H A D | merger.cc | 91 // the largest child and key() == current_->key(). Otherwise, 171 IteratorWrapper* largest = NULL; local 175 if (largest == NULL) { 176 largest = child; 177 } else if (comparator_->Compare(child->key(), largest->key()) > 0) { 178 largest = child; 182 current_ = largest;
|
/external/openfst/src/include/fst/ |
H A D | heap.h | 165 int largest; local 168 largest = l; 170 largest = i; 172 if (r < size_ && Better(A_[r], A_[largest]) ) 173 largest = r; 175 if (largest != i) { 176 Swap(i, largest); 177 Heapify(largest);
|
/external/speex/libspeex/ |
H A D | stereo.c | 151 spx_word32_t largest, smallest; local 177 largest = e_left; 181 largest = e_right; 187 shift = spx_ilog2(largest)-15; 188 largest = VSHR32(largest, shift-4); 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/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | heap.h | 152 int largest; local 155 largest = l; 157 largest = i; 159 if (r < size_ && comp_(A_[r], A_[largest]) ) 160 largest = r; 162 if (largest != i) { 163 Swap(i, largest); 164 Heapify(largest);
|
/external/chromium_org/content/browser/indexed_db/leveldb/ |
H A D | leveldb_transaction.cc | 393 LevelDBIterator* largest = 0; local 396 largest = data_iterator_.get(); 399 if (!largest || 400 comparator_->Compare(db_iterator_->Key(), largest->Key()) > 0) 401 largest = db_iterator_.get(); 404 current_ = largest;
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkPathOpsLine.cpp | 82 // find the ordinal in the original line with the largest unsigned exponent 84 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); local 85 largest = SkTMax(largest, -tiniest); 86 if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance? 103 // find the ordinal in the original line with the largest unsigned exponent 105 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); local 106 largest = SkTMax(largest, 150 double largest = SkTMax(SkTMax(y, left), right); local 185 double largest = SkTMax(SkTMax(x, top), bottom); local [all...] |
H A D | SkPathOpsPoint.h | 111 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); local 112 largest = SkTMax(largest, -tiniest); 113 return AlmostBequalUlps(largest, largest + dist); // is the dist within ULPS tolerance? 134 float largest = SkTMax(SkTMax(SkTMax(a.fX, b.fX), a.fY), b.fY); local 135 largest = SkTMax(largest, -tiniest); 136 return AlmostBequalUlps((double) largest, largest 148 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); local 185 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); local [all...] |
/external/skia/src/pathops/ |
H A D | SkPathOpsLine.cpp | 82 // find the ordinal in the original line with the largest unsigned exponent 84 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); local 85 largest = SkTMax(largest, -tiniest); 86 if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance? 103 // find the ordinal in the original line with the largest unsigned exponent 105 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); local 106 largest = SkTMax(largest, 150 double largest = SkTMax(SkTMax(y, left), right); local 185 double largest = SkTMax(SkTMax(x, top), bottom); local [all...] |
H A D | SkPathOpsPoint.h | 111 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); local 112 largest = SkTMax(largest, -tiniest); 113 return AlmostBequalUlps(largest, largest + dist); // is the dist within ULPS tolerance? 134 float largest = SkTMax(SkTMax(SkTMax(a.fX, b.fX), a.fY), b.fY); local 135 largest = SkTMax(largest, -tiniest); 136 return AlmostBequalUlps((double) largest, largest 148 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); local 185 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); local [all...] |
/external/chromium/base/ |
H A D | process_util.h | 519 // largest : size of the largest contiguous amount of memory found. It is 521 // largest_ptr: starting address of the largest memory block. 524 size_t largest; member in struct:base::FreeMBytes
|
H A D | process_util_win.cc | 796 MEMORY_BASIC_INFORMATION largest = {0}; local 806 if (info.RegionSize > largest.RegionSize) 807 largest = info; 811 free->largest = largest.RegionSize / kMegabyte; 812 free->largest_ptr = largest.BaseAddress;
|
/external/chromium_org/base/process/ |
H A D | process_metrics.h | 90 // largest : size of the largest contiguous amount of memory found. It is 92 // largest_ptr: starting address of the largest memory block. 95 size_t largest; member in struct:base::FreeMBytes
|
H A D | process_metrics_win.cc | 245 MEMORY_BASIC_INFORMATION largest = {0}; local 254 if (info.RegionSize > largest.RegionSize) 255 largest = info; 259 free->largest = largest.RegionSize / kMegabyte; 260 free->largest_ptr = largest.BaseAddress;
|
/external/chromium_org/content/common/ |
H A D | cc_messages_unittest.cc | 674 size_t largest = 0; local 680 largest = std::max(largest, sizeof(cc::CheckerboardDrawQuad)); 683 largest = std::max(largest, sizeof(cc::DebugBorderDrawQuad)); 686 largest = std::max(largest, sizeof(cc::IOSurfaceDrawQuad)); 689 largest = std::max(largest, sizeof(cc::PictureDrawQuad)); 692 largest 719 EXPECT_EQ(sizeof(RenderPassDrawQuad), largest); local [all...] |
/external/chromium_org/third_party/mesa/src/src/mesa/program/ |
H A D | prog_execute.c | 1372 const float largest = 1.884467e+19, smallest = 5.42101e-20; local 1388 if (r > largest) { 1389 r = largest; 1396 if (r < -largest) { 1397 r = -largest;
|
/external/mesa3d/src/mesa/program/ |
H A D | prog_execute.c | 1372 const float largest = 1.884467e+19, smallest = 5.42101e-20; local 1388 if (r > largest) { 1389 r = largest; 1396 if (r < -largest) { 1397 r = -largest;
|
/external/skia/tests/ |
H A D | MatrixTest.cpp | 373 SkScalar largest = (b > a) ? b : a; local 375 if (diff <= largest*tolerance) {
|
/external/chromium_org/apps/ |
H A D | shell_window.cc | 557 // Bitmaps are ordered largest to smallest. Choose the smallest bitmap 565 const SkBitmap& largest = bitmaps[largest_index]; local 566 UpdateAppIcon(gfx::Image::CreateFrom1xBitmap(largest));
|
/external/llvm/lib/ExecutionEngine/JIT/ |
H A D | JITMemoryManager.cpp | 357 uintptr_t largest = candidateBlock->BlockSize; local 359 // Search for the largest free block 361 if (iter->BlockSize > largest) { 362 largest = iter->BlockSize; 368 largest = largest - sizeof(MemoryRangeHeader); 372 if (largest < ActualSize || 373 largest <= FreeRangeHeader::getMinBlockSize()) { 480 uintptr_t largest = candidateBlock->BlockSize; local 482 // Search for the largest fre [all...] |