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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines