 |
C-Breeze C Compiler Infrastructure [ Project home page] |
Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Namespace Members | Class Members | File Members | Related Pages
df_number_walker.h
Go to the documentation of this file.00001 // $Id: df_number_walker.h,v 1.5 2003/08/07 23:14:13 pnav Exp $ 00002 // ---------------------------------------------------------------------- 00003 // 00004 // C-Breeze 00005 // C Compiler Framework 00006 // 00007 // Copyright (c) 2000 University of Texas at Austin 00008 // 00009 // Samuel Z. Guyer 00010 // Daniel A. Jimenez 00011 // Calvin Lin 00012 // 00013 // Permission is hereby granted, free of charge, to any person 00014 // obtaining a copy of this software and associated documentation 00015 // files (the "Software"), to deal in the Software without 00016 // restriction, including without limitation the rights to use, copy, 00017 // modify, merge, publish, distribute, sublicense, and/or sell copies 00018 // of the Software, and to permit persons to whom the Software is 00019 // furnished to do so, subject to the following conditions: 00020 // 00021 // The above copyright notice and this permission notice shall be 00022 // included in all copies or substantial portions of the Software. 00023 // 00024 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 00025 // EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 00026 // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 00027 // NONINFRINGEMENT. IN NO EVENT SHALL THE UNIVERSITY OF TEXAS AT 00028 // AUSTIN BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER 00029 // IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF 00030 // OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN 00031 // THE SOFTWARE. 00032 // 00033 // We acknowledge the C-to-C Translator from MIT Laboratory for 00034 // Computer Science for inspiring parts of the C-Breeze design. 00035 // 00036 // ---------------------------------------------------------------------- 00037 00038 #ifndef CBZ_DF_NUMBER_WALKER_H 00039 #define CBZ_DF_NUMBER_WALKER_H 00040 00041 00045 class df_number_walker : public Walker 00046 { 00047 public: 00048 00049 static numbering_map * number(Node * n, Order the_order) 00050 { 00051 df_number_walker w(the_order); 00052 n->walk(w); 00053 return w.result(); 00054 } 00055 00056 private: 00057 00058 int _cur; 00059 numbering_map * _m; 00060 00061 public: 00062 00063 df_number_walker(Order the_order) 00064 : Walker(the_order, Subtree), 00065 _cur(0), 00066 _m(new numbering_map()) 00067 {} 00068 00069 // -- Return the resulting numbering.. 00070 00071 numbering_map * result() { return _m; } 00072 00073 // -- At any node, simply enter it into the map 00074 00075 virtual void at_node(Node * the_node, Order ord) 00076 { 00077 if (order() == ord) { 00078 (*_m)[the_node] = _cur; 00079 ++_cur; 00080 } 00081 } 00082 }; 00083 00084 00085 #endif // CBZ_DF_NUMBER_WALKER_H