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.44 by root, Sat Mar 22 18:50:32 2003 UTC vs.
Revision 1.100 by root, Mon Nov 27 00:07:49 2006 UTC

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

Diff Legend

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