| /haiku-buildtools/isl/ |
| H A D | isl_transitive_closure.c | 1460 isl_map *step; local
|
| /haiku-buildtools/gcc/gcc/ |
| H A D | loop-iv.c | 2373 rtx op0, op1, delta, step, bound, may_xform, tmp, tmp0, tmp1; local
[all...] |
| H A D | tree-ssa-loop-manip.c | 87 create_iv (tree base, tree step, tree var, struct loop *loop, argument
857 tree step = desc->control.step; local
[all...] |
| H A D | tree-ssa-loop-prefetch.c | 269 tree step; /* Step of the reference. */ member in struct:mem_ref_group
324 dump_mem_details (FILE *file, tree base, tree step, argument
359 find_or_create_group (struct mem_ref_group **groups, tree base, tree step) argument
457 tree *step; /* Step of the memory reference. */ member in struct:ar_data
468 tree ibase, step, stepsize; local
520 analyze_ref(struct loop *loop, tree *ref_p, tree *base, tree *step, HOST_WIDE_INT *delta, gimple stmt) argument
572 tree base, step; local
701 HOST_WIDE_INT step; local
757 is_miss_rate_acceptable(unsigned HOST_WIDE_INT cache_line_size, HOST_WIDE_INT step, HOST_WIDE_INT delta, unsigned HOST_WIDE_INT distinct_iters, int align_unit) argument
803 HOST_WIDE_INT step; local
1481 tree step; local
[all...] |
| H A D | tree-vect-loop-manip.c | 695 tree step = build_int_cst (TREE_TYPE (niters), 1); local
|
| H A D | tree-predcom.c | 643 tree ref = DR_REF (a), step local
685 aff_tree diff, baseb, step; local
1104 aff_tree diff, base, step; local
[all...] |
| H A D | predict.c | 1091 tree step; local
[all...] |
| H A D | tree-ssa-loop-im.c | 1366 tree step = TREE_OPERAND (ref, 3); local
1423 tree step = TREE_OPERAND (ref, 3); local
|
| H A D | tree-ssa-loop-niter.c | 823 number_of_iterations_lt_to_ne(tree type, affine_iv *iv0, affine_iv *iv1, struct tree_niter_desc *niter, tree *delta, tree step, bool exit_must_be_taken, bounds *bnds) argument
942 assert_no_overflow_lt(tree type, affine_iv *iv0, affine_iv *iv1, struct tree_niter_desc *niter, tree step) argument
1143 tree delta, step, s; local
2754 record_nonwrapping_iv(struct loop *loop, tree base, tree step, gimple stmt, tree low, tree high, bool realistic, bool upper) argument
2837 tree ev, init, step; local
2982 tree def, base, step, scev, type, low, high; local
3040 tree def, base, step, scev, type, low, high; local
3791 scev_probably_wraps_p(tree base, tree step, gimple at_stmt, struct loop *loop, bool use_overflow_semantics) argument
[all...] |
| H A D | modulo-sched.c | 937 set_must_precede_follow(sbitmap *tmp_follow, sbitmap must_follow, sbitmap *tmp_precede, sbitmap must_precede, int c, int start, int end, int step) argument
969 int start, end, step; local
1904 int start, step, end; local
2068 calculate_must_precede_follow(ddg_node_ptr u_node, int start, int end, int step, int ii, sbitmap sched_nodes, sbitmap must_precede, sbitmap must_follow) argument
2188 int start, end, step; /* Place together into one struct? */ local
[all...] |
| H A D | tree-vect-loop.c | 655 tree init, step; local
592 vect_is_simple_iv_evolution(unsigned loop_nb, tree access_fn, tree * init, tree * step) argument
[all...] |
| H A D | tree-vect-stmts.c | 2744 tree step = STMT_VINFO_SIMD_CLONE_INFO (stmt_info)[i * 2 + 2]; local
[all...] |
| H A D | rtlanal.c | 5792 rtx *step = &XEXP (plus, 1); local
|
| H A D | tree-data-ref.c | 799 tree init, dinit, step; local
2926 tree step; local
[all...] |
| H A D | tree-vect-data-refs.c | 683 tree step = DR_STEP (dr); local
711 tree step = DR_STEP (dr); local
2030 tree step = DR_STEP (dr); local
2294 tree step = DR_STEP (dr); local
2606 HOST_WIDE_INT step = tree_to_shwi (DR_STEP (dra)); local
3413 tree step = TREE_OPERAND (off, 1); local
3938 tree step = TYPE_SIZE_UNIT (TREE_TYPE (DR_REF (dr))); local
4100 tree step; local
[all...] |
| H A D | tree-ssa-loop-ivopts.c | 172 tree step; /* Step of the iv (constant only). */ member in struct:iv
996 alloc_iv (tree base, tree step) argument
1030 set_iv(struct ivopts_data *data, tree iv, tree base, tree step) argument
1117 tree step, type, base, stop; local
1608 tree step; member in struct:ifs_ivopts_data
1616 tree step, iv_base, iv_step, lbound, off; local
1772 may_be_unaligned_p(tree ref, tree step) argument
1845 tree base = *op_p, step = size_zero_node; local
2144 tree op0 = NULL_TREE, op1 = NULL_TREE, tmp, step; local
2366 add_candidate_1(struct ivopts_data *data, tree base, tree step, bool important, enum iv_position pos, struct iv_use *use, gimple incremented_at) argument
2497 add_autoinc_candidates(struct ivopts_data *data, tree base, tree step, bool important, struct iv_use *use) argument
2556 add_candidate(struct ivopts_data *data, tree base, tree step, bool important, struct iv_use *use) argument
4458 aff_tree step, delta, nit; local
4485 tree step = iv->step, period, type; local
4642 HOST_WIDE_INT step; local
[all...] |
| H A D | gimplify.c | 7378 tree step = TREE_OPERAND (t, 1); local
|
| /haiku-buildtools/gcc/gcc/fortran/ |
| H A D | expr.c | 1346 gfc_expr *step; local
|
| H A D | openmp.c | 1015 gfc_expr *step = NULL; local
|
| H A D | trans-stmt.c | 55 tree step; member in struct:iter_info
1828 gfc_trans_simple_do(gfc_code * code, stmtblock_t *pblock, tree dovar, tree from, tree to, tree step, tree exit_cond) argument
1980 tree step; local
3178 tree var, start, end, step; local
4081 tree *step; local
[all...] |
| H A D | trans-openmp.c | 3120 tree dovar, stmt, from, to, step, type, init, cond, incr; local
[all...] |
| H A D | resolve.c | 14224 gfc_expr *e, *start, *end, *step; local
[all...] |
| H A D | trans-array.c | 1227 gfc_get_iteration_count (tree start, tree end, tree step) argument
1549 tree step = NULL_TREE; local
[all...] |
| /haiku-buildtools/gcc/gmp/tune/ |
| H A D | tuneup.c | 220 int step; /* how much to step absolutely */ member in struct:param_t
693 mp_size_t step; local
[all...] |
| /haiku-buildtools/gcc/gcc/config/mcore/ |
| H A D | mcore.c | 1717 int step; local
[all...] |