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
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
|
/*-------------------------------------------------------------------------*
* GNU Prolog *
* *
* Part : foreign facility test *
* File : examp_c.c *
* Descr.: test file - C part *
* Author: Daniel Diaz *
* *
* Copyright (C) 1999-2015 Daniel Diaz *
* *
* This file is part of GNU Prolog *
* *
* GNU Prolog is free software: you can redistribute it and/or *
* modify it under the terms of either: *
* *
* - the GNU Lesser General Public License as published by the Free *
* Software Foundation; either version 3 of the License, or (at your *
* option) any later version. *
* *
* or *
* *
* - the GNU General Public License as published by the Free *
* Software Foundation; either version 2 of the License, or (at your *
* option) any later version. *
* *
* or both in parallel, as here. *
* *
* GNU Prolog 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 copies of the GNU General Public License and *
* the GNU Lesser General Public License along with this program. If *
* not, see http://www.gnu.org/licenses/. *
*-------------------------------------------------------------------------*/
#include <string.h>
#include "gprolog.h"
/*---------------------------------*
* Constants *
*---------------------------------*/
/*---------------------------------*
* Type Definitions *
*---------------------------------*/
/*---------------------------------*
* Global Variables *
*---------------------------------*/
/*---------------------------------*
* Function Prototypes *
*---------------------------------*/
/*-------------------------------------------------------------------------*
* FIRST_OCCURRENCE *
* *
*-------------------------------------------------------------------------*/
PlBool
first_occurrence(char *str, PlLong c, PlLong *pos)
{
char *p;
p = strchr(str, c);
if (p == NULL) /* C does not appear in A */
return PL_FALSE; /* fail */
*pos = p - str; /* set the output argument */
return PL_TRUE; /* succeed */
}
/*-------------------------------------------------------------------------*
* OCCURRENCE *
* *
*-------------------------------------------------------------------------*/
PlBool
occurrence(char *str, PlLong c, PlLong *pos)
{
char **info_pos;
char *p;
info_pos = Pl_Get_Choice_Buffer(char **); /* recover the buffer */
if (Pl_Get_Choice_Counter() == 0) /* first invocation ? */
*info_pos = str;
p = strchr(*info_pos, c);
if (p == NULL) /* C does not appear */
{
Pl_No_More_Choice(); /* remove choice-point */
return PL_FALSE; /* fail */
}
*pos = p - str; /* set the output argument */
*info_pos = p + 1; /* update next starting pos */
return PL_TRUE; /* succeed */
}
/*-------------------------------------------------------------------------*
* OCCURRENCE2 *
* *
*-------------------------------------------------------------------------*/
PlBool
occurrence2(char *str, PlLong c, PlLong *pos)
{
char **info_pos;
char *p;
info_pos = Pl_Get_Choice_Buffer(char **); /* recover the buffer */
if (Pl_Get_Choice_Counter() == 0) /* first invocation ? */
{
p = strchr(str, c);
if (p == NULL) /* C does not appear at all */
{
Pl_No_More_Choice(); /* remove choice-point */
return PL_FALSE; /* fail */
}
*info_pos = p;
}
/* info_pos = an occurrence */
*pos = *info_pos - str; /* set the output argument */
p = strchr(*info_pos + 1, c);
if (p == NULL) /* no more occurrence */
Pl_No_More_Choice(); /* remove choice-point */
else
*info_pos = p; /* else update next solution */
return PL_TRUE; /* succeed */
}
/*-------------------------------------------------------------------------*
* CHAR_ASCII *
* *
*-------------------------------------------------------------------------*/
PlBool
char_ascii(PlFIOArg *c, PlFIOArg *ascii)
{
if (!c->is_var) /* Char is not a variable */
{
ascii->unify = PL_TRUE; /* enforce unif. of Code */
ascii->value.l = c->value.l; /* set Code */
return PL_TRUE; /* succeed */
}
if (ascii->is_var) /* Code is also a variable */
Pl_Err_Instantiation(); /* emit instantiation_error */
c->value.l = ascii->value.l; /* set Char */
return PL_TRUE; /* succeed */
}
/*-------------------------------------------------------------------------*
* CHAR_ASCII2 *
* *
*-------------------------------------------------------------------------*/
PlBool
char_ascii2(PlFIOArg *c, PlFIOArg *ascii)
{
if (!c->is_var)
{
if (!ascii->is_var)
return ascii->value.l == c->value.l;
ascii->value.l = c->value.l;
return PL_TRUE;
}
if (ascii->is_var)
Pl_Err_Instantiation();
c->value.l = ascii->value.l;
return PL_TRUE;
}
/*-------------------------------------------------------------------------*
* MY_CALL *
* *
*-------------------------------------------------------------------------*/
PlBool
my_call(PlTerm goal)
{
PlTerm *args;
int functor, arity;
int result;
args = Pl_Rd_Callable_Check(goal, &functor, &arity);
Pl_Query_Begin(PL_FALSE);
result = Pl_Query_Call(functor, arity, args);
Pl_Query_End(PL_KEEP_FOR_PROLOG);
if (result == PL_EXCEPTION)
{
PlTerm except = Pl_Get_Exception();
#if 0
Pl_Exec_Continuation(Pl_Find_Atom("throw"), 1, &except);
#else
Pl_Throw(except);
#endif
}
return result;
}
/*-------------------------------------------------------------------------*
* MY_CALL2 *
* *
*-------------------------------------------------------------------------*/
PlBool
my_call2(PlTerm goal)
{
PlTerm *args;
int functor, arity;
args = Pl_Rd_Callable_Check(goal, &functor, &arity);
Pl_Exec_Continuation(functor, arity, args);
return PL_TRUE;
}
/*-------------------------------------------------------------------------*
* ALL_OP *
* *
*-------------------------------------------------------------------------*/
PlBool
all_op(PlTerm list)
{
PlTerm op[1024];
PlTerm args[3];
int n = 0;
int result;
Pl_Query_Begin(PL_TRUE);
args[0] = Pl_Mk_Variable();
args[1] = Pl_Mk_Variable();
args[2] = Pl_Mk_Variable();
result = Pl_Query_Call(Pl_Find_Atom("current_op"), 3, args);
while (result)
{
op[n++] = Pl_Mk_Atom(Pl_Rd_Atom(args[2])); /* arg #2 is the name of the op */
result = Pl_Query_Next_Solution();
}
Pl_Query_End(PL_RECOVER);
return Pl_Un_Proper_List_Check(n, op, list);
}
|
