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
|
#include "obx.h"
#include <ctype.h>
#include <math.h>
#include <string.h>
char *lib_version =
"Oxford Oberon-2 library version 3.2beta1 [build hg-f2fdbc915d42]";
value *NEW(value *bp) {
word desc = bp[HEAD+0].a;
int size = bp[HEAD+1].i+4;
value *sp = bp;
word p = gc_alloc(size, bp);
value *q = ptrcast(value, p);
q[0].a = desc;
(*--sp).a = p+4;
return sp;
}
/*
Layout for flexible arrays:
q: desc
element 0
...
element n-1
desc: map desc = q + align(n*elsize) + 4
dim 1
...
dim k
map: -4
desc-(q+4)
[ GC_REPEAT if elmap != 0
0
n
elsize
GC_MAP
elmap
GC_END ]
GC_END
size = align(n*elsize) + 4*k + 20 + (28 if elmap != 0)
Parameters NEWFLEX(elmap, elsize, k: INTEGER;
dim_0, ..., dim_{k-1}: INTEGER): SYSTEM.PTR
*/
value *NEWFLEX(value *bp) {
word elmap = bp[HEAD+0].a;
int elsize = bp[HEAD+1].i;
int k = bp[HEAD+2].i;
value *dim = &bp[HEAD+3]; /* Array of bounds */
value *sp = bp;
int size, arsize, i, n;
word p, desc, map;
value *q, *pdesc, *pmap;
/* Compute no. of elements */
n = 1;
for (i = 0; i < k; i++) n *= dim[i].i;
if (n < 0) liberror("allocating negative size");
arsize = align(n * elsize, 4);
if (n == 0) elmap = 0;
/* Allocate the space */
size = arsize + 4*k + 20;
if (elmap != 0) size += 28;
p = gc_alloc(size, bp);
desc = p + arsize + 4;
map = desc + 4*k + 4;
q = ptrcast(value, p);
pdesc = ptrcast(value, desc);
pmap = ptrcast(value, map);
q[0].a = desc;
/* Fill in the descriptor */
pdesc[DESC_MAP].a = map;
for (i = 0; i < k; i++) pdesc[DESC_BOUND+i].i = dim[i].i;
/* Fill in the map */
pmap[0].i = -4;
pmap[1].i = desc-(p+4);
if (elmap == 0)
pmap[2].i = GC_END;
else {
pmap[2].i = GC_REPEAT;
pmap[3].i = 0;
pmap[4].i = n;
pmap[5].i = elsize;
pmap[6].i = GC_MAP;
pmap[7].i = elmap;
pmap[8].i = GC_END;
pmap[9].i = GC_END;
}
(*--sp).a = p+4;
return sp;
}
value *COMPARE(value *bp) {
uchar *s1 = pointer(bp[HEAD+0]), *s2 = pointer(bp[HEAD+2]);
int i = 0, n = min(bp[HEAD+1].i, bp[HEAD+3].i);
value *sp = bp;
while (i < n && s1[i] != '\0' && s1[i] == s2[i]) i++;
if (i >= n) liberror("string is not null-terminated");
(*--sp).i = s1[i] - s2[i];
return sp;
}
value *COPY(value *bp) {
obcopy((char * ) pointer(bp[HEAD+2]), bp[HEAD+3].i,
(char * ) pointer(bp[HEAD+0]), bp[HEAD+1].i, bp);
return bp;
}
value *FLEXASSIGN(value *bp) {
int size = bp[HEAD+0].i;
int dim = bp[HEAD+1].i;
uchar *src = pointer(bp[HEAD+2]), *dst = pointer(bp[HEAD+dim+3]);
value *sbound = &bp[HEAD+3], *dbound = &bp[HEAD+dim+4];
int i;
for (i = 0; i < dim; i++) {
int sb = sbound[i].i, db = dbound[i].i;
if (sb > db || (i > 0 && sb < db))
liberror("bound mismatch in open array assignment");
size *= sb;
}
memmove(dst, src, size);
return bp;
}
value *sys_move(value *bp) {
memmove(pointer(bp[HEAD+1]), pointer(bp[HEAD+0]), bp[HEAD+2].i);
return bp;
}
value *sys_liberror(value *bp) {
value *bp1 = valptr(bp[BP]);
error_stop((char * ) pointer(bp[HEAD+0]), 0, 0, bp1, NULL);
return bp;
}
value *EASSERT(value *bp) {
int line = bp[HEAD+0].i;
int arg = bp[HEAD+1].i;
value *bp1 = valptr(bp[BP]);
uchar *pc = pointer(bp[PC]);
error_stop("assertion failed (%d)", arg, line, bp1, pc);
return bp;
}
|