daniel@transgaming.com | 4f39fd9 | 2010-03-08 20:26:45 +0000 | [diff] [blame] | 1 | // |
| 2 | // Copyright (c) 2002-2010 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 | |
Jamie Madill | b1a85f4 | 2014-08-19 15:23:24 -0400 | [diff] [blame^] | 7 | #include "compiler/translator/IntermNode.h" |
Geoff Lang | 1773282 | 2013-08-29 13:46:49 -0400 | [diff] [blame] | 8 | #include "compiler/translator/RemoveTree.h" |
daniel@transgaming.com | bbf56f7 | 2010-04-20 18:52:13 +0000 | [diff] [blame] | 9 | |
daniel@transgaming.com | 4f39fd9 | 2010-03-08 20:26:45 +0000 | [diff] [blame] | 10 | // |
Jamie Madill | dd0d342 | 2014-03-26 14:01:56 -0400 | [diff] [blame] | 11 | // Code to delete the intermediate tree. |
daniel@transgaming.com | 4f39fd9 | 2010-03-08 20:26:45 +0000 | [diff] [blame] | 12 | // |
| 13 | void RemoveAllTreeNodes(TIntermNode* root) |
| 14 | { |
Jamie Madill | dd0d342 | 2014-03-26 14:01:56 -0400 | [diff] [blame] | 15 | std::queue<TIntermNode*> nodeQueue; |
daniel@transgaming.com | 4f39fd9 | 2010-03-08 20:26:45 +0000 | [diff] [blame] | 16 | |
Jamie Madill | dd0d342 | 2014-03-26 14:01:56 -0400 | [diff] [blame] | 17 | nodeQueue.push(root); |
| 18 | |
| 19 | while (!nodeQueue.empty()) |
| 20 | { |
| 21 | TIntermNode *node = nodeQueue.front(); |
| 22 | nodeQueue.pop(); |
| 23 | |
| 24 | node->enqueueChildren(&nodeQueue); |
| 25 | |
| 26 | delete node; |
| 27 | } |
daniel@transgaming.com | 4f39fd9 | 2010-03-08 20:26:45 +0000 | [diff] [blame] | 28 | } |
| 29 | |