1/*-
2 * Copyright (c) 1993 The Regents of the University of California.
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 *
| 1/*-
2 * Copyright (c) 1993 The Regents of the University of California.
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 *
|
33 * $FreeBSD: head/sys/i386/include/asmacros.h 70714 2001-01-06 17:40:04Z jake $
| 33 * $FreeBSD: head/sys/i386/include/asmacros.h 73011 2001-02-25 06:29:04Z jake $
|
34 */
35
36#ifndef _MACHINE_ASMACROS_H_
37#define _MACHINE_ASMACROS_H_
38
39#include <sys/cdefs.h>
| 34 */
35
36#ifndef _MACHINE_ASMACROS_H_
37#define _MACHINE_ASMACROS_H_
38
39#include <sys/cdefs.h>
|
40#include <machine/asnames.h>
| |
41
42/* XXX too much duplication in various asm*.h's. */
43
44/*
45 * CNAME and HIDENAME manage the relationship between symbol names in C
46 * and the equivalent assembly language names. CNAME is given a name as
47 * it would be used in a C program. It expands to the equivalent assembly
48 * language name. HIDENAME is given an assembly-language name, and expands
49 * to a possibly-modified form that will be invisible to C programs.
50 */
51#if defined(__ELF__)
52#define CNAME(csym) csym
53#define HIDENAME(asmsym) __CONCAT(.,asmsym)
54#else
55#define CNAME(csym) __CONCAT(_,csym)
56#define HIDENAME(asmsym) asmsym
57#endif
58
59#define ALIGN_DATA .p2align 2 /* 4 byte alignment, zero filled */
60#ifdef GPROF
61#define ALIGN_TEXT .p2align 4,0x90 /* 16-byte alignment, nop filled */
62#else
63#define ALIGN_TEXT .p2align 2,0x90 /* 4-byte alignment, nop filled */
64#endif
65#define SUPERALIGN_TEXT .p2align 4,0x90 /* 16-byte alignment, nop filled */
66
67#define GEN_ENTRY(name) ALIGN_TEXT; .globl CNAME(name); \
68 .type CNAME(name),@function; CNAME(name):
69#define NON_GPROF_ENTRY(name) GEN_ENTRY(name)
70#define NON_GPROF_RET .byte 0xc3 /* opcode for `ret' */
71
72#ifdef LOCORE
73#define PCPU(member) %fs:GD_ ## member
74#define PCPU_ADDR(member, reg) movl %fs:GD_PRVSPACE,reg; \
75 addl $GD_ ## member,reg
76#endif
77
78#ifdef GPROF
79/*
80 * __mcount is like [.]mcount except that doesn't require its caller to set
81 * up a frame pointer. It must be called before pushing anything onto the
82 * stack. gcc should eventually generate code to call __mcount in most
83 * cases. This would make -pg in combination with -fomit-frame-pointer
84 * useful. gcc has a configuration variable PROFILE_BEFORE_PROLOGUE to
85 * allow profiling before setting up the frame pointer, but this is
86 * inadequate for good handling of special cases, e.g., -fpic works best
87 * with profiling after the prologue.
88 *
89 * [.]mexitcount is a new function to support non-statistical profiling if an
90 * accurate clock is available. For C sources, calls to it are generated
91 * by the FreeBSD extension `-mprofiler-epilogue' to gcc. It is best to
92 * call [.]mexitcount at the end of a function like the MEXITCOUNT macro does,
93 * but gcc currently generates calls to it at the start of the epilogue to
94 * avoid problems with -fpic.
95 *
96 * [.]mcount and __mcount may clobber the call-used registers and %ef.
97 * [.]mexitcount may clobber %ecx and %ef.
98 *
99 * Cross-jumping makes non-statistical profiling timing more complicated.
100 * It is handled in many cases by calling [.]mexitcount before jumping. It
101 * is handled for conditional jumps using CROSSJUMP() and CROSSJUMP_LABEL().
102 * It is handled for some fault-handling jumps by not sharing the exit
103 * routine.
104 *
105 * ALTENTRY() must be before a corresponding ENTRY() so that it can jump to
106 * the main entry point. Note that alt entries are counted twice. They
107 * have to be counted as ordinary entries for gprof to get the call times
108 * right for the ordinary entries.
109 *
110 * High local labels are used in macros to avoid clashes with local labels
111 * in functions.
112 *
113 * Ordinary `ret' is used instead of a macro `RET' because there are a lot
114 * of `ret's. 0xc3 is the opcode for `ret' (`#define ret ... ret' can't
115 * be used because this file is sometimes preprocessed in traditional mode).
116 * `ret' clobbers eflags but this doesn't matter.
117 */
118#define ALTENTRY(name) GEN_ENTRY(name) ; MCOUNT ; MEXITCOUNT ; jmp 9f
119#define CROSSJUMP(jtrue, label, jfalse) \
120 jfalse 8f; MEXITCOUNT; jmp __CONCAT(to,label); 8:
121#define CROSSJUMPTARGET(label) \
122 ALIGN_TEXT; __CONCAT(to,label): ; MCOUNT; jmp label
123#define ENTRY(name) GEN_ENTRY(name) ; 9: ; MCOUNT
124#define FAKE_MCOUNT(caller) pushl caller ; call __mcount ; popl %ecx
125#define MCOUNT call __mcount
126#define MCOUNT_LABEL(name) GEN_ENTRY(name) ; nop ; ALIGN_TEXT
127#define MEXITCOUNT call HIDENAME(mexitcount)
128#define ret MEXITCOUNT ; NON_GPROF_RET
129
130#else /* !GPROF */
131/*
132 * ALTENTRY() has to align because it is before a corresponding ENTRY().
133 * ENTRY() has to align to because there may be no ALTENTRY() before it.
134 * If there is a previous ALTENTRY() then the alignment code for ENTRY()
135 * is empty.
136 */
137#define ALTENTRY(name) GEN_ENTRY(name)
138#define CROSSJUMP(jtrue, label, jfalse) jtrue label
139#define CROSSJUMPTARGET(label)
140#define ENTRY(name) GEN_ENTRY(name)
141#define FAKE_MCOUNT(caller)
142#define MCOUNT
143#define MCOUNT_LABEL(name)
144#define MEXITCOUNT
145#endif /* GPROF */
146
147#endif /* !_MACHINE_ASMACROS_H_ */
| 40
41/* XXX too much duplication in various asm*.h's. */
42
43/*
44 * CNAME and HIDENAME manage the relationship between symbol names in C
45 * and the equivalent assembly language names. CNAME is given a name as
46 * it would be used in a C program. It expands to the equivalent assembly
47 * language name. HIDENAME is given an assembly-language name, and expands
48 * to a possibly-modified form that will be invisible to C programs.
49 */
50#if defined(__ELF__)
51#define CNAME(csym) csym
52#define HIDENAME(asmsym) __CONCAT(.,asmsym)
53#else
54#define CNAME(csym) __CONCAT(_,csym)
55#define HIDENAME(asmsym) asmsym
56#endif
57
58#define ALIGN_DATA .p2align 2 /* 4 byte alignment, zero filled */
59#ifdef GPROF
60#define ALIGN_TEXT .p2align 4,0x90 /* 16-byte alignment, nop filled */
61#else
62#define ALIGN_TEXT .p2align 2,0x90 /* 4-byte alignment, nop filled */
63#endif
64#define SUPERALIGN_TEXT .p2align 4,0x90 /* 16-byte alignment, nop filled */
65
66#define GEN_ENTRY(name) ALIGN_TEXT; .globl CNAME(name); \
67 .type CNAME(name),@function; CNAME(name):
68#define NON_GPROF_ENTRY(name) GEN_ENTRY(name)
69#define NON_GPROF_RET .byte 0xc3 /* opcode for `ret' */
70
71#ifdef LOCORE
72#define PCPU(member) %fs:GD_ ## member
73#define PCPU_ADDR(member, reg) movl %fs:GD_PRVSPACE,reg; \
74 addl $GD_ ## member,reg
75#endif
76
77#ifdef GPROF
78/*
79 * __mcount is like [.]mcount except that doesn't require its caller to set
80 * up a frame pointer. It must be called before pushing anything onto the
81 * stack. gcc should eventually generate code to call __mcount in most
82 * cases. This would make -pg in combination with -fomit-frame-pointer
83 * useful. gcc has a configuration variable PROFILE_BEFORE_PROLOGUE to
84 * allow profiling before setting up the frame pointer, but this is
85 * inadequate for good handling of special cases, e.g., -fpic works best
86 * with profiling after the prologue.
87 *
88 * [.]mexitcount is a new function to support non-statistical profiling if an
89 * accurate clock is available. For C sources, calls to it are generated
90 * by the FreeBSD extension `-mprofiler-epilogue' to gcc. It is best to
91 * call [.]mexitcount at the end of a function like the MEXITCOUNT macro does,
92 * but gcc currently generates calls to it at the start of the epilogue to
93 * avoid problems with -fpic.
94 *
95 * [.]mcount and __mcount may clobber the call-used registers and %ef.
96 * [.]mexitcount may clobber %ecx and %ef.
97 *
98 * Cross-jumping makes non-statistical profiling timing more complicated.
99 * It is handled in many cases by calling [.]mexitcount before jumping. It
100 * is handled for conditional jumps using CROSSJUMP() and CROSSJUMP_LABEL().
101 * It is handled for some fault-handling jumps by not sharing the exit
102 * routine.
103 *
104 * ALTENTRY() must be before a corresponding ENTRY() so that it can jump to
105 * the main entry point. Note that alt entries are counted twice. They
106 * have to be counted as ordinary entries for gprof to get the call times
107 * right for the ordinary entries.
108 *
109 * High local labels are used in macros to avoid clashes with local labels
110 * in functions.
111 *
112 * Ordinary `ret' is used instead of a macro `RET' because there are a lot
113 * of `ret's. 0xc3 is the opcode for `ret' (`#define ret ... ret' can't
114 * be used because this file is sometimes preprocessed in traditional mode).
115 * `ret' clobbers eflags but this doesn't matter.
116 */
117#define ALTENTRY(name) GEN_ENTRY(name) ; MCOUNT ; MEXITCOUNT ; jmp 9f
118#define CROSSJUMP(jtrue, label, jfalse) \
119 jfalse 8f; MEXITCOUNT; jmp __CONCAT(to,label); 8:
120#define CROSSJUMPTARGET(label) \
121 ALIGN_TEXT; __CONCAT(to,label): ; MCOUNT; jmp label
122#define ENTRY(name) GEN_ENTRY(name) ; 9: ; MCOUNT
123#define FAKE_MCOUNT(caller) pushl caller ; call __mcount ; popl %ecx
124#define MCOUNT call __mcount
125#define MCOUNT_LABEL(name) GEN_ENTRY(name) ; nop ; ALIGN_TEXT
126#define MEXITCOUNT call HIDENAME(mexitcount)
127#define ret MEXITCOUNT ; NON_GPROF_RET
128
129#else /* !GPROF */
130/*
131 * ALTENTRY() has to align because it is before a corresponding ENTRY().
132 * ENTRY() has to align to because there may be no ALTENTRY() before it.
133 * If there is a previous ALTENTRY() then the alignment code for ENTRY()
134 * is empty.
135 */
136#define ALTENTRY(name) GEN_ENTRY(name)
137#define CROSSJUMP(jtrue, label, jfalse) jtrue label
138#define CROSSJUMPTARGET(label)
139#define ENTRY(name) GEN_ENTRY(name)
140#define FAKE_MCOUNT(caller)
141#define MCOUNT
142#define MCOUNT_LABEL(name)
143#define MEXITCOUNT
144#endif /* GPROF */
145
146#endif /* !_MACHINE_ASMACROS_H_ */
|