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

• Show log

  Commit

• Hash : ea39a223
  Author :
  Date : 2017-07-06T12:47:59
  

  Simplify queueReplacement AST transform helper
  
  queueReplacement is always called to replace the node that's currently
  being visited in the traverser. The currently visited node can be
  fetched automatically from the traversal path so it can be removed
  from parameters of queueReplacement.
  
  BUG=angleproject:2100
  TEST=angle_unittests
  
  Change-Id: I62ab6d1cd9c0d2b4c260af9f7c85bc156fb3f349
  Reviewed-on: https://chromium-review.googlesource.com/562336
  Reviewed-by: Corentin Wallez <cwallez@chromium.org>
  Reviewed-by: Jamie Madill <jmadill@chromium.org>
  Commit-Queue: Olli Etuaho <oetuaho@nvidia.com>
  

Download

• src/compiler/translator/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/UnfoldShortCircuitAST.h"
  
  namespace sh
  {
  
  namespace
  {
  
  // "x || y" is equivalent to "x ? true : y".
  TIntermTernary *UnfoldOR(TIntermTyped *x, TIntermTyped *y)
  {
      TConstantUnion *u = new TConstantUnion;
      u->setBConst(true);
      TIntermConstantUnion *trueNode =
          new TIntermConstantUnion(u, TType(EbtBool, EbpUndefined, EvqConst, 1));
      return new TIntermTernary(x, trueNode, y);
  }
  
  // "x && y" is equivalent to "x ? y : false".
  TIntermTernary *UnfoldAND(TIntermTyped *x, TIntermTyped *y)
  {
      TConstantUnion *u = new TConstantUnion;
      u->setBConst(false);
      TIntermConstantUnion *falseNode =
          new TIntermConstantUnion(u, TType(EbtBool, EbpUndefined, EvqConst, 1));
      return new TIntermTernary(x, y, falseNode);
  }
  
  }  // namespace anonymous
  
  bool UnfoldShortCircuitAST::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;
  }
  
  }  // namespace sh
  

Download