|
|
1 | #include "libcoro/coro.c" |
|
|
2 | |
|
|
3 | #define PERL_NO_GET_CONTEXT |
|
|
4 | #define PERL_EXT |
|
|
5 | |
1 | #include "EXTERN.h" |
6 | #include "EXTERN.h" |
2 | #include "perl.h" |
7 | #include "perl.h" |
3 | #include "XSUB.h" |
8 | #include "XSUB.h" |
|
|
9 | #include "perliol.h" |
4 | |
10 | |
5 | #include "libcoro/coro.c" |
11 | #include "patchlevel.h" |
6 | |
12 | |
7 | #include <signal.h> |
13 | #include <stdio.h> |
|
|
14 | #include <errno.h> |
|
|
15 | #include <assert.h> |
|
|
16 | |
|
|
17 | #ifdef WIN32 |
|
|
18 | # undef setjmp |
|
|
19 | # undef longjmp |
|
|
20 | # undef _exit |
|
|
21 | # define setjmp _setjmp // deep magic, don't ask |
|
|
22 | #else |
|
|
23 | # include <inttypes.h> /* most portable stdint.h */ |
|
|
24 | #endif |
8 | |
25 | |
9 | #ifdef HAVE_MMAP |
26 | #ifdef HAVE_MMAP |
10 | # include <unistd.h> |
27 | # include <unistd.h> |
11 | # include <sys/mman.h> |
28 | # include <sys/mman.h> |
12 | # ifndef MAP_ANON |
|
|
13 | # ifdef MAP_ANONYMOUS |
29 | # ifndef MAP_ANONYMOUS |
14 | # define MAP_ANON MAP_ANONYMOUS |
30 | # ifdef MAP_ANON |
|
|
31 | # define MAP_ANONYMOUS MAP_ANON |
15 | # else |
32 | # else |
16 | # undef HAVE_MMAP |
33 | # undef HAVE_MMAP |
17 | # endif |
34 | # endif |
18 | # endif |
35 | # endif |
|
|
36 | # include <limits.h> |
|
|
37 | # ifndef PAGESIZE |
|
|
38 | # define PAGESIZE pagesize |
|
|
39 | # define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE) |
|
|
40 | static long pagesize; |
|
|
41 | # else |
|
|
42 | # define BOOT_PAGESIZE (void)0 |
19 | #endif |
43 | # endif |
|
|
44 | #else |
|
|
45 | # define PAGESIZE 0 |
|
|
46 | # define BOOT_PAGESIZE (void)0 |
|
|
47 | #endif |
20 | |
48 | |
21 | #define MAY_FLUSH /* increases codesize and is rarely used */ |
49 | #if CORO_USE_VALGRIND |
|
|
50 | # include <valgrind/valgrind.h> |
|
|
51 | #endif |
22 | |
52 | |
23 | #define SUB_INIT "Coro::State::initialize" |
53 | /* the maximum number of idle cctx that will be pooled */ |
24 | #define UCORO_STATE "_coro_state" |
54 | static int cctx_max_idle = 4; |
25 | |
55 | |
26 | /* The next macro should declare a variable stacklevel that contains and approximation |
56 | #define PERL_VERSION_ATLEAST(a,b,c) \ |
27 | * to the current C stack pointer. Its property is that it changes with each call |
57 | (PERL_REVISION > (a) \ |
28 | * and should be unique. */ |
58 | || (PERL_REVISION == (a) \ |
|
|
59 | && (PERL_VERSION > (b) \ |
|
|
60 | || (PERL_VERSION == (b) && PERLSUBVERSION >= (c))))) |
|
|
61 | |
|
|
62 | #if !PERL_VERSION_ATLEAST (5,6,0) |
|
|
63 | # ifndef PL_ppaddr |
|
|
64 | # define PL_ppaddr ppaddr |
|
|
65 | # endif |
|
|
66 | # ifndef call_sv |
|
|
67 | # define call_sv perl_call_sv |
|
|
68 | # endif |
|
|
69 | # ifndef get_sv |
|
|
70 | # define get_sv perl_get_sv |
|
|
71 | # endif |
|
|
72 | # ifndef get_cv |
|
|
73 | # define get_cv perl_get_cv |
|
|
74 | # endif |
|
|
75 | # ifndef IS_PADGV |
|
|
76 | # define IS_PADGV(v) 0 |
|
|
77 | # endif |
|
|
78 | # ifndef IS_PADCONST |
|
|
79 | # define IS_PADCONST(v) 0 |
|
|
80 | # endif |
|
|
81 | #endif |
|
|
82 | |
|
|
83 | /* 5.11 */ |
|
|
84 | #ifndef CxHASARGS |
|
|
85 | # define CxHASARGS(cx) (cx)->blk_sub.hasargs |
|
|
86 | #endif |
|
|
87 | |
|
|
88 | /* 5.10.0 */ |
|
|
89 | #ifndef SvREFCNT_inc_NN |
|
|
90 | # define SvREFCNT_inc_NN(sv) SvREFCNT_inc (sv) |
|
|
91 | #endif |
|
|
92 | |
|
|
93 | /* 5.8.8 */ |
|
|
94 | #ifndef GV_NOTQUAL |
|
|
95 | # define GV_NOTQUAL 0 |
|
|
96 | #endif |
|
|
97 | #ifndef newSV |
|
|
98 | # define newSV(l) NEWSV(0,l) |
|
|
99 | #endif |
|
|
100 | |
|
|
101 | /* 5.8.7 */ |
|
|
102 | #ifndef SvRV_set |
|
|
103 | # define SvRV_set(s,v) SvRV(s) = (v) |
|
|
104 | #endif |
|
|
105 | |
|
|
106 | #if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64 |
|
|
107 | # undef CORO_STACKGUARD |
|
|
108 | #endif |
|
|
109 | |
|
|
110 | #ifndef CORO_STACKGUARD |
|
|
111 | # define CORO_STACKGUARD 0 |
|
|
112 | #endif |
|
|
113 | |
|
|
114 | /* prefer perl internal functions over our own? */ |
|
|
115 | #ifndef CORO_PREFER_PERL_FUNCTIONS |
|
|
116 | # define CORO_PREFER_PERL_FUNCTIONS 0 |
|
|
117 | #endif |
|
|
118 | |
|
|
119 | /* The next macros try to return the current stack pointer, in an as |
|
|
120 | * portable way as possible. */ |
|
|
121 | #if __GNUC__ >= 4 |
|
|
122 | # define dSTACKLEVEL void *stacklevel = __builtin_frame_address (0) |
|
|
123 | #else |
29 | #define dSTACKLEVEL void *stacklevel = &stacklevel |
124 | # define dSTACKLEVEL volatile void *stacklevel = (volatile void *)&stacklevel |
|
|
125 | #endif |
30 | |
126 | |
31 | #define labs(l) ((l) >= 0 ? (l) : -(l)) |
127 | #define IN_DESTRUCT (PL_main_cv == Nullcv) |
|
|
128 | |
|
|
129 | #if __GNUC__ >= 3 |
|
|
130 | # define attribute(x) __attribute__(x) |
|
|
131 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
|
|
132 | # define INLINE static inline |
|
|
133 | #else |
|
|
134 | # define attribute(x) |
|
|
135 | # define expect(expr,value) (expr) |
|
|
136 | # define INLINE static |
|
|
137 | #endif |
|
|
138 | |
|
|
139 | #define expect_false(expr) expect ((expr) != 0, 0) |
|
|
140 | #define expect_true(expr) expect ((expr) != 0, 1) |
|
|
141 | |
|
|
142 | #define NOINLINE attribute ((noinline)) |
32 | |
143 | |
33 | #include "CoroAPI.h" |
144 | #include "CoroAPI.h" |
34 | |
145 | |
|
|
146 | #ifdef USE_ITHREADS |
|
|
147 | # if CORO_PTHREAD |
|
|
148 | static void *coro_thx; |
|
|
149 | # endif |
|
|
150 | #endif |
|
|
151 | |
|
|
152 | /* helper storage struct for Coro::AIO */ |
|
|
153 | struct io_state |
|
|
154 | { |
|
|
155 | AV *res; |
|
|
156 | int errorno; |
|
|
157 | I32 laststype; /* U16 in 5.10.0 */ |
|
|
158 | int laststatval; |
|
|
159 | Stat_t statcache; |
|
|
160 | }; |
|
|
161 | |
|
|
162 | static double (*nvtime)(); /* so why doesn't it take void? */ |
|
|
163 | |
|
|
164 | static U32 cctx_gen; |
|
|
165 | static size_t cctx_stacksize = CORO_STACKSIZE; |
35 | static struct CoroAPI coroapi; |
166 | static struct CoroAPI coroapi; |
|
|
167 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
|
|
168 | static JMPENV *main_top_env; |
|
|
169 | static HV *coro_state_stash, *coro_stash; |
|
|
170 | static volatile SV *coro_mortal; /* will be freed/thrown after next transfer */ |
36 | |
171 | |
37 | /* this is actually not only the c stack but also c registers etc... */ |
172 | static GV *irsgv; /* $/ */ |
|
|
173 | static GV *stdoutgv; /* *STDOUT */ |
|
|
174 | static SV *rv_diehook; |
|
|
175 | static SV *rv_warnhook; |
|
|
176 | static HV *hv_sig; /* %SIG */ |
|
|
177 | |
|
|
178 | /* async_pool helper stuff */ |
|
|
179 | static SV *sv_pool_rss; |
|
|
180 | static SV *sv_pool_size; |
|
|
181 | static AV *av_async_pool; |
|
|
182 | |
|
|
183 | /* Coro::AnyEvent */ |
|
|
184 | static SV *sv_activity; |
|
|
185 | |
|
|
186 | static struct coro_cctx *cctx_first; |
|
|
187 | static int cctx_count, cctx_idle; |
|
|
188 | |
|
|
189 | enum { |
|
|
190 | CC_MAPPED = 0x01, |
|
|
191 | CC_NOREUSE = 0x02, /* throw this away after tracing */ |
|
|
192 | CC_TRACE = 0x04, |
|
|
193 | CC_TRACE_SUB = 0x08, /* trace sub calls */ |
|
|
194 | CC_TRACE_LINE = 0x10, /* trace each statement */ |
|
|
195 | CC_TRACE_ALL = CC_TRACE_SUB | CC_TRACE_LINE, |
|
|
196 | }; |
|
|
197 | |
|
|
198 | /* this is a structure representing a c-level coroutine */ |
38 | typedef struct { |
199 | typedef struct coro_cctx |
39 | int refcnt; /* pointer reference counter */ |
200 | { |
40 | int usecnt; /* shared by how many coroutines */ |
201 | struct coro_cctx *next; |
41 | int gencnt; /* generation counter */ |
|
|
42 | |
202 | |
|
|
203 | /* the stack */ |
|
|
204 | void *sptr; |
|
|
205 | size_t ssize; |
|
|
206 | |
|
|
207 | /* cpu state */ |
|
|
208 | void *idle_sp; /* sp of top-level transfer/schedule/cede call */ |
|
|
209 | JMPENV *idle_te; /* same as idle_sp, but for top_env, TODO: remove once stable */ |
|
|
210 | JMPENV *top_env; |
43 | coro_context cctx; |
211 | coro_context cctx; |
44 | |
212 | |
45 | void *sptr; |
213 | U32 gen; |
46 | long ssize; /* positive == mmap, otherwise malloc */ |
214 | #if CORO_USE_VALGRIND |
47 | } coro_stack; |
215 | int valgrind_id; |
|
|
216 | #endif |
|
|
217 | unsigned char flags; |
|
|
218 | } coro_cctx; |
48 | |
219 | |
|
|
220 | enum { |
|
|
221 | CF_RUNNING = 0x0001, /* coroutine is running */ |
|
|
222 | CF_READY = 0x0002, /* coroutine is ready */ |
|
|
223 | CF_NEW = 0x0004, /* has never been switched to */ |
|
|
224 | CF_DESTROYED = 0x0008, /* coroutine data has been freed */ |
|
|
225 | }; |
|
|
226 | |
|
|
227 | /* the structure where most of the perl state is stored, overlaid on the cxstack */ |
|
|
228 | typedef struct |
|
|
229 | { |
|
|
230 | SV *defsv; |
|
|
231 | AV *defav; |
|
|
232 | SV *errsv; |
|
|
233 | SV *irsgv; |
|
|
234 | #define VAR(name,type) type name; |
|
|
235 | # include "state.h" |
|
|
236 | #undef VAR |
|
|
237 | } perl_slots; |
|
|
238 | |
|
|
239 | #define SLOT_COUNT ((sizeof (perl_slots) + sizeof (PERL_CONTEXT) - 1) / sizeof (PERL_CONTEXT)) |
|
|
240 | |
|
|
241 | /* this is a structure representing a perl-level coroutine */ |
49 | struct coro { |
242 | struct coro { |
50 | /* the optional C context */ |
243 | /* the C coroutine allocated to this perl coroutine, if any */ |
51 | coro_stack *stack; |
244 | coro_cctx *cctx; |
52 | void *cursp; |
|
|
53 | int gencnt; |
|
|
54 | |
245 | |
55 | /* optionally saved, might be zero */ |
246 | /* process data */ |
56 | AV *defav; |
247 | struct CoroSLF slf_frame; /* saved slf frame */ |
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; |
248 | AV *mainstack; |
68 | SV **stack_sp; |
249 | perl_slots *slot; /* basically the saved 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 | |
250 | |
92 | /* data associated with this coroutine (initial args) */ |
251 | AV *args; /* data associated with this coroutine (initial args) */ |
93 | AV *args; |
252 | int refcnt; /* coroutines are refcounted, yes */ |
|
|
253 | int flags; /* CF_ flags */ |
|
|
254 | HV *hv; /* the perl hash associated with this coro, if any */ |
|
|
255 | void (*on_destroy)(pTHX_ struct coro *coro); |
|
|
256 | |
|
|
257 | /* statistics */ |
|
|
258 | int usecount; /* number of transfers to this coro */ |
|
|
259 | |
|
|
260 | /* coro process data */ |
|
|
261 | int prio; |
|
|
262 | SV *throw; /* exception to be thrown */ |
|
|
263 | |
|
|
264 | /* async_pool */ |
|
|
265 | SV *saved_deffh; |
|
|
266 | |
|
|
267 | /* linked list */ |
|
|
268 | struct coro *next, *prev; |
94 | }; |
269 | }; |
95 | |
270 | |
96 | typedef struct coro *Coro__State; |
271 | typedef struct coro *Coro__State; |
97 | typedef struct coro *Coro__State_or_hashref; |
272 | typedef struct coro *Coro__State_or_hashref; |
98 | |
273 | |
99 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
274 | static struct CoroSLF slf_frame; /* the current slf frame */ |
100 | static HV *coro_state_stash; |
|
|
101 | static SV *ucoro_state_sv; |
|
|
102 | static U32 ucoro_state_hash; |
|
|
103 | static HV *padlist_cache; |
|
|
104 | |
|
|
105 | /* mostly copied from op.c:cv_clone2 */ |
|
|
106 | STATIC AV * |
|
|
107 | clone_padlist (AV *protopadlist) |
|
|
108 | { |
|
|
109 | AV *av; |
|
|
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; |
|
|
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 | |
|
|
128 | newpadlist = newAV (); |
|
|
129 | AvREAL_off (newpadlist); |
|
|
130 | av_store (newpadlist, 0, (SV *) newpad_name); |
|
|
131 | av_store (newpadlist, 1, (SV *) newpad); |
|
|
132 | |
|
|
133 | av = newAV (); /* will be @_ */ |
|
|
134 | av_extend (av, 0); |
|
|
135 | av_store (newpad, 0, (SV *) av); |
|
|
136 | AvFLAGS (av) = AVf_REIFY; |
|
|
137 | |
|
|
138 | for (ix = fpad; ix > 0; ix--) |
|
|
139 | { |
|
|
140 | SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; |
|
|
141 | if (namesv && namesv != &PL_sv_undef) |
|
|
142 | { |
|
|
143 | char *name = SvPVX (namesv); /* XXX */ |
|
|
144 | if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') |
|
|
145 | { /* lexical from outside? */ |
|
|
146 | npad[ix] = SvREFCNT_inc (ppad[ix]); |
|
|
147 | } |
|
|
148 | else |
|
|
149 | { /* our own lexical */ |
|
|
150 | SV *sv; |
|
|
151 | if (*name == '&') |
|
|
152 | sv = SvREFCNT_inc (ppad[ix]); |
|
|
153 | else if (*name == '@') |
|
|
154 | sv = (SV *) newAV (); |
|
|
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 | } |
|
|
163 | } |
|
|
164 | else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) |
|
|
165 | { |
|
|
166 | npad[ix] = SvREFCNT_inc (ppad[ix]); |
|
|
167 | } |
|
|
168 | else |
|
|
169 | { |
|
|
170 | SV *sv = NEWSV (0, 0); |
|
|
171 | SvPADTMP_on (sv); |
|
|
172 | npad[ix] = sv; |
|
|
173 | } |
|
|
174 | } |
|
|
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 | |
|
|
317 | { |
|
|
318 | dSP; |
|
|
319 | CV *cv; |
|
|
320 | |
|
|
321 | /* now do the ugly restore mess */ |
|
|
322 | while ((cv = (CV *)POPs)) |
|
|
323 | { |
|
|
324 | AV *padlist = (AV *)POPs; |
|
|
325 | |
|
|
326 | if (padlist) |
|
|
327 | { |
|
|
328 | put_padlist (cv); /* mark this padlist as available */ |
|
|
329 | CvPADLIST(cv) = padlist; |
|
|
330 | #ifdef USE_THREADS |
|
|
331 | /*CvOWNER(cv) = (struct perl_thread *)POPs;*/ |
|
|
332 | #endif |
|
|
333 | } |
|
|
334 | |
|
|
335 | ++CvDEPTH(cv); |
|
|
336 | } |
|
|
337 | |
|
|
338 | PUTBACK; |
|
|
339 | } |
|
|
340 | } |
|
|
341 | |
|
|
342 | static void |
|
|
343 | save_state(pTHX_ Coro__State c, int flags) |
|
|
344 | { |
|
|
345 | { |
|
|
346 | dSP; |
|
|
347 | I32 cxix = cxstack_ix; |
|
|
348 | PERL_CONTEXT *ccstk = cxstack; |
|
|
349 | PERL_SI *top_si = PL_curstackinfo; |
|
|
350 | |
|
|
351 | /* |
|
|
352 | * the worst thing you can imagine happens first - we have to save |
|
|
353 | * (and reinitialize) all cv's in the whole callchain :( |
|
|
354 | */ |
|
|
355 | |
|
|
356 | PUSHs (Nullsv); |
|
|
357 | /* this loop was inspired by pp_caller */ |
|
|
358 | for (;;) |
|
|
359 | { |
|
|
360 | while (cxix >= 0) |
|
|
361 | { |
|
|
362 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
|
|
363 | |
|
|
364 | if (CxTYPE(cx) == CXt_SUB) |
|
|
365 | { |
|
|
366 | CV *cv = cx->blk_sub.cv; |
|
|
367 | if (CvDEPTH(cv)) |
|
|
368 | { |
|
|
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); |
|
|
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)); |
|
|
384 | PUSHs ((SV *)cv); |
|
|
385 | |
|
|
386 | get_padlist (cv); /* this is a monster */ |
|
|
387 | } |
|
|
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 | } |
|
|
395 | } |
|
|
396 | |
|
|
397 | if (top_si->si_type == PERLSI_MAIN) |
|
|
398 | break; |
|
|
399 | |
|
|
400 | top_si = top_si->si_prev; |
|
|
401 | ccstk = top_si->si_cxstack; |
|
|
402 | cxix = top_si->si_cxix; |
|
|
403 | } |
|
|
404 | |
|
|
405 | PUTBACK; |
|
|
406 | } |
|
|
407 | |
|
|
408 | c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
|
|
409 | c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
|
|
410 | c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
|
|
411 | |
|
|
412 | c->dowarn = PL_dowarn; |
|
|
413 | c->in_eval = PL_in_eval; |
|
|
414 | |
|
|
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 | } |
|
|
442 | |
|
|
443 | /* |
|
|
444 | * allocate various perl stacks. This is an exact copy |
|
|
445 | * of perl.c:init_stacks, except that it uses less memory |
|
|
446 | * on the assumption that coroutines do not usually need |
|
|
447 | * a lot of stackspace. |
|
|
448 | */ |
|
|
449 | STATIC void |
|
|
450 | coro_init_stacks (pTHX) |
|
|
451 | { |
|
|
452 | PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); |
|
|
453 | PL_curstackinfo->si_type = PERLSI_MAIN; |
|
|
454 | PL_curstack = PL_curstackinfo->si_stack; |
|
|
455 | PL_mainstack = PL_curstack; /* remember in case we switch stacks */ |
|
|
456 | |
|
|
457 | PL_stack_base = AvARRAY(PL_curstack); |
|
|
458 | PL_stack_sp = PL_stack_base; |
|
|
459 | PL_stack_max = PL_stack_base + AvMAX(PL_curstack); |
|
|
460 | |
|
|
461 | New(50,PL_tmps_stack,96,SV*); |
|
|
462 | PL_tmps_floor = -1; |
|
|
463 | PL_tmps_ix = -1; |
|
|
464 | PL_tmps_max = 96; |
|
|
465 | |
|
|
466 | New(54,PL_markstack,16,I32); |
|
|
467 | PL_markstack_ptr = PL_markstack; |
|
|
468 | PL_markstack_max = PL_markstack + 16; |
|
|
469 | |
|
|
470 | SET_MARK_OFFSET; |
|
|
471 | |
|
|
472 | New(54,PL_scopestack,16,I32); |
|
|
473 | PL_scopestack_ix = 0; |
|
|
474 | PL_scopestack_max = 16; |
|
|
475 | |
|
|
476 | New(54,PL_savestack,96,ANY); |
|
|
477 | PL_savestack_ix = 0; |
|
|
478 | PL_savestack_max = 96; |
|
|
479 | |
|
|
480 | New(54,PL_retstack,8,OP*); |
|
|
481 | PL_retstack_ix = 0; |
|
|
482 | PL_retstack_max = 8; |
|
|
483 | } |
|
|
484 | |
|
|
485 | /* |
|
|
486 | * destroy the stacks, the callchain etc... |
|
|
487 | * still there is a memleak of 128 bytes... |
|
|
488 | */ |
|
|
489 | STATIC void |
|
|
490 | destroy_stacks(pTHX) |
|
|
491 | { |
|
|
492 | int destruct = PL_main_cv != Nullcv; |
|
|
493 | |
|
|
494 | if (destruct) |
|
|
495 | { |
|
|
496 | /* is this ugly, I ask? */ |
|
|
497 | while (PL_scopestack_ix) |
|
|
498 | LEAVE; |
|
|
499 | |
|
|
500 | /* sure it is, but more important: is it correct?? :/ */ |
|
|
501 | while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */ |
|
|
502 | FREETMPS; |
|
|
503 | } |
|
|
504 | |
|
|
505 | while (PL_curstackinfo->si_next) |
|
|
506 | PL_curstackinfo = PL_curstackinfo->si_next; |
|
|
507 | |
|
|
508 | while (PL_curstackinfo) |
|
|
509 | { |
|
|
510 | PERL_SI *p = PL_curstackinfo->si_prev; |
|
|
511 | |
|
|
512 | { |
|
|
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); |
|
|
522 | } |
|
|
523 | |
|
|
524 | Safefree(PL_curstackinfo->si_cxstack); |
|
|
525 | Safefree(PL_curstackinfo); |
|
|
526 | PL_curstackinfo = p; |
|
|
527 | } |
|
|
528 | |
|
|
529 | Safefree(PL_tmps_stack); |
|
|
530 | Safefree(PL_markstack); |
|
|
531 | Safefree(PL_scopestack); |
|
|
532 | Safefree(PL_savestack); |
|
|
533 | 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 |
|
|
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 | } |
|
|
564 | |
|
|
565 | static void |
|
|
566 | deallocate_stack (Coro__State ctx) |
|
|
567 | { |
|
|
568 | coro_stack *stack = ctx->stack; |
|
|
569 | |
|
|
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 |
|
|
591 | setup_coro (void *arg) |
|
|
592 | { |
|
|
593 | /* |
|
|
594 | * emulate part of the perl startup here. |
|
|
595 | */ |
|
|
596 | dSP; |
|
|
597 | Coro__State ctx = (Coro__State)arg; |
|
|
598 | SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE); |
|
|
599 | |
|
|
600 | coro_init_stacks (aTHX); |
|
|
601 | /*PL_curcop = 0;*/ |
|
|
602 | /*PL_in_eval = PL_in_eval;*/ /* inherit */ |
|
|
603 | SvREFCNT_dec (GvAV (PL_defgv)); |
|
|
604 | GvAV (PL_defgv) = ctx->args; |
|
|
605 | |
|
|
606 | SPAGAIN; |
|
|
607 | |
|
|
608 | if (ctx->stack) |
|
|
609 | { |
|
|
610 | ctx->cursp = 0; |
|
|
611 | |
|
|
612 | PUSHMARK(SP); |
|
|
613 | PUTBACK; |
|
|
614 | (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL); |
|
|
615 | |
|
|
616 | if (SvTRUE (ERRSV)) |
|
|
617 | croak (NULL); |
|
|
618 | else |
|
|
619 | croak ("FATAL: CCTXT coroutine returned!"); |
|
|
620 | } |
|
|
621 | else |
|
|
622 | { |
|
|
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 | } |
|
|
646 | } |
|
|
647 | |
|
|
648 | static void |
|
|
649 | continue_coro (void *arg) |
|
|
650 | { |
|
|
651 | /* |
|
|
652 | * this is a _very_ stripped down perl interpreter ;) |
|
|
653 | */ |
|
|
654 | Coro__State ctx = (Coro__State)arg; |
|
|
655 | JMPENV coro_start_env; |
|
|
656 | |
|
|
657 | /* same as JMPENV_BOOTSTRAP */ |
|
|
658 | Zero(&coro_start_env, 1, JMPENV); |
|
|
659 | coro_start_env.je_ret = -1; |
|
|
660 | coro_start_env.je_mustcatch = TRUE; |
|
|
661 | PL_top_env = &coro_start_env; |
|
|
662 | |
|
|
663 | ctx->cursp = 0; |
|
|
664 | PL_op = PL_op->op_next; |
|
|
665 | CALLRUNOPS(aTHX); |
|
|
666 | |
|
|
667 | abort (); |
|
|
668 | } |
|
|
669 | |
|
|
670 | STATIC void |
|
|
671 | transfer(pTHX_ struct coro *prev, struct coro *next, int flags) |
|
|
672 | { |
|
|
673 | dSTACKLEVEL; |
|
|
674 | static struct coro *xnext; |
|
|
675 | |
|
|
676 | if (prev != next) |
|
|
677 | { |
|
|
678 | xnext = next; |
|
|
679 | |
|
|
680 | if (next->mainstack) |
|
|
681 | { |
|
|
682 | SAVE (prev, flags); |
|
|
683 | LOAD (next); |
|
|
684 | |
|
|
685 | /* mark this state as in-use */ |
|
|
686 | next->mainstack = 0; |
|
|
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 | } |
|
|
716 | else if (next->tmps_ix == -2) |
|
|
717 | croak ("tried to transfer to running coroutine"); |
|
|
718 | else |
|
|
719 | { |
|
|
720 | SAVE (prev, -1); /* first get rid of the old state */ |
|
|
721 | |
|
|
722 | if (flags & TRANSFER_SAVE_CCTXT) |
|
|
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 | } |
|
|
749 | } |
|
|
750 | |
|
|
751 | /* |
|
|
752 | * xnext is now either prev or next, depending on wether |
|
|
753 | * we switched the c stack or not. that's why i use a global |
|
|
754 | * variable, that should become thread-specific at one point. |
|
|
755 | */ |
|
|
756 | xnext->cursp = stacklevel; |
|
|
757 | } |
|
|
758 | |
|
|
759 | static struct coro * |
|
|
760 | sv_to_coro (SV *arg, const char *funcname, const char *varname) |
|
|
761 | { |
|
|
762 | if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVHV) |
|
|
763 | { |
|
|
764 | HE *he = hv_fetch_ent((HV *)SvRV(arg), ucoro_state_sv, 0, ucoro_state_hash); |
|
|
765 | |
|
|
766 | if (!he) |
|
|
767 | croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", funcname, varname); |
|
|
768 | |
|
|
769 | arg = HeVAL(he); |
|
|
770 | } |
|
|
771 | |
|
|
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 | |
|
|
776 | croak ("%s() -- %s is not (and contains not) a Coro::State object", funcname, varname); |
|
|
777 | /*NORETURN*/ |
|
|
778 | } |
|
|
779 | |
|
|
780 | static void |
|
|
781 | api_transfer(pTHX_ SV *prev, SV *next, int flags) |
|
|
782 | { |
|
|
783 | transfer(aTHX_ |
|
|
784 | sv_to_coro (prev, "Coro::transfer", "prev"), |
|
|
785 | sv_to_coro (next, "Coro::transfer", "next"), |
|
|
786 | flags); |
|
|
787 | } |
|
|
788 | |
275 | |
789 | /** Coro ********************************************************************/ |
276 | /** Coro ********************************************************************/ |
790 | |
277 | |
791 | #define PRIO_MAX 3 |
278 | #define PRIO_MAX 3 |
792 | #define PRIO_HIGH 1 |
279 | #define PRIO_HIGH 1 |
… | |
… | |
794 | #define PRIO_LOW -1 |
281 | #define PRIO_LOW -1 |
795 | #define PRIO_IDLE -3 |
282 | #define PRIO_IDLE -3 |
796 | #define PRIO_MIN -4 |
283 | #define PRIO_MIN -4 |
797 | |
284 | |
798 | /* for Coro.pm */ |
285 | /* for Coro.pm */ |
799 | static GV *coro_current, *coro_idle; |
286 | static SV *coro_current; |
|
|
287 | static SV *coro_readyhook; |
800 | static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; |
288 | static AV *coro_ready [PRIO_MAX - PRIO_MIN + 1]; |
801 | static int coro_nready; |
289 | static struct coro *coro_first; |
|
|
290 | #define coro_nready coroapi.nready |
802 | |
291 | |
803 | static void |
292 | /** lowlevel stuff **********************************************************/ |
804 | coro_enq (SV *sv) |
293 | |
|
|
294 | static SV * |
|
|
295 | coro_get_sv (pTHX_ const char *name, int create) |
805 | { |
296 | { |
806 | if (SvROK (sv)) |
297 | #if PERL_VERSION_ATLEAST (5,10,0) |
|
|
298 | /* silence stupid and wrong 5.10 warning that I am unable to switch off */ |
|
|
299 | get_sv (name, create); |
|
|
300 | #endif |
|
|
301 | return get_sv (name, create); |
|
|
302 | } |
|
|
303 | |
|
|
304 | static AV * |
|
|
305 | coro_get_av (pTHX_ const char *name, int create) |
|
|
306 | { |
|
|
307 | #if PERL_VERSION_ATLEAST (5,10,0) |
|
|
308 | /* silence stupid and wrong 5.10 warning that I am unable to switch off */ |
|
|
309 | get_av (name, create); |
|
|
310 | #endif |
|
|
311 | return get_av (name, create); |
|
|
312 | } |
|
|
313 | |
|
|
314 | static HV * |
|
|
315 | coro_get_hv (pTHX_ const char *name, int create) |
|
|
316 | { |
|
|
317 | #if PERL_VERSION_ATLEAST (5,10,0) |
|
|
318 | /* silence stupid and wrong 5.10 warning that I am unable to switch off */ |
|
|
319 | get_hv (name, create); |
|
|
320 | #endif |
|
|
321 | return get_hv (name, create); |
|
|
322 | } |
|
|
323 | |
|
|
324 | static AV * |
|
|
325 | coro_clone_padlist (pTHX_ CV *cv) |
|
|
326 | { |
|
|
327 | AV *padlist = CvPADLIST (cv); |
|
|
328 | AV *newpadlist, *newpad; |
|
|
329 | |
|
|
330 | newpadlist = newAV (); |
|
|
331 | AvREAL_off (newpadlist); |
|
|
332 | #if PERL_VERSION_ATLEAST (5,10,0) |
|
|
333 | Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1); |
|
|
334 | #else |
|
|
335 | Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1); |
|
|
336 | #endif |
|
|
337 | newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)]; |
|
|
338 | --AvFILLp (padlist); |
|
|
339 | |
|
|
340 | av_store (newpadlist, 0, SvREFCNT_inc_NN (*av_fetch (padlist, 0, FALSE))); |
|
|
341 | av_store (newpadlist, 1, (SV *)newpad); |
|
|
342 | |
|
|
343 | return newpadlist; |
|
|
344 | } |
|
|
345 | |
|
|
346 | static void |
|
|
347 | free_padlist (pTHX_ AV *padlist) |
|
|
348 | { |
|
|
349 | /* may be during global destruction */ |
|
|
350 | if (SvREFCNT (padlist)) |
807 | { |
351 | { |
808 | SV *hv = SvRV (sv); |
352 | I32 i = AvFILLp (padlist); |
809 | if (SvTYPE (hv) == SVt_PVHV) |
353 | while (i >= 0) |
810 | { |
354 | { |
811 | SV **xprio = hv_fetch ((HV *)hv, "prio", 4, 0); |
355 | SV **svp = av_fetch (padlist, i--, FALSE); |
812 | int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL; |
356 | if (svp) |
|
|
357 | { |
|
|
358 | SV *sv; |
|
|
359 | while (&PL_sv_undef != (sv = av_pop ((AV *)*svp))) |
|
|
360 | SvREFCNT_dec (sv); |
813 | |
361 | |
814 | prio = prio > PRIO_MAX ? PRIO_MAX |
362 | SvREFCNT_dec (*svp); |
815 | : prio < PRIO_MIN ? PRIO_MIN |
363 | } |
816 | : prio; |
|
|
817 | |
|
|
818 | av_push (coro_ready [prio - PRIO_MIN], sv); |
|
|
819 | coro_nready++; |
|
|
820 | |
|
|
821 | return; |
|
|
822 | } |
364 | } |
|
|
365 | |
|
|
366 | SvREFCNT_dec ((SV*)padlist); |
|
|
367 | } |
|
|
368 | } |
|
|
369 | |
|
|
370 | static int |
|
|
371 | coro_cv_free (pTHX_ SV *sv, MAGIC *mg) |
|
|
372 | { |
|
|
373 | AV *padlist; |
|
|
374 | AV *av = (AV *)mg->mg_obj; |
|
|
375 | |
|
|
376 | /* casting is fun. */ |
|
|
377 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
|
|
378 | free_padlist (aTHX_ padlist); |
|
|
379 | |
|
|
380 | SvREFCNT_dec (av); /* sv_magicext increased the refcount */ |
|
|
381 | |
|
|
382 | return 0; |
|
|
383 | } |
|
|
384 | |
|
|
385 | #define CORO_MAGIC_type_cv PERL_MAGIC_ext |
|
|
386 | #define CORO_MAGIC_type_state PERL_MAGIC_ext |
|
|
387 | |
|
|
388 | static MGVTBL coro_cv_vtbl = { |
|
|
389 | 0, 0, 0, 0, |
|
|
390 | coro_cv_free |
|
|
391 | }; |
|
|
392 | |
|
|
393 | #define CORO_MAGIC(sv, type) \ |
|
|
394 | expect_true (SvMAGIC (sv)) \ |
|
|
395 | ? expect_true (SvMAGIC (sv)->mg_type == type) \ |
|
|
396 | ? SvMAGIC (sv) \ |
|
|
397 | : mg_find (sv, type) \ |
|
|
398 | : 0 |
|
|
399 | |
|
|
400 | #define CORO_MAGIC_cv(cv) CORO_MAGIC (((SV *)(cv)), CORO_MAGIC_type_cv) |
|
|
401 | #define CORO_MAGIC_state(sv) CORO_MAGIC (((SV *)(sv)), CORO_MAGIC_type_state) |
|
|
402 | |
|
|
403 | INLINE struct coro * |
|
|
404 | SvSTATE_ (pTHX_ SV *coro) |
|
|
405 | { |
|
|
406 | HV *stash; |
|
|
407 | MAGIC *mg; |
|
|
408 | |
|
|
409 | if (SvROK (coro)) |
|
|
410 | coro = SvRV (coro); |
|
|
411 | |
|
|
412 | if (expect_false (SvTYPE (coro) != SVt_PVHV)) |
|
|
413 | croak ("Coro::State object required"); |
|
|
414 | |
|
|
415 | stash = SvSTASH (coro); |
|
|
416 | if (expect_false (stash != coro_stash && stash != coro_state_stash)) |
|
|
417 | { |
|
|
418 | /* very slow, but rare, check */ |
|
|
419 | if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State")) |
|
|
420 | croak ("Coro::State object required"); |
|
|
421 | } |
|
|
422 | |
|
|
423 | mg = CORO_MAGIC_state (coro); |
|
|
424 | return (struct coro *)mg->mg_ptr; |
|
|
425 | } |
|
|
426 | |
|
|
427 | #define SvSTATE(sv) SvSTATE_ (aTHX_ (sv)) |
|
|
428 | |
|
|
429 | /* fastert than SvSTATE, but expects a coroutine hv */ |
|
|
430 | INLINE struct coro * |
|
|
431 | SvSTATE_hv (SV *sv) |
|
|
432 | { |
|
|
433 | MAGIC *mg = expect_true (SvMAGIC (sv)->mg_type == CORO_MAGIC_type_state) |
|
|
434 | ? SvMAGIC (sv) |
|
|
435 | : mg_find (sv, CORO_MAGIC_type_state); |
|
|
436 | |
|
|
437 | return (struct coro *)mg->mg_ptr; |
|
|
438 | } |
|
|
439 | |
|
|
440 | #define SvSTATE_current SvSTATE_hv (SvRV (coro_current)) |
|
|
441 | |
|
|
442 | /* the next two functions merely cache the padlists */ |
|
|
443 | static void |
|
|
444 | get_padlist (pTHX_ CV *cv) |
|
|
445 | { |
|
|
446 | MAGIC *mg = CORO_MAGIC_cv (cv); |
|
|
447 | AV *av; |
|
|
448 | |
|
|
449 | if (expect_true (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0)) |
|
|
450 | CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--]; |
|
|
451 | else |
|
|
452 | { |
|
|
453 | #if CORO_PREFER_PERL_FUNCTIONS |
|
|
454 | /* this is probably cleaner? but also slower! */ |
|
|
455 | /* in practise, it seems to be less stable */ |
|
|
456 | CV *cp = Perl_cv_clone (cv); |
|
|
457 | CvPADLIST (cv) = CvPADLIST (cp); |
|
|
458 | CvPADLIST (cp) = 0; |
|
|
459 | SvREFCNT_dec (cp); |
|
|
460 | #else |
|
|
461 | CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv); |
|
|
462 | #endif |
823 | } |
463 | } |
|
|
464 | } |
824 | |
465 | |
825 | croak ("Coro::ready tried to enqueue something that is not a coroutine"); |
466 | static void |
|
|
467 | put_padlist (pTHX_ CV *cv) |
|
|
468 | { |
|
|
469 | MAGIC *mg = CORO_MAGIC_cv (cv); |
|
|
470 | AV *av; |
|
|
471 | |
|
|
472 | if (expect_false (!mg)) |
|
|
473 | mg = sv_magicext ((SV *)cv, (SV *)newAV (), CORO_MAGIC_type_cv, &coro_cv_vtbl, 0, 0); |
|
|
474 | |
|
|
475 | av = (AV *)mg->mg_obj; |
|
|
476 | |
|
|
477 | if (expect_false (AvFILLp (av) >= AvMAX (av))) |
|
|
478 | av_extend (av, AvMAX (av) + 1); |
|
|
479 | |
|
|
480 | AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv); |
|
|
481 | } |
|
|
482 | |
|
|
483 | /** load & save, init *******************************************************/ |
|
|
484 | |
|
|
485 | static void |
|
|
486 | load_perl (pTHX_ Coro__State c) |
|
|
487 | { |
|
|
488 | perl_slots *slot = c->slot; |
|
|
489 | c->slot = 0; |
|
|
490 | |
|
|
491 | PL_mainstack = c->mainstack; |
|
|
492 | |
|
|
493 | GvSV (PL_defgv) = slot->defsv; |
|
|
494 | GvAV (PL_defgv) = slot->defav; |
|
|
495 | GvSV (PL_errgv) = slot->errsv; |
|
|
496 | GvSV (irsgv) = slot->irsgv; |
|
|
497 | |
|
|
498 | #define VAR(name,type) PL_ ## name = slot->name; |
|
|
499 | # include "state.h" |
|
|
500 | #undef VAR |
|
|
501 | |
|
|
502 | { |
|
|
503 | dSP; |
|
|
504 | |
|
|
505 | CV *cv; |
|
|
506 | |
|
|
507 | /* now do the ugly restore mess */ |
|
|
508 | while (expect_true (cv = (CV *)POPs)) |
|
|
509 | { |
|
|
510 | put_padlist (aTHX_ cv); /* mark this padlist as available */ |
|
|
511 | CvDEPTH (cv) = PTR2IV (POPs); |
|
|
512 | CvPADLIST (cv) = (AV *)POPs; |
|
|
513 | } |
|
|
514 | |
|
|
515 | PUTBACK; |
|
|
516 | } |
|
|
517 | |
|
|
518 | slf_frame = c->slf_frame; |
|
|
519 | } |
|
|
520 | |
|
|
521 | static void |
|
|
522 | save_perl (pTHX_ Coro__State c) |
|
|
523 | { |
|
|
524 | c->slf_frame = slf_frame; |
|
|
525 | |
|
|
526 | { |
|
|
527 | dSP; |
|
|
528 | I32 cxix = cxstack_ix; |
|
|
529 | PERL_CONTEXT *ccstk = cxstack; |
|
|
530 | PERL_SI *top_si = PL_curstackinfo; |
|
|
531 | |
|
|
532 | /* |
|
|
533 | * the worst thing you can imagine happens first - we have to save |
|
|
534 | * (and reinitialize) all cv's in the whole callchain :( |
|
|
535 | */ |
|
|
536 | |
|
|
537 | XPUSHs (Nullsv); |
|
|
538 | /* this loop was inspired by pp_caller */ |
|
|
539 | for (;;) |
|
|
540 | { |
|
|
541 | while (expect_true (cxix >= 0)) |
|
|
542 | { |
|
|
543 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
|
|
544 | |
|
|
545 | if (expect_true (CxTYPE (cx) == CXt_SUB || CxTYPE (cx) == CXt_FORMAT)) |
|
|
546 | { |
|
|
547 | CV *cv = cx->blk_sub.cv; |
|
|
548 | |
|
|
549 | if (expect_true (CvDEPTH (cv))) |
|
|
550 | { |
|
|
551 | EXTEND (SP, 3); |
|
|
552 | PUSHs ((SV *)CvPADLIST (cv)); |
|
|
553 | PUSHs (INT2PTR (SV *, (IV)CvDEPTH (cv))); |
|
|
554 | PUSHs ((SV *)cv); |
|
|
555 | |
|
|
556 | CvDEPTH (cv) = 0; |
|
|
557 | get_padlist (aTHX_ cv); |
|
|
558 | } |
|
|
559 | } |
|
|
560 | } |
|
|
561 | |
|
|
562 | if (expect_true (top_si->si_type == PERLSI_MAIN)) |
|
|
563 | break; |
|
|
564 | |
|
|
565 | top_si = top_si->si_prev; |
|
|
566 | ccstk = top_si->si_cxstack; |
|
|
567 | cxix = top_si->si_cxix; |
|
|
568 | } |
|
|
569 | |
|
|
570 | PUTBACK; |
|
|
571 | } |
|
|
572 | |
|
|
573 | /* allocate some space on the context stack for our purposes */ |
|
|
574 | /* we manually unroll here, as usually 2 slots is enough */ |
|
|
575 | if (SLOT_COUNT >= 1) CXINC; |
|
|
576 | if (SLOT_COUNT >= 2) CXINC; |
|
|
577 | if (SLOT_COUNT >= 3) CXINC; |
|
|
578 | { |
|
|
579 | int i; |
|
|
580 | for (i = 3; i < SLOT_COUNT; ++i) |
|
|
581 | CXINC; |
|
|
582 | } |
|
|
583 | cxstack_ix -= SLOT_COUNT; /* undo allocation */ |
|
|
584 | |
|
|
585 | c->mainstack = PL_mainstack; |
|
|
586 | |
|
|
587 | { |
|
|
588 | perl_slots *slot = c->slot = (perl_slots *)(cxstack + cxstack_ix + 1); |
|
|
589 | |
|
|
590 | slot->defav = GvAV (PL_defgv); |
|
|
591 | slot->defsv = DEFSV; |
|
|
592 | slot->errsv = ERRSV; |
|
|
593 | slot->irsgv = GvSV (irsgv); |
|
|
594 | |
|
|
595 | #define VAR(name,type) slot->name = PL_ ## name; |
|
|
596 | # include "state.h" |
|
|
597 | #undef VAR |
|
|
598 | } |
|
|
599 | } |
|
|
600 | |
|
|
601 | /* |
|
|
602 | * allocate various perl stacks. This is almost an exact copy |
|
|
603 | * of perl.c:init_stacks, except that it uses less memory |
|
|
604 | * on the (sometimes correct) assumption that coroutines do |
|
|
605 | * not usually need a lot of stackspace. |
|
|
606 | */ |
|
|
607 | #if CORO_PREFER_PERL_FUNCTIONS |
|
|
608 | # define coro_init_stacks init_stacks |
|
|
609 | #else |
|
|
610 | static void |
|
|
611 | coro_init_stacks (pTHX) |
|
|
612 | { |
|
|
613 | PL_curstackinfo = new_stackinfo(32, 8); |
|
|
614 | PL_curstackinfo->si_type = PERLSI_MAIN; |
|
|
615 | PL_curstack = PL_curstackinfo->si_stack; |
|
|
616 | PL_mainstack = PL_curstack; /* remember in case we switch stacks */ |
|
|
617 | |
|
|
618 | PL_stack_base = AvARRAY(PL_curstack); |
|
|
619 | PL_stack_sp = PL_stack_base; |
|
|
620 | PL_stack_max = PL_stack_base + AvMAX(PL_curstack); |
|
|
621 | |
|
|
622 | New(50,PL_tmps_stack,32,SV*); |
|
|
623 | PL_tmps_floor = -1; |
|
|
624 | PL_tmps_ix = -1; |
|
|
625 | PL_tmps_max = 32; |
|
|
626 | |
|
|
627 | New(54,PL_markstack,16,I32); |
|
|
628 | PL_markstack_ptr = PL_markstack; |
|
|
629 | PL_markstack_max = PL_markstack + 16; |
|
|
630 | |
|
|
631 | #ifdef SET_MARK_OFFSET |
|
|
632 | SET_MARK_OFFSET; |
|
|
633 | #endif |
|
|
634 | |
|
|
635 | New(54,PL_scopestack,8,I32); |
|
|
636 | PL_scopestack_ix = 0; |
|
|
637 | PL_scopestack_max = 8; |
|
|
638 | |
|
|
639 | New(54,PL_savestack,24,ANY); |
|
|
640 | PL_savestack_ix = 0; |
|
|
641 | PL_savestack_max = 24; |
|
|
642 | |
|
|
643 | #if !PERL_VERSION_ATLEAST (5,10,0) |
|
|
644 | New(54,PL_retstack,4,OP*); |
|
|
645 | PL_retstack_ix = 0; |
|
|
646 | PL_retstack_max = 4; |
|
|
647 | #endif |
|
|
648 | } |
|
|
649 | #endif |
|
|
650 | |
|
|
651 | /* |
|
|
652 | * destroy the stacks, the callchain etc... |
|
|
653 | */ |
|
|
654 | static void |
|
|
655 | coro_destruct_stacks (pTHX) |
|
|
656 | { |
|
|
657 | while (PL_curstackinfo->si_next) |
|
|
658 | PL_curstackinfo = PL_curstackinfo->si_next; |
|
|
659 | |
|
|
660 | while (PL_curstackinfo) |
|
|
661 | { |
|
|
662 | PERL_SI *p = PL_curstackinfo->si_prev; |
|
|
663 | |
|
|
664 | if (!IN_DESTRUCT) |
|
|
665 | SvREFCNT_dec (PL_curstackinfo->si_stack); |
|
|
666 | |
|
|
667 | Safefree (PL_curstackinfo->si_cxstack); |
|
|
668 | Safefree (PL_curstackinfo); |
|
|
669 | PL_curstackinfo = p; |
|
|
670 | } |
|
|
671 | |
|
|
672 | Safefree (PL_tmps_stack); |
|
|
673 | Safefree (PL_markstack); |
|
|
674 | Safefree (PL_scopestack); |
|
|
675 | Safefree (PL_savestack); |
|
|
676 | #if !PERL_VERSION_ATLEAST (5,10,0) |
|
|
677 | Safefree (PL_retstack); |
|
|
678 | #endif |
|
|
679 | } |
|
|
680 | |
|
|
681 | static size_t |
|
|
682 | coro_rss (pTHX_ struct coro *coro) |
|
|
683 | { |
|
|
684 | size_t rss = sizeof (*coro); |
|
|
685 | |
|
|
686 | if (coro->mainstack) |
|
|
687 | { |
|
|
688 | perl_slots tmp_slot; |
|
|
689 | perl_slots *slot; |
|
|
690 | |
|
|
691 | if (coro->flags & CF_RUNNING) |
|
|
692 | { |
|
|
693 | slot = &tmp_slot; |
|
|
694 | |
|
|
695 | #define VAR(name,type) slot->name = PL_ ## name; |
|
|
696 | # include "state.h" |
|
|
697 | #undef VAR |
|
|
698 | } |
|
|
699 | else |
|
|
700 | slot = coro->slot; |
|
|
701 | |
|
|
702 | if (slot) |
|
|
703 | { |
|
|
704 | rss += sizeof (slot->curstackinfo); |
|
|
705 | rss += (slot->curstackinfo->si_cxmax + 1) * sizeof (PERL_CONTEXT); |
|
|
706 | rss += sizeof (SV) + sizeof (struct xpvav) + (1 + AvMAX (slot->curstack)) * sizeof (SV *); |
|
|
707 | rss += slot->tmps_max * sizeof (SV *); |
|
|
708 | rss += (slot->markstack_max - slot->markstack_ptr) * sizeof (I32); |
|
|
709 | rss += slot->scopestack_max * sizeof (I32); |
|
|
710 | rss += slot->savestack_max * sizeof (ANY); |
|
|
711 | |
|
|
712 | #if !PERL_VERSION_ATLEAST (5,10,0) |
|
|
713 | rss += slot->retstack_max * sizeof (OP *); |
|
|
714 | #endif |
|
|
715 | } |
|
|
716 | } |
|
|
717 | |
|
|
718 | return rss; |
|
|
719 | } |
|
|
720 | |
|
|
721 | /** coroutine stack handling ************************************************/ |
|
|
722 | |
|
|
723 | static int (*orig_sigelem_get) (pTHX_ SV *sv, MAGIC *mg); |
|
|
724 | static int (*orig_sigelem_set) (pTHX_ SV *sv, MAGIC *mg); |
|
|
725 | static int (*orig_sigelem_clr) (pTHX_ SV *sv, MAGIC *mg); |
|
|
726 | |
|
|
727 | /* apparently < 5.8.8 */ |
|
|
728 | #ifndef MgPV_nolen_const |
|
|
729 | #define MgPV_nolen_const(mg) (((((int)(mg)->mg_len)) == HEf_SVKEY) ? \ |
|
|
730 | SvPV_nolen((SV*)((mg)->mg_ptr)) : \ |
|
|
731 | (const char*)(mg)->mg_ptr) |
|
|
732 | #endif |
|
|
733 | |
|
|
734 | /* |
|
|
735 | * This overrides the default magic get method of %SIG elements. |
|
|
736 | * The original one doesn't provide for reading back of PL_diehook/PL_warnhook |
|
|
737 | * and instead of tryign to save and restore the hash elements, we just provide |
|
|
738 | * readback here. |
|
|
739 | * We only do this when the hook is != 0, as they are often set to 0 temporarily, |
|
|
740 | * not expecting this to actually change the hook. This is a potential problem |
|
|
741 | * when a schedule happens then, but we ignore this. |
|
|
742 | */ |
|
|
743 | static int |
|
|
744 | coro_sigelem_get (pTHX_ SV *sv, MAGIC *mg) |
|
|
745 | { |
|
|
746 | const char *s = MgPV_nolen_const (mg); |
|
|
747 | |
|
|
748 | if (*s == '_') |
|
|
749 | { |
|
|
750 | SV **svp = 0; |
|
|
751 | |
|
|
752 | if (strEQ (s, "__DIE__" )) svp = &PL_diehook; |
|
|
753 | if (strEQ (s, "__WARN__")) svp = &PL_warnhook; |
|
|
754 | |
|
|
755 | if (svp) |
|
|
756 | { |
|
|
757 | sv_setsv (sv, *svp ? *svp : &PL_sv_undef); |
|
|
758 | return 0; |
|
|
759 | } |
|
|
760 | } |
|
|
761 | |
|
|
762 | return orig_sigelem_get ? orig_sigelem_get (aTHX_ sv, mg) : 0; |
|
|
763 | } |
|
|
764 | |
|
|
765 | static int |
|
|
766 | coro_sigelem_clr (pTHX_ SV *sv, MAGIC *mg) |
|
|
767 | { |
|
|
768 | const char *s = MgPV_nolen_const (mg); |
|
|
769 | |
|
|
770 | if (*s == '_') |
|
|
771 | { |
|
|
772 | SV **svp = 0; |
|
|
773 | |
|
|
774 | if (strEQ (s, "__DIE__" )) svp = &PL_diehook; |
|
|
775 | if (strEQ (s, "__WARN__")) svp = &PL_warnhook; |
|
|
776 | |
|
|
777 | if (svp) |
|
|
778 | { |
|
|
779 | SV *old = *svp; |
|
|
780 | *svp = 0; |
|
|
781 | SvREFCNT_dec (old); |
|
|
782 | return 0; |
|
|
783 | } |
|
|
784 | } |
|
|
785 | |
|
|
786 | return orig_sigelem_clr ? orig_sigelem_clr (aTHX_ sv, mg) : 0; |
|
|
787 | } |
|
|
788 | |
|
|
789 | static int |
|
|
790 | coro_sigelem_set (pTHX_ SV *sv, MAGIC *mg) |
|
|
791 | { |
|
|
792 | const char *s = MgPV_nolen_const (mg); |
|
|
793 | |
|
|
794 | if (*s == '_') |
|
|
795 | { |
|
|
796 | SV **svp = 0; |
|
|
797 | |
|
|
798 | if (strEQ (s, "__DIE__" )) svp = &PL_diehook; |
|
|
799 | if (strEQ (s, "__WARN__")) svp = &PL_warnhook; |
|
|
800 | |
|
|
801 | if (svp) |
|
|
802 | { |
|
|
803 | SV *old = *svp; |
|
|
804 | *svp = newSVsv (sv); |
|
|
805 | SvREFCNT_dec (old); |
|
|
806 | return 0; |
|
|
807 | } |
|
|
808 | } |
|
|
809 | |
|
|
810 | return orig_sigelem_set ? orig_sigelem_set (aTHX_ sv, mg) : 0; |
|
|
811 | } |
|
|
812 | |
|
|
813 | static void |
|
|
814 | prepare_nop (pTHX_ struct coro_transfer_args *ta) |
|
|
815 | { |
|
|
816 | /* kind of mega-hacky, but works */ |
|
|
817 | ta->next = ta->prev = (struct coro *)ta; |
|
|
818 | } |
|
|
819 | |
|
|
820 | static int |
|
|
821 | slf_check_nop (pTHX_ struct CoroSLF *frame) |
|
|
822 | { |
|
|
823 | return 0; |
|
|
824 | } |
|
|
825 | |
|
|
826 | static void |
|
|
827 | coro_setup (pTHX_ struct coro *coro) |
|
|
828 | { |
|
|
829 | /* |
|
|
830 | * emulate part of the perl startup here. |
|
|
831 | */ |
|
|
832 | coro_init_stacks (aTHX); |
|
|
833 | |
|
|
834 | PL_runops = RUNOPS_DEFAULT; |
|
|
835 | PL_curcop = &PL_compiling; |
|
|
836 | PL_in_eval = EVAL_NULL; |
|
|
837 | PL_comppad = 0; |
|
|
838 | PL_curpm = 0; |
|
|
839 | PL_curpad = 0; |
|
|
840 | PL_localizing = 0; |
|
|
841 | PL_dirty = 0; |
|
|
842 | PL_restartop = 0; |
|
|
843 | #if PERL_VERSION_ATLEAST (5,10,0) |
|
|
844 | PL_parser = 0; |
|
|
845 | #endif |
|
|
846 | |
|
|
847 | /* recreate the die/warn hooks */ |
|
|
848 | PL_diehook = 0; SvSetMagicSV (*hv_fetch (hv_sig, "__DIE__" , sizeof ("__DIE__" ) - 1, 1), rv_diehook ); |
|
|
849 | PL_warnhook = 0; SvSetMagicSV (*hv_fetch (hv_sig, "__WARN__", sizeof ("__WARN__") - 1, 1), rv_warnhook); |
|
|
850 | |
|
|
851 | GvSV (PL_defgv) = newSV (0); |
|
|
852 | GvAV (PL_defgv) = coro->args; coro->args = 0; |
|
|
853 | GvSV (PL_errgv) = newSV (0); |
|
|
854 | GvSV (irsgv) = newSVpvn ("\n", 1); sv_magic (GvSV (irsgv), (SV *)irsgv, PERL_MAGIC_sv, "/", 0); |
|
|
855 | PL_rs = newSVsv (GvSV (irsgv)); |
|
|
856 | PL_defoutgv = (GV *)SvREFCNT_inc_NN (stdoutgv); |
|
|
857 | |
|
|
858 | { |
|
|
859 | dSP; |
|
|
860 | UNOP myop; |
|
|
861 | |
|
|
862 | Zero (&myop, 1, UNOP); |
|
|
863 | myop.op_next = Nullop; |
|
|
864 | myop.op_flags = OPf_WANT_VOID; |
|
|
865 | |
|
|
866 | PUSHMARK (SP); |
|
|
867 | XPUSHs (sv_2mortal (av_shift (GvAV (PL_defgv)))); |
|
|
868 | PUTBACK; |
|
|
869 | PL_op = (OP *)&myop; |
|
|
870 | PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
|
|
871 | SPAGAIN; |
|
|
872 | } |
|
|
873 | |
|
|
874 | /* this newly created coroutine might be run on an existing cctx which most |
|
|
875 | * likely was suspended in pp_slf, so we have to emulate entering pp_slf here. |
|
|
876 | */ |
|
|
877 | slf_frame.prepare = prepare_nop; /* provide a nop function for an eventual pp_slf */ |
|
|
878 | slf_frame.check = slf_check_nop; /* signal pp_slf to not repeat */ |
|
|
879 | } |
|
|
880 | |
|
|
881 | static void |
|
|
882 | coro_destruct (pTHX_ struct coro *coro) |
|
|
883 | { |
|
|
884 | if (!IN_DESTRUCT) |
|
|
885 | { |
|
|
886 | /* restore all saved variables and stuff */ |
|
|
887 | LEAVE_SCOPE (0); |
|
|
888 | assert (PL_tmps_floor == -1); |
|
|
889 | |
|
|
890 | /* free all temporaries */ |
|
|
891 | FREETMPS; |
|
|
892 | assert (PL_tmps_ix == -1); |
|
|
893 | |
|
|
894 | /* unwind all extra stacks */ |
|
|
895 | POPSTACK_TO (PL_mainstack); |
|
|
896 | |
|
|
897 | /* unwind main stack */ |
|
|
898 | dounwind (-1); |
|
|
899 | } |
|
|
900 | |
|
|
901 | SvREFCNT_dec (GvSV (PL_defgv)); |
|
|
902 | SvREFCNT_dec (GvAV (PL_defgv)); |
|
|
903 | SvREFCNT_dec (GvSV (PL_errgv)); |
|
|
904 | SvREFCNT_dec (PL_defoutgv); |
|
|
905 | SvREFCNT_dec (PL_rs); |
|
|
906 | SvREFCNT_dec (GvSV (irsgv)); |
|
|
907 | |
|
|
908 | SvREFCNT_dec (PL_diehook); |
|
|
909 | SvREFCNT_dec (PL_warnhook); |
|
|
910 | |
|
|
911 | SvREFCNT_dec (coro->saved_deffh); |
|
|
912 | SvREFCNT_dec (coro->throw); |
|
|
913 | |
|
|
914 | coro_destruct_stacks (aTHX); |
|
|
915 | } |
|
|
916 | |
|
|
917 | INLINE void |
|
|
918 | free_coro_mortal (pTHX) |
|
|
919 | { |
|
|
920 | if (expect_true (coro_mortal)) |
|
|
921 | { |
|
|
922 | SvREFCNT_dec (coro_mortal); |
|
|
923 | coro_mortal = 0; |
|
|
924 | } |
|
|
925 | } |
|
|
926 | |
|
|
927 | static int |
|
|
928 | runops_trace (pTHX) |
|
|
929 | { |
|
|
930 | COP *oldcop = 0; |
|
|
931 | int oldcxix = -2; |
|
|
932 | struct coro *coro = SvSTATE_current; /* trace cctx is tied to specific coro */ |
|
|
933 | coro_cctx *cctx = coro->cctx; |
|
|
934 | |
|
|
935 | while ((PL_op = CALL_FPTR (PL_op->op_ppaddr) (aTHX))) |
|
|
936 | { |
|
|
937 | PERL_ASYNC_CHECK (); |
|
|
938 | |
|
|
939 | if (cctx->flags & CC_TRACE_ALL) |
|
|
940 | { |
|
|
941 | if (PL_op->op_type == OP_LEAVESUB && cctx->flags & CC_TRACE_SUB) |
|
|
942 | { |
|
|
943 | PERL_CONTEXT *cx = &cxstack[cxstack_ix]; |
|
|
944 | SV **bot, **top; |
|
|
945 | AV *av = newAV (); /* return values */ |
|
|
946 | SV **cb; |
|
|
947 | dSP; |
|
|
948 | |
|
|
949 | GV *gv = CvGV (cx->blk_sub.cv); |
|
|
950 | SV *fullname = sv_2mortal (newSV (0)); |
|
|
951 | if (isGV (gv)) |
|
|
952 | gv_efullname3 (fullname, gv, 0); |
|
|
953 | |
|
|
954 | bot = PL_stack_base + cx->blk_oldsp + 1; |
|
|
955 | top = cx->blk_gimme == G_ARRAY ? SP + 1 |
|
|
956 | : cx->blk_gimme == G_SCALAR ? bot + 1 |
|
|
957 | : bot; |
|
|
958 | |
|
|
959 | av_extend (av, top - bot); |
|
|
960 | while (bot < top) |
|
|
961 | av_push (av, SvREFCNT_inc_NN (*bot++)); |
|
|
962 | |
|
|
963 | PL_runops = RUNOPS_DEFAULT; |
|
|
964 | ENTER; |
|
|
965 | SAVETMPS; |
|
|
966 | EXTEND (SP, 3); |
|
|
967 | PUSHMARK (SP); |
|
|
968 | PUSHs (&PL_sv_no); |
|
|
969 | PUSHs (fullname); |
|
|
970 | PUSHs (sv_2mortal (newRV_noinc ((SV *)av))); |
|
|
971 | PUTBACK; |
|
|
972 | cb = hv_fetch ((HV *)SvRV (coro_current), "_trace_sub_cb", sizeof ("_trace_sub_cb") - 1, 0); |
|
|
973 | if (cb) call_sv (*cb, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD); |
|
|
974 | SPAGAIN; |
|
|
975 | FREETMPS; |
|
|
976 | LEAVE; |
|
|
977 | PL_runops = runops_trace; |
|
|
978 | } |
|
|
979 | |
|
|
980 | if (oldcop != PL_curcop) |
|
|
981 | { |
|
|
982 | oldcop = PL_curcop; |
|
|
983 | |
|
|
984 | if (PL_curcop != &PL_compiling) |
|
|
985 | { |
|
|
986 | SV **cb; |
|
|
987 | |
|
|
988 | if (oldcxix != cxstack_ix && cctx->flags & CC_TRACE_SUB) |
|
|
989 | { |
|
|
990 | PERL_CONTEXT *cx = &cxstack[cxstack_ix]; |
|
|
991 | |
|
|
992 | if (CxTYPE (cx) == CXt_SUB && oldcxix < cxstack_ix) |
|
|
993 | { |
|
|
994 | runops_proc_t old_runops = PL_runops; |
|
|
995 | dSP; |
|
|
996 | GV *gv = CvGV (cx->blk_sub.cv); |
|
|
997 | SV *fullname = sv_2mortal (newSV (0)); |
|
|
998 | |
|
|
999 | if (isGV (gv)) |
|
|
1000 | gv_efullname3 (fullname, gv, 0); |
|
|
1001 | |
|
|
1002 | PL_runops = RUNOPS_DEFAULT; |
|
|
1003 | ENTER; |
|
|
1004 | SAVETMPS; |
|
|
1005 | EXTEND (SP, 3); |
|
|
1006 | PUSHMARK (SP); |
|
|
1007 | PUSHs (&PL_sv_yes); |
|
|
1008 | PUSHs (fullname); |
|
|
1009 | PUSHs (CxHASARGS (cx) ? sv_2mortal (newRV_inc ((SV *)cx->blk_sub.argarray)) : &PL_sv_undef); |
|
|
1010 | PUTBACK; |
|
|
1011 | cb = hv_fetch ((HV *)SvRV (coro_current), "_trace_sub_cb", sizeof ("_trace_sub_cb") - 1, 0); |
|
|
1012 | if (cb) call_sv (*cb, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD); |
|
|
1013 | SPAGAIN; |
|
|
1014 | FREETMPS; |
|
|
1015 | LEAVE; |
|
|
1016 | PL_runops = runops_trace; |
|
|
1017 | } |
|
|
1018 | |
|
|
1019 | oldcxix = cxstack_ix; |
|
|
1020 | } |
|
|
1021 | |
|
|
1022 | if (cctx->flags & CC_TRACE_LINE) |
|
|
1023 | { |
|
|
1024 | dSP; |
|
|
1025 | |
|
|
1026 | PL_runops = RUNOPS_DEFAULT; |
|
|
1027 | ENTER; |
|
|
1028 | SAVETMPS; |
|
|
1029 | EXTEND (SP, 3); |
|
|
1030 | PL_runops = RUNOPS_DEFAULT; |
|
|
1031 | PUSHMARK (SP); |
|
|
1032 | PUSHs (sv_2mortal (newSVpv (OutCopFILE (oldcop), 0))); |
|
|
1033 | PUSHs (sv_2mortal (newSViv (CopLINE (oldcop)))); |
|
|
1034 | PUTBACK; |
|
|
1035 | cb = hv_fetch ((HV *)SvRV (coro_current), "_trace_line_cb", sizeof ("_trace_line_cb") - 1, 0); |
|
|
1036 | if (cb) call_sv (*cb, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD); |
|
|
1037 | SPAGAIN; |
|
|
1038 | FREETMPS; |
|
|
1039 | LEAVE; |
|
|
1040 | PL_runops = runops_trace; |
|
|
1041 | } |
|
|
1042 | } |
|
|
1043 | } |
|
|
1044 | } |
|
|
1045 | } |
|
|
1046 | |
|
|
1047 | TAINT_NOT; |
|
|
1048 | return 0; |
|
|
1049 | } |
|
|
1050 | |
|
|
1051 | static void |
|
|
1052 | prepare_set_stacklevel (struct coro_transfer_args *ta, struct coro_cctx *cctx) |
|
|
1053 | { |
|
|
1054 | ta->prev = (struct coro *)cctx; |
|
|
1055 | ta->next = 0; |
|
|
1056 | } |
|
|
1057 | |
|
|
1058 | /* inject a fake call to Coro::State::_cctx_init into the execution */ |
|
|
1059 | /* _cctx_init should be careful, as it could be called at almost any time */ |
|
|
1060 | /* during execution of a perl program */ |
|
|
1061 | /* also initialises PL_top_env */ |
|
|
1062 | static void NOINLINE |
|
|
1063 | cctx_prepare (pTHX_ coro_cctx *cctx) |
|
|
1064 | { |
|
|
1065 | dSP; |
|
|
1066 | UNOP myop; |
|
|
1067 | |
|
|
1068 | PL_top_env = &PL_start_env; |
|
|
1069 | |
|
|
1070 | if (cctx->flags & CC_TRACE) |
|
|
1071 | PL_runops = runops_trace; |
|
|
1072 | |
|
|
1073 | Zero (&myop, 1, UNOP); |
|
|
1074 | myop.op_next = PL_op; |
|
|
1075 | myop.op_flags = OPf_WANT_VOID | OPf_STACKED; |
|
|
1076 | |
|
|
1077 | PUSHMARK (SP); |
|
|
1078 | EXTEND (SP, 2); |
|
|
1079 | PUSHs (sv_2mortal (newSViv ((IV)cctx))); |
|
|
1080 | PUSHs ((SV *)get_cv ("Coro::State::_cctx_init", FALSE)); |
|
|
1081 | PUTBACK; |
|
|
1082 | PL_op = (OP *)&myop; |
|
|
1083 | PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
|
|
1084 | SPAGAIN; |
|
|
1085 | } |
|
|
1086 | |
|
|
1087 | /* the tail of transfer: execute stuff we can only do after a transfer */ |
|
|
1088 | INLINE void |
|
|
1089 | transfer_tail (pTHX) |
|
|
1090 | { |
|
|
1091 | free_coro_mortal (aTHX); |
|
|
1092 | } |
|
|
1093 | |
|
|
1094 | /* |
|
|
1095 | * this is a _very_ stripped down perl interpreter ;) |
|
|
1096 | */ |
|
|
1097 | static void |
|
|
1098 | cctx_run (void *arg) |
|
|
1099 | { |
|
|
1100 | #ifdef USE_ITHREADS |
|
|
1101 | # if CORO_PTHREAD |
|
|
1102 | PERL_SET_CONTEXT (coro_thx); |
|
|
1103 | # endif |
|
|
1104 | #endif |
|
|
1105 | { |
|
|
1106 | dTHX; |
|
|
1107 | |
|
|
1108 | /* normally we would need to skip the entersub here */ |
|
|
1109 | /* not doing so will re-execute it, which is exactly what we want */ |
|
|
1110 | /* PL_nop = PL_nop->op_next */ |
|
|
1111 | |
|
|
1112 | /* inject a fake subroutine call to cctx_init */ |
|
|
1113 | cctx_prepare (aTHX_ (coro_cctx *)arg); |
|
|
1114 | |
|
|
1115 | /* cctx_run is the alternative tail of transfer() */ |
|
|
1116 | transfer_tail (aTHX); |
|
|
1117 | |
|
|
1118 | /* somebody or something will hit me for both perl_run and PL_restartop */ |
|
|
1119 | PL_restartop = PL_op; |
|
|
1120 | perl_run (PL_curinterp); |
|
|
1121 | |
|
|
1122 | /* |
|
|
1123 | * If perl-run returns we assume exit() was being called or the coro |
|
|
1124 | * fell off the end, which seems to be the only valid (non-bug) |
|
|
1125 | * reason for perl_run to return. We try to exit by jumping to the |
|
|
1126 | * bootstrap-time "top" top_env, as we cannot restore the "main" |
|
|
1127 | * coroutine as Coro has no such concept |
|
|
1128 | */ |
|
|
1129 | PL_top_env = main_top_env; |
|
|
1130 | JMPENV_JUMP (2); /* I do not feel well about the hardcoded 2 at all */ |
|
|
1131 | } |
|
|
1132 | } |
|
|
1133 | |
|
|
1134 | static coro_cctx * |
|
|
1135 | cctx_new () |
|
|
1136 | { |
|
|
1137 | coro_cctx *cctx; |
|
|
1138 | |
|
|
1139 | ++cctx_count; |
|
|
1140 | New (0, cctx, 1, coro_cctx); |
|
|
1141 | |
|
|
1142 | cctx->gen = cctx_gen; |
|
|
1143 | cctx->flags = 0; |
|
|
1144 | cctx->idle_sp = 0; /* can be accessed by transfer between cctx_run and set_stacklevel, on throw */ |
|
|
1145 | |
|
|
1146 | return cctx; |
|
|
1147 | } |
|
|
1148 | |
|
|
1149 | /* create a new cctx only suitable as source */ |
|
|
1150 | static coro_cctx * |
|
|
1151 | cctx_new_empty () |
|
|
1152 | { |
|
|
1153 | coro_cctx *cctx = cctx_new (); |
|
|
1154 | |
|
|
1155 | cctx->sptr = 0; |
|
|
1156 | coro_create (&cctx->cctx, 0, 0, 0, 0); |
|
|
1157 | |
|
|
1158 | return cctx; |
|
|
1159 | } |
|
|
1160 | |
|
|
1161 | /* create a new cctx suitable as destination/running a perl interpreter */ |
|
|
1162 | static coro_cctx * |
|
|
1163 | cctx_new_run () |
|
|
1164 | { |
|
|
1165 | coro_cctx *cctx = cctx_new (); |
|
|
1166 | void *stack_start; |
|
|
1167 | size_t stack_size; |
|
|
1168 | |
|
|
1169 | #if HAVE_MMAP |
|
|
1170 | cctx->ssize = ((cctx_stacksize * sizeof (long) + PAGESIZE - 1) / PAGESIZE + CORO_STACKGUARD) * PAGESIZE; |
|
|
1171 | /* mmap supposedly does allocate-on-write for us */ |
|
|
1172 | cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
|
|
1173 | |
|
|
1174 | if (cctx->sptr != (void *)-1) |
|
|
1175 | { |
|
|
1176 | #if CORO_STACKGUARD |
|
|
1177 | mprotect (cctx->sptr, CORO_STACKGUARD * PAGESIZE, PROT_NONE); |
|
|
1178 | #endif |
|
|
1179 | stack_start = (char *)cctx->sptr + CORO_STACKGUARD * PAGESIZE; |
|
|
1180 | stack_size = cctx->ssize - CORO_STACKGUARD * PAGESIZE; |
|
|
1181 | cctx->flags |= CC_MAPPED; |
|
|
1182 | } |
|
|
1183 | else |
|
|
1184 | #endif |
|
|
1185 | { |
|
|
1186 | cctx->ssize = cctx_stacksize * (long)sizeof (long); |
|
|
1187 | New (0, cctx->sptr, cctx_stacksize, long); |
|
|
1188 | |
|
|
1189 | if (!cctx->sptr) |
|
|
1190 | { |
|
|
1191 | perror ("FATAL: unable to allocate stack for coroutine, exiting."); |
|
|
1192 | _exit (EXIT_FAILURE); |
|
|
1193 | } |
|
|
1194 | |
|
|
1195 | stack_start = cctx->sptr; |
|
|
1196 | stack_size = cctx->ssize; |
|
|
1197 | } |
|
|
1198 | |
|
|
1199 | #if CORO_USE_VALGRIND |
|
|
1200 | cctx->valgrind_id = VALGRIND_STACK_REGISTER ((char *)stack_start, (char *)stack_start + stack_size); |
|
|
1201 | #endif |
|
|
1202 | |
|
|
1203 | coro_create (&cctx->cctx, cctx_run, (void *)cctx, stack_start, stack_size); |
|
|
1204 | |
|
|
1205 | return cctx; |
|
|
1206 | } |
|
|
1207 | |
|
|
1208 | static void |
|
|
1209 | cctx_destroy (coro_cctx *cctx) |
|
|
1210 | { |
|
|
1211 | if (!cctx) |
|
|
1212 | return; |
|
|
1213 | |
|
|
1214 | --cctx_count; |
|
|
1215 | coro_destroy (&cctx->cctx); |
|
|
1216 | |
|
|
1217 | /* coro_transfer creates new, empty cctx's */ |
|
|
1218 | if (cctx->sptr) |
|
|
1219 | { |
|
|
1220 | #if CORO_USE_VALGRIND |
|
|
1221 | VALGRIND_STACK_DEREGISTER (cctx->valgrind_id); |
|
|
1222 | #endif |
|
|
1223 | |
|
|
1224 | #if HAVE_MMAP |
|
|
1225 | if (cctx->flags & CC_MAPPED) |
|
|
1226 | munmap (cctx->sptr, cctx->ssize); |
|
|
1227 | else |
|
|
1228 | #endif |
|
|
1229 | Safefree (cctx->sptr); |
|
|
1230 | } |
|
|
1231 | |
|
|
1232 | Safefree (cctx); |
|
|
1233 | } |
|
|
1234 | |
|
|
1235 | /* wether this cctx should be destructed */ |
|
|
1236 | #define CCTX_EXPIRED(cctx) ((cctx)->gen != cctx_gen || ((cctx)->flags & CC_NOREUSE)) |
|
|
1237 | |
|
|
1238 | static coro_cctx * |
|
|
1239 | cctx_get (pTHX) |
|
|
1240 | { |
|
|
1241 | while (expect_true (cctx_first)) |
|
|
1242 | { |
|
|
1243 | coro_cctx *cctx = cctx_first; |
|
|
1244 | cctx_first = cctx->next; |
|
|
1245 | --cctx_idle; |
|
|
1246 | |
|
|
1247 | if (expect_true (!CCTX_EXPIRED (cctx))) |
|
|
1248 | return cctx; |
|
|
1249 | |
|
|
1250 | cctx_destroy (cctx); |
|
|
1251 | } |
|
|
1252 | |
|
|
1253 | return cctx_new_run (); |
|
|
1254 | } |
|
|
1255 | |
|
|
1256 | static void |
|
|
1257 | cctx_put (coro_cctx *cctx) |
|
|
1258 | { |
|
|
1259 | assert (("FATAL: cctx_put called on non-initialised cctx in Coro (please report)", cctx->sptr)); |
|
|
1260 | |
|
|
1261 | /* free another cctx if overlimit */ |
|
|
1262 | if (expect_false (cctx_idle >= cctx_max_idle)) |
|
|
1263 | { |
|
|
1264 | coro_cctx *first = cctx_first; |
|
|
1265 | cctx_first = first->next; |
|
|
1266 | --cctx_idle; |
|
|
1267 | |
|
|
1268 | cctx_destroy (first); |
|
|
1269 | } |
|
|
1270 | |
|
|
1271 | ++cctx_idle; |
|
|
1272 | cctx->next = cctx_first; |
|
|
1273 | cctx_first = cctx; |
|
|
1274 | } |
|
|
1275 | |
|
|
1276 | /** coroutine switching *****************************************************/ |
|
|
1277 | |
|
|
1278 | static void |
|
|
1279 | transfer_check (pTHX_ struct coro *prev, struct coro *next) |
|
|
1280 | { |
|
|
1281 | if (expect_true (prev != next)) |
|
|
1282 | { |
|
|
1283 | if (expect_false (!(prev->flags & (CF_RUNNING | CF_NEW)))) |
|
|
1284 | croak ("Coro::State::transfer called with non-running/new prev Coro::State, but can only transfer from running or new states,"); |
|
|
1285 | |
|
|
1286 | if (expect_false (next->flags & CF_RUNNING)) |
|
|
1287 | croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states,"); |
|
|
1288 | |
|
|
1289 | if (expect_false (next->flags & CF_DESTROYED)) |
|
|
1290 | croak ("Coro::State::transfer called with destroyed next Coro::State, but can only transfer to inactive states,"); |
|
|
1291 | |
|
|
1292 | #if !PERL_VERSION_ATLEAST (5,10,0) |
|
|
1293 | if (expect_false (PL_lex_state != LEX_NOTPARSING)) |
|
|
1294 | croak ("Coro::State::transfer called while parsing, but this is not supported in your perl version,"); |
|
|
1295 | #endif |
|
|
1296 | } |
|
|
1297 | } |
|
|
1298 | |
|
|
1299 | /* always use the TRANSFER macro */ |
|
|
1300 | static void NOINLINE |
|
|
1301 | transfer (pTHX_ struct coro *prev, struct coro *next, int force_cctx) |
|
|
1302 | { |
|
|
1303 | dSTACKLEVEL; |
|
|
1304 | |
|
|
1305 | /* sometimes transfer is only called to set idle_sp */ |
|
|
1306 | if (expect_false (!next)) |
|
|
1307 | { |
|
|
1308 | ((coro_cctx *)prev)->idle_sp = (void *)stacklevel; |
|
|
1309 | assert (((coro_cctx *)prev)->idle_te = PL_top_env); /* just for the side-effect when asserts are enabled */ |
|
|
1310 | } |
|
|
1311 | else if (expect_true (prev != next)) |
|
|
1312 | { |
|
|
1313 | coro_cctx *prev__cctx; |
|
|
1314 | |
|
|
1315 | if (expect_false (prev->flags & CF_NEW)) |
|
|
1316 | { |
|
|
1317 | /* create a new empty/source context */ |
|
|
1318 | prev->cctx = cctx_new_empty (); |
|
|
1319 | prev->flags &= ~CF_NEW; |
|
|
1320 | prev->flags |= CF_RUNNING; |
|
|
1321 | } |
|
|
1322 | |
|
|
1323 | prev->flags &= ~CF_RUNNING; |
|
|
1324 | next->flags |= CF_RUNNING; |
|
|
1325 | |
|
|
1326 | /* first get rid of the old state */ |
|
|
1327 | save_perl (aTHX_ prev); |
|
|
1328 | |
|
|
1329 | if (expect_false (next->flags & CF_NEW)) |
|
|
1330 | { |
|
|
1331 | /* need to start coroutine */ |
|
|
1332 | next->flags &= ~CF_NEW; |
|
|
1333 | /* setup coroutine call */ |
|
|
1334 | coro_setup (aTHX_ next); |
|
|
1335 | } |
|
|
1336 | else |
|
|
1337 | load_perl (aTHX_ next); |
|
|
1338 | |
|
|
1339 | prev__cctx = prev->cctx; |
|
|
1340 | |
|
|
1341 | /* possibly untie and reuse the cctx */ |
|
|
1342 | if (expect_true ( |
|
|
1343 | prev__cctx->idle_sp == (void *)stacklevel |
|
|
1344 | && !(prev__cctx->flags & CC_TRACE) |
|
|
1345 | && !force_cctx |
|
|
1346 | )) |
|
|
1347 | { |
|
|
1348 | /* I assume that stacklevel is a stronger indicator than PL_top_env changes */ |
|
|
1349 | assert (("FATAL: current top_env must equal previous top_env in Coro (please report)", PL_top_env == prev__cctx->idle_te)); |
|
|
1350 | |
|
|
1351 | prev->cctx = 0; |
|
|
1352 | |
|
|
1353 | /* if the cctx is about to be destroyed we need to make sure we won't see it in cctx_get */ |
|
|
1354 | /* without this the next cctx_get might destroy the prev__cctx while still in use */ |
|
|
1355 | if (expect_false (CCTX_EXPIRED (prev__cctx))) |
|
|
1356 | if (!next->cctx) |
|
|
1357 | next->cctx = cctx_get (aTHX); |
|
|
1358 | |
|
|
1359 | cctx_put (prev__cctx); |
|
|
1360 | } |
|
|
1361 | |
|
|
1362 | ++next->usecount; |
|
|
1363 | |
|
|
1364 | if (expect_true (!next->cctx)) |
|
|
1365 | next->cctx = cctx_get (aTHX); |
|
|
1366 | |
|
|
1367 | if (expect_false (prev__cctx != next->cctx)) |
|
|
1368 | { |
|
|
1369 | prev__cctx->top_env = PL_top_env; |
|
|
1370 | PL_top_env = next->cctx->top_env; |
|
|
1371 | coro_transfer (&prev__cctx->cctx, &next->cctx->cctx); |
|
|
1372 | } |
|
|
1373 | |
|
|
1374 | transfer_tail (aTHX); |
|
|
1375 | } |
|
|
1376 | } |
|
|
1377 | |
|
|
1378 | #define TRANSFER(ta, force_cctx) transfer (aTHX_ (ta).prev, (ta).next, (force_cctx)) |
|
|
1379 | #define TRANSFER_CHECK(ta) transfer_check (aTHX_ (ta).prev, (ta).next) |
|
|
1380 | |
|
|
1381 | /** high level stuff ********************************************************/ |
|
|
1382 | |
|
|
1383 | static int |
|
|
1384 | coro_state_destroy (pTHX_ struct coro *coro) |
|
|
1385 | { |
|
|
1386 | if (coro->flags & CF_DESTROYED) |
|
|
1387 | return 0; |
|
|
1388 | |
|
|
1389 | if (coro->on_destroy) |
|
|
1390 | coro->on_destroy (aTHX_ coro); |
|
|
1391 | |
|
|
1392 | coro->flags |= CF_DESTROYED; |
|
|
1393 | |
|
|
1394 | if (coro->flags & CF_READY) |
|
|
1395 | { |
|
|
1396 | /* reduce nready, as destroying a ready coro effectively unreadies it */ |
|
|
1397 | /* alternative: look through all ready queues and remove the coro */ |
|
|
1398 | --coro_nready; |
|
|
1399 | } |
|
|
1400 | else |
|
|
1401 | coro->flags |= CF_READY; /* make sure it is NOT put into the readyqueue */ |
|
|
1402 | |
|
|
1403 | if (coro->mainstack && coro->mainstack != main_mainstack) |
|
|
1404 | { |
|
|
1405 | struct coro temp; |
|
|
1406 | |
|
|
1407 | assert (("FATAL: tried to destroy currently running coroutine (please report)", !(coro->flags & CF_RUNNING))); |
|
|
1408 | |
|
|
1409 | save_perl (aTHX_ &temp); |
|
|
1410 | load_perl (aTHX_ coro); |
|
|
1411 | |
|
|
1412 | coro_destruct (aTHX_ coro); |
|
|
1413 | |
|
|
1414 | load_perl (aTHX_ &temp); |
|
|
1415 | |
|
|
1416 | coro->slot = 0; |
|
|
1417 | } |
|
|
1418 | |
|
|
1419 | cctx_destroy (coro->cctx); |
|
|
1420 | SvREFCNT_dec (coro->args); |
|
|
1421 | |
|
|
1422 | if (coro->next) coro->next->prev = coro->prev; |
|
|
1423 | if (coro->prev) coro->prev->next = coro->next; |
|
|
1424 | if (coro == coro_first) coro_first = coro->next; |
|
|
1425 | |
|
|
1426 | return 1; |
|
|
1427 | } |
|
|
1428 | |
|
|
1429 | static int |
|
|
1430 | coro_state_free (pTHX_ SV *sv, MAGIC *mg) |
|
|
1431 | { |
|
|
1432 | struct coro *coro = (struct coro *)mg->mg_ptr; |
|
|
1433 | mg->mg_ptr = 0; |
|
|
1434 | |
|
|
1435 | coro->hv = 0; |
|
|
1436 | |
|
|
1437 | if (--coro->refcnt < 0) |
|
|
1438 | { |
|
|
1439 | coro_state_destroy (aTHX_ coro); |
|
|
1440 | Safefree (coro); |
|
|
1441 | } |
|
|
1442 | |
|
|
1443 | return 0; |
|
|
1444 | } |
|
|
1445 | |
|
|
1446 | static int |
|
|
1447 | coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params) |
|
|
1448 | { |
|
|
1449 | struct coro *coro = (struct coro *)mg->mg_ptr; |
|
|
1450 | |
|
|
1451 | ++coro->refcnt; |
|
|
1452 | |
|
|
1453 | return 0; |
|
|
1454 | } |
|
|
1455 | |
|
|
1456 | static MGVTBL coro_state_vtbl = { |
|
|
1457 | 0, 0, 0, 0, |
|
|
1458 | coro_state_free, |
|
|
1459 | 0, |
|
|
1460 | #ifdef MGf_DUP |
|
|
1461 | coro_state_dup, |
|
|
1462 | #else |
|
|
1463 | # define MGf_DUP 0 |
|
|
1464 | #endif |
|
|
1465 | }; |
|
|
1466 | |
|
|
1467 | static void |
|
|
1468 | prepare_transfer (pTHX_ struct coro_transfer_args *ta, SV *prev_sv, SV *next_sv) |
|
|
1469 | { |
|
|
1470 | ta->prev = SvSTATE (prev_sv); |
|
|
1471 | ta->next = SvSTATE (next_sv); |
|
|
1472 | TRANSFER_CHECK (*ta); |
|
|
1473 | } |
|
|
1474 | |
|
|
1475 | static void |
|
|
1476 | api_transfer (pTHX_ SV *prev_sv, SV *next_sv) |
|
|
1477 | { |
|
|
1478 | struct coro_transfer_args ta; |
|
|
1479 | |
|
|
1480 | prepare_transfer (aTHX_ &ta, prev_sv, next_sv); |
|
|
1481 | TRANSFER (ta, 1); |
|
|
1482 | } |
|
|
1483 | |
|
|
1484 | /** Coro ********************************************************************/ |
|
|
1485 | |
|
|
1486 | INLINE void |
|
|
1487 | coro_enq (pTHX_ struct coro *coro) |
|
|
1488 | { |
|
|
1489 | av_push (coro_ready [coro->prio - PRIO_MIN], SvREFCNT_inc_NN (coro->hv)); |
|
|
1490 | } |
|
|
1491 | |
|
|
1492 | INLINE SV * |
|
|
1493 | coro_deq (pTHX) |
|
|
1494 | { |
|
|
1495 | int prio; |
|
|
1496 | |
|
|
1497 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= 0; ) |
|
|
1498 | if (AvFILLp (coro_ready [prio]) >= 0) |
|
|
1499 | return av_shift (coro_ready [prio]); |
|
|
1500 | |
|
|
1501 | return 0; |
|
|
1502 | } |
|
|
1503 | |
|
|
1504 | static int |
|
|
1505 | api_ready (pTHX_ SV *coro_sv) |
|
|
1506 | { |
|
|
1507 | struct coro *coro; |
|
|
1508 | SV *sv_hook; |
|
|
1509 | void (*xs_hook)(void); |
|
|
1510 | |
|
|
1511 | if (SvROK (coro_sv)) |
|
|
1512 | coro_sv = SvRV (coro_sv); |
|
|
1513 | |
|
|
1514 | coro = SvSTATE (coro_sv); |
|
|
1515 | |
|
|
1516 | if (coro->flags & CF_READY) |
|
|
1517 | return 0; |
|
|
1518 | |
|
|
1519 | coro->flags |= CF_READY; |
|
|
1520 | |
|
|
1521 | sv_hook = coro_nready ? 0 : coro_readyhook; |
|
|
1522 | xs_hook = coro_nready ? 0 : coroapi.readyhook; |
|
|
1523 | |
|
|
1524 | coro_enq (aTHX_ coro); |
|
|
1525 | ++coro_nready; |
|
|
1526 | |
|
|
1527 | if (sv_hook) |
|
|
1528 | { |
|
|
1529 | dSP; |
|
|
1530 | |
|
|
1531 | ENTER; |
|
|
1532 | SAVETMPS; |
|
|
1533 | |
|
|
1534 | PUSHMARK (SP); |
|
|
1535 | PUTBACK; |
|
|
1536 | call_sv (sv_hook, G_DISCARD); |
|
|
1537 | SPAGAIN; |
|
|
1538 | |
|
|
1539 | FREETMPS; |
|
|
1540 | LEAVE; |
|
|
1541 | } |
|
|
1542 | |
|
|
1543 | if (xs_hook) |
|
|
1544 | xs_hook (); |
|
|
1545 | |
|
|
1546 | return 1; |
|
|
1547 | } |
|
|
1548 | |
|
|
1549 | static int |
|
|
1550 | api_is_ready (pTHX_ SV *coro_sv) |
|
|
1551 | { |
|
|
1552 | return !!(SvSTATE (coro_sv)->flags & CF_READY); |
|
|
1553 | } |
|
|
1554 | |
|
|
1555 | INLINE void |
|
|
1556 | prepare_schedule (pTHX_ struct coro_transfer_args *ta) |
|
|
1557 | { |
|
|
1558 | SV *prev_sv, *next_sv; |
|
|
1559 | |
|
|
1560 | for (;;) |
|
|
1561 | { |
|
|
1562 | next_sv = coro_deq (aTHX); |
|
|
1563 | |
|
|
1564 | /* nothing to schedule: call the idle handler */ |
|
|
1565 | if (expect_false (!next_sv)) |
|
|
1566 | { |
|
|
1567 | dSP; |
|
|
1568 | |
|
|
1569 | ENTER; |
|
|
1570 | SAVETMPS; |
|
|
1571 | |
|
|
1572 | PUSHMARK (SP); |
|
|
1573 | PUTBACK; |
|
|
1574 | call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD); |
|
|
1575 | SPAGAIN; |
|
|
1576 | |
|
|
1577 | FREETMPS; |
|
|
1578 | LEAVE; |
|
|
1579 | continue; |
|
|
1580 | } |
|
|
1581 | |
|
|
1582 | ta->next = SvSTATE_hv (next_sv); |
|
|
1583 | |
|
|
1584 | /* cannot transfer to destroyed coros, skip and look for next */ |
|
|
1585 | if (expect_false (ta->next->flags & CF_DESTROYED)) |
|
|
1586 | { |
|
|
1587 | SvREFCNT_dec (next_sv); |
|
|
1588 | /* coro_nready has already been taken care of by destroy */ |
|
|
1589 | continue; |
|
|
1590 | } |
|
|
1591 | |
|
|
1592 | --coro_nready; |
|
|
1593 | break; |
|
|
1594 | } |
|
|
1595 | |
|
|
1596 | /* free this only after the transfer */ |
|
|
1597 | prev_sv = SvRV (coro_current); |
|
|
1598 | ta->prev = SvSTATE_hv (prev_sv); |
|
|
1599 | TRANSFER_CHECK (*ta); |
|
|
1600 | assert (("FATAL: next coroutine isn't marked as ready in Coro (please report)", ta->next->flags & CF_READY)); |
|
|
1601 | ta->next->flags &= ~CF_READY; |
|
|
1602 | SvRV_set (coro_current, next_sv); |
|
|
1603 | |
|
|
1604 | free_coro_mortal (aTHX); |
|
|
1605 | coro_mortal = prev_sv; |
|
|
1606 | } |
|
|
1607 | |
|
|
1608 | INLINE void |
|
|
1609 | prepare_cede (pTHX_ struct coro_transfer_args *ta) |
|
|
1610 | { |
|
|
1611 | api_ready (aTHX_ coro_current); |
|
|
1612 | prepare_schedule (aTHX_ ta); |
|
|
1613 | } |
|
|
1614 | |
|
|
1615 | INLINE void |
|
|
1616 | prepare_cede_notself (pTHX_ struct coro_transfer_args *ta) |
|
|
1617 | { |
|
|
1618 | SV *prev = SvRV (coro_current); |
|
|
1619 | |
|
|
1620 | if (coro_nready) |
|
|
1621 | { |
|
|
1622 | prepare_schedule (aTHX_ ta); |
|
|
1623 | api_ready (aTHX_ prev); |
|
|
1624 | } |
|
|
1625 | else |
|
|
1626 | prepare_nop (aTHX_ ta); |
|
|
1627 | } |
|
|
1628 | |
|
|
1629 | static void |
|
|
1630 | api_schedule (pTHX) |
|
|
1631 | { |
|
|
1632 | struct coro_transfer_args ta; |
|
|
1633 | |
|
|
1634 | prepare_schedule (aTHX_ &ta); |
|
|
1635 | TRANSFER (ta, 1); |
|
|
1636 | } |
|
|
1637 | |
|
|
1638 | static int |
|
|
1639 | api_cede (pTHX) |
|
|
1640 | { |
|
|
1641 | struct coro_transfer_args ta; |
|
|
1642 | |
|
|
1643 | prepare_cede (aTHX_ &ta); |
|
|
1644 | |
|
|
1645 | if (expect_true (ta.prev != ta.next)) |
|
|
1646 | { |
|
|
1647 | TRANSFER (ta, 1); |
|
|
1648 | return 1; |
|
|
1649 | } |
|
|
1650 | else |
|
|
1651 | return 0; |
|
|
1652 | } |
|
|
1653 | |
|
|
1654 | static int |
|
|
1655 | api_cede_notself (pTHX) |
|
|
1656 | { |
|
|
1657 | if (coro_nready) |
|
|
1658 | { |
|
|
1659 | struct coro_transfer_args ta; |
|
|
1660 | |
|
|
1661 | prepare_cede_notself (aTHX_ &ta); |
|
|
1662 | TRANSFER (ta, 1); |
|
|
1663 | return 1; |
|
|
1664 | } |
|
|
1665 | else |
|
|
1666 | return 0; |
|
|
1667 | } |
|
|
1668 | |
|
|
1669 | static void |
|
|
1670 | api_trace (pTHX_ SV *coro_sv, int flags) |
|
|
1671 | { |
|
|
1672 | struct coro *coro = SvSTATE (coro_sv); |
|
|
1673 | |
|
|
1674 | if (flags & CC_TRACE) |
|
|
1675 | { |
|
|
1676 | if (!coro->cctx) |
|
|
1677 | coro->cctx = cctx_new_run (); |
|
|
1678 | else if (!(coro->cctx->flags & CC_TRACE)) |
|
|
1679 | croak ("cannot enable tracing on coroutine with custom stack,"); |
|
|
1680 | |
|
|
1681 | coro->cctx->flags |= CC_NOREUSE | (flags & (CC_TRACE | CC_TRACE_ALL)); |
|
|
1682 | } |
|
|
1683 | else if (coro->cctx && coro->cctx->flags & CC_TRACE) |
|
|
1684 | { |
|
|
1685 | coro->cctx->flags &= ~(CC_TRACE | CC_TRACE_ALL); |
|
|
1686 | |
|
|
1687 | if (coro->flags & CF_RUNNING) |
|
|
1688 | PL_runops = RUNOPS_DEFAULT; |
|
|
1689 | else |
|
|
1690 | coro->slot->runops = RUNOPS_DEFAULT; |
|
|
1691 | } |
|
|
1692 | } |
|
|
1693 | |
|
|
1694 | /*****************************************************************************/ |
|
|
1695 | /* PerlIO::cede */ |
|
|
1696 | |
|
|
1697 | typedef struct |
|
|
1698 | { |
|
|
1699 | PerlIOBuf base; |
|
|
1700 | NV next, every; |
|
|
1701 | } PerlIOCede; |
|
|
1702 | |
|
|
1703 | static IV |
|
|
1704 | PerlIOCede_pushed (pTHX_ PerlIO *f, const char *mode, SV *arg, PerlIO_funcs *tab) |
|
|
1705 | { |
|
|
1706 | PerlIOCede *self = PerlIOSelf (f, PerlIOCede); |
|
|
1707 | |
|
|
1708 | self->every = SvCUR (arg) ? SvNV (arg) : 0.01; |
|
|
1709 | self->next = nvtime () + self->every; |
|
|
1710 | |
|
|
1711 | return PerlIOBuf_pushed (aTHX_ f, mode, Nullsv, tab); |
826 | } |
1712 | } |
827 | |
1713 | |
828 | static SV * |
1714 | static SV * |
829 | coro_deq (int min_prio) |
1715 | PerlIOCede_getarg (pTHX_ PerlIO *f, CLONE_PARAMS *param, int flags) |
830 | { |
1716 | { |
831 | int prio = PRIO_MAX - PRIO_MIN; |
1717 | PerlIOCede *self = PerlIOSelf (f, PerlIOCede); |
832 | |
1718 | |
833 | min_prio -= PRIO_MIN; |
1719 | return newSVnv (self->every); |
834 | if (min_prio < 0) |
1720 | } |
835 | min_prio = 0; |
|
|
836 | |
1721 | |
837 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
1722 | static IV |
838 | if (av_len (coro_ready[prio]) >= 0) |
1723 | PerlIOCede_flush (pTHX_ PerlIO *f) |
|
|
1724 | { |
|
|
1725 | PerlIOCede *self = PerlIOSelf (f, PerlIOCede); |
|
|
1726 | double now = nvtime (); |
|
|
1727 | |
|
|
1728 | if (now >= self->next) |
|
|
1729 | { |
|
|
1730 | api_cede (aTHX); |
|
|
1731 | self->next = now + self->every; |
|
|
1732 | } |
|
|
1733 | |
|
|
1734 | return PerlIOBuf_flush (aTHX_ f); |
|
|
1735 | } |
|
|
1736 | |
|
|
1737 | static PerlIO_funcs PerlIO_cede = |
|
|
1738 | { |
|
|
1739 | sizeof(PerlIO_funcs), |
|
|
1740 | "cede", |
|
|
1741 | sizeof(PerlIOCede), |
|
|
1742 | PERLIO_K_DESTRUCT | PERLIO_K_RAW, |
|
|
1743 | PerlIOCede_pushed, |
|
|
1744 | PerlIOBuf_popped, |
|
|
1745 | PerlIOBuf_open, |
|
|
1746 | PerlIOBase_binmode, |
|
|
1747 | PerlIOCede_getarg, |
|
|
1748 | PerlIOBase_fileno, |
|
|
1749 | PerlIOBuf_dup, |
|
|
1750 | PerlIOBuf_read, |
|
|
1751 | PerlIOBuf_unread, |
|
|
1752 | PerlIOBuf_write, |
|
|
1753 | PerlIOBuf_seek, |
|
|
1754 | PerlIOBuf_tell, |
|
|
1755 | PerlIOBuf_close, |
|
|
1756 | PerlIOCede_flush, |
|
|
1757 | PerlIOBuf_fill, |
|
|
1758 | PerlIOBase_eof, |
|
|
1759 | PerlIOBase_error, |
|
|
1760 | PerlIOBase_clearerr, |
|
|
1761 | PerlIOBase_setlinebuf, |
|
|
1762 | PerlIOBuf_get_base, |
|
|
1763 | PerlIOBuf_bufsiz, |
|
|
1764 | PerlIOBuf_get_ptr, |
|
|
1765 | PerlIOBuf_get_cnt, |
|
|
1766 | PerlIOBuf_set_ptrcnt, |
|
|
1767 | }; |
|
|
1768 | |
|
|
1769 | /*****************************************************************************/ |
|
|
1770 | |
|
|
1771 | static UNOP slf_restore; /* restore stack as entersub did, for first-re-run */ |
|
|
1772 | static const CV *slf_cv; |
|
|
1773 | static SV *slf_arg0; |
|
|
1774 | static SV *slf_arg1; |
|
|
1775 | static SV *slf_arg2; |
|
|
1776 | static I32 slf_ax; /* top of stack, for restore */ |
|
|
1777 | |
|
|
1778 | /* this restores the stack in the case we patched the entersub, to */ |
|
|
1779 | /* recreate the stack frame as perl will on following calls */ |
|
|
1780 | /* since entersub cleared the stack */ |
|
|
1781 | static OP * |
|
|
1782 | pp_restore (pTHX) |
|
|
1783 | { |
|
|
1784 | SV **SP = PL_stack_base + slf_ax; |
|
|
1785 | |
|
|
1786 | PUSHMARK (SP); |
|
|
1787 | |
|
|
1788 | EXTEND (SP, 3); |
|
|
1789 | if (slf_arg0) PUSHs (sv_2mortal (slf_arg0)); |
|
|
1790 | if (slf_arg1) PUSHs (sv_2mortal (slf_arg1)); |
|
|
1791 | if (slf_arg2) PUSHs (sv_2mortal (slf_arg2)); |
|
|
1792 | PUSHs ((SV *)CvGV (slf_cv)); |
|
|
1793 | |
|
|
1794 | RETURNOP (slf_restore.op_first); |
|
|
1795 | } |
|
|
1796 | |
|
|
1797 | static void |
|
|
1798 | slf_prepare_set_stacklevel (pTHX_ struct coro_transfer_args *ta) |
|
|
1799 | { |
|
|
1800 | prepare_set_stacklevel (ta, (struct coro_cctx *)slf_frame.data); |
|
|
1801 | } |
|
|
1802 | |
|
|
1803 | static void |
|
|
1804 | slf_init_set_stacklevel (pTHX_ struct CoroSLF *frame, CV *cv, SV **arg, int items) |
|
|
1805 | { |
|
|
1806 | assert (("FATAL: set_stacklevel needs the coro cctx as sole argument", items == 1)); |
|
|
1807 | |
|
|
1808 | frame->prepare = slf_prepare_set_stacklevel; |
|
|
1809 | frame->check = slf_check_nop; |
|
|
1810 | frame->data = (void *)SvIV (arg [0]); |
|
|
1811 | } |
|
|
1812 | |
|
|
1813 | static void |
|
|
1814 | slf_prepare_transfer (pTHX_ struct coro_transfer_args *ta) |
|
|
1815 | { |
|
|
1816 | SV **arg = (SV **)slf_frame.data; |
|
|
1817 | |
|
|
1818 | prepare_transfer (aTHX_ ta, arg [0], arg [1]); |
|
|
1819 | |
|
|
1820 | /* if the destination has ->throw set, then copy it */ |
|
|
1821 | /* into the current coro's throw slot, so it will be raised */ |
|
|
1822 | /* after the schedule */ |
|
|
1823 | if (expect_false (ta->next->throw)) |
|
|
1824 | { |
|
|
1825 | struct coro *coro = SvSTATE_current; |
|
|
1826 | SvREFCNT_dec (coro->throw); |
|
|
1827 | coro->throw = ta->next->throw; |
|
|
1828 | ta->next->throw = 0; |
|
|
1829 | } |
|
|
1830 | } |
|
|
1831 | |
|
|
1832 | static void |
|
|
1833 | slf_init_transfer (pTHX_ struct CoroSLF *frame, CV *cv, SV **arg, int items) |
|
|
1834 | { |
|
|
1835 | if (items != 2) |
|
|
1836 | croak ("Coro::State::transfer (prev, next) expects two arguments, not %d,", items); |
|
|
1837 | |
|
|
1838 | frame->prepare = slf_prepare_transfer; |
|
|
1839 | frame->check = slf_check_nop; |
|
|
1840 | frame->data = (void *)arg; /* let's hope it will stay valid */ |
|
|
1841 | } |
|
|
1842 | |
|
|
1843 | static void |
|
|
1844 | slf_init_schedule (pTHX_ struct CoroSLF *frame, CV *cv, SV **arg, int items) |
|
|
1845 | { |
|
|
1846 | frame->prepare = prepare_schedule; |
|
|
1847 | frame->check = slf_check_nop; |
|
|
1848 | } |
|
|
1849 | |
|
|
1850 | static void |
|
|
1851 | slf_init_cede (pTHX_ struct CoroSLF *frame, CV *cv, SV **arg, int items) |
|
|
1852 | { |
|
|
1853 | frame->prepare = prepare_cede; |
|
|
1854 | frame->check = slf_check_nop; |
|
|
1855 | } |
|
|
1856 | |
|
|
1857 | static void |
|
|
1858 | slf_init_cede_notself (pTHX_ struct CoroSLF *frame, CV *cv, SV **arg, int items) |
|
|
1859 | { |
|
|
1860 | frame->prepare = prepare_cede_notself; |
|
|
1861 | frame->check = slf_check_nop; |
|
|
1862 | } |
|
|
1863 | |
|
|
1864 | /* we hijack an hopefully unused CV flag for our purposes */ |
|
|
1865 | #define CVf_SLF 0x4000 |
|
|
1866 | |
|
|
1867 | /* |
|
|
1868 | * these not obviously related functions are all rolled into one |
|
|
1869 | * function to increase chances that they all will call transfer with the same |
|
|
1870 | * stack offset |
|
|
1871 | * SLF stands for "schedule-like-function". |
|
|
1872 | */ |
|
|
1873 | static OP * |
|
|
1874 | pp_slf (pTHX) |
|
|
1875 | { |
|
|
1876 | I32 checkmark; /* mark SP to see how many elements check has pushed */ |
|
|
1877 | |
|
|
1878 | /* set up the slf frame, unless it has already been set-up */ |
|
|
1879 | /* the latter happens when a new coro has been started */ |
|
|
1880 | /* or when a new cctx was attached to an existing coroutine */ |
|
|
1881 | if (expect_true (!slf_frame.prepare)) |
|
|
1882 | { |
|
|
1883 | /* first iteration */ |
|
|
1884 | dSP; |
|
|
1885 | SV **arg = PL_stack_base + TOPMARK + 1; |
|
|
1886 | int items = SP - arg; /* args without function object */ |
|
|
1887 | SV *gv = *sp; |
|
|
1888 | |
|
|
1889 | /* do a quick consistency check on the "function" object, and if it isn't */ |
|
|
1890 | /* for us, divert to the real entersub */ |
|
|
1891 | if (SvTYPE (gv) != SVt_PVGV || !(CvFLAGS (GvCV (gv)) & CVf_SLF)) |
|
|
1892 | return PL_ppaddr[OP_ENTERSUB](aTHX); |
|
|
1893 | |
|
|
1894 | if (!(PL_op->op_flags & OPf_STACKED)) |
|
|
1895 | { |
|
|
1896 | /* ampersand-form of call, use @_ instead of stack */ |
|
|
1897 | AV *av = GvAV (PL_defgv); |
|
|
1898 | arg = AvARRAY (av); |
|
|
1899 | items = AvFILLp (av) + 1; |
|
|
1900 | } |
|
|
1901 | |
|
|
1902 | /* now call the init function, which needs to set up slf_frame */ |
|
|
1903 | ((coro_slf_cb)CvXSUBANY (GvCV (gv)).any_ptr) |
|
|
1904 | (aTHX_ &slf_frame, GvCV (gv), arg, items); |
|
|
1905 | |
|
|
1906 | /* pop args */ |
|
|
1907 | SP = PL_stack_base + POPMARK; |
|
|
1908 | |
|
|
1909 | PUTBACK; |
|
|
1910 | } |
|
|
1911 | |
|
|
1912 | /* now that we have a slf_frame, interpret it! */ |
|
|
1913 | /* we use a callback system not to make the code needlessly */ |
|
|
1914 | /* complicated, but so we can run multiple perl coros from one cctx */ |
|
|
1915 | |
|
|
1916 | do |
|
|
1917 | { |
|
|
1918 | struct coro_transfer_args ta; |
|
|
1919 | |
|
|
1920 | slf_frame.prepare (aTHX_ &ta); |
|
|
1921 | TRANSFER (ta, 0); |
|
|
1922 | |
|
|
1923 | checkmark = PL_stack_sp - PL_stack_base; |
|
|
1924 | } |
|
|
1925 | while (slf_frame.check (aTHX_ &slf_frame)); |
|
|
1926 | |
|
|
1927 | { |
|
|
1928 | dSP; |
|
|
1929 | SV **bot = PL_stack_base + checkmark; |
|
|
1930 | int gimme = GIMME_V; |
|
|
1931 | |
|
|
1932 | slf_frame.prepare = 0; /* invalidate the frame, so it gets initialised again next time */ |
|
|
1933 | |
|
|
1934 | /* make sure we put something on the stack in scalar context */ |
|
|
1935 | if (gimme == G_SCALAR) |
839 | { |
1936 | { |
840 | coro_nready--; |
1937 | if (sp == bot) |
841 | return av_shift (coro_ready[prio]); |
1938 | XPUSHs (&PL_sv_undef); |
|
|
1939 | |
|
|
1940 | SP = bot + 1; |
842 | } |
1941 | } |
843 | |
1942 | |
|
|
1943 | PUTBACK; |
|
|
1944 | } |
|
|
1945 | |
|
|
1946 | { |
|
|
1947 | struct coro *coro = SvSTATE_current; |
|
|
1948 | |
|
|
1949 | if (expect_false (coro->throw)) |
|
|
1950 | { |
|
|
1951 | SV *exception = sv_2mortal (coro->throw); |
|
|
1952 | |
|
|
1953 | coro->throw = 0; |
|
|
1954 | sv_setsv (ERRSV, exception); |
|
|
1955 | croak (0); |
|
|
1956 | } |
|
|
1957 | } |
|
|
1958 | |
|
|
1959 | return NORMAL; |
|
|
1960 | } |
|
|
1961 | |
|
|
1962 | static void |
|
|
1963 | api_execute_slf (pTHX_ CV *cv, coro_slf_cb init_cb, I32 ax) |
|
|
1964 | { |
|
|
1965 | SV **arg = PL_stack_base + ax; |
|
|
1966 | int items = PL_stack_sp - arg + 1; |
|
|
1967 | |
|
|
1968 | assert (("FATAL: SLF call with illegal CV value", !CvANON (cv))); |
|
|
1969 | |
|
|
1970 | if (PL_op->op_ppaddr != PL_ppaddr [OP_ENTERSUB] |
|
|
1971 | && PL_op->op_ppaddr != pp_slf) |
|
|
1972 | croak ("FATAL: Coro SLF calls can only be made normally, not via goto or any other means, caught"); |
|
|
1973 | |
|
|
1974 | #if 0 |
|
|
1975 | if (items > 3) |
|
|
1976 | croak ("Coro only supports up to three arguments to SLF functions currently (not %d), caught", items); |
|
|
1977 | #endif |
|
|
1978 | |
|
|
1979 | CvFLAGS (cv) |= CVf_SLF; |
|
|
1980 | CvXSUBANY (cv).any_ptr = (void *)init_cb; |
|
|
1981 | slf_cv = cv; |
|
|
1982 | |
|
|
1983 | /* we patch the op, and then re-run the whole call */ |
|
|
1984 | /* we have to put the same argument on the stack for this to work */ |
|
|
1985 | /* and this will be done by pp_restore */ |
|
|
1986 | slf_restore.op_next = (OP *)&slf_restore; |
|
|
1987 | slf_restore.op_type = OP_CUSTOM; |
|
|
1988 | slf_restore.op_ppaddr = pp_restore; |
|
|
1989 | slf_restore.op_first = PL_op; |
|
|
1990 | |
|
|
1991 | slf_ax = ax - 1; /* undo the ax++ inside dAXMARK */ |
|
|
1992 | slf_arg0 = items > 0 ? SvREFCNT_inc (arg [0]) : 0; |
|
|
1993 | slf_arg1 = items > 1 ? SvREFCNT_inc (arg [1]) : 0; |
|
|
1994 | slf_arg2 = items > 2 ? SvREFCNT_inc (arg [2]) : 0; |
|
|
1995 | |
|
|
1996 | PL_op->op_ppaddr = pp_slf; |
|
|
1997 | PL_op->op_type = OP_CUSTOM; /* maybe we should leave it at entersub? */ |
|
|
1998 | |
|
|
1999 | PL_op = (OP *)&slf_restore; |
|
|
2000 | } |
|
|
2001 | |
|
|
2002 | /*****************************************************************************/ |
|
|
2003 | |
|
|
2004 | static void |
|
|
2005 | coro_semaphore_adjust (pTHX_ AV *av, IV adjust) |
|
|
2006 | { |
|
|
2007 | SV *count_sv = AvARRAY (av)[0]; |
|
|
2008 | IV count = SvIVX (count_sv); |
|
|
2009 | |
|
|
2010 | count += adjust; |
|
|
2011 | SvIVX (count_sv) = count; |
|
|
2012 | |
|
|
2013 | /* now wake up as many waiters as are expected to lock */ |
|
|
2014 | while (count > 0 && AvFILLp (av) > 0) |
|
|
2015 | { |
|
|
2016 | SV *cb; |
|
|
2017 | |
|
|
2018 | /* swap first two elements so we can shift a waiter */ |
|
|
2019 | AvARRAY (av)[0] = AvARRAY (av)[1]; |
|
|
2020 | AvARRAY (av)[1] = count_sv; |
|
|
2021 | cb = av_shift (av); |
|
|
2022 | |
|
|
2023 | if (SvOBJECT (cb)) |
|
|
2024 | api_ready (aTHX_ cb); |
|
|
2025 | else |
|
|
2026 | croak ("callbacks not yet supported"); |
|
|
2027 | |
|
|
2028 | SvREFCNT_dec (cb); |
|
|
2029 | |
|
|
2030 | --count; |
|
|
2031 | } |
|
|
2032 | } |
|
|
2033 | |
|
|
2034 | static void |
|
|
2035 | coro_semaphore_on_destroy (pTHX_ struct coro *coro) |
|
|
2036 | { |
|
|
2037 | /* call $sem->adjust (0) to possibly wake up some other waiters */ |
|
|
2038 | coro_semaphore_adjust (aTHX_ (AV *)coro->slf_frame.data, 0); |
|
|
2039 | } |
|
|
2040 | |
|
|
2041 | static int |
|
|
2042 | slf_check_semaphore_down (pTHX_ struct CoroSLF *frame) |
|
|
2043 | { |
|
|
2044 | AV *av = (AV *)frame->data; |
|
|
2045 | SV *count_sv = AvARRAY (av)[0]; |
|
|
2046 | |
|
|
2047 | if (SvIVX (count_sv) > 0) |
|
|
2048 | { |
|
|
2049 | SvSTATE_current->on_destroy = 0; |
|
|
2050 | SvIVX (count_sv) = SvIVX (count_sv) - 1; |
844 | return 0; |
2051 | return 0; |
845 | } |
2052 | } |
|
|
2053 | else |
|
|
2054 | { |
|
|
2055 | int i; |
|
|
2056 | /* if we were woken up but can't down, we look through the whole */ |
|
|
2057 | /* waiters list and only add us if we aren't in there already */ |
|
|
2058 | /* this avoids some degenerate memory usage cases */ |
846 | |
2059 | |
847 | static void |
2060 | for (i = 1; i <= AvFILLp (av); ++i) |
848 | api_ready (SV *coro) |
2061 | if (AvARRAY (av)[i] == SvRV (coro_current)) |
849 | { |
2062 | return 1; |
850 | coro_enq (SvREFCNT_inc (coro)); |
|
|
851 | } |
|
|
852 | |
2063 | |
853 | static void |
2064 | av_push (av, SvREFCNT_inc (SvRV (coro_current))); |
854 | api_schedule (int cede) |
2065 | return 1; |
855 | { |
2066 | } |
856 | SV *prev, *next; |
|
|
857 | |
|
|
858 | prev = GvSV (coro_current); |
|
|
859 | |
|
|
860 | if (cede) |
|
|
861 | coro_enq (SvREFCNT_inc (prev)); |
|
|
862 | |
|
|
863 | next = coro_deq (PRIO_MIN); |
|
|
864 | |
|
|
865 | if (!next) |
|
|
866 | next = SvREFCNT_inc (GvSV (coro_idle)); |
|
|
867 | |
|
|
868 | GvSV (coro_current) = SvREFCNT_inc (next); |
|
|
869 | transfer (aTHX_ |
|
|
870 | sv_to_coro (prev, "Coro::schedule", "current coroutine"), |
|
|
871 | sv_to_coro (next, "Coro::schedule", "next coroutine"), |
|
|
872 | TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK); |
|
|
873 | SvREFCNT_dec (next); |
|
|
874 | SvREFCNT_dec (prev); |
|
|
875 | } |
2067 | } |
876 | |
2068 | |
|
|
2069 | static void |
|
|
2070 | slf_init_semaphore_down (pTHX_ struct CoroSLF *frame, CV *cv, SV **arg, int items) |
|
|
2071 | { |
|
|
2072 | AV *av = (AV *)SvRV (arg [0]); |
|
|
2073 | |
|
|
2074 | if (SvIVX (AvARRAY (av)[0]) > 0) |
|
|
2075 | { |
|
|
2076 | frame->data = (void *)av; |
|
|
2077 | frame->prepare = prepare_nop; |
|
|
2078 | SvSTATE_current->on_destroy = coro_semaphore_on_destroy; |
|
|
2079 | } |
|
|
2080 | else |
|
|
2081 | { |
|
|
2082 | av_push (av, SvREFCNT_inc (SvRV (coro_current))); |
|
|
2083 | |
|
|
2084 | frame->data = (void *)sv_2mortal (SvREFCNT_inc ((SV *)av)); |
|
|
2085 | frame->prepare = prepare_schedule; |
|
|
2086 | |
|
|
2087 | /* to avoid race conditions when a woken-up coro gets terminated */ |
|
|
2088 | /* we arrange for a temporary on_destroy that calls adjust (0) */ |
|
|
2089 | assert (!SvSTATE_current->on_destroy);//D |
|
|
2090 | SvSTATE_current->on_destroy = coro_semaphore_on_destroy; |
|
|
2091 | } |
|
|
2092 | |
|
|
2093 | frame->check = slf_check_semaphore_down; |
|
|
2094 | |
|
|
2095 | } |
|
|
2096 | |
|
|
2097 | /*****************************************************************************/ |
|
|
2098 | |
|
|
2099 | #define GENSUB_ARG CvXSUBANY (cv).any_ptr |
|
|
2100 | |
|
|
2101 | /* create a closure from XS, returns a code reference */ |
|
|
2102 | /* the arg can be accessed via GENSUB_ARG from the callback */ |
|
|
2103 | /* the callback must use dXSARGS/XSRETURN */ |
|
|
2104 | static SV * |
|
|
2105 | gensub (pTHX_ void (*xsub)(pTHX_ CV *), void *arg) |
|
|
2106 | { |
|
|
2107 | CV *cv = (CV *)NEWSV (0, 0); |
|
|
2108 | |
|
|
2109 | sv_upgrade ((SV *)cv, SVt_PVCV); |
|
|
2110 | |
|
|
2111 | CvANON_on (cv); |
|
|
2112 | CvISXSUB_on (cv); |
|
|
2113 | CvXSUB (cv) = xsub; |
|
|
2114 | GENSUB_ARG = arg; |
|
|
2115 | |
|
|
2116 | return newRV_noinc ((SV *)cv); |
|
|
2117 | } |
|
|
2118 | |
|
|
2119 | /*****************************************************************************/ |
|
|
2120 | |
877 | MODULE = Coro::State PACKAGE = Coro::State |
2121 | MODULE = Coro::State PACKAGE = Coro::State PREFIX = api_ |
878 | |
2122 | |
879 | PROTOTYPES: ENABLE |
2123 | PROTOTYPES: DISABLE |
880 | |
2124 | |
881 | BOOT: |
2125 | BOOT: |
882 | { /* {} necessary for stoopid perl-5.6.x */ |
2126 | { |
883 | ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); |
2127 | #ifdef USE_ITHREADS |
884 | PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); |
2128 | # if CORO_PTHREAD |
|
|
2129 | coro_thx = PERL_GET_CONTEXT; |
|
|
2130 | # endif |
|
|
2131 | #endif |
|
|
2132 | BOOT_PAGESIZE; |
|
|
2133 | |
|
|
2134 | irsgv = gv_fetchpv ("/" , GV_ADD|GV_NOTQUAL, SVt_PV); |
|
|
2135 | stdoutgv = gv_fetchpv ("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVIO); |
|
|
2136 | |
|
|
2137 | orig_sigelem_get = PL_vtbl_sigelem.svt_get; PL_vtbl_sigelem.svt_get = coro_sigelem_get; |
|
|
2138 | orig_sigelem_set = PL_vtbl_sigelem.svt_set; PL_vtbl_sigelem.svt_set = coro_sigelem_set; |
|
|
2139 | orig_sigelem_clr = PL_vtbl_sigelem.svt_clear; PL_vtbl_sigelem.svt_clear = coro_sigelem_clr; |
|
|
2140 | |
|
|
2141 | hv_sig = coro_get_hv (aTHX_ "SIG", TRUE); |
|
|
2142 | rv_diehook = newRV_inc ((SV *)gv_fetchpv ("Coro::State::diehook" , 0, SVt_PVCV)); |
|
|
2143 | rv_warnhook = newRV_inc ((SV *)gv_fetchpv ("Coro::State::warnhook", 0, SVt_PVCV)); |
|
|
2144 | |
885 | coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
2145 | coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
886 | |
2146 | |
887 | newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); |
2147 | newCONSTSUB (coro_state_stash, "CC_TRACE" , newSViv (CC_TRACE)); |
888 | newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); |
2148 | newCONSTSUB (coro_state_stash, "CC_TRACE_SUB" , newSViv (CC_TRACE_SUB)); |
889 | newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); |
2149 | newCONSTSUB (coro_state_stash, "CC_TRACE_LINE", newSViv (CC_TRACE_LINE)); |
890 | newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); |
2150 | newCONSTSUB (coro_state_stash, "CC_TRACE_ALL" , newSViv (CC_TRACE_ALL)); |
891 | |
|
|
892 | if (!padlist_cache) |
|
|
893 | padlist_cache = newHV (); |
|
|
894 | |
2151 | |
895 | main_mainstack = PL_mainstack; |
2152 | main_mainstack = PL_mainstack; |
|
|
2153 | main_top_env = PL_top_env; |
896 | |
2154 | |
|
|
2155 | while (main_top_env->je_prev) |
|
|
2156 | main_top_env = main_top_env->je_prev; |
|
|
2157 | |
|
|
2158 | { |
|
|
2159 | SV *slf = sv_2mortal (newSViv (PTR2IV (pp_slf))); |
|
|
2160 | |
|
|
2161 | if (!PL_custom_op_names) PL_custom_op_names = newHV (); |
|
|
2162 | hv_store_ent (PL_custom_op_names, slf, |
|
|
2163 | newSVpv ("coro_slf", 0), 0); |
|
|
2164 | |
|
|
2165 | if (!PL_custom_op_descs) PL_custom_op_descs = newHV (); |
|
|
2166 | hv_store_ent (PL_custom_op_descs, slf, |
|
|
2167 | newSVpv ("coro schedule like function", 0), 0); |
|
|
2168 | } |
|
|
2169 | |
897 | coroapi.ver = CORO_API_VERSION; |
2170 | coroapi.ver = CORO_API_VERSION; |
|
|
2171 | coroapi.rev = CORO_API_REVISION; |
|
|
2172 | |
898 | coroapi.transfer = api_transfer; |
2173 | coroapi.transfer = api_transfer; |
899 | } |
|
|
900 | |
2174 | |
901 | Coro::State |
2175 | coroapi.sv_state = SvSTATE_; |
902 | _newprocess(args) |
2176 | coroapi.execute_slf = api_execute_slf; |
903 | SV * args |
2177 | coroapi.prepare_nop = prepare_nop; |
904 | PROTOTYPE: $ |
2178 | coroapi.prepare_schedule = prepare_schedule; |
|
|
2179 | coroapi.prepare_cede = prepare_cede; |
|
|
2180 | coroapi.prepare_cede_notself = prepare_cede_notself; |
|
|
2181 | |
|
|
2182 | { |
|
|
2183 | SV **svp = hv_fetch (PL_modglobal, "Time::NVtime", 12, 0); |
|
|
2184 | |
|
|
2185 | if (!svp) croak ("Time::HiRes is required"); |
|
|
2186 | if (!SvIOK (*svp)) croak ("Time::NVtime isn't a function pointer"); |
|
|
2187 | |
|
|
2188 | nvtime = INT2PTR (double (*)(), SvIV (*svp)); |
|
|
2189 | } |
|
|
2190 | |
|
|
2191 | assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL)); |
|
|
2192 | } |
|
|
2193 | |
|
|
2194 | SV * |
|
|
2195 | new (char *klass, ...) |
905 | CODE: |
2196 | CODE: |
906 | Coro__State coro; |
2197 | { |
|
|
2198 | struct coro *coro; |
|
|
2199 | MAGIC *mg; |
|
|
2200 | HV *hv; |
|
|
2201 | int i; |
907 | |
2202 | |
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); |
2203 | Newz (0, coro, 1, struct coro); |
|
|
2204 | coro->args = newAV (); |
|
|
2205 | coro->flags = CF_NEW; |
912 | |
2206 | |
913 | coro->args = (AV *)SvREFCNT_inc (SvRV (args)); |
2207 | if (coro_first) coro_first->prev = coro; |
914 | coro->mainstack = 0; /* actual work is done inside transfer */ |
2208 | coro->next = coro_first; |
915 | coro->stack = 0; |
2209 | coro_first = coro; |
916 | |
2210 | |
917 | RETVAL = coro; |
2211 | coro->hv = hv = newHV (); |
|
|
2212 | mg = sv_magicext ((SV *)hv, 0, CORO_MAGIC_type_state, &coro_state_vtbl, (char *)coro, 0); |
|
|
2213 | mg->mg_flags |= MGf_DUP; |
|
|
2214 | RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1)); |
|
|
2215 | |
|
|
2216 | av_extend (coro->args, items - 1); |
|
|
2217 | for (i = 1; i < items; i++) |
|
|
2218 | av_push (coro->args, newSVsv (ST (i))); |
|
|
2219 | } |
918 | OUTPUT: |
2220 | OUTPUT: |
919 | RETVAL |
2221 | RETVAL |
920 | |
2222 | |
921 | void |
2223 | void |
922 | transfer(prev, next, flags) |
2224 | _set_stacklevel (...) |
923 | Coro::State_or_hashref prev |
2225 | CODE: |
924 | Coro::State_or_hashref next |
2226 | CORO_EXECUTE_SLF_XS (slf_init_set_stacklevel); |
925 | int flags |
|
|
926 | PROTOTYPE: @ |
|
|
927 | CODE: |
|
|
928 | PUTBACK; |
|
|
929 | transfer (aTHX_ prev, next, flags); |
|
|
930 | SPAGAIN; |
|
|
931 | |
2227 | |
932 | void |
2228 | void |
933 | DESTROY(coro) |
2229 | transfer (...) |
934 | Coro::State coro |
2230 | PROTOTYPE: $$ |
935 | CODE: |
2231 | CODE: |
|
|
2232 | CORO_EXECUTE_SLF_XS (slf_init_transfer); |
936 | |
2233 | |
937 | if (coro->mainstack && coro->mainstack != main_mainstack) |
2234 | bool |
|
|
2235 | _destroy (SV *coro_sv) |
|
|
2236 | CODE: |
|
|
2237 | RETVAL = coro_state_destroy (aTHX_ SvSTATE (coro_sv)); |
|
|
2238 | OUTPUT: |
|
|
2239 | RETVAL |
|
|
2240 | |
|
|
2241 | void |
|
|
2242 | _exit (int code) |
|
|
2243 | PROTOTYPE: $ |
|
|
2244 | CODE: |
|
|
2245 | _exit (code); |
|
|
2246 | |
|
|
2247 | int |
|
|
2248 | cctx_stacksize (int new_stacksize = 0) |
|
|
2249 | PROTOTYPE: ;$ |
|
|
2250 | CODE: |
|
|
2251 | RETVAL = cctx_stacksize; |
|
|
2252 | if (new_stacksize) |
|
|
2253 | { |
|
|
2254 | cctx_stacksize = new_stacksize; |
|
|
2255 | ++cctx_gen; |
|
|
2256 | } |
|
|
2257 | OUTPUT: |
|
|
2258 | RETVAL |
|
|
2259 | |
|
|
2260 | int |
|
|
2261 | cctx_max_idle (int max_idle = 0) |
|
|
2262 | PROTOTYPE: ;$ |
|
|
2263 | CODE: |
|
|
2264 | RETVAL = cctx_max_idle; |
|
|
2265 | if (max_idle > 1) |
|
|
2266 | cctx_max_idle = max_idle; |
|
|
2267 | OUTPUT: |
|
|
2268 | RETVAL |
|
|
2269 | |
|
|
2270 | int |
|
|
2271 | cctx_count () |
|
|
2272 | PROTOTYPE: |
|
|
2273 | CODE: |
|
|
2274 | RETVAL = cctx_count; |
|
|
2275 | OUTPUT: |
|
|
2276 | RETVAL |
|
|
2277 | |
|
|
2278 | int |
|
|
2279 | cctx_idle () |
|
|
2280 | PROTOTYPE: |
|
|
2281 | CODE: |
|
|
2282 | RETVAL = cctx_idle; |
|
|
2283 | OUTPUT: |
|
|
2284 | RETVAL |
|
|
2285 | |
|
|
2286 | void |
|
|
2287 | list () |
|
|
2288 | PROTOTYPE: |
|
|
2289 | PPCODE: |
|
|
2290 | { |
|
|
2291 | struct coro *coro; |
|
|
2292 | for (coro = coro_first; coro; coro = coro->next) |
|
|
2293 | if (coro->hv) |
|
|
2294 | XPUSHs (sv_2mortal (newRV_inc ((SV *)coro->hv))); |
|
|
2295 | } |
|
|
2296 | |
|
|
2297 | void |
|
|
2298 | call (Coro::State coro, SV *coderef) |
|
|
2299 | ALIAS: |
|
|
2300 | eval = 1 |
|
|
2301 | CODE: |
|
|
2302 | { |
|
|
2303 | if (coro->mainstack && ((coro->flags & CF_RUNNING) || coro->slot)) |
938 | { |
2304 | { |
939 | struct coro temp; |
2305 | struct coro temp; |
940 | |
2306 | |
|
|
2307 | if (!(coro->flags & CF_RUNNING)) |
|
|
2308 | { |
|
|
2309 | PUTBACK; |
|
|
2310 | save_perl (aTHX_ &temp); |
|
|
2311 | load_perl (aTHX_ coro); |
|
|
2312 | } |
|
|
2313 | |
|
|
2314 | { |
|
|
2315 | dSP; |
|
|
2316 | ENTER; |
|
|
2317 | SAVETMPS; |
941 | PUTBACK; |
2318 | PUTBACK; |
942 | SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); |
2319 | PUSHSTACK; |
943 | LOAD(aTHX_ coro); |
2320 | PUSHMARK (SP); |
|
|
2321 | |
|
|
2322 | if (ix) |
|
|
2323 | eval_sv (coderef, 0); |
|
|
2324 | else |
|
|
2325 | call_sv (coderef, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD); |
|
|
2326 | |
|
|
2327 | POPSTACK; |
944 | SPAGAIN; |
2328 | SPAGAIN; |
|
|
2329 | FREETMPS; |
|
|
2330 | LEAVE; |
|
|
2331 | PUTBACK; |
|
|
2332 | } |
945 | |
2333 | |
946 | destroy_stacks (aTHX); |
2334 | if (!(coro->flags & CF_RUNNING)) |
947 | |
2335 | { |
948 | LOAD((&temp)); /* this will get rid of defsv etc.. */ |
2336 | save_perl (aTHX_ coro); |
|
|
2337 | load_perl (aTHX_ &temp); |
949 | SPAGAIN; |
2338 | SPAGAIN; |
950 | |
2339 | } |
951 | coro->mainstack = 0; |
|
|
952 | } |
2340 | } |
|
|
2341 | } |
953 | |
2342 | |
954 | deallocate_stack (coro); |
2343 | SV * |
955 | |
2344 | is_ready (Coro::State coro) |
956 | Safefree (coro); |
2345 | PROTOTYPE: $ |
|
|
2346 | ALIAS: |
|
|
2347 | is_ready = CF_READY |
|
|
2348 | is_running = CF_RUNNING |
|
|
2349 | is_new = CF_NEW |
|
|
2350 | is_destroyed = CF_DESTROYED |
|
|
2351 | CODE: |
|
|
2352 | RETVAL = boolSV (coro->flags & ix); |
|
|
2353 | OUTPUT: |
|
|
2354 | RETVAL |
957 | |
2355 | |
958 | void |
2356 | void |
959 | flush() |
2357 | throw (Coro::State self, SV *throw = &PL_sv_undef) |
960 | CODE: |
2358 | PROTOTYPE: $;$ |
961 | #ifdef MAY_FLUSH |
2359 | CODE: |
962 | flush_padlist_cache (); |
2360 | SvREFCNT_dec (self->throw); |
963 | #endif |
2361 | self->throw = SvOK (throw) ? newSVsv (throw) : 0; |
964 | |
2362 | |
965 | void |
2363 | void |
966 | _exit(code) |
2364 | api_trace (SV *coro, int flags = CC_TRACE | CC_TRACE_SUB) |
967 | int code |
2365 | PROTOTYPE: $;$ |
|
|
2366 | C_ARGS: aTHX_ coro, flags |
|
|
2367 | |
|
|
2368 | SV * |
|
|
2369 | has_cctx (Coro::State coro) |
968 | PROTOTYPE: $ |
2370 | PROTOTYPE: $ |
969 | CODE: |
2371 | CODE: |
970 | #if defined(__GLIBC__) || _POSIX_C_SOURCE |
2372 | RETVAL = boolSV (!!coro->cctx); |
971 | _exit (code); |
2373 | OUTPUT: |
972 | #else |
2374 | RETVAL |
973 | signal (SIGTERM, SIG_DFL); |
|
|
974 | raise (SIGTERM); |
|
|
975 | exit (code); |
|
|
976 | #endif |
|
|
977 | |
2375 | |
978 | MODULE = Coro::State PACKAGE = Coro::Cont |
2376 | int |
|
|
2377 | is_traced (Coro::State coro) |
|
|
2378 | PROTOTYPE: $ |
|
|
2379 | CODE: |
|
|
2380 | RETVAL = (coro->cctx ? coro->cctx->flags : 0) & CC_TRACE_ALL; |
|
|
2381 | OUTPUT: |
|
|
2382 | RETVAL |
979 | |
2383 | |
980 | # this is slightly dirty (should expose a c-level api) |
2384 | UV |
|
|
2385 | rss (Coro::State coro) |
|
|
2386 | PROTOTYPE: $ |
|
|
2387 | ALIAS: |
|
|
2388 | usecount = 1 |
|
|
2389 | CODE: |
|
|
2390 | switch (ix) |
|
|
2391 | { |
|
|
2392 | case 0: RETVAL = coro_rss (aTHX_ coro); break; |
|
|
2393 | case 1: RETVAL = coro->usecount; break; |
|
|
2394 | } |
|
|
2395 | OUTPUT: |
|
|
2396 | RETVAL |
981 | |
2397 | |
982 | void |
2398 | void |
983 | yield(...) |
2399 | force_cctx () |
|
|
2400 | PROTOTYPE: |
|
|
2401 | CODE: |
|
|
2402 | SvSTATE_current->cctx->idle_sp = 0; |
|
|
2403 | |
|
|
2404 | void |
|
|
2405 | swap_defsv (Coro::State self) |
984 | PROTOTYPE: @ |
2406 | PROTOTYPE: $ |
|
|
2407 | ALIAS: |
|
|
2408 | swap_defav = 1 |
985 | CODE: |
2409 | CODE: |
986 | static SV *returnstk; |
2410 | if (!self->slot) |
987 | SV *sv; |
2411 | croak ("cannot swap state with coroutine that has no saved state,"); |
988 | AV *defav = GvAV (PL_defgv); |
2412 | else |
989 | struct coro *prev, *next; |
2413 | { |
|
|
2414 | SV **src = ix ? (SV **)&GvAV (PL_defgv) : &GvSV (PL_defgv); |
|
|
2415 | SV **dst = ix ? (SV **)&self->slot->defav : (SV **)&self->slot->defsv; |
990 | |
2416 | |
991 | if (!returnstk) |
2417 | SV *tmp = *src; *src = *dst; *dst = tmp; |
992 | returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE)); |
2418 | } |
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 | |
2419 | |
1008 | MODULE = Coro::State PACKAGE = Coro |
2420 | MODULE = Coro::State PACKAGE = Coro |
1009 | |
2421 | |
1010 | # this is slightly dirty (should expose a c-level api) |
|
|
1011 | |
|
|
1012 | BOOT: |
2422 | BOOT: |
1013 | { |
2423 | { |
1014 | int i; |
2424 | int i; |
|
|
2425 | |
|
|
2426 | av_async_pool = coro_get_av (aTHX_ "Coro::async_pool", TRUE); |
|
|
2427 | sv_pool_rss = coro_get_sv (aTHX_ "Coro::POOL_RSS" , TRUE); |
|
|
2428 | sv_pool_size = coro_get_sv (aTHX_ "Coro::POOL_SIZE" , TRUE); |
|
|
2429 | |
|
|
2430 | coro_current = coro_get_sv (aTHX_ "Coro::current", FALSE); |
|
|
2431 | SvREADONLY_on (coro_current); |
|
|
2432 | |
1015 | HV *stash = gv_stashpv ("Coro", TRUE); |
2433 | coro_stash = gv_stashpv ("Coro", TRUE); |
1016 | |
2434 | |
1017 | newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); |
2435 | newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX)); |
1018 | newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); |
2436 | newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); |
1019 | newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); |
2437 | newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); |
1020 | newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); |
2438 | newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW)); |
1021 | newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); |
2439 | newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); |
1022 | newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); |
2440 | newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN)); |
1023 | |
|
|
1024 | coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); |
|
|
1025 | coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); |
|
|
1026 | |
2441 | |
1027 | for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) |
2442 | for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) |
1028 | coro_ready[i] = newAV (); |
2443 | coro_ready[i] = newAV (); |
1029 | |
2444 | |
1030 | { |
2445 | { |
1031 | SV *sv = perl_get_sv("Coro::API", 1); |
2446 | SV *sv = coro_get_sv (aTHX_ "Coro::API", TRUE); |
1032 | |
2447 | |
1033 | coroapi.schedule = api_schedule; |
2448 | coroapi.schedule = api_schedule; |
|
|
2449 | coroapi.cede = api_cede; |
|
|
2450 | coroapi.cede_notself = api_cede_notself; |
1034 | coroapi.ready = api_ready; |
2451 | coroapi.ready = api_ready; |
|
|
2452 | coroapi.is_ready = api_is_ready; |
1035 | coroapi.nready = &coro_nready; |
2453 | coroapi.nready = coro_nready; |
1036 | coroapi.current = coro_current; |
2454 | coroapi.current = coro_current; |
1037 | |
2455 | |
1038 | GCoroAPI = &coroapi; |
2456 | GCoroAPI = &coroapi; |
1039 | sv_setiv(sv, (IV)&coroapi); |
2457 | sv_setiv (sv, (IV)&coroapi); |
1040 | SvREADONLY_on(sv); |
2458 | SvREADONLY_on (sv); |
1041 | } |
2459 | } |
1042 | } |
2460 | } |
1043 | |
2461 | |
1044 | void |
2462 | void |
1045 | ready(self) |
2463 | schedule (...) |
1046 | SV * self |
|
|
1047 | CODE: |
2464 | CODE: |
1048 | api_ready (self); |
2465 | CORO_EXECUTE_SLF_XS (slf_init_schedule); |
|
|
2466 | |
|
|
2467 | void |
|
|
2468 | cede (...) |
|
|
2469 | CODE: |
|
|
2470 | CORO_EXECUTE_SLF_XS (slf_init_cede); |
|
|
2471 | |
|
|
2472 | void |
|
|
2473 | cede_notself (...) |
|
|
2474 | CODE: |
|
|
2475 | CORO_EXECUTE_SLF_XS (slf_init_cede_notself); |
|
|
2476 | |
|
|
2477 | void |
|
|
2478 | _set_current (SV *current) |
|
|
2479 | PROTOTYPE: $ |
|
|
2480 | CODE: |
|
|
2481 | SvREFCNT_dec (SvRV (coro_current)); |
|
|
2482 | SvRV_set (coro_current, SvREFCNT_inc_NN (SvRV (current))); |
|
|
2483 | |
|
|
2484 | void |
|
|
2485 | _set_readyhook (SV *hook) |
|
|
2486 | PROTOTYPE: $ |
|
|
2487 | CODE: |
|
|
2488 | SvREFCNT_dec (coro_readyhook); |
|
|
2489 | coro_readyhook = SvOK (hook) ? newSVsv (hook) : 0; |
1049 | |
2490 | |
1050 | int |
2491 | int |
|
|
2492 | prio (Coro::State coro, int newprio = 0) |
|
|
2493 | PROTOTYPE: $;$ |
|
|
2494 | ALIAS: |
|
|
2495 | nice = 1 |
|
|
2496 | CODE: |
|
|
2497 | { |
|
|
2498 | RETVAL = coro->prio; |
|
|
2499 | |
|
|
2500 | if (items > 1) |
|
|
2501 | { |
|
|
2502 | if (ix) |
|
|
2503 | newprio = coro->prio - newprio; |
|
|
2504 | |
|
|
2505 | if (newprio < PRIO_MIN) newprio = PRIO_MIN; |
|
|
2506 | if (newprio > PRIO_MAX) newprio = PRIO_MAX; |
|
|
2507 | |
|
|
2508 | coro->prio = newprio; |
|
|
2509 | } |
|
|
2510 | } |
|
|
2511 | OUTPUT: |
|
|
2512 | RETVAL |
|
|
2513 | |
|
|
2514 | SV * |
|
|
2515 | ready (SV *self) |
|
|
2516 | PROTOTYPE: $ |
|
|
2517 | CODE: |
|
|
2518 | RETVAL = boolSV (api_ready (aTHX_ self)); |
|
|
2519 | OUTPUT: |
|
|
2520 | RETVAL |
|
|
2521 | |
|
|
2522 | int |
1051 | nready(...) |
2523 | nready (...) |
1052 | PROTOTYPE: |
2524 | PROTOTYPE: |
1053 | CODE: |
2525 | CODE: |
1054 | RETVAL = coro_nready; |
2526 | RETVAL = coro_nready; |
1055 | OUTPUT: |
2527 | OUTPUT: |
1056 | RETVAL |
2528 | RETVAL |
1057 | |
2529 | |
|
|
2530 | # for async_pool speedup |
1058 | void |
2531 | void |
1059 | schedule(...) |
2532 | _pool_1 (SV *cb) |
1060 | PROTOTYPE: |
|
|
1061 | ALIAS: |
|
|
1062 | cede = 1 |
|
|
1063 | CODE: |
2533 | CODE: |
1064 | api_schedule (ix); |
2534 | { |
|
|
2535 | HV *hv = (HV *)SvRV (coro_current); |
|
|
2536 | struct coro *coro = SvSTATE_hv ((SV *)hv); |
|
|
2537 | AV *defav = GvAV (PL_defgv); |
|
|
2538 | SV *invoke = hv_delete (hv, "_invoke", sizeof ("_invoke") - 1, 0); |
|
|
2539 | AV *invoke_av; |
|
|
2540 | int i, len; |
1065 | |
2541 | |
|
|
2542 | if (!invoke) |
|
|
2543 | { |
|
|
2544 | SV *old = PL_diehook; |
|
|
2545 | PL_diehook = 0; |
|
|
2546 | SvREFCNT_dec (old); |
|
|
2547 | croak ("\3async_pool terminate\2\n"); |
|
|
2548 | } |
|
|
2549 | |
|
|
2550 | SvREFCNT_dec (coro->saved_deffh); |
|
|
2551 | coro->saved_deffh = SvREFCNT_inc_NN ((SV *)PL_defoutgv); |
|
|
2552 | |
|
|
2553 | hv_store (hv, "desc", sizeof ("desc") - 1, |
|
|
2554 | newSVpvn ("[async_pool]", sizeof ("[async_pool]") - 1), 0); |
|
|
2555 | |
|
|
2556 | invoke_av = (AV *)SvRV (invoke); |
|
|
2557 | len = av_len (invoke_av); |
|
|
2558 | |
|
|
2559 | sv_setsv (cb, AvARRAY (invoke_av)[0]); |
|
|
2560 | |
|
|
2561 | if (len > 0) |
|
|
2562 | { |
|
|
2563 | av_fill (defav, len - 1); |
|
|
2564 | for (i = 0; i < len; ++i) |
|
|
2565 | av_store (defav, i, SvREFCNT_inc_NN (AvARRAY (invoke_av)[i + 1])); |
|
|
2566 | } |
|
|
2567 | } |
|
|
2568 | |
|
|
2569 | void |
|
|
2570 | _pool_2 (SV *cb) |
|
|
2571 | CODE: |
|
|
2572 | { |
|
|
2573 | struct coro *coro = SvSTATE_current; |
|
|
2574 | |
|
|
2575 | sv_setsv (cb, &PL_sv_undef); |
|
|
2576 | |
|
|
2577 | SvREFCNT_dec ((SV *)PL_defoutgv); PL_defoutgv = (GV *)coro->saved_deffh; |
|
|
2578 | coro->saved_deffh = 0; |
|
|
2579 | |
|
|
2580 | if (coro_rss (aTHX_ coro) > SvUV (sv_pool_rss) |
|
|
2581 | || av_len (av_async_pool) + 1 >= SvIV (sv_pool_size)) |
|
|
2582 | { |
|
|
2583 | SV *old = PL_diehook; |
|
|
2584 | PL_diehook = 0; |
|
|
2585 | SvREFCNT_dec (old); |
|
|
2586 | croak ("\3async_pool terminate\2\n"); |
|
|
2587 | } |
|
|
2588 | |
|
|
2589 | av_clear (GvAV (PL_defgv)); |
|
|
2590 | hv_store ((HV *)SvRV (coro_current), "desc", sizeof ("desc") - 1, |
|
|
2591 | newSVpvn ("[async_pool idle]", sizeof ("[async_pool idle]") - 1), 0); |
|
|
2592 | |
|
|
2593 | coro->prio = 0; |
|
|
2594 | |
|
|
2595 | if (coro->cctx && (coro->cctx->flags & CC_TRACE)) |
|
|
2596 | api_trace (aTHX_ coro_current, 0); |
|
|
2597 | |
|
|
2598 | av_push (av_async_pool, newSVsv (coro_current)); |
|
|
2599 | } |
|
|
2600 | |
|
|
2601 | |
|
|
2602 | MODULE = Coro::State PACKAGE = Coro::AIO |
|
|
2603 | |
|
|
2604 | void |
|
|
2605 | _get_state (SV *self) |
|
|
2606 | PROTOTYPE: $ |
|
|
2607 | PPCODE: |
|
|
2608 | { |
|
|
2609 | AV *defav = GvAV (PL_defgv); |
|
|
2610 | AV *av = newAV (); |
|
|
2611 | int i; |
|
|
2612 | SV *data_sv = newSV (sizeof (struct io_state)); |
|
|
2613 | struct io_state *data = (struct io_state *)SvPVX (data_sv); |
|
|
2614 | SvCUR_set (data_sv, sizeof (struct io_state)); |
|
|
2615 | SvPOK_only (data_sv); |
|
|
2616 | |
|
|
2617 | data->errorno = errno; |
|
|
2618 | data->laststype = PL_laststype; |
|
|
2619 | data->laststatval = PL_laststatval; |
|
|
2620 | data->statcache = PL_statcache; |
|
|
2621 | |
|
|
2622 | av_extend (av, AvFILLp (defav) + 1 + 1); |
|
|
2623 | |
|
|
2624 | for (i = 0; i <= AvFILLp (defav); ++i) |
|
|
2625 | av_push (av, SvREFCNT_inc_NN (AvARRAY (defav)[i])); |
|
|
2626 | |
|
|
2627 | av_push (av, data_sv); |
|
|
2628 | |
|
|
2629 | XPUSHs (sv_2mortal (newRV_noinc ((SV *)av))); |
|
|
2630 | |
|
|
2631 | api_ready (aTHX_ self); |
|
|
2632 | } |
|
|
2633 | |
|
|
2634 | void |
|
|
2635 | _set_state (SV *state) |
|
|
2636 | PROTOTYPE: $ |
|
|
2637 | PPCODE: |
|
|
2638 | { |
|
|
2639 | AV *av = (AV *)SvRV (state); |
|
|
2640 | struct io_state *data = (struct io_state *)SvPVX (AvARRAY (av)[AvFILLp (av)]); |
|
|
2641 | int i; |
|
|
2642 | |
|
|
2643 | errno = data->errorno; |
|
|
2644 | PL_laststype = data->laststype; |
|
|
2645 | PL_laststatval = data->laststatval; |
|
|
2646 | PL_statcache = data->statcache; |
|
|
2647 | |
|
|
2648 | EXTEND (SP, AvFILLp (av)); |
|
|
2649 | for (i = 0; i < AvFILLp (av); ++i) |
|
|
2650 | PUSHs (sv_2mortal (SvREFCNT_inc_NN (AvARRAY (av)[i]))); |
|
|
2651 | } |
|
|
2652 | |
|
|
2653 | |
|
|
2654 | MODULE = Coro::State PACKAGE = Coro::AnyEvent |
|
|
2655 | |
|
|
2656 | BOOT: |
|
|
2657 | sv_activity = coro_get_sv (aTHX_ "Coro::AnyEvent::ACTIVITY", TRUE); |
|
|
2658 | |
|
|
2659 | void |
|
|
2660 | _schedule (...) |
|
|
2661 | CODE: |
|
|
2662 | { |
|
|
2663 | static int incede; |
|
|
2664 | |
|
|
2665 | api_cede_notself (aTHX); |
|
|
2666 | |
|
|
2667 | ++incede; |
|
|
2668 | while (coro_nready >= incede && api_cede (aTHX)) |
|
|
2669 | ; |
|
|
2670 | |
|
|
2671 | sv_setsv (sv_activity, &PL_sv_undef); |
|
|
2672 | if (coro_nready >= incede) |
|
|
2673 | { |
|
|
2674 | PUSHMARK (SP); |
|
|
2675 | PUTBACK; |
|
|
2676 | call_pv ("Coro::AnyEvent::_activity", G_DISCARD | G_EVAL); |
|
|
2677 | SPAGAIN; |
|
|
2678 | } |
|
|
2679 | |
|
|
2680 | --incede; |
|
|
2681 | } |
|
|
2682 | |
|
|
2683 | |
|
|
2684 | MODULE = Coro::State PACKAGE = PerlIO::cede |
|
|
2685 | |
|
|
2686 | BOOT: |
|
|
2687 | PerlIO_define_layer (aTHX_ &PerlIO_cede); |
|
|
2688 | |
|
|
2689 | MODULE = Coro::State PACKAGE = Coro::Semaphore |
|
|
2690 | |
|
|
2691 | SV * |
|
|
2692 | new (SV *klass, SV *count_ = 0) |
|
|
2693 | CODE: |
|
|
2694 | { |
|
|
2695 | /* a semaphore contains a counter IV in $sem->[0] and any waiters after that */ |
|
|
2696 | AV *av = newAV (); |
|
|
2697 | av_push (av, newSViv (count_ && SvOK (count_) ? SvIV (count_) : 1)); |
|
|
2698 | RETVAL = sv_bless (newRV_noinc ((SV *)av), GvSTASH (CvGV (cv))); |
|
|
2699 | } |
|
|
2700 | OUTPUT: |
|
|
2701 | RETVAL |
|
|
2702 | |
|
|
2703 | SV * |
|
|
2704 | count (SV *self) |
|
|
2705 | CODE: |
|
|
2706 | RETVAL = newSVsv (AvARRAY ((AV *)SvRV (self))[0]); |
|
|
2707 | OUTPUT: |
|
|
2708 | RETVAL |
|
|
2709 | |
|
|
2710 | void |
|
|
2711 | up (SV *self, int adjust = 1) |
|
|
2712 | ALIAS: |
|
|
2713 | adjust = 1 |
|
|
2714 | CODE: |
|
|
2715 | coro_semaphore_adjust (aTHX_ (AV *)SvRV (self), ix ? adjust : 1); |
|
|
2716 | |
|
|
2717 | void |
|
|
2718 | down (SV *self) |
|
|
2719 | CODE: |
|
|
2720 | CORO_EXECUTE_SLF_XS (slf_init_semaphore_down); |
|
|
2721 | |
|
|
2722 | void |
|
|
2723 | try (SV *self) |
|
|
2724 | PPCODE: |
|
|
2725 | { |
|
|
2726 | AV *av = (AV *)SvRV (self); |
|
|
2727 | SV *count_sv = AvARRAY (av)[0]; |
|
|
2728 | IV count = SvIVX (count_sv); |
|
|
2729 | |
|
|
2730 | if (count > 0) |
|
|
2731 | { |
|
|
2732 | --count; |
|
|
2733 | SvIVX (count_sv) = count; |
|
|
2734 | XSRETURN_YES; |
|
|
2735 | } |
|
|
2736 | else |
|
|
2737 | XSRETURN_NO; |
|
|
2738 | } |
|
|
2739 | |
|
|
2740 | void |
|
|
2741 | waiters (SV *self) |
|
|
2742 | CODE: |
|
|
2743 | { |
|
|
2744 | AV *av = (AV *)SvRV (self); |
|
|
2745 | |
|
|
2746 | if (GIMME_V == G_SCALAR) |
|
|
2747 | XPUSHs (sv_2mortal (newSVsv (AvARRAY (av)[0]))); |
|
|
2748 | else |
|
|
2749 | { |
|
|
2750 | int i; |
|
|
2751 | EXTEND (SP, AvFILLp (av) + 1 - 1); |
|
|
2752 | for (i = 1; i <= AvFILLp (av); ++i) |
|
|
2753 | PUSHs (newSVsv (AvARRAY (av)[i])); |
|
|
2754 | } |
|
|
2755 | } |
|
|
2756 | |