Transitive reduction of assigns fixed.

Author: gsvgit

cfpq_add_context/add_contexts.py

@@ -28,17 +28,22 @@ def indexed_to_boolean_decomposition(graph, block_count):
 def transitive_reduction(assigns, mask):
     result = Matrix(BOOL, assigns.ncols, assigns.ncols, name = "reduced_assigns")
     result << Matrix.mxm(mask, assigns, "land_lor")
-    count = 1
-    #closure = Matrix(BOOL, assigns.ncols, assigns.ncols, name = "closure")
+    total = Matrix(BOOL, assigns.ncols, assigns.ncols, name = "closure")
     unused_assigns = Matrix(BOOL, assigns.ncols, assigns.ncols, name = "unused_assigns")
     unused_assigns(~result.S) << assigns
     closure = unused_assigns
-    while closure.nvals > 0:
+    total("lor") << closure
+    #while closure.nvals > 0:
+    while True:
         print ("Closure nvals = ", closure.nvals)
         closure << Matrix.mxm(closure, unused_assigns, "land_lor")
         result("lor") << Matrix.mxm(closure, mask, "land_lor")
         new_closure = Matrix(BOOL, assigns.ncols, assigns.ncols, name = "closure")
-        new_closure(~result) << closure
+        new_closure(~result.S) << closure
+        nnz = total.nvals
+        total("lor") << closure
+        if total.nvals == nnz:
+            break
     return result
 
 def to_label_decomposed_graph(graph):