compiler.tree: renaming is hard. cleanup -> cleanup-tree

basis/compiler/tree/cleanup/cleanup-tests.factor

@@ -479,7 +479,7 @@ cell-bits 32 = [
 
 [ ] [
     [ { null } declare [ 1 ] [ 2 ] if ]
-    build-tree normalize propagate cleanup check-nodes
+    build-tree normalize propagate cleanup-tree check-nodes
 ] unit-test
 
 [ t ] [

basis/compiler/tree/dead-code/dead-code-tests.factor

@@ -15,7 +15,7 @@ IN: compiler.tree.dead-code.tests
     analyze-recursive
     normalize
     propagate
-    cleanup
+    cleanup-tree
     escape-analysis
     unbox-tuples
     compute-def-use
@@ -67,7 +67,7 @@ IN: compiler.tree.dead-code.tests
     analyze-recursive
     normalize
     propagate
-    cleanup
+    cleanup-tree
     escape-analysis
     unbox-tuples
     compute-def-use

basis/compiler/tree/def-use/def-use-tests.factor

@@ -20,7 +20,7 @@ IN: compiler.tree.def-use.tests
     analyze-recursive
     normalize
     propagate
-    cleanup
+    cleanup-tree
     compute-def-use
     check-nodes ;
 

basis/compiler/tree/escape-analysis/check/check-tests.factor

@@ -4,7 +4,7 @@ compiler.tree.propagation compiler.tree.cleanup ;
 IN: compiler.tree.escape-analysis.check.tests
 
 : test-checker ( quot -- ? )
-    build-tree normalize propagate cleanup run-escape-analysis? ;
+    build-tree normalize propagate cleanup-tree run-escape-analysis? ;
 
 [ t ] [
     [ { complex } declare [ real>> ] [ imaginary>> ] bi ]

basis/compiler/tree/escape-analysis/escape-analysis-tests.factor

@@ -34,7 +34,7 @@ M: node count-unboxed-allocations* drop ;
     analyze-recursive
     normalize
     propagate
-    cleanup
+    cleanup-tree
     escape-analysis
     dup check-nodes
     compute-def-use

basis/compiler/tree/tuple-unboxing/tuple-unboxing-tests.factor

@@ -13,7 +13,7 @@ IN: compiler.tree.tuple-unboxing.tests
     analyze-recursive
     normalize
     propagate
-    cleanup
+    cleanup-tree
     escape-analysis
     unbox-tuples
     check-nodes ;