source: mainline/uspace/lib/libc/arch/ia64/include/fibril.h@ 8c20b26

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 8c20b26 was bc1f1c2, checked in by Jakub Jermar <jakub@…>, 18 years ago

Goodbye pseudo threads, welcome fibrils.
The renaming might still be incomplete.

  • Property mode set to 100644
File size: 3.4 KB
Line 
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/** @addtogroup libcia64
30 * @{
31 */
32/** @file
33 */
34
35#ifndef LIBC_ia64_FIBRIL_H_
36#define LIBC_ia64_FIBRIL_H_
37
38#include <types.h>
39#include <align.h>
40#include <libarch/stack.h>
41#include <libarch/types.h>
42
43/*
44 * context_save() and context_restore() are both leaf procedures.
45 * No need to allocate scratch area.
46 */
47#define SP_DELTA (0 + ALIGN_UP(STACK_ITEM_SIZE, STACK_ALIGNMENT))
48
49#define PFM_MASK (~0x3fffffffff)
50
51#define PSTHREAD_INITIAL_STACK_PAGES_NO 2
52/* Stack is divided into two equal parts (for memory stack and register stack). */
53#define PSTHREAD_INITIAL_STACK_DIVISION 2
54
55#ifdef context_set
56#undef context_set
57#endif
58
59#define context_set(c, _pc, stack, size, tls) \
60 do { \
61 (c)->pc = (uint64_t) _pc; \
62 (c)->bsp = ((uint64_t) stack) + size / PSTHREAD_INITIAL_STACK_DIVISION; \
63 (c)->ar_pfs &= PFM_MASK; \
64 (c)->sp = ((uint64_t) stack) + ALIGN_UP((size / PSTHREAD_INITIAL_STACK_DIVISION), STACK_ALIGNMENT) - SP_DELTA; \
65 (c)->tp = (uint64_t) tls; \
66 } while (0);
67
68
69/*
70 * Only save registers that must be preserved across
71 * function calls.
72 */
73typedef struct context {
74
75 /*
76 * Application registers
77 */
78 uint64_t ar_pfs;
79 uint64_t ar_unat_caller;
80 uint64_t ar_unat_callee;
81 uint64_t ar_rsc;
82 uint64_t bsp; /* ar_bsp */
83 uint64_t ar_rnat;
84 uint64_t ar_lc;
85
86 /*
87 * General registers
88 */
89 uint64_t r1;
90 uint64_t r4;
91 uint64_t r5;
92 uint64_t r6;
93 uint64_t r7;
94 uint64_t sp; /* r12 */
95 uint64_t tp; /* r13 */
96
97 /*
98 * Branch registers
99 */
100 uint64_t pc; /* b0 */
101 uint64_t b1;
102 uint64_t b2;
103 uint64_t b3;
104 uint64_t b4;
105 uint64_t b5;
106
107 /*
108 * Predicate registers
109 */
110 uint64_t pr;
111
112 __r128 f2 __attribute__ ((aligned(16)));
113 __r128 f3;
114 __r128 f4;
115 __r128 f5;
116
117 __r128 f16;
118 __r128 f17;
119 __r128 f18;
120 __r128 f19;
121 __r128 f20;
122 __r128 f21;
123 __r128 f22;
124 __r128 f23;
125 __r128 f24;
126 __r128 f25;
127 __r128 f26;
128 __r128 f27;
129 __r128 f28;
130 __r128 f29;
131 __r128 f30;
132 __r128 f31;
133
134} context_t;
135
136#endif
137
138/** @}
139 */
Note: See TracBrowser for help on using the repository browser.