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.49 by pcg, Sun Nov 23 03:34:13 2003 UTC vs.
Revision 1.103 by root, Mon Nov 27 01:33:30 2006 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines