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.51 by pcg, Sun Nov 30 17:03:48 2003 UTC vs.
Revision 1.95 by root, Sun Nov 26 17:35:42 2006 UTC

1#define PERL_NO_GET_CONTEXT
2
3#include "libcoro/coro.c"
4
1#include "EXTERN.h" 5#include "EXTERN.h"
2#include "perl.h" 6#include "perl.h"
3#include "XSUB.h" 7#include "XSUB.h"
4 8
5#include "patchlevel.h" 9#include "patchlevel.h"
6 10
7#if PATCHLEVEL < 6 11#if PERL_VERSION < 6
8# ifndef PL_ppaddr 12# ifndef PL_ppaddr
9# define PL_ppaddr ppaddr 13# define PL_ppaddr ppaddr
10# endif 14# endif
11# ifndef call_sv 15# ifndef call_sv
12# define call_sv perl_call_sv 16# define call_sv perl_call_sv
23# ifndef IS_PADCONST 27# ifndef IS_PADCONST
24# define IS_PADCONST(v) 0 28# define IS_PADCONST(v) 0
25# endif 29# endif
26#endif 30#endif
27 31
28#include "libcoro/coro.c"
29
30#include <signal.h> 32#include <stdio.h>
33#include <errno.h>
34
35#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64
36# undef STACKGUARD
37#endif
38
39#ifndef STACKGUARD
40# define STACKGUARD 0
41#endif
31 42
32#ifdef HAVE_MMAP 43#ifdef HAVE_MMAP
33# include <unistd.h> 44# include <unistd.h>
34# include <sys/mman.h> 45# include <sys/mman.h>
35# ifndef MAP_ANONYMOUS 46# ifndef MAP_ANONYMOUS
37# define MAP_ANONYMOUS MAP_ANON 48# define MAP_ANONYMOUS MAP_ANON
38# else 49# else
39# undef HAVE_MMAP 50# undef HAVE_MMAP
40# endif 51# endif
41# endif 52# endif
53# include <limits.h>
54# ifndef PAGESIZE
55# define PAGESIZE pagesize
56# define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE)
57static long pagesize;
58# else
59# define BOOT_PAGESIZE
42#endif 60# endif
43 61#endif
44#define SUB_INIT "Coro::State::initialize"
45#define UCORO_STATE "_coro_state"
46 62
47/* The next macro should declare a variable stacklevel that contains and approximation 63/* 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 64 * to the current C stack pointer. Its property is that it changes with each call
49 * and should be unique. */ 65 * and should be unique. */
66#define dSTACKLEVEL int stacklevel
50#define dSTACKLEVEL void *stacklevel = &stacklevel 67#define STACKLEVEL ((void *)&stacklevel)
51 68
52#define IN_DESTRUCT (PL_main_cv == Nullcv) 69#define IN_DESTRUCT (PL_main_cv == Nullcv)
53 70
54#define labs(l) ((l) >= 0 ? (l) : -(l))
55
56#include "CoroAPI.h" 71#include "CoroAPI.h"
57 72
73#define TRANSFER_SET_STACKLEVEL 0x8bfbfbfb /* magic cookie */
74
75#ifdef USE_ITHREADS
76static perl_mutex coro_mutex;
77# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0)
78# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0)
79#else
80# define LOCK (void)0
81# define UNLOCK (void)0
82#endif
83
58static struct CoroAPI coroapi; 84static struct CoroAPI coroapi;
85static AV *main_mainstack; /* used to differentiate between $main and others */
86static HV *coro_state_stash, *coro_stash;
87static SV *coro_mortal; /* will be freed after next transfer */
59 88
60/* this is actually not only the c stack but also c registers etc... */ 89/* this is a structure representing a c-level coroutine */
61typedef struct { 90typedef struct coro_stack {
62 int refcnt; /* pointer reference counter */ 91 struct coro_stack *next;
63 int usecnt; /* shared by how many coroutines */
64 int gencnt; /* generation counter */
65 92
66 coro_context cctx; 93 /* the stack */
67
68 void *sptr; 94 void *sptr;
69 long ssize; /* positive == mmap, otherwise malloc */ 95 long ssize; /* positive == mmap, otherwise malloc */
96
97 /* cpu state */
98 void *idle_sp; /* original stacklevel when coroutine was created */
99 JMPENV *top_env;
100 coro_context cctx;
70} coro_stack; 101} coro_stack;
71 102
103/* this is a structure representing a perl-level coroutine */
72struct coro { 104struct coro {
73 /* the top-level JMPENV for each coroutine, needed to catch dies. */ 105 /* the c coroutine allocated to this perl coroutine, if any */
74 JMPENV start_env;
75
76 /* the optional C context */
77 coro_stack *stack; 106 coro_stack *stack;
78 void *cursp; 107
108 /* data associated with this coroutine (initial args) */
109 AV *args;
79 int gencnt; 110 int refcnt;
80 111
81 /* optionally saved, might be zero */ 112 /* optionally saved, might be zero */
82 AV *defav; 113 AV *defav;
83 SV *defsv; 114 SV *defsv;
84 SV *errsv; 115 SV *errsv;
93 AV *mainstack; 124 AV *mainstack;
94 SV **stack_sp; 125 SV **stack_sp;
95 OP *op; 126 OP *op;
96 SV **curpad; 127 SV **curpad;
97 AV *comppad; 128 AV *comppad;
129 CV *compcv;
98 SV **stack_base; 130 SV **stack_base;
99 SV **stack_max; 131 SV **stack_max;
100 SV **tmps_stack; 132 SV **tmps_stack;
101 I32 tmps_floor; 133 I32 tmps_floor;
102 I32 tmps_ix; 134 I32 tmps_ix;
111 I32 savestack_ix; 143 I32 savestack_ix;
112 I32 savestack_max; 144 I32 savestack_max;
113 OP **retstack; 145 OP **retstack;
114 I32 retstack_ix; 146 I32 retstack_ix;
115 I32 retstack_max; 147 I32 retstack_max;
148 PMOP *curpm;
116 COP *curcop; 149 COP *curcop;
117 JMPENV *top_env;
118 150
119 /* data associated with this coroutine (initial args) */ 151 /* coro process data */
120 AV *args; 152 int prio;
121}; 153};
122 154
123typedef struct coro *Coro__State; 155typedef struct coro *Coro__State;
124typedef struct coro *Coro__State_or_hashref; 156typedef struct coro *Coro__State_or_hashref;
125 157
126static AV *main_mainstack; /* used to differentiate between $main and others */ 158static AV *
127static HV *coro_state_stash; 159coro_clone_padlist (pTHX_ CV *cv)
128static SV *ucoro_state_sv;
129static U32 ucoro_state_hash;
130static HV *padlist_cache;
131static SV *coro_mortal; /* will be freed after next transfer */
132
133/* mostly copied from op.c:cv_clone2 */
134STATIC AV *
135clone_padlist (AV *protopadlist)
136{ 160{
137 AV *av; 161 AV *padlist = CvPADLIST (cv);
138 I32 ix;
139 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
140 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
141 SV **pname = AvARRAY (protopad_name);
142 SV **ppad = AvARRAY (protopad);
143 I32 fname = AvFILLp (protopad_name);
144 I32 fpad = AvFILLp (protopad);
145 AV *newpadlist, *newpad_name, *newpad; 162 AV *newpadlist, *newpad;
146 SV **npad;
147
148 newpad_name = newAV ();
149 for (ix = fname; ix >= 0; ix--)
150 av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
151
152 newpad = newAV ();
153 av_fill (newpad, AvFILLp (protopad));
154 npad = AvARRAY (newpad);
155 163
156 newpadlist = newAV (); 164 newpadlist = newAV ();
157 AvREAL_off (newpadlist); 165 AvREAL_off (newpadlist);
158 av_store (newpadlist, 0, (SV *) newpad_name); 166#if PERL_VERSION < 9
167 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1);
168#else
169 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1);
170#endif
171 newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)];
172 --AvFILLp (padlist);
173
174 av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE)));
159 av_store (newpadlist, 1, (SV *) newpad); 175 av_store (newpadlist, 1, (SV *)newpad);
160
161 av = newAV (); /* will be @_ */
162 av_extend (av, 0);
163 av_store (newpad, 0, (SV *) av);
164 AvFLAGS (av) = AVf_REIFY;
165
166 for (ix = fpad; ix > 0; ix--)
167 {
168 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;
169 if (namesv && namesv != &PL_sv_undef)
170 {
171 char *name = SvPVX (namesv); /* XXX */
172 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&')
173 { /* lexical from outside? */
174 npad[ix] = SvREFCNT_inc (ppad[ix]);
175 }
176 else
177 { /* our own lexical */
178 SV *sv;
179 if (*name == '&')
180 sv = SvREFCNT_inc (ppad[ix]);
181 else if (*name == '@')
182 sv = (SV *) newAV ();
183 else if (*name == '%')
184 sv = (SV *) newHV ();
185 else
186 sv = NEWSV (0, 0);
187#ifdef SvPADBUSY
188 if (!SvPADBUSY (sv))
189#endif
190 SvPADMY_on (sv);
191 npad[ix] = sv;
192 }
193 }
194 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))
195 {
196 npad[ix] = SvREFCNT_inc (ppad[ix]);
197 }
198 else
199 {
200 SV *sv = NEWSV (0, 0);
201 SvPADTMP_on (sv);
202 npad[ix] = sv;
203 }
204 }
205
206#if 0 /* return -ENOTUNDERSTOOD */
207 /* Now that vars are all in place, clone nested closures. */
208
209 for (ix = fpad; ix > 0; ix--) {
210 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
211 if (namesv
212 && namesv != &PL_sv_undef
213 && !(SvFLAGS(namesv) & SVf_FAKE)
214 && *SvPVX(namesv) == '&'
215 && CvCLONE(ppad[ix]))
216 {
217 CV *kid = cv_clone((CV*)ppad[ix]);
218 SvREFCNT_dec(ppad[ix]);
219 CvCLONE_on(kid);
220 SvPADMY_on(kid);
221 npad[ix] = (SV*)kid;
222 }
223 }
224#endif
225 176
226 return newpadlist; 177 return newpadlist;
227} 178}
228 179
229STATIC void 180static void
230free_padlist (AV *padlist) 181free_padlist (pTHX_ AV *padlist)
231{ 182{
232 /* may be during global destruction */ 183 /* may be during global destruction */
233 if (SvREFCNT (padlist)) 184 if (SvREFCNT (padlist))
234 { 185 {
235 I32 i = AvFILLp (padlist); 186 I32 i = AvFILLp (padlist);
248 199
249 SvREFCNT_dec ((SV*)padlist); 200 SvREFCNT_dec ((SV*)padlist);
250 } 201 }
251} 202}
252 203
253STATIC int 204static int
254coro_cv_free (SV *sv, MAGIC *mg) 205coro_cv_free (pTHX_ SV *sv, MAGIC *mg)
255{ 206{
256 AV *padlist; 207 AV *padlist;
257 AV *av = (AV *)mg->mg_obj; 208 AV *av = (AV *)mg->mg_obj;
258 209
259 /* casting is fun. */ 210 /* casting is fun. */
260 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) 211 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
261 free_padlist (padlist); 212 free_padlist (aTHX_ padlist);
213
214 SvREFCNT_dec (av);
215
216 return 0;
262} 217}
263 218
264#define PERL_MAGIC_coro PERL_MAGIC_ext 219#define PERL_MAGIC_coro PERL_MAGIC_ext
265 220
266static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; 221static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
267 222
268/* the next two functions merely cache the padlists */ 223/* the next two functions merely cache the padlists */
269STATIC void 224static void
270get_padlist (CV *cv) 225get_padlist (pTHX_ CV *cv)
271{ 226{
272 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); 227 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
273 228
274 if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0) 229 if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0)
275 CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj); 230 CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj);
276 else 231 else
232 {
233#if 0
234 /* this should work - but it doesn't :( */
235 CV *cp = Perl_cv_clone (aTHX_ cv);
236 CvPADLIST (cv) = CvPADLIST (cp);
237 CvPADLIST (cp) = 0;
238 SvREFCNT_dec (cp);
239#else
277 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv)); 240 CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv);
241#endif
242 }
278} 243}
279 244
280STATIC void 245static void
281put_padlist (CV *cv) 246put_padlist (pTHX_ CV *cv)
282{ 247{
283 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); 248 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
284 249
285 if (!mg) 250 if (!mg)
286 { 251 {
312 PL_mainstack = c->mainstack; 277 PL_mainstack = c->mainstack;
313 PL_stack_sp = c->stack_sp; 278 PL_stack_sp = c->stack_sp;
314 PL_op = c->op; 279 PL_op = c->op;
315 PL_curpad = c->curpad; 280 PL_curpad = c->curpad;
316 PL_comppad = c->comppad; 281 PL_comppad = c->comppad;
282 PL_compcv = c->compcv;
317 PL_stack_base = c->stack_base; 283 PL_stack_base = c->stack_base;
318 PL_stack_max = c->stack_max; 284 PL_stack_max = c->stack_max;
319 PL_tmps_stack = c->tmps_stack; 285 PL_tmps_stack = c->tmps_stack;
320 PL_tmps_floor = c->tmps_floor; 286 PL_tmps_floor = c->tmps_floor;
321 PL_tmps_ix = c->tmps_ix; 287 PL_tmps_ix = c->tmps_ix;
327 PL_scopestack_ix = c->scopestack_ix; 293 PL_scopestack_ix = c->scopestack_ix;
328 PL_scopestack_max = c->scopestack_max; 294 PL_scopestack_max = c->scopestack_max;
329 PL_savestack = c->savestack; 295 PL_savestack = c->savestack;
330 PL_savestack_ix = c->savestack_ix; 296 PL_savestack_ix = c->savestack_ix;
331 PL_savestack_max = c->savestack_max; 297 PL_savestack_max = c->savestack_max;
298#if PERL_VERSION < 9
332 PL_retstack = c->retstack; 299 PL_retstack = c->retstack;
333 PL_retstack_ix = c->retstack_ix; 300 PL_retstack_ix = c->retstack_ix;
334 PL_retstack_max = c->retstack_max; 301 PL_retstack_max = c->retstack_max;
302#endif
303 PL_curpm = c->curpm;
335 PL_curcop = c->curcop; 304 PL_curcop = c->curcop;
336 PL_top_env = c->top_env;
337 305
338 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); 306 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
339 if (c->defsv) REPLACE_SV (DEFSV , c->defsv); 307 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
340 if (c->errsv) REPLACE_SV (ERRSV , c->errsv); 308 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
341 309
348 { 316 {
349 AV *padlist = (AV *)POPs; 317 AV *padlist = (AV *)POPs;
350 318
351 if (padlist) 319 if (padlist)
352 { 320 {
353 put_padlist (cv); /* mark this padlist as available */ 321 put_padlist (aTHX_ cv); /* mark this padlist as available */
354 CvPADLIST(cv) = padlist; 322 CvPADLIST(cv) = padlist;
355#ifdef USE_THREADS
356 /*CvOWNER(cv) = (struct perl_thread *)POPs;*/
357#endif
358 } 323 }
359 324
360 ++CvDEPTH(cv); 325 ++CvDEPTH(cv);
361 } 326 }
362 327
389 if (CxTYPE(cx) == CXt_SUB) 354 if (CxTYPE(cx) == CXt_SUB)
390 { 355 {
391 CV *cv = cx->blk_sub.cv; 356 CV *cv = cx->blk_sub.cv;
392 if (CvDEPTH(cv)) 357 if (CvDEPTH(cv))
393 { 358 {
394#ifdef USE_THREADS
395 /*XPUSHs ((SV *)CvOWNER(cv));*/
396 /*CvOWNER(cv) = 0;*/
397 /*error must unlock this cv etc.. etc...*/
398#endif
399 EXTEND (SP, CvDEPTH(cv)*2); 359 EXTEND (SP, CvDEPTH(cv)*2);
400 360
401 while (--CvDEPTH(cv)) 361 while (--CvDEPTH(cv))
402 { 362 {
403 /* this tells the restore code to increment CvDEPTH */ 363 /* this tells the restore code to increment CvDEPTH */
406 } 366 }
407 367
408 PUSHs ((SV *)CvPADLIST(cv)); 368 PUSHs ((SV *)CvPADLIST(cv));
409 PUSHs ((SV *)cv); 369 PUSHs ((SV *)cv);
410 370
411 get_padlist (cv); /* this is a monster */ 371 get_padlist (aTHX_ cv);
412 } 372 }
413 } 373 }
414#ifdef CXt_FORMAT 374#ifdef CXt_FORMAT
415 else if (CxTYPE(cx) == CXt_FORMAT) 375 else if (CxTYPE(cx) == CXt_FORMAT)
416 { 376 {
444 c->mainstack = PL_mainstack; 404 c->mainstack = PL_mainstack;
445 c->stack_sp = PL_stack_sp; 405 c->stack_sp = PL_stack_sp;
446 c->op = PL_op; 406 c->op = PL_op;
447 c->curpad = PL_curpad; 407 c->curpad = PL_curpad;
448 c->comppad = PL_comppad; 408 c->comppad = PL_comppad;
409 c->compcv = PL_compcv;
449 c->stack_base = PL_stack_base; 410 c->stack_base = PL_stack_base;
450 c->stack_max = PL_stack_max; 411 c->stack_max = PL_stack_max;
451 c->tmps_stack = PL_tmps_stack; 412 c->tmps_stack = PL_tmps_stack;
452 c->tmps_floor = PL_tmps_floor; 413 c->tmps_floor = PL_tmps_floor;
453 c->tmps_ix = PL_tmps_ix; 414 c->tmps_ix = PL_tmps_ix;
459 c->scopestack_ix = PL_scopestack_ix; 420 c->scopestack_ix = PL_scopestack_ix;
460 c->scopestack_max = PL_scopestack_max; 421 c->scopestack_max = PL_scopestack_max;
461 c->savestack = PL_savestack; 422 c->savestack = PL_savestack;
462 c->savestack_ix = PL_savestack_ix; 423 c->savestack_ix = PL_savestack_ix;
463 c->savestack_max = PL_savestack_max; 424 c->savestack_max = PL_savestack_max;
425#if PERL_VERSION < 9
464 c->retstack = PL_retstack; 426 c->retstack = PL_retstack;
465 c->retstack_ix = PL_retstack_ix; 427 c->retstack_ix = PL_retstack_ix;
466 c->retstack_max = PL_retstack_max; 428 c->retstack_max = PL_retstack_max;
429#endif
430 c->curpm = PL_curpm;
467 c->curcop = PL_curcop; 431 c->curcop = PL_curcop;
468 c->top_env = PL_top_env;
469} 432}
470 433
471/* 434/*
472 * allocate various perl stacks. This is an exact copy 435 * allocate various perl stacks. This is an exact copy
473 * of perl.c:init_stacks, except that it uses less memory 436 * of perl.c:init_stacks, except that it uses less memory
474 * on the assumption that coroutines do not usually need 437 * on the (sometimes correct) assumption that coroutines do
475 * a lot of stackspace. 438 * not usually need a lot of stackspace.
476 */ 439 */
477STATIC void 440static void
478coro_init_stacks (pTHX) 441coro_init_stacks (pTHX)
479{ 442{
443 LOCK;
444
480 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 445 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
481 PL_curstackinfo->si_type = PERLSI_MAIN; 446 PL_curstackinfo->si_type = PERLSI_MAIN;
482 PL_curstack = PL_curstackinfo->si_stack; 447 PL_curstack = PL_curstackinfo->si_stack;
483 PL_mainstack = PL_curstack; /* remember in case we switch stacks */ 448 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
484 449
505 470
506 New(54,PL_savestack,96,ANY); 471 New(54,PL_savestack,96,ANY);
507 PL_savestack_ix = 0; 472 PL_savestack_ix = 0;
508 PL_savestack_max = 96; 473 PL_savestack_max = 96;
509 474
475#if PERL_VERSION < 9
510 New(54,PL_retstack,8,OP*); 476 New(54,PL_retstack,8,OP*);
511 PL_retstack_ix = 0; 477 PL_retstack_ix = 0;
512 PL_retstack_max = 8; 478 PL_retstack_max = 8;
479#endif
480
481 UNLOCK;
513} 482}
514 483
515/* 484/*
516 * destroy the stacks, the callchain etc... 485 * destroy the stacks, the callchain etc...
517 */ 486 */
518STATIC void 487static void
519destroy_stacks(pTHX) 488destroy_stacks(pTHX)
520{ 489{
521 if (!IN_DESTRUCT) 490 if (!IN_DESTRUCT)
522 { 491 {
523 /* is this ugly, I ask? */ 492 /* is this ugly, I ask? */
524 while (PL_scopestack_ix) 493 LEAVE_SCOPE (0);
525 LEAVE;
526 494
527 /* sure it is, but more important: is it correct?? :/ */ 495 /* sure it is, but more important: is it correct?? :/ */
528 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
529 FREETMPS; 496 FREETMPS;
497
498 /*POPSTACK_TO (PL_mainstack);*//*D*//*use*/
530 } 499 }
531 500
532 while (PL_curstackinfo->si_next) 501 while (PL_curstackinfo->si_next)
533 PL_curstackinfo = PL_curstackinfo->si_next; 502 PL_curstackinfo = PL_curstackinfo->si_next;
534 503
535 while (PL_curstackinfo) 504 while (PL_curstackinfo)
536 { 505 {
537 PERL_SI *p = PL_curstackinfo->si_prev; 506 PERL_SI *p = PL_curstackinfo->si_prev;
538 507
539 { 508 { /*D*//*remove*/
540 dSP; 509 dSP;
541 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); 510 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
542 PUTBACK; /* possibly superfluous */ 511 PUTBACK; /* possibly superfluous */
543 } 512 }
544 513
545 if (!IN_DESTRUCT) 514 if (!IN_DESTRUCT)
546 { 515 {
547 dounwind(-1); 516 dounwind (-1);/*D*//*remove*/
548 SvREFCNT_dec(PL_curstackinfo->si_stack); 517 SvREFCNT_dec (PL_curstackinfo->si_stack);
549 } 518 }
550 519
551 Safefree(PL_curstackinfo->si_cxstack); 520 Safefree (PL_curstackinfo->si_cxstack);
552 Safefree(PL_curstackinfo); 521 Safefree (PL_curstackinfo);
553 PL_curstackinfo = p; 522 PL_curstackinfo = p;
554 } 523 }
555 524
556 Safefree(PL_tmps_stack); 525 Safefree (PL_tmps_stack);
557 Safefree(PL_markstack); 526 Safefree (PL_markstack);
558 Safefree(PL_scopestack); 527 Safefree (PL_scopestack);
559 Safefree(PL_savestack); 528 Safefree (PL_savestack);
529#if PERL_VERSION < 9
560 Safefree(PL_retstack); 530 Safefree (PL_retstack);
561}
562
563static void
564allocate_stack (Coro__State ctx, int alloc)
565{
566 coro_stack *stack;
567
568 New (0, stack, 1, coro_stack);
569
570 stack->refcnt = 1;
571 stack->usecnt = 1;
572 stack->gencnt = ctx->gencnt = 0;
573 if (alloc)
574 {
575#if HAVE_MMAP
576 stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */
577 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
578 if (stack->sptr == (void *)-1)
579#endif 531#endif
580 {
581 /*FIXME*//*D*//* reasonable stack size! */
582 stack->ssize = - (16384 * sizeof (long));
583 New (0, stack->sptr, 16384, long);
584 }
585 }
586 else
587 stack->sptr = 0;
588
589 ctx->stack = stack;
590} 532}
591 533
592static void 534static void
593deallocate_stack (Coro__State ctx) 535setup_coro (struct coro *coro)
594{
595 coro_stack *stack = ctx->stack;
596
597 ctx->stack = 0;
598
599 if (stack)
600 {
601 if (!--stack->refcnt)
602 {
603#ifdef HAVE_MMAP
604 if (stack->ssize > 0 && stack->sptr)
605 munmap (stack->sptr, stack->ssize);
606 else
607#endif
608 Safefree (stack->sptr);
609
610 Safefree (stack);
611 }
612 else if (ctx->gencnt == stack->gencnt)
613 --stack->usecnt;
614 }
615}
616
617static void
618setup_coro (void *arg)
619{ 536{
620 /* 537 /*
621 * emulate part of the perl startup here. 538 * emulate part of the perl startup here.
622 */ 539 */
540 dTHX;
623 dSP; 541 dSP;
624 Coro__State ctx = (Coro__State)arg; 542 UNOP myop;
625 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE); 543 SV *sub_init = (SV *)get_cv ("Coro::State::coro_init", FALSE);
626 544
627 coro_init_stacks (aTHX); 545 coro_init_stacks (aTHX);
628 /*PL_curcop = 0;*/ 546 /*PL_curcop = 0;*/
629 /*PL_in_eval = PL_in_eval;*/ /* inherit */ 547 /*PL_in_eval = PL_in_eval;*/ /* inherit */
630 SvREFCNT_dec (GvAV (PL_defgv)); 548 SvREFCNT_dec (GvAV (PL_defgv));
631 GvAV (PL_defgv) = ctx->args; ctx->args = 0; 549 GvAV (PL_defgv) = coro->args; coro->args = 0;
632 550
633 SPAGAIN; 551 SPAGAIN;
634 552
635 if (ctx->stack)
636 {
637 ctx->cursp = 0;
638
639 PUSHMARK(SP);
640 PUTBACK;
641 (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL);
642
643 if (SvTRUE (ERRSV))
644 croak (NULL);
645 else
646 croak ("FATAL: CCTXT coroutine returned!");
647 }
648 else
649 {
650 UNOP myop;
651
652 PL_op = (OP *)&myop;
653
654 Zero(&myop, 1, UNOP); 553 Zero (&myop, 1, UNOP);
655 myop.op_next = Nullop; 554 myop.op_next = Nullop;
656 myop.op_flags = OPf_WANT_VOID; 555 myop.op_flags = OPf_WANT_VOID;
657 556
557 PL_op = (OP *)&myop;
558
658 PUSHMARK(SP); 559 PUSHMARK(SP);
659 XPUSHs (sub_init); 560 XPUSHs (sub_init);
660 /*
661 * the next line is slightly wrong, as PL_op->op_next
662 * is actually being executed so we skip the first op.
663 * that doesn't matter, though, since it is only
664 * pp_nextstate and we never return...
665 * ah yes, and I don't care anyways ;)
666 */
667 PUTBACK; 561 PUTBACK;
668 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); 562 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
669 SPAGAIN; 563 SPAGAIN;
670 564
671 ENTER; /* necessary e.g. for dounwind */ 565 ENTER; /* necessary e.g. for dounwind */
672 }
673} 566}
674 567
675static void 568static void
676continue_coro (void *arg) 569free_coro_mortal ()
677{ 570{
678 /*
679 * this is a _very_ stripped down perl interpreter ;)
680 */
681 Coro__State ctx = (Coro__State)arg;
682 JMPENV coro_start_env;
683
684 PL_top_env = &ctx->start_env;
685
686 ctx->cursp = 0;
687 PL_op = PL_op->op_next;
688 CALLRUNOPS(aTHX);
689
690 abort ();
691}
692
693STATIC void
694transfer(pTHX_ struct coro *prev, struct coro *next, int flags)
695{
696 dSTACKLEVEL;
697 static struct coro *xnext;
698
699 if (prev != next)
700 {
701 xnext = next;
702
703 if (next->mainstack)
704 {
705 SAVE (prev, flags);
706 LOAD (next);
707
708 /* mark this state as in-use */
709 next->mainstack = 0;
710 next->tmps_ix = -2;
711
712 /* stacklevel changed? if yes, grab the stack for us! */
713 if (flags & TRANSFER_SAVE_CCTXT)
714 {
715 if (!prev->stack)
716 allocate_stack (prev, 0);
717 else if (prev->cursp != stacklevel
718 && prev->stack->usecnt > 1)
719 {
720 prev->gencnt = ++prev->stack->gencnt;
721 prev->stack->usecnt = 1;
722 }
723
724 /* has our stack been invalidated? */
725 if (next->stack && next->stack->gencnt != next->gencnt)
726 {
727 deallocate_stack (next);
728 allocate_stack (next, 1);
729 coro_create (&(next->stack->cctx),
730 continue_coro, (void *)next,
731 next->stack->sptr, labs (next->stack->ssize));
732 }
733
734 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
735 /* don't add any code here */
736 }
737
738 }
739 else if (next->tmps_ix == -2)
740 croak ("tried to transfer to running coroutine");
741 else
742 {
743 SAVE (prev, -1); /* first get rid of the old state */
744
745 if (flags & TRANSFER_SAVE_CCTXT)
746 {
747 if (!prev->stack)
748 allocate_stack (prev, 0);
749
750 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
751 {
752 PL_top_env = &next->start_env;
753
754 setup_coro (next);
755
756 prev->stack->refcnt++;
757 prev->stack->usecnt++;
758 next->stack = prev->stack;
759 next->gencnt = prev->gencnt;
760 }
761 else
762 {
763 assert (!next->stack);
764 allocate_stack (next, 1);
765 coro_create (&(next->stack->cctx),
766 setup_coro, (void *)next,
767 next->stack->sptr, labs (next->stack->ssize));
768 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
769 /* don't add any code here */
770 }
771 }
772 else
773 setup_coro (next);
774 }
775
776 /*
777 * xnext is now either prev or next, depending on wether
778 * we switched the c stack or not. that's why I use a global
779 * variable, that should become thread-specific at one point.
780 */
781 xnext->cursp = stacklevel;
782 }
783
784 if (coro_mortal) 571 if (coro_mortal)
785 { 572 {
786 SvREFCNT_dec (coro_mortal); 573 SvREFCNT_dec (coro_mortal);
787 coro_mortal = 0; 574 coro_mortal = 0;
788 } 575 }
789} 576}
790 577
791#define SV_CORO(sv,func) \ 578static void
792 do { \ 579coro_run (void *arg)
793 if (SvROK (sv)) \ 580{
794 sv = SvRV (sv); \ 581 /*
795 \ 582 * this is a _very_ stripped down perl interpreter ;)
796 if (SvTYPE(sv) == SVt_PVHV) \ 583 */
797 { \ 584 dTHX;
798 HE *he = hv_fetch_ent((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \ 585 int ret;
799 \
800 if (!he) \
801 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \
802 \
803 (sv) = SvRV (HeVAL(he)); \
804 } \
805 \
806 /* must also be changed inside Coro::Cont::yield */ \
807 if (!SvOBJECT(sv) || SvSTASH(sv) != coro_state_stash) \
808 croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \
809 \
810 } while(0)
811 586
812#define SvSTATE(sv) (struct coro *)SvIV (sv) 587 UNLOCK;
813 588
589 PL_top_env = &PL_start_env;
590
591 sv_setiv (get_sv ("Coro::State::cctx_stack", FALSE), PTR2IV ((coro_stack *)arg));
592 sv_setiv (get_sv ("Coro::State::cctx_restartop", FALSE), PTR2IV (PL_op));
593
594 /* continue at cctx_init, without entersub */
595 PL_restartop = CvSTART (get_cv ("Coro::State::cctx_init", FALSE));
596
597 /* somebody will hit me for both perl_run and PL_restartop */
598 ret = perl_run (aTHX_ PERL_GET_CONTEXT);
599 printf ("ret %d\n", ret);//D
600
601 fputs ("FATAL: C coroutine fell over the edge of the world, aborting.\n", stderr);
602 abort ();
603}
604
605static coro_stack *
606stack_new ()
607{
608 coro_stack *stack;
609
610 New (0, stack, 1, coro_stack);
611
612#if HAVE_MMAP
613
614 stack->ssize = ((STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + STACKGUARD) * PAGESIZE;
615 /* mmap suppsedly does allocate-on-write for us */
616 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
617
618 if (stack->sptr == (void *)-1)
619 {
620 perror ("FATAL: unable to mmap stack for coroutine");
621 _exit (EXIT_FAILURE);
622 }
623
624# if STACKGUARD
625 mprotect (stack->sptr, STACKGUARD * PAGESIZE, PROT_NONE);
626# endif
627
628#else
629
630 stack->ssize = STACKSIZE * (long)sizeof (long);
631 New (0, stack->sptr, STACKSIZE, long);
632
633 if (!stack->sptr)
634 {
635 perror (stderr, "FATAL: unable to malloc stack for coroutine");
636 _exit (EXIT_FAILURE);
637 }
638
639#endif
640
641 coro_create (&stack->cctx, coro_run, (void *)stack, stack->sptr, stack->ssize);
642
643 return stack;
644}
645
646static void
647stack_free (coro_stack *stack)
648{
649 if (!stack)
650 return;
651
652#if HAVE_MMAP
653 munmap (stack->sptr, stack->ssize);
654#else
655 Safefree (stack->sptr);
656#endif
657
658 Safefree (stack);
659}
660
661static coro_stack *stack_first;
662
663static coro_stack *
664stack_get ()
665{
666 coro_stack *stack;
667
668 if (stack_first)
669 {
670 stack = stack_first;
671 stack_first = stack->next;
672 }
673 else
674 {
675 stack = stack_new ();
676 PL_op = PL_op->op_next;
677 }
678
679 return stack;
680}
681
682static void
683stack_put (coro_stack *stack)
684{
685 stack->next = stack_first;
686 stack_first = stack;
687}
688
689/* never call directly, always through the coro_state_transfer global variable */
690static void
691transfer_impl (pTHX_ struct coro *prev, struct coro *next, int flags)
692{
693 dSTACKLEVEL;
694
695 /* sometimes transfer is only called to set idle_sp */
696 if (flags == TRANSFER_SET_STACKLEVEL)
697 ((coro_stack *)prev)->idle_sp = STACKLEVEL;
698 else if (prev != next)
699 {
700 coro_stack *prev__stack;
701
702 LOCK;
703
704 if (next->mainstack)
705 {
706 /* coroutine already started */
707 SAVE (prev, flags);
708 LOAD (next);
709 }
710 else
711 {
712 /* need to start coroutine */
713 /* first get rid of the old state */
714 SAVE (prev, -1);
715 /* setup coroutine call */
716 setup_coro (next);
717 /* need a stack */
718 next->stack = 0;
719 }
720
721 if (!prev->stack)
722 /* create a new empty context */
723 Newz (0, prev->stack, 1, coro_stack);
724
725 prev__stack = prev->stack;
726
727 /* possibly "free" the stack */
728 if (prev__stack->idle_sp == STACKLEVEL)
729 {
730 stack_put (prev__stack);
731 prev->stack = 0;
732 }
733
734 if (!next->stack)
735 next->stack = stack_get ();
736
737 if (prev__stack != next->stack)
738 {
739 prev__stack->top_env = PL_top_env;
740 PL_top_env = next->stack->top_env;
741 coro_transfer (&prev__stack->cctx, &next->stack->cctx);
742 }
743
744 free_coro_mortal ();
745
746 UNLOCK;
747 }
748}
749
750/* use this function pointer to call the above function */
751/* this is done to increase chances of the compiler not inlining the call */
752/* not static to make it even harder for the compiler (and theoretically impossible in most cases */
753void (*coro_state_transfer)(pTHX_ struct coro *prev, struct coro *next, int flags) = transfer_impl;
754
755struct transfer_args
756{
757 struct coro *prev, *next;
758 int flags;
759};
760
761#define TRANSFER(ta) coro_state_transfer ((ta).prev, (ta).next, (ta).flags)
762
763static void
764coro_state_destroy (struct coro *coro)
765{
766 if (coro->refcnt--)
767 return;
768
769 if (coro->mainstack && coro->mainstack != main_mainstack)
770 {
771 struct coro temp;
772
773 SAVE (aTHX_ (&temp), TRANSFER_SAVE_ALL);
774 LOAD (aTHX_ coro);
775
776 destroy_stacks (aTHX);
777
778 LOAD ((&temp)); /* this will get rid of defsv etc.. */
779
780 coro->mainstack = 0;
781 }
782
783 stack_free (coro->stack);
784 SvREFCNT_dec (coro->args);
785 Safefree (coro);
786}
787
814static void 788static int
789coro_state_clear (SV *sv, MAGIC *mg)
790{
791 struct coro *coro = (struct coro *)mg->mg_ptr;
792 mg->mg_ptr = 0;
793
794 coro_state_destroy (coro);
795
796 return 0;
797}
798
799static int
800coro_state_dup (MAGIC *mg, CLONE_PARAMS *params)
801{
802 struct coro *coro = (struct coro *)mg->mg_ptr;
803
804 ++coro->refcnt;
805
806 return 0;
807}
808
809static MGVTBL coro_state_vtbl = { 0, 0, 0, 0, coro_state_clear, 0, coro_state_dup, 0 };
810
811static struct coro *
812SvSTATE (SV *coro)
813{
814 HV *stash;
815 MAGIC *mg;
816
817 if (SvROK (coro))
818 coro = SvRV (coro);
819
820 stash = SvSTASH (coro);
821 if (stash != coro_stash && stash != coro_state_stash)
822 {
823 /* very slow, but rare, check */
824 if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
825 croak ("Coro::State object required");
826 }
827
828 mg = SvMAGIC (coro);
829 assert (mg->mg_type == PERL_MAGIC_ext);
830 return (struct coro *)mg->mg_ptr;
831}
832
833static void
834prepare_transfer (pTHX_ struct transfer_args *ta, SV *prev, SV *next, int flags)
835{
836 ta->prev = SvSTATE (prev);
837 ta->next = SvSTATE (next);
838 ta->flags = flags;
839}
840
841static void
815api_transfer(pTHX_ SV *prev, SV *next, int flags) 842api_transfer (SV *prev, SV *next, int flags)
816{ 843{
817 SV_CORO (prev, "Coro::transfer"); 844 dTHX;
818 SV_CORO (next, "Coro::transfer"); 845 struct transfer_args ta;
819 846
820 transfer(aTHX_ SvSTATE(prev), SvSTATE(next), flags); 847 prepare_transfer (aTHX_ &ta, prev, next, flags);
848 TRANSFER (ta);
821} 849}
822 850
823/** Coro ********************************************************************/ 851/** Coro ********************************************************************/
824 852
825#define PRIO_MAX 3 853#define PRIO_MAX 3
829#define PRIO_IDLE -3 857#define PRIO_IDLE -3
830#define PRIO_MIN -4 858#define PRIO_MIN -4
831 859
832/* for Coro.pm */ 860/* for Coro.pm */
833static GV *coro_current, *coro_idle; 861static GV *coro_current, *coro_idle;
834static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; 862static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
835static int coro_nready; 863static int coro_nready;
836 864
837static void 865static void
838coro_enq (SV *sv) 866coro_enq (pTHX_ SV *sv)
839{ 867{
868 int prio;
869
840 if (SvTYPE (sv) == SVt_PVHV) 870 if (SvTYPE (sv) != SVt_PVHV)
841 {
842 SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0);
843 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
844
845 prio = prio > PRIO_MAX ? PRIO_MAX
846 : prio < PRIO_MIN ? PRIO_MIN
847 : prio;
848
849 av_push (coro_ready [prio - PRIO_MIN], sv);
850 coro_nready++;
851
852 return;
853 }
854
855 croak ("Coro::ready tried to enqueue something that is not a coroutine"); 871 croak ("Coro::ready tried to enqueue something that is not a coroutine");
872
873 prio = SvSTATE (sv)->prio;
874
875 av_push (coro_ready [prio - PRIO_MIN], sv);
876 coro_nready++;
856} 877}
857 878
858static SV * 879static SV *
859coro_deq (int min_prio) 880coro_deq (pTHX_ int min_prio)
860{ 881{
861 int prio = PRIO_MAX - PRIO_MIN; 882 int prio = PRIO_MAX - PRIO_MIN;
862 883
863 min_prio -= PRIO_MIN; 884 min_prio -= PRIO_MIN;
864 if (min_prio < 0) 885 if (min_prio < 0)
865 min_prio = 0; 886 min_prio = 0;
866 887
867 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) 888 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
868 if (av_len (coro_ready[prio]) >= 0) 889 if (AvFILLp (coro_ready [prio]) >= 0)
869 { 890 {
870 coro_nready--; 891 coro_nready--;
871 return av_shift (coro_ready[prio]); 892 return av_shift (coro_ready [prio]);
872 } 893 }
873 894
874 return 0; 895 return 0;
875} 896}
876 897
877static void 898static void
878api_ready (SV *coro) 899api_ready (SV *coro)
879{ 900{
901 dTHX;
902
880 if (SvROK (coro)) 903 if (SvROK (coro))
881 coro = SvRV (coro); 904 coro = SvRV (coro);
882 905
906 LOCK;
883 coro_enq (SvREFCNT_inc (coro)); 907 coro_enq (aTHX_ SvREFCNT_inc (coro));
908 UNLOCK;
909}
910
911static void
912prepare_schedule (aTHX_ struct transfer_args *ta)
913{
914 SV *current, *prev, *next;
915
916 LOCK;
917
918 current = GvSV (coro_current);
919
920 for (;;)
921 {
922 LOCK;
923
924 next = coro_deq (aTHX_ PRIO_MIN);
925
926 if (next)
927 break;
928
929 UNLOCK;
930
931 {
932 dSP;
933
934 ENTER;
935 SAVETMPS;
936
937 PUSHMARK (SP);
938 PUTBACK;
939 call_sv (GvSV (coro_idle), G_DISCARD);
940
941 FREETMPS;
942 LEAVE;
943 }
944 }
945
946 prev = SvRV (current);
947 SvRV (current) = next;
948
949 /* free this only after the transfer */
950 free_coro_mortal ();
951 coro_mortal = prev;
952
953 ta->prev = SvSTATE (prev);
954 ta->next = SvSTATE (next);
955 ta->flags = TRANSFER_SAVE_ALL;
956
957 UNLOCK;
958}
959
960static void
961prepare_cede (aTHX_ struct transfer_args *ta)
962{
963 LOCK;
964 coro_enq (aTHX_ SvREFCNT_inc (SvRV (GvSV (coro_current))));
965 UNLOCK;
966
967 prepare_schedule (ta);
884} 968}
885 969
886static void 970static void
887api_schedule (void) 971api_schedule (void)
888{ 972{
889 SV *prev, *next; 973 dTHX;
974 struct transfer_args ta;
890 975
891 prev = SvRV (GvSV (coro_current)); 976 prepare_schedule (&ta);
892 next = coro_deq (PRIO_MIN); 977 TRANSFER (ta);
893
894 if (!next)
895 next = SvREFCNT_inc (SvRV (GvSV (coro_idle)));
896
897 /* free this only after the transfer */
898 coro_mortal = prev;
899 SV_CORO (prev, "Coro::schedule");
900
901 SvRV (GvSV (coro_current)) = next;
902
903 SV_CORO (next, "Coro::schedule");
904
905 transfer (aTHX_ SvSTATE (prev), SvSTATE (next),
906 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);
907} 978}
908 979
909static void 980static void
910api_cede (void) 981api_cede (void)
911{ 982{
912 coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current)))); 983 dTHX;
984 struct transfer_args ta;
913 985
914 api_schedule (); 986 prepare_cede (&ta);
987 TRANSFER (ta);
915} 988}
916 989
917MODULE = Coro::State PACKAGE = Coro::State 990MODULE = Coro::State PACKAGE = Coro::State
918 991
919PROTOTYPES: ENABLE 992PROTOTYPES: DISABLE
920 993
921BOOT: 994BOOT:
922{ /* {} necessary for stoopid perl-5.6.x */ 995{
923 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); 996#ifdef USE_ITHREADS
924 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); 997 MUTEX_INIT (&coro_mutex);
998#endif
999 BOOT_PAGESIZE;
1000
925 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 1001 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
926 1002
927 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 1003 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
928 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 1004 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
929 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); 1005 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
930 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));
931
932 if (!padlist_cache)
933 padlist_cache = newHV ();
934 1006
935 main_mainstack = PL_mainstack; 1007 main_mainstack = PL_mainstack;
936 1008
937 coroapi.ver = CORO_API_VERSION; 1009 coroapi.ver = CORO_API_VERSION;
938 coroapi.transfer = api_transfer; 1010 coroapi.transfer = api_transfer;
939}
940 1011
941Coro::State 1012 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
942_newprocess(args) 1013}
943 SV * args 1014
944 PROTOTYPE: $ 1015SV *
1016new (char *klass, ...)
945 CODE: 1017 CODE:
946 Coro__State coro; 1018{
1019 struct coro *coro;
1020 HV *hv;
1021 int i;
947 1022
948 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
949 croak ("Coro::State::_newprocess expects an arrayref");
950
951 Newz (0, coro, 1, struct coro); 1023 Newz (0, coro, 1, struct coro);
1024 coro->args = newAV ();
952 1025
953 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 1026 hv = newHV ();
1027 sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP;
1028 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
1029
1030 for (i = 1; i < items; i++)
1031 av_push (coro->args, newSVsv (ST (i)));
1032
954 coro->mainstack = 0; /* actual work is done inside transfer */ 1033 /*coro->mainstack = 0; *//*actual work is done inside transfer */
955 coro->stack = 0; 1034 /*coro->stack = 0;*/
956 1035}
957 /* same as JMPENV_BOOTSTRAP */
958 /* we might be able to recycle start_env, but safe is safe */
959 //Zero(&coro->start_env, 1, JMPENV);
960 coro->start_env.je_ret = -1;
961 coro->start_env.je_mustcatch = TRUE;
962
963 RETVAL = coro;
964 OUTPUT: 1036 OUTPUT:
965 RETVAL 1037 RETVAL
966 1038
967void 1039void
968transfer(prev, next, flags) 1040_set_stacklevel (...)
969 SV *prev 1041 ALIAS:
970 SV *next 1042 Coro::State::transfer = 1
971 int flags 1043 Coro::schedule = 2
972 PROTOTYPE: @ 1044 Coro::cede = 3
1045 Coro::Cont::yield = 4
973 CODE: 1046 CODE:
974 PUTBACK; 1047{
975 SV_CORO (next, "Coro::transfer"); 1048 struct transfer_args ta;
976 SV_CORO (prev, "Coro::transfer"); 1049
977 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); 1050 switch (ix)
978 SPAGAIN; 1051 {
1052 case 0:
1053 ta.prev = (struct coro *)INT2PTR (coro_stack *, SvIV (ST (0)));
1054 ta.next = 0;
1055 ta.flags = TRANSFER_SET_STACKLEVEL;
1056 break;
1057
1058 case 1:
1059 if (items != 3)
1060 croak ("Coro::State::transfer(prev,next,flags) expects three arguments, not %d", items);
1061
1062 prepare_transfer (&ta, ST (0), ST (1), SvIV (ST (2)));
1063 break;
1064
1065 case 2:
1066 prepare_schedule (&ta);
1067 break;
1068
1069 case 3:
1070 prepare_cede (&ta);
1071 break;
1072
1073 case 4:
1074 {
1075 SV *yieldstack;
1076 SV *sv;
1077 AV *defav = GvAV (PL_defgv);
1078
1079 yieldstack = *hv_fetch (
1080 (HV *)SvRV (GvSV (coro_current)),
1081 "yieldstack", sizeof ("yieldstack") - 1,
1082 0
1083 );
1084
1085 /* set up @_ -- ugly */
1086 av_clear (defav);
1087 av_fill (defav, items - 1);
1088 while (items--)
1089 av_store (defav, items, SvREFCNT_inc (ST(items)));
1090
1091 sv = av_pop ((AV *)SvRV (yieldstack));
1092 ta.prev = SvSTATE (*av_fetch ((AV *)SvRV (sv), 0, 0));
1093 ta.next = SvSTATE (*av_fetch ((AV *)SvRV (sv), 1, 0));
1094 ta.flags = 0;
1095 SvREFCNT_dec (sv);
1096 }
1097 break;
1098
1099 }
1100
1101 TRANSFER (ta);
1102}
979 1103
980void 1104void
981DESTROY(coro) 1105_clone_state_from (SV *dst, SV *src)
982 Coro::State coro 1106 CODE:
983 CODE: 1107{
1108 struct coro *coro_src = SvSTATE (src);
984 1109
985 if (coro->mainstack && coro->mainstack != main_mainstack) 1110 sv_unmagic (SvRV (dst), PERL_MAGIC_ext);
986 {
987 struct coro temp;
988 1111
989 PUTBACK; 1112 ++coro_src->refcnt;
990 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); 1113 sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags |= MGf_DUP;
991 LOAD(aTHX_ coro); 1114}
992 SPAGAIN;
993
994 destroy_stacks (aTHX);
995
996 LOAD((&temp)); /* this will get rid of defsv etc.. */
997 SPAGAIN;
998
999 coro->mainstack = 0;
1000 }
1001
1002 deallocate_stack (coro);
1003 SvREFCNT_dec (coro->args);
1004 Safefree (coro);
1005 1115
1006void 1116void
1117_nonlocal_goto (IV nextop)
1118 CODE:
1119 /* uuh, somebody will kill me again for this */
1120 PL_op->op_next = INT2PTR (OP *, nextop);
1121
1122void
1007_exit(code) 1123_exit (code)
1008 int code 1124 int code
1009 PROTOTYPE: $ 1125 PROTOTYPE: $
1010 CODE: 1126 CODE:
1011#if defined(__GLIBC__) || _POSIX_C_SOURCE
1012 _exit (code); 1127 _exit (code);
1013#else
1014 signal (SIGTERM, SIG_DFL);
1015 raise (SIGTERM);
1016 exit (code);
1017#endif
1018
1019MODULE = Coro::State PACKAGE = Coro::Cont
1020
1021# this is slightly dirty (should expose a c-level api)
1022
1023void
1024yield(...)
1025 PROTOTYPE: @
1026 CODE:
1027 static SV *returnstk;
1028 SV *sv;
1029 AV *defav = GvAV (PL_defgv);
1030 struct coro *prev, *next;
1031
1032 if (!returnstk)
1033 returnstk = SvRV ((SV *)get_sv ("Coro::Cont::return", FALSE));
1034
1035 /* set up @_ -- ugly */
1036 av_clear (defav);
1037 av_fill (defav, items - 1);
1038 while (items--)
1039 av_store (defav, items, SvREFCNT_inc (ST(items)));
1040
1041 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
1042 sv = av_pop ((AV *)SvRV (returnstk));
1043 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
1044 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
1045 SvREFCNT_dec (sv);
1046
1047 transfer(aTHX_ prev, next, 0);
1048 1128
1049MODULE = Coro::State PACKAGE = Coro 1129MODULE = Coro::State PACKAGE = Coro
1050 1130
1051# this is slightly dirty (should expose a c-level api)
1052
1053BOOT: 1131BOOT:
1054{ 1132{
1055 int i; 1133 int i;
1134
1056 HV *stash = gv_stashpv ("Coro", TRUE); 1135 coro_stash = gv_stashpv ("Coro", TRUE);
1057 1136
1058 newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); 1137 newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1059 newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); 1138 newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1060 newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); 1139 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1061 newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); 1140 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1062 newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); 1141 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1063 newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); 1142 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1064 1143
1065 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); 1144 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1066 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); 1145 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1067 1146
1068 for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) 1147 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1076 coroapi.ready = api_ready; 1155 coroapi.ready = api_ready;
1077 coroapi.nready = &coro_nready; 1156 coroapi.nready = &coro_nready;
1078 coroapi.current = coro_current; 1157 coroapi.current = coro_current;
1079 1158
1080 GCoroAPI = &coroapi; 1159 GCoroAPI = &coroapi;
1081 sv_setiv(sv, (IV)&coroapi); 1160 sv_setiv (sv, (IV)&coroapi);
1082 SvREADONLY_on(sv); 1161 SvREADONLY_on (sv);
1083 } 1162 }
1084} 1163}
1085 1164
1086#if !PERL_MICRO 1165int
1166prio (Coro::State coro, int newprio = 0)
1167 ALIAS:
1168 nice = 1
1169 CODE:
1170{
1171 RETVAL = coro->prio;
1172
1173 if (items > 1)
1174 {
1175 if (ix)
1176 newprio += coro->prio;
1177
1178 if (newprio < PRIO_MIN) newprio = PRIO_MIN;
1179 if (newprio > PRIO_MAX) newprio = PRIO_MAX;
1180
1181 coro->prio = newprio;
1182 }
1183}
1087 1184
1088void 1185void
1089ready(self) 1186ready (SV *self)
1090 SV * self
1091 PROTOTYPE: $ 1187 PROTOTYPE: $
1092 CODE: 1188 CODE:
1093 api_ready (self); 1189 api_ready (self);
1094 1190
1095#endif
1096
1097int 1191int
1098nready(...) 1192nready (...)
1099 PROTOTYPE: 1193 PROTOTYPE:
1100 CODE: 1194 CODE:
1101 RETVAL = coro_nready; 1195 RETVAL = coro_nready;
1102 OUTPUT: 1196 OUTPUT:
1103 RETVAL 1197 RETVAL
1104 1198
1199MODULE = Coro::State PACKAGE = Coro::AIO
1200
1201SV *
1202_get_state ()
1203 CODE:
1204{
1205 struct {
1206 int errorno;
1207 int laststype;
1208 int laststatval;
1209 Stat_t statcache;
1210 } data;
1211
1212 data.errorno = errno;
1213 data.laststype = PL_laststype;
1214 data.laststatval = PL_laststatval;
1215 data.statcache = PL_statcache;
1216
1217 RETVAL = newSVpvn ((char *)&data, sizeof data);
1218}
1219 OUTPUT:
1220 RETVAL
1221
1105void 1222void
1106schedule(...) 1223_set_state (char *data_)
1107 PROTOTYPE: 1224 PROTOTYPE: $
1108 CODE: 1225 CODE:
1109 api_schedule (); 1226{
1227 struct {
1228 int errorno;
1229 int laststype;
1230 int laststatval;
1231 Stat_t statcache;
1232 } *data = (void *)data_;
1110 1233
1111void 1234 errno = data->errorno;
1112cede(...) 1235 PL_laststype = data->laststype;
1113 PROTOTYPE: 1236 PL_laststatval = data->laststatval;
1114 CODE: 1237 PL_statcache = data->statcache;
1115 api_cede (); 1238}
1116

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines