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

References

tools/polly/lib/External/isl/isl_constraint.c
   58 	case isl_dim_in:	return 1 + dim->nparam;
   59 	case isl_dim_out:	return 1 + dim->nparam + dim->n_in;
   60 	case isl_dim_div:	return 1 + dim->nparam + dim->n_in + dim->n_out;
tools/polly/lib/External/isl/isl_local_space.c
  262 	case isl_dim_in:	return 1 + dim->nparam;
  263 	case isl_dim_out:	return 1 + dim->nparam + dim->n_in;
  264 	case isl_dim_div:	return 1 + dim->nparam + dim->n_in + dim->n_out;
tools/polly/lib/External/isl/isl_map.c
   56 	case isl_dim_param:	return dim->nparam;
   59 	case isl_dim_all:	return dim->nparam + dim->n_in + dim->n_out;
   68 	case isl_dim_in:	return 1 + dim->nparam;
   69 	case isl_dim_out:	return 1 + dim->nparam + dim->n_in;
  119 	case isl_dim_in:	return 1 + space->nparam;
  120 	case isl_dim_out:	return 1 + space->nparam + space->n_in;
  121 	case isl_dim_div:	return 1 + space->nparam + space->n_in +
  183 	return bmap ? bmap->dim->nparam : 0;
  208 	return map ? map->dim->nparam : 0;
 1834 	isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
 1834 	isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
 3320 			bset->ref, bset->dim->nparam, bset->dim->n_out,
 3337 		bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
 3444 			set->ref, set->n, set->dim->nparam, set->dim->n_out,
 3465 			map->ref, map->n, map->dim->nparam, map->dim->n_in,
 5348 	if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
 7091 	bset->dim->nparam = 0;
 7095 		bset->dim->nparam = bset->dim->n_out;
 8229 	nparam = dims->nparam;
 8289 	nparam = space->nparam;
tools/polly/lib/External/isl/isl_mat.c
 1366 	isl_assert(ctx, bset->dim->nparam == 0, goto error);
tools/polly/lib/External/isl/isl_polynomial.c
   40 	case isl_dim_in:	return dim->nparam;
   41 	case isl_dim_out:	return dim->nparam + dim->n_in;
tools/polly/lib/External/isl/isl_reordering.c
  123 	exp = isl_reordering_alloc(alignee->ctx, alignee->nparam);
  129 	for (i = 0; i < alignee->nparam; ++i) {
  135 		for (j = 0; j < aligner->nparam; ++j) {
  142 		if (j < aligner->nparam) {
tools/polly/lib/External/isl/isl_space.c
   38 	dim->nparam = nparam;
  143 		isl_assert(ctx, pos < dim->nparam,
  149 		return pos + dim->nparam;
  153 		return pos + dim->nparam + dim->n_in;
  240 	case isl_dim_in:	return dim->nparam;
  241 	case isl_dim_out:	return dim->nparam + dim->n_in;
  249 	case isl_dim_param:	return dim->nparam;
  252 	case isl_dim_all:	return dim->nparam + dim->n_in + dim->n_out;
  297 	dup = isl_space_alloc(dim->ctx, dim->nparam, dim->n_in, dim->n_out);
  699 	for (i = 0; i < space->nparam && i < space->n_id; ++i) {
  898 	if (space->nparam == nparam &&
  902 	isl_assert(space->ctx, space->nparam <= nparam, goto error);
  920 		get_ids(space, isl_dim_param, 0, space->nparam, ids);
  928 	space->nparam = nparam;
  954 				space->nparam + n, space->n_in, space->n_out);
  966 				space->nparam, space->n_in + n, space->n_out);
  969 				space->nparam, space->n_in, space->n_out + n);
 1056 			     space->nparam + space->n_in + space->n_out + n);
 1060 		s[isl_dim_param - o] = space->nparam;
 1077 		space->n_id = space->nparam + space->n_in + space->n_out + n;
 1080 	case isl_dim_param:	space->nparam += n; break;
 1135 				 space->nparam + space->n_in + space->n_out);
 1139 		s[isl_dim_param - o] = space->nparam;
 1164 		space->n_id = space->nparam + space->n_in + space->n_out;
 1168 	case isl_dim_param:	space->nparam += n; break;
 1175 	case isl_dim_param:	space->nparam -= n; break;
 1228 	dim = isl_space_alloc(left->ctx, left->nparam, left->n_in, right->n_out);
 1599 	n_id = space->nparam + space->n_out + space->n_out;
 1604 		get_ids(space, isl_dim_param, 0, space->nparam, ids);
 1606 			ids + space->nparam);
 1747 	case isl_dim_param:	dim->nparam -= num; break;
 1891 	    dim->nparam == 0 && dim->n_in == 0 && dim->n_id == 0)
 1896 	dim->n_out += dim->nparam + dim->n_in + n_div;
 1897 	dim->nparam = 0;
 2017 	isl_hash_byte(hash, space->nparam % 256);
 2019 	for (i = 0; i < space->nparam; ++i) {
 2188 				    dim->nparam, dim->n_in + dim->n_out);
 2535 	if (space->nparam == 0)
 2538 	if (off + space->nparam > space->n_id)
 2540 	for (i = 0; i < space->nparam; ++i)