Home
last modified time | relevance | path

Searched refs:cgraph_nodes (Results 1 – 15 of 15) sorted by relevance

/freebsd-12.1/contrib/gcc/
H A Dipa.c45 for (node = cgraph_nodes; node; node = node->next) in cgraph_postorder()
47 for (node = cgraph_nodes; node; node = node->next) in cgraph_postorder()
86 for (node = cgraph_nodes; node; node = node->next) in cgraph_postorder()
110 for (node = cgraph_nodes; node; node = node->next) in cgraph_remove_unreachable_nodes()
113 for (node = cgraph_nodes; node; node = node->next) in cgraph_remove_unreachable_nodes()
154 for (node = cgraph_nodes; node; node = next) in cgraph_remove_unreachable_nodes()
205 for (node = cgraph_nodes; node; node = node->next) in cgraph_remove_unreachable_nodes()
H A Dipa-prop.c101 for (node = cgraph_nodes; node; node = node->next) in ipa_methodlist_init()
527 for (node = cgraph_nodes; node; node = node->next) in ipa_nodes_create()
538 for (node = cgraph_nodes; node; node = node->next) in ipa_edges_create()
549 for (node = cgraph_nodes; node; node = node->next) in ipa_nodes_free()
563 for (node = cgraph_nodes; node; node = node->next) in ipa_edges_free()
578 for (node = cgraph_nodes; node; node = node->next) in ipa_free()
607 for (node = cgraph_nodes; node; node = node->next) in ipa_method_tree_print()
632 for (node = cgraph_nodes; node; node = node->next) in ipa_method_modify_print()
H A Dipa-cp.c384 for (node = cgraph_nodes; node; node = node->next) in ipcp_method_cval_print()
519 for (node = cgraph_nodes; node; node = node->next) in ipcp_init_stage()
527 for (node = cgraph_nodes; node; node = node->next) in ipcp_init_stage()
557 for (node = cgraph_nodes; node; node = node->next) in ipcp_after_propagate()
647 for (node = cgraph_nodes; node; node = node->next) in ipcp_callsite_param_print()
687 for (node = cgraph_nodes; node; node = node->next) in ipcp_method_scale_print()
701 for (node = cgraph_nodes; node; node = node->next) in ipcp_profile_mt_count_print()
716 for (node = cgraph_nodes; node; node = node->next) in ipcp_profile_cs_count_print()
737 for (node = cgraph_nodes; node; node = node->next) in ipcp_profile_edge_print()
790 for (node = cgraph_nodes; node; node = node->next) in ipcp_profile_bb_print()
[all …]
H A Dcgraphunit.c428 for (n = cgraph_nodes; n; n = next) in cgraph_reset_node()
863 for (node = cgraph_nodes; node; node = node->next) in verify_cgraph()
1100 first_processed = cgraph_nodes; in cgraph_finalize_compilation_unit()
1147 first_processed = cgraph_nodes; in cgraph_finalize_compilation_unit()
1191 first_analyzed = cgraph_nodes; in cgraph_finalize_compilation_unit()
1202 for (node = cgraph_nodes; node; node = node->next) in cgraph_mark_functions_to_output()
1380 for (pf = cgraph_nodes; pf; pf = pf->next) in cgraph_output_in_order()
1452 for (node = cgraph_nodes; node; node = node->next) in cgraph_function_and_variable_visibility()
1494 for (node = cgraph_nodes; node; node = node->next) in cgraph_function_and_variable_visibility()
1499 for (node = cgraph_nodes; node; node = node->next) in cgraph_function_and_variable_visibility()
[all …]
H A Dcgraph.c111 struct cgraph_node *cgraph_nodes; variable
185 node->next = cgraph_nodes; in cgraph_create_node()
188 if (cgraph_nodes) in cgraph_create_node()
189 cgraph_nodes->previous = node; in cgraph_create_node()
192 cgraph_nodes = node; in cgraph_create_node()
289 for (node = cgraph_nodes; node ; node = node->next) in cgraph_node_for_asm()
552 cgraph_nodes = node->next; in cgraph_remove_node()
780 for (node = cgraph_nodes; node; node = node->next) in dump_cgraph()
H A Dipa-inline.c680 for (node = cgraph_nodes; node != master_clone; in cgraph_decide_recursive_inlining()
730 for (node = cgraph_nodes; node; node = node->next) in cgraph_decide_inlining_of_small_functions()
908 for (node = cgraph_nodes; node; node = node->next) in cgraph_decide_inlining()
943 for (node = cgraph_nodes; node; node = node->next) in cgraph_decide_inlining()
1192 for (node = cgraph_nodes; node; node = node->next) in cgraph_early_inlining()
1218 for (node = cgraph_nodes; node; node = node->next) in cgraph_early_inlining()
H A Dipa-pure-const.c623 for (node = cgraph_nodes; node; node = node->next) in static_execute()
744 for (node = cgraph_nodes; node; node = node->next) in static_execute()
H A Dipa-utils.c172 for (node = cgraph_nodes; node; node = node->next) in ipa_utils_reduced_inorder()
H A Dipa-reference.c757 for (node = cgraph_nodes; node; node = node->next) in ipa_init()
920 for (node = cgraph_nodes; node; node = node->next) in static_execute()
1292 for (node = cgraph_nodes; node; node = node->next) in static_execute()
H A Dcgraph.h243 extern GTY(()) struct cgraph_node *cgraph_nodes;
H A Dpasses.c949 for (node = cgraph_nodes; node; node = node->next) in execute_ipa_pass_list()
H A Dipa-type-escape.c1695 for (node = cgraph_nodes; node; node = node->next) in type_escape_execute()
H A Dtree-ssa-structalias.c5053 for (node = cgraph_nodes; node; node = node->next) in ipa_pta_execute()
5069 for (node = cgraph_nodes; node; node = node->next) in ipa_pta_execute()
H A DChangeLog-200316521 (cgraph_hash, cgraph_nodes, cgraph_nodes_queue,
16527 cgraph_node, cgraph_edge, cgraph_varpool_node, cgraph_nodes, cgraph_n_nodes,
31968 (cgraph_nodes, cgraph_n_nodes): Globalize.
/freebsd-12.1/contrib/gcc/cp/
H A Ddecl2.c3039 for (node = cgraph_nodes; node ; node = node->next) in build_java_method_aliases()