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

Diff Legend

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