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.2 by root, Sun Jul 15 02:35:52 2001 UTC vs.
Revision 1.131 by root, Fri Dec 29 11:37:49 2006 UTC

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

Diff Legend

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