/external/skqp/src/lazy/ |
D | SkDiscardableMemoryPool.cpp | 30 DiscardableMemoryPool(size_t budget); 39 void setRAMBudget(size_t budget) override; 62 void dumpDownTo(size_t budget); 126 DiscardableMemoryPool::DiscardableMemoryPool(size_t budget) in DiscardableMemoryPool() argument 127 : fBudget(budget) in DiscardableMemoryPool() 141 void DiscardableMemoryPool::dumpDownTo(size_t budget) { in dumpDownTo() argument 143 if (fUsed <= budget) { in dumpDownTo() 149 while ((fUsed > budget) && (cur)) { in dumpDownTo() 220 void DiscardableMemoryPool::setRAMBudget(size_t budget) { in setRAMBudget() argument 222 fBudget = budget; in setRAMBudget()
|
D | SkDiscardableMemoryPool.h | 33 virtual void setRAMBudget(size_t budget) = 0;
|
/external/skia/src/lazy/ |
D | SkDiscardableMemoryPool.cpp | 30 DiscardableMemoryPool(size_t budget); 39 void setRAMBudget(size_t budget) override; 62 void dumpDownTo(size_t budget); 126 DiscardableMemoryPool::DiscardableMemoryPool(size_t budget) in DiscardableMemoryPool() argument 127 : fBudget(budget) in DiscardableMemoryPool() 141 void DiscardableMemoryPool::dumpDownTo(size_t budget) { in dumpDownTo() argument 143 if (fUsed <= budget) { in dumpDownTo() 149 while ((fUsed > budget) && (cur)) { in dumpDownTo() 220 void DiscardableMemoryPool::setRAMBudget(size_t budget) { in setRAMBudget() argument 222 fBudget = budget; in setRAMBudget()
|
D | SkDiscardableMemoryPool.h | 33 virtual void setRAMBudget(size_t budget) = 0;
|
/external/libdivsufsort/lib/ |
D | trsort.c | 202 trbudget_init(trbudget_t *budget, saidx_t chance, saidx_t incval) { in trbudget_init() argument 203 budget->chance = chance; in trbudget_init() 204 budget->remain = budget->incval = incval; in trbudget_init() 209 trbudget_check(trbudget_t *budget, saidx_t size) { in trbudget_check() argument 210 if(size <= budget->remain) { budget->remain -= size; return 1; } in trbudget_check() 211 if(budget->chance == 0) { budget->count += size; return 0; } in trbudget_check() 212 budget->remain += budget->incval - size; in trbudget_check() 213 budget->chance -= 1; in trbudget_check() 329 trbudget_t *budget) { in tr_introsort() argument 402 if(trbudget_check(budget, a - first)) { in tr_introsort() [all …]
|
/external/libopus/celt/ |
D | quant_bands.c | 158 opus_int32 budget, opus_int32 tell, in quant_coarse_energy_impl() argument 168 if (tell+3 <= budget) in quant_coarse_energy_impl() 217 bits_left = budget-tell-3*C*(end-i); in quant_coarse_energy_impl() 227 if (budget-tell >= 15) in quant_coarse_energy_impl() 234 else if(budget-tell >= 2) in quant_coarse_energy_impl() 239 else if(budget-tell >= 1) in quant_coarse_energy_impl() 262 const opus_val16 *eBands, opus_val16 *oldEBands, opus_uint32 budget, in quant_coarse_energy() argument 278 intra_bias = (opus_int32)((budget**delayedIntra*loss_rate)/(C*512)); in quant_coarse_energy() 282 if (tell+3 > budget) in quant_coarse_energy() 304 badness1 = quant_coarse_energy_impl(m, start, end, eBands, oldEBands_intra, budget, in quant_coarse_energy() [all …]
|
D | quant_bands.h | 51 const opus_val16 *eBands, opus_val16 *oldEBands, opus_uint32 budget,
|
D | celt_decoder.c | 447 opus_uint32 budget; in tf_decode() local 450 budget = dec->storage*8; in tf_decode() 453 tf_select_rsv = LM>0 && tell+logp+1<=budget; in tf_decode() 454 budget -= tf_select_rsv; in tf_decode() 458 if (tell+logp<=budget) in tf_decode()
|
D | celt_encoder.c | 751 opus_uint32 budget; in tf_encode() local 753 budget = enc->storage*8; in tf_encode() 757 tf_select_rsv = LM>0 && tell+logp+1 <= budget; in tf_encode() 758 budget -= tf_select_rsv; in tf_encode() 762 if (tell+logp<=budget) in tf_encode()
|
/external/u-boot/lib/bzip2/ |
D | bzlib_blocksort.c | 392 Int32* budget ) in mainGtU() argument 504 (*budget)--; in mainGtU() 532 Int32* budget ) in mainSimpleSort() argument 555 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 569 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 583 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 592 if (*budget < 0) return; in mainSimpleSort() 668 Int32* budget ) in mainQSort3() argument 691 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget ); in mainQSort3() 692 if (*budget < 0) return; in mainQSort3() [all …]
|
/external/bzip2/ |
D | blocksort.c | 352 Int32* budget ) in mainGtU() argument 464 (*budget)--; in mainGtU() 492 Int32* budget ) in mainSimpleSort() argument 515 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 529 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 543 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 552 if (*budget < 0) return; in mainSimpleSort() 628 Int32* budget ) in mainQSort3() argument 651 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget ); in mainQSort3() 652 if (*budget < 0) return; in mainQSort3() [all …]
|
/external/v8/src/regexp/ |
D | jsregexp.h | 480 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start) = 0; 515 virtual void FillInBMInfo(Isolate* isolate, int offset, int budget, in FillInBMInfo() argument 596 virtual void FillInBMInfo(Isolate* isolate, int offset, int budget, in FillInBMInfo() argument 598 on_success_->FillInBMInfo(isolate, offset, budget - 1, bm, not_at_start); in FillInBMInfo() 641 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start); 649 virtual void FillInBMInfo(Isolate* isolate, int offset, int budget, 719 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start); 730 virtual void FillInBMInfo(Isolate* isolate, int offset, int budget, 784 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start); 789 virtual void FillInBMInfo(Isolate* isolate, int offset, int budget, [all …]
|
D | jsregexp.cc | 2225 int budget, in EatsAtLeast() argument 2227 if (budget <= 0) return 0; in EatsAtLeast() 2230 budget - 1, in EatsAtLeast() 2235 void ActionNode::FillInBMInfo(Isolate* isolate, int offset, int budget, in FillInBMInfo() argument 2238 on_success()->FillInBMInfo(isolate, offset, budget - 1, bm, not_at_start); in FillInBMInfo() 2245 int budget, in EatsAtLeast() argument 2247 if (budget <= 0) return 0; in EatsAtLeast() 2255 budget - 1, in EatsAtLeast() 2260 void AssertionNode::FillInBMInfo(Isolate* isolate, int offset, int budget, in FillInBMInfo() argument 2264 on_success()->FillInBMInfo(isolate, offset, budget - 1, bm, not_at_start); in FillInBMInfo() [all …]
|
/external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/SLPVectorizer/X86/ |
D | schedule_budget.ll | 1 ; RUN: opt < %s -basicaa -slp-vectorizer -S -slp-schedule-budget=16 -mtriple=x86_64-apple-macosx10… 6 ; Test if the budget for the scheduling region size works. 7 ; We test with a reduced budget of 16 which should prevent vectorizing the loads. 73 ; But still vectorize the following instructions, because even if the budget
|
D | extract-shuffle.ll | 2 …vectorizer -S -o - -mtriple=x86-64-unknown-linux -mcpu=bdver2 -slp-schedule-budget=1 | FileCheck %s
|
/external/llvm/test/Transforms/SLPVectorizer/X86/ |
D | schedule_budget.ll | 1 ; RUN: opt < %s -basicaa -slp-vectorizer -S -slp-schedule-budget=16 -mtriple=x86_64-apple-macosx10… 6 ; Test if the budget for the scheduling region size works. 7 ; We test with a reduced budget of 16 which should prevent vectorizing the loads. 73 ; But still vectorize the following instructions, because even if the budget
|
/external/linux-kselftest/tools/testing/selftests/net/ |
D | udpgso_bench_rx.c | 171 int ret, len, budget = 256; in do_flush_udp() local 174 while (budget--) { in do_flush_udp()
|
/external/skqp/src/gpu/text/ |
D | GrTextBlobCache.h | 89 void setBudget(size_t budget) { in setBudget() argument 90 fSizeBudget = budget; in setBudget()
|
/external/skia/src/gpu/text/ |
D | GrTextBlobCache.h | 93 void setBudget(size_t budget) { in setBudget() argument 94 fSizeBudget = budget; in setBudget()
|
/external/u-boot/fs/ubifs/ |
D | Makefile | 12 obj-y += tnc.o tnc_misc.o debug.o crc16.o budget.o
|
/external/archive-patcher/generator/src/main/java/com/google/archivepatcher/generator/bsdiff/ |
D | DivSuffixSorter.java | 1310 TRBudget budget = new TRBudget(trIlg(n) * 2 / 3, n); in trSort() local 1332 budget.count = 0; in trSort() 1333 trIntroSort(ISA, ISAd, first, last, budget); in trSort() 1334 if (budget.count != 0) { in trSort() 1335 unsorted += budget.count; in trSort() 1415 private final void trIntroSort(int ISA, int ISAd, int first, int last, TRBudget budget) in trIntroSort() argument 1539 if (budget.check(a - first) != 0) { in trIntroSort() 1634 if ((1 < (b - a)) && ((budget.check(b - a) != 0))) { in trIntroSort() 1749 if (budget.check(last - first) != 0) { in trIntroSort()
|
/external/swiftshader/src/OpenGL/compiler/ |
D | OutputASM.h | 290 bool trivial(TIntermTyped *expression, int budget); // Fast to compute and no side effects 291 int cost(TIntermNode *expression, int budget);
|
D | OutputASM.cpp | 2966 bool OutputASM::trivial(TIntermTyped *expression, int budget) in trivial() argument 2973 return cost(expression, budget) >= 0; in trivial() 2977 int OutputASM::cost(TIntermNode *expression, int budget) in cost() argument 2979 if(budget < 0) in cost() 2981 return budget; in cost() 2986 return budget; in cost() 2990 return budget; in cost() 3002 return cost(binary->getLeft(), budget - 0); in cost() 3006 return cost(binary->getLeft(), cost(binary->getRight(), budget - 1)); in cost() 3019 return cost(unary->getOperand(), budget - 1); in cost() [all …]
|
/external/javaparser/ |
D | CONTRIBUTING.md | 5 …. Please remember that we try to run a professional project in our spare time, on a budget of zero.
|
/external/v8/infra/testing/ |
D | builders.pyl | 1475 'suffix': 'interrupt-budget', 1478 '--stress-interrupt-budget=10', 1493 'suffix': 'interrupt-budget', 1496 '--stress-interrupt-budget=10',
|