reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
678 graph->edge = isl_calloc_array(ctx, 685 if (!graph->node || !graph->region || (graph->n_edge && !graph->edge) || 731 if (graph->edge) 733 isl_map_free(graph->edge[i].map); 734 isl_union_map_free(graph->edge[i].tagged_condition); 735 isl_union_map_free(graph->edge[i].tagged_validity); 737 free(graph->edge); 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]); 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) 2168 struct isl_sched_edge *edge = &graph->edge[i]; 2181 struct isl_sched_edge *edge = &graph->edge[i]; 2214 struct isl_sched_edge *edge = &graph->edge[i]; 2437 struct isl_sched_edge *edge = &graph->edge[i]; 2818 if (!is_validity(&graph->edge[i])) 2820 if (graph->edge[i].src == graph->edge[i].dst) 2820 if (graph->edge[i].src == graph->edge[i].dst) 2822 if (graph->edge[i].src->scc == graph->edge[i].dst->scc) 2822 if (graph->edge[i].src->scc == graph->edge[i].dst->scc) 2824 if (graph->edge[i].start > con) 2826 if (graph->edge[i].end <= con) 2828 graph->src_scc = graph->edge[i].src->scc; 2829 graph->dst_scc = graph->edge[i].dst->scc; 3288 if (!is_conditional_validity(&graph->edge[i])) 3290 if (is_validity(&graph->edge[i])) 3293 validity = graph->edge[i].tagged_validity; 3302 set_validity(&graph->edge[i]); 3340 if (!is_condition(&graph->edge[i])) 3342 if (is_local(&graph->edge[i])) 3344 local = is_condition_false(&graph->edge[i]); 3352 umap = isl_union_map_copy(graph->edge[i].tagged_condition); 3356 umap = isl_union_map_copy(graph->edge[i].tagged_condition); 3362 if (update_edge(ctx, graph, &graph->edge[i]) < 0) 3514 struct isl_sched_edge *edge = &src->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; 3556 &dst->edge[dst->n_edge - 1]) < 0) 3605 if (edge_pred(&graph->edge[i], data)) 4905 struct isl_sched_edge *edge = &graph->edge[i]; 5303 empty = isl_map_plain_is_empty(graph->edge[i].map); 5308 if (is_any_validity(&graph->edge[i])) 5351 if (is_condition(&graph->edge[i])) 5352 clear_local(&graph->edge[i]); 5364 if (is_condition(&graph->edge[i])) 5366 if (is_conditional_validity(&graph->edge[i])) 5380 if (is_coincidence(&graph->edge[i])) 5407 struct isl_sched_edge *edge = &graph->edge[edge_index]; 5446 if (!is_condition(&graph->edge[i])) 5448 if (is_local(&graph->edge[i])) 5451 condition = graph->edge[i].tagged_condition; 5461 set_local(&graph->edge[i]); 5463 local = is_condition_false(&graph->edge[i]); 5501 if (!is_conditional_validity(&graph->edge[i])) 5512 umap = isl_union_map_copy(graph->edge[i].tagged_validity); 5517 umap = isl_union_map_copy(graph->edge[i].tagged_validity); 5844 struct isl_sched_edge *edge = &graph->edge[i]; 5950 data.src = graph->edge[edge].src - graph->node; 5951 data.dst = graph->edge[edge].dst - graph->node; 6203 struct isl_sched_edge *edge = &graph->edge[i]; 6628 struct isl_sched_edge *edge = &graph->edge[i]; 6884 struct isl_sched_edge *edge = &graph->edge[i]; 6923 int edge_weight = graph->edge[edge].weight; 6928 if (any_no_merge(graph, c->scc_in_merge, &graph->edge[edge])) 6934 if (!merged && edge_weight == graph->edge[edge].weight) 6935 graph->edge[edge].no_merge = 1; 7092 struct isl_sched_edge *edge = &graph->edge[i];