|
|
1.1 root 1: /*-
2: * Copyright (c) 1990 The Regents of the University of California.
3: * All rights reserved.
4: *
5: * This code is derived from software contributed to Berkeley by
6: * the Systems Programming Group of the University of Utah Computer
7: * Science Department.
8: *
9: * Redistribution and use in source and binary forms are permitted
10: * provided that: (1) source distributions retain this entire copyright
11: * notice and comment, and (2) distributions including binaries display
12: * the following acknowledgement: ``This product includes software
13: * developed by the University of California, Berkeley and its contributors''
14: * in the documentation or other materials provided with the distribution
15: * and in all advertising materials mentioning features or use of this
16: * software. Neither the name of the University nor the names of its
17: * contributors may be used to endorse or promote products derived
18: * from this software without specific prior written permission.
19: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
20: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
21: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
22: *
23: * @(#)SYS.h 5.3 (Berkeley) 5/30/90
24: */
25:
26: #include <sys/syscall.h>
27:
28: /* vax/tahoe compat */
29: #define ret rts
30: #define r0 d0
31: #define r1 d1
32:
33: #ifdef PROF
34: #ifdef __GNUC__
35: #define ENTRY(x) .globl _/**/x; .even; _/**/x:; .data; PROF/**/x:; \
36: .long 0; .text; link a6,#0; lea PROF/**/x,a0; \
37: jbsr mcount; unlk a6
38: #else
39: #define ENTRY(x) .globl _/**/x; .even; _/**/x:; .data; PROF/**/x:; \
40: .long 0; .text; lea PROF/**/x,a0; jbsr mcount
41: #endif
42: #else
43: #define ENTRY(x) .globl _/**/x; .even; _/**/x:
44: #endif PROF
45: #define SYSCALL(x) .even; err: jmp cerror; ENTRY(x); movl #SYS_/**/x,d0; \
46: trap #0; jcs err
47: #define PSEUDO(x,y) ENTRY(x); movl #SYS_/**/y,d0; trap #0;
48:
49: #define ASMSTR .asciz
50:
51: .globl cerror
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.