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

  /src/external/mit/isl/dist/
isl_scheduler_clustering.c 87 graph->n_total_row == graph->band_start;
278 nvar = scc->n_total_row - scc->band_start;
340 n = c->scc[i].n_total_row - start;
551 nvar = scc->n_total_row - scc->band_start;
591 nvar = scc->n_total_row - scc->band_start;
656 for (i = graph->band_start; i < graph->n_total_row; ++i)
722 n = c->scc[node->scc].n_total_row - start;
733 n = merge_graph->n_total_row;
956 if (merge_graph->n_total_row == merge_graph->band_start)
960 merge_graph->n_total_row < merge_graph->maxvar
    [all...]
isl_scheduler.h 185 * n_total_row is the current number of rows in the node schedules
234 int n_total_row; member in struct:isl_sched_graph
isl_scheduler.c 2983 if (graph->n_total_row >= graph->max_row)
3012 node->coincident[graph->n_total_row] = coincident;
3018 graph->n_total_row++;
3403 graph->band_start = graph->n_total_row;
3658 sub->n_total_row = graph->n_total_row;
3727 drop = graph->n_total_row - graph->band_start;
3728 graph->n_total_row -= drop;
3820 end = graph->n_total_row;
5562 * graph->n_total_row), deciding whether to drop it or add it to "node
    [all...]

Completed in 27 milliseconds