/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 | 357 opus_uint32 budget; in tf_decode() local 360 budget = dec->storage*8; in tf_decode() 363 tf_select_rsv = LM>0 && tell+logp+1<=budget; in tf_decode() 364 budget -= tf_select_rsv; in tf_decode() 368 if (tell+logp<=budget) in tf_decode()
|
D | celt_encoder.c | 719 opus_uint32 budget; in tf_encode() local 721 budget = enc->storage*8; in tf_encode() 725 tf_select_rsv = LM>0 && tell+logp+1 <= budget; in tf_encode() 726 budget -= tf_select_rsv; in tf_encode() 730 if (tell+logp<=budget) in tf_encode()
|
/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 | 450 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start) = 0; 485 virtual void FillInBMInfo(Isolate* isolate, int offset, int budget, in FillInBMInfo() argument 568 virtual void FillInBMInfo(Isolate* isolate, int offset, int budget, in FillInBMInfo() argument 570 on_success_->FillInBMInfo(isolate, offset, budget - 1, bm, not_at_start); in FillInBMInfo() 613 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start); 621 virtual void FillInBMInfo(Isolate* isolate, int offset, int budget, 689 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start); 700 virtual void FillInBMInfo(Isolate* isolate, int offset, int budget, 754 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start); 759 virtual void FillInBMInfo(Isolate* isolate, int offset, int budget, [all …]
|
D | jsregexp.cc | 2286 int budget, in EatsAtLeast() argument 2288 if (budget <= 0) return 0; in EatsAtLeast() 2291 budget - 1, in EatsAtLeast() 2296 void ActionNode::FillInBMInfo(Isolate* isolate, int offset, int budget, in FillInBMInfo() argument 2301 on_success()->FillInBMInfo(isolate, offset, budget - 1, bm, not_at_start); in FillInBMInfo() 2308 int budget, in EatsAtLeast() argument 2310 if (budget <= 0) return 0; in EatsAtLeast() 2318 budget - 1, in EatsAtLeast() 2323 void AssertionNode::FillInBMInfo(Isolate* isolate, int offset, int budget, in FillInBMInfo() argument 2327 on_success()->FillInBMInfo(isolate, offset, budget - 1, bm, not_at_start); in FillInBMInfo() [all …]
|
/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/skia/src/gpu/text/ |
D | GrTextBlobCache.h | 94 void setBudget(size_t budget) { in setBudget() argument 95 fBudget = budget; in setBudget()
|
/external/valgrind/memcheck/tests/ |
D | varinfo6.c | 2426 Int32* budget ) in mainGtU() argument 2538 (*budget)--; in mainGtU() 2566 Int32* budget ) in mainSimpleSort() argument 2589 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 2603 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 2617 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 2626 if (*budget < 0) return; in mainSimpleSort() 2701 Int32* budget ) in mainQSort3() argument 2724 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget ); in mainQSort3() 2725 if (*budget < 0) return; in mainQSort3() [all …]
|
D | origin5-bz2.c | 2389 Int32* budget ) in mainGtU() argument 2501 (*budget)--; in mainGtU() 2529 Int32* budget ) in mainSimpleSort() argument 2552 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 2566 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 2580 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 2589 if (*budget < 0) return; in mainSimpleSort() 2665 Int32* budget ) in mainQSort3() argument 2688 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget ); in mainQSort3() 2689 if (*budget < 0) return; in mainQSort3() [all …]
|
/external/swiftshader/src/OpenGL/compiler/ |
D | OutputASM.h | 282 bool trivial(TIntermTyped *expression, int budget); // Fast to compute and no side effects 283 int cost(TIntermNode *expression, int budget);
|
D | OutputASM.cpp | 2648 bool OutputASM::trivial(TIntermTyped *expression, int budget) in trivial() argument 2655 return cost(expression, budget) >= 0; in trivial() 2659 int OutputASM::cost(TIntermNode *expression, int budget) in cost() argument 2661 if(budget < 0) in cost() 2663 return budget; in cost() 2668 return budget; in cost() 2672 return budget; in cost() 2684 return cost(binary->getLeft(), budget - 0); in cost() 2688 return cost(binary->getLeft(), cost(binary->getRight(), budget - 1)); in cost() 2701 return cost(unary->getOperand(), budget - 1); in cost() [all …]
|
/external/valgrind/perf/ |
D | bz2.c | 2387 Int32* budget ) in mainGtU() argument 2499 (*budget)--; in mainGtU() 2527 Int32* budget ) in mainSimpleSort() argument 2550 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 2564 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 2578 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 2587 if (*budget < 0) return; in mainSimpleSort() 2663 Int32* budget ) in mainQSort3() argument 2686 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget ); in mainQSort3() 2687 if (*budget < 0) return; in mainQSort3() [all …]
|
D | test_input_for_tinycc.c | 2179 Int32* budget ) in mainGtU() argument 2291 (*budget)--; in mainGtU() 2311 Int32* budget ) in mainSimpleSort() argument 2334 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 2348 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 2362 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 2371 if (*budget < 0) return; in mainSimpleSort() 2397 Int32* budget ) in mainQSort3() argument 2420 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget ); in mainQSort3() 2421 if (*budget < 0) return; in mainQSort3() [all …]
|
/external/valgrind/exp-sgcheck/tests/ |
D | hackedbz2.c | 2398 Int32* budget ) in mainGtU() argument 2510 (*budget)--; in mainGtU() 2538 Int32* budget ) in mainSimpleSort() argument 2561 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 2575 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 2589 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 2598 if (*budget < 0) return; in mainSimpleSort() 2674 Int32* budget ) in mainQSort3() argument 2697 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget ); in mainQSort3() 2698 if (*budget < 0) return; in mainQSort3() [all …]
|
/external/valgrind/include/vki/ |
D | vki-xen-domctl.h | 305 vki_uint32_t budget; member
|
/external/icu/icu4c/source/samples/ufortune/resources/ |
D | root.txt | 125 "A budget is just a method of worrying before you spend money, as well
|
/external/valgrind/coregrind/m_syswrap/ |
D | syswrap-xen.c | 977 PRE_XEN_DOMCTL_READ(scheduler_op, u.rtds.budget); in PRE() 1930 POST_XEN_DOMCTL_WRITE(scheduler_op, u.rtds.budget); in POST()
|
/external/lisa/ipynb/examples/android/benchmarks/ |
D | Android_Jankbench.ipynb | 10 …"When one fails to meet this budget - 16.6 ms, the frame rate drops, and the content judders on sc…
|
/external/brotli/tests/testdata/ |
D | lcet10.txt | 2004 printed volume. Given the current budget crunch in educational systems 3515 and a budget, selecting the materials to convert, and then raising the 3528 project, which included a budget and costs. The terms were that POB would
|
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/de-DE/ |
D | de-DE_lexpos.utf | 2052 N "budget" "bY-'d_Ze:"
|