- PPL-devel - BUGSENG Mailman

[GIT] ppl/ppl(bounded_arithmetic): Changed declaration and definition for the left_shift and right_shift operators ,
by Alberto Gioia 18 Jul '11

18 Jul '11

Module: ppl/ppl Branch: bounded_arithmetic Commit: 254d5a537bf46056b9f4305ab35860e89c23bfc4 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=254d5a537bf4… Author: Alberto Gioia <alberto.gioia1(a)studenti.unipr.it> Date: Mon Jul 18 01:16:01 2011 +0200 Changed declaration and definition for the left_shift and right_shift operators, respectively, for the functions operator<< and operator>>. --- src/Linear_Form.defs.hh | 12 +- src/Linear_Form.templates.hh | 367 +++++++++++++++++++++++------------------- 2 files changed, 205 insertions(+), 174 deletions(-) Diff: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commitdiff;h=254d5a53…

1 0

[GIT] ppl/ppl(bounded_arithmetic): Added implementation of the operator<=.
by Alberto Gioia 18 Jul '11

18 Jul '11

Module: ppl/ppl Branch: bounded_arithmetic Commit: e288ab78165d911840adf4a4f770b5355368ae95 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=e288ab78165d… Author: Alberto Gioia <alberto.gioia1(a)studenti.unipr.it> Date: Mon Jul 18 00:49:55 2011 +0200 Added implementation of the operator<=. --- src/Interval.inlines.hh | 46 +++++++++++++++++++++++++++++++++++----------- 1 files changed, 35 insertions(+), 11 deletions(-) diff --git a/src/Interval.inlines.hh b/src/Interval.inlines.hh index 4913371..f88fc60 100644 --- a/src/Interval.inlines.hh +++ b/src/Interval.inlines.hh @@ -186,8 +186,10 @@ operator!=(const T1& x, const T2& y) { template <typename T1, typename T2> inline typename Enable_If<((Is_Singleton<T1>::value || Is_Interval<T1>::value) - && (Is_Singleton<T2>::value || Is_Interval<T2>::value) - && (Is_Interval<T1>::value || Is_Interval<T2>::value)), + && (Is_Singleton<T2>::value + || Is_Interval<T2>::value) + && (Is_Interval<T1>::value + || Is_Interval<T2>::value)), bool>::type operator>=(const T1& x, const T2& y) { PPL_ASSERT(f_OK(x)); @@ -196,8 +198,30 @@ operator>=(const T1& x, const T2& y) { return check_empty_arg(y); else if (check_empty_arg(y)) return false; - return ge(LOWER, f_lower(x), f_info(x), LOWER, f_lower(y), f_info(y)) || - ge(UPPER, f_upper(x), f_info(x), UPPER, f_upper(y), f_info(y)) ; + return + ge(LOWER, f_lower(x), f_info(x), LOWER, f_lower(y), f_info(y)) + && + ge(UPPER, f_upper(x), f_info(x), UPPER, f_upper(y), f_info(y)) ; +} + +template <typename T1, typename T2> +inline typename Enable_If<((Is_Singleton<T1>::value || Is_Interval<T1>::value) + && (Is_Singleton<T2>::value + || Is_Interval<T2>::value) + && (Is_Interval<T1>::value + || Is_Interval<T2>::value)), + bool>::type +operator<=(const T1& x, const T2& y) { + PPL_ASSERT(f_OK(x)); + PPL_ASSERT(f_OK(y)); + if (check_empty_arg(x)) + return check_empty_arg(y); + else if (check_empty_arg(y)) + return false; + return + le(LOWER, f_lower(x), f_info(x), LOWER, f_lower(y), f_info(y)) + && + le(UPPER, f_upper(x), f_info(x), UPPER, f_upper(y), f_info(y)) ; } template <typename Boundary, typename Info> @@ -993,13 +1017,13 @@ Interval<To_Boundary, To_Info>::xor_assign(const From1& x, const From2& y) { Same sign. 0 <= xl <= xu, 0 <= yl <= yu xl <= xu < 0, yl <= yu < 0 - 0 <= XOR(x,y) <= |x+y| + 0 <= XOR(x,y) <= |x + y| */ if (xls >= 0) { - Boundary_NS::assign(UPPER, upperx, infox, - UPPER, f_upper(x), f_info(x)); - Boundary_NS::assign(UPPER, uppery, infoy, - UPPER, f_upper(y), f_info(y)); + Boundary_NS::assign(UPPER, upperx, infox, + UPPER, f_upper(x), f_info(x)); + Boundary_NS::assign(UPPER, uppery, infoy, + UPPER, f_upper(y), f_info(y)); Boundary_NS::assign(LOWER, lower(), to_info, LOWER, f_lower(Constant<0>::value), @@ -1026,9 +1050,9 @@ Interval<To_Boundary, To_Info>::xor_assign(const From1& x, const From2& y) { upper() = std::numeric_limits<To_Boundary>::max(); else { Boundary_NS::neg_assign(UPPER, upperx, infox, - LOWER, f_lower(x), f_info(x)); + UPPER, f_upper(x), f_info(x)); Boundary_NS::neg_assign(UPPER, uppery, infoy, - LOWER, f_lower(y), f_info(y)); + UPPER, f_upper(y), f_info(y)); Boundary_NS::add_assign(UPPER, upper(), to_info, UPPER, upperx, infox, UPPER, uppery, infoy);

1 0

[GIT] ppl/ppl(bounded_arithmetic): Minor correction.
by Alberto Gioia 18 Jul '11

18 Jul '11

Module: ppl/ppl Branch: bounded_arithmetic Commit: 9d77106c9ff99131903b042e15acba391ec9f45d URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=9d77106c9ff9… Author: Alberto Gioia <alberto.gioia1(a)studenti.unipr.it> Date: Mon Jul 18 00:44:51 2011 +0200 Minor correction. --- doc/definitions.dox | 2 +- 1 files changed, 1 insertions(+), 1 deletions(-) diff --git a/doc/definitions.dox b/doc/definitions.dox index 1034c66..ba80d9f 100644 --- a/doc/definitions.dox +++ b/doc/definitions.dox @@ -2821,7 +2821,7 @@ The interval bitwise operators are defined as follow: \begin{cases} \bigl[0, \min(b, b')\bigr], & \text{if $a \geq 0$ and $a' \geq 0$}; \\ - \bigl[0, \max\(b, b')\bigr], + \bigl[0, \max(b, b')\bigr], & \text{if $a \geq 0$ and $b' < 0$, or $b < 0$ and $a' \geq 0$}; \\ \bigl[a + a', \min(b,b')\bigr],

1 0

[GIT] ppl/ppl(bounded_arithmetic): Other fixes to the documentation.
by Alberto Gioia 16 Jul '11

16 Jul '11

Module: ppl/ppl Branch: bounded_arithmetic Commit: ebe94840d4f1f9a420bd3d27dad4aaf39fbf2ec3 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=ebe94840d4f1… Author: Alberto Gioia <alberto.gioia1(a)studenti.unipr.it> Date: Sat Jul 16 13:13:16 2011 +0200 Other fixes to the documentation. --- doc/definitions.dox | 83 ++++++++++++--------------- src/linearize_integer.hh | 142 +++++++++++++++++++++++----------------------- 2 files changed, 107 insertions(+), 118 deletions(-) Diff: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commitdiff;h=ebe94840…

1 0

[GIT] ppl/ppl(bounded_arithmetic): More fixes to the documentation.
by Alberto Gioia 14 Jul '11

14 Jul '11

Module: ppl/ppl Branch: bounded_arithmetic Commit: 49c8c1f720132b1b57be77a6aafe3745302d2808 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=49c8c1f72013… Author: Alberto Gioia <alberto.gioia1(a)studenti.unipr.it> Date: Thu Jul 14 22:38:21 2011 +0200 More fixes to the documentation. --- doc/definitions.dox | 82 +++++++++++----------- src/linearize_integer.hh | 176 +++++++++++++++++++++++----------------------- 2 files changed, 129 insertions(+), 129 deletions(-) Diff: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commitdiff;h=49c8c1f7…

1 0

[GIT] ppl/ppl(bounded_arithmetic): Corrected documentation.
by Alberto Gioia 14 Jul '11

14 Jul '11

Module: ppl/ppl Branch: bounded_arithmetic Commit: 126e67ad12f38972e01d0dbe529e970a70c059a6 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=126e67ad12f3… Author: Alberto Gioia <alberto.gioia1(a)studenti.unipr.it> Date: Thu Jul 14 18:21:36 2011 +0200 Corrected documentation. --- doc/definitions.dox | 34 +++++++++++++++++----------------- src/linearize_integer.hh | 40 ++++++++++++++++++++-------------------- 2 files changed, 37 insertions(+), 37 deletions(-) diff --git a/doc/definitions.dox b/doc/definitions.dox index 250f50e..f6381b7 100644 --- a/doc/definitions.dox +++ b/doc/definitions.dox @@ -2823,11 +2823,11 @@ The interval bitwise operators are defined as follow: \mbox{if }a \geq 0\mbox{ and } a' \geq 0 \\ \left[0, \max\left(b, b'\right)\right] & - \mbox{if }a \geq 0\mbox{ and } b' \le 0 - \mbox{, or }b \le 0\mbox{ and } a' \geq 0 + \mbox{if }a \geq 0\mbox{ and } b' < 0 + \mbox{, or }b < 0\mbox{ and } a' \geq 0 \\ \left[a + a' , \min\left(b,b'\right)\right] & - \mbox{if }b \le 0\mbox{ and } b' \le 0 \\ + \mbox{if }b < 0\mbox{ and } b' < 0 \\ \end{cases} \f] @@ -2838,11 +2838,11 @@ The interval bitwise operators are defined as follow: \mbox{if }a \geq 0\mbox{ and } a' \geq 0 \\ \left[\min\left(a,a'\right),-1\right] & - \mbox{if }a \geq 0\mbox{ and } b' \le 0 - \mbox{, or }b \le 0\mbox{ and } a' \geq 0 + \mbox{if }a \geq 0\mbox{ and } b' < 0 + \mbox{, or }b < 0\mbox{ and } a' \geq 0 \\ \left[\max\left(a,a'\right),-1\right] & - \mbox{if }b \le 0\mbox{ and } b' \le 0 \\ + \mbox{if }b < 0\mbox{ and } b' < 0 \\ \end{cases} \f] @@ -2851,11 +2851,11 @@ The interval bitwise operators are defined as follow: \begin{cases} \left[0,\left|b + b' \right|\right] & \mbox{if }a \geq 0\mbox{ and } a' \geq 0 - \mbox{, or }b \le 0\mbox{ and }b' \le 0 + \mbox{, or }b < 0\mbox{ and }b' < 0 \\ \left[-\left(\left|a\right| + \left|b\right|\right),-1\right] & - \mbox{if }a \geq 0\mbox{ and }b' \le 0 - \mbox{, or }b \le 0\mbox{ and } a' \geq 0 \\ + \mbox{if }a \geq 0\mbox{ and }b' < 0 + \mbox{, or }b < 0\mbox{ and } a' \geq 0 \\ \end{cases} \f] @@ -2866,13 +2866,13 @@ The interval bitwise operators are defined as follow: \mbox{if }a \geq 0\mbox{ and } a' \geq 0 \\ \left[0, \left(b / 2^{\left|b'\right|}\right)\right] & - \mbox{if }a \geq 0\mbox{ and } b' \le 0 + \mbox{if }a \geq 0\mbox{ and } b' < 0 \\ \left[\left(a \times 2^{a'}\right), 0\right] & - \mbox{if }b \le 0\mbox{ and } a' \geq 0 + \mbox{if }b < 0\mbox{ and } a' \geq 0 \\ \left[\left(a / 2^{\left|a'\right|}\right), 0\right] & - \mbox{if }b \le 0\mbox{ and } b' \le 0 \\ + \mbox{if }b < 0\mbox{ and } b' < 0 \\ \end{cases} \f] @@ -2883,13 +2883,13 @@ The interval bitwise operators are defined as follow: \mbox{if }a \geq 0\mbox{ and } a' \geq 0 \\ \left[0, \left(b \times 2^{\left|b'\right|}\right)\right] & - \mbox{if }a \geq 0\mbox{ and } b' \le 0 + \mbox{if }a \geq 0\mbox{ and } b' < 0 \\ \left[\left(a / 2^{a'}\right), 0\right] & - \mbox{if }b \le 0\mbox{ and } a' \geq 0 + \mbox{if }b < 0\mbox{ and } a' \geq 0 \\ \left[\left(a \times 2^{\left|a'\right|}\right), 0\right] & - \mbox{if }b \le 0\mbox{ and } b' \le 0 \\ + \mbox{if }b < 0\mbox{ and } b' < 0 \\ \end{cases} \f] @@ -3200,8 +3200,8 @@ composed by two parts: associating each variable with its current approximating linear form. An interval abstract store is represented by a -\link Parma_Polyhedra_Library::Box \c Box \endlink with integer boundaries, -while a linear form abstract store is a map of the Standard Template Library. +\link Parma_Polyhedra_Library::Box \c Box \endlink with integer boundaries, +while a linear form abstract store is a map of the Standard Template Library. The <CODE>linearize</CODE> method requires both stores as its arguments. \section use_of_library Using the Library diff --git a/src/linearize_integer.hh b/src/linearize_integer.hh index 55ee129..9b45508 100644 --- a/src/linearize_integer.hh +++ b/src/linearize_integer.hh @@ -1386,7 +1386,7 @@ xor_linearize_int \leq \left(i + \sum_{v \in \cV}i_{v}v \right) \adivlf - 2^{\left(i' + \sum_{v \in \cV}i'_{v}v \right)} + 2^{\left(\left|i'\right| + \sum_{v \in \cV}\left|i'_{v}\right|v \right)} \f] and we can define the elments of the linear form @@ -1397,7 +1397,7 @@ xor_linearize_int \leq k \leq - \left(i \adivifp 2^{i'} \right) + \left(i \adivifp 2^\left|{i'}\right| \right) \f] \f[ @@ -1405,7 +1405,7 @@ xor_linearize_int \leq k_{v} \leq - \left(i_{v} \adivifp 2^{i'_{v}} \right) + \left(i_{v} \adivifp 2^\left|{i'_{v}}\right| \right) \f] then @@ -1415,7 +1415,7 @@ xor_linearize_int \approx 0 \bowtie - \left(i \adivifp 2^{i'} \right) + \left(i \adivifp 2^\left|{i'}\right| \right) \f] \f[ @@ -1423,7 +1423,7 @@ xor_linearize_int \approx 0 \bowtie - \left(i_{v} \adivifp 2^{i'_{v}} \right) + \left(i_{v} \adivifp 2^\left|{i'_{v}}\right| \right) \f] If instead, let \f$x\f$ and \f$y\f$ be two integer constants with \f$x\f$ @@ -1529,7 +1529,7 @@ xor_linearize_int \f[ \left(i + \sum_{v \in \cV}i_{v}v \right) \adivlf - 2^{\left(i' + \sum_{v \in \cV}i'_{v}v \right)} + 2^{\left(\left|i'\right| + \sum_{v \in \cV}\left|i'_{v}\right|v \right)} \leq \left(k + \sum_{v \in \cV}k_{v}v \right) \leq @@ -1540,7 +1540,7 @@ xor_linearize_int \f$k + \sum_{v \in \cV}k_{v}v\f$, as follows, \f$\forall v \in \cV\f$: \f[ - \left(i \adivifp 2^{i'} \right) + \left(i \adivifp 2^\left|{i'}\right| \right) \leq k \leq @@ -1548,7 +1548,7 @@ xor_linearize_int \f] \f[ - \left(i_{v} \adivifp 2^{i'_{v}} \right) + \left(i_{v} \adivifp 2^\left|{i'_{v}}\right| \right) \leq k_{v} \leq @@ -1560,7 +1560,7 @@ xor_linearize_int \f[ k \approx - \left(i \adivifp 2^{i'} \right) + \left(i \adivifp 2^\left|{i'}\right| \right) \bowtie 0 \f] @@ -1568,7 +1568,7 @@ xor_linearize_int \f[ k_{v} \approx - \left(i_{v} \adivifp 2^{i'_{v}} \right) + \left(i_{v} \adivifp 2^\left|{i'_{v}}\right| \right) \bowtie 0 \f] @@ -1744,7 +1744,7 @@ lshift_linearize_int \leq \left(i + \sum_{v \in \cV}i_{v}v \right) \amlf - 2^{\left(i' + \sum_{v \in \cV}i'_{v}v \right)} + 2^{\left(\left|i'\right| + \sum_{v \in \cV}\left|i'_{v}\right|v \right)} \f] and we can define the elments of the linear form @@ -1755,7 +1755,7 @@ lshift_linearize_int \leq k \leq - \left(i \amifp 2^{i'} \right) + \left(i \amifp 2^\left|{i'}\right| \right) \f] \f[ @@ -1763,7 +1763,7 @@ lshift_linearize_int \leq k_{v} \leq - \left(i_{v} \amifp 2^{i'_{v}} \right) + \left(i_{v} \amifp 2^\left|{i'_{v}}\right| \right) \f] then @@ -1773,7 +1773,7 @@ lshift_linearize_int \approx 0 \bowtie - \left(i \amifp 2^{i'} \right) + \left(i \amifp 2^\left|{i'}\right| \right) \f] \f[ @@ -1781,7 +1781,7 @@ lshift_linearize_int \approx 0 \bowtie - \left(i_{v} \amifp 2^{i'_{v}} \right) + \left(i_{v} \amifp 2^\left|{i'_{v}}\right| \right) \f] If instead, let \f$x\f$ and \f$y\f$ be two integer constants with \f$x\f$ @@ -1887,7 +1887,7 @@ lshift_linearize_int \f[ \left(i + \sum_{v \in \cV}i_{v}v \right) \amlf - 2^{\left(i' + \sum_{v \in \cV}i'_{v}v \right)} + 2^{\left(\left|i'\right| + \sum_{v \in \cV}\left|i'_{v}\right|v \right)} \leq \left(k + \sum_{v \in \cV}k_{v}v \right) \leq @@ -1898,7 +1898,7 @@ lshift_linearize_int \f$k + \sum_{v \in \cV}k_{v}v\f$, as follows, \f$\forall v \in \cV\f$: \f[ - \left(i \amifp 2^{i'} \right) + \left(i \amifp 2^\left|{i'}\right| \right) \leq k \leq @@ -1906,7 +1906,7 @@ lshift_linearize_int \f] \f[ - \left(i_{v} \amifp 2^{i'_{v}} \right) + \left(i_{v} \amifp 2^\left|{i'_{v}}\right| \right) \leq k_{v} \leq @@ -1918,7 +1918,7 @@ lshift_linearize_int \f[ k \approx - \left(i \amifp 2^{i'} \right) + \left(i \amifp 2^\left|{i'}\right| \right) \bowtie 0 \f] @@ -1926,7 +1926,7 @@ lshift_linearize_int \f[ k_{v} \approx - \left(i_{v} \amifp 2^{i'_{v}} \right) + \left(i_{v} \amifp 2^\left|{i'_{v}}\right| \right) \bowtie 0 \f]

1 0

[GIT] ppl/ppl(bounded_arithmetic): Adjusted sintax for noisy stream.
by Alberto Gioia 13 Jul '11

13 Jul '11

Module: ppl/ppl Branch: bounded_arithmetic Commit: 0ac31f92f16dc379bbf4741a799658fdfa7d80c3 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=0ac31f92f16d… Author: Alberto Gioia <alberto.gioia1(a)studenti.unipr.it> Date: Wed Jul 13 21:25:54 2011 +0200 Adjusted sintax for noisy stream. --- tests/Concrete_Expression/linearize_int.cc | 396 +++++++++++++++++----------- 1 files changed, 247 insertions(+), 149 deletions(-) Diff: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commitdiff;h=0ac31f92…

1 0

[GIT] ppl/ppl(bounded_arithmetic): Added test files about bitwise operators on integer intervals, then added in Makefile.am files
by Alberto Gioia 13 Jul '11

13 Jul '11

Module: ppl/ppl Branch: bounded_arithmetic Commit: 501dce689d62d8ecbb01f06489be6bae7de692a7 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=501dce689d62… Author: Alberto Gioia <alberto.gioia1(a)studenti.unipr.it> Date: Wed Jul 13 21:16:22 2011 +0200 Added test files about bitwise operators on integer intervals, then added in Makefile.am files --- tests/Box/Makefile.am | 3 + tests/Box/int_interval.cc | 590 +++++++++++++++++++++++++++++++++++++++++++++ 2 files changed, 593 insertions(+), 0 deletions(-) Diff: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commitdiff;h=501dce68…

1 0

[GIT] ppl/ppl(bounded_arithmetic): Adjust the functions about bitwise operators.
by Alberto Gioia 13 Jul '11

13 Jul '11

Module: ppl/ppl Branch: bounded_arithmetic Commit: 2a8535634ff5ff5dcaf866b8542d671367431bea URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=2a8535634ff5… Author: Alberto Gioia <alberto.gioia1(a)studenti.unipr.it> Date: Wed Jul 13 21:11:11 2011 +0200 Adjust the functions about bitwise operators. --- src/Interval.inlines.hh | 558 +++++++++++++++++++++++++++++++++-------------- 1 files changed, 398 insertions(+), 160 deletions(-) Diff: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commitdiff;h=2a853563…

1 0

[GIT] ppl/ppl(master): Avoid annoying warnings caused by internal OCaml C code.
by Enea Zaffanella 11 Jul '11

11 Jul '11

Module: ppl/ppl Branch: master Commit: 30a81801ecdbaaef5842bca21c4982e035c3009b URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=30a81801ecdb… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Mon Jul 11 16:12:30 2011 +0200 Avoid annoying warnings caused by internal OCaml C code. --- interfaces/OCaml/Makefile.am | 2 +- interfaces/OCaml/tests/Makefile.am | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/interfaces/OCaml/Makefile.am b/interfaces/OCaml/Makefile.am index c0c5ac7..8a31c64 100644 --- a/interfaces/OCaml/Makefile.am +++ b/interfaces/OCaml/Makefile.am @@ -167,7 +167,7 @@ libppl_ocaml_a_DEPENDENCIES = \ OCAMLC_ENV = OCAMLRUNPARAM='l=1M' OCAMLC_COMPILE_FLAGS = \ --I @mlgmp_dir@ -I .. -ccopt -g +-I @mlgmp_dir@ -I .. -ccopt -g -ccopt -Wno-write-strings OCAMLC_LINK_FLAGS = \ `echo " $(extra_libraries) " | $(SED) -e "s/ -R[^ ]*//g" -e "s/ -/ -cclib -/g"` diff --git a/interfaces/OCaml/tests/Makefile.am b/interfaces/OCaml/tests/Makefile.am index 9cd317c..19f385f 100644 --- a/interfaces/OCaml/tests/Makefile.am +++ b/interfaces/OCaml/tests/Makefile.am @@ -60,7 +60,7 @@ ppl_ocaml_tests_common OCAMLC_ENV = OCAMLRUNPARAM='l=1M' OCAMLC_COMPILE_FLAGS = \ --I @mlgmp_dir@ -I .. -ccopt -g +-I @mlgmp_dir@ -I .. -ccopt -g -ccopt -Wno-write-strings OCAMLC_LINK_FLAGS = \ -cclib -lmlgmp -cclib -lmpfr \

1 0