kc3-lang/angle/src/compiler/translator/msl/DiscoverDependentFunctions.cpp

• Show log

  Commit

• Hash : 9b63700b
  Author :
  Date : 2023-07-11T10:25:40
  

  Translator: Reorganize files
  
  This change makes the translator files more organized by:
  
  - Grouping files that are specific to a certain output under their own
    directory,
  - Moving transformations under tree_ops
  - Removing Direct from metal translation now that that SPIR-V Cross path
    is removed
  
  Bug: angleproject:6394
  Change-Id: Iaf5bb8d5604b84748dece029821b1f77b2813967
  Reviewed-on: https://chromium-review.googlesource.com/c/angle/angle/+/4678780
  Commit-Queue: Shahbaz Youssefi <syoussefi@chromium.org>
  Reviewed-by: Geoff Lang <geofflang@chromium.org>
  

Download

• src/compiler/translator/msl/DiscoverDependentFunctions.cpp

• //
  // Copyright 2020 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 <cstring>
  #include <unordered_map>
  #include <unordered_set>
  
  #include "compiler/translator/msl/DiscoverDependentFunctions.h"
  #include "compiler/translator/msl/DiscoverEnclosingFunctionTraverser.h"
  #include "compiler/translator/msl/MapFunctionsToDefinitions.h"
  
  using namespace sh;
  
  ////////////////////////////////////////////////////////////////////////////////
  
  namespace
  {
  
  class Discoverer : public DiscoverEnclosingFunctionTraverser
  {
    private:
      const std::function<bool(const TVariable &)> &mVars;
      const FunctionToDefinition &mFuncToDef;
      std::unordered_set<const TFunction *> mNonDepFunctions;
  
    public:
      std::unordered_set<const TFunction *> mDepFunctions;
  
    public:
      Discoverer(const std::function<bool(const TVariable &)> &vars,
                 const FunctionToDefinition &funcToDef)
          : DiscoverEnclosingFunctionTraverser(true, false, true), mVars(vars), mFuncToDef(funcToDef)
      {}
  
      void visitSymbol(TIntermSymbol *symbolNode) override
      {
          const TVariable &var = symbolNode->variable();
          if (!mVars(var))
          {
              return;
          }
          const TFunction *owner = discoverEnclosingFunction(symbolNode);
          if (owner)
          {
              mDepFunctions.insert(owner);
          }
      }
  
      bool visitAggregate(Visit visit, TIntermAggregate *aggregateNode) override
      {
          if (visit != Visit::PreVisit)
          {
              return true;
          }
  
          if (!aggregateNode->isConstructor())
          {
              const TFunction *func = aggregateNode->getFunction();
  
              if (mNonDepFunctions.find(func) != mNonDepFunctions.end())
              {
                  return true;
              }
  
              if (mDepFunctions.find(func) == mDepFunctions.end())
              {
                  auto it = mFuncToDef.find(func);
                  if (it == mFuncToDef.end())
                  {
                      return true;
                  }
  
                  // Recursion is banned in GLSL, so I believe AngleIR has this property too.
                  // This implementation assumes (direct and mutual) recursion is prohibited.
                  TIntermFunctionDefinition &funcDefNode = *it->second;
                  funcDefNode.traverse(this);
                  if (mNonDepFunctions.find(func) != mNonDepFunctions.end())
                  {
                      return true;
                  }
                  ASSERT(mDepFunctions.find(func) != mDepFunctions.end());
              }
  
              const TFunction *owner = discoverEnclosingFunction(aggregateNode);
              ASSERT(owner);
              mDepFunctions.insert(owner);
          }
  
          return true;
      }
  
      bool visitFunctionDefinition(Visit visit, TIntermFunctionDefinition *funcDefNode) override
      {
          const TFunction *func = funcDefNode->getFunction();
  
          if (visit != Visit::PostVisit)
          {
              if (mDepFunctions.find(func) != mDepFunctions.end())
              {
                  return false;
              }
  
              if (mNonDepFunctions.find(func) != mNonDepFunctions.end())
              {
                  return false;
              }
  
              return true;
          }
  
          if (mDepFunctions.find(func) == mDepFunctions.end())
          {
              mNonDepFunctions.insert(func);
          }
  
          return true;
      }
  };
  
  }  // namespace
  
  std::unordered_set<const TFunction *> sh::DiscoverDependentFunctions(
      TIntermBlock &root,
      const std::function<bool(const TVariable &)> &vars)
  {
      const FunctionToDefinition funcToDef = MapFunctionsToDefinitions(root);
      Discoverer discoverer(vars, funcToDef);
      root.traverse(&discoverer);
      return std::move(discoverer.mDepFunctions);
  }
  

Download