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