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

Diff Legend

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