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

Branch : - branch - main - tag -

• Show log

  Commit

• Author : Stuart Morgan
  Date : 2019-08-14 12:25:12
  Hash : 9d737966
  Message : Standardize copyright notices to project style For all "ANGLE Project" copyrights, standardize to the format specified by the style guide. Changes: - "Copyright (c)" and "Copyright(c)" changed to just "Copyright". - Removed the second half of date ranges ("Y1Y1-Y2Y2"->"Y1Y1"). - Fixed a small number of files that had no copyright date using the initial commit year from the version control history. - Fixed one instance of copyright being "The ANGLE Project" rather than "The ANGLE Project Authors" These changes are applied both to the copyright of source file, and where applicable to copyright statements that are generated by templates. BUG=angleproject:3811 Change-Id: I973dd65e4ef9deeba232d5be74c768256a0eb2e5 Reviewed-on: https://chromium-review.googlesource.com/c/angle/angle/+/1754397 Commit-Queue: Jamie Madill <jmadill@chromium.org> Reviewed-by: Jamie Madill <jmadill@chromium.org>

• src/compiler/translator/tree_ops/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/SeparateArrayInitialization.h"
  
  #include "compiler/translator/IntermNode.h"
  #include "compiler/translator/OutputHLSL.h"
  
  namespace sh
  {
  
  namespace
  {
  
  class SeparateArrayInitTraverser : private TIntermTraverser
  {
    public:
      static void apply(TIntermNode *root);
  
    private:
      SeparateArrayInitTraverser();
      bool visitDeclaration(Visit, TIntermDeclaration *node) override;
  };
  
  void SeparateArrayInitTraverser::apply(TIntermNode *root)
  {
      SeparateArrayInitTraverser separateInit;
      root->traverse(&separateInit);
      separateInit.updateTree();
  }
  
  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
  
  void SeparateArrayInitialization(TIntermNode *root)
  {
      SeparateArrayInitTraverser::apply(root);
  }
  
  }  // namespace sh