/external/chromium_org/third_party/skia/src/lazy/ |
H A D | SkLruImageCache.cpp | 57 SkLruImageCache::SkLruImageCache(size_t budget) argument 58 : fRamBudget(budget)
|
/external/skia/src/lazy/ |
H A D | SkLruImageCache.cpp | 57 SkLruImageCache::SkLruImageCache(size_t budget) argument 58 : fRamBudget(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); 225 if (budget-tell >= 15) 232 else if(budget-tell >= 2) 237 else if(budget-tell >= 1) 260 const opus_val16 *eBands, opus_val16 *oldEBands, opus_uint32 budget, 276 intra_bias = (opus_int32)((budget**delayedIntra*loss_rate)/(C*512)); 280 if (tell+3 > budget) 303 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) argument 259 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) argument 429 opus_int32 budget; local [all...] |
H A D | celt.c | 716 opus_uint32 budget; local 718 budget = enc->storage*8; 722 tf_select_rsv = LM>0 && tell+logp+1 <= budget; 723 budget -= tf_select_rsv; 727 if (tell+logp<=budget) 756 opus_uint32 budget; local 759 budget = dec->storage*8; 762 tf_select_rsv = LM>0 && tell+logp+1<=budget; 763 budget -= tf_select_rsv; 767 if (tell+logp<=budget) [all...] |
/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 | 584 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start) = 0; 614 // EatsAtLeast, GetQuickCheckDetails. The budget argument is used to limit 618 int budget, 724 int budget, 727 on_success_->FillInBMInfo(offset, budget - 1, bm, not_at_start); 770 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start); 779 int budget, 837 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start); 848 int budget, 902 virtual int EatsAtLeast(int still_to_find, int budget, boo 723 FillInBMInfo(int offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument 974 FillInBMInfo(int offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument 1120 FillInBMInfo(int offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument [all...] |
H A D | jsregexp.cc | 2302 int budget, 2304 if (budget <= 0) return 0; 2307 budget - 1, 2313 int budget, 2319 on_success()->FillInBMInfo(offset, budget - 1, bm, not_at_start); 2326 int budget, 2328 if (budget <= 0) return 0; 2336 budget - 1, 2342 int budget, 2347 on_success()->FillInBMInfo(offset, budget 2301 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument 2312 FillInBMInfo(int offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument 2325 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument 2341 FillInBMInfo(int offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument 2352 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument 2362 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument 2375 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument 2398 EatsAtLeastHelper(int still_to_find, int budget, RegExpNode* ignore_this_node, bool not_at_start) argument 2418 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument 2428 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument 2968 FillInBMInfo(int offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument 5793 FillInBMInfo(int offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument 5808 FillInBMInfo(int offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument 5827 FillInBMInfo(int initial_offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument [all...] |
/external/v8/src/ |
H A D | jsregexp.cc | 3035 // they are flushed. Take the budget of the parent trace and distribute 4963 // If we can't find an exact solution within the budget, we 4975 int RegExpNode::ComputeFirstCharacterSet(int budget) { argument 4981 int LoopChoiceNode::ComputeFirstCharacterSet(int budget) { argument 4982 budget--; 4983 if (budget >= 0) { 5000 budget = loop_node()->ComputeFirstCharacterSet(budget); 5001 if (budget >= 0) { 5005 budget 5026 ComputeFirstCharacterSet(int budget) argument 5044 ComputeFirstCharacterSet(int budget) argument 5071 ComputeFirstCharacterSet(int budget) argument 5085 ComputeFirstCharacterSet(int budget) argument 5096 ComputeFirstCharacterSet(int budget) argument [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/memcheck/tests/ |
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...] |
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...] |
/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...] |