chromium/third_party/angle/src/compiler/translator/tree_util/IntermNodePatternMatcher.cpp

//
// Copyright 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/tree_util/IntermNodePatternMatcher.h"

#include "compiler/translator/IntermNode.h"
#include "compiler/translator/SymbolTable.h"
#include "compiler/translator/util.h"

namespace sh
{

IntermNodePatternMatcher::IntermNodePatternMatcher(const unsigned int mask) : … { … }

// static
bool IntermNodePatternMatcher::IsDynamicIndexingOfNonSSBOVectorOrMatrix(TIntermBinary *node)
{ … }

// static
bool IntermNodePatternMatcher::IsDynamicIndexingOfVectorOrMatrix(TIntermBinary *node)
{ … }

// static
bool IntermNodePatternMatcher::IsDynamicIndexingOfSwizzledVector(TIntermBinary *node)
{ … }

bool IntermNodePatternMatcher::matchInternal(TIntermBinary *node, TIntermNode *parentNode) const
{ … }

bool IntermNodePatternMatcher::match(TIntermUnary *node) const
{ … }

bool IntermNodePatternMatcher::match(TIntermBinary *node, TIntermNode *parentNode) const
{ … }

bool IntermNodePatternMatcher::match(TIntermBinary *node,
                                     TIntermNode *parentNode,
                                     bool isLValueRequiredHere) const
{ … }

bool IntermNodePatternMatcher::match(TIntermAggregate *node, TIntermNode *parentNode) const
{ … }

bool IntermNodePatternMatcher::match(TIntermTernary *node) const
{ … }

bool IntermNodePatternMatcher::match(TIntermDeclaration *node) const
{ … }

}  // namespace sh