summaryrefslogtreecommitdiffstats
path: root/src/3rdparty/angle/src/compiler/translator/DetectDiscontinuity.h
blob: 67e37be398187512b41f446e699106efb538dac2 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
//
// 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_DETECTDISCONTINUITY_H_
#define COMPILER_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_DETECTDISCONTINUITY_H_