/external/chromium_org/third_party/skia/src/lazy/ |
H A 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, argument 134 , fBudget(budget) 148 void DiscardableMemoryPool::dumpDownTo(size_t budget) { argument 152 if (fUsed <= budget) { 158 while ((fUsed > budget) && (cur)) { 240 void DiscardableMemoryPool::setRAMBudget(size_t budget) { argument 242 fBudget = budget; [all...] |
H A D | SkDiscardableMemoryPool.h | 23 * budget of memory. When the allocated memory exceeds this size, 25 * can exceed the memory-use budget. 32 virtual void setRAMBudget(size_t budget) = 0;
|
/external/skia/src/lazy/ |
H A 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, argument 133 , fBudget(budget) 147 void DiscardableMemoryPool::dumpDownTo(size_t budget) { argument 151 if (fUsed <= budget) { 157 while ((fUsed > budget) && (NULL != cur)) { 239 void DiscardableMemoryPool::setRAMBudget(size_t budget) { argument 241 fBudget = budget; [all...] |
H A D | SkDiscardableMemoryPool.h | 23 * budget of memory. When the allocated memory exceeds this size, 25 * can exceed the memory-use budget. 32 virtual void setRAMBudget(size_t budget) = 0;
|
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/ |
H A 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/third_party/opus/src/celt/ |
H A D | quant_bands.c | 158 opus_int32 budget, opus_int32 tell, 168 if (tell+3 <= budget) 217 bits_left = budget-tell-3*C*(end-i); 227 if (budget-tell >= 15) 234 else if(budget-tell >= 2) 239 else if(budget-tell >= 1) 262 const opus_val16 *eBands, opus_val16 *oldEBands, opus_uint32 budget, 278 intra_bias = (opus_int32)((budget**delayedIntra*loss_rate)/(C*512)); 282 if (tell+3 > budget) 304 badness1 = quant_coarse_energy_impl(m, start, end, eBands, oldEBands_intra, budget, 156 quant_coarse_energy_impl(const CELTMode *m, int start, int end, const opus_val16 *eBands, opus_val16 *oldEBands, opus_int32 budget, opus_int32 tell, const unsigned char *prob_model, opus_val16 *error, ec_enc *enc, int C, int LM, int intra, opus_val16 max_decay, int lfe) argument 261 quant_coarse_energy(const CELTMode *m, int start, int end, int effEnd, const opus_val16 *eBands, opus_val16 *oldEBands, opus_uint32 budget, opus_val16 *error, ec_enc *enc, int C, int LM, int nbAvailableBytes, int force_intra, opus_val32 *delayedIntra, int two_pass, int loss_rate, int lfe) argument 434 opus_int32 budget; local [all...] |
H A D | quant_bands.h | 51 const opus_val16 *eBands, opus_val16 *oldEBands, opus_uint32 budget,
|
H A D | celt_decoder.c | 292 opus_uint32 budget; local 295 budget = dec->storage*8; 298 tf_select_rsv = LM>0 && tell+logp+1<=budget; 299 budget -= tf_select_rsv; 303 if (tell+logp<=budget)
|
H A D | celt_encoder.c | 719 opus_uint32 budget; local 721 budget = enc->storage*8; 725 tf_select_rsv = LM>0 && tell+logp+1 <= budget; 726 budget -= tf_select_rsv; 730 if (tell+logp<=budget) 919 /* Make sure that dynamic allocation can't make us bust the budget */
|
/external/libopus/celt/ |
H A D | quant_bands.c | 158 opus_int32 budget, opus_int32 tell, 168 if (tell+3 <= budget) 217 bits_left = budget-tell-3*C*(end-i); 227 if (budget-tell >= 15) 234 else if(budget-tell >= 2) 239 else if(budget-tell >= 1) 262 const opus_val16 *eBands, opus_val16 *oldEBands, opus_uint32 budget, 278 intra_bias = (opus_int32)((budget**delayedIntra*loss_rate)/(C*512)); 282 if (tell+3 > budget) 304 badness1 = quant_coarse_energy_impl(m, start, end, eBands, oldEBands_intra, budget, 156 quant_coarse_energy_impl(const CELTMode *m, int start, int end, const opus_val16 *eBands, opus_val16 *oldEBands, opus_int32 budget, opus_int32 tell, const unsigned char *prob_model, opus_val16 *error, ec_enc *enc, int C, int LM, int intra, opus_val16 max_decay, int lfe) argument 261 quant_coarse_energy(const CELTMode *m, int start, int end, int effEnd, const opus_val16 *eBands, opus_val16 *oldEBands, opus_uint32 budget, opus_val16 *error, ec_enc *enc, int C, int LM, int nbAvailableBytes, int force_intra, opus_val32 *delayedIntra, int two_pass, int loss_rate, int lfe) argument 434 opus_int32 budget; local [all...] |
H A D | quant_bands.h | 51 const opus_val16 *eBands, opus_val16 *oldEBands, opus_uint32 budget,
|
H A D | celt_decoder.c | 292 opus_uint32 budget; local 295 budget = dec->storage*8; 298 tf_select_rsv = LM>0 && tell+logp+1<=budget; 299 budget -= tf_select_rsv; 303 if (tell+logp<=budget)
|
H A D | celt_encoder.c | 719 opus_uint32 budget; local 721 budget = enc->storage*8; 725 tf_select_rsv = LM>0 && tell+logp+1 <= budget; 726 budget -= tf_select_rsv; 730 if (tell+logp<=budget) 919 /* Make sure that dynamic allocation can't make us bust the budget */
|
/external/bzip2/ |
H A D | blocksort.c | 352 Int32* budget ) 464 (*budget)--; 492 Int32* budget ) 515 ptr[j-h]+d, v+d, block, quadrant, nblock, budget 529 ptr[j-h]+d, v+d, block, quadrant, nblock, budget 543 ptr[j-h]+d, v+d, block, quadrant, nblock, budget 552 if (*budget < 0) return; 628 Int32* budget ) 651 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget ); 652 if (*budget < 1040 Int32 budget; local [all...] |
/external/chromium_org/v8/src/ |
H A D | jsregexp.h | 588 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start) = 0; 619 // EatsAtLeast, GetQuickCheckDetails. The budget argument is used to limit 623 int budget, 731 int budget, 734 on_success_->FillInBMInfo(offset, budget - 1, bm, not_at_start); 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, boo 730 FillInBMInfo(int offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument 981 FillInBMInfo(int offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument 1145 FillInBMInfo(int offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument [all...] |
H A D | jsregexp.cc | 2274 int budget, 2276 if (budget <= 0) return 0; 2279 budget - 1, 2285 int budget, 2291 on_success()->FillInBMInfo(offset, budget - 1, bm, not_at_start); 2298 int budget, 2300 if (budget <= 0) return 0; 2308 budget - 1, 2314 int budget, 2319 on_success()->FillInBMInfo(offset, budget 2273 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument 2284 FillInBMInfo(int offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument 2297 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument 2313 FillInBMInfo(int offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument 2324 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument 2334 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument 2347 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument 2370 EatsAtLeastHelper(int still_to_find, int budget, RegExpNode* ignore_this_node, bool not_at_start) argument 2390 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument 2400 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument 2948 FillInBMInfo(int offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument 5821 FillInBMInfo(int offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument 5836 FillInBMInfo(int offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument 5855 FillInBMInfo(int initial_offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument [all...] |
/external/valgrind/main/memcheck/tests/ |
H A D | varinfo6.c | 2426 Int32* budget ) 2538 (*budget)--; 2566 Int32* budget ) 2589 ptr[j-h]+d, v+d, block, quadrant, nblock, budget 2603 ptr[j-h]+d, v+d, block, quadrant, nblock, budget 2617 ptr[j-h]+d, v+d, block, quadrant, nblock, budget 2626 if (*budget < 0) return; 2701 Int32* budget ) 2724 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget ); 2725 if (*budget < 3115 Int32 budget; local [all...] |
H A D | origin5-bz2.c | 2389 Int32* budget ) 2501 (*budget)--; 2529 Int32* budget ) 2552 ptr[j-h]+d, v+d, block, quadrant, nblock, budget 2566 ptr[j-h]+d, v+d, block, quadrant, nblock, budget 2580 ptr[j-h]+d, v+d, block, quadrant, nblock, budget 2589 if (*budget < 0) return; 2665 Int32* budget ) 2688 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget ); 2689 if (*budget < 3077 Int32 budget; local [all...] |
/external/valgrind/main/VEX/switchback/ |
H A D | test_bzip2.c | 2374 Int32* budget ) 2486 (*budget)--; 2514 Int32* budget ) 2537 ptr[j-h]+d, v+d, block, quadrant, nblock, budget 2551 ptr[j-h]+d, v+d, block, quadrant, nblock, budget 2565 ptr[j-h]+d, v+d, block, quadrant, nblock, budget 2574 if (*budget < 0) return; 2650 Int32* budget ) 2673 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget ); 2674 if (*budget < 3062 Int32 budget; local [all...] |
/external/valgrind/main/exp-sgcheck/tests/ |
H A D | hackedbz2.c | 2398 Int32* budget ) 2510 (*budget)--; 2538 Int32* budget ) 2561 ptr[j-h]+d, v+d, block, quadrant, nblock, budget 2575 ptr[j-h]+d, v+d, block, quadrant, nblock, budget 2589 ptr[j-h]+d, v+d, block, quadrant, nblock, budget 2598 if (*budget < 0) return; 2674 Int32* budget ) 2697 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget ); 2698 if (*budget < 3086 Int32 budget; local [all...] |
/external/valgrind/main/perf/ |
H A D | bz2.c | 2389 Int32* budget ) 2501 (*budget)--; 2529 Int32* budget ) 2552 ptr[j-h]+d, v+d, block, quadrant, nblock, budget 2566 ptr[j-h]+d, v+d, block, quadrant, nblock, budget 2580 ptr[j-h]+d, v+d, block, quadrant, nblock, budget 2589 if (*budget < 0) return; 2665 Int32* budget ) 2688 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget ); 2689 if (*budget < 3077 Int32 budget; local [all...] |
H A D | test_input_for_tinycc.c | 2179 Int32* budget ) 2291 (*budget)--; 2311 Int32* budget ) 2334 ptr[j-h]+d, v+d, block, quadrant, nblock, budget 2348 ptr[j-h]+d, v+d, block, quadrant, nblock, budget 2362 ptr[j-h]+d, v+d, block, quadrant, nblock, budget 2371 if (*budget < 0) return; 2397 Int32* budget ) 2420 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget ); 2421 if (*budget < 2699 Int32 budget; local [all...] |
/external/chromium_org/third_party/WebKit/Source/devtools/scripts/closure/ |
H A D | compiler.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/javascript/ com/google/javascript/jscomp/ ... |
/external/chromium_org/third_party/closure_compiler/compiler/ |
H A D | compiler.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/debugging/ com/google/debugging/sourcemap/ ... |