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

Diff Legend

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