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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
|
-- Copyright (c) 1991-2002, The Numerical Algorithms Group Ltd.
-- All rights reserved.
-- Copyright (C) 2007-2010, Gabriel Dos Reis.
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are
-- met:
--
-- - Redistributions of source code must retain the above copyright
-- notice, this list of conditions and the following disclaimer.
--
-- - Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in
-- the documentation and/or other materials provided with the
-- distribution.
--
-- - Neither the name of The Numerical Algorithms Group Ltd. nor the
-- names of its contributors may be used to endorse or promote products
-- derived from this software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
-- IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
-- TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
-- PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
-- OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
-- EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
-- PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
import ggreater
import macros
import sys_-utility
namespace BOOT
module g_-util where
isAtomicForm: %Form -> %Boolean
getTypeOfSyntax: %Form -> %Mode
pairList: (%List,%List) -> %List
mkList: %List -> %List
isSubDomain: (%Mode,%Mode) -> %Form
expandToVMForm: %Thing -> %Thing
--% VM forms
++ Make the assumption named `prop' for all symbols
++ on the lis `syms'.
assumeProperty(syms,prop) ==
for s in syms repeat
property(s,prop) := true
assumeProperty('(%and %or),'%nary)
++ We are about to construct a middle end expression
++ with operator `op, and aguments `form'. Try to
++ simplify the structure of the expression.
flattenVMForm(form,op) == main where
main() ==
atom form => form
EQ(form.op,op) => [op,:flatten(form.args,op,nil)]
[flattenVMForm(form.op,op),:flattenVMForm(form.args,op)]
flatten(forms,op,accu) ==
forms = nil => accu
x := flattenVMForm(first forms,op)
cons? x and EQ(x.op,op) => flatten(rest forms,op,[:accu,:x.args])
flatten(rest forms,op,[:accu,x])
++ Build a midde end expression with given operator and arguments.
mkVMForm(op,args) ==
if op has %nary then
args := flattenVMForm(args,op)
op = '%or =>
args := REMOVE('%false,args)
args = nil => '%false
args is [arg] => arg
[op,:args]
op = '%and =>
args := REMOVE('%true,args)
args = nil => '%true
args is [arg] => arg
[op,:args]
op = '%not =>
[arg] := args
arg = '%false => '%true
arg = '%true => '%false
arg is ['%not,arg'] => arg'
['%not,:args]
--%
--% Opcode expansion to VM codes.
--%
--%
--% Iteration control structures
--%
--% Code generation for an iterator produces a sequence of
--% length 5, whose components have the following meanings:
--% 0. list of loop-wide variables and their initializers
--% 1. list of body-wide variables and their initializers
--% 2. update code for next iteration
--% 3. predicate guarding loop body execution
--% 4. loop termination predicate
++ Generate code that sequentially visits each component of a list.
expandIN(x,l,early?) ==
g := gensym() -- rest of the list yet to be visited
early? => -- give the loop variable a wider scope.
[[[g,middleEndExpand l],[x,'NIL]],
nil,[['SETQ,g,['CDR,g]]],
nil,[['ATOM,g],['PROGN,['SETQ,x,['CAR,g]],'NIL]]]
[[[g,middleEndExpand l]],
[[x,['CAR,g]]],[['SETQ,g,['CDR,g]]],
nil,[['ATOM,g]]]
expandON(x,l) ==
[[[x,middleEndExpand l]],nil,[["SETQ",x,["CDR",x]]],nil,[["ATOM",x]]]
++ Generate code that traverses an interval with lower bound 'lo',
++ arithmetic progression `step, and possible upper bound `final'.
expandSTEP(id,lo,step,final)==
lo := middleEndExpand lo
step := middleEndExpand step
final := middleEndExpand final
loopvar := [[id,lo]]
inc :=
isAtomicForm step => step
g1 := gensym()
loopvar := [:loopvar,[g1,step]]
g1
final :=
atom final => final
final is [hi] and isAtomicForm hi => hi
g2 := gensym()
loopvar := [:loopvar,[g2,:final]]
g2
ex :=
final = nil => nil
integer? inc =>
pred :=
MINUSP inc => "<"
">"
[[pred,id,final]]
[['COND,[['MINUSP,inc],
["<",id,final]],['T,[">",id,final]]]]
suc := [["SETQ",id,["+",id,inc]]]
[loopvar,nil,suc,nil,ex]
++ Generate code for iterators that filter out execution state
++ not satisfying predicate `p'.
expandSUCHTHAT p ==
[nil,nil,nil,[middleEndExpand p],nil]
++ Generate code for iterators that stop loop iteration when the
++ state fails predicate `p'.
expandWHILE p ==
[nil,nil,nil,nil,[["NOT",middleEndExpand p]]]
expandUNTIL p ==
g := gensym()
[[[g,false]],nil,[["SETQ",g,middleEndExpand p]],nil,[g]]
expandInit(var,val) ==
[[[var,middleEndExpand val]],nil,nil,nil,nil]
expandIterators iters ==
-- Exit predicates may reference iterator variables. In that case,
-- the scope the variables must cover the generated loop body. The
-- following is much more coarse approximation than we may want,
-- but it will do. For now.
early? := or/[ it.op in '(WHILE UNTIL) for it in iters]
[toLisp(it,early?) or leave "failed" for it in iters] where
toLisp(it,early?) ==
it is ["STEP",var,lo,inc,:hi] => expandSTEP(var,lo,inc,hi)
it is ["IN",var,seq] => expandIN(var,seq,early?)
it is ["ON",var,seq] => expandON(var,seq)
it is ["WHILE",pred] => expandWHILE pred
it is [op,pred] and op in '(SUCHTHAT _|) => expandSUCHTHAT pred
it is ["UNTIL",pred] => expandUNTIL pred
it is ["%init",var,val] => expandInit(var,val)
nil
expandLoop(iters,body,ret) ==
itersCode := expandIterators iters
itersCode = "failed" => systemErrorHere ["expandLoop",iters]
body := middleEndExpand body
itersCode := "coagulate"/itersCode
where
coagulate(it1,it2) == [append(it1.k,it2.k) for k in 0..4]
[loopInits,bodyInits,cont,filters,exits] := itersCode
-- Guard the execution of the body by the filters.
if filters ~= nil then
body := mkpf([:filters,body],"AND")
-- If there is any body-wide initialization, now is the time.
if bodyInits ~= nil then
body := ["LET",bodyInits,body]
exits := ["COND",
[mkpf(exits,"OR"),["RETURN",ret]],
[true,body]]
body := ["LOOP",exits,:cont]
-- Finally, set up loop-wide initializations.
loopInits = nil => body
["LET",loopInits,body]
++ Generate code for list comprehension.
expandCollect ["%collect",:iters,body] ==
val := gensym() -- result of the list comprehension
-- Transform the body to build the list as we go.
body := ["SETQ",val,["CONS",middleEndExpand body,val]]
-- Initialize the variable holding the result; expand as
-- if ordinary loop. But don't forget we built the result
-- in reverse order.
expandLoop([:iters,["%init",val,nil]],body,["NREVERSE",val])
++ Generate code for plain loop.
expandRepeat ["%repeat",:iters,body] ==
expandLoop(iters,body,["voidValue"])
expandReturn(x is ['%return,.,y]) ==
$FUNNAME = nil => systemErrorHere ['expandReturn,x]
['RETURN_-FROM,$FUNNAME,expandToVMForm y]
-- Logical operators
expandEq ["%eq",:args] ==
["EQ",:expandToVMForm args]
-- Local variable bindings
expandBind ["%bind",inits,body] ==
body := expandToVMForm body
inits := [[first x,expandToVMForm second x] for x in inits]
-- FIXME: we should consider turning LET* into LET or direct inlining.
["LET*",inits,body]
-- Memory load/store
expandDynval ["%dynval",:args] ==
["SYMBOL-VALUE",:expandToVMForm args]
expandStore ["%store",place,value] ==
value := expandToVMForm value
place is ['%head,x] => ['RPLACA,expandToVMForm x,value]
place is ['%tail,x] => ['RPLACD,expandToVMForm x,value]
place := expandToVMForm place
cons? place => ["SETF",place,value]
["SETQ",place,value]
++ Opcodes with direct mapping to target operations.
for x in [
-- Boolean constants
-- ['%false, :'NIL],
['%true, :'T],
-- unary Boolean operations
['%not, :'NOT],
-- binary Boolean operations
['%and, :'AND],
['%or, :'OR],
-- character binary operations
['%ceq, :'CHAR_=],
['%clt, :'CHAR_<],
['%cle, :'CHAR_<_=],
['%cgt, :'CHAR_>],
['%cge, :'CHAR_>_=],
['%c2i, :'CHAR_-CODE],
['%i2c, :'CODE_-CHAR],
-- unary integer operations.
['%iabs, :'ABS],
['%ieven?, :'EVENP],
['%ineg, :"-"],
['%integer?,:'INTEGERP],
['%iodd?, :'ODDP],
['%ismall?, :'FIXNUMP],
-- binary integer operations.
['%iadd,:"+"],
['%ieq, :"EQL"],
['%igcd,:'GCD],
['%ige, :">="],
['%igt, :">"],
['%iinc,:"1+"],
['%ilcm,:'LCM],
['%ile, :"<="],
['%ilt, :"<"],
['%imax,:'MAX],
['%imin,:'MIN],
['%imul,:"*"],
['%ipow,:'EXPT],
['%isub,:"-"],
-- unary float operations.
['%fabs, :'ABS],
['%float?,:'FLOATP],
-- binary float operations.
['%fadd, :"+"],
['%fdiv, :"/"],
['%feq, :"="],
['%fge, :">="],
['%fgt, :">"],
['%fle, :"<="],
['%flt, :"<"],
['%fmax, :'MAX],
['%fmin, :'MIN],
['%fmul, :"*"],
['%fpow, :'EXPT],
['%fsub, :"-"],
-- list contants
-- ['%nil, :'NIL],
-- unary list operations
['%head, :'CAR],
['%makepair, :'CONS],
['%lempty?, :'NULL],
['%lfirst, :'CAR],
['%llength, :'LIST_-LENGTH],
['%lreverse, :'REVERSE],
['%lreverse_!,:'NREVERSE],
['%lsecond, :'CADR],
['%lthird, :'CADDR],
['%pair?, :'CONSP],
['%tail, :'CDR],
-- binary list operations
['%lconcat, :'APPEND],
-- symbol unary functions
['%gensym, :'GENSYM],
-- string unary functions
['%string?, :'STRINGP],
-- general utility
['%hash,:'SXHASH],
['%lam, :'LAMBDA]
] repeat property(first x,'%Rename) := rest x
++ Table of opcode-expander pairs.
for x in [
["%collect",:function expandCollect],
["%repeat",:function expandRepeat],
['%return, :function expandReturn],
["%eq",:function expandEq],
["%bind",:function expandBind],
["%store",:function expandStore],
["%dynval",:function expandDynval]
] repeat property(first x,"%Expander") := rest x
++ Return the expander of a middle-end opcode, or nil if there is none.
getOpcodeExpander op ==
op has %Expander
++ Expand all opcodes contained in the form `x' into a form
++ suitable for evaluation by the VM.
expandToVMForm x ==
x = '%false or x = '%nil => 'NIL
IDENTP x and (x' := x has %Rename) => x'
isAtomicForm x => x
[op,:args] := x
IDENTP op and (fun:= getOpcodeExpander op) => apply(fun,x,nil)
op' := expandToVMForm op
args' := expandToVMForm args
EQ(op,op') and EQ(args,args') => x
[op',:args']
++
$interpOnly := false
--% Utility Functions of General Use
mkCacheName(name) ==
INTERN strconc(PNAME name,'";AL")
mkAuxiliaryName(name) ==
INTERN strconc(PNAME name,'";AUX")
homogeneousListToVector(t,l) ==
makeSimpleArrayFromList(t,l)
++ tests if x is an identifier beginning with #
isSharpVar x ==
IDENTP x and SCHAR(SYMBOL_-NAME x,0) = char "#"
isSharpVarWithNum x ==
null isSharpVar x => nil
(n := QCSIZE(p := PNAME x)) < 2 => nil
ok := true
c := 0
for i in 1..(n-1) while ok repeat
d := p.i
ok := digit? d => c := 10*c + DIG2FIX d
if ok then c else nil
++ Returns true if `form' is either an atom or a quotation.
isAtomicForm form ==
atom form or first form = "QUOTE"
--% Sub-domains information handlers
++ If `dom' is a subdomain, return its immediate super-domain.
superType: %Mode -> %Maybe %Mode
superType dom ==
dom = "$" => superType $functorForm
dom isnt [ctor,:args] => nil
[super,.] := getSuperDomainFromDB ctor or return nil
sublisFormal(args,super,$AtVariables)
++ If the domain designated by the domain form `dom' is a subdomain,
++ then return its defining predicate. Otherwise, return nil.
domainVMPredicate dom ==
dom = "$" => domainVMPredicate $functorForm
dom isnt [ctor,:args] => false
[.,pred] := getSuperDomainFromDB ctor or return nil
sublisFormal(args,pred,$AtVariables)
++ Return the root of the reflexive transitive closure of
++ the super-domain chain for the domain designated by the domain
++ form `d'.
maximalSuperType: %Mode -> %Mode
maximalSuperType d ==
d' := superType d => maximalSuperType d'
d
++ Note that the functor `sub' instantiates to domains that
++ are subdomains of `super' instances restricted by the
++ predicate `pred'.
noteSubDomainInfo: (%Symbol,%Instantiation,%Form) -> %Thing
noteSubDomainInfo(sub,super,pred) ==
SETDATABASE(sub,"SUPERDOMAIN",[super,pred])
++ Returns non-nil if `d1' is a sub-domain of `d2'. This is the
++ case when `d1' is transitively given by an instance of SubDomain
++ d1 == SubDomain(d2,pred)
++ The transitive closure of the predicate form is returned, where
++ the predicate parameter is `#1'.
isSubDomain(d1,d2) ==
atom d1 or atom d2 => false
-- 1. Easy, if by syntax constructs.
d1 is ["SubDomain",=d2,pred] => pred
-- 2. Just say no, if there is no hope.
[sup,pred] := getSuperDomainFromDB first d1 or return false
-- 3. We may be onto something.
-- `sup' and `pred' are in most general form. We cannot just
-- test for the functors, as different arguments may instantiate
-- to super-domains.
args := rest d1
sublisFormal(args,sup,$AtVariables) = d2 =>
sublisFormal(args,pred,$AtVariables)
-- 4. Otherwise, lookup in the super-domain chain.
pred' := isSubDomain(sup,d2) =>
MKPF([pred',sublisFormal(args,pred,$AtVariables)],"AND")
-- 5. Lot of smoke, no fire.
false
--%
mkList u ==
u => ["LIST",:u]
nil
ELEMN(x, n, d) ==
null x => d
n = 1 => first x
ELEMN(rest x, n-1, d)
PPtoFile(x, fname) ==
stream := DEFIOSTREAM([['MODE, :'OUTPUT], ['FILE, :fname]], 80, 0)
PRETTYPRINT(x, stream)
SHUT stream
x
ScanOrPairVec(f, ob) ==
$seen: local := hashTable 'EQ
CATCH('ScanOrPairVecAnswer, ScanOrInner(f, ob)) where
ScanOrInner(f, ob) ==
HGET($seen, ob) => nil
cons? ob =>
HPUT($seen, ob, true)
ScanOrInner(f, first ob)
ScanOrInner(f, rest ob)
nil
VECP ob =>
HPUT($seen, ob, true)
for i in 0..#ob-1 repeat ScanOrInner(f, ob.i)
nil
FUNCALL(f, ob) =>
THROW('ScanOrPairVecAnswer, true)
nil
++ Query properties for an entity in a given environment.
get: (%Thing,%Symbol,%List) -> %Thing
get0: (%Thing,%Symbol,%List) -> %Thing
get1: (%Thing,%Symbol,%List) -> %Thing
get2: (%Thing,%Symbol) -> %Thing
get(x,prop,e) ==
$InteractiveMode => get0(x,prop,e)
get1(x,prop,e)
get0(x,prop,e) ==
not atom x => get(x.op,prop,e)
u:= QLASSQ(x,first first e) => QLASSQ(prop,u)
(tail:= rest first e) and (u:= fastSearchCurrentEnv(x,tail)) =>
QLASSQ(prop,u)
nil
get1(x,prop,e) ==
--this is the old get
not atom x => get(x.op,prop,e)
prop="modemap" and $insideCapsuleFunctionIfTrue=true =>
LASSOC("modemap",getProplist(x,$CapsuleModemapFrame))
or get2(x,prop)
LASSOC(prop,getProplist(x,e)) or get2(x,prop)
get2(x,prop) ==
prop="modemap" and IDENTP x and constructor? x =>
(u := getConstructorModemapFromDB x) => [u]
nil
nil
++ Update properties of an entity in an environment.
put: (%Thing,%Symbol,%Thing,%Env) -> %Env
addBinding: (%Thing,%List,%Env) -> %Env
addBindingInteractive: (%Thing, %List, %Env) -> %Env
augProplistOf: (%Thing,%Symbol,%Thing,%Env) -> %List
augProplist: (%List,%Symbol,%Thing) -> %List
augProplistInteractive: (%List,%Symbol,%Thing) -> %List
putIntSymTab: (%Thing,%Symbol,%Form,%Env) -> %Env
addIntSymTabBinding: (%Thing,%List,%Env) -> %Env
put(x,prop,val,e) ==
$InteractiveMode and not EQ(e,$CategoryFrame) =>
putIntSymTab(x,prop,val,e)
--e must never be $CapsuleModemapFrame
not atom x => put(first x,prop,val,e)
newProplist := augProplistOf(x,prop,val,e)
prop="modemap" and $insideCapsuleFunctionIfTrue=true =>
SAY ["**** modemap PUT on CapsuleModemapFrame: ",val]
$CapsuleModemapFrame:=
addBinding(x,augProplistOf(x,"modemap",val,$CapsuleModemapFrame),
$CapsuleModemapFrame)
e
addBinding(x,newProplist,e)
putIntSymTab(x,prop,val,e) ==
null atom x => putIntSymTab(first x,prop,val,e)
pl0 := pl := search(x,e)
pl :=
null pl => [[prop,:val]]
u := ASSQ(prop,pl) =>
u.rest := val
pl
lp := LASTPAIR pl
u := [[prop,:val]]
lp.rest := u
pl
EQ(pl0,pl) => e
addIntSymTabBinding(x,pl,e)
addIntSymTabBinding(var,proplist,e is [[curContour,:.],:.]) ==
-- change proplist of var in e destructively
u := ASSQ(var,curContour) =>
u.rest := proplist
e
first(e).first := [[var,:proplist],:curContour]
e
--% Syntax manipulation
++ Build a quasiquotation form for `x'.
quasiquote x ==
["[||]",x]
++ Extract the quoted form, otherwise return nil
isQuasiquote m ==
m is ["[||]",y] => y
++ returns the inferred domain for the syntactic object t.
getTypeOfSyntax t ==
atom t =>
IDENTP t => '(Identifier)
(m := getBasicMode t) and not member(m,[$EmptyMode,$NoValueMode]) =>
["Literal",m]
$Syntax
[op,:.] := t
op = "Mapping" => '(MappingAst)
op = "QUOTE" and #t = 2 and IDENTP second t => ["Literal",$Symbol]
op = "IF" => '(IfAst)
op = "REPEAT" => '(RepeatAst)
op = "WHILE" => '(WhileAst)
op = "IN" => '(InAst)
op = "COLLECT" => '(CollectAst)
op = "construct" => '(ConstructAst)
op = "exit" => '(ExitAst)
op = "return" => '(ReturnAst)
op = "SEGMENT" => '(SegmentAst)
op = "SEQ" => '(SequenceAst)
op = "pretend" => '(PretendAst)
op = "::" => '(CoerceAst)
op = "@" => '(RestrictAst)
op = "%LET" => '(LetAst)
op = "|" => '(SuchThatAst)
op = ":" => '(ColonAst)
op = ":=" => '(LetAst)
op = "%Comma" => '(CommaAst)
op = "case" => '(CaseAst)
op = "has" => '(HasAst)
op = "is" => '(IsAst)
op = "DEF" => '(DefinitionAst)
op in '(MDEF %Macro) => '(MacroAst)
op = "where" => '(WhereAst)
op in '(ATTRIBUTE %Attribute) => '(AttributeAst)
op = "Join" => '(JoinAst)
op = "CAPSULE" => '(CapsuleAst)
op in '(%Import import) => '(ImportAst)
op in '(%Signature SIGNATURE) => '(SignatureAst)
op = "CATEGORY" => '(CategoryAst)
op = "where" => '(WhereAst)
op = "[||]" => '(QuasiquoteAst)
$Syntax
--%
-- Convert an arbitrary lisp object to canonical boolean.
bool: %Thing -> %Boolean
bool x ==
null null x
++ Return true is the form `x' is a predicate known to always
++ evaluate to true.
TruthP x ==
x = nil or x = '%false => false
x = true or x = '%true => true
x is ['QUOTE,:.] => true
false
--% Record and Union utils.
stripUnionTags doms ==
[if dom is [":",.,dom'] then dom' else dom for dom in doms]
isTaggedUnion u ==
u is ['Union,:tl] and tl and first tl is [":",.,.] and true
getUnionOrRecordTags u ==
tags := nil
if u is ['Union, :tl] or u is ['Record, :tl] then
for t in tl repeat
if t is [":",tag,.] then tags := [tag, :tags]
tags
--% Various lispy things
Identity x == x
length1? l == cons? l and not cons? rest l
length2? l == cons? l and cons? (l := rest l) and not cons? rest l
pairList(u,v) == [[x,:y] for x in u for y in v]
-- GETALIST(alist,prop) == IFCDR assoc(prop,alist)
GETALIST(alist,prop) == rest assoc(prop,alist)
PUTALIST(alist,prop,val) ==
null alist => [[prop,:val]]
pair := assoc(prop,alist) =>
rest pair = val => alist
-- else we fall over Lucid's read-only storage feature again
pair.rest := val
alist
LASTPAIR(alist).rest := [[prop,:val]]
alist
REMALIST(alist,prop) ==
null alist => alist
alist is [[ =prop,:.],:r] =>
null r => NIL
alist.first := first r
alist.rest := rest r
alist
null rest alist => alist
l := alist
ok := true
while ok repeat
[.,[p,:.],:r] := l
p = prop =>
ok := NIL
l.rest := r
if null (l := rest l) or null rest l then ok := NIL
alist
deleteLassoc(x,y) ==
y is [[a,:.],:y'] =>
EQ(x,a) => y'
[first y,:deleteLassoc(x,y')]
y
--% association list functions
deleteAssoc(x,y) ==
y is [[a,:.],:y'] =>
a=x => deleteAssoc(x,y')
[first y,:deleteAssoc(x,y')]
y
deleteAssocWOC(x,y) ==
null y => y
[[a,:.],:t]:= y
x=a => t
(fn(x,y);y) where fn(x,y is [h,:t]) ==
t is [[a,:.],:t1] =>
x=a => y.rest := t1
fn(x,t)
nil
insertWOC(x,y) ==
null y => [x]
(fn(x,y); y) where fn(x,y is [h,:t]) ==
x=h => nil
null t =>
y.rest := [h,:t]
y.first := x
fn(x,t)
--% Miscellaneous Functions for Working with Strings
fillerSpaces(n,:charPart) ==
n <= 0 => '""
MAKE_-FULL_-CVEC(n,IFCAR charPart or '" ")
centerString(text,width,fillchar) ==
wid := entryWidth text
wid >= width => text
f := DIVIDE(width - wid,2)
fill1 := ""
for i in 1..(f.0) repeat
fill1 := strconc(fillchar,fill1)
fill2:= fill1
if f.1 ~= 0 then fill1 := strconc(fillchar,fill1)
[fill1,text,fill2]
stringPrefix?(pref,str) ==
-- sees if the first #pref letters of str are pref
-- replaces STRINGPREFIXP
null (string?(pref) and string?(str)) => NIL
(lp := QCSIZE pref) = 0 => true
lp > QCSIZE str => NIL
ok := true
i := 0
while ok and (i < lp) repeat
not EQ(SCHAR(pref,i),SCHAR(str,i)) => ok := NIL
i := i + 1
ok
stringChar2Integer(str,pos) ==
-- replaces GETSTRINGDIGIT in UT LISP
-- returns small integer represented by character in position pos
-- in string str. Returns NIL if not a digit or other error.
if IDENTP str then str := PNAME str
null (string?(str) and
integer?(pos) and (pos >= 0) and (pos < QCSIZE(str))) => NIL
not digit?(d := SCHAR(str,pos)) => NIL
DIG2FIX d
dropLeadingBlanks str ==
str := object2String str
l := QCSIZE str
nb := NIL
i := 0
while (i < l) and not nb repeat
if SCHAR(str,i) ~= char " " then nb := i
else i := i + 1
nb = 0 => str
nb => SUBSTRING(str,nb,NIL)
'""
concat(:l) == concatList l
concatList [x,:y] ==
null y => x
null x => concatList y
concat1(x,concatList y)
concat1(x,y) ==
null x => y
atom x => (null y => x; atom y => [x,y]; [x,:y])
null y => x
atom y => [:x,y]
[:x,:y]
--% BOOT ravel and reshape
ravel a == a
reshape(a,b) == a
--% Some functions for algebra code
boolODDP x == ODDP x
--% Miscellaneous
freeOfSharpVars x ==
atom x => not isSharpVarWithNum x
freeOfSharpVars first x and freeOfSharpVars rest x
listOfSharpVars x ==
atom x => (isSharpVarWithNum x => [x]; nil)
union(listOfSharpVars first x,listOfSharpVars rest x)
listOfPatternIds x ==
isPatternVar x => [x]
atom x => nil
x is ['QUOTE,:.] => nil
UNIONQ(listOfPatternIds first x,listOfPatternIds rest x)
isPatternVar v ==
-- a pattern variable consists of a star followed by a star or digit(s)
IDENTP(v) and v in '(_*_* _*1 _*2 _*3 _*4 _*5 _*6 _*7 _*8 _*9 _*10
_*11 _*12 _*13 _*14 _*15 _*16 _*17 _*18 _*19 _*20) and true
removeZeroOne x ==
-- replace all occurrences of (Zero) and (One) with
-- 0 and 1
x = $Zero => 0
x = $One => 1
atom x => x
[removeZeroOne first x,:removeZeroOne rest x]
removeZeroOneDestructively t ==
-- replace all occurrences of (Zero) and (One) with
-- 0 and 1 destructively
t = $Zero => 0
t = $One => 1
atom t => t
RPLNODE(t,removeZeroOneDestructively first t,
removeZeroOneDestructively rest t)
flattenSexpr s ==
null s => s
atom s => s
[f,:r] := s
atom f => [f,:flattenSexpr r]
[:flattenSexpr f,:flattenSexpr r]
isLowerCaseLetter c ==
lowerCase? c
isUpperCaseLetter c ==
upperCase? c
isLetter c ==
alphabetic? c
update() ==
runCommand
strconc(textEditor(), '" ",STRINGIMAGE _/VERSION,'" ",STRINGIMAGE _/WSNAME,'" A")
_/UPDATE()
--% Inplace Merge Sort for Lists
-- MBM April/88
-- listSort(pred,list) or listSort(pred,list,key)
-- the pred function is a boolean valued function defining the ordering
-- the key function extracts the key from an item for comparison by pred
listSort(pred,list,:optional) ==
NOT functionp pred => error "listSort: first arg must be a function"
NOT LISTP list => error "listSort: second argument must be a list"
null optional => mergeSort(pred,function Identity,list,# list)
key := first optional
NOT functionp key => error "listSort: last arg must be a function"
mergeSort(pred,key,list,# list)
-- non-destructive merge sort using NOT GGREATERP as predicate
MSORT list == listSort(function GLESSEQP, COPY_-LIST list)
-- destructive merge sort using NOT GGREATERP as predicate
NMSORT list == listSort(function GLESSEQP, list)
-- non-destructive merge sort using ?ORDER as predicate
orderList l == listSort(function _?ORDER, COPY_-LIST l)
-- dummy defn until clean-up
-- order l == orderList l
mergeInPlace(f,g,p,q) ==
-- merge the two sorted lists p and q
if null p then return p
if null q then return q
if FUNCALL(f,FUNCALL(g, first p),FUNCALL(g, first q))
then (r := t := p; p := rest p)
else (r := t := q; q := rest q)
while not null p and not null q repeat
if FUNCALL(f,FUNCALL(g,first p),FUNCALL(g,first q))
then (t.rest := p; t := p; p := rest p)
else (t.rest := q; t := q; q := rest q)
if null p then t.rest := q else t.rest := p
r
mergeSort(f,g,p,n) ==
if n=2 and FUNCALL(f,FUNCALL(g,second p),FUNCALL(g,first p)) then
t := p
p := rest p
p.rest := t
t.rest := NIL
if QSLESSP(n,3) then return p
-- split the list p into p and q of equal length
l := QSQUOTIENT(n,2)
t := p
for i in 1..l-1 repeat t := rest t
q := rest t
t.rest := NIL
p := mergeSort(f,g,p,l)
q := mergeSort(f,g,q,QSDIFFERENCE(n,l))
mergeInPlace(f,g,p,q)
--% Throwing with glorious highlighting (maybe)
spadThrow() ==
if $interpOnly and $mapName then
putHist($mapName,'localModemap, nil, $e)
THROW($SpadReaderTag,nil)
spadThrowBrightly x ==
sayBrightly x
spadThrow()
--% Type Formatting Without Abbreviation
formatUnabbreviatedSig sig ==
null sig => ['"() -> ()"]
[target,:args] := dollarPercentTran sig
target := formatUnabbreviated target
null args => ['"() -> ",:target]
null rest args => [:formatUnabbreviated first args,'" -> ",:target]
args := formatUnabbreviatedTuple args
['"(",:args,'") -> ",:target]
formatUnabbreviatedTuple t ==
-- t is a list of types
null t => t
atom t => [t]
t0 := formatUnabbreviated t.op
null rest t => t0
[:t0,'",",:formatUnabbreviatedTuple rest t]
formatUnabbreviated t ==
null t =>
['"()"]
atom t =>
[t]
t is [p,sel,arg] and p = ":" =>
[sel,'": ",:formatUnabbreviated arg]
t is ['Union,:args] =>
['Union,'"(",:formatUnabbreviatedTuple args,'")"]
t is ['Mapping,:args] =>
formatUnabbreviatedSig args
t is ['Record,:args] =>
['Record,'"(",:formatUnabbreviatedTuple args,'")"]
t is [arg] =>
t
t is [arg,arg1] =>
[arg,'" ",:formatUnabbreviated arg1]
t is [arg,:args] =>
[arg,'"(",:formatUnabbreviatedTuple args,'")"]
t
sublisNQ(al,e) ==
atom al => e
fn(al,e) where fn(al,e) ==
atom e =>
for x in al repeat
EQ(first x,e) => return (e := rest x)
e
EQ(a := first e,'QUOTE) => e
u := fn(al,a)
v := fn(al,rest e)
EQ(a,u) and EQ(rest e,v) => e
[u,:v]
opOf: %Thing -> %Thing
opOf x ==
atom x => x
first x
getProplist: (%Thing,%Env) -> %List
search: (%Thing,%Env) -> %List
searchCurrentEnv: (%Thing,%List) -> %List
searchTailEnv: (%Thing,%Env) -> %List
getProplist(x,E) ==
not atom x => getProplist(first x,E)
u:= search(x,E) => u
--$InteractiveMode => nil
--$InteractiveMode and (u:= search(x,$InteractiveFrame)) => u
(pl:=search(x,$CategoryFrame)) =>
pl
-- (pl:=PROPLIST x) => pl
-- Above line commented out JHD/BMT 2.Aug.90
search(x,e is [curEnv,:tailEnv]) ==
searchCurrentEnv(x,curEnv) or searchTailEnv(x,tailEnv)
searchCurrentEnv(x,currentEnv) ==
for contour in currentEnv repeat
if u:= ASSQ(x,contour) then return (signal:= u)
KDR signal
searchTailEnv(x,e) ==
for env in e repeat
signal:=
for contour in env repeat
if (u:= ASSQ(x,contour)) and ASSQ("FLUID",u) then return (signal:= u)
if signal then return signal
KDR signal
augProplist(proplist,prop,val) ==
$InteractiveMode => augProplistInteractive(proplist,prop,val)
while (proplist is [[ =prop,:.],:proplist']) repeat proplist:= proplist'
val=(u:= LASSOC(prop,proplist)) => proplist
null val =>
null u => proplist
DELLASOS(prop,proplist)
[[prop,:val],:proplist]
augProplistOf(var,prop,val,e) ==
proplist:= getProplist(var,e)
semchkProplist(var,proplist,prop,val)
augProplist(proplist,prop,val)
semchkProplist(x,proplist,prop,val) ==
prop="isLiteral" =>
LASSOC("value",proplist) or LASSOC("mode",proplist) => warnLiteral x
prop in '(mode value) =>
LASSOC("isLiteral",proplist) => warnLiteral x
addBinding(var,proplist,e is [[curContour,:tailContour],:tailEnv]) ==
EQ(proplist,getProplist(var,e)) => e
$InteractiveMode => addBindingInteractive(var,proplist,e)
if curContour is [[ =var,:.],:.] then curContour:= rest curContour
--Previous line should save some space
[[[lx,:curContour],:tailContour],:tailEnv] where lx:= [var,:proplist]
addBindingInteractive(var,proplist,e is [[curContour,:.],:.]) ==
-- change proplist of var in e destructively
u := ASSQ(var,curContour) =>
u.rest := proplist
e
first(e).first := [[var,:proplist],:curContour]
e
augProplistInteractive(proplist,prop,val) ==
u := ASSQ(prop,proplist) =>
u.rest := val
proplist
[[prop,:val],:proplist]
position(x,l) ==
posn(x,l,0) where
posn(x,l,n) ==
null l => -1
x=first l => n
posn(x,rest l,n+1)
insert(x,y) ==
member(x,y) => y
[x,:y]
after(u,v) ==
r:= u
for x in u for y in v repeat r:= rest r
r
$blank == char ('_ )
trimString s ==
leftTrim rightTrim s
leftTrim s ==
k := MAXINDEX s
k < 0 => s
s.0 = $blank =>
for i in 0..k while s.i = $blank repeat (j := i)
SUBSTRING(s,j + 1,nil)
s
rightTrim s == -- assumed a non-empty string
k := MAXINDEX s
k < 0 => s
s.k = $blank =>
for i in k..0 by -1 while s.i = $blank repeat (j := i)
SUBSTRING(s,0,j)
s
pp x ==
PRETTYPRINT x
x
pr x ==
F_,PRINT_-ONE x
nil
quickAnd(a,b) ==
a = true => b
b = true => a
a = false or b = false => false
simpBool ['AND,a,b]
quickOr(a,b) ==
a = true or b = true => true
b = false => a
a = false => b
simpCatPredicate simpBool ['OR,a,b]
intern x ==
string? x =>
digit? x.0 => string2Integer x
INTERN x
x
isDomain a ==
cons? a and VECP(first a) and
member(first a.0, $domainTypeTokens)
-- variables used by browser
$htHash := MAKE_-HASH_-TABLE()
$glossHash := MAKE_-HASH_-TABLE()
$lispHash := MAKE_-HASH_-TABLE()
$sysHash := MAKE_-HASH_-TABLE()
$htSystemCommands := '(
(boot . development) clear display (fin . development) edit help
frame history load quit read set show synonym system
trace what )
$currentSysList := [opOf x for x in $htSystemCommands] --see ht-root
$outStream := nil
$recheckingFlag := false --see transformAndRecheckComments
$exposeFlag := false --if true, messages go to $outStream
$exposeFlagHeading := false --see htcheck.boot
$checkingXmptex? := false --see htcheck.boot
$exposeDocHeading:= nil --see htcheck.boot
$charPlus == char '_+
$charBlank == (char '_ )
$charLbrace == char '_{
$charRbrace == char '_}
$charBack == char '_\
$charDash == char '_-
$charTab == CODE_-CHAR(9)
$charNewline == CODE_-CHAR(10)
$charFauxNewline == CODE_-CHAR(25)
$stringNewline == PNAME CODE_-CHAR(10)
$stringFauxNewline == PNAME CODE_-CHAR(25)
$charExclusions == [char 'a, char 'A]
$charQuote == char '_'
$charSemiColon == char '_;
$charComma == char '_,
$charPeriod == char '_.
$checkPrenAlist := [[char '_(,:char '_)],[char '_{,:char '_}],[char '_[,:char '_]]]
$charEscapeList:= [char '_%,char '_#,$charBack]
$charIdentifierEndings := [char '__, char '_!, char '_?]
$charSplitList := [$charComma,$charPeriod,char '_[, char '_],$charLbrace, $charRbrace, char '_(, char '_), char '_$, char '_%]
$charDelimiters := [$charBlank, char '_(, char '_), $charBack]
$HTspadmacros := '("\spadtype" "\spadcommand" "\spadop" "\spadfun" "\spadatt" "\spadsyscom" "\spad" "\s")
$HTmacs := [
['"\beginmenu",$charRbrace,'"menu",$charLbrace,'"\begin"],
['"\endmenu",$charRbrace,'"menu",$charLbrace,'"\end"],
['"\beginitems",$charRbrace,'"items",$charLbrace,'"\begin"],
['"\enditems",$charRbrace,'"items",$charLbrace,'"\end"],
['"\beginscroll",$charRbrace,'"scroll",$charLbrace,'"\begin"],
['"\endscroll",$charRbrace,'"scroll",$charLbrace,'"\end"]]
$HTlinks := '(
"\downlink"
"\menulink"
"\menudownlink"
"\menuwindowlink"
"\menumemolink")
$HTlisplinks := '(
"\lispdownlink"
"\menulispdownlink"
"\menulispwindowlink"
"\menulispmemolink"
"\lispwindowlink"
"\lispmemolink")
$beginEndList := '(
"page"
"items"
"menu"
"scroll"
"verbatim"
"detail")
isDefaultPackageName x == (s := PNAME x).(MAXINDEX s) = char '_&
-- gensym utils
charDigitVal c ==
digits := '"0123456789"
n := -1
for i in 0..#digits-1 while n < 0 repeat
if c = digits.i then n := i
n < 0 => error '"Character is not a digit"
n
gensymInt g ==
not GENSYMP g => error '"Need a GENSYM"
p := PNAME g
n := 0
for i in 2..#p-1 repeat n := 10 * n + charDigitVal p.i
n
++ Returns a newly allocated domain shell (a simple vector) of length `n'.
newShell: %Short -> SIMPLE_-ARRAY
newShell n ==
MAKE_-ARRAY(n,KEYWORD::INITIAL_-ELEMENT,nil)
++ fetchs the item in the nth entry of a domain shell.
getShellEntry: (%Shell,%Short) -> %Thing
getShellEntry(s,i) ==
SVREF(s,i)
++ sets the nth nth entry of a domain shell to an item.
setShellEntry: (%Shell,%Short,%Thing) -> %Thing
setShellEntry(s,i,t) ==
SETF(SVREF(s,i),t)
-- Push into the BOOT package when invoked in batch mode.
AxiomCore::$sysScope := '"BOOT"
|