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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines