/freebsd-10.2-release/contrib/gcc/ |
H A D | domwalk.c | 147 block_stmt_iterator bsi; local 200 for (bsi = bsi_last (bb); !bsi_end_p (bsi); bsi_prev (&bsi)) 202 bsi); 204 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi)) 206 bsi); 240 for (bsi [all...] |
H A D | tree-complex.c | 182 block_stmt_iterator bsi; local 191 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi)) 196 orig_stmt = stmt = bsi_stmt (bsi); 549 extract_component (block_stmt_iterator *bsi, tree t, bool imagpart_p, argument 573 t = gimplify_val (bsi, inner_type, t); 589 update_complex_components (block_stmt_iterator *bsi, tree stmt, tree r, tree i) argument 596 bsi_insert_after (bsi, list, BSI_CONTINUE_LINKING); 600 bsi_insert_after (bsi, lis 620 update_complex_assignment(block_stmt_iterator *bsi, tree r, tree i) argument 728 expand_complex_move(block_stmt_iterator *bsi, tree stmt, tree type, tree lhs, tree rhs) argument 808 expand_complex_addition(block_stmt_iterator *bsi, tree inner_type, tree ar, tree ai, tree br, tree bi, enum tree_code code, complex_lattice_t al, complex_lattice_t bl) argument 884 expand_complex_libcall(block_stmt_iterator *bsi, tree ar, tree ai, tree br, tree bi, enum tree_code code) argument 928 expand_complex_multiplication(block_stmt_iterator *bsi, tree inner_type, tree ar, tree ai, tree br, tree bi, complex_lattice_t al, complex_lattice_t bl) argument 1014 expand_complex_div_straight(block_stmt_iterator *bsi, tree inner_type, tree ar, tree ai, tree br, tree bi, enum tree_code code) argument 1041 expand_complex_div_wide(block_stmt_iterator *bsi, tree inner_type, tree ar, tree ai, tree br, tree bi, enum tree_code code) argument 1183 expand_complex_division(block_stmt_iterator *bsi, tree inner_type, tree ar, tree ai, tree br, tree bi, enum tree_code code, complex_lattice_t al, complex_lattice_t bl) argument 1263 expand_complex_negation(block_stmt_iterator *bsi, tree inner_type, tree ar, tree ai) argument 1279 expand_complex_conjugate(block_stmt_iterator *bsi, tree inner_type, tree ar, tree ai) argument 1292 expand_complex_comparison(block_stmt_iterator *bsi, tree ar, tree ai, tree br, tree bi, enum tree_code code) argument 1327 expand_complex_operations_1(block_stmt_iterator *bsi) argument 1489 block_stmt_iterator bsi; local 1560 block_stmt_iterator bsi; local [all...] |
H A D | tree-vect-generic.c | 104 tree_vec_extract (block_stmt_iterator *bsi, tree type, argument 108 return gimplify_build3 (bsi, BIT_FIELD_REF, type, t, bitsize, bitpos); 110 return gimplify_build1 (bsi, VIEW_CONVERT_EXPR, type, t); 114 do_unop (block_stmt_iterator *bsi, tree inner_type, tree a, argument 118 a = tree_vec_extract (bsi, inner_type, a, bitsize, bitpos); 119 return gimplify_build1 (bsi, code, inner_type, a); 123 do_binop (block_stmt_iterator *bsi, tree inner_type, tree a, tree b, argument 126 a = tree_vec_extract (bsi, inner_type, a, bitsize, bitpos); 127 b = tree_vec_extract (bsi, inner_type, b, bitsize, bitpos); 128 return gimplify_build2 (bsi, cod 145 do_plus_minus(block_stmt_iterator *bsi, tree word_type, tree a, tree b, tree bitpos ATTRIBUTE_UNUSED, tree bitsize ATTRIBUTE_UNUSED, enum tree_code code) argument 176 do_negate(block_stmt_iterator *bsi, tree word_type, tree b, tree unused ATTRIBUTE_UNUSED, tree bitpos ATTRIBUTE_UNUSED, tree bitsize ATTRIBUTE_UNUSED, enum tree_code code ATTRIBUTE_UNUSED) argument 201 expand_vector_piecewise(block_stmt_iterator *bsi, elem_op_func f, tree type, tree inner_type, tree a, tree b, enum tree_code code) argument 230 expand_vector_parallel(block_stmt_iterator *bsi, elem_op_func f, tree type, tree a, tree b, enum tree_code code) argument 271 expand_vector_addition(block_stmt_iterator *bsi, elem_op_func f, elem_op_func f_parallel, tree type, tree a, tree b, enum tree_code code) argument 290 expand_vector_operation(block_stmt_iterator *bsi, tree type, tree compute_type, tree rhs, enum tree_code code) argument 371 expand_vector_operations_1(block_stmt_iterator *bsi) argument 475 block_stmt_iterator bsi; local [all...] |
H A D | tree-nrv.c | 111 block_stmt_iterator bsi; local 122 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi)) 124 tree stmt = bsi_stmt (bsi); 204 for (bsi = bsi_start (bb); !bsi_end_p (bsi); ) 206 tree *tp = bsi_stmt_ptr (bsi); 211 bsi_remove (&bsi, true); 215 bsi_next (&bsi); [all...] |
H A D | tree-optimize.c | 199 block_stmt_iterator bsi; local 206 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi)) 208 tree stmt = bsi_stmt (bsi); 265 block_stmt_iterator bsi; local 270 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi)) 272 tree stmt = bsi_stmt (bsi); [all...] |
H A D | tree-profile.c | 124 prepare_instrumented_value (block_stmt_iterator *bsi, 128 return force_gimple_operand_bsi (bsi, fold_convert (gcov_type_node, val), 140 block_stmt_iterator bsi = bsi_for_stmt (stmt); 146 ref_ptr = force_gimple_operand_bsi (&bsi, 149 val = prepare_instrumented_value (&bsi, value); 156 bsi_insert_before (&bsi, call, BSI_SAME_STMT); 167 block_stmt_iterator bsi = bsi_for_stmt (stmt); 171 ref_ptr = force_gimple_operand_bsi (&bsi, 174 val = prepare_instrumented_value (&bsi, value); 179 bsi_insert_before (&bsi, cal 123 prepare_instrumented_value(block_stmt_iterator *bsi, histogram_value value) argument 139 block_stmt_iterator bsi = bsi_for_stmt (stmt); local 166 block_stmt_iterator bsi = bsi_for_stmt (stmt); local 189 block_stmt_iterator bsi = bsi_for_stmt (stmt); local [all...] |
H A D | tree-tailcall.c | 200 independent_of_stmt_p (tree expr, tree at, block_stmt_iterator bsi) argument 214 call_bb = bb_for_stmt (bsi_stmt (bsi)); 230 for (; !bsi_end_p (bsi); bsi_next (&bsi)) 231 if (bsi_stmt (bsi) == at) 234 if (!bsi_end_p (bsi)) 378 block_stmt_iterator bsi, absi; local 389 for (bsi = bsi_last (bb); !bsi_end_p (bsi); bsi_prev (&bsi)) 547 adjust_accumulator_values(block_stmt_iterator bsi, tree m, tree a, edge back) argument 620 block_stmt_iterator bsi = bsi_last (bb); local 722 block_stmt_iterator bsi; local [all...] |
H A D | tree-ssa-math-opts.c | 296 block_stmt_iterator bsi; local 314 bsi = bsi_after_labels (occ->bb); 315 while (!bsi_end_p (bsi) && !is_division_by (bsi_stmt (bsi), def)) 316 bsi_next (&bsi); 318 bsi_insert_before (&bsi, new_stmt, BSI_SAME_STMT); 331 bsi = bsi_after_labels (occ->bb); 332 bsi_insert_before (&bsi, new_stmt, BSI_SAME_STMT); 479 block_stmt_iterator bsi; local 490 for (bsi [all...] |
H A D | tree-cfgcleanup.c | 72 cleanup_control_expr_graph (basic_block bb, block_stmt_iterator bsi) argument 76 tree expr = bsi_stmt (bsi), val; 141 bsi_remove (&bsi, true); 164 block_stmt_iterator bsi; local 179 bsi = bsi_last (bb); 185 if (bsi_end_p (bsi)) 188 stmt = bsi_stmt (bsi); 192 retval |= cleanup_control_expr_graph (bb, bsi); 236 bsi_remove (&bsi, true); 261 block_stmt_iterator bsi; local 388 block_stmt_iterator bsi, bsi_to; local [all...] |
H A D | tree-ssa-threadupdate.c | 173 block_stmt_iterator bsi; local 177 bsi = bsi_last (bb); 184 if (!bsi_end_p (bsi) 185 && bsi_stmt (bsi) 186 && (TREE_CODE (bsi_stmt (bsi)) == COND_EXPR 187 || TREE_CODE (bsi_stmt (bsi)) == GOTO_EXPR 188 || TREE_CODE (bsi_stmt (bsi)) == SWITCH_EXPR)) 189 bsi_remove (&bsi, true); 662 block_stmt_iterator bsi; local 665 bsi [all...] |
H A D | value-prof.c | 107 block_stmt_iterator bsi; local 116 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi)) 118 tree stmt = bsi_stmt (bsi); 147 bsi = bsi_for_stmt (stmt); 189 block_stmt_iterator bsi; local 192 bsi = bsi_for_stmt (stmt); 202 bsi_insert_before (&bsi, stmt1, BSI_SAME_STMT); 203 bsi_insert_before (&bsi, stmt 352 block_stmt_iterator bsi; local 516 block_stmt_iterator bsi; local 786 block_stmt_iterator bsi; local [all...] |
H A D | tree-ssa-phiopt.c | 304 block_stmt_iterator bsi; local 307 bsi = bsi_start (bb); 308 while (!bsi_end_p (bsi) 309 && (TREE_CODE (bsi_stmt (bsi)) == LABEL_EXPR 310 || IS_EMPTY_STMT (bsi_stmt (bsi)))) 311 bsi_next (&bsi); 313 if (!bsi_end_p (bsi)) 329 block_stmt_iterator bsi; local 357 bsi = bsi_last (cond_block); 358 bsi_remove (&bsi, tru 381 block_stmt_iterator bsi; local 631 block_stmt_iterator bsi, bsi_from; local 879 block_stmt_iterator bsi; local [all...] |
H A D | tree-ssa-threadedge.c | 59 block_stmt_iterator bsi; local 68 bsi = bsi_last (bb); 69 if (bsi_end_p (bsi) 70 || ! bsi_stmt (bsi) 71 || (TREE_CODE (bsi_stmt (bsi)) != COND_EXPR 72 && TREE_CODE (bsi_stmt (bsi)) != GOTO_EXPR 73 && TREE_CODE (bsi_stmt (bsi)) != SWITCH_EXPR)) 217 block_stmt_iterator bsi; local 227 for (bsi = bsi_start (e->dest); ! bsi_end_p (bsi); bsi_nex [all...] |
H A D | tree-ssa-dse.c | 227 block_stmt_iterator bsi) 232 tree stmt = bsi_stmt (bsi); 342 print_generic_expr (dump_file, bsi_stmt (bsi), dump_flags); 352 bsi_remove (&bsi, true); 411 block_stmt_iterator bsi; local 413 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi)) 414 stmt_ann (bsi_stmt (bsi))->uid = max_stmt_uid++; 225 dse_optimize_stmt(struct dom_walk_data *walk_data, basic_block bb ATTRIBUTE_UNUSED, block_stmt_iterator bsi) argument
|
H A D | tree-sra.c | 663 block_stmt_iterator *bsi, bool is_output, bool use_all); 667 block_stmt_iterator *bsi); 671 void (*init) (struct sra_elt *elt, tree value, block_stmt_iterator *bsi); 677 block_stmt_iterator *bsi, bool is_output); 711 sra_walk_expr (tree *expr_p, block_stmt_iterator *bsi, bool is_output, 738 fns->use (elt, expr_p, bsi, is_output, use_all_p); 829 sra_walk_tree_list (tree list, block_stmt_iterator *bsi, bool is_output, 834 sra_walk_expr (&TREE_VALUE (op), bsi, is_output, fns); 841 sra_walk_call_expr (tree expr, block_stmt_iterator *bsi, 844 sra_walk_tree_list (TREE_OPERAND (expr, 1), bsi, fals 708 sra_walk_expr(tree *expr_p, block_stmt_iterator *bsi, bool is_output, const struct sra_walk_fns *fns) argument 826 sra_walk_tree_list(tree list, block_stmt_iterator *bsi, bool is_output, const struct sra_walk_fns *fns) argument 831 sra_walk_expr (&TREE_VALUE (op), bsi, is_output, fns); local 838 sra_walk_call_expr(tree expr, block_stmt_iterator *bsi, const struct sra_walk_fns *fns) argument 848 sra_walk_asm_expr(tree expr, block_stmt_iterator *bsi, const struct sra_walk_fns *fns) argument 851 sra_walk_tree_list (ASM_INPUTS (expr), bsi, false, fns); local 852 sra_walk_tree_list (ASM_OUTPUTS (expr), bsi, true, fns); local 858 sra_walk_modify_expr(tree expr, block_stmt_iterator *bsi, const struct sra_walk_fns *fns) argument 1919 sra_insert_before(block_stmt_iterator *bsi, tree list) argument 1931 sra_insert_after(block_stmt_iterator *bsi, tree list) argument 1947 sra_replace(block_stmt_iterator *bsi, tree list) argument 1962 scalarize_use(struct sra_elt *elt, tree *expr_p, block_stmt_iterator *bsi, bool is_output, bool use_all) argument 2010 scalarize_copy(struct sra_elt *lhs_elt, struct sra_elt *rhs_elt, block_stmt_iterator *bsi) argument 2079 scalarize_init(struct sra_elt *lhs_elt, tree rhs, block_stmt_iterator *bsi) argument 2157 scalarize_ldst(struct sra_elt *elt, tree other, block_stmt_iterator *bsi, bool is_output) argument [all...] |
H A D | tree-ssa-loop-ch.c | 54 block_stmt_iterator bsi; local 80 for (bsi = bsi_start (header); !bsi_end_p (bsi); bsi_next (&bsi)) 82 last = bsi_stmt (bsi);
|
H A D | tree-ssa-loop-ivcanon.c | 120 block_stmt_iterator bsi; local 124 for (bsi = bsi_start (body[i]); !bsi_end_p (bsi); bsi_next (&bsi)) 125 size += estimate_num_insns (bsi_stmt (bsi)); 405 block_stmt_iterator bsi; local 444 for (bsi = bsi_start (body[i]); !bsi_end_p (bsi); bsi_next (&bsi)) 446 stmt = bsi_stmt (bsi); [all...] |
H A D | tree-ssa-sink.c | 425 block_stmt_iterator bsi; local 439 for (bsi = bsi_last (bb); !bsi_end_p (bsi);) 441 tree stmt = bsi_stmt (bsi); 448 if (!bsi_end_p (bsi)) 449 bsi_prev (&bsi); 468 bsi_move_to_bb_end (&bsi, bb_for_stmt (sinkstmt)); 470 bsi_move_before (&bsi, &tobsi); 473 if (!bsi_end_p (bsi)) 474 bsi_prev (&bsi); [all...] |
H A D | tree-cfg.c | 271 block_stmt_iterator bsi = bsi_last (bb); local 274 if (bsi_end_p (bsi)) 276 last = bsi_stmt (bsi); 319 bsi_insert_before (&bsi, assignment, BSI_SAME_STMT); 832 block_stmt_iterator bsi = local 837 bsi_insert_before (&bsi, stmt, BSI_NEW_STMT); 853 block_stmt_iterator bsi; local 856 for (bsi = bsi_start (target_bb); !bsi_end_p (bsi); bsi_next (&bsi)) 1190 block_stmt_iterator bsi; local 1317 block_stmt_iterator bsi; local 2828 block_stmt_iterator bsi; local 2946 bsi_replace(const block_stmt_iterator *bsi, tree stmt, bool update_eh_info) argument 2984 tree_find_edge_insert_loc(edge e, block_stmt_iterator *bsi, basic_block *new_bb) argument 3096 block_stmt_iterator bsi; local 3124 block_stmt_iterator bsi; local 3218 block_stmt_iterator bsi; local 3584 block_stmt_iterator bsi; local 3680 block_stmt_iterator bsi; local 4103 block_stmt_iterator bsi; local 4221 block_stmt_iterator bsi; local 4303 block_stmt_iterator bsi, bsi_tgt; local 5248 block_stmt_iterator bsi = bsi_last (bb); local 5331 block_stmt_iterator bsi = bsi_last (bb); local 5355 block_stmt_iterator bsi; local 5569 block_stmt_iterator bsi; local 5672 gimplify_val(block_stmt_iterator *bsi, tree type, tree exp) argument 5697 gimplify_build3(block_stmt_iterator *bsi, enum tree_code code, tree type, tree a, tree b, tree c) argument 5712 gimplify_build2(block_stmt_iterator *bsi, enum tree_code code, tree type, tree a, tree b) argument 5727 gimplify_build1(block_stmt_iterator *bsi, enum tree_code code, tree type, tree a) argument [all...] |
H A D | tree-if-conv.c | 219 block_stmt_iterator *bsi) 245 tree_if_convert_cond_expr (loop, t, cond, bsi); 262 block_stmt_iterator *bsi) 278 unshare_expr (c), bsi); 282 add_to_dst_predicate_list (loop, false_edge, cond, c2, bsi); 289 bsi_remove (bsi, true); 614 block_stmt_iterator *bsi) 632 bsi_insert_before (bsi, tmp_stmts1, BSI_SAME_STMT); 637 bsi_insert_before (bsi, tmp_stmts2, BSI_SAME_STMT); 648 bsi_insert_before (bsi, tmp_stm 218 tree_if_convert_stmt(struct loop * loop, tree t, tree cond, block_stmt_iterator *bsi) argument 261 tree_if_convert_cond_expr(struct loop *loop, tree stmt, tree cond, block_stmt_iterator *bsi) argument 612 add_to_dst_predicate_list(struct loop * loop, edge e, tree prev_cond, tree cond, block_stmt_iterator *bsi) argument 683 find_phi_replacement_condition(struct loop *loop, basic_block bb, tree *cond, block_stmt_iterator *bsi) argument 798 replace_phi_with_cond_modify_expr(tree phi, tree cond, basic_block true_bb, block_stmt_iterator *bsi) argument 863 block_stmt_iterator bsi; local 959 block_stmt_iterator bsi; local [all...] |
H A D | tree-ssa-loop-im.c | 582 block_stmt_iterator bsi; local 594 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi)) 596 stmt = bsi_stmt (bsi); 642 bsi_replace (&bsi, stmt1, true); 643 bsi_insert_after (&bsi, stmt2, BSI_NEW_STMT); 721 block_stmt_iterator bsi; local 728 for (bsi = bsi_start (bb); !bsi_end_p (bsi); ) 1293 block_stmt_iterator bsi; local 1505 block_stmt_iterator bsi; local [all...] |
H A D | tree-ssa-forwprop.c | 562 block_stmt_iterator bsi = bsi_for_stmt (def); local 563 bsi_remove (&bsi, true); 975 block_stmt_iterator bsi; local 978 for (bsi = bsi_start (bb); !bsi_end_p (bsi); ) 980 tree stmt = bsi_stmt (bsi); 992 bsi_next (&bsi); 1000 bsi_remove (&bsi, true); 1002 bsi_next (&bsi); 1011 bsi_next (&bsi); [all...] |
H A D | tree-ssa-copyrename.c | 300 block_stmt_iterator bsi; local 315 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi)) 317 stmt = bsi_stmt (bsi);
|
H A D | tree-ssa-reassoc.c | 1024 negate_value (tree tonegate, block_stmt_iterator *bsi) argument 1040 block_stmt_iterator bsi; local 1043 bsi = bsi_for_stmt (negatedef); 1045 &bsi); 1046 bsi = bsi_for_stmt (negatedef); 1048 &bsi); 1054 resultofnegate = force_gimple_operand_bsi (bsi, tonegate, true, 1096 break_up_subtract (tree stmt, block_stmt_iterator *bsi) argument 1107 TREE_OPERAND (rhs, 1) = negate_value (TREE_OPERAND (rhs, 1), bsi); 1261 block_stmt_iterator bsi; local 1304 block_stmt_iterator bsi; local [all...] |
H A D | tree-ssa-loop-manip.c | 280 block_stmt_iterator bsi; local 290 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi)) 291 find_uses_to_rename_stmt (bsi_stmt (bsi), use_blocks, need_phis); 422 block_stmt_iterator bsi; local 438 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi)) 439 check_loop_closed_ssa_stmt (bb, bsi_stmt (bsi)); 544 standard_iv_increment_position(struct loop *loop, block_stmt_iterator *bsi, bool *insert_after) argument 851 block_stmt_iterator bsi; local [all...] |