| /prebuilts/go/darwin-x86/test/bench/garbage/ |
| H A D | tree.go | 85 iterations := 1 << uint(maxDepth-depth+minDepth)
88 for i := 1; i <= iterations; i++ {
92 fmt.Printf("%d\t trees of depth %d\t check: %d\n", iterations*2, depth, check)
|
| /prebuilts/go/linux-x86/test/bench/garbage/ |
| H A D | tree.go | 85 iterations := 1 << uint(maxDepth-depth+minDepth)
88 for i := 1; i <= iterations; i++ {
92 fmt.Printf("%d\t trees of depth %d\t check: %d\n", iterations*2, depth, check)
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
| H A D | time_hashlib.py | 12 iterations = 106201/scale * 20
17 for f in xrange(iterations):
21 print ('%2.2f' % (end-start)), "seconds", iterations, "x", len(longStr), "bytes", name
|
| H A D | test_multiprocessing.py | 1830 iterations = 5000
1835 for i in xrange(iterations):
|
| H A D | test_mailbox.py | 323 def test_clear(self, iterations=10):
326 for i in xrange(iterations):
353 def test_popitem(self, iterations=10):
|
| /prebuilts/gdb/linux-x86/lib/python2.7/test/ |
| H A D | time_hashlib.py | 12 iterations = 106201/scale * 20
17 for f in xrange(iterations):
21 print ('%2.2f' % (end-start)), "seconds", iterations, "x", len(longStr), "bytes", name
|
| H A D | test_multiprocessing.py | 1830 iterations = 5000
1835 for i in xrange(iterations):
|
| H A D | test_mailbox.py | 323 def test_clear(self, iterations=10):
326 for i in xrange(iterations):
353 def test_popitem(self, iterations=10):
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| H A D | time_hashlib.py | 12 iterations = 106201/scale * 20
17 for f in xrange(iterations):
21 print ('%2.2f' % (end-start)), "seconds", iterations, "x", len(longStr), "bytes", name
|
| H A D | test_multiprocessing.py | 1830 iterations = 5000
1835 for i in xrange(iterations):
|
| H A D | test_mailbox.py | 323 def test_clear(self, iterations=10):
326 for i in xrange(iterations):
353 def test_popitem(self, iterations=10):
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| H A D | time_hashlib.py | 12 iterations = 106201/scale * 20
17 for f in xrange(iterations):
21 print ('%2.2f' % (end-start)), "seconds", iterations, "x", len(longStr), "bytes", name
|
| H A D | test_multiprocessing.py | 1830 iterations = 5000
1835 for i in xrange(iterations):
|
| H A D | test_mailbox.py | 323 def test_clear(self, iterations=10):
326 for i in xrange(iterations):
353 def test_popitem(self, iterations=10):
|
| /prebuilts/misc/windows/sdl2/test/ |
| H A D | testsprite2.c | 37 /* Number of iterations to move sprites - used for visual tests. */
39 static int iterations = -1; variable
194 if (iterations == -1 || iterations > 0) {
211 /* Countdown sprite-move iterations and disable color changes at iteration end - used for visual tests. */
212 if (iterations > 0) {
213 iterations--;
214 if (iterations == 0) {
273 } else if (SDL_strcasecmp(argv[i], "--iterations") == 0) {
275 iterations
[all...] |
| /prebuilts/misc/darwin-x86_64/sdl2/include/SDL2/ |
| H A D | SDL_haptic.h | 1034 * If iterations are ::SDL_HAPTIC_INFINITY, it'll run the effect over and over
1041 * \param iterations Number of iterations to run the effect. Use
1051 Uint32 iterations);
|
| /prebuilts/misc/windows/sdl2/i686-w64-mingw32/include/SDL2/ |
| H A D | SDL_haptic.h | 1034 * If iterations are ::SDL_HAPTIC_INFINITY, it'll run the effect over and over
1041 * \param iterations Number of iterations to run the effect. Use
1051 Uint32 iterations);
|
| /prebuilts/misc/windows/sdl2/include/ |
| H A D | SDL_haptic.h | 1034 * If iterations are ::SDL_HAPTIC_INFINITY, it'll run the effect over and over
1041 * \param iterations Number of iterations to run the effect. Use
1051 Uint32 iterations);
|
| /prebuilts/misc/windows/sdl2/x86_64-w64-mingw32/include/SDL2/ |
| H A D | SDL_haptic.h | 1034 * If iterations are ::SDL_HAPTIC_INFINITY, it'll run the effect over and over
1041 * \param iterations Number of iterations to run the effect. Use
1051 Uint32 iterations);
|
| /prebuilts/gcc/darwin-x86/aarch64/aarch64-linux-android-4.9/bin/ |
| H A D | aarch64-linux-android-gcc-4.9.x | 3012 /Volumes/Android/buildbot/src/android/gcc/toolchain/build/../gcc/gcc-4.9/gcc/params.c minimum value of parameter %qs is %u maximum value of parameter %qs is %u invalid parameter %qs init_param_values set_default_param_value set_param_value_internal set_param_value predictable-branch-outcome Maximal estimated outcome of branch considered predictable inline-min-speedup The minimal estimated speedup allowing inliner to ignore inline-insns-single and inline-isnsns-auto max-inline-insns-single The maximum number of instructions in a single function eligible for inlining max-inline-insns-auto The maximum number of instructions when automatically inlining max-growth-auto-inline-func The maximum size growth when inlining functions without inline declared in plain mode max-inline-insns-recursive The maximum number of instructions inline function can grow to via recursive inlining max-inline-insns-recursive-auto The maximum number of instructions non-inline function can grow to via recursive inlining max-inline-recursive-depth The maximum depth of recursive inlining for inline functions max-inline-recursive-depth-auto The maximum depth of recursive inlining for non-inline functions min-inline-recursive-probability Inline recursively only when the probability of call being executed exceeds the parameter inline-function-overhead-size Size estimate of function overhead (prologue/epilogue) for inlining purposes inline-hot-caller Consider cold callsites for inlining if caller contains hot code hot-caller-codesize-threshold Maximum profile-based code size footprint estimate for hot caller heuristic inline-useful-cold-callee Only consider cold callsites for inlining if analysis estimates downstream optimization opportunities max-early-inliner-iterations The maximum number of nested indirect inlining performed by early inliner comdat-sharing-probability Probability that COMDAT function will be shared with different compilation unit partial-inlining-entry-probability Maximum probability of the entry BB of split region (in percent relative to entry BB of the function) to make partial inlining happen max-variable-expansions-in-unroller If -fvariable-expansion-in-unroller is used, the maximum number of times that an individual variable will be expanded during loop unrolling min-vect-loop-bound If -ftree-vectorize is used, the minimal loop bound of a loop to be considered for vectorization max-delay-slot-insn-search The maximum number of instructions to consider to fill a delay slot max-delay-slot-live-search The maximum number of instructions to consider to find accurate live register information max-pending-list-length The maximum length of scheduling's pending operations list max-modulo-backtrack-attempts The maximum number of backtrack attempts the scheduler should make when modulo scheduling a loop large-function-insns The size of function body to be considered large large-function-growth Maximal growth due to inlining of large function (in percent) large-unit-insns The size of translation unit to be considered large inline-unit-growth How much can given compilation unit grow because of the inlining (in percent) ipcp-unit-growth How much can given compilation unit grow because of the interprocedural constant propagation (in percent) early-inlining-insns Maximal estimated growth of function body caused by early inlining of single call early-inlining-insns-any Early inline calls if growth does not exceed this limit early-inlining-insns-comdat Early inline calls to comdate functions if growth does not exceed this limit large-stack-frame The size of stack frame to be considered large large-stack-frame-growth Maximal stack frame growth due to inlining (in percent) max-gcse-memory The maximum amount of memory to be allocated by GCSE max-gcse-insertion-ratio The maximum ratio of insertions to deletions of expressions in GCSE gcse-after-reload-partial-fraction The threshold ratio for performing partial redundancy elimination after reload gcse-after-reload-critical-fraction The threshold ratio of critical edges execution count that permit performing redundancy elimination after reload gcse-cost-distance-ratio Scaling factor in calculation of maximum distance an expression can be moved by GCSE optimizations gcse-unrestricted-cost Cost at which GCSE optimizations will not constraint the distance an expression can travel max-hoist-depth Maximum depth of search in the dominator tree for expressions to hoist max-unrolled-insns The maximum number of instructions to consider to unroll in a loop max-average-unrolled-insns The maximum number of instructions to consider to unroll in a loop on average max-unroll-times The maximum number of unrollings of a single loop max-peeled-insns The maximum number of insns of a peeled loop max-peel-times The maximum number of peelings of a single loop max-peel-branches The maximum number of branches on the path through the peeled sequence max-completely-peeled-insns The maximum number of insns of a completely peeled loop max-default-completely-peeled-insns max-completely-peel-times The maximum number of peelings of a single loop that is peeled completely max-once-peeled-insns The maximum number of insns of a peeled loop that rolls only once max-completely-peel-loop-nest-depth The maximum depth of a loop nest we completely peel unrollpeel-codesize-threshold Maximum profile-based code size footprint estimate for loop unrolling and peeling unrollpeel-hotness-threshold Maximum ratio of total profiled execution count to loop entry block count under which most codesize limits for unrolling and peeling will be ignored min-iter-unroll-with-branches Minimum iteration count to ignore branch effects when unrolling unroll-outer-loop-branch-budget Maximum number of branches allowed in hot outer loop region after unroll max-unswitch-insns The maximum number of insns of an unswitched loop max-unswitch-level The maximum number of unswitchings in a single loop max-iterations-to-track Bound on the number of iterations the brute force # of iterations analysis algorithm evaluates max-iterations-computation-cost Bound on the cost of an expression to compute the number of iterations sms-max-ii-factor A factor for tuning the upper bound that swing modulo scheduler uses for scheduling a loop sms-min-sc The minimum value of stage count that swing modulo scheduler will generate. sms-dfa-history The number of cycles the swing modulo scheduler considers when checking conflicts using DFA sms-loop-average-count-threshold A threshold on the average loop count considered by the swing modulo scheduler hot-bb-count-ws-permille A basic block profile count is considered hot if it contributes to the given permillage of the entire profiled execution hot-bb-frequency-fraction Select fraction of the maximal frequency of executions of basic block in function given basic block needs to have to be considered hot unlikely-bb-count-fraction The minimum fraction of profile runs a given basic block execution count must be not to be considered unlikely align-threshold Select fraction of the maximal frequency of executions of basic block in function given basic block get alignment align-loop-iterations Loops iterating at least selected number of iterations will get loop alignement. align-loop-size For loop small enough, try to align them more strictly. max-predicted-iterations The maximum number of loop iterations w
[all...] |
| /prebuilts/tools/common/m2/repository/com/squareup/haha/haha/1.3/ |
| H A D | haha-1.3.jar | META-INF/ META-INF/MANIFEST.MF org/ org/eclipse/ org/eclipse/mat/ org/eclipse/mat/collect/ ... |
| /prebuilts/sdk/current/support/core-ui/ |
| H A D | android-support-core-ui.jar | android/support/v4/view/AsyncLayoutInflater$InflateRequest.class AsyncLayoutInflater.java package android.support.v4. ... |
| /prebuilts/sdk/tools/lib/ |
| H A D | signapk.jar | META-INF/ META-INF/MANIFEST.MF com/ com/android/ com/android/apksig/ com/android/apksig/DefaultApkSignerEngine ... |
| /prebuilts/devtools/tools/lib/ |
| H A D | ddmlib.jar | ... mapSize
int allocSize
int allocInfoSize
int totalMemory
int backtraceSize
int iterations
private void handleNHSG (com.android.ddmlib.Client ... |
| /prebuilts/gradle-plugin/com/android/tools/ddms/ddmlib/22.2.0/ |
| H A D | ddmlib-22.2.0.jar | META-INF/ META-INF/MANIFEST.MF com/ com/android/ com/android/ddmlib/ com/android/ddmlib/AdbCommandRejectedException ... |