kc3-lang/angle/src/compiler/translator/DetectDiscontinuity.h

Branch : - branch - main - tag -

• Show log

  Commit

• Author : Geoff Lang
  Date : 2014-11-19 16:18:08
  Hash : 0a73dd85
  Message : Fix include guards. BUG=angle:733 Change-Id: I08b2c11c4831f1161c178c1842b10e807185aced Reviewed-on: https://chromium-review.googlesource.com/230831 Reviewed-by: Jamie Madill <jmadill@chromium.org> Tested-by: Geoff Lang <geofflang@chromium.org>

• src/compiler/translator/DetectDiscontinuity.h

• //
  // Copyright (c) 2012 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.
  //
  // Contains analysis utilities for dealing with HLSL's lack of support for
  // the use of intrinsic functions which (implicitly or explicitly) compute
  // gradients of functions with discontinuities. 
  //
  
  #ifndef COMPILER_TRANSLATOR_DETECTDISCONTINUITY_H_
  #define COMPILER_TRANSLATOR_DETECTDISCONTINUITY_H_
  
  #include "compiler/translator/IntermNode.h"
  
  namespace sh
  {
  // Checks whether a loop can run for a variable number of iterations
  class DetectLoopDiscontinuity : public TIntermTraverser
  {
    public:
      bool traverse(TIntermNode *node);
  
    protected:
      bool visitBranch(Visit visit, TIntermBranch *node);
      bool visitLoop(Visit visit, TIntermLoop *loop);
      bool visitAggregate(Visit visit, TIntermAggregate *node);
  
      int mLoopDepth;
      bool mLoopDiscontinuity;
  };
  
  bool containsLoopDiscontinuity(TIntermNode *node);
  
  // Checks for the existence of any loop
  class DetectAnyLoop : public TIntermTraverser
  {
  public:
      bool traverse(TIntermNode *node);
  
  protected:
      bool visitBinary(Visit, TIntermBinary *);
      bool visitUnary(Visit, TIntermUnary *);
      bool visitSelection(Visit, TIntermSelection *);
      bool visitAggregate(Visit, TIntermAggregate *);
      bool visitLoop(Visit, TIntermLoop *);
      bool visitBranch(Visit, TIntermBranch *);
  
      bool mHasLoop;
  };
  
  bool containsAnyLoop(TIntermNode *node);
  
  // Checks for intrinsic functions which compute gradients
  class DetectGradientOperation : public TIntermTraverser
  {
    public:
      bool traverse(TIntermNode *node);
  
    protected:
      bool visitUnary(Visit visit, TIntermUnary *node);
      bool visitAggregate(Visit visit, TIntermAggregate *node);
  
      bool mGradientOperation;
  };
  
  bool containsGradientOperation(TIntermNode *node);
  
  }
  
  #endif   // COMPILER_TRANSLATOR_DETECTDISCONTINUITY_H_