reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
673 graph->n_edge = n_edge; 679 struct isl_sched_edge, graph->n_edge); 685 if (!graph->node || !graph->region || (graph->n_edge && !graph->edge) || 732 for (i = 0; i < graph->n_edge; ++i) { 1347 graph->edge[graph->n_edge].src = src; 1348 graph->edge[graph->n_edge].dst = dst; 1349 graph->edge[graph->n_edge].map = map; 1350 graph->edge[graph->n_edge].types = 0; 1351 graph->edge[graph->n_edge].tagged_condition = NULL; 1352 graph->edge[graph->n_edge].tagged_validity = NULL; 1353 set_type(&graph->edge[graph->n_edge], data->type); 1355 graph->edge[graph->n_edge].tagged_condition = 1358 graph->edge[graph->n_edge].tagged_validity = 1361 edge = graph_find_matching_edge(graph, &graph->edge[graph->n_edge]); 1363 graph->n_edge++; 1366 if (edge == &graph->edge[graph->n_edge]) 1368 &graph->edge[graph->n_edge++]); 1370 if (merge_edge(edge, &graph->edge[graph->n_edge]) < 0) 1432 graph->n_edge = 0; 2167 for (i = 0; i < graph->n_edge; ++i) { 2180 for (i = 0; i < graph->n_edge; ++i) { 2213 for (i = 0; i < graph->n_edge; ++i) { 2436 for (i = 0; i < graph->n_edge; ++i) { 2817 for (i = 0; i < graph->n_edge; ++i) { 3284 for (i = 0; i < graph->n_edge; ++i) { 3335 for (i = 0; i < graph->n_edge; ++i) { 3361 for (i = 0; i < graph->n_edge; ++i) { 3512 dst->n_edge = 0; 3513 for (i = 0; i < src->n_edge; ++i) { 3542 dst->edge[dst->n_edge].src = dst_src; 3543 dst->edge[dst->n_edge].dst = dst_dst; 3544 dst->edge[dst->n_edge].map = map; 3545 dst->edge[dst->n_edge].tagged_condition = tagged_condition; 3546 dst->edge[dst->n_edge].tagged_validity = tagged_validity; 3547 dst->edge[dst->n_edge].types = edge->types; 3548 dst->n_edge++; 3556 &dst->edge[dst->n_edge - 1]) < 0) 3604 for (i = 0; i < graph->n_edge; ++i) 4904 for (i = 0; i < graph->n_edge; ++i) { 5275 if (graph->n_edge == 0) 5300 for (i = 0; i < graph->n_edge; ++i) { 5350 for (i = 0; i < graph->n_edge; ++i) 5363 for (i = 0; i < graph->n_edge; ++i) { 5379 for (i = 0; i < graph->n_edge; ++i) 5442 for (i = 0; i < graph->n_edge; ++i) { 5496 for (i = 0; i < graph->n_edge; ++i) { 5841 int i, best = graph->n_edge, best_dist, best_weight; 5843 for (i = 0; i < graph->n_edge; ++i) { 5863 if (best < graph->n_edge) { 6202 for (i = 0; i < graph->n_edge; ++i) { 6627 for (i = 0; i < graph->n_edge; ++i) { 6883 for (i = 0; i < graph->n_edge; ++i) { 7091 for (i = 0; i < graph->n_edge; ++i) { 7213 if (i >= graph->n_edge)