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
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
|
;; Copyright (c) 1991-2002, The Numerical Algorithms Group Ltd.
;; All rights reserved.
;; Copyright (C) 2007-2012, 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-MODULE "types")
(import-module "sys-globals")
; VM LISP EMULATION PACKAGE
; Lars Ericson, Barry Trager, Martial Schor, tim daly, LVMCL, et al
; IBM Thomas J. Watson Research Center
; Summer, 1986
; see /spad/daly.changes
; This emulation package version is written for Symbolics Common Lisp.
; Emulation commentary refers to LISP/VM, IBM Program Number 5798-DQZ,
; as described in the LISP/VM User's Guide, document SH20-6477-1.
; Main comment section headings refer to sections in the User's Guide.
; If you are using this, you are probably in Common Lisp, yes?
(in-package "BOOT")
;; DEFVARS
(defvar *comp370-apply* nil "function (name def) for comp370 to apply")
(defvar *embedded-functions* nil)
(defvar *fileactq-apply* nil "function to apply in fileactq")
(defvar *lam-name* nil "name to be used by lam macro if non-nil")
(defvar macerrorcount 0 "Put some documentation in here someday")
(defvar *read-place-holder* (make-symbol "%.EOF")
"default value returned by read and read-line at end-of-file")
;; DEFMACROS
(defmacro applx (&rest args)
`(apply ,@args))
(defmacro closedfn (form)
`(function ,form))
(defmacro dcq (&rest args)
(cons 'setqp args))
(defmacro difference (&rest args)
`(- ,@args))
(defmacro dsetq (&whole form pattern exp)
(dodsetq form pattern exp))
(defmacro ecq (&rest args)
(cons 'eqq args))
;;def needed to prevent recursion in def of eqcar
(eval-when
#+:common-lisp (:compile-toplevel :load-toplevel :execute)
#-:common-lisp (compile load eval)
(defun equable (x)
(or (null x)
(and (consp x) (eq (car x) 'quote)
(symbolp (cadr x))))))
(defmacro eqcar (x y)
(let ((test
(cond
((equable y) 'eq)
((integerp y) 'i=)
('eql))))
(if (atom x)
`(and (consp ,x) (,test (qcar ,x) ,y))
(let ((xx (gensym)))
`(let ((,xx ,x))
(and (consp ,xx) (,test (qcar ,xx) ,y)))))))
(defmacro eqq (pattern exp)
`(,(ecqexp pattern nil) ,exp))
(defmacro |equal| (x y)
`(equalp ,x ,y))
(defmacro evalandfileactq (name &optional (form name))
`(eval-when
#+:common-lisp (:load-toplevel :execute)
#-:common-lisp (eval load)
,form))
(defmacro exit (&rest value)
`(return-from seq ,@value))
(defmacro fetchchar (x i)
`(char ,x ,i))
(defmacro greaterp (&rest args)
`(> ,@args))
(defmacro i= (x y) ;; integer equality
(if (typep y 'fixnum)
(let ((gx (gensym)))
`(let ((,gx ,x))
(and (typep ,gx 'fixnum) (eql (the fixnum ,gx) ,y))))
(let ((gx (gensym)) (gy (gensym)))
`(let ((,gx ,x) (,gy ,y))
(cond ((and (typep ,gx 'fixnum) (typep ,gy 'fixnum))
(eql (the fixnum ,gx) (the fixnum ,gy)))
((eql (the integer ,gx) (the integer,gy))))))))
(defmacro |idChar?| (x)
`(or (alphanumericp ,x) (member ,x '(#\? #\% #\' #\!) :test #'char=)))
(defmacro ifcar (x)
(if (atom x)
`(and (consp ,x) (qcar ,x))
(let ((xx (gensym)))
`(let ((,xx ,x))
(and (consp ,xx) (qcar ,xx))))))
(defmacro ifcdr (x)
(if (atom x)
`(and (consp ,x) (qcdr ,x))
(let ((xx (gensym)))
`(let ((,xx ,x))
(and (consp ,xx) (qcdr ,xx))))))
(defmacro lam (&rest body)
(list 'quote (*lam (copy-tree body))))
(defmacro maxindex (x)
`(the fixnum (1- (the fixnum (length ,x)))))
(defmacro minus (x)
`(- ,x))
(defmacro ne (a b) `(not (equal ,a ,b)))
(defmacro plus (&rest args)
`(+ ,@ args))
(defmacro qcar (x)
`(car (the cons ,x)))
(defmacro qcdr (x)
`(cdr (the cons ,x)))
(defmacro qcaar (x)
`(car (the cons (car (the cons ,x)))))
(defmacro qcadr (x)
`(car (the cons (cdr (the cons ,x)))))
(defmacro qcdar (x)
`(cdr (the cons (car (the cons ,x)))))
(defmacro qcddr (x)
`(cdr (the cons (cdr (the cons ,x)))))
(defmacro qcaaar (x)
`(car (the cons (car (the cons (car (the cons ,x)))))))
(defmacro qcaadr (x)
`(car (the cons (car (the cons (cdr (the cons ,x)))))))
(defmacro qcadar (x)
`(car (the cons (cdr (the cons (car (the cons ,x)))))))
(defmacro qcaddr (x)
`(car (the cons (cdr (the cons (cdr (the cons ,x)))))))
(defmacro qcdaar (x)
`(cdr (the cons (car (the cons (car (the cons ,x)))))))
(defmacro qcdadr (x)
`(cdr (the cons (car (the cons (cdr (the cons ,x)))))))
(defmacro qcddar (x)
`(cdr (the cons (cdr (the cons (car (the cons ,x)))))))
(defmacro qcdddr (x)
`(cdr (the cons (cdr (the cons (cdr (the cons ,x)))))))
(defmacro qeqq (pattern exp)
`(,(ecqexp pattern 1) ,exp))
(defmacro qrplaca (a b)
`(rplaca (the cons ,a) ,b))
(defmacro qrplacd (a b)
`(rplacd (the cons ,a) ,b))
(defmacro qrplq (&whole form pattern exp)
(if (or (consp pattern) (simple-vector-p pattern))
`(,(rcqexp pattern) ,exp)
(macro-invalidargs 'qrplq form "form must be updateable.")))
(defmacro resetq (a b)
`(prog1 ,a (setq ,a ,b)))
(defmacro rplq (&whole form exp pattern)
(if (or (consp pattern) (simple-vector-p pattern))
`(,(rcqexp pattern) ,exp)
(macro-invalidargs 'rplq form "form must be updateable.")))
(defmacro rvecp (v)
`(typep ,v '(vector float)))
(defmacro setandfileq (id item)
`(eval-when
#+:common-lisp (:load-toplevel :execute)
#-:common-lisp (eval load)
(setq ,id ,item)
(lam\,fileactq ',id (list 'setq ',id (list 'quote ,id)))))
(defmacro setqp (&whole form pattern exp)
`(,(dcqexp pattern '=) ,exp))
(defmacro seq (&rest form)
(let* ((body (|reverse| form))
(val `(return-from seq ,(pop body))))
(|substitute!| '(progn) nil body) ;don't treat NIL as a label
`(block seq (tagbody ,@(|reverse!| body) ,val))))
(defmacro subrp (x)
`(compiled-function-p ,x))
(defmacro throw-protect (exp1 exp2)
`(unwind-protect ,exp1 ,exp2))
(defmacro times (&rest args)
`(* ,@args))
;; defuns
(define-function 'tempus-fugit #'get-internal-run-time)
(defun $TOTAL-ELAPSED-TIME ()
(list (get-internal-run-time) (get-internal-real-time)))
#-(OR IBCL KCL :CMULISP)
(defun $TOTAL-GC-TIME () (list 0 0))
#+IBCL
(defun $TOTAL-GC-TIME (&aux (gcruntime (system:gbc-time-report)))
(list gcruntime gcruntime))
#+KCL
(defun $TOTAL-GC-TIME (&aux (gcruntime (system:gbc-time)))
(if (minusp gcruntime)
(setq gcruntime (system:gbc-time 0)))
(list gcruntime gcruntime))
;;; note: this requires the 11/9/89 gc patch in code/lisp/daly/misc.lisp
#+:cmulisp
(defun $TOTAL-GC-TIME ()
(declare (special ext::*gc-runtime* ext::*gc-walltime*))
(list ext::*gc-runtime* ext::*gc-walltime*))
; 7.0 Macros
; 7.2 Creating Macro Expressions
; 5.2 Functions
; 5.2.2 Lambda Expressions
(defun *LAM (body)
(cond ((NOT (ISQUOTEDP (first BODY))) (cons 'LAMBDA BODY))
((LET* ((BV (DEQUOTE (first BODY)))
(CONTROL (QUOTESOF (first BODY)))
(BODY (cdr BODY))
(ARGS (GENSYM))
(INNER-FUNC (or *lam-name* (gentemp))))
(COMP370 (LIST INNER-FUNC `(LAMBDA ,BV . ,BODY)))
`(MLAMBDA ,ARGS
(CONS (QUOTE ,INNER-FUNC)
(WRAP (cdr ,ARGS) ',CONTROL)))))))
(defun WRAP (LIST-OF-ITEMS WRAPPER)
(prog nil
(COND ((OR (NOT (CONSP LIST-OF-ITEMS)) (not WRAPPER))
(RETURN LIST-OF-ITEMS))
((NOT (consp WRAPPER))
(SETQ WRAPPER (LOTSOF WRAPPER))))
(RETURN
(CONS (if (first WRAPPER)
`(,(first WRAPPER) ,(first LIST-OF-ITEMS))
(first LIST-OF-ITEMS))
(WRAP (cdr LIST-OF-ITEMS) (cdr WRAPPER))))))
(defun ISQUOTEDP (bv)
(COND ((NOT (consp BV)) NIL)
((EQ (first BV) 'QUOTE))
((AND (consp (first BV)) (EQ (QCAAR BV) 'QUOTE)))
((ISQUOTEDP (cdr BV)))))
(defun QUOTESOF (BV)
(COND ((NOT (consp BV)) NIL)
((EQ (first BV) 'QUOTE) 'QUOTE)
((CONS (COND ((NOT (consp (first BV))) nil)
((EQ (QCAAR BV) 'QUOTE) 'QUOTE)
(T NIL))
(QUOTESOF (cdr BV))))))
(defun DEQUOTE (BV)
(COND ((NOT (consp BV)) BV)
((EQ 'QUOTE (first BV)) (second BV))
((CONS (if (EQ 'QUOTE (IFCAR (CAR BV))) (CADAR BV) (first BV))
(DEQUOTE (cdr BV))))))
(defun lotsof (&rest items)
(setq items (|copyList| items))
(|append!| items items))
; 7.4 Using Macros
; Beats me how to simulate macro expansion "in the environment of sd"...:
(defun MDEF (arg item &optional sd)
(declare (ignore sd))
(macroexpand `(,arg ,item)))
; 8.0 Operator Definition and Transformation
; 8.1 Definition and Transformation Operations
(defun COMP370 (fnlist)
(cond ((atom (car fnlist)) (list (COMPILE1 fnlist)))
(t (MAPCAR #'(lambda (x) (COMPILE1 x)) fnlist))))
(defun |compileLispDefinition| (name def)
(when *COMP370-APPLY*
(funcall *COMP370-APPLY* name def)))
(defun COMPILE1 (fn)
(let* (nargs
(fname (car fn))
(lamda (cadr fn))
(ltype (car lamda))
*vars* *decl* args
(body (cddr lamda)))
(declare (special *vars* *decl*))
(if (eq ltype 'LAM)
(let ((*lam-name* (intern (concat fname "\,LAM"))))
(setq lamda (eval lamda) ltype (car lamda) body (cddr lamda))))
(let ((dectest (car body)))
(if (and (eqcar dectest 'declare) (eqcar (cadr dectest) 'special))
(setq *decl* (cdr (cadr dectest)) body (cdr body))))
(setq args (remove-fluids (cadr lamda)))
(cond ((and (eq ltype 'lambda) (simple-arglist args)) (setq nargs args))
(t (setq nargs (gensym))
(setq body `((dsetq ,args ,nargs) ,@body))
(cond ((eq ltype 'lambda) (setq nargs `(&rest ,nargs &aux ,@*vars*)))
((eq ltype 'mlambda)
(setq nargs `(&whole ,nargs &rest ,(gensym) &aux ,@*vars*)))
(t (error "bad function type")))))
(cond (*decl* (setq body (cons `(declare (special ,@ *decl*)) body))))
(setq body
(cond ((eq ltype 'lambda) `(defun ,fname ,nargs . ,body))
((eq ltype 'mlambda) `(defmacro ,fname ,nargs . ,body))))
(|compileLispDefinition| fname body)
body))
(defun simple-arglist (arglist)
(or (null arglist)
(and (consp arglist) (null (cdr (last arglist)))
(every #'symbolp arglist))))
(defun remove-fluids (arglist &aux f v) ;updates specials *decl* and *vars*
(declare (special *decl* *vars*))
(cond ((null arglist) arglist)
((symbolp arglist) (push arglist *vars*) arglist)
;if atom but not symbol, ignore value
((atom arglist) (push (setq arglist (gentemp)) *vars*) arglist)
((and (setq f (car arglist))
(eq f 'fluid)
(listp (cdr arglist))
(setq v (cadr arglist))
(|ident?| v)
(null (cddr arglist)))
(push v *decl*)
(push v *vars*)
v)
(t (cons (remove-fluids (car arglist))
(remove-fluids (cdr arglist))))))
; 9.4 Vectors and Bpis
(defun IVECP (x) (and (vectorp x) (subtypep (array-element-type x) 'integer)))
(defun mbpip (item) (and (symbolp item) ;cannot know a compiled macro in CLISP
(compiled-function-p (macro-function item))))
(defun FBPIP (item) (or (compiled-function-p item)
(and (symbolp item) (fboundp item)
(not (macro-function item))
(compiled-function-p (symbol-function item)))))
; 9.5 Identifiers
(defun digitp (x)
(or (and (symbolp x) (digitp (symbol-name x)))
(and (characterp x) (digit-char-p x))
(and (stringp x) (= (length x) 1) (digit-char-p (char x 0)))))
(defun dig2fix (x)
(if (symbolp x)
(digit-char-p (char (symbol-name x) 0))
(digit-char-p x)))
(defun LN (x) (LOG x))
(defun LOG2 (x) (LOG x 2.0))
(defun |log| (x) (LOG x 10.0))
; 9.13 Streams
#+KCL
(defun IS-CONSOLE (stream)
(and (streamp stream) (output-stream-p stream)
(eq (system:fp-output-stream stream)
(system:fp-output-stream *terminal-io*))))
#-KCL
(defun IS-CONSOLE (stream)
(cond ((not (streamp stream))
nil)
((not (typep stream 'synonym-stream))
nil)
((eq (synonym-stream-symbol stream) '*standard-input*)
(|stdStreamIsTerminal| 0))
((eq (synonym-stream-symbol stream) '*standard-output*)
(|stdStreamIsTerminal| 1))))
; 10.0 Control Structures
; 10.8.4 Auxiliary Operators
(defun nilfn (&rest ignore)
(declare (ignore ignore))
())
; 11.0 Operations on Identifiers
; 11.1 Creation
(defun upcase (l)
(cond ((stringp l) (string-upcase l))
((|ident?| l) (intern (string-upcase (symbol-name l))))
((characterp l) (char-upcase l))
((atom l) l)
(t (mapcar #'upcase l))))
(define-function 'U-CASE #'upcase)
(define-function 'LC2UC #'upcase)
(defun downcase (l)
(cond ((stringp l) (string-downcase l))
((|ident?| l) (intern (string-downcase (symbol-name l))))
((characterp l) (char-downcase L))
((atom l) l)
(t (mapcar #'downcase l))))
(define-function 'L-CASE #'downcase)
; 11.2 Accessing
;; note it is important that PNAME returns nil not an error for non-symbols
(defun pname (x)
(cond ((symbolp x) (symbol-name x))
((characterp x) (string x))
(t nil)))
;; property lists in vmlisp are alists
(defun PROPLIST (x)
(if (symbolp x)
(plist2alist (symbol-plist x))
nil))
(defun plist2alist (x)
(if (null x)
nil
(cons (cons (first x) (second x)) (plist2alist (cddr x)))))
(eval-when
#+:common-lisp (:compile-toplevel :load-toplevel :execute)
#-:common-lisp (compile load eval)
(progn
(defun put (sym ind val) (setf (get sym ind) val))
(define-function 'MAKEPROP #'put)))
; 12.0 Operations on Numbers
; 12.1 Conversion
(define-function 'FIX #'truncate)
(define-function 'INT2RNUM #'float)
; 12.3 Computation
(defun QUOTIENT (x y)
(cond ((or (floatp x) (floatp y)) (/ x y))
(t (truncate x y))))
(define-function 'vm/ #'quotient)
(defun REMAINDER (x y)
(if (and (integerp x) (integerp y))
(rem x y)
(- x (* y (QUOTIENT x y)))))
(defun DIVIDE (x y)
(if (and (integerp x) (integerp y))
(multiple-value-list (truncate x y))
(list (QUOTIENT x y) (REMAINDER x y))))
; 13.3 Updating
(defun RPLPAIR (pair1 pair2)
(RPLACA pair1 (CAR pair2))
(RPLACD pair1 (CDR pair2)) pair1)
(defun RPLNODE (pair1 ca2 cd2)
(RPLACA pair1 ca2)
(RPLACD pair1 cd2) pair1)
; 14.0 Operations on Lists
; 14.1 Creation
(defun VEC2LIST (vec) (coerce vec 'list))
(defun |member| (item sequence)
(cond ((symbolp item) (member item sequence :test #'eq))
((stringp item) (member item sequence :test #'equal))
((and (atom item) (not (arrayp item))) (member item sequence))
(T (member item sequence :test #'equalp))))
; 14.3 Searching
(DEFUN |assoc| (X Y)
"Return the pair associated with key X in association list Y."
; ignores non-nil list terminators
; ignores non-pair a-list entries
(cond ((symbolp X) (|symbolAssoc| X Y))
((or (numberp x) (characterp x))
(|scalarAssoc| X Y))
(t
(PROG NIL
A (COND ((ATOM Y) (RETURN NIL))
((NOT (consp (CAR Y))) )
((EQUAL (CAAR Y) X) (RETURN (CAR Y))) )
(SETQ Y (CDR Y))
(GO A)))))
; 16.0 Operations on Vectors
; 16.1 Creation
(defun GETREFV (n)
(make-array n :initial-element nil))
(defun LIST2VEC (list)
(if (consp list)
(make-array (list-length list) :initial-contents list)
(coerce list 'vector)))
; 16.2 Accessing
;; Oddly, LENGTH is more efficient than LIST-LENGTH in CCL, since the former
;; is compiled and the latter is byte-coded!
(defun size (l)
(cond ((vectorp l) (length l))
((consp l) (list-length l))
(t 0)))
(define-function 'MOVEVEC #'replace)
; 17.0 Operations on Character and Bit Vectors
(defun charp (a) (or (characterp a)
(and (|ident?| a) (= (length (symbol-name a)) 1))))
(defun NUM2CHAR (n) (code-char n))
(defun CHAR2NUM (c) (char-code (character c)))
;; Returns truthvalue (nil or t) if s1 compares lexicographically
;; greater than s2. Note: It is essential that this function returns
;; a canonical Boolean value because parts of the system use it in
;; contexts where generalized Boolean values are confusing.
(defun CGREATERP (s1 s2)
(cond ((string> (string s1) (string s2)) t)))
(define-function 'STRGREATERP #'CGREATERP)
; 17.1 Creation
(define-function 'strconc #'concat)
(defun make-cvec (sint) (make-array sint :fill-pointer 0 :element-type 'character))
(define-function 'getstr #'make-cvec)
; 17.2 Accessing
(defun string2id-n (cvec sint)
(if (< sint 1)
nil
(let ((start (position-if-not #'(lambda (x) (char= x #\Space)) cvec)))
(if start
(let ((end (or (position #\Space cvec :start start) (length cvec))))
(if (= sint 1)
(intern (subseq cvec start end))
(string2id-n (subseq cvec end) (1- sint))))
0))))
(defun substring (cvec start length)
(setq cvec (string cvec))
(if length (subseq cvec start (+ start length)) (subseq cvec start)))
; 17.3 Searching
(defun strpos (what in start dontcare)
(setq what (string what) in (string in))
(if dontcare (progn (setq dontcare (character dontcare))
(search what in :start2 start
:test #'(lambda (x y) (or (eql x dontcare)
(eql x y)))))
(if (= start 0)
(search what in)
(search what in :start2 start))
))
; In the following, table should be a string:
(defun strposl (table cvec sint item)
(setq cvec (string cvec))
(if (not item)
(position table cvec :test #'(lambda (x y) (position y x)) :start sint)
(position table cvec :test-not #'(lambda (x y) (position y x)) :start sint)))
; 17.4 Updating operators
(defun suffix (id cvec)
"Suffixes the first char of the symbol or char ID to the string CVEC,
changing CVEC."
(unless (characterp id) (setq id (elt (string id) 0)))
(cond ((array-has-fill-pointer-p cvec)
(vector-push-extend id cvec)
cvec)
((adjustable-array-p cvec)
(let ((l (length cvec)))
(adjust-array cvec (1+ l))
(setf (elt cvec l) id)
cvec))
(t (concat cvec id))))
(defun setsize (vector size) (adjust-array vector size))
(defun trimstring (x) x)
;;-- (defun rplacstr (cvec1 start1 length1 cvec2
;;-- &optional (start2 0) (length2 nil)
;;-- &aux end1 end2)
;;-- (setq cvec2 (string cvec2))
;;-- (if (null start1) (setq start1 0))
;;-- (if (null start2) (setq start2 0))
;;-- (if (null length1) (setq length1 (- (length cvec1) start1)))
;;-- (if (null length2) (setq length2 (- (length cvec2) start2)))
;;-- (if (numberp length1) (setq end1 (+ start1 length1)))
;;-- (if (numberp length2) (setq end2 (+ start2 length2)))
;;-- (if (/= length1 length2)
;;-- (concatenate 'string (subseq cvec1 0 start1)
;;-- (subseq cvec2 start2 end2)
;;-- (subseq cvec1 end1))
;;-- (replace cvec1 cvec2 :start1 start1 :end1 end1
;;-- :start2 start2 :end2 end2)))
; The following version has been provided to avoid reliance on the
; Common Lisp concatenate and replace functions. These built-in Lisp
; functions would probably end up doing the character-by-character
; copying shown here, but would also need to cope with generic sorts
; of sequences and unwarranted keyword generality
(defun rplacstr (cvec1 start1 length1 cvec2
&optional start2 length2
&aux end1 end2)
(setq cvec2 (string cvec2))
(if (null start1) (setq start1 0))
(if (null start2) (setq start2 0))
(if (null length1) (setq length1 (- (length cvec1) start1)))
(if (null length2) (setq length2 (- (length cvec2) start2)))
(setq end1 (+ start1 length1))
(setq end2 (+ start2 length2))
(if (= length1 length2)
(do ()
((= start1 end1) cvec1)
(setf (aref cvec1 start1) (aref cvec2 start2))
(setq start1 (1+ start1))
(setq start2 (1+ start2)))
(let* ((l1 (length cvec1))
(r (make-string (- (+ l1 length2) length1)))
(i 0))
(do ((j 0 (1+ j)))
((= j start1))
(setf (aref r i) (aref cvec1 j))
(setq i (1+ i)))
(do ((j start2 (1+ j)))
((= j end2))
(setf (aref r i) (aref cvec2 j))
(setq i (1+ i)))
(do ((j end1 (1+ j)))
((= j l1))
(setf (aref r i) (aref cvec1 j))
(setq i (1+ i)))
r)
))
; 19.0 Operations on Arbitrary Objects
; 19.1 Creating
(defun MSUBST (new old tree) (subst new old tree :test #'equal))
; note subst isn't guaranteed to copy
(defun |nsubst| (new old tree) (nsubst new old tree :test #'equal))
(defun copy (x) (copy-tree x)) ; not right since should descend vectors
; Gen code for SETQP expr
(eval-when
#+:common-lisp (:compile-toplevel :load-toplevel :execute)
#-:common-lisp (compile load eval)
(defun DCQEXP (FORM EQTAG)
(PROG (SV pvl avl CODE)
(declare (special pvl avl))
(setq SV (GENSYM))
(setq CODE (DCQGENEXP SV FORM EQTAG NIL))
(RETURN
`(LAMBDA (,sv)
(PROG ,pvl
,@code
(RETURN 'true)
BAD (RETURN NIL) ) ))))
)
; Generate Expr code for DCQ
(eval-when
#+:common-lisp (:compile-toplevel :load-toplevel :execute)
#-:common-lisp (compile load eval)
(defun DCQGENEXP (SV FORM EQTAG QFLAG)
(PROG (D A I L C W)
(declare (special pvl avl))
(COND ((EQ FORM SV) (RETURN NIL))
((|ident?| FORM) (RETURN `((setq ,form ,sv)) ))
((simple-vector-p FORM)
(RETURN (SEQ
(setq L (length FORM))
(IF (EQ L 0)
(RETURN (COND ((NULL QFLAG)
`((cond ((not (simple-vector-p ,sv)) (go bad))))))))
(setq I (1- L))
LP (setq A (elt FORM I))
(COND ((AND (NULL W) (OR (consp A) (simple-vector-p A)))
(COND ((consp AVL) (setq W (car (RESETQ AVL (cdr AVL)))))
((setq PVL (CONS (setq W (GENSYM)) PVL))))))
(setq C (|append!| (COND ((|ident?| A) `((setq ,a (ELT ,sv ,i))))
((OR (consp A) (simple-vector-p A))
`((setq ,w (ELT ,sv ,i))
,@(dcqgenexp w a eqtag qflag))))
C))
(if (EQ I 0) (GO RET))
(setq I (1- I))
(GO LP)
RET (if W (setq AVL (CONS W AVL)))
(COND ((NULL QFLAG)
`((COND ((OR (NOT (simple-vector-p ,sv)) (< (length ,sv) ,l))
(GO BAD)))
,@c))
('T C)))))
((NOT (consp FORM)) (RETURN NIL))
((AND EQTAG (EQ (car FORM) EQTAG))
(RETURN
(COND
((OR (NOT (EQ 3 (LENGTH FORM))) (NOT (|ident?| (car (setq FORM (cdr FORM))))))
(MACRO-INVALIDARGS 'DCQ\/QDCQ FORM "invalid pattern."))
(`((setq ,(car form) ,sv) ,@(DCQGENEXP SV (CADR FORM) EQTAG QFLAG)))))))
(setq A (car FORM))
(setq D (cdr FORM))
(setq C (COND ((|ident?| A) `((setq ,a (CAR ,sv))))
((OR (consp A) (simple-vector-p A))
(COND ((AND (NULL D) (|ident?| SV)) )
((COND ((consp AVL) (setq W (car (RESETQ AVL (cdr AVL)))))
((setq PVL (CONS (setq W (GENSYM)) PVL)) ) ) ) )
(COND ((AND (consp A) EQTAG (EQ (car A) EQTAG))
(DCQGENEXP (LIST 'CAR SV) A EQTAG QFLAG) )
(`((setq ,(or w sv) (CAR ,sv))
,@(DCQGENEXP (OR W SV) A EQTAG QFLAG)))))))
(setq C (|append!| C (COND ((|ident?| D) `((setq ,d (CDR ,sv))))
((OR (consp D) (simple-vector-p D))
(COND
((OR W (|ident?| SV)) )
((COND ((consp AVL)
(setq W (car (RESETQ AVL (cdr AVL)))) )
((setq PVL (CONS (setq W (GENSYM)) PVL)) ) ) ) )
(COND ((AND (consp D) EQTAG (EQ (car D) EQTAG))
(DCQGENEXP (LIST 'CDR SV) D EQTAG QFLAG) )
(`((setq ,(or w sv) (CDR ,sv))
,@(DCQGENEXP (OR W SV) D EQTAG QFLAG))))))))
(COND (W (setq AVL (CONS W AVL))))
(RETURN (COND ((NULL QFLAG) `((COND ((ATOM ,sv) (GO BAD))) ,@c)) (C)))))
)
; 19.3 Searching
; Generate code for EQQ
(eval-when
#+:common-lisp (:compile-toplevel :load-toplevel :execute)
#-:common-lisp (compile load eval)
(defun ECQEXP (FORM QFLAG)
(PROG (SV PVL CODE)
(declare (special pvl))
(setq SV (GENSYM))
(setq CODE (ECQGENEXP SV FORM QFLAG))
(RETURN
`(LAMBDA (,sv)
(PROG ,pvl
,@code
(RETURN 'true)
BAD (RETURN NIL) ) ))))
)
; Generate code for EQQ innards
(eval-when
#+:common-lisp (:compile-toplevel :load-toplevel :execute)
#-:common-lisp (compile load eval)
(defun ECQGENEXP (SV FORM QFLAG)
(PROG (D A I L C W)
(declare (special pvl))
(COND
((EQ FORM SV) (RETURN NIL))
((OR
(|ident?| FORM)
(INTEGERP FORM)
(AND (consp FORM) (EQ (qcar FORM) 'QUOTE)))
(RETURN
`((COND ((NOT (EQ ,form ,sv)) (GO BAD))) )))
((simple-vector-p FORM)
(RETURN (SEQ
(setq L (length FORM))
(if (EQ L 0)
(RETURN
(COND ((NULL QFLAG)
`((COND ((NOT (simple-vector-p ,sv)) (GO BAD))) )))
))
(setq I (1- L))
LP (setq A (elt FORM I))
(if (AND (NULL W) (OR (consp A) (simple-vector-p A)))
(push (setq W (GENSYM)) PVL))
(setq C
(|append!|
(COND
( (OR
(|ident?| A)
(INTEGERP A)
(AND (consp A) (EQ (qcar A) 'QUOTE)))
`((COND ( (NOT (EQ ,a (ELT ,sv ,i)))
(GO BAD) ) ) ) )
( (OR (consp A) (simple-vector-p A))
`((setq ,w (ELT ,sv ,i))
,@(ECQGENEXP W A QFLAG))))
C) )
(if (EQ I 0) (GO RET) )
(setq I (1- I))
(GO LP)
RET
(COND
( (NULL QFLAG)
`((COND ( (OR
(NOT (simple-vector-p ,sv))
(< (length ,sv) ,l))
(GO BAD) ) )
,@c))
( 'T C ) )) ))
( (NOT (consp FORM))
(RETURN NIL) ) )
(setq A (car FORM))
(setq D (cdr FORM))
(if (OR (consp A) (simple-vector-p A) (consp D) (simple-vector-p D))
(setq PVL (CONS (setq W (GENSYM)) PVL)))
(setq C
(COND
( (OR (|ident?| A) (INTEGERP A) (AND (consp A) (EQ (car A) 'QUOTE)))
`((COND ((NOT (EQ ,a (CAR ,sv))) (GO BAD))) ))
( (OR (consp A) (simple-vector-p A))
`((setq ,w (CAR ,sv))
,@(ECQGENEXP W A QFLAG)))))
(setq C
(|append!|
C
(COND
( (OR (|ident?| D) (INTEGERP D) (AND (consp D)
(EQ (car D) 'QUOTE)))
`((COND ((NOT (EQ ,d (CDR ,sv))) (GO BAD))) ))
( (OR (consp D) (simple-vector-p D))
`((setq ,sv (CDR ,sv))
,@(ECQGENEXP SV D QFLAG))))))
(RETURN
(COND
( (NULL QFLAG)
`((COND ( (ATOM ,sv)
(GO BAD) ) )
,@c))
( 'T
C ) )) ) )
)
; 19.4 Updating
; Generate code for RPLQ exprs
(eval-when
#+:common-lisp (:compile-toplevel :load-toplevel :execute)
#-:common-lisp (compile load eval)
(defun RCQEXP (FORM)
(PROG (SV PVL CODE)
(declare (special pvl))
(setq SV (GENSYM))
(setq CODE (RCQGENEXP SV FORM NIL))
(RETURN
`(LAMBDA (,sv)
(PROG ,pvl
,@code
(RETURN 'true)
BAD (RETURN NIL) ) ))))
)
; Generate code for RPLQ expr innards
(eval-when
#+:common-lisp (:compile-toplevel :load-toplevel :execute)
#-:common-lisp (compile load eval)
(defun RCQGENEXP (SV FORM QFLAG)
(PROG (D A I L C W)
(declare (special pvl))
(COND
( (EQ FORM SV)
(RETURN NIL) )
( (simple-vector-p FORM)
(RETURN (SEQ
(setq L (length FORM))
(if (EQ L 0) (RETURN NIL))
(setq I (1- L))
LP (setq A (elt FORM I))
(COND
( (AND
(NULL W)
(OR (AND (consp A) (NOT (EQ (car A) 'QUOTE)))
(simple-vector-p A)))
(setq PVL (CONS (setq W (GENSYM)) PVL)) ) )
(setq C
(|append!|
(COND
( (OR
(|ident?| A)
(INTEGERP A)
(AND (consp A) (EQ (car A) 'QUOTE)))
`((SETF (ELT ,sv ,i) ,a)))
( (OR (consp A) (simple-vector-p A))
`((setq ,w (ELT ,sv ,i))
,@(RCQGENEXP W A QFLAG))))
C) )
(COND
( (EQ I 0)
(GO RET) ) )
(setq I (1- I))
(GO LP)
RET (RETURN
(COND
( (NULL QFLAG)
`((COND ( (OR
(NOT (simple-vector-p ,sv))
(< (length ,sv) ,l))
(GO BAD) ) )
,@c))
( 'T
C ) )) )))
( (NOT (consp FORM))
(RETURN NIL) ) )
(setq A (car FORM))
(setq D (cdr FORM))
(cond
( (or (and (consp A) (NOT (EQ (car A) 'QUOTE))) (simple-vector-p A))
(setq PVL (CONS (setq W (GENSYM)) PVL)) ) )
(setq C
(COND
( (OR (|ident?| A) (INTEGERP A) (AND (consp A) (EQ (car A) 'QUOTE)))
`((rplaca ,sv ,a)))
( (OR (consp A) (simple-vector-p A))
`((setq ,w (CAR ,sv))
,@(RCQGENEXP W A QFLAG)))))
(setq C
(|append!|
C
(COND
( (OR (|ident?| D) (INTEGERP D) (AND (consp D) (EQ (car D) 'QUOTE)))
`((RPLACD ,sv ,d)))
( (OR (consp D) (simple-vector-p D))
`((setq ,sv (CDR ,sv))
,@(RCQGENEXP SV D QFLAG))))))
(RETURN
(COND
( (NULL QFLAG)
`((COND ( (ATOM ,sv)
(GO BAD) ) )
,@c))
( 'T
C ) )) ) )
)
; 22.0 Internal and External Forms
; 23.0 Reading
(define-function 'next #'read-char)
; 24.0 Printing
(define-function 'prin2cvec #'princ-to-string)
(define-function 'stringimage #'princ-to-string)
(defun |F,PRINT-ONE| (form &optional (stream |$OutputStream|))
(declare (ignore stream))
(let ((*print-level* 4) (*print-length* 4))
(prin1 form) (terpri)))
(defun prettyprint (x &optional (stream |$OutputStream|))
(prettyprin0 x stream) (terpri stream))
(defun prettyprin0 (x &optional (stream |$OutputStream|))
(let ((*print-pretty* t) (*print-array* t))
(prin1 x stream)))
(defun vmprint (x &optional (stream |$OutputStream|))
(prin1 x stream) (terpri stream))
(defun tab (sint &optional (stream t))
(format stream "~vT" sint))
; 27.0 Stream I/O
; 27.1 Creation
(defun MAKE-INSTREAM (filespec &optional (recnum 0))
(declare (ignore recnum))
(cond ((numberp filespec) (make-synonym-stream '*standard-input*))
((null filespec) (error "not handled yet"))
(t (open (make-input-filename filespec)
:direction :input :if-does-not-exist nil))))
(defun MAKE-OUTSTREAM (filespec &optional (width nil) (recnum 0))
(declare (ignore width) (ignore recnum))
(cond ((numberp filespec) (make-synonym-stream '*standard-output*))
((null filespec) (error "not handled yet"))
(t (open (make-filename filespec) :direction :output
:if-exists :supersede))))
(defun MAKE-APPENDSTREAM (filespec &optional (width nil) (recnum 0))
"fortran support"
(declare (ignore width) (ignore recnum))
(cond
((numberp filespec) (make-synonym-stream '*standard-output*))
((null filespec) (error "make-appendstream: not handled yet"))
('else (open (make-filename filespec) :direction :output
:if-exists :append :if-does-not-exist :create))))
(defun DEFIOSTREAM (stream-alist buffer-size char-position)
(declare (ignore buffer-size))
(let ((mode (or (cdr (assoc 'MODE stream-alist)) 'INPUT))
(filename (cdr (assoc 'FILE stream-alist)))
(dev (cdr (assoc 'DEVICE stream-alist))))
(if (EQ dev 'CONSOLE)
(case mode
((OUTPUT O) (make-synonym-stream '*standard-output*))
((INPUT I) (make-synonym-stream '*standard-input*)))
(let ((strm (case mode
((OUTPUT O) (open (make-filename filename)
:direction :output))
((INPUT I) (open (make-input-filename filename)
:direction :input)))))
(if (and (numberp char-position) (> char-position 0))
(file-position strm char-position))
strm))))
(defun shut (st) (if (is-console st) st
(if (streamp st) (close st) -1)))
(defun EOFP (stream) (null (peek-char nil stream nil nil)))
; 28.0 Key addressed I/O
; 46.0 Call tracing
(defun EMBEDDED () (mapcar #'car *embedded-functions*))
(defun EMBED (CURRENT-BINDING NEW-DEFINITION)
(PROG (OP BV BODY OLD-DEF)
(COND
( (NOT (|ident?| CURRENT-BINDING))
(SETQ CURRENT-BINDING
(error (format nil "invalid argument ~s to EMBED" CURRENT-BINDING))) ) )
(SETQ OLD-DEF (symbol-function CURRENT-BINDING))
(SETQ NEW-DEFINITION
(SETF (symbol-function CURRENT-BINDING)
(COND
( (NOT (consp NEW-DEFINITION))
NEW-DEFINITION )
( (AND
(DCQ (OP BV . BODY) NEW-DEFINITION)
(OR (EQ OP 'LAMBDA) (EQ OP 'MLAMBDA)))
(COND
( (NOT (|symbolMember?| CURRENT-BINDING (FLAT-BV-LIST BV)))
(eval `(,OP ,BV ((LAMBDA (,CURRENT-BINDING) . ,BODY)
',OLD-DEF)))
)
( 'T
(eval NEW-DEFINITION) ) ) )
( 'T
`((LAMBDA (,CURRENT-BINDING) ,NEW-DEFINITION) ',OLD-DEF)))
) )
(push (LIST CURRENT-BINDING NEW-DEFINITION OLD-DEF) *embedded-functions*)
(RETURN CURRENT-BINDING) ) )
(defun UNEMBED (CURRENT-BINDING)
(PROG (TMP E-LIST CUR-DEF)
(SETQ E-LIST *embedded-functions*)
(SETQ CUR-DEF (symbol-function CURRENT-BINDING))
(COND
( (NOT (consp E-LIST))
NIL )
( (ECQ ((CURRENT-BINDING CUR-DEF)) E-LIST)
(SETF (symbol-function CURRENT-BINDING) (QCADDAR E-LIST))
(SETQ *embedded-functions* (QCDR E-LIST))
(RETURN CURRENT-BINDING) )
( 'T
(SEQ
(SETQ TMP E-LIST)
LP (COND
( (NOT (consp (QCDR TMP)))
(EXIT NIL) )
( (NULL (ECQ ((CURRENT-BINDING CUR-DEF)) (QCDR TMP)))
(SETQ TMP (QCDR TMP))
(GO LP) )
( 'T
(SETF (symbol-function CURRENT-BINDING) (QCAR (QCDDADR TMP)))
(RPLACD TMP (QCDDR TMP))
(RETURN CURRENT-BINDING) ) ) ) ) )
(RETURN NIL) ))
(defun FLAT-BV-LIST (BV-LIST)
(PROG (TMP1)
(RETURN
(COND
( (VARP BV-LIST)
(LIST BV-LIST) )
( (simple-vector-p BV-LIST)
(FLAT-BV-LIST (VEC2LIST (MAP 'VECTOR #'FLAT-BV-LIST BV-LIST))) )
( (NOT (consp BV-LIST))
NIL )
( (EQ '= (SETQ TMP1 (QCAR BV-LIST)))
(FLAT-BV-LIST (QCDR BV-LIST)) )
( (VARP TMP1)
(CONS TMP1 (FLAT-BV-LIST (QCDR BV-LIST))) )
( (AND (NOT (consp TMP1)) (NOT (simple-vector-p TMP1)))
(FLAT-BV-LIST (QCDR BV-LIST)) )
( 'T
(|append!| (FLAT-BV-LIST TMP1) (FLAT-BV-LIST (QCDR BV-LIST))) ) )) ))
(defun VARP (TEST-ITEM)
(COND
( (|ident?| TEST-ITEM)
TEST-ITEM )
( (AND
(consp TEST-ITEM)
(OR (EQ (QCAR TEST-ITEM) 'FLUID) (EQ (QCAR TEST-ITEM) 'LEX))
(consp (QCDR TEST-ITEM))
(|ident?| (QCADR TEST-ITEM)))
TEST-ITEM )
( 'T
NIL ) ) )
; 48.0 Miscellaneous CMS Interactions
(defun CurrentTime ()
(multiple-value-bind (sec min hour day month year) (get-decoded-time)
(format nil "~2,'0D/~2,'0D/~2,'0D~2,'0D:~2,'0D:~2,'0D"
month day (rem year 100) hour min sec)))
(defun $screensize () '(24 80)) ; You tell me!!
;; This isn't really compatible but is as close as you can get in common lisp
;; In place of ((one-of 1 2 3) l) you should use
;; (funcall (one-of 1 2 3) l)
(defun doDSETQ (form pattern exp)
(let (PVL AVL)
(declare (special PVL AVL))
(COND ((|ident?| PATTERN)
(LIST 'SETQ PATTERN EXP))
((AND (NOT (consp PATTERN)) (NOT (simple-vector-p PATTERN)))
(MACRO-INVALIDARGS 'DSETQ FORM "constant target."))
((let* ((SV (GENSYM))
(E-PART (DCQGENEXP (LIST 'IDENTITY SV) PATTERN '= NIL)))
(setq e-part
`(LAMBDA (,sv)
(PROG ,pvl
,@e-part
(RETURN ,sv)
BAD (RETURN (SETQERROR ,sv)))))
`(,e-part ,exp))))))
(defun SETQERROR (&rest FORM) (error (format nil "in destructuring ~S" FORM)))
(defun MACRO-INVALIDARGS (NAME FORM MESSAGE)
(setq MACERRORCOUNT (+ 1 (eval 'MACERRORCOUNT)))
(error (format nil
"invalid arguments to macro ~S with invalid argument ~S, ~S"
name form message)))
(defun MACRO-MISSINGARGS (NAME ignore N)
(declare (ignore ignore))
(setq MACERRORCOUNT (+ 1 (eval 'MACERRORCOUNT)))
(let ((nargs (abs N)))
(error (concatenate 'string (symbol-name NAME) " requires "
(if (minusp N) "at least " "exactly ")
(case nargs (0 "no") (1 "one") (2 "two") (3 "three")
(4 "four") (5 "five") (6 "six")
(t (princ-to-string nargs)))
(if (eq nargs 1) " argument," " arguments,")))))
(defun MACERR (MESSAGE &rest ignore)
(declare (ignore ignore))
(setq MACERRORCOUNT (+ 1 (eval 'MACERRORCOUNT)))
(error
(LIST "in the expression:" MESSAGE))
())
; 98.0 Stuff Not In The VMLisp Manual That We Like
; A version of GET that works with lists
;; GETL(SYM, KEY)
;; KEY: a SYMBOL
;; SYM: a SYMBOL or a LIST whose elements are SYMBOLs or LISTs.
;; Returns:
;; when SYM is a SYMBOL, returns the KEY-property of SYM.
;; when SYM is a LIST, returns the either the KEY-property of the
;; first SYMBOL of SYM that has the KEY-property, or the CDR of the
;; first cons-cell whose CAR is EQ KEY.
(defun getl (sym key)
(cond ((symbolp sym)
(get sym key))
((null sym) nil)
((consp sym)
(let ((sym-1 (car sym)))
(cond ((symbolp sym-1)
(get sym-1 key))
((and (consp sym-1)
(symbolp (car sym-1)))
(if (eq (car sym-1) key)
(cdr sym-1)
(getl (cdr sym) key))))))))
; The following should actually position the cursor at the sint'th line of the screen:
(defun $showline (cvec sint) (terpri) sint (princ cvec))
; 99.0 Ancient Stuff We Decided To Keep
(defun LAM\,EVALANDFILEACTQ (name &optional (form name))
(LAM\,FILEACTQ name form) (eval form))
(defun LAM\,FILEACTQ (name form)
(if *FILEACTQ-APPLY* (FUNCALL *FILEACTQ-APPLY* name form)))
(defun PLACEP (item) (eq item *read-place-holder*))
(defun VMREAD (&optional (st |$InputStream|) (eofval *read-place-holder*))
(read st nil eofval))
(defun |read-line| (st &optional (eofval *read-place-holder*))
(read-line st nil eofval))
(defun gcmsg (x)
#+(OR IBCL KCL)
(prog1 system:*gbc-message*
(setq system:*gbc-message* x))
#+:cmulisp
(prog1 ext:*gc-verbose*
(setq ext:*gc-verbose* x))
)
(defun bpiname (func)
#+(OR IBCL KCL) (if (functionp func)
(cond ((symbolp func) func)
((and (consp func) (eq (car func) 'LAMBDA-BLOCK))
(cadr func))
((compiled-function-p func)
(system:compiled-function-name func))
('t func)))
#+:cmulisp (when (functionp func)
(cond
((symbolp func) func)
((and (consp func)
(eq (car func) 'lambda))
(second (third func)))
((compiled-function-p func)
(system::%primitive header-ref func
system::%function-name-slot))
('else func)))
#+(or :SBCL :clisp :ecl :clozure) (if (symbolp func)
func
(multiple-value-bind (l c n)
(function-lambda-expression func)
(declare (ignore l c))
n)))
|