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

Diff Legend

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