HomeSort by: relevance | last modified time | path
    Searched defs:new_exit_index (Results 1 - 2 of 2) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
mcf.cc 115 int new_exit_index; member in struct:fixup_graph_type
159 else if (n == fixup_graph->new_exit_index)
287 "There are %d vertices and %d edges. new_exit_index is %d.\n\n",
288 fnum_vertices, fnum_edges, fixup_graph->new_exit_index);
462 int new_entry_index = 0, new_exit_index = 0; local
597 new_exit_index = fixup_graph->new_exit_index = fixup_graph->num_vertices;
599 add_fixup_edge (fixup_graph, 2 * EXIT_BLOCK + 1, new_exit_index,
612 add_fixup_edge (fixup_graph, i, new_exit_index, BALANCE_EDGE, 0, 0,
641 pfedge = find_fixup_edge (fixup_graph, 2 * EXIT_BLOCK + 1, new_exit_index);
1313 int new_exit_index; local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
mcf.cc 115 int new_exit_index; member in struct:fixup_graph_type
159 else if (n == fixup_graph->new_exit_index)
287 "There are %d vertices and %d edges. new_exit_index is %d.\n\n",
288 fnum_vertices, fnum_edges, fixup_graph->new_exit_index);
462 int new_entry_index = 0, new_exit_index = 0; local
597 new_exit_index = fixup_graph->new_exit_index = fixup_graph->num_vertices;
599 add_fixup_edge (fixup_graph, 2 * EXIT_BLOCK + 1, new_exit_index,
612 add_fixup_edge (fixup_graph, i, new_exit_index, BALANCE_EDGE, 0, 0,
641 pfedge = find_fixup_edge (fixup_graph, 2 * EXIT_BLOCK + 1, new_exit_index);
1313 int new_exit_index; local
    [all...]

Completed in 16 milliseconds