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