contrib/gcc/tree-ssa-live.c

688 	 The a_3 referred to in b_3's PHI node is the one incoming on the
689 	 edge, *not* the PHI node just seen.  */
1073    of the same type to the type node's index.  Volatiles are ignored.  */
1173   partition_pair_p node, tmp;
1188   for (node = cl->list[p1]; node; node = node->next)
1190       if (node->second_partition == p2)
1191         return node;
1193         if (node->second_partition > p2)
1195      tmp = node;
1201   node = (partition_pair_p) xmalloc (sizeof (struct partition_pair_d));
1202   node->first_partition = p1;
1203   node->second_partition = p2;
1204   node->cost = 0;
1208       node->next = tmp->next;
1209       tmp->next = node;
1213       /* This is now the first node in the list.  */
1214       node->next = cl->list[p1];
1215       cl->list[p1] = node;
1218   return node;
1246   partition_pair_p node;
1253   node = find_partition_pair (cl, p1, p2, true);
1255   node->cost += value;
1343   partition_pair_p node;
1348   node = cl->list[0];
1349   if (!node)
1352   cl->list[0] = node->next;
1354   *p1 = node->first_partition;
1355   *p2 = node->second_partition;
1356   ret = node->cost;
1357   free (node);
1498 	 will not record any conflicts.  However, since the PHI node is
1731   partition_pair_p node;
1741 	  node = cl->list[x];
1742 	  if (node)
1747 	      for ( ; node; node = node->next)
1749 		  var = partition_to_var (cl->map, node->second_partition);
1751 		  fprintf (f, "(%1d), ", node->cost);
1760       for (node = cl->list[0]; node; node = node->next)
1762 	  fprintf (f, "(%d) ", node->cost);
1763 	  var = partition_to_var (cl->map, node->first_partition);
1766 	  var = partition_to_var (cl->map, node->second_partition);