January 2011 - PPL-devel - BUGSENG Mailman

[GIT] ppl/ppl(sparse_matrices): New commits
by Roberto Bagnara 08 Jan '11

08 Jan '11

URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=9d91a68c8298… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Sat Jan 8 19:10:56 2011 +0100 Generator: assert OK() in most constructors and non-const methods. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=827c7e001c19… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Sat Jan 8 19:03:18 2011 +0100 Generator: call strong_normalize() in the constructor from a Linear_Expression. Remove such calls in client code. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=3dcf87db1270… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Sat Jan 8 18:58:02 2011 +0100 Grid_Generator: avoid constructing an invalid Generator and fixing it afterwards. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=6bdf889c27af… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Sat Jan 8 17:51:09 2011 +0100 Generator: avoid constructing an invalid Generator and fixing it afterwards. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=d3769d914b39… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Sat Jan 8 17:40:42 2011 +0100 Linear_System: pass the optional parameters to swapping_sort() and swapping_unique(), to make sure the right iter_swap() is used. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=fc748c2a3ca1… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Sat Jan 8 17:38:32 2011 +0100 swapping_sort(), swapping_unique(): add an optional parameter that specifies the iter_swap algorithm. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=b7190f9a30dc… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Thu Jan 6 19:30:34 2011 +0100 Linear_Row: change the two-argument copy constructor semantic to match the Constraint's and Generator's ones. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=2f056375397a… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Thu Jan 6 19:26:57 2011 +0100 Linear_System: avoid using the Linear_Row copy constructor with specified capacity. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=16c8b37eb9cc… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Thu Jan 6 18:36:50 2011 +0100 Polyhedron: let all methods support Linear_System objects with different Row type. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=57291a0251e3… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Thu Jan 6 18:33:37 2011 +0100 Constraint: inherit from Linear_Row using the `public' specifier. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=95e8f47503b1… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Thu Jan 6 17:56:07 2011 +0100 Do not include Linear_Row.defs.hh in Linear_System.defs.hh. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=bce7237f46e8… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Thu Jan 6 17:55:12 2011 +0100 Linear_System: use Row instead of Linear_Row. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=aa5d014be5dc… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Thu Jan 6 17:44:04 2011 +0100 Constraint_System, Generator_System, Grid_Generator_System, Polyhedron: use Linear_System<Linear_Row> instead of Linear_System<Dense_Row>. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=a8cf68a9a7b5… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Thu Jan 6 17:27:58 2011 +0100 Make Linear_System and Linear_System_With_Bit_Matrix_Iterator class templates. Replace uses of Linear_System and Linear_System_With_Bit_Matrix_Iterator with uses of Linear_System<Dense_Row> and Linear_System_With_Bit_Matrix_Iterator<Dense_Row>. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=c95e5797818b… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Thu Jan 6 17:10:46 2011 +0100 Split the Linear_System::With_Bit_Matrix_iterator class out of Linear_System and rename it to Linear_System_With_Bit_Matrix_iterator.

1 0

[GIT] ppl/ppl(master): Replaced a call to PPL_ASSERT by PPL_ASSERT_HEAVY.
by Enea Zaffanella 08 Jan '11

08 Jan '11

Module: ppl/ppl Branch: master Commit: 0fd2de73dd626465d1c77d925eb63e2adb639648 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=0fd2de73dd62… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Sat Jan 8 17:23:18 2011 +0100 Replaced a call to PPL_ASSERT by PPL_ASSERT_HEAVY. --- src/Partially_Reduced_Product.inlines.hh | 2 +- 1 files changed, 1 insertions(+), 1 deletions(-) diff --git a/src/Partially_Reduced_Product.inlines.hh b/src/Partially_Reduced_Product.inlines.hh index 2e24c89..bbd14f1 100644 --- a/src/Partially_Reduced_Product.inlines.hh +++ b/src/Partially_Reduced_Product.inlines.hh @@ -357,7 +357,7 @@ Partially_Reduced_Product<D1, D2, R> y.reduce(); d1.time_elapse_assign(y.d1); d2.time_elapse_assign(y.d2); - PPL_ASSERT(OK()); + PPL_ASSERT_HEAVY(OK()); } template <typename D1, typename D2, typename R>

1 0

[GIT] ppl/ppl(master): Cyclic dependency avoided.
by Roberto Bagnara 07 Jan '11

07 Jan '11

Module: ppl/ppl Branch: master Commit: 1c16cf1e891f14f71c5c1d935c9df0e145bdcce1 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=1c16cf1e891f… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Fri Jan 7 18:39:22 2011 +0100 Cyclic dependency avoided. --- src/globals.inlines.hh | 2 +- 1 files changed, 1 insertions(+), 1 deletions(-) diff --git a/src/globals.inlines.hh b/src/globals.inlines.hh index 8fd6be5..f44e435 100644 --- a/src/globals.inlines.hh +++ b/src/globals.inlines.hh @@ -67,7 +67,7 @@ maybe_abandon() { inline dimension_type compute_capacity(const dimension_type requested_size, const dimension_type maximum_size) { - PPL_ASSERT(requested_size <= maximum_size); + assert(requested_size <= maximum_size); // Speculation factor 2. return (requested_size < maximum_size / 2) ? 2*(requested_size + 1)

1 0

[GIT] ppl/ppl(ppl-0_11-branch): Cyclic dependency avoided.
by Roberto Bagnara 07 Jan '11

07 Jan '11

Module: ppl/ppl Branch: ppl-0_11-branch Commit: 210f11e1f0b3f0890ca63f7305ba181105200e18 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=210f11e1f0b3… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Fri Jan 7 18:20:30 2011 +0100 Cyclic dependency avoided. --- src/globals.inlines.hh | 2 +- 1 files changed, 1 insertions(+), 1 deletions(-) diff --git a/src/globals.inlines.hh b/src/globals.inlines.hh index 8fd6be5..f44e435 100644 --- a/src/globals.inlines.hh +++ b/src/globals.inlines.hh @@ -67,7 +67,7 @@ maybe_abandon() { inline dimension_type compute_capacity(const dimension_type requested_size, const dimension_type maximum_size) { - PPL_ASSERT(requested_size <= maximum_size); + assert(requested_size <= maximum_size); // Speculation factor 2. return (requested_size < maximum_size / 2) ? 2*(requested_size + 1)

1 0

checking for version 0.10 of PPL... no
by Dennis Clarke 06 Jan '11

06 Jan '11

I see this in the configure stage of GCC 4.5.2 20101208 : . . . checking build system type... x86_64-pc-linux-gnu checking host system type... x86_64-pc-linux-gnu checking target system type... x86_64-pc-linux-gnu checking for a BSD-compatible install... /usr/bin/install -c checking whether ln works... yes checking whether ln -s works... yes checking for a sed that does not truncate output... /bin/sed checking for gawk... no checking for mawk... mawk checking for x86_64-linux-gnu-gcc... gcc checking for C compiler default output file name... a.out checking whether the C compiler works... yes checking whether we are cross compiling... no checking for suffix of executables... checking for suffix of object files... o checking whether we are using the GNU C compiler... yes checking whether gcc accepts -g... yes checking for gcc option to accept ISO C89... none needed checking whether we are using the GNU C++ compiler... no checking whether CC accepts -g... no checking for x86_64-linux-gnu-gnatbind... no checking for gnatbind... no checking for x86_64-linux-gnu-gnatmake... no checking for gnatmake... no checking whether compiler driver understands Ada... no checking how to compare bootstrapped objects... cmp --ignore-initial=16 $$f1 $$f2 checking for objdir... .libs checking for version 0.10 of PPL... no checking how to run the C preprocessor... gcc -E checking for grep that handles long lines and -e... /bin/grep checking for egrep... /bin/grep -E checking for ANSI C header files... yes . . . As a bit of a followup to the ppl issues I ran into on Solaris I can now report something on Linux ( Debian Squeeze ) in which the most recent GCC 4.5.2 Release Candidate seems to go looking for ppl 0.10 in the configure stage. This of course will not be found because the latest RC for ppl is in fact 0.11.1. Not sure how one is to build and test the ppl Release Candidate and then have it become part of the build within the GCC 4.5.2 Release Candidate on Linux or Solaris. My objective is to have a complete GCC with ppl and cloog implemented across both Linux and Solaris with equal performance results in terms of clean testsuite. I think that a package release into the Solaris world would be of some great value. I am using the Debian Squeeze build process as a test reference control data point. I am labouring under the assumption that all of this should 'just work' with a recent and solid Linux and that the struggles will be in the baseline Solaris world. Suggestions are of course needed here. -- Dennis Clarke dclarke(a)opensolaris.ca <- Email related to the open source Solaris dclarke(a)blastwave.org <- Email related to open source for Solaris ---------------------------- Original Message ---------------------------- Subject: Re: [PPL-devel] powerset1.cc: In function 'bool<unnamed>::test01()': From: "Roberto Bagnara" <bagnara(a)cs.unipr.it> Date: Fri, December 10, 2010 16:28 To: dclarke(a)blastwave.org Cc: "ppl user maillist" <ppl-devel(a)cs.unipr.it> -------------------------------------------------------------------------- On 12/10/10 17:38, Dennis Clarke wrote: > > While trying to build ppl-0.10.2 on Solaris 8 with GCC 4.4.4 I have seen > the following error in the 'make check' stage : > > [...] > > The sources were taken from > http://www.cs.unipr.it/ppl/Download/ftp/ppl/releases/LATEST/solaris/ > > Not sure if ppl can be compiled on Solaris 8. Certainly gmp, mpfr and mpc > all work flawlessly. I would certainly like to incorporate ppl into the > next GCC release if it could pass the testsuite. Hi Dennis. The PPL 0.10 series is no longer supported. We plan to release PPL 0.11.1 really soon now. You can download the current release candidate from http://www.cs.unipr.it/ppl/Download/ftp/snapshots/ Please let us know how it goes: we will be glad to incorporate improvements for Solaris 8 (or any other platform) into PPL 0.11.1. All the best, Roberto -- Prof. Roberto Bagnara Applied Formal Methods Laboratory Department of Mathematics, University of Parma, Italy http://www.cs.unipr.it/~bagnara/ mailto:bagnara@cs.unipr.it

3 2

[GIT] ppl/ppl(ppl-0_11-branch): Fixed documentation copy-and-paste error.
by Enea Zaffanella 06 Jan '11

06 Jan '11

Module: ppl/ppl Branch: ppl-0_11-branch Commit: 708d4eb3d218be8c41c3f549a38975023f50e647 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=708d4eb3d218… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Thu Jan 6 11:47:01 2011 +0100 Fixed documentation copy-and-paste error. --- src/MIP_Problem.defs.hh | 2 +- 1 files changed, 1 insertions(+), 1 deletions(-) diff --git a/src/MIP_Problem.defs.hh b/src/MIP_Problem.defs.hh index 0f6a03c..d05a8a4 100644 --- a/src/MIP_Problem.defs.hh +++ b/src/MIP_Problem.defs.hh @@ -596,7 +596,7 @@ private: is \c true if the variable is known to be nonnegative (and hence should not be split into a positive and a negative part). - \param is_nonnegative_variable + \param is_remergeable_variable This container of Boolean flags is initially empty. On exit, it size is equal to \c internal_space_dim. For each variable (index), the corresponding element of this container

1 0

[GIT] ppl/ppl(master): Fixed documentation copy-and-paste error.
by Enea Zaffanella 06 Jan '11

06 Jan '11

Module: ppl/ppl Branch: master Commit: 8d3d269f790746289a0e07a0260f808ad398814f URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=8d3d269f7907… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Thu Jan 6 11:44:48 2011 +0100 Fixed documentation copy-and-paste error. --- src/MIP_Problem.defs.hh | 2 +- 1 files changed, 1 insertions(+), 1 deletions(-) diff --git a/src/MIP_Problem.defs.hh b/src/MIP_Problem.defs.hh index d02cae1..f994b6e 100644 --- a/src/MIP_Problem.defs.hh +++ b/src/MIP_Problem.defs.hh @@ -687,7 +687,7 @@ private: is \c true if the variable is known to be nonnegative (and hence should not be split into a positive and a negative part). - \param is_nonnegative_variable + \param is_remergeable_variable This container of Boolean flags is initially empty. On exit, it size is equal to \c internal_space_dim. For each variable (index), the corresponding element of this container

1 0

[GIT] ppl/ppl(ppl-0_11-branch): Replaced several occurrences of assert() by PPL_ASSERT().
by Roberto Bagnara 06 Jan '11

06 Jan '11

Module: ppl/ppl Branch: ppl-0_11-branch Commit: d866bca5fc08a2c68b13684d404e5f3e6cf75eac URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=d866bca5fc08… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Thu Jan 6 10:44:37 2011 +0100 Replaced several occurrences of assert() by PPL_ASSERT(). --- src/Interval.templates.hh | 2 +- src/Octagonal_Shape.templates.hh | 2 +- src/PIP_Problem.inlines.hh | 2 +- src/PIP_Tree.cc | 4 ++-- src/Partially_Reduced_Product.inlines.hh | 2 +- src/Partially_Reduced_Product.templates.hh | 4 ++-- src/Polyhedron_public.cc | 2 +- src/conversion.cc | 2 +- src/globals.inlines.hh | 2 +- 9 files changed, 11 insertions(+), 11 deletions(-) diff --git a/src/Interval.templates.hh b/src/Interval.templates.hh index 11dff54..f6e306e 100644 --- a/src/Interval.templates.hh +++ b/src/Interval.templates.hh @@ -144,7 +144,7 @@ Interval<Boundary, Info>::Interval(const char* s) { // Get the upper bound. Boundary upper_bound; Result upper_r = assign_r(upper_bound, s, ROUND_UP); - assert(upper_r != V_CVT_STR_UNK && upper_r != V_NAN); + PPL_ASSERT(upper_r != V_CVT_STR_UNK && upper_r != V_NAN); upper_r = result_relation_class(upper_r); // Buld the interval. diff --git a/src/Octagonal_Shape.templates.hh b/src/Octagonal_Shape.templates.hh index 7f74de5..0d25603 100644 --- a/src/Octagonal_Shape.templates.hh +++ b/src/Octagonal_Shape.templates.hh @@ -971,7 +971,7 @@ Octagonal_Shape<T>::frequency(const Linear_Expression& expr, // Check the octagonal constraints between `v' and the other dimensions // that have non-zero coefficient in `le'. else { - assert(!constant_v); + PPL_ASSERT(!constant_v); using namespace Implementation::Octagonal_Shapes; const dimension_type ci = coherent_index(i); for (Row_Iterator j_iter = i_iter; j_iter != m_end; j_iter += 2) { diff --git a/src/PIP_Problem.inlines.hh b/src/PIP_Problem.inlines.hh index d09b3c3..1921fa0 100644 --- a/src/PIP_Problem.inlines.hh +++ b/src/PIP_Problem.inlines.hh @@ -74,7 +74,7 @@ PIP_Problem::operator=(const PIP_Problem& y) { inline PIP_Problem::Control_Parameter_Value PIP_Problem::get_control_parameter(Control_Parameter_Name n) const { - assert(n >= 0 && n < CONTROL_PARAMETER_NAME_SIZE); + PPL_ASSERT(n >= 0 && n < CONTROL_PARAMETER_NAME_SIZE); return control_parameters[n]; } diff --git a/src/PIP_Tree.cc b/src/PIP_Tree.cc index 004ddfc..d4ba7e8 100644 --- a/src/PIP_Tree.cc +++ b/src/PIP_Tree.cc @@ -2329,8 +2329,8 @@ PIP_Solution_Node::solve(const PIP_Problem& pip, generate_cut(best_i, all_params, context, space_dim); } else { - assert(cutting_strategy == PIP_Problem::CUTTING_STRATEGY_DEEPEST - || cutting_strategy == PIP_Problem::CUTTING_STRATEGY_ALL); + PPL_ASSERT(cutting_strategy == PIP_Problem::CUTTING_STRATEGY_DEEPEST + || cutting_strategy == PIP_Problem::CUTTING_STRATEGY_ALL); // Find the row with simplest parametric part // which will generate the "deepest" cut. PPL_DIRTY_TEMP_COEFFICIENT(best_score); diff --git a/src/Partially_Reduced_Product.inlines.hh b/src/Partially_Reduced_Product.inlines.hh index a4c0929..2e24c89 100644 --- a/src/Partially_Reduced_Product.inlines.hh +++ b/src/Partially_Reduced_Product.inlines.hh @@ -357,7 +357,7 @@ Partially_Reduced_Product<D1, D2, R> y.reduce(); d1.time_elapse_assign(y.d1); d2.time_elapse_assign(y.d2); - assert(OK()); + PPL_ASSERT(OK()); } template <typename D1, typename D2, typename R> diff --git a/src/Partially_Reduced_Product.templates.hh b/src/Partially_Reduced_Product.templates.hh index 174a57d..febac01 100644 --- a/src/Partially_Reduced_Product.templates.hh +++ b/src/Partially_Reduced_Product.templates.hh @@ -495,9 +495,9 @@ void Constraints_Reduction<D1, D2>::product_reduce(D1& d1, D2& d2) { template <typename D1, typename D2> bool shrink_to_congruence_no_check(D1& d1, D2& d2, const Congruence& cg) { // It is assumed that cg is a proper congruence. - assert(cg.modulus() != 0); + PPL_ASSERT(cg.modulus() != 0); // It is assumed that cg is satisfied by all points in d1. - assert(d1.relation_with(cg) == Poly_Con_Relation::is_included()); + PPL_ASSERT(d1.relation_with(cg) == Poly_Con_Relation::is_included()); // Build the linear expression for the congruence cg. Linear_Expression e; diff --git a/src/Polyhedron_public.cc b/src/Polyhedron_public.cc index f20161f..bdeb233 100644 --- a/src/Polyhedron_public.cc +++ b/src/Polyhedron_public.cc @@ -3510,7 +3510,7 @@ PPL::Polyhedron::frequency(const Linear_Expression& expr, } else { // We have a point or a closure point. - assert(gen_sys_i.is_point() || gen_sys_i.is_closure_point()); + PPL_ASSERT(gen_sys_i.is_point() || gen_sys_i.is_closure_point()); // Notice that we are ignoring the constant term in `expr' here. // We will add it to the value if there is a constant value. assign_r(candidate.get_num(), sp, ROUND_NOT_NEEDED); diff --git a/src/conversion.cc b/src/conversion.cc index a65fbd5..8871583 100644 --- a/src/conversion.cc +++ b/src/conversion.cc @@ -715,7 +715,7 @@ PPL::Polyhedron::conversion(Linear_System& source, redundant = true; break; } - assert(bound >= num_lines_or_equalities); + PPL_ASSERT(bound >= num_lines_or_equalities); WEIGHT_ADD_MUL(15, bound - num_lines_or_equalities); if (!redundant) { // Adding the new ray to `dest' and the corresponding diff --git a/src/globals.inlines.hh b/src/globals.inlines.hh index f44e435..8fd6be5 100644 --- a/src/globals.inlines.hh +++ b/src/globals.inlines.hh @@ -67,7 +67,7 @@ maybe_abandon() { inline dimension_type compute_capacity(const dimension_type requested_size, const dimension_type maximum_size) { - assert(requested_size <= maximum_size); + PPL_ASSERT(requested_size <= maximum_size); // Speculation factor 2. return (requested_size < maximum_size / 2) ? 2*(requested_size + 1)

1 0

[GIT] ppl/ppl(master): Replaced several occurrences of assert() by PPL_ASSERT().
by Roberto Bagnara 06 Jan '11

06 Jan '11

Module: ppl/ppl Branch: master Commit: 27d130ce3196cfa2d254fc5a99b265eeb6b27f95 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=27d130ce3196… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Thu Jan 6 10:42:46 2011 +0100 Replaced several occurrences of assert() by PPL_ASSERT(). --- src/Interval.templates.hh | 2 +- src/Octagonal_Shape.templates.hh | 2 +- src/PIP_Problem.inlines.hh | 2 +- src/PIP_Tree.cc | 4 ++-- src/Partially_Reduced_Product.inlines.hh | 2 +- src/Partially_Reduced_Product.templates.hh | 4 ++-- src/Polyhedron_public.cc | 2 +- src/conversion.cc | 2 +- src/globals.inlines.hh | 2 +- 9 files changed, 11 insertions(+), 11 deletions(-) diff --git a/src/Interval.templates.hh b/src/Interval.templates.hh index 11dff54..f6e306e 100644 --- a/src/Interval.templates.hh +++ b/src/Interval.templates.hh @@ -144,7 +144,7 @@ Interval<Boundary, Info>::Interval(const char* s) { // Get the upper bound. Boundary upper_bound; Result upper_r = assign_r(upper_bound, s, ROUND_UP); - assert(upper_r != V_CVT_STR_UNK && upper_r != V_NAN); + PPL_ASSERT(upper_r != V_CVT_STR_UNK && upper_r != V_NAN); upper_r = result_relation_class(upper_r); // Buld the interval. diff --git a/src/Octagonal_Shape.templates.hh b/src/Octagonal_Shape.templates.hh index 8358b85..ff8e003 100644 --- a/src/Octagonal_Shape.templates.hh +++ b/src/Octagonal_Shape.templates.hh @@ -971,7 +971,7 @@ Octagonal_Shape<T>::frequency(const Linear_Expression& expr, // Check the octagonal constraints between `v' and the other dimensions // that have non-zero coefficient in `le'. else { - assert(!constant_v); + PPL_ASSERT(!constant_v); using namespace Implementation::Octagonal_Shapes; const dimension_type ci = coherent_index(i); for (Row_Iterator j_iter = i_iter; j_iter != m_end; j_iter += 2) { diff --git a/src/PIP_Problem.inlines.hh b/src/PIP_Problem.inlines.hh index d09b3c3..1921fa0 100644 --- a/src/PIP_Problem.inlines.hh +++ b/src/PIP_Problem.inlines.hh @@ -74,7 +74,7 @@ PIP_Problem::operator=(const PIP_Problem& y) { inline PIP_Problem::Control_Parameter_Value PIP_Problem::get_control_parameter(Control_Parameter_Name n) const { - assert(n >= 0 && n < CONTROL_PARAMETER_NAME_SIZE); + PPL_ASSERT(n >= 0 && n < CONTROL_PARAMETER_NAME_SIZE); return control_parameters[n]; } diff --git a/src/PIP_Tree.cc b/src/PIP_Tree.cc index 9051c85..65fc77e 100644 --- a/src/PIP_Tree.cc +++ b/src/PIP_Tree.cc @@ -2819,8 +2819,8 @@ PIP_Solution_Node::solve(const PIP_Problem& pip, generate_cut(best_i, all_params, context, space_dim); } else { - assert(cutting_strategy == PIP_Problem::CUTTING_STRATEGY_DEEPEST - || cutting_strategy == PIP_Problem::CUTTING_STRATEGY_ALL); + PPL_ASSERT(cutting_strategy == PIP_Problem::CUTTING_STRATEGY_DEEPEST + || cutting_strategy == PIP_Problem::CUTTING_STRATEGY_ALL); // Find the row with simplest parametric part // which will generate the "deepest" cut. PPL_DIRTY_TEMP_COEFFICIENT(best_score); diff --git a/src/Partially_Reduced_Product.inlines.hh b/src/Partially_Reduced_Product.inlines.hh index a4c0929..2e24c89 100644 --- a/src/Partially_Reduced_Product.inlines.hh +++ b/src/Partially_Reduced_Product.inlines.hh @@ -357,7 +357,7 @@ Partially_Reduced_Product<D1, D2, R> y.reduce(); d1.time_elapse_assign(y.d1); d2.time_elapse_assign(y.d2); - assert(OK()); + PPL_ASSERT(OK()); } template <typename D1, typename D2, typename R> diff --git a/src/Partially_Reduced_Product.templates.hh b/src/Partially_Reduced_Product.templates.hh index 174a57d..febac01 100644 --- a/src/Partially_Reduced_Product.templates.hh +++ b/src/Partially_Reduced_Product.templates.hh @@ -495,9 +495,9 @@ void Constraints_Reduction<D1, D2>::product_reduce(D1& d1, D2& d2) { template <typename D1, typename D2> bool shrink_to_congruence_no_check(D1& d1, D2& d2, const Congruence& cg) { // It is assumed that cg is a proper congruence. - assert(cg.modulus() != 0); + PPL_ASSERT(cg.modulus() != 0); // It is assumed that cg is satisfied by all points in d1. - assert(d1.relation_with(cg) == Poly_Con_Relation::is_included()); + PPL_ASSERT(d1.relation_with(cg) == Poly_Con_Relation::is_included()); // Build the linear expression for the congruence cg. Linear_Expression e; diff --git a/src/Polyhedron_public.cc b/src/Polyhedron_public.cc index b1d9583..ea2efef 100644 --- a/src/Polyhedron_public.cc +++ b/src/Polyhedron_public.cc @@ -3513,7 +3513,7 @@ PPL::Polyhedron::frequency(const Linear_Expression& expr, } else { // We have a point or a closure point. - assert(gen_sys_i.is_point() || gen_sys_i.is_closure_point()); + PPL_ASSERT(gen_sys_i.is_point() || gen_sys_i.is_closure_point()); // Notice that we are ignoring the constant term in `expr' here. // We will add it to the value if there is a constant value. assign_r(candidate.get_num(), sp, ROUND_NOT_NEEDED); diff --git a/src/conversion.cc b/src/conversion.cc index a7297ec..ba975a0 100644 --- a/src/conversion.cc +++ b/src/conversion.cc @@ -715,7 +715,7 @@ PPL::Polyhedron::conversion(Linear_System& source, redundant = true; break; } - assert(bound >= num_lines_or_equalities); + PPL_ASSERT(bound >= num_lines_or_equalities); WEIGHT_ADD_MUL(15, bound - num_lines_or_equalities); if (!redundant) { // Adding the new ray to `dest' and the corresponding diff --git a/src/globals.inlines.hh b/src/globals.inlines.hh index f44e435..8fd6be5 100644 --- a/src/globals.inlines.hh +++ b/src/globals.inlines.hh @@ -67,7 +67,7 @@ maybe_abandon() { inline dimension_type compute_capacity(const dimension_type requested_size, const dimension_type maximum_size) { - assert(requested_size <= maximum_size); + PPL_ASSERT(requested_size <= maximum_size); // Speculation factor 2. return (requested_size < maximum_size / 2) ? 2*(requested_size + 1)

1 0

[GIT] ppl/ppl(ppl-0_11-branch): Added missing parameter documentation.
by Roberto Bagnara 06 Jan '11

06 Jan '11

Module: ppl/ppl Branch: ppl-0_11-branch Commit: 51c333447350d833a0cb85229b2f699ae8d179a5 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=51c333447350… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Thu Jan 6 09:30:52 2011 +0100 Added missing parameter documentation. --- src/termination.cc | 4 ++++ 1 files changed, 4 insertions(+), 0 deletions(-) diff --git a/src/termination.cc b/src/termination.cc index 30cdf19..b98756e 100644 --- a/src/termination.cc +++ b/src/termination.cc @@ -349,6 +349,10 @@ fill_constraint_systems_MS(const Constraint_System& cs, \f$ \vect{u}_3 \in \Qset_-^s \f$. The space of ranking functions is then spanned by \f$ \vect{u}_3^\transpose E_C' \vect x \f$. + + \param le_out + The expression to be minimized in the context of \p cs_out: + a value of \f$ -1 \f$ or less entails termination. */ void fill_constraint_system_PR(const Constraint_System& cs_before,

1 0