| /netbsd/external/gpl3/gcc/dist/gcc/ |
| H A D | hw-doloop.c | 38 dump_hwloops (hwloop_info loops) in dump_hwloops() argument
347 hwloop_info loops = NULL; in discover_loops() local
398 loop->next = loops; in discover_loops()
399 loops = loop; in discover_loops()
449 dump_hwloops (loops); in discover_loops()
451 return loops; in discover_loops()
458 while (loops) in free_loops()
461 loops = loop->next; in free_loops()
533 loops = loops->next; in reorder_loops()
640 free_loops (loops); in reorg_loops()
[all …]
|
| H A D | hw-doloop.cc | 38 dump_hwloops (hwloop_info loops) in dump_hwloops() argument
347 hwloop_info loops = NULL; in discover_loops() local
398 loop->next = loops; in discover_loops()
399 loops = loop; in discover_loops()
449 dump_hwloops (loops); in discover_loops()
451 return loops; in discover_loops()
458 while (loops) in free_loops()
461 loops = loop->next; in free_loops()
533 loops = loops->next; in reorder_loops()
640 free_loops (loops); in reorg_loops()
[all …]
|
| H A D | cfgloop.h | 321 struct GTY (()) loops { struct
340 extern struct loops *flow_loops_find (struct loops *);
562 struct loops *loops = loops_for_fn (fn); in get_loops() local
563 if (!loops) in get_loops()
566 return loops->larray; in get_loops()
575 struct loops *loops = loops_for_fn (fn); in number_of_loops() local
576 if (!loops) in number_of_loops()
579 return vec_safe_length (loops->larray); in number_of_loops()
797 struct loops *loops = loops_for_fn (fn); in loops_list() local
798 gcc_assert (!root || loops); in loops_list()
[all …]
|
| H A D | omp-expand.cc | 1873 if (fd->loops[i].m1 || fd->loops[i].m2) in expand_omp_for_init_counts()
2002 if (fd->loops[i].m1 && fd->loops[i].m2) in expand_omp_for_init_counts()
2423 if (fd->loops[i].m1 || fd->loops[i].m2) in expand_omp_for_init_counts()
3493 fd->loops[i].v, fd->loops[i].n1); in expand_omp_ordered_sink()
3660 fd->loops[i].v, fd->loops[i].n1); in expand_omp_for_ordered_loops()
4433 fd->loops[0].v, fd->loops[0].n1); in expand_omp_for_generic()
4494 fd->loops[0].v, fd->loops[0].n1); in expand_omp_for_generic()
8065 if ((loops[i].m1 || loops[i].m2) in expand_omp_for()
8075 if (loops[i].m1 && loops[i].m2) in expand_omp_for()
8083 loops[i - loops[i].outer].step)); in expand_omp_for()
[all …]
|
| H A D | cfgloop.c | 208 flow_loops_free (struct loops *loops) in flow_loops_free() argument
210 if (loops->larray) in flow_loops_free()
366 struct loops *loops, unsigned num_loops) in init_loops_structure() argument
370 memset (loops, 0, sizeof *loops); in init_loops_structure()
382 loops->tree_root = root; in init_loops_structure()
422 struct loops *
423 flow_loops_find (struct loops *loops) in flow_loops_find() argument
433 if (!loops) in flow_loops_find()
435 loops = ggc_cleared_alloc<struct loops> (); in flow_loops_find()
445 return loops; in flow_loops_find()
[all …]
|
| H A D | cfgloop.cc | 208 flow_loops_free (struct loops *loops) in flow_loops_free() argument
210 if (loops->larray) in flow_loops_free()
366 struct loops *loops, unsigned num_loops) in init_loops_structure() argument
370 memset (loops, 0, sizeof *loops); in init_loops_structure()
382 loops->tree_root = root; in init_loops_structure()
422 struct loops *
423 flow_loops_find (struct loops *loops) in flow_loops_find() argument
433 if (!loops) in flow_loops_find()
435 loops = ggc_cleared_alloc<struct loops> (); in flow_loops_find()
445 return loops; in flow_loops_find()
[all …]
|
| H A D | omp-expand.c | 2065 t = fold_build_pointer_plus (fd->loops[i].v, fd->loops[i].step); in extract_omp_for_update_vars()
2067 t = fold_build2 (PLUS_EXPR, vtype, fd->loops[i].v, fd->loops[i].step); in extract_omp_for_update_vars()
2216 TREE_TYPE (fd->loops[i].v), fd->loops[i].v, in expand_omp_ordered_sink()
2311 fd->loops[i].v, fd->loops[i].n1); in expand_omp_ordered_sink()
2478 fd->loops[i].v, fd->loops[i].n1); in expand_omp_for_ordered_loops()
3253 fd->loops[0].v, fd->loops[0].n1); in expand_omp_for_generic()
3314 fd->loops[0].v, fd->loops[0].n1); in expand_omp_for_generic()
5349 t = fold_convert (TREE_TYPE (fd->loops[i].v), fd->loops[i].n1); in expand_omp_simd()
5410 fd->loops[i].v, in expand_omp_simd()
6537 loops in expand_omp_for()
[all …]
|
| H A D | function.h | 262 struct loops *x_current_loops;
502 inline struct loops *
511 set_loops_for_fn (struct function *fn, struct loops *loops) in set_loops_for_fn() argument
513 gcc_checking_assert (fn->x_current_loops == NULL || loops == NULL); in set_loops_for_fn()
514 fn->x_current_loops = loops; in set_loops_for_fn()
|
| /netbsd/external/gpl3/gcc.old/dist/gcc/ |
| H A D | hw-doloop.c | 38 dump_hwloops (hwloop_info loops) in dump_hwloops() argument
347 hwloop_info loops = NULL; in discover_loops() local
398 loop->next = loops; in discover_loops()
399 loops = loop; in discover_loops()
449 dump_hwloops (loops); in discover_loops()
451 return loops; in discover_loops()
458 while (loops) in free_loops()
461 loops = loop->next; in free_loops()
533 loops = loops->next; in reorder_loops()
640 free_loops (loops); in reorg_loops()
[all …]
|
| H A D | cfgloop.h | 321 struct GTY (()) loops { struct
339 void init_loops_structure (struct function *, struct loops *, unsigned); argument
340 extern struct loops *flow_loops_find (struct loops *);
342 extern void flow_loops_free (struct loops *);
562 struct loops *loops = loops_for_fn (fn); in get_loops() local
563 if (!loops) in get_loops()
566 return loops->larray; in get_loops()
575 struct loops *loops = loops_for_fn (fn); in number_of_loops() local
576 if (!loops) in number_of_loops()
579 return vec_safe_length (loops->larray); in number_of_loops()
|
| H A D | cfgloop.c | 208 flow_loops_free (struct loops *loops) in flow_loops_free() argument
210 if (loops->larray) in flow_loops_free()
366 struct loops *loops, unsigned num_loops) in init_loops_structure() argument
370 memset (loops, 0, sizeof *loops); in init_loops_structure()
382 loops->tree_root = root; in init_loops_structure()
422 struct loops *
423 flow_loops_find (struct loops *loops) in flow_loops_find() argument
433 if (!loops) in flow_loops_find()
435 loops = ggc_cleared_alloc<struct loops> (); in flow_loops_find()
445 return loops; in flow_loops_find()
[all …]
|
| H A D | omp-expand.c | 2065 t = fold_build_pointer_plus (fd->loops[i].v, fd->loops[i].step); in extract_omp_for_update_vars()
2067 t = fold_build2 (PLUS_EXPR, vtype, fd->loops[i].v, fd->loops[i].step); in extract_omp_for_update_vars()
2216 TREE_TYPE (fd->loops[i].v), fd->loops[i].v, in expand_omp_ordered_sink()
2311 fd->loops[i].v, fd->loops[i].n1); in expand_omp_ordered_sink()
2478 fd->loops[i].v, fd->loops[i].n1); in expand_omp_for_ordered_loops()
3253 fd->loops[0].v, fd->loops[0].n1); in expand_omp_for_generic()
3314 fd->loops[0].v, fd->loops[0].n1); in expand_omp_for_generic()
5349 t = fold_convert (TREE_TYPE (fd->loops[i].v), fd->loops[i].n1); in expand_omp_simd()
5410 fd->loops[i].v, in expand_omp_simd()
6537 loops in expand_omp_for()
[all …]
|
| H A D | function.h | 261 struct loops *x_current_loops;
485 inline struct loops *
494 set_loops_for_fn (struct function *fn, struct loops *loops) in set_loops_for_fn() argument
496 gcc_checking_assert (fn->x_current_loops == NULL || loops == NULL); in set_loops_for_fn()
497 fn->x_current_loops = loops; in set_loops_for_fn()
|
| /netbsd/external/gpl3/gcc.old/dist/gcc/doc/ |
| H A D | loop.texi | 50 The representation of loops in GCC however allows only loops with a
83 loops in the function. To traverse all loops, use @code{FOR_EACH_LOOP}
119 sub-loops, and makes manipulation with the loops significantly easier.
151 used to cleanup CFG while updating the loops structures if
172 the basic blocks of the sub-loops).
174 sub-loop, and the sibling of the loop in the loops tree.
185 number of super-loops of the loop.
196 to a loop (including its sub-loops).
245 are only reliable for the innermost loops:
343 their evolution in the outer loops is known.
[all …]
|
| /netbsd/external/gpl3/gcc/dist/gcc/doc/ |
| H A D | loop.texi | 21 * Loop querying:: Getting information about loops.
50 The representation of loops in GCC however allows only loops with a
120 sub-loops, and makes manipulation with the loops significantly easier.
152 used to cleanup CFG while updating the loops structures if
173 the basic blocks of the sub-loops).
175 sub-loop, and the sibling of the loop in the loops tree.
186 number of super-loops of the loop.
197 to a loop (including its sub-loops).
246 are only reliable for the innermost loops:
344 their evolution in the outer loops is known.
[all …]
|
| /netbsd/crypto/external/bsd/heimdal/dist/lib/base/ |
| H A D | bsearch.c | 153 int *cmp, size_t *loops) in bsearch_common() argument
171 if (loops) in bsearch_common()
172 *loops = 0; in bsearch_common()
293 if (loops) in bsearch_common()
294 *loops = loop_count; in bsearch_common()
716 if (loops) in _bsearch_file()
717 *loops = 0; in _bsearch_file()
744 if (loops) in _bsearch_file()
745 *loops = my_loops_total; in _bsearch_file()
781 if (loops) in _bsearch_file()
[all …]
|
| /netbsd/external/lgpl3/mpc/dist/ |
| H A D | TODO | 48 10000 loops, best of 3: 42.2 us per loop
50 100 loops, best of 3: 5.29 ms per loop
54 10000 loops, best of 3: 83.7 us per loop
56 100 loops, best of 3: 17 ms per loop
61 10000 loops, best of 3: 90.8 us per loop
63 1 loops, best of 3: 2.29 s per loop
67 10000 loops, best of 3: 84 us per loop
69 100 loops, best of 3: 2.1 ms per loop
72 10000 loops, best of 3: 92 us per loop
74 1 loops, best of 3: 2.28 s per loop
|
| /netbsd/crypto/external/bsd/heimdal/dist/lib/hcrypto/ |
| H A D | test_rsa.c | 54 static int loops = 1; variable
57 { "loops", 0, arg_integer, &loops,
256 printf("running keygen with %d loops\n", loops); in main()
260 for (i = 0; i < loops; i++) { in main()
301 p = emalloc(loops * size); in main()
303 RAND_bytes(p, loops * size); in main()
306 for (i = 0; i < loops; i++) in main()
362 for (i = 0; i < loops; i++) { in main()
|
| H A D | test_bulk.c | 81 static int loops = 20; variable
98 { "loops", 0, arg_integer, &loops,
131 for (i = 0; i < loops; i++) { in test_bulk_cipher()
186 for (i = 0; i < loops; i++) { in test_bulk_digest()
|
| /netbsd/tests/net/in_cksum/ |
| H A D | in_cksum.c | 176 int loops, old_sum, off, len; in main() local
186 loops = 16; in main()
197 loops = atoi(optarg); in main()
211 for (; loops; --loops) { in main()
219 if (loops == 1) in main()
|
| /netbsd/external/lgpl3/mpc/dist/src/ |
| H A D | norm.c | 48 int loops; in mpc_norm() local
62 loops = 0; in mpc_norm()
66 loops++; in mpc_norm()
68 if (loops >= max_loops) { in mpc_norm()
92 } while (loops < max_loops && inexact != 0 in mpc_norm()
|
| /netbsd/external/apache2/llvm/dist/llvm/docs/ |
| H A D | Vectorizers.rst | 13 vectors while the Loop Vectorizer widens instructions in loops
89 Many loops cannot be vectorized including loops with complicated control flow,
92 and diagnose loops that are skipped by the loop-vectorizer.
96 ``-Rpass=loop-vectorize`` identifies loops that were successfully vectorized.
143 complex loops.
148 The Loop Vectorizer supports loops with an unknown trip count.
253 The Loop Vectorizer can vectorize loops that count backwards.
354 performing partial-unrolling of loops.
382 enhanced with a feature that allows it to vectorize epilogue loops with a
397 This benchmarks is a collection of loops from the GCC autovectorization
[all …]
|
| /netbsd/external/bsd/ntp/dist/lib/isc/ |
| H A D | hex.c | 57 unsigned int loops = 0; in isc_hex_totext() local
69 loops++; in isc_hex_totext()
71 (int)((loops + 1) * 2) >= wordlength) in isc_hex_totext()
73 loops = 0; in isc_hex_totext()
|
| /netbsd/crypto/external/bsd/heimdal/dist/tests/gss/ |
| H A D | check-basic.in | 138 --loops=10 \
144 --loops=10 \
151 --loops=10 \
158 --loops=10 \
|
| /netbsd/external/mpl/bind/dist/lib/isc/ |
| H A D | hex.c | 49 unsigned int loops = 0; in isc_hex_totext() local
62 loops++; in isc_hex_totext()
63 if (source->length != 0 && (int)((loops + 1) * 2) >= wordlength) in isc_hex_totext()
65 loops = 0; in isc_hex_totext()
|