-
Notifications
You must be signed in to change notification settings - Fork 1
/
kernel_type.py
1185 lines (1061 loc) · 40.7 KB
/
kernel_type.py
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
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
from itertools import product
from rpython.rlib import jit, rarithmetic, rstring
from rpython.rlib.rbigint import rbigint
import debug
class KernelValue(object):
simple = True
def __init__(self, source_pos=None):
self.source_pos = source_pos
def equal(self, other):
return other is self
def tostring(self):
return str(self)
def todisplay(self):
return self.tostring()
def interpret(self, env, cont):
assert self.simple, "expected simple value"
return cont.plug_reduce(self.interpret_simple(env))
def interpret_simple(self, env):
return self
def combine(self, operands, env, cont):
signal_type_error(Combiner, self)
#XXX: Unicode
class String(KernelValue):
type_name = 'string'
_immutable_fields_ = ['strval']
def __init__(self, value, source_pos=None):
assert isinstance(value, str), "wrong value for String: %s" % value
self.strval = value
self.source_pos = source_pos
def tostring(self):
return '"%s"' % self.strval
def todisplay(self):
return self.strval
def equal(self, other):
return isinstance(other, String) and other.strval == self.strval
class Number(KernelValue):
type_name = 'number'
def lteq(self, other):
return self.lt(other) or self.equal(other)
def gt(self, other):
return other.lt(self)
def gteq(self, other):
return self.gt(other) or self.equal(other)
def sub(self, other):
return self.add(other.neg())
class Infinity(Number):
def divide(self, other):
# divide primitive already discards error cases.
return zero
def mod(self, other):
return other
def divmod(self, other):
return Pair(zero, Pair(other, nil))
class ExactPositiveInfinity(Infinity):
def tostring(self):
return "#e+infinity"
def equal(self, other):
return isinstance(other, ExactPositiveInfinity)
def lt(self, other):
return False
def add(self, other):
if isinstance(other, ExactNegativeInfinity):
signal_add_positive_to_negative_infinity(self, other)
else:
return self
def mul(self, other):
if zero.lt(other):
return self
elif other.lt(zero):
return e_neg_inf
else:
signal_multiply_infinity_by_zero(self, other)
def neg(self):
return e_neg_inf
e_pos_inf = ExactPositiveInfinity()
class ExactNegativeInfinity(Infinity):
def tostring(self):
return "#e-infinity"
def equal(self, other):
return isinstance(other, ExactNegativeInfinity)
def lt(self, other):
return not isinstance(other, ExactNegativeInfinity)
def add(self, other):
if isinstance(other, ExactPositiveInfinity):
signal_add_positive_to_negative_infinity(other, self)
else:
return self
def mul(self, other):
if zero.lt(other):
return self
elif other.lt(zero):
return e_pos_inf
else:
signal_multiply_infinity_by_zero(self, other)
def neg(self):
return e_pos_inf
e_neg_inf = ExactNegativeInfinity()
class Fixnum(Number):
_immutable_fields_ = ['fixval']
def __init__(self, fixval, source_pos=None):
assert isinstance(fixval, int)
self.fixval = fixval
self.source_pos = source_pos
def tostring(self):
return str(self.fixval)
def equal(self, other):
return isinstance(other, Fixnum) and other.fixval == self.fixval
def lt(self, other):
if isinstance(other, Fixnum):
return self.fixval < other.fixval
elif isinstance(other, ExactNegativeInfinity):
return False
else:
return True
def add(self, other):
if isinstance(other, Fixnum):
try:
res = rarithmetic.ovfcheck(other.fixval + self.fixval)
return Fixnum(res)
except OverflowError:
return Bignum(rbigint.fromint(self.fixval).add(rbigint.fromint(other.fixval)))
else:
assert isinstance(other, Number)
return other.add(self)
def mul(self, other):
if isinstance(other, Fixnum):
try:
res = rarithmetic.ovfcheck(other.fixval * self.fixval)
return Fixnum(res)
except OverflowError:
return Bignum(rbigint.fromint(self.fixval).mul(rbigint.fromint(other.fixval)))
else:
assert isinstance(other, Number)
return other.mul(self)
def divide_by(self, other):
if isinstance(other, Fixnum):
return Fixnum(self.fixval // other.fixval)
else:
return other.divide(self)
def mod_by(self, other):
if isinstance(other, Fixnum):
return Fixnum(self.fixval % other.fixval)
else:
return other.mod(self)
def divmod_by(self, other):
if isinstance(other, Fixnum):
# builtin divmod doesn't seem to work in RPython.
s = self.fixval
o = other.fixval
return Pair(Fixnum(s // o), Pair(Fixnum(s % o), nil))
else:
return other.divmod(self)
def neg(self):
try:
return Fixnum(-self.fixval)
except OverflowError:
return Bignum(rbigint.fromint(self.fixval).neg())
zero = Fixnum(0)
one = Fixnum(1)
class Bignum(Number):
_immutable_fields_ = ['bigval']
def __init__(self, bigval, source_pos=None):
assert isinstance(bigval, rbigint)
self.bigval = bigval
self.source_pos = source_pos
def tostring(self):
return str(self.bigval)
def equal(self, other):
return isinstance(other, Bignum) and other.bigval.eq(self.bigval)
#XXX: refactor out duplication once we have them all implemented.
def add(self, other):
if isinstance(other, Bignum):
otherval = other.bigval
elif isinstance(other, Fixnum):
otherval = rbigint.fromint(other.fixval)
else:
assert isinstance(other, Number)
return other.add(self)
return try_and_make_fixnum(self.bigval.add(otherval))
def mul(self, other):
if isinstance(other, Bignum):
otherval = other.bigval
elif isinstance(other, Fixnum):
otherval = rbigint.fromint(other.fixval)
else:
assert isinstance(other, Number)
return other.add(self)
return try_and_make_fixnum(self.bigval.mul(otherval))
def divide(self, other):
if isinstance(other, Bignum):
otherval = other.bigval
elif isinstance(other, Fixnum):
otherval = rbigint.fromint(other.fixval)
else:
assert isinstance(other, Number)
return other.divide_by(self)
return try_and_make_fixnum(otherval.floordiv(self.bigval))
def divide_by(self, other):
if isinstance(other, Bignum):
otherval = other.bigval
elif isinstance(other, Fixnum):
otherval = rbigint.fromint(other.fixval)
else:
assert isinstance(other, Number)
return other.divide(self)
return try_and_make_fixnum(self.bigval.floordiv(otherval))
def mod(self, other):
if isinstance(other, Bignum):
otherval = other.bigval
elif isinstance(other, Fixnum):
otherval = rbigint.fromint(other.fixval)
else:
assert isinstance(other, Number)
return other.mod_by(self)
return try_and_make_fixnum(otherval.mod(self.bigval))
def mod_by(self, other):
if isinstance(other, Bignum):
otherval = other.bigval
elif isinstance(other, Fixnum):
otherval = rbigint.fromint(other.fixval)
else:
assert isinstance(other, Number)
return other.mod(self)
return try_and_make_fixnum(self.bigval.mod(otherval))
def divmod(self, other):
if isinstance(other, Bignum):
otherval = other.bigval
elif isinstance(other, Fixnum):
otherval = rbigint.fromint(other.fixval)
else:
assert isinstance(other, Number)
return other.divmod_by(self)
d, m = otherval.divmod(self.bigval)
return Pair(try_and_make_fixnum(d),
Pair(try_and_make_fixnum(m),
nil))
def divmod_by(self, other):
if isinstance(other, Bignum):
otherval = other.bigval
elif isinstance(other, Fixnum):
otherval = rbigint.fromint(other.fixval)
else:
assert isinstance(other, Number)
return other.divmod(self)
d, m = self.bigval.divmod(otherval)
return Pair(try_and_make_fixnum(d),
Pair(try_and_make_fixnum(m),
nil))
def neg(self):
return try_and_make_fixnum(self.bigval.neg())
def try_and_make_fixnum(bi):
try:
num = bi.toint()
return Fixnum(num)
except OverflowError:
return Bignum(bi)
#XXX: Unicode
class Symbol(KernelValue):
type_name = 'symbol'
_immutable_fields_ = ['symval']
def __init__(self, value, source_pos=None):
assert isinstance(value, str), "wrong value for Symbol: %s" % value
self.symval = value
self.source_pos = source_pos
def tostring(self):
return self.symval
def interpret_simple(self, env):
return env.lookup(self)
def equal(self, other):
return isinstance(other, Symbol) and other.symval == self.symval
_symbol_table = {}
def get_interned(name):
try:
return _symbol_table[name]
except KeyError:
ret = _symbol_table[name] = Symbol(name)
return ret
class List(KernelValue):
pass
class Null(List):
type_name = 'null'
def tostring(self):
return "()"
def equal(self, other):
return isinstance(other, Null)
nil = Null()
def is_nil(kv):
return isinstance(kv, Null)
class Ignore(KernelValue):
type_name = 'ignore'
def tostring(self):
return '#ignore'
def equal(self, other):
return isinstance(other, Ignore)
ignore = Ignore()
def is_ignore(kv):
return ignore.equal(kv)
class Inert(KernelValue):
type_name = 'inert'
def tostring(self):
return '#inert'
def equal(self, other):
return isinstance(other, Inert)
inert = Inert()
def is_inert(kv):
return inert.equal(kv)
class Boolean(KernelValue):
type_name = 'boolean'
_immutable_fields_ = ['value']
def __init__(self, value, source_pos=None):
assert isinstance(value, bool), "wrong value for Boolean: %s" % value
self.bval = value
self.source_pos = source_pos
def tostring(self):
return '#t' if self.bval else '#f'
def equal(self, other):
return isinstance(other, Boolean) and other.bval == self.bval
true = Boolean(True)
false = Boolean(False)
def is_true(kv):
return true.equal(kv)
def is_false(kv):
return false.equal(kv)
def kernel_boolean(python_boolean):
return true if python_boolean else false
class Pair(List):
type_name = 'pair'
_immutable_fields_ = ['car', 'cdr']
simple = False
def __init__(self, car, cdr, source_pos=None):
assert isinstance(car, KernelValue), "non-KernelValue car: %s" % car
assert isinstance(cdr, KernelValue), "non-KernelValue cdr: %s" % cdr
self.car = car
self.cdr = cdr
self.source_pos = source_pos
def tostring(self):
s = rstring.StringBuilder()
s.append("(")
pair = self
while True:
assert isinstance(pair, Pair), "not a pair: %s" % pair
s.append(pair.car.tostring())
if isinstance(pair.cdr, Pair):
pair = pair.cdr
s.append(" ")
else:
if not is_nil(pair.cdr):
s.append(" . ")
s.append(pair.cdr.tostring())
break
s.append(")")
return s.build()
def interpret(self, env, cont):
if cont.source_pos is None:
cont.source_pos = self.source_pos
return self.car, env, CombineCont(self.cdr,
env,
cont,
source_pos=self.car.source_pos)
def equal(self, other):
return (isinstance(other, Pair)
and self.car.equal(other.car)
and self.cdr.equal(other.cdr))
class Combiner(KernelValue):
type_name = 'combiner'
def combine(self, operands, env, cont):
raise NotImplementedError
class Operative(Combiner):
type_name = 'operative'
name = None
class CompoundOperative(Operative):
def __init__(self, formals, eformal, exprs, static_env, source_pos=None, name=None):
self.formals = formals
self.eformal = eformal
self.exprs = exprs
self.static_env = static_env
self.source_pos = source_pos
self.name = name
def combine(self, operands, env, cont):
eval_env = Environment([self.static_env])
match_parameter_tree(self.formals, operands, eval_env)
match_parameter_tree(self.eformal, env, eval_env)
return sequence(self.exprs, eval_env, cont)
def tostring(self):
if self.name is None:
return str(self)
else:
return "<operative '%s'>" % self.name
class Primitive(Operative):
def __init__(self, code, name):
self.code = code
self.source_pos = None
self.name = name
def combine(self, operands, env, cont):
return self.code(operands, env, cont)
def tostring(self):
return "<primitive '%s'>" % self.name
class SimplePrimitive(Operative):
def __init__(self, code, name):
self.code = code
self.source_pos = None
self.name = name
def combine(self, operands, env, cont):
return cont.plug_reduce(self.code(operands))
def tostring(self):
return "<primitive '%s'>" % self.name
class ContWrapper(Operative):
def __init__(self, cont, source_pos=None):
self.cont = cont
self.source_pos = source_pos
self.name = None
def combine(self, operands, env, cont):
return abnormally_pass(operands, cont, self.cont)
def abnormally_pass(operands, src_cont, dst_cont):
dst_cont.mark(True)
exiting = select_interceptors(src_cont, InnerGuardCont)
dst_cont.mark(False)
src_cont.mark(True)
entering = select_interceptors(dst_cont, OuterGuardCont)
src_cont.mark(False)
cont = dst_cont
for outer, interceptor in entering:
cont = InterceptCont(interceptor, cont, outer)
for outer, interceptor in reversed(exiting):
cont = InterceptCont(interceptor, cont, outer)
debug.on_abnormal_pass(operands, src_cont, dst_cont, exiting, entering)
return pass_to_next(operands, cont)
def pass_to_next(operands, cont):
if isinstance(cont, InterceptCont):
outer = cont.prev
return cont.interceptor.combine(
Pair(operands, Pair(Applicative(ContWrapper(outer)), nil)),
outer.env,
cont)
else:
return cont.plug_reduce(operands)
def select_interceptors(cont, cls):
ls = []
while cont is not None and not cont.marked:
if isinstance(cont, cls):
for guard in iter_list(cont.guards):
selector, interceptor = pythonify_list(guard)
if selector.marked:
outer_cont = cont if isinstance(cont, OuterGuardCont) else cont.prev
ls.append((outer_cont, interceptor))
break
cont = cont.prev
return ls
class Applicative(Combiner):
type_name = 'applicative'
def __init__(self, combiner, source_pos=None):
assert isinstance(combiner, Combiner), "wrong type to wrap: %s" % combiner
self.wrapped_combiner = combiner
self.source_pos = source_pos
def combine(self, operands, env, cont):
return evaluate_arguments(operands,
env,
ApplyCont(self.wrapped_combiner, env, cont))
def equal(self, other):
return (isinstance(other, Applicative)
and other.wrapped_combiner.equal(self.wrapped_combiner))
def tostring(self):
return "<applicative %s>" % self.wrapped_combiner.tostring()
class Environment(KernelValue):
type_name = 'environment'
def __init__(self, parents, bindings=None, source_pos=None):
for each in parents:
check_type(each, Environment)
assert isinstance(each, Environment)
self.parents = parents
self.bindings = bindings or {}
self.source_pos = source_pos
def set(self, symbol, value):
assert isinstance(symbol, Symbol), "setting non-symbol: %s" % symbol
self.bindings[symbol.symval] = value
def lookup(self, symbol):
ret = self.lookup_unchecked(symbol)
if ret is None:
signal_symbol_not_found(symbol)
else:
return ret
def lookup_unchecked(self, symbol):
assert isinstance(symbol, Symbol), "looking up non-symbol: %s" % symbol
ret = self.bindings.get(symbol.symval, None)
if ret is not None:
return ret
for parent in self.parents:
ret = parent.lookup_unchecked(symbol)
if ret is not None:
return ret
return None
class EncapsulationType(KernelValue):
def create_methods(self, source_pos=None):
constructor = Applicative(EncapsulationConstructor(self, source_pos))
predicate = Applicative(EncapsulationPredicate(self, source_pos))
accessor = Applicative(EncapsulationAccessor(self, source_pos))
return Pair(constructor, Pair(predicate, Pair(accessor, nil)))
class EncapsulatedObject(KernelValue):
# Abusing terminology; this is actually a union of types.
type_name = 'encapsulated-object'
def __init__(self, val, encapsulation_type, source_pos=None):
self.val = val
self.encapsulation_type = encapsulation_type
self.source_pos = source_pos
class EncapsulationMethod(Operative):
def __init__(self, encapsulation_type, source_pos=None):
self.encapsulation_type = encapsulation_type
self.source_pos = source_pos
self.name = None
class EncapsulationConstructor(EncapsulationMethod):
def combine(self, operands, env, cont):
to_wrap, = pythonify_list(operands, 1)
return cont.plug_reduce(EncapsulatedObject(to_wrap,
self.encapsulation_type))
class EncapsulationPredicate(EncapsulationMethod):
def combine(self, operands, env, cont):
for val in iter_list(operands):
if not isinstance(val, EncapsulatedObject):
return cont.plug_reduce(false)
if val.encapsulation_type is not self.encapsulation_type:
return cont.plug_reduce(false)
return cont.plug_reduce(true)
class EncapsulationAccessor(EncapsulationMethod):
def combine(self, operands, env, cont):
wrapped, = pythonify_list(operands, 1)
check_type(wrapped, EncapsulatedObject)
assert isinstance(wrapped, EncapsulatedObject)
if wrapped.encapsulation_type is self.encapsulation_type:
return cont.plug_reduce(wrapped.val)
else:
signal_encapsulation_type_error(self, wrapped)
# Copying a trick from the reference implementation in the R-1RK.
#
# This is a member of promises so it can be overwritten altogether when
# a promise results in another that must be resolved immediately.
#
# If env is None then val is the result of this promise, otherwise val is the
# expression that we need to evaluate in env.
class PromiseData(object):
def __init__(self, val, env):
self.val = val
self.env = env
class Promise(KernelValue):
type_name = 'promise'
def __init__(self, val, env, source_pos=None):
self.data = PromiseData(val, env)
self.source_pos = source_pos
def force(self, cont):
if self.data.env is None:
return cont.plug_reduce(self.data.val)
else:
return (self.data.val,
self.data.env,
HandlePromiseResultCont(self, cont))
class KeyedDynamicBinder(Operative):
def combine(self, operands, env, cont):
value, thunk = pythonify_list(operands, 2)
return thunk.combine(nil,
Environment([]),
KeyedDynamicCont(self, value, cont))
class KeyedDynamicAccessor(Operative):
def __init__(self, binder, source_pos=None):
self.binder = binder
self.source_pos = source_pos
def combine(self, operands, env, cont):
pythonify_list(operands, 0)
prev = cont
while prev is not None:
if (isinstance(prev, KeyedDynamicCont)
and prev.binder is self.binder):
return cont.plug_reduce(prev.value)
prev = prev.prev
signal_unbound_dynamic_key(self)
class KeyedStaticBinder(Operative):
def combine(self, operands, env, cont):
value, env = pythonify_list(operands, 2)
check_type(env, Environment)
assert isinstance(env, Environment)
return cont.plug_reduce(KeyedEnvironment(self, value, env))
class KeyedEnvironment(Environment):
def __init__(self, binder, value, parent, source_pos=None):
Environment.__init__(self, [parent], {}, source_pos)
self.binder = binder
self.value = value
class KeyedStaticAccessor(Operative):
def __init__(self, binder, source_pos=None):
self.binder = binder
self.source_pos = source_pos
def combine(self, operands, env, cont):
pythonify_list(operands, 0)
ret = self.find_binding(env)
if ret is None:
signal_unbound_static_key(self)
else:
return cont.plug_reduce(ret)
def find_binding(self, env):
if (isinstance(env, KeyedEnvironment)
and env.binder is self.binder):
return env.value
for parent in env.parents:
ret = self.find_binding(parent)
if ret is not None:
return ret
return None
class Continuation(KernelValue):
type_name = 'continuation'
_immutable_args_ = ['prev']
def __init__(self, prev, source_pos=None):
self.prev = prev
self.marked = False
self.source_pos = source_pos
def plug_reduce(self, val):
debug.on_plug_reduce(val, self)
return self._plug_reduce(val)
def _plug_reduce(self, val):
return self.prev.plug_reduce(val)
def mark(self, boolean):
self.marked = boolean
if self.prev is not None:
self.prev.mark(boolean)
class RootCont(Continuation):
def __init__(self):
Continuation.__init__(self, None)
self.source_pos = None
def _plug_reduce(self, val):
raise KernelExit
class BaseErrorCont(Continuation):
def _plug_reduce(self, val):
if not isinstance(val, ErrorObject):
print "*** ERROR ***:",
print val.todisplay()
return Continuation._plug_reduce(self, val)
def evaluate_arguments(vals, env, cont):
if is_nil(vals):
return cont.plug_reduce(nil)
elif isinstance(vals, Pair):
if is_nil(vals.cdr):
return vals.car, env, NoMoreArgsCont(cont, vals.car.source_pos)
else:
return vals.car, env, EvalArgsCont(vals.cdr, env, cont, vals.car.source_pos)
else:
# XXX: if the arguments are an improper list, this only prints the last
# cdr.
signal_combine_with_non_list_operands(Pair(vals, nil))
# XXX: DRY
def s_andp(vals, env, cont):
if is_nil(vals):
return cont.plug_reduce(true)
elif isinstance(vals, Pair):
return vals.car, env, AndCont(vals.cdr, env, cont, vals.car.source_pos)
else:
# XXX: if the arguments are an improper list, this only prints the last
# cdr.
signal_value_error("$and? with non-list arguments", Pair(vals, nil))
class AndCont(Continuation):
def __init__(self, exprs, env, prev, source_pos=None):
Continuation.__init__(self, prev, source_pos)
self.exprs = exprs
self.env = env
def _plug_reduce(self, val):
check_type(val, Boolean)
if true.equal(val):
return s_andp(self.exprs, self.env, self.prev)
else:
return self.prev.plug_reduce(false)
# XXX: DRY
def s_orp(vals, env, cont):
if is_nil(vals):
return cont.plug_reduce(false)
elif isinstance(vals, Pair):
return vals.car, env, OrCont(vals.cdr, env, cont, vals.car.source_pos)
else:
# XXX: if the arguments are an improper list, this only prints the last
# cdr.
signal_value_error("$or? with non-list arguments", Pair(vals, nil))
class OrCont(Continuation):
def __init__(self, exprs, env, prev, source_pos=None):
Continuation.__init__(self, prev, source_pos)
self.exprs = exprs
self.env = env
def _plug_reduce(self, val):
check_type(val, Boolean)
if true.equal(val):
return self.prev.plug_reduce(true)
else:
return s_orp(self.exprs, self.env, self.prev)
# XXX: refactor to extract common pattern with evaluate_arguments.
# this one happens to work on a Python list because we just
# happen to build one for transposing the list arguments to
# map.
def map_(combiner, transposed_lists, index, env, cont):
if not transposed_lists:
return cont.plug_reduce(nil)
if index == len(transposed_lists) - 1:
return combiner.combine(transposed_lists[index],
env, NoMoreArgsCont(cont))
else:
return combiner.combine(transposed_lists[index],
env,
MapCont(combiner,
transposed_lists,
index+1,
env,
cont))
class MapCont(Continuation):
def __init__(self, combiner, lists, index, env, prev, source_pos=None):
Continuation.__init__(self, prev, source_pos)
self.combiner = combiner
self.lists = lists
self.index = index
self.env = env
def _plug_reduce(self, val):
return map_(self.combiner,
self.lists,
self.index,
self.env,
GatherArgsCont(val, self.prev))
class EvalArgsCont(Continuation):
def __init__(self, exprs, env, prev, source_pos=None):
Continuation.__init__(self, prev, source_pos)
self.exprs = exprs
self.env = env
def _plug_reduce(self, val):
return evaluate_arguments(self.exprs,
self.env,
GatherArgsCont(val, self.prev))
class NoMoreArgsCont(Continuation):
def _plug_reduce(self, val):
return self.prev.plug_reduce(Pair(val, nil))
class GatherArgsCont(Continuation):
def __init__(self, val, prev, source_pos=None):
Continuation.__init__(self, prev)
self.val = val
self.source_pos = source_pos
def _plug_reduce(self, val):
return self.prev.plug_reduce(Pair(self.val, val))
class ApplyCont(Continuation):
def __init__(self, combiner, env, prev, source_pos=None):
Continuation.__init__(self, prev)
self.combiner = combiner
self.env = env
self.source_pos = source_pos
def _plug_reduce(self, args):
return self.combiner.combine(args, self.env, self.prev)
class CombineCont(Continuation):
def __init__(self, operands, env, prev, source_pos=None):
Continuation.__init__(self, prev)
self.operands = operands
self.env = env
self.source_pos = source_pos
def _plug_reduce(self, val):
return val.combine(self.operands, self.env, self.prev)
class GuardCont(Continuation):
def __init__(self, guards, env, prev, source_pos=None):
Continuation.__init__(self, prev)
self.guards = guards
self.env = env
self.source_pos = source_pos
class SequenceCont(Continuation):
def __init__(self, exprs, env, prev, source_pos=None):
Continuation.__init__(self, prev)
self.exprs = exprs
self.env = env
self.source_pos = source_pos
def _plug_reduce(self, val):
return sequence(self.exprs, self.env, self.prev)
def sequence(exprs, env, cont):
if is_nil(exprs):
return cont.plug_reduce(inert)
assert isinstance(exprs, Pair), "non-pair sequence: %s" % exprs
if is_nil(exprs.cdr):
# The whole function can be made shorter and simpler if we don't treat
# this as a special case, but then we'd be creating an extra
# continuation for the last element of a list. Avoiding that should be
# a significant savings since every list has a last element.
#
# This optimization was taken from Queinnec's LiSP (see README).
# I haven't actually measured, yet, how worthy is it when compiling
# with JIT enabled.
return exprs.car, env, cont
else:
return exprs.car, env, SequenceCont(exprs.cdr, env, cont)
class IfCont(Continuation):
def __init__(self, consequent, alternative, env, prev):
Continuation.__init__(self, prev)
self.consequent = consequent
self.alternative = alternative
self.env = env
def _plug_reduce(self, val):
if is_true(val):
return self.consequent, self.env, self.prev
elif is_false(val):
return self.alternative, self.env, self.prev
else:
signal_type_error(Boolean, val)
class CondCont(Continuation):
def __init__(self, clauses, env, prev, source_pos=None):
Continuation.__init__(self, prev)
self.clauses = clauses
self.env = env
self.prev = prev
self.source_pos = source_pos
def _plug_reduce(self, val):
if is_true(val):
return sequence(cdar(self.clauses), self.env, self.prev)
else:
return cond(cdr(self.clauses), self.env, self.prev)
def cond(vals, env, cont):
if is_nil(vals):
return cont.plug_reduce(inert)
return caar(vals), env, CondCont(vals, env, cont)
class DefineCont(Continuation):
def __init__(self, definiend, env, prev, source_pos=None):
Continuation.__init__(self, prev)
self.definiend = definiend
self.env = env
self.source_pos = source_pos
def _plug_reduce(self, val):
match_parameter_tree(self.definiend, val, self.env)
return self.prev.plug_reduce(inert)
def match_parameter_tree(param_tree, operand_tree, env):
if isinstance(param_tree, Symbol):
op = operand_tree
while isinstance(op, Applicative):
op = op.wrapped_combiner
if isinstance(op, Operative) and op.name is None:
op.name = param_tree.symval
env.set(param_tree, operand_tree)
elif is_ignore(param_tree):
pass
elif is_nil(param_tree):
if not is_nil(operand_tree):
# XXX: this only shows the tail of the mismatch
signal_operand_mismatch(param_tree, operand_tree)
elif isinstance(param_tree, Pair):
if not isinstance(operand_tree, Pair):
# XXX: this only shows the tail of the mismatch
signal_operand_mismatch(param_tree, operand_tree)
match_parameter_tree(param_tree.car, operand_tree.car, env)
match_parameter_tree(param_tree.cdr, operand_tree.cdr, env)
class InnerGuardCont(GuardCont):
pass
class OuterGuardCont(GuardCont):
pass
class InterceptCont(Continuation):
def __init__(self, interceptor, next_cont, outer_cont, source_pos=None):
# The outer continuation is the parent of this one for the purposes of
# abnormal passes, but normal return from this continuation goes to the
# next interceptor (or to the destination, if this is the last one)
# instead.
Continuation.__init__(self, outer_cont, source_pos)
self.next_cont = next_cont
assert isinstance(interceptor, Applicative), "non-applicative interceptor: %s" % interceptor
self.interceptor = interceptor.wrapped_combiner
def _plug_reduce(self, val):
return pass_to_next(val, self.next_cont)
class ExtendCont(Continuation):
def __init__(self, receiver, env, cont_to_extend, source_pos=None):
Continuation.__init__(self, cont_to_extend)
assert isinstance(receiver, Applicative), "non-applicative receiver: %s" % receiver
self.receiver = receiver.wrapped_combiner
self.env = env
self.source_pos = source_pos
def _plug_reduce(self, val):
return self.receiver.combine(val, self.env, self.prev)
class HandlePromiseResultCont(Continuation):
def __init__(self, promise, prev, source_pos=None):
Continuation.__init__(self, prev, source_pos)
self.promise = promise
def plug_reduce(self, val):
if self.promise.data.env is None:
return self.prev.plug_reduce(self.promise.data.val)
if isinstance(val, Promise):
self.promise.data = val.data
return self.promise.force(self.prev)
else:
self.promise.data.val = val
self.promise.data.env = None
return self.prev.plug_reduce(val)
class KeyedDynamicCont(Continuation):
def __init__(self, binder, value, prev, source_pos=None):
Continuation.__init__(self, prev, source_pos)
self.binder = binder
self.value = value
class DebugErrorCont(Continuation):
def plug_reduce(self, val):
return debug.on_error(val)
class ConstantCont(Continuation):
"""Ignore the value passed to me; just pass on the one provided in the
constructor."""
def __init__(self, val, prev):
Continuation.__init__(self, prev)
self.val = val
def _plug_reduce(self, val):
return self.prev.plug_reduce(self.val)
class BindsCont(Continuation):
def __init__(self, pyvals, prev, source_pos=None):
Continuation.__init__(self, prev, source_pos)
self.pyvals = pyvals
def _plug_reduce(self, env):
check_type(env, Environment)
assert isinstance(env, Environment)
for symbol in self.pyvals[1:]: