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.12 by root, Sun Jul 22 03:24:10 2001 UTC vs.
Revision 1.56 by pcg, Thu Apr 1 02:41:05 2004 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines