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
|
; -*- Mode: Scheme; Syntax: Scheme; Package: Scheme; -*-
; Part of Scheme 48 1.9. See file COPYING for notices and license.
; Authors: Richard Kelsey, Jonathan Rees, Marcus Crestani, Mike Sperber
;;;; Data representations
; This implementation of the data representations is particularly
; tuned for byte-addressable machines with 4 bytes per word.
; Good representations for other kinds of machines would necessarily
; look quite different; e.g. on a word-addressed machine you might
; want to put tag bits in the high end of a word, or even go to some
; kind of BIBOP system.
(define (bytes->cells bytes)
; using shift instead of quotient for speed
; (quotient (+ bytes (- bytes-per-cell 1)) bytes-per-cell)
(arithmetic-shift-right (+ bytes (- bytes-per-cell 1))
log-bytes-per-cell))
(define (cells->bytes cells)
(* cells bytes-per-cell))
; Addresses
;
; An "addressing unit" is the smallest quantum of storage addressed by
; an address on a particular machine. On a DEC-20, 3600, or other
; word-addressed architecture there is one addressing unit per cell. On
; the VAX or 68000, though, the addressing unit is the byte, of which there
; are 4 to a cell.
(define (cells->a-units cells)
(adjoin-bits cells 0 unused-field-width))
(define (a-units->cells cells)
(high-bits cells unused-field-width))
(define (bytes->a-units byte-count)
(cells->a-units (bytes->cells byte-count)))
; Descriptors
; A descriptor describes a Scheme object.
; A descriptor is represented as an integer whose low two bits are
; tag bits. The high bits contain information whose format and
; meaning are dependent on the tag.
(define (make-descriptor tag data)
(adjoin-bits data tag tag-field-width))
(define (descriptor-tag descriptor)
(low-bits descriptor tag-field-width))
(define (descriptor-data descriptor)
(high-bits descriptor tag-field-width))
(define (unsigned-descriptor-data descriptor)
(unsigned-high-bits descriptor tag-field-width))
(define (set-descriptor-tag proto-descriptor tag)
(assert (= 0 (descriptor-tag proto-descriptor)))
(+ proto-descriptor tag))
(define vm-eq? =)
; The four tags are: fixnum, immediate (character, boolean, etc.),
; header (gives the type and size of a stored object), and stored
; (pointer into memory).
; The header and immediate tags could be multiplexed, thus freeing up
; one of the 4 type codes for some other purpose, but the
; implementation is simpler if they're not.
(define-enumeration tag
(fixnum
immediate
header
stob))
;; (assert (>= (shift-left 1 tag-field-width)
;; (vector-length tag)))
(define (fixnum? descriptor)
(= (descriptor-tag descriptor) (enum tag fixnum)))
(define (immediate? descriptor)
(= (descriptor-tag descriptor) (enum tag immediate)))
(define (header? descriptor)
(= (descriptor-tag descriptor) (enum tag header)))
(define (stob? descriptor)
(= (descriptor-tag descriptor) (enum tag stob)))
; Fixnums
(define bits-per-fixnum
(- (if (< bits-per-cell c-useful-bits-per-word)
bits-per-cell
c-useful-bits-per-word)
tag-field-width))
; Be careful not to get intermediate bignums
(define greatest-fixnum-value (+ (* (- (shift-left 1 (- bits-per-fixnum 2)) 1) 2)
1))
(define least-fixnum-value (- (- greatest-fixnum-value) 1))
(define (too-big-for-fixnum? n)
(> n greatest-fixnum-value))
(define (unsigned-too-big-for-fixnum? n)
(un> n (integer->unsigned greatest-fixnum-value)))
(define (too-small-for-fixnum? n)
(< n least-fixnum-value))
(define (enter-fixnum n)
(assert (not (or (too-big-for-fixnum? n)
(too-small-for-fixnum? n))))
(make-descriptor (enum tag fixnum) n))
(define (extract-fixnum p)
(assert (fixnum? p))
(descriptor-data p))
(define (descriptor->fixnum p)
(enter-fixnum (descriptor-data p)))
(define (fixnum->stob p)
(make-descriptor (enum tag stob) (extract-fixnum p)))
; These happen to work out, given our representation for fixnums.
(define fixnum= =)
(define fixnum< <)
(define fixnum> >)
(define fixnum<= <=)
(define fixnum>= >=)
(define (fixnum-bitwise-not x)
(bitwise-not (bitwise-ior x 3)))
(define fixnum-bitwise-and bitwise-and)
(define fixnum-bitwise-ior bitwise-ior)
(define fixnum-bitwise-xor bitwise-xor)
;----------------
; Immediates
(define (make-immediate type info)
(make-descriptor (enum tag immediate)
(adjoin-bits info type immediate-type-field-width)))
(define (immediate-type imm)
(assert (immediate? imm))
(low-bits (descriptor-data imm)
immediate-type-field-width))
(define (immediate-info imm)
(assert (immediate? imm))
(high-bits (descriptor-data imm)
immediate-type-field-width))
(define (tag&immediate-type descriptor)
(low-bits descriptor (+ tag-field-width immediate-type-field-width)))
(define (make-tag&immediate-type type)
(adjoin-bits type (enum tag immediate) tag-field-width))
(define-enumeration imm
(false ; #f
true ; #t
char
unspecific
undefined
eof
null
unreleased))
;; (assert (>= (shift-left 1 immediate-type-field-width)
;; (vector-length imm)))
(define (immediate-predicate type)
(lambda (descriptor)
;; Check low 8 bits...
(= (tag&immediate-type descriptor)
(make-tag&immediate-type type))))
(define bytes-per-scalar-value-unit 4) ; must be >= 3
(define (bytes->scalar-value-units byte-count)
(quotient byte-count bytes-per-scalar-value-unit))
(define (scalar-value-units->bytes units)
(* units bytes-per-scalar-value-unit))
(define vm-char? (immediate-predicate (enum imm char)))
(define undefined? (immediate-predicate (enum imm undefined)))
(define true (make-immediate (enum imm true) 0))
(define false (make-immediate (enum imm false) 0))
(define vm-eof-object (make-immediate (enum imm eof) 0)) ; distinguish from RTS's idea of this
(define null (make-immediate (enum imm null) 0))
(define unspecific-value (make-immediate (enum imm unspecific) 0))
(define quiescent (make-immediate (enum imm undefined) 0))
(define unbound-marker (make-immediate (enum imm undefined) 1))
(define unassigned-marker (make-immediate (enum imm undefined) 2))
(define unreleased-value (make-immediate (enum imm unreleased) 0))
(define (false? x)
(vm-eq? x false))
(define (enter-boolean b)
(if b true false))
(define (extract-boolean b)
(assert (vm-boolean? b))
(if (false? b) #f #t))
(define (vm-boolean? x)
(or (vm-eq? x false)
(vm-eq? x true)))
; Characters
; old:
(define (enter-char c)
(make-immediate (enum imm char) (char->ascii c)))
(define (extract-char d)
(assert (vm-char? d))
(ascii->char (immediate-info d)))
; new:
(define (scalar-value->vm-char c)
(make-immediate (enum imm char) c))
(define (vm-char->scalar-value d)
(assert (vm-char? d))
(immediate-info d))
; these work given the representations
(define vm-char=? =)
(define vm-char<? <)
; Headers
(define header-type-field-width (- immediate-type-field-width 1))
(define header-size-field-width (- data-field-width immediate-type-field-width))
; Assumes headers sizes are extracted as unsigned.
(define max-stob-contents-size-in-cells
(bytes->cells (- (shift-left 1 header-size-field-width) 1)))
(define (make-header type length-in-bytes)
(make-descriptor (enum tag header)
(adjoin-bits length-in-bytes
type
(+ 1 header-type-field-width))))
(define header-immutable-bit-mask
(adjoin-bits 1 0 (+ header-type-field-width tag-field-width)))
(define (make-header-immutable header)
(bitwise-ior header header-immutable-bit-mask))
(define (header-type h)
(assert (header? h))
(low-bits (descriptor-data h)
header-type-field-width))
(define (immutable-header? h)
(assert (header? h))
(not (= 0 (bitwise-and h header-immutable-bit-mask))))
(define (header-length-in-bytes h)
(assert (header? h))
(unsigned-high-bits (unsigned-descriptor-data h)
(+ 1 header-type-field-width)))
(define (header-length-in-cells header)
(bytes->cells (header-length-in-bytes header)))
(define (header-length-in-a-units h)
(cells->a-units (header-length-in-cells h)))
(define (d-vector-header? h)
(< (header-type h) least-b-vector-type))
(define (b-vector-header? h)
(and (header? h)
(>= (header-type h) least-b-vector-type)))
; Stored objects
; The data field of a descriptor for a stored object contains the
; cell number of the first cell after the object's header cell.
(define (add-stob-tag address-as-integer)
(set-descriptor-tag address-as-integer (enum tag stob)))
(define (remove-stob-tag stob)
(- stob (enum tag stob)))
|