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
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
//
// Copyright (C) 2002-2005  3Dlabs Inc. Ltd.
// Copyright (C) 2013 LunarG, Inc.
//
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
//
//    Redistributions of source code must retain the above copyright
//    notice, this list of conditions and the following disclaimer.
//
//    Redistributions in binary form must reproduce the above
//    copyright notice, this list of conditions and the following
//    disclaimer in the documentation and/or other materials provided
//    with the distribution.
//
//    Neither the name of 3Dlabs Inc. Ltd. nor the names of its
//    contributors may be used to endorse or promote products derived
//    from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
// FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
// COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
// INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
// BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
// CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
// LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
// ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
//

#include "../Include/intermediate.h"
#include "RemoveTree.h"

namespace glslang {

//
// Code to recursively delete the intermediate tree.
//
struct TRemoveTraverser : TIntermTraverser {
    TRemoveTraverser() : TIntermTraverser(false, false, true, false) {}

    virtual void visitSymbol(TIntermSymbol* node)<--- Function in derived class
    {
        delete node;
    }

    virtual bool visitBinary(TVisit /* visit*/ , TIntermBinary* node)<--- Function in derived class
    {
        delete node;

        return true;
    }

    virtual bool visitUnary(TVisit /* visit */, TIntermUnary* node)<--- Function in derived class
    {
        delete node;

        return true;
    }

    virtual bool visitAggregate(TVisit /* visit*/ , TIntermAggregate* node)<--- Function in derived class
    {
        delete node;

        return true;
    }

    virtual bool visitSelection(TVisit /* visit*/ , TIntermSelection* node)<--- Function in derived class
    {
        delete node;

        return true;
    }

    virtual bool visitSwitch(TVisit /* visit*/ , TIntermSwitch* node)<--- Function in derived class
    {
        delete node;

        return true;
    }

    virtual void visitConstantUnion(TIntermConstantUnion* node)<--- Function in derived class
    {
        delete node;
    }

    virtual bool visitLoop(TVisit /* visit*/ , TIntermLoop* node)<--- Function in derived class
    {
        delete node;

        return true;
    }

    virtual bool visitBranch(TVisit /* visit*/ , TIntermBranch* node)<--- Function in derived class
    {
        delete node;

        return true;
    }
};

//
// Entry point.
//
void RemoveAllTreeNodes(TIntermNode* root)
{
    TRemoveTraverser it;

    root->traverse(&it);
}

} // end namespace glslang