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
|
/* $Header$ */
/*
* Copyright © 1988-2004 Keith Packard and Bart Massey.
* All Rights Reserved. See the file COPYING in this directory
* for licensing information.
*/
#include "nickle.h"
static Value
RefPlus (Value av, Value bv, int expandOk)
{
ENTER();
int i;
Ref *ref;
if (ValueIsInt(av))
{
i = IntPart (av, "Attempt to add non-integer to reference type");
if (aborting)
RETURN (Void);
ref = &bv->ref;
}
else if (ValueIsInt(bv))
{
i = IntPart (bv, "Attempt to add non-integer to reference type");
if (aborting)
RETURN (Void);
ref = &av->ref;
}
else
RETURN (Void);
i = i + ref->element;
if (i < 0 || i >= ref->box->nvalues ||
(!ref->box->homogeneous && i != ref->element))
{
RaiseStandardException (exception_invalid_array_bounds, 2,
av, bv);
RETURN (Void);
}
RETURN (NewRef (ref->box, i));
}
static Value
RefMinus (Value av, Value bv, int expandOk)
{
ENTER();
int i;
int element;
Ref *ref, *bref;
if (ValueIsInt(av))
{
i = IntPart (av, "Attempt to subtract non-integer to reference type");
if (aborting)
RETURN (Void);
ref = &bv->ref;
element = -ref->element;
}
else if (ValueIsInt(bv))
{
i = -IntPart (bv, "Attempt to subtract non-integer to reference type");
if (aborting)
RETURN (Void);
ref = &av->ref;
element = ref->element;
}
else
{
ref = &av->ref;
bref = &bv->ref;
if (ref->box != bref->box)
{
RaiseStandardException (exception_invalid_binop_values, 2,
av, bv);
RETURN (Void);
}
RETURN (NewInt (ref->element - bref->element));
}
i = i + element;
if (i < 0 || i >= ref->box->nvalues || (!ref->box->homogeneous && i != ref->element))
{
RaiseStandardException (exception_invalid_array_bounds, 2,
av, bv);
RETURN (Void);
}
RETURN (NewRef (ref->box, i));
}
static Value
RefLess (Value av, Value bv, int expandOk)
{
Ref *aref = &av->ref, *bref = &bv->ref;
if (aref->box != bref->box ||
(!aref->box->homogeneous && aref->element != bref->element))
{
RaiseStandardException (exception_invalid_binop_values, 2,
av, bv);
return FalseVal;
}
if (aref->element < bref->element)
return TrueVal;
return FalseVal;
}
static Value
RefEqual (Value av, Value bv, int expandOk)
{
Ref *aref = &av->ref, *bref = &bv->ref;
if (aref->box != bref->box || aref->element != bref->element)
return FalseVal;
return TrueVal;
}
static ValueRep *
RefTypeCheck (BinaryOp op, Value av, Value bv, int expandOk)
{
switch (op) {
case MinusOp:
if (ValueIsRef(av) && ValueIsRef(bv))
return av->value.type;
case PlusOp:
if (ValueIsInt(av))
return bv->value.type;
if (ValueIsInt(bv))
return av->value.type;
break;
case LessOp:
case EqualOp:
if (ValueIsRef(av) && ValueIsRef(bv))
return av->value.type;
break;
default:
break;
}
return 0;
}
static Bool
RefPrint (Value f, Value av, char format, int base, int width, int prec, int fill)
{
FileOutput (f, '&');
return Print (f, RefValueGet (av), format, base, width ? width - 1 : 0, prec, fill);
}
static void
RefMark (void *object)
{
Ref *ref = object;
if (ref->box->replace)
ref->box = BoxRewrite (ref->box, &ref->element);
MemReference (ref->box);
}
ValueRep RefRep = {
{ RefMark, 0, "RefRep" }, /* data */
rep_ref, /* tag */
{ /* binary */
RefPlus,
RefMinus,
0,
0,
0,
0,
RefLess,
RefEqual,
0,
0,
},
{ /* unary */
0,
0,
0,
},
0,
0,
RefPrint,
RefTypeCheck,
};
DataCachePtr refCache;
Value
NewRefReal (BoxPtr box, int element, Value *re)
{
ENTER ();
Value ret = ALLOCATE (&RefRep.data, sizeof (Ref));
ret->ref.box = box;
ret->ref.element = element;
*re = ret;
RETURN (ret);
}
#ifndef HAVE_C_INLINE
Value
NewRef (BoxPtr box, int element)
{
int c = ((unsigned) (&BoxElements(box)[element])) % REF_CACHE_SIZE;
Value *re = (Value *) &DataCacheValues(refCache)[c];
Value ret = *re;
if (ret && ret->ref.box == box && ret->ref.element == element)
{
REFERENCE(ret);
return ret;
}
return NewRefReal (box, element, re);
}
#endif
int
RefRewrite (Value rv)
{
Ref *ref= &rv->ref;
BoxPtr box = ref->box;
if (box->replace)
ref->box = BoxRewrite (box, &ref->element);
return 0;
}
int
RefInit (void)
{
ENTER ();
refCache = NewDataCache(REF_CACHE_SIZE);
EXIT ();
return 1;
}
|
