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