Searched refs:loop (Results 26 - 50 of 321) sorted by relevance

1234567891011>>

/freebsd-11-stable/usr.bin/what/
H A Dwhat.c118 loop: if (c != '@')
121 goto loop;
123 goto loop;
125 goto loop;
/freebsd-11-stable/contrib/gcc/
H A Dtree-ssa-loop-niter.c1 /* Functions to determine/estimate number of iterations of a loop.
129 /* Determines number of iterations of loop whose ending condition
172 /* Let nsd (step, size of mode) = d. If d does not divide c, the loop
186 /* If we cannot assume that the loop is not infinite, record the
203 of the loop with ending condition IV0 < IV1 (computed in TYPE).
277 /* Add assertions to NITER that ensure that the control variable of the loop
347 /* Add an assumption to NITER that a loop whose ending condition
405 /* Determines number of iterations of loop whose ending condition
482 otherwise the loop does not roll. */
492 /* Determines number of iterations of loop whos
907 simplify_using_initial_conditions(struct loop *loop, tree expr, tree *conds_used) argument
955 simplify_using_outer_evolutions(struct loop *loop, tree expr) argument
1008 loop_only_exit_p(struct loop *loop, edge exit) argument
1045 number_of_iterations_exit(struct loop *loop, edge exit, struct tree_niter_desc *niter, bool warn) argument
1177 find_loop_niter(struct loop *loop, edge *exit) argument
1256 chain_of_csts_start(struct loop *loop, tree x) argument
1301 get_base_for(struct loop *loop, tree x) argument
1374 loop_niter_by_eval(struct loop *loop, edge exit) argument
1471 find_loop_niter_by_eval(struct loop *loop, edge *exit) argument
1683 record_estimate(struct loop *loop, tree bound, tree additional, tree at_stmt) argument
1711 compute_estimated_nb_iterations(struct loop *loop) argument
1738 infer_loop_bounds_from_undefined(struct loop *loop) argument
1851 estimate_numbers_of_iterations_loop(struct loop *loop) argument
1896 struct loop *loop; local
2000 scev_probably_wraps_p(tree base, tree step, tree at_stmt, struct loop *loop, bool use_overflow_semantics) argument
2085 free_numbers_of_iterations_estimates_loop(struct loop *loop) argument
2106 struct loop *loop; local
2120 substitute_in_loop_info(struct loop *loop, tree name, tree val) argument
[all...]
H A Dloop-invariant.c1 /* RTL-level loop invariant motion.
21 /* This implements the loop invariant motion pass. It is very simple
24 eliminated on tree level either in tree-ssa-loop-im.c or in tree-ssa-pre.c.
26 We proceed loop by loop -- it is simpler than trying to handle things
27 globally and should not lose much. First we inspect all sets inside loop
35 Then we move the selected invariants out of the loop, creating a new
57 /* The data stored for the loop. */
61 struct loop *outermost_exit; /* The outermost exit of the loop
509 compute_always_reached(struct loop *loop, basic_block *body, bitmap may_exit, bitmap always_reached) argument
529 find_exits(struct loop *loop, basic_block *body, bitmap may_exit, bitmap has_exit) argument
611 find_defs(struct loop *loop, basic_block *body) argument
859 find_invariants_body(struct loop *loop, basic_block *body, bitmap always_reached, bitmap always_executed) argument
873 find_invariants(struct loop *loop) argument
1130 move_invariant_reg(struct loop *loop, unsigned invno) argument
1236 move_invariants(struct loop *loop) argument
1293 move_single_loop_invariants(struct loop *loop) argument
1307 free_loop_data(struct loop *loop) argument
1320 struct loop *loop; local
[all...]
H A Dloop-doloop.c41 It first validates whether the loop is well behaved and has a
43 It then modifies the loop to use a low-overhead looping pattern as
46 1. A pseudo register is allocated as the loop iteration counter.
48 2. The number of loop iterations is calculated and is stored
49 in the loop counter.
51 3. At the end of the loop, the jump insn is replaced by the
53 used elsewhere. If the loop-variable or condition register are
57 loop.
69 /* Return the loop termination condition for PATTERN or zero
89 Some targets (IA-64) wrap the set of the loop counte
156 doloop_valid_p(struct loop *loop, struct niter_desc *desc) argument
290 doloop_modify(struct loop *loop, struct niter_desc *desc, rtx doloop_seq, rtx condition, rtx count) argument
479 doloop_optimize(struct loop *loop) argument
622 struct loop *loop; local
[all...]
H A Dcfgloopanal.c1 /* Natural loop analysis code for GNU compiler.
36 just_once_each_iteration_p (const struct loop *loop, basic_block bb) argument
39 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, bb))
43 if (bb->loop_father != loop)
46 /* But this was not enough. We might have some irreducible loop here. */
259 for parts of cycles that only "pass" through some loop -- i.e. for
261 loop containing the whole cycle.
263 LOOPS is the loop tree. */
279 struct loop *cloo
362 num_loop_insns(struct loop *loop) argument
384 average_num_loop_insns(struct loop *loop) argument
419 expected_loop_iterations(const struct loop *loop) argument
468 get_loop_level(const struct loop *loop) argument
[all...]
H A Dtree-ssa-loop-prefetch.c52 1) Gathers all memory references in the single loop.
56 prefetching in the first PREFETCH_BEFORE iterations of the loop) and
58 iterations of the loop that are zero modulo PREFETCH_MOD). For example
86 the loop. The problem is that we do not know either of these values,
88 target-specific constant and size of the loop.
108 in other cache aimed loop optimizations)
325 struct loop *loop; /* Loop of the reference. */ member in struct:ar_data
346 if (!simple_iv (ar_data->loop, ar_data->stmt, *index, &iv, false))
396 analyze_ref (struct loop *loo argument
436 gather_memory_references_ref(struct loop *loop, struct mem_ref_group **refs, tree ref, bool write_p, tree stmt) argument
455 gather_memory_references(struct loop *loop) argument
877 should_unroll_loop_p(struct loop *loop, struct tree_niter_desc *desc, unsigned factor) argument
901 determine_unroll_factor(struct loop *loop, struct mem_ref_group *refs, unsigned ahead, unsigned ninsns, struct tree_niter_desc *desc) argument
956 loop_prefetch_arrays(struct loops *loops, struct loop *loop) argument
1017 struct loop *loop; local
[all...]
H A Dtree-vectorizer.h90 /* The loop to which this info struct refers to. */
91 struct loop *loop; member in struct:_loop_vec_info
93 /* The loop basic blocks. */
96 /* The loop exit_condition. */
102 /* Is the loop vectorizable? */
108 /* Unknown DRs according to which loop was peeled. */
124 /* All data references in the loop. */
127 /* All data dependences in the loop. */
130 /* Statements in the loop tha
[all...]
H A Dtree-ssa-loop-manip.c1 /* High-level loop manipulation functions.
51 create_iv (tree base, tree step, tree var, struct loop *loop, argument
58 edge pe = loop_preheader_edge (loop);
100 loop (i.e. the step should be loop invariant). */
118 stmt = create_phi_node (vb, loop->header);
120 add_phi_arg (stmt, initial, loop_preheader_edge (loop));
121 add_phi_arg (stmt, va, loop_latch_edge (loop));
131 struct loop *def_loo
505 ip_end_pos(struct loop *loop) argument
514 ip_normal_pos(struct loop *loop) argument
544 standard_iv_increment_position(struct loop *loop, block_stmt_iterator *bsi, bool *insert_after) argument
592 tree_duplicate_loop_to_header_edge(struct loop *loop, edge e, struct loops *loops, unsigned int ndupl, sbitmap wont_exit, edge orig, edge *to_remove, unsigned int *n_to_remove, int flags) argument
640 can_unroll_loop_p(struct loop *loop, unsigned factor, struct tree_niter_desc *niter) argument
687 determine_exit_conditions(struct loop *loop, struct tree_niter_desc *desc, unsigned factor, tree *enter_cond, tree *exit_base, tree *exit_step, enum tree_code *exit_cmp, tree *exit_bound) argument
840 tree_unroll_loop(struct loops *loops, struct loop *loop, unsigned factor, edge exit, struct tree_niter_desc *desc) argument
[all...]
H A Dlambda-code.c46 /* This loop nest code generation is based on non-singular matrix
50 loop transformation framework based on non-singular matrices" by Wei Li and
54 A loop iteration space represents the points traversed by the loop. A point in the
55 iteration space can be represented by a vector of size <loop depth>. You can
59 A loop iteration space is dense if every integer point between the loop
60 bounds is a point in the iteration space. Every loop with a step of 1
65 A loop iteration space is sparse if it is not dense. That is, the iteration
66 space skips integer points that are within the loop bound
298 print_lambda_loop(FILE * outfile, lambda_loop loop, int depth, int invariants, char start) argument
388 lambda_loop loop; local
490 lambda_loop loop; local
637 lambda_loop loop; local
1033 lambda_loop loop; local
1187 invariant_in_loop_and_outer_loops(struct loop *loop, tree op) argument
1210 gcc_loop_to_lambda_loop(struct loop *loop, int depth, VEC(tree,heap) ** invariants, tree * ourinductionvar, VEC(tree,heap) * outerinductionvars, VEC(tree,heap) ** lboundvars, VEC(tree,heap) ** uboundvars, VEC(int,heap) ** steps) argument
1421 find_induction_var_from_exit_cond(struct loop *loop) argument
1992 phi_loop_edge_uses_def(struct loop *loop, tree phi, tree def) argument
2021 stmt_is_bumper_for_loop(struct loop *loop, tree stmt) argument
2073 perfect_nest_p(struct loop *loop) argument
2114 replace_uses_equiv_to_x_with_y(struct loop *loop, tree stmt, tree x, int xstep, tree y, tree yinit, htab_t replacements, block_stmt_iterator *firstbsi) argument
2209 exit_phi_for_loop_p(struct loop *loop, tree stmt) argument
2249 can_put_after_inner_loop(struct loop *loop, tree stmt) argument
2280 can_convert_to_perfect_nest(struct loop *loop) argument
2442 perfect_nestify(struct loops *loops, struct loop *loop, VEC(tree,heap) *lbounds, VEC(tree,heap) *ubounds, VEC(int,heap) *steps, VEC(tree,heap) *loopivs) argument
[all...]
H A Dtree-loop-linear.c46 /* Linear loop transforms include any composition of interchange,
48 iteration order of loop nests in order to optimize data locality of
56 /* Gather statistics for loop interchange. LOOP is the loop being
57 considered. The first loop in the considered loop nest is
58 FIRST_LOOP, and consequently, the index of the considered loop is
63 carried by loop LOOP,
66 for which the loop LOOP is not carrying any dependence,
70 Example: for the following loop,
[all...]
H A Dtree-vect-analyze.c44 static loop_vec_info vect_analyze_loop_form (struct loop *);
60 static tree vect_get_loop_niters (struct loop *, tree *);
74 loop. For example, when vectorizing a loop that operates on 4byte elements,
81 in the loop.
83 VF is also the factor by which the loop iterations are strip-mined, e.g.:
84 original loop:
89 vectorized loop:
98 struct loop *loop local
231 struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); local
502 struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); local
586 struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); local
1385 struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); local
1544 struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); local
1611 struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); local
1789 struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); local
1874 vect_get_loop_niters(struct loop *loop, tree *number_of_iterations) argument
1910 vect_analyze_loop_form(struct loop *loop) argument
2034 vect_analyze_loop(struct loop *loop) argument
[all...]
H A Dtree-vect-transform.c61 static void update_vuses_to_preheader (tree, struct loop*);
65 /* Utility function dealing with loop peeling (not peeling itself). */
225 4. ONLY_INIT: indicate if vp is to be updated in the loop, or remain
244 a data-reference in the loop based on the new vector pointer vp. This
246 the loop. Return the pointer vp'.
258 struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); local
266 edge pe = loop_preheader_edge (loop);
313 the vector-pointer to point to it before the loop: **/
315 /* Create: (&(base[init_val+offset]) in the loop preheade
409 struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); local
462 struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); local
773 struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); local
1142 struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); local
1774 struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); local
2290 struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); local
2329 struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); local
2413 update_vuses_to_preheader(tree stmt, struct loop *loop) argument
2497 struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); local
2589 struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); local
2665 struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); local
2801 struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); local
2970 struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); local
[all...]
H A Dtree-flow.h255 /* Use this to terminate the FOR_EACH_IMM_USE_STMT loop early. Failure to
761 /* Description of number of iterations of a loop. All the expressions inside
762 the structure can be evaluated at the end of the loop's preheader
763 (and due to ssa form, also anywhere inside the body of the loop). */
772 the loop will exit in the first iteration (i.e.
776 a loop (provided that assumptions == true and
778 of executions of the latch of the loop. */
783 the loop). If this is a case, conjunction of such
790 the loop), then the information would be lost. */
792 /* The simplified shape of the exit condition. The loop exit
[all...]
/freebsd-11-stable/sys/arm/cavium/cns11xx/
H A Decona_machdep.c159 int loop, i; local
191 for (loop = 0; loop < NUM_KERNEL_PTS; ++loop) {
192 if (!(loop % (PAGE_SIZE / L2_TABLE_SIZE_REAL))) {
193 valloc_pages(kernel_pt_table[loop],
196 kernel_pt_table[loop].pv_va = freemempos -
197 (loop % (PAGE_SIZE / L2_TABLE_SIZE_REAL)) *
199 kernel_pt_table[loop].pv_pa =
200 kernel_pt_table[loop]
[all...]
/freebsd-11-stable/contrib/bmake/
H A Drealpath.c120 loop:
142 goto loop;
150 goto loop;
200 goto loop;
210 goto loop;
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/tsan/dd/
H A Ddd_rtl.cpp46 rep->loop[i].thr_ctx, rep->loop[i].mtx_ctx1, rep->loop[i].mtx_ctx0);
47 PrintStackTrace(thr, rep->loop[i].stk[1]);
48 if (rep->loop[i].stk[0]) {
50 rep->loop[i].mtx_ctx0);
51 PrintStackTrace(thr, rep->loop[i].stk[0]);
/freebsd-11-stable/sys/arm/xscale/i8134x/
H A Dcrb_machdep.c159 int loop, i; local
191 for (loop = 0; loop < NUM_KERNEL_PTS; ++loop) {
192 if (!(loop % (PAGE_SIZE / L2_TABLE_SIZE_REAL))) {
193 valloc_pages(kernel_pt_table[loop],
196 kernel_pt_table[loop].pv_pa = freemempos +
197 (loop % (PAGE_SIZE / L2_TABLE_SIZE_REAL)) *
199 kernel_pt_table[loop].pv_va =
200 kernel_pt_table[loop]
[all...]
/freebsd-11-stable/libexec/mknetid/
H A Dhash.c57 size_t loop; local
65 loop = (len + 8 - 1) >> 3;
92 } while (--loop);
/freebsd-11-stable/contrib/ntp/scripts/stats/
H A Dsummary.sh27 awk -f loop.awk $f >>$LOOP
30 echo "source("\""loop.S"\"")" >>$SIN
/freebsd-11-stable/contrib/bmake/unit-tests/
H A Dforloop.mk3 all: for-loop
42 for-loop:
/freebsd-11-stable/crypto/heimdal/kdc/
H A Dkdc_locl.h75 loop(krb5_context context, krb5_kdc_configuration *config);
/freebsd-11-stable/gnu/usr.bin/cc/cc_int/
H A DMakefile31 tree-vect-generic.o tree-ssa-loop.o tree-ssa-loop-niter.o \
32 tree-ssa-loop-manip.o tree-ssa-threadupdate.o tree-ssa-threadedge.o \
34 tree-vect-patterns.o tree-ssa-loop-prefetch.o \
35 tree-ssa-loop-ivcanon.o tree-ssa-propagate.o tree-ssa-address.o \
37 tree-ssa-loop-ivopts.o tree-if-conv.o tree-ssa-loop-unswitch.o \
40 cfgloopanal.o cfgloopmanip.o loop-init.o loop-unswitch.o loop
[all...]
/freebsd-11-stable/tools/tools/mwl/mwlstats/
H A Dmain.c101 loop:
121 goto loop;
/freebsd-11-stable/sys/arm/xscale/ixp425/
H A Davila_machdep.c192 int loop, i; local
246 for (loop = 0; loop < NUM_KERNEL_PTS; ++loop) {
247 if (!(loop % (PAGE_SIZE / L2_TABLE_SIZE_REAL))) {
248 valloc_pages(kernel_pt_table[loop],
251 kernel_pt_table[loop].pv_pa = freemempos +
252 (loop % (PAGE_SIZE / L2_TABLE_SIZE_REAL)) *
254 kernel_pt_table[loop].pv_va =
255 kernel_pt_table[loop]
[all...]
/freebsd-11-stable/sys/arm/xscale/pxa/
H A Dpxa_machdep.c145 int loop; local
178 for (loop = 0; loop < NUM_KERNEL_PTS; ++loop) {
179 if (!(loop % (PAGE_SIZE / L2_TABLE_SIZE_REAL))) {
180 valloc_pages(kernel_pt_table[loop],
183 kernel_pt_table[loop].pv_pa = freemempos +
184 (loop % (PAGE_SIZE / L2_TABLE_SIZE_REAL)) *
186 kernel_pt_table[loop].pv_va =
187 kernel_pt_table[loop]
[all...]

Completed in 246 milliseconds

1234567891011>>