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

  /src/external/mit/isl/dist/
isl_scheduler.c 458 * with "n_node" nodes and "n_edge" edge and initialize the corresponding
462 int n_node, int n_edge)
467 graph->n_edge = n_edge;
473 struct isl_sched_edge, graph->n_edge);
475 graph->intra_hmap = isl_map_to_basic_set_alloc(ctx, 2 * n_edge);
476 graph->intra_hmap_param = isl_map_to_basic_set_alloc(ctx, 2 * n_edge);
477 graph->inter_hmap = isl_map_to_basic_set_alloc(ctx, 2 * n_edge);
479 if (!graph->node || !graph->region || (graph->n_edge && !graph->edge) ||
526 for (i = 0; i < graph->n_edge; ++i)
567 int n_edge; local
3634 int i, n = 0, n_edge = 0; local
5111 int n_edge; local
    [all...]
isl_scheduler.h 194 * n_edge is the number of edges
240 int n_edge; member in struct:isl_sched_graph
isl_scheduler_clustering.c 101 * Return graph->n_edge if no such edge can be found.
117 int i, best = graph->n_edge, best_dist, best_weight;
119 for (i = 0; i < graph->n_edge; ++i) {
139 if (best < graph->n_edge) {
481 for (i = 0; i < graph->n_edge; ++i) {
913 for (i = 0; i < graph->n_edge; ++i) {
1174 for (i = 0; i < graph->n_edge; ++i) {
1385 for (i = 0; i < graph->n_edge; ++i) {
1549 if (i >= graph->n_edge)

Completed in 48 milliseconds