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

Diff Legend

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