utility multiRootGetSlice decoupling

Author: toudefu

third_party/iluvatar/backend/flagtree_backend_specialization/include/triton/Analysis/iluvatar_Utility.h

@@ -2,5 +2,6 @@
 #define ILUVATAR_TRITON_ANALYSIS_UTILITY_H
 
 #define FLAGTREE_SPEC_Utility_Function
+#define FLAGTREE_SPEC_Utility_multiRootGetSlice_ARG bool
 
 #endif // TRITON_ANALYSIS_UTILITY_H

third_party/iluvatar/backend/flagtree_backend_specialization/lib/Analysis/Utility.cpp

@@ -75,4 +75,34 @@ void getBackwardSliceCorex(Operation *op, SetVector<Operation *> *backwardSlice,
   backwardSlice->remove(op);
 }
 
+SetVector<Operation *> multiRootGetSlice(Operation *op,
+                                         TransitiveFilter backwardFilter,
+                                         TransitiveFilter forwardFilter,
+                                         bool omitBlockArguments) {
+  SetVector<Operation *> slice;
+  slice.insert(op);
+
+  unsigned currentIndex = 0;
+  SetVector<Operation *> backwardSlice;
+  SetVector<Operation *> forwardSlice;
+  while (currentIndex != slice.size()) {
+    auto *currentOp = (slice)[currentIndex];
+    // Compute and insert the backwardSlice starting from currentOp.
+    backwardSlice.clear();
+    BackwardSliceOptions opt;
+    opt.omitBlockArguments = true;
+    opt.filter = backwardFilter;
+    getBackwardSliceCorex(currentOp, &backwardSlice, opt.filter,
+                          opt.omitBlockArguments);
+    slice.insert(backwardSlice.begin(), backwardSlice.end());
+
+    // Compute and insert the forwardSlice starting from currentOp.
+    forwardSlice.clear();
+    getForwardSlice(currentOp, &forwardSlice, forwardFilter);
+    slice.insert(forwardSlice.begin(), forwardSlice.end());
+    ++currentIndex;
+  }
+  return multiRootTopologicalSort(slice);
+}
+
 }

third_party/iluvatar/include/triton/Analysis/Utility.h

@@ -228,10 +228,16 @@ void getBackwardSliceImplCorex(Operation *op,
 #endif
 
 /// This uses the toplogicalSort above
+#ifdef FLAGTREE_SPEC_Utility_multiRootGetSlice_ARG
 SetVector<Operation *>
 multiRootGetSlice(Operation *op, TransitiveFilter backwardFilter = nullptr,
                   TransitiveFilter forwardFilter = nullptr,
-                  bool omitBlockArguments = true);
+                  FLAGTREE_SPEC_Utility_multiRootGetSlice_ARG spec_arg = true);
+#else
+SetVector<Operation *>
+multiRootGetSlice(Operation *op, TransitiveFilter backwardFilter = nullptr,
+                  TransitiveFilter forwardFilter = nullptr);
+#endif
 
 /// Create a basic DataFlowSolver with constant and dead code analysis included.
 std::unique_ptr<DataFlowSolver> createDataFlowSolver();

third_party/iluvatar/lib/Analysis/Utility.cpp

@@ -808,10 +808,10 @@ multiRootTopologicalSort(const SetVector<Operation *> &toSort) {
   return res;
 }
 
+#ifndef FLAGTREE_SPEC_Utility_multiRootGetSlice_ARG
 SetVector<Operation *> multiRootGetSlice(Operation *op,
                                          TransitiveFilter backwardFilter,
-                                         TransitiveFilter forwardFilter,
-                                         bool omitBlockArguments) {
+                                         TransitiveFilter forwardFilter) {
   SetVector<Operation *> slice;
   slice.insert(op);
 
@@ -825,12 +825,7 @@ SetVector<Operation *> multiRootGetSlice(Operation *op,
     BackwardSliceOptions opt;
     opt.omitBlockArguments = true;
     opt.filter = backwardFilter;
-#ifdef __ILUVATAR__
-    getBackwardSliceCorex(currentOp, &backwardSlice, opt.filter,
-                          opt.omitBlockArguments);
-#elif
     getBackwardSlice(currentOp, &backwardSlice, opt);
-#endif
     slice.insert(backwardSlice.begin(), backwardSlice.end());
 
     // Compute and insert the forwardSlice starting from currentOp.
@@ -841,6 +836,7 @@ SetVector<Operation *> multiRootGetSlice(Operation *op,
   }
   return multiRootTopologicalSort(slice);
 }
+#endif
 
 namespace {
 // Copied from TestDeadCodeAnalysis.cpp, because some dead code analysis