Searched refs:budget (Results 1 - 19 of 19) sorted by relevance

/external/skia/src/lazy/
H A DSkDiscardableMemoryPool.cpp32 DiscardableMemoryPool(size_t budget, SkBaseMutex* mutex = nullptr);
38 void setRAMBudget(size_t budget) 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)) {
232 void DiscardableMemoryPool::setRAMBudget(size_t budget) { argument
234 fBudget = budget;
[all...]
H A DSkDiscardableMemoryPool.h24 * budget of memory. When the allocated memory exceeds this size,
26 * can exceed the memory-use budget.
33 virtual void setRAMBudget(size_t budget) = 0;
/external/libopus/celt/
H A Dquant_bands.c158 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 Dquant_bands.h51 const opus_val16 *eBands, opus_val16 *oldEBands, opus_uint32 budget,
H A Dcelt_decoder.c292 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 Dcelt_encoder.c719 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/libdivsufsort/lib/
H A Dtrsort.c202 trbudget_init(trbudget_t *budget, saidx_t chance, saidx_t incval) { argument
203 budget->chance = chance;
204 budget->remain = budget->incval = incval;
209 trbudget_check(trbudget_t *budget, saidx_t size) { argument
210 if(size <= budget->remain) { budget->remain -= size; return 1; }
211 if(budget->chance == 0) { budget->count += size; return 0; }
212 budget
327 tr_introsort(saidx_t *ISA, const saidx_t *ISAd, saidx_t *SA, saidx_t *first, saidx_t *last, trbudget_t *budget) argument
558 trbudget_t budget; local
[all...]
/external/bzip2/
H A Dblocksort.c352 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/skia/src/gpu/text/
H A DGrTextBlobCache.h18 * The callback function used by the cache when it is still over budget after a purge. The
93 void setBudget(size_t budget) { argument
94 fBudget = budget;
102 // If we are overbudget, then unref until we are below budget again
118 // then this single textblob is over our budget
125 SkDebugf("Single textblob is larger than our whole budget");
/external/v8/src/regexp/
H A Djsregexp.h501 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start) = 0;
532 // EatsAtLeast, GetQuickCheckDetails. The budget argument is used to limit
536 virtual void FillInBMInfo(Isolate* isolate, int offset, int budget,
619 virtual void FillInBMInfo(Isolate* isolate, int offset, int budget, argument
621 on_success_->FillInBMInfo(isolate, offset, budget - 1, bm, not_at_start);
664 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start);
672 virtual void FillInBMInfo(Isolate* isolate, int offset, int budget,
740 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start);
751 virtual void FillInBMInfo(Isolate* isolate, int offset, int budget,
805 virtual int EatsAtLeast(int still_to_find, int budget, boo
874 FillInBMInfo(Isolate* isolate, int offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument
1035 FillInBMInfo(Isolate* isolate, int offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument
[all...]
H A Djsregexp.cc2290 int budget,
2292 if (budget <= 0) return 0;
2295 budget - 1,
2300 void ActionNode::FillInBMInfo(Isolate* isolate, int offset, int budget, argument
2305 on_success()->FillInBMInfo(isolate, offset, budget - 1, bm, not_at_start);
2312 int budget,
2314 if (budget <= 0) return 0;
2322 budget - 1,
2327 void AssertionNode::FillInBMInfo(Isolate* isolate, int offset, int budget, argument
2331 on_success()->FillInBMInfo(isolate, offset, budget
2289 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument
2311 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument
2336 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
2361 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument
2381 EatsAtLeastHelper(int still_to_find, int budget, RegExpNode* ignore_this_node, bool not_at_start) argument
2401 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument
2411 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument
2964 FillInBMInfo(Isolate* isolate, int offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument
6391 FillInBMInfo(Isolate* isolate, int offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument
6405 FillInBMInfo(Isolate* isolate, int offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument
6422 FillInBMInfo(Isolate* isolate, int initial_offset, int budget, BoyerMooreLookahead* bm, bool not_at_start) argument
[all...]
/external/valgrind/memcheck/tests/
H A Dvarinfo6.c2426 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 Dorigin5-bz2.c2389 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/VEX/switchback/
H A Dtest_bzip2.c2372 Int32* budget )
2484 (*budget)--;
2512 Int32* budget )
2535 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2549 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2563 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2572 if (*budget < 0) return;
2648 Int32* budget )
2671 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget );
2672 if (*budget <
3060 Int32 budget; local
[all...]
/external/valgrind/exp-sgcheck/tests/
H A Dhackedbz2.c2398 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/perf/
H A Dbz2.c2387 Int32* budget )
2499 (*budget)--;
2527 Int32* budget )
2550 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2564 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2578 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2587 if (*budget < 0) return;
2663 Int32* budget )
2686 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget );
2687 if (*budget <
3075 Int32 budget; local
[all...]
H A Dtest_input_for_tinycc.c2179 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/valgrind/include/vki/
H A Dvki-xen-domctl.h301 vki_uint32_t budget; member in struct:vki_xen_domctl_scheduler_op::__anon19332::xen_domctl_sched_rtds
/external/valgrind/coregrind/m_syswrap/
H A Dsyswrap-xen.c875 PRE_XEN_DOMCTL_READ(scheduler_op, u.rtds.budget);
1778 POST_XEN_DOMCTL_WRITE(scheduler_op, u.rtds.budget);

Completed in 704 milliseconds