495 find (unsigned int node)  in find()  argument
497   gcc_assert (node < graph->size);  in find()
498   if (graph->rep[node] != node)  in find()
499     return graph->rep[node] = find (graph->rep[node]);  in find()
500   return node;  in find()
830 clear_edges_for_node (constraint_graph_t graph, unsigned int node)  in clear_edges_for_node()  argument
832   if (graph->succs[node])  in clear_edges_for_node()
833     BITMAP_FREE (graph->succs[node]);  in clear_edges_for_node()
1830       unsigned int node = si->node_mapping[i];  in perform_var_substitution()  local
1832       if (graph->label[node] == 0 && TEST_BIT (graph->direct_nodes, node))  in perform_var_substitution()
1837 		     get_varinfo (node)->name);  in perform_var_substitution()
1839 	  clear_edges_for_node (graph, node);  in perform_var_substitution()
1863 		      unsigned int node, unsigned int label)  in find_equivalent_node()  argument
1870   if (graph->label[FIRST_ADDR_NODE + node] == 0)  in find_equivalent_node()
1877 	  if (unite (graph->eq_rep[label], node))  in find_equivalent_node()
1878 	    unify_nodes (graph, graph->eq_rep[label], node, false);  in find_equivalent_node()
1883 	  graph->eq_rep[label] = node;  in find_equivalent_node()
1886   return node;  in find_equivalent_node()
1987 eliminate_indirect_cycles (unsigned int node)  in eliminate_indirect_cycles()  argument
1989   if (graph->indirect_cycles[node] != -1  in eliminate_indirect_cycles()
1990       && !bitmap_empty_p (get_varinfo (node)->solution))  in eliminate_indirect_cycles()
1995       unsigned int to = find (graph->indirect_cycles[node]);  in eliminate_indirect_cycles()
2002       EXECUTE_IF_SET_IN_BITMAP (get_varinfo (node)->solution, 0, i, bi)  in eliminate_indirect_cycles()
5048   struct cgraph_node *node;  in ipa_pta_execute()
5053   for (node = cgraph_nodes; node; node = node->next)  in ipa_pta_execute()
5055       if (!node->analyzed || cgraph_is_master_clone (node))  in ipa_pta_execute()
5059 	  varid = create_function_info_for (node->decl,   in ipa_pta_execute()
5060 					    cgraph_node_name (node));  in ipa_pta_execute()
5061 	  if (node->local.externally_visible)  in ipa_pta_execute()
5069   for (node = cgraph_nodes; node; node = node->next)  in ipa_pta_execute()
5071       if (node->analyzed && cgraph_is_master_clone (node))  in ipa_pta_execute()
5073 	  struct function *cfun = DECL_STRUCT_FUNCTION (node->decl);  in ipa_pta_execute()
5079 		     cgraph_node_name (node));   in ipa_pta_execute()
5081 	  current_function_decl = node->decl;  in ipa_pta_execute()