blob: 73cb9d18331a0a8462c9d144e6a7a2f4d06db03b (
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
|
//
// Copyright (c) 2017 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/IsASTDepthBelowLimit.h"
#include "compiler/translator/tree_util/IntermTraverse.h"
namespace sh
{
namespace
{
// Traverse the tree and compute max depth. Takes a maximum depth limit to prevent stack overflow.
class MaxDepthTraverser : public TIntermTraverser
{
public:
MaxDepthTraverser(int depthLimit) : TIntermTraverser(true, false, false, nullptr)
{
setMaxAllowedDepth(depthLimit);
}
};
} // anonymous namespace
bool IsASTDepthBelowLimit(TIntermNode *root, int maxDepth)
{
MaxDepthTraverser traverser(maxDepth + 1);
root->traverse(&traverser);
return traverser.getMaxDepth() <= maxDepth;
}
} // namespace sh
|
