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

• Show log

  Commit

• Hash : a07b4213
  Author :
  Date : 2018-03-22T16:13:13
  

  Move AST transformations to a subdirectory
  
  Move AST transformations to compiler/translator/tree_ops.
  
  BUG=angleproject:2409
  TEST=angle_unittests
  
  Change-Id: I9c620e98707d22d005da6192fe7d1b4e8030aadd
  Reviewed-on: https://chromium-review.googlesource.com/975550
  Reviewed-by: Jamie Madill <jmadill@chromium.org>
  Reviewed-by: Corentin Wallez <cwallez@chromium.org>
  Commit-Queue: Olli Etuaho <oetuaho@nvidia.com>
  

Download

• src/compiler/translator/tree_ops/UnfoldShortCircuitAST.cpp

• //
  // Copyright (c) 2002-2013 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
  

Download