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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines