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