Home | History | Annotate | Download | only in gcc

Lines Matching defs:edge_num

1018   unsigned int edge_num;
1065   first.edge_num = 0;
1081       /* We are walking an acyclic graph, so edge_num counts
1085       if (entry->edge_num == EDGE_COUNT (entry->bb->succs)
1117       if (entry->edge_num
1123 	  if (entry->edge_num < EDGE_COUNT (entry->bb->succs))
1125 	      e = EDGE_SUCC (entry->bb, entry->edge_num);
1130 	      e = EDGE_PRED (entry->bb, entry->edge_num
1135 	  entry->edge_num++;
1144 	      new_entry.edge_num = 0;