diff options
| author | Ben Cheng <bccheng@google.com> | 2014-03-25 22:37:19 -0700 |
|---|---|---|
| committer | Ben Cheng <bccheng@google.com> | 2014-03-25 22:37:19 -0700 |
| commit | 1bc5aee63eb72b341f506ad058502cd0361f0d10 (patch) | |
| tree | c607e8252f3405424ff15bc2d00aa38dadbb2518 /gcc-4.9/gcc/profile.h | |
| parent | 283a0bf58fcf333c58a2a92c3ebbc41fb9eb1fdb (diff) | |
| download | toolchain_gcc-1bc5aee63eb72b341f506ad058502cd0361f0d10.tar.gz toolchain_gcc-1bc5aee63eb72b341f506ad058502cd0361f0d10.tar.bz2 toolchain_gcc-1bc5aee63eb72b341f506ad058502cd0361f0d10.zip | |
Initial checkin of GCC 4.9.0 from trunk (r208799).
Change-Id: I48a3c08bb98542aa215912a75f03c0890e497dba
Diffstat (limited to 'gcc-4.9/gcc/profile.h')
| -rw-r--r-- | gcc-4.9/gcc/profile.h | 55 |
1 files changed, 55 insertions, 0 deletions
diff --git a/gcc-4.9/gcc/profile.h b/gcc-4.9/gcc/profile.h new file mode 100644 index 000000000..be609c746 --- /dev/null +++ b/gcc-4.9/gcc/profile.h @@ -0,0 +1,55 @@ +/* Header file for minimum-cost maximal flow routines used to smooth basic + block and edge frequency counts. + Copyright (C) 2008-2014 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 3, or (at your option) any later +version. + +GCC is distributed in the hope that it will be useful, but WITHOUT ANY +WARRANTY; without even the implied warranty of MERCHANTABILITY or +FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License +for more details. + +You should have received a copy of the GNU General Public License +along with GCC; see the file COPYING3. If not see +<http://www.gnu.org/licenses/>. */ + +#ifndef PROFILE_H +#define PROFILE_H + +/* Additional information about edges. */ +struct edge_info +{ + 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; +}; + +#define EDGE_INFO(e) ((struct edge_info *) (e)->aux) + +/* Smoothes the initial assigned basic block and edge counts using + a minimum cost flow algorithm. */ +extern void mcf_smooth_cfg (void); + +extern gcov_type sum_edge_counts (vec<edge, va_gc> *edges); + +extern void init_node_map (bool); +extern void del_node_map (void); + +extern void get_working_sets (void); + +/* In predict.c. */ +extern gcov_type get_hot_bb_threshold (void); +extern void set_hot_bb_threshold (gcov_type); + +#endif /* PROFILE_H */ |