369   void map_ideal_node(Node *n, PointsToNode* ptn) {

   369   void map_ideal_node(Node *n, PointsToNode* ptn) {

   370     assert(ptn != NULL, "only existing PointsTo node");

   370     assert(ptn != NULL, "only existing PointsTo node");

   371     _nodes.at_put(n->_idx, ptn);

   371     _nodes.at_put(n->_idx, ptn);

   372   }

   372   }

   373 

   373 

   374   // Create PointsToNode node and add it to Connection Graph.

   376   // Create PointsToNode node and add it to Connection Graph.

   375   void add_node_to_connection_graph(Node *n, Unique_Node_List *delayed_worklist);

   377   void add_node_to_connection_graph(Node *n, Unique_Node_List *delayed_worklist);

   376 

   378 

   377   // Add final simple edges to graph.

   379   // Add final simple edges to graph.

   378   void add_final_edges(Node *n);

   380   void add_final_edges(Node *n);