November 2009 - PPL-devel - BUGSENG Mailman

[GIT] ppl/ppl(pip): Added a pointer to parent node in PIP_Tree_Node.
by François Galea 19 Nov '09

19 Nov '09

Module: ppl/ppl Branch: pip Commit: 8cba1ff2af0392b8f741c2a6dd4da99edcd56978 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=8cba1ff2af03… Author: François Galea <francois.galea(a)uvsq.fr> Date: Thu Nov 19 11:59:53 2009 +0100 Added a pointer to parent node in PIP_Tree_Node. --- src/PIP_Tree.cc | 18 ++++++++++++++---- src/PIP_Tree.defs.hh | 9 +++++++++ src/PIP_Tree.inlines.hh | 10 ++++++++++ 3 files changed, 33 insertions(+), 4 deletions(-) diff --git a/src/PIP_Tree.cc b/src/PIP_Tree.cc index b4996cf..64a65b9 100644 --- a/src/PIP_Tree.cc +++ b/src/PIP_Tree.cc @@ -148,12 +148,14 @@ operator<<(std::ostream& os, const PIP_Tree_Node::Artificial_Parameter& x) { } // namespace IO_Operators PIP_Tree_Node::PIP_Tree_Node() - : constraints_(), + : parent_(0), + constraints_(), artificial_parameters() { } PIP_Tree_Node::PIP_Tree_Node(const PIP_Tree_Node &x) - : constraints_(x.constraints_), + : parent_(0), + constraints_(x.constraints_), artificial_parameters(x.artificial_parameters) { } @@ -256,16 +258,24 @@ PIP_Decision_Node::PIP_Decision_Node(PIP_Tree_Node* fcp, : PIP_Tree_Node(), true_child(tcp), false_child(fcp) { + if (fcp != 0) + fcp->set_parent(this); + if (tcp != 0) + tcp->set_parent(this); } PIP_Decision_Node ::PIP_Decision_Node(const PIP_Decision_Node& x) : PIP_Tree_Node(x), true_child(0), false_child(0) { - if (x.true_child != 0) + if (x.true_child != 0) { true_child = x.true_child->clone(); - if (x.false_child != 0) + true_child->set_parent(this); + } + if (x.false_child != 0) { false_child = x.false_child->clone(); + false_child->set_parent(this); + } } const PIP_Solution_Node* diff --git a/src/PIP_Tree.defs.hh b/src/PIP_Tree.defs.hh index ae5a461..1e2e01a 100644 --- a/src/PIP_Tree.defs.hh +++ b/src/PIP_Tree.defs.hh @@ -150,12 +150,21 @@ protected: friend class PIP_Decision_Node; friend class PIP_Solution_Node; + //! A pointer to \p *this 's parent, or 0 if \p *this is the root node. + const PIP_Decision_Node* parent_; + //! The local system of parameter constraints. Constraint_System constraints_; //! The local sequence of expressions for local artificial parameters. Artificial_Parameter_Sequence artificial_parameters; + //! Set this node's parent to \p *p. + void set_parent(const PIP_Decision_Node* p); + + //! Returns a pointer to this node's parent. + const PIP_Decision_Node* parent() const; + /*! \brief Populates the parametric simplex tableau using external data, if necessary diff --git a/src/PIP_Tree.inlines.hh b/src/PIP_Tree.inlines.hh index 8901588..0e0b8f8 100644 --- a/src/PIP_Tree.inlines.hh +++ b/src/PIP_Tree.inlines.hh @@ -67,6 +67,16 @@ inline PIP_Tree_Node::~PIP_Tree_Node() { } +inline void +PIP_Tree_Node::set_parent(const PIP_Decision_Node* p) { + parent_ = p; +} + +inline const PIP_Decision_Node* +PIP_Tree_Node::parent() const { + return parent_; +} + inline const Constraint_System& PIP_Tree_Node::constraints() const { return constraints_;

1 0

[GIT] ppl/ppl(pip): Improved the deepest row selection cut strategy.
by François Galea 19 Nov '09

19 Nov '09

Module: ppl/ppl Branch: pip Commit: 249afaa3a7bf3dcb85f97b7e2850241b87c2e20c URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=249afaa3a7bf… Author: François Galea <francois.galea(a)uvsq.fr> Date: Thu Nov 19 11:59:49 2009 +0100 Improved the deepest row selection cut strategy. --- src/PIP_Tree.cc | 14 ++++++-------- 1 files changed, 6 insertions(+), 8 deletions(-) diff --git a/src/PIP_Tree.cc b/src/PIP_Tree.cc index 53b24a7..b4996cf 100644 --- a/src/PIP_Tree.cc +++ b/src/PIP_Tree.cc @@ -1711,30 +1711,28 @@ PIP_Solution_Node::solve(PIP_Tree_Node*& parent_ref, } else /* PIP_CUTTING_STRATEGY_DEEPEST */ { /* Look for the row which will generate the "deepest" cut */ PPL_DIRTY_TEMP_COEFFICIENT(score); - PPL_DIRTY_TEMP_COEFFICIENT(score1); PPL_DIRTY_TEMP_COEFFICIENT(score2); Coefficient best = 0; - dimension_type best_i = 0; + dimension_type best_i = n_a_d; for (i_ = 0; i_ < num_vars; ++i_) { if (basis[i_]) continue; i = mapping[i_]; const Row& row_t = tableau.t[i]; const Row& row_s = tableau.s[i]; - score1 = 0; + score = 0; for (j = 0; j < num_params; ++j) { mod_assign(mod, row_t[j], d); if (mod != 0) - score1 += d - mod; + score += d - mod; } score2 = 0; for (j = 0; j < num_vars; ++j) { mod_assign(mod, row_s[j], d); - if (mod != 0) - score2 += d - mod; + score2 += d - mod; } - score = score1*score2; - if (score > best) { + score *= score2; + if (best_i == n_a_d || score > best) { best = score; best_i = i; }

1 0

[GIT] ppl/ppl(pip): Correctly rewrote ascii_dump/ ascii_load methods for PIP_Solution_Node.
by François Galea 19 Nov '09

19 Nov '09

Module: ppl/ppl Branch: pip Commit: defe2c4b315e272850825b3f27cff90b0726eaae URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=defe2c4b315e… Author: François Galea <francois.galea(a)uvsq.fr> Date: Thu Nov 19 12:30:50 2009 +0100 Correctly rewrote ascii_dump/ascii_load methods for PIP_Solution_Node. --- src/PIP_Tree.cc | 185 ++++++++++++++++++++++++++++++++++++++++++++++++++++--- 1 files changed, 176 insertions(+), 9 deletions(-) diff --git a/src/PIP_Tree.cc b/src/PIP_Tree.cc index ef42eee..53b24a7 100644 --- a/src/PIP_Tree.cc +++ b/src/PIP_Tree.cc @@ -675,11 +675,69 @@ void PIP_Solution_Node::ascii_dump(std::ostream& s) const { PIP_Tree_Node::ascii_dump(s); - s << "\nvariable_tableau\n"; - tableau.s.ascii_dump(s); + s << "\ntableau\n"; + tableau.ascii_dump(s); + + s << "\nbasis "; + dimension_type basis_size = basis.size(); + s << basis_size; + for (dimension_type i=0; i<basis_size; ++i) + s << (basis[i] ? " true" : " false"); + + s << "\nmapping "; + dimension_type mapping_size = mapping.size(); + s << mapping_size; + for (dimension_type i=0; i<mapping_size; ++i) + s << " " << mapping[i]; + + s << "\nvar_row "; + dimension_type var_row_size = var_row.size(); + s << var_row_size; + for (dimension_type i=0; i<var_row_size; ++i) + s << " " << var_row[i]; + + s << "\nvar_column "; + dimension_type var_column_size = var_column.size(); + s << var_column_size; + for (dimension_type i=0; i<var_column_size; ++i) + s << " " << var_column[i]; + s << "\n"; + + s << "special_equality_row " << special_equality_row << "\n"; + s << "big_dimension " << big_dimension << "\n"; + + s << "sign "; + dimension_type sign_size = sign.size(); + s << sign_size; + for (dimension_type i=0; i<sign_size; ++i) { + s << " "; + switch (sign[i]) { + case UNKNOWN: + s << "UNKNOWN"; + break; + case ZERO: + s << "ZERO"; + break; + case POSITIVE: + s << "POSITIVE"; + break; + case NEGATIVE: + s << "NEGATIVE"; + break; + case MIXED: + s << "MIXED"; + break; + } + } + s << "\n"; + + dimension_type solution_size = solution.size(); + s << "solution " << solution_size << "\n"; + for (dimension_type i=0; i<solution_size; ++i) + solution[i].ascii_dump(s); + s << "\n"; - s << "\nparameter_tableau\n"; - tableau.t.ascii_dump(s); + s << "solution_valid " << (solution_valid ? "true" : "false") << "\n"; } bool @@ -688,17 +746,126 @@ PIP_Solution_Node::ascii_load(std::istream& s) { return false; std::string str; - if (!(s >> str) || str != "variable_tableau") + if (!(s >> str) || str != "tableau") + return false; + if (!tableau.ascii_load(s)) + return false; + + if (!(s >> str) || str != "basis") + return false; + dimension_type basis_size; + if (!(s >> basis_size)) + return false; + basis.clear(); + for (dimension_type i=0; i<basis_size; ++i) { + if (!(s >> str)) + return false; + bool val = false; + if (str == "true") + val = true; + else if (str != "false") + return false; + basis.push_back(val); + } + + if (!(s >> str) || str != "mapping") + return false; + dimension_type mapping_size; + if (!(s >> mapping_size)) + return false; + mapping.clear(); + for (dimension_type i=0; i<mapping_size; ++i) { + dimension_type val; + if (!(s >> val)) + return false; + mapping.push_back(val); + } + + if (!(s >> str) || str != "var_row") + return false; + dimension_type var_row_size; + if (!(s >> var_row_size)) + return false; + var_row.clear(); + for (dimension_type i=0; i<var_row_size; ++i) { + dimension_type val; + if (!(s >> val)) + return false; + var_row.push_back(val); + } + + if (!(s >> str) || str != "var_column") + return false; + dimension_type var_column_size; + if (!(s >> var_column_size)) + return false; + var_column.clear(); + for (dimension_type i=0; i<var_column_size; ++i) { + dimension_type val; + if (!(s >> val)) + return false; + var_column.push_back(val); + } + + if (!(s >> str) || str != "special_equality_row") return false; - if (!tableau.s.ascii_load(s)) + if (!(s >> special_equality_row)) return false; - if (!(s >> str) || str != "parameter_tableau") + if (!(s >> str) || str != "big_dimension") + return false; + if (!(s >> big_dimension)) + return false; + + if (!(s >> str) || str != "sign") + return false; + dimension_type sign_size; + if (!(s >> sign_size)) + return false; + sign.clear(); + for (dimension_type i=0; i<sign_size; ++i) { + if (!(s >> str)) + return false; + Row_Sign val; + if (str == "UNKNOWN") + val = UNKNOWN; + else if (str == "ZERO") + val = ZERO; + else if (str == "POSITIVE") + val = POSITIVE; + else if (str == "NEGATIVE") + val = NEGATIVE; + else if (str == "MIXED") + val = MIXED; + else + return false; + sign.push_back(val); + } + + if (!(s >> str) || str != "solution") + return false; + dimension_type solution_size; + if (!(s >> solution_size)) + return false; + solution.clear(); + for (dimension_type i=0; i<solution_size; ++i) { + Linear_Expression val; + if (!val.ascii_load(s)) + return false; + solution.push_back(val); + } + + if (!(s >> str) || str != "solution_valid") + return false; + if (!(s >> str)) return false; - if (!tableau.t.ascii_load(s)) + if (str == "true") + solution_valid = true; + else if (str == "false") + solution_valid = false; + else return false; - solution_valid = false; PPL_ASSERT(OK()); return true; }

1 0

[GIT] ppl/ppl(pip): Removed useless debugging display code.
by François Galea 19 Nov '09

19 Nov '09

Module: ppl/ppl Branch: pip Commit: ccb5b869e390483852f0b2a40b4f42cae7d61e22 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=ccb5b869e390… Author: François Galea <francois.galea(a)uvsq.fr> Date: Thu Nov 19 12:29:42 2009 +0100 Removed useless debugging display code. --- src/PIP_Tree.cc | 1 - 1 files changed, 0 insertions(+), 1 deletions(-) diff --git a/src/PIP_Tree.cc b/src/PIP_Tree.cc index 2058c45..ef42eee 100644 --- a/src/PIP_Tree.cc +++ b/src/PIP_Tree.cc @@ -982,7 +982,6 @@ PIP_Solution_Node::update_tableau(const PIP_Problem& problem, Variables_Set::const_iterator pos = parameters.find(problem.big_parameter_dimension); big_dimension = std::distance(begin, pos) + 1; - std::cout << "big_dimension = " << big_dimension << std::endl; } const Coefficient& denom = tableau.get_denominator();

1 0

OpenSolaris success - was Re: Modified PPL 0.10.2 source distribution for Solaris
by alanpae＠ilkda.com 18 Nov '09

18 Nov '09

>> >> Would it help if I tarred everything up and sent it to you? > > Hmm, I am afraid not. The only thing it could _really_ help is > providing me with access to a fully configured Solaris machine > (with all the required development tools in place) for 30 minutes. > I know in the past you objected to this and suggested I install > Solaris instead: unfortunately I don't have the time to do that. > So let us wait for someone who can provide me access to such > a machine: if there is a real interest in having the PPL running > on Solaris, I am sure this will happen soon. > All the best, > > Roberto > Right, essentially because I'm behind a firewall and NAT that are not under my control so I have no way to cut a hole for ssh access otherwise ... Ok, so there are essentially two default compilers for Solaris/OpenSolaris. GCC and Sun Studio. There are others but let's not complicate things. Sun Studio is the one that I've been fighting with and not having any luck. You have tried to provide support and if I was an actual coder it probably would have made sense. Ok, I'm tired of fighting Sun Studio so back to gcc. Solaris/OpenSolaris comes with gcc 3.4.3 as the default compiler. As you have already noted that version is to old be be used with PPL. So the recipe is: Get and install the current version of binutils. This is used to replace the stock versions of as and ld that come with Solaris and is an attempt to get the system to be as close to a Linux dev box as possible. For the path statement add the directory where you will install binutils and gcc eventually followed by /usr/gnu/bin which again is used to get the box as close to a Linux box as possible and then any other pathing statements that you need. After binutils compile and add the current version of gcc. You cannot use the PPL switch as you haven't got that far yet and is the purpose of this in the first place. Get and install gmp using -fexceptions and --enable-gxx as per the requirements page. Then compile PPL with the --with-gnu-ld switch and it goes off without a hitch. gmake check shows all tests passed for the first two tests of 1 and 41. It's still running but I don't expect anything major to show up. thanks, alan The only errors in the output are these: g++ -DHAVE_CONFIG_H -I. -I.. -I.. -I../src -I/opt/gcc/include -g -O2 -frounding-math -W -Wall -MT ppl-config.o -MD -MP -MF .deps/ppl-config.Tpo -c -o ppl-config.o ppl-config.cc ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ ppl-config.cc:158: warning: deprecated conversion from string constant to ‘char*’ mv -f .deps/ppl-config.Tpo .deps/ppl-config.Po g++ -DHAVE_CONFIG_H -I. -I../.. -I../.. -I../../src -I../../utils -I/opt/gcc/include -g -O2 -frounding-math -W -Wall -MT ppl_lcdd.o -MD -MP -MF .deps/ppl_lcdd.Tpo -c -o ppl_lcdd.o ppl_lcdd.cc ppl_lcdd.cc:161: warning: deprecated conversion from string constant to ‘char*’ ppl_lcdd.cc:161: warning: deprecated conversion from string constant to ‘char*’ ppl_lcdd.cc:161: warning: deprecated conversion from string constant to ‘char*’ ppl_lcdd.cc:161: warning: deprecated conversion from string constant to ‘char*’ ppl_lcdd.cc:161: warning: deprecated conversion from string constant to ‘char*’ ppl_lcdd.cc:161: warning: deprecated conversion from string constant to ‘char*’ ppl_lcdd.cc:161: warning: deprecated conversion from string constant to ‘char*’ ppl_lcdd.cc:161: warning: deprecated conversion from string constant to ‘char*’ mv -f .deps/ppl_lcdd.Tpo .deps/ppl_lcdd.Po

1 0

[lucas@lucas-nussbaum.net: Bug#552959: ppl: FTBFS: build blocks]
by Michael Tautschnig 18 Nov '09

18 Nov '09

Hi all, I was notified about some very strange build failure that I cannot reproduce myself, but apparently for Lucas it _is_ reproducible. Have you by chance already come across this problem, or have some idea what could be the problem, or maybe even have a fix already in git? Thanks in advance, Michael ----- Forwarded message from Lucas Nussbaum <lucas(a)lucas-nussbaum.net> ----- Date: Fri, 30 Oct 2009 12:03:59 +0100 From: Lucas Nussbaum <lucas(a)lucas-nussbaum.net> To: Michael Tautschnig <mt(a)debian.org> CC: 552959(a)bugs.debian.org Subject: Bug#552959: ppl: FTBFS: build blocks Reply-To: Lucas Nussbaum <lucas(a)lucas-nussbaum.net>, 552959(a)bugs.debian.org User-Agent: Mutt/1.5.20 (2009-06-14) On 29/10/09 at 09:02 +0100, Michael Tautschnig wrote: > Hi! > > [...] > > > > if [ . != `pwd` ]; then \ > > > rm -f ppl_prolog_generated_test_common.pl; \ > > > fi > > > rm -f ppl_prolog_generated_test_main.pl; \ > > > diff -u --ignore-all-space ./../tests/expected_pgt obtained_pgt > > > make[7]: *** [pl_check_test] Terminated > > > make[3]: *** [check-recursive] Terminated > > > E: Caught signal 'Terminated': terminating immediately > > > make[5]: *** [check-recursive] Terminated > > > make[4]: *** [check] Terminated > > > make[2]: *** [check] Terminated > > > make[1]: *** [check-recursive] Terminated > > > make: *** [check] Terminated > > > make[6]: *** [check-am] Terminated > > > Build killed with signal TERM after 240 minutes of inactivity > > > ──────────────────────────────────────────────────────────────────────────────── > > > Build finished at 20091028-0518 > > > > The full build log is available from: > > http://people.debian.org/~lucas/logs/2009/10/28/ppl_0.10.2-3_lsid64.buildlog > > > > [...] > > Is it possible to schedule another build? I'm really clueless what could be > going wrong here, other than some problem with the buildd, which seems somewhat > more likely given the excerpt of daemon.log provided at the end of this log. > Looking at other build logs the above diff seems to be about the last thing > before install, and it worked fine on all Debian buildds just a few days ago!? The fact that it blocks is reproducible. Output on the terminal: % ppl_prolog_generated_test_main.pl compiled 0.18 sec, 2,099,112 bytes % ./swi_prolog_generated_test compiled 0.18 sec, 2,104,128 bytes true. true. % halt if [ . != `pwd` ]; then \ rm -f ppl_prolog_generated_test_common.pl; \ fi rm -f ppl_prolog_generated_test_main.pl; \ diff -u --ignore-all-space ./../tests/expected_pgt obtained_pgt However, it's not diff that is blocking, it's ppl_pl. It's eating all the available memory and causes swapping. I've attached the output of ps. the status of the process is: Name: ppl_pl State: T (stopped) Tgid: 20160 Pid: 20160 PPid: 20152 TracerPid: 0 Uid: 0 0 0 0 Gid: 0 0 0 0 FDSize: 256 Groups: 0 VmPeak: 303031364 kB VmSize: 303031364 kB VmLck: 0 kB VmHWM: 31854660 kB VmRSS: 31756644 kB VmData: 302960040 kB VmStk: 84 kB VmExe: 5284 kB VmLib: 4792 kB VmPTE: 100764 kB Threads: 1 SigQ: 1/270336 SigPnd: 0000000000000000 ShdPnd: 0000000000000000 SigBlk: 0000000000000000 SigIgn: 0000000000001000 SigCgt: 0000000187802083 CapInh: 0000000000000000 CapPrm: ffffffffffffffff CapEff: ffffffffffffffff CapBnd: ffffffffffffffff Cpus_allowed: 000000ff Cpus_allowed_list: 0-7 Mems_allowed: 00000000,00000001 Mems_allowed_list: 0 voluntary_ctxt_switches: 6796 nonvoluntary_ctxt_switches: 2400 (the T state is normal, I kill'ed -STOP it so I could get the ps output, but it was R or D before that. -- | Lucas Nussbaum | lucas(a)lucas-nussbaum.net http://www.lucas-nussbaum.net/ | | jabber: lucas(a)nussbaum.fr GPG: 1024D/023B3F4F | 10735 pts/0 S+ 0:00 | \_ /usr/bin/perl /usr/bin/dpkg-buildpackage -us -uc 26698 pts/0 S+ 0:00 | \_ /usr/bin/make -f debian/rules binary 26700 pts/0 S+ 0:00 | \_ /usr/bin/make -j16 check 26701 pts/0 S+ 0:00 | \_ /bin/bash -c failcom='exit 1'; \?for f in x $MAKEFLAGS; do \? case $f in \? *=* | --[!k]*);; \? *k*) failcom='fail=yes';; \? esac; \?done; \?dot_seen=no; \?target=`echo check-recursive | sed s/-recursive//`; \?list='. utils src Watchdog tests interfaces demos doc m4'; for subdir in $list; do \? echo "Making $target in $subdir"; \? if test "$subdir" = "."; then \? dot_seen=yes; \? local_target="$target-am"; \? else \? local_target="$target"; \? fi; \? (cd $subdir && /usr/bin/make $local_target) \? || eval $failcom; \?done; \?if test "$dot_seen" = "no"; then \? /usr/bin/make "$target-am" || exit 1; \?fi; test -z "$fail" 29227 pts/0 S+ 0:00 | \_ /bin/bash -c failcom='exit 1'; \?for f in x $MAKEFLAGS; do \? case $f in \? *=* | --[!k]*);; \? *k*) failcom='fail=yes';; \? esac; \?done; \?dot_seen=no; \?target=`echo check-recursive | sed s/-recursive//`; \?list='. utils src Watchdog tests interfaces demos doc m4'; for subdir in $list; do \? echo "Making $target in $subdir"; \? if test "$subdir" = "."; then \? dot_seen=yes; \? local_target="$target-am"; \? else \? local_target="$target"; \? fi; \? (cd $subdir && /usr/bin/make $local_target) \? || eval $failcom; \?done; \?if test "$dot_seen" = "no"; then \? /usr/bin/make "$target-am" || exit 1; \?fi; test -z "$fail" 29228 pts/0 S+ 0:00 | \_ /usr/bin/make check 29229 pts/0 S+ 0:00 | \_ /usr/bin/make check-recursive 29231 pts/0 S+ 0:00 | \_ /bin/bash -c failcom='exit 1'; \?for f in x $MAKEFLAGS; do \? case $f in \? *=* | --[!k]*);; \? *k*) failcom='fail=yes';; \? esac; \?done; \?dot_seen=no; \?target=`echo check-recursive | sed s/-recursive//`; \?list='. C Prolog'; for subdir in $list; do \? echo "Making $target in $subdir"; \? if test "$subdir" = "."; then \? dot_seen=yes; \? local_target="$target-am"; \? else \? local_target="$target"; \? fi; \? (cd $subdir && /usr/bin/make $local_target) \? || eval $failcom; \?done; \?if test "$dot_seen" = "no"; then \? /usr/bin/make "$target-am" || exit 1; \?fi; test -z "$fail" 29584 pts/0 S+ 0:00 | \_ /bin/bash -c failcom='exit 1'; \?for f in x $MAKEFLAGS; do \? case $f in \? *=* | --[!k]*);; \? *k*) failcom='fail=yes';; \? esac; \?done; \?dot_seen=no; \?target=`echo check-recursive | sed s/-recursive//`; \?list='. C Prolog'; for subdir in $list; do \? echo "Making $target in $subdir"; \? if test "$subdir" = "."; then \? dot_seen=yes; \? local_target="$target-am"; \? else \? local_target="$target"; \? fi; \? (cd $subdir && /usr/bin/make $local_target) \? || eval $failcom; \?done; \?if test "$dot_seen" = "no"; then \? /usr/bin/make "$target-am" || exit 1; \?fi; test -z "$fail" 29586 pts/0 S+ 0:00 | \_ /usr/bin/make check 29588 pts/0 S+ 0:00 | \_ /usr/bin/make check-recursive 29590 pts/0 S+ 0:00 | \_ /bin/bash -c failcom='exit 1'; \?for f in x $MAKEFLAGS; do \? case $f in \? *=* | --[!k]*);; \? *k*) failcom='fail=yes';; \? esac; \?done; \?dot_seen=no; \?target=`echo check-recursive | sed s/-recursive//`; \?list='. tests SWI '; for subdir in $list; do \? echo "Making $target in $subdir"; \? if test "$subdir" = "."; then \? dot_seen=yes; \? local_target="$target-am"; \? else \? local_target="$target"; \? fi; \? (cd $subdir && /usr/bin/make $local_target) \? || eval $failcom; \?done; \?if test "$dot_seen" = "no"; then \? /usr/bin/make "$target-am" || exit 1; \?fi; test -z "$fail" 19988 pts/0 S+ 0:00 | \_ /bin/bash -c failcom='exit 1'; \?for f in x $MAKEFLAGS; do \? case $f in \? *=* | --[!k]*);; \? *k*) failcom='fail=yes';; \? esac; \?done; \?dot_seen=no; \?target=`echo check-recursive | sed s/-recursive//`; \?list='. tests SWI '; for subdir in $list; do \? echo "Making $target in $subdir"; \? if test "$subdir" = "."; then \? dot_seen=yes; \? local_target="$target-am"; \? else \? local_target="$target"; \? fi; \? (cd $subdir && /usr/bin/make $local_target) \? || eval $failcom; \?done; \?if test "$dot_seen" = "no"; then \? /usr/bin/make "$target-am" || exit 1; \?fi; test -z "$fail" 19989 pts/0 S+ 0:00 | \_ /usr/bin/make check 20107 pts/0 S+ 0:00 | \_ /usr/bin/make check-local 20152 pts/0 S+ 0:00 | \_ /bin/bash -c /bin/bash ../../../libtool --mode=execute \??-dlopen ../../../src/libppl.la \??-dlopen ../../../Watchdog/src/libpwl.la \??-dlopen libppl_swiprolog.la \? ./ppl_pl < script_pchk 20160 pts/0 T+ 2:14 | \_ ./ppl_pl ----- End forwarded message -----

3 4

Re: [PPL-devel] Modified PPL 0.10.2 source distribution for Solaris
by Alan Pae 18 Nov '09

18 Nov '09

> -------- Original Message -------- > Subject: Re: Modified PPL 0.10.2 source distribution for Solaris > From: Roberto Bagnara <bagnara at cs.unipr.it> > Date: Wed, October 28, 2009 8:11 am > To: Alan Pae <alanpae at ilkda.com> > Cc: "The Parma Polyhedra Library developers' list" > <ppl-devel at cs.unipr.it> > > > Alan Pae wrote: > > This is on OpenSolaris build 125 (current) using Sun Studio 12.1. > > > > done > ppl_include_files.hh > > ../utils/build_header \ > > -I .. -I ../src \ > > ../src/ppl_header.hh >ppl.hh > > ../utils/text2cxxarray --name=BUGS_array \ > > ../BUGS >BUGS.cc > > ../utils/text2cxxarray --name=COPYING_array \ > > ../COPYING >COPYING.cc > > ../utils/text2cxxarray --name=CREDITS_array \ > > ../CREDITS >CREDITS.cc > > gmake all-am > > gmake[3]: Entering directory `/build/ppl-0.10.2/src' > > source='Box.cc' object='Box.lo' libtool=yes \ > > DEPDIR=.deps depmode=none /bin/sh ../depcomp \ > > /bin/sh ../libtool --tag=CXX --mode=compile > > /opt/sunstudio12.1/bin/CC -DHAVE_CONFIG_H -I. -I.. -I.. -I../src > > -I/usr/include/gmp -g -O2 -c -o Box.lo Box.cc > > libtool: compile: /opt/sunstudio12.1/bin/CC -DHAVE_CONFIG_H -I. -I.. > > -I.. -I../src -I/usr/include/gmp -g -O2 -c Box.cc -KPIC -DPIC -o > > .libs/Box.o > > "globals.types.hh", line 21: Error: size_t is not defined. > > "globals.types.hh", line 25: Error: size_t is not defined. > > Hi Alan, > > it seems the compiler you are using is buggy: according to the C++ > standard, size_t has to be provided by <cstddef> and <cstddef> is > included by globals.types.hh prior to the first reference to size_t. > All the best, > > Roberto Thanks, I'll file a bug report with Sun then. ===================== Ok, I actually figured this one out. vi src/globals.types.hh #include <stddef.h> /* for size_t */ and then it picks up size_t but then it throws a bunch of other errors: addsource='Box.cc' object='Box.lo' libtool=yes \ DEPDIR=.deps depmode=none /bin/sh ../depcomp \ /bin/sh ../libtool --tag=CXX --mode=compile /opt/SunStudioExpress/bin/CC -DHAVE_CONFIG_H -I. -I.. -I.. -I../src -I/usr/include/gmp -g -O2 -c -o Box.lo Box.cc libtool: compile: /opt/SunStudioExpress/bin/CC -DHAVE_CONFIG_H -I. -I.. -I.. -I../src -I/usr/include/gmp -g -O2 -c Box.cc -KPIC -DPIC -o .libs/Box.o "checked_mpz.inlines.hh", line 54: Error: "," expected instead of "(". "checked_mpz.inlines.hh", line 60: Error: mp_size_field_t is not defined. "checked_mpz.inlines.hh", line 66: Error: mp_size_field_t is not defined. "checked_mpz.inlines.hh", line 67: Error: size is not defined. "Row.defs.hh", line 88: Error: Row_Impl_Handler is not defined. "Row.inlines.hh", line 168: Error: Impl is not defined. "Row.inlines.hh", line 173: Error: impl is not defined. "Row.inlines.hh", line 178: Error: impl is not defined. "Row.inlines.hh", line 183: Error: impl is not defined. "Row.inlines.hh", line 208: Error: Parma_Polyhedra_Library::Row_Impl_Handler is not a direct base class of Parma_Polyhedra_Library::Row. "Row.inlines.hh", line 224: Error: impl is not defined. "Row.inlines.hh", line 224: Error: Type name expected instead of "Impl". "Row.inlines.hh", line 224: Error: Could not find a match for operator new(unsigned, unsigned). "Row.inlines.hh", line 237: Error: impl is not defined. "Row.inlines.hh", line 246: Error: impl is not defined. "Row.inlines.hh", line 267: Error: Parma_Polyhedra_Library::Row_Impl_Handler is not a direct base class of Parma_Polyhedra_Library::Row. "Row.inlines.hh", line 273: Error: Parma_Polyhedra_Library::Row_Impl_Handler is not a direct base class of Parma_Polyhedra_Library::Row. "Row.inlines.hh", line 279: Error: Parma_Polyhedra_Library::Row_Impl_Handler is not a direct base class of Parma_Polyhedra_Library::Row. "Row.inlines.hh", line 280: Error: impl is not a member of const Parma_Polyhedra_Library::Row. "Row.inlines.hh", line 289: Error: Parma_Polyhedra_Library::Row_Impl_Handler is not a direct base class of Parma_Polyhedra_Library::Row. "Row.inlines.hh", line 300: Error: Parma_Polyhedra_Library::Row_Impl_Handler is not a direct base class of Parma_Polyhedra_Library::Row. "Row.inlines.hh", line 315: Error: impl is not defined. "Row.inlines.hh", line 320: Error: impl is not defined. "Row.inlines.hh", line 320: Error: impl is not a member of Parma_Polyhedra_Library::Row. "Row.inlines.hh", line 328: Error: impl is not defined. Compilation aborted, too many Error messages. gmake[3]: *** [Box.lo] Error 1 gmake[3]: Leaving directory `/build/ppl-0.10.2/src' Please suggest. thanks, alan

2 3

[GIT] ppl/ppl(pip): Added an option in PIP standalone solver to solve the problem several times .
by François Galea 16 Nov '09

16 Nov '09

Module: ppl/ppl Branch: pip Commit: ff541fbbe9959d97ca2d25f0127ed02a561fd381 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=ff541fbbe995… Author: François Galea <francois.galea(a)uvsq.fr> Date: Mon Nov 16 18:49:07 2009 +0100 Added an option in PIP standalone solver to solve the problem several times. This may be convenient for benchmarking purposes. --- demos/ppl_pips/ppl_pips.cc | 32 +++++++++++++++++++++++++------- 1 files changed, 25 insertions(+), 7 deletions(-) diff --git a/demos/ppl_pips/ppl_pips.cc b/demos/ppl_pips/ppl_pips.cc index eb47f34..e857b18 100644 --- a/demos/ppl_pips/ppl_pips.cc +++ b/demos/ppl_pips/ppl_pips.cc @@ -108,6 +108,8 @@ namespace { PPL::PIP_Problem_Control_Parameter_Value cutting_strategy = PPL::PIP_CUTTING_STRATEGY_FIRST; +int loop_iterations = 1; + void pip_display_sol(std::ostream& out, const Parma_Polyhedra_Library::PIP_Tree pip, @@ -436,6 +438,7 @@ struct option long_options[] = { {"piplib", no_argument, 0, 'p'}, {"timings", no_argument, 0, 't'}, {"verbose", no_argument, 0, 'v'}, + {"iterations", required_argument, 0, 'i'}, #if defined(USE_PPL) {"version", no_argument, 0, 'V'}, {"check", required_argument, 0, 'c'}, @@ -459,6 +462,7 @@ static const char* usage_string " -p, --piplib read problem in PIPlib format\n" " -t, --timings prints timings to stderr\n" " -v, --verbose produces lots of output\n" +" -i, --iterations=N execute the resolution N times (default=1)\n" #if defined(USE_PPL) " -V, --version prints version information to stdout\n" " -cPATH, --check=PATH checks if the result is equal to what is in PATH\n" @@ -474,9 +478,9 @@ static const char* usage_string "Report bugs to <ppl-devel(a)cs.unipr.it>.\n"; #if defined(USE_PPL) -#define OPTION_LETTERS "R:ho:PptvVc:df" +#define OPTION_LETTERS "R:ho:Pptvi:Vc:df" #else -#define OPTION_LETTERS "R:ho:Pptvdf" +#define OPTION_LETTERS "R:ho:Pptvi:df" #endif const char* program_name = 0; @@ -654,6 +658,12 @@ process_options(int argc, char* argv[]) { verbose = true; break; + case 'i': + loop_iterations = strtol(optarg, &endptr, 10); + if (*endptr || loop_iterations < 1) + fatal("a positive integer must follow `-i'"); + break; + #if defined(USE_PPL) case 'V': @@ -744,18 +754,26 @@ main(int argc, char* argv[]) try { maybe_start_clock(); - // Compute the dual simplex on the problem. const PPL::PIP_Problem& pip = parser->problem(); - pip.solve(); + if (loop_iterations == 1) { + // Compute the dual simplex on the problem. + pip.solve(); + // Write the solution. + parser->output_solution_tree(*output_stream_p); + } else { + // Perform a time benchmark loop executing the resolution several times. + for (int i=0; i<loop_iterations; ++i) { + PPL::PIP_Problem* pipp = new PPL::PIP_Problem(pip); + pipp->solve(); + delete pipp; + } + } #if defined(USE_PPL) || defined(USE_PIPLIB) maybe_print_clock(); #endif - // Write the solution. - parser->output_solution_tree(*output_stream_p); - return 0; } catch (const std::bad_alloc&) {

1 0

[GIT] ppl/ppl(pip): Fixed a bug in PIP_Problem copy constructor.
by François Galea 16 Nov '09

16 Nov '09

Module: ppl/ppl Branch: pip Commit: 407ea63b7d301cad08af571b493ccde596414a86 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=407ea63b7d30… Author: François Galea <francois.galea(a)uvsq.fr> Date: Mon Nov 16 18:23:58 2009 +0100 Fixed a bug in PIP_Problem copy constructor. --- src/PIP_Problem.cc | 2 +- 1 files changed, 1 insertions(+), 1 deletions(-) diff --git a/src/PIP_Problem.cc b/src/PIP_Problem.cc index 81a79b1..6c98a3f 100644 --- a/src/PIP_Problem.cc +++ b/src/PIP_Problem.cc @@ -64,8 +64,8 @@ PPL::PIP_Problem::PIP_Problem(const PIP_Problem &y) big_parameter_dimension(y.big_parameter_dimension) { if (y.current_solution != 0) current_solution = y.current_solution->clone(); - PPL_ASSERT(OK()); control_parameters_copy(y); + PPL_ASSERT(OK()); } PPL::PIP_Problem::~PIP_Problem() {

1 0

[GIT] ppl/ppl(pip): Updated the deepest cut strategy; now only selects rows associated to initial variables.
by François Galea 16 Nov '09

16 Nov '09

Module: ppl/ppl Branch: pip Commit: 5968086496c32916aeaafe8faadb471be547e2ec URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=5968086496c3… Author: François Galea <francois.galea(a)uvsq.fr> Date: Mon Nov 16 15:00:45 2009 +0100 Updated the deepest cut strategy; now only selects rows associated to initial variables. This results in performance increase in most problems. --- src/PIP_Tree.cc | 11 +++++++---- 1 files changed, 7 insertions(+), 4 deletions(-) diff --git a/src/PIP_Tree.cc b/src/PIP_Tree.cc index 8dddf82..2058c45 100644 --- a/src/PIP_Tree.cc +++ b/src/PIP_Tree.cc @@ -1549,9 +1549,12 @@ PIP_Solution_Node::solve(PIP_Tree_Node*& parent_ref, PPL_DIRTY_TEMP_COEFFICIENT(score2); Coefficient best = 0; dimension_type best_i = 0; - for (i_ = 0; i_ < num_rows; ++i_) { - const Row& row_t = tableau.t[i_]; - const Row& row_s = tableau.s[i_]; + for (i_ = 0; i_ < num_vars; ++i_) { + if (basis[i_]) + continue; + i = mapping[i_]; + const Row& row_t = tableau.t[i]; + const Row& row_s = tableau.s[i]; score1 = 0; for (j = 0; j < num_params; ++j) { mod_assign(mod, row_t[j], d); @@ -1567,7 +1570,7 @@ PIP_Solution_Node::solve(PIP_Tree_Node*& parent_ref, score = score1*score2; if (score > best) { best = score; - best_i = i_; + best_i = i; } } i = best_i;

1 0