WebSVN – HelenOS-historic – Diff – /kernel/trunk/arch/ia64/include/context.h


/*
 * Copyright (C) 2005 Jakub Jermar
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
#ifndef __ia64_CONTEXT_H__
#define __ia64_CONTEXT_H__
 
#include <arch/types.h>
#include <arch/register.h>
#include <typedefs.h>
#include <align.h>
#include <arch/stack.h>
 
/*
 * context_save_arch() and context_restore_arch() are both leaf procedures.
 * No need to allocate scratch area.
 *
 * One item is put onto the stack to support get_stack_base().
 */
#define SP_DELTA    (0+ALIGN_UP(STACK_ITEM_SIZE, STACK_ALIGNMENT))
 
#ifdef context_set
#undef context_set
#endif
 
/* RSE stack starts at the bottom of memory stack. */
#define context_set(c, _pc, stack, size)                                \
    do {                                                \
        (c)->pc = (__address) _pc;                              \
        (c)->bsp = ((__address) stack) + ALIGN_UP((size), REGISTER_STACK_ALIGNMENT);        \
        (c)->ar_pfs &= PFM_MASK;                                \
        (c)->sp = ((__address) stack) + ALIGN_UP((size), STACK_ALIGNMENT) - SP_DELTA;       \
    } while (0);
 
/*
 * Only save registers that must be preserved across
 * function calls.
 */
struct context {
 
    /*
     * Application registers
     */
    __u64 ar_pfs;
    __u64 ar_unat_caller;
    __u64 ar_unat_callee;
    __u64 ar_rsc;
    __address bsp;      /* ar_bsp */
    __u64 ar_rnat;
    __u64 ar_lc;
 
    /*
     * General registers
     */
    __u64 r1;
    __u64 r4;
    __u64 r5;
    __u64 r6;
    __u64 r7;
    __address sp;       /* r12 */
    __u64 r13;
   
    /*
     * Branch registers
     */
    __address pc;       /* b0 */
    __u64 b1;
    __u64 b2;
    __u64 b3;
    __u64 b4;
    __u64 b5;
 
    /*
     * Predicate registers
     */
    __u64 pr;
 
    __r128 f2 __attribute__ ((aligned(16)));
    __r128 f3;
    __r128 f4;
    __r128 f5;
 
    __r128 f16;
    __r128 f17;
    __r128 f18;
    __r128 f19;
    __r128 f20;
    __r128 f21;
    __r128 f22;
    __r128 f23;
    __r128 f24;
    __r128 f25;
    __r128 f26;
    __r128 f27;
    __r128 f28;
    __r128 f29;
    __r128 f30;
    __r128 f31;
   
    ipl_t ipl;
};
 
 
 
#endif
 

Rev 1137	Rev 1138
1	/*	1	/*
2	* Copyright (C) 2005 Jakub Jermar	2	* Copyright (C) 2005 Jakub Jermar
3	* All rights reserved.	3	* All rights reserved.
4	*	4	*
5	* Redistribution and use in source and binary forms, with or without	5	* Redistribution and use in source and binary forms, with or without
6	* modification, are permitted provided that the following conditions	6	* modification, are permitted provided that the following conditions
7	* are met:	7	* are met:
8	*	8	*
9	* - Redistributions of source code must retain the above copyright	9	* - Redistributions of source code must retain the above copyright
10	* notice, this list of conditions and the following disclaimer.	10	* notice, this list of conditions and the following disclaimer.
11	* - Redistributions in binary form must reproduce the above copyright	11	* - Redistributions in binary form must reproduce the above copyright
12	* notice, this list of conditions and the following disclaimer in the	12	* notice, this list of conditions and the following disclaimer in the
13	* documentation and/or other materials provided with the distribution.	13	* documentation and/or other materials provided with the distribution.
14	* - The name of the author may not be used to endorse or promote products	14	* - The name of the author may not be used to endorse or promote products
15	* derived from this software without specific prior written permission.	15	* derived from this software without specific prior written permission.
16	*	16	*
17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR	17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES	18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.	19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,	20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT	21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,	22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY	23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT	24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF	25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.	26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27	*/	27	*/
28		28
29	#ifndef __ia64_CONTEXT_H__	29	#ifndef __ia64_CONTEXT_H__
30	#define __ia64_CONTEXT_H__	30	#define __ia64_CONTEXT_H__
31		31
32	#include <arch/types.h>	32	#include <arch/types.h>
33	#include <arch/register.h>	33	#include <arch/register.h>
34	#include <typedefs.h>	34	#include <typedefs.h>
35	#include <align.h>	35	#include <align.h>
36	#include <arch/stack.h>	36	#include <arch/stack.h>
37		37
38	/*	38	/*
39	* context_save() and context_restore() are both leaf procedures.	39	* context_save_arch() and context_restore_arch() are both leaf procedures.
40	* No need to allocate scratch area.	40	* No need to allocate scratch area.
41	*	41	*
42	* One item is put onto the stack to support get_stack_base().	42	* One item is put onto the stack to support get_stack_base().
43	*/	43	*/
44	#define SP_DELTA (0+ALIGN_UP(STACK_ITEM_SIZE, STACK_ALIGNMENT))	44	#define SP_DELTA (0+ALIGN_UP(STACK_ITEM_SIZE, STACK_ALIGNMENT))
45		45
46	#ifdef context_set	46	#ifdef context_set
47	#undef context_set	47	#undef context_set
48	#endif	48	#endif
49		49
50	/RSE stack should begin under bottom of stack @ kernel/	50	/* RSE stack starts at the bottom of memory stack. */
51	#define context_set(c, _pc, stack, size) \	51	#define context_set(c, _pc, stack, size) \
-		52	do { \
52	(c)->pc = (__address) _pc; \	53	(c)->pc = (__address) _pc; \
53	(c)->bsp = ((__address) stack) + ALIGN_UP((size), STACK_ALIGNMENT) ; \	54	(c)->bsp = ((__address) stack) + ALIGN_UP((size), REGISTER_STACK_ALIGNMENT); \
54	(c)->ar_pfs &= PFM_MASK; \	55	(c)->ar_pfs &= PFM_MASK; \
55	(c)->sp = ((__address) stack) + ALIGN_UP((size), STACK_ALIGNMENT) - SP_DELTA;	56	(c)->sp = ((__address) stack) + ALIGN_UP((size), STACK_ALIGNMENT) - SP_DELTA; \
-		57	} while (0);
56		58
57	/*	59	/*
58	* Only save registers that must be preserved across	60	* Only save registers that must be preserved across
59	* function calls.	61	* function calls.
60	*/	62	*/
61	struct context {	63	struct context {
62		64
63	/*	65	/*
64	* Application registers	66	* Application registers
65	*/	67	*/
66	__u64 ar_pfs;	68	__u64 ar_pfs;
67	__u64 ar_unat_caller;	69	__u64 ar_unat_caller;
68	__u64 ar_unat_callee;	70	__u64 ar_unat_callee;
69	__u64 ar_rsc;	71	__u64 ar_rsc;
70	__address bsp; /* ar_bsp */	72	__address bsp; /* ar_bsp */
71	__u64 ar_rnat;	73	__u64 ar_rnat;
72	__u64 ar_lc;	74	__u64 ar_lc;
73		75
74	/*	76	/*
75	* General registers	77	* General registers
76	*/	78	*/
77	__u64 r1;	79	__u64 r1;
78	__u64 r4;	80	__u64 r4;
79	__u64 r5;	81	__u64 r5;
80	__u64 r6;	82	__u64 r6;
81	__u64 r7;	83	__u64 r7;
82	__address sp; /* r12 */	84	__address sp; /* r12 */
83	__u64 r13;	85	__u64 r13;
84		86
85	/*	87	/*
86	* Branch registers	88	* Branch registers
87	*/	89	*/
88	__address pc; /* b0 */	90	__address pc; /* b0 */
89	__u64 b1;	91	__u64 b1;
90	__u64 b2;	92	__u64 b2;
91	__u64 b3;	93	__u64 b3;
92	__u64 b4;	94	__u64 b4;
93	__u64 b5;	95	__u64 b5;
94		96
95	/*	97	/*
96	* Predicate registers	98	* Predicate registers
97	*/	99	*/
98	__u64 pr;	100	__u64 pr;
99		101
100	__r128 f2 __attribute__ ((aligned(16)));	102	__r128 f2 __attribute__ ((aligned(16)));
101	__r128 f3;	103	__r128 f3;
102	__r128 f4;	104	__r128 f4;
103	__r128 f5;	105	__r128 f5;
104		106
105	__r128 f16;	107	__r128 f16;
106	__r128 f17;	108	__r128 f17;
107	__r128 f18;	109	__r128 f18;
108	__r128 f19;	110	__r128 f19;
109	__r128 f20;	111	__r128 f20;
110	__r128 f21;	112	__r128 f21;
111	__r128 f22;	113	__r128 f22;
112	__r128 f23;	114	__r128 f23;
113	__r128 f24;	115	__r128 f24;
114	__r128 f25;	116	__r128 f25;
115	__r128 f26;	117	__r128 f26;
116	__r128 f27;	118	__r128 f27;
117	__r128 f28;	119	__r128 f28;
118	__r128 f29;	120	__r128 f29;
119	__r128 f30;	121	__r128 f30;
120	__r128 f31;	122	__r128 f31;
121		123
122	ipl_t ipl;	124	ipl_t ipl;
123	};	125	};
124		126
125		-
126		-
127	#endif	127	#endif
128		128

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/arch/ia64/include/context.h – Rev 1137 → 1138