/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 |