Rev 1155 | Go to most recent revision | Details | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
1125 | jermar | 1 | /* |
2 | * Copyright (C) 2005 Jakub Jermar |
||
3 | * All rights reserved. |
||
4 | * |
||
5 | * Redistribution and use in source and binary forms, with or without |
||
6 | * modification, are permitted provided that the following conditions |
||
7 | * are met: |
||
8 | * |
||
9 | * - Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * - Redistributions in binary form must reproduce the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer in the |
||
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 |
||
15 | * derived from this software without specific prior written permission. |
||
16 | * |
||
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 |
||
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
||
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
||
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
||
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 |
||
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 |
||
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
27 | */ |
||
28 | |||
29 | #ifndef __LIBC__ia64PSTHREAD_H__ |
||
30 | #define __LIBC__ia64PSTHREAD_H__ |
||
31 | |||
32 | #include <types.h> |
||
33 | #include <align.h> |
||
34 | #include <libarch/stack.h> |
||
35 | |||
36 | /* |
||
37 | * context_save() and context_restore() are both leaf procedures. |
||
38 | * No need to allocate scratch area. |
||
39 | */ |
||
40 | #define SP_DELTA (0+ALIGN_UP(STACK_ITEM_SIZE, STACK_ALIGNMENT)) |
||
41 | |||
42 | #define PFM_MASK (~0x3fffffffff) |
||
43 | |||
44 | #ifdef context_set |
||
45 | #undef context_set |
||
46 | #endif |
||
47 | |||
48 | #define context_set(c, _pc, stack, size, tls) \ |
||
49 | do { \ |
||
50 | (c)->pc = (uint64_t) _pc; \ |
||
51 | (c)->bsp = (uint64_t) stack; \ |
||
52 | (c)->ar_pfs &= PFM_MASK; \ |
||
53 | (c)->sp = ((uint64_t) stack) + ALIGN_UP((size), STACK_ALIGNMENT) - SP_DELTA; \ |
||
54 | (c)->tp = (uint64_t) tls; \ |
||
55 | } while (0); |
||
56 | |||
57 | |||
58 | /* |
||
59 | * Only save registers that must be preserved across |
||
60 | * function calls. |
||
61 | */ |
||
62 | typedef struct context { |
||
63 | |||
64 | /* |
||
65 | * Application registers |
||
66 | */ |
||
67 | uint64_t ar_pfs; |
||
68 | uint64_t ar_unat_caller; |
||
69 | uint64_t ar_unat_callee; |
||
70 | uint64_t ar_rsc; |
||
71 | uint64_t bsp; /* ar_bsp */ |
||
72 | uint64_t ar_rnat; |
||
73 | uint64_t ar_lc; |
||
74 | |||
75 | /* |
||
76 | * General registers |
||
77 | */ |
||
78 | uint64_t r1; |
||
79 | uint64_t r4; |
||
80 | uint64_t r5; |
||
81 | uint64_t r6; |
||
82 | uint64_t r7; |
||
83 | uint64_t sp; /* r12 */ |
||
84 | uint64_t tp; /* r13 */ |
||
85 | |||
86 | /* |
||
87 | * Branch registers |
||
88 | */ |
||
89 | uint64_t pc; /* b0 */ |
||
90 | uint64_t b1; |
||
91 | uint64_t b2; |
||
92 | uint64_t b3; |
||
93 | uint64_t b4; |
||
94 | uint64_t b5; |
||
95 | |||
96 | /* |
||
97 | * Predicate registers |
||
98 | */ |
||
99 | uint64_t pr; |
||
100 | } context_t; |
||
101 | |||
102 | #endif |