Olli Etuaho | cccf2b0 | 2017-07-05 14:50:54 +0300 | [diff] [blame] | 1 | // |
| 2 | // Copyright (c) 2017 The ANGLE Project Authors. All rights reserved. |
| 3 | // Use of this source code is governed by a BSD-style license that can be |
| 4 | // found in the LICENSE file. |
| 5 | // |
| 6 | |
| 7 | #include "compiler/translator/IsASTDepthBelowLimit.h" |
| 8 | |
Olli Etuaho | c26214d | 2018-03-16 10:43:11 +0200 | [diff] [blame] | 9 | #include "compiler/translator/tree_util/IntermTraverse.h" |
Olli Etuaho | cccf2b0 | 2017-07-05 14:50:54 +0300 | [diff] [blame] | 10 | |
| 11 | namespace sh |
| 12 | { |
| 13 | |
| 14 | namespace |
| 15 | { |
| 16 | |
| 17 | // Traverse the tree and compute max depth. Takes a maximum depth limit to prevent stack overflow. |
| 18 | class MaxDepthTraverser : public TIntermTraverser |
| 19 | { |
| 20 | public: |
Olli Etuaho | 4002e92 | 2018-04-04 16:55:34 +0300 | [diff] [blame^] | 21 | MaxDepthTraverser(int depthLimit) : TIntermTraverser(true, false, false, nullptr) |
Olli Etuaho | cccf2b0 | 2017-07-05 14:50:54 +0300 | [diff] [blame] | 22 | { |
Olli Etuaho | 4002e92 | 2018-04-04 16:55:34 +0300 | [diff] [blame^] | 23 | setMaxAllowedDepth(depthLimit); |
Olli Etuaho | cccf2b0 | 2017-07-05 14:50:54 +0300 | [diff] [blame] | 24 | } |
Olli Etuaho | cccf2b0 | 2017-07-05 14:50:54 +0300 | [diff] [blame] | 25 | }; |
| 26 | |
| 27 | } // anonymous namespace |
| 28 | |
| 29 | bool IsASTDepthBelowLimit(TIntermNode *root, int maxDepth) |
| 30 | { |
| 31 | MaxDepthTraverser traverser(maxDepth + 1); |
| 32 | root->traverse(&traverser); |
| 33 | |
| 34 | return traverser.getMaxDepth() <= maxDepth; |
| 35 | } |
| 36 | |
| 37 | } // namespace sh |