| @@ -1,14 +1,14 @@ | | | @@ -1,14 +1,14 @@ |
1 | /* $NetBSD: gmon.h,v 1.9 2006/10/04 14:22:58 christos Exp $ */ | | 1 | /* $NetBSD: gmon.h,v 1.10 2012/03/09 15:38:03 christos Exp $ */ |
2 | | | 2 | |
3 | /*- | | 3 | /*- |
4 | * Copyright (c) 1982, 1986, 1992, 1993 | | 4 | * Copyright (c) 1982, 1986, 1992, 1993 |
5 | * The Regents of the University of California. All rights reserved. | | 5 | * The Regents of the University of California. All rights reserved. |
6 | * | | 6 | * |
7 | * Redistribution and use in source and binary forms, with or without | | 7 | * Redistribution and use in source and binary forms, with or without |
8 | * modification, are permitted provided that the following conditions | | 8 | * modification, are permitted provided that the following conditions |
9 | * are met: | | 9 | * are met: |
10 | * 1. Redistributions of source code must retain the above copyright | | 10 | * 1. Redistributions of source code must retain the above copyright |
11 | * notice, this list of conditions and the following disclaimer. | | 11 | * notice, this list of conditions and the following disclaimer. |
12 | * 2. Redistributions in binary form must reproduce the above copyright | | 12 | * 2. Redistributions in binary form must reproduce the above copyright |
13 | * notice, this list of conditions and the following disclaimer in the | | 13 | * notice, this list of conditions and the following disclaimer in the |
14 | * documentation and/or other materials provided with the distribution. | | 14 | * documentation and/or other materials provided with the distribution. |
| @@ -86,27 +86,27 @@ struct gmonhdr { | | | @@ -86,27 +86,27 @@ struct gmonhdr { |
86 | * In practice, however, call instructions are rarely at a minimal | | 86 | * In practice, however, call instructions are rarely at a minimal |
87 | * distance. Hence, we will define HASHFRACTION to be 2 across all | | 87 | * distance. Hence, we will define HASHFRACTION to be 2 across all |
88 | * architectures. This saves a reasonable amount of space for | | 88 | * architectures. This saves a reasonable amount of space for |
89 | * profiling data structures without (in practice) sacrificing | | 89 | * profiling data structures without (in practice) sacrificing |
90 | * any granularity. | | 90 | * any granularity. |
91 | */ | | 91 | */ |
92 | #define HASHFRACTION 2 | | 92 | #define HASHFRACTION 2 |
93 | | | 93 | |
94 | /* | | 94 | /* |
95 | * percent of text space to allocate for tostructs with a minimum. | | 95 | * percent of text space to allocate for tostructs with a minimum. |
96 | */ | | 96 | */ |
97 | #define ARCDENSITY 2 | | 97 | #define ARCDENSITY 2 |
98 | #define MINARCS 50 | | 98 | #define MINARCS 50 |
99 | #define MAXARCS ((1 << (8 * sizeof(HISTCOUNTER))) - 2) | | 99 | #define MAXARCS ((1 << (unsigned int)(8 * sizeof(HISTCOUNTER))) - 2) |
100 | | | 100 | |
101 | struct tostruct { | | 101 | struct tostruct { |
102 | u_long selfpc; | | 102 | u_long selfpc; |
103 | long count; | | 103 | long count; |
104 | u_short link; | | 104 | u_short link; |
105 | u_short pad; | | 105 | u_short pad; |
106 | }; | | 106 | }; |
107 | | | 107 | |
108 | /* | | 108 | /* |
109 | * a raw arc, with pointers to the calling site and | | 109 | * a raw arc, with pointers to the calling site and |
110 | * the called site and a count. | | 110 | * the called site and a count. |
111 | */ | | 111 | */ |
112 | struct rawarc { | | 112 | struct rawarc { |