113   int new_entry_index;  member
161   else if (n == fixup_graph->new_entry_index)  in print_basic_block()
462   int new_entry_index = 0, new_exit_index = 0;  in create_fixup_graph()  local
590   new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices;  in create_fixup_graph()
593   add_fixup_edge (fixup_graph, new_entry_index, ENTRY_BLOCK, SOURCE_CONNECT_EDGE,  in create_fixup_graph()
608   for (i = 4; i < new_entry_index; i += 2)  in create_fixup_graph()
618 	  add_fixup_edge (fixup_graph, new_entry_index, i, BALANCE_EDGE, 0, 0,  in create_fixup_graph()
636       pfedge = find_fixup_edge (fixup_graph, new_entry_index, ENTRY_BLOCK);  in create_fixup_graph()
793   int new_entry_index;  in cancel_negative_cycle()  local
800   new_entry_index = fixup_graph->new_entry_index;  in cancel_negative_cycle()
819 	if (pfedge->src == new_entry_index)  in cancel_negative_cycle()
842       if (pfedge->src == new_entry_index)  in cancel_negative_cycle()
1314   int new_entry_index;  in find_minimum_cost_flow()  local
1319   new_entry_index = fixup_graph->new_entry_index;  in find_minimum_cost_flow()
1321   find_max_flow (fixup_graph, new_entry_index, new_exit_index);  in find_minimum_cost_flow()