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

Diff Legend

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