3 * Copyright (c) 2001-2002, 2006 Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
8 * "Hand any two wizards a piece of rope and they would instinctively pull in
9 * opposite directions."
12 * Contributed by Arthur Bergman arthur@contiller.se
13 * pulled in the (an)other direction by Nick Ing-Simmons nick@ing-simmons.net
17 * Shared variables are implemented by a scheme similar to tieing.
18 * Each thread has a proxy SV with attached magic -- "private SVs" --
19 * which all point to a single SV in a separate shared interpreter
20 * (PL_sharedsv_space) -- "shared SVs".
22 * The shared SV holds the variable's true values, and its state is
23 * copied between the shared and private SVs with the usual
24 * mg_get()/mg_set() arrangement.
26 * Aggregates (AVs and HVs) are implemented using tie magic, except that
27 * the vtable used is one defined in this file rather than the standard one.
28 * This means that where a tie function like is FETCH is normally invoked by
29 * the tie magic's mg_get() function, we completely bypass the calling of a
30 * perl-level function, and directly call C-level code to handle it. On
31 * the other hand. calls to functions like PUSH are done directly by code
32 * in av.c etc, which we can't bypass. So the best we can do is to provide
33 * XS versions of these functions. We also have to attach a tie object,
34 * blessed into the class threads::shared::tie, to keep the method-calling
37 * Access to aggregate elements is done the usual tied way by returning a
38 * proxy PVLV element with attached element magic.
40 * Pointers to the shared SV are squirrelled away in the mg->mg_ptr field
41 * of magic (with mg_len == 0), and in the IV2PTR(SvIV(sv)) field of tied
42 * object SVs. These pointers have to be hidden like this because they
43 * cross interpreter boundaries, and we don't want sv_clear() and friends
46 * The three basic shared types look like the following:
50 * Shared scalar (my $s : shared):
52 * SV = PVMG(0x7ba238) at 0x7387a8
53 * FLAGS = (PADMY,GMG,SMG)
55 * MG_TYPE = PERL_MAGIC_shared_scalar(n)
56 * MG_PTR = 0x810358 <<<< pointer to the shared SV
60 * Shared aggregate (my @a : shared; my %h : shared):
62 * SV = PVAV(0x7175d0) at 0x738708
65 * MG_TYPE = PERL_MAGIC_tied(P)
66 * MG_OBJ = 0x7136e0 <<<< ref to the tied object
67 * SV = RV(0x7136f0) at 0x7136e0
69 * SV = PVMG(0x7ba238) at 0x738640 <<<< the tied object
70 * FLAGS = (OBJECT,IOK,pIOK)
71 * IV = 8455000 <<<< pointer to the shared AV
72 * STASH = 0x80abf0 "threads::shared::tie"
73 * MG_PTR = 0x810358 "" <<<< another pointer to the shared AV
78 * Aggregate element (my @a : shared; $a[0])
80 * SV = PVLV(0x77f628) at 0x713550
81 * FLAGS = (GMG,SMG,RMG,pIOK)
83 * MG_TYPE = PERL_MAGIC_shared_scalar(n)
84 * MG_PTR = 0x8103c0 "" <<<< pointer to the shared element
86 * MG_TYPE = PERL_MAGIC_tiedelem(p)
87 * MG_OBJ = 0x7136e0 <<<< ref to the tied object
88 * SV = RV(0x7136f0) at 0x7136e0
90 * SV = PVMG(0x7ba278) at 0x738660 <<<< the tied object
91 * FLAGS = (OBJECT,IOK,pIOK)
92 * IV = 8455064 <<<< pointer to the shared AV
93 * STASH = 0x80ac30 "threads::shared::tie"
96 * Note that PERL_MAGIC_tiedelem(p) magic doesn't have a pointer to a
97 * shared SV in mg_ptr; instead this is used to store the hash key,
98 * if any, like normal tied elements. Note also that element SVs may have
99 * pointers to both the shared aggregate and the shared element
104 * if a shared variable is used as a perl-level lock or condition
105 * variable, then PERL_MAGIC_ext magic is attached to the associated
106 * *shared* SV, whose mg_ptr field points to a malloced structure
107 * containing the necessary mutexes and condition variables.
111 * In this file, any variable name prefixed with 's', eg ssv, stmp or sobj,
112 * usually represents a shared SV which correspondis to a private SV named
113 * without the prefix, eg sv, tmp or obj.
116 #define PERL_NO_GET_CONTEXT
124 * The shared things need an intepreter to live in ...
126 PerlInterpreter *PL_sharedsv_space; /* The shared sv space */
127 /* To access shared space we fake aTHX in this scope and thread's context */
129 /* bug #24255: we include ENTER+SAVETMPS/FREETMPS+LEAVE with
130 * SHARED_CONTEXT/CALLER_CONTEXT macros, so that any mortals etc created
131 * while in the shared interpreter context don't languish */
133 #define SHARED_CONTEXT \
135 PERL_SET_CONTEXT((aTHX = PL_sharedsv_space)); \
140 /* So we need a way to switch back to the caller's context... */
141 /* So we declare _another_ copy of the aTHX variable ... */
142 #define dTHXc PerlInterpreter *caller_perl = aTHX
144 /* and use it to switch back */
145 #define CALLER_CONTEXT \
149 PERL_SET_CONTEXT((aTHX = caller_perl)); \
153 * Only one thread at a time is allowed to mess with shared space.
159 PerlInterpreter *owner;
168 recursive_lock_t PL_sharedsv_lock; /* Mutex protecting the shared sv space */
171 recursive_lock_init(pTHX_ recursive_lock_t *lock)
173 Zero(lock,1,recursive_lock_t);
174 MUTEX_INIT(&lock->mutex);
175 COND_INIT(&lock->cond);
179 recursive_lock_destroy(pTHX_ recursive_lock_t *lock)
181 MUTEX_DESTROY(&lock->mutex);
182 COND_DESTROY(&lock->cond);
186 recursive_lock_release(pTHX_ recursive_lock_t *lock)
188 MUTEX_LOCK(&lock->mutex);
189 if (lock->owner != aTHX) {
190 MUTEX_UNLOCK(&lock->mutex);
193 if (--lock->locks == 0) {
195 COND_SIGNAL(&lock->cond);
198 MUTEX_UNLOCK(&lock->mutex);
202 recursive_lock_acquire(pTHX_ recursive_lock_t *lock,char *file,int line)
205 MUTEX_LOCK(&lock->mutex);
206 if (lock->owner == aTHX) {
210 while (lock->owner) {
212 Perl_warn(aTHX_ " %p waiting - owned by %p %s:%d\n",
213 aTHX, lock->owner, lock->file, lock->line);
215 COND_WAIT(&lock->cond,&lock->mutex);
224 MUTEX_UNLOCK(&lock->mutex);
225 SAVEDESTRUCTOR_X(recursive_lock_release,lock);
228 #define ENTER_LOCK STMT_START { \
230 recursive_lock_acquire(aTHX_ &PL_sharedsv_lock, __FILE__, __LINE__); \
233 /* the unlocking is done automatically at scope exit */
234 #define LEAVE_LOCK LEAVE
237 /* A common idiom is to acquire access and switch in ... */
238 #define SHARED_EDIT STMT_START { \
243 /* then switch out and release access. */
244 #define SHARED_RELEASE STMT_START { \
251 This structure is attached (using ext magic) to any shared SV that
252 is used by user-level locking or condition code
256 recursive_lock_t lock; /* for user-levl locks */
257 perl_cond user_cond; /* For user-level conditions */
260 /* magic used for attaching user_lock structs to shared SVs
262 The vtable used has just one entry - when the SV goes away
263 we free the memory for the above.
267 sharedsv_userlock_free(pTHX_ SV *sv, MAGIC *mg)
269 user_lock *ul = (user_lock *) mg->mg_ptr;
270 assert(aTHX == PL_sharedsv_space);
272 recursive_lock_destroy(aTHX_ &ul->lock);
273 COND_DESTROY(&ul->user_cond);
274 PerlMemShared_free(ul);
280 MGVTBL sharedsv_uesrlock_vtbl = {
285 sharedsv_userlock_free, /* free */
291 /* Access to shared things is heavily based on MAGIC - in mg.h/mg.c/sv.c sense */
293 /* In any thread that has access to a shared thing there is a "proxy"
294 for it in its own space which has 'MAGIC' associated which accesses
298 MGVTBL sharedsv_scalar_vtbl; /* scalars have this vtable */
299 MGVTBL sharedsv_array_vtbl; /* hashes and arrays have this - like 'tie' */
300 MGVTBL sharedsv_elem_vtbl; /* elements of hashes and arrays have this
301 _AS WELL AS_ the scalar magic:
302 The sharedsv_elem_vtbl associates the element with the array/hash and
303 the sharedsv_scalar_vtbl associates it with the value
307 /* get shared aggregate SV pointed to by threads::shared::tie magic object */
310 S_sharedsv_from_obj(pTHX_ SV *sv)
312 return SvROK(sv) ? INT2PTR(SV *, SvIV(SvRV(sv))) : NULL;
316 /* Return the user_lock structure (if any) associated with a shared SV.
317 * If create is true, create one if it doesn't exist */
320 S_get_userlock(pTHX_ SV* ssv, bool create)
323 user_lock *ul = NULL;
326 /* XXX redsign the storage of user locks so we dont need a global
327 * lock to access them ???? DAPM */
329 mg = mg_find(ssv, PERL_MAGIC_ext);
331 ul = (user_lock*)(mg->mg_ptr);
335 ul = (user_lock *) PerlMemShared_malloc(sizeof(user_lock));
336 Zero(ul, 1, user_lock);
337 /* attach to shared SV using ext magic */
338 sv_magicext(ssv, NULL, PERL_MAGIC_ext, &sharedsv_uesrlock_vtbl,
340 recursive_lock_init(aTHX_ &ul->lock);
341 COND_INIT(&ul->user_cond);
349 =for apidoc sharedsv_find
351 Given a private side SV tries to find if the SV has a shared backend,
352 by looking for the magic.
357 Perl_sharedsv_find(pTHX_ SV *sv)
360 if (SvTYPE(sv) >= SVt_PVMG) {
364 if ((mg = mg_find(sv, PERL_MAGIC_tied))
365 && mg->mg_virtual == &sharedsv_array_vtbl) {
366 return (SV *) mg->mg_ptr;
370 /* This should work for elements as well as they
371 * have scalar magic as well as their element magic
373 if ((mg = mg_find(sv, PERL_MAGIC_shared_scalar))
374 && mg->mg_virtual == &sharedsv_scalar_vtbl) {
375 return (SV *) mg->mg_ptr;
380 /* Just for tidyness of API also handle tie objects */
381 if (SvROK(sv) && sv_derived_from(sv, "threads::shared::tie")) {
382 return S_sharedsv_from_obj(aTHX_ sv);
388 /* associate a private SV with a shared SV by pointing the appropriate
389 * magics at it. Assumes lock is held */
392 Perl_sharedsv_associate(pTHX_ SV *sv, SV *ssv)
397 /* If we are asked for any private ops we need a thread */
398 assert ( aTHX != PL_sharedsv_space );
400 /* To avoid need for recursive locks require caller to hold lock */
401 assert ( PL_sharedsv_lock.owner == aTHX );
406 if (!(mg = mg_find(sv, PERL_MAGIC_tied))
407 || mg->mg_virtual != &sharedsv_array_vtbl
408 || (SV*) mg->mg_ptr != ssv)
411 sv_setref_iv(obj, "threads::shared::tie",PTR2IV(ssv));
413 sv_unmagic(sv, PERL_MAGIC_tied);
415 mg = sv_magicext(sv, obj, PERL_MAGIC_tied, &sharedsv_array_vtbl,
417 mg->mg_flags |= (MGf_COPY|MGf_DUP);
424 if ((SvTYPE(sv) < SVt_PVMG)
425 || !(mg = mg_find(sv, PERL_MAGIC_shared_scalar))
426 || mg->mg_virtual != &sharedsv_scalar_vtbl
427 || (SV*) mg->mg_ptr != ssv)
430 sv_unmagic(sv, PERL_MAGIC_shared_scalar);
432 mg = sv_magicext(sv, Nullsv, PERL_MAGIC_shared_scalar,
433 &sharedsv_scalar_vtbl, (char *)ssv, 0);
434 mg->mg_flags |= (MGf_DUP|MGf_LOCAL);
439 assert ( Perl_sharedsv_find(aTHX_ sv) == ssv );
443 /* Given a private SV, create and return an associated shared SV.
444 * Assumes lock is held */
447 S_sharedsv_new_shared(pTHX_ SV *sv)
452 assert(PL_sharedsv_lock.owner == aTHX);
453 assert(aTHX != PL_sharedsv_space);
457 SvREFCNT(ssv) = 0; /* will be upped to 1 by Perl_sharedsv_associate */
458 sv_upgrade(ssv, SvTYPE(sv));
460 Perl_sharedsv_associate(aTHX_ sv, ssv);
465 /* Given a shared SV, create and return an associated private SV.
466 * Assumes lock is held */
469 S_sharedsv_new_private(pTHX_ SV *ssv)
473 assert(PL_sharedsv_lock.owner == aTHX);
474 assert(aTHX != PL_sharedsv_space);
477 sv_upgrade(sv, SvTYPE(ssv));
478 Perl_sharedsv_associate(aTHX_ sv, ssv);
483 /* a threadsafe version of SvREFCNT_dec(ssv) */
486 S_sharedsv_dec(pTHX_ SV* ssv)
491 if (SvREFCNT(ssv) > 1) {
492 /* no side effects, so can do it lightweight */
504 /* implements Perl-level share() and :shared */
507 Perl_sharedsv_share(pTHX_ SV *sv)
511 Perl_croak(aTHX_ "Cannot share globs yet");
515 Perl_croak(aTHX_ "Cannot share subs yet");
520 (void) S_sharedsv_new_shared(aTHX_ sv);
527 #if defined(WIN32) || defined(OS2)
528 # define ABS2RELMILLI(abs) \
530 abs -= (double)time(NULL); \
531 if (abs > 0) { abs *= 1000; } \
534 #endif /* WIN32 || OS2 */
536 /* do OS-specific condition timed wait */
539 Perl_sharedsv_cond_timedwait(perl_cond *cond, perl_mutex *mut, double abs)
541 #if defined(NETWARE) || defined(FAKE_THREADS) || defined(I_MACH_CTHREADS)
542 Perl_croak_nocontext("cond_timedwait not supported on this platform");
551 /* See comments in win32/win32thread.h COND_WAIT vis-a-vis race */
552 switch (WaitForSingleObject(cond->sem, (DWORD)abs)) {
553 case WAIT_OBJECT_0: got_it = 1; break;
554 case WAIT_TIMEOUT: break;
556 /* WAIT_FAILED? WAIT_ABANDONED? others? */
557 Perl_croak_nocontext("panic: cond_timedwait (%ld)",GetLastError());
570 if ((rc = DosResetEventSem(*cond,&n_a)) && (rc != ERROR_ALREADY_RESET))
571 Perl_rc = rc, croak_with_os2error("panic: cond_timedwait-reset");
573 if (CheckOSError(DosWaitEventSem(*cond,abs))
574 && (rc != ERROR_INTERRUPT))
575 croak_with_os2error("panic: cond_timedwait");
576 if (rc == ERROR_INTERRUPT) errno = EINTR;
579 # else /* hope you're I_PTHREAD! */
583 ts.tv_sec = (long)abs;
584 abs -= (NV)ts.tv_sec;
585 ts.tv_nsec = (long)(abs * 1000000000.0);
587 switch (pthread_cond_timedwait(cond, mut, &ts)) {
588 case 0: got_it = 1; break;
589 case ETIMEDOUT: break;
591 Perl_croak_nocontext("panic: cond_timedwait");
597 #endif /* NETWARE || FAKE_THREADS || I_MACH_CTHREADS */
601 /* given a shared RV, copy it's value to a private RV, also coping the
602 * object status of the referent.
603 * If the private side is already an appropriate RV->SV combination, keep
608 S_get_RV(pTHX_ SV *sv, SV *ssv) {
609 SV *sobj = SvRV(ssv);
612 && ((obj = SvRV(sv)))
613 && (Perl_sharedsv_find(aTHX_ obj) == sobj)
614 && (SvTYPE(obj) == SvTYPE(sobj))
618 /* can't reuse obj */
620 SvREFCNT_dec(SvRV(sv));
623 assert(SvTYPE(sv) >= SVt_RV);
624 sv_setsv_nomg(sv, &PL_sv_undef);
627 obj = S_sharedsv_new_private(aTHX_ SvRV(ssv));
632 /* remove any old blessing */
633 SvREFCNT_dec(SvSTASH(obj));
636 if (SvOBJECT(sobj)) {
637 /* add any new old blessing */
639 char* stash_ptr = SvPV((SV*) SvSTASH(sobj), len);
640 HV* stash = gv_stashpvn(stash_ptr, len, TRUE);
642 SvSTASH_set(obj, (HV*)SvREFCNT_inc(stash));
647 /* ------------ PERL_MAGIC_shared_scalar(n) functions -------------- */
649 /* get magic for PERL_MAGIC_shared_scalar(n) */
652 sharedsv_scalar_mg_get(pTHX_ SV *sv, MAGIC *mg)
654 SV *ssv = (SV *) mg->mg_ptr;
659 S_get_RV(aTHX_ sv, ssv);
662 sv_setsv_nomg(sv, ssv);
668 /* copy the contents of a private SV to a shared SV:
669 * used by various mg_set()-type functions.
670 * Assumes lock is held */
673 sharedsv_scalar_store(pTHX_ SV *sv, SV *ssv)
678 assert(PL_sharedsv_lock.owner == aTHX);
681 SV *sobj = Perl_sharedsv_find(aTHX_ obj);
684 SvUPGRADE(ssv, SVt_RV);
685 sv_setsv_nomg(ssv, &PL_sv_undef);
687 SvRV_set(ssv, SvREFCNT_inc(sobj));
690 SV* fake_stash = newSVpv(HvNAME_get(SvSTASH(obj)),0);
692 SvSTASH_set(sobj, (HV*)fake_stash);
703 sv_setsv_nomg(ssv, sv);
705 SV* fake_stash = newSVpv(HvNAME_get(SvSTASH(sv)),0);
707 SvSTASH_set(ssv, (HV*)fake_stash);
712 Perl_croak(aTHX_ "Invalid value for shared scalar");
716 /* set magic for PERL_MAGIC_shared_scalar(n) */
719 sharedsv_scalar_mg_set(pTHX_ SV *sv, MAGIC *mg)
721 SV *ssv = (SV*)(mg->mg_ptr);
724 if (SvTYPE(ssv) < SvTYPE(sv)) {
727 sv_upgrade(ssv, SvTYPE(sv));
730 sharedsv_scalar_store(aTHX_ sv, ssv);
735 /* free magic for PERL_MAGIC_shared_scalar(n) */
738 sharedsv_scalar_mg_free(pTHX_ SV *sv, MAGIC *mg)
740 S_sharedsv_dec(aTHX_ (SV*)mg->mg_ptr);
745 * Called during cloning of PERL_MAGIC_shared_scalar(n) magic in new thread
748 sharedsv_scalar_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS *param)
750 SvREFCNT_inc(mg->mg_ptr);
755 * Called during local $shared
758 sharedsv_scalar_mg_local(pTHX_ SV* nsv, MAGIC *mg)
761 SV *ssv = (SV *) mg->mg_ptr;
767 nmg = sv_magicext(nsv, mg->mg_obj, mg->mg_type, mg->mg_virtual,
768 mg->mg_ptr, mg->mg_len);
769 nmg->mg_flags = mg->mg_flags;
770 nmg->mg_private = mg->mg_private;
775 MGVTBL sharedsv_scalar_vtbl = {
776 sharedsv_scalar_mg_get, /* get */
777 sharedsv_scalar_mg_set, /* set */
780 sharedsv_scalar_mg_free, /* free */
782 sharedsv_scalar_mg_dup, /* dup */
783 sharedsv_scalar_mg_local /* local */
786 /* ------------ PERL_MAGIC_tiedelem(p) functions -------------- */
788 /* get magic for PERL_MAGIC_tiedelem(p) */
791 sharedsv_elem_mg_FETCH(pTHX_ SV *sv, MAGIC *mg)
794 SV *saggregate = S_sharedsv_from_obj(aTHX_ mg->mg_obj);
798 if (SvTYPE(saggregate) == SVt_PVAV) {
799 assert ( mg->mg_ptr == 0 );
801 svp = av_fetch((AV*) saggregate, mg->mg_len, 0);
804 char *key = mg->mg_ptr;
805 STRLEN len = mg->mg_len;
806 assert ( mg->mg_ptr != 0 );
807 if (mg->mg_len == HEf_SVKEY) {
808 key = SvPV((SV *) mg->mg_ptr, len);
811 svp = hv_fetch((HV*) saggregate, key, len, 0);
815 /* Exists in the array */
817 S_get_RV(aTHX_ sv, *svp);
820 /* XXX can this branch ever happen? DAPM */
821 /* XXX assert("no such branch"); */
822 Perl_sharedsv_associate(aTHX_ sv, *svp);
827 /* Not in the array */
828 sv_setsv(sv, &PL_sv_undef);
834 /* set magic for PERL_MAGIC_tiedelem(p) */
837 sharedsv_elem_mg_STORE(pTHX_ SV *sv, MAGIC *mg)
840 SV *saggregate = S_sharedsv_from_obj(aTHX_ mg->mg_obj);
842 /* Theory - SV itself is magically shared - and we have ordered the
843 magic such that by the time we get here it has been stored
844 to its shared counterpart
848 if (SvTYPE(saggregate) == SVt_PVAV) {
849 assert ( mg->mg_ptr == 0 );
851 svp = av_fetch((AV*) saggregate, mg->mg_len, 1);
854 char *key = mg->mg_ptr;
855 STRLEN len = mg->mg_len;
856 assert ( mg->mg_ptr != 0 );
857 if (mg->mg_len == HEf_SVKEY)
858 key = SvPV((SV *) mg->mg_ptr, len);
860 svp = hv_fetch((HV*) saggregate, key, len, 1);
863 Perl_sharedsv_associate(aTHX_ sv, *svp);
864 sharedsv_scalar_store(aTHX_ sv, *svp);
869 /* clear magic for PERL_MAGIC_tiedelem(p) */
872 sharedsv_elem_mg_DELETE(pTHX_ SV *sv, MAGIC *mg)
876 SV *saggregate = S_sharedsv_from_obj(aTHX_ mg->mg_obj);
878 sharedsv_elem_mg_FETCH(aTHX_ sv, mg);
879 if ((shmg = mg_find(sv, PERL_MAGIC_shared_scalar)))
880 sharedsv_scalar_mg_get(aTHX_ sv, shmg);
881 if (SvTYPE(saggregate) == SVt_PVAV) {
883 av_delete((AV*) saggregate, mg->mg_len, G_DISCARD);
886 char *key = mg->mg_ptr;
887 STRLEN len = mg->mg_len;
888 assert ( mg->mg_ptr != 0 );
889 if (mg->mg_len == HEf_SVKEY)
890 key = SvPV((SV *) mg->mg_ptr, len);
892 hv_delete((HV*) saggregate, key, len, G_DISCARD);
899 /* Called during cloning of PERL_MAGIC_tiedelem(p) magic in new
903 sharedsv_elem_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS *param)
905 SvREFCNT_inc(S_sharedsv_from_obj(aTHX_ mg->mg_obj));
906 assert(mg->mg_flags & MGf_DUP);
910 MGVTBL sharedsv_elem_vtbl = {
911 sharedsv_elem_mg_FETCH, /* get */
912 sharedsv_elem_mg_STORE, /* set */
914 sharedsv_elem_mg_DELETE, /* clear */
917 sharedsv_elem_mg_dup, /* dup */
921 /* ------------ PERL_MAGIC_tied(P) functions -------------- */
923 /* len magic for PERL_MAGIC_tied(P) */
926 sharedsv_array_mg_FETCHSIZE(pTHX_ SV *sv, MAGIC *mg)
929 SV *ssv = (SV *) mg->mg_ptr;
932 if (SvTYPE(ssv) == SVt_PVAV) {
933 val = av_len((AV*) ssv);
936 /* not actually defined by tie API but ... */
937 val = HvKEYS((HV*) ssv);
943 /* clear magic for PERL_MAGIC_tied(P) */
946 sharedsv_array_mg_CLEAR(pTHX_ SV *sv, MAGIC *mg)
949 SV *ssv = (SV *) mg->mg_ptr;
951 if (SvTYPE(ssv) == SVt_PVAV) {
961 /* free magic for PERL_MAGIC_tied(P) */
964 sharedsv_array_mg_free(pTHX_ SV *sv, MAGIC *mg)
966 S_sharedsv_dec(aTHX_ (SV*)mg->mg_ptr);
971 * copy magic for PERL_MAGIC_tied(P)
972 * This is called when perl is about to access an element of
976 sharedsv_array_mg_copy(pTHX_ SV *sv, MAGIC* mg,
977 SV *nsv, const char *name, int namlen)
979 MAGIC *nmg = sv_magicext(nsv,mg->mg_obj,
980 toLOWER(mg->mg_type),&sharedsv_elem_vtbl,
982 nmg->mg_flags |= MGf_DUP;
986 /* Called during cloning of PERL_MAGIC_tied(P) magic in new thread */
989 sharedsv_array_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS *param)
991 SvREFCNT_inc((SV*)mg->mg_ptr);
992 assert(mg->mg_flags & MGf_DUP);
996 MGVTBL sharedsv_array_vtbl = {
999 sharedsv_array_mg_FETCHSIZE, /* len */
1000 sharedsv_array_mg_CLEAR, /* clear */
1001 sharedsv_array_mg_free, /* free */
1002 sharedsv_array_mg_copy, /* copy */
1003 sharedsv_array_mg_dup, /* dup */
1007 =for apidoc sharedsv_unlock
1009 Recursively unlocks a shared sv.
1014 Perl_sharedsv_unlock(pTHX_ SV *ssv)
1016 user_lock *ul = S_get_userlock(aTHX_ ssv, 0);
1018 recursive_lock_release(aTHX_ &ul->lock);
1021 =for apidoc sharedsv_lock
1023 Recursive locks on a sharedsv.
1024 Locks are dynamically scoped at the level of the first lock.
1029 Perl_sharedsv_lock(pTHX_ SV *ssv)
1034 ul = S_get_userlock(aTHX_ ssv, 1);
1035 recursive_lock_acquire(aTHX_ &ul->lock, __FILE__, __LINE__);
1038 /* handles calls from lock() builtin via PL_lockhook */
1041 Perl_sharedsv_locksv(pTHX_ SV *sv)
1047 ssv = Perl_sharedsv_find(aTHX_ sv);
1049 croak("lock can only be used on shared values");
1050 Perl_sharedsv_lock(aTHX_ ssv);
1053 =head1 Shared SV Functions
1055 =for apidoc sharedsv_init
1057 Saves a space for keeping SVs wider than an interpreter,
1062 Perl_sharedsv_init(pTHX)
1065 /* This pair leaves us in shared context ... */
1066 PL_sharedsv_space = perl_alloc();
1067 perl_construct(PL_sharedsv_space);
1069 recursive_lock_init(aTHX_ &PL_sharedsv_lock);
1070 PL_lockhook = &Perl_sharedsv_locksv;
1071 PL_sharehook = &Perl_sharedsv_share;
1074 #endif /* USE_ITHREADS */
1076 MODULE = threads::shared PACKAGE = threads::shared::tie
1086 SV *sobj = S_sharedsv_from_obj(aTHX_ obj);
1088 for(i = 1; i < items; i++) {
1089 SV* tmp = newSVsv(ST(i));
1092 stmp = S_sharedsv_new_shared(aTHX_ tmp);
1093 sharedsv_scalar_store(aTHX_ tmp, stmp);
1095 av_push((AV*) sobj, stmp);
1102 UNSHIFT(SV *obj, ...)
1105 SV *sobj = S_sharedsv_from_obj(aTHX_ obj);
1109 av_unshift((AV*)sobj, items - 1);
1111 for(i = 1; i < items; i++) {
1112 SV *tmp = newSVsv(ST(i));
1113 SV *stmp = S_sharedsv_new_shared(aTHX_ tmp);
1114 sharedsv_scalar_store(aTHX_ tmp, stmp);
1116 av_store((AV*) sobj, i - 1, stmp);
1127 SV *sobj = S_sharedsv_from_obj(aTHX_ obj);
1131 ssv = av_pop((AV*)sobj);
1133 ST(0) = sv_newmortal();
1134 Perl_sharedsv_associate(aTHX_ ST(0), ssv);
1143 SV *sobj = S_sharedsv_from_obj(aTHX_ obj);
1147 ssv = av_shift((AV*)sobj);
1149 ST(0) = sv_newmortal();
1150 Perl_sharedsv_associate(aTHX_ ST(0), ssv);
1156 EXTEND(SV *obj, IV count)
1159 SV *sobj = S_sharedsv_from_obj(aTHX_ obj);
1161 av_extend((AV*)sobj, count);
1165 STORESIZE(SV *obj,IV count)
1168 SV *sobj = S_sharedsv_from_obj(aTHX_ obj);
1170 av_fill((AV*) sobj, count);
1177 EXISTS(SV *obj, SV *index)
1180 SV *sobj = S_sharedsv_from_obj(aTHX_ obj);
1182 if (SvTYPE(sobj) == SVt_PVAV) {
1184 exists = av_exists((AV*) sobj, SvIV(index));
1188 char *key = SvPV(index,len);
1190 exists = hv_exists((HV*) sobj, key, len);
1193 ST(0) = (exists) ? &PL_sv_yes : &PL_sv_no;
1201 SV *sobj = S_sharedsv_from_obj(aTHX_ obj);
1207 hv_iterinit((HV*) sobj);
1208 entry = hv_iternext((HV*) sobj);
1210 key = hv_iterkey(entry,&len);
1212 ST(0) = sv_2mortal(newSVpv(key, len));
1215 ST(0) = &PL_sv_undef;
1221 NEXTKEY(SV *obj, SV *oldkey)
1224 SV *sobj = S_sharedsv_from_obj(aTHX_ obj);
1230 entry = hv_iternext((HV*) sobj);
1232 key = hv_iterkey(entry,&len);
1234 ST(0) = sv_2mortal(newSVpv(key, len));
1237 ST(0) = &PL_sv_undef;
1242 MODULE = threads::shared PACKAGE = threads::shared
1254 if( (ssv = Perl_sharedsv_find(aTHX_ ref)) ){
1255 ST(0) = sv_2mortal(newSViv(PTR2IV(ssv)));
1269 if( (ssv = Perl_sharedsv_find(aTHX_ ref)) ) {
1270 ST(0) = sv_2mortal(newSViv(SvREFCNT(ssv)));
1274 Perl_warn(aTHX_ "%" SVf " is not shared",ST(0));
1283 Perl_croak(aTHX_ "Argument to share needs to be passed as ref");
1287 Perl_sharedsv_share(aTHX_ ref);
1288 RETVAL = newRV(ref);
1293 lock_enabled(SV *ref)
1298 Perl_croak(aTHX_ "Argument to lock needs to be passed as ref");
1302 ssv = Perl_sharedsv_find(aTHX_ ref);
1304 croak("lock can only be used on shared values");
1305 Perl_sharedsv_lock(aTHX_ ssv);
1308 cond_wait_enabled(SV *ref_cond, SV *ref_lock = 0)
1309 PROTOTYPE: \[$@%];\[$@%]
1312 perl_cond* user_condition;
1318 if (!ref_lock || ref_lock == ref_cond) same = 1;
1320 if(!SvROK(ref_cond))
1321 Perl_croak(aTHX_ "Argument to cond_wait needs to be passed as ref");
1322 ref_cond = SvRV(ref_cond);
1324 ref_cond = SvRV(ref_cond);
1325 ssv = Perl_sharedsv_find(aTHX_ ref_cond);
1327 croak("cond_wait can only be used on shared values");
1328 ul = S_get_userlock(aTHX_ ssv, 1);
1330 user_condition = &ul->user_cond;
1332 if (!SvROK(ref_lock))
1333 Perl_croak(aTHX_ "cond_wait lock needs to be passed as ref");
1334 ref_lock = SvRV(ref_lock);
1335 if (SvROK(ref_lock)) ref_lock = SvRV(ref_lock);
1336 ssv = Perl_sharedsv_find(aTHX_ ref_lock);
1338 croak("cond_wait lock must be a shared value");
1339 ul = S_get_userlock(aTHX_ ssv, 1);
1341 if(ul->lock.owner != aTHX)
1342 croak("You need a lock before you can cond_wait");
1343 /* Stealing the members of the lock object worries me - NI-S */
1344 MUTEX_LOCK(&ul->lock.mutex);
1345 ul->lock.owner = NULL;
1346 locks = ul->lock.locks;
1349 /* since we are releasing the lock here we need to tell other
1350 people that is ok to go ahead and use it */
1351 COND_SIGNAL(&ul->lock.cond);
1352 COND_WAIT(user_condition, &ul->lock.mutex);
1353 while(ul->lock.owner != NULL) {
1354 /* OK -- must reacquire the lock */
1355 COND_WAIT(&ul->lock.cond, &ul->lock.mutex);
1357 ul->lock.owner = aTHX;
1358 ul->lock.locks = locks;
1359 MUTEX_UNLOCK(&ul->lock.mutex);
1362 cond_timedwait_enabled(SV *ref_cond, double abs, SV *ref_lock = 0)
1363 PROTOTYPE: \[$@%]$;\[$@%]
1366 perl_cond* user_condition;
1372 if (!ref_lock || ref_cond == ref_lock) same = 1;
1374 if(!SvROK(ref_cond))
1375 Perl_croak(aTHX_ "Argument to cond_timedwait needs to be passed as ref");
1376 ref_cond = SvRV(ref_cond);
1378 ref_cond = SvRV(ref_cond);
1379 ssv = Perl_sharedsv_find(aTHX_ ref_cond);
1381 croak("cond_timedwait can only be used on shared values");
1382 ul = S_get_userlock(aTHX_ ssv, 1);
1384 user_condition = &ul->user_cond;
1386 if (!SvROK(ref_lock))
1387 Perl_croak(aTHX_ "cond_timedwait lock needs to be passed as ref");
1388 ref_lock = SvRV(ref_lock);
1389 if (SvROK(ref_lock)) ref_lock = SvRV(ref_lock);
1390 ssv = Perl_sharedsv_find(aTHX_ ref_lock);
1392 croak("cond_timedwait lock must be a shared value");
1393 ul = S_get_userlock(aTHX_ ssv, 1);
1395 if(ul->lock.owner != aTHX)
1396 croak("You need a lock before you can cond_wait");
1398 MUTEX_LOCK(&ul->lock.mutex);
1399 ul->lock.owner = NULL;
1400 locks = ul->lock.locks;
1402 /* since we are releasing the lock here we need to tell other
1403 people that is ok to go ahead and use it */
1404 COND_SIGNAL(&ul->lock.cond);
1405 RETVAL = Perl_sharedsv_cond_timedwait(user_condition, &ul->lock.mutex, abs);
1406 while (ul->lock.owner != NULL) {
1407 /* OK -- must reacquire the lock... */
1408 COND_WAIT(&ul->lock.cond, &ul->lock.mutex);
1410 ul->lock.owner = aTHX;
1411 ul->lock.locks = locks;
1412 MUTEX_UNLOCK(&ul->lock.mutex);
1420 cond_signal_enabled(SV *ref)
1427 Perl_croak(aTHX_ "Argument to cond_signal needs to be passed as ref");
1431 ssv = Perl_sharedsv_find(aTHX_ ref);
1433 croak("cond_signal can only be used on shared values");
1434 ul = S_get_userlock(aTHX_ ssv, 1);
1435 if (ckWARN(WARN_THREADS) && ul->lock.owner != aTHX)
1436 Perl_warner(aTHX_ packWARN(WARN_THREADS),
1437 "cond_signal() called on unlocked variable");
1438 COND_SIGNAL(&ul->user_cond);
1441 cond_broadcast_enabled(SV *ref)
1448 Perl_croak(aTHX_ "Argument to cond_broadcast needs to be passed as ref");
1452 ssv = Perl_sharedsv_find(aTHX_ ref);
1454 croak("cond_broadcast can only be used on shared values");
1455 ul = S_get_userlock(aTHX_ ssv, 1);
1456 if (ckWARN(WARN_THREADS) && ul->lock.owner != aTHX)
1457 Perl_warner(aTHX_ packWARN(WARN_THREADS),
1458 "cond_broadcast() called on unlocked variable");
1459 COND_BROADCAST(&ul->user_cond);
1463 bless(SV* ref, ...);
1470 stash = CopSTASH(PL_curcop);
1472 SV* classname = ST(1);
1476 if (classname && !SvGMAGICAL(classname) &&
1477 !SvAMAGIC(classname) && SvROK(classname))
1478 Perl_croak(aTHX_ "Attempt to bless into a reference");
1479 ptr = SvPV(classname,len);
1480 if (ckWARN(WARN_MISC) && len == 0)
1481 Perl_warner(aTHX_ packWARN(WARN_MISC),
1482 "Explicit blessing to '' (assuming package main)");
1483 stash = gv_stashpvn(ptr, len, TRUE);
1486 (void)sv_bless(ref, stash);
1488 ssv = Perl_sharedsv_find(aTHX_ ref);
1494 SV* fake_stash = newSVpv(HvNAME_get(stash),0);
1495 (void)sv_bless(ssv,(HV*)fake_stash);
1504 #endif /* USE_ITHREADS */
1509 Perl_sharedsv_init(aTHX);
1510 #endif /* USE_ITHREADS */