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.28 by root, Sat Aug 25 21:32:05 2001 UTC vs.
Revision 1.107 by root, Mon Nov 27 02:15:51 2006 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines