| /netbsd-src/external/gpl3/gcc.old/dist/gcc/ |
| H A D | hw-doloop.c | 38 dump_hwloops (hwloop_info loops) in dump_hwloops() argument
42 for (loop = loops; loop; loop = loop->next) in dump_hwloops()
61 for (ix = 0; loop->loops.iterate (ix, &i); ix++) in dump_hwloops()
347 hwloop_info loops = NULL; in discover_loops() local
398 loop->next = loops; in discover_loops()
399 loops = loop; in discover_loops()
417 for (loop = loops; loop; loop = loop->next) in discover_loops()
424 for (other = loops; other; other = other->next) in discover_loops()
433 loop->loops.safe_push (other); in discover_loops()
436 other->loops.safe_push (loop); in discover_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()
216 FOR_EACH_VEC_SAFE_ELT (loops->larray, i, loop) in flow_loops_free()
224 vec_free (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()
371 vec_alloc (loops->larray, num_loops); in init_loops_structure()
381 loops->larray->quick_push (root); in init_loops_structure()
382 loops->tree_root = root; in init_loops_structure()
422 struct loops *
[all …]
|
| H A D | omp-expand.c | 1566 const omp_for_data_loop *loop = &fd->loops[ix]; in expand_oacc_collapse_init()
1671 const omp_for_data_loop *loop = &fd->loops[ix]; in expand_oacc_collapse_vars()
1799 tree itype = TREE_TYPE (fd->loops[i].v); in expand_omp_for_init_counts()
1801 t = fold_binary (fd->loops[i].cond_code, boolean_type_node, in expand_omp_for_init_counts()
1802 fold_convert (itype, fd->loops[i].n1), in expand_omp_for_init_counts()
1803 fold_convert (itype, fd->loops[i].n2)); in expand_omp_for_init_counts()
1813 tree itype = TREE_TYPE (fd->loops[i].v); in expand_omp_for_init_counts()
1818 && ((t = fold_binary (fd->loops[i].cond_code, boolean_type_node, in expand_omp_for_init_counts()
1819 fold_convert (itype, fd->loops[i].n1), in expand_omp_for_init_counts()
1820 fold_convert (itype, fd->loops[i].n2))) in expand_omp_for_init_counts()
[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()
|
| H A D | omp-grid.c | 495 struct omp_for_data_loop *loops in grid_gfor_follows_tiling_pattern() local
498 omp_extract_for_data (gfor, &fd, loops); in grid_gfor_follows_tiling_pattern()
501 tree itype, type = TREE_TYPE (fd.loops[i].v); in grid_gfor_follows_tiling_pattern()
507 tree n1 = fold_convert (itype, fd.loops[i].n1); in grid_gfor_follows_tiling_pattern()
508 tree n2 = fold_convert (itype, fd.loops[i].n2); in grid_gfor_follows_tiling_pattern()
510 (fd.loops[i].cond_code == LT_EXPR ? -1 : 1)); in grid_gfor_follows_tiling_pattern()
511 t = fold_build2 (PLUS_EXPR, itype, fd.loops[i].step, t); in grid_gfor_follows_tiling_pattern()
514 if (TYPE_UNSIGNED (itype) && fd.loops[i].cond_code == GT_EXPR) in grid_gfor_follows_tiling_pattern()
517 fold_build1 (NEGATE_EXPR, itype, fd.loops[i].step)); in grid_gfor_follows_tiling_pattern()
519 t = fold_build2 (TRUNC_DIV_EXPR, itype, t, fd.loops[i].step); in grid_gfor_follows_tiling_pattern()
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | hw-doloop.cc | 38 dump_hwloops (hwloop_info loops) in dump_hwloops() argument
42 for (loop = loops; loop; loop = loop->next) in dump_hwloops()
61 for (ix = 0; loop->loops.iterate (ix, &i); ix++) in dump_hwloops()
347 hwloop_info loops = NULL; in discover_loops() local
398 loop->next = loops; in discover_loops()
399 loops = loop; in discover_loops()
417 for (loop = loops; loop; loop = loop->next) in discover_loops()
424 for (other = loops; other; other = other->next) in discover_loops()
433 loop->loops.safe_push (other); in discover_loops()
436 other->loops.safe_push (loop); in discover_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()
[all …]
|
| H A D | omp-expand.cc | 1568 const omp_for_data_loop *loop = &fd->loops[ix]; in expand_oacc_collapse_init()
1673 const omp_for_data_loop *loop = &fd->loops[ix]; in expand_oacc_collapse_vars()
1830 && !TYPE_UNSIGNED (TREE_TYPE (fd->loops[fd->last_nonrect].v))) in expand_omp_for_init_counts()
1850 tree itype = TREE_TYPE (fd->loops[i].v); in expand_omp_for_init_counts()
1852 t = fold_binary (fd->loops[i].cond_code, boolean_type_node, in expand_omp_for_init_counts()
1853 fold_convert (itype, fd->loops[i].n1), in expand_omp_for_init_counts()
1854 fold_convert (itype, fd->loops[i].n2)); in expand_omp_for_init_counts()
1865 tree itype = TREE_TYPE (fd->loops[i].v); in expand_omp_for_init_counts()
1873 if (fd->loops[i].m1 || fd->loops[i].m2) in expand_omp_for_init_counts()
1880 && ((t = fold_binary (fd->loops[i].cond_code, boolean_type_node, in expand_omp_for_init_counts()
[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()
216 FOR_EACH_VEC_SAFE_ELT (loops->larray, i, loop) in flow_loops_free()
224 vec_free (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()
371 vec_alloc (loops->larray, num_loops); in init_loops_structure()
381 loops->larray->quick_push (root); in init_loops_structure()
382 loops->tree_root = root; in init_loops_structure()
422 struct loops *
[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-src/external/gpl3/gcc/dist/gcc/doc/ |
| H A D | loop.texi | 13 GCC provides extensive infrastructure for work with natural loops, i.e.,
15 chapter describes representation of loops in GCC, both on GIMPLE and in
20 * Loop representation:: Representation and analysis of loops.
21 * Loop querying:: Getting information about loops.
35 This chapter describes the representation of loops in GCC, and functions
43 passes to allow attaching meta information to individual loops
48 the loop. Loops with several latches may appear if several loops share
50 The representation of loops in GCC however allows only loops with a
51 single latch. During loop analysis, headers of such loops are split and
54 variables in the loops is used to determine whether the latches
[all …]
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/doc/ |
| H A D | loop.texi | 13 GCC provides extensive infrastructure for work with natural loops, i.e.,
15 chapter describes representation of loops in GCC, both on GIMPLE and in
20 * Loop representation:: Representation and analysis of loops.
21 * Loop querying:: Getting information about loops.
35 This chapter describes the representation of loops in GCC, and functions
43 passes to allow attaching meta information to individual loops
48 the loop. Loops with several latches may appear if several loops share
50 The representation of loops in GCC however allows only loops with a
51 single latch. During loop analysis, headers of such loops are split and
54 variables in the loops is used to determine whether the latches
[all …]
|
| /netbsd-src/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()
326 char **value, size_t *location, size_t *loops) in _bsearch_text() argument
328 return bsearch_common(buf, buf_sz, key, 1, value, location, NULL, loops); in _bsearch_text()
696 char **value, size_t *location, size_t *loops, size_t *reads) in _bsearch_file() argument
716 if (loops) in _bsearch_file()
717 *loops = 0; in _bsearch_file()
[all …]
|
| /netbsd-src/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-src/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-src/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-src/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-src/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.
98 ``-Rpass-missed=loop-vectorize`` identifies loops that failed vectorization and
143 complex loops.
148 The Loop Vectorizer supports loops with an unknown trip count.
150 and the Loop Vectorizer has a mechanism to vectorize loops that do not start
253 The Loop Vectorizer can vectorize loops that count backwards.
354 performing partial-unrolling of loops.
[all …]
|
| /netbsd-src/external/mpl/dhcp/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()
|
| /netbsd-src/external/mpl/bind/dist/lib/isc/ |
| H A D | hex.c | 65 unsigned int loops = 0; in isc_hex_totext()
78 loops++;
79 if (source->length != 0 && (int)((loops + 1) * 2) >= wordlength)
81 loops = 0;
49 unsigned int loops = 0; isc_hex_totext() local
|
| H A D | base64.c | 52 unsigned int loops = 0; in isc_base64_totext() local
69 loops++; in isc_base64_totext()
70 if (source->length != 0 && (int)((loops + 1) * 4) >= wordlength) in isc_base64_totext()
72 loops = 0; in isc_base64_totext()
|
| /netbsd-src/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-src/external/apache2/llvm/dist/clang/tools/clang-fuzzer/ |
| H A D | cxx_loop_proto.proto | 1 //===-- cxx_loop_proto.proto - Protobuf description of C++ with for loops -===//
13 /// while loops and conditionals. The goal is that the C++ code generated will
15 /// contain either a single loop or two nested loops.
|