reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
236 acc->n_must = 0; 256 for (i = 0; i < acc->n_must + acc->n_may; ++i) 292 isl_assert(ctx, acc->n_must + acc->n_may < acc->max_source, goto error); 296 acc->source[acc->n_must + acc->n_may] = 297 acc->source[acc->n_must]; 298 acc->source[acc->n_must].map = source; 299 acc->source[acc->n_must].data = source_user; 300 acc->source[acc->n_must].must = 1; 301 acc->n_must++; 303 acc->source[acc->n_must + acc->n_may].map = source; 304 acc->source[acc->n_must + acc->n_may].data = source_user; 305 acc->source[acc->n_must + acc->n_may].must = 0; 385 if (acc->n_must <= 1) 388 if (isl_sort(acc->source, acc->n_must, sizeof(struct isl_labeled_map), 444 n = 2 * acc->n_must + acc->n_may; 450 for (i = 0; i < acc->n_must; ++i) { 464 for (i = acc->n_must; i < acc->n_must + acc->n_may; ++i) { 464 for (i = acc->n_must; i < acc->n_must + acc->n_may; ++i) { 469 dep->dep[acc->n_must + i].map = isl_map_empty(dim); 470 dep->dep[acc->n_must + i].data = acc->source[i].data; 471 dep->dep[acc->n_must + i].must = 0; 472 if (!dep->dep[acc->n_must + i].map) 787 write_map = isl_map_copy(acc->source[acc->n_must + j].map); 817 write_map = isl_map_copy(acc->source[acc->n_must + j].map); 821 dim = isl_space_join(isl_map_get_space(acc->source[acc->n_must + j].map), 845 int depth = 2 * isl_map_dim(acc->source[acc->n_must + j].map, 848 for (k = 0; k < acc->n_must; ++k) { 856 acc->source[acc->n_must + j].data); 983 for (i = acc->n_must - 1; i >= 0; --i) { 1008 pos = acc->n_must + j; 1016 pos = 2 * acc->n_must + j; 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) { 1221 plevel = acc->level_before(acc->source[acc->n_must + j].data, 1229 res->dep[2 * acc->n_must + j].map = 1230 isl_map_union(res->dep[2 * acc->n_must + j].map, T); 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; 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) 1308 if (acc->n_must == 0)