reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
1139 if (!acc) 1142 res = isl_flow_alloc(acc); 1145 ctx = isl_map_get_ctx(acc->sink.map); 1147 depth = 2 * isl_map_dim(acc->sink.map, isl_dim_in) + 1; 1148 mustdo = isl_map_domain(isl_map_copy(acc->sink.map)); 1155 must_rel = isl_calloc_array(ctx, struct isl_map *, acc->n_must); 1156 may_rel = isl_calloc_array(ctx, struct isl_map *, acc->n_must); 1161 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, 1173 plevel = acc->level_before(acc->source[j].data, 1174 acc->sink.data); 1180 T = last_source(acc, mustdo, j, level, &rest); 1184 if (intermediate_sources(acc, must_rel, j, level) < 0) 1187 T = last_source(acc, maydo, j, level, &rest); 1191 if (intermediate_sources(acc, may_rel, j, level) < 0) 1201 plevel = acc->level_before(acc->source[j].data, 1201 plevel = acc->level_before(acc->source[j].data, 1202 acc->sink.data); 1208 if (intermediate_sources(acc, must_rel, j, level) < 0) 1210 if (intermediate_sources(acc, may_rel, j, level) < 0) 1214 handle_coscheduled(acc, must_rel, may_rel, res); 1216 for (j = 0; j < acc->n_may; ++j) { 1221 plevel = acc->level_before(acc->source[acc->n_must + j].data, 1221 plevel = acc->level_before(acc->source[acc->n_must + j].data, 1221 plevel = acc->level_before(acc->source[acc->n_must + j].data, 1222 acc->sink.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; 1239 T = all_intermediate_sources(acc, T, must_rel, may_rel, 1241 res->dep[2 * acc->n_must + j].map = T; 1244 for (j = acc->n_must - 1; j >= 0; --j) { 1266 for (j = 0; j < acc->n_must; ++j) 1269 for (j = 0; j < acc->n_must; ++j)