Sebastian Pop wrote:
The last missing part is the simplification of domains in this commit: http://repo.or.cz/w/cloog-ppl.git?a=commit;h=da969835f0d86b4b1d2dff3b5bca479... and you can see that in the commit changelog there are some directions on how to fix domain.c:cloog_domain_simplify.
Hi Sebastian,
the PPL 0.10 snapshot at
ftp://ftp.cs.unipr.it/pub/ppl/snapshots/ppl-0.10pre23.tar.bz2
has the new functionality required. From the C interface, this is available as
int ppl_Polyhedron_simplify_using_context_assign(ppl_Polyhedron_t x, ppl_const_Polyhedron_t y);
where `x' is the polyhedron to be simplified, `y' is the context, and the return value is
= 0, if `x' intersected with `y' is empty; < 0, if an error occurred (as usual); > 0, otherwise.
Of course, this has received very little testing: please let us know how it goes. Cheers,
Roberto