forked from rubinius/rubinius
-
Notifications
You must be signed in to change notification settings - Fork 0
/
fiber_data.cpp
229 lines (175 loc) · 5.45 KB
/
fiber_data.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
#include <string.h>
#include "vm/vm.hpp"
#include "vm/fiber_data.hpp"
#include "builtin/fiber.hpp"
namespace rubinius {
#ifdef RBX_FIBER_ENABLED
#if defined(FIBER_ASM_X8664)
static void fiber_wrap_main(void) {
__asm__ __volatile__ ("\tmovq %r13, %rdi\n\tjmpq *%r12\n");
}
static inline void fiber_switch(fiber_context_t* from, fiber_context_t* to) {
__asm__ __volatile__ (
"leaq 1f(%%rip), %%rax\n\t"
"movq %%rax, (%0)\n\t"
"movq %%rsp, 8(%0)\n\t"
"movq %%rbp, 16(%0)\n\t"
"movq %%rbx, 24(%0)\n\t"
"movq %%r12, 32(%0)\n\t"
"movq %%r13, 40(%0)\n\t"
"movq %%r14, 48(%0)\n\t"
"movq %%r15, 56(%0)\n\t"
"movq 56(%1), %%r15\n\t"
"movq 48(%1), %%r14\n\t"
"movq 40(%1), %%r13\n\t"
"movq 32(%1), %%r12\n\t"
"movq 24(%1), %%rbx\n\t"
"movq 16(%1), %%rbp\n\t"
"movq 8(%1), %%rsp\n\t"
"jmpq *(%1)\n" "1:\n"
: "+S" (from), "+D" (to) :
: "rax", "rcx", "rdx", "r8", "r9", "r10", "r11", "memory", "cc");
}
static void fiber_makectx(fiber_context_t* ctx, void* func, void** stack_bottom,
int stack_size)
{
// Get a pointer to the highest address as stack that is properly aligned
// with room for the fake return value.
uintptr_t s = ((uintptr_t)stack_bottom) + stack_size;
uintptr_t diff = s % 16;
void** stack = (void**)(s - diff) - 1;
*--stack = (void*)0xdeadcafedeadcafe; /* Dummy return address. */
ctx->rip = (void*)fiber_wrap_main;
ctx->rsp = stack;
ctx->rbp = 0;
ctx->rbx = 0;
ctx->r12 = func;
ctx->r13 = 0;
ctx->r14 = 0;
ctx->r15 = 0;
}
#elif defined(FIBER_ASM_X8632)
static inline void fiber_switch(fiber_context_t* from, fiber_context_t* to) {
__asm__ __volatile__ (
"call 1f\n" "1:\tpopl %%eax\n\t" "addl $(2f-1b),%%eax\n\t"
"movl %%eax, (%0)\n\t" "movl %%esp, 4(%0)\n\t"
"movl %%ebp, 8(%0)\n\t" "movl %%ebx, 12(%0)\n\t"
"movl 12(%1), %%ebx\n\t" "movl 8(%1), %%ebp\n\t"
"movl 4(%1), %%esp\n\t" "jmp *(%1)\n" "2:\n"
: "+S" (from), "+D" (to) : : "eax", "ecx", "edx", "memory", "cc");
}
static void fiber_makectx(fiber_context_t* ctx, void* func, void** stack_bottom,
int stack_size)
{
// Get a pointer to the highest address as stack that is properly aligned
// with room for the fake return value.
uintptr_t s = ((uintptr_t)stack_bottom) + stack_size;
uintptr_t diff = s % 16;
void** stack = (void**)(s - diff) - 1;
*--stack = (void*)0xdeadcafe;
ctx->eip = func;
ctx->esp = stack;
ctx->ebp = 0;
}
#endif
#else
static inline void fiber_switch(fiber_context_t* from, fiber_context_t* to) {
rubinius::bug("Fibers not supported on this platform");
}
static void fiber_makectx(fiber_context_t* ctx, void* func, void** stack_bottom,
int stack_size)
{
rubinius::bug("Fibers not supported on this platform");
}
#endif
}
namespace rubinius {
FiberData::~FiberData() {
if(heap_) free(heap_);
if(!thread_) return;
thread_->remove_fiber_data(this);
}
void FiberData::take_stack(STATE) {
assert(status_ != eDead);
if(status_ == eOnStack || status_ == eRunning) return;
assert(stack_);
if(stack_->shared_p()) stack_->flush(state);
stack_->set_user(this);
if(status_ == eOnHeap) {
memcpy(stack_bottom(), heap_, heap_size_);
}
status_ = eOnStack;
}
void FiberData::copy_to_heap(STATE) {
assert(status_ != eDead);
assert(stack_);
heap_size_ = (uintptr_t)stack_->top_address() - (uintptr_t)stack_bottom();
if(heap_capacity_ < heap_size_) {
// Round to nearest 1k
heap_capacity_ = (heap_size_ + 1023) & ~1023;
if(heap_) free(heap_);
heap_ = malloc(heap_capacity_);
}
memcpy(heap_, stack_bottom(), heap_size_);
status_ = eOnHeap;
}
FiberStack* FiberData::allocate_stack(STATE) {
assert(!stack_);
stack_ = state->vm()->allocate_fiber_stack();
return stack_;
}
void FiberData::orphan(STATE) {
status_ = eDead;
call_frame_ = 0;
if(!stack_) return;
stack_->orphan(state, this);
stack_ = 0;
}
static void save_and_switch() {
VM* vm = VM::current();
State state(vm);
Fiber* fib = Fiber::current(&state);
fib->data()->take_stack(&state);
fiber_context_t tmp;
fiber_switch(&tmp, fib->ucontext());
}
void FiberData::switch_to(STATE, FiberData* from) {
if(uninitialized_p()) {
FiberStack* stack = allocate_stack(state);
fiber_makectx(machine(), (void*)Fiber::start_on_stack,
(void**)stack->address(),
stack->size());
}
if(currently_on_stack_p(from)) {
fiber_context_t dest;
fiber_makectx(&dest, (void*)save_and_switch,
(void**)state->vm()->fiber_trampoline(),
FiberStacks::cTrampolineSize);
fiber_switch(from->machine(), &dest);
} else {
take_stack(state);
fiber_switch(from->machine(), machine());
}
}
void FiberData::switch_and_orphan(STATE, FiberData* from) {
fiber_context_t dummy;
if(currently_on_stack_p(from)) {
from->orphan(state);
fiber_context_t dest;
fiber_makectx(&dest, (void*)save_and_switch,
(void**)state->vm()->fiber_trampoline(),
FiberStacks::cTrampolineSize);
fiber_switch(&dummy, &dest);
} else {
from->orphan(state);
take_stack(state);
fiber_switch(&dummy, machine());
}
}
void FiberData::die() {
status_ = eDead;
call_frame_ = 0;
thread_ = 0;
stack_ = 0;
}
}