asm.h revision 1.10
1/* $NetBSD: asm.h,v 1.10 2000/06/23 12:18:50 kleink Exp $ */ 2/* 3 * Copyright (c) 1982, 1993 4 * The Regents of the University of California. 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 * @(#)DEFS.h 8.1 (Berkeley) 6/4/93 35 */ 36 37#ifndef _MACHINE_ASM_H_ 38#define _MACHINE_ASM_H_ 39 40#define R0 0x001 41#define R1 0x002 42#define R2 0x004 43#define R3 0x008 44#define R4 0x010 45#define R5 0x020 46#define R6 0x040 47#define R7 0x080 48#define R8 0x100 49#define R9 0x200 50#define R10 0x400 51#define R11 0x800 52 53#ifdef __STDC__ 54#ifdef GPROF 55#define ENTRY(x, regs) \ 56 .globl _ ## x; .type _ ## x,@function ; .align 2; _ ## x: .word regs; \ 57 .data; 1:; .long 0; .text; moval 1b,r0; jsb mcount 58#define ASENTRY(x, regs) \ 59 .globl x; .type x,@function; .align 2; x: .word regs; \ 60 .data; 1:; .long 0; .text; moval 1b,r0; jsb mcount 61#else 62#define ENTRY(x, regs) \ 63 .globl _ ## x; .type _ ## x,@function; \ 64 .align 2; _ ## x : .word regs 65#define ASENTRY(x, regs) \ 66 .globl x; .type x,@function; .align 2; x: .word regs 67#endif 68#define ALTENTRY(x) .globl _ ## x; _ ## x: 69# else 70#ifdef GPROF 71#define ENTRY(x, regs) \ 72 .globl _/**/x; .type _/**/x,@function; .align 2; _/**/x: .word regs; \ 73 .data; 1:; .long 0; .text; moval 1b,r0; jsb mcount 74#define ASENTRY(x, regs) \ 75 .globl x; .type x,@function; .align 2; x: .word regs; \ 76 .data; 1:; .long 0; .text; moval 1b,r0; jsb mcount 77#else 78#define ENTRY(x, regs) \ 79 .globl _/**/x; .type _/**/x,@function; .align 2; _/**/x: .word regs 80#define ASENTRY(x, regs) \ 81 .globl x; .type x,@function; .align 2; x: .word regs 82#endif 83#define ALTENTRY(x) .globl _/**/x; _/**/x: 84#endif 85 86#ifdef __ELF__ 87#define WEAK_ALIAS(alias,sym) \ 88 .weak alias; \ 89 alias = sym 90#endif 91 92#ifdef __STDC__ 93#define __STRING(x) #x 94#define WARN_REFERENCES(sym,msg) \ 95 .stabs msg ## ,30,0,0,0 ; \ 96 .stabs __STRING(_ ## sym) ## ,1,0,0,0 97#else 98#define __STRING(x) "x" 99#define WARN_REFERENCES(sym,msg) \ 100 .stabs msg,30,0,0,0 ; \ 101 .stabs __STRING(_/**/sym),1,0,0,0 102#endif /* __STDC__ */ 103 104#endif 105