WebSVN – HelenOS – Diff – /tags/0.2.0.4/kernel/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.
 */
 
/** @addtogroup ia64   
 * @{
 */
/** @file
 */
 
#ifndef KERN_ia64_CONTEXT_H_
#define KERN_ia64_CONTEXT_H_
 
#include <arch/types.h>
#include <arch/register.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 = (uintptr_t) _pc;                              \
        (c)->bsp = ((uintptr_t) stack) + ALIGN_UP((size), REGISTER_STACK_ALIGNMENT);        \
        (c)->ar_pfs &= PFM_MASK;                                \
        (c)->sp = ((uintptr_t) stack) + ALIGN_UP((size), STACK_ALIGNMENT) - SP_DELTA;       \
    } while (0);
 
/*
 * Only save registers that must be preserved across
 * function calls.
 */
typedef struct {
 
    /*
     * Application registers
     */
    uint64_t ar_pfs;
    uint64_t ar_unat_caller;
    uint64_t ar_unat_callee;
    uint64_t ar_rsc;
    uintptr_t bsp;      /* ar_bsp */
    uint64_t ar_rnat;
    uint64_t ar_lc;
 
    /*
     * General registers
     */
    uint64_t r1;
    uint64_t r4;
    uint64_t r5;
    uint64_t r6;
    uint64_t r7;
    uintptr_t sp;       /* r12 */
    uint64_t r13;
   
    /*
     * Branch registers
     */
    uintptr_t pc;       /* b0 */
    uint64_t b1;
    uint64_t b2;
    uint64_t b3;
    uint64_t b4;
    uint64_t b5;
 
    /*
     * Predicate registers
     */
    uint64_t pr;
 
    uint128_t f2 __attribute__ ((aligned(16)));
    uint128_t f3;
    uint128_t f4;
    uint128_t f5;
 
    uint128_t f16;
    uint128_t f17;
    uint128_t f18;
    uint128_t f19;
    uint128_t f20;
    uint128_t f21;
    uint128_t f22;
    uint128_t f23;
    uint128_t f24;
    uint128_t f25;
    uint128_t f26;
    uint128_t f27;
    uint128_t f28;
    uint128_t f29;
    uint128_t f30;
    uint128_t f31;
   
    ipl_t ipl;
} context_t;
 
#endif
 
/** @}
 */
 

Rev 2089	Rev 2130
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	/** @addtogroup ia64	29	/** @addtogroup ia64
30	* @{	30	* @{
31	*/	31	*/
32	/** @file	32	/** @file
33	*/	33	*/
34		34
35	#ifndef KERN_ia64_CONTEXT_H_	35	#ifndef KERN_ia64_CONTEXT_H_
36	#define KERN_ia64_CONTEXT_H_	36	#define KERN_ia64_CONTEXT_H_
37		37
38	#include <arch/types.h>	38	#include <arch/types.h>
39	#include <arch/register.h>	39	#include <arch/register.h>
40	#include <align.h>	40	#include <align.h>
41	#include <arch/stack.h>	41	#include <arch/stack.h>
42		42
43	/*	43	/*
44	* context_save_arch() and context_restore_arch() are both leaf procedures.	44	* context_save_arch() and context_restore_arch() are both leaf procedures.
45	* No need to allocate scratch area.	45	* No need to allocate scratch area.
46	*	46	*
47	* One item is put onto the stack to support get_stack_base().	47	* One item is put onto the stack to support get_stack_base().
48	*/	48	*/
49	#define SP_DELTA (0 + ALIGN_UP(STACK_ITEM_SIZE, STACK_ALIGNMENT))	49	#define SP_DELTA (0 + ALIGN_UP(STACK_ITEM_SIZE, STACK_ALIGNMENT))
50		50
51	#ifdef context_set	51	#ifdef context_set
52	#undef context_set	52	#undef context_set
53	#endif	53	#endif
54		54
55	/* RSE stack starts at the bottom of memory stack. */	55	/* RSE stack starts at the bottom of memory stack. */
56	#define context_set(c, _pc, stack, size) \	56	#define context_set(c, _pc, stack, size) \
57	do { \	57	do { \
58	(c)->pc = (uintptr_t) _pc; \	58	(c)->pc = (uintptr_t) _pc; \
59	(c)->bsp = ((uintptr_t) stack) + ALIGN_UP((size), REGISTER_STACK_ALIGNMENT); \	59	(c)->bsp = ((uintptr_t) stack) + ALIGN_UP((size), REGISTER_STACK_ALIGNMENT); \
60	(c)->ar_pfs &= PFM_MASK; \	60	(c)->ar_pfs &= PFM_MASK; \
61	(c)->sp = ((uintptr_t) stack) + ALIGN_UP((size), STACK_ALIGNMENT) - SP_DELTA; \	61	(c)->sp = ((uintptr_t) stack) + ALIGN_UP((size), STACK_ALIGNMENT) - SP_DELTA; \
62	} while (0);	62	} while (0);
63		63
64	/*	64	/*
65	* Only save registers that must be preserved across	65	* Only save registers that must be preserved across
66	* function calls.	66	* function calls.
67	*/	67	*/
68	typedef struct {	68	typedef struct {
69		69
70	/*	70	/*
71	* Application registers	71	* Application registers
72	*/	72	*/
73	uint64_t ar_pfs;	73	uint64_t ar_pfs;
74	uint64_t ar_unat_caller;	74	uint64_t ar_unat_caller;
75	uint64_t ar_unat_callee;	75	uint64_t ar_unat_callee;
76	uint64_t ar_rsc;	76	uint64_t ar_rsc;
77	uintptr_t bsp; /* ar_bsp */	77	uintptr_t bsp; /* ar_bsp */
78	uint64_t ar_rnat;	78	uint64_t ar_rnat;
79	uint64_t ar_lc;	79	uint64_t ar_lc;
80		80
81	/*	81	/*
82	* General registers	82	* General registers
83	*/	83	*/
84	uint64_t r1;	84	uint64_t r1;
85	uint64_t r4;	85	uint64_t r4;
86	uint64_t r5;	86	uint64_t r5;
87	uint64_t r6;	87	uint64_t r6;
88	uint64_t r7;	88	uint64_t r7;
89	uintptr_t sp; /* r12 */	89	uintptr_t sp; /* r12 */
90	uint64_t r13;	90	uint64_t r13;
91		91
92	/*	92	/*
93	* Branch registers	93	* Branch registers
94	*/	94	*/
95	uintptr_t pc; /* b0 */	95	uintptr_t pc; /* b0 */
96	uint64_t b1;	96	uint64_t b1;
97	uint64_t b2;	97	uint64_t b2;
98	uint64_t b3;	98	uint64_t b3;
99	uint64_t b4;	99	uint64_t b4;
100	uint64_t b5;	100	uint64_t b5;
101		101
102	/*	102	/*
103	* Predicate registers	103	* Predicate registers
104	*/	104	*/
105	uint64_t pr;	105	uint64_t pr;
106		106
107	uint128_t f2 __attribute__ ((aligned(16)));	107	uint128_t f2 __attribute__ ((aligned(16)));
108	uint128_t f3;	108	uint128_t f3;
109	uint128_t f4;	109	uint128_t f4;
110	uint128_t f5;	110	uint128_t f5;
111		111
112	uint128_t f16;	112	uint128_t f16;
113	uint128_t f17;	113	uint128_t f17;
114	uint128_t f18;	114	uint128_t f18;
115	uint128_t f19;	115	uint128_t f19;
116	uint128_t f20;	116	uint128_t f20;
117	uint128_t f21;	117	uint128_t f21;
118	uint128_t f22;	118	uint128_t f22;
119	uint128_t f23;	119	uint128_t f23;
120	uint128_t f24;	120	uint128_t f24;
121	uint128_t f25;	121	uint128_t f25;
122	uint128_t f26;	122	uint128_t f26;
123	uint128_t f27;	123	uint128_t f27;
124	uint128_t f28;	124	uint128_t f28;
125	uint128_t f29;	125	uint128_t f29;
126	uint128_t f30;	126	uint128_t f30;
127	uint128_t f31;	127	uint128_t f31;
128		128
129	ipl_t ipl;	129	ipl_t ipl;
130	} context_t;	130	} context_t;
131		131
132	#endif	132	#endif
133		133
134	/** @}	134	/** @}
135	*/	135	*/
136		136

Subversion Repositories HelenOS

(root)/tags/0.2.0.4/kernel/arch/ia64/include/context.h – Rev 2089 → 2130