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

• Show log

  Commit

• Hash : b8d6f8aa
  Author :
  Date : 2021-07-22T22:31:29
  

  Translator: Facilitate integration in FireFox
  
  Instead of relying on is_apple to build workarounds applied on apple
  hardware, a new build argument is added for this purpose.  This allows
  FireFox to more easily include these files in their build system (which
  builds every workaround on every platform).
  
  The workarounds are reorganized too and moved from tree_ops/gl/mac to
  tree_ops/apple.  RewriteRowMajorMatrices is moved there too as it's now
  used by both gl and metal.  This workaround is large, and removing it
  from non-apple builds improves binary size (~40KB on Linux).
  
  Bug: angleproject:6188
  Change-Id: I8e1dab44d0235bb6b8341d53721bdd0d157d46c6
  Reviewed-on: https://chromium-review.googlesource.com/c/angle/angle/+/3047385
  Reviewed-by: Jeff Gilbert <jgilbert@mozilla.com>
  Reviewed-by: Yuly Novikov <ynovikov@chromium.org>
  Commit-Queue: Shahbaz Youssefi <syoussefi@chromium.org>
  

Download

• src/compiler/translator/tree_ops/apple/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/apple/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