1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
|
/* Optimization statistics functions.
Copyright (C) 2008-2013 Free Software Foundation, Inc.
Contributed by Richard Guenther <rguenther@suse.de>
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation; either version 3, or (at your option) any later
version.
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "tree-pass.h"
#include "tree-dump.h"
#include "statistics.h"
#include "hashtab.h"
#include "function.h"
static int statistics_dump_nr;
static int statistics_dump_flags;
static FILE *statistics_dump_file;
/* Statistics entry. A integer counter associated to a string ID
and value. */
typedef struct statistics_counter_s {
const char *id;
int val;
bool histogram_p;
unsigned HOST_WIDE_INT count;
unsigned HOST_WIDE_INT prev_dumped_count;
} statistics_counter_t;
/* Array of statistic hashes, indexed by pass id. */
static htab_t *statistics_hashes;
static unsigned nr_statistics_hashes;
/* Hash a statistic counter by its string ID. */
static hashval_t
hash_statistics_hash (const void *p)
{
const statistics_counter_t *const c = (const statistics_counter_t *)p;
return htab_hash_string (c->id) + c->val;
}
/* Compare two statistic counters by their string IDs. */
static int
hash_statistics_eq (const void *p, const void *q)
{
const statistics_counter_t *const c1 = (const statistics_counter_t *)p;
const statistics_counter_t *const c2 = (const statistics_counter_t *)q;
return c1->val == c2->val && strcmp (c1->id, c2->id) == 0;
}
/* Free a statistics entry. */
static void
hash_statistics_free (void *p)
{
free (CONST_CAST(char *, ((statistics_counter_t *)p)->id));
free (p);
}
/* Return the current hashtable to be used for recording or printing
statistics. */
static htab_t
curr_statistics_hash (void)
{
unsigned idx;
gcc_assert (current_pass->static_pass_number >= 0);
idx = current_pass->static_pass_number;
if (idx < nr_statistics_hashes
&& statistics_hashes[idx] != NULL)
return statistics_hashes[idx];
if (idx >= nr_statistics_hashes)
{
statistics_hashes = XRESIZEVEC (struct htab *, statistics_hashes, idx+1);
memset (statistics_hashes + nr_statistics_hashes, 0,
(idx + 1 - nr_statistics_hashes) * sizeof (htab_t));
nr_statistics_hashes = idx + 1;
}
statistics_hashes[idx] = htab_create (15, hash_statistics_hash,
hash_statistics_eq,
hash_statistics_free);
return statistics_hashes[idx];
}
/* Helper for statistics_fini_pass. Print the counter difference
since the last dump for the pass dump files. */
static int
statistics_fini_pass_1 (void **slot, void *data ATTRIBUTE_UNUSED)
{
statistics_counter_t *counter = (statistics_counter_t *)*slot;
unsigned HOST_WIDE_INT count = counter->count - counter->prev_dumped_count;
if (count == 0)
return 1;
if (counter->histogram_p)
fprintf (dump_file, "%s == %d: " HOST_WIDE_INT_PRINT_DEC "\n",
counter->id, counter->val, count);
else
fprintf (dump_file, "%s: " HOST_WIDE_INT_PRINT_DEC "\n",
counter->id, count);
counter->prev_dumped_count = counter->count;
return 1;
}
/* Helper for statistics_fini_pass. Print the counter difference
since the last dump for the statistics dump. */
static int
statistics_fini_pass_2 (void **slot, void *data ATTRIBUTE_UNUSED)
{
statistics_counter_t *counter = (statistics_counter_t *)*slot;
unsigned HOST_WIDE_INT count = counter->count - counter->prev_dumped_count;
if (count == 0)
return 1;
counter->prev_dumped_count = counter->count;
if (counter->histogram_p)
fprintf (statistics_dump_file,
"%d %s \"%s == %d\" \"%s\" " HOST_WIDE_INT_PRINT_DEC "\n",
current_pass->static_pass_number,
current_pass->name,
counter->id, counter->val,
current_function_name (),
count);
else
fprintf (statistics_dump_file,
"%d %s \"%s\" \"%s\" " HOST_WIDE_INT_PRINT_DEC "\n",
current_pass->static_pass_number,
current_pass->name,
counter->id,
current_function_name (),
count);
counter->prev_dumped_count = counter->count;
return 1;
}
/* Helper for statistics_fini_pass, reset the counters. */
static int
statistics_fini_pass_3 (void **slot, void *data ATTRIBUTE_UNUSED)
{
statistics_counter_t *counter = (statistics_counter_t *)*slot;
counter->prev_dumped_count = counter->count;
return 1;
}
/* Dump the current statistics incrementally. */
void
statistics_fini_pass (void)
{
if (current_pass->static_pass_number == -1)
return;
if (dump_file
&& dump_flags & TDF_STATS)
{
fprintf (dump_file, "\n");
fprintf (dump_file, "Pass statistics:\n");
fprintf (dump_file, "----------------\n");
htab_traverse_noresize (curr_statistics_hash (),
statistics_fini_pass_1, NULL);
fprintf (dump_file, "\n");
}
if (statistics_dump_file
&& !(statistics_dump_flags & TDF_STATS
|| statistics_dump_flags & TDF_DETAILS))
htab_traverse_noresize (curr_statistics_hash (),
statistics_fini_pass_2, NULL);
htab_traverse_noresize (curr_statistics_hash (),
statistics_fini_pass_3, NULL);
}
/* Helper for printing summary information. */
static int
statistics_fini_1 (void **slot, void *data)
{
struct opt_pass *pass = (struct opt_pass *)data;
statistics_counter_t *counter = (statistics_counter_t *)*slot;
if (counter->count == 0)
return 1;
if (counter->histogram_p)
fprintf (statistics_dump_file,
"%d %s \"%s == %d\" " HOST_WIDE_INT_PRINT_DEC "\n",
pass->static_pass_number,
pass->name,
counter->id, counter->val,
counter->count);
else
fprintf (statistics_dump_file,
"%d %s \"%s\" " HOST_WIDE_INT_PRINT_DEC "\n",
pass->static_pass_number,
pass->name,
counter->id,
counter->count);
return 1;
}
/* Finish the statistics and dump summary information. */
void
statistics_fini (void)
{
if (!statistics_dump_file)
return;
if (statistics_dump_flags & TDF_STATS)
{
unsigned i;
for (i = 0; i < nr_statistics_hashes; ++i)
if (statistics_hashes[i] != NULL
&& get_pass_for_id (i) != NULL)
htab_traverse_noresize (statistics_hashes[i],
statistics_fini_1, get_pass_for_id (i));
}
dump_end (statistics_dump_nr, statistics_dump_file);
}
/* Register the statistics dump file. */
void
statistics_early_init (void)
{
statistics_dump_nr = dump_register (".statistics", "statistics",
"statistics", TDF_TREE, OPTGROUP_NONE);
}
/* Init the statistics. */
void
statistics_init (void)
{
statistics_dump_file = dump_begin (statistics_dump_nr, NULL);
statistics_dump_flags = get_dump_file_info (statistics_dump_nr)->pflags;
}
/* Lookup or add a statistics counter in the hashtable HASH with ID, VAL
and HISTOGRAM_P. */
static statistics_counter_t *
lookup_or_add_counter (htab_t hash, const char *id, int val,
bool histogram_p)
{
statistics_counter_t **counter;
statistics_counter_t c;
c.id = id;
c.val = val;
counter = (statistics_counter_t **) htab_find_slot (hash, &c, INSERT);
if (!*counter)
{
*counter = XNEW (struct statistics_counter_s);
(*counter)->id = xstrdup (id);
(*counter)->val = val;
(*counter)->histogram_p = histogram_p;
(*counter)->prev_dumped_count = 0;
(*counter)->count = 0;
}
return *counter;
}
/* Add statistics information about event ID in function FN.
This will increment the counter associated with ID by INCR.
It will also dump the event to the global statistics file if requested. */
void
statistics_counter_event (struct function *fn, const char *id, int incr)
{
statistics_counter_t *counter;
if ((!(dump_flags & TDF_STATS)
&& !statistics_dump_file)
|| incr == 0)
return;
if (current_pass->static_pass_number != -1)
{
counter = lookup_or_add_counter (curr_statistics_hash (), id, 0, false);
gcc_assert (!counter->histogram_p);
counter->count += incr;
}
if (!statistics_dump_file
|| !(statistics_dump_flags & TDF_DETAILS))
return;
fprintf (statistics_dump_file,
"%d %s \"%s\" \"%s\" %d\n",
current_pass->static_pass_number,
current_pass->name,
id,
function_name (fn),
incr);
}
/* Add statistics information about event ID in function FN with the
histogram value VAL.
It will dump the event to the global statistics file if requested. */
void
statistics_histogram_event (struct function *fn, const char *id, int val)
{
statistics_counter_t *counter;
if (!(dump_flags & TDF_STATS)
&& !statistics_dump_file)
return;
counter = lookup_or_add_counter (curr_statistics_hash (), id, val, true);
gcc_assert (counter->histogram_p);
counter->count += 1;
if (!statistics_dump_file
|| !(statistics_dump_flags & TDF_DETAILS))
return;
fprintf (statistics_dump_file,
"%d %s \"%s == %d\" \"%s\" 1\n",
current_pass->static_pass_number,
current_pass->name,
id, val,
function_name (fn));
}
|