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

References

tools/polly/lib/External/isl/isl_flow.c
 1161 		for (j = acc->n_must-1; j >=0; --j) {
 1161 		for (j = acc->n_must-1; j >=0; --j) {
 1161 		for (j = acc->n_must-1; j >=0; --j) {
 1163 			space = isl_map_get_space(res->dep[2 * j].map);
 1164 			must_rel[j] = isl_map_empty(space);
 1165 			may_rel[j] = isl_map_copy(must_rel[j]);
 1165 			may_rel[j] = isl_map_copy(must_rel[j]);
 1168 		for (j = acc->n_must - 1; j >= 0; --j) {
 1168 		for (j = acc->n_must - 1; j >= 0; --j) {
 1168 		for (j = acc->n_must - 1; j >= 0; --j) {
 1173 			plevel = acc->level_before(acc->source[j].data,
 1180 			T = last_source(acc, mustdo, j, level, &rest);
 1181 			must_rel[j] = isl_map_union_disjoint(must_rel[j], T);
 1181 			must_rel[j] = isl_map_union_disjoint(must_rel[j], T);
 1184 			if (intermediate_sources(acc, must_rel, j, level) < 0)
 1187 			T = last_source(acc, maydo, j, level, &rest);
 1188 			may_rel[j] = isl_map_union_disjoint(may_rel[j], T);
 1188 			may_rel[j] = isl_map_union_disjoint(may_rel[j], T);
 1191 			if (intermediate_sources(acc, may_rel, j, level) < 0)
 1198 		for (j = j - 1; j >= 0; --j) {
 1198 		for (j = j - 1; j >= 0; --j) {
 1198 		for (j = j - 1; j >= 0; --j) {
 1198 		for (j = j - 1; j >= 0; --j) {
 1201 			plevel = acc->level_before(acc->source[j].data,
 1208 			if (intermediate_sources(acc, must_rel, j, level) < 0)
 1210 			if (intermediate_sources(acc, may_rel, j, level) < 0)
 1216 		for (j = 0; j < acc->n_may; ++j) {
 1216 		for (j = 0; j < acc->n_may; ++j) {
 1216 		for (j = 0; j < acc->n_may; ++j) {
 1221 			plevel = acc->level_before(acc->source[acc->n_must + j].data,
 1228 			T = all_sources(acc, isl_set_copy(maydo), j, level);
 1229 			res->dep[2 * acc->n_must + j].map =
 1230 			    isl_map_union(res->dep[2 * acc->n_must + j].map, T);
 1231 			T = all_sources(acc, isl_set_copy(mustdo), j, level);
 1233 			res->dep[2 * acc->n_must + j].map =
 1234 			    isl_map_union(res->dep[2 * acc->n_must + j].map, T);
 1238 			T = res->dep[2 * acc->n_must + j].map;
 1240 							j, level);
 1241 			res->dep[2 * acc->n_must + j].map = T;
 1244 		for (j = acc->n_must - 1; j >= 0; --j) {
 1244 		for (j = acc->n_must - 1; j >= 0; --j) {
 1244 		for (j = acc->n_must - 1; j >= 0; --j) {
 1245 			res->dep[2 * j].map =
 1246 				isl_map_union_disjoint(res->dep[2 * j].map,
 1247 							     must_rel[j]);
 1248 			res->dep[2 * j + 1].map =
 1249 				isl_map_union_disjoint(res->dep[2 * j + 1].map,
 1250 							     may_rel[j]);
 1266 		for (j = 0; j < acc->n_must; ++j)
 1266 		for (j = 0; j < acc->n_must; ++j)
 1266 		for (j = 0; j < acc->n_must; ++j)
 1267 			isl_map_free(must_rel[j]);
 1269 		for (j = 0; j < acc->n_must; ++j)
 1269 		for (j = 0; j < acc->n_must; ++j)
 1269 		for (j = 0; j < acc->n_must; ++j)
 1270 			isl_map_free(may_rel[j]);