1 #ifndef _LINUX_USER_H 2 #define _LINUX_USER_H 3 4 #include <asm/page.h> 5 #include <linux/ptrace.h> 6 /* Core file format: The core file is written in such a way that gdb 7 can understand it and provide useful information to the user (under 8 linux we use the 'trad-core' bfd). There are quite a number of 9 obstacles to being able to view the contents of the floating point 10 registers, and until these are solved you will not be able to view the 11 contents of them. Actually, you can read in the core file and look at 12 the contents of the user struct to find out what the floating point 13 registers contain. 14 The actual file contents are as follows: 15 UPAGE: 1 page consisting of a user struct that tells gdb what is present 16 in the file. Directly after this is a copy of the task_struct, which 17 is currently not used by gdb, but it may come in useful at some point. 18 All of the registers are stored as part of the upage. The upage should 19 always be only one page. 20 DATA: The data area is stored. We use current->end_text to 21 current->brk to pick up all of the user variables, plus any memory 22 that may have been malloced. No attempt is made to determine if a page 23 is demand-zero or if a page is totally unused, we just cover the entire 24 range. All of the addresses are rounded in such a way that an integral 25 number of pages is written. 26 STACK: We need the stack information in order to get a meaningful 27 backtrace. We need to write the data from (esp) to 28 current->start_stack, so we round each of these off in order to be able 29 to write an integer number of pages. 30 The minimum core file size is 3 pages, or 12288 bytes. 31 */ 32 33 struct user_i387_struct { 34 long cwd; 35 long swd; 36 long twd; 37 long fip; 38 long fcs; 39 long foo; 40 long fos; 41 long st_space[20]; /* 8*10 bytes for each FP-reg = 80 bytes */ 42 }; 43 44 /* When the kernel dumps core, it starts by dumping the user struct - 45 this will be used by gdb to figure out where the data and stack segments 46 are within the file, and what virtual addresses to use. */ 47 struct user{ 48 /* We start with the registers, to mimic the way that "memory" is returned 49 from the ptrace(3,...) function. */ 50 struct pt_regs regs; /* Where the registers are actually stored */ 51 /* ptrace does not yet supply these. Someday.... */ 52 int u_fpvalid; /* True if math co-processor being used. */ 53 /* for this mess. Not yet used. */ 54 struct user_i387_struct i387; /* Math Co-processor registers. */ 55 /* The rest of this junk is to help gdb figure out what goes where */ 56 unsigned long int u_tsize; /* Text segment size (pages). */ 57 unsigned long int u_dsize; /* Data segment size (pages). */ 58 unsigned long int u_ssize; /* Stack segment size (pages). */ 59 unsigned long start_code; /* Starting virtual address of text. */ 60 unsigned long start_stack; /* Starting virtual address of stack area. 61 This is actually the bottom of the stack, 62 the top of the stack is always found in the 63 esp register. */ 64 long int signal; /* Signal that caused the core dump. */ 65 int reserved; /* No longer used */ 66 struct pt_regs * u_ar0; /* Used by gdb to help find the values for */ 67 /* the registers. */ 68 struct user_i387_struct* u_fpstate; /* Math Co-processor pointer. */ 69 unsigned long magic; /* To uniquely identify a core file */ 70 char u_comm[32]; /* User command that was responsible */ 71 int u_debugreg[8]; 72 }; 73 #define NBPG PAGE_SIZE 74 #define UPAGES 1 75 #define HOST_TEXT_START_ADDR (u.start_code) 76 #define HOST_STACK_END_ADDR (u.start_stack + u.u_ssize * NBPG) 77 78 #endif