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

• Show log

  Commit

• Hash : cccf2b00
  Author :
  Date : 2017-07-05T14:50:54
  

  Reorganize AST traversal utility code
  
  Define TIntermTraverser and TIntermLValueTrackingTraverser in a
  separate header file. hash() function is moved out from
  TIntermTraverser as it is not related to the core functionality
  of traversing and transforming ASTs.
  
  Also reorganize some traversers to follow common conventions:
  
  - Intermediate output is now in OutputTree.h/.cpp
  - Max tree depth check is now in IsASTDepthBelowLimit.h/.cpp
  
  BUG=angleproject:1490
  TEST=angle_unittests
  
  Change-Id: Id4968aa9d4e24d0c5bac90dc147fc9f310de0184
  Reviewed-on: https://chromium-review.googlesource.com/559531
  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/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