profile.h File Reference
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Data Structures | |
| struct | edge_info |
Macros | |
| #define | EDGE_INFO(e) ((struct edge_info *) (e)->aux) |
Functions | |
| void | mcf_smooth_cfg (void) |
| gcov_type | sum_edge_counts (vec< edge, va_gc > *edges) |
| void | init_node_map (bool) |
| void | del_node_map (void) |
| void | get_working_sets (void) |
| gcov_type | get_hot_bb_threshold (void) |
| void | set_hot_bb_threshold (gcov_type) |
Macro Definition Documentation
| #define EDGE_INFO | ( | e | ) | ((struct edge_info *) (e)->aux) |
Function Documentation
| void del_node_map | ( | void | ) |
Delete the CGRAPH_NODE_MAP.
| void get_working_sets | ( | void | ) |
Fill the working set information into the profile_info structure.
Multiply the percentage by 100 to avoid float.
Print out the percentage using int arithmatic to avoid float.
References dump_file, HOST_WIDEST_INT, HOST_WIDEST_INT_PRINT_DEC, gcov_working_set_info::min_counter, and gcov_working_set_info::num_counters.
| void init_node_map | ( | bool | ) |
| void mcf_smooth_cfg | ( | void | ) |
Smoothes the initial assigned basic block and edge counts using a minimum cost flow algorithm.
Main routine. Smoothes the initial assigned basic block and edge counts using a minimum cost flow algorithm, to ensure that the flow consistency rule is obeyed: sum of outgoing edges = sum of incoming edges for each basic block.
| void set_hot_bb_threshold | ( | gcov_type | ) |
