January 2010 - PPL-devel - BUGSENG Mailman

[GIT] ppl/ppl(pip): Improved helper function merge_assign(): add all new rows at once.
by Enea Zaffanella 30 Jan '10

30 Jan '10

Module: ppl/ppl Branch: pip Commit: e10ef6e9a1b924ff1cd14372198a69a1ddc84abf URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=e10ef6e9a1b9… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Sat Jan 30 22:22:51 2010 +0100 Improved helper function merge_assign(): add all new rows at once. --- src/PIP_Problem.cc | 3 +-- src/PIP_Tree.cc | 32 +++++++++++++++++++------------- 2 files changed, 20 insertions(+), 15 deletions(-) diff --git a/src/PIP_Problem.cc b/src/PIP_Problem.cc index 9f23bb2..0e48871 100644 --- a/src/PIP_Problem.cc +++ b/src/PIP_Problem.cc @@ -282,8 +282,7 @@ PPL::PIP_Problem::ascii_dump(std::ostream& s) const { for (dimension_type i = 0; i < input_cs_size; ++i) input_cs[i].ascii_dump(s); - s << "\nfirst_pending_constraint: " << first_pending_constraint - << std::endl; + s << "\nfirst_pending_constraint: " << first_pending_constraint << "\n"; s << "\ninitialized: " << (initialized ? "YES" : "NO") << "\n"; diff --git a/src/PIP_Tree.cc b/src/PIP_Tree.cc index 8cf8d29..cb85de7 100644 --- a/src/PIP_Tree.cc +++ b/src/PIP_Tree.cc @@ -60,21 +60,27 @@ sub_assign(Row& x, const Row& y) { void merge_assign(Matrix& x, const Constraint_System& y, - const Variables_Set &parameters) { - dimension_type width = x.num_columns(); - PPL_ASSERT(parameters.size() == width-1); - Row row(width, Row::Flags()); - Variables_Set::iterator param_begin = parameters.begin(); - Variables_Set::iterator param_end = parameters.end(); - Variables_Set::iterator pi; - dimension_type j; + const Variables_Set& parameters) { + PPL_ASSERT(parameters.size() == x.num_columns() - 1); + const dimension_type new_rows = std::distance(y.begin(), y.end()); + if (new_rows == 0) + return; + const dimension_type old_num_rows = x.num_rows(); + x.add_zero_rows(new_rows, Row::Flags()); + // Compute once for all. + const Variables_Set::const_iterator param_begin = parameters.begin(); + const Variables_Set::const_iterator param_end = parameters.end(); + + dimension_type i = old_num_rows; for (Constraint_System::const_iterator y_i = y.begin(), - y_end = y.end(); y_i != y_end; ++y_i) { + y_end = y.end(); y_i != y_end; ++y_i, ++i) { PPL_ASSERT(y_i->is_nonstrict_inequality()); - row[0] = y_i->inhomogeneous_term(); - for (pi=param_begin, j=1; pi != param_end; ++pi, ++j) - row[j] = y_i->coefficient(Variable(*pi)); - x.add_row(row); + Row& x_i = x[i]; + x_i[0] = y_i->inhomogeneous_term(); + Variables_Set::const_iterator pj; + dimension_type j = 1; + for (pj = param_begin; pj != param_end; ++pj, ++j) + x_i[j] = y_i->coefficient(Variable(*pj)); } }

1 0

[GIT] ppl/ppl(pip): Corrected capacity mismatch bug in PIP_Solution_Node:: solve().
by Enea Zaffanella 30 Jan '10

30 Jan '10

Module: ppl/ppl Branch: pip Commit: 07cdb790656ae87064b7633b0f9b3bdd3e85b446 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=07cdb790656a… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Sat Jan 30 21:37:50 2010 +0100 Corrected capacity mismatch bug in PIP_Solution_Node::solve(). --- src/PIP_Tree.cc | 10 ++++++++-- 1 files changed, 8 insertions(+), 2 deletions(-) diff --git a/src/PIP_Tree.cc b/src/PIP_Tree.cc index 3e42b9f..8cf8d29 100644 --- a/src/PIP_Tree.cc +++ b/src/PIP_Tree.cc @@ -1605,8 +1605,10 @@ PIP_Solution_Node::solve(PIP_Tree_Node*& parent_ref, var_column[j_] = var_i; /* create the identity matrix row corresponding to basic variable j_ */ - Row prs(num_vars, tableau.s_capacity(), Row::Flags()); - Row prt(num_params, tableau.t_capacity(), Row::Flags()); + tableau.s.add_zero_rows(1, Row::Flags()); + Row& prs = tableau.s[num_rows]; + tableau.t.add_zero_rows(1, Row::Flags()); + Row& prt = tableau.t[num_rows]; prs[j_] = tableau.get_denominator(); /* swap it with pivot row which would become identity after pivoting */ prs.swap(tableau.s[i_]); @@ -1681,6 +1683,10 @@ PIP_Solution_Node::solve(PIP_Tree_Node*& parent_ref, } } + // Drop rows previously added at end of tableau. + tableau.s.erase_to_end(num_rows); + tableau.t.erase_to_end(num_rows); + /* compute column s[*][j_] : s[k][j_] /= sij */ if (sij != sij_denom) { // Update column only if pivot != 1

1 0

[GIT] ppl/ppl(pip): Improved consistency checks in method PIP_Decision_Node ::OK().
by Enea Zaffanella 30 Jan '10

30 Jan '10

Module: ppl/ppl Branch: pip Commit: b728ad412284bf04adf16ae4dba749b4f0627651 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=b728ad412284… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Sat Jan 30 20:50:27 2010 +0100 Improved consistency checks in method PIP_Decision_Node::OK(). --- src/PIP_Tree.cc | 22 +++++++++++++--------- 1 files changed, 13 insertions(+), 9 deletions(-) diff --git a/src/PIP_Tree.cc b/src/PIP_Tree.cc index 800992b..3e42b9f 100644 --- a/src/PIP_Tree.cc +++ b/src/PIP_Tree.cc @@ -569,27 +569,31 @@ PIP_Solution_Node::OK() const { bool PIP_Decision_Node::OK() const { /* FIXME: finish me! */ -#ifndef NDEBUG - using std::endl; - using std::cerr; -#endif + + // Perform base class well-formedness check on this node. if (!PIP_Tree_Node::OK()) return false; - // Decision nodes with false child must have exactly one constraint + // Recursively check if child nodes are well-formed. + if (true_child && !true_child->OK()) + return false; + if (false_child && !false_child->OK()) + return false; + + // Decision nodes with a false child must have exactly one constraint. if (false_child) { dimension_type - dist = std::distance(constraints_.begin(), constraints_.end()); + dist = std::distance(constraints_.begin(), constraints_.end()); if (dist != 1) { #ifndef NDEBUG - cerr << "The PIP_Decision_Node has a 'false' child but does not " - << "have exactly one parametric constraint. (" << dist << ")" - << endl; + std::cerr << "PIP_Decision_Node with a 'false' child has " + << dist << " parametric constraints (should be 1).\n"; #endif return false; } } + // All checks passed. return true; }

1 0

[GIT] ppl/ppl(pip): Improved consistency checks in method PIP_Solution_Node ::Tableau::OK().
by Enea Zaffanella 30 Jan '10

30 Jan '10

Module: ppl/ppl Branch: pip Commit: d11a14fc05769502dcb4332b2d2336681e57f229 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=d11a14fc0576… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Sat Jan 30 20:39:36 2010 +0100 Improved consistency checks in method PIP_Solution_Node::Tableau::OK(). Prefer using Coefficient_traits::const_reference in parameter passing. --- src/PIP_Tree.cc | 39 +++++++++++++++++++++++++-------------- src/PIP_Tree.defs.hh | 16 +++++++++------- src/PIP_Tree.inlines.hh | 12 +++++------- 3 files changed, 39 insertions(+), 28 deletions(-) diff --git a/src/PIP_Tree.cc b/src/PIP_Tree.cc index 36a60a8..800992b 100644 --- a/src/PIP_Tree.cc +++ b/src/PIP_Tree.cc @@ -32,9 +32,10 @@ namespace { // Calculate positive modulo of x % y void -mod_assign(Coefficient &z, Coefficient_traits::const_reference x, +mod_assign(Coefficient &z, + Coefficient_traits::const_reference x, Coefficient_traits::const_reference y) { - z = x%y; + z = x % y; if (z < 0) z += y; } @@ -79,7 +80,7 @@ merge_assign(Matrix& x, // Tranform expression "expr" into "-expr-1", using scaling void -negate_assign(Row& x, const Row& y, const Coefficient& sc) { +negate_assign(Row& x, const Row& y, Coefficient_traits::const_reference sc) { PPL_ASSERT(x.size() == y.size()); for (dimension_type i = x.size(); i-- > 0; ) x[i] = -y[i]; @@ -125,8 +126,8 @@ column_lower(const Matrix& tableau, dimension_type ja, const Row& pivot_b, dimension_type jb, - const Coefficient& cst_a = -1, - const Coefficient& cst_b = -1) { + Coefficient_traits::const_reference cst_a = -1, + Coefficient_traits::const_reference cst_b = -1) { PPL_DIRTY_TEMP_COEFFICIENT(cij_a); PPL_DIRTY_TEMP_COEFFICIENT(cij_b); const Coefficient& sij_a = pivot_a[ja]; @@ -237,7 +238,8 @@ PIP_Tree_Node::Artificial_Parameter::Artificial_Parameter() } PIP_Tree_Node::Artificial_Parameter -::Artificial_Parameter(const Linear_Expression &e, const Coefficient &d) +::Artificial_Parameter(const Linear_Expression &e, + Coefficient_traits::const_reference d) : Linear_Expression(e), denominator(d) { } @@ -424,20 +426,29 @@ PIP_Tree_Node::insert_artificials(Variables_Set &params, bool PIP_Solution_Node::Tableau::OK() const { + if (s.num_rows() != t.num_rows()) { #ifndef NDEBUG - using std::endl; - using std::cerr; + std::cerr << "PIP_Solution_Node::Tableau matrices " + << "have a different number of rows.\n"; #endif + return false; + } - const dimension_type num_rows = s.num_rows(); - if (num_rows != t.num_rows()) { + if (!s.OK() || !t.OK()) { #ifndef NDEBUG - cerr << "The PIP_Solution_Node::Tableau matrices do not have the " - << "same number of rows." - << endl; + std::cerr << "A PIP_Solution_Node::Tableau matrix is broken.\n"; #endif return false; } + + if (denominator <= 0) { +#ifndef NDEBUG + std::cerr << "PIP_Solution_Node::Tableau with non-positive denominator.\n"; +#endif + return false; + } + + // All tests passed. return true; } @@ -688,7 +699,7 @@ PIP_Solution_Node::Tableau::normalize() { } void -PIP_Solution_Node::Tableau::scale(const Coefficient &ratio) { +PIP_Solution_Node::Tableau::scale(Coefficient_traits::const_reference ratio) { dimension_type i, j, k; dimension_type i_max = s.num_rows(); dimension_type j_max = s.num_columns(); diff --git a/src/PIP_Tree.defs.hh b/src/PIP_Tree.defs.hh index d984fea..9c07242 100644 --- a/src/PIP_Tree.defs.hh +++ b/src/PIP_Tree.defs.hh @@ -90,10 +90,11 @@ public: class Artificial_Parameter : public Linear_Expression { public: Artificial_Parameter(); - Artificial_Parameter(const Linear_Expression &e, const Coefficient &d); + Artificial_Parameter(const Linear_Expression &e, + Coefficient_traits::const_reference d); Artificial_Parameter(const Artificial_Parameter &x); - const Coefficient& get_denominator() const; + Coefficient_traits::const_reference get_denominator() const; //! Returns \b true if \p x and \p y are equal. friend bool operator==(const Artificial_Parameter& x, @@ -296,14 +297,14 @@ private: //! Tests whether the matrix is integer, \e ie. the denominator is 1. bool is_integer() const; //! Multiplies all coefficients and denominator with ratio. - void scale(const Coefficient &ratio); + void scale(Coefficient_traits::const_reference ratio); //! Normalizes the modulo of coefficients so that they are mutually prime. /*! Computes the Greatest Common Divisor (GCD) among the elements of the matrices and normalizes them and the denominator by the GCD itself. */ void normalize(); - //! + /*! \brief Compares two pivot row and column pairs before pivoting. @@ -358,15 +359,16 @@ private: const dimension_type j, const dimension_type i_, const dimension_type j_) const; + //! Returns the value of the denominator. - const Coefficient &get_denominator() const; + Coefficient_traits::const_reference get_denominator() const; void ascii_dump(std::ostream& s) const; bool ascii_load(std::istream& s); //! Returns \c true if and only if \p *this is well formed. - virtual bool OK() const; - }; + bool OK() const; + }; // struct Tableau //! The parametric simplex tableau. Tableau tableau; diff --git a/src/PIP_Tree.inlines.hh b/src/PIP_Tree.inlines.hh index d436da9..0449a2e 100644 --- a/src/PIP_Tree.inlines.hh +++ b/src/PIP_Tree.inlines.hh @@ -27,16 +27,14 @@ namespace Parma_Polyhedra_Library { inline PIP_Solution_Node::Tableau::Tableau() - : s(), - t(), - denominator(1) { + : s(), t(), denominator(1) { + PPL_ASSERT(OK()); } inline PIP_Solution_Node::Tableau::Tableau(const Tableau& y) - : s(y.s), - t(y.t), - denominator(y.denominator) { + : s(y.s), t(y.t), denominator(y.denominator) { + PPL_ASSERT(OK()); } inline @@ -48,7 +46,7 @@ PIP_Solution_Node::Tableau::is_integer() const { return denominator == 1; } -inline const Coefficient& +inline Coefficient_traits::const_reference PIP_Solution_Node::Tableau::get_denominator() const { return denominator; }

1 0

[GIT] ppl/ppl(pip): The Pip_Tree_Node:OK() method is now virtual.
by Enea Zaffanella 30 Jan '10

30 Jan '10

Module: ppl/ppl Branch: pip Commit: 4f580901c8904cb1c941af424c00e968202101e7 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=4f580901c890… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Sat Jan 30 20:17:22 2010 +0100 The Pip_Tree_Node:OK() method is now virtual. When overriding a virtual method in derived classes, prefer repeating the virtual keyword for clarity. --- src/PIP_Tree.defs.hh | 69 ++++++++++++++++++++++++++----------------------- 1 files changed, 37 insertions(+), 32 deletions(-) diff --git a/src/PIP_Tree.defs.hh b/src/PIP_Tree.defs.hh index fb871a8..d984fea 100644 --- a/src/PIP_Tree.defs.hh +++ b/src/PIP_Tree.defs.hh @@ -41,7 +41,23 @@ namespace Parma_Polyhedra_Library { of PIP problems. */ class PIP_Tree_Node { +protected: + //! Default constructor. + PIP_Tree_Node(); + + //! Copy constructor. + PIP_Tree_Node(const PIP_Tree_Node &x); + public: + //! Returns a pointer to a dynamically-allocated copy of \p *this. + virtual PIP_Tree_Node* clone() const = 0; + + //! Destructor. + virtual ~PIP_Tree_Node(); + + //! Returns \c true if and only if \p *this is well formed. + virtual bool OK() const; + //! Returns \p this if \p *this is a solution node, 0 otherwise. virtual const PIP_Solution_Node* as_solution() const; @@ -54,12 +70,6 @@ public: //! Returns \p this if \p *this is a decision node, 0 otherwise. virtual PIP_Decision_Node* as_decision(); - //! Destructor. - virtual ~PIP_Tree_Node(); - - //! Returns \c true if and only if \p *this is well formed. - bool OK() const; - /*! \brief Returns the system of parameter constraints controlling \p *this. @@ -94,7 +104,7 @@ public: private: Coefficient denominator; - }; + }; // class Artificial_Parameter //! A type alias for a sequence of Artificial_Parameter's. typedef std::vector<Artificial_Parameter> Artificial_Parameter_Sequence; @@ -111,16 +121,7 @@ public: void ascii_dump(std::ostream& s) const; bool ascii_load(std::istream& s); - //! Returns a pointer to a dynamically-allocated copy of \p *this. - virtual PIP_Tree_Node* clone() const = 0; - protected: - //! Default constructor. - PIP_Tree_Node(); - - //! Copy constructor. - PIP_Tree_Node(const PIP_Tree_Node &x); - //! A type alias for a sequence of constraints. typedef std::vector<Constraint> Constraint_Sequence; @@ -223,7 +224,9 @@ protected: //! Inserts a new parametric constraint in internal Row format void add_constraint(const Row &x, const Variables_Set& parameters); -}; + +}; // class PIP_Tree_Node + //! A tree node representing part of the space of solutions. class PIP_Solution_Node : public PIP_Tree_Node { @@ -231,8 +234,14 @@ public: //! Default constructor. PIP_Solution_Node(); + //! Returns a pointer to a dynamically-allocated copy of \p *this. + virtual PIP_Tree_Node* clone() const; + //! Destructor. - ~PIP_Solution_Node(); + virtual ~PIP_Solution_Node(); + + //! Returns \c true if and only if \p *this is well formed. + virtual bool OK() const; //! Returns \p this. virtual const PIP_Solution_Node* as_solution() const; @@ -263,11 +272,6 @@ public: void ascii_dump(std::ostream& s) const; bool ascii_load(std::istream& s); - //! Returns a pointer to a dynamically-allocated copy of \p *this. - virtual PIP_Tree_Node* clone() const; - - bool OK() const; - private: //! The type for parametric simplex tableau. struct Tableau { @@ -361,7 +365,7 @@ private: bool ascii_load(std::istream& s); //! Returns \c true if and only if \p *this is well formed. - bool OK() const; + virtual bool OK() const; }; //! The parametric simplex tableau. @@ -571,14 +575,20 @@ protected: //! A tree node representing a decision in the space of solutions. class PIP_Decision_Node : public PIP_Tree_Node { public: + //! Returns a pointer to a dynamically-allocated copy of \p *this. + virtual PIP_Tree_Node* clone() const; + //! Destructor. - ~PIP_Decision_Node(); + virtual ~PIP_Decision_Node(); + + //! Returns \c true if and only if \p *this is well formed. + virtual bool OK() const; //! Returns \p this. - const PIP_Decision_Node* as_decision() const; + virtual const PIP_Decision_Node* as_decision() const; //! Returns \p this. - PIP_Decision_Node* as_decision(); + virtual PIP_Decision_Node* as_decision(); //! Returns a const pointer to the \p b (true or false) branch of \p *this. const PIP_Tree_Node* child_node(bool b) const; @@ -586,11 +596,6 @@ public: //! Returns a pointer to the \p v (true or false) branch of \p *this. PIP_Tree_Node* child_node(bool v); - //! Returns a pointer to a dynamically-allocated copy of \p *this. - virtual PIP_Tree_Node* clone() const; - - bool OK() const; - private: // only PIP_Solution_Node is allowed to use the constructor and methods. friend class PIP_Solution_Node;

1 0

[GIT] ppl/ppl(pip): Typedef for PIP_Tree moved to PIP_Tree.types.hh.
by Enea Zaffanella 30 Jan '10

30 Jan '10

Module: ppl/ppl Branch: pip Commit: 4f1e1304cef927df5823cfc34fe852d57749401a URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=4f1e1304cef9… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Sat Jan 30 19:09:19 2010 +0100 Typedef for PIP_Tree moved to PIP_Tree.types.hh. --- src/PIP_Tree.defs.hh | 2 -- src/PIP_Tree.types.hh | 2 ++ 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/src/PIP_Tree.defs.hh b/src/PIP_Tree.defs.hh index 9c22dbe..fb871a8 100644 --- a/src/PIP_Tree.defs.hh +++ b/src/PIP_Tree.defs.hh @@ -677,8 +677,6 @@ protected: dimension_type space_dimension); }; -typedef const PIP_Tree_Node* PIP_Tree; - namespace IO_Operators { std::ostream& operator<<(std::ostream& os, diff --git a/src/PIP_Tree.types.hh b/src/PIP_Tree.types.hh index 682d95b..43543f8 100644 --- a/src/PIP_Tree.types.hh +++ b/src/PIP_Tree.types.hh @@ -18,6 +18,8 @@ class PIP_Solution_Node; class PIP_Decision_Node; class PIP_Tree_Node; +typedef const PIP_Tree_Node* PIP_Tree; + } // namespace Parma_Polyhedra_Library #endif // !defined(PPL_PIP_Tree_types_hh)

1 0

[GIT] ppl/ppl(pip): Everyting else equal, prefer downward iteration in for loop.
by Enea Zaffanella 30 Jan '10

30 Jan '10

Module: ppl/ppl Branch: pip Commit: 36de950771ebd8d77798aafff299403890a547c6 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=36de950771eb… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Sat Jan 30 18:59:06 2010 +0100 Everyting else equal, prefer downward iteration in for loop. --- src/PIP_Problem.inlines.hh | 2 +- 1 files changed, 1 insertions(+), 1 deletions(-) diff --git a/src/PIP_Problem.inlines.hh b/src/PIP_Problem.inlines.hh index 8ea5a32..fc67f13 100644 --- a/src/PIP_Problem.inlines.hh +++ b/src/PIP_Problem.inlines.hh @@ -61,7 +61,7 @@ PIP_Problem::swap(PIP_Problem& y) { std::swap(first_pending_constraint, y.first_pending_constraint); std::swap(parameters, y.parameters); std::swap(initial_context, y.initial_context); - for (unsigned i = 0; i < CONTROL_PARAMETER_NAME_SIZE; ++i) + for (dimension_type i = CONTROL_PARAMETER_NAME_SIZE; i-- > 0; ) std::swap(control_parameters[i], y.control_parameters[i]); std::swap(big_parameter_dimension, y.big_parameter_dimension); }

1 0

[GIT] ppl/ppl(pip): No need to check for null pointers before deleting them .
by Enea Zaffanella 30 Jan '10

30 Jan '10

Module: ppl/ppl Branch: pip Commit: 299dafac1f95cef1e2c6901dbbe125ec2d9a10b0 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=299dafac1f95… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Sat Jan 30 18:57:29 2010 +0100 No need to check for null pointers before deleting them. --- src/PIP_Problem.cc | 3 +-- 1 files changed, 1 insertions(+), 2 deletions(-) diff --git a/src/PIP_Problem.cc b/src/PIP_Problem.cc index a4b0b2d..9f23bb2 100644 --- a/src/PIP_Problem.cc +++ b/src/PIP_Problem.cc @@ -70,8 +70,7 @@ PPL::PIP_Problem::PIP_Problem(const PIP_Problem &y) } PPL::PIP_Problem::~PIP_Problem() { - if (current_solution != 0) - delete current_solution; + delete current_solution; } void

1 0

Wrong check for GMP version fails with GMP5.0.0
by Colin Paul Gloster 30 Jan '10

30 Jan '10

Ciao, __GMP_BITS_PER_MP_LIMB is used in configure of PPL0.10.2 but this does not exist in GMP5.0.0. I used a kludge to force configure to accept it and make check seemed to report passes for all tests. Yours sincerely, Little Nicholas Collin de Gloucester

2 1

Re: [PPL-devel] [GIT] ppl/ppl(pip): Added support for GMP 5.0.
by acrux 29 Jan '10

29 Jan '10

hi, i tried to add gmp-5.0 support patching ppl-0.10.2 but ppl check still doesn't recognize it. http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=blobdiff;f=m4/ac_chec… I'd like to know if it's already scheduled a new ppl minor release bump (maybe ppl-10.3) that is able to compile against the new gmp-5.x series. thanks again, -- GNU/Linux on Power Architecture CRUX PPC - http://cruxppc.org/

2 2