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

Diff Legend

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