/external/skia/src/lazy/ |
D | SkDiscardableMemoryPool.cpp | 31 DiscardableMemoryPool(size_t budget, SkBaseMutex* mutex = NULL); 37 virtual void setRAMBudget(size_t budget) SK_OVERRIDE; 60 void dumpDownTo(size_t budget); 130 DiscardableMemoryPool::DiscardableMemoryPool(size_t budget, in DiscardableMemoryPool() argument 133 , fBudget(budget) in DiscardableMemoryPool() 147 void DiscardableMemoryPool::dumpDownTo(size_t budget) { in dumpDownTo() argument 151 if (fUsed <= budget) { in dumpDownTo() 157 while ((fUsed > budget) && (NULL != cur)) { in dumpDownTo() 239 void DiscardableMemoryPool::setRAMBudget(size_t budget) { in setRAMBudget() argument 241 fBudget = budget; in setRAMBudget()
|
D | SkDiscardableMemoryPool.h | 32 virtual void setRAMBudget(size_t budget) = 0;
|
/external/chromium_org/third_party/skia/src/lazy/ |
D | SkDiscardableMemoryPool.cpp | 32 DiscardableMemoryPool(size_t budget, SkBaseMutex* mutex = NULL); 38 virtual void setRAMBudget(size_t budget) SK_OVERRIDE; 61 void dumpDownTo(size_t budget); 131 DiscardableMemoryPool::DiscardableMemoryPool(size_t budget, in DiscardableMemoryPool() argument 134 , fBudget(budget) in DiscardableMemoryPool() 148 void DiscardableMemoryPool::dumpDownTo(size_t budget) { in dumpDownTo() argument 152 if (fUsed <= budget) { in dumpDownTo() 158 while ((fUsed > budget) && (cur)) { in dumpDownTo() 240 void DiscardableMemoryPool::setRAMBudget(size_t budget) { in setRAMBudget() argument 242 fBudget = budget; in setRAMBudget()
|
D | SkDiscardableMemoryPool.h | 32 virtual void setRAMBudget(size_t budget) = 0;
|
/external/chromium_org/third_party/opus/src/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 | 292 opus_uint32 budget; in tf_decode() local 295 budget = dec->storage*8; in tf_decode() 298 tf_select_rsv = LM>0 && tell+logp+1<=budget; in tf_decode() 299 budget -= tf_select_rsv; in tf_decode() 303 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/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 | 292 opus_uint32 budget; in tf_decode() local 295 budget = dec->storage*8; in tf_decode() 298 tf_select_rsv = LM>0 && tell+logp+1<=budget; in tf_decode() 299 budget -= tf_select_rsv; in tf_decode() 303 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/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/ |
D | print_layout_test_times.py | 100 budget = 0 102 budget += per_key 106 while tests_by_time and total_so_far <= budget: 110 if test_time and total_so_far + test_time <= budget:
|
/external/chromium_org/v8/src/ |
D | jsregexp.h | 588 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start) = 0; 623 int budget, in FillInBMInfo() argument 731 int budget, in FillInBMInfo() argument 734 on_success_->FillInBMInfo(offset, budget - 1, bm, not_at_start); in FillInBMInfo() 777 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start); 786 int budget, 844 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start); 855 int budget, 909 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start); 915 int budget, [all …]
|
D | jsregexp.cc | 2274 int budget, in EatsAtLeast() argument 2276 if (budget <= 0) return 0; in EatsAtLeast() 2279 budget - 1, in EatsAtLeast() 2285 int budget, in FillInBMInfo() argument 2291 on_success()->FillInBMInfo(offset, budget - 1, bm, not_at_start); in FillInBMInfo() 2298 int budget, in EatsAtLeast() argument 2300 if (budget <= 0) return 0; in EatsAtLeast() 2308 budget - 1, in EatsAtLeast() 2314 int budget, in FillInBMInfo() argument 2319 on_success()->FillInBMInfo(offset, budget - 1, bm, not_at_start); in FillInBMInfo() [all …]
|
/external/valgrind/main/VEX/switchback/ |
D | test_bzip2.c | 2374 Int32* budget ) in mainGtU() argument 2486 (*budget)--; in mainGtU() 2514 Int32* budget ) in mainSimpleSort() argument 2537 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 2551 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 2565 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort() 2574 if (*budget < 0) return; in mainSimpleSort() 2650 Int32* budget ) in mainQSort3() argument 2673 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget ); in mainQSort3() 2674 if (*budget < 0) return; in mainQSort3() [all …]
|
/external/valgrind/main/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/valgrind/main/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/main/perf/ |
D | 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 …]
|
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/chromium_org/third_party/re2/patches/ |
D | re2-msvc9-chrome.patch | 105 // For now, make the default budget something close to Code Search.
|
/external/chromium_org/third_party/icu/source/samples/ufortune/resources/ |
D | root.txt | 122 "A budget is just a method of worrying before you spend money, as well
|
/external/icu/icu4c/source/samples/ufortune/resources/ |
D | root.txt | 122 "A budget is just a method of worrying before you spend money, as well
|