/haiku-buildtools/gcc/gcc/ |
H A D | tree-scalar-evolution.c | 644 gimple at_stmt) 676 to_add = chrec_convert (type, to_add, at_stmt); 677 right = chrec_convert_rhs (type, right, at_stmt); 687 to_add, at_stmt); 689 right = chrec_convert_rhs (chrec_type (left), right, at_stmt); 700 right = chrec_convert_rhs (chrec_type (left), to_add, at_stmt); 841 tree to_add, gimple at_stmt) 871 res = add_to_evolution_1 (loop_nb, chrec_before, to_add, at_stmt); 939 follow_ssa_edge_binary (struct loop *loop, gimple at_stmt, 966 chrec_convert (type, evol, at_stmt), 642 add_to_evolution_1(unsigned loop_nb, tree chrec_before, tree to_add, gimple at_stmt) argument 839 add_to_evolution(unsigned loop_nb, tree chrec_before, enum tree_code code, tree to_add, gimple at_stmt) argument 936 follow_ssa_edge_binary(struct loop *loop, gimple at_stmt, tree type, tree rhs0, enum tree_code code, tree rhs1, gphi *halting_phi, tree *evolution_of_loop, int limit) argument 1071 follow_ssa_edge_expr(struct loop *loop, gimple at_stmt, tree expr, gphi *halting_phi, tree *evolution_of_loop, int limit) argument 1724 interpret_rhs_expr(struct loop *loop, gimple at_stmt, tree type, tree rhs1, enum tree_code code, tree rhs2) argument 1949 interpret_expr(struct loop *loop, gimple at_stmt, tree expr) argument [all...] |
H A D | tree-chrec.c | 1196 tree *base, tree *step, gimple at_stmt, 1256 && scev_probably_wraps_p (*base, *step, at_stmt, loop, 1260 new_base = chrec_convert_1 (type, *base, at_stmt, 1272 new_step = chrec_convert_1 (signed_ct, new_step, at_stmt, 1275 new_step = chrec_convert_1 (step_type, new_step, at_stmt, use_overflow_semantics); 1284 && scev_probably_wraps_p (new_base, new_step, at_stmt, loop, false)) 1298 chrec_convert_rhs (tree type, tree chrec, gimple at_stmt) 1303 return chrec_convert (type, chrec, at_stmt); 1331 chrec_convert (tree type, tree chrec, gimple at_stmt) 1333 return chrec_convert_1 (type, chrec, at_stmt, tru 1192 convert_affine_scev(struct loop *loop, tree type, tree *base, tree *step, gimple at_stmt, bool use_overflow_semantics) argument 1294 chrec_convert_rhs(tree type, tree chrec, gimple at_stmt) argument 1327 chrec_convert(tree type, tree chrec, gimple at_stmt) argument 1345 chrec_convert_1(tree type, tree chrec, gimple at_stmt, bool use_overflow_semantics) argument [all...] |
H A D | tree-ssa-loop-niter.c | 2681 gimple at_stmt, bool is_exit, bool realistic, bool upper) 2688 print_gimple_stmt (dump_file, at_stmt, 0, TDF_SLIM); 2708 at_stmt) in a loop with known constant number of iterations. */ 2717 elt->stmt = at_stmt; 2725 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, gimple_bb (at_stmt))) 2729 If at_stmt is an exit then the loop latch is executed at most BOUND times, 2743 do_warn_aggressive_loop_optimizations (loop, new_i_bound, at_stmt); 3792 gimple at_stmt, struct loop *loop, 3874 if (at_stmt) 3877 if (n_of_executions_at_most (at_stmt, boun 2680 record_estimate(struct loop *loop, tree bound, const widest_int &i_bound, gimple at_stmt, bool is_exit, bool realistic, bool upper) argument 3791 scev_probably_wraps_p(tree base, tree step, gimple at_stmt, struct loop *loop, bool use_overflow_semantics) argument [all...] |
H A D | tree-vect-stmts.c | 1686 gimple at_stmt = gsi_stmt (*gsi); local 1687 tree vuse = gimple_vuse (at_stmt); 1690 tree vdef = gimple_vdef (at_stmt); 1691 gimple_set_vuse (vec_stmt, gimple_vuse (at_stmt)); 1705 SET_USE (gimple_vuse_op (at_stmt), new_vdef);
|