From: Chris Hanson <org/chris-hanson/cph>
Date: Fri, 7 Aug 1987 17:06:12 +0000 (+0000)
Subject: Initial revision
X-Git-Tag: 20090517-FFI~13179
X-Git-Url: https://birchwood-abbey.net/git?a=commitdiff_plain;h=9feba2e8ebc52bcbf0be7b03e0eb0c568f465aaf;p=mit-scheme.git

Initial revision
---

diff --git a/v7/src/compiler/rtlbase/rgraph.scm b/v7/src/compiler/rtlbase/rgraph.scm
new file mode 100644
index 000000000..32df855e6
--- /dev/null
+++ b/v7/src/compiler/rtlbase/rgraph.scm
@@ -0,0 +1,70 @@
+#| -*-Scheme-*-
+
+$Header: /Users/cph/tmp/foo/mit-scheme/mit-scheme/v7/src/compiler/rtlbase/rgraph.scm,v 1.1 1987/08/07 17:06:12 cph Exp $
+
+Copyright (c) 1987 Massachusetts Institute of Technology
+
+This material was developed by the Scheme project at the Massachusetts
+Institute of Technology, Department of Electrical Engineering and
+Computer Science.  Permission to copy this software, to redistribute
+it, and to use it for any purpose is granted, subject to the following
+restrictions and understandings.
+
+1. Any copy made of this software must include this copyright notice
+in full.
+
+2. Users of this software agree to make their best efforts (a) to
+return to the MIT Scheme project any improvements or extensions that
+they make, so that these may be included in future releases; and (b)
+to inform MIT of noteworthy uses of this software.
+
+3. All materials developed as a consequence of the use of this
+software shall duly acknowledge such use, in accordance with the usual
+standards of acknowledging credit in academic research.
+
+4. MIT has made no warrantee or representation that the operation of
+this software will be error-free, and MIT is under no obligation to
+provide any services, by way of maintenance, update, or otherwise.
+
+5. In conjunction with products arising from the use of this material,
+there shall be no use of the name of the Massachusetts Institute of
+Technology nor of any adaptation thereof in any advertising,
+promotional, or sales literature without prior written consent from
+MIT in each case. |#
+
+;;;; Program Graph Abstraction
+
+(declare (usual-integrations))
+
+(define-vector-slots rgraph 0
+  edge
+  n-registers
+  continuations
+  bblocks
+  register-bblock
+  register-n-refs
+  register-n-deaths
+  register-live-length
+  register-crosses-call?
+  )
+(define-integrable rgraph-register-renumber rgraph-register-bblock)
+(define-integrable set-rgraph-register-renumber! set-rgraph-register-bblock!)
+(define *rgraphs*)
+(define *current-rgraph*)
+
+(define (rgraph-allocate)
+  (make-vector 10 false))
+
+(define (rgraph-entry-edges rgraph)
+  (cons (rgraph-edge rgraph)
+	(map continuation-rtl-edge (rgraph-continuations rgraph))))
+
+(define (rgraph-initial-edges rgraph)
+  (cons (rgraph-edge rgraph)
+	(let loop ((continuations (rgraph-continuations rgraph)))
+	  (if (null? continuations)
+	      '()
+	      (let ((edge (continuation-rtl-edge (car continuations))))
+		(if (node-previous=0? (edge-right-node edge))
+		    (cons edge (loop (cdr continuations)))
+		    (loop (cdr continuations))))))))
\ No newline at end of file