Searched refs:bsi_prev (Results 1 – 19 of 19) sorted by relevance
200 for (bsi = bsi_last (bb); !bsi_end_p (bsi); bsi_prev (&bsi)) in walk_dominator_tree()240 for (bsi = bsi_last (bb); !bsi_end_p (bsi); bsi_prev (&bsi)) in walk_dominator_tree()
449 bsi_prev (&bsi); in sink_code_in_bb()474 bsi_prev (&bsi); in sink_code_in_bb()
285 for (bsi = bsi_last (bb); !bsi_end_p (bsi); bsi_prev (&bsi)) in tree_forwarder_block_p()
589 for (bsi = bsi_last (bb); !bsi_end_p (bsi); bsi_prev (&bsi)) in mark_really_necessary_kill_operand_phis()
482 static inline void bsi_prev (block_stmt_iterator *);
389 for (bsi = bsi_last (bb); !bsi_end_p (bsi); bsi_prev (&bsi)) in find_tail_calls()
780 for (bsi = bsi_last (bb); !bsi_end_p (bsi); bsi_prev (&bsi)) in branch_prob()
516 bsi_prev (&bsi); in mf_build_check_statement_for()
1307 for (bsi = bsi_last (bb); !bsi_end_p (bsi); bsi_prev (&bsi)) in reassociate_bb()
712 bsi_prev (block_stmt_iterator *i) in bsi_prev() function
2738 bsi_prev (&i); in last_and_only_stmt()3054 bsi_prev (bsi); in tree_find_edge_insert_loc()5397 bsi_prev (&bsi); in tree_flow_call_edges_add()
1954 bsi_prev (bsi); in sra_replace()
1431 for (bsi = bsi_last (bb); !bsi_end_p (bsi); bsi_prev (&bsi)) in build_tree_conflict_graph()
3316 bsi_prev (&bsi); in realify_fake_stores()
2383 bsi_prev (&si); in remove_exit_barrier()
615 for (bsi = bsi_last (stmt_bb); ; bsi_prev (&bsi)) in stmt_after_ip_original_pos()
5804 (bsi_start, bsi_last, bsi_prev, bsi_from_tsi): Kill.5827 (bsi_next, bsi_prev, bsi_stmt, bsi_stmt_ptr, bsi_remove): Likewise.6860 * tree-cfg.c (bsi_prev): Also copy the context from the previous12128 (bsi_prev): Implement previous stmt routine.12130 * tree-flow-inline.h (bsi_prev): Remove.12132 * tree-flow.h (bsi_prev,bsi_remove): Update prototypes.12782 (bsi_prev): New function.
4735 element for bsi_prev; use @findex instead.
536 @item bsi_prev