reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
3081 if (list1->n < 1 || list2->n < 1) 3081 if (list1->n < 1 || list2->n < 1) 3086 for (i = 0; i < list1->n; ++i) 3087 for (j = 0; j < list2->n; ++j) { 3682 if (list->n < 1) 3687 for (i = 1; i < list->n; ++i) 3745 if (list->n == 0) 3748 n = list->n;tools/polly/lib/External/isl/isl_aff_map.c
260 for (i = 0; i < list->n; ++i) {
tools/polly/lib/External/isl/isl_ast.c1341 for (i = 0; i < list->n; ++i) { 2487 for (i = 0; i < list->n; ++i) 2580 for (i = 0; i < list->n; ++i)tools/polly/lib/External/isl/isl_ast_graft.c
1206 if (list2->n == 0) { 1210 if (list1->n == 0) { 1216 for (i = 0; i < list2->n; ++i) { 1222 for (j = list1->n; j >= 0; --j) { 1270 if (i < list2->n)tools/polly/lib/External/isl/isl_list_templ.c
53 list->n = 0; 74 dup = FN(LIST(EL),alloc)(FN(LIST(EL),get_ctx)(list), list->n); 77 for (i = 0; i < list->n; ++i) 107 if (list->ref == 1 && list->n + n <= list->size) 111 new_size = ((list->n + n + 1) * 3) / 2; 121 if (list->n + n <= list->size && list->size < new_size) 128 for (i = 0; i < list->n; ++i) 141 if (index < 0 || index >= list->n) 153 list->p[list->n] = el; 154 list->n++; 171 if (first + n > list->n || first + n < first) 181 for (i = first; i + n < list->n; ++i) 183 list->n -= n; 204 if (pos > list->n) 208 if (list->ref == 1 && list->size > list->n) { 209 for (i = list->n; i > pos; --i) 211 list->n++; 216 res = FN(LIST(EL),alloc)(ctx, list->n + 1); 220 for (i = pos; i < list->n; ++i) 242 for (i = 0; i < list->n; ++i) 253 return list ? list->n : 0; 381 for (i = 0; i < list->n; ++i) { 403 n = list->n; 447 if (list->n <= 1) 453 if (isl_sort(list->p, list->n, sizeof(list->p[0]), 529 if (list->n == 0) 531 if (list->n == 1) 535 n = list->n; 593 for (i = 0; i < list2->n; ++i) 614 if (list1->ref == 1 && list1->n + list2->n <= list1->size) 614 if (list1->ref == 1 && list1->n + list2->n <= list1->size) 618 res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n); 618 res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n); 619 for (i = 0; i < list1->n; ++i) 621 for (i = 0; i < list2->n; ++i) 641 for (i = 0; i < list->n; ++i) {