| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1 | #ifndef _M68K_USER_H | 
|  | 2 | #define _M68K_USER_H | 
|  | 3 |  | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4 | /* Core file format: The core file is written in such a way that gdb | 
|  | 5 | can understand it and provide useful information to the user (under | 
|  | 6 | linux we use the 'trad-core' bfd).  There are quite a number of | 
|  | 7 | obstacles to being able to view the contents of the floating point | 
|  | 8 | registers, and until these are solved you will not be able to view the | 
|  | 9 | contents of them.  Actually, you can read in the core file and look at | 
|  | 10 | the contents of the user struct to find out what the floating point | 
|  | 11 | registers contain. | 
|  | 12 | The actual file contents are as follows: | 
|  | 13 | UPAGE: 1 page consisting of a user struct that tells gdb what is present | 
|  | 14 | in the file.  Directly after this is a copy of the task_struct, which | 
|  | 15 | is currently not used by gdb, but it may come in useful at some point. | 
|  | 16 | All of the registers are stored as part of the upage.  The upage should | 
|  | 17 | always be only one page. | 
|  | 18 | DATA: The data area is stored.  We use current->end_text to | 
|  | 19 | current->brk to pick up all of the user variables, plus any memory | 
|  | 20 | that may have been malloced.  No attempt is made to determine if a page | 
|  | 21 | is demand-zero or if a page is totally unused, we just cover the entire | 
|  | 22 | range.  All of the addresses are rounded in such a way that an integral | 
|  | 23 | number of pages is written. | 
|  | 24 | STACK: We need the stack information in order to get a meaningful | 
|  | 25 | backtrace.  We need to write the data from (esp) to | 
|  | 26 | current->start_stack, so we round each of these off in order to be able | 
|  | 27 | to write an integer number of pages. | 
|  | 28 | The minimum core file size is 3 pages, or 12288 bytes. | 
|  | 29 | */ | 
|  | 30 |  | 
|  | 31 | struct user_m68kfp_struct { | 
|  | 32 | unsigned long  fpregs[8*3];	/* fp0-fp7 registers */ | 
|  | 33 | unsigned long  fpcntl[3];	/* fp control regs */ | 
|  | 34 | }; | 
|  | 35 |  | 
|  | 36 | /* This is the old layout of "struct pt_regs" as of Linux 1.x, and | 
|  | 37 | is still the layout used by user (the new pt_regs doesn't have | 
|  | 38 | all registers). */ | 
|  | 39 | struct user_regs_struct { | 
|  | 40 | long d1,d2,d3,d4,d5,d6,d7; | 
|  | 41 | long a0,a1,a2,a3,a4,a5,a6; | 
|  | 42 | long d0; | 
|  | 43 | long usp; | 
|  | 44 | long orig_d0; | 
|  | 45 | short stkadj; | 
|  | 46 | short sr; | 
|  | 47 | long pc; | 
|  | 48 | short fmtvec; | 
|  | 49 | short __fill; | 
|  | 50 | }; | 
|  | 51 |  | 
|  | 52 |  | 
|  | 53 | /* When the kernel dumps core, it starts by dumping the user struct - | 
|  | 54 | this will be used by gdb to figure out where the data and stack segments | 
|  | 55 | are within the file, and what virtual addresses to use. */ | 
|  | 56 | struct user{ | 
|  | 57 | /* We start with the registers, to mimic the way that "memory" is returned | 
|  | 58 | from the ptrace(3,...) function.  */ | 
|  | 59 | struct user_regs_struct regs;	/* Where the registers are actually stored */ | 
|  | 60 | /* ptrace does not yet supply these.  Someday.... */ | 
|  | 61 | int u_fpvalid;		/* True if math co-processor being used. */ | 
|  | 62 | /* for this mess. Not yet used. */ | 
|  | 63 | struct user_m68kfp_struct m68kfp; /* Math Co-processor registers. */ | 
|  | 64 | /* The rest of this junk is to help gdb figure out what goes where */ | 
|  | 65 | unsigned long int u_tsize;	/* Text segment size (pages). */ | 
|  | 66 | unsigned long int u_dsize;	/* Data segment size (pages). */ | 
|  | 67 | unsigned long int u_ssize;	/* Stack segment size (pages). */ | 
|  | 68 | unsigned long start_code;     /* Starting virtual address of text. */ | 
|  | 69 | unsigned long start_stack;	/* Starting virtual address of stack area. | 
|  | 70 | This is actually the bottom of the stack, | 
|  | 71 | the top of the stack is always found in the | 
|  | 72 | esp register.  */ | 
|  | 73 | long int signal;		/* Signal that caused the core dump. */ | 
|  | 74 | int reserved;			/* No longer used */ | 
|  | 75 | struct user_regs_struct *u_ar0; | 
|  | 76 | /* Used by gdb to help find the values for */ | 
|  | 77 | /* the registers. */ | 
|  | 78 | struct user_m68kfp_struct* u_fpstate;	/* Math Co-processor pointer. */ | 
|  | 79 | unsigned long magic;		/* To uniquely identify a core file */ | 
|  | 80 | char u_comm[32];		/* User command that was responsible */ | 
|  | 81 | }; | 
| Roman Zippel | 5e7c4ea | 2006-10-06 00:43:57 -0700 | [diff] [blame] | 82 | #define NBPG 4096 | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 83 | #define UPAGES 1 | 
|  | 84 | #define HOST_TEXT_START_ADDR (u.start_code) | 
|  | 85 | #define HOST_STACK_END_ADDR (u.start_stack + u.u_ssize * NBPG) | 
|  | 86 |  | 
|  | 87 | #endif |