Searched refs:loop (Results 201 - 225 of 632) sorted by relevance

1234567891011>>

/haiku-buildtools/gcc/gcc/
H A Dpredict.c92 #include "tree-ssa-loop-niter.h"
93 #include "tree-ssa-loop.h"
363 optimize_loop_for_size_p (struct loop *loop) argument
365 return optimize_bb_for_size_p (loop->header);
371 optimize_loop_for_speed_p (struct loop *loop) argument
373 return optimize_bb_for_speed_p (loop->header);
379 optimize_loop_nest_for_speed_p (struct loop *loop) argument
407 optimize_loop_nest_for_size_p(struct loop *loop) argument
1082 is_comparison_with_loop_invariant_p(gcond *stmt, struct loop *loop, tree *loop_invariant, enum tree_code *compare_code, tree *loop_step, tree *loop_iv_base) argument
1226 predict_iv_comparison(struct loop *loop, basic_block bb, tree loop_bound_var, tree loop_iv_base_var, enum tree_code loop_bound_code, int loop_bound_step) argument
1484 struct loop *loop; local
2650 struct loop *loop; local
[all...]
H A Dtree-data-ref.h30 reference in the innermost enclosing loop. The address is expressed as
32 pointer (BASE_ADDRESS), loop invariant offset (OFFSET) and
33 constant offset (INIT). Examples, in loop nest
64 BASE_OBJECT is the part of the reference that is loop-invariant
123 /* Behavior of the memory reference in the innermost loop. */
244 /* The analyzed loop nest. */
253 /* An index in loop_nest for the innermost loop that varies for
281 the loop nest. */
300 bool dr_analyze_innermost (struct data_reference *, struct loop *);
301 extern bool compute_data_dependences_for_loop (struct loop *, boo
[all...]
H A Dtree-chrec.c53 #include "tree-ssa-loop-ivopts.h"
54 #include "tree-ssa-loop-niter.h"
118 struct loop *loop0 = get_chrec_loop (poly0);
119 struct loop *loop1 = get_chrec_loop (poly1);
169 do not belong to the same loop nest. */
206 struct loop *loop0 = get_chrec_loop (poly0);
207 struct loop *loop1 = get_chrec_loop (poly1);
558 struct loop *var_loop = get_loop (cfun, var);
607 /* When the symbols are defined in an outer loop, it is possible
609 constants with respect to the varying loop
729 struct loop *loop = get_loop (cfun, loop_num), *chloop; local
770 struct loop *loop = get_loop (cfun, loop_num), *chloop; local
852 struct loop *loop = get_loop (cfun, loop_num); local
1192 convert_affine_scev(struct loop *loop, tree type, tree *base, tree *step, gimple at_stmt, bool use_overflow_semantics) argument
1350 struct loop *loop; local
[all...]
H A Dtree-ssa-loop-ivopts.c20 /* This pass tries to find the optimal set of induction variables for the loop.
59 All of this is done loop by loop. Doing it globally is theoretically
108 #include "tree-ssa-loop-ivopts.h"
109 #include "tree-ssa-loop-manip.h"
110 #include "tree-ssa-loop-niter.h"
111 #include "tree-ssa-loop.h"
153 /* Returns the expected number of loop iterations for LOOP.
158 avg_loop_niter (struct loop *loop) argument
496 single_dom_exit(struct loop *loop) argument
694 stmt_after_ip_normal_pos(struct loop *loop, gimple stmt) argument
735 stmt_after_increment(struct loop *loop, struct iv_cand *cand, gimple stmt) argument
1071 struct loop *loop = gimple_bb (phi)->loop_father; local
1119 struct loop *loop = data->current_loop; local
1171 struct loop *loop = data->current_loop; local
1213 struct loop *loop = data->current_loop; local
1277 struct loop *loop = data->current_loop; local
1521 outermost_invariant_loop_for_expr(struct loop *loop, tree expr) argument
1568 expr_invariant_in_loop_p(struct loop *loop, tree expr) argument
1617 struct loop *loop = dta->ivopts_data->current_loop; local
2482 allow_ip_end_pos_p(struct loop *loop) argument
3041 var_at_stmt(struct loop *loop, struct iv_cand *cand, gimple stmt) argument
3090 get_computation_aff(struct loop *loop, struct iv_use *use, struct iv_cand *cand, gimple at, struct aff_tree *aff) argument
3187 get_computation_at(struct loop *loop, struct iv_use *use, struct iv_cand *cand, gimple at) argument
3203 get_computation(struct loop *loop, struct iv_use *use, struct iv_cand *cand) argument
4455 cand_value_at(struct loop *loop, struct iv_cand *cand, gimple at, tree niter, aff_tree *val) argument
4513 struct loop *loop = data->current_loop; local
4739 struct loop *loop = data->current_loop; local
5245 struct loop *loop = data->current_loop; local
6983 tree_ssa_iv_optimize_loop(struct ivopts_data *data, struct loop *loop) argument
7071 struct loop *loop; local
[all...]
H A Dtree-data-ref.c21 /* This pass walks a given loop structure searching for array
35 information allows a loop parallelization),
42 - loop carried level dependence
120 #include "tree-ssa-loop-niter.h"
121 #include "tree-ssa-loop.h"
161 struct loop *);
468 struct loop *loopi;
479 fprintf (outf, " inner loop index: %d\n", DDR_INNER_LOOP (ddr));
480 fprintf (outf, " loop nest: (");
785 /* Analyzes the behavior of the memory reference DR in the innermost loop o
792 struct loop *loop = loop_containing_stmt (stmt); local
918 dr_analyze_indices(struct data_reference *dr, loop_p nest, loop_p loop) argument
1088 create_data_ref(loop_p nest, loop_p loop, tree memref, gimple stmt, bool is_read) argument
1387 object_address_invariant_in_loop_p(const struct loop *loop, const_tree obj) argument
1840 max_stmt_executions_tree(struct loop *loop) argument
1993 struct loop *loop = get_chrec_loop (chrec_b); local
2073 struct loop *loop = get_chrec_loop (chrec_b); local
4435 struct loop *loop = gimple_bb (stmt)->loop_father; local
4566 graphite_find_data_references_in_stmt(loop_p nest, loop_p loop, gimple stmt, vec<data_reference_p> *datarefs) argument
4594 find_data_references_in_bb(struct loop *loop, basic_block bb, vec<data_reference_p> *datarefs) argument
4624 find_data_references_in_loop(struct loop *loop, vec<data_reference_p> *datarefs) argument
4650 find_loop_nest_1(struct loop *loop, vec<loop_p> *loop_nest) argument
4681 find_loop_nest(struct loop *loop, vec<loop_p> *loop_nest) argument
4697 compute_data_dependences_for_loop(struct loop *loop, bool compute_self_and_read_read_dependences, vec<loop_p> *loop_nest, vec<data_reference_p> *datarefs, vec<ddr_p> *dependence_relations) argument
4809 analyze_all_data_dependences(struct loop *loop) argument
[all...]
/haiku-buildtools/gcc/mpfr/src/
H A Dexp3.c73 log2_nb_terms[0] = 0; /* log2(#terms) [exact in 1st loop where 2^k] */
161 int i, k, loop; local
205 /* Main loop */
227 for (loop = 0; loop < shift; loop++)
254 for (loop = 0; loop < shift_x - 1; loop++)
H A Datan2.c55 MPFR_ZIV_DECL (loop);
187 MPFR_ZIV_INIT (loop, prec);
240 MPFR_ZIV_NEXT (loop, prec);
268 MPFR_ZIV_NEXT (loop, prec);
277 MPFR_ZIV_FREE (loop);
H A Dlngamma.c98 differ, at some point of Ziv's loop they should agree. */
173 MPFR_ZIV_DECL (loop);
193 MPFR_ZIV_DECL (loop);
195 MPFR_ZIV_INIT (loop, prec);
241 MPFR_ZIV_FREE (loop);
251 MPFR_ZIV_NEXT (loop, prec);
254 MPFR_ZIV_FREE (loop);
276 MPFR_ZIV_INIT (loop, w);
359 MPFR_ZIV_NEXT (loop, w);
361 MPFR_ZIV_FREE (loop);
[all...]
H A Dgmp_op.c256 MPFR_ZIV_DECL (loop);
294 MPFR_ZIV_INIT (loop, p);
326 MPFR_ZIV_NEXT (loop, p);
330 MPFR_ZIV_FREE (loop);
346 MPFR_ZIV_DECL (loop);
389 MPFR_ZIV_INIT (loop, p);
422 MPFR_ZIV_NEXT (loop, p);
426 MPFR_ZIV_FREE (loop);
H A Dzeta.c151 MPFR_ZIV_DECL (loop);
193 MPFR_ZIV_INIT (loop, d);
196 /* Principal loop: we compute, in z_pre,
278 MPFR_ZIV_NEXT (loop, d);
280 MPFR_ZIV_FREE (loop);
299 MPFR_ZIV_DECL (loop);
420 MPFR_ZIV_INIT (loop, prec1);
450 MPFR_ZIV_NEXT (loop, prec1);
453 MPFR_ZIV_FREE (loop);
/haiku-buildtools/gcc/libsanitizer/sanitizer_common/
H A Dsanitizer_deadlock_detector1.cc137 rep->loop[i].thr_ctx = unique_tid;
138 rep->loop[i].mtx_ctx0 = m0->ctx;
139 rep->loop[i].mtx_ctx1 = m1->ctx;
140 rep->loop[i].stk[0] = stk_to;
141 rep->loop[i].stk[1] = stk_from;
/haiku-buildtools/gcc/libgomp/testsuite/libgomp.oacc-c-c++-common/
H A Ddata-2.c29 #pragma acc loop
53 #pragma acc loop
80 #pragma acc loop
85 #pragma acc loop
90 #pragma acc loop
H A Ddata-3.c29 #pragma acc loop
53 #pragma acc loop
82 #pragma acc loop
87 #pragma acc loop
92 #pragma acc loop
/haiku-buildtools/gcc/gmp/mpn/x86/k6/
H A Ddivrem_1.asm33 C The code here is basically the same as mpn/x86/divrem_1.asm, but uses loop
41 C Back-to-back div instructions run at 20 cycles, the same as the loop here,
42 C so it seems there's nothing to gain by rearranging the loop. Pairing the
43 C mov and loop instructions was found to gain nothing.
142 loop L(integer_top)
166 loop L(fraction_top)
H A Dmod_34lsub1.asm28 C An attempt was made to use a loop like
35 C loop L(top)
40 C In the code used, putting the "leal"s at the top of the loop is necessary
41 C for the claimed speed, anywhere else costs an extra cycle per loop.
42 C Perhaps a tight loop like this needs short decode instructions at the
43 C branch target, which would explain the leal/loop form above taking 8
H A Daorsmul_1.asm48 dnl Unrolling to 16 limbs/loop makes the unrolled loop fit exactly in a 256
77 C The jadcl0()s in the unrolled loop makes the speed data dependent. Small
89 C In the simple loop, jadcl0() measures slower than adcl (11.9-14.7 versus
92 C In the simple loop, note that running ecx from negative to zero and using
94 C instruction (2*addl+loop becoming incl+jnz), but there's nothing unpaired
97 C Attempts at a simpler main loop, with less unrolling, haven't yielded much
108 C The code in the unrolled loop decodes something like the following.
197 C simple loop
225 loop
[all...]
/haiku-buildtools/gcc/gmp/mpn/x86/pentium4/
H A Dcopyd.asm24 dnl We therefore use an open-coded 2 c/l copying loop.
51 L(loop):
56 jns L(loop)
H A Dcopyi.asm25 dnl loop for smaller sizes.
54 L(loop):
61 jnz L(loop)
/haiku-buildtools/binutils/gas/testsuite/gas/bfin/
H A Dflow.s53 loop first_loop lc0;
85 loop my_loop lc1;
/haiku-buildtools/gcc/gmp/mpn/powerpc32/
H A Daddlsh1_n.asm57 bdz L(end) C If done, skip loop
59 L(loop):
76 bdnz L(loop) C decrement ctr and loop back
H A Dsublsh1_n.asm56 bdz L(end) C If done, skip loop
58 L(loop):
75 bdnz L(loop) C decrement ctr and loop back
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/bfin/
H A Dflow.s53 loop first_loop lc0;
85 loop my_loop lc1;
/haiku-buildtools/legacy/gcc/gcc/config/rs6000/
H A Dntstack.asm36 bdnz+ .Lloop # and loop back
/haiku-buildtools/binutils/gas/testsuite/gas/i386/
H A Dmpx-add-bnd-prefix.d23 [ ]*[a-f0-9]+: e2 f2 loop 14 <foo>
H A Dx86-64-mpx-add-bnd-prefix.d23 [ ]*[a-f0-9]+: e2 f1 loop 14 <foo>

Completed in 217 milliseconds

1234567891011>>