-
Notifications
You must be signed in to change notification settings - Fork 610
/
fiber_stack.cpp
162 lines (131 loc) · 3.43 KB
/
fiber_stack.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
#include "vm.hpp"
#include "fiber_stack.hpp"
#include "fiber_data.hpp"
#include "configuration.hpp"
#include "bug.hpp"
#include "gc/gc.hpp"
#include <stdlib.h>
#ifdef HAVE_VALGRIND_H
#include <valgrind/valgrind.h>
#endif
namespace rubinius {
FiberStack::FiberStack(size_t size)
: address_(0)
, size_(size)
, refs_(0)
, user_(0)
#ifdef HAVE_VALGRIND_H
, valgrind_id_(0)
#endif
{}
void FiberStack::allocate() {
assert(!address_);
address_ = malloc(size_);
#ifdef HAVE_VALGRIND_H
valgrind_id_ = VALGRIND_STACK_REGISTER(address_, (char *)address_ + size_);
#endif
}
void FiberStack::free() {
if(!address_) return;
#ifdef HAVE_VALGRIND_H
VALGRIND_STACK_DEREGISTER(valgrind_id_);
#endif
::free(address_);
address_ = 0;
}
void FiberStack::flush(STATE) {
if(!user_) return;
// TODO assumes higher to lower stack growth.
user_->copy_to_heap(state);
}
void FiberStack::orphan(STATE, FiberData* user) {
if(user == user_) {
user_ = 0;
}
dec_ref();
}
FiberStacks::FiberStacks(VM* thread, SharedState& shared)
: max_stacks_(shared.config.fiber_stacks)
, stack_size_(shared.config.fiber_stack_size)
, thread_(thread)
, trampoline_(0)
{
lock_.init();
}
FiberStacks::~FiberStacks() {
for(Datas::iterator i = datas_.begin(); i != datas_.end(); ++i) {
(*i)->die();
}
for(Stacks::iterator i = stacks_.begin(); i != stacks_.end(); ++i) {
i->free();
}
}
void FiberStacks::gc_scan(GarbageCollector* gc, bool marked_only) {
for(Datas::iterator i = datas_.begin(); i != datas_.end(); ++i) {
FiberData* data = *i;
if(data->dead_p()) continue;
if(marked_only && !data->marked_p()) {
data->status_ = FiberData::eDead;
continue;
}
AddressDisplacement dis(data->data_offset(),
data->data_lower_bound(),
data->data_upper_bound());
if(CallFrame* cf = data->call_frame()) {
gc->walk_call_frame(cf, &dis);
}
gc->scan(data->variable_root_buffers(), false, &dis);
}
}
FiberData* FiberStacks::new_data(bool root) {
utilities::thread::SpinLock::LockGuard guard(lock_);
FiberData* data = new FiberData(thread_, root);
datas_.insert(data);
return data;
}
void FiberStacks::remove_data(FiberData* data) {
utilities::thread::SpinLock::LockGuard guard(lock_);
datas_.erase(data);
}
FiberStack* FiberStacks::allocate() {
for(Stacks::iterator i = stacks_.begin();
i != stacks_.end();
++i)
{
if(i->unused_p()) {
i->inc_ref();
return &*i;
}
}
FiberStack* stack = 0;
if(stacks_.size() < max_stacks_) {
stacks_.push_back(FiberStack(stack_size_));
stack = &stacks_.back();
stack->allocate();
} else {
for(Stacks::iterator i = stacks_.begin();
i != stacks_.end();
++i)
{
if(!stack || i->refs() < stack->refs()) {
stack = &*i;
}
}
assert(stack);
}
stack->inc_ref();
return stack;
}
void* FiberStacks::trampoline() {
if(trampoline_ == 0) {
trampoline_ = malloc(cTrampolineSize);
}
return trampoline_;
}
void FiberStacks::gc_clear_mark() {
utilities::thread::SpinLock::LockGuard guard(lock_);
for(Datas::iterator i = datas_.begin(); i != datas_.end(); ++i) {
(*i)->clear_mark();
}
}
}