1 /* GNU Prolog extended foreign language interface: definitions.
2 Copyright (C) 2001-2010 Roberto Bagnara <bagnara@cs.unipr.it>
3 Copyright (C) 2010-2016 BUGSENG srl (http://bugseng.com)
4
5 This file is part of the Parma Polyhedra Library (PPL).
6
7 The PPL is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by the
9 Free Software Foundation; either version 3 of the License, or (at your
10 option) any later version.
11
12 The PPL is distributed in the hope that it will be useful, but WITHOUT
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15 for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software Foundation,
19 Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
20
21 For the most up-to-date information see the Parma Polyhedra Library
22 site: http://bugseng.com/products/ppl/ . */
23
24 #include "gprolog_efli.hh"
25 #include "ppl_prolog_common_defs.hh"
26
27 namespace Parma_Polyhedra_Library {
28
29 namespace Interfaces {
30
31 namespace Prolog {
32
33 namespace GNU {
34
35 bool Prolog_has_unbounded_integers;
36
37 PlLong Prolog_min_integer;
38
39 PlLong Prolog_max_integer;
40
41 void
ppl_Prolog_sysdep_init()42 ppl_Prolog_sysdep_init() {
43 Prolog_has_unbounded_integers = false;
44 Prolog_min_integer = INT_LOWEST_VALUE;
45 Prolog_max_integer = INT_GREATEST_VALUE;
46 }
47
48 void
ppl_Prolog_sysdep_deinit()49 ppl_Prolog_sysdep_deinit() {
50 }
51
52 int
Prolog_get_Coefficient(Prolog_term_ref t,Coefficient & n)53 Prolog_get_Coefficient(Prolog_term_ref t, Coefficient& n) {
54 assert(Prolog_is_integer(t));
55 PlLong v = Pl_Rd_Integer_Check(t);
56 n = v;
57 return 1;
58 }
59
60 int
Prolog_put_Coefficient(Prolog_term_ref & t,const Coefficient & n)61 Prolog_put_Coefficient(Prolog_term_ref& t, const Coefficient& n) {
62 PlLong l = 0;
63 Result r = assign_r(l, n, ROUND_IGNORE);
64 if (result_overflow(r) || l < INT_LOWEST_VALUE || l > INT_GREATEST_VALUE)
65 throw PPL_integer_out_of_range(n);
66 t = Pl_Mk_Integer(l);
67 return 1;
68 }
69
70 int
Prolog_unify_Coefficient(Prolog_term_ref t,const Coefficient & n)71 Prolog_unify_Coefficient(Prolog_term_ref t, const Coefficient& n) {
72 Prolog_term_ref u = Prolog_new_term_ref();
73 Prolog_put_Coefficient(u, n);
74 return Prolog_unify(t, u);
75 }
76
77 } // namespace GNU
78
79 } // namespace Prolog
80
81 } // namespace Interfaces
82
83 } // namespace Parma_Polyhedra_Library
84