(bblock-compress!): when counting previous edges to determine if this

is the beginning of a basic block, we must include edges which have no
left node.

diff --git a/v7/src/compiler/rtlbase/rtlcfg.scm b/v7/src/compiler/rtlbase/rtlcfg.scm
index f45fa41688da73af8b8e5b8c413da7fbbe6fe13f..fdfc5aea731f2afa7609a27f2f15bbd27c62b819 100644 (file)
--- a/v7/src/compiler/rtlbase/rtlcfg.scm
+++ b/v7/src/compiler/rtlbase/rtlcfg.scm
@@ -1,6 +1,6 @@
 #| -*-Scheme-*-
 
-$Header: /Users/cph/tmp/foo/mit-scheme/mit-scheme/v7/src/compiler/rtlbase/rtlcfg.scm,v 4.5 1988/11/06 14:38:21 cph Exp $
+$Header: /Users/cph/tmp/foo/mit-scheme/mit-scheme/v7/src/compiler/rtlbase/rtlcfg.scm,v 4.6 1988/11/07 13:56:13 cph Exp $
 
 Copyright (c) 1987, 1988 Massachusetts Institute of Technology
 
@@ -115,7 +115,7 @@ MIT in each case. |#
            (let ((next (snode-next bblock)))
              (if next
                  (begin
-                   (if (node-previous=1? next)
+                   (if (null? (cdr (node-previous-edges next)))
                        (begin
                          (set-rinst-next!
                           (rinst-last (bblock-instructions bblock))