profile.h revision 1.7 1 /* $NetBSD: profile.h,v 1.7 2000/07/01 06:42:54 matt Exp $ */
2 /*
3 * Copyright (c) 1992 The Regents of the University of California.
4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * 3. All advertising materials mentioning features or use of this software
15 * must display the following acknowledgement:
16 * This product includes software developed by the University of
17 * California, Berkeley and its contributors.
18 * 4. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
21 *
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * SUCH DAMAGE.
33 *
34 * @(#)profile.h 7.1 (Berkeley) 7/16/92
35 */
36
37 /*
38 * _mcount can't be declared static, gcc will optimize it away then.
39 */
40 #define _MCOUNT_DECL void _mcount
41
42 /*
43 * Note here: the second argument to __mcount() is pc when mcount
44 * was called. Because it's already on the stack we only have to
45 * push previous pc _and_ tell calls that it is only one argument
46 * to __mcount, so that our return address won't get popped from stack.
47 */
48 #ifdef __ELF__
49 #define MCOUNT \
50 __asm__(".text; .globl __mcount; __mcount: pushl 16(fp); calls $1,_mcount; rsb");
51 #else
52 #define MCOUNT \
53 __asm__(".text; .globl mcount; mcount: pushl 16(fp); calls $1,__mcount; rsb");
54 #endif
55
56 #ifdef _KERNEL
57 /*
58 * Note that we assume splhigh() and splx() cannot call mcount()
59 * recursively.
60 */
61 #define MCOUNT_ENTER s = splhigh()
62 #define MCOUNT_EXIT splx(s)
63 #endif /* _KERNEL */
64