fix files usage

src/Transformations/MoveOperators/move_operators.cpp

@@ -470,8 +470,6 @@ static bool reorderOperatorsInBasicBlockUsingDeps(SAPFOR::BasicBlock* bb, const
     // as close as possible after its last dependency (if any).
     const auto depsMap = analyzeBasicBlockIntraDependencies(bb);
     vector<SgStatement*> order = ops;
-    const vector<SgStatement*> originalOrder = ops;
-    const int nOrig = (int)originalOrder.size();
 
     auto indexIn = [](const vector<SgStatement*>& v, SgStatement* s) -> int
     {
@@ -481,59 +479,37 @@ static bool reorderOperatorsInBasicBlockUsingDeps(SAPFOR::BasicBlock* bb, const
         return -1;
     };
 
-    auto indexInOriginal = [&](SgStatement* s) -> int
-    {
-        return indexIn(originalOrder, s);
-    };
-
     for (SgStatement* s : ops)
     {
         auto itDeps = depsMap.find(s);
         if (itDeps == depsMap.end() || itDeps->second.empty())
             continue;
 
-        int lastDepOrigIdx = -1;
-        for (SgStatement* dep : itDeps->second)
-        {
-            const int j = indexInOriginal(dep);
-            if (j >= 0)
-                lastDepOrigIdx = max(lastDepOrigIdx, j);
-        }
-        if (lastDepOrigIdx < 0)
-            continue;
-
-        SgStatement* successor = nullptr;
-        if (lastDepOrigIdx + 1 < nOrig)
-            successor = originalOrder[lastDepOrigIdx + 1];
-
         int posS = indexIn(order, s);
         if (posS < 0)
             continue;
 
-        if (successor == nullptr)
+        int lastDepIdx = -1;
+        for (SgStatement* dep : itDeps->second)
         {
-            if (posS == (int)order.size() - 1)
+            const int j = indexIn(order, dep);
-                continue;
+            if (j >= 0)
-            order.erase(order.begin() + posS);
+                lastDepIdx = max(lastDepIdx, j);
-            order.push_back(s);
-            continue;
         }
-
+        if (lastDepIdx < 0)
-        if (successor == s)
             continue;
 
-        const int posSucc = indexIn(order, successor);
+        if (posS == lastDepIdx + 1)
-        if (posSucc < 0)
-            continue;
-
-        if (posS + 1 == posSucc)
             continue;
 
         order.erase(order.begin() + posS);
-        const int posSucc2 = indexIn(order, successor);
+
-        if (posSucc2 < 0)
+        int lp = lastDepIdx;
-            printInternalError(convertFileName(__FILE__).c_str(), __LINE__);
+        if (posS < lastDepIdx)
-        order.insert(order.begin() + posSucc2, s);
+            lp = lastDepIdx - 1;
+
+        const int insertAt = lp + 1;
+        order.insert(order.begin() + insertAt, s);
     }
 
     bool changed = false;