| /freebsd-12.1/contrib/gcc/ |
| H A D | loop-init.c | 40 struct loops *
43 struct loops *loops = XCNEW (struct loops); in loop_optimizer_init() local
69 free (loops); in loop_optimizer_init()
75 free (loops->cfg.rc_order); in loop_optimizer_init()
76 loops->cfg.rc_order = NULL; in loop_optimizer_init()
103 return loops; in loop_optimizer_init()
108 loop_optimizer_finalize (struct loops *loops) in loop_optimizer_finalize() argument
112 if (!loops) in loop_optimizer_finalize()
116 if (loops->parray[i]) in loop_optimizer_finalize()
120 flow_loops_free (loops); in loop_optimizer_finalize()
[all …]
|
| H A D | cfgloop.c | 53 flow_loops_cfg_dump (const struct loops *loops, FILE *file) in flow_loops_cfg_dump() argument
190 flow_loops_free (struct loops *loops) in flow_loops_free() argument
273 mark_single_exit_loops (struct loops *loops) in mark_single_exit_loops() argument
419 flow_loops_level_compute (struct loops *loops) in flow_loops_level_compute() argument
577 initialize_loops_parallel_p (struct loops *loops) in initialize_loops_parallel_p() argument
593 flow_loops_find (struct loops *loops) in flow_loops_find() argument
604 memset (loops, 0, sizeof *loops); in flow_loops_find()
684 loops->tree_root = loops->parray[0]; in flow_loops_find()
1016 cancel_loop (struct loops *loops, struct loop *loop) in cancel_loop() argument
1040 cancel_loop_tree (struct loops *loops, struct loop *loop) in cancel_loop_tree() argument
[all …]
|
| H A D | cfgloop.h | 145 struct loops struct
179 extern struct loops *current_loops; argument
182 extern int flow_loops_find (struct loops *);
183 extern void flow_loops_free (struct loops *);
191 void mark_irreducible_loops (struct loops *);
192 void mark_single_exit_loops (struct loops *);
206 extern void mark_loop_exit_edges (struct loops *);
234 extern void verify_loop_structure (struct loops *);
260 extern bool remove_path (struct loops *, edge);
389 extern void unswitch_loops (struct loops *);
[all …]
|
| H A D | cfgloopmanip.c | 100 fix_bb_placement (struct loops *loops, basic_block bb) in fix_bb_placement() argument
141 fix_bb_placements (struct loops *loops, basic_block from, in fix_bb_placements() argument
246 remove_path (struct loops *loops, edge e) in remove_path() argument
369 add_loop (struct loops *loops, struct loop *loop) in add_loop() argument
603 fix_loop_placements (struct loops *loops, struct loop *loop, in fix_loop_placements() argument
627 place_new_loop (struct loops *loops, struct loop *loop) in place_new_loop() argument
631 loops->parray[loops->num] = loop; in place_new_loop()
1176 create_preheaders (struct loops *loops, int flags) in create_preheaders() argument
1187 force_single_succ_latches (struct loops *loops) in force_single_succ_latches() argument
1294 loop_version (struct loops *loops, struct loop * loop, in loop_version() argument
[all …]
|
| H A D | tree-ssa-loop-unswitch.c | 78 static bool tree_unswitch_single_loop (struct loops *, struct loop *, int);
84 tree_ssa_unswitch_loops (struct loops *loops) in tree_ssa_unswitch_loops() argument
91 num = loops->num; in tree_ssa_unswitch_loops()
96 loop = loops->parray[i]; in tree_ssa_unswitch_loops()
103 changed |= tree_unswitch_single_loop (loops, loop, 0); in tree_ssa_unswitch_loops()
180 tree_unswitch_single_loop (struct loops *loops, struct loop *loop, int num) in tree_unswitch_single_loop() argument
255 nloop = tree_unswitch_loop (loops, loop, bbs[i], cond); in tree_unswitch_single_loop()
268 tree_unswitch_single_loop (loops, nloop, num + 1); in tree_unswitch_single_loop()
269 tree_unswitch_single_loop (loops, loop, num + 1); in tree_unswitch_single_loop()
280 tree_unswitch_loop (struct loops *loops, struct loop *loop, in tree_unswitch_loop() argument
[all …]
|
| H A D | loop-unswitch.c | 140 unswitch_loops (struct loops *loops) in unswitch_loops() argument
146 num = loops->num; in unswitch_loops()
151 loop = loops->parray[i]; in unswitch_loops()
161 verify_loop_structure (loops); in unswitch_loops()
262 unswitch_single_loop (struct loops *loops, struct loop *loop, in unswitch_single_loop() argument
354 remove_path (loops, e); in unswitch_single_loop()
362 remove_path (loops, e); in unswitch_single_loop()
401 unswitch_loop (struct loops *loops, struct loop *loop, basic_block unswitch_on, in unswitch_loop() argument
469 nloop = loopify (loops, latch_edge, in unswitch_loop()
474 remove_path (loops, true_edge); in unswitch_loop()
[all …]
|
| H A D | tree-ssa-loop-ivcanon.c | 162 try_unroll_loop_completely (struct loops *loops ATTRIBUTE_UNUSED, in try_unroll_loop_completely()
240 loops, n_unroll, wont_exit, in try_unroll_loop_completely()
276 canonicalize_loop_induction_variables (struct loops *loops, struct loop *loop, in canonicalize_loop_induction_variables() argument
334 canonicalize_induction_variables (struct loops *loops) in canonicalize_induction_variables() argument
340 for (i = 1; i < loops->num; i++) in canonicalize_induction_variables()
342 loop = loops->parray[i]; in canonicalize_induction_variables()
345 changed |= canonicalize_loop_induction_variables (loops, loop, in canonicalize_induction_variables()
364 tree_unroll_loops_completely (struct loops *loops, bool may_increase_size) in tree_unroll_loops_completely() argument
371 for (i = 1; i < loops->num; i++) in tree_unroll_loops_completely()
373 loop = loops->parray[i]; in tree_unroll_loops_completely()
[all …]
|
| H A D | loop-unroll.c | 145 unroll_and_peel_loops (struct loops *loops, int flags) in unroll_and_peel_loops() argument
234 peel_loops_completely (struct loops *loops, int flags) in peel_loops_completely() argument
272 decide_unrolling_and_peeling (struct loops *loops, int flags) in decide_unrolling_and_peeling() argument
478 peel_loop_completely (struct loops *loops, struct loop *loop) in peel_loop_completely() argument
507 loops, npeel, in peel_loop_completely()
661 unroll_loop_constant_iterations (struct loops *loops, struct loop *loop) in unroll_loop_constant_iterations() argument
934 unroll_loop_runtime_iterations (struct loops *loops, struct loop *loop) in unroll_loop_runtime_iterations() argument
1029 loops, 1, in unroll_loop_runtime_iterations()
1046 loops, 1, in unroll_loop_runtime_iterations()
1264 peel_loop_simple (struct loops *loops, struct loop *loop) in peel_loop_simple() argument
[all …]
|
| H A D | tree-ssa-loop-ch.c | 126 struct loops *loops; in copy_loop_headers() local
135 loops = loop_optimizer_init (LOOPS_HAVE_PREHEADERS in copy_loop_headers()
137 if (!loops) in copy_loop_headers()
141 verify_loop_structure (loops); in copy_loop_headers()
148 for (i = 1; i < loops->num; i++) in copy_loop_headers()
153 loop = loops->parray[i]; in copy_loop_headers()
237 loop_optimizer_finalize (loops); in copy_loop_headers()
|
| H A D | tree-ssa-loop.c | 43 struct loops *current_loops = NULL;
47 static struct loops *
50 struct loops *loops; in tree_loop_optimizer_init() local
52 loops = loop_optimizer_init (LOOPS_NORMAL in tree_loop_optimizer_init()
55 if (!loops) in tree_loop_optimizer_init()
60 return loops; in tree_loop_optimizer_init()
|
| H A D | cfgloopanal.c | 269 mark_irreducible_loops (struct loops *loops) in mark_irreducible_loops() argument
276 int *queue1 = XNEWVEC (int, last_basic_block + loops->num); in mark_irreducible_loops()
277 int *queue2 = XNEWVEC (int, last_basic_block + loops->num); in mark_irreducible_loops()
290 g = new_graph (last_basic_block + loops->num); in mark_irreducible_loops()
342 for (i = 1; i < (int) loops->num; i++) in mark_irreducible_loops()
343 if (loops->parray[i]) in mark_irreducible_loops()
344 queue1[nq++] = LOOP_REPR (loops->parray[i]); in mark_irreducible_loops()
357 loops->state |= LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS; in mark_irreducible_loops()
573 mark_loop_exit_edges (struct loops *loops) in mark_loop_exit_edges() argument
578 if (loops->num <= 1) in mark_loop_exit_edges()
|
| H A D | tree-flow.h | 803 void vectorize_loops (struct loops *);
812 void tree_ssa_lim (struct loops *);
813 unsigned int tree_ssa_unswitch_loops (struct loops *);
814 unsigned int canonicalize_induction_variables (struct loops *);
816 unsigned int tree_ssa_prefetch_arrays (struct loops *);
817 unsigned int remove_empty_loops (struct loops *);
818 void tree_ssa_iv_optimize (struct loops *);
825 void estimate_numbers_of_iterations (struct loops *);
833 void free_numbers_of_iterations_estimates (struct loops *);
859 void tree_unroll_loop (struct loops *, struct loop *, unsigned,
[all …]
|
| H A D | cfghooks.h | 115 struct loops *loops,
167 struct loops *loops,
|
| H A D | tree-loop-linear.c | 242 linear_transform_loops (struct loops *loops) in linear_transform_loops() argument
249 for (i = 1; i < loops->num; i++) in linear_transform_loops()
254 struct loop *loop_nest = loops->parray[i]; in linear_transform_loops()
322 before = gcc_loopnest_to_lambda_loopnest (loops, loop_nest, &oldivs, in linear_transform_loops()
|
| H A D | tree-scalar-evolution.h | 28 extern void scev_initialize (struct loops *loops);
|
| H A D | tree-ssa-loop-manip.c | 593 struct loops *loops, in tree_duplicate_loop_to_header_edge() argument
600 if (!(loops->state & LOOPS_HAVE_SIMPLE_LATCHES)) in tree_duplicate_loop_to_header_edge()
602 if (!(loops->state & LOOPS_HAVE_PREHEADERS)) in tree_duplicate_loop_to_header_edge()
610 if (!duplicate_loop_to_header_edge (loop, e, loops, ndupl, wont_exit, in tree_duplicate_loop_to_header_edge()
840 tree_unroll_loop (struct loops *loops, struct loop *loop, unsigned factor, in tree_unroll_loop() argument
863 new_loop = loop_version (loops, loop, enter_main_cond, NULL, true); in tree_unroll_loop()
886 (loop, loop_latch_edge (loop), loops, factor - 1, in tree_unroll_loop()
956 verify_loop_structure (loops); in tree_unroll_loop()
|
| /freebsd-12.1/contrib/sendmail/libsm/ |
| H A D | b-strl.c | 67 long loops = LOOPS;
116 for (a = 0; a < loops; a++)
127 for (a = 0; a < loops; a++)
137 loops += loops;
138 if (loops < 0L || one > MAXTIME)
145 loops);
152 loops = LOOPS;
157 for (a = 0; a < loops; a++)
168 for (a = 0; a < loops; a++)
178 loops += loops;
[all …]
|
| H A D | b-strcmp.c | 52 long loops; local
101 loops = LOOPS;
107 for (a = 0; a < loops; a++)
118 for (a = 0; a < loops; a++)
128 loops += loops;
129 if (loops < 0L || one > MAXTIME)
137 loops);
|
| /freebsd-12.1/share/examples/perfmon/ |
| H A D | perfmon.c | 54 int loops, i, sleeptime; in main() local
68 loops = 50; in main()
92 loops = getnum(optarg, 1, INT_MAX - 1); in main()
110 buf = malloc((loops + 1) * sizeof *buf); in main()
112 err(1, "malloc(%lu)", (unsigned long)(loops +1) * sizeof *buf); in main()
129 for (i = 0; i < loops; i++) { in main()
154 for (i = 1; i <= loops; i++) { in main()
158 printf("total: %f\nmean: %f\n", total, total / loops); in main()
|
| /freebsd-12.1/contrib/cortex-strings/benchmarks/multi/ |
| H A D | harness.c | 277 int loops = 10000000; in main() local
298 loops = parse_int_arg(optarg, argv[0]); in main()
366 for (int i = 0; i < loops; i++) in main()
373 for (int i = 0; i < loops; i++) in main()
396 double bounced = 0.448730 * loops / 50000000; in main()
401 count, loops, src_alignment, dst_alignment, run_id, in main()
403 elapsed, loops, ptest->name, count, in main()
404 (double)loops*count/(elapsed - bounced)/(1024*1024)); in main()
|
| /freebsd-12.1/contrib/gcc/doc/ |
| H A D | loop.texi | 21 * Loop querying:: Getting information about loops.
48 The representation of loops in GCC however allows only loops with a
71 stored in the @code{num} field of the loops structure.
95 sub-loops, and makes manipulation with the loops significantly easier.
138 the basic blocks of the sub-loops).
140 number of super-loops of the loop.
144 exactly one exit and the loops were analyzed with
165 to a loop (including its sub-loops).
219 are only reliable for the innermost loops:
318 their evolution in the outer loops is known.
[all …]
|
| /freebsd-12.1/contrib/cortex-strings/scripts/ |
| H A D | bench.py | 58 def run(cache, variant, function, bytes, loops, alignment, run_id, quiet=False): argument
60 key = ':'.join('%s' % x for x in (variant, function, bytes, loops, alignment, run_id))
113 loops = int(f / math.sqrt(max(1, mid)))
114 took = run(cache, variant, function, mid, loops, alignment, 0,
126 loops = int(f / math.sqrt(max(1, b)))
128 run(cache, variant, function, b, loops, alignment,
|
| /freebsd-12.1/contrib/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()
|
| /freebsd-12.1/contrib/ntp/lib/isc/ |
| H A D | hex.c | 55 unsigned int loops = 0; in isc_hex_totext() local
67 loops++; in isc_hex_totext()
69 (int)((loops + 1) * 2) >= wordlength) in isc_hex_totext()
71 loops = 0; in isc_hex_totext()
|
| H A D | base64.c | 57 unsigned int loops = 0; in isc_base64_totext() local
73 loops++; in isc_base64_totext()
75 (int)((loops + 1) * 4) >= wordlength) in isc_base64_totext()
77 loops = 0; in isc_base64_totext()
|