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.101 by root, Mon Nov 27 00:08:18 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,8,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 if (!SvPADBUSY (sv))
190 SvPADMY_on (sv);
191 npad[ix] = sv;
192 } 209 }
193 } 210 }
194 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) 211
195 { 212 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 } 213 }
214}
205 215
206#if 0 /* return -ENOTUNDERSTOOD */ 216static int
207 /* 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;
208 221
209 for (ix = fpad; ix > 0; ix--) { 222 /* casting is fun. */
210 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv; 223 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
211 if (namesv 224 free_padlist (padlist);
212 && namesv != &PL_sv_undef 225
213 && !(SvFLAGS(namesv) & SVf_FAKE) 226 SvREFCNT_dec (av);
214 && *SvPVX(namesv) == '&' 227
215 && CvCLONE(ppad[ix])) 228 return 0;
216 { 229}
217 CV *kid = cv_clone((CV*)ppad[ix]); 230
218 SvREFCNT_dec(ppad[ix]); 231#define PERL_MAGIC_coro PERL_MAGIC_ext
219 CvCLONE_on(kid); 232
220 SvPADMY_on(kid); 233static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
221 npad[ix] = (SV*)kid; 234
222 } 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 ();
223 } 268 }
224#endif
225 269
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)); 270 av_push ((AV *)mg->mg_obj, (SV *)CvPADLIST (cv));
274} 271}
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 272
302#define SB do { 273#define SB do {
303#define SE } while (0) 274#define SE } while (0)
304 275
305#define LOAD(state) load_state(aTHX_ (state)); 276#define LOAD(state) load_state((state));
306#define SAVE(state,flags) save_state(aTHX_ (state),(flags)); 277#define SAVE(state,flags) save_state((state),(flags));
307 278
308#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE 279#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE
309 280
310static void 281static void
311load_state(pTHX_ Coro__State c) 282load_state(Coro__State c)
312{ 283{
313 PL_dowarn = c->dowarn; 284 PL_dowarn = c->dowarn;
314 PL_in_eval = c->in_eval; 285 PL_in_eval = c->in_eval;
315 286
316 PL_curstackinfo = c->curstackinfo; 287 PL_curstackinfo = c->curstackinfo;
318 PL_mainstack = c->mainstack; 289 PL_mainstack = c->mainstack;
319 PL_stack_sp = c->stack_sp; 290 PL_stack_sp = c->stack_sp;
320 PL_op = c->op; 291 PL_op = c->op;
321 PL_curpad = c->curpad; 292 PL_curpad = c->curpad;
322 PL_comppad = c->comppad; 293 PL_comppad = c->comppad;
294 PL_compcv = c->compcv;
323 PL_stack_base = c->stack_base; 295 PL_stack_base = c->stack_base;
324 PL_stack_max = c->stack_max; 296 PL_stack_max = c->stack_max;
325 PL_tmps_stack = c->tmps_stack; 297 PL_tmps_stack = c->tmps_stack;
326 PL_tmps_floor = c->tmps_floor; 298 PL_tmps_floor = c->tmps_floor;
327 PL_tmps_ix = c->tmps_ix; 299 PL_tmps_ix = c->tmps_ix;
333 PL_scopestack_ix = c->scopestack_ix; 305 PL_scopestack_ix = c->scopestack_ix;
334 PL_scopestack_max = c->scopestack_max; 306 PL_scopestack_max = c->scopestack_max;
335 PL_savestack = c->savestack; 307 PL_savestack = c->savestack;
336 PL_savestack_ix = c->savestack_ix; 308 PL_savestack_ix = c->savestack_ix;
337 PL_savestack_max = c->savestack_max; 309 PL_savestack_max = c->savestack_max;
310#if !PERL_VERSION_ATLEAST (5,9,0)
338 PL_retstack = c->retstack; 311 PL_retstack = c->retstack;
339 PL_retstack_ix = c->retstack_ix; 312 PL_retstack_ix = c->retstack_ix;
340 PL_retstack_max = c->retstack_max; 313 PL_retstack_max = c->retstack_max;
314#endif
315 PL_curpm = c->curpm;
341 PL_curcop = c->curcop; 316 PL_curcop = c->curcop;
342 PL_top_env = c->top_env;
343 317
344 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); 318 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
345 if (c->defsv) REPLACE_SV (DEFSV , c->defsv); 319 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
346 if (c->errsv) REPLACE_SV (ERRSV , c->errsv); 320 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
347 321
356 330
357 if (padlist) 331 if (padlist)
358 { 332 {
359 put_padlist (cv); /* mark this padlist as available */ 333 put_padlist (cv); /* mark this padlist as available */
360 CvPADLIST(cv) = padlist; 334 CvPADLIST(cv) = padlist;
361#ifdef USE_THREADS
362 /*CvOWNER(cv) = (struct perl_thread *)POPs;*/
363#endif
364 } 335 }
365 336
366 ++CvDEPTH(cv); 337 ++CvDEPTH(cv);
367 } 338 }
368 339
369 PUTBACK; 340 PUTBACK;
370 } 341 }
371} 342}
372 343
373static void 344static void
374save_state(pTHX_ Coro__State c, int flags) 345save_state(Coro__State c, int flags)
375{ 346{
376 { 347 {
377 dSP; 348 dSP;
378 I32 cxix = cxstack_ix; 349 I32 cxix = cxstack_ix;
379 PERL_CONTEXT *ccstk = cxstack; 350 PERL_CONTEXT *ccstk = cxstack;
395 if (CxTYPE(cx) == CXt_SUB) 366 if (CxTYPE(cx) == CXt_SUB)
396 { 367 {
397 CV *cv = cx->blk_sub.cv; 368 CV *cv = cx->blk_sub.cv;
398 if (CvDEPTH(cv)) 369 if (CvDEPTH(cv))
399 { 370 {
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); 371 EXTEND (SP, CvDEPTH(cv)*2);
406 372
407 while (--CvDEPTH(cv)) 373 while (--CvDEPTH(cv))
408 { 374 {
409 /* this tells the restore code to increment CvDEPTH */ 375 /* this tells the restore code to increment CvDEPTH */
412 } 378 }
413 379
414 PUSHs ((SV *)CvPADLIST(cv)); 380 PUSHs ((SV *)CvPADLIST(cv));
415 PUSHs ((SV *)cv); 381 PUSHs ((SV *)cv);
416 382
417 get_padlist (cv); /* this is a monster */ 383 get_padlist (cv);
418 } 384 }
419 } 385 }
420#ifdef CXt_FORMAT 386#ifdef CXt_FORMAT
421 else if (CxTYPE(cx) == CXt_FORMAT) 387 else if (CxTYPE(cx) == CXt_FORMAT)
422 { 388 {
450 c->mainstack = PL_mainstack; 416 c->mainstack = PL_mainstack;
451 c->stack_sp = PL_stack_sp; 417 c->stack_sp = PL_stack_sp;
452 c->op = PL_op; 418 c->op = PL_op;
453 c->curpad = PL_curpad; 419 c->curpad = PL_curpad;
454 c->comppad = PL_comppad; 420 c->comppad = PL_comppad;
421 c->compcv = PL_compcv;
455 c->stack_base = PL_stack_base; 422 c->stack_base = PL_stack_base;
456 c->stack_max = PL_stack_max; 423 c->stack_max = PL_stack_max;
457 c->tmps_stack = PL_tmps_stack; 424 c->tmps_stack = PL_tmps_stack;
458 c->tmps_floor = PL_tmps_floor; 425 c->tmps_floor = PL_tmps_floor;
459 c->tmps_ix = PL_tmps_ix; 426 c->tmps_ix = PL_tmps_ix;
465 c->scopestack_ix = PL_scopestack_ix; 432 c->scopestack_ix = PL_scopestack_ix;
466 c->scopestack_max = PL_scopestack_max; 433 c->scopestack_max = PL_scopestack_max;
467 c->savestack = PL_savestack; 434 c->savestack = PL_savestack;
468 c->savestack_ix = PL_savestack_ix; 435 c->savestack_ix = PL_savestack_ix;
469 c->savestack_max = PL_savestack_max; 436 c->savestack_max = PL_savestack_max;
437#if !PERL_VERSION_ATLEAST (5,9,0)
470 c->retstack = PL_retstack; 438 c->retstack = PL_retstack;
471 c->retstack_ix = PL_retstack_ix; 439 c->retstack_ix = PL_retstack_ix;
472 c->retstack_max = PL_retstack_max; 440 c->retstack_max = PL_retstack_max;
441#endif
442 c->curpm = PL_curpm;
473 c->curcop = PL_curcop; 443 c->curcop = PL_curcop;
474 c->top_env = PL_top_env;
475} 444}
476 445
477/* 446/*
478 * allocate various perl stacks. This is an exact copy 447 * allocate various perl stacks. This is an exact copy
479 * of perl.c:init_stacks, except that it uses less memory 448 * of perl.c:init_stacks, except that it uses less memory
480 * on the assumption that coroutines do not usually need 449 * on the (sometimes correct) assumption that coroutines do
481 * a lot of stackspace. 450 * not usually need a lot of stackspace.
482 */ 451 */
483STATIC void 452static void
484coro_init_stacks (pTHX) 453coro_init_stacks ()
485{ 454{
486 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 455 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
487 PL_curstackinfo->si_type = PERLSI_MAIN; 456 PL_curstackinfo->si_type = PERLSI_MAIN;
488 PL_curstack = PL_curstackinfo->si_stack; 457 PL_curstack = PL_curstackinfo->si_stack;
489 PL_mainstack = PL_curstack; /* remember in case we switch stacks */ 458 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
511 480
512 New(54,PL_savestack,96,ANY); 481 New(54,PL_savestack,96,ANY);
513 PL_savestack_ix = 0; 482 PL_savestack_ix = 0;
514 PL_savestack_max = 96; 483 PL_savestack_max = 96;
515 484
485#if !PERL_VERSION_ATLEAST (5,9,0)
516 New(54,PL_retstack,8,OP*); 486 New(54,PL_retstack,8,OP*);
517 PL_retstack_ix = 0; 487 PL_retstack_ix = 0;
518 PL_retstack_max = 8; 488 PL_retstack_max = 8;
489#endif
519} 490}
520 491
521/* 492/*
522 * destroy the stacks, the callchain etc... 493 * destroy the stacks, the callchain etc...
523 * still there is a memleak of 128 bytes...
524 */ 494 */
525STATIC void 495static void
526destroy_stacks(pTHX) 496destroy_stacks()
527{ 497{
528 if (!IN_DESTRUCT) 498 if (!IN_DESTRUCT)
529 { 499 {
530 /* is this ugly, I ask? */ 500 /* is this ugly, I ask? */
531 while (PL_scopestack_ix) 501 LEAVE_SCOPE (0);
532 LEAVE;
533 502
534 /* sure it is, but more important: is it correct?? :/ */ 503 /* 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; 504 FREETMPS;
505
506 /*POPSTACK_TO (PL_mainstack);*//*D*//*use*/
537 } 507 }
538 508
539 while (PL_curstackinfo->si_next) 509 while (PL_curstackinfo->si_next)
540 PL_curstackinfo = PL_curstackinfo->si_next; 510 PL_curstackinfo = PL_curstackinfo->si_next;
541 511
542 while (PL_curstackinfo) 512 while (PL_curstackinfo)
543 { 513 {
544 PERL_SI *p = PL_curstackinfo->si_prev; 514 PERL_SI *p = PL_curstackinfo->si_prev;
545 515
546 { 516 { /*D*//*remove*/
547 dSP; 517 dSP;
548 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); 518 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
549 PUTBACK; /* possibly superfluous */ 519 PUTBACK; /* possibly superfluous */
550 } 520 }
551 521
552 if (!IN_DESTRUCT) 522 if (!IN_DESTRUCT)
553 { 523 {
554 dounwind(-1); 524 dounwind (-1);/*D*//*remove*/
555 SvREFCNT_dec(PL_curstackinfo->si_stack); 525 SvREFCNT_dec (PL_curstackinfo->si_stack);
556 } 526 }
557 527
558 Safefree(PL_curstackinfo->si_cxstack); 528 Safefree (PL_curstackinfo->si_cxstack);
559 Safefree(PL_curstackinfo); 529 Safefree (PL_curstackinfo);
560 PL_curstackinfo = p; 530 PL_curstackinfo = p;
561 } 531 }
562 532
563 Safefree(PL_tmps_stack); 533 Safefree (PL_tmps_stack);
564 Safefree(PL_markstack); 534 Safefree (PL_markstack);
565 Safefree(PL_scopestack); 535 Safefree (PL_scopestack);
566 Safefree(PL_savestack); 536 Safefree (PL_savestack);
537#if !PERL_VERSION_ATLEAST (5,9,0)
567 Safefree(PL_retstack); 538 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 539#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} 540}
598 541
599static void 542static void
600deallocate_stack (Coro__State ctx) 543setup_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{ 544{
627 /* 545 /*
628 * emulate part of the perl startup here. 546 * emulate part of the perl startup here.
629 */ 547 */
548 dTHX;
630 dSP; 549 dSP;
631 Coro__State ctx = (Coro__State)arg; 550 UNOP myop;
632 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE); 551 SV *sub_init = (SV *)get_cv ("Coro::State::coro_init", FALSE);
633 552
634 coro_init_stacks (aTHX); 553 coro_init_stacks ();
635 /*PL_curcop = 0;*/ 554 /*PL_curcop = 0;*/
636 /*PL_in_eval = PL_in_eval;*/ /* inherit */ 555 /*PL_in_eval = PL_in_eval;*/ /* inherit */
637 SvREFCNT_dec (GvAV (PL_defgv)); 556 SvREFCNT_dec (GvAV (PL_defgv));
638 GvAV (PL_defgv) = ctx->args; 557 GvAV (PL_defgv) = coro->args; coro->args = 0;
639 558
640 SPAGAIN; 559 SPAGAIN;
641 560
642 if (ctx->stack)
643 {
644 ctx->cursp = 0;
645
646 PUSHMARK(SP);
647 PUTBACK;
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 }
655 else
656 {
657 UNOP myop;
658
659 PL_op = (OP *)&myop;
660
661 Zero(&myop, 1, UNOP); 561 Zero (&myop, 1, UNOP);
662 myop.op_next = Nullop; 562 myop.op_next = Nullop;
663 myop.op_flags = OPf_WANT_VOID; 563 myop.op_flags = OPf_WANT_VOID;
664 564
565 PL_op = (OP *)&myop;
566
665 PUSHMARK(SP); 567 PUSHMARK(SP);
666 XPUSHs (sub_init); 568 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; 569 PUTBACK;
675 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); 570 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
676 SPAGAIN; 571 SPAGAIN;
677 572
678 ENTER; /* necessary e.g. for dounwind */ 573 ENTER; /* necessary e.g. for dounwind */
679 }
680} 574}
681 575
682static void 576static void
683continue_coro (void *arg) 577free_coro_mortal ()
684{ 578{
685 /*
686 * this is a _very_ stripped down perl interpreter ;)
687 */
688 Coro__State ctx = (Coro__State)arg;
689 JMPENV coro_start_env;
690
691 PL_top_env = &ctx->start_env;
692
693 ctx->cursp = 0;
694 PL_op = PL_op->op_next;
695 CALLRUNOPS(aTHX);
696
697 abort ();
698}
699
700STATIC void
701transfer(pTHX_ struct coro *prev, struct coro *next, int flags)
702{
703 dSTACKLEVEL;
704 static struct coro *xnext;
705
706 if (prev != next)
707 {
708 xnext = next;
709
710 if (next->mainstack)
711 {
712 SAVE (prev, flags);
713 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 }
746 else if (next->tmps_ix == -2)
747 croak ("tried to transfer to running coroutine");
748 else
749 {
750 SAVE (prev, -1); /* first get rid of the old state */
751
752 if (flags & TRANSFER_SAVE_CCTXT)
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);
780 }
781
782 /*
783 * xnext is now either prev or next, depending on wether
784 * we switched the c stack or not. that's why I use a global
785 * variable, that should become thread-specific at one point.
786 */
787 xnext->cursp = stacklevel;
788 }
789
790 if (coro_mortal) 579 if (coro_mortal)
791 { 580 {
792 SvREFCNT_dec (coro_mortal); 581 SvREFCNT_dec (coro_mortal);
793 coro_mortal = 0; 582 coro_mortal = 0;
794 } 583 }
795} 584}
796 585
797#define SV_CORO(sv,func) \ 586static void NOINLINE
798 do { \ 587prepare_cctx (coro_stack *cctx)
799 if (SvROK (sv)) \ 588{
800 sv = SvRV (sv); \ 589 dSP;
801 \ 590 UNOP myop;
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 591
818#define SvSTATE(sv) (struct coro *)SvIV (sv) 592 Zero (&myop, 1, UNOP);
593 myop.op_next = PL_op;
594 myop.op_flags = OPf_WANT_VOID | OPf_STACKED;
819 595
596 PUSHMARK(SP);
597 EXTEND (SP, 2);
598 PUSHs (newSViv (PTR2IV (cctx)));
599 PUSHs ((SV *)get_cv ("Coro::State::cctx_init", FALSE));
600 PUTBACK;
601 PL_restartop = PL_ppaddr[OP_ENTERSUB](aTHX);
602 SPAGAIN;
603}
604
605static void
606coro_run (void *arg)
607{
608 /*
609 * this is a _very_ stripped down perl interpreter ;)
610 */
611 UNLOCK;
612
613 PL_top_env = &PL_start_env;
614 prepare_cctx ((coro_stack *)arg);
615
616 /* somebody will hit me for both perl_run and PL_restartop */
617 perl_run (PERL_GET_CONTEXT);
618
619 fputs ("FATAL: C coroutine fell over the edge of the world, aborting.\n", stderr);
620 abort ();
621}
622
623static coro_stack *
624stack_new ()
625{
626 coro_stack *stack;
627
628 New (0, stack, 1, coro_stack);
629
630#if HAVE_MMAP
631
632 stack->ssize = ((STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + STACKGUARD) * PAGESIZE;
633 /* mmap suppsedly does allocate-on-write for us */
634 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
635
636 if (stack->sptr == (void *)-1)
637 {
638 perror ("FATAL: unable to mmap stack for coroutine");
639 _exit (EXIT_FAILURE);
640 }
641
642# if STACKGUARD
643 mprotect (stack->sptr, STACKGUARD * PAGESIZE, PROT_NONE);
644# endif
645
646#else
647
648 stack->ssize = STACKSIZE * (long)sizeof (long);
649 New (0, stack->sptr, STACKSIZE, long);
650
651 if (!stack->sptr)
652 {
653 perror (stderr, "FATAL: unable to malloc stack for coroutine");
654 _exit (EXIT_FAILURE);
655 }
656
657#endif
658
659 coro_create (&stack->cctx, coro_run, (void *)stack, stack->sptr, stack->ssize);
660
661 return stack;
662}
663
664static void
665stack_free (coro_stack *stack)
666{
667 if (!stack)
668 return;
669
670#if HAVE_MMAP
671 munmap (stack->sptr, stack->ssize);
672#else
673 Safefree (stack->sptr);
674#endif
675
676 Safefree (stack);
677}
678
679static coro_stack *stack_first;
680
681static coro_stack *
682stack_get ()
683{
684 coro_stack *stack;
685
686 if (stack_first)
687 {
688 stack = stack_first;
689 stack_first = stack->next;
690 }
691 else
692 {
693 stack = stack_new ();
694 PL_op = PL_op->op_next;
695 }
696
697 return stack;
698}
699
700static void
701stack_put (coro_stack *stack)
702{
703 stack->next = stack_first;
704 stack_first = stack;
705}
706
707/* never call directly, always through the coro_state_transfer global variable */
708static void NOINLINE
709transfer (struct coro *prev, struct coro *next, int flags)
710{
711 dSTACKLEVEL;
712
713 /* sometimes transfer is only called to set idle_sp */
714 if (flags == TRANSFER_SET_STACKLEVEL)
715 ((coro_stack *)prev)->idle_sp = STACKLEVEL;
716 else if (prev != next)
717 {
718 coro_stack *prev__stack;
719
720 LOCK;
721
722 if (next->mainstack)
723 {
724 /* coroutine already started */
725 SAVE (prev, flags);
726 LOAD (next);
727 }
728 else
729 {
730 /* need to start coroutine */
731 /* first get rid of the old state */
732 SAVE (prev, -1);
733 /* setup coroutine call */
734 setup_coro (next);
735 /* need a stack */
736 next->stack = 0;
737 }
738
739 if (!prev->stack)
740 /* create a new empty context */
741 Newz (0, prev->stack, 1, coro_stack);
742
743 prev__stack = prev->stack;
744
745 /* possibly "free" the stack */
746 if (prev__stack->idle_sp == STACKLEVEL)
747 {
748 stack_put (prev__stack);
749 prev->stack = 0;
750 }
751
752 if (!next->stack)
753 next->stack = stack_get ();
754
755 if (prev__stack != next->stack)
756 {
757 prev__stack->top_env = PL_top_env;
758 PL_top_env = next->stack->top_env;
759 coro_transfer (&prev__stack->cctx, &next->stack->cctx);
760 }
761
762 free_coro_mortal ();
763
764 UNLOCK;
765 }
766}
767
768struct transfer_args
769{
770 struct coro *prev, *next;
771 int flags;
772};
773
774#define TRANSFER(ta) transfer ((ta).prev, (ta).next, (ta).flags)
775
776static void
777coro_state_destroy (struct coro *coro)
778{
779 if (coro->refcnt--)
780 return;
781
782 if (coro->mainstack && coro->mainstack != main_mainstack)
783 {
784 struct coro temp;
785
786 SAVE ((&temp), TRANSFER_SAVE_ALL);
787 LOAD (coro);
788
789 destroy_stacks ();
790
791 LOAD ((&temp)); /* this will get rid of defsv etc.. */
792
793 coro->mainstack = 0;
794 }
795
796 stack_free (coro->stack);
797 SvREFCNT_dec (coro->args);
798 Safefree (coro);
799}
800
820static void 801static int
802coro_state_clear (pTHX_ SV *sv, MAGIC *mg)
803{
804 struct coro *coro = (struct coro *)mg->mg_ptr;
805 mg->mg_ptr = 0;
806
807 coro_state_destroy (coro);
808
809 return 0;
810}
811
812static int
813coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params)
814{
815 struct coro *coro = (struct coro *)mg->mg_ptr;
816
817 ++coro->refcnt;
818
819 return 0;
820}
821
822static MGVTBL coro_state_vtbl = {
823 0, 0, 0, 0,
824 coro_state_clear,
825 0,
826#ifdef MGf_DUP
827 coro_state_dup,
828#endif
829};
830
831static struct coro *
832SvSTATE (SV *coro)
833{
834 HV *stash;
835 MAGIC *mg;
836
837 if (SvROK (coro))
838 coro = SvRV (coro);
839
840 stash = SvSTASH (coro);
841 if (stash != coro_stash && stash != coro_state_stash)
842 {
843 /* very slow, but rare, check */
844 if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
845 croak ("Coro::State object required");
846 }
847
848 mg = SvMAGIC (coro);
849 assert (mg->mg_type == PERL_MAGIC_ext);
850 return (struct coro *)mg->mg_ptr;
851}
852
853static void
854prepare_transfer (struct transfer_args *ta, SV *prev, SV *next, int flags)
855{
856 ta->prev = SvSTATE (prev);
857 ta->next = SvSTATE (next);
858 ta->flags = flags;
859}
860
861static void
821api_transfer(pTHX_ SV *prev, SV *next, int flags) 862api_transfer (SV *prev, SV *next, int flags)
822{ 863{
823 SV_CORO (prev, "Coro::transfer"); 864 dTHX;
824 SV_CORO (next, "Coro::transfer"); 865 struct transfer_args ta;
825 866
826 transfer(aTHX_ SvSTATE(prev), SvSTATE(next), flags); 867 prepare_transfer (&ta, prev, next, flags);
868 TRANSFER (ta);
827} 869}
828 870
829/** Coro ********************************************************************/ 871/** Coro ********************************************************************/
830 872
831#define PRIO_MAX 3 873#define PRIO_MAX 3
835#define PRIO_IDLE -3 877#define PRIO_IDLE -3
836#define PRIO_MIN -4 878#define PRIO_MIN -4
837 879
838/* for Coro.pm */ 880/* for Coro.pm */
839static GV *coro_current, *coro_idle; 881static GV *coro_current, *coro_idle;
840static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; 882static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
841static int coro_nready; 883static int coro_nready;
842 884
843static void 885static void
844coro_enq (SV *sv) 886coro_enq (SV *sv)
845{ 887{
888 int prio;
889
846 if (SvTYPE (sv) == SVt_PVHV) 890 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"); 891 croak ("Coro::ready tried to enqueue something that is not a coroutine");
892
893 prio = SvSTATE (sv)->prio;
894
895 av_push (coro_ready [prio - PRIO_MIN], sv);
896 coro_nready++;
862} 897}
863 898
864static SV * 899static SV *
865coro_deq (int min_prio) 900coro_deq (int min_prio)
866{ 901{
869 min_prio -= PRIO_MIN; 904 min_prio -= PRIO_MIN;
870 if (min_prio < 0) 905 if (min_prio < 0)
871 min_prio = 0; 906 min_prio = 0;
872 907
873 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) 908 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
874 if (av_len (coro_ready[prio]) >= 0) 909 if (AvFILLp (coro_ready [prio]) >= 0)
875 { 910 {
876 coro_nready--; 911 coro_nready--;
877 return av_shift (coro_ready[prio]); 912 return av_shift (coro_ready [prio]);
878 } 913 }
879 914
880 return 0; 915 return 0;
881} 916}
882 917
883static void 918static void
884api_ready (SV *coro) 919api_ready (SV *coro)
885{ 920{
921 dTHX;
922
886 if (SvROK (coro)) 923 if (SvROK (coro))
887 coro = SvRV (coro); 924 coro = SvRV (coro);
888 925
926 LOCK;
889 coro_enq (SvREFCNT_inc (coro)); 927 coro_enq (SvREFCNT_inc (coro));
928 UNLOCK;
929}
930
931static void
932prepare_schedule (struct transfer_args *ta)
933{
934 SV *current, *prev, *next;
935
936 current = GvSV (coro_current);
937
938 for (;;)
939 {
940 LOCK;
941 next = coro_deq (PRIO_MIN);
942 UNLOCK;
943
944 if (next)
945 break;
946
947 {
948 dSP;
949
950 ENTER;
951 SAVETMPS;
952
953 PUSHMARK (SP);
954 PUTBACK;
955 call_sv (GvSV (coro_idle), G_DISCARD);
956
957 FREETMPS;
958 LEAVE;
959 }
960 }
961
962 prev = SvRV (current);
963 SvRV (current) = next;
964
965 /* free this only after the transfer */
966 LOCK;
967 free_coro_mortal ();
968 UNLOCK;
969 coro_mortal = prev;
970
971 ta->prev = SvSTATE (prev);
972 ta->next = SvSTATE (next);
973 ta->flags = TRANSFER_SAVE_ALL;
974}
975
976static void
977prepare_cede (struct transfer_args *ta)
978{
979 LOCK;
980 coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current))));
981 UNLOCK;
982
983 prepare_schedule (ta);
890} 984}
891 985
892static void 986static void
893api_schedule (void) 987api_schedule (void)
894{ 988{
895 SV *prev, *next; 989 dTHX;
990 struct transfer_args ta;
896 991
897 prev = SvRV (GvSV (coro_current)); 992 prepare_schedule (&ta);
898 next = coro_deq (PRIO_MIN); 993 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} 994}
914 995
915static void 996static void
916api_cede (void) 997api_cede (void)
917{ 998{
918 coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current)))); 999 dTHX;
1000 struct transfer_args ta;
919 1001
920 api_schedule (); 1002 prepare_cede (&ta);
1003 TRANSFER (ta);
921} 1004}
922 1005
923MODULE = Coro::State PACKAGE = Coro::State 1006MODULE = Coro::State PACKAGE = Coro::State
924 1007
925PROTOTYPES: ENABLE 1008PROTOTYPES: DISABLE
926 1009
927BOOT: 1010BOOT:
928{ /* {} necessary for stoopid perl-5.6.x */ 1011{
929 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); 1012#ifdef USE_ITHREADS
930 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); 1013 MUTEX_INIT (&coro_mutex);
1014#endif
1015 BOOT_PAGESIZE;
1016
931 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 1017 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
932 1018
933 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 1019 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
934 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 1020 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
935 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); 1021 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 1022
941 main_mainstack = PL_mainstack; 1023 main_mainstack = PL_mainstack;
942 1024
943 coroapi.ver = CORO_API_VERSION; 1025 coroapi.ver = CORO_API_VERSION;
944 coroapi.transfer = api_transfer; 1026 coroapi.transfer = api_transfer;
945}
946 1027
947Coro::State 1028 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
948_newprocess(args) 1029}
949 SV * args 1030
950 PROTOTYPE: $ 1031SV *
1032new (char *klass, ...)
951 CODE: 1033 CODE:
952 Coro__State coro; 1034{
1035 struct coro *coro;
1036 HV *hv;
1037 int i;
953 1038
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); 1039 Newz (0, coro, 1, struct coro);
1040 coro->args = newAV ();
958 1041
959 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 1042 hv = newHV ();
1043 sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP;
1044 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
1045
1046 for (i = 1; i < items; i++)
1047 av_push (coro->args, newSVsv (ST (i)));
1048
960 coro->mainstack = 0; /* actual work is done inside transfer */ 1049 /*coro->mainstack = 0; *//*actual work is done inside transfer */
961 coro->stack = 0; 1050 /*coro->stack = 0;*/
962 1051}
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: 1052 OUTPUT:
971 RETVAL 1053 RETVAL
972 1054
973void 1055void
974transfer(prev, next, flags) 1056_set_stacklevel (...)
975 SV *prev 1057 ALIAS:
976 SV *next 1058 Coro::State::transfer = 1
977 int flags 1059 Coro::schedule = 2
978 PROTOTYPE: @ 1060 Coro::cede = 3
1061 Coro::Cont::yield = 4
979 CODE: 1062 CODE:
980 PUTBACK; 1063{
981 SV_CORO (next, "Coro::transfer"); 1064 struct transfer_args ta;
982 SV_CORO (prev, "Coro::transfer"); 1065
983 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); 1066 switch (ix)
984 SPAGAIN; 1067 {
1068 case 0:
1069 ta.prev = (struct coro *)INT2PTR (coro_stack *, SvIV (ST (0)));
1070 ta.next = 0;
1071 ta.flags = TRANSFER_SET_STACKLEVEL;
1072 break;
1073
1074 case 1:
1075 if (items != 3)
1076 croak ("Coro::State::transfer(prev,next,flags) expects three arguments, not %d", items);
1077
1078 prepare_transfer (&ta, ST (0), ST (1), SvIV (ST (2)));
1079 break;
1080
1081 case 2:
1082 prepare_schedule (&ta);
1083 break;
1084
1085 case 3:
1086 prepare_cede (&ta);
1087 break;
1088
1089 case 4:
1090 {
1091 SV *yieldstack;
1092 SV *sv;
1093 AV *defav = GvAV (PL_defgv);
1094
1095 yieldstack = *hv_fetch (
1096 (HV *)SvRV (GvSV (coro_current)),
1097 "yieldstack", sizeof ("yieldstack") - 1,
1098 0
1099 );
1100
1101 /* set up @_ -- ugly */
1102 av_clear (defav);
1103 av_fill (defav, items - 1);
1104 while (items--)
1105 av_store (defav, items, SvREFCNT_inc (ST(items)));
1106
1107 sv = av_pop ((AV *)SvRV (yieldstack));
1108 ta.prev = SvSTATE (*av_fetch ((AV *)SvRV (sv), 0, 0));
1109 ta.next = SvSTATE (*av_fetch ((AV *)SvRV (sv), 1, 0));
1110 ta.flags = 0;
1111 SvREFCNT_dec (sv);
1112 }
1113 break;
1114
1115 }
1116
1117 TRANSFER (ta);
1118}
985 1119
986void 1120void
987DESTROY(coro) 1121_clone_state_from (SV *dst, SV *src)
988 Coro::State coro 1122 CODE:
989 CODE: 1123{
1124 struct coro *coro_src = SvSTATE (src);
990 1125
991 if (coro->mainstack && coro->mainstack != main_mainstack) 1126 sv_unmagic (SvRV (dst), PERL_MAGIC_ext);
992 {
993 struct coro temp;
994 1127
995 PUTBACK; 1128 ++coro_src->refcnt;
996 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); 1129 sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags |= MGf_DUP;
997 LOAD(aTHX_ coro); 1130}
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 1131
1012void 1132void
1013flush()
1014 CODE:
1015#ifdef MAY_FLUSH
1016 flush_padlist_cache ();
1017#endif
1018
1019void
1020_exit(code) 1133_exit (code)
1021 int code 1134 int code
1022 PROTOTYPE: $ 1135 PROTOTYPE: $
1023 CODE: 1136 CODE:
1024#if defined(__GLIBC__) || _POSIX_C_SOURCE
1025 _exit (code); 1137 _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 1138
1062MODULE = Coro::State PACKAGE = Coro 1139MODULE = Coro::State PACKAGE = Coro
1063 1140
1064# this is slightly dirty (should expose a c-level api)
1065
1066BOOT: 1141BOOT:
1067{ 1142{
1068 int i; 1143 int i;
1144
1069 HV *stash = gv_stashpv ("Coro", TRUE); 1145 coro_stash = gv_stashpv ("Coro", TRUE);
1070 1146
1071 newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); 1147 newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1072 newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); 1148 newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1073 newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); 1149 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1074 newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); 1150 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1075 newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); 1151 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1076 newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); 1152 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1077 1153
1078 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); 1154 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1079 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); 1155 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1080 1156
1081 for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) 1157 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1089 coroapi.ready = api_ready; 1165 coroapi.ready = api_ready;
1090 coroapi.nready = &coro_nready; 1166 coroapi.nready = &coro_nready;
1091 coroapi.current = coro_current; 1167 coroapi.current = coro_current;
1092 1168
1093 GCoroAPI = &coroapi; 1169 GCoroAPI = &coroapi;
1094 sv_setiv(sv, (IV)&coroapi); 1170 sv_setiv (sv, (IV)&coroapi);
1095 SvREADONLY_on(sv); 1171 SvREADONLY_on (sv);
1096 } 1172 }
1097} 1173}
1098 1174
1175int
1176prio (Coro::State coro, int newprio = 0)
1177 ALIAS:
1178 nice = 1
1179 CODE:
1180{
1181 RETVAL = coro->prio;
1182
1183 if (items > 1)
1184 {
1185 if (ix)
1186 newprio += coro->prio;
1187
1188 if (newprio < PRIO_MIN) newprio = PRIO_MIN;
1189 if (newprio > PRIO_MAX) newprio = PRIO_MAX;
1190
1191 coro->prio = newprio;
1192 }
1193}
1194
1099void 1195void
1100ready(self) 1196ready (SV *self)
1101 SV * self
1102 PROTOTYPE: $ 1197 PROTOTYPE: $
1103 CODE: 1198 CODE:
1104 api_ready (self); 1199 api_ready (self);
1105 1200
1106int 1201int
1107nready(...) 1202nready (...)
1108 PROTOTYPE: 1203 PROTOTYPE:
1109 CODE: 1204 CODE:
1110 RETVAL = coro_nready; 1205 RETVAL = coro_nready;
1111 OUTPUT: 1206 OUTPUT:
1112 RETVAL 1207 RETVAL
1113 1208
1209MODULE = Coro::State PACKAGE = Coro::AIO
1210
1211SV *
1212_get_state ()
1213 CODE:
1214{
1215 struct {
1216 int errorno;
1217 int laststype;
1218 int laststatval;
1219 Stat_t statcache;
1220 } data;
1221
1222 data.errorno = errno;
1223 data.laststype = PL_laststype;
1224 data.laststatval = PL_laststatval;
1225 data.statcache = PL_statcache;
1226
1227 RETVAL = newSVpvn ((char *)&data, sizeof data);
1228}
1229 OUTPUT:
1230 RETVAL
1231
1114void 1232void
1115schedule(...) 1233_set_state (char *data_)
1116 PROTOTYPE: 1234 PROTOTYPE: $
1117 CODE: 1235 CODE:
1118 api_schedule (); 1236{
1237 struct {
1238 int errorno;
1239 int laststype;
1240 int laststatval;
1241 Stat_t statcache;
1242 } *data = (void *)data_;
1119 1243
1120void 1244 errno = data->errorno;
1121cede(...) 1245 PL_laststype = data->laststype;
1122 PROTOTYPE: 1246 PL_laststatval = data->laststatval;
1123 CODE: 1247 PL_statcache = data->statcache;
1124 api_cede (); 1248}
1125

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines