/external/libvpx/libvpx/vpx_mem/memory_manager/ |
hmm_largest.c | 19 U(size_bau) largest; 22 largest = 0; 29 largest = 47 if (lf_size > largest) 48 largest = lf_size; 51 /* Convert largest size to AAUs and subract head size leaving payload 54 return(largest ? 55 ((largest * ((U(size_aau)) HMM_BLOCK_ALIGN_UNIT)) - HEAD_AAUS) :
|
/external/openfst/src/include/fst/ |
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/srec/tools/thirdparty/OpenFst/fst/lib/ |
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);
|
/sdk/emulator/opengl/host/libs/Translator/EGL/ |
EglPbufferSurface.h | 35 void getDim(EGLint* width,EGLint* height,EGLint* largest){ 38 *largest = m_largest;
|
/external/chromium_org/third_party/leveldatabase/src/db/ |
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;
|
version_set_test.cc | 25 void Add(const char* smallest, const char* largest, 31 f->largest = InternalKey(largest, largest_seq, kTypeValue); 41 bool Overlaps(const char* smallest, const char* largest) { 44 Slice l(largest != NULL ? largest : ""); 47 (largest != NULL ? &l : NULL));
|
version_set.cc | 99 if (icmp.InternalKeyComparator::Compare(f->largest.Encode(), key) < 0) { 100 // Key at "mid.largest" is < "target". Therefore all 104 // Key at "mid.largest" is >= "target". Therefore all files 116 ucmp->Compare(*user_key, f->largest.user_key()) > 0); 165 // is the largest key that occurs in the file, and value() is an 200 return (*flist_)[index_]->largest.Encode(); 324 ucmp->Compare(user_key, f->largest.user_key()) <= 0) { 334 // Binary search to find earliest index whose largest key >= ikey. 467 const Slice file_limit = f->largest.user_key(); 510 r.append(files[i]->largest.DebugString()) [all...] |
builder.cc | 39 meta->largest.DecodeFrom(key);
|
version_edit.cc | 84 PutLengthPrefixedSlice(dst, f.largest.Encode()); 188 GetInternalKey(&input, &f.largest)) { 260 r.append(f.largest.DebugString());
|
/external/chromium_org/third_party/leveldatabase/src/table/ |
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/llvm/test/MC/COFF/ |
linkonce.s | 31 .linkonce largest 159 // CHECK: Selection: Largest (0x6)
|
/external/chromium_org/third_party/skia/src/pathops/ |
SkPathOpsLine.cpp | 84 // find the ordinal in the original line with the largest unsigned exponent 86 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); local 87 largest = SkTMax(largest, -tiniest); 88 if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance?
|
/external/skia/src/pathops/ |
SkPathOpsLine.cpp | 84 // find the ordinal in the original line with the largest unsigned exponent 86 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); local 87 largest = SkTMax(largest, -tiniest); 88 if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance?
|
/cts/tests/tests/display/src/android/display/cts/ |
DisplayTest.java | 162 Point largest = new Point(); local 163 display.getCurrentSizeRange(smallest, largest); 167 assertEquals(SECONDARY_DISPLAY_WIDTH, largest.x); 168 assertEquals(SECONDARY_DISPLAY_HEIGHT, largest.y);
|
/packages/apps/DeskClock/src/com/android/deskclock/timer/ |
TimerView.java | 92 int largest = 0; local 94 if (widths[ii] > widths[largest]) { 95 largest = ii; 99 textView.setPadding((int) (gapPadding * widths[largest]), 0, 0, 0);
|
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/objfmts/win64/tests/ |
sce4.asm | 11 [setframe rbp, 240] ; largest value
|
/external/speex/libspeex/ |
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/chromium_org/base/process/ |
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/llvm/lib/ExecutionEngine/JIT/ |
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 free block [all...] |
/external/chromium/chrome/common/extensions/docs/examples/extensions/app_launcher/ |
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/ |
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/content/browser/indexed_db/leveldb/ |
leveldb_transaction.cc | 415 LevelDBIterator* largest = 0; local 418 largest = tree_iterator_.get(); 421 if (!largest || 422 comparator_->Compare(db_iterator_->Key(), largest->Key()) > 0) 423 largest = db_iterator_.get(); 426 current_ = largest;
|
/external/chromium_org/v8/test/mjsunit/regress/ |
regress-326.js | 36 assertEquals(42, nonArray[1], "sort largest last"); 38 assertEquals(undefined, nonArray[2], "sort undefined after largest");
|
/external/v8/test/mjsunit/regress/ |
regress-326.js | 36 assertEquals(42, nonArray[1], "sort largest last"); 38 assertEquals(undefined, nonArray[2], "sort undefined after largest");
|
/external/chromium/base/ |
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;
|