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

Diff Legend

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