From d3a40b6c1302519f9f50eebad5082a113f2a58e8 Mon Sep 17 00:00:00 2001
From: Chris Hanson <org/chris-hanson/cph>
Date: Sat, 8 Aug 1987 23:19:11 +0000
Subject: [PATCH] Compress blocks with a separate set of node marks since that
 algorithm must mark the graph.

---
 v7/src/compiler/rtlgen/rtlgen.scm | 8 ++++++--
 1 file changed, 6 insertions(+), 2 deletions(-)

diff --git a/v7/src/compiler/rtlgen/rtlgen.scm b/v7/src/compiler/rtlgen/rtlgen.scm
index 42eec2151..666f36841 100644
--- 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 1.18 1987/08/07 17:09:04 cph Exp $
+$Header: /Users/cph/tmp/foo/mit-scheme/mit-scheme/v7/src/compiler/rtlgen/rtlgen.scm,v 1.19 1987/08/08 23:19:11 cph Exp $
 
 Copyright (c) 1987 Massachusetts Institute of Technology
 
@@ -71,6 +71,11 @@ MIT in each case. |#
      rgraph
      (node->edge (cfg-entry-node (with-new-node-marks generator))))
     (set-rgraph-n-registers! rgraph *next-pseudo-number*))
+   (with-new-node-marks
+    (lambda ()
+      (for-each (lambda (edge)
+		  (bblock-compress! (edge-right-node edge)))
+		(rgraph-initial-edges rgraph))))
   (set-rgraph-bblocks!
    rgraph
    (with-new-node-marks
@@ -89,7 +94,6 @@ MIT in each case. |#
 	    '()))
 
       (mapcan (lambda (edge)
-		(bblock-compress! (edge-right-node edge))
 		(loop (edge-right-node edge)))
 	      (rgraph-initial-edges rgraph))))))
 
-- 
2.25.1