-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathstream.js
433 lines (394 loc) · 9.55 KB
/
stream.js
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
var current_input = null;
var current_output = 0;
// FIXME: Ignores size and count!
function stdout_write(stream, size, count, buffer)
{
var str = fromByteArray(buffer);
stdout(str);
return size*count;
}
function predicate_set_input(stream)
{
var s = {};
if (!get_stream_fd(stream, s))
return false;
current_input = s.value;
return true;
}
function predicate_set_output(stream)
{
var s = {};
if (!get_stream_fd(stream, s))
return false;
current_output = s.value;
return true;
}
function predicate_current_input(stream)
{ var ftor = lookup_functor('$stream', 1);
var ref = alloc_structure(ftor);
memory[state.H++] = current_input ^ (TAG_INT << WORD_BITS);
return unify(stream, ref);
}
function predicate_current_output(stream)
{ var ftor = lookup_functor('$stream', 1);
var ref = alloc_structure(ftor);
memory[state.H++] = current_output ^ (TAG_INT << WORD_BITS);
return unify(stream, ref);
}
function predicate_get_char(stream, c)
{
var s = {};
if (!get_stream(stream, s))
return false;
return unify(c, lookup_atom(_get_char(s.value)));
}
function predicate_get_code(stream, c)
{
var s = {};
if (!get_stream(stream, s))
return false;
return unify(c, (_get_code(s.value) & ((1 << (WORD_BITS-1))-1)) ^ (TAG_INT << WORD_BITS));
}
function predicate_get_byte(stream, c)
{
var s = {};
if (!get_stream(stream, s))
return false;
return unify(c, (getb(s.value) & ((1 << (WORD_BITS-1))-1)) ^ (TAG_INT << WORD_BITS));
}
function predicate_peek_char(stream, c)
{
var s = {};
if (!get_stream(stream, s))
return false;
return unify(c, lookup_atom(peek_char(s.value)));
}
function predicate_peek_code(stream, c)
{
var s = {};
if (!get_stream(stream, s))
return false;
return unify(c, _peek_code(s.value) ^ (TAG_INT << WORD_BITS));
}
function predicate_peek_byte(stream, c)
{
var s = {};
if (!get_stream(stream, s))
return false;
return unify(c, (peekb(s.value) & ((1 << (WORD_BITS-1))-1)) ^ (TAG_INT << WORD_BITS));
}
function predicate_put_char(stream, c)
{
var s = {};
if (!get_stream(stream, s))
return false;
return putch(s.value, atable[VAL(c)]);
}
function predicate_put_code(stream, c)
{
var s = {};
if (!get_stream(stream, s))
return false;
return putch(s.value, VAL(c));
}
function predicate_put_byte(stream, c)
{
var s = {};
if (!get_stream(stream, s))
return false;
return putb(s.value, VAL(c));
}
function predicate_flush_output(stream)
{
var s = {};
if (!get_stream(stream, s))
return false;
if (s.value.write != null)
{
return s.value.buffer_size == s.value.write(s.value, 1, s.value.buffer_size, s.value.buffer);
}
return permission_error("write", "stream", stream);
}
function predicate_at_end_of_stream(stream)
{
var s = {};
if (!get_stream(stream, s))
return false;
return (peekch(s.value) != -1);
}
function predicate_set_stream_position(s, position)
{
var stream = {};
if (!get_stream(s, stream))
return false;
stream = stream.value;
if (stream.seek == null)
return permission_error("seek", "stream", s);
return stream.seek(stream, VAL(position));
}
/* Actual stream IO */
var streams = [new_stream(null, stdout_write, null, null, null, "")];
function predicate_close(stream, options)
{
var s = {};
if (!get_stream(stream, s))
return false;
s = s.value;
if (s.write != null)
{
// Flush output
// FIXME: If flush fails, then what?
s.write(s, 1, s.buffer_size, s.buffer);
}
if (s.close != null)
{
// FIXME: Ignore s.close(s) if options contains force(true)
return s.close(s);
}
// FIXME: Should be an error
return false;
}
function get_stream(term, ref)
{
var fd = {};
if (!get_stream_fd(term, fd))
return false;
ref.value = streams[fd.value];
return true;
}
function get_stream_fd(term, s)
{
if (TAG(term) != TAG_STR)
return type_error("stream", term);
ftor = VAL(memory[VAL(term)]);
if (atable[ftable[ftor][0]] == "$stream" && ftable[ftor][1] == 1)
{
s.value = VAL(memory[VAL(term)+1]);
return true;
}
return type_error("stream", term);
}
// Streams must all have a buffer to support peeking.
// If the buffer is empty, then fill it via read()
var STREAM_BUFFER_SIZE = 256;
function new_stream(read, write, seek, close, tell, user_data)
{
return {read: read,
write: write,
seek: seek,
close: close,
tell: tell,
data: user_data,
buffer: [],
buffer_size: 0};
}
function _get_char(s)
{
var t = getch(s);
if (t == -1)
return "end_of_file";
else
return String.fromCharCode(t);
}
function get_raw_char(s)
{
var t = getch(s);
if (t == -1)
return -1;
else
return String.fromCharCode(t);
}
function peek_raw_char(s)
{
var t = peekch(s);
if (t == -1)
return -1;
else
return String.fromCharCode(t);
}
function _peek_char(s)
{
var t = peekch(s);
if (t == -1)
return "end_of_file";
else
return String.fromCharCode(t);
}
function _get_code(s)
{
return getch(s);
}
function _peek_code(s)
{
return peekch(s);
}
// See getch for an explanation of what is going on here
function peekch(s)
{
var b = peekb(s);
var ch;
if (b == -1)
return -1;
// ASCII
if (b <= 0x7F)
return b;
ch = 0;
var mask = 0x20;
var i = 0;
for (var mask = 0x20; mask != 0; mask >>=1 )
{
var next = s.buffer[i+1];
if (next == undefined)
{
// This is a problem. We need to buffer more data! But we must also not lose the existing buffer since we are peeking.
abort("Unicode break in peekch. This is a bug");
}
if (next == -1)
return -1;
ch = (ch << 6) ^ (next & 0x3f);
if ((b & mask) == 0)
break;
i++;
}
ch ^= (b & (0xff >> (i+3))) << (6*(i+1));
return ch;
}
function getch(s)
{
var b = getb(s);
var ch;
if (b == -1)
return -1;
// ASCII
if (b <= 0x7F)
return b;
ch = 0;
// Otherwise we have to crunch the numbers
var mask = 0x20;
var i = 0;
// The first byte has leading bits 1, then a 1 for every additional byte we need followed by a 0
// After the 0 is the top 1-5 bits of the final character. This makes it quite confusing.
for (var mask = 0x20; mask != 0; mask >>=1 )
{
var next = getb(s);
if (next == -1)
return -1;
ch = (ch << 6) ^ (next & 0x3f);
if ((b & mask) == 0)
break;
i++;
}
ch ^= (b & (0xff >> (i+3))) << (6*(i+1));
return ch;
}
function putch(s, c)
{
if (s.buffer_size < 0)
return io_error("write");
s.buffer.push(c);
s.buffer_size++;
return true;
}
function putb(s, c)
{
if (s.buffer_size < 0)
return io_error("write");
s.buffer.push(c);
s.buffer_size++;
return true;
}
function getb(s)
{
if (s.buffer_size == 0)
{
debug_msg("Buffering...");
s.buffer_size = s.read(s, 1, STREAM_BUFFER_SIZE, s.buffer);
debug_msg("Buffer now contains " + s.buffer_size + " elements");
}
if (s.buffer_size < 0)
return s.buffer_size;
// FIXME: Can this STILL be 0?
if (s.buffer_size == 0)
return -1;
// At this point the buffer has some data in it
s.buffer_size--;
return s.buffer.shift();
}
function peekb(s)
{
if (s.buffer_size == 0)
{
debug_msg("Buffering...");
s.buffer_size = s.read(s, 1, STREAM_BUFFER_SIZE, s.buffer);
debug_msg("Buffer now contains " + s.buffer_size + " elements");
}
if (s.buffer_size < 0)
return s.buffer_size;
// FIXME: Can this STILL be 0?
if (s.buffer_size == 0)
return -1;
// At this point the buffer has some data in it
return s.buffer[0];
}
function get_stream_position(stream, property)
{
if (stream.tell != null)
{
var p = stream.tell(stream) - stream.buffer.length;
var ftor = lookup_functor('position', 1);
var ref = alloc_structure(ftor);
memory[state.H++] = p ^ (TAG_INT << WORD_BITS);
return unify(ref, property);
}
return false;
}
var stream_properties = [get_stream_position];
function predicate_stream_property(stream, property)
{
var s = {};
if (!get_stream(stream, s))
return false;
stream = s.value;
var index = 0;
if (state.foreign_retry)
{
index = state.foreign_value+1;
}
else
{
create_choicepoint();
}
update_choicepoint_data(index);
if (index >= stream_properties.length)
{
destroy_choicepoint();
return false;
}
return stream_properties[index](stream, property)
}
function predicate_current_stream(stream)
{
var index = 0;
if (state.foreign_retry)
{
index = state.foreign_value+1;
}
else
{
create_choicepoint();
}
while (streams[index] === undefined)
{
if (index >= streams.length)
{
destroy_choicepoint();
return false;
}
index++;
}
update_choicepoint_data(index);
var ftor = lookup_functor('$stream', 1);
var ref = alloc_structure(ftor);
memory[state.H++] = index ^ (TAG_INT << WORD_BITS);
return unify(stream, ref);
}