-
Notifications
You must be signed in to change notification settings - Fork 554
/
doop.c
1269 lines (1106 loc) · 37.3 KB
/
doop.c
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
/* doop.c
*
* Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
* 2001, 2002, 2004, 2005, 2006, 2007, 2008, 2009 by Larry Wall and others
*
* You may distribute under the terms of either the GNU General Public
* License or the Artistic License, as specified in the README file.
*
*/
/*
* 'So that was the job I felt I had to do when I started,' thought Sam.
*
* [p.934 of _The Lord of the Rings_, VI/iii: "Mount Doom"]
*/
/* This file contains some common functions needed to carry out certain
* ops. For example, both pp_sprintf() and pp_prtf() call the function
* do_sprintf() found in this file.
*/
#include "EXTERN.h"
#define PERL_IN_DOOP_C
#include "perl.h"
#include "invlist_inline.h"
#include <signal.h>
/* Helper function for do_trans().
* Handles cases where the search and replacement charlists aren't UTF-8,
* aren't identical, and neither the /d nor /s flag is present.
*
* sv may or may not be utf8. Note that no code point above 255 can possibly
* be in the to-translate set
*/
STATIC Size_t
S_do_trans_simple(pTHX_ SV * const sv, const OPtrans_map * const tbl)
{
Size_t matches = 0;
STRLEN len;
U8 *s = (U8*)SvPV_nomg(sv,len);
U8 * const send = s+len;
PERL_ARGS_ASSERT_DO_TRANS_SIMPLE;
DEBUG_y(PerlIO_printf(Perl_debug_log, "%s: %d: entering do_trans_simple:"
" input sv:\n",
__FILE__, __LINE__));
DEBUG_y(sv_dump(sv));
/* First, take care of input strings where UTF8ness doesn't matter */
if ( ! SvUTF8(sv)
|| (PL_op->op_private & OPpTRANS_MASK) == OPpTRANS_ONLY_UTF8_INVARIANTS)
{
while (s < send) {
const short ch = tbl->map[*s];
if (ch >= 0) {
matches++;
*s = (U8)ch;
}
s++;
}
SvSETMAGIC(sv);
}
else {
const bool grows = (PL_op->op_private & OPpTRANS_MASK) == OPpTRANS_GROWS;
U8 *d;
U8 *dstart;
/* Allow for worst-case expansion: Each input byte can become 2. For a
* given input character, this happens when it occupies a single byte
* under UTF-8, but is to be translated to something that occupies two:
* $_="a".chr(400); tr/a/\xFE/, FE needs encoding. */
if (grows)
Newx(d, len*2+1, U8);
else
d = s;
dstart = d;
while (s < send) {
STRLEN ulen;
short ch;
/* Need to check this, otherwise 128..255 won't match */
const UV c = utf8n_to_uvchr(s, send - s, &ulen, UTF8_ALLOW_DEFAULT);
if (c < 0x100 && (ch = tbl->map[c]) >= 0) {
matches++;
d = uvchr_to_utf8(d, (UV)ch);
s += ulen;
}
else { /* No match -> copy */
Move(s, d, ulen, U8);
d += ulen;
s += ulen;
}
}
if (grows) {
sv_setpvn(sv, (char*)dstart, d - dstart);
Safefree(dstart);
}
else {
*d = '\0';
SvCUR_set(sv, d - dstart);
}
SvUTF8_on(sv);
SvSETMAGIC(sv);
}
DEBUG_y(PerlIO_printf(Perl_debug_log, "%s: %d: returning %zu\n",
__FILE__, __LINE__, matches));
DEBUG_y(sv_dump(sv));
return matches;
}
/* Helper function for do_trans().
* Handles cases where the search and replacement charlists are identical and
* non-utf8: so the string isn't modified, and only a count of modifiable
* chars is needed.
*
* Note that it doesn't handle /d or /s, since these modify the string even if
* the replacement list is empty.
*
* sv may or may not be utf8. Note that no code point above 255 can possibly
* be in the to-translate set
*/
STATIC Size_t
S_do_trans_count(pTHX_ SV * const sv, const OPtrans_map * const tbl)
{
STRLEN len;
const U8 *s = (const U8*)SvPV_nomg_const(sv, len);
const U8 * const send = s + len;
Size_t matches = 0;
PERL_ARGS_ASSERT_DO_TRANS_COUNT;
DEBUG_y(PerlIO_printf(Perl_debug_log, "%s: %d: entering do_trans_count:"
" input sv:\n",
__FILE__, __LINE__));
DEBUG_y(sv_dump(sv));
if (!SvUTF8(sv)) {
while (s < send) {
if (tbl->map[*s++] >= 0)
matches++;
}
}
else {
const bool complement = cBOOL(PL_op->op_private & OPpTRANS_COMPLEMENT);
while (s < send) {
STRLEN ulen;
const UV c = utf8n_to_uvchr(s, send - s, &ulen, UTF8_ALLOW_DEFAULT);
if (c < 0x100) {
if (tbl->map[c] >= 0)
matches++;
} else if (complement)
matches++;
s += ulen;
}
}
DEBUG_y(PerlIO_printf(Perl_debug_log, "%s: %d: count returning %zu\n",
__FILE__, __LINE__, matches));
return matches;
}
/* Helper function for do_trans().
* Handles cases where the search and replacement charlists aren't identical
* and both are non-utf8, and one or both of /d, /s is specified.
*
* sv may or may not be utf8. Note that no code point above 255 can possibly
* be in the to-translate set
*/
STATIC Size_t
S_do_trans_complex(pTHX_ SV * const sv, const OPtrans_map * const tbl)
{
STRLEN len;
U8 *s = (U8*)SvPV_nomg(sv, len);
U8 * const send = s+len;
Size_t matches = 0;
const bool complement = cBOOL(PL_op->op_private & OPpTRANS_COMPLEMENT);
PERL_ARGS_ASSERT_DO_TRANS_COMPLEX;
DEBUG_y(PerlIO_printf(Perl_debug_log, "%s: %d: entering do_trans_complex:"
" input sv:\n",
__FILE__, __LINE__));
DEBUG_y(sv_dump(sv));
if ( ! SvUTF8(sv)
|| (PL_op->op_private & OPpTRANS_MASK) == OPpTRANS_ONLY_UTF8_INVARIANTS)
{
U8 *d = s;
U8 * const dstart = d;
if (PL_op->op_private & OPpTRANS_SQUASH) {
/* What the mapping of the previous character was to. If the new
* character has the same mapping, it is squashed from the output
* (but still is included in the count) */
short previous_map = (short) TR_OOB;
while (s < send) {
const short this_map = tbl->map[*s];
if (this_map >= 0) {
matches++;
if (this_map != previous_map) {
*d++ = (U8)this_map;
previous_map = this_map;
}
}
else {
if (this_map == (short) TR_UNMAPPED) {
*d++ = *s;
previous_map = (short) TR_OOB;
}
else {
assert(this_map == (short) TR_DELETE);
matches++;
}
}
s++;
}
}
else { /* Not to squash */
while (s < send) {
const short this_map = tbl->map[*s];
if (this_map >= 0) {
matches++;
*d++ = (U8)this_map;
}
else if (this_map == (short) TR_UNMAPPED)
*d++ = *s;
else if (this_map == (short) TR_DELETE)
matches++;
s++;
}
}
*d = '\0';
SvCUR_set(sv, d - dstart);
}
else { /* is utf8 */
const bool squash = cBOOL(PL_op->op_private & OPpTRANS_SQUASH);
const bool grows = (PL_op->op_private & OPpTRANS_MASK) == OPpTRANS_GROWS;
U8 *d;
U8 *dstart;
Size_t size = tbl->size;
/* What the mapping of the previous character was to. If the new
* character has the same mapping, it is squashed from the output (but
* still is included in the count) */
UV pch = TR_OOB;
if (grows)
/* Allow for worst-case expansion: Each input byte can become 2.
* For a given input character, this happens when it occupies a
* single byte under UTF-8, but is to be translated to something
* that occupies two: */
Newx(d, len*2+1, U8);
else
d = s;
dstart = d;
while (s < send) {
STRLEN len;
const UV comp = utf8n_to_uvchr(s, send - s, &len,
UTF8_ALLOW_DEFAULT);
UV ch;
short sch;
sch = (comp < size)
? tbl->map[comp]
: (! complement)
? (short) TR_UNMAPPED
: tbl->map[size];
if (sch >= 0) {
ch = (UV)sch;
replace:
matches++;
if (LIKELY(!squash || ch != pch)) {
d = uvchr_to_utf8(d, ch);
pch = ch;
}
s += len;
continue;
}
else if (sch == (short) TR_UNMAPPED) {
Move(s, d, len, U8);
d += len;
pch = TR_OOB;
}
else if (sch == (short) TR_DELETE)
matches++;
else {
assert(sch == (short) TR_R_EMPTY); /* empty replacement */
ch = comp;
goto replace;
}
s += len;
}
if (grows) {
sv_setpvn(sv, (char*)dstart, d - dstart);
Safefree(dstart);
}
else {
*d = '\0';
SvCUR_set(sv, d - dstart);
}
SvUTF8_on(sv);
}
SvSETMAGIC(sv);
DEBUG_y(PerlIO_printf(Perl_debug_log, "%s: %d: returning %zu\n",
__FILE__, __LINE__, matches));
DEBUG_y(sv_dump(sv));
return matches;
}
/* Helper function for do_trans().
* Handles cases where an inversion map implementation is to be used and the
* search and replacement charlists are identical: so the string isn't
* modified, and only a count of modifiable chars is needed.
*
* Note that it doesn't handle /d nor /s, since these modify the string
* even if the replacement charlist is empty.
*
* sv may or may not be utf8.
*/
STATIC Size_t
S_do_trans_count_invmap(pTHX_ SV * const sv, AV * const invmap)
{
U8 *s;
U8 *send;
Size_t matches = 0;
STRLEN len;
SV** const from_invlist_ptr = av_fetch(invmap, 0, TRUE);
SV** const to_invmap_ptr = av_fetch(invmap, 1, TRUE);
SV* from_invlist = *from_invlist_ptr;
SV* to_invmap_sv = *to_invmap_ptr;
UV* map = (UV *) SvPVX(to_invmap_sv);
PERL_ARGS_ASSERT_DO_TRANS_COUNT_INVMAP;
DEBUG_y(PerlIO_printf(Perl_debug_log, "%s: %d:"
"entering do_trans_count_invmap:"
" input sv:\n",
__FILE__, __LINE__));
DEBUG_y(sv_dump(sv));
DEBUG_y(PerlIO_printf(Perl_debug_log, "mapping:\n"));
DEBUG_y(invmap_dump(from_invlist, (UV *) SvPVX(to_invmap_sv)));
s = (U8*)SvPV_nomg(sv, len);
send = s + len;
while (s < send) {
UV from;
SSize_t i;
STRLEN s_len;
/* Get the code point of the next character in the string */
if (! SvUTF8(sv) || UTF8_IS_INVARIANT(*s)) {
from = *s;
s_len = 1;
}
else {
from = utf8_to_uvchr_buf(s, send, &s_len);
if (from == 0 && *s != '\0') {
_force_out_malformed_utf8_message(s, send, 0, MALFORMED_UTF8_DIE);
}
}
/* Look the code point up in the data structure for this tr/// to get
* what it maps to */
i = _invlist_search(from_invlist, from);
assert(i >= 0);
if (map[i] != (UV) TR_UNLISTED) {
matches++;
}
s += s_len;
}
DEBUG_y(PerlIO_printf(Perl_debug_log, "%s: %d: returning %zu\n",
__FILE__, __LINE__, matches));
return matches;
}
/* Helper function for do_trans().
* Handles cases where an inversion map implementation is to be used and the
* search and replacement charlists are either not identical or flags are
* present.
*
* sv may or may not be utf8.
*/
STATIC Size_t
S_do_trans_invmap(pTHX_ SV * const sv, AV * const invmap)
{
U8 *s;
U8 *send;
U8 *d;
U8 *s0;
U8 *d0;
Size_t matches = 0;
STRLEN len;
SV** const from_invlist_ptr = av_fetch(invmap, 0, TRUE);
SV** const to_invmap_ptr = av_fetch(invmap, 1, TRUE);
SV** const to_expansion_ptr = av_fetch(invmap, 2, TRUE);
NV max_expansion = SvNV(*to_expansion_ptr);
SV* from_invlist = *from_invlist_ptr;
SV* to_invmap_sv = *to_invmap_ptr;
UV* map = (UV *) SvPVX(to_invmap_sv);
UV previous_map = TR_OOB;
const bool squash = cBOOL(PL_op->op_private & OPpTRANS_SQUASH);
const bool delete_unfound = cBOOL(PL_op->op_private & OPpTRANS_DELETE);
bool inplace = (PL_op->op_private & OPpTRANS_MASK) != OPpTRANS_GROWS;
const UV* from_array = invlist_array(from_invlist);
UV final_map = TR_OOB;
bool out_is_utf8 = cBOOL(SvUTF8(sv));
STRLEN s_len;
PERL_ARGS_ASSERT_DO_TRANS_INVMAP;
/* A third element in the array indicates that the replacement list was
* shorter than the search list, and this element contains the value to use
* for the items that don't correspond */
if (av_top_index(invmap) >= 3) {
SV** const final_map_ptr = av_fetch(invmap, 3, TRUE);
SV* const final_map_sv = *final_map_ptr;
final_map = SvUV(final_map_sv);
}
/* If there is something in the transliteration that could force the input
* to be changed to UTF-8, we don't know if we can do it in place, so
* assume cannot */
if ( ! out_is_utf8
&& (PL_op->op_private & OPpTRANS_MASK) == OPpTRANS_CAN_FORCE_UTF8)
{
inplace = FALSE;
}
s = (U8*)SvPV_nomg(sv, len);
DEBUG_y(PerlIO_printf(Perl_debug_log, "%s: %d: entering do_trans_invmap:"
" input sv:\n",
__FILE__, __LINE__));
DEBUG_y(sv_dump(sv));
DEBUG_y(PerlIO_printf(Perl_debug_log, "mapping:\n"));
DEBUG_y(invmap_dump(from_invlist, map));
send = s + len;
s0 = s;
/* We know by now if there are some possible input strings whose
* transliterations are longer than the input. If none can, we just edit
* in place. */
if (inplace) {
d0 = d = s;
}
else {
/* Here, we can't edit in place. We have no idea how much, if any,
* this particular input string will grow. However, the compilation
* calculated the maximum expansion possible. Use that to allocate
* based on the worst case scenario. (First +1 is to round up; 2nd is
* for \0) */
Newx(d, (STRLEN) (len * max_expansion + 1 + 1), U8);
d0 = d;
}
restart:
/* Do the actual transliteration */
while (s < send) {
UV from;
UV to;
SSize_t i;
STRLEN s_len;
/* Get the code point of the next character in the string */
if (! SvUTF8(sv) || UTF8_IS_INVARIANT(*s)) {
from = *s;
s_len = 1;
}
else {
from = utf8_to_uvchr_buf(s, send, &s_len);
if (from == 0 && *s != '\0') {
_force_out_malformed_utf8_message(s, send, 0, MALFORMED_UTF8_DIE);
}
}
/* Look the code point up in the data structure for this tr/// to get
* what it maps to */
i = _invlist_search(from_invlist, from);
assert(i >= 0);
to = map[i];
if (to == (UV) TR_UNLISTED) { /* Just copy the unreplaced character */
if (UVCHR_IS_INVARIANT(from) || ! out_is_utf8) {
*d++ = (U8) from;
}
else if (SvUTF8(sv)) {
Move(s, d, s_len, U8);
d += s_len;
}
else { /* Convert to UTF-8 */
append_utf8_from_native_byte(*s, &d);
}
previous_map = to;
s += s_len;
continue;
}
/* Everything else is counted as a match */
matches++;
if (to == (UV) TR_SPECIAL_HANDLING) {
if (delete_unfound) {
s += s_len;
continue;
}
/* Use the final character in the replacement list */
to = final_map;
}
else { /* Here the input code point is to be remapped. The actual
value is offset from the base of this entry */
to += from - from_array[i];
}
/* If copying all occurrences, or this is the first occurrence, copy it
* to the output */
if (! squash || to != previous_map) {
if (out_is_utf8) {
d = uvchr_to_utf8(d, to);
}
else {
if (to >= 256) { /* If need to convert to UTF-8, restart */
out_is_utf8 = TRUE;
s = s0;
d = d0;
matches = 0;
goto restart;
}
*d++ = (U8) to;
}
}
previous_map = to;
s += s_len;
}
s_len = 0;
s += s_len;
if (! inplace) {
sv_setpvn(sv, (char*)d0, d - d0);
Safefree(d0);
}
else {
*d = '\0';
SvCUR_set(sv, d - d0);
}
if (! SvUTF8(sv) && out_is_utf8) {
SvUTF8_on(sv);
}
SvSETMAGIC(sv);
DEBUG_y(PerlIO_printf(Perl_debug_log, "%s: %d: returning %zu\n",
__FILE__, __LINE__, matches));
DEBUG_y(sv_dump(sv));
return matches;
}
/* Execute a tr//. sv is the value to be translated, while PL_op
* should be an OP_TRANS or OP_TRANSR op, whose op_pv field contains a
* translation table or whose op_sv field contains an inversion map.
*
* Returns a count of number of characters translated
*/
Size_t
Perl_do_trans(pTHX_ SV *sv)
{
STRLEN len;
const U8 flags = PL_op->op_private;
bool use_utf8_fcns = cBOOL(flags & OPpTRANS_USE_SVOP);
bool identical = cBOOL(flags & OPpTRANS_IDENTICAL);
PERL_ARGS_ASSERT_DO_TRANS;
if (SvREADONLY(sv) && ! identical) {
Perl_croak_no_modify();
}
(void)SvPV_const(sv, len);
if (!len)
return 0;
if (! identical) {
if (!SvPOKp(sv) || SvTHINKFIRST(sv))
(void)SvPV_force_nomg(sv, len);
(void)SvPOK_only_UTF8(sv);
}
if (use_utf8_fcns) {
SV* const map =
#ifdef USE_ITHREADS
PAD_SVl(cPADOP->op_padix);
#else
MUTABLE_SV(cSVOP->op_sv);
#endif
if (identical) {
return do_trans_count_invmap(sv, (AV *) map);
}
else {
return do_trans_invmap(sv, (AV *) map);
}
}
else {
const OPtrans_map * const map = (OPtrans_map*)cPVOP->op_pv;
if (identical) {
return do_trans_count(sv, map);
}
else if (flags & (OPpTRANS_SQUASH|OPpTRANS_DELETE|OPpTRANS_COMPLEMENT)) {
return do_trans_complex(sv, map);
}
else
return do_trans_simple(sv, map);
}
}
#ifdef DEBUGGING
/* make it small to exercise the logic */
# define JOIN_DELIM_BUFSIZE 2
#else
# define JOIN_DELIM_BUFSIZE 40
#endif
/*
=for apidoc_section $string
=for apidoc do_join
This performs a Perl L<C<join>|perlfunc/join>, placing the joined output
into C<sv>.
The elements to join are in SVs, stored in a C array of pointers to SVs, from
C<**mark> to S<C<**sp - 1>>. Hence C<*mark> is a reference to the first SV.
Each SV will be coerced into a PV if not one already.
C<delim> contains the string (or coerced into a string) that is to separate
each of the joined elements.
If any component is in UTF-8, the result will be as well, and all non-UTF-8
components will be converted to UTF-8 as necessary.
Magic and tainting are handled.
=cut
*/
void
Perl_do_join(pTHX_ SV *sv, SV *delim, SV **mark, SV **sp)
{
PERL_ARGS_ASSERT_DO_JOIN;
SV ** const oldmark = mark;
SSize_t items = sp - mark;
STRLEN len;
STRLEN delimlen;
const char * delimpv = SvPV_const(delim, delimlen);
char delim_buf[JOIN_DELIM_BUFSIZE];
bool delim_do_utf8 = DO_UTF8(delim);
if (items >= 2) {
/* Make a copy of the delim, since G or A magic may modify the delim SV.
Use a local buffer if possible to avoid the cost of allocation and
clean up.
*/
if (delimlen <= JOIN_DELIM_BUFSIZE) {
Copy(delimpv, delim_buf, delimlen, char);
delimpv = delim_buf;
}
else {
delimpv = savepvn(delimpv, delimlen);
SAVEFREEPV(delimpv);
}
}
mark++;
len = (items > 0 ? (delimlen * (items - 1) ) : 0);
SvUPGRADE(sv, SVt_PV);
if (SvLEN(sv) < len + items) { /* current length is way too short */
while (items-- > 0) {
if (*mark && !SvGAMAGIC(*mark) && SvOK(*mark)) {
STRLEN tmplen;
SvPV_const(*mark, tmplen);
len += tmplen;
}
mark++;
}
SvGROW(sv, len + 1); /* so try to pre-extend */
mark = oldmark;
items = sp - mark;
++mark;
}
SvPVCLEAR(sv);
/* sv_setpv retains old UTF8ness [perl #24846] */
SvUTF8_off(sv);
if (TAINTING_get && SvMAGICAL(sv))
SvTAINTED_off(sv);
if (items-- > 0) {
if (*mark)
sv_catsv(sv, *mark);
mark++;
}
if (delimlen) {
const U32 delimflag = delim_do_utf8 ? SV_CATUTF8 : SV_CATBYTES;
for (; items > 0; items--,mark++) {
STRLEN len;
const char *s;
sv_catpvn_flags(sv, delimpv, delimlen, delimflag);
s = SvPV_const(*mark,len);
sv_catpvn_flags(sv,s,len,
DO_UTF8(*mark) ? SV_CATUTF8 : SV_CATBYTES);
}
}
else {
for (; items > 0; items--,mark++)
{
STRLEN len;
const char *s = SvPV_const(*mark,len);
sv_catpvn_flags(sv,s,len,
DO_UTF8(*mark) ? SV_CATUTF8 : SV_CATBYTES);
}
}
SvSETMAGIC(sv);
}
/*
=for apidoc_section $string
=for apidoc do_sprintf
This performs a Perl L<C<sprintf>|perlfunc/sprintf> placing the string output
into C<sv>.
The elements to format are in SVs, stored in a C array of pointers to SVs of
length C<len>> and beginning at C<**sarg>. The element referenced by C<*sarg>
is the format.
Magic and tainting are handled.
=cut
*/
void
Perl_do_sprintf(pTHX_ SV *sv, SSize_t len, SV **sarg)
{
STRLEN patlen;
const char * const pat = SvPV_const(*sarg, patlen);
bool do_taint = FALSE;
PERL_ARGS_ASSERT_DO_SPRINTF;
assert(len >= 1);
if (SvTAINTED(*sarg))
TAINT_PROPER(
(PL_op && PL_op->op_type < OP_max)
? (PL_op->op_type == OP_PRTF)
? "printf"
: PL_op_name[PL_op->op_type]
: "(unknown)"
);
SvUTF8_off(sv);
if (DO_UTF8(*sarg))
SvUTF8_on(sv);
sv_vsetpvfn(sv, pat, patlen, NULL, sarg + 1, (Size_t)(len - 1), &do_taint);
SvSETMAGIC(sv);
if (do_taint)
SvTAINTED_on(sv);
}
UV
Perl_do_vecget(pTHX_ SV *sv, STRLEN offset, int size)
{
STRLEN srclen;
const I32 svpv_flags = ((PL_op->op_flags & OPf_MOD || LVRET)
? SV_UNDEF_RETURNS_NULL : 0);
unsigned char *s = (unsigned char *)
SvPV_flags(sv, srclen, (svpv_flags|SV_GMAGIC));
UV retnum = 0;
if (!s) {
s = (unsigned char *)"";
}
PERL_ARGS_ASSERT_DO_VECGET;
if (size < 1 || ! isPOWER_OF_2(size))
Perl_croak(aTHX_ "Illegal number of bits in vec");
if (SvUTF8(sv)) {
if (Perl_sv_utf8_downgrade_flags(aTHX_ sv, TRUE, 0)) {
/* PVX may have changed */
s = (unsigned char *) SvPV_flags(sv, srclen, svpv_flags);
}
else {
Perl_croak(aTHX_ "Use of strings with code points over 0xFF"
" as arguments to vec is forbidden");
}
}
if (size <= 8) {
STRLEN bitoffs = ((offset % 8) * size) % 8;
STRLEN uoffset = offset / (8 / size);
if (uoffset >= srclen)
return 0;
retnum = (s[uoffset] >> bitoffs) & nBIT_MASK(size);
}
else {
int n = size / 8; /* required number of bytes */
SSize_t uoffset;
#ifdef UV_IS_QUAD
if (size == 64) {
Perl_ck_warner(aTHX_ packWARN(WARN_PORTABLE),
"Bit vector size > 32 non-portable");
}
#endif
if (offset > Size_t_MAX / n - 1) /* would overflow */
return 0;
uoffset = offset * n;
/* Switch on the number of bytes available, but no more than the number
* required */
switch (MIN(n, (SSize_t) srclen - uoffset)) {
#ifdef UV_IS_QUAD
case 8:
retnum += ((UV) s[uoffset + 7]);
/* FALLTHROUGH */
case 7:
retnum += ((UV) s[uoffset + 6] << 8); /* = size - 56 */
/* FALLTHROUGH */
case 6:
retnum += ((UV) s[uoffset + 5] << 16); /* = size - 48 */
/* FALLTHROUGH */
case 5:
retnum += ((UV) s[uoffset + 4] << 24); /* = size - 40 */
#endif
/* FALLTHROUGH */
case 4:
retnum += ((UV) s[uoffset + 3] << (size - 32));
/* FALLTHROUGH */
case 3:
retnum += ((UV) s[uoffset + 2] << (size - 24));
/* FALLTHROUGH */
case 2:
retnum += ((UV) s[uoffset + 1] << (size - 16));
/* FALLTHROUGH */
case 1:
retnum += ((UV) s[uoffset ] << (size - 8));
break;
default:
return 0;
}
}
return retnum;
}
/* currently converts input to bytes if possible but doesn't sweat failures,
* although it does ensure that the string it clobbers is not marked as
* utf8-valid any more
*/
void
Perl_do_vecset(pTHX_ SV *sv)
{
STRLEN offset, bitoffs = 0;
int size;
unsigned char *s;
UV lval;
I32 mask;
STRLEN targlen;
STRLEN len;
SV * const targ = LvTARG(sv);
char errflags = LvFLAGS(sv);
PERL_ARGS_ASSERT_DO_VECSET;
/* some out-of-range errors have been deferred if/until the LV is
* actually written to: f(vec($s,-1,8)) is not always fatal */
if (errflags) {
assert(!(errflags & ~(LVf_NEG_OFF|LVf_OUT_OF_RANGE)));
if (errflags & LVf_NEG_OFF)
Perl_croak_nocontext("Negative offset to vec in lvalue context");
Perl_croak_nocontext("Out of memory during vec in lvalue context");
}
if (!targ)
return;
s = (unsigned char*)SvPV_force_flags(targ, targlen,
SV_GMAGIC | SV_UNDEF_RETURNS_NULL);
if (SvUTF8(targ)) {
/* This is handled by the SvPOK_only below...
if (!Perl_sv_utf8_downgrade_flags(aTHX_ targ, TRUE, 0))
SvUTF8_off(targ);
*/
(void) Perl_sv_utf8_downgrade_flags(aTHX_ targ, TRUE, 0);
}
(void)SvPOK_only(targ);
lval = SvUV(sv);
offset = LvTARGOFF(sv);
size = LvTARGLEN(sv);
if (size < 1 || (size & (size-1))) /* size < 1 or not a power of two */
Perl_croak(aTHX_ "Illegal number of bits in vec");
if (size < 8) {
bitoffs = ((offset%8)*size)%8;
offset /= 8/size;
}
else if (size > 8) {
int n = size/8;
if (offset > Size_t_MAX / n - 1) /* would overflow */
Perl_croak_nocontext("Out of memory during vec in lvalue context");
offset *= n;
}
len = (bitoffs + size + 7)/8; /* required number of bytes */
if (targlen < offset || targlen - offset < len) {
STRLEN newlen = offset > Size_t_MAX - len - 1 ? /* avoid overflow */
Size_t_MAX : offset + len + 1;
s = (unsigned char*)SvGROW(targ, newlen);
(void)memzero((char *)(s + targlen), newlen - targlen);
SvCUR_set(targ, newlen - 1);
}
if (size < 8) {
mask = nBIT_MASK(size);
lval &= mask;
s[offset] &= ~(mask << bitoffs);
s[offset] |= lval << bitoffs;
}
else switch (size) {
#ifdef UV_IS_QUAD
case 64:
Perl_ck_warner(aTHX_ packWARN(WARN_PORTABLE),
"Bit vector size > 32 non-portable");
s[offset+7] = (U8)( lval ); /* = size - 64 */
s[offset+6] = (U8)( lval >> 8); /* = size - 56 */
s[offset+5] = (U8)( lval >> 16); /* = size - 48 */
s[offset+4] = (U8)( lval >> 24); /* = size - 40 */
#endif
/* FALLTHROUGH */
case 32:
s[offset+3] = (U8)( lval >> (size - 32));
s[offset+2] = (U8)( lval >> (size - 24));
/* FALLTHROUGH */
case 16:
s[offset+1] = (U8)( lval >> (size - 16));
/* FALLTHROUGH */
case 8:
s[offset ] = (U8)( lval >> (size - 8));
}
SvSETMAGIC(targ);
}
void
Perl_do_vop(pTHX_ I32 optype, SV *sv, SV *left, SV *right)
{
long *dl;
long *ll;
long *rl;
char *dc;
STRLEN leftlen;
STRLEN rightlen;