ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/Coro/Coro/State.xs
(Generate patch)

Comparing Coro/Coro/State.xs (file contents):
Revision 1.26 by root, Fri Aug 17 01:45:39 2001 UTC vs.
Revision 1.146 by root, Sat Mar 17 19:51:57 2007 UTC

1#include "libcoro/coro.c"
2
3#define PERL_NO_GET_CONTEXT
4
1#include "EXTERN.h" 5#include "EXTERN.h"
2#include "perl.h" 6#include "perl.h"
3#include "XSUB.h" 7#include "XSUB.h"
4 8
5#include "libcoro/coro.c" 9#include "patchlevel.h"
6 10
7#include <signal.h> 11#include <stdio.h>
12#include <errno.h>
13#include <assert.h>
8 14
9#ifdef HAVE_MMAP 15#ifdef HAVE_MMAP
10# include <unistd.h> 16# include <unistd.h>
11# include <sys/mman.h> 17# include <sys/mman.h>
12# ifndef MAP_ANON
13# ifdef MAP_ANONYMOUS 18# ifndef MAP_ANONYMOUS
14# define MAP_ANON MAP_ANONYMOUS 19# ifdef MAP_ANON
20# define MAP_ANONYMOUS MAP_ANON
15# else 21# else
16# undef HAVE_MMAP 22# undef HAVE_MMAP
17# endif 23# endif
18# endif 24# endif
25# include <limits.h>
26# ifndef PAGESIZE
27# define PAGESIZE pagesize
28# define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE)
29static long pagesize;
30# else
31# define BOOT_PAGESIZE (void)0
19#endif 32# endif
33#else
34# define PAGESIZE 0
35# define BOOT_PAGESIZE (void)0
36#endif
20 37
21#define MAY_FLUSH /* increases codesize */ 38#if CORO_USE_VALGRIND
39# include <valgrind/valgrind.h>
40# define REGISTER_STACK(cctx,start,end) (cctx)->valgrind_id = VALGRIND_STACK_REGISTER ((start), (end))
41#else
42# define REGISTER_STACK(cctx,start,end)
43#endif
22 44
23#define SUB_INIT "Coro::State::initialize" 45/* the maximum number of idle cctx that will be pooled */
24#define UCORO_STATE "_coro_state" 46#define MAX_IDLE_CCTX 8
25 47
48#define PERL_VERSION_ATLEAST(a,b,c) \
49 (PERL_REVISION > (a) \
50 || (PERL_REVISION == (a) \
51 && (PERL_VERSION > (b) \
52 || (PERL_VERSION == (b) && PERLSUBVERSION >= (c)))))
53
54#if !PERL_VERSION_ATLEAST (5,6,0)
55# ifndef PL_ppaddr
56# define PL_ppaddr ppaddr
57# endif
58# ifndef call_sv
59# define call_sv perl_call_sv
60# endif
61# ifndef get_sv
62# define get_sv perl_get_sv
63# endif
64# ifndef get_cv
65# define get_cv perl_get_cv
66# endif
67# ifndef IS_PADGV
68# define IS_PADGV(v) 0
69# endif
70# ifndef IS_PADCONST
71# define IS_PADCONST(v) 0
72# endif
73#endif
74
75/* 5.8.7 */
76#ifndef SvRV_set
77# define SvRV_set(s,v) SvRV(s) = (v)
78#endif
79
80#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64
81# undef CORO_STACKGUARD
82#endif
83
84#ifndef CORO_STACKGUARD
85# define CORO_STACKGUARD 0
86#endif
87
88/* prefer perl internal functions over our own? */
89#ifndef CORO_PREFER_PERL_FUNCTIONS
90# define CORO_PREFER_PERL_FUNCTIONS 0
91#endif
92
26/* The next macro should delcare a variable stacklevel that contains and approximation 93/* The next macro should declare a variable stacklevel that contains and approximation
27 * to the current C stack pointer. Its property is that it changes with each call 94 * to the current C stack pointer. Its property is that it changes with each call
28 * and should be unique. */ 95 * and should be unique. */
96#define dSTACKLEVEL int stacklevel
29#define dSTACKLEVEL void *stacklevel = &stacklevel 97#define STACKLEVEL ((void *)&stacklevel)
30 98
31#define labs(l) ((l) >= 0 ? (l) : -(l)) 99#define IN_DESTRUCT (PL_main_cv == Nullcv)
100
101#if __GNUC__ >= 3
102# define attribute(x) __attribute__(x)
103# define BARRIER __asm__ __volatile__ ("" : : : "memory")
104#else
105# define attribute(x)
106# define BARRIER
107#endif
108
109#define NOINLINE attribute ((noinline))
32 110
33#include "CoroAPI.h" 111#include "CoroAPI.h"
34 112
113#ifdef USE_ITHREADS
114static perl_mutex coro_mutex;
115# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0)
116# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0)
117#else
118# define LOCK (void)0
119# define UNLOCK (void)0
120#endif
121
122/* helper storage struct for Coro::AIO */
123struct io_state
124{
125 int errorno;
126 I32 laststype;
127 int laststatval;
128 Stat_t statcache;
129};
130
131static size_t coro_stacksize = CORO_STACKSIZE;
35static struct CoroAPI coroapi; 132static struct CoroAPI coroapi;
133static AV *main_mainstack; /* used to differentiate between $main and others */
134static HV *coro_state_stash, *coro_stash;
135static SV *coro_mortal; /* will be freed after next transfer */
36 136
37/* this is actually not only the c stack but also c registers etc... */ 137static struct coro_cctx *cctx_first;
138static int cctx_count, cctx_idle;
139
140/* this is a structure representing a c-level coroutine */
38typedef struct { 141typedef struct coro_cctx {
39 int refcnt; /* pointer reference counter */ 142 struct coro_cctx *next;
40 int usecnt; /* shared by how many coroutines */
41 int gencnt; /* generation counter */
42 143
144 /* the stack */
145 void *sptr;
146 size_t ssize;
147
148 /* cpu state */
149 void *idle_sp; /* sp of top-level transfer/schedule/cede call */
150 JMPENV *idle_te; /* same as idle_sp, but for top_env, TODO: remove once stable */
151 JMPENV *top_env;
43 coro_context cctx; 152 coro_context cctx;
44 153
45 void *sptr; 154#if CORO_USE_VALGRIND
46 long ssize; /* positive == mmap, otherwise malloc */ 155 int valgrind_id;
47} coro_stack; 156#endif
157 char inuse, mapped;
158} coro_cctx;
48 159
160enum {
161 CF_RUNNING = 0x0001, /* coroutine is running */
162 CF_READY = 0x0002, /* coroutine is ready */
163 CF_NEW = 0x0004, /* has never been switched to */
164 CF_DESTROYED = 0x0008, /* coroutine data has been freed */
165};
166
167/* this is a structure representing a perl-level coroutine */
49struct coro { 168struct coro {
50 /* the optional C context */ 169 /* the c coroutine allocated to this perl coroutine, if any */
51 coro_stack *stack; 170 coro_cctx *cctx;
52 void *cursp;
53 int gencnt;
54
55 /* optionally saved, might be zero */
56 AV *defav;
57 SV *defsv;
58 SV *errsv;
59
60 /* saved global state not related to stacks */
61 U8 dowarn;
62 I32 in_eval;
63
64 /* the stacks and related info (callchain etc..) */
65 PERL_SI *curstackinfo;
66 AV *curstack;
67 AV *mainstack;
68 SV **stack_sp;
69 OP *op;
70 SV **curpad;
71 SV **stack_base;
72 SV **stack_max;
73 SV **tmps_stack;
74 I32 tmps_floor;
75 I32 tmps_ix;
76 I32 tmps_max;
77 I32 *markstack;
78 I32 *markstack_ptr;
79 I32 *markstack_max;
80 I32 *scopestack;
81 I32 scopestack_ix;
82 I32 scopestack_max;
83 ANY *savestack;
84 I32 savestack_ix;
85 I32 savestack_max;
86 OP **retstack;
87 I32 retstack_ix;
88 I32 retstack_max;
89 COP *curcop;
90 JMPENV *top_env;
91 171
92 /* data associated with this coroutine (initial args) */ 172 /* data associated with this coroutine (initial args) */
93 AV *args; 173 AV *args;
174 int refcnt;
175 int save; /* CORO_SAVE flags */
176 int flags; /* CF_ flags */
177
178 /* optionally saved, might be zero */
179 AV *defav; /* @_ */
180 SV *defsv; /* $_ */
181 SV *errsv; /* $@ */
182 SV *irssv; /* $/ */
183 SV *irssv_sv; /* real $/ cache */
184
185#define VAR(name,type) type name;
186# include "state.h"
187#undef VAR
188
189 /* coro process data */
190 int prio;
94}; 191};
95 192
96typedef struct coro *Coro__State; 193typedef struct coro *Coro__State;
97typedef struct coro *Coro__State_or_hashref; 194typedef struct coro *Coro__State_or_hashref;
98
99static AV *main_mainstack; /* used to differentiate between $main and others */
100static HV *coro_state_stash;
101static SV *ucoro_state_sv;
102static U32 ucoro_state_hash;
103static HV *padlist_cache;
104
105/* mostly copied from op.c:cv_clone2 */
106STATIC AV *
107clone_padlist (AV *protopadlist)
108{
109 AV *av;
110 I32 ix;
111 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
112 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
113 SV **pname = AvARRAY (protopad_name);
114 SV **ppad = AvARRAY (protopad);
115 I32 fname = AvFILLp (protopad_name);
116 I32 fpad = AvFILLp (protopad);
117 AV *newpadlist, *newpad_name, *newpad;
118 SV **npad;
119
120 newpad_name = newAV ();
121 for (ix = fname; ix >= 0; ix--)
122 av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
123
124 newpad = newAV ();
125 av_fill (newpad, AvFILLp (protopad));
126 npad = AvARRAY (newpad);
127
128 newpadlist = newAV ();
129 AvREAL_off (newpadlist);
130 av_store (newpadlist, 0, (SV *) newpad_name);
131 av_store (newpadlist, 1, (SV *) newpad);
132
133 av = newAV (); /* will be @_ */
134 av_extend (av, 0);
135 av_store (newpad, 0, (SV *) av);
136 AvFLAGS (av) = AVf_REIFY;
137
138 for (ix = fpad; ix > 0; ix--)
139 {
140 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;
141 if (namesv && namesv != &PL_sv_undef)
142 {
143 char *name = SvPVX (namesv); /* XXX */
144 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&')
145 { /* lexical from outside? */
146 npad[ix] = SvREFCNT_inc (ppad[ix]);
147 }
148 else
149 { /* our own lexical */
150 SV *sv;
151 if (*name == '&')
152 sv = SvREFCNT_inc (ppad[ix]);
153 else if (*name == '@')
154 sv = (SV *) newAV ();
155 else if (*name == '%')
156 sv = (SV *) newHV ();
157 else
158 sv = NEWSV (0, 0);
159 if (!SvPADBUSY (sv))
160 SvPADMY_on (sv);
161 npad[ix] = sv;
162 }
163 }
164 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))
165 {
166 npad[ix] = SvREFCNT_inc (ppad[ix]);
167 }
168 else
169 {
170 SV *sv = NEWSV (0, 0);
171 SvPADTMP_on (sv);
172 npad[ix] = sv;
173 }
174 }
175
176#if 0 /* return -ENOTUNDERSTOOD */
177 /* Now that vars are all in place, clone nested closures. */
178
179 for (ix = fpad; ix > 0; ix--) {
180 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
181 if (namesv
182 && namesv != &PL_sv_undef
183 && !(SvFLAGS(namesv) & SVf_FAKE)
184 && *SvPVX(namesv) == '&'
185 && CvCLONE(ppad[ix]))
186 {
187 CV *kid = cv_clone((CV*)ppad[ix]);
188 SvREFCNT_dec(ppad[ix]);
189 CvCLONE_on(kid);
190 SvPADMY_on(kid);
191 npad[ix] = (SV*)kid;
192 }
193 }
194#endif
195
196 return newpadlist;
197}
198
199#ifdef MAY_FLUSH
200STATIC AV *
201free_padlist (AV *padlist)
202{
203 /* may be during global destruction */
204 if (SvREFCNT(padlist))
205 {
206 I32 i = AvFILLp(padlist);
207 while (i >= 0)
208 {
209 SV **svp = av_fetch(padlist, i--, FALSE);
210 SV *sv = svp ? *svp : Nullsv;
211 if (sv)
212 SvREFCNT_dec(sv);
213 }
214
215 SvREFCNT_dec((SV*)padlist);
216 }
217}
218#endif
219
220/* the next two functions merely cache the padlists */
221STATIC void
222get_padlist (CV *cv)
223{
224 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0);
225
226 if (he && AvFILLp ((AV *)*he) >= 0)
227 CvPADLIST (cv) = (AV *)av_pop ((AV *)*he);
228 else
229 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));
230}
231
232STATIC void
233put_padlist (CV *cv)
234{
235 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1);
236
237 if (SvTYPE (*he) != SVt_PVAV)
238 {
239 SvREFCNT_dec (*he);
240 *he = (SV *)newAV ();
241 }
242
243 av_push ((AV *)*he, (SV *)CvPADLIST (cv));
244}
245
246#ifdef MAY_FLUSH
247STATIC void
248flush_padlist_cache ()
249{
250 HV *hv = padlist_cache;
251 padlist_cache = newHV ();
252
253 if (hv_iterinit (hv))
254 {
255 HE *he;
256 AV *padlist;
257
258 while (!!(he = hv_iternext (hv)))
259 {
260 AV *av = (AV *)HeVAL(he);
261
262 /* casting is fun. */
263 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
264 free_padlist (padlist);
265 }
266 }
267
268 SvREFCNT_dec (hv);
269}
270#endif
271
272#define SB do {
273#define SE } while (0)
274
275#define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE
276#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE
277
278#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE
279
280static void
281load_state(pTHX_ Coro__State c)
282{
283 PL_dowarn = c->dowarn;
284 PL_in_eval = c->in_eval;
285
286 PL_curstackinfo = c->curstackinfo;
287 PL_curstack = c->curstack;
288 PL_mainstack = c->mainstack;
289 PL_stack_sp = c->stack_sp;
290 PL_op = c->op;
291 PL_curpad = c->curpad;
292 PL_stack_base = c->stack_base;
293 PL_stack_max = c->stack_max;
294 PL_tmps_stack = c->tmps_stack;
295 PL_tmps_floor = c->tmps_floor;
296 PL_tmps_ix = c->tmps_ix;
297 PL_tmps_max = c->tmps_max;
298 PL_markstack = c->markstack;
299 PL_markstack_ptr = c->markstack_ptr;
300 PL_markstack_max = c->markstack_max;
301 PL_scopestack = c->scopestack;
302 PL_scopestack_ix = c->scopestack_ix;
303 PL_scopestack_max = c->scopestack_max;
304 PL_savestack = c->savestack;
305 PL_savestack_ix = c->savestack_ix;
306 PL_savestack_max = c->savestack_max;
307 PL_retstack = c->retstack;
308 PL_retstack_ix = c->retstack_ix;
309 PL_retstack_max = c->retstack_max;
310 PL_curcop = c->curcop;
311 PL_top_env = c->top_env;
312
313 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
314 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
315 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
316
317 {
318 dSP;
319 CV *cv;
320
321 /* now do the ugly restore mess */
322 while ((cv = (CV *)POPs))
323 {
324 AV *padlist = (AV *)POPs;
325
326 if (padlist)
327 {
328 put_padlist (cv); /* mark this padlist as available */
329 CvPADLIST(cv) = padlist;
330#ifdef USE_THREADS
331 /*CvOWNER(cv) = (struct perl_thread *)POPs;*/
332#endif
333 }
334
335 ++CvDEPTH(cv);
336 }
337
338 PUTBACK;
339 }
340}
341
342static void
343save_state(pTHX_ Coro__State c, int flags)
344{
345 {
346 dSP;
347 I32 cxix = cxstack_ix;
348 PERL_CONTEXT *ccstk = cxstack;
349 PERL_SI *top_si = PL_curstackinfo;
350
351 /*
352 * the worst thing you can imagine happens first - we have to save
353 * (and reinitialize) all cv's in the whole callchain :(
354 */
355
356 PUSHs (Nullsv);
357 /* this loop was inspired by pp_caller */
358 for (;;)
359 {
360 do
361 {
362 PERL_CONTEXT *cx = &ccstk[cxix--];
363
364 if (CxTYPE(cx) == CXt_SUB)
365 {
366 CV *cv = cx->blk_sub.cv;
367 if (CvDEPTH(cv))
368 {
369#ifdef USE_THREADS
370 /*XPUSHs ((SV *)CvOWNER(cv));*/
371 /*CvOWNER(cv) = 0;*/
372 /*error must unlock this cv etc.. etc...*/
373#endif
374 EXTEND (SP, CvDEPTH(cv)*2);
375
376 while (--CvDEPTH(cv))
377 {
378 /* this tells the restore code to increment CvDEPTH */
379 PUSHs (Nullsv);
380 PUSHs ((SV *)cv);
381 }
382
383 PUSHs ((SV *)CvPADLIST(cv));
384 PUSHs ((SV *)cv);
385
386 get_padlist (cv); /* this is a monster */
387 }
388 }
389 else if (CxTYPE(cx) == CXt_FORMAT)
390 {
391 /* I never used formats, so how should I know how these are implemented? */
392 /* my bold guess is as a simple, plain sub... */
393 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
394 }
395 }
396 while (cxix >= 0);
397
398 if (top_si->si_type == PERLSI_MAIN)
399 break;
400
401 top_si = top_si->si_prev;
402 ccstk = top_si->si_cxstack;
403 cxix = top_si->si_cxix;
404 }
405
406 PUTBACK;
407 }
408
409 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
410 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
411 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
412
413 /* I have not the slightest idea of why av_reify is necessary */
414 /* but if it's missing the defav contents magically get replaced sometimes */
415 if (c->defav)
416 av_reify (c->defav);
417
418 c->dowarn = PL_dowarn;
419 c->in_eval = PL_in_eval;
420
421 c->curstackinfo = PL_curstackinfo;
422 c->curstack = PL_curstack;
423 c->mainstack = PL_mainstack;
424 c->stack_sp = PL_stack_sp;
425 c->op = PL_op;
426 c->curpad = PL_curpad;
427 c->stack_base = PL_stack_base;
428 c->stack_max = PL_stack_max;
429 c->tmps_stack = PL_tmps_stack;
430 c->tmps_floor = PL_tmps_floor;
431 c->tmps_ix = PL_tmps_ix;
432 c->tmps_max = PL_tmps_max;
433 c->markstack = PL_markstack;
434 c->markstack_ptr = PL_markstack_ptr;
435 c->markstack_max = PL_markstack_max;
436 c->scopestack = PL_scopestack;
437 c->scopestack_ix = PL_scopestack_ix;
438 c->scopestack_max = PL_scopestack_max;
439 c->savestack = PL_savestack;
440 c->savestack_ix = PL_savestack_ix;
441 c->savestack_max = PL_savestack_max;
442 c->retstack = PL_retstack;
443 c->retstack_ix = PL_retstack_ix;
444 c->retstack_max = PL_retstack_max;
445 c->curcop = PL_curcop;
446 c->top_env = PL_top_env;
447}
448
449/*
450 * allocate various perl stacks. This is an exact copy
451 * of perl.c:init_stacks, except that it uses less memory
452 * on the assumption that coroutines do not usually need
453 * a lot of stackspace.
454 */
455STATIC void
456coro_init_stacks (pTHX)
457{
458 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
459 PL_curstackinfo->si_type = PERLSI_MAIN;
460 PL_curstack = PL_curstackinfo->si_stack;
461 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
462
463 PL_stack_base = AvARRAY(PL_curstack);
464 PL_stack_sp = PL_stack_base;
465 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
466
467 New(50,PL_tmps_stack,96,SV*);
468 PL_tmps_floor = -1;
469 PL_tmps_ix = -1;
470 PL_tmps_max = 96;
471
472 New(54,PL_markstack,16,I32);
473 PL_markstack_ptr = PL_markstack;
474 PL_markstack_max = PL_markstack + 16;
475
476 SET_MARK_OFFSET;
477
478 New(54,PL_scopestack,16,I32);
479 PL_scopestack_ix = 0;
480 PL_scopestack_max = 16;
481
482 New(54,PL_savestack,96,ANY);
483 PL_savestack_ix = 0;
484 PL_savestack_max = 96;
485
486 New(54,PL_retstack,8,OP*);
487 PL_retstack_ix = 0;
488 PL_retstack_max = 8;
489}
490
491/*
492 * destroy the stacks, the callchain etc...
493 * still there is a memleak of 128 bytes...
494 */
495STATIC void
496destroy_stacks(pTHX)
497{
498 /* is this ugly, I ask? */
499 while (PL_scopestack_ix)
500 LEAVE;
501
502 /* sure it is, but more important: is it correct?? :/ */
503 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
504 FREETMPS;
505
506 while (PL_curstackinfo->si_next)
507 PL_curstackinfo = PL_curstackinfo->si_next;
508
509 while (PL_curstackinfo)
510 {
511 PERL_SI *p = PL_curstackinfo->si_prev;
512
513 {
514 dSP;
515 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
516 PUTBACK; /* possibly superfluous */
517 }
518
519 if (PL_main_cv != Nullcv) /* don't during destruction. hack? */
520 dounwind(-1);
521
522 SvREFCNT_dec(PL_curstackinfo->si_stack);
523 Safefree(PL_curstackinfo->si_cxstack);
524 Safefree(PL_curstackinfo);
525 PL_curstackinfo = p;
526 }
527
528 Safefree(PL_tmps_stack);
529 Safefree(PL_markstack);
530 Safefree(PL_scopestack);
531 Safefree(PL_savestack);
532 Safefree(PL_retstack);
533}
534
535static void
536allocate_stack (Coro__State ctx, int alloc)
537{
538 coro_stack *stack;
539
540 New (0, stack, 1, coro_stack);
541
542 stack->refcnt = 1;
543 stack->usecnt = 1;
544 stack->gencnt = ctx->gencnt = 0;
545 if (alloc)
546 {
547#ifdef HAVE_MMAP
548 stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */
549 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0);
550 if (stack->sptr == (void *)-1)
551#endif
552 {
553 /*FIXME*//*D*//* reasonable stack size! */
554 stack->ssize = -4096 * sizeof (long);
555 New (0, stack->sptr, 4096, long);
556 }
557 }
558 else
559 stack->sptr = 0;
560
561 ctx->stack = stack;
562}
563
564static void
565deallocate_stack (Coro__State ctx)
566{
567 coro_stack *stack = ctx->stack;
568
569 ctx->stack = 0;
570
571 if (stack)
572 {
573 if (!--stack->refcnt)
574 {
575#ifdef HAVE_MMAP
576 if (stack->ssize > 0 && stack->sptr)
577 munmap (stack->sptr, stack->ssize);
578 else
579#else
580 Safefree (stack->sptr);
581#endif
582 Safefree (stack);
583 }
584 else if (ctx->gencnt == stack->gencnt)
585 --stack->usecnt;
586 }
587}
588
589static void
590setup_coro (void *arg)
591{
592 /*
593 * emulate part of the perl startup here.
594 */
595 dSP;
596 Coro__State ctx = (Coro__State)arg;
597 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
598
599 coro_init_stacks (aTHX);
600 /*PL_curcop = 0;*/
601 /*PL_in_eval = PL_in_eval;*/ /* inherit */
602 SvREFCNT_dec (GvAV (PL_defgv));
603 GvAV (PL_defgv) = ctx->args;
604
605 SPAGAIN;
606
607 if (ctx->stack)
608 {
609 ctx->cursp = 0;
610
611 PUSHMARK(SP);
612 PUTBACK;
613 (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL);
614
615 if (SvTRUE (ERRSV))
616 croak (NULL);
617 else
618 croak ("FATAL: CCTXT coroutine returned!");
619 }
620 else
621 {
622 UNOP myop;
623
624 PL_op = (OP *)&myop;
625
626 Zero(&myop, 1, UNOP);
627 myop.op_next = Nullop;
628 myop.op_flags = OPf_WANT_VOID;
629
630 PUSHMARK(SP);
631 XPUSHs (sub_init);
632 /*
633 * the next line is slightly wrong, as PL_op->op_next
634 * is actually being executed so we skip the first op.
635 * that doesn't matter, though, since it is only
636 * pp_nextstate and we never return...
637 * ah yes, and I don't care anyways ;)
638 */
639 PUTBACK;
640 PL_op = pp_entersub();
641 SPAGAIN;
642
643 ENTER; /* necessary e.g. for dounwind */
644 }
645}
646
647static void
648continue_coro (void *arg)
649{
650 /*
651 * this is a _very_ stripped down perl interpreter ;)
652 */
653 Coro__State ctx = (Coro__State)arg;
654
655 /*FIXME*//* must set up top_env here */
656 ctx->cursp = 0;
657 PL_op = PL_op->op_next;
658 CALLRUNOPS(aTHX);
659
660 abort ();
661}
662
663STATIC void
664transfer(pTHX_ struct coro *prev, struct coro *next, int flags)
665{
666 dSP;
667 dSTACKLEVEL;
668
669 if (prev != next)
670 {
671 if (next->mainstack)
672 {
673 SAVE (prev, flags);
674 LOAD (next);
675
676 /* mark this state as in-use */
677 next->mainstack = 0;
678 next->tmps_ix = -2;
679
680 /* stacklevel changed? if yes, grab the stack for us! */
681 if (flags & TRANSFER_SAVE_CCTXT)
682 {
683 if (!prev->stack)
684 allocate_stack (prev, 0);
685 else if (prev->cursp != stacklevel
686 && prev->stack->usecnt > 1)
687 {
688 prev->gencnt = ++prev->stack->gencnt;
689 prev->stack->usecnt = 1;
690 }
691
692 /* has our stack been invalidated? */
693 if (next->stack && next->stack->gencnt != next->gencnt)
694 {
695 deallocate_stack (next);
696 allocate_stack (next, 1);
697 coro_create (&(next->stack->cctx),
698 continue_coro, (void *)next,
699 next->stack->sptr, labs (next->stack->ssize));
700 }
701
702 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
703 }
704
705 }
706 else if (next->tmps_ix == -2)
707 croak ("tried to transfer to running coroutine");
708 else
709 {
710 SAVE (prev, -1); /* first get rid of the old state */
711
712 if (flags & TRANSFER_SAVE_CCTXT)
713 {
714 if (!prev->stack)
715 allocate_stack (prev, 0);
716
717 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
718 {
719 setup_coro (next);
720
721 prev->stack->refcnt++;
722 prev->stack->usecnt++;
723 next->stack = prev->stack;
724 next->gencnt = prev->gencnt;
725 }
726 else
727 {
728 allocate_stack (next, 1);
729 coro_create (&(next->stack->cctx),
730 setup_coro, (void *)next,
731 next->stack->sptr, labs (next->stack->ssize));
732 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
733 }
734 }
735 else
736 setup_coro (next);
737 }
738 }
739
740 next->cursp = stacklevel;
741}
742
743static struct coro *
744sv_to_coro (SV *arg, const char *funcname, const char *varname)
745{
746 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVHV)
747 {
748 HE *he = hv_fetch_ent((HV *)SvRV(arg), ucoro_state_sv, 0, ucoro_state_hash);
749
750 if (!he)
751 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", funcname, varname);
752
753 arg = HeVAL(he);
754 }
755
756 /* must also be changed inside Coro::Cont::yield */
757 if (SvROK(arg) && SvSTASH(SvRV(arg)) == coro_state_stash)
758 return (struct coro *) SvIV((SV*)SvRV(arg));
759 else
760 croak ("%s() -- %s is not (and contains not) a Coro::State object", funcname, varname);
761}
762
763static void
764api_transfer(pTHX_ SV *prev, SV *next, int flags)
765{
766 transfer(aTHX_ sv_to_coro (prev, "Coro::transfer", "prev"),
767 sv_to_coro (next, "Coro::transfer", "next"),
768 flags);
769}
770 195
771/** Coro ********************************************************************/ 196/** Coro ********************************************************************/
772 197
773#define PRIO_MAX 3 198#define PRIO_MAX 3
774#define PRIO_HIGH 1 199#define PRIO_HIGH 1
… …
776#define PRIO_LOW -1 201#define PRIO_LOW -1
777#define PRIO_IDLE -3 202#define PRIO_IDLE -3
778#define PRIO_MIN -4 203#define PRIO_MIN -4
779 204
780/* for Coro.pm */ 205/* for Coro.pm */
781static GV *coro_current, *coro_idle; 206static SV *coro_current;
782static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; 207static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
783static int coro_nready; 208static int coro_nready;
784 209
785static void 210/** lowlevel stuff **********************************************************/
786coro_enq (SV *sv) 211
212static AV *
213coro_clone_padlist (pTHX_ CV *cv)
787{ 214{
788 if (SvROK (sv)) 215 AV *padlist = CvPADLIST (cv);
216 AV *newpadlist, *newpad;
217
218 newpadlist = newAV ();
219 AvREAL_off (newpadlist);
220#if PERL_VERSION_ATLEAST (5,9,0)
221 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1);
222#else
223 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1);
224#endif
225 newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)];
226 --AvFILLp (padlist);
227
228 av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE)));
229 av_store (newpadlist, 1, (SV *)newpad);
230
231 return newpadlist;
232}
233
234static void
235free_padlist (pTHX_ AV *padlist)
236{
237 /* may be during global destruction */
238 if (SvREFCNT (padlist))
789 { 239 {
790 SV *hv = SvRV (sv); 240 I32 i = AvFILLp (padlist);
791 if (SvTYPE (hv) == SVt_PVHV) 241 while (i >= 0)
792 { 242 {
793 SV **xprio = hv_fetch ((HV *)hv, "prio", 4, 0); 243 SV **svp = av_fetch (padlist, i--, FALSE);
794 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL; 244 if (svp)
245 {
246 SV *sv;
247 while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
248 SvREFCNT_dec (sv);
795 249
796 prio = prio > PRIO_MAX ? PRIO_MAX 250 SvREFCNT_dec (*svp);
797 : prio < PRIO_MIN ? PRIO_MIN 251 }
798 : prio;
799
800 av_push (coro_ready [prio - PRIO_MIN], sv);
801 coro_nready++;
802
803 return;
804 } 252 }
253
254 SvREFCNT_dec ((SV*)padlist);
255 }
256}
257
258static int
259coro_cv_free (pTHX_ SV *sv, MAGIC *mg)
260{
261 AV *padlist;
262 AV *av = (AV *)mg->mg_obj;
263
264 /* casting is fun. */
265 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
266 free_padlist (aTHX_ padlist);
267
268 SvREFCNT_dec (av);
269
270 return 0;
271}
272
273#define PERL_MAGIC_coro PERL_MAGIC_ext
274
275static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
276
277#define CORO_MAGIC(cv) \
278 SvMAGIC (cv) \
279 ? SvMAGIC (cv)->mg_type == PERL_MAGIC_coro \
280 ? SvMAGIC (cv) \
281 : mg_find ((SV *)cv, PERL_MAGIC_coro) \
282 : 0
283
284/* the next two functions merely cache the padlists */
285static void
286get_padlist (pTHX_ CV *cv)
287{
288 MAGIC *mg = CORO_MAGIC (cv);
289 AV *av;
290
291 if (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0)
292 CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--];
293 else
294 {
295#if CORO_PREFER_PERL_FUNCTIONS
296 /* this is probably cleaner, but also slower? */
297 CV *cp = Perl_cv_clone (cv);
298 CvPADLIST (cv) = CvPADLIST (cp);
299 CvPADLIST (cp) = 0;
300 SvREFCNT_dec (cp);
301#else
302 CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv);
303#endif
805 } 304 }
305}
806 306
807 croak ("Coro::ready tried to enqueue something that is not a coroutine"); 307static void
308put_padlist (pTHX_ CV *cv)
309{
310 MAGIC *mg = CORO_MAGIC (cv);
311 AV *av;
312
313 if (!mg)
314 {
315 sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0);
316 mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
317 mg->mg_virtual = &vtbl_coro;
318 mg->mg_obj = (SV *)newAV ();
319 }
320
321 av = (AV *)mg->mg_obj;
322
323 if (AvFILLp (av) >= AvMAX (av))
324 av_extend (av, AvMAX (av) + 1);
325
326 AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv);
327}
328
329/** load & save, init *******************************************************/
330
331#define SB do {
332#define SE } while (0)
333
334#define REPLACE_SV(sv,val) SB SvREFCNT_dec (sv); (sv) = (val); (val) = 0; SE
335
336static void
337load_perl (pTHX_ Coro__State c)
338{
339#define VAR(name,type) PL_ ## name = c->name;
340# include "state.h"
341#undef VAR
342
343 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
344 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
345 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
346 if (c->irssv)
347 {
348 if (c->irssv == PL_rs || sv_eq (PL_rs, c->irssv))
349 SvREFCNT_dec (c->irssv);
350 else
351 {
352 REPLACE_SV (PL_rs, c->irssv);
353 if (!c->irssv_sv) c->irssv_sv = get_sv ("/", 0);
354 sv_setsv (c->irssv_sv, PL_rs);
355 }
356 }
357
358 {
359 dSP;
360 CV *cv;
361
362 /* now do the ugly restore mess */
363 while ((cv = (CV *)POPs))
364 {
365 put_padlist (aTHX_ cv); /* mark this padlist as available */
366 CvDEPTH (cv) = PTR2IV (POPs);
367 CvPADLIST (cv) = (AV *)POPs;
368 }
369
370 PUTBACK;
371 }
372 assert (!PL_comppad || AvARRAY (PL_comppad));//D
373}
374
375static void
376save_perl (pTHX_ Coro__State c)
377{
378 assert (!PL_comppad || AvARRAY (PL_comppad));//D
379 {
380 dSP;
381 I32 cxix = cxstack_ix;
382 PERL_CONTEXT *ccstk = cxstack;
383 PERL_SI *top_si = PL_curstackinfo;
384
385 /*
386 * the worst thing you can imagine happens first - we have to save
387 * (and reinitialize) all cv's in the whole callchain :(
388 */
389
390 EXTEND (SP, 3 + 1);
391 PUSHs (Nullsv);
392 /* this loop was inspired by pp_caller */
393 for (;;)
394 {
395 while (cxix >= 0)
396 {
397 PERL_CONTEXT *cx = &ccstk[cxix--];
398
399 if (CxTYPE (cx) == CXt_SUB)
400 {
401 CV *cv = cx->blk_sub.cv;
402
403 if (CvDEPTH (cv))
404 {
405 EXTEND (SP, 3);
406 PUSHs ((SV *)CvPADLIST (cv));
407 PUSHs (INT2PTR (SV *, CvDEPTH (cv)));
408 PUSHs ((SV *)cv);
409
410 CvDEPTH (cv) = 0;
411 get_padlist (aTHX_ cv);
412 }
413 }
414 }
415
416 if (top_si->si_type == PERLSI_MAIN)
417 break;
418
419 top_si = top_si->si_prev;
420 ccstk = top_si->si_cxstack;
421 cxix = top_si->si_cxix;
422 }
423
424 PUTBACK;
425 }
426
427 c->defav = c->save & CORO_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
428 c->defsv = c->save & CORO_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
429 c->errsv = c->save & CORO_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
430 c->irssv = c->save & CORO_SAVE_IRSSV ? SvREFCNT_inc (PL_rs) : 0;
431
432#define VAR(name,type)c->name = PL_ ## name;
433# include "state.h"
434#undef VAR
435}
436
437/*
438 * allocate various perl stacks. This is an exact copy
439 * of perl.c:init_stacks, except that it uses less memory
440 * on the (sometimes correct) assumption that coroutines do
441 * not usually need a lot of stackspace.
442 */
443#if CORO_PREFER_PERL_FUNCTIONS
444# define coro_init_stacks init_stacks
445#else
446static void
447coro_init_stacks (pTHX)
448{
449 PL_curstackinfo = new_stackinfo(128, 1024/sizeof(PERL_CONTEXT));
450 PL_curstackinfo->si_type = PERLSI_MAIN;
451 PL_curstack = PL_curstackinfo->si_stack;
452 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
453
454 PL_stack_base = AvARRAY(PL_curstack);
455 PL_stack_sp = PL_stack_base;
456 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
457
458 New(50,PL_tmps_stack,128,SV*);
459 PL_tmps_floor = -1;
460 PL_tmps_ix = -1;
461 PL_tmps_max = 128;
462
463 New(54,PL_markstack,32,I32);
464 PL_markstack_ptr = PL_markstack;
465 PL_markstack_max = PL_markstack + 32;
466
467#ifdef SET_MARK_OFFSET
468 SET_MARK_OFFSET;
469#endif
470
471 New(54,PL_scopestack,32,I32);
472 PL_scopestack_ix = 0;
473 PL_scopestack_max = 32;
474
475 New(54,PL_savestack,64,ANY);
476 PL_savestack_ix = 0;
477 PL_savestack_max = 64;
478
479#if !PERL_VERSION_ATLEAST (5,9,0)
480 New(54,PL_retstack,16,OP*);
481 PL_retstack_ix = 0;
482 PL_retstack_max = 16;
483#endif
484}
485#endif
486
487/*
488 * destroy the stacks, the callchain etc...
489 */
490static void
491coro_destroy_stacks (pTHX)
492{
493 if (!IN_DESTRUCT)
494 {
495 /* restore all saved variables and stuff */
496 LEAVE_SCOPE (0);
497 assert (PL_tmps_floor == -1);
498
499 /* free all temporaries */
500 FREETMPS;
501 assert (PL_tmps_ix == -1);
502
503 /* unwind all extra stacks */
504 POPSTACK_TO (PL_mainstack);
505
506 /* unwind main stack */
507 dounwind (-1);
508 }
509
510 while (PL_curstackinfo->si_next)
511 PL_curstackinfo = PL_curstackinfo->si_next;
512
513 while (PL_curstackinfo)
514 {
515 PERL_SI *p = PL_curstackinfo->si_prev;
516
517 if (!IN_DESTRUCT)
518 SvREFCNT_dec (PL_curstackinfo->si_stack);
519
520 Safefree (PL_curstackinfo->si_cxstack);
521 Safefree (PL_curstackinfo);
522 PL_curstackinfo = p;
523 }
524
525 Safefree (PL_tmps_stack);
526 Safefree (PL_markstack);
527 Safefree (PL_scopestack);
528 Safefree (PL_savestack);
529#if !PERL_VERSION_ATLEAST (5,9,0)
530 Safefree (PL_retstack);
531#endif
532}
533
534/** coroutine stack handling ************************************************/
535
536static void
537setup_coro (pTHX_ struct coro *coro)
538{
539 /*
540 * emulate part of the perl startup here.
541 */
542 coro_init_stacks (aTHX);
543
544 PL_curcop = &PL_compiling;
545 PL_in_eval = EVAL_NULL;
546 PL_comppad = 0;
547 PL_curpm = 0;
548 PL_localizing = 0;
549 PL_dirty = 0;
550 PL_restartop = 0;
551
552 {
553 dSP;
554 LOGOP myop;
555
556 SvREFCNT_dec (GvAV (PL_defgv));
557 GvAV (PL_defgv) = coro->args; coro->args = 0;
558
559 Zero (&myop, 1, LOGOP);
560 myop.op_next = Nullop;
561 myop.op_flags = OPf_WANT_VOID;
562
563 PUSHMARK (SP);
564 XPUSHs ((SV *)get_cv ("Coro::State::_coro_init", FALSE));
565 PUTBACK;
566 PL_op = (OP *)&myop;
567 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
568 SPAGAIN;
569 }
570
571 ENTER; /* necessary e.g. for dounwind */
572}
573
574static void
575free_coro_mortal (pTHX)
576{
577 if (coro_mortal)
578 {
579 SvREFCNT_dec (coro_mortal);
580 coro_mortal = 0;
581 }
582}
583
584/* inject a fake call to Coro::State::_cctx_init into the execution */
585static void NOINLINE
586prepare_cctx (pTHX_ coro_cctx *cctx)
587{
588 dSP;
589 LOGOP myop;
590
591 Zero (&myop, 1, LOGOP);
592 myop.op_next = PL_op;
593 myop.op_flags = OPf_WANT_VOID | OPf_STACKED;
594
595 PUSHMARK (SP);
596 EXTEND (SP, 2);
597 PUSHs (sv_2mortal (newSViv (PTR2IV (cctx))));
598 PUSHs ((SV *)get_cv ("Coro::State::_cctx_init", FALSE));
599 PUTBACK;
600 PL_op = (OP *)&myop;
601 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
602 SPAGAIN;
603}
604
605static void
606coro_run (void *arg)
607{
608 dTHX;
609
610 /* coro_run is the alternative tail of transfer(), so unlock here. */
611 UNLOCK;
612
613 /*
614 * this is a _very_ stripped down perl interpreter ;)
615 */
616 PL_top_env = &PL_start_env;
617
618 /* inject call to cctx_init */
619 prepare_cctx (aTHX_ (coro_cctx *)arg);
620
621 /* somebody will hit me for both perl_run and PL_restartop */
622 PL_restartop = PL_op;
623 perl_run (PL_curinterp);
624
625 fputs ("FATAL: C coroutine fell over the edge of the world, aborting. Did you call exit in a coroutine?\n", stderr);
626 abort ();
627}
628
629static coro_cctx *
630cctx_new ()
631{
632 coro_cctx *cctx;
633 void *stack_start;
634 size_t stack_size;
635
636 ++cctx_count;
637
638 Newz (0, cctx, 1, coro_cctx);
639
640#if HAVE_MMAP
641
642 cctx->ssize = ((coro_stacksize * sizeof (long) + PAGESIZE - 1) / PAGESIZE + CORO_STACKGUARD) * PAGESIZE;
643 /* mmap supposedly does allocate-on-write for us */
644 cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
645
646 if (cctx->sptr != (void *)-1)
647 {
648# if CORO_STACKGUARD
649 mprotect (cctx->sptr, CORO_STACKGUARD * PAGESIZE, PROT_NONE);
650# endif
651 stack_start = CORO_STACKGUARD * PAGESIZE + (char *)cctx->sptr;
652 stack_size = cctx->ssize - CORO_STACKGUARD * PAGESIZE;
653 cctx->mapped = 1;
654 }
655 else
656#endif
657 {
658 cctx->ssize = coro_stacksize * (long)sizeof (long);
659 New (0, cctx->sptr, coro_stacksize, long);
660
661 if (!cctx->sptr)
662 {
663 perror ("FATAL: unable to allocate stack for coroutine");
664 _exit (EXIT_FAILURE);
665 }
666
667 stack_start = cctx->sptr;
668 stack_size = cctx->ssize;
669 }
670
671 REGISTER_STACK (cctx, (char *)stack_start, (char *)stack_start + stack_size);
672 coro_create (&cctx->cctx, coro_run, (void *)cctx, stack_start, stack_size);
673
674 return cctx;
675}
676
677static void
678cctx_destroy (coro_cctx *cctx)
679{
680 if (!cctx)
681 return;
682
683 --cctx_count;
684
685#if CORO_USE_VALGRIND
686 VALGRIND_STACK_DEREGISTER (cctx->valgrind_id);
687#endif
688
689#if HAVE_MMAP
690 if (cctx->mapped)
691 munmap (cctx->sptr, cctx->ssize);
692 else
693#endif
694 Safefree (cctx->sptr);
695
696 Safefree (cctx);
697}
698
699static coro_cctx *
700cctx_get (pTHX)
701{
702 while (cctx_first)
703 {
704 coro_cctx *cctx = cctx_first;
705 cctx_first = cctx->next;
706 --cctx_idle;
707
708 if (cctx->ssize >= coro_stacksize)
709 return cctx;
710
711 cctx_destroy (cctx);
712 }
713
714 PL_op = PL_op->op_next;
715 return cctx_new ();
716}
717
718static void
719cctx_put (coro_cctx *cctx)
720{
721 /* free another cctx if overlimit */
722 if (cctx_idle >= MAX_IDLE_CCTX)
723 {
724 coro_cctx *first = cctx_first;
725 cctx_first = first->next;
726 --cctx_idle;
727
728 assert (!first->inuse);
729 cctx_destroy (first);
730 }
731
732 ++cctx_idle;
733 cctx->next = cctx_first;
734 cctx_first = cctx;
735}
736
737/** coroutine switching *****************************************************/
738
739/* never call directly, always through the coro_state_transfer global variable */
740static void NOINLINE
741transfer (pTHX_ struct coro *prev, struct coro *next)
742{
743 dSTACKLEVEL;
744
745 /* sometimes transfer is only called to set idle_sp */
746 if (!next)
747 {
748 ((coro_cctx *)prev)->idle_sp = STACKLEVEL;
749 assert (((coro_cctx *)prev)->idle_te = PL_top_env); /* just for the side-effect when asserts are enabled */
750 }
751 else if (prev != next)
752 {
753 coro_cctx *prev__cctx;
754
755 if (prev->flags & CF_NEW)
756 {
757 /* create a new empty context */
758 Newz (0, prev->cctx, 1, coro_cctx);
759 prev->cctx->inuse = 1;
760 prev->flags &= ~CF_NEW;
761 prev->flags |= CF_RUNNING;
762 }
763
764 /*TODO: must not croak here */
765 if (!prev->flags & CF_RUNNING)
766 croak ("Coro::State::transfer called with non-running prev Coro::State, but can only transfer from running states");
767
768 if (next->flags & CF_RUNNING)
769 croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states");
770
771 if (next->flags & CF_DESTROYED)
772 croak ("Coro::State::transfer called with destroyed next Coro::State, but can only transfer to inactive states");
773
774 prev->flags &= ~CF_RUNNING;
775 next->flags |= CF_RUNNING;
776
777 LOCK;
778
779 if (next->flags & CF_NEW)
780 {
781 /* need to start coroutine */
782 next->flags &= ~CF_NEW;
783 /* first get rid of the old state */
784 save_perl (aTHX_ prev);
785 /* setup coroutine call */
786 setup_coro (aTHX_ next);
787 /* need a new stack */
788 assert (!next->cctx);
789 }
790 else
791 {
792 /* coroutine already started */
793 save_perl (aTHX_ prev);
794 load_perl (aTHX_ next);
795 }
796
797 prev__cctx = prev->cctx;
798
799 /* possibly "free" the cctx */
800 if (prev__cctx->idle_sp == STACKLEVEL)
801 {
802 /* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */
803 assert (("ERROR: current top_env must equal previous top_env", PL_top_env == prev__cctx->idle_te));
804
805 prev->cctx = 0;
806
807 cctx_put (prev__cctx);
808 prev__cctx->inuse = 0;
809 }
810
811 if (!next->cctx)
812 {
813 next->cctx = cctx_get (aTHX);
814 assert (!next->cctx->inuse);
815 next->cctx->inuse = 1;
816 }
817
818 if (prev__cctx != next->cctx)
819 {
820 prev__cctx->top_env = PL_top_env;
821 PL_top_env = next->cctx->top_env;
822 coro_transfer (&prev__cctx->cctx, &next->cctx->cctx);
823 }
824
825 free_coro_mortal (aTHX);
826 UNLOCK;
827 }
828}
829
830struct transfer_args
831{
832 struct coro *prev, *next;
833};
834
835#define TRANSFER(ta) transfer (aTHX_ (ta).prev, (ta).next)
836
837/** high level stuff ********************************************************/
838
839static int
840coro_state_destroy (pTHX_ struct coro *coro)
841{
842 if (coro->flags & CF_DESTROYED)
843 return 0;
844
845 coro->flags |= CF_DESTROYED;
846
847 if (coro->flags & CF_READY)
848 {
849 /* reduce nready, as destroying a ready coro effectively unreadies it */
850 /* alternative: look through all ready queues and remove the coro */
851 LOCK;
852 --coro_nready;
853 UNLOCK;
854 }
855 else
856 coro->flags |= CF_READY; /* make sure it is NOT put into the readyqueue */
857
858 if (coro->mainstack && coro->mainstack != main_mainstack)
859 {
860 struct coro temp;
861
862 assert (!(coro->flags & CF_RUNNING));
863
864 Zero (&temp, 1, struct coro);
865 temp.save = CORO_SAVE_ALL;
866
867 if (coro->flags & CF_RUNNING)
868 croak ("FATAL: tried to destroy currently running coroutine");
869
870 save_perl (aTHX_ &temp);
871 load_perl (aTHX_ coro);
872
873 coro_destroy_stacks (aTHX);
874
875 load_perl (aTHX_ &temp); /* this will get rid of defsv etc.. */
876
877 coro->mainstack = 0;
878 }
879
880 cctx_destroy (coro->cctx);
881 SvREFCNT_dec (coro->args);
882
883 return 1;
884}
885
886static int
887coro_state_free (pTHX_ SV *sv, MAGIC *mg)
888{
889 struct coro *coro = (struct coro *)mg->mg_ptr;
890 mg->mg_ptr = 0;
891
892 if (--coro->refcnt < 0)
893 {
894 coro_state_destroy (aTHX_ coro);
895 Safefree (coro);
896 }
897
898 return 0;
899}
900
901static int
902coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params)
903{
904 struct coro *coro = (struct coro *)mg->mg_ptr;
905
906 ++coro->refcnt;
907
908 return 0;
909}
910
911static MGVTBL coro_state_vtbl = {
912 0, 0, 0, 0,
913 coro_state_free,
914 0,
915#ifdef MGf_DUP
916 coro_state_dup,
917#else
918# define MGf_DUP 0
919#endif
920};
921
922static struct coro *
923SvSTATE_ (pTHX_ SV *coro)
924{
925 HV *stash;
926 MAGIC *mg;
927
928 if (SvROK (coro))
929 coro = SvRV (coro);
930
931 stash = SvSTASH (coro);
932 if (stash != coro_stash && stash != coro_state_stash)
933 {
934 /* very slow, but rare, check */
935 if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
936 croak ("Coro::State object required");
937 }
938
939 mg = CORO_MAGIC (coro);
940 return (struct coro *)mg->mg_ptr;
941}
942
943#define SvSTATE(sv) SvSTATE_ (aTHX_ (sv))
944
945static void
946prepare_transfer (pTHX_ struct transfer_args *ta, SV *prev_sv, SV *next_sv)
947{
948 ta->prev = SvSTATE (prev_sv);
949 ta->next = SvSTATE (next_sv);
950}
951
952static void
953api_transfer (SV *prev_sv, SV *next_sv)
954{
955 dTHX;
956 struct transfer_args ta;
957
958 prepare_transfer (aTHX_ &ta, prev_sv, next_sv);
959 TRANSFER (ta);
960}
961
962static int
963api_save (SV *coro_sv, int new_save)
964{
965 dTHX;
966 struct coro *coro = SvSTATE (coro_sv);
967 int old_save = coro->save;
968
969 if (new_save >= 0)
970 coro->save = new_save;
971
972 return old_save;
973}
974
975/** Coro ********************************************************************/
976
977static void
978coro_enq (pTHX_ SV *coro_sv)
979{
980 av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv);
808} 981}
809 982
810static SV * 983static SV *
811coro_deq (int min_prio) 984coro_deq (pTHX_ int min_prio)
812{ 985{
813 int prio = PRIO_MAX - PRIO_MIN; 986 int prio = PRIO_MAX - PRIO_MIN;
814 987
815 min_prio -= PRIO_MIN; 988 min_prio -= PRIO_MIN;
816 if (min_prio < 0) 989 if (min_prio < 0)
817 min_prio = 0; 990 min_prio = 0;
818 991
819 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) 992 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
820 if (av_len (coro_ready[prio]) >= 0) 993 if (AvFILLp (coro_ready [prio]) >= 0)
821 {
822 coro_nready--;
823 return av_shift (coro_ready[prio]); 994 return av_shift (coro_ready [prio]);
824 }
825 995
826 return 0; 996 return 0;
827} 997}
828 998
829static void 999static int
830api_ready (SV *coro) 1000api_ready (SV *coro_sv)
831{ 1001{
1002 dTHX;
1003 struct coro *coro;
1004
1005 if (SvROK (coro_sv))
1006 coro_sv = SvRV (coro_sv);
1007
1008 coro = SvSTATE (coro_sv);
1009
1010 if (coro->flags & CF_READY)
1011 return 0;
1012
1013 coro->flags |= CF_READY;
1014
1015 LOCK;
832 coro_enq (SvREFCNT_inc (coro)); 1016 coro_enq (aTHX_ SvREFCNT_inc (coro_sv));
833} 1017 ++coro_nready;
1018 UNLOCK;
834 1019
1020 return 1;
1021}
1022
835static void 1023static int
836api_schedule (int cede) 1024api_is_ready (SV *coro_sv)
837{ 1025{
1026 dTHX;
1027 return !!(SvSTATE (coro_sv)->flags & CF_READY);
1028}
1029
1030static void
1031prepare_schedule (pTHX_ struct transfer_args *ta)
1032{
838 SV *prev, *next; 1033 SV *prev_sv, *next_sv;
839 1034
1035 for (;;)
1036 {
1037 LOCK;
1038 next_sv = coro_deq (aTHX_ PRIO_MIN);
1039
1040 /* nothing to schedule: call the idle handler */
1041 if (!next_sv)
1042 {
1043 dSP;
1044 UNLOCK;
1045
1046 ENTER;
1047 SAVETMPS;
1048
1049 PUSHMARK (SP);
1050 PUTBACK;
1051 call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD);
1052
1053 FREETMPS;
1054 LEAVE;
1055 continue;
1056 }
1057
1058 ta->next = SvSTATE (next_sv);
1059
1060 /* cannot transfer to destroyed coros, skip and look for next */
1061 if (ta->next->flags & CF_DESTROYED)
1062 {
1063 UNLOCK;
1064 SvREFCNT_dec (next_sv);
1065 /* coro_nready is already taken care of by destroy */
1066 continue;
1067 }
1068
1069 --coro_nready;
1070 UNLOCK;
1071 break;
1072 }
1073
1074 /* free this only after the transfer */
840 prev = GvSV (coro_current); 1075 prev_sv = SvRV (coro_current);
1076 SvRV_set (coro_current, next_sv);
1077 ta->prev = SvSTATE (prev_sv);
841 1078
842 if (cede) 1079 assert (ta->next->flags & CF_READY);
843 coro_enq (SvREFCNT_inc (prev)); 1080 ta->next->flags &= ~CF_READY;
844 1081
845 next = coro_deq (PRIO_MIN); 1082 LOCK;
1083 free_coro_mortal (aTHX);
1084 coro_mortal = prev_sv;
1085 UNLOCK;
1086}
846 1087
847 if (!next) 1088static void
848 next = SvREFCNT_inc (GvSV (coro_idle)); 1089prepare_cede (pTHX_ struct transfer_args *ta)
1090{
1091 api_ready (coro_current);
1092 prepare_schedule (aTHX_ ta);
1093}
849 1094
850 GvSV (coro_current) = SvREFCNT_inc (next); 1095static int
851 transfer (sv_to_coro (prev, "Coro::schedule", "current coroutine"), 1096prepare_cede_notself (pTHX_ struct transfer_args *ta)
852 sv_to_coro (next, "Coro::schedule", "next coroutine"), 1097{
853 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK); 1098 if (coro_nready)
854 SvREFCNT_dec (next); 1099 {
855 SvREFCNT_dec (prev); 1100 SV *prev = SvRV (coro_current);
1101 prepare_schedule (aTHX_ ta);
1102 api_ready (prev);
1103 return 1;
1104 }
1105 else
1106 return 0;
1107}
1108
1109static void
1110api_schedule (void)
1111{
1112 dTHX;
1113 struct transfer_args ta;
1114
1115 prepare_schedule (aTHX_ &ta);
1116 TRANSFER (ta);
1117}
1118
1119static int
1120api_cede (void)
1121{
1122 dTHX;
1123 struct transfer_args ta;
1124
1125 prepare_cede (aTHX_ &ta);
1126
1127 if (ta.prev != ta.next)
1128 {
1129 TRANSFER (ta);
1130 return 1;
1131 }
1132 else
1133 return 0;
1134}
1135
1136static int
1137api_cede_notself (void)
1138{
1139 dTHX;
1140 struct transfer_args ta;
1141
1142 if (prepare_cede_notself (aTHX_ &ta))
1143 {
1144 TRANSFER (ta);
1145 return 1;
1146 }
1147 else
1148 return 0;
856} 1149}
857 1150
858MODULE = Coro::State PACKAGE = Coro::State 1151MODULE = Coro::State PACKAGE = Coro::State
859 1152
860PROTOTYPES: ENABLE 1153PROTOTYPES: DISABLE
861 1154
862BOOT: 1155BOOT:
863{ /* {} necessary for stoopid perl-5.6.x */ 1156{
864 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); 1157#ifdef USE_ITHREADS
865 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); 1158 MUTEX_INIT (&coro_mutex);
1159#endif
1160 BOOT_PAGESIZE;
1161
866 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 1162 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
867 1163
868 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 1164 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (CORO_SAVE_DEFAV));
869 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 1165 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (CORO_SAVE_DEFSV));
870 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); 1166 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (CORO_SAVE_ERRSV));
1167 newCONSTSUB (coro_state_stash, "SAVE_IRSSV", newSViv (CORO_SAVE_IRSSV));
871 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); 1168 newCONSTSUB (coro_state_stash, "SAVE_ALL", newSViv (CORO_SAVE_ALL));
872
873 if (!padlist_cache)
874 padlist_cache = newHV ();
875 1169
876 main_mainstack = PL_mainstack; 1170 main_mainstack = PL_mainstack;
877 1171
878 coroapi.ver = CORO_API_VERSION; 1172 coroapi.ver = CORO_API_VERSION;
879 coroapi.transfer = api_transfer; 1173 coroapi.transfer = api_transfer;
880}
881 1174
882Coro::State 1175 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
883_newprocess(args) 1176}
884 SV * args 1177
885 PROTOTYPE: $ 1178SV *
1179new (char *klass, ...)
886 CODE: 1180 CODE:
887 Coro__State coro; 1181{
1182 struct coro *coro;
1183 HV *hv;
1184 int i;
888 1185
889 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
890 croak ("Coro::State::_newprocess expects an arrayref");
891
892 New (0, coro, 1, struct coro); 1186 Newz (0, coro, 1, struct coro);
1187 coro->args = newAV ();
1188 coro->save = CORO_SAVE_ALL;
1189 coro->flags = CF_NEW;
893 1190
894 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 1191 hv = newHV ();
895 coro->mainstack = 0; /* actual work is done inside transfer */ 1192 sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP;
896 coro->stack = 0; 1193 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
897 1194
898 RETVAL = coro; 1195 for (i = 1; i < items; i++)
1196 av_push (coro->args, newSVsv (ST (i)));
1197}
899 OUTPUT: 1198 OUTPUT:
900 RETVAL 1199 RETVAL
901 1200
1201int
1202save (SV *coro, int new_save = -1)
1203 CODE:
1204 RETVAL = api_save (coro, new_save);
1205 OUTPUT:
1206 RETVAL
1207
902void 1208void
903transfer(prev, next, flags) 1209_set_stacklevel (...)
904 Coro::State_or_hashref prev 1210 ALIAS:
905 Coro::State_or_hashref next 1211 Coro::State::transfer = 1
906 int flags 1212 Coro::schedule = 2
907 PROTOTYPE: @ 1213 Coro::cede = 3
1214 Coro::cede_notself = 4
908 CODE: 1215 CODE:
909 PUTBACK; 1216{
910 transfer (aTHX_ prev, next, flags); 1217 struct transfer_args ta;
911 SPAGAIN; 1218
1219 switch (ix)
1220 {
1221 case 0:
1222 ta.prev = (struct coro *)INT2PTR (coro_cctx *, SvIV (ST (0)));
1223 ta.next = 0;
1224 break;
1225
1226 case 1:
1227 if (items != 2)
1228 croak ("Coro::State::transfer (prev,next) expects two arguments, not %d", items);
1229
1230 prepare_transfer (aTHX_ &ta, ST (0), ST (1));
1231 break;
1232
1233 case 2:
1234 prepare_schedule (aTHX_ &ta);
1235 break;
1236
1237 case 3:
1238 prepare_cede (aTHX_ &ta);
1239 break;
1240
1241 case 4:
1242 if (!prepare_cede_notself (aTHX_ &ta))
1243 XSRETURN_EMPTY;
1244
1245 break;
1246 }
1247
1248 BARRIER;
1249 TRANSFER (ta);
1250
1251 if (GIMME_V != G_VOID && ta.next != ta.prev)
1252 XSRETURN_YES;
1253}
1254
1255bool
1256_destroy (SV *coro_sv)
1257 CODE:
1258 RETVAL = coro_state_destroy (aTHX_ SvSTATE (coro_sv));
1259 OUTPUT:
1260 RETVAL
912 1261
913void 1262void
914DESTROY(coro)
915 Coro::State coro
916 CODE:
917
918 if (coro->mainstack && coro->mainstack != main_mainstack)
919 {
920 struct coro temp;
921
922 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);
923 LOAD(aTHX_ coro);
924
925 destroy_stacks (aTHX);
926
927 LOAD((&temp)); /* this will get rid of defsv etc.. */
928
929 coro->mainstack = 0;
930 }
931
932 deallocate_stack (coro);
933
934 Safefree (coro);
935
936void
937flush()
938 CODE:
939#ifdef MAY_FLUSH
940 flush_padlist_cache ();
941#endif
942
943void
944_exit(code) 1263_exit (code)
945 int code 1264 int code
946 PROTOTYPE: $ 1265 PROTOTYPE: $
947 CODE: 1266 CODE:
948#if defined(__GLIBC__) || _POSIX_C_SOURCE
949 _exit (code); 1267 _exit (code);
950#else
951 signal (SIGTERM, SIG_DFL);
952 raise (SIGTERM);
953 exit (code);
954#endif
955 1268
956MODULE = Coro::State PACKAGE = Coro::Cont 1269int
1270cctx_stacksize (int new_stacksize = 0)
1271 CODE:
1272 RETVAL = coro_stacksize;
1273 if (new_stacksize)
1274 coro_stacksize = new_stacksize;
1275 OUTPUT:
1276 RETVAL
957 1277
958# this is slightly dirty (should expose a c-level api) 1278int
1279cctx_count ()
1280 CODE:
1281 RETVAL = cctx_count;
1282 OUTPUT:
1283 RETVAL
959 1284
960void 1285int
961yield(...) 1286cctx_idle ()
962 PROTOTYPE: @ 1287 CODE:
963 CODE: 1288 RETVAL = cctx_idle;
964 static SV *returnstk; 1289 OUTPUT:
965 SV *sv; 1290 RETVAL
966 AV *defav = GvAV (PL_defgv);
967 struct coro *prev, *next;
968
969 if (!returnstk)
970 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));
971
972 /* set up @_ -- ugly */
973 av_clear (defav);
974 av_fill (defav, items - 1);
975 while (items--)
976 av_store (defav, items, SvREFCNT_inc (ST(items)));
977
978 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
979 sv = av_pop ((AV *)SvRV (returnstk));
980 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
981 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
982 SvREFCNT_dec (sv);
983
984 transfer(aTHX_ prev, next, 0);
985 1291
986MODULE = Coro::State PACKAGE = Coro 1292MODULE = Coro::State PACKAGE = Coro
987 1293
988# this is slightly dirty (should expose a c-level api)
989
990BOOT: 1294BOOT:
991{ 1295{
992 int i; 1296 int i;
1297
993 HV *stash = gv_stashpv ("Coro", TRUE); 1298 coro_stash = gv_stashpv ("Coro", TRUE);
994 1299
995 newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); 1300 newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
996 newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); 1301 newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
997 newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); 1302 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
998 newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); 1303 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
999 newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); 1304 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1000 newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); 1305 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1001 1306
1002 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); 1307 coro_current = get_sv ("Coro::current", FALSE);
1003 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); 1308 SvREADONLY_on (coro_current);
1004 1309
1005 for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) 1310 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1006 coro_ready[i] = newAV (); 1311 coro_ready[i] = newAV ();
1007 1312
1008 { 1313 {
1009 SV *sv = perl_get_sv("Coro::API", 1); 1314 SV *sv = perl_get_sv("Coro::API", 1);
1010 1315
1011 coroapi.schedule = api_schedule; 1316 coroapi.schedule = api_schedule;
1317 coroapi.save = api_save;
1318 coroapi.cede = api_cede;
1319 coroapi.cede_notself = api_cede_notself;
1012 coroapi.ready = api_ready; 1320 coroapi.ready = api_ready;
1321 coroapi.is_ready = api_is_ready;
1013 coroapi.nready = &coro_nready; 1322 coroapi.nready = &coro_nready;
1014 coroapi.current = coro_current; 1323 coroapi.current = coro_current;
1015 1324
1016 GCoroAPI = &coroapi; 1325 GCoroAPI = &coroapi;
1017 sv_setiv(sv, (IV)&coroapi); 1326 sv_setiv (sv, (IV)&coroapi);
1018 SvREADONLY_on(sv); 1327 SvREADONLY_on (sv);
1019 } 1328 }
1020} 1329}
1021 1330
1022void 1331void
1023ready(self) 1332_set_current (SV *current)
1024 SV * self 1333 PROTOTYPE: $
1025 CODE: 1334 CODE:
1026 api_ready (self); 1335 SvREFCNT_dec (SvRV (coro_current));
1336 SvRV_set (coro_current, SvREFCNT_inc (SvRV (current)));
1027 1337
1028int 1338int
1339prio (Coro::State coro, int newprio = 0)
1340 ALIAS:
1341 nice = 1
1342 CODE:
1343{
1344 RETVAL = coro->prio;
1345
1346 if (items > 1)
1347 {
1348 if (ix)
1349 newprio = coro->prio - newprio;
1350
1351 if (newprio < PRIO_MIN) newprio = PRIO_MIN;
1352 if (newprio > PRIO_MAX) newprio = PRIO_MAX;
1353
1354 coro->prio = newprio;
1355 }
1356}
1357 OUTPUT:
1358 RETVAL
1359
1360SV *
1361ready (SV *self)
1362 PROTOTYPE: $
1363 CODE:
1364 RETVAL = boolSV (api_ready (self));
1365 OUTPUT:
1366 RETVAL
1367
1368SV *
1369is_ready (SV *self)
1370 PROTOTYPE: $
1371 CODE:
1372 RETVAL = boolSV (api_is_ready (self));
1373 OUTPUT:
1374 RETVAL
1375
1376int
1029nready(...) 1377nready (...)
1030 PROTOTYPE: 1378 PROTOTYPE:
1031 CODE: 1379 CODE:
1032 RETVAL = coro_nready; 1380 RETVAL = coro_nready;
1033 OUTPUT: 1381 OUTPUT:
1034 RETVAL 1382 RETVAL
1035 1383
1384MODULE = Coro::State PACKAGE = Coro::AIO
1385
1386SV *
1387_get_state ()
1388 CODE:
1389{
1390 struct io_state *data;
1391
1392 RETVAL = newSV (sizeof (struct io_state));
1393 data = (struct io_state *)SvPVX (RETVAL);
1394 SvCUR_set (RETVAL, sizeof (struct io_state));
1395 SvPOK_only (RETVAL);
1396
1397 data->errorno = errno;
1398 data->laststype = PL_laststype;
1399 data->laststatval = PL_laststatval;
1400 data->statcache = PL_statcache;
1401}
1402 OUTPUT:
1403 RETVAL
1404
1036void 1405void
1037schedule(...) 1406_set_state (char *data_)
1038 PROTOTYPE: 1407 PROTOTYPE: $
1039 ALIAS:
1040 cede = 1
1041 CODE: 1408 CODE:
1042 api_schedule (ix); 1409{
1410 struct io_state *data = (void *)data_;
1043 1411
1412 errno = data->errorno;
1413 PL_laststype = data->laststype;
1414 PL_laststatval = data->laststatval;
1415 PL_statcache = data->statcache;
1416}
1417

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines