kc3-lang/angle/src/tests/test_utils/compiler_test.cpp

• Show log

  Commit

• Hash : 18841310
  Author :
  Date : 2017-11-28T12:48:47
  

  Clean up MatchOutputCodeTest usage
  
  It's cleaner to use a generic function to test that a sequence of
  strings is found in a specific order rather than fetching and
  comparing string locations in test case code.
  
  Also make sure that string occurrences can't overlap when looking for
  a specific number of occurrences of the same string.
  
  TEST=angle_unittests
  
  Change-Id: I8ca66c73c7aaa5be8469ded466f51d97a36c801b
  Reviewed-on: https://chromium-review.googlesource.com/793041
  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/compiler_test.cpp

• //
  // Copyright (c) 2015 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.
  //
  // compiler_test.cpp:
  //     utilities for compiler unit tests.
  
  #include "tests/test_utils/compiler_test.h"
  
  #include "angle_gl.h"
  #include "compiler/translator/Compiler.h"
  #include "compiler/translator/IntermTraverse.h"
  
  namespace sh
  {
  
  namespace
  {
  
  class FunctionCallFinder : public TIntermTraverser
  {
    public:
      FunctionCallFinder(const TString &functionMangledName)
          : TIntermTraverser(true, false, false),
            mFunctionMangledName(functionMangledName),
            mNodeFound(nullptr)
      {
      }
  
      bool visitAggregate(Visit visit, TIntermAggregate *node) override
      {
          if (node->isFunctionCall() && node->getSymbolTableMangledName() == mFunctionMangledName)
          {
              mNodeFound = node;
              return false;
          }
          return true;
      }
  
      bool isFound() const { return mNodeFound != nullptr; }
      const TIntermAggregate *getNode() const { return mNodeFound; }
  
    private:
      TString mFunctionMangledName;
      TIntermAggregate *mNodeFound;
  };
  
  }  // anonymous namespace
  
  bool compileTestShader(GLenum type,
                         ShShaderSpec spec,
                         ShShaderOutput output,
                         const std::string &shaderString,
                         ShBuiltInResources *resources,
                         ShCompileOptions compileOptions,
                         std::string *translatedCode,
                         std::string *infoLog)
  {
      sh::TCompiler *translator = sh::ConstructCompiler(type, spec, output);
      if (!translator->Init(*resources))
      {
          SafeDelete(translator);
          return false;
      }
  
      const char *shaderStrings[] = { shaderString.c_str() };
  
      bool compilationSuccess = translator->compile(shaderStrings, 1, SH_OBJECT_CODE | compileOptions);
      TInfoSink &infoSink = translator->getInfoSink();
      if (translatedCode)
          *translatedCode = infoSink.obj.c_str();
      if (infoLog)
          *infoLog = infoSink.info.c_str();
      SafeDelete(translator);
      return compilationSuccess;
  }
  
  bool compileTestShader(GLenum type,
                         ShShaderSpec spec,
                         ShShaderOutput output,
                         const std::string &shaderString,
                         ShCompileOptions compileOptions,
                         std::string *translatedCode,
                         std::string *infoLog)
  {
      ShBuiltInResources resources;
      sh::InitBuiltInResources(&resources);
      return compileTestShader(type, spec, output, shaderString, &resources, compileOptions, translatedCode, infoLog);
  }
  
  MatchOutputCodeTest::MatchOutputCodeTest(GLenum shaderType,
                                           ShCompileOptions defaultCompileOptions,
                                           ShShaderOutput outputType)
      : mShaderType(shaderType), mDefaultCompileOptions(defaultCompileOptions)
  {
      sh::InitBuiltInResources(&mResources);
      mOutputCode[outputType] = std::string();
  }
  
  void MatchOutputCodeTest::addOutputType(const ShShaderOutput outputType)
  {
      mOutputCode[outputType] = std::string();
  }
  
  ShBuiltInResources *MatchOutputCodeTest::getResources()
  {
      return &mResources;
  }
  
  void MatchOutputCodeTest::compile(const std::string &shaderString)
  {
      compile(shaderString, mDefaultCompileOptions);
  }
  
  void MatchOutputCodeTest::compile(const std::string &shaderString,
                                    const ShCompileOptions compileOptions)
  {
      std::string infoLog;
      for (auto &code : mOutputCode)
      {
          bool compilationSuccess =
              compileWithSettings(code.first, shaderString, compileOptions, &code.second, &infoLog);
          if (!compilationSuccess)
          {
              FAIL() << "Shader compilation failed:\n" << infoLog;
          }
      }
  }
  
  bool MatchOutputCodeTest::compileWithSettings(ShShaderOutput output,
                                                const std::string &shaderString,
                                                const ShCompileOptions compileOptions,
                                                std::string *translatedCode,
                                                std::string *infoLog)
  {
      return compileTestShader(mShaderType, SH_GLES3_1_SPEC, output, shaderString, &mResources,
                               compileOptions, translatedCode, infoLog);
  }
  
  bool MatchOutputCodeTest::foundInCode(ShShaderOutput output, const char *stringToFind) const
  {
      const auto code = mOutputCode.find(output);
      EXPECT_NE(mOutputCode.end(), code);
      if (code == mOutputCode.end())
      {
          return std::string::npos;
      }
      return code->second.find(stringToFind) != std::string::npos;
  }
  
  bool MatchOutputCodeTest::foundInCodeInOrder(ShShaderOutput output,
                                               std::vector<const char *> stringsToFind)
  {
      const auto code = mOutputCode.find(output);
      EXPECT_NE(mOutputCode.end(), code);
      if (code == mOutputCode.end())
      {
          return false;
      }
  
      size_t currentPos = 0;
      for (const char *stringToFind : stringsToFind)
      {
          auto position = code->second.find(stringToFind, currentPos);
          if (position == std::string::npos)
          {
              return false;
          }
          currentPos = position + strlen(stringToFind);
      }
      return true;
  }
  
  bool MatchOutputCodeTest::foundInCode(ShShaderOutput output,
                                        const char *stringToFind,
                                        const int expectedOccurrences) const
  {
      const auto code = mOutputCode.find(output);
      EXPECT_NE(mOutputCode.end(), code);
      if (code == mOutputCode.end())
      {
          return false;
      }
  
      size_t currentPos  = 0;
      int occurencesLeft = expectedOccurrences;
  
      const size_t searchStringLength = strlen(stringToFind);
  
      while (occurencesLeft-- > 0)
      {
          auto position = code->second.find(stringToFind, currentPos);
          if (position == std::string::npos)
          {
              return false;
          }
          // Search strings should not overlap.
          currentPos = position + searchStringLength;
      }
      // Make sure that there aren't extra occurrences.
      return code->second.find(stringToFind, currentPos) == std::string::npos;
  }
  
  bool MatchOutputCodeTest::foundInCode(const char *stringToFind) const
  {
      for (auto &code : mOutputCode)
      {
          if (!foundInCode(code.first, stringToFind))
          {
              return false;
          }
      }
      return true;
  }
  
  bool MatchOutputCodeTest::foundInCode(const char *stringToFind, const int expectedOccurrences) const
  {
      for (auto &code : mOutputCode)
      {
          if (!foundInCode(code.first, stringToFind, expectedOccurrences))
          {
              return false;
          }
      }
      return true;
  }
  
  bool MatchOutputCodeTest::foundInCodeInOrder(std::vector<const char *> stringsToFind)
  {
      for (auto &code : mOutputCode)
      {
          if (!foundInCodeInOrder(code.first, stringsToFind))
          {
              return false;
          }
      }
      return true;
  }
  
  bool MatchOutputCodeTest::notFoundInCode(const char *stringToFind) const
  {
      for (auto &code : mOutputCode)
      {
          if (foundInCode(code.first, stringToFind))
          {
              return false;
          }
      }
      return true;
  }
  
  const TIntermAggregate *FindFunctionCallNode(TIntermNode *root, const TString &functionMangledName)
  {
      FunctionCallFinder finder(functionMangledName);
      root->traverse(&finder);
      return finder.getNode();
  }
  
  }  // namespace sh
  

Download