kc3-lang/angle/src/compiler/translator/IsASTDepthBelowLimit.cpp

• Show log

  Commit

• Hash : c26214de
  Author :
  Date : 2018-03-16T10:43:11
  

  Move AST utilities to a subdirectory
  
  Move AST related utilities to compiler/translator/tree_util.
  
  BUG=angleproject:2409
  TEST=angle_unittests
  
  Change-Id: I7567c2f6f2710292029263257c7ac26e2a144ac8
  Reviewed-on: https://chromium-review.googlesource.com/966032
  Reviewed-by: Jamie Madill <jmadill@chromium.org>
  Reviewed-by: Corentin Wallez <cwallez@chromium.org>
  Commit-Queue: Olli Etuaho <oetuaho@nvidia.com>
  

Download

• src/compiler/translator/IsASTDepthBelowLimit.cpp

• //
  // Copyright (c) 2017 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.
  //
  
  #include "compiler/translator/IsASTDepthBelowLimit.h"
  
  #include "compiler/translator/tree_util/IntermTraverse.h"
  
  namespace sh
  {
  
  namespace
  {
  
  // Traverse the tree and compute max depth. Takes a maximum depth limit to prevent stack overflow.
  class MaxDepthTraverser : public TIntermTraverser
  {
    public:
      MaxDepthTraverser(int depthLimit) : TIntermTraverser(true, true, false), mDepthLimit(depthLimit)
      {
      }
  
      bool visitBinary(Visit, TIntermBinary *) override { return depthCheck(); }
      bool visitUnary(Visit, TIntermUnary *) override { return depthCheck(); }
      bool visitTernary(Visit, TIntermTernary *) override { return depthCheck(); }
      bool visitSwizzle(Visit, TIntermSwizzle *) override { return depthCheck(); }
      bool visitIfElse(Visit, TIntermIfElse *) override { return depthCheck(); }
      bool visitAggregate(Visit, TIntermAggregate *) override { return depthCheck(); }
      bool visitBlock(Visit, TIntermBlock *) override { return depthCheck(); }
      bool visitLoop(Visit, TIntermLoop *) override { return depthCheck(); }
      bool visitBranch(Visit, TIntermBranch *) override { return depthCheck(); }
  
    protected:
      bool depthCheck() const { return mMaxDepth < mDepthLimit; }
  
      int mDepthLimit;
  };
  
  }  // anonymous namespace
  
  bool IsASTDepthBelowLimit(TIntermNode *root, int maxDepth)
  {
      MaxDepthTraverser traverser(maxDepth + 1);
      root->traverse(&traverser);
  
      return traverser.getMaxDepth() <= maxDepth;
  }
  
  }  // namespace sh
  

Download