Searched refs:step (Results 151 - 175 of 198) sorted by last modified time

12345678

/freebsd-11-stable/contrib/gcc/
H A Dloop-unroll.c79 rtx step; /* Step of the induction variable. */ member in struct:iv_to_split
1677 if (iv.step == const0_rtx
1685 ivts->step = iv.step;
1861 by base variable + DELTA * step. */
1870 /* Construct base + DELTA * step. */
1876 ivts->step, gen_int_mode (delta, mode));
H A Dloop-unswitch.c210 if (iv.step != const0_rtx
H A Dmodulo-sched.c1310 6. start = Early_start; end = Early_start + II - 1; step = 1
1313 13. start = Late_start; end = Late_start - II + 1; step = -1
1319 19. step = 1
1321 21. start = ASAP(u); end = start + II - 1; step = 1
1325 24. for (c = start ; c != end ; c += step)
1365 int start, step, end;
1376 /* 1. compute sched window for u (start, end, step). */
1403 step = 1;
1425 step = -1;
1463 step
1362 int start, step, end; local
1491 int start, end, step; /* Place together into one struct? */ local
[all...]
H A Domp-low.c101 tree v, n1, n2, step, chunk_size, for_stmt; member in struct:omp_for_data
197 fd->step = TREE_OPERAND (t, 1);
200 fd->step = TREE_OPERAND (t, 1);
201 fd->step = fold_build1 (NEGATE_EXPR, TREE_TYPE (fd->step), fd->step);
306 || !is_gimple_min_invariant (fd.step)
337 t = fold_convert (long_integer_type_node, fd.step);
2647 t = fold_convert (long_integer_type_node, fd->step);
2693 t = build2 (PLUS_EXPR, type, fd->v, fd->step);
4016 HOST_WIDE_INT step = TREE_INT_CST_LOW (fd->step); local
[all...]
H A Dsys-protos.h1071 extern int step(const char *, const char *);
H A Dtree-chrec.c1130 tree *base, tree *step, tree at_stmt,
1133 tree ct = TREE_TYPE (*step);
1193 && scev_probably_wraps_p (*base, *step, at_stmt, loop,
1199 /* The step must be sign extended, regardless of the signedness
1205 new_step = *step;
1222 *step = new_step;
1275 tree base, step;
1290 step = CHREC_RIGHT (chrec);
1292 if (convert_affine_scev (loop, type, &base, &step, at_stmt,
1294 return build_polynomial_chrec (loop->num, base, step);
1125 convert_affine_scev(struct loop *loop, tree type, tree *base, tree *step, tree at_stmt, bool use_overflow_semantics) argument
1270 tree base, step; local
1384 tree step; local
[all...]
H A Dtree-data-ref.c910 tree init, step;
913 step = evolution_part_in_loop_num (access_fn, loop->num);
926 && step != NULL_TREE
928 && TREE_CODE (step) == INTEGER_CST)
930 tree i_plus_s = fold_build2 (PLUS_EXPR, integer_type_node, init, step);
936 data_size, init), step);
938 /* When the step is negative, as in PR23386: (init = 3, step =
940 estimation as ceil_div (init, 0 - step) + 1. */
947 integer_zero_node, step)),
908 tree init, step; local
1062 tree base_address = NULL_TREE, evolution, step = NULL_TREE; local
1122 init_data_ref(tree stmt, tree ref, tree base, tree access_fn, bool is_read, tree base_address, tree init_offset, tree step, tree misalign, tree memtag, struct ptr_info_def *ptr_info, enum data_ref_type type) argument
1228 analyze_offset_expr(tree expr, struct loop *loop, tree *initial_offset, tree *misalign, tree *aligned_to, tree *step) argument
1436 address_analysis(tree expr, tree stmt, bool is_read, struct data_reference *dr, tree *offset, tree *misalign, tree *aligned_to, tree *step) argument
1595 object_analysis(tree memref, tree stmt, bool is_read, struct data_reference **dr, tree *offset, tree *misalign, tree *aligned_to, tree *step, tree *memtag, struct ptr_info_def **ptr_info, subvar_t *subvars) argument
1958 tree base_address, offset, step, misalign, memtag; local
[all...]
H A Dtree-data-ref.h28 in the loop, and step is the stride of data-ref in the loop in bytes;
38 step D_j 4
51 tree step; member in struct:first_location_in_loop
127 #define DR_STEP(DR) (DR)->first_location.step
H A Dtree-flow.h755 tree base, step; member in struct:__anon1380
794 LT_EXPR, or GT_EXPR, and step of CONTROL is positive if CMP is
1000 tree symbol, base, index, step, offset; member in struct:mem_address
H A Dtree-scalar-evolution.c36 when entering in the loop_1 and has a step 2 in this loop, in other
778 condition INIT, and a step EXPR. In order to show this, we start
2793 its base and step in IV if possible. If ALLOW_NONCONSTANT_STEP is true, we
2794 want step to be invariant in LOOP. Otherwise we require it to be an
2807 iv->step = NULL_TREE;
2832 iv->step = CHREC_RIGHT (ev);
2835 if (tree_contains_chrecs (iv->step, NULL)
2836 || chrec_contains_symbols_defined_in_loop (iv->step, loop->num))
2839 else if (TREE_CODE (iv->step) != INTEGER_CST)
H A Dtree-ssa-address.c76 rtx * GTY ((skip)) step_p; /* The point in template where the step should be
95 STEP and OFFSET to *ADDR. Stores pointers to where step is placed to
99 gen_addr_rtx (rtx symbol, rtx base, rtx index, rtx step, rtx offset, argument
113 if (step)
115 act_elem = gen_rtx_MULT (Pmode, act_elem, step);
180 if (addr->step && !integer_onep (addr->step))
181 st = immed_double_const (TREE_INT_CST_LOW (addr->step),
182 TREE_INT_CST_HIGH (addr->step), Pmode);
248 tree step local
[all...]
H A Dtree-ssa-loop-im.c794 /* If REF is an array reference, check also that the step and the lower
798 tree step = array_ref_element_size (ref); local
801 max_loop = outermost_invariant_loop_expr (step, loop);
865 tree step = array_ref_element_size (ref); local
868 force_move_till_expr (step, fmt_data->orig_loop, fmt_data->loop);
H A Dtree-ssa-loop-ivopts.c106 tree step; /* Step of the iv (constant only). */ member in struct:iv
187 bitmap depends_on; /* The list of invariants that are used in step of the
380 if (iv->step)
386 fprintf (file, " step ");
387 print_generic_expr (file, iv->step, TDF_SLIM);
886 /* Allocates an induction variable with given initial value BASE and step STEP
890 alloc_iv (tree base, tree step) argument
894 if (step && integer_zerop (step))
895 step
911 set_iv(struct ivopts_data *data, tree iv, tree base, tree step) argument
965 tree phi, step, type, base; local
1344 tree step, iv_base, iv_step, lbound, off; local
1507 tree base = *op_p, step = NULL; local
1791 tree op0 = NULL_TREE, op1 = NULL_TREE, tmp, step; local
1976 add_candidate_1(struct ivopts_data *data, tree base, tree step, bool important, enum iv_position pos, struct iv_use *use, tree incremented_at) argument
2107 add_candidate(struct ivopts_data *data, tree base, tree step, bool important, struct iv_use *use) argument
4093 tree step = iv->step, period, type; local
5374 tree step, ctype, utype; local
[all...]
H A Dtree-ssa-loop-manip.c51 create_iv (tree base, tree step, tree var, struct loop *loop, argument
75 if (TREE_CODE (step) == INTEGER_CST)
77 if (TYPE_UNSIGNED (TREE_TYPE (step)))
79 step1 = fold_build1 (NEGATE_EXPR, TREE_TYPE (step), step);
80 if (tree_int_cst_lt (step1, step))
83 step = step1;
90 if (!tree_expr_nonnegative_warnv_p (step, &ovf)
91 && may_negate_without_overflow_p (step))
94 step
694 tree step = desc->control.step; local
[all...]
H A Dtree-ssa-loop-niter.c149 if (tree_int_cst_sign_bit (iv->step))
152 fold_build1 (NEGATE_EXPR, type, iv->step));
159 s = fold_convert (niter_type, iv->step);
165 /* First the trivial cases -- when the step is 1. */
172 /* Let nsd (step, size of mode) = d. If d does not divide c, the loop
205 of the step. The assumptions necessary to ensure that the computation
213 tree *delta, tree step)
215 tree niter_type = TREE_TYPE (step);
216 tree mod = fold_build2 (FLOOR_MOD_EXPR, niter_type, *delta, step);
223 mod = fold_build2 (MINUS_EXPR, niter_type, step, mo
211 number_of_iterations_lt_to_ne(tree type, affine_iv *iv0, affine_iv *iv1, struct tree_niter_desc *niter, tree *delta, tree step) argument
283 assert_no_overflow_lt(tree type, affine_iv *iv0, affine_iv *iv1, struct tree_niter_desc *niter, tree step) argument
415 tree delta, step, s; local
1782 tree init, step, diff, estimation; local
2000 scev_probably_wraps_p(tree base, tree step, tree at_stmt, struct loop *loop, bool use_overflow_semantics) argument
[all...]
H A Dtree-ssa-loop-prefetch.c179 HOST_WIDE_INT step; /* Step of the reference. */ member in struct:mem_ref_group
216 fprintf (file, ", step ");
217 fprintf (file, HOST_WIDE_INT_PRINT_DEC, ref->group->step);
234 HOST_WIDE_INT step)
240 if ((*groups)->step == step
244 /* Keep the list of groups sorted by decreasing step. */
245 if ((*groups)->step < step)
251 group->step
233 find_or_create_group(struct mem_ref_group **groups, tree base, HOST_WIDE_INT step) argument
327 HOST_WIDE_INT *step; /* Step of the memory reference. */ member in struct:ar_data
338 tree ibase, step, stepsize; local
396 analyze_ref(struct loop *loop, tree *ref_p, tree *base, HOST_WIDE_INT *step, HOST_WIDE_INT *delta, tree stmt) argument
440 HOST_WIDE_INT step, delta; local
497 HOST_WIDE_INT step = ref->group->step; local
543 HOST_WIDE_INT step = ref->group->step; local
[all...]
H A Dtree-vect-analyze.c1324 tree step = DR_STEP (dr); local
1327 if (!step || tree_int_cst_compare (step, TYPE_SIZE_UNIT (scalar_type)))
1342 simple step 1 (consecutive) access.
1378 4- vect_analyze_drs_access(): check that ref_stmt.step is ok.
H A Dtree-vectorizer.c287 step 1. For each loop-header-phi:
291 step 2. For each loop-header-phi:
295 step 3. Update the phis in the successor block of NEW_LOOP.
320 /* step 1. */
324 /* step 2. */
340 /* step 3 (case 1). */
778 tree step = build_int_cst (TREE_TYPE (niters), 1);
788 create_iv (init, step, NULL_TREE, loop,
1982 considered a polynomial evolution with constant step. */
1986 tree * step)
777 tree step = build_int_cst (TREE_TYPE (niters), 1); local
1984 vect_is_simple_iv_evolution(unsigned loop_nb, tree access_fn, tree * init, tree * step) argument
[all...]
H A Dtree-vrp.c2478 tree init, step, chrec, tmin, tmax, min, max, type; local
2491 step = evolution_part_in_loop_num (chrec, loop->num);
2497 if (step == NULL_TREE
2498 || !is_gimple_min_invariant (step)
2507 || scev_probably_wraps_p (init, step, stmt,
2611 tree chrec, init, step; local
2625 step = evolution_part_in_loop_num (chrec, l->num);
2627 if (step == NULL_TREE
2628 || !is_gimple_min_invariant (step)
2635 if (scev_probably_wraps_p (init, step, stm
[all...]
H A Dcfgloop.h269 delta + mult * extend_{extend_mode} (subreg_{mode} (base + i * step)).
275 subreg_{mode} (base + i * step)
285 /* Its base and step (mode of base and step is supposed to be extend_mode,
287 rtx base, step; member in struct:rtx_iv
H A Dcgraphunit.c589 tree step; local
617 for (step = DECL_STRUCT_FUNCTION (body)->unexpanded_var_list;
618 step;
619 step = TREE_CHAIN (step))
621 tree decl = TREE_VALUE (step);
/freebsd-11-stable/contrib/gcc/config/sparc/
H A Dlb1spc.asm168 ! as our usual N-at-a-shot divide step will cause overflow and havoc.
202 ! %o5 > %o3: went too far: back up 1 step
208 ! first divide step without thinking. BUT, the others are conditional,
210 ! order bit set in the first step, just falling into the regular
515 ! as our usual N-at-a-shot divide step will cause overflow and havoc.
549 ! %o5 > %o3: went too far: back up 1 step
555 ! first divide step without thinking. BUT, the others are conditional,
557 ! order bit set in the first step, just falling into the regular
/freebsd-11-stable/contrib/gcc/config/rs6000/
H A Drs6000.c2189 vspltis_constant (rtx op, unsigned step, unsigned copies)
2223 && (splat_val >= 0 || (step == 1 && copies == 1)))
2234 if (((i + 1) & (step - 1)) == 0)
2253 unsigned step, copies;
2261 step = GET_MODE_NUNITS (mode) / 4;
2264 if (vspltis_constant (op, step, copies))
2268 if (step == 1)
2271 step >>= 1;
2273 if (vspltis_constant (op, step, copies))
2277 if (step
2181 vspltis_constant(rtx op, unsigned step, unsigned copies) argument
2245 unsigned step, copies; local
2289 unsigned step = nunits / 4; local
[all...]
/freebsd-11-stable/contrib/gcc/config/arm/
H A Dlib1funcs.asm1066 @ If r2 is negative at this point the following step would OR
/freebsd-11-stable/lib/libthread_db/arch/aarch64/
H A Dlibpthread_md.c92 pt_reg_sstep(struct reg *reg __unused, int step __unused)

Completed in 435 milliseconds

12345678