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