kc3-lang/angle/src/compiler/translator/tree_ops/d3d/SeparateArrayInitialization.cpp

• Show log

  Commit

• Hash : 382bf288
  Author :
  Date : 2020-12-24T23:56:39
  

  Organize AST transforms per backend
  
  Most of the AST transforms are written as a workaround to an issue that
  affects a single backend.  This change identifies such transforms and
  organizes them by backend.  They are then only built if the respective
  backend is.
  
  Additionally, about half of the GL transforms are due to mac
  workarounds, including the large RewriteRowMajorMatrices transform.
  Mac-specific workarounds are additionally only built on said platform.
  
  This change reduces the ANGLE binary size:
  
  - 106KB in a Vulkan-only build on Linux
  - 27KB in a GL-only build on Android (60KB on Linux)
  
  Bug: chromium:1084580
  Bug: chromium:1161513
  Change-Id: I64b334332c0d4f848756c6538af0d8d96864c7e9
  Reviewed-on: https://chromium-review.googlesource.com/c/angle/angle/+/2601346
  Commit-Queue: Shahbaz Youssefi <syoussefi@chromium.org>
  Reviewed-by: Jamie Madill <jmadill@chromium.org>
  Reviewed-by: Tim Van Patten <timvp@google.com>
  

Download

• src/compiler/translator/tree_ops/d3d/SeparateArrayInitialization.cpp

• //
  // Copyright 2002 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.
  //
  // The SeparateArrayInitialization function splits each array initialization into a declaration and
  // an assignment.
  // Example:
  //     type[n] a = initializer;
  // will effectively become
  //     type[n] a;
  //     a = initializer;
  //
  // Note that if the array is declared as const, the initialization may still be split, making the
  // AST technically invalid. Because of that this transformation should only be used when subsequent
  // stages don't care about const qualifiers. However, the initialization will not be split if the
  // initializer can be written as a HLSL literal.
  
  #include "compiler/translator/tree_ops/d3d/SeparateArrayInitialization.h"
  
  #include "compiler/translator/IntermNode.h"
  #include "compiler/translator/OutputHLSL.h"
  
  namespace sh
  {
  
  namespace
  {
  
  class SeparateArrayInitTraverser : private TIntermTraverser
  {
    public:
      ANGLE_NO_DISCARD static bool apply(TCompiler *compiler, TIntermNode *root);
  
    private:
      SeparateArrayInitTraverser();
      bool visitDeclaration(Visit, TIntermDeclaration *node) override;
  };
  
  bool SeparateArrayInitTraverser::apply(TCompiler *compiler, TIntermNode *root)
  {
      SeparateArrayInitTraverser separateInit;
      root->traverse(&separateInit);
      return separateInit.updateTree(compiler, root);
  }
  
  SeparateArrayInitTraverser::SeparateArrayInitTraverser() : TIntermTraverser(true, false, false) {}
  
  bool SeparateArrayInitTraverser::visitDeclaration(Visit, TIntermDeclaration *node)
  {
      TIntermSequence *sequence = node->getSequence();
      TIntermBinary *initNode   = sequence->back()->getAsBinaryNode();
      if (initNode != nullptr && initNode->getOp() == EOpInitialize)
      {
          TIntermTyped *initializer = initNode->getRight();
          if (initializer->isArray() && !initializer->hasConstantValue())
          {
              // We rely on that array declarations have been isolated to single declarations.
              ASSERT(sequence->size() == 1);
              TIntermTyped *symbol      = initNode->getLeft();
              TIntermBlock *parentBlock = getParentNode()->getAsBlock();
              ASSERT(parentBlock != nullptr);
  
              TIntermSequence replacements;
  
              TIntermDeclaration *replacementDeclaration = new TIntermDeclaration();
              replacementDeclaration->appendDeclarator(symbol);
              replacementDeclaration->setLine(symbol->getLine());
              replacements.push_back(replacementDeclaration);
  
              TIntermBinary *replacementAssignment =
                  new TIntermBinary(EOpAssign, symbol, initializer);
              replacementAssignment->setLine(symbol->getLine());
              replacements.push_back(replacementAssignment);
  
              mMultiReplacements.push_back(
                  NodeReplaceWithMultipleEntry(parentBlock, node, replacements));
          }
      }
      return false;
  }
  
  }  // namespace
  
  bool SeparateArrayInitialization(TCompiler *compiler, TIntermNode *root)
  {
      return SeparateArrayInitTraverser::apply(compiler, root);
  }
  
  }  // namespace sh
  

Download