|
|
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" |
4 | |
9 | |
5 | #include "libcoro/coro.c" |
10 | #include "patchlevel.h" |
6 | |
11 | |
7 | #include <signal.h> |
12 | #include <stdio.h> |
|
|
13 | #include <errno.h> |
|
|
14 | #include <assert.h> |
|
|
15 | #include <inttypes.h> /* portable stdint.h */ |
8 | |
16 | |
9 | #ifdef HAVE_MMAP |
17 | #ifdef HAVE_MMAP |
10 | # include <unistd.h> |
18 | # include <unistd.h> |
11 | # include <sys/mman.h> |
19 | # include <sys/mman.h> |
12 | # ifndef MAP_ANONYMOUS |
20 | # ifndef MAP_ANONYMOUS |
… | |
… | |
14 | # define MAP_ANONYMOUS MAP_ANON |
22 | # define MAP_ANONYMOUS MAP_ANON |
15 | # else |
23 | # else |
16 | # undef HAVE_MMAP |
24 | # undef HAVE_MMAP |
17 | # endif |
25 | # endif |
18 | # endif |
26 | # endif |
|
|
27 | # include <limits.h> |
|
|
28 | # ifndef PAGESIZE |
|
|
29 | # define PAGESIZE pagesize |
|
|
30 | # define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE) |
|
|
31 | static long pagesize; |
|
|
32 | # else |
|
|
33 | # define BOOT_PAGESIZE (void)0 |
19 | #endif |
34 | # endif |
|
|
35 | #else |
|
|
36 | # define PAGESIZE 0 |
|
|
37 | # define BOOT_PAGESIZE (void)0 |
|
|
38 | #endif |
20 | |
39 | |
21 | #define MAY_FLUSH /* increases codesize and is rarely used */ |
40 | #if CORO_USE_VALGRIND |
|
|
41 | # include <valgrind/valgrind.h> |
|
|
42 | # define REGISTER_STACK(cctx,start,end) (cctx)->valgrind_id = VALGRIND_STACK_REGISTER ((start), (end)) |
|
|
43 | #else |
|
|
44 | # define REGISTER_STACK(cctx,start,end) |
|
|
45 | #endif |
22 | |
46 | |
23 | #define SUB_INIT "Coro::State::initialize" |
47 | /* the maximum number of idle cctx that will be pooled */ |
24 | #define UCORO_STATE "_coro_state" |
48 | #define MAX_IDLE_CCTX 8 |
25 | |
49 | |
26 | /* The next macro should declare a variable stacklevel that contains and approximation |
50 | #define PERL_VERSION_ATLEAST(a,b,c) \ |
27 | * to the current C stack pointer. Its property is that it changes with each call |
51 | (PERL_REVISION > (a) \ |
28 | * and should be unique. */ |
52 | || (PERL_REVISION == (a) \ |
|
|
53 | && (PERL_VERSION > (b) \ |
|
|
54 | || (PERL_VERSION == (b) && PERLSUBVERSION >= (c))))) |
|
|
55 | |
|
|
56 | #if !PERL_VERSION_ATLEAST (5,6,0) |
|
|
57 | # ifndef PL_ppaddr |
|
|
58 | # define PL_ppaddr ppaddr |
|
|
59 | # endif |
|
|
60 | # ifndef call_sv |
|
|
61 | # define call_sv perl_call_sv |
|
|
62 | # endif |
|
|
63 | # ifndef get_sv |
|
|
64 | # define get_sv perl_get_sv |
|
|
65 | # endif |
|
|
66 | # ifndef get_cv |
|
|
67 | # define get_cv perl_get_cv |
|
|
68 | # endif |
|
|
69 | # ifndef IS_PADGV |
|
|
70 | # define IS_PADGV(v) 0 |
|
|
71 | # endif |
|
|
72 | # ifndef IS_PADCONST |
|
|
73 | # define IS_PADCONST(v) 0 |
|
|
74 | # endif |
|
|
75 | #endif |
|
|
76 | |
|
|
77 | /* 5.8.7 */ |
|
|
78 | #ifndef SvRV_set |
|
|
79 | # define SvRV_set(s,v) SvRV(s) = (v) |
|
|
80 | #endif |
|
|
81 | |
|
|
82 | /* 5.8.8 */ |
|
|
83 | #ifndef GV_NOTQUAL |
|
|
84 | # define GV_NOTQUAL 0 |
|
|
85 | #endif |
|
|
86 | #ifndef newSV |
|
|
87 | # define newSV(l) NEWSV(0,l) |
|
|
88 | #endif |
|
|
89 | |
|
|
90 | #if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64 |
|
|
91 | # undef CORO_STACKGUARD |
|
|
92 | #endif |
|
|
93 | |
|
|
94 | #ifndef CORO_STACKGUARD |
|
|
95 | # define CORO_STACKGUARD 0 |
|
|
96 | #endif |
|
|
97 | |
|
|
98 | /* prefer perl internal functions over our own? */ |
|
|
99 | #ifndef CORO_PREFER_PERL_FUNCTIONS |
|
|
100 | # define CORO_PREFER_PERL_FUNCTIONS 0 |
|
|
101 | #endif |
|
|
102 | |
|
|
103 | /* The next macros try to return the current stack pointer, in an as |
|
|
104 | * portable way as possible. */ |
|
|
105 | #define dSTACKLEVEL volatile char stacklevel |
29 | #define dSTACKLEVEL void *stacklevel = &stacklevel |
106 | #define STACKLEVEL ((void *)&stacklevel) |
30 | |
107 | |
31 | #define IN_DESTRUCT (PL_main_cv == Nullcv) |
108 | #define IN_DESTRUCT (PL_main_cv == Nullcv) |
32 | |
109 | |
33 | #define labs(l) ((l) >= 0 ? (l) : -(l)) |
110 | #if __GNUC__ >= 3 |
|
|
111 | # define attribute(x) __attribute__(x) |
|
|
112 | # define BARRIER __asm__ __volatile__ ("" : : : "memory") |
|
|
113 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
|
|
114 | #else |
|
|
115 | # define attribute(x) |
|
|
116 | # define BARRIER |
|
|
117 | # define expect(expr,value) (expr) |
|
|
118 | #endif |
|
|
119 | |
|
|
120 | #define expect_false(expr) expect ((expr) != 0, 0) |
|
|
121 | #define expect_true(expr) expect ((expr) != 0, 1) |
|
|
122 | |
|
|
123 | #define NOINLINE attribute ((noinline)) |
34 | |
124 | |
35 | #include "CoroAPI.h" |
125 | #include "CoroAPI.h" |
36 | |
126 | |
|
|
127 | #ifdef USE_ITHREADS |
|
|
128 | static perl_mutex coro_mutex; |
|
|
129 | # define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0) |
|
|
130 | # define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0) |
|
|
131 | #else |
|
|
132 | # define LOCK (void)0 |
|
|
133 | # define UNLOCK (void)0 |
|
|
134 | #endif |
|
|
135 | |
|
|
136 | /* helper storage struct for Coro::AIO */ |
|
|
137 | struct io_state |
|
|
138 | { |
|
|
139 | int errorno; |
|
|
140 | I32 laststype; |
|
|
141 | int laststatval; |
|
|
142 | Stat_t statcache; |
|
|
143 | }; |
|
|
144 | |
|
|
145 | static size_t coro_stacksize = CORO_STACKSIZE; |
37 | static struct CoroAPI coroapi; |
146 | static struct CoroAPI coroapi; |
|
|
147 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
|
|
148 | static JMPENV *main_top_env; |
|
|
149 | static HV *coro_state_stash, *coro_stash; |
|
|
150 | static SV *coro_mortal; /* will be freed after next transfer */ |
38 | |
151 | |
39 | /* this is actually not only the c stack but also c registers etc... */ |
152 | static GV *irsgv; /* $/ */ |
|
|
153 | static GV *stdoutgv; /* *STDOUT */ |
|
|
154 | static SV *rv_diehook; |
|
|
155 | static SV *rv_warnhook; |
|
|
156 | static HV *hv_sig; /* %SIG */ |
|
|
157 | |
|
|
158 | /* async_pool helper stuff */ |
|
|
159 | static SV *sv_pool_rss; |
|
|
160 | static SV *sv_pool_size; |
|
|
161 | static AV *av_async_pool; |
|
|
162 | |
|
|
163 | static struct coro_cctx *cctx_first; |
|
|
164 | static int cctx_count, cctx_idle; |
|
|
165 | |
|
|
166 | enum { |
|
|
167 | CC_MAPPED = 0x01, |
|
|
168 | CC_NOREUSE = 0x02, /* throw this away after tracing */ |
|
|
169 | CC_TRACE = 0x04, |
|
|
170 | CC_TRACE_SUB = 0x08, /* trace sub calls */ |
|
|
171 | CC_TRACE_LINE = 0x10, /* trace each statement */ |
|
|
172 | CC_TRACE_ALL = CC_TRACE_SUB | CC_TRACE_LINE, |
|
|
173 | }; |
|
|
174 | |
|
|
175 | /* this is a structure representing a c-level coroutine */ |
|
|
176 | typedef struct coro_cctx { |
|
|
177 | struct coro_cctx *next; |
|
|
178 | |
|
|
179 | /* the stack */ |
|
|
180 | void *sptr; |
|
|
181 | size_t ssize; |
|
|
182 | |
|
|
183 | /* cpu state */ |
|
|
184 | void *idle_sp; /* sp of top-level transfer/schedule/cede call */ |
|
|
185 | JMPENV *idle_te; /* same as idle_sp, but for top_env, TODO: remove once stable */ |
|
|
186 | JMPENV *top_env; |
|
|
187 | coro_context cctx; |
|
|
188 | |
|
|
189 | #if CORO_USE_VALGRIND |
|
|
190 | int valgrind_id; |
|
|
191 | #endif |
|
|
192 | unsigned char flags; |
|
|
193 | } coro_cctx; |
|
|
194 | |
|
|
195 | enum { |
|
|
196 | CF_RUNNING = 0x0001, /* coroutine is running */ |
|
|
197 | CF_READY = 0x0002, /* coroutine is ready */ |
|
|
198 | CF_NEW = 0x0004, /* has never been switched to */ |
|
|
199 | CF_DESTROYED = 0x0008, /* coroutine data has been freed */ |
|
|
200 | }; |
|
|
201 | |
|
|
202 | /* the structure where most of the perl state is stored, overlaid on the cxstack */ |
40 | typedef struct { |
203 | typedef struct { |
41 | int refcnt; /* pointer reference counter */ |
204 | SV *defsv; |
42 | int usecnt; /* shared by how many coroutines */ |
205 | AV *defav; |
43 | int gencnt; /* generation counter */ |
206 | SV *errsv; |
|
|
207 | SV *irsgv; |
|
|
208 | #define VAR(name,type) type name; |
|
|
209 | # include "state.h" |
|
|
210 | #undef VAR |
|
|
211 | } perl_slots; |
44 | |
212 | |
45 | coro_context cctx; |
213 | #define SLOT_COUNT ((sizeof (perl_slots) + sizeof (PERL_CONTEXT) - 1) / sizeof (PERL_CONTEXT)) |
46 | |
214 | |
47 | void *sptr; |
215 | /* this is a structure representing a perl-level coroutine */ |
48 | long ssize; /* positive == mmap, otherwise malloc */ |
|
|
49 | } coro_stack; |
|
|
50 | |
|
|
51 | struct coro { |
216 | struct coro { |
52 | /* the optional C context */ |
217 | /* the c coroutine allocated to this perl coroutine, if any */ |
53 | coro_stack *stack; |
218 | coro_cctx *cctx; |
54 | void *cursp; |
|
|
55 | int gencnt; |
|
|
56 | |
219 | |
57 | /* optionally saved, might be zero */ |
220 | /* process data */ |
58 | AV *defav; |
|
|
59 | SV *defsv; |
|
|
60 | SV *errsv; |
|
|
61 | |
|
|
62 | /* saved global state not related to stacks */ |
|
|
63 | U8 dowarn; |
|
|
64 | I32 in_eval; |
|
|
65 | |
|
|
66 | /* the stacks and related info (callchain etc..) */ |
|
|
67 | PERL_SI *curstackinfo; |
|
|
68 | AV *curstack; |
|
|
69 | AV *mainstack; |
221 | AV *mainstack; |
70 | SV **stack_sp; |
222 | perl_slots *slot; /* basically the saved sp */ |
71 | OP *op; |
|
|
72 | SV **curpad; |
|
|
73 | AV *comppad; |
|
|
74 | SV **stack_base; |
|
|
75 | SV **stack_max; |
|
|
76 | SV **tmps_stack; |
|
|
77 | I32 tmps_floor; |
|
|
78 | I32 tmps_ix; |
|
|
79 | I32 tmps_max; |
|
|
80 | I32 *markstack; |
|
|
81 | I32 *markstack_ptr; |
|
|
82 | I32 *markstack_max; |
|
|
83 | I32 *scopestack; |
|
|
84 | I32 scopestack_ix; |
|
|
85 | I32 scopestack_max; |
|
|
86 | ANY *savestack; |
|
|
87 | I32 savestack_ix; |
|
|
88 | I32 savestack_max; |
|
|
89 | OP **retstack; |
|
|
90 | I32 retstack_ix; |
|
|
91 | I32 retstack_max; |
|
|
92 | COP *curcop; |
|
|
93 | JMPENV *top_env; |
|
|
94 | |
223 | |
95 | /* data associated with this coroutine (initial args) */ |
224 | AV *args; /* data associated with this coroutine (initial args) */ |
96 | AV *args; |
225 | int refcnt; /* coroutines are refcounted, yes */ |
|
|
226 | int flags; /* CF_ flags */ |
|
|
227 | HV *hv; /* the perl hash associated with this coro, if any */ |
|
|
228 | |
|
|
229 | /* statistics */ |
|
|
230 | int usecount; /* number of transfers to this coro */ |
|
|
231 | |
|
|
232 | /* coro process data */ |
|
|
233 | int prio; |
|
|
234 | SV *throw; /* exception to be thrown */ |
|
|
235 | |
|
|
236 | /* async_pool */ |
|
|
237 | SV *saved_deffh; |
|
|
238 | |
|
|
239 | /* linked list */ |
|
|
240 | struct coro *next, *prev; |
97 | }; |
241 | }; |
98 | |
242 | |
99 | typedef struct coro *Coro__State; |
243 | typedef struct coro *Coro__State; |
100 | typedef struct coro *Coro__State_or_hashref; |
244 | typedef struct coro *Coro__State_or_hashref; |
101 | |
|
|
102 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
|
|
103 | static HV *coro_state_stash; |
|
|
104 | static SV *ucoro_state_sv; |
|
|
105 | static U32 ucoro_state_hash; |
|
|
106 | static HV *padlist_cache; |
|
|
107 | static SV *coro_mortal; /* will be freed after next transfer */ |
|
|
108 | |
|
|
109 | /* mostly copied from op.c:cv_clone2 */ |
|
|
110 | STATIC AV * |
|
|
111 | clone_padlist (AV *protopadlist) |
|
|
112 | { |
|
|
113 | AV *av; |
|
|
114 | I32 ix; |
|
|
115 | AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE); |
|
|
116 | AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE); |
|
|
117 | SV **pname = AvARRAY (protopad_name); |
|
|
118 | SV **ppad = AvARRAY (protopad); |
|
|
119 | I32 fname = AvFILLp (protopad_name); |
|
|
120 | I32 fpad = AvFILLp (protopad); |
|
|
121 | AV *newpadlist, *newpad_name, *newpad; |
|
|
122 | SV **npad; |
|
|
123 | |
|
|
124 | newpad_name = newAV (); |
|
|
125 | for (ix = fname; ix >= 0; ix--) |
|
|
126 | av_store (newpad_name, ix, SvREFCNT_inc (pname[ix])); |
|
|
127 | |
|
|
128 | newpad = newAV (); |
|
|
129 | av_fill (newpad, AvFILLp (protopad)); |
|
|
130 | npad = AvARRAY (newpad); |
|
|
131 | |
|
|
132 | newpadlist = newAV (); |
|
|
133 | AvREAL_off (newpadlist); |
|
|
134 | av_store (newpadlist, 0, (SV *) newpad_name); |
|
|
135 | av_store (newpadlist, 1, (SV *) newpad); |
|
|
136 | |
|
|
137 | av = newAV (); /* will be @_ */ |
|
|
138 | av_extend (av, 0); |
|
|
139 | av_store (newpad, 0, (SV *) av); |
|
|
140 | AvFLAGS (av) = AVf_REIFY; |
|
|
141 | |
|
|
142 | for (ix = fpad; ix > 0; ix--) |
|
|
143 | { |
|
|
144 | SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; |
|
|
145 | if (namesv && namesv != &PL_sv_undef) |
|
|
146 | { |
|
|
147 | char *name = SvPVX (namesv); /* XXX */ |
|
|
148 | if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') |
|
|
149 | { /* lexical from outside? */ |
|
|
150 | npad[ix] = SvREFCNT_inc (ppad[ix]); |
|
|
151 | } |
|
|
152 | else |
|
|
153 | { /* our own lexical */ |
|
|
154 | SV *sv; |
|
|
155 | if (*name == '&') |
|
|
156 | sv = SvREFCNT_inc (ppad[ix]); |
|
|
157 | else if (*name == '@') |
|
|
158 | sv = (SV *) newAV (); |
|
|
159 | else if (*name == '%') |
|
|
160 | sv = (SV *) newHV (); |
|
|
161 | else |
|
|
162 | sv = NEWSV (0, 0); |
|
|
163 | if (!SvPADBUSY (sv)) |
|
|
164 | SvPADMY_on (sv); |
|
|
165 | npad[ix] = sv; |
|
|
166 | } |
|
|
167 | } |
|
|
168 | else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) |
|
|
169 | { |
|
|
170 | npad[ix] = SvREFCNT_inc (ppad[ix]); |
|
|
171 | } |
|
|
172 | else |
|
|
173 | { |
|
|
174 | SV *sv = NEWSV (0, 0); |
|
|
175 | SvPADTMP_on (sv); |
|
|
176 | npad[ix] = sv; |
|
|
177 | } |
|
|
178 | } |
|
|
179 | |
|
|
180 | #if 0 /* return -ENOTUNDERSTOOD */ |
|
|
181 | /* Now that vars are all in place, clone nested closures. */ |
|
|
182 | |
|
|
183 | for (ix = fpad; ix > 0; ix--) { |
|
|
184 | SV* namesv = (ix <= fname) ? pname[ix] : Nullsv; |
|
|
185 | if (namesv |
|
|
186 | && namesv != &PL_sv_undef |
|
|
187 | && !(SvFLAGS(namesv) & SVf_FAKE) |
|
|
188 | && *SvPVX(namesv) == '&' |
|
|
189 | && CvCLONE(ppad[ix])) |
|
|
190 | { |
|
|
191 | CV *kid = cv_clone((CV*)ppad[ix]); |
|
|
192 | SvREFCNT_dec(ppad[ix]); |
|
|
193 | CvCLONE_on(kid); |
|
|
194 | SvPADMY_on(kid); |
|
|
195 | npad[ix] = (SV*)kid; |
|
|
196 | } |
|
|
197 | } |
|
|
198 | #endif |
|
|
199 | |
|
|
200 | return newpadlist; |
|
|
201 | } |
|
|
202 | |
|
|
203 | #ifdef MAY_FLUSH |
|
|
204 | STATIC void |
|
|
205 | free_padlist (AV *padlist) |
|
|
206 | { |
|
|
207 | /* may be during global destruction */ |
|
|
208 | if (SvREFCNT(padlist)) |
|
|
209 | { |
|
|
210 | I32 i = AvFILLp(padlist); |
|
|
211 | while (i >= 0) |
|
|
212 | { |
|
|
213 | SV **svp = av_fetch(padlist, i--, FALSE); |
|
|
214 | SV *sv = svp ? *svp : Nullsv; |
|
|
215 | if (sv) |
|
|
216 | SvREFCNT_dec(sv); |
|
|
217 | } |
|
|
218 | |
|
|
219 | SvREFCNT_dec((SV*)padlist); |
|
|
220 | } |
|
|
221 | } |
|
|
222 | #endif |
|
|
223 | |
|
|
224 | /* the next two functions merely cache the padlists */ |
|
|
225 | STATIC void |
|
|
226 | get_padlist (CV *cv) |
|
|
227 | { |
|
|
228 | SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0); |
|
|
229 | |
|
|
230 | if (he && AvFILLp ((AV *)*he) >= 0) |
|
|
231 | CvPADLIST (cv) = (AV *)av_pop ((AV *)*he); |
|
|
232 | else |
|
|
233 | CvPADLIST (cv) = clone_padlist (CvPADLIST (cv)); |
|
|
234 | } |
|
|
235 | |
|
|
236 | STATIC void |
|
|
237 | put_padlist (CV *cv) |
|
|
238 | { |
|
|
239 | SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1); |
|
|
240 | |
|
|
241 | if (SvTYPE (*he) != SVt_PVAV) |
|
|
242 | { |
|
|
243 | SvREFCNT_dec (*he); |
|
|
244 | *he = (SV *)newAV (); |
|
|
245 | } |
|
|
246 | |
|
|
247 | av_push ((AV *)*he, (SV *)CvPADLIST (cv)); |
|
|
248 | } |
|
|
249 | |
|
|
250 | #ifdef MAY_FLUSH |
|
|
251 | STATIC void |
|
|
252 | flush_padlist_cache () |
|
|
253 | { |
|
|
254 | HV *hv = padlist_cache; |
|
|
255 | padlist_cache = newHV (); |
|
|
256 | |
|
|
257 | if (hv_iterinit (hv)) |
|
|
258 | { |
|
|
259 | HE *he; |
|
|
260 | AV *padlist; |
|
|
261 | |
|
|
262 | while (!!(he = hv_iternext (hv))) |
|
|
263 | { |
|
|
264 | AV *av = (AV *)HeVAL(he); |
|
|
265 | |
|
|
266 | /* casting is fun. */ |
|
|
267 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
|
|
268 | free_padlist (padlist); |
|
|
269 | } |
|
|
270 | } |
|
|
271 | |
|
|
272 | SvREFCNT_dec (hv); |
|
|
273 | } |
|
|
274 | #endif |
|
|
275 | |
|
|
276 | #define SB do { |
|
|
277 | #define SE } while (0) |
|
|
278 | |
|
|
279 | #define LOAD(state) load_state(aTHX_ (state)); |
|
|
280 | #define SAVE(state,flags) save_state(aTHX_ (state),(flags)); |
|
|
281 | |
|
|
282 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE |
|
|
283 | |
|
|
284 | static void |
|
|
285 | load_state(pTHX_ Coro__State c) |
|
|
286 | { |
|
|
287 | PL_dowarn = c->dowarn; |
|
|
288 | PL_in_eval = c->in_eval; |
|
|
289 | |
|
|
290 | PL_curstackinfo = c->curstackinfo; |
|
|
291 | PL_curstack = c->curstack; |
|
|
292 | PL_mainstack = c->mainstack; |
|
|
293 | PL_stack_sp = c->stack_sp; |
|
|
294 | PL_op = c->op; |
|
|
295 | PL_curpad = c->curpad; |
|
|
296 | PL_comppad = c->comppad; |
|
|
297 | PL_stack_base = c->stack_base; |
|
|
298 | PL_stack_max = c->stack_max; |
|
|
299 | PL_tmps_stack = c->tmps_stack; |
|
|
300 | PL_tmps_floor = c->tmps_floor; |
|
|
301 | PL_tmps_ix = c->tmps_ix; |
|
|
302 | PL_tmps_max = c->tmps_max; |
|
|
303 | PL_markstack = c->markstack; |
|
|
304 | PL_markstack_ptr = c->markstack_ptr; |
|
|
305 | PL_markstack_max = c->markstack_max; |
|
|
306 | PL_scopestack = c->scopestack; |
|
|
307 | PL_scopestack_ix = c->scopestack_ix; |
|
|
308 | PL_scopestack_max = c->scopestack_max; |
|
|
309 | PL_savestack = c->savestack; |
|
|
310 | PL_savestack_ix = c->savestack_ix; |
|
|
311 | PL_savestack_max = c->savestack_max; |
|
|
312 | PL_retstack = c->retstack; |
|
|
313 | PL_retstack_ix = c->retstack_ix; |
|
|
314 | PL_retstack_max = c->retstack_max; |
|
|
315 | PL_curcop = c->curcop; |
|
|
316 | PL_top_env = c->top_env; |
|
|
317 | |
|
|
318 | if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); |
|
|
319 | if (c->defsv) REPLACE_SV (DEFSV , c->defsv); |
|
|
320 | if (c->errsv) REPLACE_SV (ERRSV , c->errsv); |
|
|
321 | |
|
|
322 | { |
|
|
323 | dSP; |
|
|
324 | CV *cv; |
|
|
325 | |
|
|
326 | /* now do the ugly restore mess */ |
|
|
327 | while ((cv = (CV *)POPs)) |
|
|
328 | { |
|
|
329 | AV *padlist = (AV *)POPs; |
|
|
330 | |
|
|
331 | if (padlist) |
|
|
332 | { |
|
|
333 | put_padlist (cv); /* mark this padlist as available */ |
|
|
334 | CvPADLIST(cv) = padlist; |
|
|
335 | #ifdef USE_THREADS |
|
|
336 | /*CvOWNER(cv) = (struct perl_thread *)POPs;*/ |
|
|
337 | #endif |
|
|
338 | } |
|
|
339 | |
|
|
340 | ++CvDEPTH(cv); |
|
|
341 | } |
|
|
342 | |
|
|
343 | PUTBACK; |
|
|
344 | } |
|
|
345 | } |
|
|
346 | |
|
|
347 | static void |
|
|
348 | save_state(pTHX_ Coro__State c, int flags) |
|
|
349 | { |
|
|
350 | { |
|
|
351 | dSP; |
|
|
352 | I32 cxix = cxstack_ix; |
|
|
353 | PERL_CONTEXT *ccstk = cxstack; |
|
|
354 | PERL_SI *top_si = PL_curstackinfo; |
|
|
355 | |
|
|
356 | /* |
|
|
357 | * the worst thing you can imagine happens first - we have to save |
|
|
358 | * (and reinitialize) all cv's in the whole callchain :( |
|
|
359 | */ |
|
|
360 | |
|
|
361 | PUSHs (Nullsv); |
|
|
362 | /* this loop was inspired by pp_caller */ |
|
|
363 | for (;;) |
|
|
364 | { |
|
|
365 | while (cxix >= 0) |
|
|
366 | { |
|
|
367 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
|
|
368 | |
|
|
369 | if (CxTYPE(cx) == CXt_SUB) |
|
|
370 | { |
|
|
371 | CV *cv = cx->blk_sub.cv; |
|
|
372 | if (CvDEPTH(cv)) |
|
|
373 | { |
|
|
374 | #ifdef USE_THREADS |
|
|
375 | /*XPUSHs ((SV *)CvOWNER(cv));*/ |
|
|
376 | /*CvOWNER(cv) = 0;*/ |
|
|
377 | /*error must unlock this cv etc.. etc...*/ |
|
|
378 | #endif |
|
|
379 | EXTEND (SP, CvDEPTH(cv)*2); |
|
|
380 | |
|
|
381 | while (--CvDEPTH(cv)) |
|
|
382 | { |
|
|
383 | /* this tells the restore code to increment CvDEPTH */ |
|
|
384 | PUSHs (Nullsv); |
|
|
385 | PUSHs ((SV *)cv); |
|
|
386 | } |
|
|
387 | |
|
|
388 | PUSHs ((SV *)CvPADLIST(cv)); |
|
|
389 | PUSHs ((SV *)cv); |
|
|
390 | |
|
|
391 | get_padlist (cv); /* this is a monster */ |
|
|
392 | } |
|
|
393 | } |
|
|
394 | else if (CxTYPE(cx) == CXt_FORMAT) |
|
|
395 | { |
|
|
396 | /* I never used formats, so how should I know how these are implemented? */ |
|
|
397 | /* my bold guess is as a simple, plain sub... */ |
|
|
398 | croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); |
|
|
399 | } |
|
|
400 | } |
|
|
401 | |
|
|
402 | if (top_si->si_type == PERLSI_MAIN) |
|
|
403 | break; |
|
|
404 | |
|
|
405 | top_si = top_si->si_prev; |
|
|
406 | ccstk = top_si->si_cxstack; |
|
|
407 | cxix = top_si->si_cxix; |
|
|
408 | } |
|
|
409 | |
|
|
410 | PUTBACK; |
|
|
411 | } |
|
|
412 | |
|
|
413 | c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
|
|
414 | c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
|
|
415 | c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
|
|
416 | |
|
|
417 | c->dowarn = PL_dowarn; |
|
|
418 | c->in_eval = PL_in_eval; |
|
|
419 | |
|
|
420 | c->curstackinfo = PL_curstackinfo; |
|
|
421 | c->curstack = PL_curstack; |
|
|
422 | c->mainstack = PL_mainstack; |
|
|
423 | c->stack_sp = PL_stack_sp; |
|
|
424 | c->op = PL_op; |
|
|
425 | c->curpad = PL_curpad; |
|
|
426 | c->comppad = PL_comppad; |
|
|
427 | c->stack_base = PL_stack_base; |
|
|
428 | c->stack_max = PL_stack_max; |
|
|
429 | c->tmps_stack = PL_tmps_stack; |
|
|
430 | c->tmps_floor = PL_tmps_floor; |
|
|
431 | c->tmps_ix = PL_tmps_ix; |
|
|
432 | c->tmps_max = PL_tmps_max; |
|
|
433 | c->markstack = PL_markstack; |
|
|
434 | c->markstack_ptr = PL_markstack_ptr; |
|
|
435 | c->markstack_max = PL_markstack_max; |
|
|
436 | c->scopestack = PL_scopestack; |
|
|
437 | c->scopestack_ix = PL_scopestack_ix; |
|
|
438 | c->scopestack_max = PL_scopestack_max; |
|
|
439 | c->savestack = PL_savestack; |
|
|
440 | c->savestack_ix = PL_savestack_ix; |
|
|
441 | c->savestack_max = PL_savestack_max; |
|
|
442 | c->retstack = PL_retstack; |
|
|
443 | c->retstack_ix = PL_retstack_ix; |
|
|
444 | c->retstack_max = PL_retstack_max; |
|
|
445 | c->curcop = PL_curcop; |
|
|
446 | c->top_env = PL_top_env; |
|
|
447 | } |
|
|
448 | |
|
|
449 | /* |
|
|
450 | * allocate various perl stacks. This is an exact copy |
|
|
451 | * of perl.c:init_stacks, except that it uses less memory |
|
|
452 | * on the assumption that coroutines do not usually need |
|
|
453 | * a lot of stackspace. |
|
|
454 | */ |
|
|
455 | STATIC void |
|
|
456 | coro_init_stacks (pTHX) |
|
|
457 | { |
|
|
458 | PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); |
|
|
459 | PL_curstackinfo->si_type = PERLSI_MAIN; |
|
|
460 | PL_curstack = PL_curstackinfo->si_stack; |
|
|
461 | PL_mainstack = PL_curstack; /* remember in case we switch stacks */ |
|
|
462 | |
|
|
463 | PL_stack_base = AvARRAY(PL_curstack); |
|
|
464 | PL_stack_sp = PL_stack_base; |
|
|
465 | PL_stack_max = PL_stack_base + AvMAX(PL_curstack); |
|
|
466 | |
|
|
467 | New(50,PL_tmps_stack,96,SV*); |
|
|
468 | PL_tmps_floor = -1; |
|
|
469 | PL_tmps_ix = -1; |
|
|
470 | PL_tmps_max = 96; |
|
|
471 | |
|
|
472 | New(54,PL_markstack,16,I32); |
|
|
473 | PL_markstack_ptr = PL_markstack; |
|
|
474 | PL_markstack_max = PL_markstack + 16; |
|
|
475 | |
|
|
476 | SET_MARK_OFFSET; |
|
|
477 | |
|
|
478 | New(54,PL_scopestack,16,I32); |
|
|
479 | PL_scopestack_ix = 0; |
|
|
480 | PL_scopestack_max = 16; |
|
|
481 | |
|
|
482 | New(54,PL_savestack,96,ANY); |
|
|
483 | PL_savestack_ix = 0; |
|
|
484 | PL_savestack_max = 96; |
|
|
485 | |
|
|
486 | New(54,PL_retstack,8,OP*); |
|
|
487 | PL_retstack_ix = 0; |
|
|
488 | PL_retstack_max = 8; |
|
|
489 | } |
|
|
490 | |
|
|
491 | /* |
|
|
492 | * destroy the stacks, the callchain etc... |
|
|
493 | * still there is a memleak of 128 bytes... |
|
|
494 | */ |
|
|
495 | STATIC void |
|
|
496 | destroy_stacks(pTHX) |
|
|
497 | { |
|
|
498 | if (!IN_DESTRUCT) |
|
|
499 | { |
|
|
500 | /* is this ugly, I ask? */ |
|
|
501 | while (PL_scopestack_ix) |
|
|
502 | LEAVE; |
|
|
503 | |
|
|
504 | /* sure it is, but more important: is it correct?? :/ */ |
|
|
505 | while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */ |
|
|
506 | FREETMPS; |
|
|
507 | } |
|
|
508 | |
|
|
509 | while (PL_curstackinfo->si_next) |
|
|
510 | PL_curstackinfo = PL_curstackinfo->si_next; |
|
|
511 | |
|
|
512 | while (PL_curstackinfo) |
|
|
513 | { |
|
|
514 | PERL_SI *p = PL_curstackinfo->si_prev; |
|
|
515 | |
|
|
516 | { |
|
|
517 | dSP; |
|
|
518 | SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); |
|
|
519 | PUTBACK; /* possibly superfluous */ |
|
|
520 | } |
|
|
521 | |
|
|
522 | if (!IN_DESTRUCT) |
|
|
523 | { |
|
|
524 | dounwind(-1); |
|
|
525 | SvREFCNT_dec(PL_curstackinfo->si_stack); |
|
|
526 | } |
|
|
527 | |
|
|
528 | Safefree(PL_curstackinfo->si_cxstack); |
|
|
529 | Safefree(PL_curstackinfo); |
|
|
530 | PL_curstackinfo = p; |
|
|
531 | } |
|
|
532 | |
|
|
533 | Safefree(PL_tmps_stack); |
|
|
534 | Safefree(PL_markstack); |
|
|
535 | Safefree(PL_scopestack); |
|
|
536 | Safefree(PL_savestack); |
|
|
537 | Safefree(PL_retstack); |
|
|
538 | } |
|
|
539 | |
|
|
540 | static void |
|
|
541 | allocate_stack (Coro__State ctx, int alloc) |
|
|
542 | { |
|
|
543 | coro_stack *stack; |
|
|
544 | |
|
|
545 | New (0, stack, 1, coro_stack); |
|
|
546 | |
|
|
547 | stack->refcnt = 1; |
|
|
548 | stack->usecnt = 1; |
|
|
549 | stack->gencnt = ctx->gencnt = 0; |
|
|
550 | if (alloc) |
|
|
551 | { |
|
|
552 | #if HAVE_MMAP |
|
|
553 | stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */ |
|
|
554 | stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
|
|
555 | if (stack->sptr == (void *)-1) |
|
|
556 | #endif |
|
|
557 | { |
|
|
558 | /*FIXME*//*D*//* reasonable stack size! */ |
|
|
559 | stack->ssize = -4096 * sizeof (long); |
|
|
560 | New (0, stack->sptr, 4096, long); |
|
|
561 | } |
|
|
562 | } |
|
|
563 | else |
|
|
564 | stack->sptr = 0; |
|
|
565 | |
|
|
566 | ctx->stack = stack; |
|
|
567 | } |
|
|
568 | |
|
|
569 | static void |
|
|
570 | deallocate_stack (Coro__State ctx) |
|
|
571 | { |
|
|
572 | coro_stack *stack = ctx->stack; |
|
|
573 | |
|
|
574 | ctx->stack = 0; |
|
|
575 | |
|
|
576 | if (stack) |
|
|
577 | { |
|
|
578 | if (!--stack->refcnt) |
|
|
579 | { |
|
|
580 | #ifdef HAVE_MMAP |
|
|
581 | if (stack->ssize > 0 && stack->sptr) |
|
|
582 | munmap (stack->sptr, stack->ssize); |
|
|
583 | else |
|
|
584 | #else |
|
|
585 | Safefree (stack->sptr); |
|
|
586 | #endif |
|
|
587 | Safefree (stack); |
|
|
588 | } |
|
|
589 | else if (ctx->gencnt == stack->gencnt) |
|
|
590 | --stack->usecnt; |
|
|
591 | } |
|
|
592 | } |
|
|
593 | |
|
|
594 | static void |
|
|
595 | setup_coro (void *arg) |
|
|
596 | { |
|
|
597 | /* |
|
|
598 | * emulate part of the perl startup here. |
|
|
599 | */ |
|
|
600 | dSP; |
|
|
601 | Coro__State ctx = (Coro__State)arg; |
|
|
602 | SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE); |
|
|
603 | |
|
|
604 | coro_init_stacks (aTHX); |
|
|
605 | /*PL_curcop = 0;*/ |
|
|
606 | /*PL_in_eval = PL_in_eval;*/ /* inherit */ |
|
|
607 | SvREFCNT_dec (GvAV (PL_defgv)); |
|
|
608 | GvAV (PL_defgv) = ctx->args; |
|
|
609 | |
|
|
610 | SPAGAIN; |
|
|
611 | |
|
|
612 | if (ctx->stack) |
|
|
613 | { |
|
|
614 | ctx->cursp = 0; |
|
|
615 | |
|
|
616 | PUSHMARK(SP); |
|
|
617 | PUTBACK; |
|
|
618 | (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL); |
|
|
619 | |
|
|
620 | if (SvTRUE (ERRSV)) |
|
|
621 | croak (NULL); |
|
|
622 | else |
|
|
623 | croak ("FATAL: CCTXT coroutine returned!"); |
|
|
624 | } |
|
|
625 | else |
|
|
626 | { |
|
|
627 | UNOP myop; |
|
|
628 | |
|
|
629 | PL_op = (OP *)&myop; |
|
|
630 | |
|
|
631 | Zero(&myop, 1, UNOP); |
|
|
632 | myop.op_next = Nullop; |
|
|
633 | myop.op_flags = OPf_WANT_VOID; |
|
|
634 | |
|
|
635 | PUSHMARK(SP); |
|
|
636 | XPUSHs (sub_init); |
|
|
637 | /* |
|
|
638 | * the next line is slightly wrong, as PL_op->op_next |
|
|
639 | * is actually being executed so we skip the first op. |
|
|
640 | * that doesn't matter, though, since it is only |
|
|
641 | * pp_nextstate and we never return... |
|
|
642 | * ah yes, and I don't care anyways ;) |
|
|
643 | */ |
|
|
644 | PUTBACK; |
|
|
645 | PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
|
|
646 | SPAGAIN; |
|
|
647 | |
|
|
648 | ENTER; /* necessary e.g. for dounwind */ |
|
|
649 | } |
|
|
650 | } |
|
|
651 | |
|
|
652 | static void |
|
|
653 | continue_coro (void *arg) |
|
|
654 | { |
|
|
655 | /* |
|
|
656 | * this is a _very_ stripped down perl interpreter ;) |
|
|
657 | */ |
|
|
658 | Coro__State ctx = (Coro__State)arg; |
|
|
659 | JMPENV coro_start_env; |
|
|
660 | |
|
|
661 | /* same as JMPENV_BOOTSTRAP */ |
|
|
662 | Zero(&coro_start_env, 1, JMPENV); |
|
|
663 | coro_start_env.je_ret = -1; |
|
|
664 | coro_start_env.je_mustcatch = TRUE; |
|
|
665 | PL_top_env = &coro_start_env; |
|
|
666 | |
|
|
667 | ctx->cursp = 0; |
|
|
668 | PL_op = PL_op->op_next; |
|
|
669 | CALLRUNOPS(aTHX); |
|
|
670 | |
|
|
671 | abort (); |
|
|
672 | } |
|
|
673 | |
|
|
674 | STATIC void |
|
|
675 | transfer(pTHX_ struct coro *prev, struct coro *next, int flags) |
|
|
676 | { |
|
|
677 | dSTACKLEVEL; |
|
|
678 | static struct coro *xnext; |
|
|
679 | |
|
|
680 | if (prev != next) |
|
|
681 | { |
|
|
682 | xnext = next; |
|
|
683 | |
|
|
684 | if (next->mainstack) |
|
|
685 | { |
|
|
686 | SAVE (prev, flags); |
|
|
687 | LOAD (next); |
|
|
688 | |
|
|
689 | /* mark this state as in-use */ |
|
|
690 | next->mainstack = 0; |
|
|
691 | next->tmps_ix = -2; |
|
|
692 | |
|
|
693 | /* stacklevel changed? if yes, grab the stack for us! */ |
|
|
694 | if (flags & TRANSFER_SAVE_CCTXT) |
|
|
695 | { |
|
|
696 | if (!prev->stack) |
|
|
697 | allocate_stack (prev, 0); |
|
|
698 | else if (prev->cursp != stacklevel |
|
|
699 | && prev->stack->usecnt > 1) |
|
|
700 | { |
|
|
701 | prev->gencnt = ++prev->stack->gencnt; |
|
|
702 | prev->stack->usecnt = 1; |
|
|
703 | } |
|
|
704 | |
|
|
705 | /* has our stack been invalidated? */ |
|
|
706 | if (next->stack && next->stack->gencnt != next->gencnt) |
|
|
707 | { |
|
|
708 | deallocate_stack (next); |
|
|
709 | allocate_stack (next, 1); |
|
|
710 | coro_create (&(next->stack->cctx), |
|
|
711 | continue_coro, (void *)next, |
|
|
712 | next->stack->sptr, labs (next->stack->ssize)); |
|
|
713 | } |
|
|
714 | |
|
|
715 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
|
|
716 | /* don't add any code here */ |
|
|
717 | } |
|
|
718 | |
|
|
719 | } |
|
|
720 | else if (next->tmps_ix == -2) |
|
|
721 | croak ("tried to transfer to running coroutine"); |
|
|
722 | else |
|
|
723 | { |
|
|
724 | SAVE (prev, -1); /* first get rid of the old state */ |
|
|
725 | |
|
|
726 | if (flags & TRANSFER_SAVE_CCTXT) |
|
|
727 | { |
|
|
728 | if (!prev->stack) |
|
|
729 | allocate_stack (prev, 0); |
|
|
730 | |
|
|
731 | if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK) |
|
|
732 | { |
|
|
733 | setup_coro (next); |
|
|
734 | |
|
|
735 | prev->stack->refcnt++; |
|
|
736 | prev->stack->usecnt++; |
|
|
737 | next->stack = prev->stack; |
|
|
738 | next->gencnt = prev->gencnt; |
|
|
739 | } |
|
|
740 | else |
|
|
741 | { |
|
|
742 | allocate_stack (next, 1); |
|
|
743 | coro_create (&(next->stack->cctx), |
|
|
744 | setup_coro, (void *)next, |
|
|
745 | next->stack->sptr, labs (next->stack->ssize)); |
|
|
746 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
|
|
747 | /* don't add any code here */ |
|
|
748 | } |
|
|
749 | } |
|
|
750 | else |
|
|
751 | setup_coro (next); |
|
|
752 | } |
|
|
753 | |
|
|
754 | /* |
|
|
755 | * xnext is now either prev or next, depending on wether |
|
|
756 | * we switched the c stack or not. that's why I use a global |
|
|
757 | * variable, that should become thread-specific at one point. |
|
|
758 | */ |
|
|
759 | xnext->cursp = stacklevel; |
|
|
760 | } |
|
|
761 | |
|
|
762 | if (coro_mortal) |
|
|
763 | { |
|
|
764 | SvREFCNT_dec (coro_mortal); |
|
|
765 | coro_mortal = 0; |
|
|
766 | } |
|
|
767 | } |
|
|
768 | |
|
|
769 | #define SV_CORO(sv,func) \ |
|
|
770 | do { \ |
|
|
771 | if (SvROK (sv)) \ |
|
|
772 | sv = SvRV (sv); \ |
|
|
773 | \ |
|
|
774 | if (SvTYPE(sv) == SVt_PVHV) \ |
|
|
775 | { \ |
|
|
776 | HE *he = hv_fetch_ent((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \ |
|
|
777 | \ |
|
|
778 | if (!he) \ |
|
|
779 | croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \ |
|
|
780 | \ |
|
|
781 | (sv) = SvRV (HeVAL(he)); \ |
|
|
782 | } \ |
|
|
783 | \ |
|
|
784 | /* must also be changed inside Coro::Cont::yield */ \ |
|
|
785 | if (!SvOBJECT(sv) || SvSTASH(sv) != coro_state_stash) \ |
|
|
786 | croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \ |
|
|
787 | \ |
|
|
788 | } while(0) |
|
|
789 | |
|
|
790 | #define SvSTATE(sv) (struct coro *)SvIV (sv) |
|
|
791 | |
|
|
792 | static void |
|
|
793 | api_transfer(pTHX_ SV *prev, SV *next, int flags) |
|
|
794 | { |
|
|
795 | SV_CORO (prev, "Coro::transfer"); |
|
|
796 | SV_CORO (next, "Coro::transfer"); |
|
|
797 | |
|
|
798 | transfer(aTHX_ SvSTATE(prev), SvSTATE(next), flags); |
|
|
799 | } |
|
|
800 | |
245 | |
801 | /** Coro ********************************************************************/ |
246 | /** Coro ********************************************************************/ |
802 | |
247 | |
803 | #define PRIO_MAX 3 |
248 | #define PRIO_MAX 3 |
804 | #define PRIO_HIGH 1 |
249 | #define PRIO_HIGH 1 |
… | |
… | |
806 | #define PRIO_LOW -1 |
251 | #define PRIO_LOW -1 |
807 | #define PRIO_IDLE -3 |
252 | #define PRIO_IDLE -3 |
808 | #define PRIO_MIN -4 |
253 | #define PRIO_MIN -4 |
809 | |
254 | |
810 | /* for Coro.pm */ |
255 | /* for Coro.pm */ |
811 | static GV *coro_current, *coro_idle; |
256 | static SV *coro_current; |
812 | static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; |
257 | static AV *coro_ready [PRIO_MAX-PRIO_MIN+1]; |
813 | static int coro_nready; |
258 | static int coro_nready; |
|
|
259 | static struct coro *coro_first; |
814 | |
260 | |
815 | static void |
261 | /** lowlevel stuff **********************************************************/ |
816 | coro_enq (SV *sv) |
|
|
817 | { |
|
|
818 | if (SvTYPE (sv) == SVt_PVHV) |
|
|
819 | { |
|
|
820 | SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0); |
|
|
821 | int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL; |
|
|
822 | |
|
|
823 | prio = prio > PRIO_MAX ? PRIO_MAX |
|
|
824 | : prio < PRIO_MIN ? PRIO_MIN |
|
|
825 | : prio; |
|
|
826 | |
|
|
827 | av_push (coro_ready [prio - PRIO_MIN], sv); |
|
|
828 | coro_nready++; |
|
|
829 | |
|
|
830 | return; |
|
|
831 | } |
|
|
832 | |
|
|
833 | croak ("Coro::ready tried to enqueue something that is not a coroutine"); |
|
|
834 | } |
|
|
835 | |
262 | |
836 | static SV * |
263 | static SV * |
|
|
264 | coro_get_sv (pTHX_ const char *name, int create) |
|
|
265 | { |
|
|
266 | #if PERL_VERSION_ATLEAST (5,9,0) |
|
|
267 | /* silence stupid and wrong 5.10 warning that I am unable to switch off */ |
|
|
268 | get_sv (name, create); |
|
|
269 | #endif |
|
|
270 | return get_sv (name, create); |
|
|
271 | } |
|
|
272 | |
|
|
273 | static AV * |
|
|
274 | coro_get_av (pTHX_ const char *name, int create) |
|
|
275 | { |
|
|
276 | #if PERL_VERSION_ATLEAST (5,9,0) |
|
|
277 | /* silence stupid and wrong 5.10 warning that I am unable to switch off */ |
|
|
278 | get_av (name, create); |
|
|
279 | #endif |
|
|
280 | return get_av (name, create); |
|
|
281 | } |
|
|
282 | |
|
|
283 | static HV * |
|
|
284 | coro_get_hv (pTHX_ const char *name, int create) |
|
|
285 | { |
|
|
286 | #if PERL_VERSION_ATLEAST (5,9,0) |
|
|
287 | /* silence stupid and wrong 5.10 warning that I am unable to switch off */ |
|
|
288 | get_hv (name, create); |
|
|
289 | #endif |
|
|
290 | return get_hv (name, create); |
|
|
291 | } |
|
|
292 | |
|
|
293 | static AV * |
|
|
294 | coro_clone_padlist (pTHX_ CV *cv) |
|
|
295 | { |
|
|
296 | AV *padlist = CvPADLIST (cv); |
|
|
297 | AV *newpadlist, *newpad; |
|
|
298 | |
|
|
299 | newpadlist = newAV (); |
|
|
300 | AvREAL_off (newpadlist); |
|
|
301 | #if PERL_VERSION_ATLEAST (5,9,0) |
|
|
302 | Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1); |
|
|
303 | #else |
|
|
304 | Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1); |
|
|
305 | #endif |
|
|
306 | newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)]; |
|
|
307 | --AvFILLp (padlist); |
|
|
308 | |
|
|
309 | av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE))); |
|
|
310 | av_store (newpadlist, 1, (SV *)newpad); |
|
|
311 | |
|
|
312 | return newpadlist; |
|
|
313 | } |
|
|
314 | |
|
|
315 | static void |
|
|
316 | free_padlist (pTHX_ AV *padlist) |
|
|
317 | { |
|
|
318 | /* may be during global destruction */ |
|
|
319 | if (SvREFCNT (padlist)) |
|
|
320 | { |
|
|
321 | I32 i = AvFILLp (padlist); |
|
|
322 | while (i >= 0) |
|
|
323 | { |
|
|
324 | SV **svp = av_fetch (padlist, i--, FALSE); |
|
|
325 | if (svp) |
|
|
326 | { |
|
|
327 | SV *sv; |
|
|
328 | while (&PL_sv_undef != (sv = av_pop ((AV *)*svp))) |
|
|
329 | SvREFCNT_dec (sv); |
|
|
330 | |
|
|
331 | SvREFCNT_dec (*svp); |
|
|
332 | } |
|
|
333 | } |
|
|
334 | |
|
|
335 | SvREFCNT_dec ((SV*)padlist); |
|
|
336 | } |
|
|
337 | } |
|
|
338 | |
|
|
339 | static int |
|
|
340 | coro_cv_free (pTHX_ SV *sv, MAGIC *mg) |
|
|
341 | { |
|
|
342 | AV *padlist; |
|
|
343 | AV *av = (AV *)mg->mg_obj; |
|
|
344 | |
|
|
345 | /* casting is fun. */ |
|
|
346 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
|
|
347 | free_padlist (aTHX_ padlist); |
|
|
348 | |
|
|
349 | return 0; |
|
|
350 | } |
|
|
351 | |
|
|
352 | #define CORO_MAGIC_type_cv PERL_MAGIC_ext |
|
|
353 | #define CORO_MAGIC_type_state PERL_MAGIC_ext |
|
|
354 | |
|
|
355 | static MGVTBL coro_cv_vtbl = { |
|
|
356 | 0, 0, 0, 0, |
|
|
357 | coro_cv_free |
|
|
358 | }; |
|
|
359 | |
|
|
360 | #define CORO_MAGIC(sv,type) \ |
|
|
361 | SvMAGIC (sv) \ |
|
|
362 | ? SvMAGIC (sv)->mg_type == type \ |
|
|
363 | ? SvMAGIC (sv) \ |
|
|
364 | : mg_find (sv, type) \ |
|
|
365 | : 0 |
|
|
366 | |
|
|
367 | #define CORO_MAGIC_cv(cv) CORO_MAGIC (((SV *)(cv)), CORO_MAGIC_type_cv) |
|
|
368 | #define CORO_MAGIC_state(sv) CORO_MAGIC (((SV *)(sv)), CORO_MAGIC_type_state) |
|
|
369 | |
|
|
370 | static struct coro * |
|
|
371 | SvSTATE_ (pTHX_ SV *coro) |
|
|
372 | { |
|
|
373 | HV *stash; |
|
|
374 | MAGIC *mg; |
|
|
375 | |
|
|
376 | if (SvROK (coro)) |
|
|
377 | coro = SvRV (coro); |
|
|
378 | |
|
|
379 | if (expect_false (SvTYPE (coro) != SVt_PVHV)) |
|
|
380 | croak ("Coro::State object required"); |
|
|
381 | |
|
|
382 | stash = SvSTASH (coro); |
|
|
383 | if (expect_false (stash != coro_stash && stash != coro_state_stash)) |
|
|
384 | { |
|
|
385 | /* very slow, but rare, check */ |
|
|
386 | if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State")) |
|
|
387 | croak ("Coro::State object required"); |
|
|
388 | } |
|
|
389 | |
|
|
390 | mg = CORO_MAGIC_state (coro); |
|
|
391 | return (struct coro *)mg->mg_ptr; |
|
|
392 | } |
|
|
393 | |
|
|
394 | #define SvSTATE(sv) SvSTATE_ (aTHX_ (sv)) |
|
|
395 | |
|
|
396 | /* the next two functions merely cache the padlists */ |
|
|
397 | static void |
|
|
398 | get_padlist (pTHX_ CV *cv) |
|
|
399 | { |
|
|
400 | MAGIC *mg = CORO_MAGIC_cv (cv); |
|
|
401 | AV *av; |
|
|
402 | |
|
|
403 | if (expect_true (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0)) |
|
|
404 | CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--]; |
|
|
405 | else |
|
|
406 | { |
|
|
407 | #if CORO_PREFER_PERL_FUNCTIONS |
|
|
408 | /* this is probably cleaner, but also slower? */ |
|
|
409 | CV *cp = Perl_cv_clone (cv); |
|
|
410 | CvPADLIST (cv) = CvPADLIST (cp); |
|
|
411 | CvPADLIST (cp) = 0; |
|
|
412 | SvREFCNT_dec (cp); |
|
|
413 | #else |
|
|
414 | CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv); |
|
|
415 | #endif |
|
|
416 | } |
|
|
417 | } |
|
|
418 | |
|
|
419 | static void |
|
|
420 | put_padlist (pTHX_ CV *cv) |
|
|
421 | { |
|
|
422 | MAGIC *mg = CORO_MAGIC_cv (cv); |
|
|
423 | AV *av; |
|
|
424 | |
|
|
425 | if (expect_false (!mg)) |
|
|
426 | mg = sv_magicext ((SV *)cv, (SV *)newAV (), CORO_MAGIC_type_cv, &coro_cv_vtbl, 0, 0); |
|
|
427 | |
|
|
428 | av = (AV *)mg->mg_obj; |
|
|
429 | |
|
|
430 | if (expect_false (AvFILLp (av) >= AvMAX (av))) |
|
|
431 | av_extend (av, AvMAX (av) + 1); |
|
|
432 | |
|
|
433 | AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv); |
|
|
434 | } |
|
|
435 | |
|
|
436 | /** load & save, init *******************************************************/ |
|
|
437 | |
|
|
438 | static void |
|
|
439 | load_perl (pTHX_ Coro__State c) |
|
|
440 | { |
|
|
441 | perl_slots *slot = c->slot; |
|
|
442 | c->slot = 0; |
|
|
443 | |
|
|
444 | PL_mainstack = c->mainstack; |
|
|
445 | |
|
|
446 | GvSV (PL_defgv) = slot->defsv; |
|
|
447 | GvAV (PL_defgv) = slot->defav; |
|
|
448 | GvSV (PL_errgv) = slot->errsv; |
|
|
449 | GvSV (irsgv) = slot->irsgv; |
|
|
450 | |
|
|
451 | #define VAR(name,type) PL_ ## name = slot->name; |
|
|
452 | # include "state.h" |
|
|
453 | #undef VAR |
|
|
454 | |
|
|
455 | { |
|
|
456 | dSP; |
|
|
457 | |
|
|
458 | CV *cv; |
|
|
459 | |
|
|
460 | /* now do the ugly restore mess */ |
|
|
461 | while (expect_true (cv = (CV *)POPs)) |
|
|
462 | { |
|
|
463 | put_padlist (aTHX_ cv); /* mark this padlist as available */ |
|
|
464 | CvDEPTH (cv) = PTR2IV (POPs); |
|
|
465 | CvPADLIST (cv) = (AV *)POPs; |
|
|
466 | } |
|
|
467 | |
|
|
468 | PUTBACK; |
|
|
469 | } |
|
|
470 | } |
|
|
471 | |
|
|
472 | static void |
|
|
473 | save_perl (pTHX_ Coro__State c) |
|
|
474 | { |
|
|
475 | { |
|
|
476 | dSP; |
|
|
477 | I32 cxix = cxstack_ix; |
|
|
478 | PERL_CONTEXT *ccstk = cxstack; |
|
|
479 | PERL_SI *top_si = PL_curstackinfo; |
|
|
480 | |
|
|
481 | /* |
|
|
482 | * the worst thing you can imagine happens first - we have to save |
|
|
483 | * (and reinitialize) all cv's in the whole callchain :( |
|
|
484 | */ |
|
|
485 | |
|
|
486 | XPUSHs (Nullsv); |
|
|
487 | /* this loop was inspired by pp_caller */ |
|
|
488 | for (;;) |
|
|
489 | { |
|
|
490 | while (expect_true (cxix >= 0)) |
|
|
491 | { |
|
|
492 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
|
|
493 | |
|
|
494 | if (expect_true (CxTYPE (cx) == CXt_SUB || CxTYPE (cx) == CXt_FORMAT)) |
|
|
495 | { |
|
|
496 | CV *cv = cx->blk_sub.cv; |
|
|
497 | |
|
|
498 | if (expect_true (CvDEPTH (cv))) |
|
|
499 | { |
|
|
500 | EXTEND (SP, 3); |
|
|
501 | PUSHs ((SV *)CvPADLIST (cv)); |
|
|
502 | PUSHs (INT2PTR (SV *, CvDEPTH (cv))); |
|
|
503 | PUSHs ((SV *)cv); |
|
|
504 | |
|
|
505 | CvDEPTH (cv) = 0; |
|
|
506 | get_padlist (aTHX_ cv); |
|
|
507 | } |
|
|
508 | } |
|
|
509 | } |
|
|
510 | |
|
|
511 | if (expect_true (top_si->si_type == PERLSI_MAIN)) |
|
|
512 | break; |
|
|
513 | |
|
|
514 | top_si = top_si->si_prev; |
|
|
515 | ccstk = top_si->si_cxstack; |
|
|
516 | cxix = top_si->si_cxix; |
|
|
517 | } |
|
|
518 | |
|
|
519 | PUTBACK; |
|
|
520 | } |
|
|
521 | |
|
|
522 | /* allocate some space on the context stack for our purposes */ |
|
|
523 | /* we manually unroll here, as usually 2 slots is enough */ |
|
|
524 | if (SLOT_COUNT >= 1) CXINC; |
|
|
525 | if (SLOT_COUNT >= 2) CXINC; |
|
|
526 | if (SLOT_COUNT >= 3) CXINC; |
|
|
527 | { |
|
|
528 | int i; |
|
|
529 | for (i = 3; i < SLOT_COUNT; ++i) |
|
|
530 | CXINC; |
|
|
531 | } |
|
|
532 | cxstack_ix -= SLOT_COUNT; /* undo allocation */ |
|
|
533 | |
|
|
534 | c->mainstack = PL_mainstack; |
|
|
535 | |
|
|
536 | { |
|
|
537 | perl_slots *slot = c->slot = (perl_slots *)(cxstack + cxstack_ix + 1); |
|
|
538 | |
|
|
539 | slot->defav = GvAV (PL_defgv); |
|
|
540 | slot->defsv = DEFSV; |
|
|
541 | slot->errsv = ERRSV; |
|
|
542 | slot->irsgv = GvSV (irsgv); |
|
|
543 | |
|
|
544 | #define VAR(name,type) slot->name = PL_ ## name; |
|
|
545 | # include "state.h" |
|
|
546 | #undef VAR |
|
|
547 | } |
|
|
548 | } |
|
|
549 | |
|
|
550 | /* |
|
|
551 | * allocate various perl stacks. This is an exact copy |
|
|
552 | * of perl.c:init_stacks, except that it uses less memory |
|
|
553 | * on the (sometimes correct) assumption that coroutines do |
|
|
554 | * not usually need a lot of stackspace. |
|
|
555 | */ |
|
|
556 | #if CORO_PREFER_PERL_FUNCTIONS |
|
|
557 | # define coro_init_stacks init_stacks |
|
|
558 | #else |
|
|
559 | static void |
|
|
560 | coro_init_stacks (pTHX) |
|
|
561 | { |
|
|
562 | PL_curstackinfo = new_stackinfo(32, 8); |
|
|
563 | PL_curstackinfo->si_type = PERLSI_MAIN; |
|
|
564 | PL_curstack = PL_curstackinfo->si_stack; |
|
|
565 | PL_mainstack = PL_curstack; /* remember in case we switch stacks */ |
|
|
566 | |
|
|
567 | PL_stack_base = AvARRAY(PL_curstack); |
|
|
568 | PL_stack_sp = PL_stack_base; |
|
|
569 | PL_stack_max = PL_stack_base + AvMAX(PL_curstack); |
|
|
570 | |
|
|
571 | New(50,PL_tmps_stack,32,SV*); |
|
|
572 | PL_tmps_floor = -1; |
|
|
573 | PL_tmps_ix = -1; |
|
|
574 | PL_tmps_max = 32; |
|
|
575 | |
|
|
576 | New(54,PL_markstack,16,I32); |
|
|
577 | PL_markstack_ptr = PL_markstack; |
|
|
578 | PL_markstack_max = PL_markstack + 16; |
|
|
579 | |
|
|
580 | #ifdef SET_MARK_OFFSET |
|
|
581 | SET_MARK_OFFSET; |
|
|
582 | #endif |
|
|
583 | |
|
|
584 | New(54,PL_scopestack,8,I32); |
|
|
585 | PL_scopestack_ix = 0; |
|
|
586 | PL_scopestack_max = 8; |
|
|
587 | |
|
|
588 | New(54,PL_savestack,24,ANY); |
|
|
589 | PL_savestack_ix = 0; |
|
|
590 | PL_savestack_max = 24; |
|
|
591 | |
|
|
592 | #if !PERL_VERSION_ATLEAST (5,9,0) |
|
|
593 | New(54,PL_retstack,4,OP*); |
|
|
594 | PL_retstack_ix = 0; |
|
|
595 | PL_retstack_max = 4; |
|
|
596 | #endif |
|
|
597 | } |
|
|
598 | #endif |
|
|
599 | |
|
|
600 | /* |
|
|
601 | * destroy the stacks, the callchain etc... |
|
|
602 | */ |
|
|
603 | static void |
|
|
604 | coro_destroy_stacks (pTHX) |
|
|
605 | { |
|
|
606 | while (PL_curstackinfo->si_next) |
|
|
607 | PL_curstackinfo = PL_curstackinfo->si_next; |
|
|
608 | |
|
|
609 | while (PL_curstackinfo) |
|
|
610 | { |
|
|
611 | PERL_SI *p = PL_curstackinfo->si_prev; |
|
|
612 | |
|
|
613 | if (!IN_DESTRUCT) |
|
|
614 | SvREFCNT_dec (PL_curstackinfo->si_stack); |
|
|
615 | |
|
|
616 | Safefree (PL_curstackinfo->si_cxstack); |
|
|
617 | Safefree (PL_curstackinfo); |
|
|
618 | PL_curstackinfo = p; |
|
|
619 | } |
|
|
620 | |
|
|
621 | Safefree (PL_tmps_stack); |
|
|
622 | Safefree (PL_markstack); |
|
|
623 | Safefree (PL_scopestack); |
|
|
624 | Safefree (PL_savestack); |
|
|
625 | #if !PERL_VERSION_ATLEAST (5,9,0) |
|
|
626 | Safefree (PL_retstack); |
|
|
627 | #endif |
|
|
628 | } |
|
|
629 | |
|
|
630 | static size_t |
|
|
631 | coro_rss (pTHX_ struct coro *coro) |
|
|
632 | { |
|
|
633 | size_t rss = sizeof (*coro); |
|
|
634 | |
|
|
635 | if (coro->mainstack) |
|
|
636 | { |
|
|
637 | perl_slots tmp_slot; |
|
|
638 | perl_slots *slot; |
|
|
639 | |
|
|
640 | if (coro->flags & CF_RUNNING) |
|
|
641 | { |
|
|
642 | slot = &tmp_slot; |
|
|
643 | |
|
|
644 | #define VAR(name,type) slot->name = PL_ ## name; |
|
|
645 | # include "state.h" |
|
|
646 | #undef VAR |
|
|
647 | } |
|
|
648 | else |
|
|
649 | slot = coro->slot; |
|
|
650 | |
|
|
651 | rss += sizeof (slot->curstackinfo); |
|
|
652 | rss += (slot->curstackinfo->si_cxmax + 1) * sizeof (PERL_CONTEXT); |
|
|
653 | rss += sizeof (SV) + sizeof (struct xpvav) + (1 + AvMAX (slot->curstack)) * sizeof (SV *); |
|
|
654 | rss += slot->tmps_max * sizeof (SV *); |
|
|
655 | rss += (slot->markstack_max - slot->markstack_ptr) * sizeof (I32); |
|
|
656 | rss += slot->scopestack_max * sizeof (I32); |
|
|
657 | rss += slot->savestack_max * sizeof (ANY); |
|
|
658 | |
|
|
659 | #if !PERL_VERSION_ATLEAST (5,9,0) |
|
|
660 | rss += slot->retstack_max * sizeof (OP *); |
|
|
661 | #endif |
|
|
662 | } |
|
|
663 | |
|
|
664 | return rss; |
|
|
665 | } |
|
|
666 | |
|
|
667 | /** coroutine stack handling ************************************************/ |
|
|
668 | |
|
|
669 | #if 0 |
|
|
670 | static int (*orig_sigelem_get) (pTHX_ SV *sv, MAGIC *mg); |
|
|
671 | |
|
|
672 | /* |
|
|
673 | * This overrides the default magic get method of %SIG elements. |
|
|
674 | * The original one doesn't provide for reading back of PL_diehook/PL_warnhook |
|
|
675 | * and instead of tryign to save and restore the hash elements, we just provide |
|
|
676 | * readback here. |
|
|
677 | * We only do this when the hook is != 0, as they are often set to 0 temporarily, |
|
|
678 | * not expecting this to actually change the hook. This is a potential problem |
|
|
679 | * when a schedule happens then, but we ignore this. |
|
|
680 | */ |
|
|
681 | static int |
|
|
682 | coro_sigelem_get (pTHX_ SV *sv, MAGIC *mg) |
|
|
683 | { |
|
|
684 | return orig_sigelem_get (aTHX_ sv, mg); |
|
|
685 | const char *s = MgPV_nolen_const (mg); |
|
|
686 | |
|
|
687 | if (*s == '_') |
|
|
688 | { |
|
|
689 | if (strEQ (s, "__DIE__" ) && PL_diehook ) return sv_setsv (sv, PL_diehook ), 0; |
|
|
690 | if (strEQ (s, "__WARN__") && PL_warnhook) return sv_setsv (sv, PL_warnhook), 0; |
|
|
691 | } |
|
|
692 | |
|
|
693 | return orig_sigelem_get (aTHX_ sv, mg); |
|
|
694 | } |
|
|
695 | #endif |
|
|
696 | |
|
|
697 | static void |
|
|
698 | coro_setup (pTHX_ struct coro *coro) |
|
|
699 | { |
|
|
700 | /* |
|
|
701 | * emulate part of the perl startup here. |
|
|
702 | */ |
|
|
703 | coro_init_stacks (aTHX); |
|
|
704 | |
|
|
705 | PL_runops = RUNOPS_DEFAULT; |
|
|
706 | PL_curcop = &PL_compiling; |
|
|
707 | PL_in_eval = EVAL_NULL; |
|
|
708 | PL_comppad = 0; |
|
|
709 | PL_curpm = 0; |
|
|
710 | PL_curpad = 0; |
|
|
711 | PL_localizing = 0; |
|
|
712 | PL_dirty = 0; |
|
|
713 | PL_restartop = 0; |
|
|
714 | |
|
|
715 | /* recreate the die/warn hooks */ |
|
|
716 | PL_diehook = 0; |
|
|
717 | hv_store (hv_sig, "__DIE__", sizeof ("__DIE__") - 1, newSV (0), 0); |
|
|
718 | PL_diehook = SvREFCNT_inc (rv_diehook); |
|
|
719 | |
|
|
720 | PL_warnhook = 0; |
|
|
721 | hv_store (hv_sig, "__WARN__", sizeof ("__WARN__") - 1, newSV (0), 0); |
|
|
722 | PL_warnhook = SvREFCNT_inc (rv_warnhook); |
|
|
723 | |
|
|
724 | GvSV (PL_defgv) = newSV (0); |
|
|
725 | GvAV (PL_defgv) = coro->args; coro->args = 0; |
|
|
726 | GvSV (PL_errgv) = newSV (0); |
|
|
727 | GvSV (irsgv) = newSVpvn ("\n", 1); sv_magic (GvSV (irsgv), (SV *)irsgv, PERL_MAGIC_sv, "/", 0); |
|
|
728 | PL_rs = newSVsv (GvSV (irsgv)); |
|
|
729 | PL_defoutgv = (GV *)SvREFCNT_inc (stdoutgv); |
|
|
730 | |
|
|
731 | { |
|
|
732 | dSP; |
|
|
733 | LOGOP myop; |
|
|
734 | |
|
|
735 | Zero (&myop, 1, LOGOP); |
|
|
736 | myop.op_next = Nullop; |
|
|
737 | myop.op_flags = OPf_WANT_VOID; |
|
|
738 | |
|
|
739 | PUSHMARK (SP); |
|
|
740 | XPUSHs (sv_2mortal (av_shift (GvAV (PL_defgv)))); |
|
|
741 | PUTBACK; |
|
|
742 | PL_op = (OP *)&myop; |
|
|
743 | PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
|
|
744 | SPAGAIN; |
|
|
745 | } |
|
|
746 | |
|
|
747 | /* this newly created coroutine might be run on an existing cctx which most |
|
|
748 | * likely was suspended in set_stacklevel, called from entersub. |
|
|
749 | * set_stacklevl doesn't do anything on return, but entersub does LEAVE, |
|
|
750 | * so we ENTER here for symmetry |
|
|
751 | */ |
|
|
752 | ENTER; |
|
|
753 | } |
|
|
754 | |
|
|
755 | static void |
|
|
756 | coro_destroy (pTHX_ struct coro *coro) |
|
|
757 | { |
|
|
758 | if (!IN_DESTRUCT) |
|
|
759 | { |
|
|
760 | /* restore all saved variables and stuff */ |
|
|
761 | LEAVE_SCOPE (0); |
|
|
762 | assert (PL_tmps_floor == -1); |
|
|
763 | |
|
|
764 | /* free all temporaries */ |
|
|
765 | FREETMPS; |
|
|
766 | assert (PL_tmps_ix == -1); |
|
|
767 | |
|
|
768 | /* unwind all extra stacks */ |
|
|
769 | POPSTACK_TO (PL_mainstack); |
|
|
770 | |
|
|
771 | /* unwind main stack */ |
|
|
772 | dounwind (-1); |
|
|
773 | } |
|
|
774 | |
|
|
775 | SvREFCNT_dec (GvSV (PL_defgv)); |
|
|
776 | SvREFCNT_dec (GvAV (PL_defgv)); |
|
|
777 | SvREFCNT_dec (GvSV (PL_errgv)); |
|
|
778 | SvREFCNT_dec (PL_defoutgv); |
|
|
779 | SvREFCNT_dec (PL_rs); |
|
|
780 | SvREFCNT_dec (GvSV (irsgv)); |
|
|
781 | |
|
|
782 | SvREFCNT_dec (PL_diehook); |
|
|
783 | SvREFCNT_dec (PL_warnhook); |
|
|
784 | |
|
|
785 | SvREFCNT_dec (coro->saved_deffh); |
|
|
786 | SvREFCNT_dec (coro->throw); |
|
|
787 | |
|
|
788 | coro_destroy_stacks (aTHX); |
|
|
789 | } |
|
|
790 | |
|
|
791 | static void |
|
|
792 | free_coro_mortal (pTHX) |
|
|
793 | { |
|
|
794 | if (expect_true (coro_mortal)) |
|
|
795 | { |
|
|
796 | SvREFCNT_dec (coro_mortal); |
|
|
797 | coro_mortal = 0; |
|
|
798 | } |
|
|
799 | } |
|
|
800 | |
|
|
801 | static int |
|
|
802 | runops_trace (pTHX) |
|
|
803 | { |
|
|
804 | COP *oldcop = 0; |
|
|
805 | int oldcxix = -2; |
|
|
806 | struct coro *coro = SvSTATE (coro_current); /* trace cctx is tied to specific coro */ |
|
|
807 | coro_cctx *cctx = coro->cctx; |
|
|
808 | |
|
|
809 | while ((PL_op = CALL_FPTR (PL_op->op_ppaddr) (aTHX))) |
|
|
810 | { |
|
|
811 | PERL_ASYNC_CHECK (); |
|
|
812 | |
|
|
813 | if (cctx->flags & CC_TRACE_ALL) |
|
|
814 | { |
|
|
815 | if (PL_op->op_type == OP_LEAVESUB && cctx->flags & CC_TRACE_SUB) |
|
|
816 | { |
|
|
817 | PERL_CONTEXT *cx = &cxstack[cxstack_ix]; |
|
|
818 | SV **bot, **top; |
|
|
819 | AV *av = newAV (); /* return values */ |
|
|
820 | SV **cb; |
|
|
821 | dSP; |
|
|
822 | |
|
|
823 | GV *gv = CvGV (cx->blk_sub.cv); |
|
|
824 | SV *fullname = sv_2mortal (newSV (0)); |
|
|
825 | if (isGV (gv)) |
|
|
826 | gv_efullname3 (fullname, gv, 0); |
|
|
827 | |
|
|
828 | bot = PL_stack_base + cx->blk_oldsp + 1; |
|
|
829 | top = cx->blk_gimme == G_ARRAY ? SP + 1 |
|
|
830 | : cx->blk_gimme == G_SCALAR ? bot + 1 |
|
|
831 | : bot; |
|
|
832 | |
|
|
833 | av_extend (av, top - bot); |
|
|
834 | while (bot < top) |
|
|
835 | av_push (av, SvREFCNT_inc (*bot++)); |
|
|
836 | |
|
|
837 | PL_runops = RUNOPS_DEFAULT; |
|
|
838 | ENTER; |
|
|
839 | SAVETMPS; |
|
|
840 | EXTEND (SP, 3); |
|
|
841 | PUSHMARK (SP); |
|
|
842 | PUSHs (&PL_sv_no); |
|
|
843 | PUSHs (fullname); |
|
|
844 | PUSHs (sv_2mortal (newRV_noinc ((SV *)av))); |
|
|
845 | PUTBACK; |
|
|
846 | cb = hv_fetch ((HV *)SvRV (coro_current), "_trace_sub_cb", sizeof ("_trace_sub_cb") - 1, 0); |
|
|
847 | if (cb) call_sv (*cb, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD); |
|
|
848 | SPAGAIN; |
|
|
849 | FREETMPS; |
|
|
850 | LEAVE; |
|
|
851 | PL_runops = runops_trace; |
|
|
852 | } |
|
|
853 | |
|
|
854 | if (oldcop != PL_curcop) |
|
|
855 | { |
|
|
856 | oldcop = PL_curcop; |
|
|
857 | |
|
|
858 | if (PL_curcop != &PL_compiling) |
|
|
859 | { |
|
|
860 | SV **cb; |
|
|
861 | |
|
|
862 | if (oldcxix != cxstack_ix && cctx->flags & CC_TRACE_SUB) |
|
|
863 | { |
|
|
864 | PERL_CONTEXT *cx = &cxstack[cxstack_ix]; |
|
|
865 | |
|
|
866 | if (CxTYPE (cx) == CXt_SUB && oldcxix < cxstack_ix) |
|
|
867 | { |
|
|
868 | runops_proc_t old_runops = PL_runops; |
|
|
869 | dSP; |
|
|
870 | GV *gv = CvGV (cx->blk_sub.cv); |
|
|
871 | SV *fullname = sv_2mortal (newSV (0)); |
|
|
872 | |
|
|
873 | if (isGV (gv)) |
|
|
874 | gv_efullname3 (fullname, gv, 0); |
|
|
875 | |
|
|
876 | PL_runops = RUNOPS_DEFAULT; |
|
|
877 | ENTER; |
|
|
878 | SAVETMPS; |
|
|
879 | EXTEND (SP, 3); |
|
|
880 | PUSHMARK (SP); |
|
|
881 | PUSHs (&PL_sv_yes); |
|
|
882 | PUSHs (fullname); |
|
|
883 | PUSHs (cx->blk_sub.hasargs ? sv_2mortal (newRV_inc ((SV *)cx->blk_sub.argarray)) : &PL_sv_undef); |
|
|
884 | PUTBACK; |
|
|
885 | cb = hv_fetch ((HV *)SvRV (coro_current), "_trace_sub_cb", sizeof ("_trace_sub_cb") - 1, 0); |
|
|
886 | if (cb) call_sv (*cb, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD); |
|
|
887 | SPAGAIN; |
|
|
888 | FREETMPS; |
|
|
889 | LEAVE; |
|
|
890 | PL_runops = runops_trace; |
|
|
891 | } |
|
|
892 | |
|
|
893 | oldcxix = cxstack_ix; |
|
|
894 | } |
|
|
895 | |
|
|
896 | if (cctx->flags & CC_TRACE_LINE) |
|
|
897 | { |
|
|
898 | dSP; |
|
|
899 | |
|
|
900 | PL_runops = RUNOPS_DEFAULT; |
|
|
901 | ENTER; |
|
|
902 | SAVETMPS; |
|
|
903 | EXTEND (SP, 3); |
|
|
904 | PL_runops = RUNOPS_DEFAULT; |
|
|
905 | PUSHMARK (SP); |
|
|
906 | PUSHs (sv_2mortal (newSVpv (OutCopFILE (oldcop), 0))); |
|
|
907 | PUSHs (sv_2mortal (newSViv (CopLINE (oldcop)))); |
|
|
908 | PUTBACK; |
|
|
909 | cb = hv_fetch ((HV *)SvRV (coro_current), "_trace_line_cb", sizeof ("_trace_line_cb") - 1, 0); |
|
|
910 | if (cb) call_sv (*cb, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD); |
|
|
911 | SPAGAIN; |
|
|
912 | FREETMPS; |
|
|
913 | LEAVE; |
|
|
914 | PL_runops = runops_trace; |
|
|
915 | } |
|
|
916 | } |
|
|
917 | } |
|
|
918 | } |
|
|
919 | } |
|
|
920 | |
|
|
921 | TAINT_NOT; |
|
|
922 | return 0; |
|
|
923 | } |
|
|
924 | |
|
|
925 | /* inject a fake call to Coro::State::_cctx_init into the execution */ |
|
|
926 | /* _cctx_init should be careful, as it could be called at almost any time */ |
|
|
927 | /* during execution of a perl program */ |
|
|
928 | static void NOINLINE |
|
|
929 | cctx_prepare (pTHX_ coro_cctx *cctx) |
|
|
930 | { |
|
|
931 | dSP; |
|
|
932 | LOGOP myop; |
|
|
933 | |
|
|
934 | PL_top_env = &PL_start_env; |
|
|
935 | |
|
|
936 | if (cctx->flags & CC_TRACE) |
|
|
937 | PL_runops = runops_trace; |
|
|
938 | |
|
|
939 | Zero (&myop, 1, LOGOP); |
|
|
940 | myop.op_next = PL_op; |
|
|
941 | myop.op_flags = OPf_WANT_VOID | OPf_STACKED; |
|
|
942 | |
|
|
943 | PUSHMARK (SP); |
|
|
944 | EXTEND (SP, 2); |
|
|
945 | PUSHs (sv_2mortal (newSViv (PTR2IV (cctx)))); |
|
|
946 | PUSHs ((SV *)get_cv ("Coro::State::_cctx_init", FALSE)); |
|
|
947 | PUTBACK; |
|
|
948 | PL_op = (OP *)&myop; |
|
|
949 | PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
|
|
950 | SPAGAIN; |
|
|
951 | } |
|
|
952 | |
|
|
953 | /* |
|
|
954 | * this is a _very_ stripped down perl interpreter ;) |
|
|
955 | */ |
|
|
956 | static void |
|
|
957 | cctx_run (void *arg) |
|
|
958 | { |
|
|
959 | dTHX; |
|
|
960 | |
|
|
961 | /* cctx_run is the alternative tail of transfer(), so unlock here. */ |
|
|
962 | UNLOCK; |
|
|
963 | |
|
|
964 | /* we now skip the entersub that lead to transfer() */ |
|
|
965 | PL_op = PL_op->op_next; |
|
|
966 | |
|
|
967 | /* inject a fake subroutine call to cctx_init */ |
|
|
968 | cctx_prepare (aTHX_ (coro_cctx *)arg); |
|
|
969 | |
|
|
970 | /* somebody or something will hit me for both perl_run and PL_restartop */ |
|
|
971 | PL_restartop = PL_op; |
|
|
972 | perl_run (PL_curinterp); |
|
|
973 | |
|
|
974 | /* |
|
|
975 | * If perl-run returns we assume exit() was being called or the coro |
|
|
976 | * fell off the end, which seems to be the only valid (non-bug) |
|
|
977 | * reason for perl_run to return. We try to exit by jumping to the |
|
|
978 | * bootstrap-time "top" top_env, as we cannot restore the "main" |
|
|
979 | * coroutine as Coro has no such concept |
|
|
980 | */ |
|
|
981 | PL_top_env = main_top_env; |
|
|
982 | JMPENV_JUMP (2); /* I do not feel well about the hardcoded 2 at all */ |
|
|
983 | } |
|
|
984 | |
|
|
985 | static coro_cctx * |
|
|
986 | cctx_new () |
|
|
987 | { |
|
|
988 | coro_cctx *cctx; |
|
|
989 | void *stack_start; |
|
|
990 | size_t stack_size; |
|
|
991 | |
|
|
992 | ++cctx_count; |
|
|
993 | |
|
|
994 | Newz (0, cctx, 1, coro_cctx); |
|
|
995 | |
|
|
996 | #if HAVE_MMAP |
|
|
997 | cctx->ssize = ((coro_stacksize * sizeof (long) + PAGESIZE - 1) / PAGESIZE + CORO_STACKGUARD) * PAGESIZE; |
|
|
998 | /* mmap supposedly does allocate-on-write for us */ |
|
|
999 | cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
|
|
1000 | |
|
|
1001 | if (cctx->sptr != (void *)-1) |
|
|
1002 | { |
|
|
1003 | # if CORO_STACKGUARD |
|
|
1004 | mprotect (cctx->sptr, CORO_STACKGUARD * PAGESIZE, PROT_NONE); |
|
|
1005 | # endif |
|
|
1006 | stack_start = CORO_STACKGUARD * PAGESIZE + (char *)cctx->sptr; |
|
|
1007 | stack_size = cctx->ssize - CORO_STACKGUARD * PAGESIZE; |
|
|
1008 | cctx->flags |= CC_MAPPED; |
|
|
1009 | } |
|
|
1010 | else |
|
|
1011 | #endif |
|
|
1012 | { |
|
|
1013 | cctx->ssize = coro_stacksize * (long)sizeof (long); |
|
|
1014 | New (0, cctx->sptr, coro_stacksize, long); |
|
|
1015 | |
|
|
1016 | if (!cctx->sptr) |
|
|
1017 | { |
|
|
1018 | perror ("FATAL: unable to allocate stack for coroutine"); |
|
|
1019 | _exit (EXIT_FAILURE); |
|
|
1020 | } |
|
|
1021 | |
|
|
1022 | stack_start = cctx->sptr; |
|
|
1023 | stack_size = cctx->ssize; |
|
|
1024 | } |
|
|
1025 | |
|
|
1026 | REGISTER_STACK (cctx, (char *)stack_start, (char *)stack_start + stack_size); |
|
|
1027 | coro_create (&cctx->cctx, cctx_run, (void *)cctx, stack_start, stack_size); |
|
|
1028 | |
|
|
1029 | return cctx; |
|
|
1030 | } |
|
|
1031 | |
|
|
1032 | static void |
|
|
1033 | cctx_destroy (coro_cctx *cctx) |
|
|
1034 | { |
|
|
1035 | if (!cctx) |
|
|
1036 | return; |
|
|
1037 | |
|
|
1038 | --cctx_count; |
|
|
1039 | |
|
|
1040 | #if CORO_USE_VALGRIND |
|
|
1041 | VALGRIND_STACK_DEREGISTER (cctx->valgrind_id); |
|
|
1042 | #endif |
|
|
1043 | |
|
|
1044 | #if HAVE_MMAP |
|
|
1045 | if (cctx->flags & CC_MAPPED) |
|
|
1046 | munmap (cctx->sptr, cctx->ssize); |
|
|
1047 | else |
|
|
1048 | #endif |
|
|
1049 | Safefree (cctx->sptr); |
|
|
1050 | |
|
|
1051 | Safefree (cctx); |
|
|
1052 | } |
|
|
1053 | |
|
|
1054 | /* wether this cctx should be destructed */ |
|
|
1055 | #define CCTX_EXPIRED(cctx) ((cctx)->ssize < coro_stacksize || ((cctx)->flags & CC_NOREUSE)) |
|
|
1056 | |
|
|
1057 | static coro_cctx * |
|
|
1058 | cctx_get (pTHX) |
|
|
1059 | { |
|
|
1060 | while (expect_true (cctx_first)) |
|
|
1061 | { |
|
|
1062 | coro_cctx *cctx = cctx_first; |
|
|
1063 | cctx_first = cctx->next; |
|
|
1064 | --cctx_idle; |
|
|
1065 | |
|
|
1066 | if (expect_true (!CCTX_EXPIRED (cctx))) |
|
|
1067 | return cctx; |
|
|
1068 | |
|
|
1069 | cctx_destroy (cctx); |
|
|
1070 | } |
|
|
1071 | |
|
|
1072 | return cctx_new (); |
|
|
1073 | } |
|
|
1074 | |
|
|
1075 | static void |
|
|
1076 | cctx_put (coro_cctx *cctx) |
|
|
1077 | { |
|
|
1078 | /* free another cctx if overlimit */ |
|
|
1079 | if (expect_false (cctx_idle >= MAX_IDLE_CCTX)) |
|
|
1080 | { |
|
|
1081 | coro_cctx *first = cctx_first; |
|
|
1082 | cctx_first = first->next; |
|
|
1083 | --cctx_idle; |
|
|
1084 | |
|
|
1085 | cctx_destroy (first); |
|
|
1086 | } |
|
|
1087 | |
|
|
1088 | ++cctx_idle; |
|
|
1089 | cctx->next = cctx_first; |
|
|
1090 | cctx_first = cctx; |
|
|
1091 | } |
|
|
1092 | |
|
|
1093 | /** coroutine switching *****************************************************/ |
|
|
1094 | |
|
|
1095 | static void |
|
|
1096 | transfer_check (pTHX_ struct coro *prev, struct coro *next) |
|
|
1097 | { |
|
|
1098 | if (expect_true (prev != next)) |
|
|
1099 | { |
|
|
1100 | if (expect_false (!(prev->flags & (CF_RUNNING | CF_NEW)))) |
|
|
1101 | croak ("Coro::State::transfer called with non-running/new prev Coro::State, but can only transfer from running or new states"); |
|
|
1102 | |
|
|
1103 | if (expect_false (next->flags & CF_RUNNING)) |
|
|
1104 | croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states"); |
|
|
1105 | |
|
|
1106 | if (expect_false (next->flags & CF_DESTROYED)) |
|
|
1107 | croak ("Coro::State::transfer called with destroyed next Coro::State, but can only transfer to inactive states"); |
|
|
1108 | |
|
|
1109 | if ( |
|
|
1110 | #if PERL_VERSION_ATLEAST (5,9,0) |
|
|
1111 | expect_false (PL_parser) |
|
|
1112 | #else |
|
|
1113 | expect_false (PL_lex_state != LEX_NOTPARSING) |
|
|
1114 | #endif |
|
|
1115 | ) |
|
|
1116 | croak ("Coro::State::transfer called while parsing, but this is not supported"); |
|
|
1117 | } |
|
|
1118 | } |
|
|
1119 | |
|
|
1120 | /* always use the TRANSFER macro */ |
|
|
1121 | static void NOINLINE |
|
|
1122 | transfer (pTHX_ struct coro *prev, struct coro *next) |
|
|
1123 | { |
|
|
1124 | dSTACKLEVEL; |
|
|
1125 | |
|
|
1126 | /* sometimes transfer is only called to set idle_sp */ |
|
|
1127 | if (expect_false (!next)) |
|
|
1128 | { |
|
|
1129 | ((coro_cctx *)prev)->idle_sp = STACKLEVEL; |
|
|
1130 | assert (((coro_cctx *)prev)->idle_te = PL_top_env); /* just for the side-effect when asserts are enabled */ |
|
|
1131 | } |
|
|
1132 | else if (expect_true (prev != next)) |
|
|
1133 | { |
|
|
1134 | coro_cctx *prev__cctx; |
|
|
1135 | |
|
|
1136 | if (expect_false (prev->flags & CF_NEW)) |
|
|
1137 | { |
|
|
1138 | /* create a new empty context */ |
|
|
1139 | Newz (0, prev->cctx, 1, coro_cctx); |
|
|
1140 | prev->flags &= ~CF_NEW; |
|
|
1141 | prev->flags |= CF_RUNNING; |
|
|
1142 | } |
|
|
1143 | |
|
|
1144 | prev->flags &= ~CF_RUNNING; |
|
|
1145 | next->flags |= CF_RUNNING; |
|
|
1146 | |
|
|
1147 | LOCK; |
|
|
1148 | |
|
|
1149 | /* first get rid of the old state */ |
|
|
1150 | save_perl (aTHX_ prev); |
|
|
1151 | |
|
|
1152 | if (expect_false (next->flags & CF_NEW)) |
|
|
1153 | { |
|
|
1154 | /* need to start coroutine */ |
|
|
1155 | next->flags &= ~CF_NEW; |
|
|
1156 | /* setup coroutine call */ |
|
|
1157 | coro_setup (aTHX_ next); |
|
|
1158 | } |
|
|
1159 | else |
|
|
1160 | load_perl (aTHX_ next); |
|
|
1161 | |
|
|
1162 | prev__cctx = prev->cctx; |
|
|
1163 | |
|
|
1164 | /* possibly "free" the cctx */ |
|
|
1165 | if (expect_true (prev__cctx->idle_sp == STACKLEVEL && !(prev__cctx->flags & CC_TRACE))) |
|
|
1166 | { |
|
|
1167 | /* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */ |
|
|
1168 | assert (("ERROR: current top_env must equal previous top_env", PL_top_env == prev__cctx->idle_te)); |
|
|
1169 | |
|
|
1170 | prev->cctx = 0; |
|
|
1171 | |
|
|
1172 | /* if the cctx is about to be destroyed we need to make sure we won't see it in cctx_get */ |
|
|
1173 | /* without this the next cctx_get might destroy the prev__cctx while still in use */ |
|
|
1174 | if (expect_false (CCTX_EXPIRED (prev__cctx))) |
|
|
1175 | if (!next->cctx) |
|
|
1176 | next->cctx = cctx_get (aTHX); |
|
|
1177 | |
|
|
1178 | cctx_put (prev__cctx); |
|
|
1179 | } |
|
|
1180 | |
|
|
1181 | ++next->usecount; |
|
|
1182 | |
|
|
1183 | if (expect_true (!next->cctx)) |
|
|
1184 | next->cctx = cctx_get (aTHX); |
|
|
1185 | |
|
|
1186 | if (expect_false (prev__cctx != next->cctx)) |
|
|
1187 | { |
|
|
1188 | prev__cctx->top_env = PL_top_env; |
|
|
1189 | PL_top_env = next->cctx->top_env; |
|
|
1190 | coro_transfer (&prev__cctx->cctx, &next->cctx->cctx); |
|
|
1191 | } |
|
|
1192 | |
|
|
1193 | free_coro_mortal (aTHX); |
|
|
1194 | UNLOCK; |
|
|
1195 | |
|
|
1196 | if (expect_false (prev->throw || next->throw)) |
|
|
1197 | { |
|
|
1198 | struct coro *coro = SvSTATE (coro_current); |
|
|
1199 | |
|
|
1200 | if (coro->throw) |
|
|
1201 | { |
|
|
1202 | SV *exception = coro->throw; |
|
|
1203 | coro->throw = 0; |
|
|
1204 | sv_setsv (ERRSV, exception); |
|
|
1205 | croak (0); |
|
|
1206 | } |
|
|
1207 | } |
|
|
1208 | } |
|
|
1209 | } |
|
|
1210 | |
|
|
1211 | struct transfer_args |
|
|
1212 | { |
|
|
1213 | struct coro *prev, *next; |
|
|
1214 | }; |
|
|
1215 | |
|
|
1216 | #define TRANSFER(ta) transfer (aTHX_ (ta).prev, (ta).next) |
|
|
1217 | #define TRANSFER_CHECK(ta) transfer_check (aTHX_ (ta).prev, (ta).next) |
|
|
1218 | |
|
|
1219 | /** high level stuff ********************************************************/ |
|
|
1220 | |
|
|
1221 | static int |
|
|
1222 | coro_state_destroy (pTHX_ struct coro *coro) |
|
|
1223 | { |
|
|
1224 | if (coro->flags & CF_DESTROYED) |
|
|
1225 | return 0; |
|
|
1226 | |
|
|
1227 | coro->flags |= CF_DESTROYED; |
|
|
1228 | |
|
|
1229 | if (coro->flags & CF_READY) |
|
|
1230 | { |
|
|
1231 | /* reduce nready, as destroying a ready coro effectively unreadies it */ |
|
|
1232 | /* alternative: look through all ready queues and remove the coro */ |
|
|
1233 | LOCK; |
|
|
1234 | --coro_nready; |
|
|
1235 | UNLOCK; |
|
|
1236 | } |
|
|
1237 | else |
|
|
1238 | coro->flags |= CF_READY; /* make sure it is NOT put into the readyqueue */ |
|
|
1239 | |
|
|
1240 | if (coro->mainstack && coro->mainstack != main_mainstack) |
|
|
1241 | { |
|
|
1242 | struct coro temp; |
|
|
1243 | |
|
|
1244 | if (coro->flags & CF_RUNNING) |
|
|
1245 | croak ("FATAL: tried to destroy currently running coroutine"); |
|
|
1246 | |
|
|
1247 | save_perl (aTHX_ &temp); |
|
|
1248 | load_perl (aTHX_ coro); |
|
|
1249 | |
|
|
1250 | coro_destroy (aTHX_ coro); |
|
|
1251 | |
|
|
1252 | load_perl (aTHX_ &temp); |
|
|
1253 | |
|
|
1254 | coro->slot = 0; |
|
|
1255 | } |
|
|
1256 | |
|
|
1257 | cctx_destroy (coro->cctx); |
|
|
1258 | SvREFCNT_dec (coro->args); |
|
|
1259 | |
|
|
1260 | if (coro->next) coro->next->prev = coro->prev; |
|
|
1261 | if (coro->prev) coro->prev->next = coro->next; |
|
|
1262 | if (coro == coro_first) coro_first = coro->next; |
|
|
1263 | |
|
|
1264 | return 1; |
|
|
1265 | } |
|
|
1266 | |
|
|
1267 | static int |
|
|
1268 | coro_state_free (pTHX_ SV *sv, MAGIC *mg) |
|
|
1269 | { |
|
|
1270 | struct coro *coro = (struct coro *)mg->mg_ptr; |
|
|
1271 | mg->mg_ptr = 0; |
|
|
1272 | |
|
|
1273 | coro->hv = 0; |
|
|
1274 | |
|
|
1275 | if (--coro->refcnt < 0) |
|
|
1276 | { |
|
|
1277 | coro_state_destroy (aTHX_ coro); |
|
|
1278 | Safefree (coro); |
|
|
1279 | } |
|
|
1280 | |
|
|
1281 | return 0; |
|
|
1282 | } |
|
|
1283 | |
|
|
1284 | static int |
|
|
1285 | coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params) |
|
|
1286 | { |
|
|
1287 | struct coro *coro = (struct coro *)mg->mg_ptr; |
|
|
1288 | |
|
|
1289 | ++coro->refcnt; |
|
|
1290 | |
|
|
1291 | return 0; |
|
|
1292 | } |
|
|
1293 | |
|
|
1294 | static MGVTBL coro_state_vtbl = { |
|
|
1295 | 0, 0, 0, 0, |
|
|
1296 | coro_state_free, |
|
|
1297 | 0, |
|
|
1298 | #ifdef MGf_DUP |
|
|
1299 | coro_state_dup, |
|
|
1300 | #else |
|
|
1301 | # define MGf_DUP 0 |
|
|
1302 | #endif |
|
|
1303 | }; |
|
|
1304 | |
|
|
1305 | static void |
|
|
1306 | prepare_transfer (pTHX_ struct transfer_args *ta, SV *prev_sv, SV *next_sv) |
|
|
1307 | { |
|
|
1308 | ta->prev = SvSTATE (prev_sv); |
|
|
1309 | ta->next = SvSTATE (next_sv); |
|
|
1310 | TRANSFER_CHECK (*ta); |
|
|
1311 | } |
|
|
1312 | |
|
|
1313 | static void |
|
|
1314 | api_transfer (SV *prev_sv, SV *next_sv) |
|
|
1315 | { |
|
|
1316 | dTHX; |
|
|
1317 | struct transfer_args ta; |
|
|
1318 | |
|
|
1319 | prepare_transfer (aTHX_ &ta, prev_sv, next_sv); |
|
|
1320 | TRANSFER (ta); |
|
|
1321 | } |
|
|
1322 | |
|
|
1323 | /** Coro ********************************************************************/ |
|
|
1324 | |
|
|
1325 | static void |
|
|
1326 | coro_enq (pTHX_ SV *coro_sv) |
|
|
1327 | { |
|
|
1328 | av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv); |
|
|
1329 | } |
|
|
1330 | |
|
|
1331 | static SV * |
837 | coro_deq (int min_prio) |
1332 | coro_deq (pTHX_ int min_prio) |
838 | { |
1333 | { |
839 | int prio = PRIO_MAX - PRIO_MIN; |
1334 | int prio = PRIO_MAX - PRIO_MIN; |
840 | |
1335 | |
841 | min_prio -= PRIO_MIN; |
1336 | min_prio -= PRIO_MIN; |
842 | if (min_prio < 0) |
1337 | if (min_prio < 0) |
843 | min_prio = 0; |
1338 | min_prio = 0; |
844 | |
1339 | |
845 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
1340 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
846 | if (av_len (coro_ready[prio]) >= 0) |
1341 | if (AvFILLp (coro_ready [prio]) >= 0) |
847 | { |
|
|
848 | coro_nready--; |
|
|
849 | return av_shift (coro_ready[prio]); |
1342 | return av_shift (coro_ready [prio]); |
850 | } |
|
|
851 | |
1343 | |
852 | return 0; |
1344 | return 0; |
853 | } |
1345 | } |
854 | |
1346 | |
855 | static void |
1347 | static int |
856 | api_ready (SV *coro) |
1348 | api_ready (SV *coro_sv) |
857 | { |
1349 | { |
|
|
1350 | dTHX; |
|
|
1351 | struct coro *coro; |
|
|
1352 | |
858 | if (SvROK (coro)) |
1353 | if (SvROK (coro_sv)) |
859 | coro = SvRV (coro); |
1354 | coro_sv = SvRV (coro_sv); |
860 | |
1355 | |
|
|
1356 | coro = SvSTATE (coro_sv); |
|
|
1357 | |
|
|
1358 | if (coro->flags & CF_READY) |
|
|
1359 | return 0; |
|
|
1360 | |
|
|
1361 | coro->flags |= CF_READY; |
|
|
1362 | |
|
|
1363 | LOCK; |
861 | coro_enq (SvREFCNT_inc (coro)); |
1364 | coro_enq (aTHX_ SvREFCNT_inc (coro_sv)); |
|
|
1365 | ++coro_nready; |
|
|
1366 | UNLOCK; |
|
|
1367 | |
|
|
1368 | return 1; |
|
|
1369 | } |
|
|
1370 | |
|
|
1371 | static int |
|
|
1372 | api_is_ready (SV *coro_sv) |
|
|
1373 | { |
|
|
1374 | dTHX; |
|
|
1375 | return !!(SvSTATE (coro_sv)->flags & CF_READY); |
|
|
1376 | } |
|
|
1377 | |
|
|
1378 | static void |
|
|
1379 | prepare_schedule (pTHX_ struct transfer_args *ta) |
|
|
1380 | { |
|
|
1381 | SV *prev_sv, *next_sv; |
|
|
1382 | |
|
|
1383 | for (;;) |
|
|
1384 | { |
|
|
1385 | LOCK; |
|
|
1386 | next_sv = coro_deq (aTHX_ PRIO_MIN); |
|
|
1387 | |
|
|
1388 | /* nothing to schedule: call the idle handler */ |
|
|
1389 | if (expect_false (!next_sv)) |
|
|
1390 | { |
|
|
1391 | dSP; |
|
|
1392 | UNLOCK; |
|
|
1393 | |
|
|
1394 | ENTER; |
|
|
1395 | SAVETMPS; |
|
|
1396 | |
|
|
1397 | PUSHMARK (SP); |
|
|
1398 | PUTBACK; |
|
|
1399 | call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD); |
|
|
1400 | |
|
|
1401 | FREETMPS; |
|
|
1402 | LEAVE; |
|
|
1403 | continue; |
|
|
1404 | } |
|
|
1405 | |
|
|
1406 | ta->next = SvSTATE (next_sv); |
|
|
1407 | |
|
|
1408 | /* cannot transfer to destroyed coros, skip and look for next */ |
|
|
1409 | if (expect_false (ta->next->flags & CF_DESTROYED)) |
|
|
1410 | { |
|
|
1411 | UNLOCK; |
|
|
1412 | SvREFCNT_dec (next_sv); |
|
|
1413 | /* coro_nready is already taken care of by destroy */ |
|
|
1414 | continue; |
|
|
1415 | } |
|
|
1416 | |
|
|
1417 | --coro_nready; |
|
|
1418 | UNLOCK; |
|
|
1419 | break; |
|
|
1420 | } |
|
|
1421 | |
|
|
1422 | /* free this only after the transfer */ |
|
|
1423 | prev_sv = SvRV (coro_current); |
|
|
1424 | ta->prev = SvSTATE (prev_sv); |
|
|
1425 | TRANSFER_CHECK (*ta); |
|
|
1426 | assert (ta->next->flags & CF_READY); |
|
|
1427 | ta->next->flags &= ~CF_READY; |
|
|
1428 | SvRV_set (coro_current, next_sv); |
|
|
1429 | |
|
|
1430 | LOCK; |
|
|
1431 | free_coro_mortal (aTHX); |
|
|
1432 | coro_mortal = prev_sv; |
|
|
1433 | UNLOCK; |
|
|
1434 | } |
|
|
1435 | |
|
|
1436 | static void |
|
|
1437 | prepare_cede (pTHX_ struct transfer_args *ta) |
|
|
1438 | { |
|
|
1439 | api_ready (coro_current); |
|
|
1440 | prepare_schedule (aTHX_ ta); |
|
|
1441 | } |
|
|
1442 | |
|
|
1443 | static int |
|
|
1444 | prepare_cede_notself (pTHX_ struct transfer_args *ta) |
|
|
1445 | { |
|
|
1446 | if (coro_nready) |
|
|
1447 | { |
|
|
1448 | SV *prev = SvRV (coro_current); |
|
|
1449 | prepare_schedule (aTHX_ ta); |
|
|
1450 | api_ready (prev); |
|
|
1451 | return 1; |
|
|
1452 | } |
|
|
1453 | else |
|
|
1454 | return 0; |
862 | } |
1455 | } |
863 | |
1456 | |
864 | static void |
1457 | static void |
865 | api_schedule (void) |
1458 | api_schedule (void) |
866 | { |
1459 | { |
867 | SV *prev, *next; |
1460 | dTHX; |
|
|
1461 | struct transfer_args ta; |
868 | |
1462 | |
869 | prev = SvRV (GvSV (coro_current)); |
1463 | prepare_schedule (aTHX_ &ta); |
870 | next = coro_deq (PRIO_MIN); |
1464 | TRANSFER (ta); |
871 | |
|
|
872 | if (!next) |
|
|
873 | next = SvREFCNT_inc (SvRV (GvSV (coro_idle))); |
|
|
874 | |
|
|
875 | /* free this only after the transfer */ |
|
|
876 | coro_mortal = prev; |
|
|
877 | SV_CORO (prev, "Coro::schedule"); |
|
|
878 | |
|
|
879 | SvRV (GvSV (coro_current)) = next; |
|
|
880 | |
|
|
881 | SV_CORO (next, "Coro::schedule"); |
|
|
882 | |
|
|
883 | transfer (aTHX_ SvSTATE (prev), SvSTATE (next), |
|
|
884 | TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK); |
|
|
885 | } |
1465 | } |
886 | |
1466 | |
887 | static void |
1467 | static int |
888 | api_cede (void) |
1468 | api_cede (void) |
889 | { |
1469 | { |
890 | coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current)))); |
1470 | dTHX; |
|
|
1471 | struct transfer_args ta; |
891 | |
1472 | |
892 | api_schedule (); |
1473 | prepare_cede (aTHX_ &ta); |
893 | } |
|
|
894 | |
1474 | |
|
|
1475 | if (expect_true (ta.prev != ta.next)) |
|
|
1476 | { |
|
|
1477 | TRANSFER (ta); |
|
|
1478 | return 1; |
|
|
1479 | } |
|
|
1480 | else |
|
|
1481 | return 0; |
|
|
1482 | } |
|
|
1483 | |
|
|
1484 | static int |
|
|
1485 | api_cede_notself (void) |
|
|
1486 | { |
|
|
1487 | dTHX; |
|
|
1488 | struct transfer_args ta; |
|
|
1489 | |
|
|
1490 | if (prepare_cede_notself (aTHX_ &ta)) |
|
|
1491 | { |
|
|
1492 | TRANSFER (ta); |
|
|
1493 | return 1; |
|
|
1494 | } |
|
|
1495 | else |
|
|
1496 | return 0; |
|
|
1497 | } |
|
|
1498 | |
|
|
1499 | static void |
|
|
1500 | api_trace (SV *coro_sv, int flags) |
|
|
1501 | { |
|
|
1502 | dTHX; |
|
|
1503 | struct coro *coro = SvSTATE (coro_sv); |
|
|
1504 | |
|
|
1505 | if (flags & CC_TRACE) |
|
|
1506 | { |
|
|
1507 | if (!coro->cctx) |
|
|
1508 | coro->cctx = cctx_new (); |
|
|
1509 | else if (!(coro->cctx->flags & CC_TRACE)) |
|
|
1510 | croak ("cannot enable tracing on coroutine with custom stack"); |
|
|
1511 | |
|
|
1512 | coro->cctx->flags |= CC_NOREUSE | (flags & (CC_TRACE | CC_TRACE_ALL)); |
|
|
1513 | } |
|
|
1514 | else if (coro->cctx && coro->cctx->flags & CC_TRACE) |
|
|
1515 | { |
|
|
1516 | coro->cctx->flags &= ~(CC_TRACE | CC_TRACE_ALL); |
|
|
1517 | |
|
|
1518 | if (coro->flags & CF_RUNNING) |
|
|
1519 | PL_runops = RUNOPS_DEFAULT; |
|
|
1520 | else |
|
|
1521 | coro->slot->runops = RUNOPS_DEFAULT; |
|
|
1522 | } |
|
|
1523 | } |
|
|
1524 | |
895 | MODULE = Coro::State PACKAGE = Coro::State |
1525 | MODULE = Coro::State PACKAGE = Coro::State PREFIX = api_ |
896 | |
1526 | |
897 | PROTOTYPES: ENABLE |
1527 | PROTOTYPES: DISABLE |
898 | |
1528 | |
899 | BOOT: |
1529 | BOOT: |
900 | { /* {} necessary for stoopid perl-5.6.x */ |
1530 | { |
901 | ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); |
1531 | #ifdef USE_ITHREADS |
902 | PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); |
1532 | MUTEX_INIT (&coro_mutex); |
|
|
1533 | #endif |
|
|
1534 | BOOT_PAGESIZE; |
|
|
1535 | |
|
|
1536 | irsgv = gv_fetchpv ("/" , GV_ADD|GV_NOTQUAL, SVt_PV); |
|
|
1537 | stdoutgv = gv_fetchpv ("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVIO); |
|
|
1538 | #if 0 |
|
|
1539 | orig_sigelem_get = PL_vtbl_sigelem.svt_get; |
|
|
1540 | PL_vtbl_sigelem.svt_get = coro_sigelem_get; |
|
|
1541 | #endif |
|
|
1542 | hv_sig = coro_get_hv (aTHX_ "SIG", TRUE); |
|
|
1543 | rv_diehook = SvREFCNT_inc ((SV *)gv_fetchpv ("Coro::State::diehook" , 0, SVt_PVCV)); |
|
|
1544 | rv_warnhook = SvREFCNT_inc ((SV *)gv_fetchpv ("Coro::State::warnhook", 0, SVt_PVCV)); |
|
|
1545 | |
903 | coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
1546 | coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
904 | |
1547 | |
905 | newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); |
1548 | newCONSTSUB (coro_state_stash, "CC_TRACE" , newSViv (CC_TRACE)); |
906 | newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); |
1549 | newCONSTSUB (coro_state_stash, "CC_TRACE_SUB" , newSViv (CC_TRACE_SUB)); |
907 | newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); |
1550 | newCONSTSUB (coro_state_stash, "CC_TRACE_LINE", newSViv (CC_TRACE_LINE)); |
908 | newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); |
1551 | newCONSTSUB (coro_state_stash, "CC_TRACE_ALL" , newSViv (CC_TRACE_ALL)); |
909 | |
|
|
910 | if (!padlist_cache) |
|
|
911 | padlist_cache = newHV (); |
|
|
912 | |
1552 | |
913 | main_mainstack = PL_mainstack; |
1553 | main_mainstack = PL_mainstack; |
|
|
1554 | main_top_env = PL_top_env; |
|
|
1555 | |
|
|
1556 | while (main_top_env->je_prev) |
|
|
1557 | main_top_env = main_top_env->je_prev; |
914 | |
1558 | |
915 | coroapi.ver = CORO_API_VERSION; |
1559 | coroapi.ver = CORO_API_VERSION; |
|
|
1560 | coroapi.rev = CORO_API_REVISION; |
916 | coroapi.transfer = api_transfer; |
1561 | coroapi.transfer = api_transfer; |
917 | } |
|
|
918 | |
1562 | |
919 | Coro::State |
1563 | assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL)); |
920 | _newprocess(args) |
1564 | } |
921 | SV * args |
1565 | |
922 | PROTOTYPE: $ |
1566 | SV * |
|
|
1567 | new (char *klass, ...) |
923 | CODE: |
1568 | CODE: |
924 | Coro__State coro; |
1569 | { |
|
|
1570 | struct coro *coro; |
|
|
1571 | MAGIC *mg; |
|
|
1572 | HV *hv; |
|
|
1573 | int i; |
925 | |
1574 | |
926 | if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) |
|
|
927 | croak ("Coro::State::_newprocess expects an arrayref"); |
|
|
928 | |
|
|
929 | New (0, coro, 1, struct coro); |
1575 | Newz (0, coro, 1, struct coro); |
|
|
1576 | coro->args = newAV (); |
|
|
1577 | coro->flags = CF_NEW; |
930 | |
1578 | |
931 | coro->args = (AV *)SvREFCNT_inc (SvRV (args)); |
1579 | if (coro_first) coro_first->prev = coro; |
932 | coro->mainstack = 0; /* actual work is done inside transfer */ |
1580 | coro->next = coro_first; |
933 | coro->stack = 0; |
1581 | coro_first = coro; |
934 | |
1582 | |
935 | RETVAL = coro; |
1583 | coro->hv = hv = newHV (); |
|
|
1584 | mg = sv_magicext ((SV *)hv, 0, CORO_MAGIC_type_state, &coro_state_vtbl, (char *)coro, 0); |
|
|
1585 | mg->mg_flags |= MGf_DUP; |
|
|
1586 | RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1)); |
|
|
1587 | |
|
|
1588 | av_extend (coro->args, items - 1); |
|
|
1589 | for (i = 1; i < items; i++) |
|
|
1590 | av_push (coro->args, newSVsv (ST (i))); |
|
|
1591 | } |
936 | OUTPUT: |
1592 | OUTPUT: |
937 | RETVAL |
1593 | RETVAL |
938 | |
1594 | |
|
|
1595 | # these not obviously related functions are all rolled into the same xs |
|
|
1596 | # function to increase chances that they all will call transfer with the same |
|
|
1597 | # stack offset |
939 | void |
1598 | void |
940 | transfer(prev, next, flags) |
1599 | _set_stacklevel (...) |
941 | SV *prev |
1600 | ALIAS: |
942 | SV *next |
1601 | Coro::State::transfer = 1 |
943 | int flags |
1602 | Coro::schedule = 2 |
944 | PROTOTYPE: @ |
1603 | Coro::cede = 3 |
|
|
1604 | Coro::cede_notself = 4 |
945 | CODE: |
1605 | CODE: |
|
|
1606 | { |
|
|
1607 | struct transfer_args ta; |
|
|
1608 | |
|
|
1609 | switch (ix) |
|
|
1610 | { |
|
|
1611 | case 0: |
|
|
1612 | ta.prev = (struct coro *)INT2PTR (coro_cctx *, SvIV (ST (0))); |
|
|
1613 | ta.next = 0; |
|
|
1614 | break; |
|
|
1615 | |
|
|
1616 | case 1: |
|
|
1617 | if (items != 2) |
|
|
1618 | croak ("Coro::State::transfer (prev,next) expects two arguments, not %d", items); |
|
|
1619 | |
|
|
1620 | prepare_transfer (aTHX_ &ta, ST (0), ST (1)); |
|
|
1621 | break; |
|
|
1622 | |
|
|
1623 | case 2: |
|
|
1624 | prepare_schedule (aTHX_ &ta); |
|
|
1625 | break; |
|
|
1626 | |
|
|
1627 | case 3: |
|
|
1628 | prepare_cede (aTHX_ &ta); |
|
|
1629 | break; |
|
|
1630 | |
|
|
1631 | case 4: |
|
|
1632 | if (!prepare_cede_notself (aTHX_ &ta)) |
|
|
1633 | XSRETURN_EMPTY; |
|
|
1634 | |
|
|
1635 | break; |
|
|
1636 | } |
|
|
1637 | |
|
|
1638 | BARRIER; |
946 | PUTBACK; |
1639 | PUTBACK; |
947 | SV_CORO (next, "Coro::transfer"); |
1640 | TRANSFER (ta); |
948 | SV_CORO (prev, "Coro::transfer"); |
1641 | SPAGAIN; /* might be the sp of a different coroutine now */ |
949 | transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); |
1642 | /* be extra careful not to ever do anything after TRANSFER */ |
950 | SPAGAIN; |
1643 | } |
|
|
1644 | |
|
|
1645 | bool |
|
|
1646 | _destroy (SV *coro_sv) |
|
|
1647 | CODE: |
|
|
1648 | RETVAL = coro_state_destroy (aTHX_ SvSTATE (coro_sv)); |
|
|
1649 | OUTPUT: |
|
|
1650 | RETVAL |
951 | |
1651 | |
952 | void |
1652 | void |
953 | DESTROY(coro) |
|
|
954 | Coro::State coro |
|
|
955 | CODE: |
|
|
956 | |
|
|
957 | if (coro->mainstack && coro->mainstack != main_mainstack) |
|
|
958 | { |
|
|
959 | struct coro temp; |
|
|
960 | |
|
|
961 | PUTBACK; |
|
|
962 | SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); |
|
|
963 | LOAD(aTHX_ coro); |
|
|
964 | SPAGAIN; |
|
|
965 | |
|
|
966 | destroy_stacks (aTHX); |
|
|
967 | |
|
|
968 | LOAD((&temp)); /* this will get rid of defsv etc.. */ |
|
|
969 | SPAGAIN; |
|
|
970 | |
|
|
971 | coro->mainstack = 0; |
|
|
972 | } |
|
|
973 | |
|
|
974 | deallocate_stack (coro); |
|
|
975 | |
|
|
976 | Safefree (coro); |
|
|
977 | |
|
|
978 | void |
|
|
979 | flush() |
|
|
980 | CODE: |
|
|
981 | #ifdef MAY_FLUSH |
|
|
982 | flush_padlist_cache (); |
|
|
983 | #endif |
|
|
984 | |
|
|
985 | void |
|
|
986 | _exit(code) |
1653 | _exit (code) |
987 | int code |
1654 | int code |
988 | PROTOTYPE: $ |
1655 | PROTOTYPE: $ |
989 | CODE: |
1656 | CODE: |
990 | #if defined(__GLIBC__) || _POSIX_C_SOURCE |
|
|
991 | _exit (code); |
1657 | _exit (code); |
992 | #else |
|
|
993 | signal (SIGTERM, SIG_DFL); |
|
|
994 | raise (SIGTERM); |
|
|
995 | exit (code); |
|
|
996 | #endif |
|
|
997 | |
1658 | |
998 | MODULE = Coro::State PACKAGE = Coro::Cont |
1659 | int |
|
|
1660 | cctx_stacksize (int new_stacksize = 0) |
|
|
1661 | CODE: |
|
|
1662 | RETVAL = coro_stacksize; |
|
|
1663 | if (new_stacksize) |
|
|
1664 | coro_stacksize = new_stacksize; |
|
|
1665 | OUTPUT: |
|
|
1666 | RETVAL |
999 | |
1667 | |
1000 | # this is slightly dirty (should expose a c-level api) |
1668 | int |
|
|
1669 | cctx_count () |
|
|
1670 | CODE: |
|
|
1671 | RETVAL = cctx_count; |
|
|
1672 | OUTPUT: |
|
|
1673 | RETVAL |
|
|
1674 | |
|
|
1675 | int |
|
|
1676 | cctx_idle () |
|
|
1677 | CODE: |
|
|
1678 | RETVAL = cctx_idle; |
|
|
1679 | OUTPUT: |
|
|
1680 | RETVAL |
1001 | |
1681 | |
1002 | void |
1682 | void |
1003 | yield(...) |
1683 | list () |
1004 | PROTOTYPE: @ |
1684 | PPCODE: |
|
|
1685 | { |
|
|
1686 | struct coro *coro; |
|
|
1687 | for (coro = coro_first; coro; coro = coro->next) |
|
|
1688 | if (coro->hv) |
|
|
1689 | XPUSHs (sv_2mortal (newRV_inc ((SV *)coro->hv))); |
|
|
1690 | } |
|
|
1691 | |
|
|
1692 | void |
|
|
1693 | call (Coro::State coro, SV *coderef) |
|
|
1694 | ALIAS: |
|
|
1695 | eval = 1 |
|
|
1696 | CODE: |
|
|
1697 | { |
|
|
1698 | if (coro->mainstack) |
|
|
1699 | { |
|
|
1700 | struct coro temp; |
|
|
1701 | |
|
|
1702 | if (!(coro->flags & CF_RUNNING)) |
|
|
1703 | { |
|
|
1704 | save_perl (aTHX_ &temp); |
|
|
1705 | load_perl (aTHX_ coro); |
|
|
1706 | } |
|
|
1707 | |
|
|
1708 | { |
|
|
1709 | dSP; |
|
|
1710 | ENTER; |
|
|
1711 | SAVETMPS; |
|
|
1712 | PUTBACK; |
|
|
1713 | PUSHSTACK; |
|
|
1714 | PUSHMARK (SP); |
|
|
1715 | |
|
|
1716 | if (ix) |
|
|
1717 | eval_sv (coderef, 0); |
|
|
1718 | else |
|
|
1719 | call_sv (coderef, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD); |
|
|
1720 | |
|
|
1721 | POPSTACK; |
|
|
1722 | SPAGAIN; |
|
|
1723 | FREETMPS; |
|
|
1724 | LEAVE; |
|
|
1725 | PUTBACK; |
|
|
1726 | } |
|
|
1727 | |
|
|
1728 | if (!(coro->flags & CF_RUNNING)) |
|
|
1729 | { |
|
|
1730 | save_perl (aTHX_ coro); |
|
|
1731 | load_perl (aTHX_ &temp); |
|
|
1732 | } |
|
|
1733 | } |
|
|
1734 | } |
|
|
1735 | |
|
|
1736 | SV * |
|
|
1737 | is_ready (Coro::State coro) |
|
|
1738 | PROTOTYPE: $ |
|
|
1739 | ALIAS: |
|
|
1740 | is_ready = CF_READY |
|
|
1741 | is_running = CF_RUNNING |
|
|
1742 | is_new = CF_NEW |
|
|
1743 | is_destroyed = CF_DESTROYED |
|
|
1744 | CODE: |
|
|
1745 | RETVAL = boolSV (coro->flags & ix); |
|
|
1746 | OUTPUT: |
|
|
1747 | RETVAL |
|
|
1748 | |
|
|
1749 | void |
|
|
1750 | api_trace (SV *coro, int flags = CC_TRACE | CC_TRACE_SUB) |
|
|
1751 | |
|
|
1752 | SV * |
|
|
1753 | has_stack (Coro::State coro) |
|
|
1754 | PROTOTYPE: $ |
|
|
1755 | CODE: |
|
|
1756 | RETVAL = boolSV (!!coro->cctx); |
|
|
1757 | OUTPUT: |
|
|
1758 | RETVAL |
|
|
1759 | |
|
|
1760 | int |
|
|
1761 | is_traced (Coro::State coro) |
|
|
1762 | PROTOTYPE: $ |
|
|
1763 | CODE: |
|
|
1764 | RETVAL = (coro->cctx ? coro->cctx->flags : 0) & CC_TRACE_ALL; |
|
|
1765 | OUTPUT: |
|
|
1766 | RETVAL |
|
|
1767 | |
|
|
1768 | IV |
|
|
1769 | rss (Coro::State coro) |
|
|
1770 | PROTOTYPE: $ |
|
|
1771 | ALIAS: |
|
|
1772 | usecount = 1 |
1005 | CODE: |
1773 | CODE: |
1006 | static SV *returnstk; |
1774 | switch (ix) |
1007 | SV *sv; |
1775 | { |
1008 | AV *defav = GvAV (PL_defgv); |
1776 | case 0: RETVAL = coro_rss (aTHX_ coro); break; |
1009 | struct coro *prev, *next; |
1777 | case 1: RETVAL = coro->usecount; break; |
|
|
1778 | } |
|
|
1779 | OUTPUT: |
|
|
1780 | RETVAL |
1010 | |
1781 | |
1011 | if (!returnstk) |
|
|
1012 | returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE)); |
|
|
1013 | |
|
|
1014 | /* set up @_ -- ugly */ |
|
|
1015 | av_clear (defav); |
|
|
1016 | av_fill (defav, items - 1); |
|
|
1017 | while (items--) |
|
|
1018 | av_store (defav, items, SvREFCNT_inc (ST(items))); |
|
|
1019 | |
|
|
1020 | mg_get (returnstk); /* isn't documentation wrong for mg_get? */ |
|
|
1021 | sv = av_pop ((AV *)SvRV (returnstk)); |
|
|
1022 | prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0))); |
|
|
1023 | next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))); |
|
|
1024 | SvREFCNT_dec (sv); |
|
|
1025 | |
|
|
1026 | transfer(aTHX_ prev, next, 0); |
|
|
1027 | |
1782 | |
1028 | MODULE = Coro::State PACKAGE = Coro |
1783 | MODULE = Coro::State PACKAGE = Coro |
1029 | |
1784 | |
1030 | # this is slightly dirty (should expose a c-level api) |
|
|
1031 | |
|
|
1032 | BOOT: |
1785 | BOOT: |
1033 | { |
1786 | { |
1034 | int i; |
1787 | int i; |
|
|
1788 | |
|
|
1789 | sv_pool_rss = coro_get_sv (aTHX_ "Coro::POOL_RSS" , TRUE); |
|
|
1790 | sv_pool_size = coro_get_sv (aTHX_ "Coro::POOL_SIZE" , TRUE); |
|
|
1791 | av_async_pool = coro_get_av (aTHX_ "Coro::async_pool", TRUE); |
|
|
1792 | |
|
|
1793 | coro_current = coro_get_sv (aTHX_ "Coro::current", FALSE); |
|
|
1794 | SvREADONLY_on (coro_current); |
|
|
1795 | |
1035 | HV *stash = gv_stashpv ("Coro", TRUE); |
1796 | coro_stash = gv_stashpv ("Coro", TRUE); |
1036 | |
1797 | |
1037 | newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); |
1798 | newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX)); |
1038 | newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); |
1799 | newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); |
1039 | newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); |
1800 | newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); |
1040 | newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); |
1801 | newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW)); |
1041 | newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); |
1802 | newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); |
1042 | newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); |
1803 | newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN)); |
1043 | |
|
|
1044 | coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); |
|
|
1045 | coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); |
|
|
1046 | |
1804 | |
1047 | for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) |
1805 | for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) |
1048 | coro_ready[i] = newAV (); |
1806 | coro_ready[i] = newAV (); |
1049 | |
1807 | |
1050 | { |
1808 | { |
1051 | SV *sv = perl_get_sv("Coro::API", 1); |
1809 | SV *sv = perl_get_sv ("Coro::API", TRUE); |
|
|
1810 | perl_get_sv ("Coro::API", TRUE); /* silence 5.10 warning */ |
1052 | |
1811 | |
1053 | coroapi.schedule = api_schedule; |
1812 | coroapi.schedule = api_schedule; |
1054 | coroapi.cede = api_cede; |
1813 | coroapi.cede = api_cede; |
|
|
1814 | coroapi.cede_notself = api_cede_notself; |
1055 | coroapi.ready = api_ready; |
1815 | coroapi.ready = api_ready; |
|
|
1816 | coroapi.is_ready = api_is_ready; |
1056 | coroapi.nready = &coro_nready; |
1817 | coroapi.nready = &coro_nready; |
1057 | coroapi.current = coro_current; |
1818 | coroapi.current = coro_current; |
1058 | |
1819 | |
1059 | GCoroAPI = &coroapi; |
1820 | GCoroAPI = &coroapi; |
1060 | sv_setiv(sv, (IV)&coroapi); |
1821 | sv_setiv (sv, (IV)&coroapi); |
1061 | SvREADONLY_on(sv); |
1822 | SvREADONLY_on (sv); |
1062 | } |
1823 | } |
1063 | } |
1824 | } |
1064 | |
1825 | |
1065 | void |
1826 | void |
1066 | ready(self) |
1827 | _set_current (SV *current) |
1067 | SV * self |
|
|
1068 | PROTOTYPE: $ |
1828 | PROTOTYPE: $ |
1069 | CODE: |
1829 | CODE: |
1070 | api_ready (self); |
1830 | SvREFCNT_dec (SvRV (coro_current)); |
|
|
1831 | SvRV_set (coro_current, SvREFCNT_inc (SvRV (current))); |
1071 | |
1832 | |
1072 | int |
1833 | int |
|
|
1834 | prio (Coro::State coro, int newprio = 0) |
|
|
1835 | ALIAS: |
|
|
1836 | nice = 1 |
|
|
1837 | CODE: |
|
|
1838 | { |
|
|
1839 | RETVAL = coro->prio; |
|
|
1840 | |
|
|
1841 | if (items > 1) |
|
|
1842 | { |
|
|
1843 | if (ix) |
|
|
1844 | newprio = coro->prio - newprio; |
|
|
1845 | |
|
|
1846 | if (newprio < PRIO_MIN) newprio = PRIO_MIN; |
|
|
1847 | if (newprio > PRIO_MAX) newprio = PRIO_MAX; |
|
|
1848 | |
|
|
1849 | coro->prio = newprio; |
|
|
1850 | } |
|
|
1851 | } |
|
|
1852 | OUTPUT: |
|
|
1853 | RETVAL |
|
|
1854 | |
|
|
1855 | SV * |
|
|
1856 | ready (SV *self) |
|
|
1857 | PROTOTYPE: $ |
|
|
1858 | CODE: |
|
|
1859 | RETVAL = boolSV (api_ready (self)); |
|
|
1860 | OUTPUT: |
|
|
1861 | RETVAL |
|
|
1862 | |
|
|
1863 | int |
1073 | nready(...) |
1864 | nready (...) |
1074 | PROTOTYPE: |
1865 | PROTOTYPE: |
1075 | CODE: |
1866 | CODE: |
1076 | RETVAL = coro_nready; |
1867 | RETVAL = coro_nready; |
1077 | OUTPUT: |
1868 | OUTPUT: |
1078 | RETVAL |
1869 | RETVAL |
1079 | |
1870 | |
1080 | void |
1871 | void |
1081 | schedule(...) |
1872 | throw (Coro::State self, SV *throw = &PL_sv_undef) |
1082 | PROTOTYPE: |
1873 | PROTOTYPE: $;$ |
|
|
1874 | CODE: |
|
|
1875 | SvREFCNT_dec (self->throw); |
|
|
1876 | self->throw = SvOK (throw) ? newSVsv (throw) : 0; |
|
|
1877 | |
|
|
1878 | # for async_pool speedup |
|
|
1879 | void |
|
|
1880 | _pool_1 (SV *cb) |
1083 | CODE: |
1881 | CODE: |
1084 | api_schedule (); |
1882 | { |
|
|
1883 | struct coro *coro = SvSTATE (coro_current); |
|
|
1884 | HV *hv = (HV *)SvRV (coro_current); |
|
|
1885 | AV *defav = GvAV (PL_defgv); |
|
|
1886 | SV *invoke = hv_delete (hv, "_invoke", sizeof ("_invoke") - 1, 0); |
|
|
1887 | AV *invoke_av; |
|
|
1888 | int i, len; |
|
|
1889 | |
|
|
1890 | if (!invoke) |
|
|
1891 | croak ("\3async_pool terminate\2\n"); |
|
|
1892 | |
|
|
1893 | SvREFCNT_dec (coro->saved_deffh); |
|
|
1894 | coro->saved_deffh = SvREFCNT_inc ((SV *)PL_defoutgv); |
|
|
1895 | |
|
|
1896 | hv_store (hv, "desc", sizeof ("desc") - 1, |
|
|
1897 | newSVpvn ("[async_pool]", sizeof ("[async_pool]") - 1), 0); |
|
|
1898 | |
|
|
1899 | invoke_av = (AV *)SvRV (invoke); |
|
|
1900 | len = av_len (invoke_av); |
|
|
1901 | |
|
|
1902 | sv_setsv (cb, AvARRAY (invoke_av)[0]); |
|
|
1903 | |
|
|
1904 | if (len > 0) |
|
|
1905 | { |
|
|
1906 | av_fill (defav, len - 1); |
|
|
1907 | for (i = 0; i < len; ++i) |
|
|
1908 | av_store (defav, i, SvREFCNT_inc (AvARRAY (invoke_av)[i + 1])); |
|
|
1909 | } |
|
|
1910 | |
|
|
1911 | SvREFCNT_dec (invoke); |
|
|
1912 | } |
1085 | |
1913 | |
1086 | void |
1914 | void |
1087 | cede(...) |
1915 | _pool_2 (SV *cb) |
1088 | PROTOTYPE: |
|
|
1089 | CODE: |
1916 | CODE: |
1090 | api_cede (); |
1917 | { |
|
|
1918 | struct coro *coro = SvSTATE (coro_current); |
1091 | |
1919 | |
|
|
1920 | sv_setsv (cb, &PL_sv_undef); |
|
|
1921 | |
|
|
1922 | SvREFCNT_dec ((SV *)PL_defoutgv); PL_defoutgv = (GV *)coro->saved_deffh; |
|
|
1923 | coro->saved_deffh = 0; |
|
|
1924 | |
|
|
1925 | if (coro_rss (aTHX_ coro) > SvIV (sv_pool_rss) |
|
|
1926 | || av_len (av_async_pool) + 1 >= SvIV (sv_pool_size)) |
|
|
1927 | croak ("\3async_pool terminate\2\n"); |
|
|
1928 | |
|
|
1929 | av_clear (GvAV (PL_defgv)); |
|
|
1930 | hv_store ((HV *)SvRV (coro_current), "desc", sizeof ("desc") - 1, |
|
|
1931 | newSVpvn ("[async_pool idle]", sizeof ("[async_pool idle]") - 1), 0); |
|
|
1932 | |
|
|
1933 | coro->prio = 0; |
|
|
1934 | |
|
|
1935 | if (coro->cctx && (coro->cctx->flags & CC_TRACE)) |
|
|
1936 | api_trace (coro_current, 0); |
|
|
1937 | |
|
|
1938 | av_push (av_async_pool, newSVsv (coro_current)); |
|
|
1939 | } |
|
|
1940 | |
|
|
1941 | |
|
|
1942 | MODULE = Coro::State PACKAGE = Coro::AIO |
|
|
1943 | |
|
|
1944 | SV * |
|
|
1945 | _get_state () |
|
|
1946 | CODE: |
|
|
1947 | { |
|
|
1948 | struct io_state *data; |
|
|
1949 | |
|
|
1950 | RETVAL = newSV (sizeof (struct io_state)); |
|
|
1951 | data = (struct io_state *)SvPVX (RETVAL); |
|
|
1952 | SvCUR_set (RETVAL, sizeof (struct io_state)); |
|
|
1953 | SvPOK_only (RETVAL); |
|
|
1954 | |
|
|
1955 | data->errorno = errno; |
|
|
1956 | data->laststype = PL_laststype; |
|
|
1957 | data->laststatval = PL_laststatval; |
|
|
1958 | data->statcache = PL_statcache; |
|
|
1959 | } |
|
|
1960 | OUTPUT: |
|
|
1961 | RETVAL |
|
|
1962 | |
|
|
1963 | void |
|
|
1964 | _set_state (char *data_) |
|
|
1965 | PROTOTYPE: $ |
|
|
1966 | CODE: |
|
|
1967 | { |
|
|
1968 | struct io_state *data = (void *)data_; |
|
|
1969 | |
|
|
1970 | errno = data->errorno; |
|
|
1971 | PL_laststype = data->laststype; |
|
|
1972 | PL_laststatval = data->laststatval; |
|
|
1973 | PL_statcache = data->statcache; |
|
|
1974 | } |
|
|
1975 | |