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
|
;; Copyright (c) 1991-2002, The Numerical Algorithms Group Ltd.
;; All rights reserved.
;; Copyright (C) 2007-2009, 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.
;;
;;
;; Abstract:
;; This file defines the base initial environment for building
;; a Boot translator image. It essentially etablishes a namespace
;; (package BOOTTRAN) for the Boot translator, and defines
;; some macros that need to be present during translation of Boot
;; source files.
;;
(defpackage "BOOTTRAN"
(:use "AxiomCore")
#+:common-lisp (:use "COMMON-LISP")
#-:common-lisp (:use "LISP")
(:export "loadNativeModule"
"loadSystemRuntimeCore"
"$InteractiveMode"
"string2BootTree"
"genImportDeclaration"))
(in-package "BOOTTRAN")
;## need the conditional here so it appears in boottran
#+:ieee-floating-point (defparameter $ieee t)
#-:ieee-floating-point (defparameter $ieee nil)
;; when true indicate that that the Boot translator
;; is called interactively.
(defparameter |$InteractiveMode| nil)
(defmacro memq (a b)
`(member ,a ,b :test #'eq))
(defvar *lisp-bin-filetype* "o")
(defvar *lisp-source-filetype* "lisp")
(defun setdifference (x y)
(set-difference x y))
(defun make-cvec (sint)
(make-string sint))
(defun MAKE-VEC (n)
(make-array n))
(defun |shoeInputFile| (filespec )
(open filespec :direction :input :if-does-not-exist nil))
(defmacro |shoeOpenInputFile|
(stream fn prog)
`(with-open-file (,stream ,fn :direction :input
:if-does-not-exist nil) ,prog))
(defmacro |shoeOpenOutputFile|
(stream fn prog)
`(with-open-file (,stream ,fn :direction :output
:if-exists :supersede) ,prog))
(defun shoeprettyprin1 (x &optional (stream *standard-output*))
(let ((*print-pretty* t)
(*print-array* t)
(*print-circle* t)
(*print-level* nil)
(*print-length* nil))
(prin1 x stream)))
(defun reallyprettyprint (x &optional (stream *terminal-io*))
(shoeprettyprin1 x stream) (terpri stream))
(defun shoeprettyprin0 (x &optional (stream *standard-output*))
(let ((*print-pretty* nil)
(*print-array* t)
(*print-circle* t)
(*print-level* nil)
(*print-length* nil))
(prin1 x stream)))
(defun shoenotprettyprint (x &optional (stream *terminal-io*))
(shoeprettyprin0 x stream)
(terpri stream))
(defun make-full-cvec (sint &optional (char #\space))
(make-string sint :initial-element (character char)))
(defun |shoePLACEP| (item)
(eq item nil))
(defun substring (cvec start length)
(if length
(subseq cvec start (+ start length))
(subseq cvec start)))
(defun MAKE-HASHTABLE (id1)
(let ((test (case id1
((EQ ID) #'eq)
(CVEC #'equal)
((UEQUAL EQUAL) #'equal)
(otherwise (error "bad arg to make-hashtable")))))
(make-hash-table :test test)))
(defun HKEYS (table)
(let (keys)
(maphash #'(lambda (key val)
(declare (ignore val))
(push key keys)) table)
keys))
(defun HPUT (table key value)
(setf (gethash key table) value))
(defun QENUM (cvec ind)
(char-code (char cvec ind)))
(defun charmem (a b)
(member a b :test #'eql))
(defun |shoeIdChar| (x)
(or (ALPHANUMERICP x)
(charmem x '(#\' #\? #\%))))
(defun |shoeStartsId| (x)
(or (alpha-char-p x)
(charmem x '(#\$ #\? #\%))))
(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)))))
(search what in :start2 start)))
(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)))
(defun VEC-SETELT (vec ind val)
(setf (elt vec ind) val))
(defun bvec-make-full (n x)
(make-array (list n)
:element-type 'bit
:initial-element x))
(defun make-bvec (n)
(bvec-make-full n 0))
(defun bvec-setelt (bv i x)
(setf (sbit bv i) x))
(defun size (l)
(cond ((vectorp l) (length l))
((consp l) (list-length l))
(t 0)))
(defun identp (a)
(and (symbolp a) a))
(defun |shoeReadLisp| (s n)
(multiple-value-list (read-from-string s nil nil :start n)))
(defun |last| (x)
(car (last x)))
|
