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