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

Diff Legend

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