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.46 by pcg, Wed Nov 5 20:02:46 2003 UTC vs.
Revision 1.89 by root, Sat Nov 25 00:40:26 2006 UTC

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

Diff Legend

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