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

Diff Legend

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