(generate/rgraph): Make only a single edge for the entry of each

rgraph.  This is important because the linearizer looks at the number
of edges to determine when labels are needed.

diff --git a/v7/src/compiler/rtlgen/rtlgen.scm b/v7/src/compiler/rtlgen/rtlgen.scm
index 3ef2e84613619879db8dca2e071c22ce3338c6c3..b8dd6cb36056ffe241218241190e471205c1bbb5 100644 (file)
--- a/v7/src/compiler/rtlgen/rtlgen.scm
+++ b/v7/src/compiler/rtlgen/rtlgen.scm
@@ -1,6 +1,6 @@
 #| -*-Scheme-*-
 
-$Header: /Users/cph/tmp/foo/mit-scheme/mit-scheme/v7/src/compiler/rtlgen/rtlgen.scm,v 4.10 1988/10/26 12:33:00 markf Exp $
+$Header: /Users/cph/tmp/foo/mit-scheme/mit-scheme/v7/src/compiler/rtlgen/rtlgen.scm,v 4.11 1988/11/02 21:45:03 cph Exp $
 
 Copyright (c) 1988 Massachusetts Institute of Technology
 
@@ -213,12 +213,13 @@ MIT in each case. |#
 \f
 (define (generate/rgraph node generator)
   (let ((rgraph (node->rgraph node)))
-    (let ((entry-node
-          (cfg-entry-node
-           (fluid-let ((*current-rgraph* rgraph))
-             (with-new-node-marks (lambda () (generator node)))))))
-      (add-rgraph-entry-node! rgraph entry-node)
-      (return-2 rgraph (node->edge entry-node)))))
+    (let ((entry-edge
+          (node->edge
+           (cfg-entry-node
+            (fluid-let ((*current-rgraph* rgraph))
+              (with-new-node-marks (lambda () (generator node))))))))
+      (add-rgraph-entry-edge! rgraph entry-edge)
+      (return-2 rgraph entry-edge))))
 
 (define (node->rgraph node)
   (let ((color