|
|
1.1 root 1: /*
2: * Copyright (c) 1980 Regents of the University of California.
3: * All rights reserved. The Berkeley software License Agreement
4: * specifies the terms and conditions for redistribution.
5: *
6: * @(#)pxinfo.h 5.3 (Berkeley) 1/9/89
7: */
8:
9: /*
10: * This is the information we get after the initial trap that px does.
11: * By passing the "-d" flag, we cause px to call a procedure with the
12: * the following information:
13: *
14: * address of the display
15: * address of the display pointer
16: * address of the beginning of the object code
17: *
18: * the address of the program counter used in the interpreter procedure
19: * (px actually keeps the pc in a register if it can, but stores
20: * it in this location each time around the interpreter loop.)
21: * the address of the main interpreter loop (past the store of pc)
22: */
23:
24: #ifdef tahoe
25: typedef struct {
26: short trp_savemask;
27: short trp_removed;
28: int trp_oldfp;
29: ADDRESS *disp;
30: ADDRESS *dp;
31: ADDRESS objstart;
32: ADDRESS pcaddr;
33: ADDRESS loopaddr;
34: } TRAPARGS;
35: #else
36: typedef struct {
37: int nargs;
38: ADDRESS *disp;
39: ADDRESS *dp;
40: ADDRESS objstart;
41: ADDRESS pcaddr;
42: ADDRESS loopaddr;
43: } TRAPARGS;
44: #endif
45:
46: ADDRESS *DISPLAY;
47: ADDRESS *DP;
48: ADDRESS ENDOFF;
49: ADDRESS PCADDR;
50: ADDRESS LOOPADDR;
51: #ifdef tahoe
52: ADDRESS RETLOC;
53: ADDRESS INTFP;
54: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.