arm/gprof/gmon.h

9  * 1. Redistributions of source code must retain the above copyright notice,
10  * this list of conditions and the following disclaimer.
13  * this list of conditions and the following disclaimer in the documentation
18  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
22  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
23  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
26  * POSSIBILITY OF SUCH DAMAGE.
33  *	The Regents of the University of California.  All rights reserved.
38  * 1. Redistributions of source code must retain the above copyright
39  *    notice, this list of conditions and the following disclaimer.
41  *    notice, this list of conditions and the following disclaimer in the
43  * 4. Neither the name of the University nor the names of its contributors
49  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
52  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
53  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
54  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
56  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
83  * Fraction of text space to allocate for histogram counters here, 1/2
88  * Fraction of text space to allocate for from hash buckets.
89  * The value of HASHFRACTION is based on the minimum number of bytes
90  * of separation between two subroutine call points in the object code.
91  * Given MIN_SUBR_SEPARATION bytes of separation the value of
111  * architectures.  This saves a reasonable amount of space for
118  * Percent of text space to allocate for tostructs.
120  * with a very large number of very small functions, but that's
125  * text size, thus raising the number of arcs expected by the heuristic).
131  * hides the inadequacy of the ARCDENSITY heuristic, at least
142  * Maximum number of arcs we want to allow.
143  * Used to be max representable value of ARCINDEX minus 2, but now
146  * The old value of 1<<16 wasn't high enough in practice for large C++
189  * Possible states of profiling.