WebSVN – HelenOS-historic – Diff – /uspace/trunk/libc/arch/ia64/include/psthread.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 __LIBC__ia64PSTHREAD_H__
#define __LIBC__ia64PSTHREAD_H__
 
#include <types.h>
#include <align.h>
#include <libarch/stack.h>
 
/*
 * context_save() and context_restore() are both leaf procedures.
 * No need to allocate scratch area.
 */
#define SP_DELTA    (0+ALIGN_UP(STACK_ITEM_SIZE, STACK_ALIGNMENT))
 
#define PFM_MASK        (~0x3fffffffff)
 
#define PSTHREAD_INITIAL_STACK_PAGES_NO 2
#define PSTHREAD_INITIAL_STACK_DIVISION 2  /*Stack is divided into two equal parts (for clasic stack and register stack)*/
 
 
#ifdef context_set
#undef context_set
#endif
 
#define context_set(c, _pc, stack, size, tls)                               \
    do {                                                \
        (c)->pc = (uint64_t) _pc;                               \
        (c)->bsp = ((uint64_t) stack) + size / PSTHREAD_INITIAL_STACK_DIVISION;                             \
        (c)->ar_pfs &= PFM_MASK;                                \
        (c)->sp = ((uint64_t) stack) + ALIGN_UP((size / PSTHREAD_INITIAL_STACK_DIVISION), STACK_ALIGNMENT) - SP_DELTA;      \
        (c)->tp = (uint64_t) tls;                               \
    } while (0);
   
 
/*
 * Only save registers that must be preserved across
 * function calls.
 */
typedef struct context {
 
    /*
     * Application registers
     */
    uint64_t ar_pfs;
    uint64_t ar_unat_caller;
    uint64_t ar_unat_callee;
    uint64_t ar_rsc;
    uint64_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;
    uint64_t sp;        /* r12 */
    uint64_t tp;        /* r13 */
   
    /*
     * Branch registers
     */
    uint64_t pc;        /* b0 */
    uint64_t b1;
    uint64_t b2;
    uint64_t b3;
    uint64_t b4;
    uint64_t b5;
 
    /*
     * Predicate registers
     */
    uint64_t pr;
} context_t;
 
#endif
 

Rev 1125	Rev 1155
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 __LIBC__ia64PSTHREAD_H__	29	#ifndef __LIBC__ia64PSTHREAD_H__
30	#define __LIBC__ia64PSTHREAD_H__	30	#define __LIBC__ia64PSTHREAD_H__
31		31
32	#include <types.h>	32	#include <types.h>
33	#include <align.h>	33	#include <align.h>
34	#include <libarch/stack.h>	34	#include <libarch/stack.h>
35		35
36	/*	36	/*
37	* context_save() and context_restore() are both leaf procedures.	37	* context_save() and context_restore() are both leaf procedures.
38	* No need to allocate scratch area.	38	* No need to allocate scratch area.
39	*/	39	*/
40	#define SP_DELTA (0+ALIGN_UP(STACK_ITEM_SIZE, STACK_ALIGNMENT))	40	#define SP_DELTA (0+ALIGN_UP(STACK_ITEM_SIZE, STACK_ALIGNMENT))
41		41
42	#define PFM_MASK (~0x3fffffffff)	42	#define PFM_MASK (~0x3fffffffff)
43		43
-		44	#define PSTHREAD_INITIAL_STACK_PAGES_NO 2
-		45	#define PSTHREAD_INITIAL_STACK_DIVISION 2 /Stack is divided into two equal parts (for clasic stack and register stack)/
-		46
-		47
44	#ifdef context_set	48	#ifdef context_set
45	#undef context_set	49	#undef context_set
46	#endif	50	#endif
47		51
48	#define context_set(c, _pc, stack, size, tls) \	52	#define context_set(c, _pc, stack, size, tls) \
49	do { \	53	do { \
50	(c)->pc = (uint64_t) _pc; \	54	(c)->pc = (uint64_t) _pc; \
51	(c)->bsp = (uint64_t) stack; \	55	(c)->bsp = ((uint64_t) stack) + size / PSTHREAD_INITIAL_STACK_DIVISION; \
52	(c)->ar_pfs &= PFM_MASK; \	56	(c)->ar_pfs &= PFM_MASK; \
53	(c)->sp = ((uint64_t) stack) + ALIGN_UP((size), STACK_ALIGNMENT) - SP_DELTA; \	57	(c)->sp = ((uint64_t) stack) + ALIGN_UP((size / PSTHREAD_INITIAL_STACK_DIVISION), STACK_ALIGNMENT) - SP_DELTA; \
54	(c)->tp = (uint64_t) tls; \	58	(c)->tp = (uint64_t) tls; \
55	} while (0);	59	} while (0);
56		60
57		61
58	/*	62	/*
59	* Only save registers that must be preserved across	63	* Only save registers that must be preserved across
60	* function calls.	64	* function calls.
61	*/	65	*/
62	typedef struct context {	66	typedef struct context {
63		67
64	/*	68	/*
65	* Application registers	69	* Application registers
66	*/	70	*/
67	uint64_t ar_pfs;	71	uint64_t ar_pfs;
68	uint64_t ar_unat_caller;	72	uint64_t ar_unat_caller;
69	uint64_t ar_unat_callee;	73	uint64_t ar_unat_callee;
70	uint64_t ar_rsc;	74	uint64_t ar_rsc;
71	uint64_t bsp; /* ar_bsp */	75	uint64_t bsp; /* ar_bsp */
72	uint64_t ar_rnat;	76	uint64_t ar_rnat;
73	uint64_t ar_lc;	77	uint64_t ar_lc;
74		78
75	/*	79	/*
76	* General registers	80	* General registers
77	*/	81	*/
78	uint64_t r1;	82	uint64_t r1;
79	uint64_t r4;	83	uint64_t r4;
80	uint64_t r5;	84	uint64_t r5;
81	uint64_t r6;	85	uint64_t r6;
82	uint64_t r7;	86	uint64_t r7;
83	uint64_t sp; /* r12 */	87	uint64_t sp; /* r12 */
84	uint64_t tp; /* r13 */	88	uint64_t tp; /* r13 */
85		89
86	/*	90	/*
87	* Branch registers	91	* Branch registers
88	*/	92	*/
89	uint64_t pc; /* b0 */	93	uint64_t pc; /* b0 */
90	uint64_t b1;	94	uint64_t b1;
91	uint64_t b2;	95	uint64_t b2;
92	uint64_t b3;	96	uint64_t b3;
93	uint64_t b4;	97	uint64_t b4;
94	uint64_t b5;	98	uint64_t b5;
95		99
96	/*	100	/*
97	* Predicate registers	101	* Predicate registers
98	*/	102	*/
99	uint64_t pr;	103	uint64_t pr;
100	} context_t;	104	} context_t;
101		105
102	#endif	106	#endif
103		107

Subversion Repositories HelenOS-historic

(root)/uspace/trunk/libc/arch/ia64/include/psthread.h – Rev 1125 → 1155