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.11 by root, Sat Jul 21 18:21:45 2001 UTC vs.
Revision 1.55 by pcg, Thu Apr 1 02:29:05 2004 UTC

1#include "EXTERN.h" 1#include "EXTERN.h"
2#include "perl.h" 2#include "perl.h"
3#include "XSUB.h" 3#include "XSUB.h"
4 4
5#if 1 5#include "patchlevel.h"
6# define CHK(x) (void *)0 6
7#if PATCHLEVEL < 6
8# ifndef PL_ppaddr
9# define PL_ppaddr ppaddr
10# endif
11# ifndef call_sv
12# define call_sv perl_call_sv
13# endif
14# ifndef get_sv
15# define get_sv perl_get_sv
16# endif
17# ifndef get_cv
18# define get_cv perl_get_cv
19# endif
20# ifndef IS_PADGV
21# define IS_PADGV(v) 0
22# endif
23# ifndef IS_PADCONST
24# define IS_PADCONST(v) 0
25# endif
26#endif
27
28#include "libcoro/coro.c"
29
30#include <signal.h>
31
32#ifdef HAVE_MMAP
33# include <unistd.h>
34# include <sys/mman.h>
35# ifndef MAP_ANONYMOUS
36# ifdef MAP_ANON
37# define MAP_ANONYMOUS MAP_ANON
38# else
39# undef HAVE_MMAP
40# endif
41# endif
42#endif
43
44#define SUB_INIT "Coro::State::initialize"
45#define UCORO_STATE "_coro_state"
46
47/* The next macro should declare a variable stacklevel that contains and approximation
48 * to the current C stack pointer. Its property is that it changes with each call
49 * and should be unique. */
50#define dSTACKLEVEL void *stacklevel = &stacklevel
51
52#define IN_DESTRUCT (PL_main_cv == Nullcv)
53
54#define labs(l) ((l) >= 0 ? (l) : -(l))
55
56#include "CoroAPI.h"
57
58#ifdef USE_ITHREADS
59static perl_mutex coro_mutex;
60# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0)
61# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0)
7#else 62#else
8# define CHK(x) if (!(x)) croak("FATAL, CHK: " #x) 63# define LOCK 0
64# define UNLOCK 0
9#endif 65#endif
10 66
11#define MAY_FLUSH /* increases codesize */ 67static struct CoroAPI coroapi;
12 68
13#define SUB_INIT "Coro::State::initialize" 69/* this is actually not only the c stack but also c registers etc... */
70typedef struct {
71 int refcnt; /* pointer reference counter */
72 int usecnt; /* shared by how many coroutines */
73 int gencnt; /* generation counter */
14 74
15#define SAVE_DEFAV 0x00000001 75 coro_context cctx;
16#define SAVE_DEFSV 0x00000002
17#define SAVE_ERRSV 0x00000004
18 76
19#define SAVE_ALL -1 77 void *sptr;
78 long ssize; /* positive == mmap, otherwise malloc */
79} coro_stack;
20 80
21struct coro { 81struct coro {
82 /* the top-level JMPENV for each coroutine, needed to catch dies. */
83 JMPENV start_env;
84
85 /* the optional C context */
86 coro_stack *stack;
87 void *cursp;
88 int gencnt;
89
22 /* optionally saved, might be zero */ 90 /* optionally saved, might be zero */
23 AV *defav; 91 AV *defav;
24 SV *defsv; 92 SV *defsv;
25 SV *errsv; 93 SV *errsv;
26 94
27 /* saved global state not related to stacks */ 95 /* saved global state not related to stacks */
28 U8 dowarn; 96 U8 dowarn;
97 I32 in_eval;
29 98
30 /* the stacks and related info (callchain etc..) */ 99 /* the stacks and related info (callchain etc..) */
31 PERL_SI *curstackinfo; 100 PERL_SI *curstackinfo;
32 AV *curstack; 101 AV *curstack;
33 AV *mainstack; 102 AV *mainstack;
34 SV **stack_sp; 103 SV **stack_sp;
35 OP *op; 104 OP *op;
36 SV **curpad; 105 SV **curpad;
106 AV *comppad;
37 SV **stack_base; 107 SV **stack_base;
38 SV **stack_max; 108 SV **stack_max;
39 SV **tmps_stack; 109 SV **tmps_stack;
40 I32 tmps_floor; 110 I32 tmps_floor;
41 I32 tmps_ix; 111 I32 tmps_ix;
51 I32 savestack_max; 121 I32 savestack_max;
52 OP **retstack; 122 OP **retstack;
53 I32 retstack_ix; 123 I32 retstack_ix;
54 I32 retstack_max; 124 I32 retstack_max;
55 COP *curcop; 125 COP *curcop;
126 JMPENV *top_env;
56 127
57 /* data associated with this coroutine (initial args) */ 128 /* data associated with this coroutine (initial args) */
58 AV *args; 129 AV *args;
59}; 130};
60 131
61typedef struct coro *Coro__State; 132typedef struct coro *Coro__State;
62typedef struct coro *Coro__State_or_hashref; 133typedef struct coro *Coro__State_or_hashref;
63 134
64static HV *padlist_cache; 135static AV *main_mainstack; /* used to differentiate between $main and others */
136static HV *coro_state_stash;
137static SV *ucoro_state_sv;
138static U32 ucoro_state_hash;
139static SV *coro_mortal; /* will be freed after next transfer */
65 140
66/* mostly copied from op.c:cv_clone2 */ 141/* mostly copied from op.c:cv_clone2 */
67STATIC AV * 142STATIC AV *
68clone_padlist (AV *protopadlist) 143clone_padlist (AV *protopadlist)
69{ 144{
97 AvFLAGS (av) = AVf_REIFY; 172 AvFLAGS (av) = AVf_REIFY;
98 173
99 for (ix = fpad; ix > 0; ix--) 174 for (ix = fpad; ix > 0; ix--)
100 { 175 {
101 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; 176 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;
177
102 if (namesv && namesv != &PL_sv_undef) 178 if (namesv && namesv != &PL_sv_undef)
103 { 179 {
104 char *name = SvPVX (namesv); /* XXX */ 180 char *name = SvPVX (namesv); /* XXX */
181
105 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') 182 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&')
106 { /* lexical from outside? */ 183 { /* lexical from outside? */
107 npad[ix] = SvREFCNT_inc (ppad[ix]); 184 npad[ix] = SvREFCNT_inc (ppad[ix]);
108 } 185 }
109 else 186 else
115 sv = (SV *) newAV (); 192 sv = (SV *) newAV ();
116 else if (*name == '%') 193 else if (*name == '%')
117 sv = (SV *) newHV (); 194 sv = (SV *) newHV ();
118 else 195 else
119 sv = NEWSV (0, 0); 196 sv = NEWSV (0, 0);
197
198#ifdef SvPADBUSY
120 if (!SvPADBUSY (sv)) 199 if (!SvPADBUSY (sv))
200#endif
121 SvPADMY_on (sv); 201 SvPADMY_on (sv);
202
122 npad[ix] = sv; 203 npad[ix] = sv;
123 } 204 }
124 } 205 }
125 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) 206 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))
126 { 207 {
155#endif 236#endif
156 237
157 return newpadlist; 238 return newpadlist;
158} 239}
159 240
160#ifdef MAY_FLUSH 241STATIC void
161STATIC AV *
162free_padlist (AV *padlist) 242free_padlist (AV *padlist)
163{ 243{
164 /* may be during global destruction */ 244 /* may be during global destruction */
165 if (SvREFCNT(padlist)) 245 if (SvREFCNT (padlist))
166 { 246 {
167 I32 i = AvFILLp(padlist); 247 I32 i = AvFILLp (padlist);
168 while (i >= 0) 248 while (i >= 0)
169 { 249 {
170 SV **svp = av_fetch(padlist, i--, FALSE); 250 SV **svp = av_fetch (padlist, i--, FALSE);
171 SV *sv = svp ? *svp : Nullsv;
172 if (sv) 251 if (svp)
252 {
253 SV *sv;
254 while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
173 SvREFCNT_dec(sv); 255 SvREFCNT_dec (sv);
256
257 SvREFCNT_dec (*svp);
258 }
174 } 259 }
175 260
176 SvREFCNT_dec((SV*)padlist); 261 SvREFCNT_dec ((SV*)padlist);
177 } 262 }
178} 263}
179#endif 264
265STATIC int
266coro_cv_free (pTHX_ SV *sv, MAGIC *mg)
267{
268 AV *padlist;
269 AV *av = (AV *)mg->mg_obj;
270
271 /* casting is fun. */
272 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
273 free_padlist (padlist);
274}
275
276#define PERL_MAGIC_coro PERL_MAGIC_ext
277
278static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
180 279
181/* the next two functions merely cache the padlists */ 280/* the next two functions merely cache the padlists */
182STATIC void 281STATIC void
183get_padlist (CV *cv) 282get_padlist (CV *cv)
184{ 283{
185 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0); 284 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
186 285
187 if (he && AvFILLp ((AV *)*he) >= 0) 286 if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0)
188 CvPADLIST (cv) = (AV *)av_pop ((AV *)*he); 287 CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj);
189 else 288 else
190 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv)); 289 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));
191} 290}
192 291
193STATIC void 292STATIC void
194put_padlist (CV *cv) 293put_padlist (CV *cv)
195{ 294{
196 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1); 295 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
197 296
198 if (SvTYPE (*he) != SVt_PVAV) 297 if (!mg)
199 { 298 {
200 SvREFCNT_dec (*he); 299 sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0);
300 mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
301 mg->mg_virtual = &vtbl_coro;
201 *he = (SV *)newAV (); 302 mg->mg_obj = (SV *)newAV ();
202 } 303 }
203 304
204 av_push ((AV *)*he, (SV *)CvPADLIST (cv)); 305 av_push ((AV *)mg->mg_obj, (SV *)CvPADLIST (cv));
205} 306}
206
207#ifdef MAY_FLUSH
208STATIC void
209flush_padlist_cache ()
210{
211 HV *hv = padlist_cache;
212 padlist_cache = newHV ();
213
214 if (hv_iterinit (hv))
215 {
216 HE *he;
217 AV *padlist;
218
219 while (!!(he = hv_iternext (hv)))
220 {
221 AV *av = (AV *)HeVAL(he);
222
223 /* casting is fun. */
224 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
225 free_padlist (padlist);
226 }
227 }
228
229 SvREFCNT_dec (hv);
230}
231#endif
232 307
233#define SB do { 308#define SB do {
234#define SE } while (0) 309#define SE } while (0)
235 310
236#define LOAD(state) SB load_state(aTHX_ state); SPAGAIN; SE 311#define LOAD(state) load_state(aTHX_ (state));
237#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ state,flags); SE 312#define SAVE(state,flags) save_state(aTHX_ (state),(flags));
238 313
239#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE 314#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE
240 315
241static void 316static void
242load_state(pTHX_ Coro__State c) 317load_state(pTHX_ Coro__State c)
243{ 318{
244 PL_dowarn = c->dowarn; 319 PL_dowarn = c->dowarn;
320 PL_in_eval = c->in_eval;
245 321
246 PL_curstackinfo = c->curstackinfo; 322 PL_curstackinfo = c->curstackinfo;
247 PL_curstack = c->curstack; 323 PL_curstack = c->curstack;
248 PL_mainstack = c->mainstack; 324 PL_mainstack = c->mainstack;
249 PL_stack_sp = c->stack_sp; 325 PL_stack_sp = c->stack_sp;
250 PL_op = c->op; 326 PL_op = c->op;
251 PL_curpad = c->curpad; 327 PL_curpad = c->curpad;
328 PL_comppad = c->comppad;
252 PL_stack_base = c->stack_base; 329 PL_stack_base = c->stack_base;
253 PL_stack_max = c->stack_max; 330 PL_stack_max = c->stack_max;
254 PL_tmps_stack = c->tmps_stack; 331 PL_tmps_stack = c->tmps_stack;
255 PL_tmps_floor = c->tmps_floor; 332 PL_tmps_floor = c->tmps_floor;
256 PL_tmps_ix = c->tmps_ix; 333 PL_tmps_ix = c->tmps_ix;
266 PL_savestack_max = c->savestack_max; 343 PL_savestack_max = c->savestack_max;
267 PL_retstack = c->retstack; 344 PL_retstack = c->retstack;
268 PL_retstack_ix = c->retstack_ix; 345 PL_retstack_ix = c->retstack_ix;
269 PL_retstack_max = c->retstack_max; 346 PL_retstack_max = c->retstack_max;
270 PL_curcop = c->curcop; 347 PL_curcop = c->curcop;
348 PL_top_env = c->top_env;
271 349
272 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); 350 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
273 if (c->defsv) REPLACE_SV (DEFSV , c->defsv); 351 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
274 if (c->errsv) REPLACE_SV (ERRSV , c->errsv); 352 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
275 353
284 362
285 if (padlist) 363 if (padlist)
286 { 364 {
287 put_padlist (cv); /* mark this padlist as available */ 365 put_padlist (cv); /* mark this padlist as available */
288 CvPADLIST(cv) = padlist; 366 CvPADLIST(cv) = padlist;
289#ifdef USE_THREADS
290 /*CvOWNER(cv) = (struct perl_thread *)POPs;*/
291#endif
292 } 367 }
293 368
294 ++CvDEPTH(cv); 369 ++CvDEPTH(cv);
295 } 370 }
296 371
314 389
315 PUSHs (Nullsv); 390 PUSHs (Nullsv);
316 /* this loop was inspired by pp_caller */ 391 /* this loop was inspired by pp_caller */
317 for (;;) 392 for (;;)
318 { 393 {
319 do 394 while (cxix >= 0)
320 { 395 {
321 PERL_CONTEXT *cx = &ccstk[cxix--]; 396 PERL_CONTEXT *cx = &ccstk[cxix--];
322 397
323 if (CxTYPE(cx) == CXt_SUB) 398 if (CxTYPE(cx) == CXt_SUB)
324 { 399 {
325 CV *cv = cx->blk_sub.cv; 400 CV *cv = cx->blk_sub.cv;
326 if (CvDEPTH(cv)) 401 if (CvDEPTH(cv))
327 { 402 {
328#ifdef USE_THREADS
329 /*XPUSHs ((SV *)CvOWNER(cv));*/
330 /*CvOWNER(cv) = 0;*/
331 /*error must unlock this cv etc.. etc...*/
332#endif
333 EXTEND (SP, CvDEPTH(cv)*2); 403 EXTEND (SP, CvDEPTH(cv)*2);
334 404
335 while (--CvDEPTH(cv)) 405 while (--CvDEPTH(cv))
336 { 406 {
337 /* this tells the restore code to increment CvDEPTH */ 407 /* this tells the restore code to increment CvDEPTH */
343 PUSHs ((SV *)cv); 413 PUSHs ((SV *)cv);
344 414
345 get_padlist (cv); /* this is a monster */ 415 get_padlist (cv); /* this is a monster */
346 } 416 }
347 } 417 }
418#ifdef CXt_FORMAT
348 else if (CxTYPE(cx) == CXt_FORMAT) 419 else if (CxTYPE(cx) == CXt_FORMAT)
349 { 420 {
350 /* I never used formats, so how should I know how these are implemented? */ 421 /* I never used formats, so how should I know how these are implemented? */
351 /* my bold guess is as a simple, plain sub... */ 422 /* my bold guess is as a simple, plain sub... */
352 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); 423 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
353 } 424 }
425#endif
354 } 426 }
355 while (cxix >= 0);
356 427
357 if (top_si->si_type == PERLSI_MAIN) 428 if (top_si->si_type == PERLSI_MAIN)
358 break; 429 break;
359 430
360 top_si = top_si->si_prev; 431 top_si = top_si->si_prev;
363 } 434 }
364 435
365 PUTBACK; 436 PUTBACK;
366 } 437 }
367 438
368 c->defav = flags & SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; 439 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
369 c->defsv = flags & SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; 440 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
370 c->errsv = flags & SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; 441 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
371
372 /* I have not the slightest idea of why av_reify is necessary */
373 /* but if it's missing the defav contents magically get replaced sometimes */
374 if (c->defav)
375 av_reify (c->defav);
376 442
377 c->dowarn = PL_dowarn; 443 c->dowarn = PL_dowarn;
444 c->in_eval = PL_in_eval;
378 445
379 c->curstackinfo = PL_curstackinfo; 446 c->curstackinfo = PL_curstackinfo;
380 c->curstack = PL_curstack; 447 c->curstack = PL_curstack;
381 c->mainstack = PL_mainstack; 448 c->mainstack = PL_mainstack;
382 c->stack_sp = PL_stack_sp; 449 c->stack_sp = PL_stack_sp;
383 c->op = PL_op; 450 c->op = PL_op;
384 c->curpad = PL_curpad; 451 c->curpad = PL_curpad;
452 c->comppad = PL_comppad;
385 c->stack_base = PL_stack_base; 453 c->stack_base = PL_stack_base;
386 c->stack_max = PL_stack_max; 454 c->stack_max = PL_stack_max;
387 c->tmps_stack = PL_tmps_stack; 455 c->tmps_stack = PL_tmps_stack;
388 c->tmps_floor = PL_tmps_floor; 456 c->tmps_floor = PL_tmps_floor;
389 c->tmps_ix = PL_tmps_ix; 457 c->tmps_ix = PL_tmps_ix;
399 c->savestack_max = PL_savestack_max; 467 c->savestack_max = PL_savestack_max;
400 c->retstack = PL_retstack; 468 c->retstack = PL_retstack;
401 c->retstack_ix = PL_retstack_ix; 469 c->retstack_ix = PL_retstack_ix;
402 c->retstack_max = PL_retstack_max; 470 c->retstack_max = PL_retstack_max;
403 c->curcop = PL_curcop; 471 c->curcop = PL_curcop;
472 c->top_env = PL_top_env;
473}
474
475/*
476 * allocate various perl stacks. This is an exact copy
477 * of perl.c:init_stacks, except that it uses less memory
478 * on the (sometimes correct) assumption that coroutines do
479 * not usually need a lot of stackspace.
480 */
481STATIC void
482coro_init_stacks (pTHX)
483{
484 LOCK;
485
486 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
487 PL_curstackinfo->si_type = PERLSI_MAIN;
488 PL_curstack = PL_curstackinfo->si_stack;
489 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
490
491 PL_stack_base = AvARRAY(PL_curstack);
492 PL_stack_sp = PL_stack_base;
493 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
494
495 New(50,PL_tmps_stack,96,SV*);
496 PL_tmps_floor = -1;
497 PL_tmps_ix = -1;
498 PL_tmps_max = 96;
499
500 New(54,PL_markstack,16,I32);
501 PL_markstack_ptr = PL_markstack;
502 PL_markstack_max = PL_markstack + 16;
503
504#ifdef SET_MARK_OFFSET
505 SET_MARK_OFFSET;
506#endif
507
508 New(54,PL_scopestack,16,I32);
509 PL_scopestack_ix = 0;
510 PL_scopestack_max = 16;
511
512 New(54,PL_savestack,96,ANY);
513 PL_savestack_ix = 0;
514 PL_savestack_max = 96;
515
516 New(54,PL_retstack,8,OP*);
517 PL_retstack_ix = 0;
518 PL_retstack_max = 8;
519
520 UNLOCK;
404} 521}
405 522
406/* 523/*
407 * destroy the stacks, the callchain etc... 524 * destroy the stacks, the callchain etc...
408 * still there is a memleak of 128 bytes...
409 */ 525 */
410STATIC void 526STATIC void
411destroy_stacks(pTHX) 527destroy_stacks(pTHX)
412{ 528{
529 if (!IN_DESTRUCT)
530 {
413 /* is this ugly, I ask? */ 531 /* is this ugly, I ask? */
414 while (PL_scopestack_ix) 532 LEAVE_SCOPE (0);
415 LEAVE;
416 533
417 /* sure it is, but more important: is it correct?? :/ */ 534 /* sure it is, but more important: is it correct?? :/ */
418 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
419 FREETMPS; 535 FREETMPS;
536 }
420 537
421 while (PL_curstackinfo->si_next) 538 while (PL_curstackinfo->si_next)
422 PL_curstackinfo = PL_curstackinfo->si_next; 539 PL_curstackinfo = PL_curstackinfo->si_next;
423 540
424 while (PL_curstackinfo) 541 while (PL_curstackinfo)
429 dSP; 546 dSP;
430 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); 547 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
431 PUTBACK; /* possibly superfluous */ 548 PUTBACK; /* possibly superfluous */
432 } 549 }
433 550
551 if (!IN_DESTRUCT)
552 {
434 dounwind(-1); 553 dounwind(-1);
435
436 SvREFCNT_dec(PL_curstackinfo->si_stack); 554 SvREFCNT_dec(PL_curstackinfo->si_stack);
555 }
556
437 Safefree(PL_curstackinfo->si_cxstack); 557 Safefree(PL_curstackinfo->si_cxstack);
438 Safefree(PL_curstackinfo); 558 Safefree(PL_curstackinfo);
439 PL_curstackinfo = p; 559 PL_curstackinfo = p;
440 } 560 }
441 561
444 Safefree(PL_scopestack); 564 Safefree(PL_scopestack);
445 Safefree(PL_savestack); 565 Safefree(PL_savestack);
446 Safefree(PL_retstack); 566 Safefree(PL_retstack);
447} 567}
448 568
569static void
570allocate_stack (Coro__State ctx, int alloc)
571{
572 coro_stack *stack;
573
574 New (0, stack, 1, coro_stack);
575
576 stack->refcnt = 1;
577 stack->usecnt = 1;
578 stack->gencnt = ctx->gencnt = 0;
579
580 if (alloc)
581 {
582#if HAVE_MMAP
583 stack->ssize = 16384 * sizeof (long); /* mmap should do allocate-on-write for us */
584 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
585 if (stack->sptr == (void *)-1)
586#endif
587 {
588 /*FIXME*//*D*//* reasonable stack size! */
589 stack->ssize = - (8192 * sizeof (long));
590 New (0, stack->sptr, 8192, long);
591 }
592 }
593 else
594 stack->sptr = 0;
595
596 ctx->stack = stack;
597}
598
599static void
600deallocate_stack (Coro__State ctx)
601{
602 coro_stack *stack = ctx->stack;
603
604 ctx->stack = 0;
605
606 if (stack)
607 {
608 if (!--stack->refcnt)
609 {
610#ifdef HAVE_MMAP
611 if (stack->ssize > 0 && stack->sptr)
612 munmap (stack->sptr, stack->ssize);
613 else
614#endif
615 Safefree (stack->sptr);
616
617 Safefree (stack);
618 }
619 else if (ctx->gencnt == stack->gencnt)
620 --stack->usecnt;
621 }
622}
623
624static void
625setup_coro (void *arg)
626{
627 /*
628 * emulate part of the perl startup here.
629 */
630 dSP;
631 Coro__State ctx = (Coro__State)arg;
632 SV *sub_init = (SV *)get_cv (SUB_INIT, FALSE);
633
634 coro_init_stacks (aTHX);
635 /*PL_curcop = 0;*/
636 /*PL_in_eval = PL_in_eval;*/ /* inherit */
637 SvREFCNT_dec (GvAV (PL_defgv));
638 GvAV (PL_defgv) = ctx->args; ctx->args = 0;
639
640 SPAGAIN;
641
642 if (ctx->stack)
643 {
644 ctx->cursp = 0;
645
646 PUSHMARK(SP);
647 PUTBACK;
648 (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL);
649
650 if (SvTRUE (ERRSV))
651 croak (NULL);
652 else
653 croak ("FATAL: CCTXT coroutine returned!");
654 }
655 else
656 {
657 UNOP myop;
658
659 PL_op = (OP *)&myop;
660
661 Zero(&myop, 1, UNOP);
662 myop.op_next = Nullop;
663 myop.op_flags = OPf_WANT_VOID;
664
665 PUSHMARK(SP);
666 XPUSHs (sub_init);
667 /*
668 * the next line is slightly wrong, as PL_op->op_next
669 * is actually being executed so we skip the first op.
670 * that doesn't matter, though, since it is only
671 * pp_nextstate and we never return...
672 * ah yes, and I don't care anyways ;)
673 */
674 PUTBACK;
675 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
676 SPAGAIN;
677
678 ENTER; /* necessary e.g. for dounwind */
679 }
680}
681
682static void
683continue_coro (void *arg)
684{
685 /*
686 * this is a _very_ stripped down perl interpreter ;)
687 */
688 Coro__State ctx = (Coro__State)arg;
689 JMPENV coro_start_env;
690
691 PL_top_env = &ctx->start_env;
692
693 ctx->cursp = 0;
694 PL_op = PL_op->op_next;
695 CALLRUNOPS(aTHX);
696
697 abort ();
698}
699
449STATIC void 700STATIC void
450transfer(pTHX_ struct coro *prev, struct coro *next, int flags) 701transfer (pTHX_ struct coro *prev, struct coro *next, int flags)
451{ 702{
452 dSP; 703 dSTACKLEVEL;
453 704
454 if (prev != next) 705 if (prev != next)
455 { 706 {
456 /*
457 * this could be done in newprocess which would lead to
458 * extremely elegant and fast (just SAVE/LOAD)
459 * code here, but lazy allocation of stacks has also
460 * some virtues and the overhead of the if() is nil.
461 */
462 if (next->mainstack) 707 if (next->mainstack)
463 { 708 {
709 LOCK;
464 SAVE (prev, flags); 710 SAVE (prev, flags);
465 LOAD (next); 711 LOAD (next);
712 UNLOCK;
713
466 /* mark this state as in-use */ 714 /* mark this state as in-use */
467 next->mainstack = 0; 715 next->mainstack = 0;
468 next->tmps_ix = -2; 716 next->tmps_ix = -2;
717
718 /* stacklevel changed? if yes, grab the stack for us! */
719 if (flags & TRANSFER_SAVE_CCTXT)
720 {
721 if (!prev->stack)
722 allocate_stack (prev, 0);
723 else if (prev->cursp != stacklevel
724 && prev->stack->usecnt > 1)
725 {
726 prev->gencnt = ++prev->stack->gencnt;
727 prev->stack->usecnt = 1;
728 }
729
730 /* has our stack been invalidated? */
731 if (next->stack && next->stack->gencnt != next->gencnt)
732 {
733 deallocate_stack (next);
734 allocate_stack (next, 1);
735 coro_create (&(next->stack->cctx),
736 continue_coro, (void *)next,
737 next->stack->sptr, labs (next->stack->ssize));
738 }
739
740 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
741 prev->cursp = stacklevel;
742 /* don't add any code here */
743 }
744 else
745 next->cursp = stacklevel;
469 } 746 }
470 else if (next->tmps_ix == -2) 747 else if (next->tmps_ix == -2)
471 {
472 croak ("tried to transfer to running coroutine"); 748 croak ("tried to transfer to running coroutine");
473 }
474 else 749 else
475 { 750 {
476 /* 751 LOCK;
477 * emulate part of the perl startup here.
478 */
479 UNOP myop;
480
481 SAVE (prev, -1); /* first get rid of the old state */ 752 SAVE (prev, -1); /* first get rid of the old state */
753 UNLOCK;
482 754
483 init_stacks (); /* from perl.c */ 755 if (flags & TRANSFER_SAVE_CCTXT)
484 SPAGAIN;
485
486 PL_op = (OP *)&myop;
487 /*PL_curcop = 0;*/
488 SvREFCNT_dec (GvAV (PL_defgv));
489 GvAV (PL_defgv) = next->args;
490
491 Zero(&myop, 1, UNOP);
492 myop.op_next = Nullop;
493 myop.op_flags = OPf_WANT_VOID;
494
495 PUSHMARK(SP);
496 XPUSHs ((SV*)get_cv(SUB_INIT, TRUE));
497 /*
498 * the next line is slightly wrong, as PL_op->op_next
499 * is actually being executed so we skip the first op.
500 * that doesn't matter, though, since it is only
501 * pp_nextstate and we never return...
502 * ah yes, and I don't care anyways ;)
503 */ 756 {
504 PUTBACK; 757 if (!prev->stack)
505 PL_op = pp_entersub(aTHX); 758 allocate_stack (prev, 0);
506 SPAGAIN;
507 759
508 ENTER; /* necessary e.g. for dounwind */ 760 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
761 {
762 PL_top_env = &next->start_env;
763
764 setup_coro (next);
765 next->cursp = stacklevel;
766
767 prev->stack->refcnt++;
768 prev->stack->usecnt++;
769 next->stack = prev->stack;
770 next->gencnt = prev->gencnt;
771 }
772 else
773 {
774 assert (!next->stack);
775 allocate_stack (next, 1);
776 coro_create (&(next->stack->cctx),
777 setup_coro, (void *)next,
778 next->stack->sptr, labs (next->stack->ssize));
779 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
780 prev->cursp = stacklevel;
781 /* don't add any code here */
782 }
783 }
784 else
785 {
786 setup_coro (next);
787 next->cursp = stacklevel;
788 }
509 } 789 }
510 } 790 }
791
792 LOCK;
793 if (coro_mortal)
794 {
795 SvREFCNT_dec (coro_mortal);
796 coro_mortal = 0;
797 }
798 UNLOCK;
799}
800
801#define SV_CORO(sv,func) \
802 do { \
803 if (SvROK (sv)) \
804 sv = SvRV (sv); \
805 \
806 if (SvTYPE (sv) == SVt_PVHV) \
807 { \
808 HE *he = hv_fetch_ent ((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \
809 \
810 if (!he) \
811 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \
812 \
813 (sv) = SvRV (HeVAL(he)); \
814 } \
815 \
816 /* must also be changed inside Coro::Cont::yield */ \
817 if (!SvOBJECT (sv) || SvSTASH (sv) != coro_state_stash) \
818 croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \
819 \
820 } while(0)
821
822#define SvSTATE(sv) (struct coro *)SvIV (sv)
823
824static void
825api_transfer(pTHX_ SV *prev, SV *next, int flags)
826{
827 SV_CORO (prev, "Coro::transfer");
828 SV_CORO (next, "Coro::transfer");
829
830 transfer(aTHX_ SvSTATE(prev), SvSTATE(next), flags);
831}
832
833/** Coro ********************************************************************/
834
835#define PRIO_MAX 3
836#define PRIO_HIGH 1
837#define PRIO_NORMAL 0
838#define PRIO_LOW -1
839#define PRIO_IDLE -3
840#define PRIO_MIN -4
841
842/* for Coro.pm */
843static GV *coro_current, *coro_idle;
844static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];
845static int coro_nready;
846
847static void
848coro_enq (SV *sv)
849{
850 if (SvTYPE (sv) == SVt_PVHV)
851 {
852 SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0);
853 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
854
855 prio = prio > PRIO_MAX ? PRIO_MAX
856 : prio < PRIO_MIN ? PRIO_MIN
857 : prio;
858
859 av_push (coro_ready [prio - PRIO_MIN], sv);
860 coro_nready++;
861
862 return;
863 }
864
865 croak ("Coro::ready tried to enqueue something that is not a coroutine");
866}
867
868static SV *
869coro_deq (int min_prio)
870{
871 int prio = PRIO_MAX - PRIO_MIN;
872
873 min_prio -= PRIO_MIN;
874 if (min_prio < 0)
875 min_prio = 0;
876
877 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
878 if (av_len (coro_ready[prio]) >= 0)
879 {
880 coro_nready--;
881 return av_shift (coro_ready[prio]);
882 }
883
884 return 0;
885}
886
887static void
888api_ready (SV *coro)
889{
890 if (SvROK (coro))
891 coro = SvRV (coro);
892
893 LOCK;
894 coro_enq (SvREFCNT_inc (coro));
895 UNLOCK;
896}
897
898static void
899api_schedule (void)
900{
901 SV *prev, *next;
902
903 LOCK;
904
905 prev = SvRV (GvSV (coro_current));
906 next = coro_deq (PRIO_MIN);
907
908 if (!next)
909 next = SvREFCNT_inc (SvRV (GvSV (coro_idle)));
910
911 /* free this only after the transfer */
912 coro_mortal = prev;
913 SV_CORO (prev, "Coro::schedule");
914
915 SvRV (GvSV (coro_current)) = next;
916
917 SV_CORO (next, "Coro::schedule");
918
919 UNLOCK;
920
921 transfer (aTHX_ SvSTATE (prev), SvSTATE (next),
922 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);
923}
924
925static void
926api_cede (void)
927{
928 LOCK;
929 coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current))));
930 UNLOCK;
931
932 api_schedule ();
511} 933}
512 934
513MODULE = Coro::State PACKAGE = Coro::State 935MODULE = Coro::State PACKAGE = Coro::State
514 936
515PROTOTYPES: ENABLE 937PROTOTYPES: ENABLE
516 938
517BOOT: 939BOOT:
518{ /* {} necessary for stoopid perl-5.6.x */ 940{ /* {} necessary for stoopid perl-5.6.x */
941#ifdef USE_ITHREADS
942 MUTEX_INIT (&coro_mutex);
943#endif
944
945 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);
946 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);
519 HV * stash = gv_stashpvn("Coro::State", 10, TRUE); 947 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
520 948
521 newCONSTSUB (stash, "SAVE_DEFAV", newSViv (SAVE_DEFAV)); 949 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
522 newCONSTSUB (stash, "SAVE_DEFSV", newSViv (SAVE_DEFSV)); 950 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
523 newCONSTSUB (stash, "SAVE_ERRSV", newSViv (SAVE_ERRSV)); 951 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
952 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));
524 953
525 if (!padlist_cache) 954 main_mainstack = PL_mainstack;
526 padlist_cache = newHV (); 955
956 coroapi.ver = CORO_API_VERSION;
957 coroapi.transfer = api_transfer;
527} 958}
528 959
529Coro::State 960Coro::State
530_newprocess(args) 961_newprocess(args)
531 SV * args 962 SV * args
534 Coro__State coro; 965 Coro__State coro;
535 966
536 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) 967 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
537 croak ("Coro::State::_newprocess expects an arrayref"); 968 croak ("Coro::State::_newprocess expects an arrayref");
538 969
539 New (0, coro, 1, struct coro); 970 Newz (0, coro, 1, struct coro);
540 971
972 coro->args = (AV *)SvREFCNT_inc (SvRV (args));
541 coro->mainstack = 0; /* actual work is done inside transfer */ 973 coro->mainstack = 0; /* actual work is done inside transfer */
542 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 974 coro->stack = 0;
975
976 /* same as JMPENV_BOOTSTRAP */
977 /* we might be able to recycle start_env, but safe is safe */
978 //Zero(&coro->start_env, 1, JMPENV);
979 coro->start_env.je_ret = -1;
980 coro->start_env.je_mustcatch = TRUE;
543 981
544 RETVAL = coro; 982 RETVAL = coro;
545 OUTPUT: 983 OUTPUT:
546 RETVAL 984 RETVAL
547 985
548void 986void
549transfer(prev, next, flags = SAVE_ALL) 987transfer(prev, next, flags)
550 Coro::State_or_hashref prev 988 SV *prev
551 Coro::State_or_hashref next 989 SV *next
552 int flags 990 int flags
553 PROTOTYPE: @ 991 PROTOTYPE: @
554 CODE: 992 CODE:
555 993 PUTBACK;
994 SV_CORO (next, "Coro::transfer");
995 SV_CORO (prev, "Coro::transfer");
556 transfer (aTHX_ prev, next, flags); 996 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
997 SPAGAIN;
557 998
558void 999void
559DESTROY(coro) 1000DESTROY(coro)
560 Coro::State coro 1001 Coro::State coro
561 CODE: 1002 CODE:
562 1003
563 if (coro->mainstack) 1004 if (coro->mainstack && coro->mainstack != main_mainstack)
564 { 1005 {
565 struct coro temp; 1006 struct coro temp;
566 1007
1008 PUTBACK;
567 SAVE(aTHX_ (&temp), SAVE_ALL); 1009 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);
568 LOAD(aTHX_ coro); 1010 LOAD(aTHX_ coro);
1011 SPAGAIN;
569 1012
570 destroy_stacks (); 1013 destroy_stacks (aTHX);
571 1014
572 LOAD((&temp)); /* this will get rid of defsv etc.. */ 1015 LOAD((&temp)); /* this will get rid of defsv etc.. */
1016 SPAGAIN;
1017
1018 coro->mainstack = 0;
573 } 1019 }
574 1020
1021 deallocate_stack (coro);
1022 SvREFCNT_dec (coro->args);
575 Safefree (coro); 1023 Safefree (coro);
576 1024
577void 1025void
578flush() 1026_exit(code)
1027 int code
1028 PROTOTYPE: $
579 CODE: 1029 CODE:
580#ifdef MAY_FLUSH 1030 _exit (code);
581 flush_padlist_cache ();
582#endif
583 1031
584MODULE = Coro::State PACKAGE = Coro::Cont 1032MODULE = Coro::State PACKAGE = Coro::Cont
585 1033
586# this is dirty (do you hear me?) and should be in it's own .xs 1034# this is slightly dirty (should expose a c-level api)
587 1035
588void 1036void
589result(...) 1037yield(...)
590 PROTOTYPE: @ 1038 PROTOTYPE: @
591 CODE: 1039 CODE:
592 static SV *returnstk; 1040 static SV *returnstk;
593 SV *sv; 1041 SV *sv;
594 AV *defav = GvAV (PL_defgv); 1042 AV *defav = GvAV (PL_defgv);
595 struct coro *prev, *next; 1043 struct coro *prev, *next;
596 1044
597 if (!returnstk) 1045 if (!returnstk)
598 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE)); 1046 returnstk = SvRV ((SV *)get_sv ("Coro::Cont::return", FALSE));
599 1047
600 /* set up @_ -- ugly */ 1048 /* set up @_ -- ugly */
601 av_clear (defav); 1049 av_clear (defav);
602 av_fill (defav, items - 1); 1050 av_fill (defav, items - 1);
603 while (items--) 1051 while (items--)
606 mg_get (returnstk); /* isn't documentation wrong for mg_get? */ 1054 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
607 sv = av_pop ((AV *)SvRV (returnstk)); 1055 sv = av_pop ((AV *)SvRV (returnstk));
608 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0))); 1056 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
609 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))); 1057 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
610 SvREFCNT_dec (sv); 1058 SvREFCNT_dec (sv);
1059
611 transfer(prev, next, 0); 1060 transfer(aTHX_ prev, next, 0);
612 1061
1062MODULE = Coro::State PACKAGE = Coro
1063
1064# this is slightly dirty (should expose a c-level api)
1065
1066BOOT:
1067{
1068 int i;
1069 HV *stash = gv_stashpv ("Coro", TRUE);
1070
1071 newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX));
1072 newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1073 newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1074 newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW));
1075 newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1076 newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN));
1077
1078 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1079 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1080
1081 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1082 coro_ready[i] = newAV ();
1083
1084 {
1085 SV *sv = perl_get_sv("Coro::API", 1);
1086
1087 coroapi.schedule = api_schedule;
1088 coroapi.cede = api_cede;
1089 coroapi.ready = api_ready;
1090 coroapi.nready = &coro_nready;
1091 coroapi.current = coro_current;
1092
1093 GCoroAPI = &coroapi;
1094 sv_setiv(sv, (IV)&coroapi);
1095 SvREADONLY_on(sv);
1096 }
1097}
1098
1099#if !PERL_MICRO
1100
1101void
1102ready(self)
1103 SV * self
1104 PROTOTYPE: $
1105 CODE:
1106 api_ready (self);
1107
1108#endif
1109
1110int
1111nready(...)
1112 PROTOTYPE:
1113 CODE:
1114 RETVAL = coro_nready;
1115 OUTPUT:
1116 RETVAL
1117
1118void
1119schedule(...)
1120 PROTOTYPE:
1121 CODE:
1122 api_schedule ();
1123
1124void
1125cede(...)
1126 PROTOTYPE:
1127 CODE:
1128 api_cede ();
1129

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines