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.61 by root, Tue Aug 10 01:56:30 2004 UTC vs.
Revision 1.111 by root, Thu Nov 30 18:21:14 2006 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines