|
|
1 | #define PERL_NO_GET_CONTEXT |
|
|
2 | |
|
|
3 | #include "libcoro/coro.c" |
|
|
4 | |
1 | #include "EXTERN.h" |
5 | #include "EXTERN.h" |
2 | #include "perl.h" |
6 | #include "perl.h" |
3 | #include "XSUB.h" |
7 | #include "XSUB.h" |
4 | |
8 | |
5 | #include "libcoro/coro.c" |
9 | #include "patchlevel.h" |
6 | |
10 | |
|
|
11 | #if PERL_VERSION < 6 |
|
|
12 | # ifndef PL_ppaddr |
|
|
13 | # define PL_ppaddr ppaddr |
|
|
14 | # endif |
|
|
15 | # ifndef call_sv |
|
|
16 | # define call_sv perl_call_sv |
|
|
17 | # endif |
|
|
18 | # ifndef get_sv |
|
|
19 | # define get_sv perl_get_sv |
|
|
20 | # endif |
|
|
21 | # ifndef get_cv |
|
|
22 | # define get_cv perl_get_cv |
|
|
23 | # endif |
|
|
24 | # ifndef IS_PADGV |
|
|
25 | # define IS_PADGV(v) 0 |
|
|
26 | # endif |
|
|
27 | # ifndef IS_PADCONST |
|
|
28 | # define IS_PADCONST(v) 0 |
|
|
29 | # endif |
|
|
30 | #endif |
|
|
31 | |
7 | #include <signal.h> |
32 | #include <errno.h> |
8 | |
33 | |
9 | #ifdef HAVE_MMAP |
34 | #ifdef HAVE_MMAP |
10 | # include <unistd.h> |
35 | # include <unistd.h> |
11 | # include <sys/mman.h> |
36 | # include <sys/mman.h> |
12 | # ifndef MAP_ANON |
|
|
13 | # ifdef MAP_ANONYMOUS |
37 | # ifndef MAP_ANONYMOUS |
14 | # define MAP_ANON MAP_ANONYMOUS |
38 | # ifdef MAP_ANON |
|
|
39 | # define MAP_ANONYMOUS MAP_ANON |
15 | # else |
40 | # else |
16 | # undef HAVE_MMAP |
41 | # undef HAVE_MMAP |
17 | # endif |
42 | # endif |
18 | # endif |
43 | # endif |
19 | #endif |
44 | #endif |
20 | |
45 | |
21 | #define MAY_FLUSH /* increases codesize */ |
|
|
22 | |
|
|
23 | #define SUB_INIT "Coro::State::initialize" |
46 | #define SUB_INIT "Coro::State::initialize" |
24 | #define UCORO_STATE "_coro_state" |
47 | #define UCORO_STATE "_coro_state" |
25 | |
48 | |
26 | /* The next macro should delcare a variable stacklevel that contains and approximation |
49 | /* 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 |
50 | * to the current C stack pointer. Its property is that it changes with each call |
28 | * and should be unique. */ |
51 | * and should be unique. */ |
29 | #define dSTACKLEVEL void *stacklevel = &stacklevel |
52 | #define dSTACKLEVEL void *stacklevel = &stacklevel |
30 | |
53 | |
|
|
54 | #define IN_DESTRUCT (PL_main_cv == Nullcv) |
|
|
55 | |
31 | #define labs(l) ((l) >= 0 ? (l) : -(l)) |
56 | #define labs(l) ((l) >= 0 ? (l) : -(l)) |
32 | |
57 | |
33 | #include "CoroAPI.h" |
58 | #include "CoroAPI.h" |
34 | |
59 | |
|
|
60 | #ifdef USE_ITHREADS |
|
|
61 | static perl_mutex coro_mutex; |
|
|
62 | # define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0) |
|
|
63 | # define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0) |
|
|
64 | #else |
|
|
65 | # define LOCK (void)0 |
|
|
66 | # define UNLOCK (void)0 |
|
|
67 | #endif |
|
|
68 | |
35 | static struct CoroAPI coroapi; |
69 | static struct CoroAPI coroapi; |
|
|
70 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
|
|
71 | static HV *coro_state_stash; |
|
|
72 | static SV *ucoro_state_sv; |
|
|
73 | static U32 ucoro_state_hash; |
|
|
74 | static SV *coro_mortal; /* will be freed after next transfer */ |
36 | |
75 | |
37 | /* this is actually not only the c stack but also c registers etc... */ |
76 | /* this is actually not only the c stack but also c registers etc... */ |
38 | typedef struct { |
77 | typedef struct { |
39 | int refcnt; /* pointer reference counter */ |
78 | int refcnt; /* pointer reference counter */ |
40 | int usecnt; /* shared by how many coroutines */ |
79 | int usecnt; /* shared by how many coroutines */ |
… | |
… | |
45 | void *sptr; |
84 | void *sptr; |
46 | long ssize; /* positive == mmap, otherwise malloc */ |
85 | long ssize; /* positive == mmap, otherwise malloc */ |
47 | } coro_stack; |
86 | } coro_stack; |
48 | |
87 | |
49 | struct coro { |
88 | struct coro { |
|
|
89 | /* the top-level JMPENV for each coroutine, needed to catch dies. */ |
|
|
90 | JMPENV start_env; |
|
|
91 | |
50 | /* the optional C context */ |
92 | /* the optional C context */ |
51 | coro_stack *stack; |
93 | coro_stack *stack; |
52 | void *cursp; |
94 | void *cursp; |
53 | int gencnt; |
95 | int gencnt; |
54 | |
96 | |
… | |
… | |
66 | AV *curstack; |
108 | AV *curstack; |
67 | AV *mainstack; |
109 | AV *mainstack; |
68 | SV **stack_sp; |
110 | SV **stack_sp; |
69 | OP *op; |
111 | OP *op; |
70 | SV **curpad; |
112 | SV **curpad; |
|
|
113 | AV *comppad; |
|
|
114 | CV *compcv; |
71 | SV **stack_base; |
115 | SV **stack_base; |
72 | SV **stack_max; |
116 | SV **stack_max; |
73 | SV **tmps_stack; |
117 | SV **tmps_stack; |
74 | I32 tmps_floor; |
118 | I32 tmps_floor; |
75 | I32 tmps_ix; |
119 | I32 tmps_ix; |
… | |
… | |
84 | I32 savestack_ix; |
128 | I32 savestack_ix; |
85 | I32 savestack_max; |
129 | I32 savestack_max; |
86 | OP **retstack; |
130 | OP **retstack; |
87 | I32 retstack_ix; |
131 | I32 retstack_ix; |
88 | I32 retstack_max; |
132 | I32 retstack_max; |
|
|
133 | PMOP *curpm; |
89 | COP *curcop; |
134 | COP *curcop; |
90 | JMPENV *top_env; |
135 | JMPENV *top_env; |
91 | |
136 | |
92 | /* data associated with this coroutine (initial args) */ |
137 | /* data associated with this coroutine (initial args) */ |
93 | AV *args; |
138 | AV *args; |
94 | }; |
139 | }; |
95 | |
140 | |
96 | typedef struct coro *Coro__State; |
141 | typedef struct coro *Coro__State; |
97 | typedef struct coro *Coro__State_or_hashref; |
142 | typedef struct coro *Coro__State_or_hashref; |
98 | |
143 | |
99 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
144 | static AV * |
100 | static HV *coro_state_stash; |
145 | coro_clone_padlist (pTHX_ CV *cv) |
101 | static SV *ucoro_state_sv; |
|
|
102 | static U32 ucoro_state_hash; |
|
|
103 | static HV *padlist_cache; |
|
|
104 | |
|
|
105 | /* mostly copied from op.c:cv_clone2 */ |
|
|
106 | STATIC AV * |
|
|
107 | clone_padlist (AV *protopadlist) |
|
|
108 | { |
146 | { |
109 | AV *av; |
147 | AV *padlist = CvPADLIST (cv); |
110 | I32 ix; |
|
|
111 | AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE); |
|
|
112 | AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE); |
|
|
113 | SV **pname = AvARRAY (protopad_name); |
|
|
114 | SV **ppad = AvARRAY (protopad); |
|
|
115 | I32 fname = AvFILLp (protopad_name); |
|
|
116 | I32 fpad = AvFILLp (protopad); |
|
|
117 | AV *newpadlist, *newpad_name, *newpad; |
148 | AV *newpadlist, *newpad; |
118 | SV **npad; |
|
|
119 | |
|
|
120 | newpad_name = newAV (); |
|
|
121 | for (ix = fname; ix >= 0; ix--) |
|
|
122 | av_store (newpad_name, ix, SvREFCNT_inc (pname[ix])); |
|
|
123 | |
|
|
124 | newpad = newAV (); |
|
|
125 | av_fill (newpad, AvFILLp (protopad)); |
|
|
126 | npad = AvARRAY (newpad); |
|
|
127 | |
149 | |
128 | newpadlist = newAV (); |
150 | newpadlist = newAV (); |
129 | AvREAL_off (newpadlist); |
151 | AvREAL_off (newpadlist); |
130 | av_store (newpadlist, 0, (SV *) newpad_name); |
152 | Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1); |
|
|
153 | newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)]; |
|
|
154 | --AvFILLp (padlist); |
|
|
155 | |
|
|
156 | av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE))); |
131 | av_store (newpadlist, 1, (SV *) newpad); |
157 | av_store (newpadlist, 1, (SV *)newpad); |
132 | |
158 | |
133 | av = newAV (); /* will be @_ */ |
159 | return newpadlist; |
134 | av_extend (av, 0); |
160 | } |
135 | av_store (newpad, 0, (SV *) av); |
|
|
136 | AvFLAGS (av) = AVf_REIFY; |
|
|
137 | |
161 | |
138 | for (ix = fpad; ix > 0; ix--) |
162 | static void |
|
|
163 | free_padlist (pTHX_ AV *padlist) |
|
|
164 | { |
|
|
165 | /* may be during global destruction */ |
|
|
166 | if (SvREFCNT (padlist)) |
139 | { |
167 | { |
140 | SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; |
168 | I32 i = AvFILLp (padlist); |
141 | if (namesv && namesv != &PL_sv_undef) |
169 | while (i >= 0) |
142 | { |
170 | { |
143 | char *name = SvPVX (namesv); /* XXX */ |
171 | SV **svp = av_fetch (padlist, i--, FALSE); |
144 | if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') |
172 | if (svp) |
145 | { /* lexical from outside? */ |
|
|
146 | npad[ix] = SvREFCNT_inc (ppad[ix]); |
|
|
147 | } |
173 | { |
148 | else |
|
|
149 | { /* our own lexical */ |
|
|
150 | SV *sv; |
174 | SV *sv; |
151 | if (*name == '&') |
175 | while (&PL_sv_undef != (sv = av_pop ((AV *)*svp))) |
152 | sv = SvREFCNT_inc (ppad[ix]); |
176 | SvREFCNT_dec (sv); |
153 | else if (*name == '@') |
177 | |
154 | sv = (SV *) newAV (); |
178 | SvREFCNT_dec (*svp); |
155 | else if (*name == '%') |
|
|
156 | sv = (SV *) newHV (); |
|
|
157 | else |
|
|
158 | sv = NEWSV (0, 0); |
|
|
159 | if (!SvPADBUSY (sv)) |
|
|
160 | SvPADMY_on (sv); |
|
|
161 | npad[ix] = sv; |
|
|
162 | } |
179 | } |
163 | } |
180 | } |
164 | else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) |
181 | |
165 | { |
182 | SvREFCNT_dec ((SV*)padlist); |
166 | npad[ix] = SvREFCNT_inc (ppad[ix]); |
|
|
167 | } |
|
|
168 | else |
|
|
169 | { |
|
|
170 | SV *sv = NEWSV (0, 0); |
|
|
171 | SvPADTMP_on (sv); |
|
|
172 | npad[ix] = sv; |
|
|
173 | } |
|
|
174 | } |
183 | } |
|
|
184 | } |
175 | |
185 | |
176 | #if 0 /* return -ENOTUNDERSTOOD */ |
186 | static int |
177 | /* Now that vars are all in place, clone nested closures. */ |
187 | coro_cv_free (pTHX_ SV *sv, MAGIC *mg) |
|
|
188 | { |
|
|
189 | AV *padlist; |
|
|
190 | AV *av = (AV *)mg->mg_obj; |
178 | |
191 | |
179 | for (ix = fpad; ix > 0; ix--) { |
192 | /* casting is fun. */ |
180 | SV* namesv = (ix <= fname) ? pname[ix] : Nullsv; |
193 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
181 | if (namesv |
194 | free_padlist (aTHX_ padlist); |
182 | && namesv != &PL_sv_undef |
195 | |
183 | && !(SvFLAGS(namesv) & SVf_FAKE) |
196 | SvREFCNT_dec (av); |
184 | && *SvPVX(namesv) == '&' |
197 | |
185 | && CvCLONE(ppad[ix])) |
198 | return 0; |
186 | { |
199 | } |
187 | CV *kid = cv_clone((CV*)ppad[ix]); |
200 | |
188 | SvREFCNT_dec(ppad[ix]); |
201 | #define PERL_MAGIC_coro PERL_MAGIC_ext |
189 | CvCLONE_on(kid); |
202 | |
190 | SvPADMY_on(kid); |
203 | static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; |
191 | npad[ix] = (SV*)kid; |
204 | |
192 | } |
205 | /* the next two functions merely cache the padlists */ |
|
|
206 | static void |
|
|
207 | get_padlist (pTHX_ CV *cv) |
|
|
208 | { |
|
|
209 | MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
|
|
210 | |
|
|
211 | if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0) |
|
|
212 | CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj); |
|
|
213 | else |
|
|
214 | { |
|
|
215 | #if 0 |
|
|
216 | /* this should work - but it doesn't :( */ |
|
|
217 | CV *cp = Perl_cv_clone (aTHX_ cv); |
|
|
218 | CvPADLIST (cv) = CvPADLIST (cp); |
|
|
219 | CvPADLIST (cp) = 0; |
|
|
220 | SvREFCNT_dec (cp); |
|
|
221 | #else |
|
|
222 | CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv); |
|
|
223 | #endif |
|
|
224 | } |
|
|
225 | } |
|
|
226 | |
|
|
227 | static void |
|
|
228 | put_padlist (pTHX_ CV *cv) |
|
|
229 | { |
|
|
230 | MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
|
|
231 | |
|
|
232 | if (!mg) |
|
|
233 | { |
|
|
234 | sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0); |
|
|
235 | mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
|
|
236 | mg->mg_virtual = &vtbl_coro; |
|
|
237 | mg->mg_obj = (SV *)newAV (); |
193 | } |
238 | } |
194 | #endif |
|
|
195 | |
239 | |
196 | return newpadlist; |
|
|
197 | } |
|
|
198 | |
|
|
199 | #ifdef MAY_FLUSH |
|
|
200 | STATIC AV * |
|
|
201 | free_padlist (AV *padlist) |
|
|
202 | { |
|
|
203 | /* may be during global destruction */ |
|
|
204 | if (SvREFCNT(padlist)) |
|
|
205 | { |
|
|
206 | I32 i = AvFILLp(padlist); |
|
|
207 | while (i >= 0) |
|
|
208 | { |
|
|
209 | SV **svp = av_fetch(padlist, i--, FALSE); |
|
|
210 | SV *sv = svp ? *svp : Nullsv; |
|
|
211 | if (sv) |
|
|
212 | SvREFCNT_dec(sv); |
|
|
213 | } |
|
|
214 | |
|
|
215 | SvREFCNT_dec((SV*)padlist); |
|
|
216 | } |
|
|
217 | } |
|
|
218 | #endif |
|
|
219 | |
|
|
220 | /* the next two functions merely cache the padlists */ |
|
|
221 | STATIC void |
|
|
222 | get_padlist (CV *cv) |
|
|
223 | { |
|
|
224 | SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0); |
|
|
225 | |
|
|
226 | if (he && AvFILLp ((AV *)*he) >= 0) |
|
|
227 | CvPADLIST (cv) = (AV *)av_pop ((AV *)*he); |
|
|
228 | else |
|
|
229 | CvPADLIST (cv) = clone_padlist (CvPADLIST (cv)); |
|
|
230 | } |
|
|
231 | |
|
|
232 | STATIC void |
|
|
233 | put_padlist (CV *cv) |
|
|
234 | { |
|
|
235 | SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1); |
|
|
236 | |
|
|
237 | if (SvTYPE (*he) != SVt_PVAV) |
|
|
238 | { |
|
|
239 | SvREFCNT_dec (*he); |
|
|
240 | *he = (SV *)newAV (); |
|
|
241 | } |
|
|
242 | |
|
|
243 | av_push ((AV *)*he, (SV *)CvPADLIST (cv)); |
240 | av_push ((AV *)mg->mg_obj, (SV *)CvPADLIST (cv)); |
244 | } |
241 | } |
245 | |
|
|
246 | #ifdef MAY_FLUSH |
|
|
247 | STATIC void |
|
|
248 | flush_padlist_cache () |
|
|
249 | { |
|
|
250 | HV *hv = padlist_cache; |
|
|
251 | padlist_cache = newHV (); |
|
|
252 | |
|
|
253 | if (hv_iterinit (hv)) |
|
|
254 | { |
|
|
255 | HE *he; |
|
|
256 | AV *padlist; |
|
|
257 | |
|
|
258 | while (!!(he = hv_iternext (hv))) |
|
|
259 | { |
|
|
260 | AV *av = (AV *)HeVAL(he); |
|
|
261 | |
|
|
262 | /* casting is fun. */ |
|
|
263 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
|
|
264 | free_padlist (padlist); |
|
|
265 | } |
|
|
266 | } |
|
|
267 | |
|
|
268 | SvREFCNT_dec (hv); |
|
|
269 | } |
|
|
270 | #endif |
|
|
271 | |
242 | |
272 | #define SB do { |
243 | #define SB do { |
273 | #define SE } while (0) |
244 | #define SE } while (0) |
274 | |
245 | |
275 | #define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE |
246 | #define LOAD(state) load_state(aTHX_ (state)); |
276 | #define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE |
247 | #define SAVE(state,flags) save_state(aTHX_ (state),(flags)); |
277 | |
248 | |
278 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE |
249 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE |
279 | |
250 | |
280 | static void |
251 | static void |
281 | load_state(pTHX_ Coro__State c) |
252 | load_state(pTHX_ Coro__State c) |
282 | { |
253 | { |
283 | PL_dowarn = c->dowarn; |
254 | PL_dowarn = c->dowarn; |
… | |
… | |
287 | PL_curstack = c->curstack; |
258 | PL_curstack = c->curstack; |
288 | PL_mainstack = c->mainstack; |
259 | PL_mainstack = c->mainstack; |
289 | PL_stack_sp = c->stack_sp; |
260 | PL_stack_sp = c->stack_sp; |
290 | PL_op = c->op; |
261 | PL_op = c->op; |
291 | PL_curpad = c->curpad; |
262 | PL_curpad = c->curpad; |
|
|
263 | PL_comppad = c->comppad; |
|
|
264 | PL_compcv = c->compcv; |
292 | PL_stack_base = c->stack_base; |
265 | PL_stack_base = c->stack_base; |
293 | PL_stack_max = c->stack_max; |
266 | PL_stack_max = c->stack_max; |
294 | PL_tmps_stack = c->tmps_stack; |
267 | PL_tmps_stack = c->tmps_stack; |
295 | PL_tmps_floor = c->tmps_floor; |
268 | PL_tmps_floor = c->tmps_floor; |
296 | PL_tmps_ix = c->tmps_ix; |
269 | PL_tmps_ix = c->tmps_ix; |
… | |
… | |
302 | PL_scopestack_ix = c->scopestack_ix; |
275 | PL_scopestack_ix = c->scopestack_ix; |
303 | PL_scopestack_max = c->scopestack_max; |
276 | PL_scopestack_max = c->scopestack_max; |
304 | PL_savestack = c->savestack; |
277 | PL_savestack = c->savestack; |
305 | PL_savestack_ix = c->savestack_ix; |
278 | PL_savestack_ix = c->savestack_ix; |
306 | PL_savestack_max = c->savestack_max; |
279 | PL_savestack_max = c->savestack_max; |
|
|
280 | #if PERL_VERSION < 9 |
307 | PL_retstack = c->retstack; |
281 | PL_retstack = c->retstack; |
308 | PL_retstack_ix = c->retstack_ix; |
282 | PL_retstack_ix = c->retstack_ix; |
309 | PL_retstack_max = c->retstack_max; |
283 | PL_retstack_max = c->retstack_max; |
|
|
284 | #endif |
|
|
285 | PL_curpm = c->curpm; |
310 | PL_curcop = c->curcop; |
286 | PL_curcop = c->curcop; |
311 | PL_top_env = c->top_env; |
287 | PL_top_env = c->top_env; |
312 | |
288 | |
313 | if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); |
289 | if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); |
314 | if (c->defsv) REPLACE_SV (DEFSV , c->defsv); |
290 | if (c->defsv) REPLACE_SV (DEFSV , c->defsv); |
… | |
… | |
323 | { |
299 | { |
324 | AV *padlist = (AV *)POPs; |
300 | AV *padlist = (AV *)POPs; |
325 | |
301 | |
326 | if (padlist) |
302 | if (padlist) |
327 | { |
303 | { |
328 | put_padlist (cv); /* mark this padlist as available */ |
304 | put_padlist (aTHX_ cv); /* mark this padlist as available */ |
329 | CvPADLIST(cv) = padlist; |
305 | CvPADLIST(cv) = padlist; |
330 | #ifdef USE_THREADS |
|
|
331 | /*CvOWNER(cv) = (struct perl_thread *)POPs;*/ |
|
|
332 | #endif |
|
|
333 | } |
306 | } |
334 | |
307 | |
335 | ++CvDEPTH(cv); |
308 | ++CvDEPTH(cv); |
336 | } |
309 | } |
337 | |
310 | |
… | |
… | |
355 | |
328 | |
356 | PUSHs (Nullsv); |
329 | PUSHs (Nullsv); |
357 | /* this loop was inspired by pp_caller */ |
330 | /* this loop was inspired by pp_caller */ |
358 | for (;;) |
331 | for (;;) |
359 | { |
332 | { |
360 | do |
333 | while (cxix >= 0) |
361 | { |
334 | { |
362 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
335 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
363 | |
336 | |
364 | if (CxTYPE(cx) == CXt_SUB) |
337 | if (CxTYPE(cx) == CXt_SUB) |
365 | { |
338 | { |
366 | CV *cv = cx->blk_sub.cv; |
339 | CV *cv = cx->blk_sub.cv; |
367 | if (CvDEPTH(cv)) |
340 | if (CvDEPTH(cv)) |
368 | { |
341 | { |
369 | #ifdef USE_THREADS |
|
|
370 | /*XPUSHs ((SV *)CvOWNER(cv));*/ |
|
|
371 | /*CvOWNER(cv) = 0;*/ |
|
|
372 | /*error must unlock this cv etc.. etc...*/ |
|
|
373 | #endif |
|
|
374 | EXTEND (SP, CvDEPTH(cv)*2); |
342 | EXTEND (SP, CvDEPTH(cv)*2); |
375 | |
343 | |
376 | while (--CvDEPTH(cv)) |
344 | while (--CvDEPTH(cv)) |
377 | { |
345 | { |
378 | /* this tells the restore code to increment CvDEPTH */ |
346 | /* this tells the restore code to increment CvDEPTH */ |
… | |
… | |
381 | } |
349 | } |
382 | |
350 | |
383 | PUSHs ((SV *)CvPADLIST(cv)); |
351 | PUSHs ((SV *)CvPADLIST(cv)); |
384 | PUSHs ((SV *)cv); |
352 | PUSHs ((SV *)cv); |
385 | |
353 | |
386 | get_padlist (cv); /* this is a monster */ |
354 | get_padlist (aTHX_ cv); |
387 | } |
355 | } |
388 | } |
356 | } |
|
|
357 | #ifdef CXt_FORMAT |
389 | else if (CxTYPE(cx) == CXt_FORMAT) |
358 | else if (CxTYPE(cx) == CXt_FORMAT) |
390 | { |
359 | { |
391 | /* I never used formats, so how should I know how these are implemented? */ |
360 | /* I never used formats, so how should I know how these are implemented? */ |
392 | /* my bold guess is as a simple, plain sub... */ |
361 | /* my bold guess is as a simple, plain sub... */ |
393 | croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); |
362 | croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); |
394 | } |
363 | } |
|
|
364 | #endif |
395 | } |
365 | } |
396 | while (cxix >= 0); |
|
|
397 | |
366 | |
398 | if (top_si->si_type == PERLSI_MAIN) |
367 | if (top_si->si_type == PERLSI_MAIN) |
399 | break; |
368 | break; |
400 | |
369 | |
401 | top_si = top_si->si_prev; |
370 | top_si = top_si->si_prev; |
… | |
… | |
407 | } |
376 | } |
408 | |
377 | |
409 | c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
378 | c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
410 | c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
379 | c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
411 | c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
380 | c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
412 | |
|
|
413 | /* I have not the slightest idea of why av_reify is necessary */ |
|
|
414 | /* but if it's missing the defav contents magically get replaced sometimes */ |
|
|
415 | if (c->defav) |
|
|
416 | av_reify (c->defav); |
|
|
417 | |
381 | |
418 | c->dowarn = PL_dowarn; |
382 | c->dowarn = PL_dowarn; |
419 | c->in_eval = PL_in_eval; |
383 | c->in_eval = PL_in_eval; |
420 | |
384 | |
421 | c->curstackinfo = PL_curstackinfo; |
385 | c->curstackinfo = PL_curstackinfo; |
422 | c->curstack = PL_curstack; |
386 | c->curstack = PL_curstack; |
423 | c->mainstack = PL_mainstack; |
387 | c->mainstack = PL_mainstack; |
424 | c->stack_sp = PL_stack_sp; |
388 | c->stack_sp = PL_stack_sp; |
425 | c->op = PL_op; |
389 | c->op = PL_op; |
426 | c->curpad = PL_curpad; |
390 | c->curpad = PL_curpad; |
|
|
391 | c->comppad = PL_comppad; |
|
|
392 | c->compcv = PL_compcv; |
427 | c->stack_base = PL_stack_base; |
393 | c->stack_base = PL_stack_base; |
428 | c->stack_max = PL_stack_max; |
394 | c->stack_max = PL_stack_max; |
429 | c->tmps_stack = PL_tmps_stack; |
395 | c->tmps_stack = PL_tmps_stack; |
430 | c->tmps_floor = PL_tmps_floor; |
396 | c->tmps_floor = PL_tmps_floor; |
431 | c->tmps_ix = PL_tmps_ix; |
397 | c->tmps_ix = PL_tmps_ix; |
… | |
… | |
437 | c->scopestack_ix = PL_scopestack_ix; |
403 | c->scopestack_ix = PL_scopestack_ix; |
438 | c->scopestack_max = PL_scopestack_max; |
404 | c->scopestack_max = PL_scopestack_max; |
439 | c->savestack = PL_savestack; |
405 | c->savestack = PL_savestack; |
440 | c->savestack_ix = PL_savestack_ix; |
406 | c->savestack_ix = PL_savestack_ix; |
441 | c->savestack_max = PL_savestack_max; |
407 | c->savestack_max = PL_savestack_max; |
|
|
408 | #if PERL_VERSION < 9 |
442 | c->retstack = PL_retstack; |
409 | c->retstack = PL_retstack; |
443 | c->retstack_ix = PL_retstack_ix; |
410 | c->retstack_ix = PL_retstack_ix; |
444 | c->retstack_max = PL_retstack_max; |
411 | c->retstack_max = PL_retstack_max; |
|
|
412 | #endif |
|
|
413 | c->curpm = PL_curpm; |
445 | c->curcop = PL_curcop; |
414 | c->curcop = PL_curcop; |
446 | c->top_env = PL_top_env; |
415 | c->top_env = PL_top_env; |
447 | } |
416 | } |
448 | |
417 | |
449 | /* |
418 | /* |
450 | * allocate various perl stacks. This is an exact copy |
419 | * allocate various perl stacks. This is an exact copy |
451 | * of perl.c:init_stacks, except that it uses less memory |
420 | * of perl.c:init_stacks, except that it uses less memory |
452 | * on the assumption that coroutines do not usually need |
421 | * on the (sometimes correct) assumption that coroutines do |
453 | * a lot of stackspace. |
422 | * not usually need a lot of stackspace. |
454 | */ |
423 | */ |
455 | STATIC void |
424 | static void |
456 | coro_init_stacks (pTHX) |
425 | coro_init_stacks (pTHX) |
457 | { |
426 | { |
|
|
427 | LOCK; |
|
|
428 | |
458 | PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); |
429 | PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); |
459 | PL_curstackinfo->si_type = PERLSI_MAIN; |
430 | PL_curstackinfo->si_type = PERLSI_MAIN; |
460 | PL_curstack = PL_curstackinfo->si_stack; |
431 | PL_curstack = PL_curstackinfo->si_stack; |
461 | PL_mainstack = PL_curstack; /* remember in case we switch stacks */ |
432 | PL_mainstack = PL_curstack; /* remember in case we switch stacks */ |
462 | |
433 | |
… | |
… | |
471 | |
442 | |
472 | New(54,PL_markstack,16,I32); |
443 | New(54,PL_markstack,16,I32); |
473 | PL_markstack_ptr = PL_markstack; |
444 | PL_markstack_ptr = PL_markstack; |
474 | PL_markstack_max = PL_markstack + 16; |
445 | PL_markstack_max = PL_markstack + 16; |
475 | |
446 | |
|
|
447 | #ifdef SET_MARK_OFFSET |
476 | SET_MARK_OFFSET; |
448 | SET_MARK_OFFSET; |
|
|
449 | #endif |
477 | |
450 | |
478 | New(54,PL_scopestack,16,I32); |
451 | New(54,PL_scopestack,16,I32); |
479 | PL_scopestack_ix = 0; |
452 | PL_scopestack_ix = 0; |
480 | PL_scopestack_max = 16; |
453 | PL_scopestack_max = 16; |
481 | |
454 | |
482 | New(54,PL_savestack,96,ANY); |
455 | New(54,PL_savestack,96,ANY); |
483 | PL_savestack_ix = 0; |
456 | PL_savestack_ix = 0; |
484 | PL_savestack_max = 96; |
457 | PL_savestack_max = 96; |
485 | |
458 | |
|
|
459 | #if PERL_VERSION < 9 |
486 | New(54,PL_retstack,8,OP*); |
460 | New(54,PL_retstack,8,OP*); |
487 | PL_retstack_ix = 0; |
461 | PL_retstack_ix = 0; |
488 | PL_retstack_max = 8; |
462 | PL_retstack_max = 8; |
|
|
463 | #endif |
|
|
464 | |
|
|
465 | UNLOCK; |
489 | } |
466 | } |
490 | |
467 | |
491 | /* |
468 | /* |
492 | * destroy the stacks, the callchain etc... |
469 | * destroy the stacks, the callchain etc... |
493 | * still there is a memleak of 128 bytes... |
|
|
494 | */ |
470 | */ |
495 | STATIC void |
471 | static void |
496 | destroy_stacks(pTHX) |
472 | destroy_stacks(pTHX) |
497 | { |
473 | { |
|
|
474 | if (!IN_DESTRUCT) |
|
|
475 | { |
498 | /* is this ugly, I ask? */ |
476 | /* is this ugly, I ask? */ |
499 | while (PL_scopestack_ix) |
477 | LEAVE_SCOPE (0); |
500 | LEAVE; |
|
|
501 | |
478 | |
502 | /* sure it is, but more important: is it correct?? :/ */ |
479 | /* sure it is, but more important: is it correct?? :/ */ |
503 | while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */ |
|
|
504 | FREETMPS; |
480 | FREETMPS; |
|
|
481 | |
|
|
482 | /*POPSTACK_TO (PL_mainstack);*//*D*//*use*/ |
|
|
483 | } |
505 | |
484 | |
506 | while (PL_curstackinfo->si_next) |
485 | while (PL_curstackinfo->si_next) |
507 | PL_curstackinfo = PL_curstackinfo->si_next; |
486 | PL_curstackinfo = PL_curstackinfo->si_next; |
508 | |
487 | |
509 | while (PL_curstackinfo) |
488 | while (PL_curstackinfo) |
510 | { |
489 | { |
511 | PERL_SI *p = PL_curstackinfo->si_prev; |
490 | PERL_SI *p = PL_curstackinfo->si_prev; |
512 | |
491 | |
513 | { |
492 | { /*D*//*remove*/ |
514 | dSP; |
493 | dSP; |
515 | SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); |
494 | SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); |
516 | PUTBACK; /* possibly superfluous */ |
495 | PUTBACK; /* possibly superfluous */ |
517 | } |
496 | } |
518 | |
497 | |
519 | if (PL_main_cv != Nullcv) /* don't during destruction. hack? */ |
498 | if (!IN_DESTRUCT) |
520 | dounwind(-1); |
499 | { |
521 | |
500 | dounwind (-1);/*D*//*remove*/ |
522 | SvREFCNT_dec(PL_curstackinfo->si_stack); |
501 | SvREFCNT_dec (PL_curstackinfo->si_stack); |
|
|
502 | } |
|
|
503 | |
523 | Safefree(PL_curstackinfo->si_cxstack); |
504 | Safefree (PL_curstackinfo->si_cxstack); |
524 | Safefree(PL_curstackinfo); |
505 | Safefree (PL_curstackinfo); |
525 | PL_curstackinfo = p; |
506 | PL_curstackinfo = p; |
526 | } |
507 | } |
527 | |
508 | |
528 | Safefree(PL_tmps_stack); |
509 | Safefree (PL_tmps_stack); |
529 | Safefree(PL_markstack); |
510 | Safefree (PL_markstack); |
530 | Safefree(PL_scopestack); |
511 | Safefree (PL_scopestack); |
531 | Safefree(PL_savestack); |
512 | Safefree (PL_savestack); |
|
|
513 | #if PERL_VERSION < 9 |
532 | Safefree(PL_retstack); |
514 | Safefree (PL_retstack); |
|
|
515 | #endif |
533 | } |
516 | } |
534 | |
517 | |
535 | static void |
518 | static void |
536 | allocate_stack (Coro__State ctx, int alloc) |
519 | allocate_stack (Coro__State ctx, int alloc) |
537 | { |
520 | { |
… | |
… | |
540 | New (0, stack, 1, coro_stack); |
523 | New (0, stack, 1, coro_stack); |
541 | |
524 | |
542 | stack->refcnt = 1; |
525 | stack->refcnt = 1; |
543 | stack->usecnt = 1; |
526 | stack->usecnt = 1; |
544 | stack->gencnt = ctx->gencnt = 0; |
527 | stack->gencnt = ctx->gencnt = 0; |
|
|
528 | |
545 | if (alloc) |
529 | if (alloc) |
546 | { |
530 | { |
547 | #ifdef HAVE_MMAP |
531 | #if HAVE_MMAP |
548 | stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */ |
532 | stack->ssize = STACKSIZE * sizeof (long); /* mmap should do allocate-on-write for us */ |
549 | stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0); |
533 | stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
550 | if (stack->sptr == (void *)-1) |
534 | if (stack->sptr == (void *)-1) |
551 | #endif |
535 | #endif |
552 | { |
536 | { |
553 | /*FIXME*//*D*//* reasonable stack size! */ |
|
|
554 | stack->ssize = -4096 * sizeof (long); |
537 | stack->ssize = - (STACKSIZE * (long)sizeof (long)); |
555 | New (0, stack->sptr, 4096, long); |
538 | New (0, stack->sptr, STACKSIZE, long); |
556 | } |
539 | } |
557 | } |
540 | } |
558 | else |
541 | else |
559 | stack->sptr = 0; |
542 | stack->sptr = 0; |
560 | |
543 | |
… | |
… | |
574 | { |
557 | { |
575 | #ifdef HAVE_MMAP |
558 | #ifdef HAVE_MMAP |
576 | if (stack->ssize > 0 && stack->sptr) |
559 | if (stack->ssize > 0 && stack->sptr) |
577 | munmap (stack->sptr, stack->ssize); |
560 | munmap (stack->sptr, stack->ssize); |
578 | else |
561 | else |
579 | #else |
562 | #endif |
580 | Safefree (stack->sptr); |
563 | Safefree (stack->sptr); |
581 | #endif |
564 | |
582 | Safefree (stack); |
565 | Safefree (stack); |
583 | } |
566 | } |
584 | else if (ctx->gencnt == stack->gencnt) |
567 | else if (ctx->gencnt == stack->gencnt) |
585 | --stack->usecnt; |
568 | --stack->usecnt; |
586 | } |
569 | } |
… | |
… | |
590 | setup_coro (void *arg) |
573 | setup_coro (void *arg) |
591 | { |
574 | { |
592 | /* |
575 | /* |
593 | * emulate part of the perl startup here. |
576 | * emulate part of the perl startup here. |
594 | */ |
577 | */ |
|
|
578 | dTHX; |
595 | dSP; |
579 | dSP; |
596 | Coro__State ctx = (Coro__State)arg; |
580 | Coro__State ctx = (Coro__State)arg; |
597 | SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE); |
581 | SV *sub_init = (SV *)get_cv (SUB_INIT, FALSE); |
598 | |
582 | |
599 | coro_init_stacks (aTHX); |
583 | coro_init_stacks (aTHX); |
600 | /*PL_curcop = 0;*/ |
584 | /*PL_curcop = 0;*/ |
601 | /*PL_in_eval = PL_in_eval;*/ /* inherit */ |
585 | /*PL_in_eval = PL_in_eval;*/ /* inherit */ |
602 | SvREFCNT_dec (GvAV (PL_defgv)); |
586 | SvREFCNT_dec (GvAV (PL_defgv)); |
603 | GvAV (PL_defgv) = ctx->args; |
587 | GvAV (PL_defgv) = ctx->args; ctx->args = 0; |
604 | |
588 | |
605 | SPAGAIN; |
589 | SPAGAIN; |
606 | |
590 | |
607 | if (ctx->stack) |
591 | if (ctx->stack) |
608 | { |
592 | { |
… | |
… | |
635 | * that doesn't matter, though, since it is only |
619 | * that doesn't matter, though, since it is only |
636 | * pp_nextstate and we never return... |
620 | * pp_nextstate and we never return... |
637 | * ah yes, and I don't care anyways ;) |
621 | * ah yes, and I don't care anyways ;) |
638 | */ |
622 | */ |
639 | PUTBACK; |
623 | PUTBACK; |
640 | PL_op = pp_entersub(); |
624 | PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
641 | SPAGAIN; |
625 | SPAGAIN; |
642 | |
626 | |
643 | ENTER; /* necessary e.g. for dounwind */ |
627 | ENTER; /* necessary e.g. for dounwind */ |
644 | } |
628 | } |
645 | } |
629 | } |
… | |
… | |
648 | continue_coro (void *arg) |
632 | continue_coro (void *arg) |
649 | { |
633 | { |
650 | /* |
634 | /* |
651 | * this is a _very_ stripped down perl interpreter ;) |
635 | * this is a _very_ stripped down perl interpreter ;) |
652 | */ |
636 | */ |
|
|
637 | dTHX; |
653 | Coro__State ctx = (Coro__State)arg; |
638 | Coro__State ctx = (Coro__State)arg; |
654 | |
639 | |
655 | /*FIXME*//* must set up top_env here */ |
640 | PL_top_env = &ctx->start_env; |
|
|
641 | |
656 | ctx->cursp = 0; |
642 | ctx->cursp = 0; |
657 | PL_op = PL_op->op_next; |
643 | PL_op = PL_op->op_next; |
658 | CALLRUNOPS(aTHX); |
644 | CALLRUNOPS(aTHX); |
659 | |
645 | |
660 | abort (); |
646 | abort (); |
661 | } |
647 | } |
662 | |
648 | |
663 | STATIC void |
649 | static void |
664 | transfer(pTHX_ struct coro *prev, struct coro *next, int flags) |
650 | transfer (pTHX_ struct coro *prev, struct coro *next, int flags) |
665 | { |
651 | { |
666 | dSP; |
|
|
667 | dSTACKLEVEL; |
652 | dSTACKLEVEL; |
668 | |
653 | |
669 | if (prev != next) |
654 | if (prev != next) |
670 | { |
655 | { |
671 | if (next->mainstack) |
656 | if (next->mainstack) |
672 | { |
657 | { |
|
|
658 | LOCK; |
673 | SAVE (prev, flags); |
659 | SAVE (prev, flags); |
674 | LOAD (next); |
660 | LOAD (next); |
|
|
661 | UNLOCK; |
675 | |
662 | |
676 | /* mark this state as in-use */ |
663 | /* mark this state as in-use */ |
677 | next->mainstack = 0; |
664 | next->mainstack = 0; |
678 | next->tmps_ix = -2; |
665 | next->tmps_ix = -2; |
679 | |
666 | |
… | |
… | |
698 | continue_coro, (void *)next, |
685 | continue_coro, (void *)next, |
699 | next->stack->sptr, labs (next->stack->ssize)); |
686 | next->stack->sptr, labs (next->stack->ssize)); |
700 | } |
687 | } |
701 | |
688 | |
702 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
689 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
|
|
690 | prev->cursp = stacklevel; |
|
|
691 | /* don't add any code here */ |
703 | } |
692 | } |
704 | |
693 | else |
|
|
694 | next->cursp = stacklevel; |
705 | } |
695 | } |
706 | else if (next->tmps_ix == -2) |
696 | else if (next->tmps_ix == -2) |
707 | croak ("tried to transfer to running coroutine"); |
697 | croak ("tried to transfer to running coroutine"); |
708 | else |
698 | else |
709 | { |
699 | { |
|
|
700 | LOCK; |
710 | SAVE (prev, -1); /* first get rid of the old state */ |
701 | SAVE (prev, -1); /* first get rid of the old state */ |
|
|
702 | UNLOCK; |
711 | |
703 | |
712 | if (flags & TRANSFER_SAVE_CCTXT) |
704 | if (flags & TRANSFER_SAVE_CCTXT) |
713 | { |
705 | { |
714 | if (!prev->stack) |
706 | if (!prev->stack) |
715 | allocate_stack (prev, 0); |
707 | allocate_stack (prev, 0); |
716 | |
708 | |
717 | if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK) |
709 | if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK) |
718 | { |
710 | { |
|
|
711 | PL_top_env = &next->start_env; |
|
|
712 | |
719 | setup_coro (next); |
713 | setup_coro (next); |
|
|
714 | next->cursp = stacklevel; |
720 | |
715 | |
721 | prev->stack->refcnt++; |
716 | prev->stack->refcnt++; |
722 | prev->stack->usecnt++; |
717 | prev->stack->usecnt++; |
723 | next->stack = prev->stack; |
718 | next->stack = prev->stack; |
724 | next->gencnt = prev->gencnt; |
719 | next->gencnt = prev->gencnt; |
725 | } |
720 | } |
726 | else |
721 | else |
727 | { |
722 | { |
|
|
723 | assert (!next->stack); |
728 | allocate_stack (next, 1); |
724 | allocate_stack (next, 1); |
729 | coro_create (&(next->stack->cctx), |
725 | coro_create (&(next->stack->cctx), |
730 | setup_coro, (void *)next, |
726 | setup_coro, (void *)next, |
731 | next->stack->sptr, labs (next->stack->ssize)); |
727 | next->stack->sptr, labs (next->stack->ssize)); |
732 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
728 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
|
|
729 | prev->cursp = stacklevel; |
|
|
730 | /* don't add any code here */ |
733 | } |
731 | } |
734 | } |
732 | } |
735 | else |
733 | else |
|
|
734 | { |
736 | setup_coro (next); |
735 | setup_coro (next); |
|
|
736 | next->cursp = stacklevel; |
|
|
737 | } |
737 | } |
738 | } |
738 | } |
739 | } |
739 | |
740 | |
740 | next->cursp = stacklevel; |
741 | LOCK; |
741 | } |
742 | if (coro_mortal) |
742 | |
|
|
743 | static struct coro * |
|
|
744 | sv_to_coro (SV *arg, const char *funcname, const char *varname) |
|
|
745 | { |
|
|
746 | if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVHV) |
|
|
747 | { |
743 | { |
748 | HE *he = hv_fetch_ent((HV *)SvRV(arg), ucoro_state_sv, 0, ucoro_state_hash); |
744 | SvREFCNT_dec (coro_mortal); |
749 | |
745 | coro_mortal = 0; |
750 | if (!he) |
|
|
751 | croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", funcname, varname); |
|
|
752 | |
|
|
753 | arg = HeVAL(he); |
|
|
754 | } |
746 | } |
755 | |
747 | UNLOCK; |
|
|
748 | } |
|
|
749 | |
|
|
750 | #define SV_CORO(sv,func) \ |
|
|
751 | do { \ |
|
|
752 | if (SvROK (sv)) \ |
|
|
753 | sv = SvRV (sv); \ |
|
|
754 | \ |
|
|
755 | if (SvTYPE (sv) == SVt_PVHV) \ |
|
|
756 | { \ |
|
|
757 | HE *he = hv_fetch_ent ((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \ |
|
|
758 | \ |
|
|
759 | if (!he) \ |
|
|
760 | croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \ |
|
|
761 | \ |
|
|
762 | (sv) = SvRV (HeVAL(he)); \ |
|
|
763 | } \ |
|
|
764 | \ |
756 | /* must also be changed inside Coro::Cont::yield */ |
765 | /* must also be changed inside Coro::Cont::yield */ \ |
757 | if (SvROK(arg) && SvSTASH(SvRV(arg)) == coro_state_stash) |
766 | if (!SvOBJECT (sv) || SvSTASH (sv) != coro_state_stash) \ |
758 | return (struct coro *) SvIV((SV*)SvRV(arg)); |
|
|
759 | else |
|
|
760 | croak ("%s() -- %s is not (and contains not) a Coro::State object", funcname, varname); |
767 | croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \ |
761 | } |
768 | \ |
|
|
769 | } while(0) |
|
|
770 | |
|
|
771 | #define SvSTATE(sv) INT2PTR (struct coro *, SvIV (sv)) |
762 | |
772 | |
763 | static void |
773 | static void |
764 | api_transfer(pTHX_ SV *prev, SV *next, int flags) |
774 | api_transfer(pTHX_ SV *prev, SV *next, int flags) |
765 | { |
775 | { |
766 | transfer(aTHX_ sv_to_coro (prev, "Coro::transfer", "prev"), |
776 | SV_CORO (prev, "Coro::transfer"); |
767 | sv_to_coro (next, "Coro::transfer", "next"), |
777 | SV_CORO (next, "Coro::transfer"); |
768 | flags); |
778 | |
|
|
779 | transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); |
769 | } |
780 | } |
770 | |
781 | |
771 | /** Coro ********************************************************************/ |
782 | /** Coro ********************************************************************/ |
772 | |
783 | |
773 | #define PRIO_MAX 3 |
784 | #define PRIO_MAX 3 |
… | |
… | |
778 | #define PRIO_MIN -4 |
789 | #define PRIO_MIN -4 |
779 | |
790 | |
780 | /* for Coro.pm */ |
791 | /* for Coro.pm */ |
781 | static GV *coro_current, *coro_idle; |
792 | static GV *coro_current, *coro_idle; |
782 | static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; |
793 | static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; |
|
|
794 | static int coro_nready; |
783 | |
795 | |
784 | static void |
796 | static void |
785 | coro_enq (SV *sv) |
797 | coro_enq (pTHX_ SV *sv) |
786 | { |
798 | { |
787 | if (SvROK (sv)) |
799 | SV **xprio; |
788 | { |
800 | int prio; |
789 | SV *hv = SvRV (sv); |
801 | |
790 | if (SvTYPE (hv) == SVt_PVHV) |
802 | if (SvTYPE (sv) != SVt_PVHV) |
791 | { |
|
|
792 | SV **xprio = hv_fetch ((HV *)hv, "prio", 4, 0); |
|
|
793 | int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL; |
|
|
794 | |
|
|
795 | prio = prio > PRIO_MAX ? PRIO_MAX |
|
|
796 | : prio < PRIO_MIN ? PRIO_MIN |
|
|
797 | : prio; |
|
|
798 | |
|
|
799 | av_push (coro_ready [prio - PRIO_MIN], sv); |
|
|
800 | |
|
|
801 | return; |
|
|
802 | } |
|
|
803 | } |
|
|
804 | |
|
|
805 | croak ("Coro::ready tried to enqueue something that is not a coroutine"); |
803 | croak ("Coro::ready tried to enqueue something that is not a coroutine"); |
|
|
804 | |
|
|
805 | xprio = hv_fetch ((HV *)sv, "prio", 4, 0); |
|
|
806 | prio = xprio ? SvIV (*xprio) : PRIO_NORMAL; |
|
|
807 | |
|
|
808 | prio = prio > PRIO_MAX ? PRIO_MAX |
|
|
809 | : prio < PRIO_MIN ? PRIO_MIN |
|
|
810 | : prio; |
|
|
811 | |
|
|
812 | av_push (coro_ready [prio - PRIO_MIN], sv); |
|
|
813 | coro_nready++; |
806 | } |
814 | } |
807 | |
815 | |
808 | static SV * |
816 | static SV * |
809 | coro_deq (int min_prio) |
817 | coro_deq (pTHX_ int min_prio) |
810 | { |
818 | { |
811 | int prio = PRIO_MAX - PRIO_MIN; |
819 | int prio = PRIO_MAX - PRIO_MIN; |
812 | |
820 | |
813 | min_prio -= PRIO_MIN; |
821 | min_prio -= PRIO_MIN; |
814 | if (min_prio < 0) |
822 | if (min_prio < 0) |
815 | min_prio = 0; |
823 | min_prio = 0; |
816 | |
824 | |
817 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
825 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
818 | if (av_len (coro_ready[prio]) >= 0) |
826 | if (av_len (coro_ready[prio]) >= 0) |
|
|
827 | { |
|
|
828 | coro_nready--; |
819 | return av_shift (coro_ready[prio]); |
829 | return av_shift (coro_ready[prio]); |
|
|
830 | } |
820 | |
831 | |
821 | return 0; |
832 | return 0; |
822 | } |
833 | } |
823 | |
834 | |
824 | static void |
835 | static void |
825 | api_ready (SV *coro) |
836 | api_ready (SV *coro) |
826 | { |
837 | { |
|
|
838 | dTHX; |
|
|
839 | |
|
|
840 | if (SvROK (coro)) |
|
|
841 | coro = SvRV (coro); |
|
|
842 | |
|
|
843 | LOCK; |
827 | coro_enq (SvREFCNT_inc (coro)); |
844 | coro_enq (aTHX_ SvREFCNT_inc (coro)); |
|
|
845 | UNLOCK; |
828 | } |
846 | } |
829 | |
847 | |
830 | static void |
848 | static void |
831 | api_schedule (int cede) |
849 | api_schedule (void) |
832 | { |
850 | { |
|
|
851 | dTHX; |
|
|
852 | |
833 | SV *prev, *next; |
853 | SV *prev, *next; |
834 | |
854 | |
|
|
855 | LOCK; |
|
|
856 | |
835 | prev = GvSV (coro_current); |
857 | prev = SvRV (GvSV (coro_current)); |
836 | |
|
|
837 | if (cede) |
|
|
838 | coro_enq (SvREFCNT_inc (prev)); |
|
|
839 | |
|
|
840 | next = coro_deq (PRIO_MIN); |
858 | next = coro_deq (aTHX_ PRIO_MIN); |
841 | |
859 | |
842 | if (!next) |
860 | if (!next) |
843 | next = SvREFCNT_inc (GvSV (coro_idle)); |
861 | next = SvREFCNT_inc (SvRV (GvSV (coro_idle))); |
844 | |
862 | |
845 | GvSV (coro_current) = SvREFCNT_inc (next); |
863 | /* free this only after the transfer */ |
846 | transfer (sv_to_coro (prev, "Coro::schedule", "current coroutine"), |
864 | coro_mortal = prev; |
847 | sv_to_coro (next, "Coro::schedule", "next coroutine"), |
865 | SV_CORO (prev, "Coro::schedule"); |
|
|
866 | |
|
|
867 | SvRV (GvSV (coro_current)) = next; |
|
|
868 | |
|
|
869 | SV_CORO (next, "Coro::schedule"); |
|
|
870 | |
|
|
871 | UNLOCK; |
|
|
872 | |
|
|
873 | transfer (aTHX_ SvSTATE (prev), SvSTATE (next), |
848 | TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK); |
874 | TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK); |
849 | SvREFCNT_dec (next); |
875 | } |
850 | SvREFCNT_dec (prev); |
876 | |
|
|
877 | static void |
|
|
878 | api_cede (void) |
|
|
879 | { |
|
|
880 | dTHX; |
|
|
881 | |
|
|
882 | LOCK; |
|
|
883 | coro_enq (aTHX_ SvREFCNT_inc (SvRV (GvSV (coro_current)))); |
|
|
884 | UNLOCK; |
|
|
885 | |
|
|
886 | api_schedule (); |
851 | } |
887 | } |
852 | |
888 | |
853 | MODULE = Coro::State PACKAGE = Coro::State |
889 | MODULE = Coro::State PACKAGE = Coro::State |
854 | |
890 | |
855 | PROTOTYPES: ENABLE |
891 | PROTOTYPES: ENABLE |
856 | |
892 | |
857 | BOOT: |
893 | BOOT: |
858 | { /* {} necessary for stoopid perl-5.6.x */ |
894 | { /* {} necessary for stoopid perl-5.6.x */ |
|
|
895 | #ifdef USE_ITHREADS |
|
|
896 | MUTEX_INIT (&coro_mutex); |
|
|
897 | #endif |
|
|
898 | |
859 | ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); |
899 | ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); |
860 | PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); |
900 | PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); |
861 | coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
901 | coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
862 | |
902 | |
863 | newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); |
903 | newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); |
864 | newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); |
904 | newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); |
865 | newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); |
905 | newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); |
866 | newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); |
906 | newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); |
867 | |
907 | |
868 | if (!padlist_cache) |
|
|
869 | padlist_cache = newHV (); |
|
|
870 | |
|
|
871 | main_mainstack = PL_mainstack; |
908 | main_mainstack = PL_mainstack; |
872 | |
909 | |
873 | { |
|
|
874 | SV *sv = perl_get_sv("Coro::API", 1); |
|
|
875 | |
|
|
876 | coroapi.ver = CORO_API_VERSION - 1; |
910 | coroapi.ver = CORO_API_VERSION; |
877 | coroapi.transfer = api_transfer; |
911 | coroapi.transfer = api_transfer; |
878 | coroapi.schedule = api_schedule; |
|
|
879 | coroapi.ready = api_ready; |
|
|
880 | |
|
|
881 | GCoroAPI = &coroapi; |
|
|
882 | sv_setiv(sv, (IV)&coroapi); |
|
|
883 | SvREADONLY_on(sv); |
|
|
884 | } |
|
|
885 | } |
912 | } |
886 | |
913 | |
887 | Coro::State |
914 | Coro::State |
888 | _newprocess(args) |
915 | _newprocess(args) |
889 | SV * args |
916 | SV * args |
… | |
… | |
892 | Coro__State coro; |
919 | Coro__State coro; |
893 | |
920 | |
894 | if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) |
921 | if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) |
895 | croak ("Coro::State::_newprocess expects an arrayref"); |
922 | croak ("Coro::State::_newprocess expects an arrayref"); |
896 | |
923 | |
897 | New (0, coro, 1, struct coro); |
924 | Newz (0, coro, 1, struct coro); |
898 | |
925 | |
899 | coro->args = (AV *)SvREFCNT_inc (SvRV (args)); |
926 | coro->args = (AV *)SvREFCNT_inc (SvRV (args)); |
900 | coro->mainstack = 0; /* actual work is done inside transfer */ |
927 | /*coro->mainstack = 0; *//*actual work is done inside transfer */ |
901 | coro->stack = 0; |
928 | /*coro->stack = 0;*/ |
|
|
929 | |
|
|
930 | /* same as JMPENV_BOOTSTRAP */ |
|
|
931 | /* we might be able to recycle start_env, but safe is safe */ |
|
|
932 | /*Zero(&coro->start_env, 1, JMPENV);*/ |
|
|
933 | coro->start_env.je_ret = -1; |
|
|
934 | coro->start_env.je_mustcatch = TRUE; |
902 | |
935 | |
903 | RETVAL = coro; |
936 | RETVAL = coro; |
904 | OUTPUT: |
937 | OUTPUT: |
905 | RETVAL |
938 | RETVAL |
906 | |
939 | |
907 | void |
940 | void |
908 | transfer(prev, next, flags) |
941 | transfer(prev, next, flags) |
909 | Coro::State_or_hashref prev |
942 | SV *prev |
910 | Coro::State_or_hashref next |
943 | SV *next |
911 | int flags |
944 | int flags |
912 | PROTOTYPE: @ |
945 | PROTOTYPE: @ |
913 | CODE: |
946 | CODE: |
914 | PUTBACK; |
947 | PUTBACK; |
|
|
948 | SV_CORO (next, "Coro::transfer"); |
|
|
949 | SV_CORO (prev, "Coro::transfer"); |
915 | transfer (aTHX_ prev, next, flags); |
950 | transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); |
916 | SPAGAIN; |
951 | SPAGAIN; |
917 | |
952 | |
918 | void |
953 | void |
919 | DESTROY(coro) |
954 | DESTROY(coro) |
920 | Coro::State coro |
955 | Coro::State coro |
… | |
… | |
922 | |
957 | |
923 | if (coro->mainstack && coro->mainstack != main_mainstack) |
958 | if (coro->mainstack && coro->mainstack != main_mainstack) |
924 | { |
959 | { |
925 | struct coro temp; |
960 | struct coro temp; |
926 | |
961 | |
|
|
962 | PUTBACK; |
927 | SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); |
963 | SAVE (aTHX_ (&temp), TRANSFER_SAVE_ALL); |
928 | LOAD(aTHX_ coro); |
964 | LOAD (aTHX_ coro); |
|
|
965 | SPAGAIN; |
929 | |
966 | |
930 | destroy_stacks (aTHX); |
967 | destroy_stacks (aTHX); |
931 | |
968 | |
932 | LOAD((&temp)); /* this will get rid of defsv etc.. */ |
969 | LOAD ((&temp)); /* this will get rid of defsv etc.. */ |
|
|
970 | SPAGAIN; |
933 | |
971 | |
934 | coro->mainstack = 0; |
972 | coro->mainstack = 0; |
935 | } |
973 | } |
936 | |
974 | |
937 | deallocate_stack (coro); |
975 | deallocate_stack (coro); |
938 | |
976 | SvREFCNT_dec (coro->args); |
939 | Safefree (coro); |
977 | Safefree (coro); |
940 | |
|
|
941 | void |
|
|
942 | flush() |
|
|
943 | CODE: |
|
|
944 | #ifdef MAY_FLUSH |
|
|
945 | flush_padlist_cache (); |
|
|
946 | #endif |
|
|
947 | |
978 | |
948 | void |
979 | void |
949 | _exit(code) |
980 | _exit(code) |
950 | int code |
981 | int code |
951 | PROTOTYPE: $ |
982 | PROTOTYPE: $ |
952 | CODE: |
983 | CODE: |
953 | #if defined(__GLIBC__) || _POSIX_C_SOURCE |
|
|
954 | _exit (code); |
984 | _exit (code); |
955 | #else |
|
|
956 | signal (SIGTERM, SIG_DFL); |
|
|
957 | raise (SIGTERM); |
|
|
958 | exit (code); |
|
|
959 | #endif |
|
|
960 | |
985 | |
961 | MODULE = Coro::State PACKAGE = Coro::Cont |
986 | MODULE = Coro::State PACKAGE = Coro::Cont |
962 | |
987 | |
963 | # this is slightly dirty (should expose a c-level api) |
988 | # this is slightly dirty (should expose a c-level api) |
964 | |
989 | |
965 | void |
990 | void |
966 | yield(...) |
991 | yield(...) |
967 | PROTOTYPE: @ |
992 | PROTOTYPE: @ |
968 | CODE: |
993 | CODE: |
969 | static SV *returnstk; |
994 | SV *yieldstack; |
970 | SV *sv; |
995 | SV *sv; |
971 | AV *defav = GvAV (PL_defgv); |
996 | AV *defav = GvAV (PL_defgv); |
972 | struct coro *prev, *next; |
997 | struct coro *prev, *next; |
973 | |
998 | |
974 | if (!returnstk) |
999 | yieldstack = *hv_fetch ( |
975 | returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE)); |
1000 | (HV *)SvRV (GvSV (coro_current)), |
|
|
1001 | "yieldstack", sizeof ("yieldstack") - 1, |
|
|
1002 | 0 |
|
|
1003 | ); |
976 | |
1004 | |
977 | /* set up @_ -- ugly */ |
1005 | /* set up @_ -- ugly */ |
978 | av_clear (defav); |
1006 | av_clear (defav); |
979 | av_fill (defav, items - 1); |
1007 | av_fill (defav, items - 1); |
980 | while (items--) |
1008 | while (items--) |
981 | av_store (defav, items, SvREFCNT_inc (ST(items))); |
1009 | av_store (defav, items, SvREFCNT_inc (ST(items))); |
982 | |
1010 | |
983 | mg_get (returnstk); /* isn't documentation wrong for mg_get? */ |
|
|
984 | sv = av_pop ((AV *)SvRV (returnstk)); |
1011 | sv = av_pop ((AV *)SvRV (yieldstack)); |
985 | prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0))); |
1012 | prev = INT2PTR (struct coro *, SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)))); |
986 | next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))); |
1013 | next = INT2PTR (struct coro *, SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)))); |
987 | SvREFCNT_dec (sv); |
1014 | SvREFCNT_dec (sv); |
988 | |
1015 | |
989 | transfer(aTHX_ prev, next, 0); |
1016 | transfer (aTHX_ prev, next, 0); |
990 | |
1017 | |
991 | MODULE = Coro::State PACKAGE = Coro |
1018 | MODULE = Coro::State PACKAGE = Coro |
992 | |
1019 | |
993 | # this is slightly dirty (should expose a c-level api) |
1020 | # this is slightly dirty (should expose a c-level api) |
994 | |
1021 | |
… | |
… | |
1007 | coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); |
1034 | coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); |
1008 | coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); |
1035 | coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); |
1009 | |
1036 | |
1010 | for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) |
1037 | for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) |
1011 | coro_ready[i] = newAV (); |
1038 | coro_ready[i] = newAV (); |
|
|
1039 | |
|
|
1040 | { |
|
|
1041 | SV *sv = perl_get_sv("Coro::API", 1); |
|
|
1042 | |
|
|
1043 | coroapi.schedule = api_schedule; |
|
|
1044 | coroapi.cede = api_cede; |
|
|
1045 | coroapi.ready = api_ready; |
|
|
1046 | coroapi.nready = &coro_nready; |
|
|
1047 | coroapi.current = coro_current; |
|
|
1048 | |
|
|
1049 | GCoroAPI = &coroapi; |
|
|
1050 | sv_setiv(sv, (IV)&coroapi); |
|
|
1051 | SvREADONLY_on(sv); |
|
|
1052 | } |
1012 | } |
1053 | } |
|
|
1054 | |
|
|
1055 | #if !PERL_MICRO |
1013 | |
1056 | |
1014 | void |
1057 | void |
1015 | ready(self) |
1058 | ready(self) |
1016 | SV * self |
1059 | SV * self |
|
|
1060 | PROTOTYPE: $ |
1017 | CODE: |
1061 | CODE: |
1018 | api_ready (self); |
1062 | api_ready (self); |
1019 | |
1063 | |
|
|
1064 | #endif |
|
|
1065 | |
|
|
1066 | int |
|
|
1067 | nready(...) |
|
|
1068 | PROTOTYPE: |
|
|
1069 | CODE: |
|
|
1070 | RETVAL = coro_nready; |
|
|
1071 | OUTPUT: |
|
|
1072 | RETVAL |
|
|
1073 | |
1020 | void |
1074 | void |
1021 | schedule(...) |
1075 | schedule(...) |
1022 | ALIAS: |
1076 | PROTOTYPE: |
1023 | cede = 1 |
|
|
1024 | CODE: |
1077 | CODE: |
1025 | api_schedule (ix); |
1078 | api_schedule (); |
1026 | |
1079 | |
|
|
1080 | void |
|
|
1081 | cede(...) |
|
|
1082 | PROTOTYPE: |
|
|
1083 | CODE: |
|
|
1084 | api_cede (); |
|
|
1085 | |
|
|
1086 | # and these are hacks |
|
|
1087 | SV * |
|
|
1088 | _aio_get_state () |
|
|
1089 | CODE: |
|
|
1090 | { |
|
|
1091 | struct { |
|
|
1092 | int errorno; |
|
|
1093 | int laststype; |
|
|
1094 | int laststatval; |
|
|
1095 | Stat_t statcache; |
|
|
1096 | } data; |
|
|
1097 | |
|
|
1098 | data.errorno = errno; |
|
|
1099 | data.laststype = PL_laststype; |
|
|
1100 | data.laststatval = PL_laststatval; |
|
|
1101 | data.statcache = PL_statcache; |
|
|
1102 | |
|
|
1103 | RETVAL = newSVpvn ((char *)&data, sizeof data); |
|
|
1104 | } |
|
|
1105 | OUTPUT: |
|
|
1106 | RETVAL |
|
|
1107 | |
|
|
1108 | void |
|
|
1109 | _aio_set_state (char *data_) |
|
|
1110 | PROTOTYPE: $ |
|
|
1111 | CODE: |
|
|
1112 | { |
|
|
1113 | struct { |
|
|
1114 | int errorno; |
|
|
1115 | int laststype; |
|
|
1116 | int laststatval; |
|
|
1117 | Stat_t statcache; |
|
|
1118 | } *data = (void *)data_; |
|
|
1119 | |
|
|
1120 | errno = data->errorno; |
|
|
1121 | PL_laststype = data->laststype; |
|
|
1122 | PL_laststatval = data->laststatval; |
|
|
1123 | PL_statcache = data->statcache; |
|
|
1124 | } |