kc3-lang/angle/src/compiler/translator/tree_ops/UnfoldShortCircuitAST.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/UnfoldShortCircuitAST.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.
  //
  
  #include "compiler/translator/tree_ops/UnfoldShortCircuitAST.h"
  
  #include "compiler/translator/IntermNode.h"
  #include "compiler/translator/tree_util/IntermNode_util.h"
  #include "compiler/translator/tree_util/IntermTraverse.h"
  
  namespace sh
  {
  
  namespace
  {
  
  // "x || y" is equivalent to "x ? true : y".
  TIntermTernary *UnfoldOR(TIntermTyped *x, TIntermTyped *y)
  {
      return new TIntermTernary(x, CreateBoolNode(true), y);
  }
  
  // "x && y" is equivalent to "x ? y : false".
  TIntermTernary *UnfoldAND(TIntermTyped *x, TIntermTyped *y)
  {
      return new TIntermTernary(x, y, CreateBoolNode(false));
  }
  
  // This traverser identifies all the short circuit binary  nodes that need to
  // be replaced, and creates the corresponding replacement nodes. However,
  // the actual replacements happen after the traverse through updateTree().
  
  class UnfoldShortCircuitASTTraverser : public TIntermTraverser
  {
    public:
      UnfoldShortCircuitASTTraverser() : TIntermTraverser(true, false, false) {}
  
      bool visitBinary(Visit visit, TIntermBinary *) override;
  };
  
  bool UnfoldShortCircuitASTTraverser::visitBinary(Visit visit, TIntermBinary *node)
  {
      TIntermTernary *replacement = nullptr;
  
      switch (node->getOp())
      {
          case EOpLogicalOr:
              replacement = UnfoldOR(node->getLeft(), node->getRight());
              break;
          case EOpLogicalAnd:
              replacement = UnfoldAND(node->getLeft(), node->getRight());
              break;
          default:
              break;
      }
      if (replacement)
      {
          queueReplacement(replacement, OriginalNode::IS_DROPPED);
      }
      return true;
  }
  
  }  // anonymous namespace
  
  void UnfoldShortCircuitAST(TIntermBlock *root)
  {
      UnfoldShortCircuitASTTraverser traverser;
      root->traverse(&traverser);
      traverser.updateTree();
  }
  
  }  // namespace sh