|
|
1 | #include "libcoro/coro.c" |
|
|
2 | |
1 | #include "EXTERN.h" |
3 | #include "EXTERN.h" |
2 | #include "perl.h" |
4 | #include "perl.h" |
3 | #include "XSUB.h" |
5 | #include "XSUB.h" |
4 | |
6 | |
5 | #include "libcoro/coro.c" |
7 | #include "patchlevel.h" |
6 | |
8 | |
|
|
9 | #if USE_VALGRIND |
|
|
10 | # include <valgrind/valgrind.h> |
|
|
11 | #endif |
|
|
12 | |
|
|
13 | #define PERL_VERSION_ATLEAST(a,b,c) \ |
|
|
14 | (PERL_REVISION > (a) \ |
|
|
15 | || (PERL_REVISION == (a) \ |
|
|
16 | && (PERL_VERSION > (b) \ |
|
|
17 | || (PERL_VERSION == (b) && PERLSUBVERSION >= (c))))) |
|
|
18 | |
|
|
19 | #if !PERL_VERSION_ATLEAST (5,6,0) |
|
|
20 | # ifndef PL_ppaddr |
|
|
21 | # define PL_ppaddr ppaddr |
|
|
22 | # endif |
|
|
23 | # ifndef call_sv |
|
|
24 | # define call_sv perl_call_sv |
|
|
25 | # endif |
|
|
26 | # ifndef get_sv |
|
|
27 | # define get_sv perl_get_sv |
|
|
28 | # endif |
|
|
29 | # ifndef get_cv |
|
|
30 | # define get_cv perl_get_cv |
|
|
31 | # endif |
|
|
32 | # ifndef IS_PADGV |
|
|
33 | # define IS_PADGV(v) 0 |
|
|
34 | # endif |
|
|
35 | # ifndef IS_PADCONST |
|
|
36 | # define IS_PADCONST(v) 0 |
|
|
37 | # endif |
|
|
38 | #endif |
|
|
39 | |
7 | #include <signal.h> |
40 | #include <stdio.h> |
|
|
41 | #include <errno.h> |
|
|
42 | |
|
|
43 | #if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64 |
|
|
44 | # undef STACKGUARD |
|
|
45 | #endif |
|
|
46 | |
|
|
47 | #ifndef STACKGUARD |
|
|
48 | # define STACKGUARD 0 |
|
|
49 | #endif |
8 | |
50 | |
9 | #ifdef HAVE_MMAP |
51 | #ifdef HAVE_MMAP |
10 | # include <unistd.h> |
52 | # include <unistd.h> |
11 | # include <sys/mman.h> |
53 | # include <sys/mman.h> |
12 | # ifndef MAP_ANONYMOUS |
54 | # ifndef MAP_ANONYMOUS |
… | |
… | |
14 | # define MAP_ANONYMOUS MAP_ANON |
56 | # define MAP_ANONYMOUS MAP_ANON |
15 | # else |
57 | # else |
16 | # undef HAVE_MMAP |
58 | # undef HAVE_MMAP |
17 | # endif |
59 | # endif |
18 | # endif |
60 | # endif |
|
|
61 | # include <limits.h> |
|
|
62 | # ifndef PAGESIZE |
|
|
63 | # define PAGESIZE pagesize |
|
|
64 | # define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE) |
|
|
65 | static long pagesize; |
|
|
66 | # else |
|
|
67 | # define BOOT_PAGESIZE (void)0 |
19 | #endif |
68 | # endif |
20 | |
69 | #else |
21 | #define MAY_FLUSH /* increases codesize and is rarely used */ |
70 | # define PAGESIZE 0 |
22 | |
71 | # define BOOT_PAGESIZE (void)0 |
23 | #define SUB_INIT "Coro::State::initialize" |
72 | #endif |
24 | #define UCORO_STATE "_coro_state" |
|
|
25 | |
73 | |
26 | /* The next macro should declare a variable stacklevel that contains and approximation |
74 | /* The next macro should declare a variable stacklevel that contains and approximation |
27 | * to the current C stack pointer. Its property is that it changes with each call |
75 | * to the current C stack pointer. Its property is that it changes with each call |
28 | * and should be unique. */ |
76 | * and should be unique. */ |
|
|
77 | #define dSTACKLEVEL int stacklevel |
29 | #define dSTACKLEVEL void *stacklevel = &stacklevel |
78 | #define STACKLEVEL ((void *)&stacklevel) |
30 | |
79 | |
31 | #define IN_DESTRUCT (PL_main_cv == Nullcv) |
80 | #define IN_DESTRUCT (PL_main_cv == Nullcv) |
32 | |
81 | |
33 | #define labs(l) ((l) >= 0 ? (l) : -(l)) |
82 | #if __GNUC__ >= 3 |
|
|
83 | # define attribute(x) __attribute__(x) |
|
|
84 | #else |
|
|
85 | # define attribute(x) |
|
|
86 | #endif |
|
|
87 | |
|
|
88 | #define NOINLINE attribute ((noinline)) |
34 | |
89 | |
35 | #include "CoroAPI.h" |
90 | #include "CoroAPI.h" |
36 | |
91 | |
|
|
92 | #define TRANSFER_SET_STACKLEVEL 0x8bfbfbfb /* magic cookie */ |
|
|
93 | |
|
|
94 | #ifdef USE_ITHREADS |
|
|
95 | static perl_mutex coro_mutex; |
|
|
96 | # define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0) |
|
|
97 | # define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0) |
|
|
98 | #else |
|
|
99 | # define LOCK (void)0 |
|
|
100 | # define UNLOCK (void)0 |
|
|
101 | #endif |
|
|
102 | |
37 | static struct CoroAPI coroapi; |
103 | static struct CoroAPI coroapi; |
|
|
104 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
|
|
105 | static HV *coro_state_stash, *coro_stash; |
|
|
106 | static SV *coro_mortal; /* will be freed after next transfer */ |
38 | |
107 | |
39 | /* this is actually not only the c stack but also c registers etc... */ |
108 | static struct coro_cctx *cctx_first; |
|
|
109 | static int cctx_count, cctx_idle; |
|
|
110 | |
|
|
111 | /* this is a structure representing a c-level coroutine */ |
40 | typedef struct { |
112 | typedef struct coro_cctx { |
41 | int refcnt; /* pointer reference counter */ |
113 | struct coro_cctx *next; |
42 | int usecnt; /* shared by how many coroutines */ |
|
|
43 | int gencnt; /* generation counter */ |
|
|
44 | |
114 | |
45 | coro_context cctx; |
115 | /* the stack */ |
46 | |
|
|
47 | void *sptr; |
116 | void *sptr; |
48 | long ssize; /* positive == mmap, otherwise malloc */ |
117 | long ssize; /* positive == mmap, otherwise malloc */ |
49 | } coro_stack; |
|
|
50 | |
118 | |
|
|
119 | /* cpu state */ |
|
|
120 | void *idle_sp; /* sp of top-level transfer/schedule/cede call */ |
|
|
121 | JMPENV *top_env; |
|
|
122 | coro_context cctx; |
|
|
123 | |
|
|
124 | #if USE_VALGRIND |
|
|
125 | int valgrind_id; |
|
|
126 | #endif |
|
|
127 | } coro_cctx; |
|
|
128 | |
|
|
129 | /* this is a structure representing a perl-level coroutine */ |
51 | struct coro { |
130 | struct coro { |
52 | /* the optional C context */ |
131 | /* the c coroutine allocated to this perl coroutine, if any */ |
53 | coro_stack *stack; |
132 | coro_cctx *cctx; |
54 | void *cursp; |
133 | |
|
|
134 | /* data associated with this coroutine (initial args) */ |
|
|
135 | AV *args; |
55 | int gencnt; |
136 | int refcnt; |
56 | |
137 | |
57 | /* optionally saved, might be zero */ |
138 | /* optionally saved, might be zero */ |
58 | AV *defav; |
139 | AV *defav; |
59 | SV *defsv; |
140 | SV *defsv; |
60 | SV *errsv; |
141 | SV *errsv; |
61 | |
142 | |
62 | /* saved global state not related to stacks */ |
143 | #define VAR(name,type) type name; |
63 | U8 dowarn; |
144 | # include "state.h" |
64 | I32 in_eval; |
145 | #undef VAR |
65 | |
146 | |
66 | /* the stacks and related info (callchain etc..) */ |
147 | /* coro process data */ |
67 | PERL_SI *curstackinfo; |
148 | int prio; |
68 | AV *curstack; |
|
|
69 | AV *mainstack; |
|
|
70 | SV **stack_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 | |
|
|
95 | /* data associated with this coroutine (initial args) */ |
|
|
96 | AV *args; |
|
|
97 | }; |
149 | }; |
98 | |
150 | |
99 | typedef struct coro *Coro__State; |
151 | typedef struct coro *Coro__State; |
100 | typedef struct coro *Coro__State_or_hashref; |
152 | typedef struct coro *Coro__State_or_hashref; |
101 | |
153 | |
102 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
154 | static AV * |
103 | static HV *coro_state_stash; |
155 | coro_clone_padlist (CV *cv) |
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 | { |
156 | { |
113 | AV *av; |
157 | AV *padlist = CvPADLIST (cv); |
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; |
158 | AV *newpadlist, *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 | |
159 | |
132 | newpadlist = newAV (); |
160 | newpadlist = newAV (); |
133 | AvREAL_off (newpadlist); |
161 | AvREAL_off (newpadlist); |
134 | av_store (newpadlist, 0, (SV *) newpad_name); |
162 | #if PERL_VERSION_ATLEAST (5,9,0) |
|
|
163 | Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1); |
|
|
164 | #else |
|
|
165 | Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1); |
|
|
166 | #endif |
|
|
167 | newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)]; |
|
|
168 | --AvFILLp (padlist); |
|
|
169 | |
|
|
170 | av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE))); |
135 | av_store (newpadlist, 1, (SV *) newpad); |
171 | av_store (newpadlist, 1, (SV *)newpad); |
136 | |
172 | |
137 | av = newAV (); /* will be @_ */ |
173 | return newpadlist; |
138 | av_extend (av, 0); |
174 | } |
139 | av_store (newpad, 0, (SV *) av); |
|
|
140 | AvFLAGS (av) = AVf_REIFY; |
|
|
141 | |
175 | |
142 | for (ix = fpad; ix > 0; ix--) |
176 | static void |
|
|
177 | free_padlist (AV *padlist) |
|
|
178 | { |
|
|
179 | /* may be during global destruction */ |
|
|
180 | if (SvREFCNT (padlist)) |
143 | { |
181 | { |
144 | SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; |
182 | I32 i = AvFILLp (padlist); |
145 | if (namesv && namesv != &PL_sv_undef) |
183 | while (i >= 0) |
146 | { |
184 | { |
147 | char *name = SvPVX (namesv); /* XXX */ |
185 | SV **svp = av_fetch (padlist, i--, FALSE); |
148 | if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') |
186 | if (svp) |
149 | { /* lexical from outside? */ |
|
|
150 | npad[ix] = SvREFCNT_inc (ppad[ix]); |
|
|
151 | } |
187 | { |
152 | else |
|
|
153 | { /* our own lexical */ |
|
|
154 | SV *sv; |
188 | SV *sv; |
155 | if (*name == '&') |
189 | while (&PL_sv_undef != (sv = av_pop ((AV *)*svp))) |
156 | sv = SvREFCNT_inc (ppad[ix]); |
190 | SvREFCNT_dec (sv); |
157 | else if (*name == '@') |
191 | |
158 | sv = (SV *) newAV (); |
192 | SvREFCNT_dec (*svp); |
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 | } |
193 | } |
167 | } |
194 | } |
168 | else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) |
195 | |
169 | { |
196 | SvREFCNT_dec ((SV*)padlist); |
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 | } |
197 | } |
|
|
198 | } |
179 | |
199 | |
180 | #if 0 /* return -ENOTUNDERSTOOD */ |
200 | static int |
181 | /* Now that vars are all in place, clone nested closures. */ |
201 | coro_cv_free (pTHX_ SV *sv, MAGIC *mg) |
|
|
202 | { |
|
|
203 | AV *padlist; |
|
|
204 | AV *av = (AV *)mg->mg_obj; |
182 | |
205 | |
183 | for (ix = fpad; ix > 0; ix--) { |
206 | /* casting is fun. */ |
184 | SV* namesv = (ix <= fname) ? pname[ix] : Nullsv; |
207 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
185 | if (namesv |
208 | free_padlist (padlist); |
186 | && namesv != &PL_sv_undef |
209 | |
187 | && !(SvFLAGS(namesv) & SVf_FAKE) |
210 | SvREFCNT_dec (av); |
188 | && *SvPVX(namesv) == '&' |
211 | |
189 | && CvCLONE(ppad[ix])) |
212 | return 0; |
190 | { |
213 | } |
191 | CV *kid = cv_clone((CV*)ppad[ix]); |
214 | |
192 | SvREFCNT_dec(ppad[ix]); |
215 | #define PERL_MAGIC_coro PERL_MAGIC_ext |
193 | CvCLONE_on(kid); |
216 | |
194 | SvPADMY_on(kid); |
217 | static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; |
195 | npad[ix] = (SV*)kid; |
218 | |
196 | } |
219 | #define CORO_MAGIC(cv) \ |
|
|
220 | SvMAGIC (cv) \ |
|
|
221 | ? SvMAGIC (cv)->mg_type == PERL_MAGIC_coro \ |
|
|
222 | ? SvMAGIC (cv) \ |
|
|
223 | : mg_find ((SV *)cv, PERL_MAGIC_coro) \ |
|
|
224 | : 0 |
|
|
225 | |
|
|
226 | /* the next two functions merely cache the padlists */ |
|
|
227 | static void |
|
|
228 | get_padlist (CV *cv) |
|
|
229 | { |
|
|
230 | MAGIC *mg = CORO_MAGIC (cv); |
|
|
231 | AV *av; |
|
|
232 | |
|
|
233 | if (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0) |
|
|
234 | CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--]; |
|
|
235 | else |
|
|
236 | { |
|
|
237 | #if 0 |
|
|
238 | /* this is probably cleaner, but also slower? */ |
|
|
239 | CV *cp = Perl_cv_clone (cv); |
|
|
240 | CvPADLIST (cv) = CvPADLIST (cp); |
|
|
241 | CvPADLIST (cp) = 0; |
|
|
242 | SvREFCNT_dec (cp); |
|
|
243 | #else |
|
|
244 | CvPADLIST (cv) = coro_clone_padlist (cv); |
|
|
245 | #endif |
|
|
246 | } |
|
|
247 | } |
|
|
248 | |
|
|
249 | static void |
|
|
250 | put_padlist (CV *cv) |
|
|
251 | { |
|
|
252 | MAGIC *mg = CORO_MAGIC (cv); |
|
|
253 | AV *av; |
|
|
254 | |
|
|
255 | if (!mg) |
|
|
256 | { |
|
|
257 | sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0); |
|
|
258 | mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
|
|
259 | mg->mg_virtual = &vtbl_coro; |
|
|
260 | mg->mg_obj = (SV *)newAV (); |
197 | } |
261 | } |
198 | #endif |
|
|
199 | |
262 | |
200 | return newpadlist; |
263 | av = (AV *)mg->mg_obj; |
201 | } |
|
|
202 | |
264 | |
203 | #ifdef MAY_FLUSH |
265 | if (AvFILLp (av) >= AvMAX (av)) |
204 | STATIC void |
266 | av_extend (av, AvMAX (av) + 1); |
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 | |
267 | |
219 | SvREFCNT_dec((SV*)padlist); |
268 | AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv); |
220 | } |
|
|
221 | } |
269 | } |
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 | |
270 | |
276 | #define SB do { |
271 | #define SB do { |
277 | #define SE } while (0) |
272 | #define SE } while (0) |
278 | |
273 | |
279 | #define LOAD(state) load_state(aTHX_ (state)); |
274 | #define LOAD(state) load_state((state)); |
280 | #define SAVE(state,flags) save_state(aTHX_ (state),(flags)); |
275 | #define SAVE(state,flags) save_state((state),(flags)); |
281 | |
276 | |
282 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE |
277 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE |
283 | |
278 | |
284 | static void |
279 | static void |
285 | load_state(pTHX_ Coro__State c) |
280 | load_state(Coro__State c) |
286 | { |
281 | { |
287 | PL_dowarn = c->dowarn; |
282 | #define VAR(name,type) PL_ ## name = c->name; |
288 | PL_in_eval = c->in_eval; |
283 | # include "state.h" |
289 | |
284 | #undef VAR |
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 | |
285 | |
318 | if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); |
286 | if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); |
319 | if (c->defsv) REPLACE_SV (DEFSV , c->defsv); |
287 | if (c->defsv) REPLACE_SV (DEFSV , c->defsv); |
320 | if (c->errsv) REPLACE_SV (ERRSV , c->errsv); |
288 | if (c->errsv) REPLACE_SV (ERRSV , c->errsv); |
321 | |
289 | |
… | |
… | |
324 | CV *cv; |
292 | CV *cv; |
325 | |
293 | |
326 | /* now do the ugly restore mess */ |
294 | /* now do the ugly restore mess */ |
327 | while ((cv = (CV *)POPs)) |
295 | while ((cv = (CV *)POPs)) |
328 | { |
296 | { |
329 | AV *padlist = (AV *)POPs; |
|
|
330 | |
|
|
331 | if (padlist) |
|
|
332 | { |
|
|
333 | put_padlist (cv); /* mark this padlist as available */ |
297 | put_padlist (cv); /* mark this padlist as available */ |
334 | CvPADLIST(cv) = padlist; |
298 | CvDEPTH (cv) = PTR2IV (POPs); |
335 | #ifdef USE_THREADS |
299 | CvPADLIST (cv) = (AV *)POPs; |
336 | /*CvOWNER(cv) = (struct perl_thread *)POPs;*/ |
|
|
337 | #endif |
|
|
338 | } |
|
|
339 | |
|
|
340 | ++CvDEPTH(cv); |
|
|
341 | } |
300 | } |
342 | |
301 | |
343 | PUTBACK; |
302 | PUTBACK; |
344 | } |
303 | } |
345 | } |
304 | } |
346 | |
305 | |
347 | static void |
306 | static void |
348 | save_state(pTHX_ Coro__State c, int flags) |
307 | save_state(Coro__State c, int flags) |
349 | { |
308 | { |
350 | { |
309 | { |
351 | dSP; |
310 | dSP; |
352 | I32 cxix = cxstack_ix; |
311 | I32 cxix = cxstack_ix; |
353 | PERL_CONTEXT *ccstk = cxstack; |
312 | PERL_CONTEXT *ccstk = cxstack; |
… | |
… | |
367 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
326 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
368 | |
327 | |
369 | if (CxTYPE(cx) == CXt_SUB) |
328 | if (CxTYPE(cx) == CXt_SUB) |
370 | { |
329 | { |
371 | CV *cv = cx->blk_sub.cv; |
330 | CV *cv = cx->blk_sub.cv; |
|
|
331 | |
372 | if (CvDEPTH(cv)) |
332 | if (CvDEPTH (cv)) |
373 | { |
333 | { |
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); |
334 | EXTEND (SP, 3); |
380 | |
|
|
381 | while (--CvDEPTH(cv)) |
|
|
382 | { |
|
|
383 | /* this tells the restore code to increment CvDEPTH */ |
|
|
384 | PUSHs (Nullsv); |
|
|
385 | PUSHs ((SV *)cv); |
|
|
386 | } |
|
|
387 | |
335 | |
388 | PUSHs ((SV *)CvPADLIST(cv)); |
336 | PUSHs ((SV *)CvPADLIST(cv)); |
|
|
337 | PUSHs (INT2PTR (SV *, CvDEPTH (cv))); |
389 | PUSHs ((SV *)cv); |
338 | PUSHs ((SV *)cv); |
390 | |
339 | |
|
|
340 | CvDEPTH (cv) = 0; |
391 | get_padlist (cv); /* this is a monster */ |
341 | get_padlist (cv); |
392 | } |
342 | } |
393 | } |
343 | } |
|
|
344 | #ifdef CXt_FORMAT |
394 | else if (CxTYPE(cx) == CXt_FORMAT) |
345 | else if (CxTYPE(cx) == CXt_FORMAT) |
395 | { |
346 | { |
396 | /* I never used formats, so how should I know how these are implemented? */ |
347 | /* I never used formats, so how should I know how these are implemented? */ |
397 | /* my bold guess is as a simple, plain sub... */ |
348 | /* my bold guess is as a simple, plain sub... */ |
398 | croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); |
349 | croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); |
399 | } |
350 | } |
|
|
351 | #endif |
400 | } |
352 | } |
401 | |
353 | |
402 | if (top_si->si_type == PERLSI_MAIN) |
354 | if (top_si->si_type == PERLSI_MAIN) |
403 | break; |
355 | break; |
404 | |
356 | |
… | |
… | |
412 | |
364 | |
413 | c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
365 | c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
414 | c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
366 | c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
415 | c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
367 | c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
416 | |
368 | |
417 | c->dowarn = PL_dowarn; |
369 | #define VAR(name,type)c->name = PL_ ## name; |
418 | c->in_eval = PL_in_eval; |
370 | # include "state.h" |
419 | |
371 | #undef VAR |
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 | } |
372 | } |
448 | |
373 | |
449 | /* |
374 | /* |
450 | * allocate various perl stacks. This is an exact copy |
375 | * allocate various perl stacks. This is an exact copy |
451 | * of perl.c:init_stacks, except that it uses less memory |
376 | * of perl.c:init_stacks, except that it uses less memory |
452 | * on the assumption that coroutines do not usually need |
377 | * on the (sometimes correct) assumption that coroutines do |
453 | * a lot of stackspace. |
378 | * not usually need a lot of stackspace. |
454 | */ |
379 | */ |
455 | STATIC void |
380 | static void |
456 | coro_init_stacks (pTHX) |
381 | coro_init_stacks () |
457 | { |
382 | { |
458 | PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); |
383 | PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); |
459 | PL_curstackinfo->si_type = PERLSI_MAIN; |
384 | PL_curstackinfo->si_type = PERLSI_MAIN; |
460 | PL_curstack = PL_curstackinfo->si_stack; |
385 | PL_curstack = PL_curstackinfo->si_stack; |
461 | PL_mainstack = PL_curstack; /* remember in case we switch stacks */ |
386 | PL_mainstack = PL_curstack; /* remember in case we switch stacks */ |
… | |
… | |
471 | |
396 | |
472 | New(54,PL_markstack,16,I32); |
397 | New(54,PL_markstack,16,I32); |
473 | PL_markstack_ptr = PL_markstack; |
398 | PL_markstack_ptr = PL_markstack; |
474 | PL_markstack_max = PL_markstack + 16; |
399 | PL_markstack_max = PL_markstack + 16; |
475 | |
400 | |
|
|
401 | #ifdef SET_MARK_OFFSET |
476 | SET_MARK_OFFSET; |
402 | SET_MARK_OFFSET; |
|
|
403 | #endif |
477 | |
404 | |
478 | New(54,PL_scopestack,16,I32); |
405 | New(54,PL_scopestack,16,I32); |
479 | PL_scopestack_ix = 0; |
406 | PL_scopestack_ix = 0; |
480 | PL_scopestack_max = 16; |
407 | PL_scopestack_max = 16; |
481 | |
408 | |
482 | New(54,PL_savestack,96,ANY); |
409 | New(54,PL_savestack,96,ANY); |
483 | PL_savestack_ix = 0; |
410 | PL_savestack_ix = 0; |
484 | PL_savestack_max = 96; |
411 | PL_savestack_max = 96; |
485 | |
412 | |
|
|
413 | #if !PERL_VERSION_ATLEAST (5,9,0) |
486 | New(54,PL_retstack,8,OP*); |
414 | New(54,PL_retstack,8,OP*); |
487 | PL_retstack_ix = 0; |
415 | PL_retstack_ix = 0; |
488 | PL_retstack_max = 8; |
416 | PL_retstack_max = 8; |
|
|
417 | #endif |
489 | } |
418 | } |
490 | |
419 | |
491 | /* |
420 | /* |
492 | * destroy the stacks, the callchain etc... |
421 | * destroy the stacks, the callchain etc... |
493 | * still there is a memleak of 128 bytes... |
|
|
494 | */ |
422 | */ |
495 | STATIC void |
423 | static void |
496 | destroy_stacks(pTHX) |
424 | coro_destroy_stacks () |
497 | { |
425 | { |
498 | if (!IN_DESTRUCT) |
426 | if (!IN_DESTRUCT) |
499 | { |
427 | { |
500 | /* is this ugly, I ask? */ |
428 | /* is this ugly, I ask? */ |
501 | while (PL_scopestack_ix) |
429 | LEAVE_SCOPE (0); |
502 | LEAVE; |
|
|
503 | |
430 | |
504 | /* sure it is, but more important: is it correct?? :/ */ |
431 | /* 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; |
432 | FREETMPS; |
|
|
433 | |
|
|
434 | /*POPSTACK_TO (PL_mainstack);*//*D*//*use*/ |
507 | } |
435 | } |
508 | |
436 | |
509 | while (PL_curstackinfo->si_next) |
437 | while (PL_curstackinfo->si_next) |
510 | PL_curstackinfo = PL_curstackinfo->si_next; |
438 | PL_curstackinfo = PL_curstackinfo->si_next; |
511 | |
439 | |
512 | while (PL_curstackinfo) |
440 | while (PL_curstackinfo) |
513 | { |
441 | { |
514 | PERL_SI *p = PL_curstackinfo->si_prev; |
442 | PERL_SI *p = PL_curstackinfo->si_prev; |
515 | |
443 | |
516 | { |
444 | { /*D*//*remove*/ |
517 | dSP; |
445 | dSP; |
518 | SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); |
446 | SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); |
519 | PUTBACK; /* possibly superfluous */ |
447 | PUTBACK; /* possibly superfluous */ |
520 | } |
448 | } |
521 | |
449 | |
522 | if (!IN_DESTRUCT) |
450 | if (!IN_DESTRUCT) |
523 | { |
451 | { |
524 | dounwind(-1); |
452 | dounwind (-1);/*D*//*remove*/ |
525 | SvREFCNT_dec(PL_curstackinfo->si_stack); |
453 | SvREFCNT_dec (PL_curstackinfo->si_stack); |
526 | } |
454 | } |
527 | |
455 | |
528 | Safefree(PL_curstackinfo->si_cxstack); |
456 | Safefree (PL_curstackinfo->si_cxstack); |
529 | Safefree(PL_curstackinfo); |
457 | Safefree (PL_curstackinfo); |
530 | PL_curstackinfo = p; |
458 | PL_curstackinfo = p; |
531 | } |
459 | } |
532 | |
460 | |
533 | Safefree(PL_tmps_stack); |
461 | Safefree (PL_tmps_stack); |
534 | Safefree(PL_markstack); |
462 | Safefree (PL_markstack); |
535 | Safefree(PL_scopestack); |
463 | Safefree (PL_scopestack); |
536 | Safefree(PL_savestack); |
464 | Safefree (PL_savestack); |
|
|
465 | #if !PERL_VERSION_ATLEAST (5,9,0) |
537 | Safefree(PL_retstack); |
466 | 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 |
467 | #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 | } |
468 | } |
568 | |
469 | |
569 | static void |
470 | static void |
570 | deallocate_stack (Coro__State ctx) |
471 | setup_coro (struct coro *coro) |
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 | { |
472 | { |
597 | /* |
473 | /* |
598 | * emulate part of the perl startup here. |
474 | * emulate part of the perl startup here. |
599 | */ |
475 | */ |
600 | dSP; |
|
|
601 | Coro__State ctx = (Coro__State)arg; |
|
|
602 | SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE); |
|
|
603 | |
476 | |
604 | coro_init_stacks (aTHX); |
477 | coro_init_stacks (); |
|
|
478 | |
605 | /*PL_curcop = 0;*/ |
479 | PL_curcop = 0; |
606 | /*PL_in_eval = PL_in_eval;*/ /* inherit */ |
480 | PL_in_eval = 0; |
|
|
481 | PL_curpm = 0; |
|
|
482 | |
|
|
483 | { |
|
|
484 | dSP; |
|
|
485 | LOGOP myop; |
|
|
486 | |
|
|
487 | /* I have no idea why this is needed, but it is */ |
|
|
488 | PUSHMARK (SP); |
|
|
489 | |
607 | SvREFCNT_dec (GvAV (PL_defgv)); |
490 | SvREFCNT_dec (GvAV (PL_defgv)); |
608 | GvAV (PL_defgv) = ctx->args; |
491 | GvAV (PL_defgv) = coro->args; coro->args = 0; |
609 | |
492 | |
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); |
493 | Zero (&myop, 1, LOGOP); |
632 | myop.op_next = Nullop; |
494 | myop.op_next = Nullop; |
633 | myop.op_flags = OPf_WANT_VOID; |
495 | myop.op_flags = OPf_WANT_VOID; |
634 | |
496 | |
|
|
497 | PL_op = (OP *)&myop; |
|
|
498 | |
635 | PUSHMARK(SP); |
499 | PUSHMARK (SP); |
636 | XPUSHs (sub_init); |
500 | XPUSHs ((SV *)get_cv ("Coro::State::_coro_init", FALSE)); |
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; |
501 | PUTBACK; |
645 | PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
502 | PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
646 | SPAGAIN; |
503 | SPAGAIN; |
647 | |
504 | |
648 | ENTER; /* necessary e.g. for dounwind */ |
505 | ENTER; /* necessary e.g. for dounwind */ |
649 | } |
506 | } |
650 | } |
507 | } |
651 | |
508 | |
652 | static void |
509 | static void |
653 | continue_coro (void *arg) |
510 | free_coro_mortal () |
654 | { |
511 | { |
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) |
512 | if (coro_mortal) |
763 | { |
513 | { |
764 | SvREFCNT_dec (coro_mortal); |
514 | SvREFCNT_dec (coro_mortal); |
765 | coro_mortal = 0; |
515 | coro_mortal = 0; |
766 | } |
516 | } |
767 | } |
517 | } |
768 | |
518 | |
769 | #define SV_CORO(sv,func) \ |
519 | static void NOINLINE |
770 | do { \ |
520 | prepare_cctx (coro_cctx *cctx) |
771 | if (SvROK (sv)) \ |
521 | { |
772 | sv = SvRV (sv); \ |
522 | dSP; |
773 | \ |
523 | LOGOP myop; |
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 | |
524 | |
790 | #define SvSTATE(sv) (struct coro *)SvIV (sv) |
525 | Zero (&myop, 1, LOGOP); |
|
|
526 | myop.op_next = PL_op; |
|
|
527 | myop.op_flags = OPf_WANT_VOID; |
791 | |
528 | |
|
|
529 | sv_setiv (get_sv ("Coro::State::_cctx", FALSE), PTR2IV (cctx)); |
|
|
530 | |
|
|
531 | PUSHMARK (SP); |
|
|
532 | XPUSHs ((SV *)get_cv ("Coro::State::_cctx_init", FALSE)); |
|
|
533 | PUTBACK; |
|
|
534 | PL_restartop = PL_ppaddr[OP_ENTERSUB](aTHX); |
|
|
535 | SPAGAIN; |
|
|
536 | } |
|
|
537 | |
|
|
538 | static void |
|
|
539 | coro_run (void *arg) |
|
|
540 | { |
|
|
541 | /* coro_run is the alternative epilogue of transfer() */ |
|
|
542 | UNLOCK; |
|
|
543 | |
|
|
544 | /* |
|
|
545 | * this is a _very_ stripped down perl interpreter ;) |
|
|
546 | */ |
|
|
547 | PL_top_env = &PL_start_env; |
|
|
548 | |
|
|
549 | /* inject call to cctx_init */ |
|
|
550 | prepare_cctx ((coro_cctx *)arg); |
|
|
551 | |
|
|
552 | /* somebody will hit me for both perl_run and PL_restartop */ |
|
|
553 | perl_run (PL_curinterp); |
|
|
554 | |
|
|
555 | fputs ("FATAL: C coroutine fell over the edge of the world, aborting. Did you call exit in a coroutine?\n", stderr); |
|
|
556 | abort (); |
|
|
557 | } |
|
|
558 | |
|
|
559 | static coro_cctx * |
|
|
560 | cctx_new () |
|
|
561 | { |
|
|
562 | coro_cctx *cctx; |
|
|
563 | |
|
|
564 | ++cctx_count; |
|
|
565 | |
|
|
566 | New (0, cctx, 1, coro_cctx); |
|
|
567 | |
|
|
568 | #if HAVE_MMAP |
|
|
569 | |
|
|
570 | cctx->ssize = ((STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + STACKGUARD) * PAGESIZE; |
|
|
571 | /* mmap suppsedly does allocate-on-write for us */ |
|
|
572 | cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
|
|
573 | |
|
|
574 | if (cctx->sptr == (void *)-1) |
|
|
575 | { |
|
|
576 | perror ("FATAL: unable to mmap stack for coroutine"); |
|
|
577 | _exit (EXIT_FAILURE); |
|
|
578 | } |
|
|
579 | |
|
|
580 | # if STACKGUARD |
|
|
581 | mprotect (cctx->sptr, STACKGUARD * PAGESIZE, PROT_NONE); |
|
|
582 | # endif |
|
|
583 | |
|
|
584 | #else |
|
|
585 | |
|
|
586 | cctx->ssize = STACKSIZE * (long)sizeof (long); |
|
|
587 | New (0, cctx->sptr, STACKSIZE, long); |
|
|
588 | |
|
|
589 | if (!cctx->sptr) |
|
|
590 | { |
|
|
591 | perror ("FATAL: unable to malloc stack for coroutine"); |
|
|
592 | _exit (EXIT_FAILURE); |
|
|
593 | } |
|
|
594 | |
|
|
595 | #endif |
|
|
596 | |
|
|
597 | #if USE_VALGRIND |
|
|
598 | cctx->valgrind_id = VALGRIND_STACK_REGISTER ( |
|
|
599 | STACKGUARD * PAGESIZE + (char *)cctx->sptr, |
|
|
600 | cctx->ssize + (char *)cctx->sptr |
|
|
601 | ); |
|
|
602 | #endif |
|
|
603 | |
|
|
604 | coro_create (&cctx->cctx, coro_run, (void *)cctx, cctx->sptr, cctx->ssize); |
|
|
605 | |
|
|
606 | return cctx; |
|
|
607 | } |
|
|
608 | |
|
|
609 | static void |
|
|
610 | cctx_free (coro_cctx *cctx) |
|
|
611 | { |
|
|
612 | if (!cctx) |
|
|
613 | return; |
|
|
614 | |
|
|
615 | --cctx_count; |
|
|
616 | |
|
|
617 | #if USE_VALGRIND |
|
|
618 | VALGRIND_STACK_DEREGISTER (cctx->valgrind_id); |
|
|
619 | #endif |
|
|
620 | |
|
|
621 | #if HAVE_MMAP |
|
|
622 | munmap (cctx->sptr, cctx->ssize); |
|
|
623 | #else |
|
|
624 | Safefree (cctx->sptr); |
|
|
625 | #endif |
|
|
626 | |
|
|
627 | Safefree (cctx); |
|
|
628 | } |
|
|
629 | |
|
|
630 | static coro_cctx * |
|
|
631 | cctx_get () |
|
|
632 | { |
|
|
633 | coro_cctx *cctx; |
|
|
634 | |
|
|
635 | if (cctx_first) |
|
|
636 | { |
|
|
637 | --cctx_idle; |
|
|
638 | cctx = cctx_first; |
|
|
639 | cctx_first = cctx->next; |
|
|
640 | } |
|
|
641 | else |
|
|
642 | { |
|
|
643 | cctx = cctx_new (); |
|
|
644 | PL_op = PL_op->op_next; |
|
|
645 | } |
|
|
646 | |
|
|
647 | return cctx; |
|
|
648 | } |
|
|
649 | |
|
|
650 | static void |
|
|
651 | cctx_put (coro_cctx *cctx) |
|
|
652 | { |
|
|
653 | ++cctx_idle; |
|
|
654 | cctx->next = cctx_first; |
|
|
655 | cctx_first = cctx; |
|
|
656 | } |
|
|
657 | |
|
|
658 | /* never call directly, always through the coro_state_transfer global variable */ |
|
|
659 | static void NOINLINE |
|
|
660 | transfer (struct coro *prev, struct coro *next, int flags) |
|
|
661 | { |
|
|
662 | dSTACKLEVEL; |
|
|
663 | |
|
|
664 | /* sometimes transfer is only called to set idle_sp */ |
|
|
665 | if (flags == TRANSFER_SET_STACKLEVEL) |
|
|
666 | ((coro_cctx *)prev)->idle_sp = STACKLEVEL; |
|
|
667 | else if (prev != next) |
|
|
668 | { |
|
|
669 | coro_cctx *prev__cctx; |
|
|
670 | |
|
|
671 | LOCK; |
|
|
672 | |
|
|
673 | if (next->mainstack) |
|
|
674 | { |
|
|
675 | /* coroutine already started */ |
|
|
676 | SAVE (prev, flags); |
|
|
677 | LOAD (next); |
|
|
678 | } |
|
|
679 | else |
|
|
680 | { |
|
|
681 | /* need to start coroutine */ |
|
|
682 | /* first get rid of the old state */ |
|
|
683 | SAVE (prev, -1); |
|
|
684 | /* setup coroutine call */ |
|
|
685 | setup_coro (next); |
|
|
686 | /* need a stack */ |
|
|
687 | next->cctx = 0; |
|
|
688 | } |
|
|
689 | |
|
|
690 | if (!prev->cctx) |
|
|
691 | /* create a new empty context */ |
|
|
692 | Newz (0, prev->cctx, 1, coro_cctx); |
|
|
693 | |
|
|
694 | prev__cctx = prev->cctx; |
|
|
695 | |
|
|
696 | /* possibly "free" the cctx */ |
|
|
697 | if (prev__cctx->idle_sp == STACKLEVEL) |
|
|
698 | { |
|
|
699 | cctx_put (prev__cctx); |
|
|
700 | prev->cctx = 0; |
|
|
701 | } |
|
|
702 | |
|
|
703 | if (!next->cctx) |
|
|
704 | next->cctx = cctx_get (); |
|
|
705 | |
|
|
706 | if (prev__cctx != next->cctx) |
|
|
707 | { |
|
|
708 | prev__cctx->top_env = PL_top_env; |
|
|
709 | PL_top_env = next->cctx->top_env; |
|
|
710 | coro_transfer (&prev__cctx->cctx, &next->cctx->cctx); |
|
|
711 | } |
|
|
712 | |
|
|
713 | free_coro_mortal (); |
|
|
714 | |
|
|
715 | UNLOCK; |
|
|
716 | } |
|
|
717 | } |
|
|
718 | |
|
|
719 | struct transfer_args |
|
|
720 | { |
|
|
721 | struct coro *prev, *next; |
|
|
722 | int flags; |
|
|
723 | }; |
|
|
724 | |
|
|
725 | #define TRANSFER(ta) transfer ((ta).prev, (ta).next, (ta).flags) |
|
|
726 | |
|
|
727 | static void |
|
|
728 | coro_state_destroy (struct coro *coro) |
|
|
729 | { |
|
|
730 | if (coro->refcnt--) |
|
|
731 | return; |
|
|
732 | |
|
|
733 | if (coro->mainstack && coro->mainstack != main_mainstack) |
|
|
734 | { |
|
|
735 | struct coro temp; |
|
|
736 | |
|
|
737 | SAVE ((&temp), TRANSFER_SAVE_ALL); |
|
|
738 | LOAD (coro); |
|
|
739 | |
|
|
740 | coro_destroy_stacks (); |
|
|
741 | |
|
|
742 | LOAD ((&temp)); /* this will get rid of defsv etc.. */ |
|
|
743 | |
|
|
744 | coro->mainstack = 0; |
|
|
745 | } |
|
|
746 | |
|
|
747 | cctx_free (coro->cctx); |
|
|
748 | SvREFCNT_dec (coro->args); |
|
|
749 | Safefree (coro); |
|
|
750 | } |
|
|
751 | |
792 | static void |
752 | static int |
|
|
753 | coro_state_clear (pTHX_ SV *sv, MAGIC *mg) |
|
|
754 | { |
|
|
755 | struct coro *coro = (struct coro *)mg->mg_ptr; |
|
|
756 | mg->mg_ptr = 0; |
|
|
757 | |
|
|
758 | coro_state_destroy (coro); |
|
|
759 | |
|
|
760 | return 0; |
|
|
761 | } |
|
|
762 | |
|
|
763 | static int |
|
|
764 | coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params) |
|
|
765 | { |
|
|
766 | struct coro *coro = (struct coro *)mg->mg_ptr; |
|
|
767 | |
|
|
768 | ++coro->refcnt; |
|
|
769 | |
|
|
770 | return 0; |
|
|
771 | } |
|
|
772 | |
|
|
773 | static MGVTBL coro_state_vtbl = { |
|
|
774 | 0, 0, 0, 0, |
|
|
775 | coro_state_clear, |
|
|
776 | 0, |
|
|
777 | #ifdef MGf_DUP |
|
|
778 | coro_state_dup, |
|
|
779 | #else |
|
|
780 | # define MGf_DUP 0 |
|
|
781 | #endif |
|
|
782 | }; |
|
|
783 | |
|
|
784 | static struct coro * |
|
|
785 | SvSTATE (SV *coro) |
|
|
786 | { |
|
|
787 | HV *stash; |
|
|
788 | MAGIC *mg; |
|
|
789 | |
|
|
790 | if (SvROK (coro)) |
|
|
791 | coro = SvRV (coro); |
|
|
792 | |
|
|
793 | stash = SvSTASH (coro); |
|
|
794 | if (stash != coro_stash && stash != coro_state_stash) |
|
|
795 | { |
|
|
796 | /* very slow, but rare, check */ |
|
|
797 | if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State")) |
|
|
798 | croak ("Coro::State object required"); |
|
|
799 | } |
|
|
800 | |
|
|
801 | mg = SvMAGIC (coro); |
|
|
802 | assert (mg->mg_type == PERL_MAGIC_ext); |
|
|
803 | return (struct coro *)mg->mg_ptr; |
|
|
804 | } |
|
|
805 | |
|
|
806 | static void |
|
|
807 | prepare_transfer (struct transfer_args *ta, SV *prev, SV *next, int flags) |
|
|
808 | { |
|
|
809 | ta->prev = SvSTATE (prev); |
|
|
810 | ta->next = SvSTATE (next); |
|
|
811 | ta->flags = flags; |
|
|
812 | } |
|
|
813 | |
|
|
814 | static void |
793 | api_transfer(pTHX_ SV *prev, SV *next, int flags) |
815 | api_transfer (SV *prev, SV *next, int flags) |
794 | { |
816 | { |
795 | SV_CORO (prev, "Coro::transfer"); |
817 | dTHX; |
796 | SV_CORO (next, "Coro::transfer"); |
818 | struct transfer_args ta; |
797 | |
819 | |
798 | transfer(aTHX_ SvSTATE(prev), SvSTATE(next), flags); |
820 | prepare_transfer (&ta, prev, next, flags); |
|
|
821 | TRANSFER (ta); |
799 | } |
822 | } |
800 | |
823 | |
801 | /** Coro ********************************************************************/ |
824 | /** Coro ********************************************************************/ |
802 | |
825 | |
803 | #define PRIO_MAX 3 |
826 | #define PRIO_MAX 3 |
… | |
… | |
807 | #define PRIO_IDLE -3 |
830 | #define PRIO_IDLE -3 |
808 | #define PRIO_MIN -4 |
831 | #define PRIO_MIN -4 |
809 | |
832 | |
810 | /* for Coro.pm */ |
833 | /* for Coro.pm */ |
811 | static GV *coro_current, *coro_idle; |
834 | static GV *coro_current, *coro_idle; |
812 | static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; |
835 | static AV *coro_ready [PRIO_MAX-PRIO_MIN+1]; |
813 | static int coro_nready; |
836 | static int coro_nready; |
814 | |
837 | |
815 | static void |
838 | static void |
816 | coro_enq (SV *sv) |
839 | coro_enq (SV *sv) |
817 | { |
840 | { |
|
|
841 | int prio; |
|
|
842 | |
818 | if (SvTYPE (sv) == SVt_PVHV) |
843 | 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"); |
844 | croak ("Coro::ready tried to enqueue something that is not a coroutine"); |
|
|
845 | |
|
|
846 | prio = SvSTATE (sv)->prio; |
|
|
847 | |
|
|
848 | av_push (coro_ready [prio - PRIO_MIN], sv); |
|
|
849 | coro_nready++; |
834 | } |
850 | } |
835 | |
851 | |
836 | static SV * |
852 | static SV * |
837 | coro_deq (int min_prio) |
853 | coro_deq (int min_prio) |
838 | { |
854 | { |
… | |
… | |
841 | min_prio -= PRIO_MIN; |
857 | min_prio -= PRIO_MIN; |
842 | if (min_prio < 0) |
858 | if (min_prio < 0) |
843 | min_prio = 0; |
859 | min_prio = 0; |
844 | |
860 | |
845 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
861 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
846 | if (av_len (coro_ready[prio]) >= 0) |
862 | if (AvFILLp (coro_ready [prio]) >= 0) |
847 | { |
863 | { |
848 | coro_nready--; |
864 | coro_nready--; |
849 | return av_shift (coro_ready[prio]); |
865 | return av_shift (coro_ready [prio]); |
850 | } |
866 | } |
851 | |
867 | |
852 | return 0; |
868 | return 0; |
853 | } |
869 | } |
854 | |
870 | |
855 | static void |
871 | static void |
856 | api_ready (SV *coro) |
872 | api_ready (SV *coro) |
857 | { |
873 | { |
|
|
874 | dTHX; |
|
|
875 | |
858 | if (SvROK (coro)) |
876 | if (SvROK (coro)) |
859 | coro = SvRV (coro); |
877 | coro = SvRV (coro); |
860 | |
878 | |
|
|
879 | LOCK; |
861 | coro_enq (SvREFCNT_inc (coro)); |
880 | coro_enq (SvREFCNT_inc (coro)); |
|
|
881 | UNLOCK; |
|
|
882 | } |
|
|
883 | |
|
|
884 | static void |
|
|
885 | prepare_schedule (struct transfer_args *ta) |
|
|
886 | { |
|
|
887 | SV *current, *prev, *next; |
|
|
888 | |
|
|
889 | current = GvSV (coro_current); |
|
|
890 | |
|
|
891 | for (;;) |
|
|
892 | { |
|
|
893 | LOCK; |
|
|
894 | next = coro_deq (PRIO_MIN); |
|
|
895 | UNLOCK; |
|
|
896 | |
|
|
897 | if (next) |
|
|
898 | break; |
|
|
899 | |
|
|
900 | { |
|
|
901 | dSP; |
|
|
902 | |
|
|
903 | ENTER; |
|
|
904 | SAVETMPS; |
|
|
905 | |
|
|
906 | PUSHMARK (SP); |
|
|
907 | PUTBACK; |
|
|
908 | call_sv (GvSV (coro_idle), G_DISCARD); |
|
|
909 | |
|
|
910 | FREETMPS; |
|
|
911 | LEAVE; |
|
|
912 | } |
|
|
913 | } |
|
|
914 | |
|
|
915 | prev = SvRV (current); |
|
|
916 | SvRV (current) = next; |
|
|
917 | |
|
|
918 | /* free this only after the transfer */ |
|
|
919 | LOCK; |
|
|
920 | free_coro_mortal (); |
|
|
921 | UNLOCK; |
|
|
922 | coro_mortal = prev; |
|
|
923 | |
|
|
924 | ta->prev = SvSTATE (prev); |
|
|
925 | ta->next = SvSTATE (next); |
|
|
926 | ta->flags = TRANSFER_SAVE_ALL; |
|
|
927 | } |
|
|
928 | |
|
|
929 | static void |
|
|
930 | prepare_cede (struct transfer_args *ta) |
|
|
931 | { |
|
|
932 | LOCK; |
|
|
933 | coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current)))); |
|
|
934 | UNLOCK; |
|
|
935 | |
|
|
936 | prepare_schedule (ta); |
862 | } |
937 | } |
863 | |
938 | |
864 | static void |
939 | static void |
865 | api_schedule (void) |
940 | api_schedule (void) |
866 | { |
941 | { |
867 | SV *prev, *next; |
942 | dTHX; |
|
|
943 | struct transfer_args ta; |
868 | |
944 | |
869 | prev = SvRV (GvSV (coro_current)); |
945 | prepare_schedule (&ta); |
870 | next = coro_deq (PRIO_MIN); |
946 | 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 | } |
947 | } |
886 | |
948 | |
887 | static void |
949 | static void |
888 | api_cede (void) |
950 | api_cede (void) |
889 | { |
951 | { |
890 | coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current)))); |
952 | dTHX; |
|
|
953 | struct transfer_args ta; |
891 | |
954 | |
892 | api_schedule (); |
955 | prepare_cede (&ta); |
|
|
956 | TRANSFER (ta); |
893 | } |
957 | } |
894 | |
958 | |
895 | MODULE = Coro::State PACKAGE = Coro::State |
959 | MODULE = Coro::State PACKAGE = Coro::State |
896 | |
960 | |
897 | PROTOTYPES: ENABLE |
961 | PROTOTYPES: DISABLE |
898 | |
962 | |
899 | BOOT: |
963 | BOOT: |
900 | { /* {} necessary for stoopid perl-5.6.x */ |
964 | { |
901 | ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); |
965 | #ifdef USE_ITHREADS |
902 | PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); |
966 | MUTEX_INIT (&coro_mutex); |
|
|
967 | #endif |
|
|
968 | BOOT_PAGESIZE; |
|
|
969 | |
903 | coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
970 | coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
904 | |
971 | |
905 | newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); |
972 | newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); |
906 | newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); |
973 | newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); |
907 | newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); |
974 | newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); |
908 | newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); |
|
|
909 | |
|
|
910 | if (!padlist_cache) |
|
|
911 | padlist_cache = newHV (); |
|
|
912 | |
975 | |
913 | main_mainstack = PL_mainstack; |
976 | main_mainstack = PL_mainstack; |
914 | |
977 | |
915 | coroapi.ver = CORO_API_VERSION; |
978 | coroapi.ver = CORO_API_VERSION; |
916 | coroapi.transfer = api_transfer; |
979 | coroapi.transfer = api_transfer; |
917 | } |
|
|
918 | |
980 | |
919 | Coro::State |
981 | assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL)); |
920 | _newprocess(args) |
982 | } |
921 | SV * args |
983 | |
922 | PROTOTYPE: $ |
984 | SV * |
|
|
985 | new (char *klass, ...) |
923 | CODE: |
986 | CODE: |
924 | Coro__State coro; |
987 | { |
|
|
988 | struct coro *coro; |
|
|
989 | HV *hv; |
|
|
990 | int i; |
925 | |
991 | |
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); |
992 | Newz (0, coro, 1, struct coro); |
|
|
993 | coro->args = newAV (); |
930 | |
994 | |
931 | coro->args = (AV *)SvREFCNT_inc (SvRV (args)); |
995 | hv = newHV (); |
932 | coro->mainstack = 0; /* actual work is done inside transfer */ |
996 | sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP; |
933 | coro->stack = 0; |
997 | RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1)); |
934 | |
998 | |
935 | RETVAL = coro; |
999 | for (i = 1; i < items; i++) |
|
|
1000 | av_push (coro->args, newSVsv (ST (i))); |
|
|
1001 | } |
936 | OUTPUT: |
1002 | OUTPUT: |
937 | RETVAL |
1003 | RETVAL |
938 | |
1004 | |
939 | void |
1005 | void |
940 | transfer(prev, next, flags) |
1006 | _set_stacklevel (...) |
941 | SV *prev |
1007 | ALIAS: |
942 | SV *next |
1008 | Coro::State::transfer = 1 |
943 | int flags |
1009 | Coro::schedule = 2 |
944 | PROTOTYPE: @ |
1010 | Coro::cede = 3 |
|
|
1011 | Coro::Cont::yield = 4 |
945 | CODE: |
1012 | CODE: |
946 | PUTBACK; |
1013 | { |
947 | SV_CORO (next, "Coro::transfer"); |
1014 | struct transfer_args ta; |
948 | SV_CORO (prev, "Coro::transfer"); |
1015 | |
949 | transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); |
1016 | switch (ix) |
950 | SPAGAIN; |
1017 | { |
|
|
1018 | case 0: |
|
|
1019 | ta.prev = (struct coro *)INT2PTR (coro_cctx *, SvIV (ST (0))); |
|
|
1020 | ta.next = 0; |
|
|
1021 | ta.flags = TRANSFER_SET_STACKLEVEL; |
|
|
1022 | break; |
|
|
1023 | |
|
|
1024 | case 1: |
|
|
1025 | if (items != 3) |
|
|
1026 | croak ("Coro::State::transfer(prev,next,flags) expects three arguments, not %d", items); |
|
|
1027 | |
|
|
1028 | prepare_transfer (&ta, ST (0), ST (1), SvIV (ST (2))); |
|
|
1029 | break; |
|
|
1030 | |
|
|
1031 | case 2: |
|
|
1032 | prepare_schedule (&ta); |
|
|
1033 | break; |
|
|
1034 | |
|
|
1035 | case 3: |
|
|
1036 | prepare_cede (&ta); |
|
|
1037 | break; |
|
|
1038 | |
|
|
1039 | case 4: |
|
|
1040 | { |
|
|
1041 | SV *yieldstack; |
|
|
1042 | SV *sv; |
|
|
1043 | AV *defav = GvAV (PL_defgv); |
|
|
1044 | |
|
|
1045 | yieldstack = *hv_fetch ( |
|
|
1046 | (HV *)SvRV (GvSV (coro_current)), |
|
|
1047 | "yieldstack", sizeof ("yieldstack") - 1, |
|
|
1048 | 0 |
|
|
1049 | ); |
|
|
1050 | |
|
|
1051 | /* set up @_ -- ugly */ |
|
|
1052 | av_clear (defav); |
|
|
1053 | av_fill (defav, items - 1); |
|
|
1054 | while (items--) |
|
|
1055 | av_store (defav, items, SvREFCNT_inc (ST(items))); |
|
|
1056 | |
|
|
1057 | sv = av_pop ((AV *)SvRV (yieldstack)); |
|
|
1058 | ta.prev = SvSTATE (*av_fetch ((AV *)SvRV (sv), 0, 0)); |
|
|
1059 | ta.next = SvSTATE (*av_fetch ((AV *)SvRV (sv), 1, 0)); |
|
|
1060 | ta.flags = 0; |
|
|
1061 | SvREFCNT_dec (sv); |
|
|
1062 | } |
|
|
1063 | break; |
|
|
1064 | |
|
|
1065 | } |
|
|
1066 | |
|
|
1067 | TRANSFER (ta); |
|
|
1068 | } |
951 | |
1069 | |
952 | void |
1070 | void |
953 | DESTROY(coro) |
1071 | _clone_state_from (SV *dst, SV *src) |
954 | Coro::State coro |
1072 | CODE: |
955 | CODE: |
1073 | { |
|
|
1074 | struct coro *coro_src = SvSTATE (src); |
956 | |
1075 | |
957 | if (coro->mainstack && coro->mainstack != main_mainstack) |
1076 | sv_unmagic (SvRV (dst), PERL_MAGIC_ext); |
958 | { |
|
|
959 | struct coro temp; |
|
|
960 | |
1077 | |
961 | PUTBACK; |
1078 | ++coro_src->refcnt; |
962 | SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); |
1079 | sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags |= MGf_DUP; |
963 | LOAD(aTHX_ coro); |
1080 | } |
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 | |
1081 | |
978 | void |
1082 | void |
979 | flush() |
|
|
980 | CODE: |
|
|
981 | #ifdef MAY_FLUSH |
|
|
982 | flush_padlist_cache (); |
|
|
983 | #endif |
|
|
984 | |
|
|
985 | void |
|
|
986 | _exit(code) |
1083 | _exit (code) |
987 | int code |
1084 | int code |
988 | PROTOTYPE: $ |
1085 | PROTOTYPE: $ |
989 | CODE: |
1086 | CODE: |
990 | #if defined(__GLIBC__) || _POSIX_C_SOURCE |
|
|
991 | _exit (code); |
1087 | _exit (code); |
992 | #else |
|
|
993 | signal (SIGTERM, SIG_DFL); |
|
|
994 | raise (SIGTERM); |
|
|
995 | exit (code); |
|
|
996 | #endif |
|
|
997 | |
1088 | |
998 | MODULE = Coro::State PACKAGE = Coro::Cont |
1089 | int |
|
|
1090 | cctx_count () |
|
|
1091 | CODE: |
|
|
1092 | RETVAL = cctx_count; |
|
|
1093 | OUTPUT: |
|
|
1094 | RETVAL |
999 | |
1095 | |
1000 | # this is slightly dirty (should expose a c-level api) |
1096 | int |
1001 | |
1097 | cctx_idle () |
1002 | void |
1098 | CODE: |
1003 | yield(...) |
1099 | RETVAL = cctx_idle; |
1004 | PROTOTYPE: @ |
1100 | OUTPUT: |
1005 | CODE: |
1101 | RETVAL |
1006 | static SV *returnstk; |
|
|
1007 | SV *sv; |
|
|
1008 | AV *defav = GvAV (PL_defgv); |
|
|
1009 | struct coro *prev, *next; |
|
|
1010 | |
|
|
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 | |
1102 | |
1028 | MODULE = Coro::State PACKAGE = Coro |
1103 | MODULE = Coro::State PACKAGE = Coro |
1029 | |
1104 | |
1030 | # this is slightly dirty (should expose a c-level api) |
|
|
1031 | |
|
|
1032 | BOOT: |
1105 | BOOT: |
1033 | { |
1106 | { |
1034 | int i; |
1107 | int i; |
|
|
1108 | |
1035 | HV *stash = gv_stashpv ("Coro", TRUE); |
1109 | coro_stash = gv_stashpv ("Coro", TRUE); |
1036 | |
1110 | |
1037 | newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); |
1111 | newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX)); |
1038 | newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); |
1112 | newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); |
1039 | newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); |
1113 | newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); |
1040 | newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); |
1114 | newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW)); |
1041 | newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); |
1115 | newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); |
1042 | newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); |
1116 | newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN)); |
1043 | |
1117 | |
1044 | coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); |
1118 | coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); |
1045 | coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); |
1119 | coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); |
1046 | |
1120 | |
1047 | for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) |
1121 | for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) |
… | |
… | |
1055 | coroapi.ready = api_ready; |
1129 | coroapi.ready = api_ready; |
1056 | coroapi.nready = &coro_nready; |
1130 | coroapi.nready = &coro_nready; |
1057 | coroapi.current = coro_current; |
1131 | coroapi.current = coro_current; |
1058 | |
1132 | |
1059 | GCoroAPI = &coroapi; |
1133 | GCoroAPI = &coroapi; |
1060 | sv_setiv(sv, (IV)&coroapi); |
1134 | sv_setiv (sv, (IV)&coroapi); |
1061 | SvREADONLY_on(sv); |
1135 | SvREADONLY_on (sv); |
1062 | } |
1136 | } |
1063 | } |
1137 | } |
1064 | |
1138 | |
|
|
1139 | int |
|
|
1140 | prio (Coro::State coro, int newprio = 0) |
|
|
1141 | ALIAS: |
|
|
1142 | nice = 1 |
|
|
1143 | CODE: |
|
|
1144 | { |
|
|
1145 | RETVAL = coro->prio; |
|
|
1146 | |
|
|
1147 | if (items > 1) |
|
|
1148 | { |
|
|
1149 | if (ix) |
|
|
1150 | newprio += coro->prio; |
|
|
1151 | |
|
|
1152 | if (newprio < PRIO_MIN) newprio = PRIO_MIN; |
|
|
1153 | if (newprio > PRIO_MAX) newprio = PRIO_MAX; |
|
|
1154 | |
|
|
1155 | coro->prio = newprio; |
|
|
1156 | } |
|
|
1157 | } |
|
|
1158 | |
1065 | void |
1159 | void |
1066 | ready(self) |
1160 | ready (SV *self) |
1067 | SV * self |
|
|
1068 | PROTOTYPE: $ |
1161 | PROTOTYPE: $ |
1069 | CODE: |
1162 | CODE: |
1070 | api_ready (self); |
1163 | api_ready (self); |
1071 | |
1164 | |
1072 | int |
1165 | int |
1073 | nready(...) |
1166 | nready (...) |
1074 | PROTOTYPE: |
1167 | PROTOTYPE: |
1075 | CODE: |
1168 | CODE: |
1076 | RETVAL = coro_nready; |
1169 | RETVAL = coro_nready; |
1077 | OUTPUT: |
1170 | OUTPUT: |
1078 | RETVAL |
1171 | RETVAL |
1079 | |
1172 | |
|
|
1173 | MODULE = Coro::State PACKAGE = Coro::AIO |
|
|
1174 | |
|
|
1175 | SV * |
|
|
1176 | _get_state () |
|
|
1177 | CODE: |
|
|
1178 | { |
|
|
1179 | struct { |
|
|
1180 | int errorno; |
|
|
1181 | int laststype; |
|
|
1182 | int laststatval; |
|
|
1183 | Stat_t statcache; |
|
|
1184 | } data; |
|
|
1185 | |
|
|
1186 | data.errorno = errno; |
|
|
1187 | data.laststype = PL_laststype; |
|
|
1188 | data.laststatval = PL_laststatval; |
|
|
1189 | data.statcache = PL_statcache; |
|
|
1190 | |
|
|
1191 | RETVAL = newSVpvn ((char *)&data, sizeof data); |
|
|
1192 | } |
|
|
1193 | OUTPUT: |
|
|
1194 | RETVAL |
|
|
1195 | |
1080 | void |
1196 | void |
1081 | schedule(...) |
1197 | _set_state (char *data_) |
1082 | PROTOTYPE: |
1198 | PROTOTYPE: $ |
1083 | CODE: |
1199 | CODE: |
1084 | api_schedule (); |
1200 | { |
|
|
1201 | struct { |
|
|
1202 | int errorno; |
|
|
1203 | int laststype; |
|
|
1204 | int laststatval; |
|
|
1205 | Stat_t statcache; |
|
|
1206 | } *data = (void *)data_; |
1085 | |
1207 | |
1086 | void |
1208 | errno = data->errorno; |
1087 | cede(...) |
1209 | PL_laststype = data->laststype; |
1088 | PROTOTYPE: |
1210 | PL_laststatval = data->laststatval; |
1089 | CODE: |
1211 | PL_statcache = data->statcache; |
1090 | api_cede (); |
1212 | } |
1091 | |
|
|