Searched refs:fixup_graph (Results 1 - 1 of 1) sorted by relevance
| /haiku-buildtools/gcc/gcc/ |
| H A D | mcf.c | 161 print_basic_block (FILE *file, fixup_graph_type *fixup_graph, int n) argument
171 else if (n == fixup_graph->new_exit_index)
173 else if (n == fixup_graph->new_entry_index)
186 /* Print edge S->D for given fixup_graph with n' and n'' format.
190 fixup_graph (input). */
193 print_edge (FILE *file, fixup_graph_type *fixup_graph, int s, int d) argument
195 print_basic_block (file, fixup_graph, s);
197 print_basic_block (file, fixup_graph, d);
201 /* Dump out the attributes of a given edge FEDGE in the fixup_graph to a
204 dump_fixup_edge (FILE *file, fixup_graph_type *fixup_graph, fixup_edge_ argument
283 dump_fixup_graph(FILE *file, fixup_graph_type *fixup_graph, const char *msg) argument
376 add_edge(fixup_graph_type *fixup_graph, int src, int dest, gcov_type cost) argument
395 add_fixup_edge(fixup_graph_type *fixup_graph, int src, int dest, edge_type type, gcov_type weight, gcov_type cost, gcov_type max_capacity) argument
410 add_rfixup_edge(fixup_graph_type *fixup_graph, int src, int dest, gcov_type rflow, gcov_type cost) argument
425 find_fixup_edge(fixup_graph_type *fixup_graph, int src, int dest) argument
447 delete_fixup_graph(fixup_graph_type *fixup_graph) argument
464 create_fixup_graph(fixup_graph_type *fixup_graph) argument
796 cancel_negative_cycle(fixup_graph_type *fixup_graph, int *pi, gcov_type *d, int *cycle) argument
939 compute_residual_flow(fixup_graph_type *fixup_graph) argument
971 find_augmenting_path(fixup_graph_type *fixup_graph, augmenting_path_type *augmenting_path, int source, int sink) argument
1039 find_max_flow(fixup_graph_type *fixup_graph, int source, int sink) argument
1126 adjust_cfg_counts(fixup_graph_type *fixup_graph) argument
1331 find_minimum_cost_flow(fixup_graph_type *fixup_graph) argument
1407 fixup_graph_type fixup_graph; local
[all...] |
Completed in 93 milliseconds