1 files changed, 0 insertions, 157 deletions
diff --git a/src/3rdparty/angle/src/compiler/translator/IntermNodePatternMatcher.cpp b/src/3rdparty/angle/src/compiler/translator/IntermNodePatternMatcher.cpp
deleted file mode 100644
index 567e8f7440..0000000000
--- a/src/3rdparty/angle/src/compiler/translator/IntermNodePatternMatcher.cpp
+++ /dev/null
@@ -1,157 +0,0 @@
-//
-// Copyright (c) 2016 The ANGLE Project Authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-//
-// IntermNodePatternMatcher is a helper class for matching node trees to given patterns.
-// It can be used whenever the same checks for certain node structures are common to multiple AST
-// traversers.
-//
-
-#include "compiler/translator/IntermNodePatternMatcher.h"
-
-#include "compiler/translator/IntermNode.h"
-
-namespace sh
-{
-
-IntermNodePatternMatcher::IntermNodePatternMatcher(const unsigned int mask) : mMask(mask)
-{
-}
-
-// static
-bool IntermNodePatternMatcher::IsDynamicIndexingOfVectorOrMatrix(TIntermBinary *node)
-{
-    return node->getOp() == EOpIndexIndirect && !node->getLeft()->isArray() &&
-           node->getLeft()->getBasicType() != EbtStruct;
-}
-
-bool IntermNodePatternMatcher::matchInternal(TIntermBinary *node, TIntermNode *parentNode)
-{
-    if ((mMask & kExpressionReturningArray) != 0)
-    {
-        if (node->isArray() && node->getOp() == EOpAssign && parentNode != nullptr &&
-            !parentNode->getAsBlock())
-        {
-            return true;
-        }
-    }
-
-    if ((mMask & kUnfoldedShortCircuitExpression) != 0)
-    {
-        if (node->getRight()->hasSideEffects() &&
-            (node->getOp() == EOpLogicalOr || node->getOp() == EOpLogicalAnd))
-        {
-            return true;
-        }
-    }
-    return false;
-}
-
-bool IntermNodePatternMatcher::match(TIntermUnary *node)
-{
-    if ((mMask & kArrayLengthMethod) != 0)
-    {
-        if (node->getOp() == EOpArrayLength)
-        {
-            return true;
-        }
-    }
-    return false;
-}
-
-bool IntermNodePatternMatcher::match(TIntermBinary *node, TIntermNode *parentNode)
-{
-    // L-value tracking information is needed to check for dynamic indexing in L-value.
-    // Traversers that don't track l-values can still use this class and match binary nodes with
-    // this variation of this method if they don't need to check for dynamic indexing in l-values.
-    ASSERT((mMask & kDynamicIndexingOfVectorOrMatrixInLValue) == 0);
-    return matchInternal(node, parentNode);
-}
-
-bool IntermNodePatternMatcher::match(TIntermBinary *node,
-                                     TIntermNode *parentNode,
-                                     bool isLValueRequiredHere)
-{
-    if (matchInternal(node, parentNode))
-    {
-        return true;
-    }
-    if ((mMask & kDynamicIndexingOfVectorOrMatrixInLValue) != 0)
-    {
-        if (isLValueRequiredHere && IsDynamicIndexingOfVectorOrMatrix(node))
-        {
-            return true;
-        }
-    }
-    return false;
-}
-
-bool IntermNodePatternMatcher::match(TIntermAggregate *node, TIntermNode *parentNode)
-{
-    if ((mMask & kExpressionReturningArray) != 0)
-    {
-        if (parentNode != nullptr)
-        {
-            TIntermBinary *parentBinary = parentNode->getAsBinaryNode();
-            bool parentIsAssignment =
-                (parentBinary != nullptr &&
-                 (parentBinary->getOp() == EOpAssign || parentBinary->getOp() == EOpInitialize));
-
-            if (node->getType().isArray() && !parentIsAssignment &&
-                (node->isConstructor() || node->isFunctionCall()) && !parentNode->getAsBlock())
-            {
-                return true;
-            }
-        }
-    }
-    return false;
-}
-
-bool IntermNodePatternMatcher::match(TIntermTernary *node)
-{
-    if ((mMask & kUnfoldedShortCircuitExpression) != 0)
-    {
-        return true;
-    }
-    return false;
-}
-
-bool IntermNodePatternMatcher::match(TIntermDeclaration *node)
-{
-    if ((mMask & kMultiDeclaration) != 0)
-    {
-        if (node->getSequence()->size() > 1)
-        {
-            return true;
-        }
-    }
-    if ((mMask & kArrayDeclaration) != 0)
-    {
-        if (node->getSequence()->front()->getAsTyped()->getType().isStructureContainingArrays())
-        {
-            return true;
-        }
-        // Need to check from all declarators whether they are arrays since that may vary between
-        // declarators.
-        for (TIntermNode *declarator : *node->getSequence())
-        {
-            if (declarator->getAsTyped()->isArray())
-            {
-                return true;
-            }
-        }
-    }
-    if ((mMask & kNamelessStructDeclaration) != 0)
-    {
-        TIntermTyped *declarator = node->getSequence()->front()->getAsTyped();
-        if (declarator->getBasicType() == EbtStruct &&
-            declarator->getType().getStruct()->name() == "")
-        {
-            return true;
-        }
-    }
-    return false;
-}
-
-}  // namespace sh