GCC Middle and Back End API Reference
profile.h
Go to the documentation of this file.
1/* Header file for minimum-cost maximal flow routines used to smooth basic
2 block and edge frequency counts.
3 Copyright (C) 2008-2024 Free Software Foundation, Inc.
4 Contributed by Paul Yuan (yingbo.com@gmail.com)
5 and Vinodha Ramasamy (vinodha@google.com).
6
7This file is part of GCC.
8GCC is free software; you can redistribute it and/or modify it under
9the terms of the GNU General Public License as published by the Free
10Software Foundation; either version 3, or (at your option) any later
11version.
12
13GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14WARRANTY; without even the implied warranty of MERCHANTABILITY or
15FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16for more details.
17
18You should have received a copy of the GNU General Public License
19along with GCC; see the file COPYING3. If not see
20<http://www.gnu.org/licenses/>. */
21
22#ifndef PROFILE_H
23#define PROFILE_H
24
25/* Additional information about edges. */
27{
28 unsigned int count_valid:1;
29
30 /* Is on the spanning tree. */
31 unsigned int on_tree:1;
32
33 /* Pretend this edge does not exist (it is abnormal and we've
34 inserted a fake to compensate). */
35 unsigned int ignore:1;
36};
37
38#define EDGE_INFO(e) ((struct edge_profile_info *) (e)->aux)
39
40/* Helpers annotating edges/basic blocks to GCOV counts. */
41
44
45inline gcov_type &
47{
48 bool existed;
49 gcov_type &c = edge_gcov_counts->get_or_insert (e, &existed);
50 if (!existed)
51 c = 0;
52 return c;
53}
54
55inline gcov_type &
57{
58 return bb_gcov_counts[bb->index];
59}
60
61typedef struct gcov_working_set_info gcov_working_set_t;
62extern gcov_working_set_t *find_working_set (unsigned pct_times_10);
64
65/* Smoothes the initial assigned basic block and edge counts using
66 a minimum cost flow algorithm. */
67extern void mcf_smooth_cfg (void);
68
70
71extern void init_node_map (bool);
72extern void del_node_map (void);
73
74extern void get_working_sets (void);
75
76/* Counter summary from the last set of coverage counts read by
77 profile.cc. */
78extern struct gcov_summary *profile_info;
79
80#endif /* PROFILE_H */
Definition hash-map.h:40
Value & get_or_insert(const Key &k, bool *existed=NULL)
Definition hash-map.h:199
class edge_def * edge
Definition coretypes.h:352
int64_t gcov_type
Definition coretypes.h:46
vec< gcov_type > bb_gcov_counts
Definition profile.cc:84
struct gcov_working_set_info gcov_working_set_t
Definition profile.h:61
struct gcov_summary * profile_info
Definition profile.cc:100
void del_node_map(void)
Definition value-prof.cc:1282
void add_working_set(gcov_working_set_t *)
void init_node_map(bool)
Definition value-prof.cc:1229
gcov_type sum_edge_counts(vec< edge, va_gc > *edges)
Definition mcf.cc:1354
hash_map< edge, gcov_type > * edge_gcov_counts
Definition profile.cc:85
void mcf_smooth_cfg(void)
Definition mcf.cc:1376
gcov_type & edge_gcov_count(edge e)
Definition profile.h:46
gcov_type & bb_gcov_count(basic_block bb)
Definition profile.h:56
void get_working_sets(void)
gcov_working_set_t * find_working_set(unsigned pct_times_10)
Definition basic-block.h:117
int index
Definition basic-block.h:147
Definition profile.h:27
unsigned int count_valid
Definition profile.h:28
unsigned int on_tree
Definition profile.h:31
unsigned int ignore
Definition profile.h:35
Definition gcov-io.h:346
Definition vec.h:450