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.101 by root, Mon Nov 27 00:08:18 2006 UTC

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