May 2009 - PPL-devel - BUGSENG Mailman

[GIT] ppl/ppl(master): Commits improved.
by Roberto Bagnara 14 May '09

14 May '09

Module: ppl/ppl Branch: master Commit: b64080a7407e00c3196f2ab2a16b0dcf46c03567 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=b64080a7407e… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Thu May 14 12:43:47 2009 +0200 Commits improved. --- src/WRD_coefficient_types.defs.hh | 8 ++------ src/checked.inlines.hh | 8 ++++---- 2 files changed, 6 insertions(+), 10 deletions(-) diff --git a/src/WRD_coefficient_types.defs.hh b/src/WRD_coefficient_types.defs.hh index 1916c46..7e28d28 100644 --- a/src/WRD_coefficient_types.defs.hh +++ b/src/WRD_coefficient_types.defs.hh @@ -28,11 +28,9 @@ site: http://www.cs.unipr.it/ppl/ . */ namespace Parma_Polyhedra_Library { #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS -/*! \brief +/*! \brief \ingroup PPL_CXX_interface The production policy for checked numbers used in weakly-relational domains. - - \ingroup PPL_CXX_interface */ #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS) struct WRD_Extended_Number_Policy { @@ -92,11 +90,9 @@ struct WRD_Extended_Number_Policy { }; #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS -/*! \brief +/*! \brief \ingroup PPL_CXX_interface The debugging policy for checked numbers used in weakly-relational domains. - - \ingroup PPL_CXX_interface */ #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS) struct Debug_WRD_Extended_Number_Policy { diff --git a/src/checked.inlines.hh b/src/checked.inlines.hh index 0c96381..7e2e664 100644 --- a/src/checked.inlines.hh +++ b/src/checked.inlines.hh @@ -30,8 +30,8 @@ site: http://www.cs.unipr.it/ppl/ . */ #if defined(__GNUC__) /*! \brief - Performs the test <CODE>a < b</CODE> avoiding the warning - about comparison with min or max of the type. + Performs the test <CODE>a < b</CODE> avoiding the warning about the + comparison being always false due to limited range of data type. */ #define PPL_LT_SILENT(a, b) \ ({ \ @@ -40,8 +40,8 @@ site: http://www.cs.unipr.it/ppl/ . */ _a <= _b && _a != _b; \ }) /*! \brief - Performs the test <CODE>a > b</CODE> avoiding the warning - about comparison with min or max of the type. + Performs the test <CODE>a > b</CODE> avoiding the warning about the + comparison being always false due to limited range of data type. */ #define PPL_GT_SILENT(a, b) PPL_LT_SILENT(b, a) #else

1 0

[GIT] ppl/ppl(master): New commits
by Roberto Bagnara 14 May '09

14 May '09

URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=9f7260b5f092… Merge: c606710cfe67adb748857cfb840d20a2feb3a3b8 6c8a266be0f01266599542b7cdc3d3c2a47e62d2 Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Thu May 14 12:36:18 2009 +0200 Merge branch 'bounded_arithmetic' URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=6c8a266be0f0… Author: Abramo Bagnara <abramo.bagnara(a)gmail.com> Date: Thu May 14 09:41:30 2009 +0200 Silenced bogus comparison warnings. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=9724ada507cd… Author: Abramo Bagnara <abramo.bagnara(a)gmail.com> Date: Thu May 14 10:11:31 2009 +0200 Added missing policy. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=f922aa0fa152… Author: Abramo Bagnara <abramo.bagnara(a)gmail.com> Date: Thu May 14 08:45:36 2009 +0200 Added missing Result values. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=6d905acbbe0a… Author: Abramo Bagnara <abramo.bagnara(a)gmail.com> Date: Thu May 14 08:28:05 2009 +0200 Fixed some typos. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=e33e130ebcb9… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Thu May 14 08:30:18 2009 +0200 New policy Debug_WRD_Extended_Number_Policy. This is the debugging policy for checked numbers used in weakly-relational domains. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=8c4cee6feb0a… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Thu May 14 08:12:12 2009 +0200 WRD_Extended_Number_Policy properly commented. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=ffc6689ea022… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Thu May 14 07:10:26 2009 +0200 Marked tests that are expected to fail with 8-bit coefficients. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=5f9892fcb2fc… Author: Abramo Bagnara <abramo.bagnara(a)gmail.com> Date: Wed May 13 23:42:29 2009 +0200 Added wrap_assign. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=b55ca03354c3… Author: Abramo Bagnara <abramo.bagnara(a)gmail.com> Date: Wed May 13 23:41:38 2009 +0200 Added add_2exp and sub_2exp. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=37f8d8b4162a… Author: Abramo Bagnara <abramo.bagnara(a)gmail.com> Date: Wed May 13 23:33:01 2009 +0200 Added missing info clearing. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=0edbd37a47bb… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Wed May 13 22:17:32 2009 +0200 Coefficient types of weakly-relational domains moved to new source files. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=ee2d6c28172e… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Wed May 13 21:29:11 2009 +0200 Comment fixed. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=bfc05d94ff20… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Wed May 13 20:29:09 2009 +0200 Got rid of Checked_Number_Default_Policy. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=76c766e5f4da… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Wed May 13 20:28:36 2009 +0200 Bounded_Integer_Coefficient_Policy::handle_result() commented. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=6ea0b6f8a8ee… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Wed May 13 20:20:28 2009 +0200 Also check for NaN in Bounded_Integer_Coefficient_Policy::handle_result(). URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=2ee98075c306… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Wed May 13 20:13:31 2009 +0200 Checked number policy parameter `check_nan_result' renamed `fpu_check_nan_result'. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=0cb27e7158a1… Author: Abramo Bagnara <abramo.bagnara(a)gmail.com> Date: Wed May 13 20:05:05 2009 +0200 Fixed return type. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=eb89cfe6722a… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Wed May 13 20:01:01 2009 +0200 Use Bounded_Integer_Coefficient_Policy as the policy for checked coefficients. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=a8f95c123cd3… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Wed May 13 20:00:32 2009 +0200 Added Bounded_Integer_Coefficient_Policy. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=986d10992053… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Wed May 13 19:59:13 2009 +0200 Checked_Number_Transparent_Policy properly commented. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=cbcb69446ece… Author: Abramo Bagnara <abramo.bagnara(a)gmail.com> Date: Wed May 13 11:39:15 2009 +0200 Fixed topological closure for unbounded intervals. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=8c816f458ca9… Author: Abramo Bagnara <abramo.bagnara(a)gmail.com> Date: Wed May 13 11:48:59 2009 +0200 Reorganized and separated Result classes to be more informative. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=ca38275a5e16… Author: Abramo Bagnara <abramo.bagnara(a)gmail.com> Date: Tue May 12 17:30:01 2009 +0200 Added smod_2exp and umod_2exp for boundary. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=80ba9754deb0… Author: Abramo Bagnara <abramo.bagnara(a)gmail.com> Date: Sun May 10 19:30:17 2009 +0200 Added umod_2exp and smod_2exp to checked numbers. Fixed rem for mpq to work similarly to other numeric types. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=98fb9c3061d1… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Sat May 9 14:22:25 2009 +0200 Drafted specialized implementation for Box<ITV>::wrap_assign. Code still commented out as it relies on a missing Interval method. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=306db9d46d07… Merge: 7309a3a239bc75074827c6c61bd0df2b278088df 317f48d0d55391b07624e0f55a6228e3b2d39d6f Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Tue May 5 19:22:47 2009 +0200 Merge branch 'master' into bounded_arithmetic URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=7309a3a239bc… Author: Abramo Bagnara <abramo.bagnara(a)gmail.com> Date: Tue May 5 13:59:21 2009 +0200 Fixed typo on assertion. URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=962d7b0a74ec… Author: Abramo Bagnara <abramo.bagnara(a)gmail.com> Date: Tue May 5 10:47:36 2009 +0200 Added Circular Integer intervals.

1 0

[GIT] ppl/ppl(bounded_arithmetic): Silenced bogus comparison warnings.
by Abramo Bagnara 14 May '09

14 May '09

Module: ppl/ppl Branch: bounded_arithmetic Commit: 6c8a266be0f01266599542b7cdc3d3c2a47e62d2 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=6c8a266be0f0… Author: Abramo Bagnara <abramo.bagnara(a)gmail.com> Date: Thu May 14 09:41:30 2009 +0200 Silenced bogus comparison warnings. --- src/checked.inlines.hh | 31 ++++++++++++++++++++++++++----- src/checked_int.inlines.hh | 18 +++++++++--------- 2 files changed, 35 insertions(+), 14 deletions(-) diff --git a/src/checked.inlines.hh b/src/checked.inlines.hh index a98c153..0c96381 100644 --- a/src/checked.inlines.hh +++ b/src/checked.inlines.hh @@ -28,6 +28,27 @@ site: http://www.cs.unipr.it/ppl/ . */ #include "C_Integer.hh" #include <cassert> +#if defined(__GNUC__) +/*! \brief + Performs the test <CODE>a < b</CODE> avoiding the warning + about comparison with min or max of the type. +*/ +#define PPL_LT_SILENT(a, b) \ + ({ \ + __typeof__(a) _a = (a); \ + __typeof__(b) _b = (b); \ + _a <= _b && _a != _b; \ + }) +/*! \brief + Performs the test <CODE>a > b</CODE> avoiding the warning + about comparison with min or max of the type. +*/ +#define PPL_GT_SILENT(a, b) PPL_LT_SILENT(b, a) +#else +#define PPL_LT_SILENT(a, b) ((a) < (b)) +#define PPL_GT_SILENT(a, b) ((a) > (b)) +#endif + namespace Parma_Polyhedra_Library { namespace Checked { @@ -439,7 +460,7 @@ inline typename Enable_If<(!Safe_Int_Comparison<S, U>::value && C_Integer<U>::value && C_Integer<S>::is_signed), bool>::type lt(const U& x, const S& y) { - return y >= 0 && x < y; + return y >= 0 && x < static_cast<typename C_Integer<S>::other_type>(y); } template <typename S, typename U> @@ -455,7 +476,7 @@ inline typename Enable_If<(!Safe_Int_Comparison<S, U>::value && C_Integer<U>::value && C_Integer<S>::is_signed), bool>::type le(const U& x, const S& y) { - return y >= 0 && x <= y; + return y >= 0 && x <= static_cast<typename C_Integer<S>::other_type>(y); } template <typename S, typename U> @@ -463,7 +484,7 @@ inline typename Enable_If<(!Safe_Int_Comparison<S, U>::value && C_Integer<U>::value && C_Integer<S>::is_signed), bool>::type eq(const S& x, const U& y) { - return x >= 0 && x == y; + return x >= 0 && static_cast<typename C_Integer<S>::other_type>(x) == y; } template <typename U, typename S> @@ -471,7 +492,7 @@ inline typename Enable_If<(!Safe_Int_Comparison<S, U>::value && C_Integer<U>::value && C_Integer<S>::is_signed), bool>::type eq(const U& x, const S& y) { - return y >= 0 && x == y; + return y >= 0 && x == static_cast<typename C_Integer<S>::other_type>(y); } template <typename T1, typename T2> @@ -480,7 +501,7 @@ inline typename Enable_If<(!Safe_Conversion<T1, T2>::value && (!C_Integer<T1>::value || !C_Integer<T2>::value)), bool>::type eq(const T1& x, const T2& y) { PPL_DIRTY_TEMP(T1, tmp); - Result r = assign_r(tmp, y, static_cast<Rounding_Dir>(ROUND_DIRECT | ROUND_FPU_CHECK_INEXACT)); + Result r = assign_r(tmp, y, ROUND_CHECK); // FIXME: We can do this also without fpu inexact check using a // conversion back and forth and then testing equality. We should // code this in checked_float.inlines.hh, probably it's faster also diff --git a/src/checked_int.inlines.hh b/src/checked_int.inlines.hh index d74cba2..95676fd 100644 --- a/src/checked_int.inlines.hh +++ b/src/checked_int.inlines.hh @@ -347,10 +347,10 @@ assign_signed_int_signed_int(To& to, const From from, Rounding_Dir dir) { && (Extended_Int<To_Policy, To>::min > Extended_Int<From_Policy, From>::min || Extended_Int<To_Policy, To>::max < Extended_Int<From_Policy, From>::max))) { if (CHECK_P(To_Policy::check_overflow, - from < From(Extended_Int<To_Policy, To>::min))) + PPL_LT_SILENT(from, From(Extended_Int<To_Policy, To>::min)))) return set_neg_overflow_int<To_Policy>(to, dir); if (CHECK_P(To_Policy::check_overflow, - from > From(Extended_Int<To_Policy, To>::max))) + PPL_GT_SILENT(from, From(Extended_Int<To_Policy, To>::max)))) return set_pos_overflow_int<To_Policy>(to, dir); } to = To(from); @@ -390,7 +390,7 @@ assign_unsigned_int_unsigned_int(To& to, const From from, Rounding_Dir dir) { || (sizeof(To) == sizeof(From) && Extended_Int<To_Policy, To>::max < Extended_Int<From_Policy, From>::max)) { if (CHECK_P(To_Policy::check_overflow, - from > From(Extended_Int<To_Policy, To>::max))) + PPL_GT_SILENT(from, From(Extended_Int<To_Policy, To>::max)))) return set_pos_overflow_int<To_Policy>(to, dir); } to = To(from); @@ -561,9 +561,9 @@ assign_signed_int_mpz(To& to, const mpz_class& from, Rounding_Dir dir) { } if (from.fits_slong_p()) { signed long v = from.get_si(); - if (v < Extended_Int<To_Policy, To>::min) + if (PPL_LT_SILENT(v, (Extended_Int<To_Policy, To>::min))) return set_neg_overflow_int<To_Policy>(to, dir); - if (v > Extended_Int<To_Policy, To>::max) + if (PPL_GT_SILENT(v, (Extended_Int<To_Policy, To>::max))) return set_pos_overflow_int<To_Policy>(to, dir); to = v; return V_EQ; @@ -610,7 +610,7 @@ assign_unsigned_int_mpz(To& to, const mpz_class& from, Rounding_Dir dir) { } if (from.fits_ulong_p()) { unsigned long v = from.get_ui(); - if (v > Extended_Int<To_Policy, To>::max) + if (PPL_GT_SILENT(v, (Extended_Int<To_Policy, To>::max))) return set_pos_overflow_int<To_Policy>(to, dir); to = v; return V_EQ; @@ -1230,7 +1230,7 @@ mul_2exp_unsigned_int(Type& to, const Type x, unsigned int exp, if (x & (((Type(1) << exp) - 1) << (sizeof(Type) * CHAR_BIT - exp))) return set_pos_overflow_int<To_Policy>(to, dir); Type n = x << exp; - if (n > Extended_Int<To_Policy, Type>::max) + if (PPL_GT_SILENT(n, (Extended_Int<To_Policy, Type>::max))) return set_pos_overflow_int<To_Policy>(to, dir); to = n; return V_EQ; @@ -1261,14 +1261,14 @@ mul_2exp_signed_int(Type& to, const Type x, unsigned int exp, if ((x & mask) != mask) return set_neg_overflow_int<To_Policy>(to, dir); n = x << exp; - if (n < Extended_Int<To_Policy, Type>::min) + if (PPL_LT_SILENT(n, (Extended_Int<To_Policy, Type>::min))) return set_neg_overflow_int<To_Policy>(to, dir); } else { if (x & mask) return set_pos_overflow_int<To_Policy>(to, dir); n = x << exp; - if (n > Extended_Int<To_Policy, Type>::max) + if (PPL_GT_SILENT(n, (Extended_Int<To_Policy, Type>::max))) return set_pos_overflow_int<To_Policy>(to, dir); } to = n;

1 0

[GIT] ppl/ppl(bounded_arithmetic): Added missing policy.
by Abramo Bagnara 14 May '09

14 May '09

Module: ppl/ppl Branch: bounded_arithmetic Commit: 9724ada507cd902da0de7f179519935a54c341a9 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=9724ada507cd… Author: Abramo Bagnara <abramo.bagnara(a)gmail.com> Date: Thu May 14 10:11:31 2009 +0200 Added missing policy. --- tests/Box/frombox1.cc | 2 +- 1 files changed, 1 insertions(+), 1 deletions(-) diff --git a/tests/Box/frombox1.cc b/tests/Box/frombox1.cc index 217b86e..8379d19 100644 --- a/tests/Box/frombox1.cc +++ b/tests/Box/frombox1.cc @@ -79,7 +79,7 @@ test04() { bool test05() { const int DIM = 10; - typedef Checked_Number<mpq_class> Q; + typedef Checked_Number<mpq_class, Checked_Number_Transparent_Policy<mpq_class> > Q; Rational_Box src(DIM, UNIVERSE); Q k; Q a;

1 0

[GIT] ppl/ppl(products): Added new method frequency() for Grids.
by Patricia Hill 14 May '09

14 May '09

Module: ppl/ppl Branch: products Commit: 4f5a7d280e521fb9e657b6b45798b98637f50229 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=4f5a7d280e52… Author: Patricia Hill <p.m.hill(a)leeds.ac.uk> Date: Thu May 14 07:41:22 2009 +0100 Added new method frequency() for Grids. --- tests/Grid/frequency1.cc | 284 ++++++++++++++++++++++++++++++++++++++++++++++ 1 files changed, 284 insertions(+), 0 deletions(-) diff --git a/tests/Grid/frequency1.cc b/tests/Grid/frequency1.cc new file mode 100644 index 0000000..d4727e4 --- /dev/null +++ b/tests/Grid/frequency1.cc @@ -0,0 +1,284 @@ +/* Test Grid::frequency(). + Copyright (C) 2001-2009 Roberto Bagnara <bagnara(a)cs.unipr.it> + +This file is part of the Parma Polyhedra Library (PPL). + +The PPL is free software; you can redistribute it and/or modify it +under the terms of the GNU General Public License as published by the +Free Software Foundation; either version 3 of the License, or (at your +option) any later version. + +The PPL is distributed in the hope that it will be useful, but WITHOUT +ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or +FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License +for more details. + +You should have received a copy of the GNU General Public License +along with this program; if not, write to the Free Software Foundation, +Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA. + +For the most up-to-date information see the Parma Polyhedra Library +site: http://www.cs.unipr.it/ppl/ . */ + +#include "ppl_test.hh" + +using namespace Parma_Polyhedra_Library::IO_Operators; + +namespace { + +// Universe and empty grid. +bool +test01() { + Variable A(0); + + Grid gr1(1); + + Grid gr2(1, EMPTY); + + Coefficient num1; + Coefficient den1; + Coefficient valn1; + Coefficient vald1; + Coefficient num2; + Coefficient den2; + Coefficient valn2; + Coefficient vald2; + bool ok = (!gr1.frequency(A, num1, den1, valn1, vald1) + && !gr2.frequency(A, num2, den2, valn2, vald2)); + print_congruences(gr1, "*** gr1 ***"); + print_congruences(gr2, "*** gr2 ***"); + + return ok; +} + +// 0-dimension grids. +bool +test02() { + Grid gr1(0); + + Grid gr2(0, EMPTY); + + Coefficient num1; + Coefficient den1; + Coefficient valn1; + Coefficient vald1; + Coefficient num2; + Coefficient den2; + Coefficient valn2; + Coefficient vald2; + bool ok = (gr1.frequency(Linear_Expression(0), num1, den1, valn1, vald1) + && num1 == 0 && den1 == 1 && valn1 == 0 && vald1 == 1 + && !gr2.frequency(Linear_Expression(0), num2, den2, valn2, vald2)); + print_congruences(gr1, "*** gr1 ***"); + print_congruences(gr2, "*** gr2 ***"); + + return ok; +} + +// Non-relational test. +bool +test03() { + Variable A(0); + + Grid gr(1); + gr.add_congruence(A %= 0); + + Coefficient num; + Coefficient den; + Coefficient valn; + Coefficient vald; + bool ok = (gr.frequency(Linear_Expression(A), num, den, valn, vald) + && num == 1 && den == 1 && valn == 0 && vald == 1); + print_congruences(gr, "*** gr ***"); + + return ok; +} + +bool +test04() { + Variable A(0); + Variable B(1); + + Grid gr(2); + gr.add_congruence(A %= 0); + + Coefficient num; + Coefficient den; + Coefficient valn; + Coefficient vald; + bool ok = (!gr.frequency(Linear_Expression(B), num, den, valn, vald)); + print_congruences(gr, "*** gr ***"); + + return ok; +} + +bool +test05() { + Variable A(0); + Variable B(1); + + Grid gr(2); + gr.add_congruence(A %= 0); + gr.add_congruence(B %= 0); + + Coefficient num; + Coefficient den; + Coefficient valn; + Coefficient vald; + bool ok = (gr.frequency(Linear_Expression(A + B - 3), num, den, valn, vald) + && num == 1 && den == 1 && valn == 0 && vald == 1); + print_congruences(gr, "*** gr ***"); + + return ok; +} + +bool +test06() { + Variable A(0); + Variable B(1); + + Grid gr(2); + gr.add_congruence(A %= 0); + gr.add_congruence((B %= 1) / 2); + + Coefficient num; + Coefficient den; + Coefficient valn; + Coefficient vald; + bool ok = (gr.frequency(Linear_Expression(2*A + B), num, den, valn, vald) + && num == 2 && den == 1 && valn == 1 && vald == 1); + print_congruences(gr, "*** gr ***"); + + return ok; +} + +bool +test07() { + Variable A(0); + Variable B(1); + + Grid gr(2); + gr.add_congruence(A %= 0); + gr.add_congruence((B %= 1) / 2); + + Coefficient num; + Coefficient den; + Coefficient valn; + Coefficient vald; + bool ok = (gr.frequency(Linear_Expression(2*A + 3*B), num, den, valn, vald) + && num == 2 && den == 1 && valn == 1 && vald == 1); + print_congruences(gr, "*** gr ***"); + + return ok; +} + +bool +test08() { + Variable A(0); + Variable B(1); + + Grid gr(2); + gr.add_congruence(3*A %= 0); + gr.add_congruence((B %= 0) / 2); + + Coefficient num; + Coefficient den; + Coefficient valn; + Coefficient vald; + bool ok = (gr.frequency(Linear_Expression(2*A + 3*B - 1), + num, den, valn, vald) + && num == 2 && den == 3 && valn == -1 && vald == 3); + print_congruences(gr, "*** gr ***"); + + return ok; +} + +bool +test09() { + Variable A(0); + Variable B(1); + + Grid gr(2); + gr.add_congruence((A %= 1) / 2); + gr.add_congruence((B %= 1) / 2); + + Coefficient num; + Coefficient den; + Coefficient valn; + Coefficient vald; + bool ok = (gr.frequency(Linear_Expression(3*A + 2*B + 5), + num, den, valn, vald) + && num == 2 && den == 1 && valn == 0 && vald == 1); + print_congruences(gr, "*** gr ***"); + + return ok; +} + +bool +test10() { + Variable A(0); + Variable B(1); + Variable C(2); + Variable D(3); + + Grid gr(4, EMPTY); + gr.add_grid_generator(grid_point((-2*A - C + 2*D), 2)); + gr.add_grid_generator(parameter(10*A, 2)); + gr.add_grid_generator(grid_line(2*B + C)); + gr.add_grid_generator(parameter(5*C, 2)); + gr.add_grid_generator(parameter(10*D, 2)); + + Coefficient num; + Coefficient den; + Coefficient valn; + Coefficient vald; + bool ok = (gr.frequency(Linear_Expression(3*A - B + 2*C - 17), + num, den, valn, vald) + && num == 5 && den == 1 && valn == -1 && vald == 1); + + Grid known_gr(gr); + known_gr.add_congruence((3*A - B + 2*C - 17 %= -1) / 5); + print_congruences(gr, "*** gr ***"); + + return ok && (gr == known_gr); +} + +bool +test11() { + Variable A(0); + Variable B(1); + + Grid gr(2, EMPTY); + gr.add_grid_generator(grid_point((2*A - B), 4)); + gr.add_grid_generator(parameter(B)); + + Coefficient num; + Coefficient den; + Coefficient valn; + Coefficient vald; + bool ok = (gr.frequency(Linear_Expression(A), + num, den, valn, vald) + && num == 0 && den == 1 && valn == 1 && vald == 2); + + Grid known_gr(gr); + known_gr.add_congruence((2*A %= 1) / 0); + print_congruences(gr, "*** gr ***"); + + return ok && (gr == known_gr); +} + +} // namespace + +BEGIN_MAIN + DO_TEST(test01); + DO_TEST(test02); + DO_TEST(test03); + DO_TEST(test04); + DO_TEST(test05); + DO_TEST(test06); + DO_TEST(test07); + DO_TEST(test08); + DO_TEST(test09); + DO_TEST(test10); + DO_TEST(test11); +END_MAIN

1 0

[GIT] ppl/ppl(products): Added new method frequency() for Grids.
by Patricia Hill 14 May '09

14 May '09

Module: ppl/ppl Branch: products Commit: c7f4b16d84c83be74fb0e62080e2d22b51d170a6 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=c7f4b16d84c8… Author: Patricia Hill <p.m.hill(a)leeds.ac.uk> Date: Thu May 14 07:41:22 2009 +0100 Added new method frequency() for Grids. --- src/Grid.defs.hh | 33 +++++++++++++++++++++++++++++++++ src/Grid_public.cc | 26 ++++++++++++++++++++++++++ tests/Grid/Makefile.am | 3 +++ 3 files changed, 62 insertions(+), 0 deletions(-) diff --git a/src/Grid.defs.hh b/src/Grid.defs.hh index 3049c31..0ad5277 100644 --- a/src/Grid.defs.hh +++ b/src/Grid.defs.hh @@ -861,6 +861,39 @@ public: Coefficient& inf_n, Coefficient& inf_d, bool& minimum, Generator& point) const; + /*! \brief + Returns <CODE>true</CODE> if and only if \p *this is not empty and + \p expr is discrete in \p *this, in which case the maximum frequency + and the value for \p expr that is closest to zero are computed. + + \param expr + The linear expression for which the frequency is needed; + + \param freq_n + The numerator of the maximum frequency of \p expr; + + \param freq_d + The denominator of the maximum frequency of \p expr; + + \param val_n + The numerator of a value of \p expr at a point in the grid + that is closest to zero; + + \param val_d + The denominator of a value of \p expr at a point in the grid + that is closest to zero; + + \exception std::invalid_argument + Thrown if \p expr and \p *this are dimension-incompatible. + + If \p *this is empty or \p expr can take any real number in \p *this, + <CODE>false</CODE> is returned and \p freq_n, \p freq_d, + \p val_n and \p val_d are left untouched. + */ + bool frequency(const Linear_Expression& expr, + Coefficient& freq_n, Coefficient& freq_d, + Coefficient& val_n, Coefficient& val_d) const; + //! Returns <CODE>true</CODE> if and only if \p *this contains \p y. /*! \exception std::invalid_argument diff --git a/src/Grid_public.cc b/src/Grid_public.cc index 16e6ba9..24a53f6 100644 --- a/src/Grid_public.cc +++ b/src/Grid_public.cc @@ -2475,6 +2475,32 @@ PPL::Grid::time_elapse_assign(const Grid& y) { assert(x.OK(true) && y.OK(true)); } +bool +PPL::Grid::frequency(const Linear_Expression& expr, + Coefficient& freq_n, Coefficient& freq_d, + Coefficient& val_n, Coefficient& val_d) const { + // The dimension of `expr' must be at most the dimension of *this. + if (space_dim < expr.space_dimension()) + throw_dimension_incompatible("frequency(e, ...)", "e", expr); + + // Space dimension = 0: if empty, then return false; + // otherwise the frequency is 1 and the value is 0 + if (space_dim == 0) { + if (is_empty()) + return false; + freq_n = 0; + freq_d = 1; + val_n = 0; + val_d = 1; + return true; + } + if (!generators_are_minimized() && !minimize()) + // Minimizing found `this' empty. + return false; + + return frequency_no_check(expr, freq_n, freq_d, val_n, val_d); +} + /*! \relates Parma_Polyhedra_Library::Grid */ bool PPL::operator==(const Grid& x, const Grid& y) { diff --git a/tests/Grid/Makefile.am b/tests/Grid/Makefile.am index 7189082..74bab01 100644 --- a/tests/Grid/Makefile.am +++ b/tests/Grid/Makefile.am @@ -81,6 +81,7 @@ disjoint1 \ equals1 \ expandspacedim1 \ foldspacedims1 \ +frequency1 \ frombdshape1 \ frombox1 \ fromgrid1 \ @@ -191,6 +192,8 @@ equals1_SOURCES = equals1.cc expandspacedim1_SOURCES = expandspacedim1.cc +frequency1_SOURCES = frequency1.cc + frombdshape1_SOURCES = frombdshape1.cc frombox1_SOURCES = frombox1.cc

1 0

[GIT] ppl/ppl(bounded_arithmetic): Added missing Result values.
by Abramo Bagnara 14 May '09

14 May '09

Module: ppl/ppl Branch: bounded_arithmetic Commit: f922aa0fa1526a2f52b04b3c180c514a578420c7 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=f922aa0fa152… Author: Abramo Bagnara <abramo.bagnara(a)gmail.com> Date: Thu May 14 08:45:36 2009 +0200 Added missing Result values. --- src/Checked_Number.cc | 14 +++++++++++--- src/Checked_Number.inlines.hh | 2 +- src/Result.defs.hh | 8 ++++---- 3 files changed, 16 insertions(+), 8 deletions(-) diff --git a/src/Checked_Number.cc b/src/Checked_Number.cc index 03ec838..5852e6a 100644 --- a/src/Checked_Number.cc +++ b/src/Checked_Number.cc @@ -27,7 +27,11 @@ namespace Parma_Polyhedra_Library { void throw_result_exception(Result r) { - switch (r) { + switch (r - V_UNREPRESENTABLE) { + case V_EMPTY: + throw std::domain_error("Exact result is not comparable to computable one."); + case V_EQ: + throw std::logic_error("Exact result is equal to computed one."); case V_LT: throw std::logic_error("Exact result is less than computed one."); case V_LE: @@ -47,15 +51,19 @@ throw_result_exception(Result r) { case V_EQ_MINUS_INFINITY: throw std::overflow_error("Minus infinity."); case V_GT_MINUS_INFINITY: + case V_LT_INF: throw std::overflow_error("Negative overflow."); case V_UNKNOWN_NEG_OVERFLOW: - throw std::overflow_error("Unknown result due to negative overflow."); + throw std::overflow_error("Unknown result due to intermediate negative overflow."); case V_EQ_PLUS_INFINITY: throw std::overflow_error("Plus infinity."); case V_LT_PLUS_INFINITY: + case V_GT_SUP: throw std::overflow_error("Positive overflow."); case V_UNKNOWN_POS_OVERFLOW: - throw std::overflow_error("Unknown result due to positive overflow."); + throw std::overflow_error("Unknown result due to intermediate positive overflow."); + case V_NAN: + throw std::domain_error("Not-a-Number."); case V_CVT_STR_UNK: throw std::domain_error("Invalid numeric string."); case V_DIV_ZERO: diff --git a/src/Checked_Number.inlines.hh b/src/Checked_Number.inlines.hh index 5996143..20babf4 100644 --- a/src/Checked_Number.inlines.hh +++ b/src/Checked_Number.inlines.hh @@ -33,7 +33,7 @@ inline Rounding_Dir rounding_dir(Rounding_Dir dir) { if (dir == ROUND_NOT_NEEDED) { #ifdef DEBUG_ROUND_NOT_NEEDED - return ROUND_DIRECT & ROUND_FPU_CHECK_INEXACT; + return ROUND_CHECK; #else return ROUND_IGNORE; #endif diff --git a/src/Result.defs.hh b/src/Result.defs.hh index 613ddb4..ae68372 100644 --- a/src/Result.defs.hh +++ b/src/Result.defs.hh @@ -100,9 +100,6 @@ enum Result { //! \hideinitializer The exact result is a number out of finite bounds. V_OVERFLOW = 1 << 6, - //! \hideinitializer The computed result is not representable. - V_UNREPRESENTABLE = 1 << 7, - //! \hideinitializer A negative integer overflow occurred (rounding up). V_LT_INF = V_LT | V_OVERFLOW, @@ -155,7 +152,10 @@ enum Result { V_UNKNOWN_NEG_OVERFLOW = V_NAN | (10 << 8), //! \hideinitializer Unknown result due to intermediate positive overflow. - V_UNKNOWN_POS_OVERFLOW = V_NAN | (11 << 8) + V_UNKNOWN_POS_OVERFLOW = V_NAN | (11 << 8), + + //! \hideinitializer The computed result is not representable. + V_UNREPRESENTABLE = 1 << 7, };

1 0

[GIT] ppl/ppl(bounded_arithmetic): Fixed some typos.
by Abramo Bagnara 14 May '09

14 May '09

Module: ppl/ppl Branch: bounded_arithmetic Commit: 6d905acbbe0a9a488562292454cee9e51983871c URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=6d905acbbe0a… Author: Abramo Bagnara <abramo.bagnara(a)gmail.com> Date: Thu May 14 08:28:05 2009 +0200 Fixed some typos. --- src/Interval.defs.hh | 14 +++++++------- 1 files changed, 7 insertions(+), 7 deletions(-) diff --git a/src/Interval.defs.hh b/src/Interval.defs.hh index e58b084..56b0b6c 100644 --- a/src/Interval.defs.hh +++ b/src/Interval.defs.hh @@ -529,9 +529,9 @@ public: } template <typename T> - typename Enable_If<Is_Singleton<T>::value || Is_Interval<T>::value, Interval&>::type - wrap_assign(const T& x, Bounded_Integer_Type_Width w, - Bounded_Integer_Type_Signedness s, const Interval& refinement) { + typename Enable_If<Is_Singleton<T>::value || Is_Interval<T>::value, I_Result>::type + wrap_assign(Bounded_Integer_Type_Width w, Bounded_Integer_Type_Signedness s, + const Interval& refinement) { if (is_empty()) return I_EMPTY; if (lower_is_boundary_infinity() || upper_is_boundary_infinity()) @@ -544,15 +544,15 @@ public: switch (s) { case UNSIGNED: umod_2exp_assign(LOWER, lower(), info(), - LOWER, f_lower(x), f_info(x), w); + LOWER, lower(), info(), w); umod_2exp_assign(UPPER, upper(), info(), - UPPER, f_upper(x), f_info(x), w); + UPPER, upper(), info(), w); break; case SIGNED_2_COMPLEMENT: smod_2exp_assign(LOWER, lower(), info(), - LOWER, f_lower(x), f_info(x), w); + LOWER, lower(), info(), w); smod_2exp_assign(UPPER, upper(), info(), - UPPER, f_upper(x), f_info(x), w); + UPPER, upper(), info(), w); break; default: assert(false);

1 0

[GIT] ppl/ppl(bounded_arithmetic): New policy Debug_WRD_Extended_Number_Policy.
by Roberto Bagnara 14 May '09

14 May '09

Module: ppl/ppl Branch: bounded_arithmetic Commit: e33e130ebcb92b6ae36fdd8bf75d0c7c7e1b0047 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=e33e130ebcb9… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Thu May 14 08:30:18 2009 +0200 New policy Debug_WRD_Extended_Number_Policy. This is the debugging policy for checked numbers used in weakly-relational domains. --- src/BD_Shape.defs.hh | 2 +- src/Octagonal_Shape.defs.hh | 2 +- src/WRD_coefficient_types.defs.hh | 71 +++++++++++++++++++++++++++++++++- src/WRD_coefficient_types.inlines.hh | 6 +++ 4 files changed, 78 insertions(+), 3 deletions(-) diff --git a/src/BD_Shape.defs.hh b/src/BD_Shape.defs.hh index a15ff6a..f836ad7 100644 --- a/src/BD_Shape.defs.hh +++ b/src/BD_Shape.defs.hh @@ -406,7 +406,7 @@ private: the inequalities defining a BDS. */ #ifndef NDEBUG - typedef Checked_Number<T, Extended_Number_Policy> N; + typedef Checked_Number<T, Debug_WRD_Extended_Number_Policy> N; #else typedef Checked_Number<T, WRD_Extended_Number_Policy> N; #endif diff --git a/src/Octagonal_Shape.defs.hh b/src/Octagonal_Shape.defs.hh index 02bbb32..f227261 100644 --- a/src/Octagonal_Shape.defs.hh +++ b/src/Octagonal_Shape.defs.hh @@ -417,7 +417,7 @@ private: the inequalities defining an OS. */ #ifndef NDEBUG - typedef Checked_Number<T, Extended_Number_Policy> N; + typedef Checked_Number<T, Debug_WRD_Extended_Number_Policy> N; #else typedef Checked_Number<T, WRD_Extended_Number_Policy> N; #endif diff --git a/src/WRD_coefficient_types.defs.hh b/src/WRD_coefficient_types.defs.hh index ae7d707..1916c46 100644 --- a/src/WRD_coefficient_types.defs.hh +++ b/src/WRD_coefficient_types.defs.hh @@ -28,7 +28,12 @@ site: http://www.cs.unipr.it/ppl/ . */ namespace Parma_Polyhedra_Library { #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS -/*! \ingroup PPL_CXX_interface */ +/*! \brief + The production policy for checked numbers used in weakly-relational + domains. + + \ingroup PPL_CXX_interface + */ #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS) struct WRD_Extended_Number_Policy { //! Check for overflowed result. @@ -86,6 +91,70 @@ struct WRD_Extended_Number_Policy { static void handle_result(Result r); }; +#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS +/*! \brief + The debugging policy for checked numbers used in weakly-relational + domains. + + \ingroup PPL_CXX_interface + */ +#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS) +struct Debug_WRD_Extended_Number_Policy { + //! Check for overflowed result. + const_bool_nodef(check_overflow, true); + + //! Check for attempts to add infinities with different sign. + const_bool_nodef(check_inf_add_inf, true); + + //! Check for attempts to subtract infinities with same sign. + const_bool_nodef(check_inf_sub_inf, true); + + //! Check for attempts to multiply infinities by zero. + const_bool_nodef(check_inf_mul_zero, true); + + //! Check for attempts to divide by zero. + const_bool_nodef(check_div_zero, true); + + //! Check for attempts to divide infinities. + const_bool_nodef(check_inf_div_inf, true); + + //! Check for attempts to compute remainder of infinities. + const_bool_nodef(check_inf_mod, true); + + //! Checks for attempts to take the square root of a negative number. + const_bool_nodef(check_sqrt_neg, true); + + //! Handle not-a-number special value. + const_bool_nodef(has_nan, true); + + //! Handle infinity special values. + const_bool_nodef(has_infinity, true); + + // Do not uncomment the following. + // The compile time error on conversions is the expected behavior. + // const_bool_nodef(convertible, false); + + //! Honor requests to check for FPU inexact results. + const_bool_nodef(fpu_check_inexact, true); + + //! Make extra checks to detect FPU NaN results. + const_bool_nodef(fpu_check_nan_result, true); + + // Do not uncomment the following. + // The compile time error is the expected behavior. + // static const Rounding_Dir ROUND_DEFAULT_CONSTRUCTOR = ROUND_UP; + // static const Rounding_Dir ROUND_DEFAULT_OPERATOR = ROUND_UP; + // static const Rounding_Dir ROUND_DEFAULT_FUNCTION = ROUND_UP; + // static const Rounding_Dir ROUND_DEFAULT_INPUT = ROUND_UP; + // static const Rounding_Dir ROUND_DEFAULT_OUTPUT = ROUND_UP; + + /*! \brief + Handles \p r: called by all constructors, operators and functions that + do not return a Result value. + */ + static void handle_result(Result r); +}; + } // namespace Parma_Polyhedra_Library #include "WRD_coefficient_types.inlines.hh" diff --git a/src/WRD_coefficient_types.inlines.hh b/src/WRD_coefficient_types.inlines.hh index 2f98f58..0bcd080 100644 --- a/src/WRD_coefficient_types.inlines.hh +++ b/src/WRD_coefficient_types.inlines.hh @@ -31,6 +31,12 @@ WRD_Extended_Number_Policy::handle_result(Result r) { throw_result_exception(r); } +inline void +Debug_WRD_Extended_Number_Policy::handle_result(Result r) { + if (result_class(r) == VC_NAN) + throw_result_exception(r); +} + } // namespace Parma_Polyhedra_Library #endif // !defined(PPL_WRD_coefficient_types_inlines_hh)

1 0

[GIT] ppl/ppl(bounded_arithmetic): WRD_Extended_Number_Policy properly commented.
by Roberto Bagnara 14 May '09

14 May '09

Module: ppl/ppl Branch: bounded_arithmetic Commit: 8c4cee6feb0a90857fa5e77f848a3757cc796ed1 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=8c4cee6feb0a… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Thu May 14 08:12:12 2009 +0200 WRD_Extended_Number_Policy properly commented. --- src/WRD_coefficient_types.defs.hh | 30 ++++++++++++++++++++++++++++++ 1 files changed, 30 insertions(+), 0 deletions(-) diff --git a/src/WRD_coefficient_types.defs.hh b/src/WRD_coefficient_types.defs.hh index b05b322..ae7d707 100644 --- a/src/WRD_coefficient_types.defs.hh +++ b/src/WRD_coefficient_types.defs.hh @@ -31,21 +31,46 @@ namespace Parma_Polyhedra_Library { /*! \ingroup PPL_CXX_interface */ #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS) struct WRD_Extended_Number_Policy { + //! Check for overflowed result. const_bool_nodef(check_overflow, true); + + //! Do not check for attempts to add infinities with different sign. const_bool_nodef(check_inf_add_inf, false); + + //! Do not check for attempts to subtract infinities with same sign. const_bool_nodef(check_inf_sub_inf, false); + + //! Do not check for attempts to multiply infinities by zero. const_bool_nodef(check_inf_mul_zero, false); + + //! Do not check for attempts to divide by zero. const_bool_nodef(check_div_zero, false); + + //! Do not check for attempts to divide infinities. const_bool_nodef(check_inf_div_inf, false); + + //! Do not check for attempts to compute remainder of infinities. const_bool_nodef(check_inf_mod, false); + + //! Do not checks for attempts to take the square root of a negative number. const_bool_nodef(check_sqrt_neg, false); + + //! Handle not-a-number special value. const_bool_nodef(has_nan, true); + + //! Handle infinity special values. const_bool_nodef(has_infinity, true); + // Do not uncomment the following. // The compile time error on conversions is the expected behavior. // const_bool_nodef(convertible, false); + + //! Honor requests to check for FPU inexact results. const_bool_nodef(fpu_check_inexact, true); + + //! Do not make extra checks to detect FPU NaN results. const_bool_nodef(fpu_check_nan_result, false); + // Do not uncomment the following. // The compile time error is the expected behavior. // static const Rounding_Dir ROUND_DEFAULT_CONSTRUCTOR = ROUND_UP; @@ -53,6 +78,11 @@ struct WRD_Extended_Number_Policy { // static const Rounding_Dir ROUND_DEFAULT_FUNCTION = ROUND_UP; // static const Rounding_Dir ROUND_DEFAULT_INPUT = ROUND_UP; // static const Rounding_Dir ROUND_DEFAULT_OUTPUT = ROUND_UP; + + /*! \brief + Handles \p r: called by all constructors, operators and functions that + do not return a Result value. + */ static void handle_result(Result r); };

1 0