Searched refs:idx_find_step (Results 1 – 9 of 9) sorted by relevance
2029 idx_find_step (tree base, tree *idx, void *data) in idx_find_step() function2367 if (!for_each_index (&base, idx_find_step, &ifs_ivopts_data) in find_interesting_uses_address()
237 (idx_find_step): Use zero as a step of an invariant. Modify12246 * tree-ssa-loop-ivopts.c (idx_find_step): Use convert_affine_scev13549 * tree-ssa-loop-ivopts.c (idx_find_step): Mark source of the
3910 (idx_find_step): Replace uses of EXEC_BINARY with calls to11217 (idx_find_step): Handle step and lower bound for ARRAY_REFs. Handle12574 (idx_find_step): Handle nonconstant array_ref_element_size and14854 * tree-ssa-loop-ivopts.c (determine_biv_step, idx_find_step,
8957 * tree-ssa-loop-ivopts.c (idx_find_step): Add a fixme note.15702 * tree-ssa-loop-ivopts.c (idx_find_step): Update the use of16307 * tree-ssa-loo-ivopts.c (idx_find_step): Use sizetype
15162 * tree-ssa-loop-ivopts.c (idx_find_step): Likewise.20774 * tree-ssa-loop-ivopts.c (idx_find_step): Ditto.22836 * tree-ssa-loop-ivopts.c (idx_find_step): Likewise.
16182 (idx_find_step): Call new functions above.30183 (idx_find_step): Use no_overflow information for conversion.
3982 (idx_find_step): Likewise.
18548 (idx_find_step): Cast according to the coding conventions.
22565 (idx_find_step): Same.