haiku-buildtools/isl/isl_flow.c

191 	struct isl_labeled_map	*dep;
378 	struct isl_flow *dep;
384 	dep = isl_calloc_type(ctx, struct isl_flow);
385 	if (!dep)
389 	dep->dep = isl_calloc_array(ctx, struct isl_labeled_map, n);
390 	if (n && !dep->dep)
393 	dep->n_source = n;
399 		dep->dep[2 * i].map = isl_map_empty(dim);
400 		dep->dep[2 * i + 1].map = isl_map_copy(dep->dep[2 * i].map);
401 		dep->dep[2 * i].data = acc->source[i].data;
402 		dep->dep[2 * i + 1].data = acc->source[i].data;
403 		dep->dep[2 * i].must = 1;
404 		dep->dep[2 * i + 1].must = 0;
405 		if (!dep->dep[2 * i].map || !dep->dep[2 * i + 1].map)
413 		dep->dep[acc->n_must + i].map = isl_map_empty(dim);
414 		dep->dep[acc->n_must + i].data = acc->source[i].data;
415 		dep->dep[acc->n_must + i].must = 0;
416 		if (!dep->dep[acc->n_must + i].map)
420 	return dep;
422 	isl_flow_free(dep);
433 	int (*fn)(__isl_take isl_map *dep, int must, void *dep_user, void *user),
442 		if (isl_map_plain_is_empty(deps->dep[i].map))
444 		if (fn(isl_map_copy(deps->dep[i].map), deps->dep[i].must,
445 				deps->dep[i].data, user) < 0)
473 	if (deps->dep) {
475 			isl_map_free(deps->dep[i].map);
476 		free(deps->dep);
508 /* Compute the partial lexicographic maximum of "dep" on domain "sink",
514  * whereas the domain of "dep" is a wrapped map, mapping sink iterations
521 	__isl_keep isl_access_info *acc, __isl_take isl_map *dep,
531 		return isl_map_partial_lexmax(dep, sink, empty);
533 	source_map = isl_map_copy(dep);
546 		dep = isl_map_intersect_range(dep, isl_set_copy(restr->source));
552 		isl_space *space = isl_map_get_space(dep);
553 		isl_map_free(dep);
554 		dep = isl_map_empty(space);
557 	res = isl_map_partial_lexmax(dep, sink, empty);
565 	isl_map_free(dep);
849 		isl_map *dep;
855 		dim = isl_map_get_space(res->dep[i].map);
860 		dep = isl_map_apply_range(isl_map_copy(acc->source[i].map),
862 		dep = isl_map_intersect(dep, before);
864 					    isl_map_range(isl_map_copy(dep)));
865 		res->dep[i].map = isl_map_union(res->dep[i].map, dep);
889  *		    for all possible last accesses dep of w at l
891  *								of dep
893  *			and replace possible last accesses dep by the remainder
944 			must_rel[j] = isl_map_empty_like(res->dep[j].map);
997 			res->dep[2 * acc->n_must + j].map =
998 			    isl_map_union(res->dep[2 * acc->n_must + j].map, T);
1001 			res->dep[2 * acc->n_must + j].map =
1002 			    isl_map_union(res->dep[2 * acc->n_must + j].map, T);
1006 			T = res->dep[2 * acc->n_must + j].map;
1009 			res->dep[2 * acc->n_must + j].map = T;
1013 			res->dep[2 * j].map =
1014 				isl_map_union_disjoint(res->dep[2 * j].map,
1016 			res->dep[2 * j + 1].map =
1017 				isl_map_union_disjoint(res->dep[2 * j + 1].map,
1081 		res->dep[j].map = isl_map_apply_range(res->dep[j].map,
1083 		if (!res->dep[j].map)
1347 		isl_union_map *dep;
1348 		dep = isl_union_map_from_map(isl_map_copy(flow->dep[i].map));
1349 		if (flow->dep[i].must)
1350 			data->must_dep = isl_union_map_union(data->must_dep, dep);
1352 			data->may_dep = isl_union_map_union(data->may_dep, dep);