1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
|
/* shared.xs
*
* Copyright (c) 2001-2002, 2006 Larry Wall
*
* You may distribute under the terms of either the GNU General Public
* License or the Artistic License, as specified in the README file.
*
* "Hand any two wizards a piece of rope and they would instinctively pull in
* opposite directions."
* --Sourcery
*
* Contributed by Artur Bergman <sky AT crucially DOT net>
* Pulled in the (an)other direction by Nick Ing-Simmons
* <nick AT ing-simmons DOT net>
* CPAN version produced by Jerry D. Hedden <jdhedden AT cpan DOT org>
*/
/*
* Shared variables are implemented by a scheme similar to tieing.
* Each thread has a proxy SV with attached magic -- "private SVs" --
* which all point to a single SV in a separate shared interpreter
* (PL_sharedsv_space) -- "shared SVs".
*
* The shared SV holds the variable's true values, and its state is
* copied between the shared and private SVs with the usual
* mg_get()/mg_set() arrangement.
*
* Aggregates (AVs and HVs) are implemented using tie magic, except that
* the vtable used is one defined in this file rather than the standard one.
* This means that where a tie function like FETCH is normally invoked by
* the tie magic's mg_get() function, we completely bypass the calling of a
* perl-level function, and directly call C-level code to handle it. On
* the other hand, calls to functions like PUSH are done directly by code
* in av.c, etc., which we can't bypass. So the best we can do is to provide
* XS versions of these functions. We also have to attach a tie object,
* blessed into the class threads::shared::tie, to keep the method-calling
* code happy.
*
* Access to aggregate elements is done the usual tied way by returning a
* proxy PVLV element with attached element magic.
*
* Pointers to the shared SV are squirrelled away in the mg->mg_ptr field
* of magic (with mg_len == 0), and in the IV2PTR(SvIV(sv)) field of tied
* object SVs. These pointers have to be hidden like this because they
* cross interpreter boundaries, and we don't want sv_clear() and friends
* following them.
*
* The three basic shared types look like the following:
*
* -----------------
*
* Shared scalar (my $s : shared):
*
* SV = PVMG(0x7ba238) at 0x7387a8
* FLAGS = (PADMY,GMG,SMG)
* MAGIC = 0x824d88
* MG_TYPE = PERL_MAGIC_shared_scalar(n)
* MG_PTR = 0x810358 <<<< pointer to the shared SV
*
* -----------------
*
* Shared aggregate (my @a : shared; my %h : shared):
*
* SV = PVAV(0x7175d0) at 0x738708
* FLAGS = (PADMY,RMG)
* MAGIC = 0x824e48
* MG_TYPE = PERL_MAGIC_tied(P)
* MG_OBJ = 0x7136e0 <<<< ref to the tied object
* SV = RV(0x7136f0) at 0x7136e0
* RV = 0x738640
* SV = PVMG(0x7ba238) at 0x738640 <<<< the tied object
* FLAGS = (OBJECT,IOK,pIOK)
* IV = 8455000 <<<< pointer to the shared AV
* STASH = 0x80abf0 "threads::shared::tie"
* MG_PTR = 0x810358 "" <<<< another pointer to the shared AV
* ARRAY = 0x0
*
* -----------------
*
* Aggregate element (my @a : shared; $a[0])
*
* SV = PVLV(0x77f628) at 0x713550
* FLAGS = (GMG,SMG,RMG,pIOK)
* MAGIC = 0x72bd58
* MG_TYPE = PERL_MAGIC_shared_scalar(n)
* MG_PTR = 0x8103c0 "" <<<< pointer to the shared element
* MAGIC = 0x72bd18
* MG_TYPE = PERL_MAGIC_tiedelem(p)
* MG_OBJ = 0x7136e0 <<<< ref to the tied object
* SV = RV(0x7136f0) at 0x7136e0
* RV = 0x738660
* SV = PVMG(0x7ba278) at 0x738660 <<<< the tied object
* FLAGS = (OBJECT,IOK,pIOK)
* IV = 8455064 <<<< pointer to the shared AV
* STASH = 0x80ac30 "threads::shared::tie"
* TYPE = t
*
* Note that PERL_MAGIC_tiedelem(p) magic doesn't have a pointer to a
* shared SV in mg_ptr; instead this is used to store the hash key,
* if any, like normal tied elements. Note also that element SVs may have
* pointers to both the shared aggregate and the shared element.
*
*
* Userland locks:
*
* If a shared variable is used as a perl-level lock or condition
* variable, then PERL_MAGIC_ext magic is attached to the associated
* *shared* SV, whose mg_ptr field points to a malloc'ed structure
* containing the necessary mutexes and condition variables.
*
* Nomenclature:
*
* In this file, any variable name prefixed with 's' (e.g., ssv, stmp or sobj)
* usually represents a shared SV which corresponds to a private SV named
* without the prefix (e.g., sv, tmp or obj).
*/
#define PERL_NO_GET_CONTEXT
#include "EXTERN.h"
#include "perl.h"
#include "XSUB.h"
#ifdef HAS_PPPORT_H
# define NEED_sv_2pv_flags
# define NEED_vnewSVpvf
# define NEED_warner
# define NEED_newSVpvn_flags
# include "ppport.h"
# include "shared.h"
#endif
#ifdef USE_ITHREADS
/* Magic signature(s) for mg_private to make PERL_MAGIC_ext magic safer */
#define UL_MAGIC_SIG 0x554C /* UL = user lock */
/*
* The shared things need an interpreter to live in ...
*/
PerlInterpreter *PL_sharedsv_space; /* The shared sv space */
/* To access shared space we fake aTHX in this scope and thread's context */
/* Bug #24255: We include ENTER+SAVETMPS/FREETMPS+LEAVE with
* SHARED_CONTEXT/CALLER_CONTEXT macros, so that any mortals, etc. created
* while in the shared interpreter context don't languish */
#define SHARED_CONTEXT \
STMT_START { \
PERL_SET_CONTEXT((aTHX = PL_sharedsv_space)); \
ENTER; \
SAVETMPS; \
} STMT_END
/* So we need a way to switch back to the caller's context... */
/* So we declare _another_ copy of the aTHX variable ... */
#define dTHXc PerlInterpreter *caller_perl = aTHX
/* ... and use it to switch back */
#define CALLER_CONTEXT \
STMT_START { \
FREETMPS; \
LEAVE; \
PERL_SET_CONTEXT((aTHX = caller_perl)); \
} STMT_END
/*
* Only one thread at a time is allowed to mess with shared space.
*/
typedef struct {
perl_mutex mutex;
PerlInterpreter *owner;
I32 locks;
perl_cond cond;
#ifdef DEBUG_LOCKS
const char * file;
int line;
#endif
} recursive_lock_t;
recursive_lock_t PL_sharedsv_lock; /* Mutex protecting the shared sv space */
void
recursive_lock_init(pTHX_ recursive_lock_t *lock)
{
Zero(lock,1,recursive_lock_t);
MUTEX_INIT(&lock->mutex);
COND_INIT(&lock->cond);
}
void
recursive_lock_destroy(pTHX_ recursive_lock_t *lock)
{
MUTEX_DESTROY(&lock->mutex);
COND_DESTROY(&lock->cond);
}
void
recursive_lock_release(pTHX_ recursive_lock_t *lock)
{
MUTEX_LOCK(&lock->mutex);
if (lock->owner == aTHX) {
if (--lock->locks == 0) {
lock->owner = NULL;
COND_SIGNAL(&lock->cond);
}
}
MUTEX_UNLOCK(&lock->mutex);
}
void
recursive_lock_acquire(pTHX_ recursive_lock_t *lock, const char *file, int line)
{
PERL_UNUSED_ARG(file);
PERL_UNUSED_ARG(line);
assert(aTHX);
MUTEX_LOCK(&lock->mutex);
if (lock->owner == aTHX) {
lock->locks++;
} else {
while (lock->owner) {
#ifdef DEBUG_LOCKS
Perl_warn(aTHX_ " %p waiting - owned by %p %s:%d\n",
aTHX, lock->owner, lock->file, lock->line);
#endif
COND_WAIT(&lock->cond,&lock->mutex);
}
lock->locks = 1;
lock->owner = aTHX;
#ifdef DEBUG_LOCKS
lock->file = file;
lock->line = line;
#endif
}
MUTEX_UNLOCK(&lock->mutex);
SAVEDESTRUCTOR_X(recursive_lock_release,lock);
}
#define ENTER_LOCK \
STMT_START { \
ENTER; \
recursive_lock_acquire(aTHX_ &PL_sharedsv_lock, __FILE__, __LINE__);\
} STMT_END
/* The unlocking is done automatically at scope exit */
#define LEAVE_LOCK LEAVE
/* A common idiom is to acquire access and switch in ... */
#define SHARED_EDIT \
STMT_START { \
ENTER_LOCK; \
SHARED_CONTEXT; \
} STMT_END
/* ... then switch out and release access. */
#define SHARED_RELEASE \
STMT_START { \
CALLER_CONTEXT; \
LEAVE_LOCK; \
} STMT_END
/* User-level locks:
This structure is attached (using ext magic) to any shared SV that
is used by user-level locking or condition code
*/
typedef struct {
recursive_lock_t lock; /* For user-levl locks */
perl_cond user_cond; /* For user-level conditions */
} user_lock;
/* Magic used for attaching user_lock structs to shared SVs
The vtable used has just one entry - when the SV goes away
we free the memory for the above.
*/
int
sharedsv_userlock_free(pTHX_ SV *sv, MAGIC *mg)
{
user_lock *ul = (user_lock *) mg->mg_ptr;
PERL_UNUSED_ARG(sv);
assert(aTHX == PL_sharedsv_space);
if (ul) {
recursive_lock_destroy(aTHX_ &ul->lock);
COND_DESTROY(&ul->user_cond);
PerlMemShared_free(ul);
mg->mg_ptr = NULL;
}
return (0);
}
MGVTBL sharedsv_userlock_vtbl = {
0, /* get */
0, /* set */
0, /* len */
0, /* clear */
sharedsv_userlock_free, /* free */
0, /* copy */
0, /* dup */
#ifdef MGf_LOCAL
0, /* local */
#endif
};
/* Support for dual-valued variables */
#ifdef SVf_IVisUV
# define DUALVAR_FLAGS(sv) \
((SvPOK(sv)) \
? ((SvNOK(sv) || SvNOKp(sv)) ? SVf_NOK \
: ((SvIsUV(sv)) ? (SVf_IOK | SVf_IVisUV) \
: ((SvIOK(sv) || SvIOKp(sv)) ? SVf_IOK : 0))) \
: 0)
#else
# define DUALVAR_FLAGS(sv) \
((SvPOK(sv)) \
? ((SvNOK(sv) || SvNOKp(sv)) ? SVf_NOK \
: ((SvIOK(sv) || SvIOKp(sv)) ? SVf_IOK : 0)) \
: 0)
#endif
/*
* Access to shared things is heavily based on MAGIC
* - in mg.h/mg.c/sv.c sense
*/
/* In any thread that has access to a shared thing there is a "proxy"
for it in its own space which has 'MAGIC' associated which accesses
the shared thing.
*/
extern MGVTBL sharedsv_scalar_vtbl; /* Scalars have this vtable */
extern MGVTBL sharedsv_array_vtbl; /* Hashes and arrays have this
- like 'tie' */
extern MGVTBL sharedsv_elem_vtbl; /* Elements of hashes and arrays have
this _AS WELL AS_ the scalar magic:
The sharedsv_elem_vtbl associates the element with the array/hash and
the sharedsv_scalar_vtbl associates it with the value
*/
/* Get shared aggregate SV pointed to by threads::shared::tie magic object */
#define SHAREDSV_FROM_OBJ(sv) ((SvROK(sv)) ? INT2PTR(SV *, SvIV(SvRV(sv))) : NULL)
/* Return the user_lock structure (if any) associated with a shared SV.
* If create is true, create one if it doesn't exist
*/
STATIC user_lock *
S_get_userlock(pTHX_ SV* ssv, bool create)
{
MAGIC *mg;
user_lock *ul = NULL;
assert(ssv);
/* XXX Redesign the storage of user locks so we don't need a global
* lock to access them ???? DAPM */
ENTER_LOCK;
/* Version of mg_find that also checks the private signature */
for (mg = SvMAGIC(ssv); mg; mg = mg->mg_moremagic) {
if ((mg->mg_type == PERL_MAGIC_ext) &&
(mg->mg_private == UL_MAGIC_SIG))
{
break;
}
}
if (mg) {
ul = (user_lock*)(mg->mg_ptr);
} else if (create) {
dTHXc;
SHARED_CONTEXT;
ul = (user_lock *) PerlMemShared_malloc(sizeof(user_lock));
Zero(ul, 1, user_lock);
/* Attach to shared SV using ext magic */
mg = sv_magicext(ssv, NULL, PERL_MAGIC_ext, &sharedsv_userlock_vtbl,
(char *)ul, 0);
mg->mg_private = UL_MAGIC_SIG; /* Set private signature */
recursive_lock_init(aTHX_ &ul->lock);
COND_INIT(&ul->user_cond);
CALLER_CONTEXT;
}
LEAVE_LOCK;
return (ul);
}
/* Given a private side SV tries to find if the SV has a shared backend,
* by looking for the magic.
*/
SV *
Perl_sharedsv_find(pTHX_ SV *sv)
{
MAGIC *mg;
if (SvTYPE(sv) >= SVt_PVMG) {
switch(SvTYPE(sv)) {
case SVt_PVAV:
case SVt_PVHV:
if ((mg = mg_find(sv, PERL_MAGIC_tied))
&& mg->mg_virtual == &sharedsv_array_vtbl) {
return ((SV *)mg->mg_ptr);
}
break;
default:
/* This should work for elements as well as they
* have scalar magic as well as their element magic
*/
if ((mg = mg_find(sv, PERL_MAGIC_shared_scalar))
&& mg->mg_virtual == &sharedsv_scalar_vtbl) {
return ((SV *)mg->mg_ptr);
}
break;
}
}
/* Just for tidyness of API also handle tie objects */
if (SvROK(sv) && sv_derived_from(sv, "threads::shared::tie")) {
return (SHAREDSV_FROM_OBJ(sv));
}
return (NULL);
}
/* Associate a private SV with a shared SV by pointing the appropriate
* magics at it.
* Assumes lock is held.
*/
void
Perl_sharedsv_associate(pTHX_ SV *sv, SV *ssv)
{
MAGIC *mg = 0;
/* If we are asked for any private ops we need a thread */
assert ( aTHX != PL_sharedsv_space );
/* To avoid need for recursive locks require caller to hold lock */
assert ( PL_sharedsv_lock.owner == aTHX );
switch(SvTYPE(sv)) {
case SVt_PVAV:
case SVt_PVHV:
if (!(mg = mg_find(sv, PERL_MAGIC_tied))
|| mg->mg_virtual != &sharedsv_array_vtbl
|| (SV*) mg->mg_ptr != ssv)
{
SV *obj = newSV(0);
sv_setref_iv(obj, "threads::shared::tie", PTR2IV(ssv));
if (mg) {
sv_unmagic(sv, PERL_MAGIC_tied);
}
mg = sv_magicext(sv, obj, PERL_MAGIC_tied, &sharedsv_array_vtbl,
(char *)ssv, 0);
mg->mg_flags |= (MGf_COPY|MGf_DUP);
SvREFCNT_inc_void(ssv);
SvREFCNT_dec(obj);
}
break;
default:
if ((SvTYPE(sv) < SVt_PVMG)
|| !(mg = mg_find(sv, PERL_MAGIC_shared_scalar))
|| mg->mg_virtual != &sharedsv_scalar_vtbl
|| (SV*) mg->mg_ptr != ssv)
{
if (mg) {
sv_unmagic(sv, PERL_MAGIC_shared_scalar);
}
mg = sv_magicext(sv, Nullsv, PERL_MAGIC_shared_scalar,
&sharedsv_scalar_vtbl, (char *)ssv, 0);
mg->mg_flags |= (MGf_DUP
#ifdef MGf_LOCAL
|MGf_LOCAL
#endif
);
SvREFCNT_inc_void(ssv);
}
break;
}
assert ( Perl_sharedsv_find(aTHX_ sv) == ssv );
}
/* Given a private SV, create and return an associated shared SV.
* Assumes lock is held.
*/
STATIC SV *
S_sharedsv_new_shared(pTHX_ SV *sv)
{
dTHXc;
SV *ssv;
assert(PL_sharedsv_lock.owner == aTHX);
assert(aTHX != PL_sharedsv_space);
SHARED_CONTEXT;
ssv = newSV(0);
SvREFCNT(ssv) = 0; /* Will be upped to 1 by Perl_sharedsv_associate */
sv_upgrade(ssv, SvTYPE(sv));
CALLER_CONTEXT;
Perl_sharedsv_associate(aTHX_ sv, ssv);
return (ssv);
}
/* Given a shared SV, create and return an associated private SV.
* Assumes lock is held.
*/
STATIC SV *
S_sharedsv_new_private(pTHX_ SV *ssv)
{
SV *sv;
assert(PL_sharedsv_lock.owner == aTHX);
assert(aTHX != PL_sharedsv_space);
sv = newSV(0);
sv_upgrade(sv, SvTYPE(ssv));
Perl_sharedsv_associate(aTHX_ sv, ssv);
return (sv);
}
/* A threadsafe version of SvREFCNT_dec(ssv) */
STATIC void
S_sharedsv_dec(pTHX_ SV* ssv)
{
if (! ssv)
return;
ENTER_LOCK;
if (SvREFCNT(ssv) > 1) {
/* No side effects, so can do it lightweight */
SvREFCNT_dec(ssv);
} else {
dTHXc;
SHARED_CONTEXT;
SvREFCNT_dec(ssv);
CALLER_CONTEXT;
}
LEAVE_LOCK;
}
/* Implements Perl-level share() and :shared */
void
Perl_sharedsv_share(pTHX_ SV *sv)
{
switch(SvTYPE(sv)) {
case SVt_PVGV:
Perl_croak(aTHX_ "Cannot share globs yet");
break;
case SVt_PVCV:
Perl_croak(aTHX_ "Cannot share subs yet");
break;
default:
ENTER_LOCK;
(void) S_sharedsv_new_shared(aTHX_ sv);
LEAVE_LOCK;
SvSETMAGIC(sv);
break;
}
}
#ifdef WIN32
/* Number of milliseconds from 1/1/1601 to 1/1/1970 */
#define EPOCH_BIAS 11644473600000.
/* Returns relative time in milliseconds. (Adapted from Time::HiRes.) */
STATIC DWORD
S_abs_2_rel_milli(double abs)
{
double rel;
/* Get current time (in units of 100 nanoseconds since 1/1/1601) */
union {
FILETIME ft;
__int64 i64; /* 'signed' to keep compilers happy */
} now;
GetSystemTimeAsFileTime(&now.ft);
/* Relative time in milliseconds */
rel = (abs * 1000.) - (((double)now.i64 / 10000.) - EPOCH_BIAS);
if (rel <= 0.0) {
return (0);
}
return (DWORD)rel;
}
#else
# if defined(OS2)
# define ABS2RELMILLI(abs) \
do { \
abs -= (double)time(NULL); \
if (abs > 0) { abs *= 1000; } \
else { abs = 0; } \
} while (0)
# endif /* OS2 */
#endif /* WIN32 */
/* Do OS-specific condition timed wait */
bool
Perl_sharedsv_cond_timedwait(perl_cond *cond, perl_mutex *mut, double abs)
{
#if defined(NETWARE) || defined(I_MACH_CTHREADS)
Perl_croak_nocontext("cond_timedwait not supported on this platform");
#else
# ifdef WIN32
int got_it = 0;
cond->waiters++;
MUTEX_UNLOCK(mut);
/* See comments in win32/win32thread.h COND_WAIT vis-a-vis race */
switch (WaitForSingleObject(cond->sem, S_abs_2_rel_milli(abs))) {
case WAIT_OBJECT_0: got_it = 1; break;
case WAIT_TIMEOUT: break;
default:
/* WAIT_FAILED? WAIT_ABANDONED? others? */
Perl_croak_nocontext("panic: cond_timedwait (%ld)",GetLastError());
break;
}
MUTEX_LOCK(mut);
cond->waiters--;
return (got_it);
# else
# ifdef OS2
int rc, got_it = 0;
STRLEN n_a;
ABS2RELMILLI(abs);
if ((rc = DosResetEventSem(*cond,&n_a)) && (rc != ERROR_ALREADY_RESET))
Perl_rc = rc, croak_with_os2error("panic: cond_timedwait-reset");
MUTEX_UNLOCK(mut);
if (CheckOSError(DosWaitEventSem(*cond,abs))
&& (rc != ERROR_INTERRUPT))
croak_with_os2error("panic: cond_timedwait");
if (rc == ERROR_INTERRUPT) errno = EINTR;
MUTEX_LOCK(mut);
return (got_it);
# else /* Hope you're I_PTHREAD! */
struct timespec ts;
int got_it = 0;
ts.tv_sec = (long)abs;
abs -= (NV)ts.tv_sec;
ts.tv_nsec = (long)(abs * 1000000000.0);
switch (pthread_cond_timedwait(cond, mut, &ts)) {
case 0: got_it = 1; break;
case ETIMEDOUT: break;
#ifdef OEMVS
case -1:
if (errno == ETIMEDOUT || errno == EAGAIN)
break;
#endif
default:
Perl_croak_nocontext("panic: cond_timedwait");
break;
}
return (got_it);
# endif /* OS2 */
# endif /* WIN32 */
#endif /* NETWARE || I_MACH_CTHREADS */
}
/* Given a thingy referenced by a shared RV, copy it's value to a private
* RV, also copying the object status of the referent.
* If the private side is already an appropriate RV->SV combination, keep
* it if possible.
*/
STATIC void
S_get_RV(pTHX_ SV *sv, SV *sobj) {
SV *obj;
if (! (SvROK(sv) &&
((obj = SvRV(sv))) &&
(Perl_sharedsv_find(aTHX_ obj) == sobj) &&
(SvTYPE(obj) == SvTYPE(sobj))))
{
/* Can't reuse obj */
if (SvROK(sv)) {
SvREFCNT_dec(SvRV(sv));
} else {
assert(SvTYPE(sv) >= SVt_RV);
sv_setsv_nomg(sv, &PL_sv_undef);
SvROK_on(sv);
}
obj = S_sharedsv_new_private(aTHX_ sobj);
SvRV_set(sv, obj);
}
if (SvOBJECT(obj)) {
/* Remove any old blessing */
SvREFCNT_dec(SvSTASH(obj));
SvOBJECT_off(obj);
}
if (SvOBJECT(sobj)) {
/* Add any new old blessing */
STRLEN len;
char* stash_ptr = SvPV((SV*) SvSTASH(sobj), len);
HV* stash = gv_stashpvn(stash_ptr, len, TRUE);
SvOBJECT_on(obj);
SvSTASH_set(obj, (HV*)SvREFCNT_inc(stash));
}
}
/* Every caller of S_get_RV needs this incantation (which cannot go inside
S_get_RV itself, as we do not want recursion beyond one level): */
#define get_RV(sv, sobj) \
S_get_RV(aTHX_ sv, sobj); \
/* Look ahead for refs of refs */ \
if (SvROK(sobj)) { \
SvROK_on(SvRV(sv)); \
S_get_RV(aTHX_ SvRV(sv), SvRV(sobj)); \
}
/* ------------ PERL_MAGIC_shared_scalar(n) functions -------------- */
/* Get magic for PERL_MAGIC_shared_scalar(n) */
int
sharedsv_scalar_mg_get(pTHX_ SV *sv, MAGIC *mg)
{
SV *ssv = (SV *) mg->mg_ptr;
assert(ssv);
ENTER_LOCK;
if (SvROK(ssv)) {
get_RV(sv, SvRV(ssv));
} else {
sv_setsv_nomg(sv, ssv);
}
LEAVE_LOCK;
return (0);
}
/* Copy the contents of a private SV to a shared SV.
* Used by various mg_set()-type functions.
* Assumes lock is held.
*/
void
sharedsv_scalar_store(pTHX_ SV *sv, SV *ssv)
{
dTHXc;
bool allowed = TRUE;
assert(PL_sharedsv_lock.owner == aTHX);
if (!PL_dirty && SvROK(ssv) && SvREFCNT(SvRV(ssv)) == 1) {
SV *sv = sv_newmortal();
sv_upgrade(sv, SVt_RV);
get_RV(sv, SvRV(ssv));
}
if (SvROK(sv)) {
SV *obj = SvRV(sv);
SV *sobj = Perl_sharedsv_find(aTHX_ obj);
if (sobj) {
SHARED_CONTEXT;
(void)SvUPGRADE(ssv, SVt_RV);
sv_setsv_nomg(ssv, &PL_sv_undef);
SvRV_set(ssv, SvREFCNT_inc(sobj));
SvROK_on(ssv);
if (SvOBJECT(sobj)) {
/* Remove any old blessing */
SvREFCNT_dec(SvSTASH(sobj));
SvOBJECT_off(sobj);
}
if (SvOBJECT(obj)) {
SV* fake_stash = newSVpv(HvNAME_get(SvSTASH(obj)),0);
SvOBJECT_on(sobj);
SvSTASH_set(sobj, (HV*)fake_stash);
}
CALLER_CONTEXT;
} else {
allowed = FALSE;
}
} else {
SvTEMP_off(sv);
SHARED_CONTEXT;
sv_setsv_nomg(ssv, sv);
if (SvOBJECT(ssv)) {
/* Remove any old blessing */
SvREFCNT_dec(SvSTASH(ssv));
SvOBJECT_off(ssv);
}
if (SvOBJECT(sv)) {
SV* fake_stash = newSVpv(HvNAME_get(SvSTASH(sv)),0);
SvOBJECT_on(ssv);
SvSTASH_set(ssv, (HV*)fake_stash);
}
CALLER_CONTEXT;
}
if (!allowed) {
Perl_croak(aTHX_ "Invalid value for shared scalar");
}
}
/* Set magic for PERL_MAGIC_shared_scalar(n) */
int
sharedsv_scalar_mg_set(pTHX_ SV *sv, MAGIC *mg)
{
SV *ssv = (SV*)(mg->mg_ptr);
assert(ssv);
ENTER_LOCK;
if (SvTYPE(ssv) < SvTYPE(sv)) {
dTHXc;
SHARED_CONTEXT;
sv_upgrade(ssv, SvTYPE(sv));
CALLER_CONTEXT;
}
sharedsv_scalar_store(aTHX_ sv, ssv);
LEAVE_LOCK;
return (0);
}
/* Free magic for PERL_MAGIC_shared_scalar(n) */
int
sharedsv_scalar_mg_free(pTHX_ SV *sv, MAGIC *mg)
{
PERL_UNUSED_ARG(sv);
ENTER_LOCK;
if (!PL_dirty
&& SvROK((SV *)mg->mg_ptr) && SvREFCNT(SvRV((SV *)mg->mg_ptr)) == 1) {
SV *sv = sv_newmortal();
sv_upgrade(sv, SVt_RV);
get_RV(sv, SvRV((SV *)mg->mg_ptr));
}
S_sharedsv_dec(aTHX_ (SV*)mg->mg_ptr);
LEAVE_LOCK;
return (0);
}
/*
* Called during cloning of PERL_MAGIC_shared_scalar(n) magic in new thread
*/
int
sharedsv_scalar_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS *param)
{
PERL_UNUSED_ARG(param);
SvREFCNT_inc_void(mg->mg_ptr);
return (0);
}
#ifdef MGf_LOCAL
/*
* Called during local $shared
*/
int
sharedsv_scalar_mg_local(pTHX_ SV* nsv, MAGIC *mg)
{
MAGIC *nmg;
SV *ssv = (SV *) mg->mg_ptr;
if (ssv) {
ENTER_LOCK;
SvREFCNT_inc_void(ssv);
LEAVE_LOCK;
}
nmg = sv_magicext(nsv, mg->mg_obj, mg->mg_type, mg->mg_virtual,
mg->mg_ptr, mg->mg_len);
nmg->mg_flags = mg->mg_flags;
nmg->mg_private = mg->mg_private;
return (0);
}
#endif
MGVTBL sharedsv_scalar_vtbl = {
sharedsv_scalar_mg_get, /* get */
sharedsv_scalar_mg_set, /* set */
0, /* len */
0, /* clear */
sharedsv_scalar_mg_free, /* free */
0, /* copy */
sharedsv_scalar_mg_dup, /* dup */
#ifdef MGf_LOCAL
sharedsv_scalar_mg_local, /* local */
#endif
};
/* ------------ PERL_MAGIC_tiedelem(p) functions -------------- */
/* Get magic for PERL_MAGIC_tiedelem(p) */
int
sharedsv_elem_mg_FETCH(pTHX_ SV *sv, MAGIC *mg)
{
dTHXc;
SV *saggregate = SHAREDSV_FROM_OBJ(mg->mg_obj);
SV** svp = NULL;
ENTER_LOCK;
if (saggregate) { /* During global destruction, underlying
aggregate may no longer exist */
if (SvTYPE(saggregate) == SVt_PVAV) {
assert ( mg->mg_ptr == 0 );
SHARED_CONTEXT;
svp = av_fetch((AV*) saggregate, mg->mg_len, 0);
} else {
char *key = mg->mg_ptr;
I32 len = mg->mg_len;
assert ( mg->mg_ptr != 0 );
if (mg->mg_len == HEf_SVKEY) {
STRLEN slen;
key = SvPV((SV *)mg->mg_ptr, slen);
len = slen;
if (SvUTF8((SV *)mg->mg_ptr)) {
len = -len;
}
}
SHARED_CONTEXT;
svp = hv_fetch((HV*) saggregate, key, len, 0);
}
CALLER_CONTEXT;
}
if (svp) {
/* Exists in the array */
if (SvROK(*svp)) {
get_RV(sv, SvRV(*svp));
} else {
/* $ary->[elem] or $ary->{elem} is a scalar */
Perl_sharedsv_associate(aTHX_ sv, *svp);
sv_setsv(sv, *svp);
}
} else {
/* Not in the array */
sv_setsv(sv, &PL_sv_undef);
}
LEAVE_LOCK;
return (0);
}
/* Set magic for PERL_MAGIC_tiedelem(p) */
int
sharedsv_elem_mg_STORE(pTHX_ SV *sv, MAGIC *mg)
{
dTHXc;
SV *saggregate = SHAREDSV_FROM_OBJ(mg->mg_obj);
SV **svp;
U32 dualvar_flags = DUALVAR_FLAGS(sv);
/* Theory - SV itself is magically shared - and we have ordered the
magic such that by the time we get here it has been stored
to its shared counterpart
*/
ENTER_LOCK;
assert(saggregate);
if (SvTYPE(saggregate) == SVt_PVAV) {
assert ( mg->mg_ptr == 0 );
SHARED_CONTEXT;
svp = av_fetch((AV*) saggregate, mg->mg_len, 1);
} else {
char *key = mg->mg_ptr;
I32 len = mg->mg_len;
assert ( mg->mg_ptr != 0 );
if (mg->mg_len == HEf_SVKEY) {
STRLEN slen;
key = SvPV((SV *)mg->mg_ptr, slen);
len = slen;
if (SvUTF8((SV *)mg->mg_ptr)) {
len = -len;
}
}
SHARED_CONTEXT;
svp = hv_fetch((HV*) saggregate, key, len, 1);
}
CALLER_CONTEXT;
Perl_sharedsv_associate(aTHX_ sv, *svp);
sharedsv_scalar_store(aTHX_ sv, *svp);
SvFLAGS(*svp) |= dualvar_flags;
LEAVE_LOCK;
return (0);
}
/* Clear magic for PERL_MAGIC_tiedelem(p) */
int
sharedsv_elem_mg_DELETE(pTHX_ SV *sv, MAGIC *mg)
{
dTHXc;
MAGIC *shmg;
SV *saggregate = SHAREDSV_FROM_OBJ(mg->mg_obj);
/* Object may not exist during global destruction */
if (! saggregate) {
return (0);
}
ENTER_LOCK;
sharedsv_elem_mg_FETCH(aTHX_ sv, mg);
if ((shmg = mg_find(sv, PERL_MAGIC_shared_scalar)))
sharedsv_scalar_mg_get(aTHX_ sv, shmg);
if (SvTYPE(saggregate) == SVt_PVAV) {
SHARED_CONTEXT;
av_delete((AV*) saggregate, mg->mg_len, G_DISCARD);
} else {
char *key = mg->mg_ptr;
I32 len = mg->mg_len;
assert ( mg->mg_ptr != 0 );
if (mg->mg_len == HEf_SVKEY) {
STRLEN slen;
key = SvPV((SV *)mg->mg_ptr, slen);
len = slen;
if (SvUTF8((SV *)mg->mg_ptr)) {
len = -len;
}
}
SHARED_CONTEXT;
(void) hv_delete((HV*) saggregate, key, len, G_DISCARD);
}
CALLER_CONTEXT;
LEAVE_LOCK;
return (0);
}
/* Called during cloning of PERL_MAGIC_tiedelem(p) magic in new
* thread */
int
sharedsv_elem_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS *param)
{
PERL_UNUSED_ARG(param);
SvREFCNT_inc_void(SHAREDSV_FROM_OBJ(mg->mg_obj));
assert(mg->mg_flags & MGf_DUP);
return (0);
}
MGVTBL sharedsv_elem_vtbl = {
sharedsv_elem_mg_FETCH, /* get */
sharedsv_elem_mg_STORE, /* set */
0, /* len */
sharedsv_elem_mg_DELETE, /* clear */
0, /* free */
0, /* copy */
sharedsv_elem_mg_dup, /* dup */
#ifdef MGf_LOCAL
0, /* local */
#endif
};
/* ------------ PERL_MAGIC_tied(P) functions -------------- */
/* Len magic for PERL_MAGIC_tied(P) */
U32
sharedsv_array_mg_FETCHSIZE(pTHX_ SV *sv, MAGIC *mg)
{
dTHXc;
SV *ssv = (SV *) mg->mg_ptr;
U32 val;
PERL_UNUSED_ARG(sv);
SHARED_EDIT;
if (SvTYPE(ssv) == SVt_PVAV) {
val = av_len((AV*) ssv);
} else {
/* Not actually defined by tie API but ... */
val = HvUSEDKEYS((HV*) ssv);
}
SHARED_RELEASE;
return (val);
}
/* Clear magic for PERL_MAGIC_tied(P) */
int
sharedsv_array_mg_CLEAR(pTHX_ SV *sv, MAGIC *mg)
{
dTHXc;
SV *ssv = (SV *) mg->mg_ptr;
const bool isav = SvTYPE(ssv) == SVt_PVAV;
PERL_UNUSED_ARG(sv);
SHARED_EDIT;
if (!PL_dirty) {
SV **svp = isav ? AvARRAY((AV *)ssv) : NULL;
I32 items = isav ? AvFILLp((AV *)ssv) + 1 : 0;
HE *iter;
if (!isav) hv_iterinit((HV *)ssv);
while (isav ? items-- : !!(iter = hv_iternext((HV *)ssv))) {
SV *sv = isav ? *svp++ : HeVAL(iter);
if (!sv) continue;
if ( (SvOBJECT(sv) || (SvROK(sv) && (sv = SvRV(sv))))
&& SvREFCNT(sv) == 1 ) {
SV *tmp = Perl_sv_newmortal(caller_perl);
PERL_SET_CONTEXT((aTHX = caller_perl));
sv_upgrade(tmp, SVt_RV);
get_RV(tmp, sv);
PERL_SET_CONTEXT((aTHX = PL_sharedsv_space));
}
}
}
if (isav) av_clear((AV*) ssv);
else hv_clear((HV*) ssv);
SHARED_RELEASE;
return (0);
}
/* Free magic for PERL_MAGIC_tied(P) */
int
sharedsv_array_mg_free(pTHX_ SV *sv, MAGIC *mg)
{
PERL_UNUSED_ARG(sv);
S_sharedsv_dec(aTHX_ (SV*)mg->mg_ptr);
return (0);
}
/*
* Copy magic for PERL_MAGIC_tied(P)
* This is called when perl is about to access an element of
* the array -
*/
#if PERL_VERSION >= 11
int
sharedsv_array_mg_copy(pTHX_ SV *sv, MAGIC* mg,
SV *nsv, const char *name, I32 namlen)
#else
int
sharedsv_array_mg_copy(pTHX_ SV *sv, MAGIC* mg,
SV *nsv, const char *name, int namlen)
#endif
{
MAGIC *nmg = sv_magicext(nsv,mg->mg_obj,
toLOWER(mg->mg_type),&sharedsv_elem_vtbl,
name, namlen);
PERL_UNUSED_ARG(sv);
nmg->mg_flags |= MGf_DUP;
return (1);
}
/* Called during cloning of PERL_MAGIC_tied(P) magic in new thread */
int
sharedsv_array_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS *param)
{
PERL_UNUSED_ARG(param);
SvREFCNT_inc_void((SV*)mg->mg_ptr);
assert(mg->mg_flags & MGf_DUP);
return (0);
}
MGVTBL sharedsv_array_vtbl = {
0, /* get */
0, /* set */
sharedsv_array_mg_FETCHSIZE,/* len */
sharedsv_array_mg_CLEAR, /* clear */
sharedsv_array_mg_free, /* free */
sharedsv_array_mg_copy, /* copy */
sharedsv_array_mg_dup, /* dup */
#ifdef MGf_LOCAL
0, /* local */
#endif
};
/* Recursively unlocks a shared sv. */
void
Perl_sharedsv_unlock(pTHX_ SV *ssv)
{
user_lock *ul = S_get_userlock(aTHX_ ssv, 0);
assert(ul);
recursive_lock_release(aTHX_ &ul->lock);
}
/* Recursive locks on a sharedsv.
* Locks are dynamically scoped at the level of the first lock.
*/
void
Perl_sharedsv_lock(pTHX_ SV *ssv)
{
user_lock *ul;
if (! ssv)
return;
ul = S_get_userlock(aTHX_ ssv, 1);
recursive_lock_acquire(aTHX_ &ul->lock, __FILE__, __LINE__);
}
/* Handles calls from lock() builtin via PL_lockhook */
void
Perl_sharedsv_locksv(pTHX_ SV *sv)
{
SV *ssv;
if (SvROK(sv))
sv = SvRV(sv);
ssv = Perl_sharedsv_find(aTHX_ sv);
if (!ssv)
croak("lock can only be used on shared values");
Perl_sharedsv_lock(aTHX_ ssv);
}
/* Can a shared object be destroyed?
* True if not a shared,
* or if destroying last proxy on a shared object
*/
#ifdef PL_destroyhook
bool
Perl_shared_object_destroy(pTHX_ SV *sv)
{
SV *ssv;
if (SvROK(sv))
sv = SvRV(sv);
ssv = Perl_sharedsv_find(aTHX_ sv);
return (!ssv || (SvREFCNT(ssv) <= 1));
}
#endif
/* veto signal dispatch if we have the lock */
#ifdef PL_signalhook
STATIC despatch_signals_proc_t prev_signal_hook = NULL;
STATIC void
S_shared_signal_hook(pTHX) {
int us;
MUTEX_LOCK(&PL_sharedsv_lock.mutex);
us = (PL_sharedsv_lock.owner == aTHX);
MUTEX_UNLOCK(&PL_sharedsv_lock.mutex);
if (us)
return; /* try again later */
prev_signal_hook(aTHX);
}
#endif
/* Saves a space for keeping SVs wider than an interpreter. */
void
Perl_sharedsv_init(pTHX)
{
dTHXc;
PL_sharedsv_space = perl_alloc();
perl_construct(PL_sharedsv_space);
/* The pair above leaves us in shared context (what dTHX would get),
* but aTHX still points to caller context */
aTHX = PL_sharedsv_space;
LEAVE; /* This balances the ENTER at the end of perl_construct. */
PERL_SET_CONTEXT((aTHX = caller_perl));
recursive_lock_init(aTHX_ &PL_sharedsv_lock);
PL_lockhook = &Perl_sharedsv_locksv;
PL_sharehook = &Perl_sharedsv_share;
#ifdef PL_destroyhook
PL_destroyhook = &Perl_shared_object_destroy;
#endif
#ifdef PL_signalhook
if (!prev_signal_hook) {
prev_signal_hook = PL_signalhook;
PL_signalhook = &S_shared_signal_hook;
}
#endif
}
#endif /* USE_ITHREADS */
MODULE = threads::shared PACKAGE = threads::shared::tie
PROTOTYPES: DISABLE
#ifdef USE_ITHREADS
void
PUSH(SV *obj, ...)
CODE:
dTHXc;
SV *sobj = SHAREDSV_FROM_OBJ(obj);
int ii;
for (ii = 1; ii < items; ii++) {
SV* tmp = newSVsv(ST(ii));
SV *stmp;
U32 dualvar_flags = DUALVAR_FLAGS(tmp);
ENTER_LOCK;
stmp = S_sharedsv_new_shared(aTHX_ tmp);
sharedsv_scalar_store(aTHX_ tmp, stmp);
SvFLAGS(stmp) |= dualvar_flags;
SHARED_CONTEXT;
av_push((AV*) sobj, stmp);
SvREFCNT_inc_void(stmp);
SHARED_RELEASE;
SvREFCNT_dec(tmp);
}
void
UNSHIFT(SV *obj, ...)
CODE:
dTHXc;
SV *sobj = SHAREDSV_FROM_OBJ(obj);
int ii;
ENTER_LOCK;
SHARED_CONTEXT;
av_unshift((AV*)sobj, items - 1);
CALLER_CONTEXT;
for (ii = 1; ii < items; ii++) {
SV *tmp = newSVsv(ST(ii));
U32 dualvar_flags = DUALVAR_FLAGS(tmp);
SV *stmp = S_sharedsv_new_shared(aTHX_ tmp);
sharedsv_scalar_store(aTHX_ tmp, stmp);
SHARED_CONTEXT;
SvFLAGS(stmp) |= dualvar_flags;
av_store((AV*) sobj, ii - 1, stmp);
SvREFCNT_inc_void(stmp);
CALLER_CONTEXT;
SvREFCNT_dec(tmp);
}
LEAVE_LOCK;
void
POP(SV *obj)
CODE:
dTHXc;
SV *sobj = SHAREDSV_FROM_OBJ(obj);
SV* ssv;
ENTER_LOCK;
SHARED_CONTEXT;
ssv = av_pop((AV*)sobj);
CALLER_CONTEXT;
ST(0) = sv_newmortal();
Perl_sharedsv_associate(aTHX_ ST(0), ssv);
SvREFCNT_dec(ssv);
LEAVE_LOCK;
/* XSRETURN(1); - implied */
void
SHIFT(SV *obj)
CODE:
dTHXc;
SV *sobj = SHAREDSV_FROM_OBJ(obj);
SV* ssv;
ENTER_LOCK;
SHARED_CONTEXT;
ssv = av_shift((AV*)sobj);
CALLER_CONTEXT;
ST(0) = sv_newmortal();
Perl_sharedsv_associate(aTHX_ ST(0), ssv);
SvREFCNT_dec(ssv);
LEAVE_LOCK;
/* XSRETURN(1); - implied */
void
EXTEND(SV *obj, IV count)
CODE:
dTHXc;
SV *sobj = SHAREDSV_FROM_OBJ(obj);
SHARED_EDIT;
av_extend((AV*)sobj, count);
SHARED_RELEASE;
void
STORESIZE(SV *obj,IV count)
CODE:
dTHXc;
SV *sobj = SHAREDSV_FROM_OBJ(obj);
SHARED_EDIT;
av_fill((AV*) sobj, count);
SHARED_RELEASE;
void
EXISTS(SV *obj, SV *index)
CODE:
dTHXc;
SV *sobj = SHAREDSV_FROM_OBJ(obj);
bool exists;
if (SvTYPE(sobj) == SVt_PVAV) {
SHARED_EDIT;
exists = av_exists((AV*) sobj, SvIV(index));
} else {
I32 len;
STRLEN slen;
char *key = SvPVutf8(index, slen);
len = slen;
if (SvUTF8(index)) {
len = -len;
}
SHARED_EDIT;
exists = hv_exists((HV*) sobj, key, len);
}
SHARED_RELEASE;
ST(0) = (exists) ? &PL_sv_yes : &PL_sv_no;
/* XSRETURN(1); - implied */
void
FIRSTKEY(SV *obj)
CODE:
dTHXc;
SV *sobj = SHAREDSV_FROM_OBJ(obj);
char* key = NULL;
I32 len = 0;
HE* entry;
ENTER_LOCK;
SHARED_CONTEXT;
hv_iterinit((HV*) sobj);
entry = hv_iternext((HV*) sobj);
if (entry) {
I32 utf8 = HeKUTF8(entry);
key = hv_iterkey(entry,&len);
CALLER_CONTEXT;
ST(0) = newSVpvn_flags(key, len, SVs_TEMP | (utf8 ? SVf_UTF8 : 0));
} else {
CALLER_CONTEXT;
ST(0) = &PL_sv_undef;
}
LEAVE_LOCK;
/* XSRETURN(1); - implied */
void
NEXTKEY(SV *obj, SV *oldkey)
CODE:
dTHXc;
SV *sobj = SHAREDSV_FROM_OBJ(obj);
char* key = NULL;
I32 len = 0;
HE* entry;
PERL_UNUSED_VAR(oldkey);
ENTER_LOCK;
SHARED_CONTEXT;
entry = hv_iternext((HV*) sobj);
if (entry) {
I32 utf8 = HeKUTF8(entry);
key = hv_iterkey(entry,&len);
CALLER_CONTEXT;
ST(0) = newSVpvn_flags(key, len, SVs_TEMP | (utf8 ? SVf_UTF8 : 0));
} else {
CALLER_CONTEXT;
ST(0) = &PL_sv_undef;
}
LEAVE_LOCK;
/* XSRETURN(1); - implied */
MODULE = threads::shared PACKAGE = threads::shared
PROTOTYPES: ENABLE
void
_id(SV *myref)
PROTOTYPE: \[$@%]
PREINIT:
SV *ssv;
CODE:
myref = SvRV(myref);
if (SvMAGICAL(myref))
mg_get(myref);
if (SvROK(myref))
myref = SvRV(myref);
ssv = Perl_sharedsv_find(aTHX_ myref);
if (! ssv)
XSRETURN_UNDEF;
ST(0) = sv_2mortal(newSVuv(PTR2UV(ssv)));
/* XSRETURN(1); - implied */
void
_refcnt(SV *myref)
PROTOTYPE: \[$@%]
PREINIT:
SV *ssv;
CODE:
myref = SvRV(myref);
if (SvROK(myref))
myref = SvRV(myref);
ssv = Perl_sharedsv_find(aTHX_ myref);
if (! ssv) {
if (ckWARN(WARN_THREADS)) {
Perl_warner(aTHX_ packWARN(WARN_THREADS),
"%" SVf " is not shared", ST(0));
}
XSRETURN_UNDEF;
}
ST(0) = sv_2mortal(newSViv(SvREFCNT(ssv)));
/* XSRETURN(1); - implied */
void
share(SV *myref)
PROTOTYPE: \[$@%]
CODE:
if (! SvROK(myref))
Perl_croak(aTHX_ "Argument to share needs to be passed as ref");
myref = SvRV(myref);
if (SvROK(myref))
myref = SvRV(myref);
Perl_sharedsv_share(aTHX_ myref);
ST(0) = sv_2mortal(newRV_inc(myref));
/* XSRETURN(1); - implied */
void
cond_wait(SV *ref_cond, SV *ref_lock = 0)
PROTOTYPE: \[$@%];\[$@%]
PREINIT:
SV *ssv;
perl_cond* user_condition;
int locks;
user_lock *ul;
CODE:
if (!SvROK(ref_cond))
Perl_croak(aTHX_ "Argument to cond_wait needs to be passed as ref");
ref_cond = SvRV(ref_cond);
if (SvROK(ref_cond))
ref_cond = SvRV(ref_cond);
ssv = Perl_sharedsv_find(aTHX_ ref_cond);
if (! ssv)
Perl_croak(aTHX_ "cond_wait can only be used on shared values");
ul = S_get_userlock(aTHX_ ssv, 1);
user_condition = &ul->user_cond;
if (ref_lock && (ref_cond != ref_lock)) {
if (!SvROK(ref_lock))
Perl_croak(aTHX_ "cond_wait lock needs to be passed as ref");
ref_lock = SvRV(ref_lock);
if (SvROK(ref_lock)) ref_lock = SvRV(ref_lock);
ssv = Perl_sharedsv_find(aTHX_ ref_lock);
if (! ssv)
Perl_croak(aTHX_ "cond_wait lock must be a shared value");
ul = S_get_userlock(aTHX_ ssv, 1);
}
if (ul->lock.owner != aTHX)
croak("You need a lock before you can cond_wait");
/* Stealing the members of the lock object worries me - NI-S */
MUTEX_LOCK(&ul->lock.mutex);
ul->lock.owner = NULL;
locks = ul->lock.locks;
ul->lock.locks = 0;
/* Since we are releasing the lock here, we need to tell other
* people that it is ok to go ahead and use it */
COND_SIGNAL(&ul->lock.cond);
COND_WAIT(user_condition, &ul->lock.mutex);
while (ul->lock.owner != NULL) {
/* OK -- must reacquire the lock */
COND_WAIT(&ul->lock.cond, &ul->lock.mutex);
}
ul->lock.owner = aTHX;
ul->lock.locks = locks;
MUTEX_UNLOCK(&ul->lock.mutex);
int
cond_timedwait(SV *ref_cond, double abs, SV *ref_lock = 0)
PROTOTYPE: \[$@%]$;\[$@%]
PREINIT:
SV *ssv;
perl_cond* user_condition;
int locks;
user_lock *ul;
CODE:
if (! SvROK(ref_cond))
Perl_croak(aTHX_ "Argument to cond_timedwait needs to be passed as ref");
ref_cond = SvRV(ref_cond);
if (SvROK(ref_cond))
ref_cond = SvRV(ref_cond);
ssv = Perl_sharedsv_find(aTHX_ ref_cond);
if (! ssv)
Perl_croak(aTHX_ "cond_timedwait can only be used on shared values");
ul = S_get_userlock(aTHX_ ssv, 1);
user_condition = &ul->user_cond;
if (ref_lock && (ref_cond != ref_lock)) {
if (! SvROK(ref_lock))
Perl_croak(aTHX_ "cond_timedwait lock needs to be passed as ref");
ref_lock = SvRV(ref_lock);
if (SvROK(ref_lock)) ref_lock = SvRV(ref_lock);
ssv = Perl_sharedsv_find(aTHX_ ref_lock);
if (! ssv)
Perl_croak(aTHX_ "cond_timedwait lock must be a shared value");
ul = S_get_userlock(aTHX_ ssv, 1);
}
if (ul->lock.owner != aTHX)
Perl_croak(aTHX_ "You need a lock before you can cond_wait");
MUTEX_LOCK(&ul->lock.mutex);
ul->lock.owner = NULL;
locks = ul->lock.locks;
ul->lock.locks = 0;
/* Since we are releasing the lock here, we need to tell other
* people that it is ok to go ahead and use it */
COND_SIGNAL(&ul->lock.cond);
RETVAL = Perl_sharedsv_cond_timedwait(user_condition, &ul->lock.mutex, abs);
while (ul->lock.owner != NULL) {
/* OK -- must reacquire the lock... */
COND_WAIT(&ul->lock.cond, &ul->lock.mutex);
}
ul->lock.owner = aTHX;
ul->lock.locks = locks;
MUTEX_UNLOCK(&ul->lock.mutex);
if (RETVAL == 0)
XSRETURN_UNDEF;
OUTPUT:
RETVAL
void
cond_signal(SV *myref)
PROTOTYPE: \[$@%]
PREINIT:
SV *ssv;
user_lock *ul;
CODE:
if (! SvROK(myref))
Perl_croak(aTHX_ "Argument to cond_signal needs to be passed as ref");
myref = SvRV(myref);
if (SvROK(myref))
myref = SvRV(myref);
ssv = Perl_sharedsv_find(aTHX_ myref);
if (! ssv)
Perl_croak(aTHX_ "cond_signal can only be used on shared values");
ul = S_get_userlock(aTHX_ ssv, 1);
if (ckWARN(WARN_THREADS) && ul->lock.owner != aTHX) {
Perl_warner(aTHX_ packWARN(WARN_THREADS),
"cond_signal() called on unlocked variable");
}
COND_SIGNAL(&ul->user_cond);
void
cond_broadcast(SV *myref)
PROTOTYPE: \[$@%]
PREINIT:
SV *ssv;
user_lock *ul;
CODE:
if (! SvROK(myref))
Perl_croak(aTHX_ "Argument to cond_broadcast needs to be passed as ref");
myref = SvRV(myref);
if (SvROK(myref))
myref = SvRV(myref);
ssv = Perl_sharedsv_find(aTHX_ myref);
if (! ssv)
Perl_croak(aTHX_ "cond_broadcast can only be used on shared values");
ul = S_get_userlock(aTHX_ ssv, 1);
if (ckWARN(WARN_THREADS) && ul->lock.owner != aTHX) {
Perl_warner(aTHX_ packWARN(WARN_THREADS),
"cond_broadcast() called on unlocked variable");
}
COND_BROADCAST(&ul->user_cond);
void
bless(SV* myref, ...)
PROTOTYPE: $;$
PREINIT:
HV* stash;
SV *ssv;
CODE:
if (items == 1) {
stash = CopSTASH(PL_curcop);
} else {
SV* classname = ST(1);
STRLEN len;
char *ptr;
if (classname &&
! SvGMAGICAL(classname) &&
! SvAMAGIC(classname) &&
SvROK(classname))
{
Perl_croak(aTHX_ "Attempt to bless into a reference");
}
ptr = SvPV(classname, len);
if (ckWARN(WARN_MISC) && len == 0) {
Perl_warner(aTHX_ packWARN(WARN_MISC),
"Explicit blessing to '' (assuming package main)");
}
stash = gv_stashpvn(ptr, len, TRUE);
}
SvREFCNT_inc_void(myref);
(void)sv_bless(myref, stash);
ST(0) = sv_2mortal(myref);
ssv = Perl_sharedsv_find(aTHX_ myref);
if (ssv) {
dTHXc;
ENTER_LOCK;
SHARED_CONTEXT;
{
SV* fake_stash = newSVpv(HvNAME_get(stash), 0);
(void)sv_bless(ssv, (HV*)fake_stash);
}
CALLER_CONTEXT;
LEAVE_LOCK;
}
/* XSRETURN(1); - implied */
#endif /* USE_ITHREADS */
BOOT:
{
#ifdef USE_ITHREADS
Perl_sharedsv_init(aTHX);
#endif /* USE_ITHREADS */
}
|