/* Header file for minimum-cost maximal flow routines used to smooth basic
block and edge frequency counts.
- Copyright (C) 2008-2013 Free Software Foundation, Inc.
+ Copyright (C) 2008-2014 Free Software Foundation, Inc.
Contributed by Paul Yuan (yingbo.com@gmail.com)
and Vinodha Ramasamy (vinodha@google.com).
#define PROFILE_H
/* Additional information about edges. */
-struct edge_info
+struct edge_profile_info
{
unsigned int count_valid:1;
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. */
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 */