coretypes.h: Include hash-table.h and hash-set.h for host files.

[gcc.git] / gcc / profile.h

diff --git a/gcc/profile.h b/gcc/profile.h
index ed8c88667d80f8d2fe7bf3f603b6d85a161b22dd..a71beb10516b6d94af70f88de086f5a556c69987 100644 (file)
--- a/gcc/profile.h
+++ b/gcc/profile.h
@@ -1,7 +1,6 @@
 /* Header file for minimum-cost maximal flow routines used to smooth basic
    block and edge frequency counts.
-   Copyright (C) 2008
-   Free Software Foundation, Inc.
+   Copyright (C) 2008-2015 Free Software Foundation, Inc.
    Contributed by Paul Yuan (yingbo.com@gmail.com)
        and Vinodha Ramasamy (vinodha@google.com).
 
@@ -24,7 +23,7 @@ along with GCC; see the file COPYING3.  If not see
 #define PROFILE_H
 
 /* Additional information about edges. */
-struct edge_info
+struct edge_profile_info
 {
   unsigned int count_valid:1;
 
@@ -36,7 +35,11 @@ struct edge_info
   unsigned int ignore:1;
 };
 
-#define EDGE_INFO(e)  ((struct edge_info *) (e)->aux)
+#define EDGE_INFO(e)  ((struct edge_profile_info *) (e)->aux)
+
+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 *);
 
 /* Smoothes the initial assigned basic block and edge counts using
    a minimum cost flow algorithm. */
@@ -44,9 +47,13 @@ extern void mcf_smooth_cfg (void);
 
 extern gcov_type sum_edge_counts (vec<edge, va_gc> *edges);
 
-extern void init_node_map (void);
+extern void init_node_map (bool);
 extern void del_node_map (void);
 
-extern void compute_working_sets (void);
+extern void get_working_sets (void);
+
+/* Counter summary from the last set of coverage counts read by
+   profile.c.  */
+extern const struct gcov_ctr_summary *profile_info;
 
 #endif /* PROFILE_H */