| /external/webkit/Source/JavaScriptCore/tests/mozilla/js1_5/Regress/ |
| H A D | regress-90445.js | 42 var budget = document.formtest.budget.value;
240 ((budget == 0) || (budget == V[i][7] ))) {
|
| /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/v8/src/ |
| H A D | jsregexp.cc | 3017 // they are flushed. Take the budget of the parent trace and distribute
5003 // If we can't find an exact solution within the budget, we
5015 int RegExpNode::ComputeFirstCharacterSet(int budget) { argument
5021 int LoopChoiceNode::ComputeFirstCharacterSet(int budget) { argument
5022 budget--;
5023 if (budget >= 0) {
5040 budget = loop_node()->ComputeFirstCharacterSet(budget);
5041 if (budget >= 0) {
5045 budget
5066 ComputeFirstCharacterSet(int budget) argument
5084 ComputeFirstCharacterSet(int budget) argument
5111 ComputeFirstCharacterSet(int budget) argument
5125 ComputeFirstCharacterSet(int budget) argument
5136 ComputeFirstCharacterSet(int budget) argument
[all...] |
| H A D | jsregexp.h | 659 // Compute (if possible within the budget of traversed nodes) the
661 // its continuation. Returns the remaining budget after the computation.
662 // If the budget is spent, the result is negative, and the cached
664 virtual int ComputeFirstCharacterSet(int budget);
795 virtual int ComputeFirstCharacterSet(int budget);
863 virtual int ComputeFirstCharacterSet(int budget);
924 virtual int ComputeFirstCharacterSet(int budget);
957 virtual int ComputeFirstCharacterSet(int budget);
1119 virtual int ComputeFirstCharacterSet(int budget);
1140 virtual int ComputeFirstCharacterSet(int budget);
[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/exp-ptrcheck/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...] |