00001 // ---------------------------------------------------------------------- 00002 // 00003 // C-Breeze 00004 // C Compiler Framework 00005 // 00006 // Copyright (c) 2000 University of Texas at Austin 00007 // 00008 // Samuel Z. Guyer 00009 // Daniel A. Jimenez 00010 // Calvin Lin 00011 // 00012 // Permission is hereby granted, free of charge, to any person 00013 // obtaining a copy of this software and associated documentation 00014 // files (the "Software"), to deal in the Software without 00015 // restriction, including without limitation the rights to use, copy, 00016 // modify, merge, publish, distribute, sublicense, and/or sell copies 00017 // of the Software, and to permit persons to whom the Software is 00018 // furnished to do so, subject to the following conditions: 00019 // 00020 // The above copyright notice and this permission notice shall be 00021 // included in all copies or substantial portions of the Software. 00022 // 00023 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 00024 // EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 00025 // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 00026 // NONINFRINGEMENT. IN NO EVENT SHALL THE UNIVERSITY OF TEXAS AT 00027 // AUSTIN BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER 00028 // IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF 00029 // OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN 00030 // THE SOFTWARE. 00031 // 00032 // We acknowledge the C-to-C Translator from MIT Laboratory for 00033 // Computer Science for inspiring parts of the C-Breeze design. 00034 // 00035 // ---------------------------------------------------------------------- 00036 00037 #ifndef CBZ_CALLGRAPH_WALKER_H 00038 #define CBZ_CALLGRAPH_WALKER_H 00039 00040 00041 typedef pair< procNode *, unitNode * > procpair; 00042 00043 typedef map<string, 00044 procpair, 00045 less< string > > procnode_map; 00046 00047 typedef procnode_map::iterator procnode_map_p; 00048 00049 class callgraph_walker : public Walker 00050 { 00051 public: 00052 00053 // -- Use this interface to access the walker.. 00054 00055 static void graph(); 00056 00057 protected: 00058 00059 procnode_map _procs; 00060 unitNode * _cur_unit; 00061 00062 callgraph_walker() 00063 : Walker(Preorder, Subtree), 00064 _procs() 00065 { 00066 find_procs(); 00067 } 00068 00069 void find_procs(); 00070 00071 public: 00072 00073 // -- Keep track of the current translation unit... 00074 00075 inline unitNode * cur_unit() const { return _cur_unit; } 00076 inline void cur_unit(unitNode * u) { _cur_unit = u; } 00077 00078 // -- Handle the callNodes... 00079 00080 virtual void at_call(callNode * the_call, Order ord); 00081 }; 00082 00083 00084 #endif // CBZ_CALLGRAPH_WALKER_H