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

Diff Legend

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