HomeSort by: relevance | last modified time | path
    Searched defs:edge_num (Results 1 - 2 of 2) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
ipa-split.cc 1021 unsigned int edge_num; member in class:stack_entry
1068 first.edge_num = 0;
1084 /* We are walking an acyclic graph, so edge_num counts
1088 if (entry->edge_num == EDGE_COUNT (entry->bb->succs)
1120 if (entry->edge_num
1126 if (entry->edge_num < EDGE_COUNT (entry->bb->succs))
1128 e = EDGE_SUCC (entry->bb, entry->edge_num);
1133 e = EDGE_PRED (entry->bb, entry->edge_num
1138 entry->edge_num++;
1147 new_entry.edge_num = 0
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
ipa-split.cc 1018 unsigned int edge_num; member in class:stack_entry
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
    [all...]

Completed in 30 milliseconds