src/mesa/shader/slang/MachineIndependent/RemoveTree.cpp

   1 //
   2 //Copyright (C) 2002-2005  3Dlabs Inc. Ltd.
   3 //All rights reserved.
   4 //
   5 //Redistribution and use in source and binary forms, with or without
   6 //modification, are permitted provided that the following conditions
   7 //are met:
   8 //
   9 //    Redistributions of source code must retain the above copyright
  10 //    notice, this list of conditions and the following disclaimer.
  11 //
  12 //    Redistributions in binary form must reproduce the above
  13 //    copyright notice, this list of conditions and the following
  14 //    disclaimer in the documentation and/or other materials provided
  15 //    with the distribution.
  16 //
  17 //    Neither the name of 3Dlabs Inc. Ltd. nor the names of its
  18 //    contributors may be used to endorse or promote products derived
  19 //    from this software without specific prior written permission.
  20 //
  21 //THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  22 //"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  23 //LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
  24 //FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
  25 //COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
  26 //INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
  27 //BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  28 //LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  29 //CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  30 //LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
  31 //ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  32 //POSSIBILITY OF SUCH DAMAGE.
  33 //
  34
  35 #include "../Include/intermediate.h"
  36 #include "RemoveTree.h"
  37 //
  38 // Code to recursively delete the intermediate tree.
  39 //
  40
  41 void RemoveSymbol(TIntermSymbol* node, TIntermTraverser* it)
  42 {
  43         delete node;
  44 }
  45
  46 bool RemoveBinary(bool  /*preVisit*/ , TIntermBinary* node, TIntermTraverser*)
  47 {
  48         delete node;
  49
  50         return true;
  51 }
  52
  53 bool RemoveUnary(bool /*preVisit */, TIntermUnary* node, TIntermTraverser*)
  54 {
  55     delete node;
  56
  57         return true;
  58 }
  59
  60 bool RemoveAggregate(bool  /*preVisit*/ , TIntermAggregate* node, TIntermTraverser*)
  61 {
  62         delete node;
  63
  64         return true;
  65 }
  66
  67 bool RemoveSelection(bool  /*preVisit*/ , TIntermSelection* node, TIntermTraverser*)
  68 {
  69         delete node;
  70
  71         return true;
  72 }
  73
  74 void RemoveConstantUnion(TIntermConstantUnion* node, TIntermTraverser*)
  75 {
  76         delete node;
  77 }
  78
  79 //
  80 // Entry point.
  81 //
  82 void RemoveAllTreeNodes(TIntermNode* root)
  83 {
  84     TIntermTraverser it;
  85
  86     it.visitAggregate     = RemoveAggregate;
  87     it.visitBinary        = RemoveBinary;
  88     it.visitConstantUnion = RemoveConstantUnion;
  89     it.visitSelection     = RemoveSelection;
  90     it.visitSymbol        = RemoveSymbol;
  91     it.visitUnary         = RemoveUnary;
  92
  93         it.preVisit = false;
  94         it.postVisit = true;
  95
  96     root->traverse(&it);
  97 }
  98