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.67 by root, Mon Dec 12 20:07:44 2005 UTC vs.
Revision 1.109 by root, Mon Nov 27 18:45:29 2006 UTC

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

Diff Legend

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