477 void cgraph_insert_node_to_hashtable (struct cgraph_node *node);
483 void cgraph_node_remove_callees (struct cgraph_node *node);
544   (struct cgraph_node *node);
546   (struct cgraph_node *node);
547 bool cgraph_can_remove_if_no_direct_calls_p (struct cgraph_node *node);
558 VEC (cgraph_edge_p, heap) * collect_callers_of_node (struct cgraph_node *node);
611 void cgraph_call_function_insertion_hooks (struct cgraph_node *node);
618 bool cgraph_propagate_frequency (struct cgraph_node *node);
672 void varpool_remove_node (struct varpool_node *node);
673 void varpool_finalize_named_section_flags (struct varpool_node *node);
675 bool varpool_assemble_decl (struct varpool_node *node);
681 const char * varpool_node_name (struct varpool_node *node);
690 #define FOR_EACH_STATIC_VARIABLE(node) \  argument
691    for ((node) = varpool_nodes_queue; (node); (node) = (node)->next_needed)
697   struct varpool_node *node;  in varpool_first_static_initializer()  local
698   for (node = varpool_nodes_queue; node; node = node->next_needed)  in varpool_first_static_initializer()
700       gcc_checking_assert (TREE_CODE (node->decl) == VAR_DECL);  in varpool_first_static_initializer()
701       if (DECL_INITIAL (node->decl))  in varpool_first_static_initializer()
702           return node;  in varpool_first_static_initializer()
709 varpool_next_static_initializer (struct varpool_node *node)  in varpool_next_static_initializer()  argument
711   for (node = node->next_needed; node; node = node->next_needed)  in varpool_next_static_initializer()
713       gcc_checking_assert (TREE_CODE (node->decl) == VAR_DECL);  in varpool_next_static_initializer()
714       if (DECL_INITIAL (node->decl))  in varpool_next_static_initializer()
715           return node;  in varpool_next_static_initializer()
721 #define FOR_EACH_STATIC_INITIALIZER(node) \  argument
722    for ((node) = varpool_first_static_initializer (); (node); \
723         (node) = varpool_next_static_initializer (node))
729   struct cgraph_node *node;  in cgraph_first_defined_function()  local
730   for (node = cgraph_nodes; node; node = node->next)  in cgraph_first_defined_function()
732       if (node->analyzed)  in cgraph_first_defined_function()
733           return node;  in cgraph_first_defined_function()
740 cgraph_next_defined_function (struct cgraph_node *node)  in cgraph_next_defined_function()  argument
742   for (node = node->next; node; node = node->next)  in cgraph_next_defined_function()
744       if (node->analyzed)  in cgraph_next_defined_function()
745           return node;  in cgraph_next_defined_function()
751 #define FOR_EACH_DEFINED_FUNCTION(node) \  argument
752    for ((node) = cgraph_first_defined_function (); (node); \
753         (node) = cgraph_next_defined_function (node))
763 cgraph_function_with_gimple_body_p (struct cgraph_node *node)  in cgraph_function_with_gimple_body_p()  argument
765   return node->analyzed && !node->thunk.thunk_p && !node->alias;  in cgraph_function_with_gimple_body_p()
772   struct cgraph_node *node;  in cgraph_first_function_with_gimple_body()  local
773   for (node = cgraph_nodes; node; node = node->next)  in cgraph_first_function_with_gimple_body()
775       if (cgraph_function_with_gimple_body_p (node))  in cgraph_first_function_with_gimple_body()
776           return node;  in cgraph_first_function_with_gimple_body()
783 cgraph_next_function_with_gimple_body (struct cgraph_node *node)  in cgraph_next_function_with_gimple_body()  argument
785   for (node = node->next; node; node = node->next)  in cgraph_next_function_with_gimple_body()
787       if (cgraph_function_with_gimple_body_p (node))  in cgraph_next_function_with_gimple_body()
788           return node;  in cgraph_next_function_with_gimple_body()
794 #define FOR_EACH_FUNCTION_WITH_GIMPLE_BODY(node) \  argument
795    for ((node) = cgraph_first_function_with_gimple_body (); (node); \
796         (node) = cgraph_next_function_with_gimple_body (node))
835 cgraph_node_in_set_p (struct cgraph_node *node, cgraph_node_set set)  in cgraph_node_in_set_p()  argument
838   csi = cgraph_node_set_find (set, node);  in cgraph_node_in_set_p()
883 varpool_node_in_set_p (struct varpool_node *node, varpool_node_set set)  in varpool_node_in_set_p()  argument
886   vsi = varpool_node_set_find (set, node);  in varpool_node_in_set_p()
933 cgraph_only_called_directly_or_aliased_p (struct cgraph_node *node)  in cgraph_only_called_directly_or_aliased_p()  argument
935   gcc_assert (!node->global.inlined_to);  in cgraph_only_called_directly_or_aliased_p()
936   return (!node->needed && !node->address_taken  in cgraph_only_called_directly_or_aliased_p()
937             && !node->reachable_from_other_partition  in cgraph_only_called_directly_or_aliased_p()
938             && !DECL_VIRTUAL_P (node->decl)  in cgraph_only_called_directly_or_aliased_p()
939             && !DECL_STATIC_CONSTRUCTOR (node->decl)  in cgraph_only_called_directly_or_aliased_p()
940             && !DECL_STATIC_DESTRUCTOR (node->decl)  in cgraph_only_called_directly_or_aliased_p()
941             && !node->local.externally_visible);  in cgraph_only_called_directly_or_aliased_p()
948 varpool_can_remove_if_no_refs (struct varpool_node *node)  in varpool_can_remove_if_no_refs()  argument
950   if (DECL_EXTERNAL (node->decl))  in varpool_can_remove_if_no_refs()
952   return (!node->force_output && !node->used_from_other_partition  in varpool_can_remove_if_no_refs()
953             && ((DECL_COMDAT (node->decl)  in varpool_can_remove_if_no_refs()
954                  && !varpool_used_from_object_file_p (node))  in varpool_can_remove_if_no_refs()
955                 || (flag_toplevel_reorder && !node->externally_visible)  in varpool_can_remove_if_no_refs()
956                 || DECL_HAS_VALUE_EXPR_P (node->decl)));  in varpool_can_remove_if_no_refs()
1012 cgraph_function_node (struct cgraph_node *node, enum availability *availability)  in cgraph_function_node()  argument
1015     *availability = cgraph_function_body_availability (node);  in cgraph_function_node()
1016   while (node)  in cgraph_function_node()
1018       if (node->alias && node->analyzed)  in cgraph_function_node()
1019           node = cgraph_alias_aliased_node (node);  in cgraph_function_node()
1020       else if (node->thunk.thunk_p)  in cgraph_function_node()
1021           node = node->callees->callee;  in cgraph_function_node()
1023           return node;  in cgraph_function_node()
1024       if (node && availability)  in cgraph_function_node()
1027             a = cgraph_function_body_availability (node);  in cgraph_function_node()
1042 cgraph_function_or_thunk_node (struct cgraph_node *node, enum availability *availability)  in cgraph_function_or_thunk_node()  argument
1045     *availability = cgraph_function_body_availability (node);  in cgraph_function_or_thunk_node()
1046   while (node)  in cgraph_function_or_thunk_node()
1048       if (node->alias && node->analyzed)  in cgraph_function_or_thunk_node()
1049           node = cgraph_alias_aliased_node (node);  in cgraph_function_or_thunk_node()
1051           return node;  in cgraph_function_or_thunk_node()
1052       if (node && availability)  in cgraph_function_or_thunk_node()
1055             a = cgraph_function_body_availability (node);  in cgraph_function_or_thunk_node()
1070 varpool_variable_node (struct varpool_node *node, enum availability *availability)  in varpool_variable_node()  argument
1073     *availability = cgraph_variable_initializer_availability (node);  in varpool_variable_node()
1074   while (node)  in varpool_variable_node()
1076       if (node->alias && node->analyzed)  in varpool_variable_node()
1077           node = varpool_alias_aliased_node (node);  in varpool_variable_node()
1079           return node;  in varpool_variable_node()
1080       if (node && availability)  in varpool_variable_node()
1083             a = cgraph_variable_initializer_availability (node);  in varpool_variable_node()