ROSE  0.11.96.11
rtiHelpers.h
1 #ifndef ROSE_RTIHELPERS_H
2 #define ROSE_RTIHELPERS_H
3 
4 #include <string>
5 #include <vector>
6 #include <list>
7 #include <set>
8 #include <sstream>
9 #include <iomanip>
10 #include <boost/lexical_cast.hpp>
11 #include <Sawyer/BitVector.h>
12 
13 // Helpful functions for Cxx_GrammarRTI.C
14 // Probably should not be included anywhere else
15 
16 #if ROSE_USE_VALGRIND
17 #include <valgrind/valgrind.h>
18 #include <valgrind/memcheck.h>
19 #include <stdio.h>
20 static void doUninitializedFieldCheck(const char* fieldName, void* fieldPointer, size_t fieldSize, void* wholeObject, const char* className) {
21  if (VALGRIND_CHECK_READABLE(fieldPointer, fieldSize)) {
22  fprintf(stderr, "Warning: uninitialized field p_%s of object %p of class %s\n", fieldName, wholeObject, className);
23  }
24 }
25 #endif
26 
27 template <typename T>
28 static std::string toStringForRTI(const T& x) {
29  std::ostringstream ss;
30  ss << x;
31  return ss.str();
32 }
33 
34 inline std::string toStringForRTI(const Sawyer::Container::BitVector &x) {
35  return "0x" + x.toHex();
36 }
37 
38 template <typename T>
39 static std::string toStringForRTI(const std::vector<T>& x) {
40  std::ostringstream ss;
41  ss << "[";
42  for (typename std::vector<T>::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << (*i);}
43  ss << "]";
44  return ss.str();
45 }
46 
47 // DQ (8/8/2008): Added support for type used in binary file format support.
48 template <typename T>
49 static std::string toStringForRTI(const std::vector<std::pair<T,T> >& x) {
50  std::ostringstream ss;
51  ss << "[";
52  for (typename std::vector<std::pair<T,T> >::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << i->first << "->" << i->second;}
53  ss << "]";
54  return ss.str();
55 }
56 
57 // std::vector < std::pair <SgOmpClause::omp_map_dist_data_enum, SgExpression*> >
58 template <typename F, typename S> // First and Second
59 static std::string toStringForRTI(const std::vector<std::pair<F,S> >& x) {
60  std::ostringstream ss;
61  ss << "[";
62  for (typename std::vector<std::pair<F,S> >::const_iterator i = x.begin(); i != x.end(); ++i)
63  {if (i != x.begin()) ss << ", "; ss << i->first << "->" << i->second;}
64  ss << "]";
65  return ss.str();
66 }
67 
68 #if 0 // not used
69 static std::string toStringForRTI(const ExtentMap &x)
70 {
71  std::ostringstream ss;
72  ss << "[";
73  for (ExtentMap::const_iterator i=x.begin(); i!=x.end(); ++i) {
74  if (i!=x.begin())
75  ss << ", ";
76  ss << i->first << "->" << i->second;
77  }
78  ss <<"]";
79  return ss.str();
80 }
81 #endif
82 
83 static std::string toStringForRTI(const std::vector<bool>& x) {
84  std::ostringstream ss;
85  ss << "[";
86  for (std::vector<bool>::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << (*i ? "T" : "F");}
87  ss << "]";
88  return ss.str();
89 }
90 
91 template <typename T>
92 static std::string toStringForRTI(const std::list<T>& x) {
93  std::ostringstream ss;
94  ss << "[";
95  for (typename std::list<T>::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << (*i);}
96  ss << "]";
97  return ss.str();
98 }
99 
100 template <typename T>
101 static std::string toStringForRTI(const std::list<list<T> >& x) {
102  std::ostringstream ss;
103  ss << "[";
104  for (typename std::list<list<T> >::const_iterator i = x.begin(); i != x.end(); ++i) {
105  }
106  ss << "]";
107  return ss.str();
108 }
109 
110 template <typename T>
111 static std::string toStringForRTI(const std::set<T>& x) {
112  std::ostringstream ss;
113  ss << "[";
114  for (typename std::set<T>::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << (*i);}
115  ss << "]";
116  return ss.str();
117 }
118 
119 template <typename K, typename V>
120 static std::string toStringForRTI(const std::map<K, V>& x) {
121  std::ostringstream ss;
122  ss << "[";
123  for (typename std::map<K, V>::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << i->first << "->" << toStringForRTI(i->second);}
124  ss << "]";
125  return ss.str();
126 }
127 
128 // negara1 (06/27/2011): Added support for the map of including files (field p_preprocessorDirectivesAndCommentsList)
129 template <typename K>
130 static std::string toStringForRTI(const std::map<K, std::set<PreprocessingInfo*> >& x) {
131  std::ostringstream ss;
132  ss << "[";
133  for (typename std::map<K, std::set<PreprocessingInfo*> >::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << i->first << "->" << toStringForRTI(i->second);}
134  ss << "]";
135  return ss.str();
136 }
137 
138 // DQ (4/30/2009): Added new support for std::multimap.
139 template <typename K, typename V>
140 static std::string toStringForRTI(const std::multimap<K, V>& x) {
141  std::ostringstream ss;
142  ss << "[";
143  for (typename std::multimap<K, V>::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << i->first << "->" << i->second;}
144  ss << "]";
145  return ss.str();
146 }
147 
148 #if 0
149 static std::string toStringForRTI(const std::map<std::pair<int,std::pair<int,int> >, uint64_t > & x) {
150  std::ostringstream ss;
151  ss << "[";
152 // for (std::vector<bool>::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << (*i ? "T" : "F");}
153  ss << "]";
154  return ss.str();
155 }
156 #endif
157 
158 #if 0
159 static std::string toStringForRTI(const std::map<uint64_t ,std::pair<int,std::pair<int,int> > > & x) {
160  std::ostringstream ss;
161  ss << "[";
162 // for (std::vector<bool>::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << (*i ? "T" : "F");}
163  ss << "]";
164  return ss.str();
165 }
166 #endif
167 
168 #if 1
169 // #if !OLD_GRAPH_NODES
170 //#ifdef ROSE_USE_NEW_GRAPH_NODES
171 // DQ (8/18/2008): Added support for new Graph IR node.
172 
173 #ifdef ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY
174 // static std::string toStringForRTI(const SgGraphNodeDirectedGraphEdgeMultimapPtrList & x)
175 static std::string toStringForRTI(const rose_graph_node_edge_hash_multimap & x)
176 {
177  std::ostringstream ss;
178  ss << "[";
179 // for (SgGraphNodeUndirectedGraphEdgeMultimapPtrList::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << i->first << "->" << i->second;}
180  ss << "]";
181  return ss.str();
182 }
183 #endif
184 
185 static std::string toStringForRTI(const rose_graph_integer_node_hash_map & x)
186 {
187  std::ostringstream ss;
188  ss << "[";
189 // for (SgGraphNodeUndirectedGraphEdgeMultimapPtrList::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << i->first << "->" << i->second;}
190  ss << "]";
191  return ss.str();
192 }
193 
194 static std::string toStringForRTI(const rose_graph_integer_edge_hash_map & x)
195 {
196  std::ostringstream ss;
197  ss << "[";
198 // for (SgGraphNodeUndirectedGraphEdgeMultimapPtrList::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << i->first << "->" << i->second;}
199  ss << "]";
200  return ss.str();
201 }
202 
203 static std::string toStringForRTI(const rose_graph_integer_edge_hash_multimap & x)
204 {
205  std::ostringstream ss;
206  ss << "[";
207 // for (SgGraphNodeUndirectedGraphEdgeMultimapPtrList::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << i->first << "->" << i->second;}
208  ss << "]";
209  return ss.str();
210 }
211 
212 static std::string toStringForRTI(const rose_graph_string_integer_hash_multimap & x)
213 {
214  std::ostringstream ss;
215  ss << "[";
216 // for (rose_graph_string_integer_hash_multimap::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << i->first << "->" << i->second;}
217  ss << "]";
218  return ss.str();
219 }
220 
221 static std::string toStringForRTI(const rose_graph_integerpair_edge_hash_multimap & x)
222 {
223  std::ostringstream ss;
224  ss << "[";
225 // for (rose_graph_string_integer_hash_multimap::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << i->first << "->" << i->second;}
226  ss << "]";
227  return ss.str();
228 }
229 
230 #if 0
231 // DQ (4/30/2009): Removed these in favor of the hash_multimap using the SgGraphEdge class.
232 static std::string toStringForRTI(const rose_undirected_graph_hash_multimap & x)
233 {
234  std::ostringstream ss;
235  ss << "[";
236 // for (SgGraphNodeUndirectedGraphEdgeMultimapPtrList::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << i->first << "->" << i->second;}
237  ss << "]";
238  return ss.str();
239 }
240 #endif
241 
242 #if 0
243 // DQ (4/30/2009): Removed these in favor of the hash_multimap using the SgGraphEdge class.
244 static std::string toStringForRTI(const rose_directed_graph_hash_multimap & x)
245 {
246  std::ostringstream ss;
247  ss << "[";
248 // for (SgGraphNodeDirectedGraphEdgeMultimapPtrList::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << i->first << "->" << i->second;}
249  ss << "]";
250  return ss.str();
251 }
252 #endif
253 
254 #ifdef ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY
255 // DQ (8/18/2008): Added support for new Graph IR node.
256 // static std::string toStringForRTI(const SgStringGraphNodeMapPtrList & x)
257 static std::string toStringForRTI(const rose_graph_hash_multimap & x)
258 {
259  std::ostringstream ss;
260  ss << "[";
261 // for (SgStringGraphNodeMapPtrList::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << i->first << "->" << i->second;}
262  ss << "]";
263  return ss.str();
264 }
265 #endif
266 
267 #if 0
268 // DQ (5/1/2009): This is no longer used and is replaced by an implementation using a hash_map.
269 // DQ (8/18/2008): Added support for new Graph IR node.
270 // static std::string toStringForRTI(const SgIntegerGraphNodeMapPtrList & x)
271 static std::string toStringForRTI(const std::map<int, SgGraphNode*> & x)
272 {
273  std::ostringstream ss;
274  ss << "[";
275 // for (SgIntegerGraphNodeMapPtrList::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << i->first << "->" << i->second;}
276  for (std::map<int, SgGraphNode*>::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << i->first << "->" << i->second;}
277  ss << "]";
278  return ss.str();
279 }
280 #endif
281 
282 #if 0
283 // DQ (4/25/2009): This is now redundant...
284 // DQ (8/18/2008): Added support for new Graph IR node.
285 // static std::string toStringForRTI(const SgGraphNodeUndirectedGraphEdgeMultimapPtrList & x)
286 static std::string toStringForRTI(const rose_undirected_graph_hash_multimap & x)
287 {
288  std::ostringstream ss;
289  ss << "[";
290 // for (SgGraphNodeUndirectedGraphEdgeMultimapPtrList::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << i->first << "->" << i->second;}
291  ss << "]";
292  return ss.str();
293 }
294 #endif
295 #endif
296 //#endif
297 // end condition new_graph
298 
299 static std::string toStringForRTI(const SgAccessModifier& m) {
300  return m.displayString();
301 }
302 
303 static std::string toStringForRTI(const SgUPC_AccessModifier& m) {
304  return m.displayString();
305 }
306 
307 static std::string toStringForRTI(const SgConstVolatileModifier& m) {
308  return m.displayString();
309 }
310 
311 static std::string toStringForRTI(const SgElaboratedTypeModifier& m) {
312  return m.displayString();
313 }
314 
315 static std::string toStringForRTI(const SgTypeModifier& m) {
316  return m.displayString();
317 }
318 
319 static std::string toStringForRTI(const SgStorageModifier& m) {
320  return m.displayString();
321 }
322 
323 static std::string toStringForRTI(const SgDeclarationModifier& m) {
324  return m.displayString();
325 }
326 
327 static std::string toStringForRTI(const SgFunctionModifier& m) {
328  return m.displayString();
329 }
330 
331 static std::string toStringForRTI(const SgSpecialFunctionModifier& m) {
332  return m.displayString();
333 }
334 
335 static std::string toStringForRTI(const SgName& n) {
336  return n.getString();
337 }
338 
339 static std::string toStringForRTI(const SgFunctionModifier::opencl_work_group_size_t & x) {
340  std::ostringstream os;
341  os << " ( " << x.x << ", " << x.y << ", " << x.z << " ) ";
342  return os.str();
343 }
344 
345 #if 0
346 // None of these seem to be used
347 
348 template <typename Sym>
349 static std::string toStringForRTISymbol(Sym* sym) {
350  std::ostringstream ss;
351  ss << sym;
352  if (sym) {
353  ss << ": varsym " << sym->get_name().str() << " declared at 0x" << std::hex << (sym->get_declaration());
354  }
355  return ss.str();
356 }
357 
358 static std::string toStringForRTI(SgVariableSymbol* sym) {return toStringForRTISymbol(sym);}
359 static std::string toStringForRTI(SgFunctionSymbol* sym) {return toStringForRTISymbol(sym);}
360 static std::string toStringForRTI(SgMemberFunctionSymbol* sym) {return toStringForRTISymbol(sym);}
361 
362 static std::string toStringForRTI(const SgSymbolTable&) {return "<no output operator defined for this type>";}
363 static std::string toStringForRTI(const SgSymbolHashBase::iterator&) {return "<no output operator defined for this type>";}
364 #endif
365 
366 void doRTI(const char* fieldNameBase, void* fieldPtr, size_t fieldSize, void* thisPtr, const char* className, const char* typeString, const char* fieldName, const std::string& fieldContents, RTIMemberData& memberData);
367 
368 #endif // ROSE_RTIHELPERS_H
SgFunctionModifier::opencl_work_group_size_t
Definition: Cxx_Grammar.h:10725
SgVariableSymbol
This class represents the concept of a variable name within the compiler (a shared container for the ...
Definition: Cxx_Grammar.h:321540
RTIMemberData
Access to C++ Run Time Information (RTI)
Definition: Cxx_Grammar.h:6451
SgMemberFunctionSymbol
Definition: Cxx_Grammar.h:323344
SgFunctionModifier
Definition: Cxx_Grammar.h:10648
SgSpecialFunctionModifier
Definition: Cxx_Grammar.h:11889
SgUPC_AccessModifier
Definition: Cxx_Grammar.h:11379
Sawyer::Container::BitVector
Bit vectors.
Definition: BitVector.h:64
SgTypeModifier
Definition: Cxx_Grammar.h:14390
rose_graph_node_edge_hash_multimap
Definition: Cxx_Grammar.h:6064
rose_graph_integerpair_edge_hash_multimap
Definition: Cxx_Grammar.h:6301
SgElaboratedTypeModifier
Definition: Cxx_Grammar.h:12406
rose_graph_integer_edge_hash_map
Definition: Cxx_Grammar.h:6189
SgName
This class represents strings within the IR nodes.
Definition: Cxx_Grammar.h:16476
rose_graph_string_node_hash_multimap
Definition: Cxx_Grammar.h:5995
Sawyer::Container::BitVector::toHex
std::string toHex(const BitRange &range) const
Convert to a hexadecimal string.
Definition: BitVector.h:1249
rose_graph_string_integer_hash_multimap
Definition: Cxx_Grammar.h:6360
SgAccessModifier
Definition: Cxx_Grammar.h:10143
SgDeclarationModifier
This class represents modifiers for SgDeclaration (declaration statements).
Definition: Cxx_Grammar.h:15263
SgSymbolTable
This class represents the symbol tables used in both SgScopeStatement and the SgFunctionTypeSymbolTab...
Definition: Cxx_Grammar.h:17148
SgConstVolatileModifier
Definition: Cxx_Grammar.h:9040
rose_graph_integer_edge_hash_multimap
Definition: Cxx_Grammar.h:6247
SgFunctionSymbol
Definition: Cxx_Grammar.h:322891
SgStorageModifier
This class represents modifiers specific to storage.
Definition: Cxx_Grammar.h:9538
rose_graph_integer_node_hash_map
Definition: Cxx_Grammar.h:6127
Generated on Mon Dec 19 2022 23:39:54 for ROSE by   doxygen 1.8.17