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
|
/*
* Streamer.xs
*
* Code from Array::RefElem
* Copyright (c) 1997-2000 Graham Barr <gbarr@pobox.com>. All rights reserved.
* This program is free software; you can redistribute it and/or
* modify it under the same terms as Perl itself.
*
* Code From Scalar::Util
* Copyright 2000 Gisle Aas.
* This library is free software; you can redistribute it and/or
* modify it under the same terms as Perl itself.
* A good chunk of the XS is morphed or taken directly from this module.
* Thanks Gisle.
*
* alias_ref is from Lexical::Alias by Jeff Pinyan which
* was borrowed/modified from Devel::LexAlias by Richard Clamp
*
*
* Additional Code and Modifications
* Copyright 2003 Yves Orton.
* This library is free software; you can redistribute it and/or
* modify it under the same terms as Perl itself.
*
*/
#ifdef __cplusplus
extern "C" {
#endif
#include "EXTERN.h"
#include "perl.h"
#include "XSUB.h"
#include "ppport.h"
#ifdef __cplusplus
}
#endif
#ifndef PERL_VERSION
# include <patchlevel.h>
# if !(defined(PERL_VERSION) || (PERL_SUBVERSION > 0 && defined(PATCHLEVEL)))
# include <could_not_find_Perl_patchlevel.h>
# endif
# define PERL_REVISION 5
# define PERL_VERSION PATCHLEVEL
# define PERL_SUBVERSION PERL_SUBVERSION
#endif
#if PERL_VERSION < 8
# define PERL_MAGIC_qr 'r' /* precompiled qr// regex */
# define BFD_Svs_SMG_OR_RMG SVs_RMG
#elif ((PERL_VERSION==8) && (PERL_SUBVERSION >= 1) || (PERL_VERSION>8))
# define BFD_Svs_SMG_OR_RMG SVs_SMG
# define MY_PLACEHOLDER PL_sv_placeholder
#else
# define BFD_Svs_SMG_OR_RMG SVs_RMG
# define MY_PLACEHOLDER PL_sv_undef
#endif
#if (((PERL_VERSION == 9) && (PERL_SUBVERSION >= 4)) || (PERL_VERSION > 9))
# define NEW_REGEX_ENGINE 1
#endif
#if (((PERL_VERSION == 8) && (PERL_SUBVERSION >= 1)) || (PERL_VERSION > 8))
#define MY_CAN_FIND_PLACEHOLDERS
#define HAS_SV2OBJ
#endif
#ifdef SvWEAKREF
# ifndef PERL_MAGIC_backref
# define PERL_MAGIC_backref '<'
# endif
#define ADD_WEAK_REFCOUNT do { \
MAGIC *mg = NULL; \
if( SvMAGICAL(sv) \
&& (mg = mg_find(sv, PERL_MAGIC_backref) ) \
){ \
SV **svp = (SV**)mg->mg_obj; \
if (svp && *svp) { \
RETVAL += \
SvTYPE(*svp) == SVt_PVAV \
? av_len((AV*)*svp)+1 \
: 1; \
} \
} \
} while (0)
#else
#define ADD_WEAK_REFCOUNT
#endif
#if PERL_VERSION < 7
/* Not in 5.6.1. */
# define SvUOK(sv) SvIOK_UV(sv)
# ifdef cxinc
# undef cxinc
# endif
# define cxinc() my_cxinc(aTHX)
static I32
my_cxinc(pTHX)
{
cxstack_max = cxstack_max * 3 / 2;
Renew(cxstack, cxstack_max + 1, struct context); /* XXX should fix CXINC macro */
return cxstack_ix + 1;
}
#endif
#if PERL_VERSION < 6
# define NV double
#endif
#if PERL_VERSION < 8
# define MY_XS_AMAGIC
#endif
#if ((PERL_VERSION == 8) && (PERL_SUBVERSION <= 8))
# define MY_XS_AMAGIC
#endif
/*
the following three subs are outright stolen from Data::Dumper ( Dumper.xs )
from the 5.6.1 distribution of Perl. Probably Gurusamy Sarathy's work.
As is much of the code in _globname and globname
*/
/* does a string need to be protected? */
static I32
needs_q(register char *s)
{
TOP:
if (s[0] == ':') {
if (*++s) {
if (*s++ != ':')
return 1;
}
else
return 1;
}
if (isIDFIRST(*s)) {
while (*++s)
if (!isALNUM(*s)) {
if (*s == ':')
goto TOP;
else
return 1;
}
}
else
return 1;
return 0;
}
/* count the number of "'"s and "\"s in string */
static I32
num_q(register char *s, register STRLEN slen)
{
register I32 ret = 0;
while (slen > 0) {
if (*s == '\'' || *s == '\\')
++ret;
++s;
--slen;
}
return ret;
}
/* returns number of chars added to escape "'"s and "\"s in s */
/* slen number of characters in s will be escaped */
/* destination must be long enough for additional chars */
static I32
esc_q(register char *d, register char *s, register STRLEN slen)
{
register I32 ret = 0;
while (slen > 0) {
switch (*s) {
case '\'':
case '\\':
*d = '\\';
++d; ++ret;
default:
*d = *s;
++d; ++s; --slen;
break;
}
}
return ret;
}
XS(XS_Data__Dump__Streamer_SvREADONLY);
XS(XS_Data__Dump__Streamer_SvREADONLY) /* This is dangerous stuff. */
{
dXSARGS;
SV *sv = SvRV(ST(0));
if (items == 1) {
if (SvREADONLY(sv))
XSRETURN_YES;
else
XSRETURN_NO;
}
else if (items == 2) {
if (SvTRUE(ST(1))) {
SvREADONLY_on(sv);
XSRETURN_YES;
}
else {
/* I hope you really know what you are doing. */
SvREADONLY_off(sv);
XSRETURN_NO;
}
}
XSRETURN_UNDEF; /* Can't happen. */
}
XS(XS_Data__Dump__Streamer_SvREFCNT);
XS(XS_Data__Dump__Streamer_SvREFCNT) /* This is dangerous stuff. */
{
dXSARGS;
SV *sv = SvRV(ST(0));
if (items == 1)
XSRETURN_IV(SvREFCNT(sv) - 1); /* Minus the ref created for us. */
else if (items == 2) {
/* I hope you really know what you are doing. */
SvREFCNT(sv) = SvIV(ST(1));
XSRETURN_IV(SvREFCNT(sv));
}
XSRETURN_UNDEF; /* Can't happen. */
}
/* this is from B is perl 5.9.2 */
typedef SV *B__SV;
MODULE = B PACKAGE = B::SV
#ifndef HAS_SV2OBJ
#define object_2svref(sv) sv
#define SVREF SV *
SVREF
object_2svref(sv)
B::SV sv
#endif
MODULE = Data::Dump::Streamer PACKAGE = Data::Dump::Streamer
void
dualvar(num,str)
SV * num
SV * str
PROTOTYPE: $$
CODE:
{
STRLEN len;
char *ptr = SvPV(str,len);
ST(0) = sv_newmortal();
(void)SvUPGRADE(ST(0),SVt_PVNV);
sv_setpvn(ST(0),ptr,len);
if(SvNOK(num) || SvPOK(num) || SvMAGICAL(num)) {
SvNVX(ST(0)) = SvNV(num);
SvNOK_on(ST(0));
}
#ifdef SVf_IVisUV
else if (SvUOK(num)) {
SvUVX(ST(0)) = SvUV(num);
SvIOK_on(ST(0));
SvIsUV_on(ST(0));
}
#endif
else {
SvIVX(ST(0)) = SvIV(num);
SvIOK_on(ST(0));
}
if(PL_tainting && (SvTAINTED(num) || SvTAINTED(str)))
SvTAINTED_on(ST(0));
XSRETURN(1);
}
bool
_could_be_dualvar(sv)
SV * sv
PROTOTYPE: $
CODE:
{
RETVAL = ((SvNIOK(sv)) && (SvPOK(sv))) ? 1 : 0;
}
OUTPUT:
RETVAL
int
alias_av(avref, key, val)
SV* avref
I32 key
SV* val
PROTOTYPE: \@$$
PREINIT:
AV* av;
CODE:
{
if (!SvROK(avref) || SvTYPE(SvRV(avref)) != SVt_PVAV)
croak("First argument to alias_av() must be an array reference");
av = (AV*)SvRV(avref);
SvREFCNT_inc(val);
if (!av_store(av, key, val)) {
SvREFCNT_dec(val);
RETVAL=0;
} else {
RETVAL=1;
}
}
OUTPUT:
RETVAL
void
push_alias(avref, val)
SV* avref
SV* val
PROTOTYPE: \@$
PREINIT:
AV* av;
CODE:
if (!SvROK(avref) || SvTYPE(SvRV(avref)) != SVt_PVAV)
croak("First argument to push_alias() must be an array reference");
av = (AV*)SvRV(avref);
SvREFCNT_inc(val);
av_push(av, val);
int
alias_hv(hvref, key, val)
SV* hvref
SV* key
SV* val
PROTOTYPE: \%$$
PREINIT:
HV* hv;
CODE:
{
if (!SvROK(hvref) || SvTYPE(SvRV(hvref)) != SVt_PVHV)
croak("First argument to alias_hv() must be a hash reference");
hv = (HV*)SvRV(hvref);
SvREFCNT_inc(val);
if (!hv_store_ent(hv, key, val, 0)) {
SvREFCNT_dec(val);
RETVAL=0;
} else {
RETVAL=1;
}
}
OUTPUT:
RETVAL
char *
blessed(sv)
SV * sv
PROTOTYPE: $
CODE:
{
if (SvMAGICAL(sv))
mg_get(sv);
if(!sv_isobject(sv)) {
XSRETURN_UNDEF;
}
RETVAL = (char *)sv_reftype(SvRV(sv),TRUE);
}
OUTPUT:
RETVAL
UV
refaddr(sv)
SV * sv
PROTOTYPE: $
CODE:
{
if(!SvROK(sv)) {
RETVAL = 0;
} else {
RETVAL = PTR2UV(SvRV(sv));
}
}
OUTPUT:
RETVAL
void
weaken(sv)
SV *sv
PROTOTYPE: $
CODE:
#ifdef SvWEAKREF
sv_rvweaken(sv);
XSRETURN_YES;
#else
croak("weak references are not implemented in this release of perl");
#endif
void
isweak(sv)
SV *sv
PROTOTYPE: $
CODE:
#ifdef SvWEAKREF
ST(0) = boolSV(SvROK(sv) && SvWEAKREF(sv));
XSRETURN(1);
#else
XSRETURN_NO;
#endif
IV
weak_refcount(sv)
SV * sv
PROTOTYPE: $
CODE:
{
RETVAL=0;
ADD_WEAK_REFCOUNT;
}
OUTPUT:
RETVAL
IV
sv_refcount(sv)
SV * sv
PROTOTYPE: $
CODE:
{
RETVAL = SvREFCNT(sv);
ADD_WEAK_REFCOUNT;
}
OUTPUT:
RETVAL
IV
refcount(sv)
SV * sv
PROTOTYPE: $
CODE:
{
if(!SvROK(sv)) {
RETVAL=0;
} else {
sv = (SV*)SvRV(sv);
RETVAL = SvREFCNT(sv);
ADD_WEAK_REFCOUNT;
}
}
OUTPUT:
RETVAL
bool
is_numeric(sv)
SV * sv
PROTOTYPE: $
CODE:
{
RETVAL = (SvNIOK(sv)) ? 1 : 0;
}
OUTPUT:
RETVAL
int
_make_ro(sv)
SV *sv
PROTOTYPE: $
CODE:
RETVAL = SvREADONLY_on(sv);
OUTPUT:
RETVAL
SV *
make_ro(sv)
SV *sv
PROTOTYPE: $
CODE:
SvREADONLY_on(sv);
SvREFCNT_inc(sv);
RETVAL=sv;
OUTPUT:
RETVAL
int
readonly_set(sv,set)
SV *sv
SV *set
PROTOTYPE: $
CODE:
if (SvTRUE(set)) {
RETVAL = SvREADONLY_on(sv);
} else {
RETVAL = SvREADONLY_off(sv);
}
OUTPUT:
RETVAL
int
readonly(sv)
SV *sv
PROTOTYPE: $
CODE:
RETVAL = SvREADONLY(sv);
OUTPUT:
RETVAL
int
looks_like_number(sv)
SV *sv
PROTOTYPE: $
CODE:
RETVAL = looks_like_number(sv);
OUTPUT:
RETVAL
int
alias_ref (dst,src)
SV *dst
SV *src
CODE:
{
AV* padv = PL_comppad;
int dt, st;
int ok=0;
I32 i;
if (!SvROK(src) || !SvROK(dst))
croak("destination and source must be references");
dt = SvTYPE(SvRV(dst));
st = SvTYPE(SvRV(src));
if (!(dt < SVt_PVAV && st < SVt_PVAV || dt == st && dt <= SVt_PVHV))
croak("destination and source must be same type (%d != %d)",dt,st);
for (i = 0; i <= av_len(padv); ++i) {
SV** myvar_ptr = av_fetch(padv, i, 0);
if (myvar_ptr) {
if (SvRV(dst) == *myvar_ptr) {
av_store(padv, i, SvRV(src));
SvREFCNT_inc(SvRV(src));
ok=1;
}
}
}
if (!ok)
croak("Failed to created alias");
RETVAL = ok;
}
OUTPUT:
RETVAL
char *
reftype(sv)
SV * sv
PROTOTYPE: $
CODE:
{
if (SvMAGICAL(sv))
mg_get(sv);
if(!SvROK(sv)) {
XSRETURN_NO;
} else {
RETVAL = (char *)sv_reftype(SvRV(sv),FALSE);
}
}
OUTPUT:
RETVAL
char *
_globname(sv)
SV * sv
PROTOTYPE: $
CODE:
{
if (SvMAGICAL(sv))
mg_get(sv);
if(SvROK(sv)) {
XSRETURN_NO;
} else {
U32 realtype;
realtype = SvTYPE(sv);
if (realtype == SVt_PVGV) {
STRLEN i;
RETVAL = SvPV(sv, i);
} else {
XSRETURN_NO;
}
}
}
OUTPUT:
RETVAL
SV *
reftype_or_glob(sv)
SV * sv
PROTOTYPE: $
CODE:
{
if (SvMAGICAL(sv))
mg_get(sv);
if(SvROK(sv)) {
RETVAL = newSVpv(sv_reftype(SvRV(sv),FALSE),0);
} else {
U32 realtype;
realtype = SvTYPE(sv);
if (realtype == SVt_PVGV) {
char *c, *r;
STRLEN i;
/* SV *retval; */
RETVAL = newSVpvn("", 0);
/* RETVAL = SvPV(sv, i); */
c = SvPV(sv, i);
++c; --i; /* just get the name */
if (i >= 6 && strncmp(c, "main::", 6) == 0) {
c += 4;
i -= 4;
}
if (needs_q(c)) {
sv_grow(RETVAL, 6+2*i);
r = SvPVX(RETVAL);
r[0] = '*'; r[1] = '{'; r[2] = '\'';
/* i have a feeling this will cause problems with utf8 glob names */
i += esc_q(r+3, c, i);
i += 3;
r[i++] = '\''; r[i++] = '}';
r[i] = '\0';
}
else {
sv_grow(RETVAL, i+2);
r = SvPVX(RETVAL);
r[0] = '*'; strcpy(r+1, c);
i++;
}
SvCUR_set(RETVAL, i);
/*sv_2mortal(RETVAL);*/ /*causes an error*/
} else {
XSRETURN_NO;
}
}
}
OUTPUT:
RETVAL
SV *
refaddr_or_glob(sv)
SV * sv
PROTOTYPE: $
CODE:
{
if (SvMAGICAL(sv))
mg_get(sv);
if(SvROK(sv)) {
UV uv;
uv = PTR2UV(SvRV(sv));
RETVAL = newSVuv(uv);
} else {
U32 realtype;
realtype = SvTYPE(sv);
if (realtype == SVt_PVGV) {
char *c, *r;
STRLEN i;
/* SV *retval; */
RETVAL = newSVpvn("", 0);
/* RETVAL = SvPV(sv, i); */
c = SvPV(sv, i);
++c; --i; /* just get the name */
if (i >= 6 && strncmp(c, "main::", 6) == 0) {
c += 4;
i -= 4;
}
if (needs_q(c)) {
sv_grow(RETVAL, 6+2*i);
r = SvPVX(RETVAL);
r[0] = '*'; r[1] = '{'; r[2] = '\'';
i += esc_q(r+3, c, i);
i += 3;
r[i++] = '\''; r[i++] = '}';
r[i] = '\0';
}
else {
sv_grow(RETVAL, i+2);
r = SvPVX(RETVAL);
r[0] = '*'; strcpy(r+1, c);
i++;
}
SvCUR_set(RETVAL, i);
/*sv_2mortal(RETVAL);*/ /*causes an error*/
} else {
XSRETURN_NO;
}
}
}
OUTPUT:
RETVAL
SV *
globname(sv)
SV * sv
PROTOTYPE: $
CODE:
{
if (SvMAGICAL(sv))
mg_get(sv);
if(SvROK(sv)) {
XSRETURN_NO;
} else {
U32 realtype;
realtype = SvTYPE(sv);
if (realtype == SVt_PVGV) {
char *c, *r;
STRLEN i;
/* SV *retval; */
RETVAL = newSVpvn("", 0);
/* RETVAL = SvPV(sv, i); */
c = SvPV(sv, i);
++c; --i; /* just get the name */
if (i >= 6 && strncmp(c, "main::", 6) == 0) {
c += 4;
i -= 4;
}
if (needs_q(c)) {
sv_grow(RETVAL, 6+2*i);
r = SvPVX(RETVAL);
r[0] = '*'; r[1] = '{'; r[2] = '\'';
i += esc_q(r+3, c, i);
i += 3;
r[i++] = '\''; r[i++] = '}';
r[i] = '\0';
}
else {
sv_grow(RETVAL, i+2);
r = SvPVX(RETVAL);
r[0] = '*'; strcpy(r+1, c);
i++;
}
SvCUR_set(RETVAL, i);
/*sv_2mortal(RETVAL);*/ /*causes an error*/
} else {
XSRETURN_NO;
}
}
}
OUTPUT:
RETVAL
#ifdef MY_XS_AMAGIC
void
SvAMAGIC_off(sv)
SV * sv
PROTOTYPE: $
CODE:
SvAMAGIC_off(sv);
void
SvAMAGIC_on(sv,klass)
SV * sv
SV * klass
PROTOTYPE: $$
CODE:
SvAMAGIC_off(sv);
#endif
#ifndef NEW_REGEX_ENGINE
void
regex(sv)
SV * sv
PROTOTYPE: $
PREINIT:
STRLEN patlen;
char reflags[6];
int left;
PPCODE:
{
/*
Checks if a reference is a regex or not. If the parameter is
not a ref, or is not the result of a qr// then returns undef.
Otherwise in list context it returns the pattern and the
modifiers, in scalar context it returns the pattern just as it
would if the qr// was blessed into the package Regexp and
stringified normally.
*/
if (SvMAGICAL(sv)) { /* is this if needed??? Why?*/
mg_get(sv);
}
if(!SvROK(sv)) { /* bail if we dont have a ref. */
XSRETURN_UNDEF;
}
patlen=0;
left=0;
if (SvTHINKFIRST(sv))
{
sv = (SV*)SvRV(sv);
if (sv)
{
MAGIC *mg;
if (SvTYPE(sv)==SVt_PVMG)
{
if ( ((SvFLAGS(sv) &
(SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
== (SVs_OBJECT|BFD_Svs_SMG_OR_RMG))
&& (mg = mg_find(sv, PERL_MAGIC_qr)))
{
/* Housten, we have a regex! */
SV *pattern;
regexp *re = (regexp *)mg->mg_obj;
I32 gimme = GIMME_V;
if ( gimme == G_ARRAY ) {
/*
we are in list/array context so stringify
the modifiers that apply. We ignore "negative
modifiers" in this scenario. Also we dont cache
the modifiers. AFAICT there isnt anywhere for
them to go. :-(
*/
char *fptr = "msix";
char ch;
U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
while((ch = *fptr++)) {
if(reganch & 1) {
reflags[left++] = ch;
}
reganch >>= 1;
}
pattern = sv_2mortal(newSVpvn(re->precomp,re->prelen));
if (re->reganch & ROPT_UTF8) SvUTF8_on(pattern);
/* return the pattern and the modifiers */
XPUSHs(pattern);
XPUSHs(sv_2mortal(newSVpvn(reflags,left)));
XSRETURN(2);
} else {
/*
Non array/list context. So we build up the
stringified form just as PL_sv_2pv does,
and like it we also cache the result. The
entire content of the if() is directly taken
from PL_sv_2pv
*/
if (!mg->mg_ptr )
{
char *fptr = "msix";
char ch;
int right = 4;
char need_newline = 0;
U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
while((ch = *fptr++)) {
if(reganch & 1) {
reflags[left++] = ch;
}
else {
reflags[right--] = ch;
}
reganch >>= 1;
}
if(left != 4) {
reflags[left] = '-';
left = 5;
}
mg->mg_len = re->prelen + 4 + left;
/*
* If /x was used, we have to worry about a regex
* ending with a comment later being embedded
* within another regex. If so, we don't want this
* regex's "commentization" to leak out to the
* right part of the enclosing regex, we must cap
* it with a newline.
*
* So, if /x was used, we scan backwards from the
* end of the regex. If we find a '#' before we
* find a newline, we need to add a newline
* ourself. If we find a '\n' first (or if we
* don't find '#' or '\n'), we don't need to add
* anything. -jfriedl
*/
if (PMf_EXTENDED & re->reganch)
{
char *endptr = re->precomp + re->prelen;
while (endptr >= re->precomp)
{
char c = *(endptr--);
if (c == '\n')
break; /* don't need another */
if (c == '#') {
/* we end while in a comment, so we
need a newline */
mg->mg_len++; /* save space for it */
need_newline = 1; /* note to add it */
break;
}
}
}
/**/
New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
Copy("(?", mg->mg_ptr, 2, char);
Copy(reflags, mg->mg_ptr+2, left, char);
Copy(":", mg->mg_ptr+left+2, 1, char);
Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
if (need_newline)
mg->mg_ptr[mg->mg_len - 2] = '\n';
mg->mg_ptr[mg->mg_len - 1] = ')';
mg->mg_ptr[mg->mg_len] = 0;
}
/* return the pattern in (?msix:..) format */
pattern = sv_2mortal(newSVpvn(mg->mg_ptr,mg->mg_len));
if (re->reganch & ROPT_UTF8) SvUTF8_on(pattern);
XPUSHs(pattern);
XSRETURN(1);
}
}
}
}
}
/* 'twould appear it aint a regex, so return undef/empty list */
XSRETURN_UNDEF;
}
#endif
#ifdef MY_CAN_FIND_PLACEHOLDERS
void
all_keys(hash,keys,placeholder)
SV* hash
SV* keys
SV* placeholder
PROTOTYPE: \%\@\@
PREINIT:
AV* av_k;
AV* av_p;
HV* hv;
SV *key;
HE *he;
CODE:
if (!SvROK(hash) || SvTYPE(SvRV(hash)) != SVt_PVHV)
croak("First argument to all_keys() must be an HASH reference");
if (!SvROK(keys) || SvTYPE(SvRV(keys)) != SVt_PVAV)
croak("Second argument to all_keys() must be an ARRAY reference");
if (!SvROK(placeholder) || SvTYPE(SvRV(placeholder)) != SVt_PVAV)
croak("Third argument to all_keys() must be an ARRAY reference");
hv = (HV*)SvRV(hash);
av_k = (AV*)SvRV(keys);
av_p = (AV*)SvRV(placeholder);
av_clear(av_k);
av_clear(av_p);
(void)hv_iterinit(hv);
while((he = hv_iternext_flags(hv, HV_ITERNEXT_WANTPLACEHOLDERS))!= NULL) {
key=hv_iterkeysv(he);
if (HeVAL(he) == &MY_PLACEHOLDER) {
SvREFCNT_inc(key);
av_push(av_p, key);
} else {
SvREFCNT_inc(key);
av_push(av_k, key);
}
}
void
hidden_keys(hash)
SV* hash
PROTOTYPE: \%
PREINIT:
HV* hv;
SV *key;
HE *he;
PPCODE:
if (!SvROK(hash) || SvTYPE(SvRV(hash)) != SVt_PVHV)
croak("First argument to hidden_keys() must be an HASH reference");
hv = (HV*)SvRV(hash);
(void)hv_iterinit(hv);
while((he = hv_iternext_flags(hv, HV_ITERNEXT_WANTPLACEHOLDERS))!= NULL) {
key=hv_iterkeysv(he);
if (HeVAL(he) == &MY_PLACEHOLDER) {
XPUSHs( key );
}
}
void
legal_keys(hash)
SV* hash
PROTOTYPE: \%
PREINIT:
HV* hv;
SV *key;
HE *he;
PPCODE:
if (!SvROK(hash) || SvTYPE(SvRV(hash)) != SVt_PVHV)
croak("First argument to legal_keys() must be an HASH reference");
hv = (HV*)SvRV(hash);
(void)hv_iterinit(hv);
while((he = hv_iternext_flags(hv, HV_ITERNEXT_WANTPLACEHOLDERS))!= NULL) {
key=hv_iterkeysv(he);
XPUSHs( key );
}
#endif
BOOT:
newXSproto("Data::Dump::Streamer::SvREADONLY_ref", XS_Data__Dump__Streamer_SvREADONLY, file,"$;$");
newXSproto("Data::Dump::Streamer::SvREFCNT_ref", XS_Data__Dump__Streamer_SvREFCNT, file,"$;$");
|