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

• Show log

  Commit

• Hash : 03d863c8
  Author :
  Date : 2016-07-27T18:15:53
  

  translator: Refactor node replacement APIs.
  
  BUG=angleproject:851
  
  Change-Id: I50c3b3a4f00b27fed85f09509738513a441c7b5b
  Reviewed-on: https://chromium-review.googlesource.com/363990
  Reviewed-by: Olli Etuaho <oetuaho@nvidia.com>
  Reviewed-by: Zhenyao Mo <zmo@chromium.org>
  Commit-Queue: Jamie Madill <jmadill@chromium.org>
  

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
  {
  
  // "x || y" is equivalent to "x ? true : y".
  TIntermSelection *UnfoldOR(TIntermTyped *x, TIntermTyped *y)
  {
      const TType boolType(EbtBool, EbpUndefined);
      TConstantUnion *u = new TConstantUnion;
      u->setBConst(true);
      TIntermConstantUnion *trueNode = new TIntermConstantUnion(
          u, TType(EbtBool, EbpUndefined, EvqConst, 1));
      return new TIntermSelection(x, trueNode, y, boolType);
  }
  
  // "x && y" is equivalent to "x ? y : false".
  TIntermSelection *UnfoldAND(TIntermTyped *x, TIntermTyped *y)
  {
      const TType boolType(EbtBool, EbpUndefined);
      TConstantUnion *u = new TConstantUnion;
      u->setBConst(false);
      TIntermConstantUnion *falseNode = new TIntermConstantUnion(
          u, TType(EbtBool, EbpUndefined, EvqConst, 1));
      return new TIntermSelection(x, y, falseNode, boolType);
  }
  
  }  // namespace anonymous
  
  bool UnfoldShortCircuitAST::visitBinary(Visit visit, TIntermBinary *node)
  {
      TIntermSelection *replacement = NULL;
  
      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(node, replacement, OriginalNode::IS_DROPPED);
      }
      return true;
  }
  

Download