/external/skia/src/pathops/ |
D | SkPathOpsLine.cpp | 84 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearPoint() local 85 largest = SkTMax(largest, -tiniest); in nearPoint() 86 if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance? in nearPoint() 90 *unequal = (float) largest != (float) (largest + dist); in nearPoint() 108 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearRay() local 109 largest = SkTMax(largest, -tiniest); in nearRay() 110 return RoughlyEqualUlps(largest, largest + dist); // is the dist within ULPS tolerance? in nearRay() 153 double largest = SkTMax(SkTMax(y, left), right); in NearPointH() local 154 largest = SkTMax(largest, -tiniest); in NearPointH() 155 if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance? in NearPointH() [all …]
|
D | SkPathOpsPoint.h | 123 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); in approximatelyEqual() local 124 largest = SkTMax(largest, -tiniest); in approximatelyEqual() 125 return AlmostBequalUlps(largest, largest + dist); // is the dist within ULPS tolerance? in approximatelyEqual() 146 float largest = SkTMax(SkTMax(SkTMax(a.fX, b.fX), a.fY), b.fY); in ApproximatelyEqual() local 147 largest = SkTMax(largest, -tiniest); in ApproximatelyEqual() 148 return AlmostBequalUlps((double) largest, largest + dist); // is dist within ULPS tolerance? in ApproximatelyEqual() 167 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); in approximatelyPEqual() local 168 largest = SkTMax(largest, -tiniest); in approximatelyPEqual() 169 return AlmostPequalUlps(largest, largest + dist); // is the dist within ULPS tolerance? in approximatelyPEqual() 181 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); in approximatelyDEqual() local [all …]
|
/external/chromium_org/third_party/skia/src/pathops/ |
D | SkPathOpsLine.cpp | 84 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearPoint() local 85 largest = SkTMax(largest, -tiniest); in nearPoint() 86 if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance? in nearPoint() 90 *unequal = (float) largest != (float) (largest + dist); in nearPoint() 108 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearRay() local 109 largest = SkTMax(largest, -tiniest); in nearRay() 110 return RoughlyEqualUlps(largest, largest + dist); // is the dist within ULPS tolerance? in nearRay() 153 double largest = SkTMax(SkTMax(y, left), right); in NearPointH() local 154 largest = SkTMax(largest, -tiniest); in NearPointH() 155 if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance? in NearPointH() [all …]
|
D | SkPathOpsPoint.h | 123 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); in approximatelyEqual() local 124 largest = SkTMax(largest, -tiniest); in approximatelyEqual() 125 return AlmostBequalUlps(largest, largest + dist); // is the dist within ULPS tolerance? in approximatelyEqual() 146 float largest = SkTMax(SkTMax(SkTMax(a.fX, b.fX), a.fY), b.fY); in ApproximatelyEqual() local 147 largest = SkTMax(largest, -tiniest); in ApproximatelyEqual() 148 return AlmostBequalUlps((double) largest, largest + dist); // is dist within ULPS tolerance? in ApproximatelyEqual() 167 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); in approximatelyPEqual() local 168 largest = SkTMax(largest, -tiniest); in approximatelyPEqual() 169 return AlmostPequalUlps(largest, largest + dist); // is the dist within ULPS tolerance? in approximatelyPEqual() 181 double largest = SkTMax(SkTMax(SkTMax(fX, a.fX), fY), a.fY); in approximatelyDEqual() local [all …]
|
/external/chromium_org/third_party/libvpx/source/libvpx/vpx_mem/memory_manager/ |
D | hmm_largest.c | 19 U(size_bau) largest; in U() 22 largest = 0; in U() 29 largest = in U() 47 if (lf_size > largest) in U() 48 largest = lf_size; in U() 54 return(largest ? in U() 55 ((largest * ((U(size_aau)) HMM_BLOCK_ALIGN_UNIT)) - HEAD_AAUS) : in U()
|
/external/libvpx/libvpx/vpx_mem/memory_manager/ |
D | hmm_largest.c | 19 U(size_bau) largest; in U() 22 largest = 0; in U() 29 largest = in U() 47 if (lf_size > largest) in U() 48 largest = lf_size; in U() 54 return(largest ? in U() 55 ((largest * ((U(size_aau)) HMM_BLOCK_ALIGN_UNIT)) - HEAD_AAUS) : in U()
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
D | heap.h | 152 int largest; in Heapify() local 155 largest = l; in Heapify() 157 largest = i; in Heapify() 159 if (r < size_ && comp_(A_[r], A_[largest]) ) in Heapify() 160 largest = r; in Heapify() 162 if (largest != i) { in Heapify() 163 Swap(i, largest); in Heapify() 164 Heapify(largest); in Heapify()
|
/external/openfst/src/include/fst/ |
D | heap.h | 165 int largest; in Heapify() local 168 largest = l; in Heapify() 170 largest = i; in Heapify() 172 if (r < size_ && Better(A_[r], A_[largest]) ) in Heapify() 173 largest = r; in Heapify() 175 if (largest != i) { in Heapify() 176 Swap(i, largest); in Heapify() 177 Heapify(largest); in Heapify()
|
/external/chromium_org/third_party/leveldatabase/src/table/ |
D | merger.cc | 171 IteratorWrapper* largest = NULL; in FindLargest() local 175 if (largest == NULL) { in FindLargest() 176 largest = child; in FindLargest() 177 } else if (comparator_->Compare(child->key(), largest->key()) > 0) { in FindLargest() 178 largest = child; in FindLargest() 182 current_ = largest; in FindLargest()
|
/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 31 f->largest = InternalKey(largest, largest_seq, kTypeValue); in Add() 41 bool Overlaps(const char* smallest, const char* largest) { in Overlaps() argument 44 Slice l(largest != NULL ? largest : ""); in Overlaps() 47 (largest != NULL ? &l : NULL)); in Overlaps()
|
D | version_set.cc | 85 if (icmp.InternalKeyComparator::Compare(f->largest.Encode(), key) < 0) { in FindFile() 102 ucmp->Compare(*user_key, f->largest.user_key()) > 0); in AfterFile() 186 return (*flist_)[index_]->largest.Encode(); in key() 290 ucmp->Compare(user_key, f->largest.user_key()) <= 0) { in ForEachOverlapping() 355 ucmp->Compare(user_key, f->largest.user_key()) <= 0) { in Get() 541 const Slice file_limit = f->largest.user_key(); in GetOverlappingInputs() 584 r.append(files[i]->largest.DebugString()); in DebugString() 736 const InternalKey& prev_end = v->files_[level][i-1]->largest; in SaveTo() 757 assert(vset_->icmp_.Compare((*files)[files->size()-1]->largest, in MaybeAddFile() 1075 edit.AddFile(level, f->number, f->file_size, f->smallest, f->largest); in WriteSnapshot() [all …]
|
D | version_edit.h | 23 InternalKey largest; // Largest internal key served by table member 65 const InternalKey& largest) { in AddFile() argument 70 f.largest = largest; in AddFile()
|
D | version_edit.cc | 84 PutLengthPrefixedSlice(dst, f.largest.Encode()); in EncodeTo() 188 GetInternalKey(&input, &f.largest)) { in DecodeFrom() 260 r.append(f.largest.DebugString()); in DebugString()
|
/external/llvm/test/Linker/ |
D | comdat.ll | 5 $foo = comdat largest 12 $qux = comdat largest 22 ; CHECK: $qux = comdat largest 23 ; CHECK: $foo = comdat largest
|
/external/chromium_org/third_party/speex/libspeex/ |
D | stereo.c | 151 spx_word32_t largest, smallest; in speex_encode_stereo_int() local 177 largest = e_left; in speex_encode_stereo_int() 181 largest = e_right; in speex_encode_stereo_int() 187 shift = spx_ilog2(largest)-15; in speex_encode_stereo_int() 188 largest = VSHR32(largest, shift-4); 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/speex/libspeex/ |
D | stereo.c | 151 spx_word32_t largest, smallest; in speex_encode_stereo_int() local 177 largest = e_left; in speex_encode_stereo_int() 181 largest = e_right; in speex_encode_stereo_int() 187 shift = spx_ilog2(largest)-15; in speex_encode_stereo_int() 188 largest = VSHR32(largest, shift-4); 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/llvm/lib/ExecutionEngine/JIT/ |
D | JITMemoryManager.cpp | 361 uintptr_t largest = candidateBlock->BlockSize; in startFunctionBody() local 365 if (iter->BlockSize > largest) { in startFunctionBody() 366 largest = iter->BlockSize; in startFunctionBody() 372 largest = largest - sizeof(MemoryRangeHeader); in startFunctionBody() 376 if (largest < ActualSize || in startFunctionBody() 377 largest <= FreeRangeHeader::getMinBlockSize()) { in startFunctionBody() 485 uintptr_t largest = candidateBlock->BlockSize; in allocateCodeSection() local 489 if (iter->BlockSize > largest) { in allocateCodeSection() 490 largest = iter->BlockSize; in allocateCodeSection() 496 largest = largest - sizeof(MemoryRangeHeader); in allocateCodeSection() [all …]
|
/external/chromium_org/cc/quads/ |
D | draw_quad_unittest.cc | 926 size_t largest = 0; in TEST() local 931 largest = std::max(largest, sizeof(CheckerboardDrawQuad)); in TEST() 934 largest = std::max(largest, sizeof(DebugBorderDrawQuad)); in TEST() 937 largest = std::max(largest, sizeof(IOSurfaceDrawQuad)); in TEST() 940 largest = std::max(largest, sizeof(PictureDrawQuad)); in TEST() 943 largest = std::max(largest, sizeof(TextureDrawQuad)); in TEST() 946 largest = std::max(largest, sizeof(RenderPassDrawQuad)); in TEST() 949 largest = std::max(largest, sizeof(SolidColorDrawQuad)); in TEST() 952 largest = std::max(largest, sizeof(SurfaceDrawQuad)); in TEST() 955 largest = std::max(largest, sizeof(TileDrawQuad)); in TEST() [all …]
|
/external/llvm/test/CodeGen/X86/ |
D | coff-comdat.ll | 15 $f3 = comdat largest 53 $vftable = comdat largest 62 ; CHECK: .section .text,"xr",largest,_f3 90 ; CHECK: .section .rdata,"rd",largest,_vftable
|
/external/chromium_org/chrome/common/extensions/docs/examples/extensions/app_launcher/ |
D | popup.js | 14 var largest = {size:0}; variable 17 if (icon.size > largest.size) { 18 largest = icon; 21 return largest.url;
|
/external/llvm/test/Linker/Inputs/ |
D | comdat.ll | 4 $foo = comdat largest 11 $qux = comdat largest
|
D | comdat2.ll | 1 $foo = comdat largest
|
/external/skia/tests/ |
D | PathOpsCubicLineIntersectionIdeas.cpp | 182 double largest = SkTMax(fabs(allRoots[0]), fabs(allRoots[1])); in DEF_TEST() local 184 largest = SkTMax(largest, fabs(allRoots[2])); in DEF_TEST() 187 if (largest <= 1) { in DEF_TEST() 201 frexp(largest, &largeBits); in DEF_TEST()
|
/external/chromium_org/third_party/skia/tests/ |
D | PathOpsCubicLineIntersectionIdeas.cpp | 182 double largest = SkTMax(fabs(allRoots[0]), fabs(allRoots[1])); in DEF_TEST() local 184 largest = SkTMax(largest, fabs(allRoots[2])); in DEF_TEST() 187 if (largest <= 1) { in DEF_TEST() 201 frexp(largest, &largeBits); in DEF_TEST()
|
/external/chromium_org/content/browser/indexed_db/leveldb/ |
D | leveldb_transaction.cc | 422 LevelDBIterator* largest = 0; in SetCurrentIteratorToLargestKey() local 425 largest = data_iterator_.get(); in SetCurrentIteratorToLargestKey() 428 if (!largest || in SetCurrentIteratorToLargestKey() 429 comparator_->Compare(db_iterator_->Key(), largest->Key()) > 0) in SetCurrentIteratorToLargestKey() 430 largest = db_iterator_.get(); in SetCurrentIteratorToLargestKey() 433 current_ = largest; in SetCurrentIteratorToLargestKey()
|