3 * Copyright (c) 2001-2002, 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
16 #define PERL_NO_GET_CONTEXT
23 #define SHAREDSvPTR(a) ((a)->sv)
26 * The shared things need an intepreter to live in ...
28 PerlInterpreter *PL_sharedsv_space; /* The shared sv space */
29 /* To access shared space we fake aTHX in this scope and thread's context */
30 #define SHARED_CONTEXT PERL_SET_CONTEXT((aTHX = PL_sharedsv_space))
32 /* So we need a way to switch back to the caller's context... */
33 /* So we declare _another_ copy of the aTHX variable ... */
34 #define dTHXc PerlInterpreter *caller_perl = aTHX
35 /* and use it to switch back */
36 #define CALLER_CONTEXT PERL_SET_CONTEXT((aTHX = caller_perl))
39 * Only one thread at a time is allowed to mess with shared space.
45 PerlInterpreter *owner;
54 recursive_lock_t PL_sharedsv_lock; /* Mutex protecting the shared sv space */
57 recursive_lock_init(pTHX_ recursive_lock_t *lock)
59 Zero(lock,1,recursive_lock_t);
60 MUTEX_INIT(&lock->mutex);
61 COND_INIT(&lock->cond);
64 recursive_lock_destroy(pTHX_ recursive_lock_t *lock)
66 MUTEX_DESTROY(&lock->mutex);
67 COND_DESTROY(&lock->cond);
71 recursive_lock_release(pTHX_ recursive_lock_t *lock)
73 MUTEX_LOCK(&lock->mutex);
74 if (lock->owner != aTHX) {
75 MUTEX_UNLOCK(&lock->mutex);
78 if (--lock->locks == 0) {
80 COND_SIGNAL(&lock->cond);
83 MUTEX_UNLOCK(&lock->mutex);
87 recursive_lock_acquire(pTHX_ recursive_lock_t *lock,char *file,int line)
90 MUTEX_LOCK(&lock->mutex);
91 if (lock->owner == aTHX) {
97 Perl_warn(aTHX_ " %p waiting - owned by %p %s:%d\n",
98 aTHX, lock->owner, lock->file, lock->line);
100 COND_WAIT(&lock->cond,&lock->mutex);
109 MUTEX_UNLOCK(&lock->mutex);
110 SAVEDESTRUCTOR_X(recursive_lock_release,lock);
113 #define ENTER_LOCK STMT_START { \
115 recursive_lock_acquire(aTHX_ &PL_sharedsv_lock, __FILE__, __LINE__); \
118 #define LEAVE_LOCK LEAVE
121 /* A common idiom is to acquire access and switch in ... */
122 #define SHARED_EDIT STMT_START { \
127 /* then switch out and release access. */
128 #define SHARED_RELEASE STMT_START { \
138 Shared SV is a structure for keeping the backend storage
141 Shared-ness really only needs the SV * - the rest is for locks.
142 (Which suggests further space optimization ... )
147 SV *sv; /* The actual SV - in shared space */
148 recursive_lock_t lock;
149 perl_cond user_cond; /* For user-level conditions */
152 /* The SV in shared-space has a back-pointer to the shared_sv
153 struct associated with it PERL_MAGIC_ext.
155 The vtable used has just one entry - when the SV goes away
156 we free the memory for the above.
161 sharedsv_shared_mg_free(pTHX_ SV *sv, MAGIC *mg)
163 shared_sv *shared = (shared_sv *) mg->mg_ptr;
164 assert( aTHX == PL_sharedsv_space );
166 recursive_lock_destroy(aTHX_ &shared->lock);
167 COND_DESTROY(&shared->user_cond);
168 PerlMemShared_free(shared);
174 MGVTBL sharedsv_shared_vtbl = {
179 sharedsv_shared_mg_free, /* free */
184 /* Access to shared things is heavily based on MAGIC - in mg.h/mg.c/sv.c sense */
186 /* In any thread that has access to a shared thing there is a "proxy"
187 for it in its own space which has 'MAGIC' associated which accesses
191 MGVTBL sharedsv_scalar_vtbl; /* scalars have this vtable */
192 MGVTBL sharedsv_array_vtbl; /* hashes and arrays have this - like 'tie' */
193 MGVTBL sharedsv_elem_vtbl; /* elements of hashes and arrays have this
194 _AS WELL AS_ the scalar magic */
196 /* The sharedsv_elem_vtbl associates the element with the array/hash and
197 the sharedsv_scalar_vtbl associates it with the value
201 /* Accessor to convert threads::shared::tie objects back shared_sv * */
203 SV_to_sharedsv(pTHX_ SV *sv)
205 shared_sv *shared = 0;
208 shared = INT2PTR(shared_sv *, SvIV(SvRV(sv)));
213 =for apidoc sharedsv_find
215 Given a private side SV tries to find if the SV has a shared backend,
216 by looking for the magic.
221 Perl_sharedsv_find(pTHX_ SV *sv)
224 if (SvTYPE(sv) >= SVt_PVMG) {
228 if ((mg = mg_find(sv, PERL_MAGIC_tied))
229 && mg->mg_virtual == &sharedsv_array_vtbl) {
230 return (shared_sv *) mg->mg_ptr;
234 /* This should work for elements as well as they
235 * have scalar magic as well as their element magic
237 if ((mg = mg_find(sv, PERL_MAGIC_shared_scalar))
238 && mg->mg_virtual == &sharedsv_scalar_vtbl) {
239 return (shared_sv *) mg->mg_ptr;
244 /* Just for tidyness of API also handle tie objects */
245 if (SvROK(sv) && sv_derived_from(sv, "threads::shared::tie")) {
246 return SV_to_sharedsv(aTHX_ sv);
252 * Almost all the pain is in this routine.
257 Perl_sharedsv_associate(pTHX_ SV **psv, SV *ssv, shared_sv *data)
261 SV *sv = (psv) ? *psv : Nullsv;
263 /* If we are asked for an private ops we need a thread */
264 assert ( aTHX != PL_sharedsv_space );
266 /* To avoid need for recursive locks require caller to hold lock */
267 assert ( PL_sharedsv_lock.owner == aTHX );
269 /* First try and get existing global data structure */
271 /* Try shared SV as 1st choice */
272 if (!data && ssv && SvTYPE(ssv) >= SVt_PVMG) {
273 if( (mg = mg_find(ssv, PERL_MAGIC_ext)) ){
274 data = (shared_sv *) mg->mg_ptr;
278 /* Next see if private SV is associated with something */
280 data = Perl_sharedsv_find(aTHX_ sv);
283 /* If neither of those then create a new one */
290 data = PerlMemShared_malloc(sizeof(shared_sv));
291 Zero(data,1,shared_sv);
292 SHAREDSvPTR(data) = ssv;
293 /* Tag shared side SV with data pointer */
294 sv_magicext(ssv, ssv, PERL_MAGIC_ext, &sharedsv_shared_vtbl,
296 recursive_lock_init(aTHX_ &data->lock);
297 COND_INIT(&data->user_cond);
302 ssv = SHAREDSvPTR(data);
303 if (!SHAREDSvPTR(data))
304 SHAREDSvPTR(data) = ssv;
306 /* If we know type upgrade shared side SV */
307 if (sv && SvTYPE(ssv) < SvTYPE(sv)) {
309 sv_upgrade(ssv, SvTYPE(*psv));
313 /* Now if requested allocate private SV */
315 *psv = sv = newSV(0);
318 /* Finally if private SV exists check and add magic */
321 if (SvTYPE(sv) < SvTYPE(ssv)) {
322 sv_upgrade(sv, SvTYPE(ssv));
327 if (!(mg = mg_find(sv, PERL_MAGIC_tied))
328 || mg->mg_virtual != &sharedsv_array_vtbl
329 || (shared_sv *) mg->mg_ptr != data) {
331 sv_setref_iv(obj, "threads::shared::tie",PTR2IV(data));
333 sv_unmagic(sv, PERL_MAGIC_tied);
335 mg = sv_magicext(sv, obj, PERL_MAGIC_tied, &sharedsv_array_vtbl,
337 mg->mg_flags |= (MGf_COPY|MGf_DUP);
342 char* stash_ptr = SvPV((SV*) SvSTASH(ssv), len);
343 HV* stash = gv_stashpvn(stash_ptr, len, TRUE);
345 SvSTASH(sv) = (HV*)SvREFCNT_inc(stash);
351 if ((SvTYPE(sv) < SVt_PVMG)
352 || !(mg = mg_find(sv, PERL_MAGIC_shared_scalar))
353 || mg->mg_virtual != &sharedsv_scalar_vtbl
354 || (shared_sv *) mg->mg_ptr != data) {
356 sv_unmagic(sv, PERL_MAGIC_shared_scalar);
358 mg = sv_magicext(sv, Nullsv, PERL_MAGIC_shared_scalar,
359 &sharedsv_scalar_vtbl, (char *)data, 0);
360 mg->mg_flags |= (MGf_COPY|MGf_DUP);
365 assert ( Perl_sharedsv_find(aTHX_ *psv) == data );
371 Perl_sharedsv_free(pTHX_ shared_sv *shared)
376 SvREFCNT_dec(SHAREDSvPTR(shared));
382 Perl_sharedsv_share(pTHX_ SV *sv)
386 Perl_croak(aTHX_ "Cannot share globs yet");
390 Perl_croak(aTHX_ "Cannot share subs yet");
395 Perl_sharedsv_associate(aTHX_ &sv, 0, 0);
402 /* MAGIC (in mg.h sense) hooks */
405 sharedsv_scalar_mg_get(pTHX_ SV *sv, MAGIC *mg)
407 shared_sv *shared = (shared_sv *) mg->mg_ptr;
411 if (SHAREDSvPTR(shared)) {
412 if (SvROK(SHAREDSvPTR(shared))) {
414 Perl_sharedsv_associate(aTHX_ &obj, SvRV(SHAREDSvPTR(shared)), NULL);
415 sv_setsv_nomg(sv, &PL_sv_undef);
421 sv_setsv_nomg(sv, SHAREDSvPTR(shared));
429 sharedsv_scalar_store(pTHX_ SV *sv, shared_sv *shared)
434 shared_sv* target = Perl_sharedsv_find(aTHX_ SvRV(sv));
438 tmp = newRV(SHAREDSvPTR(target));
439 sv_setsv_nomg(SHAREDSvPTR(shared), tmp);
441 if(SvOBJECT(SvRV(sv))) {
442 SV* fake_stash = newSVpv(HvNAME(SvSTASH(SvRV(sv))),0);
443 SvOBJECT_on(SHAREDSvPTR(target));
444 SvSTASH(SHAREDSvPTR(target)) = (HV*)fake_stash;
455 sv_setsv_nomg(SHAREDSvPTR(shared), sv);
457 SV* fake_stash = newSVpv(HvNAME(SvSTASH(sv)),0);
458 SvOBJECT_on(SHAREDSvPTR(shared));
459 SvSTASH(SHAREDSvPTR(shared)) = (HV*)fake_stash;
464 Perl_croak(aTHX_ "Invalid value for shared scalar");
469 sharedsv_scalar_mg_set(pTHX_ SV *sv, MAGIC *mg)
473 /* We call associate to potentially upgrade shared side SV */
474 shared = Perl_sharedsv_associate(aTHX_ &sv, Nullsv, (shared_sv *) mg->mg_ptr);
476 sharedsv_scalar_store(aTHX_ sv, shared);
482 sharedsv_scalar_mg_free(pTHX_ SV *sv, MAGIC *mg)
484 shared_sv *shared = (shared_sv *) mg->mg_ptr;
486 assert (SvREFCNT(SHAREDSvPTR(shared)) < 1000);
488 Perl_sharedsv_free(aTHX_ shared);
493 sharedsv_scalar_mg_clear(pTHX_ SV *sv, MAGIC *mg)
499 * Called during cloning of new threads
502 sharedsv_scalar_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS *param)
504 shared_sv *shared = (shared_sv *) mg->mg_ptr;
506 SvREFCNT_inc(SHAREDSvPTR(shared));
511 MGVTBL sharedsv_scalar_vtbl = {
512 sharedsv_scalar_mg_get, /* get */
513 sharedsv_scalar_mg_set, /* set */
515 sharedsv_scalar_mg_clear, /* clear */
516 sharedsv_scalar_mg_free, /* free */
518 sharedsv_scalar_mg_dup /* dup */
521 /* Now the arrays/hashes stuff */
523 sharedsv_elem_mg_FETCH(pTHX_ SV *sv, MAGIC *mg)
526 shared_sv *shared = SV_to_sharedsv(aTHX_ mg->mg_obj);
527 shared_sv *target = Perl_sharedsv_find(aTHX_ sv);
531 assert ( SHAREDSvPTR(shared) );
534 if (SvTYPE(SHAREDSvPTR(shared)) == SVt_PVAV) {
535 assert ( mg->mg_ptr == 0 );
537 svp = av_fetch((AV*) SHAREDSvPTR(shared), mg->mg_len, 0);
540 char *key = mg->mg_ptr;
541 STRLEN len = mg->mg_len;
542 assert ( mg->mg_ptr != 0 );
543 if (mg->mg_len == HEf_SVKEY) {
544 key = SvPV((SV *) mg->mg_ptr, len);
547 svp = hv_fetch((HV*) SHAREDSvPTR(shared), key, len, 0);
551 /* Exists in the array */
552 target = Perl_sharedsv_associate(aTHX_ &sv, *svp, target);
556 /* Not in the array */
557 sv_setsv(sv, &PL_sv_undef);
564 sharedsv_elem_mg_STORE(pTHX_ SV *sv, MAGIC *mg)
567 shared_sv *shared = SV_to_sharedsv(aTHX_ mg->mg_obj);
570 /* Theory - SV itself is magically shared - and we have ordered the
571 magic such that by the time we get here it has been stored
572 to its shared counterpart
576 assert(SHAREDSvPTR(shared));
577 if (SvTYPE(SHAREDSvPTR(shared)) == SVt_PVAV) {
578 assert ( mg->mg_ptr == 0 );
580 svp = av_fetch((AV*) SHAREDSvPTR(shared), mg->mg_len, 1);
583 char *key = mg->mg_ptr;
584 STRLEN len = mg->mg_len;
585 assert ( mg->mg_ptr != 0 );
586 if (mg->mg_len == HEf_SVKEY)
587 key = SvPV((SV *) mg->mg_ptr, len);
589 svp = hv_fetch((HV*) SHAREDSvPTR(shared), key, len, 1);
592 target = Perl_sharedsv_associate(aTHX_ &sv, *svp, 0);
593 sharedsv_scalar_store(aTHX_ sv, target);
599 sharedsv_elem_mg_DELETE(pTHX_ SV *sv, MAGIC *mg)
602 shared_sv *shared = SV_to_sharedsv(aTHX_ mg->mg_obj);
604 sharedsv_elem_mg_FETCH(aTHX_ sv, mg);
605 if (SvTYPE(SHAREDSvPTR(shared)) == SVt_PVAV) {
607 av_delete((AV*) SHAREDSvPTR(shared), mg->mg_len, G_DISCARD);
610 char *key = mg->mg_ptr;
611 STRLEN len = mg->mg_len;
612 assert ( mg->mg_ptr != 0 );
613 if (mg->mg_len == HEf_SVKEY)
614 key = SvPV((SV *) mg->mg_ptr, len);
616 hv_delete((HV*) SHAREDSvPTR(shared), key, len, G_DISCARD);
624 sharedsv_elem_mg_free(pTHX_ SV *sv, MAGIC *mg)
626 Perl_sharedsv_free(aTHX_ SV_to_sharedsv(aTHX_ mg->mg_obj));
631 sharedsv_elem_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS *param)
633 shared_sv *shared = SV_to_sharedsv(aTHX_ mg->mg_obj);
634 SvREFCNT_inc(SHAREDSvPTR(shared));
635 mg->mg_flags |= MGf_DUP;
639 MGVTBL sharedsv_elem_vtbl = {
640 sharedsv_elem_mg_FETCH, /* get */
641 sharedsv_elem_mg_STORE, /* set */
643 sharedsv_elem_mg_DELETE, /* clear */
644 sharedsv_elem_mg_free, /* free */
646 sharedsv_elem_mg_dup /* dup */
650 sharedsv_array_mg_FETCHSIZE(pTHX_ SV *sv, MAGIC *mg)
653 shared_sv *shared = (shared_sv *) mg->mg_ptr;
656 if (SvTYPE(SHAREDSvPTR(shared)) == SVt_PVAV) {
657 val = av_len((AV*) SHAREDSvPTR(shared));
660 /* not actually defined by tie API but ... */
661 val = HvKEYS((HV*) SHAREDSvPTR(shared));
668 sharedsv_array_mg_CLEAR(pTHX_ SV *sv, MAGIC *mg)
671 shared_sv *shared = (shared_sv *) mg->mg_ptr;
673 if (SvTYPE(SHAREDSvPTR(shared)) == SVt_PVAV) {
674 av_clear((AV*) SHAREDSvPTR(shared));
677 hv_clear((HV*) SHAREDSvPTR(shared));
684 sharedsv_array_mg_free(pTHX_ SV *sv, MAGIC *mg)
686 Perl_sharedsv_free(aTHX_ (shared_sv *) mg->mg_ptr);
691 * This is called when perl is about to access an element of
695 sharedsv_array_mg_copy(pTHX_ SV *sv, MAGIC* mg,
696 SV *nsv, const char *name, int namlen)
698 shared_sv *shared = (shared_sv *) mg->mg_ptr;
699 MAGIC *nmg = sv_magicext(nsv,mg->mg_obj,
700 toLOWER(mg->mg_type),&sharedsv_elem_vtbl,
703 SvREFCNT_inc(SHAREDSvPTR(shared));
705 nmg->mg_flags |= MGf_DUP;
710 sharedsv_array_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS *param)
712 shared_sv *shared = (shared_sv *) mg->mg_ptr;
713 SvREFCNT_inc(SHAREDSvPTR(shared));
714 mg->mg_flags |= MGf_DUP;
718 MGVTBL sharedsv_array_vtbl = {
721 sharedsv_array_mg_FETCHSIZE, /* len */
722 sharedsv_array_mg_CLEAR, /* clear */
723 sharedsv_array_mg_free, /* free */
724 sharedsv_array_mg_copy, /* copy */
725 sharedsv_array_mg_dup /* dup */
728 =for apidoc sharedsv_unlock
730 Recursively unlocks a shared sv.
735 Perl_sharedsv_unlock(pTHX_ shared_sv* ssv)
737 recursive_lock_release(aTHX_ &ssv->lock);
740 =for apidoc sharedsv_lock
742 Recursive locks on a sharedsv.
743 Locks are dynamically scoped at the level of the first lock.
748 Perl_sharedsv_lock(pTHX_ shared_sv* ssv)
752 recursive_lock_acquire(aTHX_ &ssv->lock, __FILE__, __LINE__);
755 /* handles calls from lock() builtin via PL_lockhook */
758 Perl_sharedsv_locksv(pTHX_ SV *sv)
764 shared = Perl_sharedsv_find(aTHX_ sv);
766 croak("lock can only be used on shared values");
767 Perl_sharedsv_lock(aTHX_ shared);
770 =head1 Shared SV Functions
772 =for apidoc sharedsv_init
774 Saves a space for keeping SVs wider than an interpreter,
779 Perl_sharedsv_init(pTHX)
782 /* This pair leaves us in shared context ... */
783 PL_sharedsv_space = perl_alloc();
784 perl_construct(PL_sharedsv_space);
786 recursive_lock_init(aTHX_ &PL_sharedsv_lock);
787 PL_lockhook = &Perl_sharedsv_locksv;
788 PL_sharehook = &Perl_sharedsv_share;
791 #endif /* USE_ITHREADS */
793 MODULE = threads::shared PACKAGE = threads::shared::tie
800 PUSH(shared_sv *shared, ...)
804 for(i = 1; i < items; i++) {
805 SV* tmp = newSVsv(ST(i));
808 target = Perl_sharedsv_associate(aTHX_ &tmp, Nullsv, 0);
809 sharedsv_scalar_store(aTHX_ tmp, target);
811 av_push((AV*) SHAREDSvPTR(shared), SHAREDSvPTR(target));
812 SvREFCNT_inc(SHAREDSvPTR(target));
818 UNSHIFT(shared_sv *shared, ...)
824 av_unshift((AV*)SHAREDSvPTR(shared), items - 1);
826 for(i = 1; i < items; i++) {
827 SV* tmp = newSVsv(ST(i));
828 shared_sv *target = Perl_sharedsv_associate(aTHX_ &tmp, Nullsv, 0);
829 sharedsv_scalar_store(aTHX_ tmp, target);
831 av_store((AV*) SHAREDSvPTR(shared), i - 1, SHAREDSvPTR(target));
832 SvREFCNT_inc(SHAREDSvPTR(target));
839 POP(shared_sv *shared)
845 sv = av_pop((AV*)SHAREDSvPTR(shared));
847 ST(0) = sv_newmortal();
848 Perl_sharedsv_associate(aTHX_ &ST(0), sv, 0);
854 SHIFT(shared_sv *shared)
860 sv = av_shift((AV*)SHAREDSvPTR(shared));
862 ST(0) = sv_newmortal();
863 Perl_sharedsv_associate(aTHX_ &ST(0), sv, 0);
869 EXTEND(shared_sv *shared, IV count)
873 av_extend((AV*)SHAREDSvPTR(shared), count);
877 STORESIZE(shared_sv *shared,IV count)
881 av_fill((AV*) SHAREDSvPTR(shared), count);
888 EXISTS(shared_sv *shared, SV *index)
893 if (SvTYPE(SHAREDSvPTR(shared)) == SVt_PVAV) {
894 exists = av_exists((AV*) SHAREDSvPTR(shared), SvIV(index));
898 char *key = SvPV(index,len);
899 exists = hv_exists((HV*) SHAREDSvPTR(shared), key, len);
902 ST(0) = (exists) ? &PL_sv_yes : &PL_sv_no;
907 FIRSTKEY(shared_sv *shared)
915 hv_iterinit((HV*) SHAREDSvPTR(shared));
916 entry = hv_iternext((HV*) SHAREDSvPTR(shared));
918 key = hv_iterkey(entry,&len);
920 ST(0) = sv_2mortal(newSVpv(key, len));
923 ST(0) = &PL_sv_undef;
929 NEXTKEY(shared_sv *shared, SV *oldkey)
937 entry = hv_iternext((HV*) SHAREDSvPTR(shared));
939 key = hv_iterkey(entry,&len);
941 ST(0) = sv_2mortal(newSVpv(key, len));
944 ST(0) = &PL_sv_undef;
949 MODULE = threads::shared PACKAGE = threads::shared
961 if( (shared = Perl_sharedsv_find(aTHX_ ref)) ){
962 ST(0) = sv_2mortal(newSViv(PTR2IV(shared)));
976 if( (shared = Perl_sharedsv_find(aTHX_ ref)) ){
977 if (SHAREDSvPTR(shared)) {
978 ST(0) = sv_2mortal(newSViv(SvREFCNT(SHAREDSvPTR(shared))));
982 Perl_warn(aTHX_ "%" SVf " s=%p has no shared SV",ST(0),shared);
986 Perl_warn(aTHX_ "%" SVf " is not shared",ST(0));
995 Perl_croak(aTHX_ "Argument to share needs to be passed as ref");
999 Perl_sharedsv_share(aTHX_ ref);
1000 RETVAL = newRV(ref);
1005 lock_enabled(SV *ref)
1010 Perl_croak(aTHX_ "Argument to lock needs to be passed as ref");
1014 shared = Perl_sharedsv_find(aTHX_ ref);
1016 croak("lock can only be used on shared values");
1017 Perl_sharedsv_lock(aTHX_ shared);
1020 cond_wait_enabled(SV *ref)
1026 Perl_croak(aTHX_ "Argument to cond_wait needs to be passed as ref");
1030 shared = Perl_sharedsv_find(aTHX_ ref);
1032 croak("cond_wait can only be used on shared values");
1033 if(shared->lock.owner != aTHX)
1034 croak("You need a lock before you can cond_wait");
1035 /* Stealing the members of the lock object worries me - NI-S */
1036 MUTEX_LOCK(&shared->lock.mutex);
1037 shared->lock.owner = NULL;
1038 locks = shared->lock.locks;
1039 shared->lock.locks = 0;
1041 /* since we are releasing the lock here we need to tell other
1042 people that is ok to go ahead and use it */
1043 COND_SIGNAL(&shared->lock.cond);
1044 COND_WAIT(&shared->user_cond, &shared->lock.mutex);
1045 while(shared->lock.owner != NULL) {
1046 COND_WAIT(&shared->lock.cond,&shared->lock.mutex);
1048 shared->lock.owner = aTHX;
1049 shared->lock.locks = locks;
1050 MUTEX_UNLOCK(&shared->lock.mutex);
1053 cond_signal_enabled(SV *ref)
1058 Perl_croak(aTHX_ "Argument to cond_signal needs to be passed as ref");
1062 shared = Perl_sharedsv_find(aTHX_ ref);
1063 if (ckWARN(WARN_THREADS) && shared->lock.owner != aTHX)
1064 Perl_warner(aTHX_ packWARN(WARN_THREADS),
1065 "cond_signal() called on unlocked variable");
1067 croak("cond_signal can only be used on shared values");
1068 COND_SIGNAL(&shared->user_cond);
1071 cond_broadcast_enabled(SV *ref)
1076 Perl_croak(aTHX_ "Argument to cond_broadcast needs to be passed as ref");
1080 shared = Perl_sharedsv_find(aTHX_ ref);
1082 croak("cond_broadcast can only be used on shared values");
1083 if (ckWARN(WARN_THREADS) && shared->lock.owner != aTHX)
1084 Perl_warner(aTHX_ packWARN(WARN_THREADS),
1085 "cond_broadcast() called on unlocked variable");
1086 COND_BROADCAST(&shared->user_cond);
1090 bless(SV* ref, ...);
1097 stash = CopSTASH(PL_curcop);
1103 if (ssv && !SvGMAGICAL(ssv) && !SvAMAGIC(ssv) && SvROK(ssv))
1104 Perl_croak(aTHX_ "Attempt to bless into a reference");
1105 ptr = SvPV(ssv,len);
1106 if (ckWARN(WARN_MISC) && len == 0)
1107 Perl_warner(aTHX_ packWARN(WARN_MISC),
1108 "Explicit blessing to '' (assuming package main)");
1109 stash = gv_stashpvn(ptr, len, TRUE);
1112 (void)sv_bless(ref, stash);
1114 shared = Perl_sharedsv_find(aTHX_ ref);
1120 SV* fake_stash = newSVpv(HvNAME(stash),0);
1121 (void)sv_bless(SHAREDSvPTR(shared),(HV*)fake_stash);
1130 #endif /* USE_ITHREADS */
1135 Perl_sharedsv_init(aTHX);
1136 #endif /* USE_ITHREADS */