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 Artur Bergman <sky AT crucially DOT net>
13 * Pulled in the (an)other direction by Nick Ing-Simmons
14 * <nick AT ing-simmons DOT net>
15 * CPAN version produced by Jerry D. Hedden <jdhedden AT cpan DOT org>
19 * Shared variables are implemented by a scheme similar to tieing.
20 * Each thread has a proxy SV with attached magic -- "private SVs" --
21 * which all point to a single SV in a separate shared interpreter
22 * (PL_sharedsv_space) -- "shared SVs".
24 * The shared SV holds the variable's true values, and its state is
25 * copied between the shared and private SVs with the usual
26 * mg_get()/mg_set() arrangement.
28 * Aggregates (AVs and HVs) are implemented using tie magic, except that
29 * the vtable used is one defined in this file rather than the standard one.
30 * This means that where a tie function like FETCH is normally invoked by
31 * the tie magic's mg_get() function, we completely bypass the calling of a
32 * perl-level function, and directly call C-level code to handle it. On
33 * the other hand, calls to functions like PUSH are done directly by code
34 * in av.c, etc., which we can't bypass. So the best we can do is to provide
35 * XS versions of these functions. We also have to attach a tie object,
36 * blessed into the class threads::shared::tie, to keep the method-calling
39 * Access to aggregate elements is done the usual tied way by returning a
40 * proxy PVLV element with attached element magic.
42 * Pointers to the shared SV are squirrelled away in the mg->mg_ptr field
43 * of magic (with mg_len == 0), and in the IV2PTR(SvIV(sv)) field of tied
44 * object SVs. These pointers have to be hidden like this because they
45 * cross interpreter boundaries, and we don't want sv_clear() and friends
48 * The three basic shared types look like the following:
52 * Shared scalar (my $s : shared):
54 * SV = PVMG(0x7ba238) at 0x7387a8
55 * FLAGS = (PADMY,GMG,SMG)
57 * MG_TYPE = PERL_MAGIC_shared_scalar(n)
58 * MG_PTR = 0x810358 <<<< pointer to the shared SV
62 * Shared aggregate (my @a : shared; my %h : shared):
64 * SV = PVAV(0x7175d0) at 0x738708
67 * MG_TYPE = PERL_MAGIC_tied(P)
68 * MG_OBJ = 0x7136e0 <<<< ref to the tied object
69 * SV = RV(0x7136f0) at 0x7136e0
71 * SV = PVMG(0x7ba238) at 0x738640 <<<< the tied object
72 * FLAGS = (OBJECT,IOK,pIOK)
73 * IV = 8455000 <<<< pointer to the shared AV
74 * STASH = 0x80abf0 "threads::shared::tie"
75 * MG_PTR = 0x810358 "" <<<< another pointer to the shared AV
80 * Aggregate element (my @a : shared; $a[0])
82 * SV = PVLV(0x77f628) at 0x713550
83 * FLAGS = (GMG,SMG,RMG,pIOK)
85 * MG_TYPE = PERL_MAGIC_shared_scalar(n)
86 * MG_PTR = 0x8103c0 "" <<<< pointer to the shared element
88 * MG_TYPE = PERL_MAGIC_tiedelem(p)
89 * MG_OBJ = 0x7136e0 <<<< ref to the tied object
90 * SV = RV(0x7136f0) at 0x7136e0
92 * SV = PVMG(0x7ba278) at 0x738660 <<<< the tied object
93 * FLAGS = (OBJECT,IOK,pIOK)
94 * IV = 8455064 <<<< pointer to the shared AV
95 * STASH = 0x80ac30 "threads::shared::tie"
98 * Note that PERL_MAGIC_tiedelem(p) magic doesn't have a pointer to a
99 * shared SV in mg_ptr; instead this is used to store the hash key,
100 * if any, like normal tied elements. Note also that element SVs may have
101 * pointers to both the shared aggregate and the shared element.
106 * If a shared variable is used as a perl-level lock or condition
107 * variable, then PERL_MAGIC_ext magic is attached to the associated
108 * *shared* SV, whose mg_ptr field points to a malloc'ed structure
109 * containing the necessary mutexes and condition variables.
113 * In this file, any variable name prefixed with 's' (e.g., ssv, stmp or sobj)
114 * usually represents a shared SV which corresponds to a private SV named
115 * without the prefix (e.g., sv, tmp or obj).
118 #define PERL_NO_GET_CONTEXT
123 # define NEED_vnewSVpvf
132 * The shared things need an intepreter to live in ...
134 PerlInterpreter *PL_sharedsv_space; /* The shared sv space */
135 /* To access shared space we fake aTHX in this scope and thread's context */
137 /* Bug #24255: We include ENTER+SAVETMPS/FREETMPS+LEAVE with
138 * SHARED_CONTEXT/CALLER_CONTEXT macros, so that any mortals, etc. created
139 * while in the shared interpreter context don't languish */
141 #define SHARED_CONTEXT \
143 PERL_SET_CONTEXT((aTHX = PL_sharedsv_space)); \
148 /* So we need a way to switch back to the caller's context... */
149 /* So we declare _another_ copy of the aTHX variable ... */
150 #define dTHXc PerlInterpreter *caller_perl = aTHX
152 /* ... and use it to switch back */
153 #define CALLER_CONTEXT \
157 PERL_SET_CONTEXT((aTHX = caller_perl)); \
161 * Only one thread at a time is allowed to mess with shared space.
166 PerlInterpreter *owner;
175 recursive_lock_t PL_sharedsv_lock; /* Mutex protecting the shared sv space */
178 recursive_lock_init(pTHX_ recursive_lock_t *lock)
180 Zero(lock,1,recursive_lock_t);
181 MUTEX_INIT(&lock->mutex);
182 COND_INIT(&lock->cond);
186 recursive_lock_destroy(pTHX_ recursive_lock_t *lock)
188 MUTEX_DESTROY(&lock->mutex);
189 COND_DESTROY(&lock->cond);
193 recursive_lock_release(pTHX_ recursive_lock_t *lock)
195 MUTEX_LOCK(&lock->mutex);
196 if (lock->owner == aTHX) {
197 if (--lock->locks == 0) {
199 COND_SIGNAL(&lock->cond);
202 MUTEX_UNLOCK(&lock->mutex);
206 recursive_lock_acquire(pTHX_ recursive_lock_t *lock, char *file, int line)
209 MUTEX_LOCK(&lock->mutex);
210 if (lock->owner == aTHX) {
213 while (lock->owner) {
215 Perl_warn(aTHX_ " %p waiting - owned by %p %s:%d\n",
216 aTHX, lock->owner, lock->file, lock->line);
218 COND_WAIT(&lock->cond,&lock->mutex);
227 MUTEX_UNLOCK(&lock->mutex);
228 SAVEDESTRUCTOR_X(recursive_lock_release,lock);
234 recursive_lock_acquire(aTHX_ &PL_sharedsv_lock, __FILE__, __LINE__);\
237 /* The unlocking is done automatically at scope exit */
238 #define LEAVE_LOCK LEAVE
241 /* A common idiom is to acquire access and switch in ... */
242 #define SHARED_EDIT \
248 /* ... then switch out and release access. */
249 #define SHARED_RELEASE \
257 This structure is attached (using ext magic) to any shared SV that
258 is used by user-level locking or condition code
262 recursive_lock_t lock; /* For user-levl locks */
263 perl_cond user_cond; /* For user-level conditions */
266 /* Magic used for attaching user_lock structs to shared SVs
268 The vtable used has just one entry - when the SV goes away
269 we free the memory for the above.
273 sharedsv_userlock_free(pTHX_ SV *sv, MAGIC *mg)
275 user_lock *ul = (user_lock *) mg->mg_ptr;
276 assert(aTHX == PL_sharedsv_space);
278 recursive_lock_destroy(aTHX_ &ul->lock);
279 COND_DESTROY(&ul->user_cond);
280 PerlMemShared_free(ul);
286 MGVTBL sharedsv_userlock_vtbl = {
291 sharedsv_userlock_free, /* free */
300 * Access to shared things is heavily based on MAGIC
301 * - in mg.h/mg.c/sv.c sense
304 /* In any thread that has access to a shared thing there is a "proxy"
305 for it in its own space which has 'MAGIC' associated which accesses
309 extern MGVTBL sharedsv_scalar_vtbl; /* Scalars have this vtable */
310 extern MGVTBL sharedsv_array_vtbl; /* Hashes and arrays have this
312 extern MGVTBL sharedsv_elem_vtbl; /* Elements of hashes and arrays have
313 this _AS WELL AS_ the scalar magic:
314 The sharedsv_elem_vtbl associates the element with the array/hash and
315 the sharedsv_scalar_vtbl associates it with the value
319 /* Get shared aggregate SV pointed to by threads::shared::tie magic object */
322 S_sharedsv_from_obj(pTHX_ SV *sv)
324 return ((SvROK(sv)) ? INT2PTR(SV *, SvIV(SvRV(sv))) : NULL);
328 /* Return the user_lock structure (if any) associated with a shared SV.
329 * If create is true, create one if it doesn't exist
332 S_get_userlock(pTHX_ SV* ssv, bool create)
335 user_lock *ul = NULL;
338 /* XXX Redesign the storage of user locks so we don't need a global
339 * lock to access them ???? DAPM */
341 mg = mg_find(ssv, PERL_MAGIC_ext);
343 ul = (user_lock*)(mg->mg_ptr);
347 ul = (user_lock *) PerlMemShared_malloc(sizeof(user_lock));
348 Zero(ul, 1, user_lock);
349 /* Attach to shared SV using ext magic */
350 sv_magicext(ssv, NULL, PERL_MAGIC_ext, &sharedsv_userlock_vtbl,
352 recursive_lock_init(aTHX_ &ul->lock);
353 COND_INIT(&ul->user_cond);
361 /* Given a private side SV tries to find if the SV has a shared backend,
362 * by looking for the magic.
365 Perl_sharedsv_find(pTHX_ SV *sv)
368 if (SvTYPE(sv) >= SVt_PVMG) {
372 if ((mg = mg_find(sv, PERL_MAGIC_tied))
373 && mg->mg_virtual == &sharedsv_array_vtbl) {
374 return ((SV *)mg->mg_ptr);
378 /* This should work for elements as well as they
379 * have scalar magic as well as their element magic
381 if ((mg = mg_find(sv, PERL_MAGIC_shared_scalar))
382 && mg->mg_virtual == &sharedsv_scalar_vtbl) {
383 return ((SV *)mg->mg_ptr);
388 /* Just for tidyness of API also handle tie objects */
389 if (SvROK(sv) && sv_derived_from(sv, "threads::shared::tie")) {
390 return (S_sharedsv_from_obj(aTHX_ sv));
396 /* Associate a private SV with a shared SV by pointing the appropriate
398 * Assumes lock is held.
401 Perl_sharedsv_associate(pTHX_ SV *sv, SV *ssv)
405 /* If we are asked for any private ops we need a thread */
406 assert ( aTHX != PL_sharedsv_space );
408 /* To avoid need for recursive locks require caller to hold lock */
409 assert ( PL_sharedsv_lock.owner == aTHX );
414 if (!(mg = mg_find(sv, PERL_MAGIC_tied))
415 || mg->mg_virtual != &sharedsv_array_vtbl
416 || (SV*) mg->mg_ptr != ssv)
419 sv_setref_iv(obj, "threads::shared::tie", PTR2IV(ssv));
421 sv_unmagic(sv, PERL_MAGIC_tied);
423 mg = sv_magicext(sv, obj, PERL_MAGIC_tied, &sharedsv_array_vtbl,
425 mg->mg_flags |= (MGf_COPY|MGf_DUP);
426 SvREFCNT_inc_void(ssv);
432 if ((SvTYPE(sv) < SVt_PVMG)
433 || !(mg = mg_find(sv, PERL_MAGIC_shared_scalar))
434 || mg->mg_virtual != &sharedsv_scalar_vtbl
435 || (SV*) mg->mg_ptr != ssv)
438 sv_unmagic(sv, PERL_MAGIC_shared_scalar);
440 mg = sv_magicext(sv, Nullsv, PERL_MAGIC_shared_scalar,
441 &sharedsv_scalar_vtbl, (char *)ssv, 0);
442 mg->mg_flags |= (MGf_DUP
447 SvREFCNT_inc_void(ssv);
452 assert ( Perl_sharedsv_find(aTHX_ sv) == ssv );
456 /* Given a private SV, create and return an associated shared SV.
457 * Assumes lock is held.
460 S_sharedsv_new_shared(pTHX_ SV *sv)
465 assert(PL_sharedsv_lock.owner == aTHX);
466 assert(aTHX != PL_sharedsv_space);
470 SvREFCNT(ssv) = 0; /* Will be upped to 1 by Perl_sharedsv_associate */
471 sv_upgrade(ssv, SvTYPE(sv));
473 Perl_sharedsv_associate(aTHX_ sv, ssv);
478 /* Given a shared SV, create and return an associated private SV.
479 * Assumes lock is held.
482 S_sharedsv_new_private(pTHX_ SV *ssv)
486 assert(PL_sharedsv_lock.owner == aTHX);
487 assert(aTHX != PL_sharedsv_space);
490 sv_upgrade(sv, SvTYPE(ssv));
491 Perl_sharedsv_associate(aTHX_ sv, ssv);
496 /* A threadsafe version of SvREFCNT_dec(ssv) */
499 S_sharedsv_dec(pTHX_ SV* ssv)
504 if (SvREFCNT(ssv) > 1) {
505 /* No side effects, so can do it lightweight */
517 /* Implements Perl-level share() and :shared */
520 Perl_sharedsv_share(pTHX_ SV *sv)
524 Perl_croak(aTHX_ "Cannot share globs yet");
528 Perl_croak(aTHX_ "Cannot share subs yet");
533 (void) S_sharedsv_new_shared(aTHX_ sv);
542 /* Number of milliseconds from 1/1/1601 to 1/1/1970 */
543 #define EPOCH_BIAS 11644473600000.
545 /* Returns relative time in milliseconds. (Adapted from Time::HiRes.) */
547 S_abs_2_rel_milli(double abs)
551 /* Get current time (in units of 100 nanoseconds since 1/1/1601) */
554 __int64 i64; /* 'signed' to keep compilers happy */
557 GetSystemTimeAsFileTime(&now.ft);
559 /* Relative time in milliseconds */
560 rel = (abs * 1000.) - (((double)now.i64 / 10000.) - EPOCH_BIAS);
569 # define ABS2RELMILLI(abs) \
571 abs -= (double)time(NULL); \
572 if (abs > 0) { abs *= 1000; } \
578 /* Do OS-specific condition timed wait */
581 Perl_sharedsv_cond_timedwait(perl_cond *cond, perl_mutex *mut, double abs)
583 #if defined(NETWARE) || defined(FAKE_THREADS) || defined(I_MACH_CTHREADS)
584 Perl_croak_nocontext("cond_timedwait not supported on this platform");
591 /* See comments in win32/win32thread.h COND_WAIT vis-a-vis race */
592 switch (WaitForSingleObject(cond->sem, S_abs_2_rel_milli(abs))) {
593 case WAIT_OBJECT_0: got_it = 1; break;
594 case WAIT_TIMEOUT: break;
596 /* WAIT_FAILED? WAIT_ABANDONED? others? */
597 Perl_croak_nocontext("panic: cond_timedwait (%ld)",GetLastError());
610 if ((rc = DosResetEventSem(*cond,&n_a)) && (rc != ERROR_ALREADY_RESET))
611 Perl_rc = rc, croak_with_os2error("panic: cond_timedwait-reset");
613 if (CheckOSError(DosWaitEventSem(*cond,abs))
614 && (rc != ERROR_INTERRUPT))
615 croak_with_os2error("panic: cond_timedwait");
616 if (rc == ERROR_INTERRUPT) errno = EINTR;
619 # else /* Hope you're I_PTHREAD! */
623 ts.tv_sec = (long)abs;
624 abs -= (NV)ts.tv_sec;
625 ts.tv_nsec = (long)(abs * 1000000000.0);
627 switch (pthread_cond_timedwait(cond, mut, &ts)) {
628 case 0: got_it = 1; break;
629 case ETIMEDOUT: break;
632 if (errno == ETIMEDOUT || errno == EAGAIN)
636 Perl_croak_nocontext("panic: cond_timedwait");
642 #endif /* NETWARE || FAKE_THREADS || I_MACH_CTHREADS */
646 /* Given a shared RV, copy it's value to a private RV, also copying the
647 * object status of the referent.
648 * If the private side is already an appropriate RV->SV combination, keep
652 S_get_RV(pTHX_ SV *sv, SV *ssv) {
653 SV *sobj = SvRV(ssv);
656 ((obj = SvRV(sv))) &&
657 (Perl_sharedsv_find(aTHX_ obj) == sobj) &&
658 (SvTYPE(obj) == SvTYPE(sobj))))
660 /* Can't reuse obj */
662 SvREFCNT_dec(SvRV(sv));
664 assert(SvTYPE(sv) >= SVt_RV);
665 sv_setsv_nomg(sv, &PL_sv_undef);
668 obj = S_sharedsv_new_private(aTHX_ SvRV(ssv));
673 /* Remove any old blessing */
674 SvREFCNT_dec(SvSTASH(obj));
677 if (SvOBJECT(sobj)) {
678 /* Add any new old blessing */
680 char* stash_ptr = SvPV((SV*) SvSTASH(sobj), len);
681 HV* stash = gv_stashpvn(stash_ptr, len, TRUE);
683 SvSTASH_set(obj, (HV*)SvREFCNT_inc(stash));
688 /* ------------ PERL_MAGIC_shared_scalar(n) functions -------------- */
690 /* Get magic for PERL_MAGIC_shared_scalar(n) */
693 sharedsv_scalar_mg_get(pTHX_ SV *sv, MAGIC *mg)
695 SV *ssv = (SV *) mg->mg_ptr;
700 S_get_RV(aTHX_ sv, ssv);
702 sv_setsv_nomg(sv, ssv);
708 /* Copy the contents of a private SV to a shared SV.
709 * Used by various mg_set()-type functions.
710 * Assumes lock is held.
713 sharedsv_scalar_store(pTHX_ SV *sv, SV *ssv)
718 assert(PL_sharedsv_lock.owner == aTHX);
721 SV *sobj = Perl_sharedsv_find(aTHX_ obj);
724 (void)SvUPGRADE(ssv, SVt_RV);
725 sv_setsv_nomg(ssv, &PL_sv_undef);
727 SvRV_set(ssv, SvREFCNT_inc(sobj));
729 if (SvOBJECT(sobj)) {
730 /* Remove any old blessing */
731 SvREFCNT_dec(SvSTASH(sobj));
735 SV* fake_stash = newSVpv(HvNAME_get(SvSTASH(obj)),0);
737 SvSTASH_set(sobj, (HV*)fake_stash);
746 sv_setsv_nomg(ssv, sv);
748 /* Remove any old blessing */
749 SvREFCNT_dec(SvSTASH(ssv));
753 SV* fake_stash = newSVpv(HvNAME_get(SvSTASH(sv)),0);
755 SvSTASH_set(ssv, (HV*)fake_stash);
760 Perl_croak(aTHX_ "Invalid value for shared scalar");
764 /* Set magic for PERL_MAGIC_shared_scalar(n) */
767 sharedsv_scalar_mg_set(pTHX_ SV *sv, MAGIC *mg)
769 SV *ssv = (SV*)(mg->mg_ptr);
772 if (SvTYPE(ssv) < SvTYPE(sv)) {
775 sv_upgrade(ssv, SvTYPE(sv));
778 sharedsv_scalar_store(aTHX_ sv, ssv);
783 /* Free magic for PERL_MAGIC_shared_scalar(n) */
786 sharedsv_scalar_mg_free(pTHX_ SV *sv, MAGIC *mg)
788 S_sharedsv_dec(aTHX_ (SV*)mg->mg_ptr);
793 * Called during cloning of PERL_MAGIC_shared_scalar(n) magic in new thread
796 sharedsv_scalar_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS *param)
798 SvREFCNT_inc_void(mg->mg_ptr);
804 * Called during local $shared
807 sharedsv_scalar_mg_local(pTHX_ SV* nsv, MAGIC *mg)
810 SV *ssv = (SV *) mg->mg_ptr;
813 SvREFCNT_inc_void(ssv);
816 nmg = sv_magicext(nsv, mg->mg_obj, mg->mg_type, mg->mg_virtual,
817 mg->mg_ptr, mg->mg_len);
818 nmg->mg_flags = mg->mg_flags;
819 nmg->mg_private = mg->mg_private;
825 MGVTBL sharedsv_scalar_vtbl = {
826 sharedsv_scalar_mg_get, /* get */
827 sharedsv_scalar_mg_set, /* set */
830 sharedsv_scalar_mg_free, /* free */
832 sharedsv_scalar_mg_dup, /* dup */
834 sharedsv_scalar_mg_local, /* local */
838 /* ------------ PERL_MAGIC_tiedelem(p) functions -------------- */
840 /* Get magic for PERL_MAGIC_tiedelem(p) */
843 sharedsv_elem_mg_FETCH(pTHX_ SV *sv, MAGIC *mg)
846 SV *saggregate = S_sharedsv_from_obj(aTHX_ mg->mg_obj);
850 if (SvTYPE(saggregate) == SVt_PVAV) {
851 assert ( mg->mg_ptr == 0 );
853 svp = av_fetch((AV*) saggregate, mg->mg_len, 0);
855 char *key = mg->mg_ptr;
856 STRLEN len = mg->mg_len;
857 assert ( mg->mg_ptr != 0 );
858 if (mg->mg_len == HEf_SVKEY) {
859 key = SvPV((SV *) mg->mg_ptr, len);
862 svp = hv_fetch((HV*) saggregate, key, len, 0);
866 /* Exists in the array */
868 S_get_RV(aTHX_ sv, *svp);
870 /* XXX Can this branch ever happen? DAPM */
871 /* XXX assert("no such branch"); */
872 Perl_sharedsv_associate(aTHX_ sv, *svp);
876 /* Not in the array */
877 sv_setsv(sv, &PL_sv_undef);
883 /* Set magic for PERL_MAGIC_tiedelem(p) */
886 sharedsv_elem_mg_STORE(pTHX_ SV *sv, MAGIC *mg)
889 SV *saggregate = S_sharedsv_from_obj(aTHX_ mg->mg_obj);
891 /* Theory - SV itself is magically shared - and we have ordered the
892 magic such that by the time we get here it has been stored
893 to its shared counterpart
897 if (SvTYPE(saggregate) == SVt_PVAV) {
898 assert ( mg->mg_ptr == 0 );
900 svp = av_fetch((AV*) saggregate, mg->mg_len, 1);
902 char *key = mg->mg_ptr;
903 STRLEN len = mg->mg_len;
904 assert ( mg->mg_ptr != 0 );
905 if (mg->mg_len == HEf_SVKEY)
906 key = SvPV((SV *) mg->mg_ptr, len);
908 svp = hv_fetch((HV*) saggregate, key, len, 1);
911 Perl_sharedsv_associate(aTHX_ sv, *svp);
912 sharedsv_scalar_store(aTHX_ sv, *svp);
917 /* Clear magic for PERL_MAGIC_tiedelem(p) */
920 sharedsv_elem_mg_DELETE(pTHX_ SV *sv, MAGIC *mg)
924 SV *saggregate = S_sharedsv_from_obj(aTHX_ mg->mg_obj);
926 sharedsv_elem_mg_FETCH(aTHX_ sv, mg);
927 if ((shmg = mg_find(sv, PERL_MAGIC_shared_scalar)))
928 sharedsv_scalar_mg_get(aTHX_ sv, shmg);
929 if (SvTYPE(saggregate) == SVt_PVAV) {
931 av_delete((AV*) saggregate, mg->mg_len, G_DISCARD);
933 char *key = mg->mg_ptr;
934 STRLEN len = mg->mg_len;
935 assert ( mg->mg_ptr != 0 );
936 if (mg->mg_len == HEf_SVKEY)
937 key = SvPV((SV *) mg->mg_ptr, len);
939 hv_delete((HV*) saggregate, key, len, G_DISCARD);
946 /* Called during cloning of PERL_MAGIC_tiedelem(p) magic in new
950 sharedsv_elem_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS *param)
952 SvREFCNT_inc_void(S_sharedsv_from_obj(aTHX_ mg->mg_obj));
953 assert(mg->mg_flags & MGf_DUP);
957 MGVTBL sharedsv_elem_vtbl = {
958 sharedsv_elem_mg_FETCH, /* get */
959 sharedsv_elem_mg_STORE, /* set */
961 sharedsv_elem_mg_DELETE, /* clear */
964 sharedsv_elem_mg_dup, /* dup */
970 /* ------------ PERL_MAGIC_tied(P) functions -------------- */
972 /* Len magic for PERL_MAGIC_tied(P) */
975 sharedsv_array_mg_FETCHSIZE(pTHX_ SV *sv, MAGIC *mg)
978 SV *ssv = (SV *) mg->mg_ptr;
981 if (SvTYPE(ssv) == SVt_PVAV) {
982 val = av_len((AV*) ssv);
984 /* Not actually defined by tie API but ... */
985 val = HvKEYS((HV*) ssv);
991 /* Clear magic for PERL_MAGIC_tied(P) */
994 sharedsv_array_mg_CLEAR(pTHX_ SV *sv, MAGIC *mg)
997 SV *ssv = (SV *) mg->mg_ptr;
999 if (SvTYPE(ssv) == SVt_PVAV) {
1000 av_clear((AV*) ssv);
1002 hv_clear((HV*) ssv);
1008 /* Free magic for PERL_MAGIC_tied(P) */
1011 sharedsv_array_mg_free(pTHX_ SV *sv, MAGIC *mg)
1013 S_sharedsv_dec(aTHX_ (SV*)mg->mg_ptr);
1018 * Copy magic for PERL_MAGIC_tied(P)
1019 * This is called when perl is about to access an element of
1023 sharedsv_array_mg_copy(pTHX_ SV *sv, MAGIC* mg,
1024 SV *nsv, const char *name, int namlen)
1026 MAGIC *nmg = sv_magicext(nsv,mg->mg_obj,
1027 toLOWER(mg->mg_type),&sharedsv_elem_vtbl,
1029 nmg->mg_flags |= MGf_DUP;
1033 /* Called during cloning of PERL_MAGIC_tied(P) magic in new thread */
1036 sharedsv_array_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS *param)
1038 SvREFCNT_inc_void((SV*)mg->mg_ptr);
1039 assert(mg->mg_flags & MGf_DUP);
1043 MGVTBL sharedsv_array_vtbl = {
1046 sharedsv_array_mg_FETCHSIZE,/* len */
1047 sharedsv_array_mg_CLEAR, /* clear */
1048 sharedsv_array_mg_free, /* free */
1049 sharedsv_array_mg_copy, /* copy */
1050 sharedsv_array_mg_dup, /* dup */
1057 /* Recursively unlocks a shared sv. */
1060 Perl_sharedsv_unlock(pTHX_ SV *ssv)
1062 user_lock *ul = S_get_userlock(aTHX_ ssv, 0);
1064 recursive_lock_release(aTHX_ &ul->lock);
1068 /* Recursive locks on a sharedsv.
1069 * Locks are dynamically scoped at the level of the first lock.
1072 Perl_sharedsv_lock(pTHX_ SV *ssv)
1077 ul = S_get_userlock(aTHX_ ssv, 1);
1078 recursive_lock_acquire(aTHX_ &ul->lock, __FILE__, __LINE__);
1081 /* Handles calls from lock() builtin via PL_lockhook */
1084 Perl_sharedsv_locksv(pTHX_ SV *sv)
1090 ssv = Perl_sharedsv_find(aTHX_ sv);
1092 croak("lock can only be used on shared values");
1093 Perl_sharedsv_lock(aTHX_ ssv);
1097 /* Saves a space for keeping SVs wider than an interpreter. */
1100 Perl_sharedsv_init(pTHX)
1103 /* This pair leaves us in shared context ... */
1104 PL_sharedsv_space = perl_alloc();
1105 perl_construct(PL_sharedsv_space);
1107 recursive_lock_init(aTHX_ &PL_sharedsv_lock);
1108 PL_lockhook = &Perl_sharedsv_locksv;
1109 PL_sharehook = &Perl_sharedsv_share;
1112 #endif /* USE_ITHREADS */
1114 MODULE = threads::shared PACKAGE = threads::shared::tie
1124 SV *sobj = S_sharedsv_from_obj(aTHX_ obj);
1126 for (i = 1; i < items; i++) {
1127 SV* tmp = newSVsv(ST(i));
1130 stmp = S_sharedsv_new_shared(aTHX_ tmp);
1131 sharedsv_scalar_store(aTHX_ tmp, stmp);
1133 av_push((AV*) sobj, stmp);
1134 SvREFCNT_inc_void(stmp);
1141 UNSHIFT(SV *obj, ...)
1144 SV *sobj = S_sharedsv_from_obj(aTHX_ obj);
1148 av_unshift((AV*)sobj, items - 1);
1150 for (i = 1; i < items; i++) {
1151 SV *tmp = newSVsv(ST(i));
1152 SV *stmp = S_sharedsv_new_shared(aTHX_ tmp);
1153 sharedsv_scalar_store(aTHX_ tmp, stmp);
1155 av_store((AV*) sobj, i - 1, stmp);
1156 SvREFCNT_inc_void(stmp);
1167 SV *sobj = S_sharedsv_from_obj(aTHX_ obj);
1171 ssv = av_pop((AV*)sobj);
1173 ST(0) = sv_newmortal();
1174 Perl_sharedsv_associate(aTHX_ ST(0), ssv);
1177 /* XSRETURN(1); - implied */
1184 SV *sobj = S_sharedsv_from_obj(aTHX_ obj);
1188 ssv = av_shift((AV*)sobj);
1190 ST(0) = sv_newmortal();
1191 Perl_sharedsv_associate(aTHX_ ST(0), ssv);
1194 /* XSRETURN(1); - implied */
1198 EXTEND(SV *obj, IV count)
1201 SV *sobj = S_sharedsv_from_obj(aTHX_ obj);
1203 av_extend((AV*)sobj, count);
1208 STORESIZE(SV *obj,IV count)
1211 SV *sobj = S_sharedsv_from_obj(aTHX_ obj);
1213 av_fill((AV*) sobj, count);
1218 EXISTS(SV *obj, SV *index)
1221 SV *sobj = S_sharedsv_from_obj(aTHX_ obj);
1223 if (SvTYPE(sobj) == SVt_PVAV) {
1225 exists = av_exists((AV*) sobj, SvIV(index));
1228 char *key = SvPV(index,len);
1230 exists = hv_exists((HV*) sobj, key, len);
1233 ST(0) = (exists) ? &PL_sv_yes : &PL_sv_no;
1234 /* XSRETURN(1); - implied */
1241 SV *sobj = S_sharedsv_from_obj(aTHX_ obj);
1247 hv_iterinit((HV*) sobj);
1248 entry = hv_iternext((HV*) sobj);
1250 key = hv_iterkey(entry,&len);
1252 ST(0) = sv_2mortal(newSVpv(key, len));
1255 ST(0) = &PL_sv_undef;
1258 /* XSRETURN(1); - implied */
1262 NEXTKEY(SV *obj, SV *oldkey)
1265 SV *sobj = S_sharedsv_from_obj(aTHX_ obj);
1270 PERL_UNUSED_VAR(oldkey);
1274 entry = hv_iternext((HV*) sobj);
1276 key = hv_iterkey(entry,&len);
1278 ST(0) = sv_2mortal(newSVpv(key, len));
1281 ST(0) = &PL_sv_undef;
1284 /* XSRETURN(1); - implied */
1287 MODULE = threads::shared PACKAGE = threads::shared
1300 ssv = Perl_sharedsv_find(aTHX_ ref);
1303 ST(0) = sv_2mortal(newSVuv(PTR2UV(ssv)));
1304 /* XSRETURN(1); - implied */
1316 ssv = Perl_sharedsv_find(aTHX_ ref);
1318 Perl_warn(aTHX_ "%" SVf " is not shared", ST(0));
1321 ST(0) = sv_2mortal(newSViv(SvREFCNT(ssv)));
1322 /* XSRETURN(1); - implied */
1330 Perl_croak(aTHX_ "Argument to share needs to be passed as ref");
1334 Perl_sharedsv_share(aTHX_ ref);
1335 ST(0) = sv_2mortal(newRV_inc(ref));
1336 /* XSRETURN(1); - implied */
1340 cond_wait(SV *ref_cond, SV *ref_lock = 0)
1341 PROTOTYPE: \[$@%];\[$@%]
1344 perl_cond* user_condition;
1348 if (!SvROK(ref_cond))
1349 Perl_croak(aTHX_ "Argument to cond_wait needs to be passed as ref");
1350 ref_cond = SvRV(ref_cond);
1351 if (SvROK(ref_cond))
1352 ref_cond = SvRV(ref_cond);
1353 ssv = Perl_sharedsv_find(aTHX_ ref_cond);
1355 Perl_croak(aTHX_ "cond_wait can only be used on shared values");
1356 ul = S_get_userlock(aTHX_ ssv, 1);
1358 user_condition = &ul->user_cond;
1359 if (ref_lock && (ref_cond != ref_lock)) {
1360 if (!SvROK(ref_lock))
1361 Perl_croak(aTHX_ "cond_wait lock needs to be passed as ref");
1362 ref_lock = SvRV(ref_lock);
1363 if (SvROK(ref_lock)) ref_lock = SvRV(ref_lock);
1364 ssv = Perl_sharedsv_find(aTHX_ ref_lock);
1366 Perl_croak(aTHX_ "cond_wait lock must be a shared value");
1367 ul = S_get_userlock(aTHX_ ssv, 1);
1369 if (ul->lock.owner != aTHX)
1370 croak("You need a lock before you can cond_wait");
1372 /* Stealing the members of the lock object worries me - NI-S */
1373 MUTEX_LOCK(&ul->lock.mutex);
1374 ul->lock.owner = NULL;
1375 locks = ul->lock.locks;
1378 /* Since we are releasing the lock here, we need to tell other
1379 * people that it is ok to go ahead and use it */
1380 COND_SIGNAL(&ul->lock.cond);
1381 COND_WAIT(user_condition, &ul->lock.mutex);
1382 while (ul->lock.owner != NULL) {
1383 /* OK -- must reacquire the lock */
1384 COND_WAIT(&ul->lock.cond, &ul->lock.mutex);
1386 ul->lock.owner = aTHX;
1387 ul->lock.locks = locks;
1388 MUTEX_UNLOCK(&ul->lock.mutex);
1392 cond_timedwait(SV *ref_cond, double abs, SV *ref_lock = 0)
1393 PROTOTYPE: \[$@%]$;\[$@%]
1396 perl_cond* user_condition;
1400 if (! SvROK(ref_cond))
1401 Perl_croak(aTHX_ "Argument to cond_timedwait needs to be passed as ref");
1402 ref_cond = SvRV(ref_cond);
1403 if (SvROK(ref_cond))
1404 ref_cond = SvRV(ref_cond);
1405 ssv = Perl_sharedsv_find(aTHX_ ref_cond);
1407 Perl_croak(aTHX_ "cond_timedwait can only be used on shared values");
1408 ul = S_get_userlock(aTHX_ ssv, 1);
1410 user_condition = &ul->user_cond;
1411 if (ref_lock && (ref_cond != ref_lock)) {
1412 if (! SvROK(ref_lock))
1413 Perl_croak(aTHX_ "cond_timedwait lock needs to be passed as ref");
1414 ref_lock = SvRV(ref_lock);
1415 if (SvROK(ref_lock)) ref_lock = SvRV(ref_lock);
1416 ssv = Perl_sharedsv_find(aTHX_ ref_lock);
1418 Perl_croak(aTHX_ "cond_timedwait lock must be a shared value");
1419 ul = S_get_userlock(aTHX_ ssv, 1);
1421 if (ul->lock.owner != aTHX)
1422 Perl_croak(aTHX_ "You need a lock before you can cond_wait");
1424 MUTEX_LOCK(&ul->lock.mutex);
1425 ul->lock.owner = NULL;
1426 locks = ul->lock.locks;
1428 /* Since we are releasing the lock here, we need to tell other
1429 * people that it is ok to go ahead and use it */
1430 COND_SIGNAL(&ul->lock.cond);
1431 RETVAL = Perl_sharedsv_cond_timedwait(user_condition, &ul->lock.mutex, abs);
1432 while (ul->lock.owner != NULL) {
1433 /* OK -- must reacquire the lock... */
1434 COND_WAIT(&ul->lock.cond, &ul->lock.mutex);
1436 ul->lock.owner = aTHX;
1437 ul->lock.locks = locks;
1438 MUTEX_UNLOCK(&ul->lock.mutex);
1447 cond_signal(SV *ref)
1454 Perl_croak(aTHX_ "Argument to cond_signal needs to be passed as ref");
1458 ssv = Perl_sharedsv_find(aTHX_ ref);
1460 Perl_croak(aTHX_ "cond_signal can only be used on shared values");
1461 ul = S_get_userlock(aTHX_ ssv, 1);
1462 if (ckWARN(WARN_THREADS) && ul->lock.owner != aTHX) {
1463 Perl_warner(aTHX_ packWARN(WARN_THREADS),
1464 "cond_signal() called on unlocked variable");
1466 COND_SIGNAL(&ul->user_cond);
1470 cond_broadcast(SV *ref)
1477 Perl_croak(aTHX_ "Argument to cond_broadcast needs to be passed as ref");
1481 ssv = Perl_sharedsv_find(aTHX_ ref);
1483 Perl_croak(aTHX_ "cond_broadcast can only be used on shared values");
1484 ul = S_get_userlock(aTHX_ ssv, 1);
1485 if (ckWARN(WARN_THREADS) && ul->lock.owner != aTHX) {
1486 Perl_warner(aTHX_ packWARN(WARN_THREADS),
1487 "cond_broadcast() called on unlocked variable");
1489 COND_BROADCAST(&ul->user_cond);
1493 bless(SV* ref, ...);
1500 stash = CopSTASH(PL_curcop);
1502 SV* classname = ST(1);
1507 ! SvGMAGICAL(classname) &&
1508 ! SvAMAGIC(classname) &&
1511 Perl_croak(aTHX_ "Attempt to bless into a reference");
1513 ptr = SvPV(classname, len);
1514 if (ckWARN(WARN_MISC) && len == 0) {
1515 Perl_warner(aTHX_ packWARN(WARN_MISC),
1516 "Explicit blessing to '' (assuming package main)");
1518 stash = gv_stashpvn(ptr, len, TRUE);
1520 SvREFCNT_inc_void(ref);
1521 (void)sv_bless(ref, stash);
1522 ST(0) = sv_2mortal(ref);
1523 ssv = Perl_sharedsv_find(aTHX_ ref);
1529 SV* fake_stash = newSVpv(HvNAME_get(stash), 0);
1530 (void)sv_bless(ssv, (HV*)fake_stash);
1535 /* XSRETURN(1); - implied */
1537 #endif /* USE_ITHREADS */
1542 Perl_sharedsv_init(aTHX);
1543 #endif /* USE_ITHREADS */