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

  /src/external/gpl3/gcc/dist/gcc/
tree-ssa-structalias.cc 572 int *indirect_cycles; member in struct:constraint_graph
1142 if (graph->indirect_cycles[from] != -1)
1150 if (graph->indirect_cycles[to] == -1)
1151 graph->indirect_cycles[to] = graph->indirect_cycles[from];
1255 graph->indirect_cycles = XNEWVEC (int, graph->size);
1268 graph->indirect_cycles[j] = -1;
1302 graph->indirect_cycles[j] = -1;
1534 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node;
2693 if (graph->indirect_cycles[node] != -
    [all...]
tree-ssa-structalias.cc 572 int *indirect_cycles; member in struct:constraint_graph
1142 if (graph->indirect_cycles[from] != -1)
1150 if (graph->indirect_cycles[to] == -1)
1151 graph->indirect_cycles[to] = graph->indirect_cycles[from];
1255 graph->indirect_cycles = XNEWVEC (int, graph->size);
1268 graph->indirect_cycles[j] = -1;
1302 graph->indirect_cycles[j] = -1;
1534 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node;
2693 if (graph->indirect_cycles[node] != -
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-ssa-structalias.cc 571 int *indirect_cycles; member in struct:constraint_graph
1129 if (graph->indirect_cycles[from] != -1)
1137 if (graph->indirect_cycles[to] == -1)
1138 graph->indirect_cycles[to] = graph->indirect_cycles[from];
1239 graph->indirect_cycles = XNEWVEC (int, graph->size);
1252 graph->indirect_cycles[j] = -1;
1286 graph->indirect_cycles[j] = -1;
1518 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node;
2670 if (graph->indirect_cycles[node] != -
    [all...]
tree-ssa-structalias.cc 571 int *indirect_cycles; member in struct:constraint_graph
1129 if (graph->indirect_cycles[from] != -1)
1137 if (graph->indirect_cycles[to] == -1)
1138 graph->indirect_cycles[to] = graph->indirect_cycles[from];
1239 graph->indirect_cycles = XNEWVEC (int, graph->size);
1252 graph->indirect_cycles[j] = -1;
1286 graph->indirect_cycles[j] = -1;
1518 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node;
2670 if (graph->indirect_cycles[node] != -
    [all...]

Completed in 102 milliseconds