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