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.
7 #include "compiler/translator/IntermNode.h"
8 #include "compiler/translator/RemoveTree.h"
11 // Code to delete the intermediate tree.
13 void RemoveAllTreeNodes(TIntermNode* root)
15 std::queue<TIntermNode*> nodeQueue;
19 while (!nodeQueue.empty())
21 TIntermNode *node = nodeQueue.front();
24 node->enqueueChildren(&nodeQueue);