reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
456 return edge->src == temp->src && edge->dst == temp->dst; 456 return edge->src == temp->src && edge->dst == temp->dst; 469 hash = isl_hash_builtin(hash, edge->src); 529 hash = isl_hash_builtin(hash, temp.src); 589 edge = graph_find_edge(graph, i, model->src, model->dst); 613 entry = graph_find_edge_entry(graph, i, edge->src, edge->dst); 1347 graph->edge[graph->n_edge].src = src; 1708 if (edge->src->compressed) 1710 isl_multi_aff_copy(edge->src->decompress)); 1927 struct isl_sched_node *node = edge->src; 1963 struct isl_sched_node *src = edge->src; 2040 struct isl_sched_node *node = edge->src; 2118 struct isl_sched_node *src = edge->src; 2174 if (edge->src != edge->dst) 2187 if (edge->src == edge->dst) 2220 if (edge->src == edge->dst && 2223 if (edge->src != edge->dst && 2228 if (edge->src == edge->dst && 2231 if (edge->src != edge->dst && 2344 if (edge->src != edge->dst) 2393 if (edge->src != edge->dst) { 2400 coef = intra_coefficients(graph, edge->src, copy, 1); 2407 coef = intra_coefficients(graph, edge->src, copy, 0); 2820 if (graph->edge[i].src == graph->edge[i].dst) 2822 if (graph->edge[i].src->scc == graph->edge[i].dst->scc) 2828 graph->src_scc = graph->edge[i].src->scc; 3170 id = specializer(edge->src, edge->dst); 3258 sched = node_extract_schedule(edge->src); 3526 dst_src = graph_find_node(ctx, dst, edge->src->space); 3542 dst->edge[dst->n_edge].src = dst_src; 3671 return edge->src->scc == scc && edge->dst->scc == scc; 3681 return edge->src->scc >= scc; 4617 struct isl_sched_node *node = edge->src; 4619 if (edge->src != edge->dst) 4643 if (edge->src == edge->dst) 4647 if (edge->src->compressed) 4649 isl_multi_aff_copy(edge->src->decompress)); 5410 src_sched = final_row(edge->src); 5855 if (bad_cluster(&c->scc[edge->src->scc]) || 5859 c->scc_cluster[edge->src->scc]; 5950 data.src = graph->edge[edge].src - graph->node; 6205 if (!scc_in_merge[edge->src->scc]) 6566 t = extract_node_transformation(ctx, edge->src, c, merge_graph); 6633 if (!c->scc_in_merge[edge->src->scc]) 6638 c->scc_cluster[edge->src->scc]) 6886 if (!scc_in_merge[edge->src->scc]) 6952 return edge->src->cluster == cluster && edge->dst->cluster == cluster; 7093 struct isl_sched_node *src = edge->src; 7104 if (bad_cluster(&c->scc[edge->src->scc]) || 7108 c->scc_cluster[edge->src->scc])