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

References

tools/polly/lib/External/isl/isl_aff.c
 4352 	n = pma1->n * pma2->n;
 4352 	n = pma1->n * pma2->n;
 4357 	for (i = 0; i < pma1->n; ++i) {
 4358 		for (j = 0; j < pma2->n; ++j) {
 5363 	n = pma->n * subs->n;
 5366 	for (i = 0; i < pma->n; ++i) {
 5806 	pa = isl_pw_aff_alloc_size(space, pma->n);
 5807 	for (i = 0; i < pma->n; ++i) {
 6040 	n = pma->n * pa->n;
 6043 	for (i = 0; i < pma->n; ++i) {
 6215 	for (i = 0; i < pma->n; ++i) {
tools/polly/lib/External/isl/isl_aff_map.c
  343 	for (i = 0; i < pma->n; ++i) {
tools/polly/lib/External/isl/isl_map.c
13241 	if (pma->n == 0) {
13257 	for (i = 1; i < pma->n; ++i) {
tools/polly/lib/External/isl/isl_output.c
 3010 	for (i = 0; i < pma->n; ++i) {
 3054 	for (i = 0; i < pma->n - 1; ++i) {
 3063 	return print_aff_c(p, pma->p[pma->n - 1].maff->u.p[0]);
 3074 	if (pma->n < 1)
tools/polly/lib/External/isl/isl_pw_templ.c
   45 	pw->n = 0;
   88 	isl_assert(ctx, pw->n < pw->size, goto error);
   90 	pw->p[pw->n].set = set;
   91 	pw->p[pw->n].FIELD = el;
   92 	pw->n++;
  175 	dup = FN(PW,alloc_size)(isl_space_copy(pw->dim), pw->n);
  180 	for (i = 0; i < pw->n; ++i)
  216 	for (i = 0; i < pw->n; ++i) {
  269 	return pw->n == 0;
  282 	for (i = 0; i < pw->n; ++i) {
  431 	n = (pw1->n + 1) * (pw2->n + 1);
  431 	n = (pw1->n + 1) * (pw2->n + 1);
  438 	for (i = 0; i < pw1->n; ++i) {
  440 		for (j = 0; j < pw2->n; ++j) {
  461 	for (j = 0; j < pw2->n; ++j) {
  463 		for (i = 0; i < pw1->n; ++i)
  501 	if (pw->n + n <= pw->size)
  504 	n += pw->n;
  520 	for (i = 0; i < pw->n; ++i)
  536 	if (pw1->size < pw1->n + pw2->n && pw1->n < pw2->n)
  536 	if (pw1->size < pw1->n + pw2->n && pw1->n < pw2->n)
  536 	if (pw1->size < pw1->n + pw2->n && pw1->n < pw2->n)
  536 	if (pw1->size < pw1->n + pw2->n && pw1->n < pw2->n)
  557 	pw1 = FN(PW,grow)(pw1, pw2->n);
  561 	for (i = 0; i < pw2->n; ++i)
  601 	n = pw1->n * pw2->n;
  601 	n = pw1->n * pw2->n;
  608 	for (i = 0; i < pw1->n; ++i) {
  609 		for (j = 0; j < pw2->n; ++j) {
  687 	for (i = 0; i < pw->n; ++i) {
  720 	for (i = 0; i < pw->n; ++i)
  744 		if (i != pw->n - 1)
  745 			pw->p[i] = pw->p[pw->n - 1];
  746 		pw->n--;
  794 	if (pw->n == 0)
  804 	for (i = pw->n - 1; i >= 0; --i) {
  827 	if (pw->n == 0) {
  836 	for (i = pw->n - 1; i >= 0; --i) {
  911 	for (i = 0; i < pw->n - 1; ++i) {
  915 	pw->p[0].FIELD = pw->p[pw->n - 1].FIELD;
  916 	pw->p[0].set = pw->p[pw->n - 1].set;
  917 	pw->n = 1;
  953 	if (pw->n == 0) {
  978 	if (pw->n == 1) {
  991 	for (i = pw->n - 1; i >= 0; --i) {
  995 		if (i == pw->n - 1) {
 1015 			if (i != pw->n - 1)
 1016 				pw->p[i] = pw->p[pw->n - 1];
 1017 			pw->n--;
 1089 	if (pw->n <= 1)
 1091 	if (isl_sort(pw->p, pw->n, sizeof(pw->p[0]),
 1094 	for (i = pw->n - 1; i >= 1; --i) {
 1105 		for (j = i + 1; j < pw->n; ++j)
 1107 		pw->n--;
 1128 	for (i = 0; i < pw->n; ++i) {
 1153 	if (pw->n == 0 || n == 0)
 1158 	for (i = 0; i < pw->n; ++i) {
 1187 	for (i = 0; i < pw->n; ++i) {
 1222 	for (i = 0; i < pw->n; ++i) {
 1263 	for (i = 0; i < pw->n; ++i) {
 1370 	for (i = 0; i < pw->n; ++i) {
 1423 	for (i = 0; i < pw->n; ++i) {
 1525 	for (i = 0; i < pw->n; ++i) {
 1685 	return pw ? pw->n : 0;
 1697 	for (i = 0; i < pw->n; ++i)
 1801 	for (i = 0; i < pw->n; ++i) {
 1813 	for (i = 0; i < pw->n; ++i) {
 1848 	if (pw->n == 0)
 1855 	for (i = 0; i < pw->n; ++i) {
 1892 	if (pw->n == 0) {
 1904 	for (i = 0; i < pw->n; ++i) {
 1940 	if (pw->n == 0) {
 1952 	for (i = 0; i < pw->n; ++i) {
 1989 	for (i = 0; i < pw->n; ++i) {
 2034 	equal = pw1->n == pw2->n;
 2034 	equal = pw1->n == pw2->n;
 2035 	for (i = 0; equal && i < pw1->n; ++i) {
 2063 	if (pw->n == 0)
 2066 	for (i = 0; i < pw->n; ++i) {
 2158 	for (i = 0; i < pw->n; ++i) {
 2198 	if (pma->n == 0) {
 2212 	for (i = 1; i < pma->n; ++i) {
tools/polly/lib/External/isl/isl_pw_union_opt.c
   35 	list = isl_set_list_alloc(ctx, pw->n);
   36 	for (i = 0; i < pw->n; ++i)
   96 	res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), pw1->n + pw2->n);
   96 	res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), pw1->n + pw2->n);
   99 	while (i < pw1->n || j < pw2->n) {
   99 	while (i < pw1->n || j < pw2->n) {
  104 		if (i < pw1->n && j < pw2->n)
  104 		if (i < pw1->n && j < pw2->n)
  108 			cmp = i < pw1->n ? -1 : 1;
  218 	for (i = 0; i < pw1->n; ++i) {
  219 		for (j = 0; j < pw2->n; ++j) {
tools/polly/lib/External/isl/isl_tab_pip.c
 5869 	for (i = 0; i < opt->n; ++i) {