Context Navigation

source: src/CodeTools/DeclStats.cc @ 8573729

resolv-new

Last change on this file since 8573729 was a16764a6, checked in by Thierry Delisle <tdelisle@…>, 7 years ago
Changed warning system to prepare for toggling warnings
Property mode set to `100644`
File size: 22.2 KB

Line
1	//
2	// Cforall Version 1.0.0 Copyright (C) 2015 University of Waterloo
3	//
4	// The contents of this file are covered under the licence agreement in the
5	// file "LICENCE" distributed with Cforall.
6	//
7	// DeclStats.cc --
8	//
9	// Author : Aaron Moss
10	// Created On : Wed Jan 31 16:40:00 2016
11	// Last Modified By : Aaron Moss
12	// Last Modified On : Wed Jan 31 16:40:00 2016
13	// Update Count : 1
14	//
15
16	#include "DeclStats.h"
17
18	#include <iostream> // for operator<<, basic_ostream, cout
19	#include <map> // for map
20	#include <string> // for string, operator+, operator<<, cha...
21	#include <unordered_map> // for unordered_map
22	#include <unordered_set> // for unordered_set
23	#include <utility> // for pair, make_pair
24
25	#include "Common/PassVisitor.h"
26	#include "Common/VectorMap.h" // for VectorMap
27	#include "GenPoly/GenPoly.h" // for hasPolyBase
28	#include "Parser/LinkageSpec.h" // for ::NoOfSpecs, Spec
29	#include "SynTree/Declaration.h" // for FunctionDecl, TypeDecl, Declaration
30	#include "SynTree/Expression.h" // for UntypedExpr, Expression
31	#include "SynTree/Statement.h" // for CompoundStmt
32	#include "SynTree/Type.h" // for Type, FunctionType, PointerType
33	#include "SynTree/Visitor.h" // for maybeAccept, Visitor, acceptAll
34
35	namespace CodeTools {
36
37	struct DeclStats : public WithShortCircuiting {
38	template<typename T>
39	static void sum(T& a, const T& b) { a += b; }
40
41	static void sum(VectorMap<unsigned>& a, const VectorMap<unsigned>& b) {
42	a.reserve( b.size() );
43	for ( unsigned i = 0; i < b.size(); ++i ) {
44	a[i] += b[i];
45	}
46	}
47
48	template<typename K>
49	static void sum(std::map<K, unsigned>& a, const std::map<K, unsigned>& b) {
50	for ( const auto& entry : b ) {
51	a[ entry.first ] += entry.second;
52	}
53	}
54
55	template<typename K>
56	static void sum(std::unordered_map<K, unsigned>& a, const std::unordered_map<K, unsigned>& b) {
57	for ( const auto& entry : b ) {
58	a[ entry.first ] += entry.second;
59	}
60	}
61
62	struct ArgPackStats {
63	VectorMap<unsigned> n; ///< Count of decls with each number of elements
64	VectorMap<unsigned> n_basic; ///< Count of decls with each number of basic type elements
65	VectorMap<unsigned> n_generic; ///< Count of decls with each number of generic type elements
66	VectorMap<unsigned> n_poly; ///< Count of decls with each number of polymorphic elements
67	VectorMap<unsigned> n_compound; ///< Count of decls with each number of non-generic compound types
68	std::map<unsigned, unsigned> p_basic; ///< Count of decls with each percentage of basic type elements
69	std::map<unsigned, unsigned> p_generic; ///< Count of decls with each percentage of generic type elements
70	std::map<unsigned, unsigned> p_poly; ///< Count of decls with each percentage of polymorphic elements
71	std::map<unsigned, unsigned> p_compound; ///< Count of decls with each percentage of non-generic compound type elements
72	VectorMap<unsigned> n_types; ///< Count of decls with each number of distinct types in the pack
73	/// Count of decls with each percentage of new types in lists.
74	/// Types used in the parameter list that recur in the return list are not considered to be new.
75	std::map<unsigned, unsigned> p_new;
76
77	ArgPackStats& operator+= (const ArgPackStats& o) {
78	sum(n, o.n);
79	sum(n_basic, o.n_basic);
80	sum(n_generic, o.n_generic);
81	sum(n_poly, o.n_poly);
82	sum(n_compound, o.n_compound);
83	sum(p_basic, o.p_basic);
84	sum(p_generic, o.p_generic);
85	sum(p_poly, o.p_poly);
86	sum(p_compound, o.p_compound);
87	sum(n_types, o.n_types);
88	sum(p_new, o.p_new);
89
90	return *this;
91	}
92	};
93
94	struct Stats {
95	unsigned n_decls; ///< Total number of declarations
96	/// Count of declarations with each number of assertion parameters
97	VectorMap<unsigned> n_type_params;
98	/// Count of generic types with each number of type parameters
99	VectorMap<unsigned> n_generic_params;
100	/// Count of maximum nesting depth of types
101	VectorMap<unsigned> n_generic_nesting;
102	/// Count of declarations with each name
103	std::unordered_map<std::string, unsigned> by_name;
104	/// Count of uses of each basic type
105	std::unordered_map<std::string, unsigned> basic_type_names;
106	/// Count of uses of each generic type name (includes "", "[]", "()", "[,]")
107	std::unordered_map<std::string, unsigned> generic_type_names;
108	/// Count of uses of each non-generic aggregate type
109	std::unordered_map<std::string, unsigned> compound_type_names;
110	/// Count of decls using each basic type
111	std::unordered_map<std::string, unsigned> basic_type_decls;
112	/// Count of decls using each generic type (includes "", "[]", "()", "[,]")
113	std::unordered_map<std::string, unsigned> generic_type_decls;
114	/// Count of decls using each compound type
115	std::unordered_map<std::string, unsigned> compound_type_decls;
116	/// Stats for the parameter list
117	ArgPackStats params;
118	/// Stats for the return list
119	ArgPackStats returns;
120
121	/// Count of declarations with each number of assertions
122	std::map<unsigned, unsigned> n_assns;
123	/// Stats for the assertions' parameters
124	ArgPackStats assn_params;
125	/// Stats for the assertions' return types
126	ArgPackStats assn_returns;
127
128	Stats() : n_decls(0), n_type_params(), n_generic_params(), n_generic_nesting(),
129	by_name(), basic_type_names(), generic_type_names(), compound_type_names(),
130	basic_type_decls(), generic_type_decls(), compound_type_decls(), params(),
131	returns(), n_assns(), assn_params(), assn_returns() {}
132
133	public:
134	Stats& operator+= (const Stats& o) {
135	sum( n_decls, o.n_decls );
136	sum( n_type_params, o.n_type_params );
137	sum( n_generic_params, o.n_generic_params );
138	sum( n_generic_nesting, o.n_generic_nesting );
139	sum( by_name, o.by_name );
140	sum( basic_type_names, o.basic_type_names );
141	sum( generic_type_names, o.generic_type_names );
142	sum( compound_type_names, o.compound_type_names );
143	sum( basic_type_decls, o.basic_type_decls );
144	sum( generic_type_decls, o.generic_type_decls );
145	sum( compound_type_decls, o.compound_type_decls );
146	sum( params, o.params );
147	sum( returns, o.returns );
148	sum( n_assns, o.n_assns );
149	sum( assn_params, o.assn_params );
150	sum( assn_returns, o.assn_returns );
151
152	return *this;
153	}
154	};
155
156	/// number of counting bins for linkages
157	static const unsigned n_named_specs = 8;
158	/// map from total number of specs to bins
159	static const unsigned ind_for_linkage[16];
160
161	Stats for_linkage[n_named_specs]; ///< Stores separate stats per linkage
162	std::unordered_set<std::string> seen_names; ///< Stores manglenames already seen to avoid double-counting
163	Stats total;
164	/// Count of expressions with (depth, fanout)
165	std::map<std::pair<unsigned, unsigned>, unsigned> exprs_by_fanout_at_depth;
166
167	void countType( const std::string& name, unsigned& n, std::unordered_map<std::string,
168	unsigned>& names, std::unordered_map<std::string, unsigned>& decls,
169	std::unordered_set<std::string>& elSeen ) {
170	++n;
171	++names[ name ];
172	if ( elSeen.insert( name ).second ) { ++decls[ name ]; }
173	}
174
175	void update_max( unsigned& max, unsigned crnt ) {
176	if ( crnt > max ) max = crnt;
177	}
178
179	void analyzeSubtype( Type* ty, Stats& stats, std::unordered_set<std::string>& elSeen,
180	unsigned& n_poly, bool& seen_poly, unsigned& max_depth, unsigned depth ) {
181	unsigned x;
182	analyzeType( ty, stats, elSeen, x, x, n_poly, x, seen_poly, max_depth, depth + 1 );
183	}
184
185	void analyzeSubtypes( std::list<DeclarationWithType*>& tys, Stats& stats,
186	std::unordered_set<std::string>& elSeen, unsigned& n_poly, bool& seen_poly,
187	unsigned& max_depth, unsigned depth, unsigned& n_subs ) {
188	for ( DeclarationWithType* dwt : tys ) {
189	Type* ty = dwt->get_type();
190	n_subs += (unsigned)( dynamic_cast<VoidType*>(ty) != nullptr );
191	analyzeSubtype( ty, stats, elSeen, n_poly, seen_poly, max_depth, depth );
192	}
193	}
194
195	void analyzeSubtypes( std::list<Expression*>& tys, Stats& stats,
196	std::unordered_set<std::string>& elSeen, unsigned& n_poly, bool& seen_poly,
197	unsigned& max_depth, unsigned depth ) {
198	for ( Expression* expr : tys ) {
199	TypeExpr* texpr = dynamic_cast<TypeExpr*>(expr);
200	if ( ! texpr ) continue;
201	Type* ty = texpr->get_type();
202	analyzeSubtype( ty, stats, elSeen, n_poly, seen_poly, max_depth, depth );
203	}
204	}
205
206	void analyzeSubtypes( std::list<Type*>& tys, Stats& stats,
207	std::unordered_set<std::string>& elSeen, unsigned& n_poly, bool& seen_poly,
208	unsigned& max_depth, unsigned depth ) {
209	for ( Type* ty : tys ) {
210	analyzeSubtype( ty, stats, elSeen, n_poly, seen_poly, max_depth, depth );
211	}
212	}
213
214	void analyzeType( Type* ty, Stats& stats, std::unordered_set<std::string>& elSeen,
215	unsigned& n_basic, unsigned& n_generic, unsigned& n_poly, unsigned& n_agg,
216	bool& seen_poly, unsigned& max_depth, unsigned depth = 0 ) {
217	if ( BasicType* bt = dynamic_cast<BasicType*>(ty) ) {
218	std::string name = BasicType::typeNames[ bt->get_kind() ];
219	countType( name, n_basic, stats.basic_type_names, stats.basic_type_decls, elSeen );
220	update_max( max_depth, depth );
221	} else if ( PointerType* pt = dynamic_cast<PointerType*>(ty) ) {
222	std::string name = "*";
223	countType(
224	name, n_generic, stats.generic_type_names, stats.generic_type_decls, elSeen);
225	analyzeSubtype(
226	pt->get_base(), stats, elSeen, n_poly, seen_poly, max_depth, depth );
227	++stats.n_generic_params.at( 1 );
228	} else if ( ArrayType* at = dynamic_cast<ArrayType*>(ty) ) {
229	std::string name = "[]";
230	countType(
231	name, n_generic, stats.generic_type_names, stats.generic_type_decls, elSeen);
232	analyzeSubtype(
233	at->get_base(), stats, elSeen, n_poly, seen_poly, max_depth, depth );
234	++stats.n_generic_params.at( 1 );
235	} else if ( ReferenceType* rt = dynamic_cast<ReferenceType*>(ty) ) {
236	std::string name = "&";
237	countType(
238	name, n_generic, stats.generic_type_names, stats.generic_type_decls, elSeen);
239	analyzeSubtype(
240	rt->get_base(), stats, elSeen, n_poly, seen_poly, max_depth, depth );
241	++stats.n_generic_params.at( 1 );
242	} else if ( FunctionType* ft = dynamic_cast<FunctionType*>(ty) ) {
243	std::string name = "(*)";
244	countType(
245	name, n_generic, stats.generic_type_names, stats.generic_type_decls, elSeen);
246	unsigned n_subs = 0;
247	analyzeSubtypes(
248	ft->get_returnVals(), stats, elSeen, n_poly, seen_poly, max_depth, depth,
249	n_subs );
250	analyzeSubtypes(
251	ft->get_parameters(), stats, elSeen, n_poly, seen_poly, max_depth, depth,
252	n_subs );
253	++stats.n_generic_params.at( n_subs );
254	} else if ( TypeInstType* vt = dynamic_cast<TypeInstType*>(ty) ) {
255	if ( ! seen_poly ) {
256	++n_poly;
257	seen_poly = true;
258	}
259	countType(
260	vt->get_name(), n_agg, stats.compound_type_names, stats.compound_type_decls,
261	elSeen );
262	update_max( max_depth, depth );
263	} else if ( ReferenceToType* st = dynamic_cast<ReferenceToType*>(ty) ) {
264	std::list<Expression*>& params = st->get_parameters();
265	if ( params.empty() ) {
266	countType(
267	st->get_name(), n_agg, stats.compound_type_names,
268	stats.compound_type_decls, elSeen );
269	update_max( max_depth, depth );
270	} else {
271	countType(
272	st->get_name(), n_generic, stats.generic_type_names,
273	stats.generic_type_decls, elSeen);
274	analyzeSubtypes( params, stats, elSeen, n_poly, seen_poly, max_depth, depth );
275	++stats.n_generic_params.at( params.size() );
276	}
277	} else if ( TupleType* tt = dynamic_cast<TupleType*>(ty) ) {
278	std::string name = "[,]";
279	countType(
280	name, n_generic, stats.generic_type_names, stats.generic_type_decls, elSeen);
281	analyzeSubtypes(
282	tt->get_types(), stats, elSeen, n_poly, seen_poly, max_depth, depth );
283	++stats.n_generic_params.at( tt->size() );
284	} else if ( dynamic_cast<VarArgsType*>(ty) ) {
285	std::string name = "...";
286	countType(
287	name, n_agg, stats.compound_type_names, stats.compound_type_decls, elSeen );
288	update_max( max_depth, depth );
289	} else if ( dynamic_cast<ZeroType*>(ty) ) {
290	std::string name = "0";
291	countType( name, n_basic, stats.basic_type_names, stats.basic_type_decls, elSeen );
292	update_max( max_depth, depth );
293	} else if ( dynamic_cast<OneType*>(ty) ) {
294	std::string name = "1";
295	countType( name, n_basic, stats.basic_type_names, stats.basic_type_decls, elSeen );
296	update_max( max_depth, depth );
297	}
298	}
299
300	/// Update arg pack stats based on a declaration list
301	void analyze( Stats& stats, std::unordered_set<std::string>& seen,
302	std::unordered_set<std::string>& elSeen, ArgPackStats& pstats,
303	std::list<DeclarationWithType*>& decls ) {
304	std::unordered_set<std::string> types;
305	unsigned n = 0; ///< number of args/returns
306	unsigned n_basic = 0; ///< number of basic types
307	unsigned n_generic = 0; ///< number of generic types (includes "", "&", "[]", "()", "[,]")
308	unsigned n_poly = 0; ///< number of polymorphic types
309	unsigned n_agg = 0; ///< number of non-generic aggregate types
310	unsigned n_new = 0; ///< number of new types
311
312	for ( auto decl : decls ) {
313	Type* dt = decl->get_type();
314
315	n += dt->size();
316
317	std::stringstream ss;
318	dt->print( ss );
319	types.insert( ss.str() );
320	if ( seen.insert( ss.str() ).second ) { ++n_new; }
321
322	bool seen_poly = false;
323	unsigned max_depth = 0;
324	analyzeType(
325	dt, stats, elSeen, n_basic, n_generic, n_poly, n_agg, seen_poly, max_depth );
326	++stats.n_generic_nesting.at( max_depth );
327	}
328
329	++pstats.n.at( n );
330	++pstats.n_basic.at( n_basic );
331	++pstats.n_generic.at( n_generic );
332	++pstats.n_poly.at( n_poly );
333	++pstats.n_compound.at( n_agg );
334	if ( n > 0 ) {
335	++pstats.p_basic[ n_basic*100/n ];
336	++pstats.p_generic[ n_generic*100/n ];
337	++pstats.p_poly[ n_poly*100/n ];
338	++pstats.p_compound[ n_agg*100/n ];
339	if ( n > 1 ) ++pstats.p_new[ (n_new-1)*100/(n-1) ];
340	}
341	++pstats.n_types.at( types.size() );
342	}
343
344	void analyzeFunc( FunctionType* fnTy, Stats& stats, ArgPackStats& params, ArgPackStats& returns ) {
345	std::unordered_set<std::string> seen;
346	std::unordered_set<std::string> elSeen;
347	analyze( stats, seen, elSeen, params, fnTy->get_parameters() );
348	analyze( stats, seen, elSeen, returns, fnTy->get_returnVals() );
349	}
350
351	void analyzeExpr( UntypedExpr *expr, unsigned depth ) {
352	auto& args = expr->get_args();
353	unsigned fanout = args.size();
354
355	++exprs_by_fanout_at_depth[ std::make_pair(depth, fanout) ];
356	for ( Expression* arg : args ) {
357	if ( UntypedExpr uearg = dynamic_cast<UntypedExpr>(arg) ) {
358	analyzeExpr( uearg, depth+1 );
359	}
360	}
361	}
362
363	public:
364	void previsit( FunctionDecl *decl ) {
365	// skip if already seen declaration for this function
366	const std::string& mangleName = decl->get_mangleName().empty() ? decl->name : decl->get_mangleName();
367	if ( seen_names.insert( mangleName ).second ) {
368	Stats& stats = for_linkage[ ind_for_linkage[ decl->linkage ] ];
369
370	++stats.n_decls;
371	FunctionType* fnTy = decl->type;
372	const Type::ForallList& forall = fnTy->forall;
373	++stats.n_type_params.at( forall.size() );
374	unsigned n_assns = 0;
375	for ( TypeDecl* fdecl : forall ) {
376	n_assns += fdecl->assertions.size();
377	for ( DeclarationWithType* assn : fdecl->assertions ) {
378	FunctionType *assnTy = nullptr;
379	if ( ObjectDecl assnObj = dynamic_cast<ObjectDecl>(assn) ) {
380	if ( PointerType ptrTy = dynamic_cast<PointerType>(assnObj->get_type()) ) {
381	assnTy = dynamic_cast<FunctionType*>(ptrTy->base);
382	} else assnTy = dynamic_cast<FunctionType*>(assnObj->get_type());
383	} else if ( FunctionDecl assnDecl = dynamic_cast<FunctionDecl>(assn) ) {
384	assnTy = assnDecl->type;
385	}
386	if ( assnTy ) analyzeFunc( assnTy, stats, stats.assn_params, stats.assn_returns );
387	}
388	}
389	++stats.n_assns[ n_assns ];
390	++stats.by_name[ decl->name ];
391	analyzeFunc( fnTy, stats, stats.params, stats.returns );
392	}
393	}
394
395	void previsit( UntypedExpr *expr ) {
396	visit_children = false;
397	analyzeExpr( expr, 0 );
398	}
399
400	private:
401	template<typename F>
402	void printAll( const std::string& name, F extract ) {
403	std::cout << "\"" << name << "\",";
404	for ( const auto& stats : for_linkage ) {
405	std::cout << "," << extract(stats);
406	}
407	std::cout << "," << extract(total) << std::endl;
408	}
409
410	template<typename F>
411	void printAllMap( const std::string& name, F extract ) {
412	for ( const auto& entry : extract(total) ) {
413	const auto& key = entry.first;
414	std::cout << "\"" << name << "\"," << key;
415	for ( const auto& stats : for_linkage ) {
416	const auto& map = extract(stats);
417	auto it = map.find( key );
418	if ( it == map.end() ) std::cout << ",0";
419	else std::cout << "," << it->second;
420	}
421	std::cout << "," << entry.second << std::endl;
422	}
423	}
424
425	template<typename F>
426	void printAllHisto( const std::string& name, F extract ) {
427	VectorMap<unsigned> histos[n_named_specs];
428	VectorMap<unsigned> thisto;
429
430	for ( const auto& entry : extract(total) ) { ++thisto.at( entry.second ); }
431
432	for ( unsigned i = 0; i < n_named_specs; ++i ) {
433	// can't be a higher count in one of the sub-histograms than the total
434	histos[i].reserve( thisto.size() );
435
436	for ( const auto& entry : extract(for_linkage[i]) ) { ++histos[i][entry.second]; }
437	}
438
439	for ( unsigned i = 0; i < thisto.size(); ++i ) {
440	std::cout << "\"" << name << "\"," << i;
441	for ( const auto& histo : histos ) {
442	std::cout << "," << histo[i];
443	}
444	std::cout << "," << thisto[i] << std::endl;
445	}
446	}
447
448	template<typename F>
449	void printAllSparseHisto( const std::string& name, F extract ) {
450	std::map<unsigned, unsigned> histos[n_named_specs];
451	std::map<unsigned, unsigned> thisto;
452
453	for ( const auto& entry : extract(total) ) { ++thisto[ entry.second ]; }
454
455	for ( unsigned i = 0; i < n_named_specs; ++i ) {
456	for ( const auto& entry : extract(for_linkage[i]) ) { ++histos[i][entry.second]; }
457	}
458
459	for ( const auto& entry : thisto ) {
460	const auto& key = entry.first;
461	std::cout << "\"" << name << "\"," << key;
462	for ( unsigned i = 0; i < n_named_specs; ++i ) {
463	auto it = histos[i].find( key );
464	if ( it == histos[i].end() ) std::cout << ",0";
465	else std::cout << "," << it->second;
466	}
467	std::cout << "," << entry.second << std::endl;
468	}
469	}
470
471	template<typename F>
472	void printAllPack( const std::string& name, F extract ) {
473	printAllMap("n_basic_" + name, [&extract](const Stats& stats) { return extract(stats).n_basic; });
474	printAllMap("n_generic_" + name, [&extract](const Stats& stats) { return extract(stats).n_generic; });
475	printAllMap("n_poly_" + name, [&extract](const Stats& stats) { return extract(stats).n_poly; });
476	printAllMap("n_compound_" + name, [&extract](const Stats& stats) { return extract(stats).n_compound; });
477	printAllMap("n_" + name, [&extract](const Stats& stats) { return extract(stats).n; });
478	printAllMap("%_basic_" + name, [&extract](const Stats& stats) { return extract(stats).p_basic; });
479	printAllMap("%_generic_" + name, [&extract](const Stats& stats) { return extract(stats).p_generic; });
480	printAllMap("%_poly_" + name, [&extract](const Stats& stats) { return extract(stats).p_poly; });
481	printAllMap("%_compound_" + name, [&extract](const Stats& stats) { return extract(stats).p_compound; });
482	printAllMap("n_distinct_types_" + name, [&extract](const Stats& stats) { return extract(stats).n_types; });
483	printAllMap("%_new_types_in_" + name, [&extract](const Stats& stats) { return extract(stats).p_new; });
484	}
485
486	void printPairMap( const std::string& name,
487	const std::map<std::pair<unsigned, unsigned>, unsigned>& map ) {
488	for ( const auto& entry : map ) {
489	const auto& key = entry.first;
490	std::cout << "\"" << name << "\"," << key.first << "," << key.second << ","
491	<< entry.second << std::endl;
492	}
493	}
494
495	public:
496	void print() {
497	for ( auto& stats : for_linkage ) {
498	total += stats;
499	}
500
501	std::cout << ",,\"intrinsic\",\"Cforall\",\"C\",\"autogen\",\"compiler\",\"builtinCFA\",\"builtinC\",\"other\",\"TOTAL\"" << std::endl;
502
503	printAllMap("n_type_params", [](const Stats& stats) { return stats.n_type_params; });
504	printAllMap("n_generic_params", [](const Stats& stats) { return stats.n_generic_params; });
505	printAllMap("n_generic_nesting", [](const Stats& stats) { return stats.n_generic_nesting; });
506	printAll("n_decls", [](const Stats& stats) { return stats.n_decls; });
507	printAll("unique_names", [](const Stats& stats) { return stats.by_name.size(); });
508	printAllSparseHisto("overloads", [](const Stats& stats) { return stats.by_name; });
509	printAll("basic_type_names", [](const Stats& stats) { return stats.basic_type_names.size(); });
510	printAllSparseHisto("basic_type_uses", [](const Stats& stats) { return stats.basic_type_names; });
511	printAllSparseHisto("decls_using_basic_type", [](const Stats& stats) { return stats.basic_type_decls; });
512	printAll("generic_type_names", [](const Stats& stats) { return stats.generic_type_names.size(); });
513	printAllSparseHisto("generic_type_uses", [](const Stats& stats) { return stats.generic_type_names; });
514	printAllSparseHisto("decls_using_generic_type", [](const Stats& stats) { return stats.generic_type_decls; });
515	printAll("compound_type_names", [](const Stats& stats) { return stats.compound_type_names.size(); });
516	printAllSparseHisto("compound_type_uses", [](const Stats& stats) { return stats.compound_type_names; });
517	printAllSparseHisto("decls_using_compound_type", [](const Stats& stats) { return stats.compound_type_decls; });
518	printAllPack("params", [](const Stats& stats) { return stats.params; });
519	printAllPack("returns", [](const Stats& stats) { return stats.returns; });
520	printAllMap("n_assns", [](const Stats& stats) { return stats.n_assns; });
521	printAllPack("assn_params", [](const Stats& stats) { return stats.assn_params; });
522	printAllPack("assn_returns", [](const Stats& stats) { return stats.assn_returns; });
523	std::cout << std::endl;
524
525	printPairMap("exprs_by_depth+fanout", exprs_by_fanout_at_depth);
526	}
527	};
528
529	const unsigned DeclStats::ind_for_linkage[]
530	= { 7, 7, 2, 1, 7, 7, 7, 3, 4, 7, 6, 5, 7, 7, 7, 0 };
531
532	void printDeclStats( std::list< Declaration * > &translationUnit ) {
533	PassVisitor<DeclStats> stats;
534	acceptAll( translationUnit, stats );
535	stats.pass.print();
536	}
537
538	} // namespace CodeTools
539
540	// Local Variables: //
541	// tab-width: 4 //
542	// mode: c++ //
543	// compile-command: "make install" //
544	// End: //

Note: See TracBrowser for help on using the repository browser.

Download in other formats: