1 files changed, 2 insertions, 26 deletions
diff --git a/src/3rdparty/angle/src/compiler/translator/UnfoldShortCircuitAST.cpp b/src/3rdparty/angle/src/compiler/translator/UnfoldShortCircuitAST.cpp
index 29c4397d56..d548d421d2 100644
--- a/src/3rdparty/angle/src/compiler/translator/UnfoldShortCircuitAST.cpp
+++ b/src/3rdparty/angle/src/compiler/translator/UnfoldShortCircuitAST.cpp
@@ -50,32 +50,8 @@ bool UnfoldShortCircuitAST::visitBinary(Visit visit, TIntermBinary *node)
     }
     if (replacement)
     {
-        replacements.push_back(
-            NodeUpdateEntry(getParentNode(), node, replacement));
+        mReplacements.push_back(
+            NodeUpdateEntry(getParentNode(), node, replacement, false));
     }
     return true;
 }
-
-void UnfoldShortCircuitAST::updateTree()
-{
-    for (size_t ii = 0; ii < replacements.size(); ++ii)
-    {
-        const NodeUpdateEntry& entry = replacements[ii];
-        ASSERT(entry.parent);
-        bool replaced = entry.parent->replaceChildNode(
-            entry.original, entry.replacement);
-        ASSERT(replaced);
-
-        // In AST traversing, a parent is visited before its children.
-        // After we replace a node, if an immediate child is to
-        // be replaced, we need to make sure we don't update the replaced
-	// node; instead, we update the replacement node.
-        for (size_t jj = ii + 1; jj < replacements.size(); ++jj)
-        {
-            NodeUpdateEntry& entry2 = replacements[jj];
-            if (entry2.parent == entry.original)
-                entry2.parent = entry.replacement;
-        }
-    }
-}
-