contrib/gcc/ipa.c

33   struct cgraph_node *node, *node2;
45   for (node = cgraph_nodes; node; node = node->next)
46     node->aux = NULL;
47   for (node = cgraph_nodes; node; node = node->next)
48     if (!node->aux)
50 	node2 = node;
51 	if (!node->callers)
52 	  node->aux = &last;
54 	  node->aux = node->callers;
86   for (node = cgraph_nodes; node; node = node->next)
87     node->aux = NULL;
100   struct cgraph_node *node, *next;
110   for (node = cgraph_nodes; node; node = node->next)
111     gcc_assert (!node->aux);
113   for (node = cgraph_nodes; node; node = node->next)
114     if (node->needed && !node->global.inlined_to
115 	&& ((!DECL_EXTERNAL (node->decl))
116             || !node->analyzed
119 	node->aux = first;
120 	first = node;
123       gcc_assert (!node->aux);
131       node = first;
134       for (e = node->callees; e; e = e->next_callee)
136 	    && node->analyzed
154   for (node = cgraph_nodes; node; node = next)
156       next = node->next;
157       if (!node->aux)
160 	  tree decl = node->decl;
162           node->global.inlined_to = NULL;
164 	    local_insns = node->local.self_insns;
168 	    fprintf (file, " %s", cgraph_node_name (node));
169 	  if (!node->analyzed || !DECL_EXTERNAL (node->decl)
171 	    cgraph_remove_node (node);
176 	      for (e = node->callers; e; e = e->next_caller)
179 	      if (e || node->needed)
183 		  for (clone = node->next_clone; clone;
189 		      DECL_SAVED_TREE (node->decl) = NULL;
190 		      DECL_STRUCT_FUNCTION (node->decl) = NULL;
191 		      DECL_INITIAL (node->decl) = error_mark_node;
192 		      node->analyzed = false;
194 		  cgraph_node_remove_callees (node);
195 		  node->analyzed = false;
198 		cgraph_remove_node (node);
205   for (node = cgraph_nodes; node; node = node->next)
206     node->aux = NULL;