forked from rubinius/rubinius
-
Notifications
You must be signed in to change notification settings - Fork 0
/
event.cpp
393 lines (317 loc) · 9.72 KB
/
event.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
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
/* A C++ wrapper around libev, which Rubinius uses for all event handling.
* This is the folcrum of the thread subsystem. */
#include <sstream>
#include <vector>
#include <sys/types.h>
#include <sys/stat.h>
#include <sys/time.h>
#include <sys/wait.h>
#include <fcntl.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <errno.h>
#include <ev.h>
#include "vm.hpp"
#include "objectmemory.hpp"
#include "vm/object_utils.hpp"
#include "builtin/tuple.hpp"
#include "builtin/integer.hpp"
#include "builtin/fixnum.hpp"
#include "builtin/io.hpp"
#include "builtin/thread.hpp"
#include "event.hpp"
namespace rubinius {
namespace event {
static void dispatch(Event *obj) {
if(obj->activated()) {
if(obj->loop) {
obj->loop->remove_event(obj);
}
if(obj->tracked()) {
delete obj;
} else {
obj->stop();
}
}
}
template <typename S>
void tramp(EV_P_ S* ev, int revents) {
event::dispatch((Event*)ev->data);
}
Event::Event(STATE, ObjectCallback* chan) :
state(state), channel(chan), id(0),
buffer(state), loop(NULL) { }
void IO::stop() {
ev_io_stop(loop->base, &ev);
}
void IO::start() {
ev_io_start(loop->base, &ev);
}
bool IO::for_fd_p(int in) {
if(fd == in) return true;
return false;
}
Write::Write(STATE, ObjectCallback* chan, int ifd) : IO(state, chan) {
fd = ifd;
ev_io_init(&ev, event::tramp<struct ev_io>, fd, EV_WRITE);
ev.data = this;
}
bool Write::activated() {
channel->call(Integer::from(state, fd));
return true;
}
Read::Read(STATE, ObjectCallback* chan, int ifd) :
IO(state, chan), count(0) {
fd = ifd;
ev_io_init(&ev, event::tramp<struct ev_io>, fd, EV_READ);
ev.data = this;
}
void Read::into_buffer(Object* maybe_buffer, std::size_t bytes) {
count = bytes;
buffer.set(maybe_buffer);
}
bool Read::activated() {
Object* ret;
if(buffer->nil_p()) {
ret = Integer::from(state, fd);
} else {
/* the + 1 is for the null on the end */
size_t bytes_to_read = count + 1;
if(buffer->left() < bytes_to_read) {
bytes_to_read = buffer->left() - 1;
}
char* start = buffer->at_unused();
while(1) {
int i = read(fd, start, bytes_to_read);
/* EOF seen */
if(i == 0) {
ret = Qnil;
/* didn't work out... */
} else if(i == -1) {
/* we were interrupted, how rude. go again. */
if(errno == EINTR) continue;
/* not sure. Send a system error */
ret = Tuple::from(state, 2, state->symbol("error"), Fixnum::from(errno));
} else {
/* clamp */
start[i] = 0;
buffer->read_bytes(state, i);
ret = Fixnum::from(i);
}
break;
}
}
channel->call(ret);
return true;
}
Signal::Signal(STATE, ObjectCallback *chan, int sig):
Event(state, chan), signal(sig) {
ev_signal_init(&ev, event::tramp<struct ev_signal>, sig);
ev.data = this;
}
void Signal::start() {
/* Only one event of a given signal type per loop. */
loop->remove_signal(signal);
ev_signal_start(loop->base, &ev);
}
void Signal::stop() {
ev_signal_stop(loop->base, &ev);
}
bool Signal::activated() {
channel->call(state->current_thread());
return false;
}
Timer::Timer(STATE, ObjectCallback* chan, double seconds, Object* obj):
Event(state, chan), tag(obj), timer_(NULL)
{
timer_ = new struct ev_timer;
ev_timer_init(timer_, event::tramp<ev_timer>, (ev_tstamp)seconds, 0.);
timer_->data = this;
}
void Timer::start() {
ev_timer_start(loop->base, timer_);
}
void Timer::stop() {
ev_timer_stop(loop->base, timer_);
delete timer_;
}
bool Timer::activated() {
channel->call(tag);
return true;
}
/* SIGCHLD */
Child::Child(ObjectCallback* channel, pid_t pid, int opts):
channel_(channel), options_(opts), pid_(pid) {
}
Child::~Child() {}
void Child::add(STATE, ObjectCallback* channel, pid_t pid, int opts) {
Child::waiters().push_back(new Child(channel, pid, opts));
/* This seems a bit cheap, but we need to force a check to
* catch the case where wait is called before any child is
* created, because such an occurrence must result in ECHILD.
*
* Non-hanging force a check too, so that they do not
* need to wait until the next signal arrives.
*/
if((opts & WNOHANG) || Child::waiters().size() == 1) {
Child::find_finished(state);
}
}
/**
* The idea here is that this method is called each time we receive
* a SIGCHLD. Since we do not know which child exited, we check each
* using waitpid(). The WNOHANG means that if the child is still up,
* we can just move on to the next candidate and come back to check
* later.
*
* To avoid a problem with calling wait before any children exist
* not raising an error, ::add() explicitly runs this method when
* the first waiter is added (whether at the start or at some point
* when all waiters have been removed previously.)
*
* @todo Support WUNTRACED and other options?
*/
void Child::find_finished(VM* state) {
Waiters& all = Child::waiters();
for(Waiters::iterator it = all.begin(); it != all.end(); /* Updated in body */) {
int status = 0;
Child* waiter = *it;
pid_t pid = ::waitpid(waiter->pid(), &status, WNOHANG);
switch(pid) {
case -1:
if(errno == EINTR) {
continue; /* With the same iterator */
}
if(errno == ECHILD) {
waiter->channel()->call(Qfalse);
it = all.erase(it);
continue;
}
break;
case 0: /* No stopped children. */
if(waiter->options() & WNOHANG) {
waiter->channel()->call(Qnil);
it = all.erase(it);
continue;
}
/* Only blocking waits remain */
++it;
break;
default: /* Found it */
Object* SP = Qtrue;
if(WIFEXITED(status)) {
SP = as<Object>(Fixnum::from(WEXITSTATUS(status)));
}
waiter->channel()->call(Tuple::from(state, 2, Fixnum::from(pid), SP));
it = all.erase(it);
continue;
}
} /* for */
}
/** @todo Fix the options. --rue */
Loop::Loop(struct ev_loop *loop) :
base(loop), event_ids(0), options_(0), owner(false) { }
Loop::Loop(int opts) : event_ids(0), options_(opts), owner(false) {
base = ev_default_loop(options_);
/* @todo Should fail here if default returns NULL */
}
/* Gives this loop ownership of +ev+, letting it delete +ev+
* when +ev+ is done, then starts the event. */
void Loop::start(Event* ev) {
ev->loop = this;
ev->id = ++event_ids;
ev->start();
// It's important this is last. Signal::start removes older Signal
// events by looking through +events+ on start. We don't want it
// to remove itself, so we do this after the event has actually
// started.
events.push_back(ev);
}
/** @todo Figure out what to do with default vs. regular loops. --rue */
Loop::~Loop() {
if(owner) {
std::vector<Event*>::iterator it;
for(it = events.begin(); it != events.end(); it = events.erase(it)) {
delete *it;
}
if(base != ev_default_loop(0)) {
ev_loop_destroy(base);
}
}
}
size_t Loop::num_of_events() {
return events.size();
}
size_t Loop::loop_count() {
return (size_t)ev_loop_count(base);
}
void Loop::poll() {
ev_loop(base, EVLOOP_NONBLOCK);
}
void Loop::run_and_wait() {
ev_loop(base, EVLOOP_ONESHOT);
}
void Loop::clear_by_fd(int fd) {
std::vector<Event*>::iterator it;
for(it = events.begin(); it != events.end();) {
if((*it)->for_fd_p(fd)) {
delete *it;
it = events.erase(it);
} else {
it++;
}
}
}
void Loop::clear_by_channel(void* chan) {
std::vector<Event*>::iterator it;
for(it = events.begin(); it != events.end();) {
if((*it)->channel == chan) {
delete *it;
it = events.erase(it);
} else {
it++;
}
}
}
void Loop::clear_by_id(size_t id) {
std::vector<Event*>::iterator it;
for(it = events.begin(); it != events.end();) {
if((*it)->id == id) {
delete *it;
it = events.erase(it);
} else {
it++;
}
}
}
void Loop::remove_event(Event *ev) {
std::vector<Event*>::iterator it;
for(it = events.begin(); it != events.end();) {
if(*it == ev) {
it = events.erase(it);
} else {
it++;
}
}
}
// Look through events for a Signal object for +signal_number+
// If we find one, send nil to the channel and remove it.
void Loop::remove_signal(int signal_number) {
for(std::vector<Event*>::iterator it = events.begin();
it != events.end();) {
Event* ev = *it;
if(Signal* sig = dynamic_cast<Signal*>(ev)) {
if(sig->signal == signal_number) {
sig->channel->call(Qnil);
sig->stop();
it = events.erase(it);
continue;
}
}
it++;
}
}
} // event
} // rubinius