Lines Matching refs:blk
1850 block_info *blk; in solve_flow_graph() local
1902 blk = &fn->blocks[i]; in solve_flow_graph()
1907 for (arc = blk->succ; arc; arc = arc->succ_next) in solve_flow_graph()
1917 blk->num_succ--; in solve_flow_graph()
1928 for (arc = blk->succ; arc; arc = arc->succ_next) in solve_flow_graph()
1938 if (blk->is_call_site && arc->fall_through in solve_flow_graph()
1950 arc_info *start = blk->succ; in solve_flow_graph()
1978 blk->succ = start; in solve_flow_graph()
1983 blk->invalid_chain = 1; in solve_flow_graph()
1984 blk->chain = invalid_blocks; in solve_flow_graph()
1985 invalid_blocks = blk; in solve_flow_graph()
1990 while ((blk = invalid_blocks)) in solve_flow_graph()
1995 invalid_blocks = blk->chain; in solve_flow_graph()
1996 blk->invalid_chain = 0; in solve_flow_graph()
1997 if (!blk->num_succ) in solve_flow_graph()
1998 for (arc = blk->succ; arc; arc = arc->succ_next) in solve_flow_graph()
2000 else if (!blk->num_pred) in solve_flow_graph()
2001 for (arc = blk->pred; arc; arc = arc->pred_next) in solve_flow_graph()
2006 blk->count = total; in solve_flow_graph()
2007 blk->count_valid = 1; in solve_flow_graph()
2008 blk->chain = valid_blocks; in solve_flow_graph()
2009 blk->valid_chain = 1; in solve_flow_graph()
2010 valid_blocks = blk; in solve_flow_graph()
2012 while ((blk = valid_blocks)) in solve_flow_graph()
2017 valid_blocks = blk->chain; in solve_flow_graph()
2018 blk->valid_chain = 0; in solve_flow_graph()
2019 if (blk->num_succ == 1) in solve_flow_graph()
2023 total = blk->count; in solve_flow_graph()
2025 for (arc = blk->succ; arc; arc = arc->succ_next) in solve_flow_graph()
2034 blk->num_succ--; in solve_flow_graph()
2055 if (blk->num_pred == 1) in solve_flow_graph()
2059 total = blk->count; in solve_flow_graph()
2061 for (arc = blk->pred; arc; arc = arc->pred_next) in solve_flow_graph()
2070 blk->num_pred--; in solve_flow_graph()