| /src/external/lgpl2/userspace-rcu/dist/tests/benchmark/ |
| test_cycles_per_loop.c | 14 static inline void loop_sleep(unsigned long loops)
16 while (loops-- != 0)
|
| test_looplen.c | 30 static inline void loop_sleep(unsigned long loops)
32 while (loops-- != 0)
36 #define LOOPS 1048576
48 loop_sleep(LOOPS);
52 cpl = ((double)time_tot) / (double)TESTS / (double)LOOPS;
55 printf("time_tot = %llu, LOOPS = %d, TESTS = %d\n",
56 (unsigned long long) time_tot, LOOPS, TESTS);
|
| /src/external/gpl3/gcc/dist/gcc/ |
| hw-doloop.cc | 1 /* Code to analyze doloop loops in order for targets to perform late
2 optimizations converting doloops to other forms of hardware loops.
36 /* Dump information collected in LOOPS. */
38 dump_hwloops (hwloop_info loops)
42 for (loop = loops; loop; loop = loop->next)
60 fprintf (dump_file, " inner loops: [ ");
61 for (ix = 0; loop->loops.iterate (ix, &i); ix++)
188 well. This transformation gives a second chance to loops we couldn't
339 /* Analyze the structure of the loops in the current function. Use
341 hardware loops found in this function. HOOKS is the argumen
347 hwloop_info loops = NULL; local
620 hwloop_info loops = NULL; local
[all...] |
| cfgloop.h | 85 /* Next element in the list of loops from that E exits. */
122 /* Index into loops array. Note indices will never be reused after loop
200 7) Update constraints in versioned loops so that niter analyzer
246 /* For SIMD loops, this is a unique identifier of the loop, referenced
251 /* In loop optimization, it's common to generate loops from the original
253 used to track the original loop from newly generated loops. This can
274 loop header for loops marked for removal. Note that this prevents
323 /* Structure to hold CFG information about natural loops within a function. */
324 struct GTY (()) loops {
325 /* State of loops. *
570 struct loops *loops = loops_for_fn (fn); local
583 struct loops *loops = loops_for_fn (fn); local
805 struct loops *loops = loops_for_fn (fn); local
[all...] |
| hw-doloop.h | 1 /* Code to analyze doloop loops in order for targets to perform late
2 optimizations converting doloops to other forms of hardware loops.
24 /* We need to keep a vector of loops */
38 inner loops. */
44 /* Vector of inner loops within this loop. Includes loops of every
46 vec<hwloop_info> loops; variable
89 /* The nesting depth of the loop. Innermost loops are given a depth
140 innermost loops first and ascending. */
|
| omp-expand.cc | 342 static loops and any kind of ordered loop. In the first
1457 loop tree arrange for the child function to fixup loops. */
1569 const omp_for_data_loop *loop = &fd->loops[ix];
1674 const omp_for_data_loop *loop = &fd->loops[ix];
1736 loops, do this only for the rectangular loops. Then pick
1737 the loops which reference outer vars in their bound expressions
1738 and the loops which they refer to and for this sub-nest compute
1739 number of iterations. For triangular loops use Faulhaber's formula,
1740 otherwise as a fallback, compute by iterating the loops
8143 struct omp_for_data_loop *loops; local
[all...] |
| function.h | 262 /* The loops in this function. */
263 struct loops *x_current_loops;
423 /* Nonzero if the current function contains any loops with
427 /* Nonzero if the current function contains any loops with
511 inline struct loops *
517 /* Set the loop tree of FN to LOOPS. */
520 set_loops_for_fn (struct function *fn, struct loops *loops)
522 gcc_checking_assert (fn->x_current_loops == NULL || loops == NULL);
523 fn->x_current_loops = loops;
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| hw-doloop.cc | 1 /* Code to analyze doloop loops in order for targets to perform late
2 optimizations converting doloops to other forms of hardware loops.
36 /* Dump information collected in LOOPS. */
38 dump_hwloops (hwloop_info loops)
42 for (loop = loops; loop; loop = loop->next)
60 fprintf (dump_file, " inner loops: [ ");
61 for (ix = 0; loop->loops.iterate (ix, &i); ix++)
188 well. This transformation gives a second chance to loops we couldn't
339 /* Analyze the structure of the loops in the current function. Use
341 hardware loops found in this function. HOOKS is the argumen
347 hwloop_info loops = NULL; local
620 hwloop_info loops = NULL; local
[all...] |
| cfgloop.h | 82 /* Next element in the list of loops from that E exits. */
119 /* Index into loops array. Note indices will never be reused after loop
197 7) Update constraints in versioned loops so that niter analyzer
243 /* For SIMD loops, this is a unique identifier of the loop, referenced
248 /* In loop optimization, it's common to generate loops from the original
250 used to track the original loop from newly generated loops. This can
271 loop header for loops marked for removal. Note that this prevents
320 /* Structure to hold CFG information about natural loops within a function. */
321 struct GTY (()) loops {
322 /* State of loops. *
562 struct loops *loops = loops_for_fn (fn); local
575 struct loops *loops = loops_for_fn (fn); local
797 struct loops *loops = loops_for_fn (fn); local
[all...] |
| hw-doloop.h | 1 /* Code to analyze doloop loops in order for targets to perform late
2 optimizations converting doloops to other forms of hardware loops.
24 /* We need to keep a vector of loops */
38 inner loops. */
44 /* Vector of inner loops within this loop. Includes loops of every
46 vec<hwloop_info> loops; variable
89 /* The nesting depth of the loop. Innermost loops are given a depth
140 innermost loops first and ascending. */
|
| omp-expand.cc | 341 static loops and any kind of ordered loop. In the first
1454 loop tree arrange for the child function to fixup loops. */
1568 const omp_for_data_loop *loop = &fd->loops[ix];
1673 const omp_for_data_loop *loop = &fd->loops[ix];
1735 loops, do this only for the rectangular loops. Then pick
1736 the loops which reference outer vars in their bound expressions
1737 and the loops which they refer to and for this sub-nest compute
1738 number of iterations. For triangular loops use Faulhaber's formula,
1739 otherwise as a fallback, compute by iterating the loops
8054 struct omp_for_data_loop *loops; local
[all...] |
| /src/usr.bin/make/unit-tests/ |
| directive-for-lines.mk | 3 # Tests for the line numbers that are reported in .for loops.
7 # messages inside .for loops had been wrong since ParseGetLine skipped empty
|
| directive-for-empty.mk | 3 # Tests for .for loops containing conditions of the form 'empty(var:...)'.
37 # The typical way of mistakenly using 'empty' with variables from .for loops
42 # Instead of the 'empty' function, the variables from .for loops can be
83 # the .for loops in a separate scope. To match the current behavior, there
84 # has to be one scope per included file. There may be .for loops using the
99 # that variables from .for loops can only affect expressions in the current
100 # file. If variables from .for loops were implemented as global variables,
107 # Another tricky detail are nested .for loops in a single file that use the
110 # possible though. Assuming there are two nested .for loops, both using the
124 # from .for loops and the modifiers mentioned above
[all...] |
| /src/external/mpl/bind/dist/lib/isc/ |
| loop_p.h | 114 isc_loop_t *loops; member in struct:isc_loopmgr
150 #define DEFAULT_LOOP(loopmgr) (&(loopmgr)->loops[0])
151 #define CURRENT_LOOP(loopmgr) (&(loopmgr)->loops[isc_tid()])
152 #define LOOP(loopmgr, tid) (&(loopmgr)->loops[tid])
|
| /src/external/lgpl3/mpc/dist/src/ |
| norm.c | 48 int loops; local
50 /* switch to exact squarings when loops==max_loops */
62 loops = 0;
66 loops++;
68 if (loops >= max_loops) {
83 /* If loops = max_loops, inexact should be 0 here, except in case
85 If loops < max_loops and inexact is zero, we can exit the
92 } while (loops < max_loops && inexact != 0
|
| log10.c | 35 int ok = 0, loops = 0, check_exact = 0, special_re, special_im, local
52 loops ++;
53 prec += (loops <= 2) ? mpc_ceil_log2 (prec) + 4 : prec / 2;
|
| /src/external/mpl/bind/dist/tests/isc/ |
| mutex_test.c | 42 static unsigned int loops = 100; variable
49 loops = atoi(env);
51 assert_int_not_equal(loops, 0);
67 for (size_t i = 0; i < loops; i++) {
91 for (size_t i = 0; i < loops; i++) {
107 for (size_t i = 0; i < loops; i++) {
129 expected_counter = ITERS * workers * loops *
162 "loops in "
198 printf("[ TIME ] isc_mutex_benchmark: %zu isc_mutex loops "
|
| spinlock_test.c | 47 static unsigned int loops = 100; variable
54 loops = atoi(env);
56 assert_int_not_equal(loops, 0);
72 for (size_t i = 0; i < loops; i++) {
97 for (size_t i = 0; i < loops; i++) {
116 for (size_t i = 0; i < loops; i++) {
137 expected_counter = ITERS * workers * loops *
171 "loops in "
208 printf("[ TIME ] isc_spinlock_benchmark: %zu isc_spinlock loops "
|
| rwlock_test.c | 43 static unsigned int loops = 100; variable
66 loops = atoi(env);
68 assert_int_not_equal(loops, 0);
76 rnd = isc_mem_cget(mctx, loops, sizeof(rnd[0]));
77 for (size_t i = 0; i < loops; i++) {
86 isc_mem_cput(mctx, rnd, loops, sizeof(rnd[0]));
211 for (size_t i = 0; i < loops; i++) {
233 for (size_t i = 0; i < loops; i++) {
259 expected_counter = ITERS * nthreads * loops *
289 printf("[ TIME ] isc_rwlock_benchmark: %zu pthread_rwlock loops in
[all...] |
| /src/external/bsd/openldap/dist/tests/progs/ |
| slapd-common.h | 48 int loops; member in struct:tester_conn_args
78 "[-l <loops>] " \
|
| /src/external/mpl/dhcp/bind/dist/lib/isc/ |
| hex.c | 49 unsigned int loops = 0; local
62 loops++;
63 if (source->length != 0 && (int)((loops + 1) * 2) >= wordlength)
65 loops = 0;
|
| /src/crypto/external/bsd/heimdal/dist/lib/hcrypto/ |
| test_rsa.c | 54 static int loops = 1; variable
57 { "loops", 0, arg_integer, &loops,
58 "number of loops", "loops" },
256 printf("running keygen with %d loops\n", loops);
260 for (i = 0; i < loops; i++) {
301 p = emalloc(loops * size);
303 RAND_bytes(p, loops * size)
[all...] |
| /src/crypto/external/bsd/heimdal/dist/tests/gss/ |
| check-basic.in | 138 --loops=10 \
144 --loops=10 \
151 --loops=10 \
158 --loops=10 \
|
| /src/tests/net/in_cksum/ |
| in_cksum.c | 176 int loops, old_sum, off, len; local
186 loops = 16;
197 loops = atoi(optarg);
206 errx(1, "%s [-l <loops>] [-u <unalign> [-i <iterations> "
211 for (; loops; --loops) {
219 if (loops == 1)
|
| /src/crypto/external/bsd/heimdal/dist/lib/base/ |
| bsearch.c | 147 * @loops Location to store a count of bisections required for
153 int *cmp, size_t *loops)
171 if (loops)
172 *loops = 0;
293 if (loops)
294 *loops = loop_count;
321 * @loops Location where to put a number of loops (or comparisons)
326 char **value, size_t *location, size_t *loops)
328 return bsearch_common(buf, buf_sz, key, 1, value, location, NULL, loops);
[all...] |
