-/* profile.h - Defines data exported from profile.c to other passes.
- Copyright (C) 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
+/* Header file for minimum-cost maximal flow routines used to smooth basic
+ block and edge frequency counts.
+ Copyright (C) 2008-2019 Free Software Foundation, Inc.
+ Contributed by Paul Yuan (yingbo.com@gmail.com)
+ and Vinodha Ramasamy (vinodha@google.com).
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 2, or (at your option) any later
+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
for more details.
You should have received a copy of the GNU General Public License
-along with GCC; see the file COPYING. If not, write to the Free
-Software Foundation, 59 Temple Place - Suite 330, Boston, MA
-02111-1307, USA. */
-
-#ifndef GCC_PROFILE_H
-#define GCC_PROFILE_H
+along with GCC; see the file COPYING3. If not see
+<http://www.gnu.org/licenses/>. */
-/* The number of different counter sections. */
-#define MAX_COUNTER_SECTIONS 1
+#ifndef PROFILE_H
+#define PROFILE_H
-/* Info about number of counters in the section. */
-struct section_info
+/* Additional information about edges. */
+struct edge_profile_info
{
- unsigned tag; /* Section tag. */
- int present; /* Are the data from this section read into gcc? */
- int n_counters; /* Total number of counters. */
- int n_counters_now; /* Number of counters in the current function. */
+ unsigned int count_valid:1;
+
+ /* Is on the spanning tree. */
+ unsigned int on_tree:1;
+
+ /* Pretend this edge does not exist (it is abnormal and we've
+ inserted a fake to compensate). */
+ unsigned int ignore:1;
};
-struct profile_info
- {
- /* Information about numbers of counters in counter sections, for
- allocating the storage and storing the sizes. */
- unsigned n_sections;
- struct section_info section_info[MAX_COUNTER_SECTIONS];
-
- /* Checksum of the cfg. Used for 'identification' of code.
- Used by final. */
+#define EDGE_INFO(e) ((struct edge_profile_info *) (e)->aux)
+
+/* Helpers annotating edges/basic blocks to GCOV counts. */
+
+extern vec<gcov_type> bb_gcov_counts;
+extern hash_map<edge,gcov_type> *edge_gcov_counts;
+
+inline gcov_type &
+edge_gcov_count (edge e)
+{
+ bool existed;
+ gcov_type &c = edge_gcov_counts->get_or_insert (e, &existed);
+ if (!existed)
+ c = 0;
+ return c;
+}
+
+inline gcov_type &
+bb_gcov_count (basic_block bb)
+{
+ return bb_gcov_counts[bb->index];
+}
- unsigned current_function_cfg_checksum;
+typedef struct gcov_working_set_info gcov_working_set_t;
+extern gcov_working_set_t *find_working_set (unsigned pct_times_10);
+extern void add_working_set (gcov_working_set_t *);
- /* Max. value of counter in program corresponding to the profile data
- for the current function. */
+/* Smoothes the initial assigned basic block and edge counts using
+ a minimum cost flow algorithm. */
+extern void mcf_smooth_cfg (void);
- gcov_type max_counter_in_program;
+extern gcov_type sum_edge_counts (vec<edge, va_gc> *edges);
- /* The number of profiles merged to form the profile data for the current
- function. */
- int count_profiles_merged;
- };
+extern void init_node_map (bool);
+extern void del_node_map (void);
-extern struct profile_info profile_info;
+extern void get_working_sets (void);
-struct section_info *find_counters_section PARAMS ((unsigned));
+/* Counter summary from the last set of coverage counts read by
+ profile.c. */
+extern struct gcov_summary *profile_info;
-#endif
+#endif /* PROFILE_H */