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