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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines