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

Diff Legend

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