|
|
1 | #include "libcoro/coro.c" |
|
|
2 | |
|
|
3 | #define PERL_NO_GET_CONTEXT |
|
|
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 | #if 1 |
9 | #include "patchlevel.h" |
6 | # define CHK(x) (void *)0 |
10 | |
|
|
11 | #include <stdio.h> |
|
|
12 | #include <errno.h> |
|
|
13 | #include <assert.h> |
|
|
14 | |
|
|
15 | #ifdef HAVE_MMAP |
|
|
16 | # include <unistd.h> |
|
|
17 | # include <sys/mman.h> |
|
|
18 | # ifndef MAP_ANONYMOUS |
|
|
19 | # ifdef MAP_ANON |
|
|
20 | # define MAP_ANONYMOUS MAP_ANON |
|
|
21 | # else |
|
|
22 | # undef HAVE_MMAP |
|
|
23 | # endif |
|
|
24 | # endif |
|
|
25 | # include <limits.h> |
|
|
26 | # ifndef PAGESIZE |
|
|
27 | # define PAGESIZE pagesize |
|
|
28 | # define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE) |
|
|
29 | static long pagesize; |
|
|
30 | # else |
|
|
31 | # define BOOT_PAGESIZE (void)0 |
|
|
32 | # endif |
7 | #else |
33 | #else |
8 | # define CHK(x) if (!(x)) croak("FATAL, CHK: " #x) |
34 | # define PAGESIZE 0 |
|
|
35 | # define BOOT_PAGESIZE (void)0 |
|
|
36 | #endif |
|
|
37 | |
|
|
38 | #if CORO_USE_VALGRIND |
|
|
39 | # include <valgrind/valgrind.h> |
|
|
40 | # define REGISTER_STACK(cctx,start,end) (cctx)->valgrind_id = VALGRIND_STACK_REGISTER ((start), (end)) |
|
|
41 | #else |
|
|
42 | # define REGISTER_STACK(cctx,start,end) |
|
|
43 | #endif |
|
|
44 | |
|
|
45 | /* the maximum number of idle cctx that will be pooled */ |
|
|
46 | #define MAX_IDLE_CCTX 8 |
|
|
47 | |
|
|
48 | #define PERL_VERSION_ATLEAST(a,b,c) \ |
|
|
49 | (PERL_REVISION > (a) \ |
|
|
50 | || (PERL_REVISION == (a) \ |
|
|
51 | && (PERL_VERSION > (b) \ |
|
|
52 | || (PERL_VERSION == (b) && PERLSUBVERSION >= (c))))) |
|
|
53 | |
|
|
54 | #if !PERL_VERSION_ATLEAST (5,6,0) |
|
|
55 | # ifndef PL_ppaddr |
|
|
56 | # define PL_ppaddr ppaddr |
9 | #endif |
57 | # endif |
|
|
58 | # ifndef call_sv |
|
|
59 | # define call_sv perl_call_sv |
|
|
60 | # endif |
|
|
61 | # ifndef get_sv |
|
|
62 | # define get_sv perl_get_sv |
|
|
63 | # endif |
|
|
64 | # ifndef get_cv |
|
|
65 | # define get_cv perl_get_cv |
|
|
66 | # endif |
|
|
67 | # ifndef IS_PADGV |
|
|
68 | # define IS_PADGV(v) 0 |
|
|
69 | # endif |
|
|
70 | # ifndef IS_PADCONST |
|
|
71 | # define IS_PADCONST(v) 0 |
|
|
72 | # endif |
|
|
73 | #endif |
10 | |
74 | |
11 | #define MAY_FLUSH /* increases codesize */ |
75 | /* 5.8.7 */ |
|
|
76 | #ifndef SvRV_set |
|
|
77 | # define SvRV_set(s,v) SvRV(s) = (v) |
|
|
78 | #endif |
12 | |
79 | |
13 | #define SUB_INIT "Coro::State::initialize" |
80 | #if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64 |
|
|
81 | # undef CORO_STACKGUARD |
|
|
82 | #endif |
14 | |
83 | |
15 | #define TRANSFER_SAVE_DEFAV 0x00000001 |
84 | #ifndef CORO_STACKGUARD |
16 | #define TRANSFER_SAVE_DEFSV 0x00000002 |
85 | # define CORO_STACKGUARD 0 |
17 | #define TRANSFER_SAVE_ERRSV 0x00000004 |
86 | #endif |
18 | |
87 | |
19 | #define TRANSFER_SAVE_ALL -1 |
88 | /* prefer perl internal functions over our own? */ |
|
|
89 | #ifndef CORO_PREFER_PERL_FUNCTIONS |
|
|
90 | # define CORO_PREFER_PERL_FUNCTIONS 0 |
|
|
91 | #endif |
20 | |
92 | |
|
|
93 | /* The next macro should declare a variable stacklevel that contains and approximation |
|
|
94 | * to the current C stack pointer. Its property is that it changes with each call |
|
|
95 | * and should be unique. */ |
|
|
96 | #define dSTACKLEVEL int stacklevel |
|
|
97 | #define STACKLEVEL ((void *)&stacklevel) |
|
|
98 | |
|
|
99 | #define IN_DESTRUCT (PL_main_cv == Nullcv) |
|
|
100 | |
|
|
101 | #if __GNUC__ >= 3 |
|
|
102 | # define attribute(x) __attribute__(x) |
|
|
103 | # define BARRIER __asm__ __volatile__ ("" : : : "memory") |
|
|
104 | #else |
|
|
105 | # define attribute(x) |
|
|
106 | # define BARRIER |
|
|
107 | #endif |
|
|
108 | |
|
|
109 | #define NOINLINE attribute ((noinline)) |
|
|
110 | |
|
|
111 | #include "CoroAPI.h" |
|
|
112 | |
|
|
113 | #ifdef USE_ITHREADS |
|
|
114 | static perl_mutex coro_mutex; |
|
|
115 | # define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0) |
|
|
116 | # define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0) |
|
|
117 | #else |
|
|
118 | # define LOCK (void)0 |
|
|
119 | # define UNLOCK (void)0 |
|
|
120 | #endif |
|
|
121 | |
|
|
122 | /* helper storage struct for Coro::AIO */ |
|
|
123 | struct io_state |
|
|
124 | { |
|
|
125 | int errorno; |
|
|
126 | I32 laststype; |
|
|
127 | int laststatval; |
|
|
128 | Stat_t statcache; |
|
|
129 | }; |
|
|
130 | |
|
|
131 | static size_t coro_stacksize = CORO_STACKSIZE; |
|
|
132 | static struct CoroAPI coroapi; |
|
|
133 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
|
|
134 | static HV *coro_state_stash, *coro_stash; |
|
|
135 | static SV *coro_mortal; /* will be freed after next transfer */ |
|
|
136 | |
|
|
137 | static struct coro_cctx *cctx_first; |
|
|
138 | static int cctx_count, cctx_idle; |
|
|
139 | |
|
|
140 | /* this is a structure representing a c-level coroutine */ |
|
|
141 | typedef struct coro_cctx { |
|
|
142 | struct coro_cctx *next; |
|
|
143 | |
|
|
144 | /* the stack */ |
|
|
145 | void *sptr; |
|
|
146 | size_t ssize; |
|
|
147 | |
|
|
148 | /* cpu state */ |
|
|
149 | void *idle_sp; /* sp of top-level transfer/schedule/cede call */ |
|
|
150 | JMPENV *idle_te; /* same as idle_sp, but for top_env, TODO: remove once stable */ |
|
|
151 | JMPENV *top_env; |
|
|
152 | coro_context cctx; |
|
|
153 | |
|
|
154 | #if CORO_USE_VALGRIND |
|
|
155 | int valgrind_id; |
|
|
156 | #endif |
|
|
157 | char inuse, mapped; |
|
|
158 | } coro_cctx; |
|
|
159 | |
|
|
160 | enum { |
|
|
161 | CF_RUNNING = 0x0001, /* coroutine is running */ |
|
|
162 | CF_READY = 0x0002, /* coroutine is ready */ |
|
|
163 | CF_NEW = 0x0004, /* has never been switched to */ |
|
|
164 | CF_DESTROYED = 0x0008, /* coroutine data has been freed */ |
|
|
165 | }; |
|
|
166 | |
|
|
167 | /* this is a structure representing a perl-level coroutine */ |
21 | struct coro { |
168 | struct coro { |
22 | /* optionally saved, might be zero */ |
169 | /* the c coroutine allocated to this perl coroutine, if any */ |
23 | AV *defav; |
170 | coro_cctx *cctx; |
24 | SV *defsv; |
|
|
25 | SV *errsv; |
|
|
26 | |
|
|
27 | /* saved global state not related to stacks */ |
|
|
28 | U8 dowarn; |
|
|
29 | |
|
|
30 | /* the stacks and related info (callchain etc..) */ |
|
|
31 | PERL_SI *curstackinfo; |
|
|
32 | AV *curstack; |
|
|
33 | AV *mainstack; |
|
|
34 | SV **stack_sp; |
|
|
35 | OP *op; |
|
|
36 | SV **curpad; |
|
|
37 | SV **stack_base; |
|
|
38 | SV **stack_max; |
|
|
39 | SV **tmps_stack; |
|
|
40 | I32 tmps_floor; |
|
|
41 | I32 tmps_ix; |
|
|
42 | I32 tmps_max; |
|
|
43 | I32 *markstack; |
|
|
44 | I32 *markstack_ptr; |
|
|
45 | I32 *markstack_max; |
|
|
46 | I32 *scopestack; |
|
|
47 | I32 scopestack_ix; |
|
|
48 | I32 scopestack_max; |
|
|
49 | ANY *savestack; |
|
|
50 | I32 savestack_ix; |
|
|
51 | I32 savestack_max; |
|
|
52 | OP **retstack; |
|
|
53 | I32 retstack_ix; |
|
|
54 | I32 retstack_max; |
|
|
55 | COP *curcop; |
|
|
56 | |
171 | |
57 | /* data associated with this coroutine (initial args) */ |
172 | /* data associated with this coroutine (initial args) */ |
58 | AV *args; |
173 | AV *args; |
|
|
174 | int refcnt; |
|
|
175 | int save; /* CORO_SAVE flags */ |
|
|
176 | int flags; /* CF_ flags */ |
|
|
177 | |
|
|
178 | /* optionally saved, might be zero */ |
|
|
179 | AV *defav; /* @_ */ |
|
|
180 | SV *defsv; /* $_ */ |
|
|
181 | SV *errsv; /* $@ */ |
|
|
182 | GV *deffh; /* default filehandle */ |
|
|
183 | SV *irssv; /* $/ */ |
|
|
184 | SV *irssv_sv; /* real $/ cache */ |
|
|
185 | |
|
|
186 | #define VAR(name,type) type name; |
|
|
187 | # include "state.h" |
|
|
188 | #undef VAR |
|
|
189 | |
|
|
190 | /* coro process data */ |
|
|
191 | int prio; |
59 | }; |
192 | }; |
60 | |
193 | |
61 | typedef struct coro *Coro__State; |
194 | typedef struct coro *Coro__State; |
62 | typedef struct coro *Coro__State_or_hashref; |
195 | typedef struct coro *Coro__State_or_hashref; |
63 | |
196 | |
64 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
197 | /** Coro ********************************************************************/ |
65 | |
198 | |
66 | static HV *padlist_cache; |
199 | #define PRIO_MAX 3 |
|
|
200 | #define PRIO_HIGH 1 |
|
|
201 | #define PRIO_NORMAL 0 |
|
|
202 | #define PRIO_LOW -1 |
|
|
203 | #define PRIO_IDLE -3 |
|
|
204 | #define PRIO_MIN -4 |
67 | |
205 | |
68 | /* mostly copied from op.c:cv_clone2 */ |
206 | /* for Coro.pm */ |
69 | STATIC AV * |
207 | static SV *coro_current; |
70 | clone_padlist (AV *protopadlist) |
208 | static AV *coro_ready [PRIO_MAX-PRIO_MIN+1]; |
|
|
209 | static int coro_nready; |
|
|
210 | |
|
|
211 | /** lowlevel stuff **********************************************************/ |
|
|
212 | |
|
|
213 | static AV * |
|
|
214 | coro_clone_padlist (pTHX_ CV *cv) |
71 | { |
215 | { |
72 | AV *av; |
216 | AV *padlist = CvPADLIST (cv); |
73 | I32 ix; |
|
|
74 | AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE); |
|
|
75 | AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE); |
|
|
76 | SV **pname = AvARRAY (protopad_name); |
|
|
77 | SV **ppad = AvARRAY (protopad); |
|
|
78 | I32 fname = AvFILLp (protopad_name); |
|
|
79 | I32 fpad = AvFILLp (protopad); |
|
|
80 | AV *newpadlist, *newpad_name, *newpad; |
217 | AV *newpadlist, *newpad; |
81 | SV **npad; |
|
|
82 | |
|
|
83 | newpad_name = newAV (); |
|
|
84 | for (ix = fname; ix >= 0; ix--) |
|
|
85 | av_store (newpad_name, ix, SvREFCNT_inc (pname[ix])); |
|
|
86 | |
|
|
87 | newpad = newAV (); |
|
|
88 | av_fill (newpad, AvFILLp (protopad)); |
|
|
89 | npad = AvARRAY (newpad); |
|
|
90 | |
218 | |
91 | newpadlist = newAV (); |
219 | newpadlist = newAV (); |
92 | AvREAL_off (newpadlist); |
220 | AvREAL_off (newpadlist); |
93 | av_store (newpadlist, 0, (SV *) newpad_name); |
221 | #if PERL_VERSION_ATLEAST (5,9,0) |
|
|
222 | Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1); |
|
|
223 | #else |
|
|
224 | Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1); |
|
|
225 | #endif |
|
|
226 | newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)]; |
|
|
227 | --AvFILLp (padlist); |
|
|
228 | |
|
|
229 | av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE))); |
94 | av_store (newpadlist, 1, (SV *) newpad); |
230 | av_store (newpadlist, 1, (SV *)newpad); |
95 | |
231 | |
96 | av = newAV (); /* will be @_ */ |
232 | return newpadlist; |
97 | av_extend (av, 0); |
233 | } |
98 | av_store (newpad, 0, (SV *) av); |
|
|
99 | AvFLAGS (av) = AVf_REIFY; |
|
|
100 | |
234 | |
101 | for (ix = fpad; ix > 0; ix--) |
235 | static void |
|
|
236 | free_padlist (pTHX_ AV *padlist) |
|
|
237 | { |
|
|
238 | /* may be during global destruction */ |
|
|
239 | if (SvREFCNT (padlist)) |
102 | { |
240 | { |
103 | SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; |
241 | I32 i = AvFILLp (padlist); |
104 | if (namesv && namesv != &PL_sv_undef) |
242 | while (i >= 0) |
105 | { |
243 | { |
106 | char *name = SvPVX (namesv); /* XXX */ |
244 | SV **svp = av_fetch (padlist, i--, FALSE); |
107 | if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') |
245 | if (svp) |
108 | { /* lexical from outside? */ |
|
|
109 | npad[ix] = SvREFCNT_inc (ppad[ix]); |
|
|
110 | } |
246 | { |
111 | else |
|
|
112 | { /* our own lexical */ |
|
|
113 | SV *sv; |
247 | SV *sv; |
114 | if (*name == '&') |
248 | while (&PL_sv_undef != (sv = av_pop ((AV *)*svp))) |
115 | sv = SvREFCNT_inc (ppad[ix]); |
249 | SvREFCNT_dec (sv); |
116 | else if (*name == '@') |
250 | |
117 | sv = (SV *) newAV (); |
251 | SvREFCNT_dec (*svp); |
118 | else if (*name == '%') |
|
|
119 | sv = (SV *) newHV (); |
|
|
120 | else |
|
|
121 | sv = NEWSV (0, 0); |
|
|
122 | if (!SvPADBUSY (sv)) |
|
|
123 | SvPADMY_on (sv); |
|
|
124 | npad[ix] = sv; |
|
|
125 | } |
252 | } |
126 | } |
253 | } |
127 | else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) |
254 | |
|
|
255 | SvREFCNT_dec ((SV*)padlist); |
|
|
256 | } |
|
|
257 | } |
|
|
258 | |
|
|
259 | static int |
|
|
260 | coro_cv_free (pTHX_ SV *sv, MAGIC *mg) |
|
|
261 | { |
|
|
262 | AV *padlist; |
|
|
263 | AV *av = (AV *)mg->mg_obj; |
|
|
264 | |
|
|
265 | /* casting is fun. */ |
|
|
266 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
|
|
267 | free_padlist (aTHX_ padlist); |
|
|
268 | |
|
|
269 | SvREFCNT_dec (av); |
|
|
270 | |
|
|
271 | return 0; |
|
|
272 | } |
|
|
273 | |
|
|
274 | #define PERL_MAGIC_coro PERL_MAGIC_ext |
|
|
275 | |
|
|
276 | static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; |
|
|
277 | |
|
|
278 | #define CORO_MAGIC(cv) \ |
|
|
279 | SvMAGIC (cv) \ |
|
|
280 | ? SvMAGIC (cv)->mg_type == PERL_MAGIC_coro \ |
|
|
281 | ? SvMAGIC (cv) \ |
|
|
282 | : mg_find ((SV *)cv, PERL_MAGIC_coro) \ |
|
|
283 | : 0 |
|
|
284 | |
|
|
285 | /* the next two functions merely cache the padlists */ |
|
|
286 | static void |
|
|
287 | get_padlist (pTHX_ CV *cv) |
|
|
288 | { |
|
|
289 | MAGIC *mg = CORO_MAGIC (cv); |
|
|
290 | AV *av; |
|
|
291 | |
|
|
292 | if (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0) |
|
|
293 | CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--]; |
|
|
294 | else |
|
|
295 | { |
|
|
296 | #if CORO_PREFER_PERL_FUNCTIONS |
|
|
297 | /* this is probably cleaner, but also slower? */ |
|
|
298 | CV *cp = Perl_cv_clone (cv); |
|
|
299 | CvPADLIST (cv) = CvPADLIST (cp); |
|
|
300 | CvPADLIST (cp) = 0; |
|
|
301 | SvREFCNT_dec (cp); |
|
|
302 | #else |
|
|
303 | CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv); |
|
|
304 | #endif |
|
|
305 | } |
|
|
306 | } |
|
|
307 | |
|
|
308 | static void |
|
|
309 | put_padlist (pTHX_ CV *cv) |
|
|
310 | { |
|
|
311 | MAGIC *mg = CORO_MAGIC (cv); |
|
|
312 | AV *av; |
|
|
313 | |
|
|
314 | if (!mg) |
|
|
315 | { |
|
|
316 | sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0); |
|
|
317 | mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
|
|
318 | mg->mg_virtual = &vtbl_coro; |
|
|
319 | mg->mg_obj = (SV *)newAV (); |
|
|
320 | } |
|
|
321 | |
|
|
322 | av = (AV *)mg->mg_obj; |
|
|
323 | |
|
|
324 | if (AvFILLp (av) >= AvMAX (av)) |
|
|
325 | av_extend (av, AvMAX (av) + 1); |
|
|
326 | |
|
|
327 | AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv); |
|
|
328 | } |
|
|
329 | |
|
|
330 | /** load & save, init *******************************************************/ |
|
|
331 | |
|
|
332 | #define SB do { |
|
|
333 | #define SE } while (0) |
|
|
334 | |
|
|
335 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec (sv); (sv) = (val); (val) = 0; SE |
|
|
336 | |
|
|
337 | static void |
|
|
338 | load_perl (pTHX_ Coro__State c) |
|
|
339 | { |
|
|
340 | #define VAR(name,type) PL_ ## name = c->name; |
|
|
341 | # include "state.h" |
|
|
342 | #undef VAR |
|
|
343 | |
|
|
344 | if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); |
|
|
345 | if (c->defsv) REPLACE_SV (DEFSV , c->defsv); |
|
|
346 | if (c->errsv) REPLACE_SV (ERRSV , c->errsv); |
|
|
347 | if (c->deffh) REPLACE_SV (PL_defoutgv , c->deffh); |
|
|
348 | |
|
|
349 | if (c->irssv) |
|
|
350 | { |
|
|
351 | if (c->irssv == PL_rs || sv_eq (PL_rs, c->irssv)) |
128 | { |
352 | { |
129 | npad[ix] = SvREFCNT_inc (ppad[ix]); |
353 | SvREFCNT_dec (c->irssv); |
|
|
354 | c->irssv = 0; |
130 | } |
355 | } |
131 | else |
356 | else |
132 | { |
357 | { |
133 | SV *sv = NEWSV (0, 0); |
358 | REPLACE_SV (PL_rs, c->irssv); |
134 | SvPADTMP_on (sv); |
359 | if (!c->irssv_sv) c->irssv_sv = get_sv ("/", 0); |
135 | npad[ix] = sv; |
360 | sv_setsv (c->irssv_sv, PL_rs); |
136 | } |
361 | } |
137 | } |
362 | } |
138 | |
|
|
139 | #if 0 /* return -ENOTUNDERSTOOD */ |
|
|
140 | /* Now that vars are all in place, clone nested closures. */ |
|
|
141 | |
|
|
142 | for (ix = fpad; ix > 0; ix--) { |
|
|
143 | SV* namesv = (ix <= fname) ? pname[ix] : Nullsv; |
|
|
144 | if (namesv |
|
|
145 | && namesv != &PL_sv_undef |
|
|
146 | && !(SvFLAGS(namesv) & SVf_FAKE) |
|
|
147 | && *SvPVX(namesv) == '&' |
|
|
148 | && CvCLONE(ppad[ix])) |
|
|
149 | { |
|
|
150 | CV *kid = cv_clone((CV*)ppad[ix]); |
|
|
151 | SvREFCNT_dec(ppad[ix]); |
|
|
152 | CvCLONE_on(kid); |
|
|
153 | SvPADMY_on(kid); |
|
|
154 | npad[ix] = (SV*)kid; |
|
|
155 | } |
|
|
156 | } |
|
|
157 | #endif |
|
|
158 | |
|
|
159 | return newpadlist; |
|
|
160 | } |
|
|
161 | |
|
|
162 | #ifdef MAY_FLUSH |
|
|
163 | STATIC AV * |
|
|
164 | free_padlist (AV *padlist) |
|
|
165 | { |
|
|
166 | /* may be during global destruction */ |
|
|
167 | if (SvREFCNT(padlist)) |
|
|
168 | { |
|
|
169 | I32 i = AvFILLp(padlist); |
|
|
170 | while (i >= 0) |
|
|
171 | { |
|
|
172 | SV **svp = av_fetch(padlist, i--, FALSE); |
|
|
173 | SV *sv = svp ? *svp : Nullsv; |
|
|
174 | if (sv) |
|
|
175 | SvREFCNT_dec(sv); |
|
|
176 | } |
|
|
177 | |
|
|
178 | SvREFCNT_dec((SV*)padlist); |
|
|
179 | } |
|
|
180 | } |
|
|
181 | #endif |
|
|
182 | |
|
|
183 | /* the next two functions merely cache the padlists */ |
|
|
184 | STATIC void |
|
|
185 | get_padlist (CV *cv) |
|
|
186 | { |
|
|
187 | SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0); |
|
|
188 | |
|
|
189 | if (he && AvFILLp ((AV *)*he) >= 0) |
|
|
190 | CvPADLIST (cv) = (AV *)av_pop ((AV *)*he); |
|
|
191 | else |
|
|
192 | CvPADLIST (cv) = clone_padlist (CvPADLIST (cv)); |
|
|
193 | } |
|
|
194 | |
|
|
195 | STATIC void |
|
|
196 | put_padlist (CV *cv) |
|
|
197 | { |
|
|
198 | SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1); |
|
|
199 | |
|
|
200 | if (SvTYPE (*he) != SVt_PVAV) |
|
|
201 | { |
|
|
202 | SvREFCNT_dec (*he); |
|
|
203 | *he = (SV *)newAV (); |
|
|
204 | } |
|
|
205 | |
|
|
206 | av_push ((AV *)*he, (SV *)CvPADLIST (cv)); |
|
|
207 | } |
|
|
208 | |
|
|
209 | #ifdef MAY_FLUSH |
|
|
210 | STATIC void |
|
|
211 | flush_padlist_cache () |
|
|
212 | { |
|
|
213 | HV *hv = padlist_cache; |
|
|
214 | padlist_cache = newHV (); |
|
|
215 | |
|
|
216 | if (hv_iterinit (hv)) |
|
|
217 | { |
|
|
218 | HE *he; |
|
|
219 | AV *padlist; |
|
|
220 | |
|
|
221 | while (!!(he = hv_iternext (hv))) |
|
|
222 | { |
|
|
223 | AV *av = (AV *)HeVAL(he); |
|
|
224 | |
|
|
225 | /* casting is fun. */ |
|
|
226 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
|
|
227 | free_padlist (padlist); |
|
|
228 | } |
|
|
229 | } |
|
|
230 | |
|
|
231 | SvREFCNT_dec (hv); |
|
|
232 | } |
|
|
233 | #endif |
|
|
234 | |
|
|
235 | #define SB do { |
|
|
236 | #define SE } while (0) |
|
|
237 | |
|
|
238 | #define LOAD(state) SB load_state(aTHX_ state); SPAGAIN; SE |
|
|
239 | #define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ state,flags); SE |
|
|
240 | |
|
|
241 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE |
|
|
242 | |
|
|
243 | static void |
|
|
244 | load_state(pTHX_ Coro__State c) |
|
|
245 | { |
|
|
246 | PL_dowarn = c->dowarn; |
|
|
247 | |
|
|
248 | PL_curstackinfo = c->curstackinfo; |
|
|
249 | PL_curstack = c->curstack; |
|
|
250 | PL_mainstack = c->mainstack; |
|
|
251 | PL_stack_sp = c->stack_sp; |
|
|
252 | PL_op = c->op; |
|
|
253 | PL_curpad = c->curpad; |
|
|
254 | PL_stack_base = c->stack_base; |
|
|
255 | PL_stack_max = c->stack_max; |
|
|
256 | PL_tmps_stack = c->tmps_stack; |
|
|
257 | PL_tmps_floor = c->tmps_floor; |
|
|
258 | PL_tmps_ix = c->tmps_ix; |
|
|
259 | PL_tmps_max = c->tmps_max; |
|
|
260 | PL_markstack = c->markstack; |
|
|
261 | PL_markstack_ptr = c->markstack_ptr; |
|
|
262 | PL_markstack_max = c->markstack_max; |
|
|
263 | PL_scopestack = c->scopestack; |
|
|
264 | PL_scopestack_ix = c->scopestack_ix; |
|
|
265 | PL_scopestack_max = c->scopestack_max; |
|
|
266 | PL_savestack = c->savestack; |
|
|
267 | PL_savestack_ix = c->savestack_ix; |
|
|
268 | PL_savestack_max = c->savestack_max; |
|
|
269 | PL_retstack = c->retstack; |
|
|
270 | PL_retstack_ix = c->retstack_ix; |
|
|
271 | PL_retstack_max = c->retstack_max; |
|
|
272 | PL_curcop = c->curcop; |
|
|
273 | |
|
|
274 | if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); |
|
|
275 | if (c->defsv) REPLACE_SV (DEFSV , c->defsv); |
|
|
276 | if (c->errsv) REPLACE_SV (ERRSV , c->errsv); |
|
|
277 | |
363 | |
278 | { |
364 | { |
279 | dSP; |
365 | dSP; |
280 | CV *cv; |
366 | CV *cv; |
281 | |
367 | |
282 | /* now do the ugly restore mess */ |
368 | /* now do the ugly restore mess */ |
283 | while ((cv = (CV *)POPs)) |
369 | while ((cv = (CV *)POPs)) |
284 | { |
370 | { |
285 | AV *padlist = (AV *)POPs; |
|
|
286 | |
|
|
287 | if (padlist) |
|
|
288 | { |
|
|
289 | put_padlist (cv); /* mark this padlist as available */ |
371 | put_padlist (aTHX_ cv); /* mark this padlist as available */ |
290 | CvPADLIST(cv) = padlist; |
372 | CvDEPTH (cv) = PTR2IV (POPs); |
291 | #ifdef USE_THREADS |
373 | CvPADLIST (cv) = (AV *)POPs; |
292 | /*CvOWNER(cv) = (struct perl_thread *)POPs;*/ |
|
|
293 | #endif |
|
|
294 | } |
|
|
295 | |
|
|
296 | ++CvDEPTH(cv); |
|
|
297 | } |
374 | } |
298 | |
375 | |
299 | PUTBACK; |
376 | PUTBACK; |
300 | } |
377 | } |
|
|
378 | assert (!PL_comppad || AvARRAY (PL_comppad));//D |
301 | } |
379 | } |
302 | |
380 | |
303 | static void |
381 | static void |
304 | save_state(pTHX_ Coro__State c, int flags) |
382 | save_perl (pTHX_ Coro__State c) |
305 | { |
383 | { |
|
|
384 | assert (!PL_comppad || AvARRAY (PL_comppad));//D |
306 | { |
385 | { |
307 | dSP; |
386 | dSP; |
308 | I32 cxix = cxstack_ix; |
387 | I32 cxix = cxstack_ix; |
309 | PERL_CONTEXT *ccstk = cxstack; |
388 | PERL_CONTEXT *ccstk = cxstack; |
310 | PERL_SI *top_si = PL_curstackinfo; |
389 | PERL_SI *top_si = PL_curstackinfo; |
… | |
… | |
312 | /* |
391 | /* |
313 | * the worst thing you can imagine happens first - we have to save |
392 | * the worst thing you can imagine happens first - we have to save |
314 | * (and reinitialize) all cv's in the whole callchain :( |
393 | * (and reinitialize) all cv's in the whole callchain :( |
315 | */ |
394 | */ |
316 | |
395 | |
|
|
396 | EXTEND (SP, 3 + 1); |
317 | PUSHs (Nullsv); |
397 | PUSHs (Nullsv); |
318 | /* this loop was inspired by pp_caller */ |
398 | /* this loop was inspired by pp_caller */ |
319 | for (;;) |
399 | for (;;) |
320 | { |
400 | { |
321 | do |
401 | while (cxix >= 0) |
322 | { |
402 | { |
323 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
403 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
324 | |
404 | |
325 | if (CxTYPE(cx) == CXt_SUB) |
405 | if (CxTYPE (cx) == CXt_SUB) |
326 | { |
406 | { |
327 | CV *cv = cx->blk_sub.cv; |
407 | CV *cv = cx->blk_sub.cv; |
|
|
408 | |
328 | if (CvDEPTH(cv)) |
409 | if (CvDEPTH (cv)) |
329 | { |
410 | { |
330 | #ifdef USE_THREADS |
|
|
331 | /*XPUSHs ((SV *)CvOWNER(cv));*/ |
|
|
332 | /*CvOWNER(cv) = 0;*/ |
|
|
333 | /*error must unlock this cv etc.. etc...*/ |
|
|
334 | #endif |
|
|
335 | EXTEND (SP, CvDEPTH(cv)*2); |
411 | EXTEND (SP, 3); |
336 | |
|
|
337 | while (--CvDEPTH(cv)) |
|
|
338 | { |
|
|
339 | /* this tells the restore code to increment CvDEPTH */ |
|
|
340 | PUSHs (Nullsv); |
|
|
341 | PUSHs ((SV *)cv); |
|
|
342 | } |
|
|
343 | |
|
|
344 | PUSHs ((SV *)CvPADLIST(cv)); |
412 | PUSHs ((SV *)CvPADLIST (cv)); |
|
|
413 | PUSHs (INT2PTR (SV *, CvDEPTH (cv))); |
345 | PUSHs ((SV *)cv); |
414 | PUSHs ((SV *)cv); |
346 | |
415 | |
347 | get_padlist (cv); /* this is a monster */ |
416 | CvDEPTH (cv) = 0; |
|
|
417 | get_padlist (aTHX_ cv); |
348 | } |
418 | } |
349 | } |
419 | } |
350 | else if (CxTYPE(cx) == CXt_FORMAT) |
|
|
351 | { |
|
|
352 | /* I never used formats, so how should I know how these are implemented? */ |
|
|
353 | /* my bold guess is as a simple, plain sub... */ |
|
|
354 | croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); |
|
|
355 | } |
|
|
356 | } |
420 | } |
357 | while (cxix >= 0); |
|
|
358 | |
421 | |
359 | if (top_si->si_type == PERLSI_MAIN) |
422 | if (top_si->si_type == PERLSI_MAIN) |
360 | break; |
423 | break; |
361 | |
424 | |
362 | top_si = top_si->si_prev; |
425 | top_si = top_si->si_prev; |
… | |
… | |
365 | } |
428 | } |
366 | |
429 | |
367 | PUTBACK; |
430 | PUTBACK; |
368 | } |
431 | } |
369 | |
432 | |
370 | c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
433 | c->defav = c->save & CORO_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
371 | c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
434 | c->defsv = c->save & CORO_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
372 | c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
435 | c->errsv = c->save & CORO_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
|
|
436 | c->deffh = c->save & CORO_SAVE_DEFFH ? (GV *)SvREFCNT_inc (PL_defoutgv) : 0; |
|
|
437 | c->irssv = c->save & CORO_SAVE_IRSSV ? SvREFCNT_inc (PL_rs) : 0; |
373 | |
438 | |
374 | /* I have not the slightest idea of why av_reify is necessary */ |
439 | #define VAR(name,type)c->name = PL_ ## name; |
375 | /* but if it's missing the defav contents magically get replaced sometimes */ |
440 | # include "state.h" |
376 | if (c->defav) |
441 | #undef VAR |
377 | av_reify (c->defav); |
442 | } |
378 | |
443 | |
379 | c->dowarn = PL_dowarn; |
444 | /* |
|
|
445 | * allocate various perl stacks. This is an exact copy |
|
|
446 | * of perl.c:init_stacks, except that it uses less memory |
|
|
447 | * on the (sometimes correct) assumption that coroutines do |
|
|
448 | * not usually need a lot of stackspace. |
|
|
449 | */ |
|
|
450 | #if CORO_PREFER_PERL_FUNCTIONS |
|
|
451 | # define coro_init_stacks init_stacks |
|
|
452 | #else |
|
|
453 | static void |
|
|
454 | coro_init_stacks (pTHX) |
|
|
455 | { |
|
|
456 | PL_curstackinfo = new_stackinfo(128, 1024/sizeof(PERL_CONTEXT)); |
|
|
457 | PL_curstackinfo->si_type = PERLSI_MAIN; |
|
|
458 | PL_curstack = PL_curstackinfo->si_stack; |
|
|
459 | PL_mainstack = PL_curstack; /* remember in case we switch stacks */ |
380 | |
460 | |
381 | c->curstackinfo = PL_curstackinfo; |
461 | PL_stack_base = AvARRAY(PL_curstack); |
382 | c->curstack = PL_curstack; |
|
|
383 | c->mainstack = PL_mainstack; |
|
|
384 | c->stack_sp = PL_stack_sp; |
|
|
385 | c->op = PL_op; |
|
|
386 | c->curpad = PL_curpad; |
|
|
387 | c->stack_base = PL_stack_base; |
462 | PL_stack_sp = PL_stack_base; |
388 | c->stack_max = PL_stack_max; |
463 | PL_stack_max = PL_stack_base + AvMAX(PL_curstack); |
389 | c->tmps_stack = PL_tmps_stack; |
464 | |
390 | c->tmps_floor = PL_tmps_floor; |
465 | New(50,PL_tmps_stack,128,SV*); |
391 | c->tmps_ix = PL_tmps_ix; |
466 | PL_tmps_floor = -1; |
392 | c->tmps_max = PL_tmps_max; |
467 | PL_tmps_ix = -1; |
|
|
468 | PL_tmps_max = 128; |
|
|
469 | |
|
|
470 | New(54,PL_markstack,32,I32); |
393 | c->markstack = PL_markstack; |
471 | PL_markstack_ptr = PL_markstack; |
394 | c->markstack_ptr = PL_markstack_ptr; |
472 | PL_markstack_max = PL_markstack + 32; |
395 | c->markstack_max = PL_markstack_max; |
473 | |
396 | c->scopestack = PL_scopestack; |
474 | #ifdef SET_MARK_OFFSET |
397 | c->scopestack_ix = PL_scopestack_ix; |
475 | SET_MARK_OFFSET; |
398 | c->scopestack_max = PL_scopestack_max; |
476 | #endif |
399 | c->savestack = PL_savestack; |
477 | |
400 | c->savestack_ix = PL_savestack_ix; |
478 | New(54,PL_scopestack,32,I32); |
401 | c->savestack_max = PL_savestack_max; |
479 | PL_scopestack_ix = 0; |
402 | c->retstack = PL_retstack; |
480 | PL_scopestack_max = 32; |
403 | c->retstack_ix = PL_retstack_ix; |
481 | |
404 | c->retstack_max = PL_retstack_max; |
482 | New(54,PL_savestack,64,ANY); |
405 | c->curcop = PL_curcop; |
483 | PL_savestack_ix = 0; |
|
|
484 | PL_savestack_max = 64; |
|
|
485 | |
|
|
486 | #if !PERL_VERSION_ATLEAST (5,9,0) |
|
|
487 | New(54,PL_retstack,16,OP*); |
|
|
488 | PL_retstack_ix = 0; |
|
|
489 | PL_retstack_max = 16; |
|
|
490 | #endif |
406 | } |
491 | } |
|
|
492 | #endif |
407 | |
493 | |
408 | /* |
494 | /* |
409 | * destroy the stacks, the callchain etc... |
495 | * destroy the stacks, the callchain etc... |
410 | * still there is a memleak of 128 bytes... |
|
|
411 | */ |
496 | */ |
412 | STATIC void |
497 | static void |
413 | destroy_stacks(pTHX) |
498 | coro_destroy_stacks (pTHX) |
414 | { |
499 | { |
415 | /* is this ugly, I ask? */ |
500 | if (!IN_DESTRUCT) |
416 | while (PL_scopestack_ix) |
501 | { |
417 | LEAVE; |
502 | /* restore all saved variables and stuff */ |
|
|
503 | LEAVE_SCOPE (0); |
|
|
504 | assert (PL_tmps_floor == -1); |
418 | |
505 | |
419 | /* sure it is, but more important: is it correct?? :/ */ |
506 | /* free all temporaries */ |
420 | while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */ |
|
|
421 | FREETMPS; |
507 | FREETMPS; |
|
|
508 | assert (PL_tmps_ix == -1); |
|
|
509 | |
|
|
510 | /* unwind all extra stacks */ |
|
|
511 | POPSTACK_TO (PL_mainstack); |
|
|
512 | |
|
|
513 | /* unwind main stack */ |
|
|
514 | dounwind (-1); |
|
|
515 | } |
422 | |
516 | |
423 | while (PL_curstackinfo->si_next) |
517 | while (PL_curstackinfo->si_next) |
424 | PL_curstackinfo = PL_curstackinfo->si_next; |
518 | PL_curstackinfo = PL_curstackinfo->si_next; |
425 | |
519 | |
426 | while (PL_curstackinfo) |
520 | while (PL_curstackinfo) |
427 | { |
521 | { |
428 | PERL_SI *p = PL_curstackinfo->si_prev; |
522 | PERL_SI *p = PL_curstackinfo->si_prev; |
429 | |
523 | |
430 | { |
524 | if (!IN_DESTRUCT) |
431 | dSP; |
|
|
432 | SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); |
|
|
433 | PUTBACK; /* possibly superfluous */ |
|
|
434 | } |
|
|
435 | |
|
|
436 | dounwind(-1); |
|
|
437 | |
|
|
438 | SvREFCNT_dec(PL_curstackinfo->si_stack); |
525 | SvREFCNT_dec (PL_curstackinfo->si_stack); |
|
|
526 | |
439 | Safefree(PL_curstackinfo->si_cxstack); |
527 | Safefree (PL_curstackinfo->si_cxstack); |
440 | Safefree(PL_curstackinfo); |
528 | Safefree (PL_curstackinfo); |
441 | PL_curstackinfo = p; |
529 | PL_curstackinfo = p; |
442 | } |
530 | } |
443 | |
531 | |
444 | Safefree(PL_tmps_stack); |
532 | Safefree (PL_tmps_stack); |
445 | Safefree(PL_markstack); |
533 | Safefree (PL_markstack); |
446 | Safefree(PL_scopestack); |
534 | Safefree (PL_scopestack); |
447 | Safefree(PL_savestack); |
535 | Safefree (PL_savestack); |
|
|
536 | #if !PERL_VERSION_ATLEAST (5,9,0) |
448 | Safefree(PL_retstack); |
537 | Safefree (PL_retstack); |
|
|
538 | #endif |
449 | } |
539 | } |
450 | |
540 | |
451 | STATIC void |
541 | /** coroutine stack handling ************************************************/ |
452 | transfer(pTHX_ struct coro *prev, struct coro *next, int flags) |
542 | |
|
|
543 | static void |
|
|
544 | setup_coro (pTHX_ struct coro *coro) |
|
|
545 | { |
|
|
546 | /* |
|
|
547 | * emulate part of the perl startup here. |
|
|
548 | */ |
|
|
549 | coro_init_stacks (aTHX); |
|
|
550 | |
|
|
551 | PL_curcop = &PL_compiling; |
|
|
552 | PL_in_eval = EVAL_NULL; |
|
|
553 | PL_comppad = 0; |
|
|
554 | PL_curpm = 0; |
|
|
555 | PL_localizing = 0; |
|
|
556 | PL_dirty = 0; |
|
|
557 | PL_restartop = 0; |
|
|
558 | |
|
|
559 | { |
|
|
560 | dSP; |
|
|
561 | LOGOP myop; |
|
|
562 | |
|
|
563 | SvREFCNT_dec (GvAV (PL_defgv)); |
|
|
564 | GvAV (PL_defgv) = coro->args; coro->args = 0; |
|
|
565 | |
|
|
566 | Zero (&myop, 1, LOGOP); |
|
|
567 | myop.op_next = Nullop; |
|
|
568 | myop.op_flags = OPf_WANT_VOID; |
|
|
569 | |
|
|
570 | PUSHMARK (SP); |
|
|
571 | XPUSHs ((SV *)get_cv ("Coro::State::_coro_init", FALSE)); |
|
|
572 | PUTBACK; |
|
|
573 | PL_op = (OP *)&myop; |
|
|
574 | PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
|
|
575 | SPAGAIN; |
|
|
576 | } |
|
|
577 | |
|
|
578 | ENTER; /* necessary e.g. for dounwind */ |
|
|
579 | } |
|
|
580 | |
|
|
581 | static void |
|
|
582 | free_coro_mortal (pTHX) |
|
|
583 | { |
|
|
584 | if (coro_mortal) |
|
|
585 | { |
|
|
586 | SvREFCNT_dec (coro_mortal); |
|
|
587 | coro_mortal = 0; |
|
|
588 | } |
|
|
589 | } |
|
|
590 | |
|
|
591 | /* inject a fake call to Coro::State::_cctx_init into the execution */ |
|
|
592 | static void NOINLINE |
|
|
593 | prepare_cctx (pTHX_ coro_cctx *cctx) |
453 | { |
594 | { |
454 | dSP; |
595 | dSP; |
|
|
596 | LOGOP myop; |
455 | |
597 | |
456 | if (prev != next) |
598 | Zero (&myop, 1, LOGOP); |
|
|
599 | myop.op_next = PL_op; |
|
|
600 | myop.op_flags = OPf_WANT_VOID | OPf_STACKED; |
|
|
601 | |
|
|
602 | PUSHMARK (SP); |
|
|
603 | EXTEND (SP, 2); |
|
|
604 | PUSHs (sv_2mortal (newSViv (PTR2IV (cctx)))); |
|
|
605 | PUSHs ((SV *)get_cv ("Coro::State::_cctx_init", FALSE)); |
|
|
606 | PUTBACK; |
|
|
607 | PL_op = (OP *)&myop; |
|
|
608 | PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
|
|
609 | SPAGAIN; |
|
|
610 | } |
|
|
611 | |
|
|
612 | static void |
|
|
613 | coro_run (void *arg) |
|
|
614 | { |
|
|
615 | dTHX; |
|
|
616 | |
|
|
617 | /* coro_run is the alternative tail of transfer(), so unlock here. */ |
|
|
618 | UNLOCK; |
|
|
619 | |
|
|
620 | /* |
|
|
621 | * this is a _very_ stripped down perl interpreter ;) |
|
|
622 | */ |
|
|
623 | PL_top_env = &PL_start_env; |
|
|
624 | |
|
|
625 | /* inject call to cctx_init */ |
|
|
626 | prepare_cctx (aTHX_ (coro_cctx *)arg); |
|
|
627 | |
|
|
628 | /* somebody will hit me for both perl_run and PL_restartop */ |
|
|
629 | PL_restartop = PL_op; |
|
|
630 | perl_run (PL_curinterp); |
|
|
631 | |
|
|
632 | fputs ("FATAL: C coroutine fell over the edge of the world, aborting. Did you call exit in a coroutine?\n", stderr); |
|
|
633 | abort (); |
|
|
634 | } |
|
|
635 | |
|
|
636 | static coro_cctx * |
|
|
637 | cctx_new () |
|
|
638 | { |
|
|
639 | coro_cctx *cctx; |
|
|
640 | void *stack_start; |
|
|
641 | size_t stack_size; |
|
|
642 | |
|
|
643 | ++cctx_count; |
|
|
644 | |
|
|
645 | Newz (0, cctx, 1, coro_cctx); |
|
|
646 | |
|
|
647 | #if HAVE_MMAP |
|
|
648 | |
|
|
649 | cctx->ssize = ((coro_stacksize * sizeof (long) + PAGESIZE - 1) / PAGESIZE + CORO_STACKGUARD) * PAGESIZE; |
|
|
650 | /* mmap supposedly does allocate-on-write for us */ |
|
|
651 | cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
|
|
652 | |
|
|
653 | if (cctx->sptr != (void *)-1) |
|
|
654 | { |
|
|
655 | # if CORO_STACKGUARD |
|
|
656 | mprotect (cctx->sptr, CORO_STACKGUARD * PAGESIZE, PROT_NONE); |
|
|
657 | # endif |
|
|
658 | stack_start = CORO_STACKGUARD * PAGESIZE + (char *)cctx->sptr; |
|
|
659 | stack_size = cctx->ssize - CORO_STACKGUARD * PAGESIZE; |
|
|
660 | cctx->mapped = 1; |
457 | { |
661 | } |
458 | /* |
662 | else |
459 | * this could be done in newprocess which would lead to |
663 | #endif |
460 | * extremely elegant and fast (just SAVE/LOAD) |
664 | { |
461 | * code here, but lazy allocation of stacks has also |
665 | cctx->ssize = coro_stacksize * (long)sizeof (long); |
462 | * some virtues and the overhead of the if() is nil. |
666 | New (0, cctx->sptr, coro_stacksize, long); |
463 | */ |
667 | |
464 | if (next->mainstack) |
668 | if (!cctx->sptr) |
465 | { |
669 | { |
466 | SAVE (prev, flags); |
670 | perror ("FATAL: unable to allocate stack for coroutine"); |
467 | LOAD (next); |
671 | _exit (EXIT_FAILURE); |
468 | /* mark this state as in-use */ |
|
|
469 | next->mainstack = 0; |
|
|
470 | next->tmps_ix = -2; |
|
|
471 | } |
672 | } |
472 | else if (next->tmps_ix == -2) |
673 | |
|
|
674 | stack_start = cctx->sptr; |
|
|
675 | stack_size = cctx->ssize; |
|
|
676 | } |
|
|
677 | |
|
|
678 | REGISTER_STACK (cctx, (char *)stack_start, (char *)stack_start + stack_size); |
|
|
679 | coro_create (&cctx->cctx, coro_run, (void *)cctx, stack_start, stack_size); |
|
|
680 | |
|
|
681 | return cctx; |
|
|
682 | } |
|
|
683 | |
|
|
684 | static void |
|
|
685 | cctx_destroy (coro_cctx *cctx) |
|
|
686 | { |
|
|
687 | if (!cctx) |
|
|
688 | return; |
|
|
689 | |
|
|
690 | --cctx_count; |
|
|
691 | |
|
|
692 | #if CORO_USE_VALGRIND |
|
|
693 | VALGRIND_STACK_DEREGISTER (cctx->valgrind_id); |
|
|
694 | #endif |
|
|
695 | |
|
|
696 | #if HAVE_MMAP |
|
|
697 | if (cctx->mapped) |
|
|
698 | munmap (cctx->sptr, cctx->ssize); |
|
|
699 | else |
|
|
700 | #endif |
|
|
701 | Safefree (cctx->sptr); |
|
|
702 | |
|
|
703 | Safefree (cctx); |
|
|
704 | } |
|
|
705 | |
|
|
706 | static coro_cctx * |
|
|
707 | cctx_get (pTHX) |
|
|
708 | { |
|
|
709 | while (cctx_first) |
|
|
710 | { |
|
|
711 | coro_cctx *cctx = cctx_first; |
|
|
712 | cctx_first = cctx->next; |
|
|
713 | --cctx_idle; |
|
|
714 | |
|
|
715 | if (cctx->ssize >= coro_stacksize) |
|
|
716 | return cctx; |
|
|
717 | |
|
|
718 | cctx_destroy (cctx); |
|
|
719 | } |
|
|
720 | |
|
|
721 | PL_op = PL_op->op_next; |
|
|
722 | return cctx_new (); |
|
|
723 | } |
|
|
724 | |
|
|
725 | static void |
|
|
726 | cctx_put (coro_cctx *cctx) |
|
|
727 | { |
|
|
728 | /* free another cctx if overlimit */ |
|
|
729 | if (cctx_idle >= MAX_IDLE_CCTX) |
|
|
730 | { |
|
|
731 | coro_cctx *first = cctx_first; |
|
|
732 | cctx_first = first->next; |
|
|
733 | --cctx_idle; |
|
|
734 | |
|
|
735 | assert (!first->inuse); |
|
|
736 | cctx_destroy (first); |
|
|
737 | } |
|
|
738 | |
|
|
739 | ++cctx_idle; |
|
|
740 | cctx->next = cctx_first; |
|
|
741 | cctx_first = cctx; |
|
|
742 | } |
|
|
743 | |
|
|
744 | /** coroutine switching *****************************************************/ |
|
|
745 | |
|
|
746 | /* never call directly, always through the coro_state_transfer global variable */ |
|
|
747 | static void NOINLINE |
|
|
748 | transfer (pTHX_ struct coro *prev, struct coro *next) |
|
|
749 | { |
|
|
750 | dSTACKLEVEL; |
|
|
751 | |
|
|
752 | /* sometimes transfer is only called to set idle_sp */ |
|
|
753 | if (!next) |
|
|
754 | { |
|
|
755 | ((coro_cctx *)prev)->idle_sp = STACKLEVEL; |
|
|
756 | assert (((coro_cctx *)prev)->idle_te = PL_top_env); /* just for the side-effect when asserts are enabled */ |
|
|
757 | } |
|
|
758 | else if (prev != next) |
|
|
759 | { |
|
|
760 | coro_cctx *prev__cctx; |
|
|
761 | |
|
|
762 | if (prev->flags & CF_NEW) |
473 | { |
763 | { |
474 | croak ("tried to transfer to running coroutine"); |
764 | /* create a new empty context */ |
|
|
765 | Newz (0, prev->cctx, 1, coro_cctx); |
|
|
766 | prev->cctx->inuse = 1; |
|
|
767 | prev->flags &= ~CF_NEW; |
|
|
768 | prev->flags |= CF_RUNNING; |
|
|
769 | } |
|
|
770 | |
|
|
771 | /*TODO: must not croak here */ |
|
|
772 | if (!prev->flags & CF_RUNNING) |
|
|
773 | croak ("Coro::State::transfer called with non-running prev Coro::State, but can only transfer from running states"); |
|
|
774 | |
|
|
775 | if (next->flags & CF_RUNNING) |
|
|
776 | croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states"); |
|
|
777 | |
|
|
778 | if (next->flags & CF_DESTROYED) |
|
|
779 | croak ("Coro::State::transfer called with destroyed next Coro::State, but can only transfer to inactive states"); |
|
|
780 | |
|
|
781 | prev->flags &= ~CF_RUNNING; |
|
|
782 | next->flags |= CF_RUNNING; |
|
|
783 | |
|
|
784 | LOCK; |
|
|
785 | |
|
|
786 | if (next->flags & CF_NEW) |
|
|
787 | { |
|
|
788 | /* need to start coroutine */ |
|
|
789 | next->flags &= ~CF_NEW; |
|
|
790 | /* first get rid of the old state */ |
|
|
791 | save_perl (aTHX_ prev); |
|
|
792 | /* setup coroutine call */ |
|
|
793 | setup_coro (aTHX_ next); |
|
|
794 | /* need a new stack */ |
|
|
795 | assert (!next->cctx); |
475 | } |
796 | } |
476 | else |
797 | else |
477 | { |
798 | { |
|
|
799 | /* coroutine already started */ |
|
|
800 | save_perl (aTHX_ prev); |
|
|
801 | load_perl (aTHX_ next); |
478 | /* |
802 | } |
479 | * emulate part of the perl startup here. |
|
|
480 | */ |
|
|
481 | UNOP myop; |
|
|
482 | |
803 | |
483 | SAVE (prev, -1); /* first get rid of the old state */ |
804 | prev__cctx = prev->cctx; |
484 | |
805 | |
485 | init_stacks (); /* from perl.c */ |
806 | /* possibly "free" the cctx */ |
|
|
807 | if (prev__cctx->idle_sp == STACKLEVEL) |
|
|
808 | { |
|
|
809 | /* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */ |
|
|
810 | assert (("ERROR: current top_env must equal previous top_env", PL_top_env == prev__cctx->idle_te)); |
|
|
811 | |
|
|
812 | prev->cctx = 0; |
|
|
813 | |
|
|
814 | cctx_put (prev__cctx); |
|
|
815 | prev__cctx->inuse = 0; |
|
|
816 | } |
|
|
817 | |
|
|
818 | if (!next->cctx) |
|
|
819 | { |
|
|
820 | next->cctx = cctx_get (aTHX); |
|
|
821 | assert (!next->cctx->inuse); |
|
|
822 | next->cctx->inuse = 1; |
|
|
823 | } |
|
|
824 | |
|
|
825 | if (prev__cctx != next->cctx) |
|
|
826 | { |
|
|
827 | prev__cctx->top_env = PL_top_env; |
|
|
828 | PL_top_env = next->cctx->top_env; |
|
|
829 | coro_transfer (&prev__cctx->cctx, &next->cctx->cctx); |
|
|
830 | } |
|
|
831 | |
|
|
832 | free_coro_mortal (aTHX); |
|
|
833 | UNLOCK; |
|
|
834 | } |
|
|
835 | } |
|
|
836 | |
|
|
837 | struct transfer_args |
|
|
838 | { |
|
|
839 | struct coro *prev, *next; |
|
|
840 | }; |
|
|
841 | |
|
|
842 | #define TRANSFER(ta) transfer (aTHX_ (ta).prev, (ta).next) |
|
|
843 | |
|
|
844 | /** high level stuff ********************************************************/ |
|
|
845 | |
|
|
846 | static int |
|
|
847 | coro_state_destroy (pTHX_ struct coro *coro) |
|
|
848 | { |
|
|
849 | if (coro->flags & CF_DESTROYED) |
|
|
850 | return 0; |
|
|
851 | |
|
|
852 | coro->flags |= CF_DESTROYED; |
|
|
853 | |
|
|
854 | if (coro->flags & CF_READY) |
|
|
855 | { |
|
|
856 | /* reduce nready, as destroying a ready coro effectively unreadies it */ |
|
|
857 | /* alternative: look through all ready queues and remove the coro */ |
|
|
858 | LOCK; |
|
|
859 | --coro_nready; |
|
|
860 | UNLOCK; |
|
|
861 | } |
|
|
862 | else |
|
|
863 | coro->flags |= CF_READY; /* make sure it is NOT put into the readyqueue */ |
|
|
864 | |
|
|
865 | if (coro->mainstack && coro->mainstack != main_mainstack) |
|
|
866 | { |
|
|
867 | struct coro temp; |
|
|
868 | |
|
|
869 | assert (!(coro->flags & CF_RUNNING)); |
|
|
870 | |
|
|
871 | Zero (&temp, 1, struct coro); |
|
|
872 | temp.save = CORO_SAVE_DEF; |
|
|
873 | |
|
|
874 | if (coro->flags & CF_RUNNING) |
|
|
875 | croak ("FATAL: tried to destroy currently running coroutine"); |
|
|
876 | |
|
|
877 | save_perl (aTHX_ &temp); |
|
|
878 | load_perl (aTHX_ coro); |
|
|
879 | |
|
|
880 | coro_destroy_stacks (aTHX); |
|
|
881 | |
|
|
882 | load_perl (aTHX_ &temp); /* this will get rid of defsv etc.. */ |
|
|
883 | |
|
|
884 | coro->mainstack = 0; |
|
|
885 | } |
|
|
886 | |
|
|
887 | cctx_destroy (coro->cctx); |
|
|
888 | SvREFCNT_dec (coro->args); |
|
|
889 | |
|
|
890 | return 1; |
|
|
891 | } |
|
|
892 | |
|
|
893 | static int |
|
|
894 | coro_state_free (pTHX_ SV *sv, MAGIC *mg) |
|
|
895 | { |
|
|
896 | struct coro *coro = (struct coro *)mg->mg_ptr; |
|
|
897 | mg->mg_ptr = 0; |
|
|
898 | |
|
|
899 | if (--coro->refcnt < 0) |
|
|
900 | { |
|
|
901 | coro_state_destroy (aTHX_ coro); |
|
|
902 | Safefree (coro); |
|
|
903 | } |
|
|
904 | |
|
|
905 | return 0; |
|
|
906 | } |
|
|
907 | |
|
|
908 | static int |
|
|
909 | coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params) |
|
|
910 | { |
|
|
911 | struct coro *coro = (struct coro *)mg->mg_ptr; |
|
|
912 | |
|
|
913 | ++coro->refcnt; |
|
|
914 | |
|
|
915 | return 0; |
|
|
916 | } |
|
|
917 | |
|
|
918 | static MGVTBL coro_state_vtbl = { |
|
|
919 | 0, 0, 0, 0, |
|
|
920 | coro_state_free, |
|
|
921 | 0, |
|
|
922 | #ifdef MGf_DUP |
|
|
923 | coro_state_dup, |
|
|
924 | #else |
|
|
925 | # define MGf_DUP 0 |
|
|
926 | #endif |
|
|
927 | }; |
|
|
928 | |
|
|
929 | static struct coro * |
|
|
930 | SvSTATE_ (pTHX_ SV *coro) |
|
|
931 | { |
|
|
932 | HV *stash; |
|
|
933 | MAGIC *mg; |
|
|
934 | |
|
|
935 | if (SvROK (coro)) |
|
|
936 | coro = SvRV (coro); |
|
|
937 | |
|
|
938 | stash = SvSTASH (coro); |
|
|
939 | if (stash != coro_stash && stash != coro_state_stash) |
|
|
940 | { |
|
|
941 | /* very slow, but rare, check */ |
|
|
942 | if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State")) |
|
|
943 | croak ("Coro::State object required"); |
|
|
944 | } |
|
|
945 | |
|
|
946 | mg = CORO_MAGIC (coro); |
|
|
947 | return (struct coro *)mg->mg_ptr; |
|
|
948 | } |
|
|
949 | |
|
|
950 | #define SvSTATE(sv) SvSTATE_ (aTHX_ (sv)) |
|
|
951 | |
|
|
952 | static void |
|
|
953 | prepare_transfer (pTHX_ struct transfer_args *ta, SV *prev_sv, SV *next_sv) |
|
|
954 | { |
|
|
955 | ta->prev = SvSTATE (prev_sv); |
|
|
956 | ta->next = SvSTATE (next_sv); |
|
|
957 | } |
|
|
958 | |
|
|
959 | static void |
|
|
960 | api_transfer (SV *prev_sv, SV *next_sv) |
|
|
961 | { |
|
|
962 | dTHX; |
|
|
963 | struct transfer_args ta; |
|
|
964 | |
|
|
965 | prepare_transfer (aTHX_ &ta, prev_sv, next_sv); |
|
|
966 | TRANSFER (ta); |
|
|
967 | } |
|
|
968 | |
|
|
969 | static int |
|
|
970 | api_save (SV *coro_sv, int new_save) |
|
|
971 | { |
|
|
972 | dTHX; |
|
|
973 | struct coro *coro = SvSTATE (coro_sv); |
|
|
974 | int old_save = coro->save; |
|
|
975 | |
|
|
976 | if (new_save >= 0) |
|
|
977 | coro->save = new_save; |
|
|
978 | |
|
|
979 | return old_save; |
|
|
980 | } |
|
|
981 | |
|
|
982 | /** Coro ********************************************************************/ |
|
|
983 | |
|
|
984 | static void |
|
|
985 | coro_enq (pTHX_ SV *coro_sv) |
|
|
986 | { |
|
|
987 | av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv); |
|
|
988 | } |
|
|
989 | |
|
|
990 | static SV * |
|
|
991 | coro_deq (pTHX_ int min_prio) |
|
|
992 | { |
|
|
993 | int prio = PRIO_MAX - PRIO_MIN; |
|
|
994 | |
|
|
995 | min_prio -= PRIO_MIN; |
|
|
996 | if (min_prio < 0) |
|
|
997 | min_prio = 0; |
|
|
998 | |
|
|
999 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
|
|
1000 | if (AvFILLp (coro_ready [prio]) >= 0) |
|
|
1001 | return av_shift (coro_ready [prio]); |
|
|
1002 | |
|
|
1003 | return 0; |
|
|
1004 | } |
|
|
1005 | |
|
|
1006 | static int |
|
|
1007 | api_ready (SV *coro_sv) |
|
|
1008 | { |
|
|
1009 | dTHX; |
|
|
1010 | struct coro *coro; |
|
|
1011 | |
|
|
1012 | if (SvROK (coro_sv)) |
|
|
1013 | coro_sv = SvRV (coro_sv); |
|
|
1014 | |
|
|
1015 | coro = SvSTATE (coro_sv); |
|
|
1016 | |
|
|
1017 | if (coro->flags & CF_READY) |
|
|
1018 | return 0; |
|
|
1019 | |
|
|
1020 | coro->flags |= CF_READY; |
|
|
1021 | |
|
|
1022 | LOCK; |
|
|
1023 | coro_enq (aTHX_ SvREFCNT_inc (coro_sv)); |
|
|
1024 | ++coro_nready; |
|
|
1025 | UNLOCK; |
|
|
1026 | |
|
|
1027 | return 1; |
|
|
1028 | } |
|
|
1029 | |
|
|
1030 | static int |
|
|
1031 | api_is_ready (SV *coro_sv) |
|
|
1032 | { |
|
|
1033 | dTHX; |
|
|
1034 | return !!(SvSTATE (coro_sv)->flags & CF_READY); |
|
|
1035 | } |
|
|
1036 | |
|
|
1037 | static void |
|
|
1038 | prepare_schedule (pTHX_ struct transfer_args *ta) |
|
|
1039 | { |
|
|
1040 | SV *prev_sv, *next_sv; |
|
|
1041 | |
|
|
1042 | for (;;) |
|
|
1043 | { |
|
|
1044 | LOCK; |
|
|
1045 | next_sv = coro_deq (aTHX_ PRIO_MIN); |
|
|
1046 | |
|
|
1047 | /* nothing to schedule: call the idle handler */ |
|
|
1048 | if (!next_sv) |
|
|
1049 | { |
486 | SPAGAIN; |
1050 | dSP; |
|
|
1051 | UNLOCK; |
487 | |
1052 | |
488 | PL_op = (OP *)&myop; |
1053 | ENTER; |
489 | /*PL_curcop = 0;*/ |
1054 | SAVETMPS; |
490 | SvREFCNT_dec (GvAV (PL_defgv)); |
|
|
491 | GvAV (PL_defgv) = next->args; |
|
|
492 | |
1055 | |
493 | Zero(&myop, 1, UNOP); |
|
|
494 | myop.op_next = Nullop; |
|
|
495 | myop.op_flags = OPf_WANT_VOID; |
|
|
496 | |
|
|
497 | PUSHMARK(SP); |
1056 | PUSHMARK (SP); |
498 | XPUSHs ((SV*)get_cv(SUB_INIT, TRUE)); |
|
|
499 | /* |
|
|
500 | * the next line is slightly wrong, as PL_op->op_next |
|
|
501 | * is actually being executed so we skip the first op. |
|
|
502 | * that doesn't matter, though, since it is only |
|
|
503 | * pp_nextstate and we never return... |
|
|
504 | * ah yes, and I don't care anyways ;) |
|
|
505 | */ |
|
|
506 | PUTBACK; |
1057 | PUTBACK; |
507 | PL_op = pp_entersub(aTHX); |
1058 | call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD); |
508 | SPAGAIN; |
|
|
509 | |
1059 | |
510 | ENTER; /* necessary e.g. for dounwind */ |
1060 | FREETMPS; |
|
|
1061 | LEAVE; |
|
|
1062 | continue; |
511 | } |
1063 | } |
|
|
1064 | |
|
|
1065 | ta->next = SvSTATE (next_sv); |
|
|
1066 | |
|
|
1067 | /* cannot transfer to destroyed coros, skip and look for next */ |
|
|
1068 | if (ta->next->flags & CF_DESTROYED) |
|
|
1069 | { |
|
|
1070 | UNLOCK; |
|
|
1071 | SvREFCNT_dec (next_sv); |
|
|
1072 | /* coro_nready is already taken care of by destroy */ |
|
|
1073 | continue; |
|
|
1074 | } |
|
|
1075 | |
|
|
1076 | --coro_nready; |
|
|
1077 | UNLOCK; |
|
|
1078 | break; |
|
|
1079 | } |
|
|
1080 | |
|
|
1081 | /* free this only after the transfer */ |
|
|
1082 | prev_sv = SvRV (coro_current); |
|
|
1083 | SvRV_set (coro_current, next_sv); |
|
|
1084 | ta->prev = SvSTATE (prev_sv); |
|
|
1085 | |
|
|
1086 | assert (ta->next->flags & CF_READY); |
|
|
1087 | ta->next->flags &= ~CF_READY; |
|
|
1088 | |
|
|
1089 | LOCK; |
|
|
1090 | free_coro_mortal (aTHX); |
|
|
1091 | coro_mortal = prev_sv; |
|
|
1092 | UNLOCK; |
|
|
1093 | } |
|
|
1094 | |
|
|
1095 | static void |
|
|
1096 | prepare_cede (pTHX_ struct transfer_args *ta) |
|
|
1097 | { |
|
|
1098 | api_ready (coro_current); |
|
|
1099 | prepare_schedule (aTHX_ ta); |
|
|
1100 | } |
|
|
1101 | |
|
|
1102 | static int |
|
|
1103 | prepare_cede_notself (pTHX_ struct transfer_args *ta) |
|
|
1104 | { |
|
|
1105 | if (coro_nready) |
512 | } |
1106 | { |
|
|
1107 | SV *prev = SvRV (coro_current); |
|
|
1108 | prepare_schedule (aTHX_ ta); |
|
|
1109 | api_ready (prev); |
|
|
1110 | return 1; |
|
|
1111 | } |
|
|
1112 | else |
|
|
1113 | return 0; |
|
|
1114 | } |
|
|
1115 | |
|
|
1116 | static void |
|
|
1117 | api_schedule (void) |
|
|
1118 | { |
|
|
1119 | dTHX; |
|
|
1120 | struct transfer_args ta; |
|
|
1121 | |
|
|
1122 | prepare_schedule (aTHX_ &ta); |
|
|
1123 | TRANSFER (ta); |
|
|
1124 | } |
|
|
1125 | |
|
|
1126 | static int |
|
|
1127 | api_cede (void) |
|
|
1128 | { |
|
|
1129 | dTHX; |
|
|
1130 | struct transfer_args ta; |
|
|
1131 | |
|
|
1132 | prepare_cede (aTHX_ &ta); |
|
|
1133 | |
|
|
1134 | if (ta.prev != ta.next) |
|
|
1135 | { |
|
|
1136 | TRANSFER (ta); |
|
|
1137 | return 1; |
|
|
1138 | } |
|
|
1139 | else |
|
|
1140 | return 0; |
|
|
1141 | } |
|
|
1142 | |
|
|
1143 | static int |
|
|
1144 | api_cede_notself (void) |
|
|
1145 | { |
|
|
1146 | dTHX; |
|
|
1147 | struct transfer_args ta; |
|
|
1148 | |
|
|
1149 | if (prepare_cede_notself (aTHX_ &ta)) |
|
|
1150 | { |
|
|
1151 | TRANSFER (ta); |
|
|
1152 | return 1; |
|
|
1153 | } |
|
|
1154 | else |
|
|
1155 | return 0; |
513 | } |
1156 | } |
514 | |
1157 | |
515 | MODULE = Coro::State PACKAGE = Coro::State |
1158 | MODULE = Coro::State PACKAGE = Coro::State |
516 | |
1159 | |
517 | PROTOTYPES: ENABLE |
1160 | PROTOTYPES: DISABLE |
518 | |
1161 | |
519 | BOOT: |
1162 | BOOT: |
520 | { /* {} necessary for stoopid perl-5.6.x */ |
1163 | { |
|
|
1164 | #ifdef USE_ITHREADS |
|
|
1165 | MUTEX_INIT (&coro_mutex); |
|
|
1166 | #endif |
|
|
1167 | BOOT_PAGESIZE; |
|
|
1168 | |
521 | HV * stash = gv_stashpvn("Coro::State", 10, TRUE); |
1169 | coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
522 | |
1170 | |
523 | newCONSTSUB (stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); |
1171 | newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (CORO_SAVE_DEFAV)); |
524 | newCONSTSUB (stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); |
1172 | newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (CORO_SAVE_DEFSV)); |
525 | newCONSTSUB (stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); |
1173 | newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (CORO_SAVE_ERRSV)); |
526 | |
1174 | newCONSTSUB (coro_state_stash, "SAVE_IRSSV", newSViv (CORO_SAVE_IRSSV)); |
527 | if (!padlist_cache) |
1175 | newCONSTSUB (coro_state_stash, "SAVE_DEFFH", newSViv (CORO_SAVE_DEFFH)); |
528 | padlist_cache = newHV (); |
1176 | newCONSTSUB (coro_state_stash, "SAVE_DEF", newSViv (CORO_SAVE_DEF)); |
|
|
1177 | newCONSTSUB (coro_state_stash, "SAVE_ALL", newSViv (CORO_SAVE_ALL)); |
529 | |
1178 | |
530 | main_mainstack = PL_mainstack; |
1179 | main_mainstack = PL_mainstack; |
531 | } |
|
|
532 | |
1180 | |
533 | Coro::State |
1181 | coroapi.ver = CORO_API_VERSION; |
534 | _newprocess(args) |
1182 | coroapi.transfer = api_transfer; |
535 | SV * args |
1183 | |
536 | PROTOTYPE: $ |
1184 | assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL)); |
|
|
1185 | } |
|
|
1186 | |
|
|
1187 | SV * |
|
|
1188 | new (char *klass, ...) |
537 | CODE: |
1189 | CODE: |
538 | Coro__State coro; |
1190 | { |
|
|
1191 | struct coro *coro; |
|
|
1192 | HV *hv; |
|
|
1193 | int i; |
539 | |
1194 | |
540 | if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) |
|
|
541 | croak ("Coro::State::_newprocess expects an arrayref"); |
|
|
542 | |
|
|
543 | New (0, coro, 1, struct coro); |
1195 | Newz (0, coro, 1, struct coro); |
|
|
1196 | coro->args = newAV (); |
|
|
1197 | coro->save = CORO_SAVE_DEF; |
|
|
1198 | coro->flags = CF_NEW; |
544 | |
1199 | |
545 | coro->mainstack = 0; /* actual work is done inside transfer */ |
1200 | hv = newHV (); |
546 | coro->args = (AV *)SvREFCNT_inc (SvRV (args)); |
1201 | sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP; |
|
|
1202 | RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1)); |
547 | |
1203 | |
548 | RETVAL = coro; |
1204 | for (i = 1; i < items; i++) |
|
|
1205 | av_push (coro->args, newSVsv (ST (i))); |
|
|
1206 | } |
549 | OUTPUT: |
1207 | OUTPUT: |
550 | RETVAL |
1208 | RETVAL |
551 | |
1209 | |
|
|
1210 | int |
|
|
1211 | save (SV *coro, int new_save = -1) |
|
|
1212 | CODE: |
|
|
1213 | RETVAL = api_save (coro, new_save); |
|
|
1214 | OUTPUT: |
|
|
1215 | RETVAL |
|
|
1216 | |
|
|
1217 | int |
|
|
1218 | save_also (SV *coro_sv, int save_also) |
|
|
1219 | CODE: |
|
|
1220 | { |
|
|
1221 | struct coro *coro = SvSTATE (coro_sv); |
|
|
1222 | RETVAL = coro->save; |
|
|
1223 | coro->save |= save_also; |
|
|
1224 | } |
|
|
1225 | OUTPUT: |
|
|
1226 | RETVAL |
|
|
1227 | |
552 | void |
1228 | void |
553 | transfer(prev, next, flags = TRANSFER_SAVE_ALL) |
1229 | _set_stacklevel (...) |
554 | Coro::State_or_hashref prev |
1230 | ALIAS: |
555 | Coro::State_or_hashref next |
1231 | Coro::State::transfer = 1 |
556 | int flags |
1232 | Coro::schedule = 2 |
557 | PROTOTYPE: @ |
1233 | Coro::cede = 3 |
|
|
1234 | Coro::cede_notself = 4 |
558 | CODE: |
1235 | CODE: |
|
|
1236 | { |
|
|
1237 | struct transfer_args ta; |
559 | |
1238 | |
560 | transfer (aTHX_ prev, next, flags); |
1239 | switch (ix) |
|
|
1240 | { |
|
|
1241 | case 0: |
|
|
1242 | ta.prev = (struct coro *)INT2PTR (coro_cctx *, SvIV (ST (0))); |
|
|
1243 | ta.next = 0; |
|
|
1244 | break; |
|
|
1245 | |
|
|
1246 | case 1: |
|
|
1247 | if (items != 2) |
|
|
1248 | croak ("Coro::State::transfer (prev,next) expects two arguments, not %d", items); |
|
|
1249 | |
|
|
1250 | prepare_transfer (aTHX_ &ta, ST (0), ST (1)); |
|
|
1251 | break; |
|
|
1252 | |
|
|
1253 | case 2: |
|
|
1254 | prepare_schedule (aTHX_ &ta); |
|
|
1255 | break; |
|
|
1256 | |
|
|
1257 | case 3: |
|
|
1258 | prepare_cede (aTHX_ &ta); |
|
|
1259 | break; |
|
|
1260 | |
|
|
1261 | case 4: |
|
|
1262 | if (!prepare_cede_notself (aTHX_ &ta)) |
|
|
1263 | XSRETURN_EMPTY; |
|
|
1264 | |
|
|
1265 | break; |
|
|
1266 | } |
|
|
1267 | |
|
|
1268 | BARRIER; |
|
|
1269 | TRANSFER (ta); |
|
|
1270 | |
|
|
1271 | if (GIMME_V != G_VOID && ta.next != ta.prev) |
|
|
1272 | XSRETURN_YES; |
|
|
1273 | } |
|
|
1274 | |
|
|
1275 | bool |
|
|
1276 | _destroy (SV *coro_sv) |
|
|
1277 | CODE: |
|
|
1278 | RETVAL = coro_state_destroy (aTHX_ SvSTATE (coro_sv)); |
|
|
1279 | OUTPUT: |
|
|
1280 | RETVAL |
561 | |
1281 | |
562 | void |
1282 | void |
563 | DESTROY(coro) |
1283 | _exit (code) |
564 | Coro::State coro |
1284 | int code |
|
|
1285 | PROTOTYPE: $ |
|
|
1286 | CODE: |
|
|
1287 | _exit (code); |
|
|
1288 | |
|
|
1289 | int |
|
|
1290 | cctx_stacksize (int new_stacksize = 0) |
|
|
1291 | CODE: |
|
|
1292 | RETVAL = coro_stacksize; |
|
|
1293 | if (new_stacksize) |
|
|
1294 | coro_stacksize = new_stacksize; |
|
|
1295 | OUTPUT: |
|
|
1296 | RETVAL |
|
|
1297 | |
|
|
1298 | int |
|
|
1299 | cctx_count () |
|
|
1300 | CODE: |
|
|
1301 | RETVAL = cctx_count; |
|
|
1302 | OUTPUT: |
|
|
1303 | RETVAL |
|
|
1304 | |
|
|
1305 | int |
|
|
1306 | cctx_idle () |
|
|
1307 | CODE: |
|
|
1308 | RETVAL = cctx_idle; |
|
|
1309 | OUTPUT: |
|
|
1310 | RETVAL |
|
|
1311 | |
|
|
1312 | MODULE = Coro::State PACKAGE = Coro |
|
|
1313 | |
|
|
1314 | BOOT: |
|
|
1315 | { |
|
|
1316 | int i; |
|
|
1317 | |
|
|
1318 | coro_stash = gv_stashpv ("Coro", TRUE); |
|
|
1319 | |
|
|
1320 | newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX)); |
|
|
1321 | newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); |
|
|
1322 | newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); |
|
|
1323 | newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW)); |
|
|
1324 | newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); |
|
|
1325 | newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN)); |
|
|
1326 | |
|
|
1327 | coro_current = get_sv ("Coro::current", FALSE); |
|
|
1328 | SvREADONLY_on (coro_current); |
|
|
1329 | |
|
|
1330 | for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) |
|
|
1331 | coro_ready[i] = newAV (); |
|
|
1332 | |
|
|
1333 | { |
|
|
1334 | SV *sv = perl_get_sv("Coro::API", 1); |
|
|
1335 | |
|
|
1336 | coroapi.schedule = api_schedule; |
|
|
1337 | coroapi.save = api_save; |
|
|
1338 | coroapi.cede = api_cede; |
|
|
1339 | coroapi.cede_notself = api_cede_notself; |
|
|
1340 | coroapi.ready = api_ready; |
|
|
1341 | coroapi.is_ready = api_is_ready; |
|
|
1342 | coroapi.nready = &coro_nready; |
|
|
1343 | coroapi.current = coro_current; |
|
|
1344 | |
|
|
1345 | GCoroAPI = &coroapi; |
|
|
1346 | sv_setiv (sv, (IV)&coroapi); |
|
|
1347 | SvREADONLY_on (sv); |
|
|
1348 | } |
|
|
1349 | } |
|
|
1350 | |
|
|
1351 | void |
|
|
1352 | _set_current (SV *current) |
|
|
1353 | PROTOTYPE: $ |
|
|
1354 | CODE: |
|
|
1355 | SvREFCNT_dec (SvRV (coro_current)); |
|
|
1356 | SvRV_set (coro_current, SvREFCNT_inc (SvRV (current))); |
|
|
1357 | |
|
|
1358 | int |
|
|
1359 | prio (Coro::State coro, int newprio = 0) |
|
|
1360 | ALIAS: |
|
|
1361 | nice = 1 |
565 | CODE: |
1362 | CODE: |
|
|
1363 | { |
|
|
1364 | RETVAL = coro->prio; |
566 | |
1365 | |
567 | if (coro->mainstack && coro->mainstack != main_mainstack) |
1366 | if (items > 1) |
568 | { |
1367 | { |
569 | struct coro temp; |
1368 | if (ix) |
|
|
1369 | newprio = coro->prio - newprio; |
570 | |
1370 | |
571 | SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); |
1371 | if (newprio < PRIO_MIN) newprio = PRIO_MIN; |
572 | LOAD(aTHX_ coro); |
1372 | if (newprio > PRIO_MAX) newprio = PRIO_MAX; |
573 | |
1373 | |
574 | destroy_stacks (); |
1374 | coro->prio = newprio; |
575 | |
|
|
576 | LOAD((&temp)); /* this will get rid of defsv etc.. */ |
|
|
577 | } |
1375 | } |
|
|
1376 | } |
|
|
1377 | OUTPUT: |
|
|
1378 | RETVAL |
578 | |
1379 | |
579 | Safefree (coro); |
1380 | SV * |
|
|
1381 | ready (SV *self) |
|
|
1382 | PROTOTYPE: $ |
|
|
1383 | CODE: |
|
|
1384 | RETVAL = boolSV (api_ready (self)); |
|
|
1385 | OUTPUT: |
|
|
1386 | RETVAL |
580 | |
1387 | |
581 | /* |
1388 | SV * |
582 | * there is one problematic case left (remember _recurse?) |
1389 | is_ready (SV *self) |
583 | * consider the case when we |
1390 | PROTOTYPE: $ |
584 | * |
1391 | CODE: |
585 | * 1. start a coroutine |
1392 | RETVAL = boolSV (api_is_ready (self)); |
586 | * 2. inside it descend into some xs functions |
1393 | OUTPUT: |
587 | * 3. xs function calls a callback |
1394 | RETVAL |
588 | * 4. callback switches to $main |
|
|
589 | * 5. $main ends - we will end inside the xs function |
|
|
590 | * 6. xs function returns and perl executes - what? |
|
|
591 | * |
|
|
592 | * to avoid this case we recurse in this function |
|
|
593 | * and simply call my_exit(0), skipping other xs functions |
|
|
594 | */ |
|
|
595 | |
1395 | |
596 | #if 0 |
1396 | int |
|
|
1397 | nready (...) |
|
|
1398 | PROTOTYPE: |
|
|
1399 | CODE: |
|
|
1400 | RETVAL = coro_nready; |
|
|
1401 | OUTPUT: |
|
|
1402 | RETVAL |
|
|
1403 | |
|
|
1404 | MODULE = Coro::State PACKAGE = Coro::AIO |
|
|
1405 | |
|
|
1406 | SV * |
|
|
1407 | _get_state () |
|
|
1408 | CODE: |
|
|
1409 | { |
|
|
1410 | struct io_state *data; |
|
|
1411 | |
|
|
1412 | RETVAL = newSV (sizeof (struct io_state)); |
|
|
1413 | data = (struct io_state *)SvPVX (RETVAL); |
|
|
1414 | SvCUR_set (RETVAL, sizeof (struct io_state)); |
|
|
1415 | SvPOK_only (RETVAL); |
|
|
1416 | |
|
|
1417 | data->errorno = errno; |
|
|
1418 | data->laststype = PL_laststype; |
|
|
1419 | data->laststatval = PL_laststatval; |
|
|
1420 | data->statcache = PL_statcache; |
|
|
1421 | } |
|
|
1422 | OUTPUT: |
|
|
1423 | RETVAL |
|
|
1424 | |
597 | void |
1425 | void |
598 | _recurse() |
1426 | _set_state (char *data_) |
|
|
1427 | PROTOTYPE: $ |
599 | CODE: |
1428 | CODE: |
600 | LEAVE; |
1429 | { |
601 | PL_stack_sp = PL_stack_base + ax - 1; |
1430 | struct io_state *data = (void *)data_; |
602 | PL_op = PL_op->op_next; |
|
|
603 | CALLRUNOPS(aTHX); |
|
|
604 | printf ("my_exit\n"); |
|
|
605 | my_exit (0); |
|
|
606 | |
1431 | |
607 | #endif |
1432 | errno = data->errorno; |
|
|
1433 | PL_laststype = data->laststype; |
|
|
1434 | PL_laststatval = data->laststatval; |
|
|
1435 | PL_statcache = data->statcache; |
|
|
1436 | } |
608 | |
1437 | |
609 | void |
|
|
610 | flush() |
|
|
611 | CODE: |
|
|
612 | #ifdef MAY_FLUSH |
|
|
613 | flush_padlist_cache (); |
|
|
614 | #endif |
|
|
615 | |
|
|
616 | MODULE = Coro::State PACKAGE = Coro::Cont |
|
|
617 | |
|
|
618 | # this is dirty (do you hear me?) and should be in it's own .xs |
|
|
619 | |
|
|
620 | void |
|
|
621 | result(...) |
|
|
622 | PROTOTYPE: @ |
|
|
623 | CODE: |
|
|
624 | static SV *returnstk; |
|
|
625 | SV *sv; |
|
|
626 | AV *defav = GvAV (PL_defgv); |
|
|
627 | struct coro *prev, *next; |
|
|
628 | |
|
|
629 | if (!returnstk) |
|
|
630 | returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE)); |
|
|
631 | |
|
|
632 | /* set up @_ -- ugly */ |
|
|
633 | av_clear (defav); |
|
|
634 | av_fill (defav, items - 1); |
|
|
635 | while (items--) |
|
|
636 | av_store (defav, items, SvREFCNT_inc (ST(items))); |
|
|
637 | |
|
|
638 | mg_get (returnstk); /* isn't documentation wrong for mg_get? */ |
|
|
639 | sv = av_pop ((AV *)SvRV (returnstk)); |
|
|
640 | prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0))); |
|
|
641 | next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))); |
|
|
642 | SvREFCNT_dec (sv); |
|
|
643 | transfer(prev, next, 0); |
|
|
644 | |
|
|