1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
/* $Id$
Part of SWI-Prolog
Author: Jeffrey Rosenwald
E-mail: jeffrose@acm.org
WWW: http://www.swi-prolog.org
Copyright (C): 2010, Jeffrey Rosenwald
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#define O_DEBUG 1
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <SWI-Prolog.h>
#ifdef _MSC_VER
#define inline __inline
typedef int int32_t;
#endif
static functor_t FUNCTOR_error2; /* error(Formal, Context) */
static int
instantiation_error()
{ term_t ex;
if ( (ex = PL_new_term_ref()) &&
PL_unify_term(ex,
PL_FUNCTOR, FUNCTOR_error2,
PL_CHARS, "instantiation_error",
PL_VARIABLE) )
return PL_raise_exception(ex);
return FALSE;
}
static inline
void cp_net_order(char * to, char * from, int size) /* must be a power of 2 */
{ register int i = 0, j = 0;
#ifdef ARCH_IS_BIG_ENDIAN
j = size - 1;
#endif
for(i = 0; i < size; i++)
to[i] = from[i ^ j];
}
static
foreign_t integer_zigzag(term_t Integer, term_t ZigZag)
{ int64_t val, val1;
if(PL_get_int64(Integer, &val))
{
val1 = (val << 1) ^ (val >> 63);
return PL_unify_int64(ZigZag, val1);
}
if(PL_get_int64(ZigZag, &val))
{
val1 = (val >> 1) ^ (-1 * (val & 1));
return PL_unify_int64(Integer, val1);
}
return instantiation_error();
}
static
foreign_t int32_codes(term_t Number, term_t Codes)
{ union
{
int32_t asNumber;
char asCodes[sizeof(int32_t)];
} val, val1;
char *data;
size_t len;
if(PL_get_integer(Number, &val.asNumber))
{ cp_net_order(val1.asCodes, val.asCodes, sizeof(val1.asCodes));
return PL_unify_list_ncodes(Codes, sizeof(val1.asCodes), val1.asCodes);
}
if(PL_get_list_nchars(Codes, &len, &data, CVT_LIST)
&& len == sizeof(val.asCodes))
{ cp_net_order(val.asCodes, data, sizeof(val.asCodes));
return PL_unify_integer(Number, val.asNumber);
}
return instantiation_error();
}
static
foreign_t int64_codes(term_t Number, term_t Codes)
{
union
{
int64_t asNumber;
char asCodes[sizeof(int64_t)];
} val, val1;
char *data;
size_t len;
if(PL_get_int64(Number, &val.asNumber))
{ cp_net_order(val1.asCodes, val.asCodes, sizeof(val1.asCodes));
return PL_unify_list_ncodes(Codes, sizeof(val1.asCodes), val1.asCodes);
}
if(PL_get_list_nchars(Codes, &len, &data, CVT_LIST)
&& len == sizeof(val.asCodes))
{ cp_net_order(val.asCodes, data, sizeof(val.asCodes));
return PL_unify_int64(Number, val.asNumber);
}
return instantiation_error();
}
static
foreign_t float32_codes(term_t Number, term_t Codes)
{
union
{
float asNumber;
char asCodes[sizeof(float)];
} val, val1;
char *data;
size_t len;
double tmp;
if(PL_get_float(Number, &tmp))
{ val.asNumber = (float)tmp;
cp_net_order(val1.asCodes, val.asCodes, sizeof(val1.asCodes));
return PL_unify_list_ncodes(Codes, sizeof(val1.asCodes), val1.asCodes);
}
if(PL_get_list_nchars(Codes, &len, &data, CVT_LIST)
&& len == sizeof(val.asCodes))
{ cp_net_order(val.asCodes, data, sizeof(val.asCodes));
tmp = val.asNumber;
return PL_unify_float(Number, tmp);
}
return instantiation_error();
}
static
foreign_t float64_codes(term_t Number, term_t Codes)
{
union
{
double asNumber;
char asCodes[sizeof(double)];
} val, val1;
char *data;
size_t len;
if(PL_get_float(Number, &val.asNumber))
{ cp_net_order(val1.asCodes, val.asCodes, sizeof(val1.asCodes));
return PL_unify_list_ncodes(Codes, sizeof(val1.asCodes), val1.asCodes);
}
if(PL_get_list_nchars(Codes, &len, &data, CVT_LIST)
&& len == sizeof(val.asCodes))
{ cp_net_order(val.asCodes, data, sizeof(val.asCodes));
return PL_unify_float(Number, val.asNumber);
}
return instantiation_error();
}
install_t
install_protobufs()
{
FUNCTOR_error2 = PL_new_functor(PL_new_atom("error"), 2);
PL_register_foreign("int32_codes", 2, int32_codes, 0);
PL_register_foreign("float32_codes", 2, float32_codes, 0);
PL_register_foreign("int64_codes", 2, int64_codes, 0);
PL_register_foreign("float64_codes", 2, float64_codes, 0);
PL_register_foreign("integer_zigzag", 2, integer_zigzag, 0);
}
|
