mirror of
https://git.savannah.gnu.org/git/guile.git
synced 2025-05-01 20:30:28 +02:00
* module/language/assembly.scm: Refactor a bit; remove the name "code" from the API, as it's too generic, and replace with "assembly". * module/language/assembly/compile-bytecode.scm: Get byte lengths via, well, byte-length. * module/language/glil/Makefile.am: * module/language/glil/spec.scm: * module/language/glil/compile-objcode.scm: Remove compile-objcode, as we just go through bytecode now. * module/language/glil/compile-assembly.scm (glil->assembly) (dump-object): s/object->code/object->assembly/.
360 lines
13 KiB
Scheme
360 lines
13 KiB
Scheme
;;; Guile VM assembler
|
|
|
|
;; Copyright (C) 2001 Free Software Foundation, Inc.
|
|
|
|
;; This program is free software; you can redistribute it and/or modify
|
|
;; it under the terms of the GNU General Public License as published by
|
|
;; the Free Software Foundation; either version 2, or (at your option)
|
|
;; any later version.
|
|
;;
|
|
;; This program is distributed in the hope that it will be useful,
|
|
;; but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
;; GNU General Public License for more details.
|
|
;;
|
|
;; You should have received a copy of the GNU General Public License
|
|
;; along with this program; see the file COPYING. If not, write to
|
|
;; the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
;; Boston, MA 02111-1307, USA.
|
|
|
|
;;; Code:
|
|
|
|
(define-module (language glil compile-assembly)
|
|
#:use-module (system base syntax)
|
|
#:use-module (system base pmatch)
|
|
#:use-module (language glil)
|
|
#:use-module (language assembly)
|
|
#:use-module (system vm instruction)
|
|
#:use-module ((system vm program) #:select (make-binding))
|
|
#:use-module (ice-9 receive)
|
|
#:use-module ((srfi srfi-1) #:select (fold))
|
|
#:export (compile-assembly))
|
|
|
|
;; Variable cache cells go in the object table, and serialize as their
|
|
;; keys. The reason we wrap the keys in these records is so they don't
|
|
;; compare as `equal?' to other objects in the object table.
|
|
;;
|
|
;; `key' is either a symbol or the list (MODNAME SYM PUBLIC?)
|
|
|
|
(define-record <variable-cache-cell> key)
|
|
|
|
;; Subprograms can be loaded into an object table as well. We need a
|
|
;; disjoint type here too.
|
|
|
|
(define-record <subprogram> code)
|
|
|
|
|
|
;; A metadata thunk has no object table, so it is very quick to load.
|
|
(define (make-meta bindings sources tail)
|
|
(if (and (null? bindings) (null? sources) (null? tail))
|
|
#f
|
|
(make-subprogram
|
|
;; we need to prepend #f for the object table. This would have
|
|
;; even less overhead if we just appended the metadata-generating
|
|
;; instructions after the body of the program's code. A FIXME for
|
|
;; the future, eh.
|
|
`((make-false)
|
|
,(compile-assembly
|
|
(make-glil-program 0 0 0 0 '()
|
|
(list
|
|
(make-glil-const `(,bindings ,sources ,@tail))
|
|
(make-glil-call 'return 0))))))))
|
|
|
|
;; A functional stack of names of live variables.
|
|
(define (make-open-binding name ext? index)
|
|
(list name ext? index))
|
|
(define (make-closed-binding open-binding start end)
|
|
(make-binding (car open-binding) (cadr open-binding)
|
|
(caddr open-binding) start end))
|
|
(define (open-binding bindings vars nargs start)
|
|
(cons
|
|
(acons start
|
|
(map
|
|
(lambda (v)
|
|
(pmatch v
|
|
((,name argument ,i) (make-open-binding name #f i))
|
|
((,name local ,i) (make-open-binding name #f (+ nargs i)))
|
|
((,name external ,i) (make-open-binding name #t i))
|
|
(else (error "unknown binding type" name type))))
|
|
vars)
|
|
(car bindings))
|
|
(cdr bindings)))
|
|
(define (close-binding bindings end)
|
|
(pmatch bindings
|
|
((((,start . ,closing) . ,open) . ,closed)
|
|
(cons open
|
|
(fold (lambda (o tail)
|
|
;; the cons is for dsu sort
|
|
(acons start (make-closed-binding o start end)
|
|
tail))
|
|
closed
|
|
closing)))
|
|
(else (error "broken bindings" bindings))))
|
|
(define (close-all-bindings bindings end)
|
|
(if (null? (car bindings))
|
|
(map cdr
|
|
(stable-sort (reverse (cdr bindings))
|
|
(lambda (x y) (< (car x) (car y)))))
|
|
(close-all-bindings (close-binding bindings end) end)))
|
|
|
|
;; A functional object table.
|
|
(define *module-and-meta* 2)
|
|
(define (assoc-ref-or-acons alist x make-y)
|
|
(cond ((assoc-ref alist x)
|
|
=> (lambda (y) (values y alist)))
|
|
(else
|
|
(let ((y (make-y x alist)))
|
|
(values y (acons x y alist))))))
|
|
(define (object-index-and-alist x alist)
|
|
(assoc-ref-or-acons alist x
|
|
(lambda (x alist)
|
|
(+ (length alist) *module-and-meta*))))
|
|
|
|
(define (compile-assembly glil)
|
|
(receive (code . _)
|
|
(glil->assembly glil 0 '() '(()) '() '() #f 0)
|
|
(car code)))
|
|
(define (make-object-table objects meta)
|
|
(and (or meta (not (null? objects)))
|
|
(list->vector (cons* #f meta objects))))
|
|
|
|
(define (glil->assembly glil nargs nexts-stack bindings
|
|
source-alist label-alist object-alist addr)
|
|
(define (emit-code x)
|
|
(values x bindings source-alist label-alist object-alist))
|
|
(define (emit-code/object x object-alist)
|
|
(values x bindings source-alist label-alist object-alist))
|
|
|
|
(record-case glil
|
|
((<glil-program> nargs nrest nlocs nexts meta body closure-level)
|
|
(let ((toplevel? (null? nexts-stack)))
|
|
(define (process-body)
|
|
(let ((nexts-stack (cons nexts nexts-stack)))
|
|
(let lp ((body body) (code '()) (bindings '(())) (source-alist '())
|
|
(label-alist '()) (object-alist (if toplevel? #f '())) (addr 0))
|
|
(cond
|
|
((null? body)
|
|
(values (reverse code)
|
|
(close-all-bindings bindings addr)
|
|
(reverse source-alist)
|
|
(reverse label-alist)
|
|
(and object-alist (map car (reverse object-alist)))
|
|
addr))
|
|
(else
|
|
(receive (subcode bindings source-alist label-alist object-alist)
|
|
(glil->assembly (car body) nargs nexts-stack bindings
|
|
source-alist label-alist object-alist addr)
|
|
(lp (cdr body) (append (reverse subcode) code)
|
|
bindings source-alist label-alist object-alist
|
|
(apply + addr (map byte-length subcode)))))))))
|
|
|
|
(receive (code bindings sources labels objects len)
|
|
(process-body)
|
|
(let ((prog `(load-program ,nargs ,nrest ,nlocs ,nexts ,labels
|
|
,len . ,code)))
|
|
(cond
|
|
(toplevel?
|
|
;; toplevel bytecode isn't loaded by the vm, no way to do
|
|
;; object table or closure capture (not in the bytecode,
|
|
;; anyway)
|
|
(emit-code `(,prog)))
|
|
(else
|
|
(let ((table (dump-object (make-object-table
|
|
objects
|
|
(make-meta bindings sources meta))
|
|
addr))
|
|
(closure (if (> closure-level 0) '((make-closure)) '())))
|
|
(cond
|
|
(object-alist
|
|
;; if we are being compiled from something with an object
|
|
;; table, cache the program there
|
|
(receive (i object-alist)
|
|
(object-index-and-alist (make-subprogram `(,@table ,prog))
|
|
object-alist)
|
|
(emit-code/object `((object-ref ,i) ,@closure)
|
|
object-alist)))
|
|
(else
|
|
;; otherwise emit a load directly
|
|
(emit-code `(,@table ,prog ,@closure)))))))))))
|
|
|
|
((<glil-bind> vars)
|
|
(values '()
|
|
(open-binding bindings vars nargs addr)
|
|
source-alist
|
|
label-alist
|
|
object-alist))
|
|
|
|
((<glil-mv-bind> vars rest)
|
|
(values `((truncate-values ,(length vars) ,(if rest 1 0)))
|
|
(open-binding bindings vars nargs addr)
|
|
source-alist
|
|
label-alist
|
|
object-alist))
|
|
|
|
((<glil-unbind>)
|
|
(values '()
|
|
(close-binding bindings addr)
|
|
source-alist
|
|
label-alist
|
|
object-alist))
|
|
|
|
((<glil-source> loc)
|
|
(values '()
|
|
bindings
|
|
(acons addr loc source-alist)
|
|
label-alist
|
|
object-alist))
|
|
|
|
((<glil-void>)
|
|
(emit-code '((void))))
|
|
|
|
((<glil-const> obj)
|
|
(cond
|
|
((object->assembly obj)
|
|
=> (lambda (code)
|
|
(emit-code (list code))))
|
|
((not object-alist)
|
|
(emit-code (dump-object obj addr)))
|
|
(else
|
|
(receive (i object-alist)
|
|
(object-index-and-alist obj object-alist)
|
|
(emit-code/object `((object-ref ,i))
|
|
object-alist)))))
|
|
|
|
((<glil-argument> op index)
|
|
(emit-code (if (eq? op 'ref)
|
|
`((local-ref ,index))
|
|
`((local-set ,index)))))
|
|
|
|
((<glil-local> op index)
|
|
(emit-code (if (eq? op 'ref)
|
|
`((local-ref ,(+ nargs index)))
|
|
`((local-set ,(+ nargs index))))))
|
|
|
|
((<glil-external> op depth index)
|
|
(emit-code (let lp ((d depth) (n 0) (stack nexts-stack))
|
|
(if (> d 0)
|
|
(lp (1- d) (+ n (car stack)) (cdr stack))
|
|
(if (eq? op 'ref)
|
|
`((external-ref ,(+ n index)))
|
|
`((external-set ,(+ n index))))))))
|
|
|
|
((<glil-toplevel> op name)
|
|
(case op
|
|
((ref set)
|
|
(cond
|
|
((not object-alist)
|
|
(emit-code `(,@(dump-object name addr)
|
|
(link-now)
|
|
,(case op
|
|
((ref) '(variable-ref))
|
|
((set) '(variable-set))))))
|
|
(else
|
|
(receive (i object-alist)
|
|
(object-index-and-alist (make-variable-cache-cell name)
|
|
object-alist)
|
|
(emit-code/object (case op
|
|
((ref) `((toplevel-ref ,i)))
|
|
((set) `((toplevel-set ,i))))
|
|
object-alist)))))
|
|
((define)
|
|
(emit-code `((define ,(symbol->string name))
|
|
(variable-set))))
|
|
(else
|
|
(error "unknown toplevel var kind" op name))))
|
|
|
|
((<glil-module> op mod name public?)
|
|
(let ((key (list mod name public?)))
|
|
(case op
|
|
((ref set)
|
|
(cond
|
|
((not object-alist)
|
|
(emit-code `(,@(dump-object key addr)
|
|
(link-now)
|
|
,(case op
|
|
((ref) '(variable-ref))
|
|
((set) '(variable-set))))))
|
|
(else
|
|
(receive (i object-alist)
|
|
(object-index-and-alist (make-variable-cache-cell key)
|
|
object-alist)
|
|
(emit-code/object (case op
|
|
((ref) `((toplevel-ref ,i)))
|
|
((set) `((toplevel-set ,i))))
|
|
object-alist)))))
|
|
(else
|
|
(error "unknown module var kind" op key)))))
|
|
|
|
((<glil-label> label)
|
|
(values '()
|
|
bindings
|
|
source-alist
|
|
(acons label addr label-alist)
|
|
object-alist))
|
|
|
|
((<glil-branch> inst label)
|
|
(emit-code `((,inst ,label))))
|
|
|
|
;; nargs is number of stack args to insn. probably should rename.
|
|
((<glil-call> inst nargs)
|
|
(if (not (instruction? inst))
|
|
(error "Unknown instruction:" inst))
|
|
(let ((pops (instruction-pops inst)))
|
|
(cond ((< pops 0)
|
|
(emit-code `((,inst ,nargs))))
|
|
((= pops nargs)
|
|
(emit-code `((,inst))))
|
|
(else
|
|
(error "Wrong number of stack arguments to instruction:" inst nargs)))))
|
|
|
|
((<glil-mv-call> nargs ra)
|
|
(emit-code `((mv-call ,nargs ,ra))))))
|
|
|
|
;; addr is currently unused, but could be used to align data in the
|
|
;; instruction stream.
|
|
(define (dump-object x addr)
|
|
(define (too-long x)
|
|
(error (string-append x " too long")))
|
|
|
|
(let dump ((x x))
|
|
(cond
|
|
((object->assembly x) => list)
|
|
((variable-cache-cell? x) (dump (variable-cache-cell-key x)))
|
|
((subprogram? x) (subprogram-code x))
|
|
((and (integer? x) (exact? x))
|
|
(let ((str (do ((n x (quotient n 256))
|
|
(l '() (cons (modulo n 256) l)))
|
|
((= n 0)
|
|
(list->string (map integer->char l))))))
|
|
`((load-integer ,str))))
|
|
((number? x)
|
|
`((load-number ,(number->string x))))
|
|
((string? x)
|
|
`((load-string ,x)))
|
|
((symbol? x)
|
|
`((load-symbol ,(symbol->string x))))
|
|
((keyword? x)
|
|
`((load-keyword ,(symbol->string (keyword->symbol x)))))
|
|
((list? x)
|
|
(fold append
|
|
(let ((len (length x)))
|
|
(if (>= len 65536) (too-long "list"))
|
|
`((list ,(quotient len 256) ,(modulo len 256))))
|
|
(fold (lambda (x y) (cons (dump x) y))
|
|
'()
|
|
x)))
|
|
((pair? x)
|
|
`(,@(dump (car x))
|
|
,@(dump (cdr x))
|
|
(cons)))
|
|
((vector? x)
|
|
(fold append
|
|
(let ((len (vector-length x)))
|
|
(if (>= len 65536) (too-long "vector"))
|
|
`((vector ,(quotient len 256) ,(modulo len 256))))
|
|
(fold (lambda (x y) (cons (dump x) y))
|
|
'()
|
|
(vector->list x))))
|
|
(else
|
|
(error "assemble: unrecognized object" x)))))
|
|
|