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

Diff Legend

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