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

• Show log

  Commit

• Hash : 472c74c6
  Author :
  Date : 2019-08-19T16:32:13
  

  Translator: Allow tree validation in children of TCompiler
  
  This is to be able to perform validation inside TranslatorVulkan, even
  if it's through ASSERTs.
  
  Additionally, every transformation is changed such that they do their
  validation themselves.  TIntermTraverser::updateTree() performs the
  validation, which indirectly validates many of three tree
  transformations.  Some of the more ancient transformations that don't
  use this function directly call TCompiler::validateAST.
  
  Bug: angleproject:2733
  Change-Id: Ie4af029d34e053c5ad1dc8c2c2568eecd625d344
  Reviewed-on: https://chromium-review.googlesource.com/c/angle/angle/+/1761149
  Reviewed-by: Geoff Lang <geofflang@chromium.org>
  Reviewed-by: Jamie Madill <jmadill@chromium.org>
  Commit-Queue: Shahbaz Youssefi <syoussefi@chromium.org>
  

Download

• 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
  
  bool UnfoldShortCircuitAST(TCompiler *compiler, TIntermBlock *root)
  {
      UnfoldShortCircuitASTTraverser traverser;
      root->traverse(&traverser);
      return traverser.updateTree(compiler, root);
  }
  
  }  // namespace sh
  

Download