HomeSort by: relevance | last modified time | path
    Searched refs:src_scc (Results 1 - 5 of 5) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
cfganal.cc 1301 int src_scc = e->src->index;
1303 src_scc = bb_data[src_scc].scc;
1304 if (src_scc == -1)
1309 if (src_scc == dest_scc)
1311 /* When dest_scc is nested insde src_scc it's not an
1318 if ((tem_dest_scc = bb_data[tem_dest_scc].scc) == src_scc)
1323 /* When src_scc is nested inside dest_scc record an
1325 int tem_src_scc = src_scc;
1348 src_scc = bb_data[src_scc].scc
1297 int src_scc = e->src->index; local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
cfganal.cc 1298 int src_scc = e->src->index;
1300 src_scc = bb_data[src_scc].scc;
1301 if (src_scc == -1)
1306 if (src_scc == dest_scc)
1308 /* When dest_scc is nested insde src_scc it's not an
1315 if ((tem_dest_scc = bb_data[tem_dest_scc].scc) == src_scc)
1320 /* When src_scc is nested inside dest_scc record an
1322 int tem_src_scc = src_scc;
1345 src_scc = bb_data[src_scc].scc
1294 int src_scc = e->src->index; local
    [all...]
  /src/external/mit/isl/dist/
isl_scheduler.h 212 * src_scc and dst_scc are the source and sink SCCs of an edge with
249 int src_scc; member in struct:isl_sched_graph
isl_scheduler.c 2826 if (graph->src_scc >= 0)
2845 graph->src_scc = graph->edge[i].src->scc;
3469 * to and including graph->src_scc and another for the other SCCs.
3479 &node_scc_at_most, graph->src_scc);
3482 &node_scc_at_least, graph->src_scc + 1);
3749 * to and including graph->src_scc, while the other part contains the other
3781 graph->src_scc + 1, 0);
3786 graph->src_scc, 0);
5610 if (graph->src_scc >= 0)
5684 graph->src_scc = -1
    [all...]
isl_scheduler_clustering.c 1347 c->cluster[i].src_scc = -1;

Completed in 36 milliseconds