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

Diff Legend

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