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.96 by root, Sun Nov 26 18:25: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 <stdio.h>
33#include <errno.h>
34
35#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64
36# undef STACKGUARD
37#endif
38
39#ifndef STACKGUARD
40# define STACKGUARD 0
41#endif
6 42
7#ifdef HAVE_MMAP 43#ifdef HAVE_MMAP
8# include <unistd.h> 44# include <unistd.h>
9# include <sys/mman.h> 45# include <sys/mman.h>
46# ifndef MAP_ANONYMOUS
47# ifdef MAP_ANON
48# define MAP_ANONYMOUS MAP_ANON
49# else
50# undef HAVE_MMAP
51# endif
10#endif 52# endif
53# include <limits.h>
54# ifndef PAGESIZE
55# define PAGESIZE pagesize
56# define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE)
57static long pagesize;
58# else
59# define BOOT_PAGESIZE
60# endif
61#endif
11 62
12#define MAY_FLUSH /* increases codesize */ 63/* The next macro should declare a variable stacklevel that contains and approximation
64 * to the current C stack pointer. Its property is that it changes with each call
65 * and should be unique. */
66#define dSTACKLEVEL int stacklevel
67#define STACKLEVEL ((void *)&stacklevel)
13 68
14#define SUB_INIT "Coro::State::initialize" 69#define IN_DESTRUCT (PL_main_cv == Nullcv)
15 70
16#define TRANSFER_SAVE_DEFAV 0x00000001 71#include "CoroAPI.h"
17#define TRANSFER_SAVE_DEFSV 0x00000002
18#define TRANSFER_SAVE_ERRSV 0x00000004
19#define TRANSFER_SAVE_CCTXT 0x00000008
20 72
21#define TRANSFER_SAVE_ALL -1 73#define TRANSFER_SET_STACKLEVEL 0x8bfbfbfb /* magic cookie */
22 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 a structure representing a c-level coroutine */
90typedef struct coro_stack {
91 struct coro_stack *next;
92
93 /* the stack */
94 void *sptr;
95 long ssize; /* positive == mmap, otherwise malloc */
96
97 /* cpu state */
98 void *idle_sp; /* sp of top-level transfer/schedule/cede call */
99 JMPENV *top_env;
100 coro_context cctx;
101} coro_stack;
102
103/* this is a structure representing a perl-level coroutine */
23struct coro { 104struct coro {
24 /* the optional C context */ 105 /* the c coroutine allocated to this perl coroutine, if any */
25 coro_context cctx; 106 coro_stack *stack;
26 void *sptr; 107
27 long ssize; 108 /* data associated with this coroutine (initial args) */
109 AV *args;
110 int refcnt;
28 111
29 /* optionally saved, might be zero */ 112 /* optionally saved, might be zero */
30 AV *defav; 113 AV *defav;
31 SV *defsv; 114 SV *defsv;
32 SV *errsv; 115 SV *errsv;
33 116
34 /* saved global state not related to stacks */ 117 /* saved global state not related to stacks */
35 U8 dowarn; 118 U8 dowarn;
119 I32 in_eval;
36 120
37 /* the stacks and related info (callchain etc..) */ 121 /* the stacks and related info (callchain etc..) */
38 PERL_SI *curstackinfo; 122 PERL_SI *curstackinfo;
39 AV *curstack; 123 AV *curstack;
40 AV *mainstack; 124 AV *mainstack;
41 SV **stack_sp; 125 SV **stack_sp;
42 OP *op; 126 OP *op;
43 SV **curpad; 127 SV **curpad;
128 AV *comppad;
129 CV *compcv;
44 SV **stack_base; 130 SV **stack_base;
45 SV **stack_max; 131 SV **stack_max;
46 SV **tmps_stack; 132 SV **tmps_stack;
47 I32 tmps_floor; 133 I32 tmps_floor;
48 I32 tmps_ix; 134 I32 tmps_ix;
… …
57 I32 savestack_ix; 143 I32 savestack_ix;
58 I32 savestack_max; 144 I32 savestack_max;
59 OP **retstack; 145 OP **retstack;
60 I32 retstack_ix; 146 I32 retstack_ix;
61 I32 retstack_max; 147 I32 retstack_max;
148 PMOP *curpm;
62 COP *curcop; 149 COP *curcop;
63 JMPENV start_env;
64 JMPENV *top_env;
65 150
66 /* data associated with this coroutine (initial args) */ 151 /* coro process data */
67 AV *args; 152 int prio;
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 is probably cleaner, but also slower? */
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;
284 305
285 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); 306 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
286 if (c->defsv) REPLACE_SV (DEFSV , c->defsv); 307 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
287 if (c->errsv) REPLACE_SV (ERRSV , c->errsv); 308 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
288 309
… …
295 { 316 {
296 AV *padlist = (AV *)POPs; 317 AV *padlist = (AV *)POPs;
297 318
298 if (padlist) 319 if (padlist)
299 { 320 {
300 put_padlist (cv); /* mark this padlist as available */ 321 put_padlist (aTHX_ cv); /* mark this padlist as available */
301 CvPADLIST(cv) = padlist; 322 CvPADLIST(cv) = padlist;
302#ifdef USE_THREADS
303 /*CvOWNER(cv) = (struct perl_thread *)POPs;*/
304#endif
305 } 323 }
306 324
307 ++CvDEPTH(cv); 325 ++CvDEPTH(cv);
308 } 326 }
309 327
… …
327 345
328 PUSHs (Nullsv); 346 PUSHs (Nullsv);
329 /* this loop was inspired by pp_caller */ 347 /* this loop was inspired by pp_caller */
330 for (;;) 348 for (;;)
331 { 349 {
332 do 350 while (cxix >= 0)
333 { 351 {
334 PERL_CONTEXT *cx = &ccstk[cxix--]; 352 PERL_CONTEXT *cx = &ccstk[cxix--];
335 353
336 if (CxTYPE(cx) == CXt_SUB) 354 if (CxTYPE(cx) == CXt_SUB)
337 { 355 {
338 CV *cv = cx->blk_sub.cv; 356 CV *cv = cx->blk_sub.cv;
339 if (CvDEPTH(cv)) 357 if (CvDEPTH(cv))
340 { 358 {
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); 359 EXTEND (SP, CvDEPTH(cv)*2);
347 360
348 while (--CvDEPTH(cv)) 361 while (--CvDEPTH(cv))
349 { 362 {
350 /* this tells the restore code to increment CvDEPTH */ 363 /* this tells the restore code to increment CvDEPTH */
… …
353 } 366 }
354 367
355 PUSHs ((SV *)CvPADLIST(cv)); 368 PUSHs ((SV *)CvPADLIST(cv));
356 PUSHs ((SV *)cv); 369 PUSHs ((SV *)cv);
357 370
358 get_padlist (cv); /* this is a monster */ 371 get_padlist (aTHX_ cv);
359 } 372 }
360 } 373 }
374#ifdef CXt_FORMAT
361 else if (CxTYPE(cx) == CXt_FORMAT) 375 else if (CxTYPE(cx) == CXt_FORMAT)
362 { 376 {
363 /* I never used formats, so how should I know how these are implemented? */ 377 /* I never used formats, so how should I know how these are implemented? */
364 /* my bold guess is as a simple, plain sub... */ 378 /* my bold guess is as a simple, plain sub... */
365 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); 379 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
366 } 380 }
381#endif
367 } 382 }
368 while (cxix >= 0);
369 383
370 if (top_si->si_type == PERLSI_MAIN) 384 if (top_si->si_type == PERLSI_MAIN)
371 break; 385 break;
372 386
373 top_si = top_si->si_prev; 387 top_si = top_si->si_prev;
… …
380 394
381 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; 395 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
382 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; 396 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
383 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; 397 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
384 398
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; 399 c->dowarn = PL_dowarn;
400 c->in_eval = PL_in_eval;
391 401
392 c->curstackinfo = PL_curstackinfo; 402 c->curstackinfo = PL_curstackinfo;
393 c->curstack = PL_curstack; 403 c->curstack = PL_curstack;
394 c->mainstack = PL_mainstack; 404 c->mainstack = PL_mainstack;
395 c->stack_sp = PL_stack_sp; 405 c->stack_sp = PL_stack_sp;
396 c->op = PL_op; 406 c->op = PL_op;
397 c->curpad = PL_curpad; 407 c->curpad = PL_curpad;
408 c->comppad = PL_comppad;
409 c->compcv = PL_compcv;
398 c->stack_base = PL_stack_base; 410 c->stack_base = PL_stack_base;
399 c->stack_max = PL_stack_max; 411 c->stack_max = PL_stack_max;
400 c->tmps_stack = PL_tmps_stack; 412 c->tmps_stack = PL_tmps_stack;
401 c->tmps_floor = PL_tmps_floor; 413 c->tmps_floor = PL_tmps_floor;
402 c->tmps_ix = PL_tmps_ix; 414 c->tmps_ix = PL_tmps_ix;
… …
408 c->scopestack_ix = PL_scopestack_ix; 420 c->scopestack_ix = PL_scopestack_ix;
409 c->scopestack_max = PL_scopestack_max; 421 c->scopestack_max = PL_scopestack_max;
410 c->savestack = PL_savestack; 422 c->savestack = PL_savestack;
411 c->savestack_ix = PL_savestack_ix; 423 c->savestack_ix = PL_savestack_ix;
412 c->savestack_max = PL_savestack_max; 424 c->savestack_max = PL_savestack_max;
425#if PERL_VERSION < 9
413 c->retstack = PL_retstack; 426 c->retstack = PL_retstack;
414 c->retstack_ix = PL_retstack_ix; 427 c->retstack_ix = PL_retstack_ix;
415 c->retstack_max = PL_retstack_max; 428 c->retstack_max = PL_retstack_max;
429#endif
430 c->curpm = PL_curpm;
416 c->curcop = PL_curcop; 431 c->curcop = PL_curcop;
417 c->start_env = PL_start_env;
418 c->top_env = PL_top_env;
419} 432}
420 433
421/* 434/*
422 * allocate various perl stacks. This is an exact copy 435 * allocate various perl stacks. This is an exact copy
423 * of perl.c:init_stacks, except that it uses less memory 436 * of perl.c:init_stacks, except that it uses less memory
424 * on the assumption that coroutines do not usually need 437 * on the (sometimes correct) assumption that coroutines do
425 * a lot of stackspace. 438 * not usually need a lot of stackspace.
426 */ 439 */
427STATIC void 440static void
428coro_init_stacks (pTHX) 441coro_init_stacks (pTHX)
429{ 442{
443 LOCK;
444
430 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 445 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
431 PL_curstackinfo->si_type = PERLSI_MAIN; 446 PL_curstackinfo->si_type = PERLSI_MAIN;
432 PL_curstack = PL_curstackinfo->si_stack; 447 PL_curstack = PL_curstackinfo->si_stack;
433 PL_mainstack = PL_curstack; /* remember in case we switch stacks */ 448 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
434 449
435 PL_stack_base = AvARRAY(PL_curstack); 450 PL_stack_base = AvARRAY(PL_curstack);
436 PL_stack_sp = PL_stack_base; 451 PL_stack_sp = PL_stack_base;
437 PL_stack_max = PL_stack_base + AvMAX(PL_curstack); 452 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
438 453
439 New(50,PL_tmps_stack,64,SV*); 454 New(50,PL_tmps_stack,96,SV*);
440 PL_tmps_floor = -1; 455 PL_tmps_floor = -1;
441 PL_tmps_ix = -1; 456 PL_tmps_ix = -1;
442 PL_tmps_max = 64; 457 PL_tmps_max = 96;
443 458
444 New(54,PL_markstack,12,I32); 459 New(54,PL_markstack,16,I32);
445 PL_markstack_ptr = PL_markstack; 460 PL_markstack_ptr = PL_markstack;
446 PL_markstack_max = PL_markstack + 12; 461 PL_markstack_max = PL_markstack + 16;
447 462
463#ifdef SET_MARK_OFFSET
448 SET_MARK_OFFSET; 464 SET_MARK_OFFSET;
465#endif
449 466
450 New(54,PL_scopestack,12,I32); 467 New(54,PL_scopestack,16,I32);
451 PL_scopestack_ix = 0; 468 PL_scopestack_ix = 0;
452 PL_scopestack_max = 12; 469 PL_scopestack_max = 16;
453 470
454 New(54,PL_savestack,64,ANY); 471 New(54,PL_savestack,96,ANY);
455 PL_savestack_ix = 0; 472 PL_savestack_ix = 0;
456 PL_savestack_max = 64; 473 PL_savestack_max = 96;
457 474
475#if PERL_VERSION < 9
458 New(54,PL_retstack,8,OP*); 476 New(54,PL_retstack,8,OP*);
459 PL_retstack_ix = 0; 477 PL_retstack_ix = 0;
460 PL_retstack_max = 8; 478 PL_retstack_max = 8;
479#endif
480
481 UNLOCK;
461} 482}
462 483
463/* 484/*
464 * destroy the stacks, the callchain etc... 485 * destroy the stacks, the callchain etc...
465 * still there is a memleak of 128 bytes...
466 */ 486 */
467STATIC void 487static void
468destroy_stacks(pTHX) 488destroy_stacks(pTHX)
469{ 489{
490 if (!IN_DESTRUCT)
491 {
470 /* is this ugly, I ask? */ 492 /* is this ugly, I ask? */
471 while (PL_scopestack_ix) 493 LEAVE_SCOPE (0);
472 LEAVE;
473 494
474 /* sure it is, but more important: is it correct?? :/ */ 495 /* 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; 496 FREETMPS;
497
498 /*POPSTACK_TO (PL_mainstack);*//*D*//*use*/
499 }
477 500
478 while (PL_curstackinfo->si_next) 501 while (PL_curstackinfo->si_next)
479 PL_curstackinfo = PL_curstackinfo->si_next; 502 PL_curstackinfo = PL_curstackinfo->si_next;
480 503
481 while (PL_curstackinfo) 504 while (PL_curstackinfo)
482 { 505 {
483 PERL_SI *p = PL_curstackinfo->si_prev; 506 PERL_SI *p = PL_curstackinfo->si_prev;
484 507
485 { 508 { /*D*//*remove*/
486 dSP; 509 dSP;
487 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); 510 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
488 PUTBACK; /* possibly superfluous */ 511 PUTBACK; /* possibly superfluous */
489 } 512 }
490 513
491 dounwind(-1); 514 if (!IN_DESTRUCT)
492 515 {
516 dounwind (-1);/*D*//*remove*/
493 SvREFCNT_dec(PL_curstackinfo->si_stack); 517 SvREFCNT_dec (PL_curstackinfo->si_stack);
518 }
519
494 Safefree(PL_curstackinfo->si_cxstack); 520 Safefree (PL_curstackinfo->si_cxstack);
495 Safefree(PL_curstackinfo); 521 Safefree (PL_curstackinfo);
496 PL_curstackinfo = p; 522 PL_curstackinfo = p;
497 } 523 }
498 524
499 Safefree(PL_tmps_stack); 525 Safefree (PL_tmps_stack);
500 Safefree(PL_markstack); 526 Safefree (PL_markstack);
501 Safefree(PL_scopestack); 527 Safefree (PL_scopestack);
502 Safefree(PL_savestack); 528 Safefree (PL_savestack);
529#if PERL_VERSION < 9
503 Safefree(PL_retstack); 530 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 531#endif
514 {
515 /*FIXME*//*D*//* reasonable stack size! */
516 ctx->ssize = 4096 * sizeof (long);
517 New (0, ctx->sptr, 4096, long);
518 }
519} 532}
520 533
521static void 534static void
522deallocate_stack (Coro__State ctx) 535setup_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{ 536{
535 /* 537 /*
536 * emulate part of the perl startup here. 538 * emulate part of the perl startup here.
537 */ 539 */
540 dTHX;
538 dSP; 541 dSP;
539 Coro__State ctx = (Coro__State)arg; 542 UNOP myop;
540 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE); 543 SV *sub_init = (SV *)get_cv ("Coro::State::coro_init", FALSE);
541 544
542 coro_init_stacks (aTHX); 545 coro_init_stacks (aTHX);
543 JMPENV_BOOTSTRAP; 546 /*PL_curcop = 0;*/
547 /*PL_in_eval = PL_in_eval;*/ /* inherit */
548 SvREFCNT_dec (GvAV (PL_defgv));
549 GvAV (PL_defgv) = coro->args; coro->args = 0;
550
544 SPAGAIN; 551 SPAGAIN;
545 552
546 /*PL_curcop = 0;*/ 553 Zero (&myop, 1, UNOP);
547 SvREFCNT_dec (GvAV (PL_defgv)); 554 myop.op_next = Nullop;
548 GvAV (PL_defgv) = ctx->args; 555 myop.op_flags = OPf_WANT_VOID;
549 556
550 if (ctx->sptr) 557 PL_op = (OP *)&myop;
558
559 PUSHMARK(SP);
560 XPUSHs (sub_init);
561 PUTBACK;
562 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
563 SPAGAIN;
564
565 ENTER; /* necessary e.g. for dounwind */
566}
567
568static void
569free_coro_mortal ()
570{
571 if (coro_mortal)
551 { 572 {
552 PUSHMARK(SP); 573 SvREFCNT_dec (coro_mortal);
553 PUTBACK; 574 coro_mortal = 0;
554 (void) call_sv (sub_init, G_VOID|G_NOARGS); 575 }
555 croak ("FATAL: CCTXT coroutine returned!"); 576}
577
578static void
579coro_run (void *arg)
580{
581 /*
582 * this is a _very_ stripped down perl interpreter ;)
583 */
584 dTHX;
585 int ret;
586
587 UNLOCK;
588
589 PL_top_env = &PL_start_env;
590
591 sv_setiv (get_sv ("Coro::State::cctx_stack", FALSE), PTR2IV ((coro_stack *)arg));
592 sv_setiv (get_sv ("Coro::State::cctx_restartop", FALSE), PTR2IV (PL_op));
593
594 /* continue at cctx_init, without entersub */
595 PL_restartop = CvSTART (get_cv ("Coro::State::cctx_init", FALSE));
596
597 /* somebody will hit me for both perl_run and PL_restartop */
598 ret = perl_run (aTHX_ PERL_GET_CONTEXT);
599 printf ("ret %d\n", ret);//D
600
601 fputs ("FATAL: C coroutine fell over the edge of the world, aborting.\n", stderr);
602 abort ();
603}
604
605static coro_stack *
606stack_new ()
607{
608 coro_stack *stack;
609
610 New (0, stack, 1, coro_stack);
611
612#if HAVE_MMAP
613
614 stack->ssize = ((STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + STACKGUARD) * PAGESIZE;
615 /* mmap suppsedly does allocate-on-write for us */
616 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
617
618 if (stack->sptr == (void *)-1)
619 {
620 perror ("FATAL: unable to mmap stack for coroutine");
621 _exit (EXIT_FAILURE);
622 }
623
624# if STACKGUARD
625 mprotect (stack->sptr, STACKGUARD * PAGESIZE, PROT_NONE);
626# endif
627
628#else
629
630 stack->ssize = STACKSIZE * (long)sizeof (long);
631 New (0, stack->sptr, STACKSIZE, long);
632
633 if (!stack->sptr)
634 {
635 perror (stderr, "FATAL: unable to malloc stack for coroutine");
636 _exit (EXIT_FAILURE);
637 }
638
639#endif
640
641 coro_create (&stack->cctx, coro_run, (void *)stack, stack->sptr, stack->ssize);
642
643 return stack;
644}
645
646static void
647stack_free (coro_stack *stack)
648{
649 if (!stack)
650 return;
651
652#if HAVE_MMAP
653 munmap (stack->sptr, stack->ssize);
654#else
655 Safefree (stack->sptr);
656#endif
657
658 Safefree (stack);
659}
660
661static coro_stack *stack_first;
662
663static coro_stack *
664stack_get ()
665{
666 coro_stack *stack;
667
668 if (stack_first)
669 {
670 stack = stack_first;
671 stack_first = stack->next;
556 } 672 }
557 else 673 else
674 {
675 stack = stack_new ();
676 PL_op = PL_op->op_next;
677 }
678
679 return stack;
680}
681
682static void
683stack_put (coro_stack *stack)
684{
685 stack->next = stack_first;
686 stack_first = stack;
687}
688
689/* never call directly, always through the coro_state_transfer global variable */
690static void
691transfer_impl (pTHX_ struct coro *prev, struct coro *next, int flags)
692{
693 dSTACKLEVEL;
694
695 /* sometimes transfer is only called to set idle_sp */
696 if (flags == TRANSFER_SET_STACKLEVEL)
697 ((coro_stack *)prev)->idle_sp = STACKLEVEL;
698 else if (prev != next)
558 { 699 {
559 UNOP myop; 700 coro_stack *prev__stack;
560 701
561 PL_op = (OP *)&myop; 702 LOCK;
562 703
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}
583
584STATIC void
585transfer(pTHX_ struct coro *prev, struct coro *next, int flags)
586{
587 dSP;
588
589 if (prev != next)
590 {
591 /*
592 * this could be done in newprocess which would lead to
593 * extremely elegant and fast (basically just SAVE/LOAD)
594 * code here, but lazy allocation of stacks has also
595 * some virtues and the overhead of the if() is nil.
596 */
597 if (next->mainstack) 704 if (next->mainstack)
598 { 705 {
706 /* coroutine already started */
599 SAVE (prev, flags); 707 SAVE (prev, flags);
600 LOAD (next); 708 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 } 709 }
618 else if (next->tmps_ix == -2)
619 croak ("tried to transfer to running coroutine");
620 else 710 else
621 { 711 {
712 /* need to start coroutine */
622 SAVE (prev, -1); /* first get rid of the old state */ 713 /* first get rid of the old state */
623 714 SAVE (prev, -1);
624 if (flags & TRANSFER_SAVE_CCTXT) 715 /* 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); 716 setup_coro (next);
717 /* need a stack */
718 next->stack = 0;
641 } 719 }
720
721 if (!prev->stack)
722 /* create a new empty context */
723 Newz (0, prev->stack, 1, coro_stack);
724
725 prev__stack = prev->stack;
726
727 /* possibly "free" the stack */
728 if (prev__stack->idle_sp == STACKLEVEL)
729 {
730 stack_put (prev__stack);
731 prev->stack = 0;
732 }
733
734 if (!next->stack)
735 next->stack = stack_get ();
736
737 if (prev__stack != next->stack)
738 {
739 prev__stack->top_env = PL_top_env;
740 PL_top_env = next->stack->top_env;
741 coro_transfer (&prev__stack->cctx, &next->stack->cctx);
742 }
743
744 free_coro_mortal ();
745
746 UNLOCK;
642 } 747 }
643} 748}
644 749
750/* use this function pointer to call the above function */
751/* this is done to increase chances of the compiler not inlining the call */
752/* not static to make it even harder for the compiler (and theoretically impossible in most cases */
753void (*coro_state_transfer)(pTHX_ struct coro *prev, struct coro *next, int flags) = transfer_impl;
754
755struct transfer_args
756{
757 struct coro *prev, *next;
758 int flags;
759};
760
761#define TRANSFER(ta) coro_state_transfer ((ta).prev, (ta).next, (ta).flags)
762
763static void
764coro_state_destroy (struct coro *coro)
765{
766 if (coro->refcnt--)
767 return;
768
769 if (coro->mainstack && coro->mainstack != main_mainstack)
770 {
771 struct coro temp;
772
773 SAVE (aTHX_ (&temp), TRANSFER_SAVE_ALL);
774 LOAD (aTHX_ coro);
775
776 destroy_stacks (aTHX);
777
778 LOAD ((&temp)); /* this will get rid of defsv etc.. */
779
780 coro->mainstack = 0;
781 }
782
783 stack_free (coro->stack);
784 SvREFCNT_dec (coro->args);
785 Safefree (coro);
786}
787
788static int
789coro_state_clear (SV *sv, MAGIC *mg)
790{
791 struct coro *coro = (struct coro *)mg->mg_ptr;
792 mg->mg_ptr = 0;
793
794 coro_state_destroy (coro);
795
796 return 0;
797}
798
799static int
800coro_state_dup (MAGIC *mg, CLONE_PARAMS *params)
801{
802 struct coro *coro = (struct coro *)mg->mg_ptr;
803
804 ++coro->refcnt;
805
806 return 0;
807}
808
809static MGVTBL coro_state_vtbl = { 0, 0, 0, 0, coro_state_clear, 0, coro_state_dup, 0 };
810
811static struct coro *
812SvSTATE (SV *coro)
813{
814 HV *stash;
815 MAGIC *mg;
816
817 if (SvROK (coro))
818 coro = SvRV (coro);
819
820 stash = SvSTASH (coro);
821 if (stash != coro_stash && stash != coro_state_stash)
822 {
823 /* very slow, but rare, check */
824 if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
825 croak ("Coro::State object required");
826 }
827
828 mg = SvMAGIC (coro);
829 assert (mg->mg_type == PERL_MAGIC_ext);
830 return (struct coro *)mg->mg_ptr;
831}
832
833static void
834prepare_transfer (pTHX_ struct transfer_args *ta, SV *prev, SV *next, int flags)
835{
836 ta->prev = SvSTATE (prev);
837 ta->next = SvSTATE (next);
838 ta->flags = flags;
839}
840
841static void
842api_transfer (SV *prev, SV *next, int flags)
843{
844 dTHX;
845 struct transfer_args ta;
846
847 prepare_transfer (aTHX_ &ta, prev, next, flags);
848 TRANSFER (ta);
849}
850
851/** Coro ********************************************************************/
852
853#define PRIO_MAX 3
854#define PRIO_HIGH 1
855#define PRIO_NORMAL 0
856#define PRIO_LOW -1
857#define PRIO_IDLE -3
858#define PRIO_MIN -4
859
860/* for Coro.pm */
861static GV *coro_current, *coro_idle;
862static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
863static int coro_nready;
864
865static void
866coro_enq (pTHX_ SV *sv)
867{
868 int prio;
869
870 if (SvTYPE (sv) != SVt_PVHV)
871 croak ("Coro::ready tried to enqueue something that is not a coroutine");
872
873 prio = SvSTATE (sv)->prio;
874
875 av_push (coro_ready [prio - PRIO_MIN], sv);
876 coro_nready++;
877}
878
879static SV *
880coro_deq (pTHX_ int min_prio)
881{
882 int prio = PRIO_MAX - PRIO_MIN;
883
884 min_prio -= PRIO_MIN;
885 if (min_prio < 0)
886 min_prio = 0;
887
888 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
889 if (AvFILLp (coro_ready [prio]) >= 0)
890 {
891 coro_nready--;
892 return av_shift (coro_ready [prio]);
893 }
894
895 return 0;
896}
897
898static void
899api_ready (SV *coro)
900{
901 dTHX;
902
903 if (SvROK (coro))
904 coro = SvRV (coro);
905
906 LOCK;
907 coro_enq (aTHX_ SvREFCNT_inc (coro));
908 UNLOCK;
909}
910
911static void
912prepare_schedule (aTHX_ struct transfer_args *ta)
913{
914 SV *current, *prev, *next;
915
916 LOCK;
917
918 current = GvSV (coro_current);
919
920 for (;;)
921 {
922 LOCK;
923
924 next = coro_deq (aTHX_ PRIO_MIN);
925
926 if (next)
927 break;
928
929 UNLOCK;
930
931 {
932 dSP;
933
934 ENTER;
935 SAVETMPS;
936
937 PUSHMARK (SP);
938 PUTBACK;
939 call_sv (GvSV (coro_idle), G_DISCARD);
940
941 FREETMPS;
942 LEAVE;
943 }
944 }
945
946 prev = SvRV (current);
947 SvRV (current) = next;
948
949 /* free this only after the transfer */
950 free_coro_mortal ();
951 coro_mortal = prev;
952
953 ta->prev = SvSTATE (prev);
954 ta->next = SvSTATE (next);
955 ta->flags = TRANSFER_SAVE_ALL;
956
957 UNLOCK;
958}
959
960static void
961prepare_cede (aTHX_ struct transfer_args *ta)
962{
963 LOCK;
964 coro_enq (aTHX_ SvREFCNT_inc (SvRV (GvSV (coro_current))));
965 UNLOCK;
966
967 prepare_schedule (ta);
968}
969
970static void
971api_schedule (void)
972{
973 dTHX;
974 struct transfer_args ta;
975
976 prepare_schedule (&ta);
977 TRANSFER (ta);
978}
979
980static void
981api_cede (void)
982{
983 dTHX;
984 struct transfer_args ta;
985
986 prepare_cede (&ta);
987 TRANSFER (ta);
988}
989
645MODULE = Coro::State PACKAGE = Coro::State 990MODULE = Coro::State PACKAGE = Coro::State
646 991
647PROTOTYPES: ENABLE 992PROTOTYPES: DISABLE
648 993
649BOOT: 994BOOT:
650{ /* {} necessary for stoopid perl-5.6.x */ 995{
996#ifdef USE_ITHREADS
997 MUTEX_INIT (&coro_mutex);
998#endif
999 BOOT_PAGESIZE;
1000
651 coro_state_stash = gv_stashpvn ("Coro::State", 10, TRUE); 1001 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
652 1002
653 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 1003 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
654 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 1004 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
655 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); 1005 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 1006
661 main_mainstack = PL_mainstack; 1007 main_mainstack = PL_mainstack;
662}
663 1008
664Coro::State 1009 coroapi.ver = CORO_API_VERSION;
665_newprocess(args) 1010 coroapi.transfer = api_transfer;
666 SV * args 1011
667 PROTOTYPE: $ 1012 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
1013}
1014
1015SV *
1016new (char *klass, ...)
668 CODE: 1017 CODE:
669 Coro__State coro; 1018{
1019 struct coro *coro;
1020 HV *hv;
1021 int i;
670 1022
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); 1023 Newz (0, coro, 1, struct coro);
1024 coro->args = newAV ();
675 1025
676 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 1026 hv = newHV ();
1027 sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP;
1028 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
1029
1030 for (i = 1; i < items; i++)
1031 av_push (coro->args, newSVsv (ST (i)));
1032
677 coro->mainstack = 0; /* actual work is done inside transfer */ 1033 /*coro->mainstack = 0; *//*actual work is done inside transfer */
678 coro->sptr = 0; 1034 /*coro->stack = 0;*/
679 coro->ssize = 0; 1035}
680
681 RETVAL = coro;
682 OUTPUT: 1036 OUTPUT:
683 RETVAL 1037 RETVAL
684 1038
685void 1039void
686transfer(prev, next, flags = TRANSFER_SAVE_ALL) 1040_set_stacklevel (...)
687 Coro::State_or_hashref prev 1041 ALIAS:
688 Coro::State_or_hashref next 1042 Coro::State::transfer = 1
689 int flags 1043 Coro::schedule = 2
690 PROTOTYPE: @ 1044 Coro::cede = 3
1045 Coro::Cont::yield = 4
691 CODE: 1046 CODE:
692 transfer (aTHX_ prev, next, flags); 1047{
1048 struct transfer_args ta;
1049
1050 switch (ix)
1051 {
1052 case 0:
1053 ta.prev = (struct coro *)INT2PTR (coro_stack *, SvIV (ST (0)));
1054 ta.next = 0;
1055 ta.flags = TRANSFER_SET_STACKLEVEL;
1056 break;
1057
1058 case 1:
1059 if (items != 3)
1060 croak ("Coro::State::transfer(prev,next,flags) expects three arguments, not %d", items);
1061
1062 prepare_transfer (&ta, ST (0), ST (1), SvIV (ST (2)));
1063 break;
1064
1065 case 2:
1066 prepare_schedule (&ta);
1067 break;
1068
1069 case 3:
1070 prepare_cede (&ta);
1071 break;
1072
1073 case 4:
1074 {
1075 SV *yieldstack;
1076 SV *sv;
1077 AV *defav = GvAV (PL_defgv);
1078
1079 yieldstack = *hv_fetch (
1080 (HV *)SvRV (GvSV (coro_current)),
1081 "yieldstack", sizeof ("yieldstack") - 1,
1082 0
1083 );
1084
1085 /* set up @_ -- ugly */
1086 av_clear (defav);
1087 av_fill (defav, items - 1);
1088 while (items--)
1089 av_store (defav, items, SvREFCNT_inc (ST(items)));
1090
1091 sv = av_pop ((AV *)SvRV (yieldstack));
1092 ta.prev = SvSTATE (*av_fetch ((AV *)SvRV (sv), 0, 0));
1093 ta.next = SvSTATE (*av_fetch ((AV *)SvRV (sv), 1, 0));
1094 ta.flags = 0;
1095 SvREFCNT_dec (sv);
1096 }
1097 break;
1098
1099 }
1100
1101 TRANSFER (ta);
1102}
693 1103
694void 1104void
695DESTROY(coro) 1105_clone_state_from (SV *dst, SV *src)
696 Coro::State coro 1106 CODE:
1107{
1108 struct coro *coro_src = SvSTATE (src);
1109
1110 sv_unmagic (SvRV (dst), PERL_MAGIC_ext);
1111
1112 ++coro_src->refcnt;
1113 sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags |= MGf_DUP;
1114}
1115
1116void
1117_nonlocal_goto (IV nextop)
1118 CODE:
1119 /* uuh, somebody will kill me again for this */
1120 PL_op->op_next = INT2PTR (OP *, nextop);
1121
1122void
1123_exit (code)
1124 int code
1125 PROTOTYPE: $
1126 CODE:
1127 _exit (code);
1128
1129MODULE = Coro::State PACKAGE = Coro
1130
1131BOOT:
1132{
1133 int i;
1134
1135 coro_stash = gv_stashpv ("Coro", TRUE);
1136
1137 newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1138 newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1139 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1140 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1141 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1142 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1143
1144 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1145 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1146
1147 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1148 coro_ready[i] = newAV ();
1149
1150 {
1151 SV *sv = perl_get_sv("Coro::API", 1);
1152
1153 coroapi.schedule = api_schedule;
1154 coroapi.cede = api_cede;
1155 coroapi.ready = api_ready;
1156 coroapi.nready = &coro_nready;
1157 coroapi.current = coro_current;
1158
1159 GCoroAPI = &coroapi;
1160 sv_setiv (sv, (IV)&coroapi);
1161 SvREADONLY_on (sv);
1162 }
1163}
1164
1165int
1166prio (Coro::State coro, int newprio = 0)
1167 ALIAS:
1168 nice = 1
697 CODE: 1169 CODE:
1170{
1171 RETVAL = coro->prio;
698 1172
699 if (coro->mainstack && coro->mainstack != main_mainstack) 1173 if (items > 1)
700 { 1174 {
701 struct coro temp; 1175 if (ix)
1176 newprio += coro->prio;
702 1177
703 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); 1178 if (newprio < PRIO_MIN) newprio = PRIO_MIN;
704 LOAD(aTHX_ coro); 1179 if (newprio > PRIO_MAX) newprio = PRIO_MAX;
705 1180
706 destroy_stacks (aTHX); 1181 coro->prio = newprio;
707
708 LOAD((&temp)); /* this will get rid of defsv etc.. */
709
710 coro->mainstack = 0;
711 } 1182 }
712 1183}
713 if (coro->sptr)
714 {
715 deallocate_stack (coro);
716 coro->sptr = 0;
717 }
718
719 Safefree (coro);
720 1184
721void 1185void
722flush() 1186ready (SV *self)
1187 PROTOTYPE: $
723 CODE: 1188 CODE:
724#ifdef MAY_FLUSH 1189 api_ready (self);
725 flush_padlist_cache ();
726#endif
727 1190
1191int
1192nready (...)
1193 PROTOTYPE:
1194 CODE:
1195 RETVAL = coro_nready;
1196 OUTPUT:
1197 RETVAL
1198
728MODULE = Coro::State PACKAGE = Coro::Cont 1199MODULE = Coro::State PACKAGE = Coro::AIO
729 1200
730# this is slightly dirty 1201SV *
1202_get_state ()
1203 CODE:
1204{
1205 struct {
1206 int errorno;
1207 int laststype;
1208 int laststatval;
1209 Stat_t statcache;
1210 } data;
1211
1212 data.errorno = errno;
1213 data.laststype = PL_laststype;
1214 data.laststatval = PL_laststatval;
1215 data.statcache = PL_statcache;
1216
1217 RETVAL = newSVpvn ((char *)&data, sizeof data);
1218}
1219 OUTPUT:
1220 RETVAL
731 1221
732void 1222void
733yield(...) 1223_set_state (char *data_)
734 PROTOTYPE: @ 1224 PROTOTYPE: $
735 CODE: 1225 CODE:
736 static SV *returnstk; 1226{
737 SV *sv; 1227 struct {
738 AV *defav = GvAV (PL_defgv); 1228 int errorno;
739 struct coro *prev, *next; 1229 int laststype;
1230 int laststatval;
1231 Stat_t statcache;
1232 } *data = (void *)data_;
740 1233
741 if (!returnstk) 1234 errno = data->errorno;
742 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE)); 1235 PL_laststype = data->laststype;
743 1236 PL_laststatval = data->laststatval;
744 /* set up @_ -- ugly */ 1237 PL_statcache = data->statcache;
745 av_clear (defav); 1238}
746 av_fill (defav, items - 1);
747 while (items--)
748 av_store (defav, items, SvREFCNT_inc (ST(items)));
749
750 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
751 sv = av_pop ((AV *)SvRV (returnstk));
752 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
753 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
754 SvREFCNT_dec (sv);
755
756 transfer(aTHX_ prev, next, 0);
757

Diff Legend

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