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

References

tools/polly/lib/External/isl/isl_scheduler.c
  134 	return isl_space_has_equal_tuples(node->space, space);
  412 		hash = isl_space_get_tuple_hash(graph->node[i].space);
  415 					    graph->node[i].space, 1);
  524 	isl_ctx *ctx = isl_space_get_ctx(src->space);
  703 	isl_space_free(node->space);
 1015 	node->space = space;
 1214 		dom = isl_set_universe(isl_space_copy(src->space));
 1218 		ran = isl_set_universe(isl_space_copy(dst->space));
 1562 		space = isl_space_copy(node->space);
 2049 	nparam = isl_space_dim(node->space, isl_dim_param);
 2128 	nparam = isl_space_dim(src->space, isl_dim_param);
 2756 	nparam = isl_space_dim(graph->node[0].space, isl_dim_param);
 3067 		space = isl_space_copy(node->space);
 3402 	set = isl_set_universe(isl_space_copy(graph->node[i].space));
 3408 		set = isl_set_universe(isl_space_copy(graph->node[i].space));
 3472 		dst->node[j].space = isl_space_copy(src->node[i].space);
 3472 		dst->node[j].space = isl_space_copy(src->node[i].space);
 3489 		if (!dst->node[j].space || !dst->node[j].sched)
 3526 		dst_src = graph_find_node(ctx, dst, edge->src->space);
 3527 		dst_dst = graph_find_node(ctx, dst, edge->dst->space);
 4005 		node = graph_find_node(ctx, graph, node->space);
 4444 	ctx = isl_space_get_ctx(node->space);
 4901 	space = isl_space_copy(graph->node[0].space);
 6002 	space = isl_space_copy(scc->node[0].space);
 6436 	scc_node = graph_find_node(ctx, &c->scc[node->scc], node->space);