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.89 by root, Sat Nov 25 00:40:26 2006 UTC vs.
Revision 1.143 by root, Wed Feb 28 11:43:03 2007 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#if PERL_VERSION < 6 9#include <stdio.h>
10#include <errno.h>
11#include <assert.h>
12
13#ifdef HAVE_MMAP
14# include <unistd.h>
15# include <sys/mman.h>
16# ifndef MAP_ANONYMOUS
17# ifdef MAP_ANON
18# define MAP_ANONYMOUS MAP_ANON
19# else
20# undef HAVE_MMAP
21# endif
22# endif
23# include <limits.h>
24# ifndef PAGESIZE
25# define PAGESIZE pagesize
26# define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE)
27static long pagesize;
28# else
29# define BOOT_PAGESIZE (void)0
30# endif
31#else
32# define PAGESIZE 0
33# define BOOT_PAGESIZE (void)0
34#endif
35
36#if CORO_USE_VALGRIND
37# include <valgrind/valgrind.h>
38# define REGISTER_STACK(cctx,start,end) (cctx)->valgrind_id = VALGRIND_STACK_REGISTER ((start), (end))
39#else
40# define REGISTER_STACK(cctx,start,end)
41#endif
42
43/* the maximum number of idle cctx that will be pooled */
44#define MAX_IDLE_CCTX 8
45
46#define PERL_VERSION_ATLEAST(a,b,c) \
47 (PERL_REVISION > (a) \
48 || (PERL_REVISION == (a) \
49 && (PERL_VERSION > (b) \
50 || (PERL_VERSION == (b) && PERLSUBVERSION >= (c)))))
51
52#if !PERL_VERSION_ATLEAST (5,6,0)
12# ifndef PL_ppaddr 53# ifndef PL_ppaddr
13# define PL_ppaddr ppaddr 54# define PL_ppaddr ppaddr
14# endif 55# endif
15# ifndef call_sv 56# ifndef call_sv
16# define call_sv perl_call_sv 57# define call_sv perl_call_sv
27# ifndef IS_PADCONST 68# ifndef IS_PADCONST
28# define IS_PADCONST(v) 0 69# define IS_PADCONST(v) 0
29# endif 70# endif
30#endif 71#endif
31 72
32#include <errno.h> 73/* 5.8.7 */
74#ifndef SvRV_set
75# define SvRV_set(s,v) SvRV(s) = (v)
76#endif
33 77
34#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64 78#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64
35# undef STACKGUARD 79# undef CORO_STACKGUARD
36#endif
37
38#ifndef STACKGUARD
39# define STACKGUARD 0
40#endif
41
42#ifdef HAVE_MMAP
43# include <unistd.h>
44# include <sys/mman.h>
45# ifndef MAP_ANONYMOUS
46# ifdef MAP_ANON
47# define MAP_ANONYMOUS MAP_ANON
48# else
49# undef HAVE_MMAP
50# endif
51# endif 80#endif
52# include <limits.h> 81
53# ifndef PAGESIZE 82#ifndef CORO_STACKGUARD
54# define PAGESIZE pagesize 83# define CORO_STACKGUARD 0
55# define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE)
56static long pagesize;
57# else
58# define BOOT_PAGESIZE
59# endif 84#endif
60#endif
61 85
62#define SUB_INIT "Coro::State::initialize" 86/* prefer perl internal functions over our own? */
87#ifndef CORO_PREFER_PERL_FUNCTIONS
88# define CORO_PREFER_PERL_FUNCTIONS 0
89#endif
63 90
64/* The next macro should declare a variable stacklevel that contains and approximation 91/* The next macro should declare a variable stacklevel that contains and approximation
65 * to the current C stack pointer. Its property is that it changes with each call 92 * to the current C stack pointer. Its property is that it changes with each call
66 * and should be unique. */ 93 * and should be unique. */
94#define dSTACKLEVEL int stacklevel
67#define dSTACKLEVEL void *stacklevel = &stacklevel 95#define STACKLEVEL ((void *)&stacklevel)
68 96
69#define IN_DESTRUCT (PL_main_cv == Nullcv) 97#define IN_DESTRUCT (PL_main_cv == Nullcv)
70 98
71#define labs(l) ((l) >= 0 ? (l) : -(l)) 99#if __GNUC__ >= 3
100# define attribute(x) __attribute__(x)
101# define BARRIER __asm__ __volatile__ ("" : : : "memory")
102#else
103# define attribute(x)
104# define BARRIER
105#endif
106
107#define NOINLINE attribute ((noinline))
72 108
73#include "CoroAPI.h" 109#include "CoroAPI.h"
74 110
75#ifdef USE_ITHREADS 111#ifdef USE_ITHREADS
76static perl_mutex coro_mutex; 112static perl_mutex coro_mutex;
79#else 115#else
80# define LOCK (void)0 116# define LOCK (void)0
81# define UNLOCK (void)0 117# define UNLOCK (void)0
82#endif 118#endif
83 119
120/* helper storage struct for Coro::AIO */
121struct io_state
122{
123 int errorno;
124 I32 laststype;
125 int laststatval;
126 Stat_t statcache;
127};
128
84static struct CoroAPI coroapi; 129static struct CoroAPI coroapi;
85static AV *main_mainstack; /* used to differentiate between $main and others */ 130static AV *main_mainstack; /* used to differentiate between $main and others */
86static HV *coro_state_stash, *coro_stash; 131static HV *coro_state_stash, *coro_stash;
87static SV *coro_mortal; /* will be freed after next transfer */ 132static SV *coro_mortal; /* will be freed after next transfer */
88 133
89/* this is actually not just the c stack but also c registers etc... */ 134static struct coro_cctx *cctx_first;
135static int cctx_count, cctx_idle;
136
137/* this is a structure representing a c-level coroutine */
90typedef struct coro_stack { 138typedef struct coro_cctx {
91 struct coro_stack *next; 139 struct coro_cctx *next;
92 140
93 void *idle_sp; 141 /* the stack */
94 void *sptr; 142 void *sptr;
95 long ssize; /* positive == mmap, otherwise malloc */ 143 ssize_t ssize; /* positive == mmap, otherwise malloc */
96 144
97 /* cpu state */ 145 /* cpu state */
146 void *idle_sp; /* sp of top-level transfer/schedule/cede call */
147 JMPENV *idle_te; /* same as idle_sp, but for top_env, TODO: remove once stable */
148 JMPENV *top_env;
98 coro_context cctx; 149 coro_context cctx;
99} coro_stack;
100 150
101static coro_stack *main_stack; 151 int inuse;
102 152
153#if CORO_USE_VALGRIND
154 int valgrind_id;
155#endif
156} coro_cctx;
157
158enum {
159 CF_RUNNING = 0x0001, /* coroutine is running */
160 CF_READY = 0x0002, /* coroutine is ready */
161 CF_NEW = 0x0004, /* has never been switched to */
162 CF_DESTROYED = 0x0008, /* coroutine data has been freed */
163};
164
165/* this is a structure representing a perl-level coroutine */
103struct coro { 166struct coro {
104 /* optionally saved, might be zero */ 167 /* the c coroutine allocated to this perl coroutine, if any */
105 AV *defav; 168 coro_cctx *cctx;
106 SV *defsv;
107 SV *errsv;
108
109 /* saved global state not related to stacks */
110 U8 dowarn;
111 I32 in_eval;
112
113 /* the c stack, if any */
114 coro_stack *stack;
115
116 /* the stacks and related info (callchain etc..) */
117 PERL_SI *curstackinfo;
118 AV *curstack;
119 AV *mainstack;
120 SV **stack_sp;
121 OP *op;
122 SV **curpad;
123 AV *comppad;
124 CV *compcv;
125 SV **stack_base;
126 SV **stack_max;
127 SV **tmps_stack;
128 I32 tmps_floor;
129 I32 tmps_ix;
130 I32 tmps_max;
131 I32 *markstack;
132 I32 *markstack_ptr;
133 I32 *markstack_max;
134 I32 *scopestack;
135 I32 scopestack_ix;
136 I32 scopestack_max;
137 ANY *savestack;
138 I32 savestack_ix;
139 I32 savestack_max;
140 OP **retstack;
141 I32 retstack_ix;
142 I32 retstack_max;
143 PMOP *curpm;
144 COP *curcop;
145 JMPENV *top_env;
146
147 /* coro process data */
148 int prio;
149 169
150 /* data associated with this coroutine (initial args) */ 170 /* data associated with this coroutine (initial args) */
151 AV *args; 171 AV *args;
152 int refcnt; 172 int refcnt;
173 int save; /* CORO_SAVE flags */
174 int flags; /* CF_ flags */
175
176 /* optionally saved, might be zero */
177 AV *defav; /* @_ */
178 SV *defsv; /* $_ */
179 SV *errsv; /* $@ */
180 SV *irssv; /* $/ */
181 SV *irssv_sv; /* real $/ cache */
182
183#define VAR(name,type) type name;
184# include "state.h"
185#undef VAR
186
187 /* coro process data */
188 int prio;
153}; 189};
154 190
155typedef struct coro *Coro__State; 191typedef struct coro *Coro__State;
156typedef struct coro *Coro__State_or_hashref; 192typedef struct coro *Coro__State_or_hashref;
157 193
194/** Coro ********************************************************************/
195
196#define PRIO_MAX 3
197#define PRIO_HIGH 1
198#define PRIO_NORMAL 0
199#define PRIO_LOW -1
200#define PRIO_IDLE -3
201#define PRIO_MIN -4
202
203/* for Coro.pm */
204static SV *coro_current;
205static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
206static int coro_nready;
207
208/** lowlevel stuff **********************************************************/
209
158static AV * 210static AV *
159coro_clone_padlist (pTHX_ CV *cv) 211coro_clone_padlist (CV *cv)
160{ 212{
161 AV *padlist = CvPADLIST (cv); 213 AV *padlist = CvPADLIST (cv);
162 AV *newpadlist, *newpad; 214 AV *newpadlist, *newpad;
163 215
164 newpadlist = newAV (); 216 newpadlist = newAV ();
165 AvREAL_off (newpadlist); 217 AvREAL_off (newpadlist);
166#if PERL_VERSION < 9 218#if PERL_VERSION_ATLEAST (5,9,0)
219 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1);
220#else
167 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1); 221 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1);
168#else
169 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1);
170#endif 222#endif
171 newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)]; 223 newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)];
172 --AvFILLp (padlist); 224 --AvFILLp (padlist);
173 225
174 av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE))); 226 av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE)));
176 228
177 return newpadlist; 229 return newpadlist;
178} 230}
179 231
180static void 232static void
181free_padlist (pTHX_ AV *padlist) 233free_padlist (AV *padlist)
182{ 234{
183 /* may be during global destruction */ 235 /* may be during global destruction */
184 if (SvREFCNT (padlist)) 236 if (SvREFCNT (padlist))
185 { 237 {
186 I32 i = AvFILLp (padlist); 238 I32 i = AvFILLp (padlist);
207 AV *padlist; 259 AV *padlist;
208 AV *av = (AV *)mg->mg_obj; 260 AV *av = (AV *)mg->mg_obj;
209 261
210 /* casting is fun. */ 262 /* casting is fun. */
211 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) 263 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
212 free_padlist (aTHX_ padlist); 264 free_padlist (padlist);
213 265
214 SvREFCNT_dec (av); 266 SvREFCNT_dec (av);
215 267
216 return 0; 268 return 0;
217} 269}
218 270
219#define PERL_MAGIC_coro PERL_MAGIC_ext 271#define PERL_MAGIC_coro PERL_MAGIC_ext
220 272
221static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; 273static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
222 274
275#define CORO_MAGIC(cv) \
276 SvMAGIC (cv) \
277 ? SvMAGIC (cv)->mg_type == PERL_MAGIC_coro \
278 ? SvMAGIC (cv) \
279 : mg_find ((SV *)cv, PERL_MAGIC_coro) \
280 : 0
281
223/* the next two functions merely cache the padlists */ 282/* the next two functions merely cache the padlists */
224static void 283static void
225get_padlist (pTHX_ CV *cv) 284get_padlist (CV *cv)
226{ 285{
227 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); 286 MAGIC *mg = CORO_MAGIC (cv);
287 AV *av;
228 288
229 if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0) 289 if (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0)
230 CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj); 290 CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--];
231 else 291 else
232 { 292 {
233#if 0 293#if CORO_PREFER_PERL_FUNCTIONS
234 /* this should work - but it doesn't :( */ 294 /* this is probably cleaner, but also slower? */
235 CV *cp = Perl_cv_clone (aTHX_ cv); 295 CV *cp = Perl_cv_clone (cv);
236 CvPADLIST (cv) = CvPADLIST (cp); 296 CvPADLIST (cv) = CvPADLIST (cp);
237 CvPADLIST (cp) = 0; 297 CvPADLIST (cp) = 0;
238 SvREFCNT_dec (cp); 298 SvREFCNT_dec (cp);
239#else 299#else
240 CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv); 300 CvPADLIST (cv) = coro_clone_padlist (cv);
241#endif 301#endif
242 } 302 }
243} 303}
244 304
245static void 305static void
246put_padlist (pTHX_ CV *cv) 306put_padlist (CV *cv)
247{ 307{
248 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); 308 MAGIC *mg = CORO_MAGIC (cv);
309 AV *av;
249 310
250 if (!mg) 311 if (!mg)
251 { 312 {
252 sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0); 313 sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0);
253 mg = mg_find ((SV *)cv, PERL_MAGIC_coro); 314 mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
254 mg->mg_virtual = &vtbl_coro; 315 mg->mg_virtual = &vtbl_coro;
255 mg->mg_obj = (SV *)newAV (); 316 mg->mg_obj = (SV *)newAV ();
256 } 317 }
257 318
258 av_push ((AV *)mg->mg_obj, (SV *)CvPADLIST (cv)); 319 av = (AV *)mg->mg_obj;
320
321 if (AvFILLp (av) >= AvMAX (av))
322 av_extend (av, AvMAX (av) + 1);
323
324 AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv);
259} 325}
326
327/** load & save, init *******************************************************/
260 328
261#define SB do { 329#define SB do {
262#define SE } while (0) 330#define SE } while (0)
263 331
264#define LOAD(state) load_state(aTHX_ (state));
265#define SAVE(state,flags) save_state(aTHX_ (state),(flags));
266
267#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE 332#define REPLACE_SV(sv,val) SB SvREFCNT_dec (sv); (sv) = (val); (val) = 0; SE
268 333
269static void 334static void
270load_state(pTHX_ Coro__State c) 335load_perl (Coro__State c)
271{ 336{
272 PL_dowarn = c->dowarn; 337#define VAR(name,type) PL_ ## name = c->name;
273 PL_in_eval = c->in_eval; 338# include "state.h"
274 339#undef VAR
275 PL_curstackinfo = c->curstackinfo;
276 PL_curstack = c->curstack;
277 PL_mainstack = c->mainstack;
278 PL_stack_sp = c->stack_sp;
279 PL_op = c->op;
280 PL_curpad = c->curpad;
281 PL_comppad = c->comppad;
282 PL_compcv = c->compcv;
283 PL_stack_base = c->stack_base;
284 PL_stack_max = c->stack_max;
285 PL_tmps_stack = c->tmps_stack;
286 PL_tmps_floor = c->tmps_floor;
287 PL_tmps_ix = c->tmps_ix;
288 PL_tmps_max = c->tmps_max;
289 PL_markstack = c->markstack;
290 PL_markstack_ptr = c->markstack_ptr;
291 PL_markstack_max = c->markstack_max;
292 PL_scopestack = c->scopestack;
293 PL_scopestack_ix = c->scopestack_ix;
294 PL_scopestack_max = c->scopestack_max;
295 PL_savestack = c->savestack;
296 PL_savestack_ix = c->savestack_ix;
297 PL_savestack_max = c->savestack_max;
298#if PERL_VERSION < 9
299 PL_retstack = c->retstack;
300 PL_retstack_ix = c->retstack_ix;
301 PL_retstack_max = c->retstack_max;
302#endif
303 PL_curpm = c->curpm;
304 PL_curcop = c->curcop;
305 PL_top_env = c->top_env;
306 340
307 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); 341 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
308 if (c->defsv) REPLACE_SV (DEFSV , c->defsv); 342 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
309 if (c->errsv) REPLACE_SV (ERRSV , c->errsv); 343 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
344 if (c->irssv)
345 {
346 if (c->irssv == PL_rs || sv_eq (PL_rs, c->irssv))
347 SvREFCNT_dec (c->irssv);
348 else
349 {
350 REPLACE_SV (PL_rs, c->irssv);
351 if (!c->irssv_sv) c->irssv_sv = get_sv ("/", 0);
352 sv_setsv (c->irssv_sv, PL_rs);
353 }
354 }
310 355
311 { 356 {
312 dSP; 357 dSP;
313 CV *cv; 358 CV *cv;
314 359
315 /* now do the ugly restore mess */ 360 /* now do the ugly restore mess */
316 while ((cv = (CV *)POPs)) 361 while ((cv = (CV *)POPs))
317 { 362 {
318 AV *padlist = (AV *)POPs;
319
320 if (padlist)
321 {
322 put_padlist (aTHX_ cv); /* mark this padlist as available */ 363 put_padlist (cv); /* mark this padlist as available */
323 CvPADLIST(cv) = padlist; 364 CvDEPTH (cv) = PTR2IV (POPs);
324 } 365 CvPADLIST (cv) = (AV *)POPs;
325
326 ++CvDEPTH(cv);
327 } 366 }
328 367
329 PUTBACK; 368 PUTBACK;
330 } 369 }
370 assert (!PL_comppad || AvARRAY (PL_comppad));//D
331} 371}
332 372
333static void 373static void
334save_state(pTHX_ Coro__State c, int flags) 374save_perl (Coro__State c)
335{ 375{
376 assert (!PL_comppad || AvARRAY (PL_comppad));//D
336 { 377 {
337 dSP; 378 dSP;
338 I32 cxix = cxstack_ix; 379 I32 cxix = cxstack_ix;
339 PERL_CONTEXT *ccstk = cxstack; 380 PERL_CONTEXT *ccstk = cxstack;
340 PERL_SI *top_si = PL_curstackinfo; 381 PERL_SI *top_si = PL_curstackinfo;
342 /* 383 /*
343 * the worst thing you can imagine happens first - we have to save 384 * the worst thing you can imagine happens first - we have to save
344 * (and reinitialize) all cv's in the whole callchain :( 385 * (and reinitialize) all cv's in the whole callchain :(
345 */ 386 */
346 387
388 EXTEND (SP, 3 + 1);
347 PUSHs (Nullsv); 389 PUSHs (Nullsv);
348 /* this loop was inspired by pp_caller */ 390 /* this loop was inspired by pp_caller */
349 for (;;) 391 for (;;)
350 { 392 {
351 while (cxix >= 0) 393 while (cxix >= 0)
352 { 394 {
353 PERL_CONTEXT *cx = &ccstk[cxix--]; 395 PERL_CONTEXT *cx = &ccstk[cxix--];
354 396
355 if (CxTYPE(cx) == CXt_SUB) 397 if (CxTYPE (cx) == CXt_SUB)
356 { 398 {
357 CV *cv = cx->blk_sub.cv; 399 CV *cv = cx->blk_sub.cv;
400
358 if (CvDEPTH(cv)) 401 if (CvDEPTH (cv))
359 { 402 {
360 EXTEND (SP, CvDEPTH(cv)*2); 403 EXTEND (SP, 3);
361
362 while (--CvDEPTH(cv))
363 {
364 /* this tells the restore code to increment CvDEPTH */
365 PUSHs (Nullsv);
366 PUSHs ((SV *)cv);
367 }
368
369 PUSHs ((SV *)CvPADLIST(cv)); 404 PUSHs ((SV *)CvPADLIST (cv));
405 PUSHs (INT2PTR (SV *, CvDEPTH (cv)));
370 PUSHs ((SV *)cv); 406 PUSHs ((SV *)cv);
371 407
408 CvDEPTH (cv) = 0;
372 get_padlist (aTHX_ cv); 409 get_padlist (cv);
373 } 410 }
374 } 411 }
375#ifdef CXt_FORMAT
376 else if (CxTYPE(cx) == CXt_FORMAT)
377 {
378 /* I never used formats, so how should I know how these are implemented? */
379 /* my bold guess is as a simple, plain sub... */
380 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
381 }
382#endif
383 } 412 }
384 413
385 if (top_si->si_type == PERLSI_MAIN) 414 if (top_si->si_type == PERLSI_MAIN)
386 break; 415 break;
387 416
391 } 420 }
392 421
393 PUTBACK; 422 PUTBACK;
394 } 423 }
395 424
396 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; 425 c->defav = c->save & CORO_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
397 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; 426 c->defsv = c->save & CORO_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
398 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; 427 c->errsv = c->save & CORO_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
428 c->irssv = c->save & CORO_SAVE_IRSSV ? SvREFCNT_inc (PL_rs) : 0;
399 429
400 c->dowarn = PL_dowarn; 430#define VAR(name,type)c->name = PL_ ## name;
401 c->in_eval = PL_in_eval; 431# include "state.h"
402 432#undef VAR
403 c->curstackinfo = PL_curstackinfo;
404 c->curstack = PL_curstack;
405 c->mainstack = PL_mainstack;
406 c->stack_sp = PL_stack_sp;
407 c->op = PL_op;
408 c->curpad = PL_curpad;
409 c->comppad = PL_comppad;
410 c->compcv = PL_compcv;
411 c->stack_base = PL_stack_base;
412 c->stack_max = PL_stack_max;
413 c->tmps_stack = PL_tmps_stack;
414 c->tmps_floor = PL_tmps_floor;
415 c->tmps_ix = PL_tmps_ix;
416 c->tmps_max = PL_tmps_max;
417 c->markstack = PL_markstack;
418 c->markstack_ptr = PL_markstack_ptr;
419 c->markstack_max = PL_markstack_max;
420 c->scopestack = PL_scopestack;
421 c->scopestack_ix = PL_scopestack_ix;
422 c->scopestack_max = PL_scopestack_max;
423 c->savestack = PL_savestack;
424 c->savestack_ix = PL_savestack_ix;
425 c->savestack_max = PL_savestack_max;
426#if PERL_VERSION < 9
427 c->retstack = PL_retstack;
428 c->retstack_ix = PL_retstack_ix;
429 c->retstack_max = PL_retstack_max;
430#endif
431 c->curpm = PL_curpm;
432 c->curcop = PL_curcop;
433 c->top_env = PL_top_env;
434} 433}
435 434
436/* 435/*
437 * allocate various perl stacks. This is an exact copy 436 * allocate various perl stacks. This is an exact copy
438 * of perl.c:init_stacks, except that it uses less memory 437 * of perl.c:init_stacks, except that it uses less memory
439 * on the (sometimes correct) assumption that coroutines do 438 * on the (sometimes correct) assumption that coroutines do
440 * not usually need a lot of stackspace. 439 * not usually need a lot of stackspace.
441 */ 440 */
441#if CORO_PREFER_PERL_FUNCTIONS
442# define coro_init_stacks init_stacks
443#else
442static void 444static void
443coro_init_stacks (pTHX) 445coro_init_stacks ()
444{ 446{
445 LOCK;
446
447 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 447 PL_curstackinfo = new_stackinfo(128, 1024/sizeof(PERL_CONTEXT));
448 PL_curstackinfo->si_type = PERLSI_MAIN; 448 PL_curstackinfo->si_type = PERLSI_MAIN;
449 PL_curstack = PL_curstackinfo->si_stack; 449 PL_curstack = PL_curstackinfo->si_stack;
450 PL_mainstack = PL_curstack; /* remember in case we switch stacks */ 450 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
451 451
452 PL_stack_base = AvARRAY(PL_curstack); 452 PL_stack_base = AvARRAY(PL_curstack);
453 PL_stack_sp = PL_stack_base; 453 PL_stack_sp = PL_stack_base;
454 PL_stack_max = PL_stack_base + AvMAX(PL_curstack); 454 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
455 455
456 New(50,PL_tmps_stack,96,SV*); 456 New(50,PL_tmps_stack,128,SV*);
457 PL_tmps_floor = -1; 457 PL_tmps_floor = -1;
458 PL_tmps_ix = -1; 458 PL_tmps_ix = -1;
459 PL_tmps_max = 96; 459 PL_tmps_max = 128;
460 460
461 New(54,PL_markstack,16,I32); 461 New(54,PL_markstack,32,I32);
462 PL_markstack_ptr = PL_markstack; 462 PL_markstack_ptr = PL_markstack;
463 PL_markstack_max = PL_markstack + 16; 463 PL_markstack_max = PL_markstack + 32;
464 464
465#ifdef SET_MARK_OFFSET 465#ifdef SET_MARK_OFFSET
466 SET_MARK_OFFSET; 466 SET_MARK_OFFSET;
467#endif 467#endif
468 468
469 New(54,PL_scopestack,16,I32); 469 New(54,PL_scopestack,32,I32);
470 PL_scopestack_ix = 0; 470 PL_scopestack_ix = 0;
471 PL_scopestack_max = 16; 471 PL_scopestack_max = 32;
472 472
473 New(54,PL_savestack,96,ANY); 473 New(54,PL_savestack,64,ANY);
474 PL_savestack_ix = 0; 474 PL_savestack_ix = 0;
475 PL_savestack_max = 96; 475 PL_savestack_max = 64;
476 476
477#if PERL_VERSION < 9 477#if !PERL_VERSION_ATLEAST (5,9,0)
478 New(54,PL_retstack,8,OP*); 478 New(54,PL_retstack,16,OP*);
479 PL_retstack_ix = 0; 479 PL_retstack_ix = 0;
480 PL_retstack_max = 8; 480 PL_retstack_max = 16;
481#endif 481#endif
482
483 UNLOCK;
484} 482}
483#endif
485 484
486/* 485/*
487 * destroy the stacks, the callchain etc... 486 * destroy the stacks, the callchain etc...
488 */ 487 */
489static void 488static void
490destroy_stacks(pTHX) 489coro_destroy_stacks ()
491{ 490{
492 if (!IN_DESTRUCT) 491 if (!IN_DESTRUCT)
493 { 492 {
494 /* is this ugly, I ask? */ 493 /* restore all saved variables and stuff */
495 LEAVE_SCOPE (0); 494 LEAVE_SCOPE (0);
495 assert (PL_tmps_floor == -1);
496 496
497 /* sure it is, but more important: is it correct?? :/ */ 497 /* free all temporaries */
498 FREETMPS; 498 FREETMPS;
499 assert (PL_tmps_ix == -1);
499 500
501 /* unwind all extra stacks */
500 /*POPSTACK_TO (PL_mainstack);*//*D*//*use*/ 502 POPSTACK_TO (PL_mainstack);
503
504 /* unwind main stack */
505 dounwind (-1);
501 } 506 }
502 507
503 while (PL_curstackinfo->si_next) 508 while (PL_curstackinfo->si_next)
504 PL_curstackinfo = PL_curstackinfo->si_next; 509 PL_curstackinfo = PL_curstackinfo->si_next;
505 510
506 while (PL_curstackinfo) 511 while (PL_curstackinfo)
507 { 512 {
508 PERL_SI *p = PL_curstackinfo->si_prev; 513 PERL_SI *p = PL_curstackinfo->si_prev;
509 514
510 { /*D*//*remove*/
511 dSP;
512 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
513 PUTBACK; /* possibly superfluous */
514 }
515
516 if (!IN_DESTRUCT) 515 if (!IN_DESTRUCT)
517 {
518 dounwind (-1);/*D*//*remove*/
519 SvREFCNT_dec (PL_curstackinfo->si_stack); 516 SvREFCNT_dec (PL_curstackinfo->si_stack);
520 }
521 517
522 Safefree (PL_curstackinfo->si_cxstack); 518 Safefree (PL_curstackinfo->si_cxstack);
523 Safefree (PL_curstackinfo); 519 Safefree (PL_curstackinfo);
524 PL_curstackinfo = p; 520 PL_curstackinfo = p;
525 } 521 }
526 522
527 Safefree (PL_tmps_stack); 523 Safefree (PL_tmps_stack);
528 Safefree (PL_markstack); 524 Safefree (PL_markstack);
529 Safefree (PL_scopestack); 525 Safefree (PL_scopestack);
530 Safefree (PL_savestack); 526 Safefree (PL_savestack);
531#if PERL_VERSION < 9 527#if !PERL_VERSION_ATLEAST (5,9,0)
532 Safefree (PL_retstack); 528 Safefree (PL_retstack);
533#endif 529#endif
534} 530}
531
532/** coroutine stack handling ************************************************/
535 533
536static void 534static void
537setup_coro (struct coro *coro) 535setup_coro (struct coro *coro)
538{ 536{
539 /* 537 /*
540 * emulate part of the perl startup here. 538 * emulate part of the perl startup here.
541 */ 539 */
542 dTHX; 540
541 coro_init_stacks ();
542
543 PL_curcop = &PL_compiling;
544 PL_in_eval = EVAL_NULL;
545 PL_comppad = 0;
546 PL_curpm = 0;
547 PL_localizing = 0;
548 PL_dirty = 0;
549 PL_restartop = 0;
550
551 {
552 dSP;
553 LOGOP myop;
554
555 SvREFCNT_dec (GvAV (PL_defgv));
556 GvAV (PL_defgv) = coro->args; coro->args = 0;
557
558 Zero (&myop, 1, LOGOP);
559 myop.op_next = Nullop;
560 myop.op_flags = OPf_WANT_VOID;
561
562 PUSHMARK (SP);
563 XPUSHs ((SV *)get_cv ("Coro::State::_coro_init", FALSE));
564 PUTBACK;
565 PL_op = (OP *)&myop;
566 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
567 SPAGAIN;
568 }
569
570 ENTER; /* necessary e.g. for dounwind */
571}
572
573static void
574free_coro_mortal ()
575{
576 if (coro_mortal)
577 {
578 SvREFCNT_dec (coro_mortal);
579 coro_mortal = 0;
580 }
581}
582
583/* inject a fake call to Coro::State::_cctx_init into the execution */
584static void NOINLINE
585prepare_cctx (coro_cctx *cctx)
586{
543 dSP; 587 dSP;
544 UNOP myop; 588 LOGOP myop;
545 SV *sub_init = (SV *)get_cv (SUB_INIT, FALSE);
546 589
547 coro_init_stacks (aTHX);
548 /*PL_curcop = 0;*/
549 /*PL_in_eval = PL_in_eval;*/ /* inherit */
550 SvREFCNT_dec (GvAV (PL_defgv));
551 GvAV (PL_defgv) = coro->args; coro->args = 0;
552
553 SPAGAIN;
554
555 Zero (&myop, 1, UNOP); 590 Zero (&myop, 1, LOGOP);
556 myop.op_next = Nullop; 591 myop.op_next = PL_op;
557 myop.op_flags = OPf_WANT_VOID; 592 myop.op_flags = OPf_WANT_VOID | OPf_STACKED;
558 593
594 PUSHMARK (SP);
595 EXTEND (SP, 2);
596 PUSHs (sv_2mortal (newSViv (PTR2IV (cctx))));
597 PUSHs ((SV *)get_cv ("Coro::State::_cctx_init", FALSE));
598 PUTBACK;
559 PL_op = (OP *)&myop; 599 PL_op = (OP *)&myop;
560
561 PUSHMARK(SP);
562 XPUSHs (sub_init);
563 PUTBACK;
564 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); 600 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
565 SPAGAIN; 601 SPAGAIN;
566
567 ENTER; /* necessary e.g. for dounwind */
568} 602}
569 603
570static void 604static void
571transfer_tail () 605coro_run (void *arg)
572{ 606{
573 if (coro_mortal) 607 /* coro_run is the alternative tail of transfer(), so unlock here. */
574 {
575 SvREFCNT_dec (coro_mortal);
576 coro_mortal = 0;
577 }
578
579 UNLOCK; 608 UNLOCK;
580}
581 609
582static void
583coro_run (void *arg)
584{
585 /* 610 /*
586 * this is a _very_ stripped down perl interpreter ;) 611 * this is a _very_ stripped down perl interpreter ;)
587 */ 612 */
588 dTHX;
589
590 transfer_tail ();
591
592 PL_top_env = &PL_start_env; 613 PL_top_env = &PL_start_env;
593 PL_restartop = PL_op->op_next; 614
615 /* inject call to cctx_init */
616 prepare_cctx ((coro_cctx *)arg);
617
594 /* somebody will hit me for both perl_run and PL_restart_top */ 618 /* somebody will hit me for both perl_run and PL_restartop */
595 perl_run (aTHX_ PERL_GET_CONTEXT); 619 PL_restartop = PL_op;
620 perl_run (PL_curinterp);
596 621
622 fputs ("FATAL: C coroutine fell over the edge of the world, aborting. Did you call exit in a coroutine?\n", stderr);
597 abort (); 623 abort ();
598} 624}
599 625
600static coro_stack * 626static coro_cctx *
601stack_new () 627cctx_new ()
602{ 628{
603 coro_stack *stack; 629 coro_cctx *cctx;
604 630
631 ++cctx_count;
632
605 New (0, stack, 1, coro_stack); 633 Newz (0, cctx, 1, coro_cctx);
606 634
607#if HAVE_MMAP 635#if HAVE_MMAP
608 636
609 stack->ssize = ((STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + STACKGUARD) * PAGESIZE; /* mmap should do allocate-on-write for us */ 637 cctx->ssize = ((CORO_STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + CORO_STACKGUARD) * PAGESIZE;
638 /* mmap supposedly does allocate-on-write for us */
610 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); 639 cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
611 640
612 if (stack->sptr == (void *)-1) 641 if (cctx->sptr != (void *)-1)
642 {
643# if CORO_STACKGUARD
644 mprotect (cctx->sptr, CORO_STACKGUARD * PAGESIZE, PROT_NONE);
645# endif
646 REGISTER_STACK (
647 cctx,
648 CORO_STACKGUARD * PAGESIZE + (char *)cctx->sptr,
649 cctx->ssize + (char *)cctx->sptr
650 );
651
652 coro_create (&cctx->cctx, coro_run, (void *)cctx, cctx->sptr, cctx->ssize);
613 { 653 }
654 else
655#endif
656 {
657 cctx->ssize = -CORO_STACKSIZE * (long)sizeof (long);
658 New (0, cctx->sptr, CORO_STACKSIZE, long);
659
660 if (!cctx->sptr)
661 {
614 fprintf (stderr, "FATAL: unable to mmap stack for coroutine\n"); 662 perror ("FATAL: unable to allocate stack for coroutine");
615 _exit (EXIT_FAILURE); 663 _exit (EXIT_FAILURE);
616 } 664 }
617 665
618 mprotect (stack->sptr, STACKGUARD * PAGESIZE, PROT_NONE); 666 REGISTER_STACK (
667 cctx,
668 (char *)cctx->sptr,
669 (char *)cctx->sptr - cctx->ssize
670 );
619 671
620#else 672 coro_create (&cctx->cctx, coro_run, (void *)cctx, cctx->sptr, -cctx->ssize);
621
622 stack->ssize = STACKSIZE * (long)sizeof (long);
623 New (0, stack->sptr, STACKSIZE, long);
624
625 if (!stack->sptr)
626 { 673 }
627 fprintf (stderr, "FATAL: unable to malloc stack for coroutine\n");
628 _exit (EXIT_FAILURE);
629 }
630 674
631#endif
632
633 coro_create (&stack->cctx, coro_run, 0, stack->sptr, stack->ssize);
634
635 return stack; 675 return cctx;
636} 676}
637 677
638static void 678static void
639stack_free (coro_stack *stack) 679cctx_destroy (coro_cctx *cctx)
640{ 680{
641 if (!stack || stack == main_stack) 681 if (!cctx)
642 return; 682 return;
643 683
684 --cctx_count;
685
686#if CORO_USE_VALGRIND
687 VALGRIND_STACK_DEREGISTER (cctx->valgrind_id);
688#endif
689
644#if HAVE_MMAP 690#if HAVE_MMAP
691 if (cctx->ssize > 0)
645 munmap (stack->sptr, stack->ssize); 692 munmap (cctx->sptr, cctx->ssize);
646#else
647 Safefree (stack->sptr);
648#endif
649
650 Safefree (stack);
651}
652
653static coro_stack *stack_first;
654
655static void
656stack_get (struct coro *coro)
657{
658 if (stack_first)
659 {
660 coro->stack = stack_first;
661 stack_first = stack_first->next;
662 }
663 else 693 else
664 coro->stack = stack_new (); 694#endif
665} 695 Safefree (cctx->sptr);
666 696
667static void 697 Safefree (cctx);
668stack_put (coro_stack *stack)
669{
670 stack->next = stack_first;
671 stack_first = stack;
672} 698}
699
700static coro_cctx *
701cctx_get ()
702{
703 coro_cctx *cctx;
704
705 if (cctx_first)
706 {
707 cctx = cctx_first;
708 cctx_first = cctx->next;
709 --cctx_idle;
710 }
711 else
712 {
713 cctx = cctx_new ();
714 PL_op = PL_op->op_next;
715 }
716
717 return cctx;
718}
719
720static void
721cctx_put (coro_cctx *cctx)
722{
723 /* free another cctx if overlimit */
724 if (cctx_idle >= MAX_IDLE_CCTX)
725 {
726 coro_cctx *first = cctx_first;
727 cctx_first = first->next;
728 --cctx_idle;
729
730 assert (!first->inuse);
731 cctx_destroy (first);
732 }
733
734 ++cctx_idle;
735 cctx->next = cctx_first;
736 cctx_first = cctx;
737}
738
739/** coroutine switching *****************************************************/
673 740
674/* never call directly, always through the coro_state_transfer global variable */ 741/* never call directly, always through the coro_state_transfer global variable */
675static void 742static void NOINLINE
676transfer_impl (pTHX_ struct coro *prev, struct coro *next, int flags) 743transfer (struct coro *prev, struct coro *next)
677{ 744{
678 dSTACKLEVEL; 745 dSTACKLEVEL;
679 746
680 /* sometimes transfer is only called to set idle_sp */ 747 /* sometimes transfer is only called to set idle_sp */
681 if (!prev->stack->idle_sp) 748 if (!next)
682 prev->stack->idle_sp = stacklevel; 749 {
683 750 ((coro_cctx *)prev)->idle_sp = STACKLEVEL;
684 LOCK; 751 assert (((coro_cctx *)prev)->idle_te = PL_top_env); /* just for the side-effect when asserts are enabled */
685 752 }
686 if (prev != next) 753 else if (prev != next)
687 { 754 {
688 coro_stack *prev_stack = prev->stack; 755 coro_cctx *prev__cctx;
689 756
690 /* possibly "free" the stack */ 757 if (prev->flags & CF_NEW)
691 if (prev_stack->idle_sp == stacklevel)
692 { 758 {
693 stack_put (prev_stack); 759 /* create a new empty context */
694 prev->stack = 0; 760 Newz (0, prev->cctx, 1, coro_cctx);
761 prev->cctx->inuse = 1;
762 prev->flags &= ~CF_NEW;
763 prev->flags |= CF_RUNNING;
695 } 764 }
696 765
697 if (!next->mainstack) 766 /*TODO: must not croak here */
767 if (!prev->flags & CF_RUNNING)
768 croak ("Coro::State::transfer called with non-running prev Coro::State, but can only transfer from running states");
769
770 if (next->flags & CF_RUNNING)
771 croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states");
772
773 if (next->flags & CF_DESTROYED)
774 croak ("Coro::State::transfer called with destroyed next Coro::State, but can only transfer to inactive states");
775
776 prev->flags &= ~CF_RUNNING;
777 next->flags |= CF_RUNNING;
778
779 LOCK;
780
781 if (next->flags & CF_NEW)
698 { 782 {
783 /* need to start coroutine */
784 next->flags &= ~CF_NEW;
699 /* first get rid of the old state */ 785 /* first get rid of the old state */
700 SAVE (prev, -1); 786 save_perl (prev);
701 /* setup coroutine call */ 787 /* setup coroutine call */
702 setup_coro (next); 788 setup_coro (next);
703 next->stack = 0; 789 /* need a new stack */
790 assert (!next->cctx);
704 } 791 }
705 else 792 else
706 { 793 {
707 SAVE (prev, flags); 794 /* coroutine already started */
708 LOAD (next); 795 save_perl (prev);
796 load_perl (next);
709 } 797 }
710 798
799 prev__cctx = prev->cctx;
800
801 /* possibly "free" the cctx */
802 if (prev__cctx->idle_sp == STACKLEVEL)
803 {
804 /* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */
805 assert (("ERROR: current top_env must equal previous top_env", PL_top_env == prev__cctx->idle_te));
806
807 prev->cctx = 0;
808
809 cctx_put (prev__cctx);
810 prev__cctx->inuse = 0;
811 }
812
711 if (!next->stack) 813 if (!next->cctx)
712 stack_get (next); 814 {
815 next->cctx = cctx_get ();
816 assert (!next->cctx->inuse);
817 next->cctx->inuse = 1;
818 }
713 819
714 if (prev_stack != next->stack) 820 if (prev__cctx != next->cctx)
821 {
822 prev__cctx->top_env = PL_top_env;
823 PL_top_env = next->cctx->top_env;
715 coro_transfer (&prev_stack->cctx, &next->stack->cctx); 824 coro_transfer (&prev__cctx->cctx, &next->cctx->cctx);
716 } 825 }
717 826
718 transfer_tail (); 827 free_coro_mortal ();
828 UNLOCK;
829 }
719} 830}
720 831
721/* use this function pointer to call the above function */ 832struct transfer_args
722/* this is done to increase chances of the compiler not inlining the call */ 833{
723void (*coro_state_transfer)(pTHX_ struct coro *prev, struct coro *next, int flags) = transfer_impl; 834 struct coro *prev, *next;
835};
724 836
837#define TRANSFER(ta) transfer ((ta).prev, (ta).next)
838
839/** high level stuff ********************************************************/
840
725static void 841static int
726coro_state_destroy (struct coro *coro) 842coro_state_destroy (struct coro *coro)
727{ 843{
728 if (coro->refcnt--) 844 if (coro->flags & CF_DESTROYED)
729 return; 845 return 0;
846
847 coro->flags |= CF_DESTROYED;
848
849 if (coro->flags & CF_READY)
850 {
851 /* reduce nready, as destroying a ready coro effectively unreadies it */
852 /* alternative: look through all ready queues and remove the coro */
853 LOCK;
854 --coro_nready;
855 UNLOCK;
856 }
857 else
858 coro->flags |= CF_READY; /* make sure it is NOT put into the readyqueue */
730 859
731 if (coro->mainstack && coro->mainstack != main_mainstack) 860 if (coro->mainstack && coro->mainstack != main_mainstack)
732 { 861 {
733 struct coro temp; 862 struct coro temp;
734 863
735 SAVE (aTHX_ (&temp), TRANSFER_SAVE_ALL); 864 assert (!(coro->flags & CF_RUNNING));
736 LOAD (aTHX_ coro);
737 865
866 Zero (&temp, 1, struct coro);
867 temp.save = CORO_SAVE_ALL;
868
869 if (coro->flags & CF_RUNNING)
870 croak ("FATAL: tried to destroy currently running coroutine");
871
872 save_perl (&temp);
873 load_perl (coro);
874
738 destroy_stacks (aTHX); 875 coro_destroy_stacks ();
739 876
740 LOAD ((&temp)); /* this will get rid of defsv etc.. */ 877 load_perl (&temp); /* this will get rid of defsv etc.. */
741 878
742 coro->mainstack = 0; 879 coro->mainstack = 0;
743 } 880 }
744 881
745 stack_free (coro->stack); 882 cctx_destroy (coro->cctx);
746 SvREFCNT_dec (coro->args); 883 SvREFCNT_dec (coro->args);
747 Safefree (coro); 884
885 return 1;
748} 886}
749 887
750static int 888static int
751coro_state_clear (SV *sv, MAGIC *mg) 889coro_state_free (pTHX_ SV *sv, MAGIC *mg)
752{ 890{
753 struct coro *coro = (struct coro *)mg->mg_ptr; 891 struct coro *coro = (struct coro *)mg->mg_ptr;
754 mg->mg_ptr = 0; 892 mg->mg_ptr = 0;
755 893
894 if (--coro->refcnt < 0)
895 {
756 coro_state_destroy (coro); 896 coro_state_destroy (coro);
897 Safefree (coro);
898 }
757 899
758 return 0; 900 return 0;
759} 901}
760 902
761static int 903static int
762coro_state_dup (MAGIC *mg, CLONE_PARAMS *params) 904coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params)
763{ 905{
764 struct coro *coro = (struct coro *)mg->mg_ptr; 906 struct coro *coro = (struct coro *)mg->mg_ptr;
765 907
766 ++coro->refcnt; 908 ++coro->refcnt;
767 909
768 return 0; 910 return 0;
769} 911}
770 912
771static MGVTBL coro_state_vtbl = { 0, 0, 0, 0, coro_state_clear, 0, coro_state_dup, 0 }; 913static MGVTBL coro_state_vtbl = {
914 0, 0, 0, 0,
915 coro_state_free,
916 0,
917#ifdef MGf_DUP
918 coro_state_dup,
919#else
920# define MGf_DUP 0
921#endif
922};
772 923
773static struct coro * 924static struct coro *
774SvSTATE (SV *coro) 925SvSTATE (SV *coro)
775{ 926{
776 HV *stash; 927 HV *stash;
791 assert (mg->mg_type == PERL_MAGIC_ext); 942 assert (mg->mg_type == PERL_MAGIC_ext);
792 return (struct coro *)mg->mg_ptr; 943 return (struct coro *)mg->mg_ptr;
793} 944}
794 945
795static void 946static void
947prepare_transfer (struct transfer_args *ta, SV *prev_sv, SV *next_sv)
948{
949 ta->prev = SvSTATE (prev_sv);
950 ta->next = SvSTATE (next_sv);
951}
952
953static void
796api_transfer (pTHX_ SV *prev, SV *next, int flags) 954api_transfer (SV *prev_sv, SV *next_sv)
797{ 955{
798 coro_state_transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); 956 struct transfer_args ta;
957
958 prepare_transfer (&ta, prev_sv, next_sv);
959 TRANSFER (ta);
960}
961
962static int
963api_save (SV *coro_sv, int new_save)
964{
965 struct coro *coro = SvSTATE (coro_sv);
966 int old_save = coro->save;
967
968 if (new_save >= 0)
969 coro->save = new_save;
970
971 return old_save;
799} 972}
800 973
801/** Coro ********************************************************************/ 974/** Coro ********************************************************************/
802 975
803#define PRIO_MAX 3
804#define PRIO_HIGH 1
805#define PRIO_NORMAL 0
806#define PRIO_LOW -1
807#define PRIO_IDLE -3
808#define PRIO_MIN -4
809
810/* for Coro.pm */
811static GV *coro_current, *coro_idle;
812static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
813static int coro_nready;
814
815static void 976static void
816coro_enq (pTHX_ SV *sv) 977coro_enq (SV *coro_sv)
817{ 978{
818 int prio;
819
820 if (SvTYPE (sv) != SVt_PVHV)
821 croak ("Coro::ready tried to enqueue something that is not a coroutine");
822
823 prio = SvSTATE (sv)->prio;
824
825 av_push (coro_ready [prio - PRIO_MIN], sv); 979 av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv);
826 coro_nready++;
827} 980}
828 981
829static SV * 982static SV *
830coro_deq (pTHX_ int min_prio) 983coro_deq (int min_prio)
831{ 984{
832 int prio = PRIO_MAX - PRIO_MIN; 985 int prio = PRIO_MAX - PRIO_MIN;
833 986
834 min_prio -= PRIO_MIN; 987 min_prio -= PRIO_MIN;
835 if (min_prio < 0) 988 if (min_prio < 0)
836 min_prio = 0; 989 min_prio = 0;
837 990
838 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) 991 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
839 if (AvFILLp (coro_ready [prio]) >= 0) 992 if (AvFILLp (coro_ready [prio]) >= 0)
840 {
841 coro_nready--;
842 return av_shift (coro_ready [prio]); 993 return av_shift (coro_ready [prio]);
843 }
844 994
845 return 0; 995 return 0;
846} 996}
847 997
848static void 998static int
849api_ready (SV *coro) 999api_ready (SV *coro_sv)
850{ 1000{
851 dTHX; 1001 struct coro *coro;
852 1002
853 if (SvROK (coro)) 1003 if (SvROK (coro_sv))
854 coro = SvRV (coro); 1004 coro_sv = SvRV (coro_sv);
1005
1006 coro = SvSTATE (coro_sv);
1007
1008 if (coro->flags & CF_READY)
1009 return 0;
1010
1011 coro->flags |= CF_READY;
855 1012
856 LOCK; 1013 LOCK;
857 coro_enq (aTHX_ SvREFCNT_inc (coro)); 1014 coro_enq (SvREFCNT_inc (coro_sv));
1015 ++coro_nready;
858 UNLOCK; 1016 UNLOCK;
1017
1018 return 1;
1019}
1020
1021static int
1022api_is_ready (SV *coro_sv)
1023{
1024 return !!(SvSTATE (coro_sv)->flags & CF_READY);
1025}
1026
1027static void
1028prepare_schedule (struct transfer_args *ta)
1029{
1030 SV *prev_sv, *next_sv;
1031
1032 for (;;)
1033 {
1034 LOCK;
1035 next_sv = coro_deq (PRIO_MIN);
1036
1037 /* nothing to schedule: call the idle handler */
1038 if (!next_sv)
1039 {
1040 dSP;
1041 UNLOCK;
1042
1043 ENTER;
1044 SAVETMPS;
1045
1046 PUSHMARK (SP);
1047 PUTBACK;
1048 call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD);
1049
1050 FREETMPS;
1051 LEAVE;
1052 continue;
1053 }
1054
1055 ta->next = SvSTATE (next_sv);
1056
1057 /* cannot transfer to destroyed coros, skip and look for next */
1058 if (ta->next->flags & CF_DESTROYED)
1059 {
1060 UNLOCK;
1061 SvREFCNT_dec (next_sv);
1062 /* coro_nready is already taken care of by destroy */
1063 continue;
1064 }
1065
1066 --coro_nready;
1067 UNLOCK;
1068 break;
1069 }
1070
1071 /* free this only after the transfer */
1072 prev_sv = SvRV (coro_current);
1073 SvRV_set (coro_current, next_sv);
1074 ta->prev = SvSTATE (prev_sv);
1075
1076 assert (ta->next->flags & CF_READY);
1077 ta->next->flags &= ~CF_READY;
1078
1079 LOCK;
1080 free_coro_mortal ();
1081 coro_mortal = prev_sv;
1082 UNLOCK;
1083}
1084
1085static void
1086prepare_cede (struct transfer_args *ta)
1087{
1088 api_ready (coro_current);
1089 prepare_schedule (ta);
1090}
1091
1092static int
1093prepare_cede_notself (struct transfer_args *ta)
1094{
1095 if (coro_nready)
1096 {
1097 SV *prev = SvRV (coro_current);
1098 prepare_schedule (ta);
1099 api_ready (prev);
1100 return 1;
1101 }
1102 else
1103 return 0;
859} 1104}
860 1105
861static void 1106static void
862api_schedule (void) 1107api_schedule (void)
863{ 1108{
864 dTHX; 1109 struct transfer_args ta;
865 1110
866 SV *prev, *next; 1111 prepare_schedule (&ta);
867 SV *current = GvSV (coro_current); 1112 TRANSFER (ta);
868
869 for (;;)
870 {
871 LOCK;
872
873 next = coro_deq (aTHX_ PRIO_MIN);
874
875 if (next)
876 break;
877
878 UNLOCK;
879
880 {
881 dSP;
882
883 ENTER;
884 SAVETMPS;
885
886 PUSHMARK (SP);
887 PUTBACK;
888 call_sv (GvSV (coro_idle), G_DISCARD);
889
890 FREETMPS;
891 LEAVE;
892 }
893 }
894
895 prev = SvRV (current);
896 SvRV (current) = next;
897
898 /* free this only after the transfer */
899 coro_mortal = prev;
900
901 UNLOCK;
902
903 coro_state_transfer (aTHX_ SvSTATE (prev), SvSTATE (next), TRANSFER_SAVE_ALL);
904} 1113}
905 1114
906static int coro_cede_self;
907
908static void 1115static int
909api_cede (void) 1116api_cede (void)
910{ 1117{
911 dTHX; 1118 struct transfer_args ta;
912 SV *current = SvREFCNT_inc (SvRV (GvSV (coro_current)));
913 1119
914 LOCK; 1120 prepare_cede (&ta);
915 1121
916 if (coro_cede_self) 1122 if (ta.prev != ta.next)
917 { 1123 {
918 AV *runqueue = coro_ready [PRIO_MAX - PRIO_MIN]; 1124 TRANSFER (ta);
919 av_unshift (runqueue, 1); 1125 return 1;
920 av_store (runqueue, 0, current);
921 coro_nready++;
922 coro_cede_self = 0;
923 } 1126 }
924 else 1127 else
925 coro_enq (aTHX_ current); 1128 return 0;
1129}
926 1130
927 UNLOCK; 1131static int
1132api_cede_notself (void)
1133{
1134 struct transfer_args ta;
928 1135
929 api_schedule (); 1136 if (prepare_cede_notself (&ta))
1137 {
1138 TRANSFER (ta);
1139 return 1;
1140 }
1141 else
1142 return 0;
930} 1143}
931 1144
932MODULE = Coro::State PACKAGE = Coro::State 1145MODULE = Coro::State PACKAGE = Coro::State
933 1146
934PROTOTYPES: DISABLE 1147PROTOTYPES: DISABLE
940#endif 1153#endif
941 BOOT_PAGESIZE; 1154 BOOT_PAGESIZE;
942 1155
943 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 1156 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
944 1157
945 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 1158 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (CORO_SAVE_DEFAV));
946 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 1159 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (CORO_SAVE_DEFSV));
947 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); 1160 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (CORO_SAVE_ERRSV));
1161 newCONSTSUB (coro_state_stash, "SAVE_IRSSV", newSViv (CORO_SAVE_IRSSV));
1162 newCONSTSUB (coro_state_stash, "SAVE_ALL", newSViv (CORO_SAVE_ALL));
948 1163
949 main_mainstack = PL_mainstack; 1164 main_mainstack = PL_mainstack;
950 1165
951 coroapi.ver = CORO_API_VERSION; 1166 coroapi.ver = CORO_API_VERSION;
952 coroapi.transfer = api_transfer; 1167 coroapi.transfer = api_transfer;
953
954 Newz (0, main_stack, 1, coro_stack);
955 main_stack->idle_sp = (void *)-1;
956 1168
957 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL)); 1169 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
958} 1170}
959 1171
960SV * 1172SV *
965 HV *hv; 1177 HV *hv;
966 int i; 1178 int i;
967 1179
968 Newz (0, coro, 1, struct coro); 1180 Newz (0, coro, 1, struct coro);
969 coro->args = newAV (); 1181 coro->args = newAV ();
1182 coro->save = CORO_SAVE_ALL;
1183 coro->flags = CF_NEW;
970 1184
971 hv = newHV (); 1185 hv = newHV ();
972 sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP; 1186 sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP;
973 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1)); 1187 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
974 1188
975 av_push (coro->args, newSVsv (RETVAL));
976 for (i = 1; i < items; i++) 1189 for (i = 1; i < items; i++)
977 av_push (coro->args, newSVsv (ST (i))); 1190 av_push (coro->args, newSVsv (ST (i)));
978
979 coro->stack = main_stack;
980 /*coro->mainstack = 0; *//*actual work is done inside transfer */
981 /*coro->stack = 0;*/
982} 1191}
983 OUTPUT: 1192 OUTPUT:
984 RETVAL 1193 RETVAL
985 1194
1195int
1196save (SV *coro, int new_save = -1)
1197 CODE:
1198 RETVAL = api_save (coro, new_save);
1199 OUTPUT:
1200 RETVAL
1201
986void 1202void
987transfer (prev, next, flags) 1203_set_stacklevel (...)
988 SV *prev 1204 ALIAS:
989 SV *next 1205 Coro::State::transfer = 1
990 int flags 1206 Coro::schedule = 2
1207 Coro::cede = 3
1208 Coro::cede_notself = 4
991 CODE: 1209 CODE:
992 PUTBACK;
993 coro_state_transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
994 SPAGAIN;
995
996int
997prio (Coro::State coro, int newprio = 0)
998 ALIAS:
999 nice = 1
1000 CODE:
1001{ 1210{
1002 RETVAL = coro->prio; 1211 struct transfer_args ta;
1003 1212
1004 if (items > 1) 1213 switch (ix)
1005 { 1214 {
1215 case 0:
1216 ta.prev = (struct coro *)INT2PTR (coro_cctx *, SvIV (ST (0)));
1217 ta.next = 0;
1218 break;
1219
1220 case 1:
1006 if (ix) 1221 if (items != 2)
1007 newprio += coro->prio; 1222 croak ("Coro::State::transfer (prev,next) expects two arguments, not %d", items);
1008 1223
1009 if (newprio < PRIO_MIN) newprio = PRIO_MIN; 1224 prepare_transfer (&ta, ST (0), ST (1));
1010 if (newprio > PRIO_MAX) newprio = PRIO_MAX; 1225 break;
1011 1226
1012 coro->prio = newprio; 1227 case 2:
1228 prepare_schedule (&ta);
1229 break;
1230
1231 case 3:
1232 prepare_cede (&ta);
1233 break;
1234
1235 case 4:
1236 if (!prepare_cede_notself (&ta))
1237 XSRETURN_EMPTY;
1238
1239 break;
1013 } 1240 }
1014}
1015 1241
1016void 1242 BARRIER;
1017_clear_idle_sp (Coro::State self) 1243 TRANSFER (ta);
1244
1245 if (GIMME_V != G_VOID && ta.next != ta.prev)
1246 XSRETURN_YES;
1247}
1248
1249bool
1250_destroy (SV *coro_sv)
1018 CODE: 1251 CODE:
1019 self->stack->idle_sp = 0; 1252 RETVAL = coro_state_destroy (SvSTATE (coro_sv));
1020 1253 OUTPUT:
1021void 1254 RETVAL
1022_clone_state_from (SV *dst, SV *src)
1023 CODE:
1024{
1025 struct coro *coro_src = SvSTATE (src);
1026
1027 sv_unmagic (SvRV (dst), PERL_MAGIC_ext);
1028
1029 ++coro_src->refcnt;
1030 sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags |= MGf_DUP;
1031}
1032 1255
1033void 1256void
1034_exit (code) 1257_exit (code)
1035 int code 1258 int code
1036 PROTOTYPE: $ 1259 PROTOTYPE: $
1037 CODE: 1260 CODE:
1038 _exit (code); 1261 _exit (code);
1039 1262
1040MODULE = Coro::State PACKAGE = Coro::Cont 1263int
1264cctx_count ()
1265 CODE:
1266 RETVAL = cctx_count;
1267 OUTPUT:
1268 RETVAL
1041 1269
1042void 1270int
1043yield (...) 1271cctx_idle ()
1044 PROTOTYPE: @ 1272 CODE:
1045 CODE: 1273 RETVAL = cctx_idle;
1046{ 1274 OUTPUT:
1047 SV *yieldstack; 1275 RETVAL
1048 SV *sv;
1049 AV *defav = GvAV (PL_defgv);
1050 struct coro *prev, *next;
1051
1052 yieldstack = *hv_fetch (
1053 (HV *)SvRV (GvSV (coro_current)),
1054 "yieldstack", sizeof ("yieldstack") - 1,
1055 0
1056 );
1057
1058 /* set up @_ -- ugly */
1059 av_clear (defav);
1060 av_fill (defav, items - 1);
1061 while (items--)
1062 av_store (defav, items, SvREFCNT_inc (ST(items)));
1063
1064 sv = av_pop ((AV *)SvRV (yieldstack));
1065 prev = SvSTATE (*av_fetch ((AV *)SvRV (sv), 0, 0));
1066 next = SvSTATE (*av_fetch ((AV *)SvRV (sv), 1, 0));
1067 SvREFCNT_dec (sv);
1068
1069 coro_state_transfer (aTHX_ prev, next, 0);
1070}
1071 1276
1072MODULE = Coro::State PACKAGE = Coro 1277MODULE = Coro::State PACKAGE = Coro
1073 1278
1074BOOT: 1279BOOT:
1075{ 1280{
1082 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); 1287 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1083 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW)); 1288 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1084 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); 1289 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1085 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN)); 1290 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1086 1291
1087 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); 1292 coro_current = get_sv ("Coro::current", FALSE);
1088 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); 1293 SvREADONLY_on (coro_current);
1089 1294
1090 for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) 1295 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1091 coro_ready[i] = newAV (); 1296 coro_ready[i] = newAV ();
1092 1297
1093 { 1298 {
1094 SV *sv = perl_get_sv("Coro::API", 1); 1299 SV *sv = perl_get_sv("Coro::API", 1);
1095 1300
1096 coroapi.schedule = api_schedule; 1301 coroapi.schedule = api_schedule;
1302 coroapi.save = api_save;
1097 coroapi.cede = api_cede; 1303 coroapi.cede = api_cede;
1304 coroapi.cede_notself = api_cede_notself;
1098 coroapi.ready = api_ready; 1305 coroapi.ready = api_ready;
1306 coroapi.is_ready = api_is_ready;
1099 coroapi.nready = &coro_nready; 1307 coroapi.nready = &coro_nready;
1100 coroapi.current = coro_current; 1308 coroapi.current = coro_current;
1101 1309
1102 GCoroAPI = &coroapi; 1310 GCoroAPI = &coroapi;
1103 sv_setiv (sv, (IV)&coroapi); 1311 sv_setiv (sv, (IV)&coroapi);
1104 SvREADONLY_on (sv); 1312 SvREADONLY_on (sv);
1105 } 1313 }
1106} 1314}
1107 1315
1108void 1316void
1317_set_current (SV *current)
1318 PROTOTYPE: $
1319 CODE:
1320 SvREFCNT_dec (SvRV (coro_current));
1321 SvRV_set (coro_current, SvREFCNT_inc (SvRV (current)));
1322
1323int
1324prio (Coro::State coro, int newprio = 0)
1325 ALIAS:
1326 nice = 1
1327 CODE:
1328{
1329 RETVAL = coro->prio;
1330
1331 if (items > 1)
1332 {
1333 if (ix)
1334 newprio = coro->prio - newprio;
1335
1336 if (newprio < PRIO_MIN) newprio = PRIO_MIN;
1337 if (newprio > PRIO_MAX) newprio = PRIO_MAX;
1338
1339 coro->prio = newprio;
1340 }
1341}
1342 OUTPUT:
1343 RETVAL
1344
1345SV *
1109ready (SV *self) 1346ready (SV *self)
1110 PROTOTYPE: $ 1347 PROTOTYPE: $
1111 CODE: 1348 CODE:
1112 api_ready (self); 1349 RETVAL = boolSV (api_ready (self));
1350 OUTPUT:
1351 RETVAL
1352
1353SV *
1354is_ready (SV *self)
1355 PROTOTYPE: $
1356 CODE:
1357 RETVAL = boolSV (api_is_ready (self));
1358 OUTPUT:
1359 RETVAL
1113 1360
1114int 1361int
1115nready (...) 1362nready (...)
1116 PROTOTYPE: 1363 PROTOTYPE:
1117 CODE: 1364 CODE:
1118 RETVAL = coro_nready; 1365 RETVAL = coro_nready;
1119 OUTPUT: 1366 OUTPUT:
1120 RETVAL 1367 RETVAL
1121 1368
1122void
1123schedule (...)
1124 PROTOTYPE:
1125 CODE:
1126 api_schedule ();
1127
1128void
1129_set_cede_self ()
1130 CODE:
1131 coro_cede_self = 1;
1132
1133void
1134cede (...)
1135 PROTOTYPE:
1136 CODE:
1137 api_cede ();
1138
1139MODULE = Coro::State PACKAGE = Coro::AIO 1369MODULE = Coro::State PACKAGE = Coro::AIO
1140 1370
1141SV * 1371SV *
1142_get_state () 1372_get_state ()
1143 CODE: 1373 CODE:
1144{ 1374{
1145 struct { 1375 struct io_state *data;
1146 int errorno;
1147 int laststype;
1148 int laststatval;
1149 Stat_t statcache;
1150 } data;
1151 1376
1377 RETVAL = newSV (sizeof (struct io_state));
1378 data = (struct io_state *)SvPVX (RETVAL);
1379 SvCUR_set (RETVAL, sizeof (struct io_state));
1380 SvPOK_only (RETVAL);
1381
1152 data.errorno = errno; 1382 data->errorno = errno;
1153 data.laststype = PL_laststype; 1383 data->laststype = PL_laststype;
1154 data.laststatval = PL_laststatval; 1384 data->laststatval = PL_laststatval;
1155 data.statcache = PL_statcache; 1385 data->statcache = PL_statcache;
1156
1157 RETVAL = newSVpvn ((char *)&data, sizeof data);
1158} 1386}
1159 OUTPUT: 1387 OUTPUT:
1160 RETVAL 1388 RETVAL
1161 1389
1162void 1390void
1163_set_state (char *data_) 1391_set_state (char *data_)
1164 PROTOTYPE: $ 1392 PROTOTYPE: $
1165 CODE: 1393 CODE:
1166{ 1394{
1167 struct { 1395 struct io_state *data = (void *)data_;
1168 int errorno;
1169 int laststype;
1170 int laststatval;
1171 Stat_t statcache;
1172 } *data = (void *)data_;
1173 1396
1174 errno = data->errorno; 1397 errno = data->errorno;
1175 PL_laststype = data->laststype; 1398 PL_laststype = data->laststype;
1176 PL_laststatval = data->laststatval; 1399 PL_laststatval = data->laststatval;
1177 PL_statcache = data->statcache; 1400 PL_statcache = data->statcache;
1178} 1401}
1402

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines