reference, declarationdefinition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced

References

tools/polly/lib/External/isl/isl_scheduler.c
  456 	return edge->src == temp->src && edge->dst == temp->dst;
  456 	return edge->src == temp->src && edge->dst == temp->dst;
  470 	hash = isl_hash_builtin(hash, edge->dst);
  530 	hash = isl_hash_builtin(hash, temp.dst);
  589 		edge = graph_find_edge(graph, i, model->src, model->dst);
  613 		entry = graph_find_edge_entry(graph, i, edge->src, edge->dst);
 1348 	graph->edge[graph->n_edge].dst = dst;
 1711 	if (edge->dst->compressed)
 1713 				    isl_multi_aff_copy(edge->dst->decompress));
 1964 	struct isl_sched_node *dst = edge->dst;
 2119 	struct isl_sched_node *dst = edge->dst;
 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) {
 2820 		if (graph->edge[i].src == graph->edge[i].dst)
 2822 		if (graph->edge[i].src->scc == graph->edge[i].dst->scc)
 2829 		graph->dst_scc = graph->edge[i].dst->scc;
 3170 	id = specializer(edge->src, edge->dst);
 3260 	sched = node_extract_schedule(edge->dst);
 3527 		dst_dst = graph_find_node(ctx, dst, edge->dst->space);
 3543 		dst->edge[dst->n_edge].dst = dst_dst;
 3671 	return edge->src->scc == scc && edge->dst->scc == scc;
 3676 	return edge->dst->scc <= scc;
 4619 	if (edge->src != edge->dst)
 4643 	if (edge->src == edge->dst)
 4650 	if (edge->dst->compressed)
 4652 				    isl_multi_aff_copy(edge->dst->decompress));
 5411 	dst_sched = final_row(edge->dst);
 5856 		    bad_cluster(&c->scc[edge->dst->scc]))
 5858 		dist = c->scc_cluster[edge->dst->scc] -
 5951 	data.dst = graph->edge[edge].dst - graph->node;
 6207 		if (!scc_in_merge[edge->dst->scc])
 6568 	t = extract_node_transformation(ctx, edge->dst, c, merge_graph);
 6635 		if (!c->scc_in_merge[edge->dst->scc])
 6637 		if (c->scc_cluster[edge->dst->scc] ==
 6888 		if (!scc_in_merge[edge->dst->scc])
 6952 	return edge->src->cluster == cluster && edge->dst->cluster == cluster;
 7094 		struct isl_sched_node *dst = edge->dst;
 7105 		    bad_cluster(&c->scc[edge->dst->scc]))
 7107 		if (c->scc_cluster[edge->dst->scc] ==