| Age | Commit message (Collapse) | Author | Files | Lines | |
|---|---|---|---|---|---|
| 2009-06-05 | add isl_map_coalesce | Sven Verdoolaege | 2 | -218/+229 | |
| 2009-05-19 | add isl_set_product | Sven Verdoolaege | 2 | -0/+9 | |
| 2009-05-19 | export isl_map_dim | Sven Verdoolaege | 1 | -0/+1 | |
| 2009-05-06 | isl_map_convex_hull: handle unbounded, but pointed, case using wrapping | Sven Verdoolaege | 3 | -2/+294 | |
| The case where the convex hull may be unbounded (but still pointed) cannot be handled directly using wrapping. However, by changing the homogeneous direction, we can in such cases always transform the input polyhedra to polytopes, compute the hull and then transform back. Since we already handle the case where the convex hull may not be pointed, we can now handle all cases using wrapping. The convex_hull_pair_elim function is therefore no longer used. We leave it in, because we may want to allow the user to choose in future which convex hull algorithm to use. | |||||
| 2009-05-06 | privately export isl_mat_unimodular_complete | Sven Verdoolaege | 3 | -28/+31 | |
| 2009-05-06 | isl_tab.c: add isl_tab_get_sample_value | Sven Verdoolaege | 2 | -0/+39 | |
| 2009-05-06 | isl_map_convex_hull: avoid introducing lineality spaces in convex hull of pairs | Sven Verdoolaege | 1 | -86/+209 | |
| 2009-05-06 | add two more convex hull test cases | Sven Verdoolaege | 3 | -0/+31 | |
| 2009-05-06 | isl_map_convex_hull: remove lineality space if any before computing convex hull | Sven Verdoolaege | 1 | -3/+138 | |
| 2009-05-06 | add isl_basic_set_is_universe | Sven Verdoolaege | 2 | -0/+8 | |
| 2009-05-06 | add isl_set_get_dim | Sven Verdoolaege | 2 | -0/+8 | |
| 2009-05-05 | isl_convex_hull.c: update wrap_facet to the fact we only apply it on polytopes | Sven Verdoolaege | 1 | -5/+3 | |
| 2009-05-05 | isl_convex_hull.c: fix typo in comment | Sven Verdoolaege | 1 | -1/+1 | |
| 2009-05-05 | isl_coalesce.c: fix typo in comment | Sven Verdoolaege | 1 | -1/+1 | |
| 2009-05-05 | isl_tab.c: fix typo in comment | Sven Verdoolaege | 1 | -1/+1 | |
| 2009-05-05 | configure.in: set AC_CONFIG_MACRO_DIR | Sven Verdoolaege | 1 | -0/+1 | |
| 2009-03-23 | add isl_basic_set_get_dim | Sven Verdoolaege | 2 | -0/+9 | |
| 2009-03-23 | isl_basic_map_gist: normalize divs (if any) in context | Sven Verdoolaege | 1 | -10/+60 | |
| 2009-03-23 | isl_basic_map_simplify: remove duplicate divs before dropping divs | Sven Verdoolaege | 1 | -1/+1 | |
| The equalities on the duplicate but separate divs may entail additional equalities among the variables that we do not want to ignore. | |||||
| 2009-03-23 | add isl_basic_set_div | Sven Verdoolaege | 2 | -0/+7 | |
| 2009-03-23 | change calling convention of isl_basic_map_div | Sven Verdoolaege | 3 | -7/+8 | |
| 2009-03-23 | isl_map_simplify.c: uset_gist: break early if there are no inequalities | Sven Verdoolaege | 1 | -0/+5 | |
| 2009-03-23 | isl_map_simplify.c: uset_gist: break early if intersection is empty | Sven Verdoolaege | 1 | -0/+2 | |
| 2009-03-23 | add isl_basic_set_fast_is_empty | Sven Verdoolaege | 2 | -0/+8 | |
| 2009-03-23 | update piplib to 1.4.0 | Sven Verdoolaege | 1 | -0/+0 | |
| 2009-03-23 | isl_tab.c: store number of equalities among the constraints in tableau | Sven Verdoolaege | 3 | -5/+5 | |
| Before, we would check the bmap to figure out how many equalities we had added, but there was at least one instance where we didn't actually store the equalities in the tableau, leading to problems if any additional equalities would be found in the tableau. | |||||
| 2009-03-23 | isl_mat_extend: properly extend matrices with reordered rows | Sven Verdoolaege | 1 | -1/+5 | |
| 2009-03-20 | isl_map_gist: handle some special cases | Sven Verdoolaege | 1 | -1/+34 | |
| 2009-03-20 | add isl_map_universe | Sven Verdoolaege | 2 | -0/+11 | |
| 2009-03-20 | add isl_basic_map_fast_is_empty | Sven Verdoolaege | 2 | -0/+8 | |
| 2009-03-20 | isl_basic_map_gist: replace by new version based on tableaus | Sven Verdoolaege | 1 | -82/+161 | |
| The new version should be a little bit more efficient because it only constructs a single tableau. More importantly, the new version keeps better track of the original constraints and never introduces an inequality constraint in the result that did not appear in the input. This is especially important in the presence of divs. Throught variable compression, the original version would sometimes translate constraints that did not involve any divs into constraints that did involve divs. | |||||
| 2009-03-20 | isl_map_simplify.c: compute_elimination_index: don't assume equalities are ↵ | Sven Verdoolaege | 1 | -2/+5 | |
| in order | |||||
| 2009-03-20 | add isl_map_implicit_equalities | Sven Verdoolaege | 1 | -0/+19 | |
| 2009-03-20 | add isl_basic_set_free_equality | Sven Verdoolaege | 2 | -0/+6 | |
| 2009-03-20 | isl_map_convex_hull: mark result as not having any implicit equalities | Sven Verdoolaege | 1 | -0/+3 | |
| 2009-03-20 | convex_hull: coalesce set first | Sven Verdoolaege | 1 | -1/+1 | |
| 2009-03-20 | add isl_set_coalesce | Sven Verdoolaege | 4 | -0/+694 | |
| 2009-03-20 | isl_input_omega.c: basic_map_read: accept "+" in constraints | Sven Verdoolaege | 1 | -0/+2 | |
| 2009-03-20 | add isl_basic_set_alloc_div | Sven Verdoolaege | 2 | -0/+6 | |
| 2009-03-20 | add isl_set_align_divs | Sven Verdoolaege | 2 | -0/+6 | |
| 2009-03-20 | uset_affine_hull: ignore directions in affine hull of recession cone | Sven Verdoolaege | 1 | -0/+64 | |
| 2009-03-20 | isl_basic_map_implicit_equalities: perform Gaussian elimination on result | Sven Verdoolaege | 1 | -0/+1 | |
| 2009-03-20 | isl_affine_hull.c: outside_point: check for obvious candidate first | Sven Verdoolaege | 1 | -1/+18 | |
| 2009-03-20 | privately export isl_basic_set_contains | Sven Verdoolaege | 2 | -0/+8 | |
| 2009-03-20 | isl_ctx: add negone | Sven Verdoolaege | 2 | -0/+5 | |
| 2009-03-20 | isl_vec_dump: handle NULL vec | Sven Verdoolaege | 1 | -0/+6 | |
| 2009-03-20 | isl_affine_hull.c: extract uset_affine_hull | Sven Verdoolaege | 1 | -23/+44 | |
| 2009-03-20 | isl_mat_transpose: handle non-rectangular matrices | Sven Verdoolaege | 1 | -7/+17 | |
| 2009-03-20 | isl_map_simple_hull: compute affine hull before aligning divs | Sven Verdoolaege | 1 | -10/+5 | |
| Computing the affine hull may change the internal representation. In particular, it may simplify div constraints that are added during the alignment to constraints that did not appear in the original set and we do not want to introduce such constraints in the simple hull. | |||||
| 2009-03-20 | isl_map_simple_hull: mark result as not having any implicit equalities | Sven Verdoolaege | 1 | -0/+4 | |
 |
index : platform/upstream/isl | |
| Domain: System / Uncategorized; |
| summaryrefslogtreecommitdiff |