Home | History | Annotate | Download | only in dist

Lines Matching defs:vertex

49 		isl_basic_set_free(vertices->v[i].vertex);
77 		isl_basic_set_free(list->v.vertex);
115 /* Prepend a vertex to the linked list "list" based on the equalities in "tab".
116  * Return isl_bool_true if the vertex was actually added and
139 	v->v.vertex = isl_basic_set_copy(bset);
140 	v->v.vertex = isl_basic_set_cow(v->v.vertex);
141 	v->v.vertex = isl_basic_set_update_from_tab(v->v.vertex, tab);
142 	v->v.vertex = isl_basic_set_simplify(v->v.vertex);
143 	v->v.vertex = isl_basic_set_finalize(v->v.vertex);
144 	if (!v->v.vertex)
146 	isl_assert(bset->ctx, v->v.vertex->n_eq >= nvar, goto error);
147 	v->v.dom = isl_basic_set_copy(v->v.vertex);
191  * There is exactly one 0D vertex and a single chamber containing
192  * the vertex.
211 	vertices->v[0].vertex = isl_basic_set_copy(bset);
213 	if (!vertices->v[0].vertex || !vertices->v[0].dom)
386  * define a vertex.  To avoid the generation of duplicate vertices,
387  * which may happen if a vertex is defined by more than d constraints,
388  * we make sure we only generate the vertex for the d constraints with
411  * equality, then any vertex that may still be found with the current
414  * the constraint could lead to a vertex (in combination with the current
1043 isl_ctx *isl_vertex_get_ctx(__isl_keep isl_vertex *vertex)
1045 	return vertex ? isl_vertices_get_ctx(vertex->vertices) : NULL;
1048 isl_size isl_vertex_get_id(__isl_keep isl_vertex *vertex)
1050 	return vertex ? vertex->id : isl_size_error;
1053 /* Return the activity domain of the vertex "vertex".
1055 __isl_give isl_basic_set *isl_vertex_get_domain(__isl_keep isl_vertex *vertex)
1059 	if (!vertex)
1062 	v = &vertex->vertices->v[vertex->id];
1064 		v->dom = isl_basic_set_copy(v->vertex);
1072 /* Return a multiple quasi-affine expression describing the vertex "vertex"
1075 __isl_give isl_multi_aff *isl_vertex_get_expr(__isl_keep isl_vertex *vertex)
1080 	if (!vertex)
1083 	v = &vertex->vertices->v[vertex->id];
1085 	bset = isl_basic_set_copy(v->vertex);
1093 	isl_vertex *vertex;
1099 	vertex = isl_alloc_type(ctx, isl_vertex);
1100 	if (!vertex)
1103 	vertex->vertices = vertices;
1104 	vertex->id = id;
1106 	return vertex;
1112 __isl_null isl_vertex *isl_vertex_free(__isl_take isl_vertex *vertex)
1114 	if (!vertex)
1116 	isl_vertices_free(vertex->vertices);
1117 	free(vertex);
1342 	isl_stat (*fn)(__isl_take isl_vertex *vertex, void *user), void *user)
1345 	isl_vertex *vertex;
1356 		vertex = isl_vertex_alloc(isl_vertices_copy(vertices), i);
1357 		if (!vertex)
1360 		r = fn(vertex, user);
1369 	isl_stat (*fn)(__isl_take isl_vertex *vertex, void *user), void *user)
1372 	isl_vertex *vertex;
1383 		vertex = isl_vertex_alloc(isl_vertices_copy(cell->vertices),
1385 		if (!vertex)
1388 		r = fn(vertex, user);
1424 		vertices->v[i].vertex = isl_morph_basic_set(
1425 			isl_morph_copy(morph), vertices->v[i].vertex);
1426 		if (!vertices->v[i].vertex)
1485 /* Check whether the parametric vertex described by "vertex"
1490  * equalities defining the vertex and check if the result is identical
1494  * a vertex during the vertex construction so that we could simply look
1497 static int vertex_on_facet(__isl_keep isl_basic_set *vertex,
1506 	for (i = 0; i < vertex->n_eq; ++i) {
1507 		int k = isl_seq_last_non_zero(vertex->eq[i], v->size);
1508 		isl_seq_elim(v->el, vertex->eq[i], k, v->size, &m);
1533 	isl_basic_set *vertex;
1547 	vertex = cell->vertices->v[other_ids[0]].vertex;
1556 		if (vertex_on_facet(vertex, bset, i, v))
1561 			ov = cell->vertices->v[other_ids[j]].vertex;