ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/Coro/Coro/State.xs
(Generate patch)

Comparing Coro/Coro/State.xs (file contents):
Revision 1.69 by root, Fri Dec 16 01:33:20 2005 UTC vs.
Revision 1.78 by root, Wed Nov 1 01:21:21 2006 UTC

27# ifndef IS_PADCONST 27# ifndef IS_PADCONST
28# define IS_PADCONST(v) 0 28# define IS_PADCONST(v) 0
29# endif 29# endif
30#endif 30#endif
31 31
32#include <signal.h> 32#include <errno.h>
33
34#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64
35# undef STACKGUARD
36#endif
37
38#ifndef STACKGUARD
39# define STACKGUARD 0
40#endif
33 41
34#ifdef HAVE_MMAP 42#ifdef HAVE_MMAP
35# include <unistd.h> 43# include <unistd.h>
36# include <sys/mman.h> 44# include <sys/mman.h>
37# ifndef MAP_ANONYMOUS 45# ifndef MAP_ANONYMOUS
38# ifdef MAP_ANON 46# ifdef MAP_ANON
39# define MAP_ANONYMOUS MAP_ANON 47# define MAP_ANONYMOUS MAP_ANON
40# else 48# else
41# undef HAVE_MMAP 49# undef HAVE_MMAP
42# endif 50# endif
51# endif
52# include <limits.h>
53# ifndef PAGESIZE
54# define PAGESIZE pagesize
55# define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE)
56static long pagesize;
57# else
58# define BOOT_PAGESIZE
43# endif 59# endif
44#endif 60#endif
45 61
46#define SUB_INIT "Coro::State::initialize" 62#define SUB_INIT "Coro::State::initialize"
47#define UCORO_STATE "_coro_state" 63#define UCORO_STATE "_coro_state"
139}; 155};
140 156
141typedef struct coro *Coro__State; 157typedef struct coro *Coro__State;
142typedef struct coro *Coro__State_or_hashref; 158typedef struct coro *Coro__State_or_hashref;
143 159
144/* mostly copied from op.c:cv_clone2 */ 160static AV *
145STATIC AV * 161coro_clone_padlist (pTHX_ CV *cv)
146clone_padlist (pTHX_ AV *protopadlist)
147{ 162{
148 AV *av; 163 AV *padlist = CvPADLIST (cv);
149 I32 ix;
150 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
151 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
152 SV **pname = AvARRAY (protopad_name);
153 SV **ppad = AvARRAY (protopad);
154 I32 fname = AvFILLp (protopad_name);
155 I32 fpad = AvFILLp (protopad);
156 AV *newpadlist, *newpad_name, *newpad; 164 AV *newpadlist, *newpad;
157 SV **npad;
158
159 newpad_name = newAV ();
160 for (ix = fname; ix >= 0; ix--)
161 av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
162
163 newpad = newAV ();
164 av_fill (newpad, AvFILLp (protopad));
165 npad = AvARRAY (newpad);
166 165
167 newpadlist = newAV (); 166 newpadlist = newAV ();
168 AvREAL_off (newpadlist); 167 AvREAL_off (newpadlist);
169 av_store (newpadlist, 0, (SV *) newpad_name); 168 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1);
169 newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)];
170 --AvFILLp (padlist);
171
172 av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE)));
170 av_store (newpadlist, 1, (SV *) newpad); 173 av_store (newpadlist, 1, (SV *)newpad);
171
172 av = newAV (); /* will be @_ */
173 av_extend (av, 0);
174 av_store (newpad, 0, (SV *) av);
175 AvFLAGS (av) = AVf_REIFY;
176
177 for (ix = fpad; ix > 0; ix--)
178 {
179 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;
180
181 if (namesv && namesv != &PL_sv_undef)
182 {
183 char *name = SvPVX (namesv); /* XXX */
184
185 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&')
186 { /* lexical from outside? */
187 npad[ix] = SvREFCNT_inc (ppad[ix]);
188 }
189 else
190 { /* our own lexical */
191 SV *sv;
192 if (*name == '&')
193 sv = SvREFCNT_inc (ppad[ix]);
194 else if (*name == '@')
195 sv = (SV *) newAV ();
196 else if (*name == '%')
197 sv = (SV *) newHV ();
198 else
199 sv = NEWSV (0, 0);
200
201#ifdef SvPADBUSY
202 if (!SvPADBUSY (sv))
203#endif
204 SvPADMY_on (sv);
205
206 npad[ix] = sv;
207 }
208 }
209 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))
210 {
211 npad[ix] = SvREFCNT_inc (ppad[ix]);
212 }
213 else
214 {
215 SV *sv = NEWSV (0, 0);
216 SvPADTMP_on (sv);
217 npad[ix] = sv;
218 }
219 }
220
221#if 0 /* return -ENOTUNDERSTOOD */
222 /* Now that vars are all in place, clone nested closures. */
223
224 for (ix = fpad; ix > 0; ix--) {
225 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
226 if (namesv
227 && namesv != &PL_sv_undef
228 && !(SvFLAGS(namesv) & SVf_FAKE)
229 && *SvPVX(namesv) == '&'
230 && CvCLONE(ppad[ix]))
231 {
232 CV *kid = cv_clone((CV*)ppad[ix]);
233 SvREFCNT_dec(ppad[ix]);
234 CvCLONE_on(kid);
235 SvPADMY_on(kid);
236 npad[ix] = (SV*)kid;
237 }
238 }
239#endif
240 174
241 return newpadlist; 175 return newpadlist;
242} 176}
243 177
244STATIC void 178static void
245free_padlist (pTHX_ AV *padlist) 179free_padlist (pTHX_ AV *padlist)
246{ 180{
247 /* may be during global destruction */ 181 /* may be during global destruction */
248 if (SvREFCNT (padlist)) 182 if (SvREFCNT (padlist))
249 { 183 {
263 197
264 SvREFCNT_dec ((SV*)padlist); 198 SvREFCNT_dec ((SV*)padlist);
265 } 199 }
266} 200}
267 201
268STATIC int 202static int
269coro_cv_free (pTHX_ SV *sv, MAGIC *mg) 203coro_cv_free (pTHX_ SV *sv, MAGIC *mg)
270{ 204{
271 AV *padlist; 205 AV *padlist;
272 AV *av = (AV *)mg->mg_obj; 206 AV *av = (AV *)mg->mg_obj;
273 207
274 /* casting is fun. */ 208 /* casting is fun. */
275 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) 209 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
276 free_padlist (aTHX_ padlist); 210 free_padlist (aTHX_ padlist);
277 211
278 SvREFCNT_dec (av); 212 SvREFCNT_dec (av);
213
214 return 0;
279} 215}
280 216
281#define PERL_MAGIC_coro PERL_MAGIC_ext 217#define PERL_MAGIC_coro PERL_MAGIC_ext
282 218
283static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; 219static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
284 220
285/* the next two functions merely cache the padlists */ 221/* the next two functions merely cache the padlists */
286STATIC void 222static void
287get_padlist (pTHX_ CV *cv) 223get_padlist (pTHX_ CV *cv)
288{ 224{
289 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); 225 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
290 226
291 if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0) 227 if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0)
292 CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj); 228 CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj);
293 else 229 else
230 {
231#if 0
232 /* this should work - but it doesn't :( */
233 CV *cp = Perl_cv_clone (aTHX_ cv);
234 CvPADLIST (cv) = CvPADLIST (cp);
235 CvPADLIST (cp) = 0;
236 SvREFCNT_dec (cp);
237#else
294 CvPADLIST (cv) = clone_padlist (aTHX_ CvPADLIST (cv)); 238 CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv);
239#endif
240 }
295} 241}
296 242
297STATIC void 243static void
298put_padlist (pTHX_ CV *cv) 244put_padlist (pTHX_ CV *cv)
299{ 245{
300 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); 246 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
301 247
302 if (!mg) 248 if (!mg)
345 PL_scopestack_ix = c->scopestack_ix; 291 PL_scopestack_ix = c->scopestack_ix;
346 PL_scopestack_max = c->scopestack_max; 292 PL_scopestack_max = c->scopestack_max;
347 PL_savestack = c->savestack; 293 PL_savestack = c->savestack;
348 PL_savestack_ix = c->savestack_ix; 294 PL_savestack_ix = c->savestack_ix;
349 PL_savestack_max = c->savestack_max; 295 PL_savestack_max = c->savestack_max;
296#if PERL_VERSION < 9
350 PL_retstack = c->retstack; 297 PL_retstack = c->retstack;
351 PL_retstack_ix = c->retstack_ix; 298 PL_retstack_ix = c->retstack_ix;
352 PL_retstack_max = c->retstack_max; 299 PL_retstack_max = c->retstack_max;
300#endif
353 PL_curpm = c->curpm; 301 PL_curpm = c->curpm;
354 PL_curcop = c->curcop; 302 PL_curcop = c->curcop;
355 PL_top_env = c->top_env; 303 PL_top_env = c->top_env;
356 304
357 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); 305 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
417 } 365 }
418 366
419 PUSHs ((SV *)CvPADLIST(cv)); 367 PUSHs ((SV *)CvPADLIST(cv));
420 PUSHs ((SV *)cv); 368 PUSHs ((SV *)cv);
421 369
422 get_padlist (aTHX_ cv); /* this is a monster */ 370 get_padlist (aTHX_ cv);
423 } 371 }
424 } 372 }
425#ifdef CXt_FORMAT 373#ifdef CXt_FORMAT
426 else if (CxTYPE(cx) == CXt_FORMAT) 374 else if (CxTYPE(cx) == CXt_FORMAT)
427 { 375 {
471 c->scopestack_ix = PL_scopestack_ix; 419 c->scopestack_ix = PL_scopestack_ix;
472 c->scopestack_max = PL_scopestack_max; 420 c->scopestack_max = PL_scopestack_max;
473 c->savestack = PL_savestack; 421 c->savestack = PL_savestack;
474 c->savestack_ix = PL_savestack_ix; 422 c->savestack_ix = PL_savestack_ix;
475 c->savestack_max = PL_savestack_max; 423 c->savestack_max = PL_savestack_max;
424#if PERL_VERSION < 9
476 c->retstack = PL_retstack; 425 c->retstack = PL_retstack;
477 c->retstack_ix = PL_retstack_ix; 426 c->retstack_ix = PL_retstack_ix;
478 c->retstack_max = PL_retstack_max; 427 c->retstack_max = PL_retstack_max;
428#endif
479 c->curpm = PL_curpm; 429 c->curpm = PL_curpm;
480 c->curcop = PL_curcop; 430 c->curcop = PL_curcop;
481 c->top_env = PL_top_env; 431 c->top_env = PL_top_env;
482} 432}
483 433
485 * allocate various perl stacks. This is an exact copy 435 * allocate various perl stacks. This is an exact copy
486 * of perl.c:init_stacks, except that it uses less memory 436 * of perl.c:init_stacks, except that it uses less memory
487 * on the (sometimes correct) assumption that coroutines do 437 * on the (sometimes correct) assumption that coroutines do
488 * not usually need a lot of stackspace. 438 * not usually need a lot of stackspace.
489 */ 439 */
490STATIC void 440static void
491coro_init_stacks (pTHX) 441coro_init_stacks (pTHX)
492{ 442{
493 LOCK; 443 LOCK;
494 444
495 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 445 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
520 470
521 New(54,PL_savestack,96,ANY); 471 New(54,PL_savestack,96,ANY);
522 PL_savestack_ix = 0; 472 PL_savestack_ix = 0;
523 PL_savestack_max = 96; 473 PL_savestack_max = 96;
524 474
475#if PERL_VERSION < 9
525 New(54,PL_retstack,8,OP*); 476 New(54,PL_retstack,8,OP*);
526 PL_retstack_ix = 0; 477 PL_retstack_ix = 0;
527 PL_retstack_max = 8; 478 PL_retstack_max = 8;
479#endif
528 480
529 UNLOCK; 481 UNLOCK;
530} 482}
531 483
532/* 484/*
533 * destroy the stacks, the callchain etc... 485 * destroy the stacks, the callchain etc...
534 */ 486 */
535STATIC void 487static void
536destroy_stacks(pTHX) 488destroy_stacks(pTHX)
537{ 489{
538 if (!IN_DESTRUCT) 490 if (!IN_DESTRUCT)
539 { 491 {
540 /* is this ugly, I ask? */ 492 /* is this ugly, I ask? */
572 524
573 Safefree (PL_tmps_stack); 525 Safefree (PL_tmps_stack);
574 Safefree (PL_markstack); 526 Safefree (PL_markstack);
575 Safefree (PL_scopestack); 527 Safefree (PL_scopestack);
576 Safefree (PL_savestack); 528 Safefree (PL_savestack);
529#if PERL_VERSION < 9
577 Safefree (PL_retstack); 530 Safefree (PL_retstack);
531#endif
578} 532}
579 533
580static void 534static void
581allocate_stack (Coro__State ctx, int alloc) 535allocate_stack (Coro__State ctx, int alloc)
582{ 536{
589 stack->gencnt = ctx->gencnt = 0; 543 stack->gencnt = ctx->gencnt = 0;
590 544
591 if (alloc) 545 if (alloc)
592 { 546 {
593#if HAVE_MMAP 547#if HAVE_MMAP
594 stack->ssize = STACKSIZE * sizeof (long); /* mmap should do allocate-on-write for us */ 548 stack->ssize = ((STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + STACKGUARD) * PAGESIZE; /* mmap should do allocate-on-write for us */
595 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); 549 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
596 if (stack->sptr == (void *)-1) 550 if (stack->sptr != (void *)-1)
597#endif
598 { 551 {
599 /*FIXME*//*D*//* reasonable stack size! */ 552# if STACKGUARD
553 mprotect (stack->sptr, STACKGUARD * PAGESIZE, PROT_NONE);
554# endif
555 }
556 else
557#endif
558 {
600 stack->ssize = - (STACKSIZE * sizeof (long)); 559 stack->ssize = - (STACKSIZE * (long)sizeof (long));
601 New (0, stack->sptr, STACKSIZE, long); 560 New (0, stack->sptr, STACKSIZE, long);
602 } 561 }
603 } 562 }
604 else 563 else
605 stack->sptr = 0; 564 stack->sptr = 0;
697 /* 656 /*
698 * this is a _very_ stripped down perl interpreter ;) 657 * this is a _very_ stripped down perl interpreter ;)
699 */ 658 */
700 dTHX; 659 dTHX;
701 Coro__State ctx = (Coro__State)arg; 660 Coro__State ctx = (Coro__State)arg;
702 JMPENV coro_start_env;
703 661
704 PL_top_env = &ctx->start_env; 662 PL_top_env = &ctx->start_env;
705 663
706 ctx->cursp = 0; 664 ctx->cursp = 0;
707 PL_op = PL_op->op_next; 665 PL_op = PL_op->op_next;
708 CALLRUNOPS(aTHX); 666 CALLRUNOPS(aTHX);
709 667
710 abort (); 668 abort ();
711} 669}
712 670
713STATIC void 671static void
714transfer (pTHX_ struct coro *prev, struct coro *next, int flags) 672transfer (pTHX_ struct coro *prev, struct coro *next, int flags)
715{ 673{
716 dSTACKLEVEL; 674 dSTACKLEVEL;
717 675
718 if (prev != next) 676 if (prev != next)
830 if (!SvOBJECT (sv) || SvSTASH (sv) != coro_state_stash) \ 788 if (!SvOBJECT (sv) || SvSTASH (sv) != coro_state_stash) \
831 croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \ 789 croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \
832 \ 790 \
833 } while(0) 791 } while(0)
834 792
835#define SvSTATE(sv) (struct coro *)SvIV (sv) 793#define SvSTATE(sv) INT2PTR (struct coro *, SvIV (sv))
836 794
837static void 795static void
838api_transfer(pTHX_ SV *prev, SV *next, int flags) 796api_transfer(pTHX_ SV *prev, SV *next, int flags)
839{ 797{
840 SV_CORO (prev, "Coro::transfer"); 798 SV_CORO (prev, "Coro::transfer");
858static int coro_nready; 816static int coro_nready;
859 817
860static void 818static void
861coro_enq (pTHX_ SV *sv) 819coro_enq (pTHX_ SV *sv)
862{ 820{
821 SV **xprio;
822 int prio;
823
863 if (SvTYPE (sv) == SVt_PVHV) 824 if (SvTYPE (sv) != SVt_PVHV)
864 {
865 SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0);
866 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
867
868 prio = prio > PRIO_MAX ? PRIO_MAX
869 : prio < PRIO_MIN ? PRIO_MIN
870 : prio;
871
872 av_push (coro_ready [prio - PRIO_MIN], sv);
873 coro_nready++;
874
875 return;
876 }
877
878 croak ("Coro::ready tried to enqueue something that is not a coroutine"); 825 croak ("Coro::ready tried to enqueue something that is not a coroutine");
826
827 xprio = hv_fetch ((HV *)sv, "prio", 4, 0);
828 prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
829
830 prio = prio > PRIO_MAX ? PRIO_MAX
831 : prio < PRIO_MIN ? PRIO_MIN
832 : prio;
833
834 av_push (coro_ready [prio - PRIO_MIN], sv);
835 coro_nready++;
879} 836}
880 837
881static SV * 838static SV *
882coro_deq (pTHX_ int min_prio) 839coro_deq (pTHX_ int min_prio)
883{ 840{
958BOOT: 915BOOT:
959{ /* {} necessary for stoopid perl-5.6.x */ 916{ /* {} necessary for stoopid perl-5.6.x */
960#ifdef USE_ITHREADS 917#ifdef USE_ITHREADS
961 MUTEX_INIT (&coro_mutex); 918 MUTEX_INIT (&coro_mutex);
962#endif 919#endif
920 BOOT_PAGESIZE;
963 921
964 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); 922 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);
965 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); 923 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);
966 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 924 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
967 925
1072 av_fill (defav, items - 1); 1030 av_fill (defav, items - 1);
1073 while (items--) 1031 while (items--)
1074 av_store (defav, items, SvREFCNT_inc (ST(items))); 1032 av_store (defav, items, SvREFCNT_inc (ST(items)));
1075 1033
1076 sv = av_pop ((AV *)SvRV (yieldstack)); 1034 sv = av_pop ((AV *)SvRV (yieldstack));
1077 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0))); 1035 prev = INT2PTR (struct coro *, SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0))));
1078 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))); 1036 next = INT2PTR (struct coro *, SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))));
1079 SvREFCNT_dec (sv); 1037 SvREFCNT_dec (sv);
1080 1038
1081 transfer (aTHX_ prev, next, 0); 1039 transfer (aTHX_ prev, next, 0);
1082 1040
1083MODULE = Coro::State PACKAGE = Coro 1041MODULE = Coro::State PACKAGE = Coro
1146cede(...) 1104cede(...)
1147 PROTOTYPE: 1105 PROTOTYPE:
1148 CODE: 1106 CODE:
1149 api_cede (); 1107 api_cede ();
1150 1108
1109# and these are hacks
1110SV *
1111_aio_get_state ()
1112 CODE:
1113{
1114 struct {
1115 int errorno;
1116 int laststype;
1117 int laststatval;
1118 Stat_t statcache;
1119 } data;
1120
1121 data.errorno = errno;
1122 data.laststype = PL_laststype;
1123 data.laststatval = PL_laststatval;
1124 data.statcache = PL_statcache;
1125
1126 RETVAL = newSVpvn ((char *)&data, sizeof data);
1127}
1128 OUTPUT:
1129 RETVAL
1130
1131void
1132_aio_set_state (char *data_)
1133 PROTOTYPE: $
1134 CODE:
1135{
1136 struct {
1137 int errorno;
1138 int laststype;
1139 int laststatval;
1140 Stat_t statcache;
1141 } *data = (void *)data_;
1142
1143 errno = data->errorno;
1144 PL_laststype = data->laststype;
1145 PL_laststatval = data->laststatval;
1146 PL_statcache = data->statcache;
1147}

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines