kc3-lang/angle/src/tests/test_utils/ConstantFoldingTest.h

• 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/tests/test_utils/ConstantFoldingTest.h

• //
  // 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.
  //
  // ConstantFoldingTest.h:
  //   Utilities for constant folding tests.
  //
  
  #ifndef TESTS_TEST_UTILS_CONSTANTFOLDINGTEST_H_
  #define TESTS_TEST_UTILS_CONSTANTFOLDINGTEST_H_
  
  #include <vector>
  
  #include "common/mathutil.h"
  #include "compiler/translator/IntermTraverse.h"
  #include "tests/test_utils/ShaderCompileTreeTest.h"
  
  namespace sh
  {
  
  class TranslatorESSL;
  
  template <typename T>
  class ConstantFinder : public TIntermTraverser
  {
    public:
      ConstantFinder(const std::vector<T> &constantVector)
          : TIntermTraverser(true, false, false),
            mConstantVector(constantVector),
            mFaultTolerance(T()),
            mFound(false)
      {
      }
  
      ConstantFinder(const std::vector<T> &constantVector, const T &faultTolerance)
          : TIntermTraverser(true, false, false),
            mConstantVector(constantVector),
            mFaultTolerance(faultTolerance),
            mFound(false)
      {
      }
  
      ConstantFinder(const T &value)
          : TIntermTraverser(true, false, false), mFaultTolerance(T()), mFound(false)
      {
          mConstantVector.push_back(value);
      }
  
      void visitConstantUnion(TIntermConstantUnion *node)
      {
          if (node->getType().getObjectSize() == mConstantVector.size())
          {
              bool found = true;
              for (size_t i = 0; i < mConstantVector.size(); i++)
              {
                  if (!isEqual(node->getUnionArrayPointer()[i], mConstantVector[i]))
                  {
                      found = false;
                      break;
                  }
              }
              if (found)
              {
                  mFound = found;
              }
          }
      }
  
      bool found() const { return mFound; }
  
    private:
      bool isEqual(const TConstantUnion &node, const float &value) const
      {
          if (node.getType() != EbtFloat)
          {
              return false;
          }
          if (value == std::numeric_limits<float>::infinity())
          {
              return gl::isInf(node.getFConst()) && node.getFConst() > 0;
          }
          else if (value == -std::numeric_limits<float>::infinity())
          {
              return gl::isInf(node.getFConst()) && node.getFConst() < 0;
          }
          else if (gl::isNaN(value))
          {
              // All NaNs are treated as equal.
              return gl::isNaN(node.getFConst());
          }
          return mFaultTolerance >= fabsf(node.getFConst() - value);
      }
  
      bool isEqual(const TConstantUnion &node, const int &value) const
      {
          if (node.getType() != EbtInt)
          {
              return false;
          }
          ASSERT(mFaultTolerance < std::numeric_limits<int>::max());
          // abs() returns 0 at least on some platforms when the minimum int value is passed in (it
          // doesn't have a positive counterpart).
          return mFaultTolerance >= abs(node.getIConst() - value) &&
                 (node.getIConst() - value) != std::numeric_limits<int>::min();
      }
  
      bool isEqual(const TConstantUnion &node, const unsigned int &value) const
      {
          if (node.getType() != EbtUInt)
          {
              return false;
          }
          ASSERT(mFaultTolerance < static_cast<unsigned int>(std::numeric_limits<int>::max()));
          return static_cast<int>(mFaultTolerance) >=
                     abs(static_cast<int>(node.getUConst() - value)) &&
                 static_cast<int>(node.getUConst() - value) != std::numeric_limits<int>::min();
      }
  
      bool isEqual(const TConstantUnion &node, const bool &value) const
      {
          if (node.getType() != EbtBool)
          {
              return false;
          }
          return node.getBConst() == value;
      }
  
      std::vector<T> mConstantVector;
      T mFaultTolerance;
      bool mFound;
  };
  
  class ConstantFoldingTest : public ShaderCompileTreeTest
  {
    public:
      ConstantFoldingTest() {}
  
    protected:
      ::GLenum getShaderType() const override { return GL_FRAGMENT_SHADER; }
      ShShaderSpec getShaderSpec() const override { return SH_GLES3_1_SPEC; }
  
      template <typename T>
      bool constantFoundInAST(T constant)
      {
          ConstantFinder<T> finder(constant);
          mASTRoot->traverse(&finder);
          return finder.found();
      }
  
      template <typename T>
      bool constantVectorFoundInAST(const std::vector<T> &constantVector)
      {
          ConstantFinder<T> finder(constantVector);
          mASTRoot->traverse(&finder);
          return finder.found();
      }
  
      template <typename T>
      bool constantColumnMajorMatrixFoundInAST(const std::vector<T> &constantMatrix)
      {
          return constantVectorFoundInAST(constantMatrix);
      }
  
      template <typename T>
      bool constantVectorNearFoundInAST(const std::vector<T> &constantVector, const T &faultTolerance)
      {
          ConstantFinder<T> finder(constantVector, faultTolerance);
          mASTRoot->traverse(&finder);
          return finder.found();
      }
  };
  
  class ConstantFoldingExpressionTest : public ConstantFoldingTest
  {
    public:
      ConstantFoldingExpressionTest() {}
  
      void evaluateFloat(const std::string &floatExpression);
      void evaluateInt(const std::string &intExpression);
      void evaluateUint(const std::string &uintExpression);
  };
  
  }  // namespace sh
  
  #endif  // TESTS_TEST_UTILS_CONSTANTFOLDINGTEST_H_
  

Download