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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines