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.47 by pcg, Sat Nov 15 03:53:10 2003 UTC vs.
Revision 1.96 by root, Sun Nov 26 18:25:11 2006 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines