| /haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
| H A D | ssa-lim-11.c | 7 long iterations; member in struct:thread_param
14 long iterations = p->iterations; local
16 for (i=0; i<iterations; i++)
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/performance/27_io/ |
| H A D | ifstream_extract_int.cc | 29 const int iterations = 10000000; local
33 for (int i = 0; i < iterations; ++i)
40 for (int j, i = 0; i < iterations; ++i)
|
| H A D | cout_insert_int.cc | 30 const int iterations = 150000; local
33 for (int i = 0; i < iterations; i++)
|
| H A D | ofstream_insert_int.cc | 30 const int iterations = 10000000; local
34 for (int i = 0; i < iterations; ++i)
|
| H A D | ifstream_extract_float.cc | 29 const int iterations = 10000000; local
38 for (int i = 0; i < iterations; ++i)
53 for (int j, i = 0; i < iterations; ++i)
|
| H A D | ofstream_insert_float.cc | 30 const int iterations = 10000000; local
42 for (int i = 0; i < iterations; ++i)
|
| H A D | fstream_seek_write.cc | 30 const int iterations = 300000; local
36 for (int i = 0; i < iterations; i++)
|
| H A D | filebuf_sgetn_unbuf.cc | 33 const int iterations = 500000; local
51 for (int i = 0; i < iterations; ++i)
63 for (int i = 0; i < iterations; ++i)
76 for (int i = 0; i < iterations; ++i)
|
| H A D | filebuf_sputc.cc | 31 const int iterations = 100000000; local
36 for (int i = 0; i < iterations; ++i)
46 for (int i = 0; i < iterations; ++i)
58 for (int i = 0; i < iterations; ++i)
|
| H A D | filebuf_sputn_unbuf.cc | 32 const int iterations = 500000; local
41 for (int i = 0; i < iterations; ++i)
52 for (int i = 0; i < iterations; ++i)
64 for (int i = 0; i < iterations; ++i)
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/set/modifiers/ |
| H A D | 16728.cc | 38 // The number of iterations to be performed.
39 int iterations = ITERATIONS; variable
65 while (test_iterations < iterations)
80 comment << "4-way threaded iterations: " << iterations*4 << '\t';
82 comment << "iterations: " << iterations << '\t'; local
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/performance/21_strings/ |
| H A D | find.cc | 39 const unsigned int iterations = 2000000; local
45 test_pair(s, f, iterations);
52 test_pair(s, f, iterations);
59 test_pair(s, f, iterations);
67 test_pair(s, f, iterations);
74 test_pair(s, f, iterations);
81 test_pair(s, f, iterations);
90 test_pair(s, f, iterations);
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/performance/23_containers/create/ |
| H A D | map.cc | 28 const int iterations = 250000; local
29 for (int i = 0; i < iterations; ++i)
|
| /haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/ |
| H A D | 990527-1.c | 13 static int iterations, offset; variable
24 for (i = 0; i < iterations; i++)
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/performance/23_containers/create_sort/ |
| H A D | list.cc | 27 const int iterations = 1000000; local
28 for (unsigned int n = 1; n <= iterations; n *= 10)
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/performance/23_containers/create_from_sorted/ |
| H A D | set.cc | 28 static const unsigned iterations = 10; // make results less random while local
38 for (test_type i = 0; i != iterations; ++i)
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/performance/23_containers/insert_from_sorted/ |
| H A D | set.cc | 29 static const unsigned iterations = 10; local
46 for (unsigned i = 0; i != iterations; ++i)
|
| /haiku-buildtools/gcc/gcc/testsuite/go.test/test/bench/shootout/ |
| H A D | binary-tree.c | 130 long i, iterations, check; local
132 iterations = pow(2, maxDepth - depth + minDepth);
136 for (i = 1; i <= iterations; i++)
150 iterations * 2,
|
| H A D | binary-tree.go | 82 iterations := 1 << uint(maxDepth-depth+minDepth)
85 for i := 1; i <= iterations; i++ {
89 fmt.Printf("%d\t trees of depth %d\t check: %d\n", iterations*2, depth, check)
|
| H A D | binary-tree-freelist.go | 115 iterations := 1 << uint(maxDepth-depth+minDepth)
118 for i := 1; i <= iterations; i++ {
126 fmt.Printf("%d\t trees of depth %d\t check: %d\n", iterations*2, depth, check)
|
| /haiku-buildtools/gcc/gcc/testsuite/go.test/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)
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/performance/26_numerics/ |
| H A D | complex_norm.cc | 30 const int iterations = 2000; local
39 for (int i = 0; i < iterations; ++i)
55 for (int i = 0; i < iterations; ++i)
|
| /haiku-buildtools/gcc/gcc/testsuite/go.test/test/bench/go1/ |
| H A D | binarytree_test.go | 46 iterations := 1 << uint(maxDepth-depth+minDepth)
49 for i := 1; i <= iterations; i++ {
53 //fmt.Printf("%d\t trees of depth %d\t check: %d\n", iterations*2, depth, check)
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/performance/23_containers/producer_consumer/ |
| H A D | associative.cc | 23 // The number of iterations to be performed.
24 int iterations = 1000; variable
181 for (int j = insert_values * iterations; j > 0;)
219 for (int j = insert_values * iterations; j-- > 0;)
|
| H A D | sequence.cc | 23 // The number of iterations to be performed.
24 int iterations = 1000; variable
181 for (int j = insert_values * iterations; j > 0;)
219 for (int j = insert_values * iterations; j-- > 0;)
|