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

References

tools/polly/lib/External/isl/isl_scheduler.c
  823 	node->max = isl_vec_alloc(ctx, node->nvar);
  854 	v = isl_vec_alloc(ctx, node->nvar);
  858 	for (i = 0; i < node->nvar; ++i) {
  863 	for (i = 0; i < node->nvar; ++i) {
  873 		for (j = 0; j < node->nvar; ++j) {
  883 	for (i = 0; i < node->nvar; ++i)
 1016 	node->nvar = nvar;
 1567 	for (i = 0; i < node->nvar; ++i) {
 1753 	return node->start + 2 * node->nvar + node->nparam;
 1766 	return node->start + 2 * node->nvar;
 1790 	return node_var_coef_offset(node) + 2 * (node->nvar - 1 - i);
 1827 	isl_dim_map_range(dim_map, pos, -2, offset, 1, node->nvar, -s);
 1828 	isl_dim_map_range(dim_map, pos + 1, -2, offset, 1, node->nvar, s);
 1872 	isl_dim_map_range(dim_map, pos, -2, offset + src->nvar, 1,
 1873 			  dst->nvar, -s);
 1874 	isl_dim_map_range(dim_map, pos + 1, -2, offset + src->nvar, 1,
 1875 			  dst->nvar, s);
 1882 	isl_dim_map_range(dim_map, pos, -2, offset, 1, src->nvar, s);
 1883 	isl_dim_map_range(dim_map, pos + 1, -2, offset, 1, src->nvar, -s);
 2285 			      1 + node->nparam, node->nvar);
 2516 		*n_ineq += graph->node[i].nparam + 2 * graph->node[i].nvar;
 2579 	for (i = 0; i < node->nvar; ++i) {
 2707 		for (j = 0; j < 2 * node->nvar; ++j)
 2764 		total += 1 + node->nparam + 2 * node->nvar;
 2843 	return node->nvar - node->rank >= graph->maxvar - graph->n_row;
 2932 	csol = isl_vec_alloc(isl_vec_get_ctx(sol), node->nvar);
 2937 	for (i = 0; i < node->nvar; ++i)
 2938 		isl_int_sub(csol->el[node->nvar - 1 - i],
 2991 		for (j = 0; j < node->nvar; ++j)
 3030 	for (j = 0; j < node->nvar; ++j) {
 3479 		dst->node[j].nvar = src->node[i].nvar;
 3479 		dst->node[j].nvar = src->node[i].nvar;
 3581 		nvar = node->nvar + graph->n_row - node->rank;
 4191 		total += 1 + node->nparam + 2 * node->nvar;
 4332 	if (node->nvar == node->rank)
 4341 					node->nvar - node->rank) == -1;
 4387 	if (node->nvar <= 1)
 4388 		return node->nvar;
 4394 	for (i = 0; i < node->nvar; ++i) {
 4413 		for (j = 0; j < node->nvar; ++j) {
 4419 		if (j < node->nvar)
 4588 			if (pos < node->nvar)
 6280 			slack = node->nvar - node->rank;
 6320 			slack = node->nvar - node->rank;
 6707 	n_var = node->nvar;