Cross Reference: /src/external/mit/isl/dist/isl_convex

Lines Matching refs:bset1
745 	__isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
752 	dim = isl_basic_set_dim(bset1, isl_dim_set);
756 	hull = isl_basic_set_alloc(bset1->ctx, 0, 2 + 3 * dim, 0,
757 				1 + dim + bset1->n_eq + bset2->n_eq,
758 				2 + bset1->n_ineq + bset2->n_ineq);
759 	bset[0] = bset1;
798 	isl_basic_set_free(bset1);
802 	isl_basic_set_free(bset1);
865 /* Compute the lineality space of the convex hull of bset1 and bset2.
867  * We first compute the intersection of the recession cone of bset1
872 	__isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
878 	dim = isl_basic_set_dim(bset1, isl_dim_all);
882 	lin = isl_basic_set_alloc_space(isl_basic_set_get_space(bset1), 0,
883 					bset1->n_eq + bset2->n_eq,
884 					bset1->n_ineq + bset2->n_ineq);
888 	for (i = 0; i < bset1->n_eq; ++i) {
893 		isl_seq_cpy(lin->eq[k] + 1, bset1->eq[i] + 1, dim);
895 	for (i = 0; i < bset1->n_ineq; ++i) {
900 		isl_seq_cpy(lin->ineq[k] + 1, bset1->ineq[i] + 1, dim);
917 	isl_basic_set_free(bset1);
922 	isl_basic_set_free(bset1);
994 	__isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
1003 	total = isl_basic_set_dim(bset1, isl_dim_all);
1008 	    2 * bset1->n_eq + bset1->n_ineq + 2 * bset2->n_eq + bset2->n_ineq;
1009 	space = isl_space_set_alloc(bset1->ctx, 0, n);
1029 		for (j = 0; j < bset1->n_eq; ++j) {
1030 			isl_int_set(lp->eq[k][n], bset1->eq[j][i]); n++;
1031 			isl_int_neg(lp->eq[k][n], bset1->eq[j][i]); n++;
1033 		for (j = 0; j < bset1->n_ineq; ++j) {
1034 			isl_int_set(lp->eq[k][n], bset1->ineq[j][i]); n++;
1047 	isl_basic_set_free(bset1);
1051 	isl_basic_set_free(bset1);
1058  * to the input polyhedra bset1 and bset2.
1077 	__isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
1087 	if (!bset1 || !bset2)
1089 	lp = valid_direction_lp(isl_basic_set_copy(bset1),
1097 	d = isl_basic_set_dim(bset1, isl_dim_all);
1100 	dir = isl_vec_alloc(bset1->ctx, 1 + d);
1107 	for (i = 0; i < bset1->n_eq; ++i) {
1111 				bset1->ctx->one, dir->block.data,
1112 				sample->block.data[n], bset1->eq[i], 1 + d);
1116 	for (i = 0; i < bset1->n_ineq; ++i)
1118 				bset1->ctx->one, dir->block.data,
1119 				sample->block.data[n++], bset1->ineq[i], 1 + d);
1121 	isl_seq_normalize(bset1->ctx, dir->el, dir->size);
1122 	isl_basic_set_free(bset1);
1127 	isl_basic_set_free(bset1);
1224 	__isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
1233 	if (!bset1 || !bset2)
1235 	ctx = isl_basic_set_get_ctx(bset1);
1236 	dir = valid_direction(isl_basic_set_copy(bset1),
1247 	bset1 = homogeneous_map(bset1, isl_mat_copy(T2));
1249 	set = isl_set_alloc_space(isl_basic_set_get_space(bset1), 2, 0);
1250 	set = isl_set_add_basic_set(set, bset1);
1260 	isl_basic_set_free(bset1);
1283 	__isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
1289 	if (bset1->ctx->opt->convex == ISL_CONVEX_HULL_FM)
1290 		return convex_hull_pair_elim(bset1, bset2);
1292 	aff = isl_set_affine_hull(isl_basic_set_union(isl_basic_set_copy(bset1),
1297 		return modulo_affine_hull(isl_basic_set_union(bset1, bset2), aff);
1300 	bounded1 = isl_basic_set_is_bounded(bset1);
1307 		return uset_convex_hull_wrap(isl_basic_set_union(bset1, bset2));
1310 		return convex_hull_pair_pointed(bset1, bset2);
1312 	lin = induced_lineality_space(isl_basic_set_copy(bset1),
1317 		isl_basic_set_free(bset1);
1324 		set = isl_set_alloc_space(isl_basic_set_get_space(bset1), 2, 0);
1325 		set = isl_set_add_basic_set(set, bset1);
1333 	return convex_hull_pair_pointed(bset1, bset2);
1335 	isl_basic_set_free(bset1);
1438 		isl_basic_set *bset1, *bset2;
1447 		bset1 = isl_basic_set_list_get_basic_set(list, n - 1);
1449 		bset1 = convex_hull_pair(bset1, bset2);
1452 			return bset1;
1454 		bset1 = isl_basic_set_underlying_set(bset1);
1456 		list = isl_basic_set_list_add(list, bset1);
OpenGrok
