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
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
|
/* Copyright (C) 1990, 1991, 1992, 1993, 1994, 1995, 1997 Free Software Foundation, Inc.
*
* This program 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 2, or (at your option)
* any later version.
*
* This program 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 software; see the file COPYING. If not, write to
* the Free Software Foundation, 59 Temple Place, Suite 330, Boston, MA 02111, USA.
*
* As a special exception, the Free Software Foundation gives permission
* for additional uses of the text contained in its release of SCM.
*
* The exception is that, if you link the SCM library with other files
* to produce an executable, this does not by itself cause the
* resulting executable to be covered by the GNU General Public License.
* Your use of that executable is in no way restricted on account of
* linking the SCM library code into it.
*
* This exception does not however invalidate any other reasons why
* the executable file might be covered by the GNU General Public License.
*
* This exception applies only to the code released by the
* Free Software Foundation under the name SCM. If you copy
* code from other Free Software Foundation releases into a copy of
* SCM, as the General Public License permits, the exception does
* not apply to the code that you add in this way. To avoid misleading
* anyone as to the status of such modified files, you must delete
* this exception notice from them.
*
* If you write modifications of your own for SCM, it is your choice
* whether to permit this exception to apply to your modifications.
* If you do not wish that, delete this exception notice.
*/
/* "rope.c" interface between C and SCM.
Author: Aubrey Jaffer */
#include "scm.h"
/* Numeric conversions */
/* Convert longs to SCM */
SCM long2num(sl)
long sl;
{
if (!FIXABLE(sl)) {
# ifdef BIGDIG
return long2big(sl);
# else
# ifdef FLOATS
return makdbl((double) sl, 0.0);
# else
return BOOL_F;
# endif
# endif
}
return MAKINUM(sl);
}
SCM ulong2num(sl)
unsigned long sl;
{
if (!POSFIXABLE(sl)) {
#ifdef BIGDIG
return ulong2big(sl);
#else
# ifdef FLOATS
return makdbl((double) sl, 0.0);
# else
return BOOL_F;
# endif
#endif
}
return MAKINUM(sl);
}
/* Convert SCM to numbers */
unsigned char num2uchar(num, pos, s_caller)
SCM num;
char *pos, *s_caller;
{
unsigned long res = INUM(num);
ASRTER(INUMP(num) && (255L >= res), num, pos, s_caller);
return (unsigned char) res;
}
unsigned short num2ushort(num, pos, s_caller)
SCM num;
char *pos, *s_caller;
{
unsigned long res = INUM(num);
ASRTER(INUMP(num) && (65535L >= res), num, pos, s_caller);
return (unsigned short) res;
}
unsigned long num2ulong(num, pos, s_caller)
SCM num;
char *pos, *s_caller;
{
unsigned long res;
if (INUMP(num)) {
ASRTGO(0 < num, errout);
res = INUM((unsigned long)num);
return res;
}
ASRTGO(NIMP(num), errout);
#ifdef FLOATS
if (REALP(num)) {
double u = REALPART(num);
if ((0 <= u) && (u <= (unsigned long)~0L)) {
res = u;
return res;
}
}
#endif
#ifdef BIGDIG
if (TYP16(num)==tc16_bigpos) {
sizet l = NUMDIGS(num);
ASRTGO(DIGSPERLONG >= l, errout);
res = 0;
for(;l--;) res = BIGUP(res) + BDIGITS(num)[l];
return res;
}
#endif
errout: wta(num, pos, s_caller);
}
long num2long(num, pos, s_caller)
SCM num;
char *pos, *s_caller;
{
long res;
if (INUMP(num)) {
res = INUM((long)num);
return res;
}
ASRTGO(NIMP(num), errout);
# ifdef FLOATS
if (REALP(num)) {
double u = REALPART(num);
if (((MOST_NEGATIVE_FIXNUM * 4) <= u)
&& (u <= (MOST_POSITIVE_FIXNUM * 4 + 3))) {
res = u;
return res;
}
}
# endif
# ifdef BIGDIG
if (BIGP(num)) {
sizet l = NUMDIGS(num);
ASRTGO(DIGSPERLONG >= l, errout);
res = 0;
for(;l--;) res = BIGUP(res) + BDIGITS(num)[l];
ASRTGO(0<res, errout);
return (tc16_bigpos==TYP16(num) ? res : -res);
}
# endif
errout: wta(num, pos, s_caller);
}
short num2short(num, pos, s_caller)
SCM num;
char *pos, *s_caller;
{
long lres = INUM((long)num);
short res = lres;
if (INUMP(num) && lres==res) return res;
wta(num, pos, s_caller);
}
#ifdef FLOATS
double num2dbl(num, pos, s_caller)
SCM num;
char *pos, *s_caller;
{
if (INUMP(num)) return (double)INUM(num);
ASRTGO(NIMP(num), errout);
if (REALP(num)) return REALPART(num);
if (scm_narn==num) return REALPART(num);
#ifdef BIGDIG
if (BIGP(num)) return big2dbl(num);
#endif
errout: wta(num, pos, s_caller);
}
#endif
/* Convert (arrays of) strings to SCM */
SCM makfromstr(src, len)
const char *src;
sizet len;
{
SCM s;
register char *dst;
s = makstr((long)len);
dst = CHARS(s);
while (len--) *dst++ = *src++;
return s;
}
SCM makfrom0str(src)
const char *src;
{
if (!src) return BOOL_F;
return makfromstr(src, (sizet) strlen(src));
}
/* converts C array of strings to SCM list of strings. */
/* If argc < 0, a null terminated array is assumed. */
SCM makfromstrs(argc, argv)
int argc;
const char * const *argv;
{
int i = argc;
SCM lst = EOL;
if (0 > i) for(i = 0; argv[i]; i++);
while (i--) lst = cons(makfrom0str(argv[i]), lst);
return lst;
}
/* Converts SCM list of strings to NULL terminated array of strings. */
/* INTS must be DEFERed around this call and the use of the returned array. */
char **makargvfrmstrs(args, s_name)
SCM args;
const char *s_name;
{
char ** argv;
int argc = ilength(args);
argv = (char **)must_malloc((1L+argc)*sizeof(char *), s_vector);
for(argc = 0; NNULLP(args); args=CDR(args), ++argc) {
ASRTER(NIMP(CAR(args)) && STRINGP(CAR(args)), CAR(args), ARG2, s_name);
{
sizet len = 1 + LENGTH(CAR(args));
char *dst = (char *)must_malloc((long)len, s_string);
char *src = CHARS(CAR(args));
while (len--) dst[len] = src[len];
argv[argc] = dst;
}
}
argv[argc] = 0;
return argv;
}
void must_free_argv(argv)
const char * const *argv;
{
sizet i;
for(i = 0; argv[i]; i++) {
must_free(argv[i], 1+strlen(argv[i]));
}
must_free((char *)argv, i*sizeof(char *));
}
/* Hooks to call SCM from C */
SCM scm_evstr(str)
char *str;
{
SCM lsym;
NEWCELL(lsym);
SETLENGTH(lsym, strlen(str), tc7_ssymbol);
SETCHARS(lsym, str);
return scm_eval_string(lsym);
}
void scm_ldstr(str)
char *str;
{
SCM lsym;
NEWCELL(lsym);
SETLENGTH(lsym, strlen(str), tc7_ssymbol);
SETCHARS(lsym, str);
scm_load_string(lsym);
}
int scm_ldfile(path)
char *path;
{
SCM name = makfrom0str(path);
*loc_errobj = name;
return BOOL_F==tryload(name, UNDEFINED);
}
int scm_ldprog(path)
char *path;
{
SCM name = makfrom0str(path);
*loc_errobj = name;
return
BOOL_F==scm_evstr("(try-load (in-vicinity (program-vicinity) errobj))");
}
/* Get byte address of SCM array */
#ifdef ARRAYS
long aind P((SCM ra, SCM args, const char *what));
unsigned long scm_addr(args, s_name)
SCM args;
char *s_name;
{
long pos;
unsigned long ptr = 0; /* gratuitous assignment squelches cc warn. */
SCM v;
ASRTGO(NIMP(args), wna);
v = CAR(args);
args = CDR(args);
if (IMP(v)) {goto badarg;}
else if (ARRAYP(v)) {
pos = aind(v, args, s_name);
v = ARRAY_V(v);
}
else {
if (NIMP(args)) {
ASRTER(CONSP(args) && INUMP(CAR(args)), args, ARG2, s_name);
pos = INUM(CAR(args));
ASRTGO(NULLP(CDR(args)), wna);
}
else if (NULLP(args)) pos = 0;
else {
ASRTER(INUMP(args), args, ARG2, s_name);
pos = INUM(args);
}
ASRTGO(pos >= 0 && pos < LENGTH(v), outrng);
}
switch TYP7(v) {
case tc7_string:
ptr = (unsigned long)&(CHARS(v)[pos]);
break;
# ifdef FLOATS
# ifdef SINGLES
case tc7_fvect:
ptr = (unsigned long)&(((float *)CDR(v))[pos]);
break;
# endif
case tc7_cvect: pos = 2 * pos;
case tc7_dvect: ptr = (unsigned long)&(((double *)CDR(v))[pos]);
break;
# endif
case tc7_bvect: ASRTGO(0==(pos%LONG_BIT), outrng);
pos = pos/LONG_BIT;
case tc7_uvect:
case tc7_ivect:
case tc7_vector: ptr = (unsigned long)&(VELTS(v)[pos]);
break;
case tc7_svect: ptr = (unsigned long)&(((short *)CDR(v))[pos]);
break;
outrng: wta(MAKINUM(pos), (char *)OUTOFRANGE, s_name);
default:
badarg: wta(v, (char *)ARG1, s_name);
wna: wta(UNDEFINED, (char *)WNA, s_name);
}
return ptr;
}
unsigned long scm_base_addr(v, s_name)
SCM v;
char *s_name;
{
long pos = 0;
unsigned long ptr = 0; /* gratuitous assignment squelches cc warn. */
if (IMP(v)) {goto badarg;}
else if (ARRAYP(v)) {
pos = ARRAY_BASE(v);
v = ARRAY_V(v);
}
switch TYP7(v) {
case tc7_string:
ptr = (unsigned long)&(CHARS(v)[pos]);
break;
# ifdef FLOATS
# ifdef SINGLES
case tc7_fvect:
ptr = (unsigned long)&(((float *)CDR(v))[pos]);
break;
# endif
case tc7_cvect: pos = 2 * pos;
case tc7_dvect: ptr = (unsigned long)&(((double *)CDR(v))[pos]);
break;
# endif
case tc7_bvect: ASRTGO(0==(pos%LONG_BIT), outrng);
pos = pos/LONG_BIT;
case tc7_uvect:
case tc7_ivect:
case tc7_vector: ptr = (unsigned long)&(VELTS(v)[pos]);
break;
case tc7_svect: ptr = (unsigned long)&(((short *)CDR(v))[pos]);
break;
outrng: wta(MAKINUM(pos), (char *)OUTOFRANGE, s_name);
default:
badarg: wta(v, (char *)ARG1, s_name);
}
return ptr;
}
#endif /* ARRAYS */
extern sizet hplim_ind;
extern CELLPTR *hplims;
/* scm_cell_p() returns !0 if the SCM argument `x' is cell-aligned and
points into a valid heap segment. This code is duplicated from
mark_locations() and obunhash() in "sys.c", which means that
changes to these routines must be coordinated. */
int scm_cell_p(x)
SCM x;
{
register int i, j;
register CELLPTR ptr;
if (NCELLP(x)) return 0;
ptr = (CELLPTR)SCM2PTR(x);
i = 0;
j = hplim_ind;
do {
if (PTR_GT(hplims[i++], ptr)) break;
if (PTR_LE(hplims[--j], ptr)) break;
if ((i != j)
&& PTR_LE(hplims[i++], ptr)
&& PTR_GT(hplims[--j], ptr)) continue;
return !0; /* NFREEP(x) */
} while(i<j);
if (PTR_LE(scm_ecache, ptr)
&& PTR_GT(scm_ecache+scm_ecache_len, ptr))
return !0; /* so we can print environments while debugging */
return 0;
}
long scm_protidx = 0;
SCM scm_gc_protect(obj)
SCM obj;
{
long len;
ASRTER(NIMP(scm_uprotects), MAKINUM(20), NALLOC, "protects");
if (IMP(obj)) return obj;
for (len = LENGTH(scm_uprotects);len--;) {
if (obj==VELTS(scm_uprotects)[len]) return obj;
}
len = LENGTH(scm_uprotects);
if (scm_protidx >= len) resizuve(scm_uprotects, MAKINUM(len + (len>>2)));
VELTS(scm_uprotects)[scm_protidx++] = obj;
return obj;
}
void init_rope()
{
scm_protidx = 0;
scm_uprotects = make_vector(MAKINUM(20), UNDEFINED);
}
|