3 * Copyright (c) 1991-1997, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "I wonder what the Entish is for 'yes' and 'no'," he thought.
18 /* Use an overridden DBL_DIG */
22 # define DBL_DIG OVR_DBL_DIG
24 /* The following is all to get DBL_DIG, in order to pick a nice
25 default value for printing floating point numbers in Gconvert.
35 #define DBL_DIG 15 /* A guess that works lots of places */
40 #define FCALL this->*f
41 #define VTBL this->*vtbl
43 #else /* !PERL_OBJECT */
45 static IV asIV _((SV* sv));
46 static UV asUV _((SV* sv));
47 static SV *more_sv _((void));
48 static void more_xiv _((void));
49 static void more_xnv _((void));
50 static void more_xpv _((void));
51 static void more_xrv _((void));
52 static XPVIV *new_xiv _((void));
53 static XPVNV *new_xnv _((void));
54 static XPV *new_xpv _((void));
55 static XRV *new_xrv _((void));
56 static void del_xiv _((XPVIV* p));
57 static void del_xnv _((XPVNV* p));
58 static void del_xpv _((XPV* p));
59 static void del_xrv _((XRV* p));
60 static void sv_mortalgrow _((void));
61 static void sv_unglob _((SV* sv));
62 static void sv_check_thinkfirst _((SV *sv));
65 static void *my_safemalloc(MEM_SIZE size);
68 typedef void (*SVFUNC) _((SV*));
72 #endif /* PERL_OBJECT */
74 #define SV_CHECK_THINKFIRST(sv) if (SvTHINKFIRST(sv)) sv_check_thinkfirst(sv)
81 (p) = (SV*)safemalloc(sizeof(SV)); \
90 Safefree((char*)(p)); \
95 static I32 registry_size;
97 #define REGHASH(sv,size) ((((U32)(sv)) >> 2) % (size))
99 #define REG_REPLACE(sv,a,b) \
101 void* p = sv->sv_any; \
102 I32 h = REGHASH(sv, registry_size); \
104 while (registry[i] != (a)) { \
105 if (++i >= registry_size) \
108 die("SV registry bug"); \
113 #define REG_ADD(sv) REG_REPLACE(sv,Nullsv,sv)
114 #define REG_REMOVE(sv) REG_REPLACE(sv,sv,Nullsv)
120 if (PL_sv_count >= (registry_size >> 1))
122 SV **oldreg = registry;
123 I32 oldsize = registry_size;
125 registry_size = registry_size ? ((registry_size << 2) + 1) : 2037;
126 Newz(707, registry, registry_size, SV*);
131 for (i = 0; i < oldsize; ++i) {
132 SV* oldsv = oldreg[i];
158 for (i = 0; i < registry_size; ++i) {
159 SV* sv = registry[i];
160 if (sv && SvTYPE(sv) != SVTYPEMASK)
166 sv_add_arena(ptr, size, flags)
171 if (!(flags & SVf_FAKE))
178 * "A time to plant, and a time to uproot what was planted..."
181 #define plant_SV(p) \
183 SvANY(p) = (void *)PL_sv_root; \
184 SvFLAGS(p) = SVTYPEMASK; \
189 /* sv_mutex must be held while calling uproot_SV() */
190 #define uproot_SV(p) \
193 PL_sv_root = (SV*)SvANY(p); \
197 #define new_SV(p) do { \
208 #define del_SV(p) do { \
210 if (PL_debug & 32768) \
220 if (PL_debug & 32768) {
225 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
227 svend = &sva[SvREFCNT(sva)];
228 if (p >= sv && p < svend)
232 warn("Attempt to free non-arena SV: 0x%lx", (unsigned long)p);
239 #else /* ! DEBUGGING */
241 #define del_SV(p) plant_SV(p)
243 #endif /* DEBUGGING */
246 sv_add_arena(char *ptr, U32 size, U32 flags)
251 Zero(sva, size, char);
253 /* The first SV in an arena isn't an SV. */
254 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
255 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
256 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
258 PL_sv_arenaroot = sva;
259 PL_sv_root = sva + 1;
261 svend = &sva[SvREFCNT(sva) - 1];
264 SvANY(sv) = (void *)(SV*)(sv + 1);
265 SvFLAGS(sv) = SVTYPEMASK;
269 SvFLAGS(sv) = SVTYPEMASK;
272 /* sv_mutex must be held while calling more_sv() */
279 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
280 PL_nice_chunk = Nullch;
283 char *chunk; /* must use New here to match call to */
284 New(704,chunk,1008,char); /* Safefree() in sv_free_arenas() */
285 sv_add_arena(chunk, 1008, 0);
298 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
299 svend = &sva[SvREFCNT(sva)];
300 for (sv = sva + 1; sv < svend; ++sv) {
301 if (SvTYPE(sv) != SVTYPEMASK)
310 do_report_used(SV *sv)
312 if (SvTYPE(sv) != SVTYPEMASK) {
313 /* XXX Perhaps this ought to go to Perl_debug_log, if DEBUGGING. */
314 PerlIO_printf(PerlIO_stderr(), "****\n");
322 visit(FUNC_NAME_TO_PTR(do_report_used));
326 do_clean_objs(SV *sv)
330 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
331 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv));)
337 /* XXX Might want to check arrays, etc. */
340 #ifndef DISABLE_DESTRUCTOR_KLUDGE
342 do_clean_named_objs(SV *sv)
344 if (SvTYPE(sv) == SVt_PVGV) {
345 if ( SvOBJECT(GvSV(sv)) ||
346 GvAV(sv) && SvOBJECT(GvAV(sv)) ||
347 GvHV(sv) && SvOBJECT(GvHV(sv)) ||
348 GvIO(sv) && SvOBJECT(GvIO(sv)) ||
349 GvCV(sv) && SvOBJECT(GvCV(sv)) )
351 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv));)
361 PL_in_clean_objs = TRUE;
362 visit(FUNC_NAME_TO_PTR(do_clean_objs));
363 #ifndef DISABLE_DESTRUCTOR_KLUDGE
364 /* some barnacles may yet remain, clinging to typeglobs */
365 visit(FUNC_NAME_TO_PTR(do_clean_named_objs));
367 PL_in_clean_objs = FALSE;
373 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%lx\n", sv) );)
374 SvFLAGS(sv) |= SVf_BREAK;
381 PL_in_clean_all = TRUE;
382 visit(FUNC_NAME_TO_PTR(do_clean_all));
383 PL_in_clean_all = FALSE;
392 /* Free arenas here, but be careful about fake ones. (We assume
393 contiguity of the fake ones with the corresponding real ones.) */
395 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
396 svanext = (SV*) SvANY(sva);
397 while (svanext && SvFAKE(svanext))
398 svanext = (SV*) SvANY(svanext);
401 Safefree((void *)sva);
405 Safefree(PL_nice_chunk);
406 PL_nice_chunk = Nullch;
407 PL_nice_chunk_size = 0;
421 * See comment in more_xiv() -- RAM.
423 PL_xiv_root = *(IV**)xiv;
425 return (XPVIV*)((char*)xiv - STRUCT_OFFSET(XPVIV, xiv_iv));
431 IV* xiv = (IV*)((char*)(p) + STRUCT_OFFSET(XPVIV, xiv_iv));
433 *(IV**)xiv = PL_xiv_root;
444 New(705, ptr, 1008/sizeof(XPV), XPV);
445 ptr->xpv_pv = (char*)PL_xiv_arenaroot; /* linked list of xiv arenas */
446 PL_xiv_arenaroot = ptr; /* to keep Purify happy */
449 xivend = &xiv[1008 / sizeof(IV) - 1];
450 xiv += (sizeof(XPV) - 1) / sizeof(IV) + 1; /* fudge by size of XPV */
452 while (xiv < xivend) {
453 *(IV**)xiv = (IV *)(xiv + 1);
467 PL_xnv_root = *(double**)xnv;
469 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
475 double* xnv = (double*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
477 *(double**)xnv = PL_xnv_root;
485 register double* xnv;
486 register double* xnvend;
487 New(711, xnv, 1008/sizeof(double), double);
488 xnvend = &xnv[1008 / sizeof(double) - 1];
489 xnv += (sizeof(XPVIV) - 1) / sizeof(double) + 1; /* fudge by sizeof XPVIV */
491 while (xnv < xnvend) {
492 *(double**)xnv = (double*)(xnv + 1);
506 PL_xrv_root = (XRV*)xrv->xrv_rv;
515 p->xrv_rv = (SV*)PL_xrv_root;
524 register XRV* xrvend;
525 New(712, PL_xrv_root, 1008/sizeof(XRV), XRV);
527 xrvend = &xrv[1008 / sizeof(XRV) - 1];
528 while (xrv < xrvend) {
529 xrv->xrv_rv = (SV*)(xrv + 1);
543 PL_xpv_root = (XPV*)xpv->xpv_pv;
552 p->xpv_pv = (char*)PL_xpv_root;
561 register XPV* xpvend;
562 New(713, PL_xpv_root, 1008/sizeof(XPV), XPV);
564 xpvend = &xpv[1008 / sizeof(XPV) - 1];
565 while (xpv < xpvend) {
566 xpv->xpv_pv = (char*)(xpv + 1);
573 #define new_XIV() (void*)safemalloc(sizeof(XPVIV))
574 #define del_XIV(p) Safefree((char*)p)
576 #define new_XIV() (void*)new_xiv()
577 #define del_XIV(p) del_xiv((XPVIV*) p)
581 #define new_XNV() (void*)safemalloc(sizeof(XPVNV))
582 #define del_XNV(p) Safefree((char*)p)
584 #define new_XNV() (void*)new_xnv()
585 #define del_XNV(p) del_xnv((XPVNV*) p)
589 #define new_XRV() (void*)safemalloc(sizeof(XRV))
590 #define del_XRV(p) Safefree((char*)p)
592 #define new_XRV() (void*)new_xrv()
593 #define del_XRV(p) del_xrv((XRV*) p)
597 #define new_XPV() (void*)safemalloc(sizeof(XPV))
598 #define del_XPV(p) Safefree((char*)p)
600 #define new_XPV() (void*)new_xpv()
601 #define del_XPV(p) del_xpv((XPV *)p)
605 # define my_safemalloc(s) safemalloc(s)
606 # define my_safefree(s) safefree(s)
609 my_safemalloc(MEM_SIZE size)
612 New(717, p, size, char);
615 # define my_safefree(s) Safefree(s)
618 #define new_XPVIV() (void*)my_safemalloc(sizeof(XPVIV))
619 #define del_XPVIV(p) my_safefree((char*)p)
621 #define new_XPVNV() (void*)my_safemalloc(sizeof(XPVNV))
622 #define del_XPVNV(p) my_safefree((char*)p)
624 #define new_XPVMG() (void*)my_safemalloc(sizeof(XPVMG))
625 #define del_XPVMG(p) my_safefree((char*)p)
627 #define new_XPVLV() (void*)my_safemalloc(sizeof(XPVLV))
628 #define del_XPVLV(p) my_safefree((char*)p)
630 #define new_XPVAV() (void*)my_safemalloc(sizeof(XPVAV))
631 #define del_XPVAV(p) my_safefree((char*)p)
633 #define new_XPVHV() (void*)my_safemalloc(sizeof(XPVHV))
634 #define del_XPVHV(p) my_safefree((char*)p)
636 #define new_XPVCV() (void*)my_safemalloc(sizeof(XPVCV))
637 #define del_XPVCV(p) my_safefree((char*)p)
639 #define new_XPVGV() (void*)my_safemalloc(sizeof(XPVGV))
640 #define del_XPVGV(p) my_safefree((char*)p)
642 #define new_XPVBM() (void*)my_safemalloc(sizeof(XPVBM))
643 #define del_XPVBM(p) my_safefree((char*)p)
645 #define new_XPVFM() (void*)my_safemalloc(sizeof(XPVFM))
646 #define del_XPVFM(p) my_safefree((char*)p)
648 #define new_XPVIO() (void*)my_safemalloc(sizeof(XPVIO))
649 #define del_XPVIO(p) my_safefree((char*)p)
652 sv_upgrade(register SV *sv, U32 mt)
662 if (SvTYPE(sv) == mt)
668 switch (SvTYPE(sv)) {
683 nv = (double)SvIVX(sv);
689 else if (mt < SVt_PVIV)
706 pv = (char*)SvRV(sv);
710 nv = (double)(unsigned long)pv;
726 else if (mt == SVt_NV)
737 del_XPVIV(SvANY(sv));
747 del_XPVNV(SvANY(sv));
757 del_XPVMG(SvANY(sv));
760 croak("Can't upgrade that kind of scalar");
765 croak("Can't upgrade to undef");
767 SvANY(sv) = new_XIV();
771 SvANY(sv) = new_XNV();
775 SvANY(sv) = new_XRV();
779 SvANY(sv) = new_XPV();
785 SvANY(sv) = new_XPVIV();
795 SvANY(sv) = new_XPVNV();
803 SvANY(sv) = new_XPVMG();
813 SvANY(sv) = new_XPVLV();
827 SvANY(sv) = new_XPVAV();
842 SvANY(sv) = new_XPVHV();
858 SvANY(sv) = new_XPVCV();
859 Zero(SvANY(sv), 1, XPVCV);
869 SvANY(sv) = new_XPVGV();
884 SvANY(sv) = new_XPVBM();
897 SvANY(sv) = new_XPVFM();
898 Zero(SvANY(sv), 1, XPVFM);
908 SvANY(sv) = new_XPVIO();
909 Zero(SvANY(sv), 1, XPVIO);
920 SvFLAGS(sv) &= ~SVTYPEMASK;
926 sv_backoff(register SV *sv)
931 SvLEN(sv) += SvIVX(sv);
932 SvPVX(sv) -= SvIVX(sv);
934 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
936 SvFLAGS(sv) &= ~SVf_OOK;
941 sv_grow(register SV *sv, register STRLEN newlen)
946 if (newlen >= 0x10000) {
947 PerlIO_printf(Perl_debug_log, "Allocation too large: %lx\n", newlen);
950 #endif /* HAS_64K_LIMIT */
953 if (SvTYPE(sv) < SVt_PV) {
954 sv_upgrade(sv, SVt_PV);
957 else if (SvOOK(sv)) { /* pv is offset? */
960 if (newlen > SvLEN(sv))
961 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
963 if (newlen >= 0x10000)
969 if (newlen > SvLEN(sv)) { /* need more room? */
970 if (SvLEN(sv) && s) {
971 #if defined(MYMALLOC) && !defined(PURIFY) && !defined(LEAKTEST)
972 STRLEN l = malloced_size((void*)SvPVX(sv));
978 Renew(s,newlen,char);
981 New(703,s,newlen,char);
983 SvLEN_set(sv, newlen);
989 sv_setiv(register SV *sv, IV i)
991 SV_CHECK_THINKFIRST(sv);
992 switch (SvTYPE(sv)) {
994 sv_upgrade(sv, SVt_IV);
997 sv_upgrade(sv, SVt_PVNV);
1001 sv_upgrade(sv, SVt_PVIV);
1017 croak("Can't coerce %s to integer in %s", sv_reftype(sv,0),
1018 PL_op_desc[PL_op->op_type]);
1021 (void)SvIOK_only(sv); /* validate number */
1027 sv_setiv_mg(register SV *sv, IV i)
1034 sv_setuv(register SV *sv, UV u)
1039 sv_setnv(sv, (double)u);
1043 sv_setuv_mg(register SV *sv, UV u)
1050 sv_setnv(register SV *sv, double num)
1052 SV_CHECK_THINKFIRST(sv);
1053 switch (SvTYPE(sv)) {
1056 sv_upgrade(sv, SVt_NV);
1061 sv_upgrade(sv, SVt_PVNV);
1077 croak("Can't coerce %s to number in %s", sv_reftype(sv,0),
1078 PL_op_name[PL_op->op_type]);
1082 (void)SvNOK_only(sv); /* validate number */
1087 sv_setnv_mg(register SV *sv, double num)
1094 not_a_number(SV *sv)
1100 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1101 /* each *s can expand to 4 chars + "...\0",
1102 i.e. need room for 8 chars */
1104 for (s = SvPVX(sv); *s && d < limit; s++) {
1106 if (ch & 128 && !isPRINT_LC(ch)) {
1115 else if (ch == '\r') {
1119 else if (ch == '\f') {
1123 else if (ch == '\\') {
1127 else if (isPRINT_LC(ch))
1142 warner(WARN_NUMERIC, "Argument \"%s\" isn't numeric in %s", tmpbuf,
1143 PL_op_name[PL_op->op_type]);
1145 warner(WARN_NUMERIC, "Argument \"%s\" isn't numeric", tmpbuf);
1149 sv_2iv(register SV *sv)
1153 if (SvGMAGICAL(sv)) {
1158 if (SvNVX(sv) < 0.0)
1159 return I_V(SvNVX(sv));
1161 return (IV) U_V(SvNVX(sv));
1163 if (SvPOKp(sv) && SvLEN(sv))
1166 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1168 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
1169 warner(WARN_UNINITIALIZED, PL_warn_uninit);
1174 if (SvTHINKFIRST(sv)) {
1177 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv, numer)))
1178 return SvIV(tmpstr);
1179 return (IV)SvRV(sv);
1181 if (SvREADONLY(sv)) {
1183 if (SvNVX(sv) < 0.0)
1184 return I_V(SvNVX(sv));
1186 return (IV) U_V(SvNVX(sv));
1188 if (SvPOKp(sv) && SvLEN(sv))
1192 if (ckWARN(WARN_UNINITIALIZED))
1193 warner(WARN_UNINITIALIZED, PL_warn_uninit);
1198 switch (SvTYPE(sv)) {
1200 sv_upgrade(sv, SVt_IV);
1203 sv_upgrade(sv, SVt_PVIV);
1206 sv_upgrade(sv, SVt_PVNV);
1211 if (SvNVX(sv) < 0.0)
1212 SvIVX(sv) = I_V(SvNVX(sv));
1214 SvUVX(sv) = U_V(SvNVX(sv));
1216 else if (SvPOKp(sv) && SvLEN(sv)) {
1218 SvIVX(sv) = asIV(sv);
1222 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
1223 warner(WARN_UNINITIALIZED, PL_warn_uninit);
1226 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%lx 2iv(%ld)\n",
1227 (unsigned long)sv,(long)SvIVX(sv)));
1232 sv_2uv(register SV *sv)
1236 if (SvGMAGICAL(sv)) {
1241 return U_V(SvNVX(sv));
1242 if (SvPOKp(sv) && SvLEN(sv))
1245 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1247 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
1248 warner(WARN_UNINITIALIZED, PL_warn_uninit);
1253 if (SvTHINKFIRST(sv)) {
1256 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv, numer)))
1257 return SvUV(tmpstr);
1258 return (UV)SvRV(sv);
1260 if (SvREADONLY(sv)) {
1262 return U_V(SvNVX(sv));
1264 if (SvPOKp(sv) && SvLEN(sv))
1268 if (ckWARN(WARN_UNINITIALIZED))
1269 warner(WARN_UNINITIALIZED, PL_warn_uninit);
1274 switch (SvTYPE(sv)) {
1276 sv_upgrade(sv, SVt_IV);
1279 sv_upgrade(sv, SVt_PVIV);
1282 sv_upgrade(sv, SVt_PVNV);
1287 SvUVX(sv) = U_V(SvNVX(sv));
1289 else if (SvPOKp(sv) && SvLEN(sv)) {
1291 SvUVX(sv) = asUV(sv);
1294 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1296 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
1297 warner(WARN_UNINITIALIZED, PL_warn_uninit);
1301 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%lx 2uv(%lu)\n",
1302 (unsigned long)sv,SvUVX(sv)));
1307 sv_2nv(register SV *sv)
1311 if (SvGMAGICAL(sv)) {
1315 if (SvPOKp(sv) && SvLEN(sv)) {
1317 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !looks_like_number(sv))
1319 SET_NUMERIC_STANDARD();
1320 return atof(SvPVX(sv));
1323 return (double)SvIVX(sv);
1325 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1327 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
1328 warner(WARN_UNINITIALIZED, PL_warn_uninit);
1333 if (SvTHINKFIRST(sv)) {
1336 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)))
1337 return SvNV(tmpstr);
1338 return (double)(unsigned long)SvRV(sv);
1340 if (SvREADONLY(sv)) {
1342 if (SvPOKp(sv) && SvLEN(sv)) {
1343 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !looks_like_number(sv))
1345 SET_NUMERIC_STANDARD();
1346 return atof(SvPVX(sv));
1349 return (double)SvIVX(sv);
1350 if (ckWARN(WARN_UNINITIALIZED))
1351 warner(WARN_UNINITIALIZED, PL_warn_uninit);
1355 if (SvTYPE(sv) < SVt_NV) {
1356 if (SvTYPE(sv) == SVt_IV)
1357 sv_upgrade(sv, SVt_PVNV);
1359 sv_upgrade(sv, SVt_NV);
1360 DEBUG_c(SET_NUMERIC_STANDARD());
1361 DEBUG_c(PerlIO_printf(Perl_debug_log,
1362 "0x%lx num(%g)\n",(unsigned long)sv,SvNVX(sv)));
1364 else if (SvTYPE(sv) < SVt_PVNV)
1365 sv_upgrade(sv, SVt_PVNV);
1367 (!SvPOKp(sv) || !strchr(SvPVX(sv),'.') || !looks_like_number(sv)))
1369 SvNVX(sv) = (double)SvIVX(sv);
1371 else if (SvPOKp(sv) && SvLEN(sv)) {
1373 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !looks_like_number(sv))
1375 SET_NUMERIC_STANDARD();
1376 SvNVX(sv) = atof(SvPVX(sv));
1380 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
1381 warner(WARN_UNINITIALIZED, PL_warn_uninit);
1385 DEBUG_c(SET_NUMERIC_STANDARD());
1386 DEBUG_c(PerlIO_printf(Perl_debug_log,
1387 "0x%lx 2nv(%g)\n",(unsigned long)sv,SvNVX(sv)));
1394 I32 numtype = looks_like_number(sv);
1398 return atol(SvPVX(sv));
1401 if (ckWARN(WARN_NUMERIC))
1404 SET_NUMERIC_STANDARD();
1405 d = atof(SvPVX(sv));
1415 I32 numtype = looks_like_number(sv);
1419 return strtoul(SvPVX(sv), Null(char**), 10);
1423 if (ckWARN(WARN_NUMERIC))
1426 SET_NUMERIC_STANDARD();
1427 return U_V(atof(SvPVX(sv)));
1431 looks_like_number(SV *sv)
1434 register char *send;
1435 register char *sbegin;
1443 else if (SvPOKp(sv))
1444 sbegin = SvPV(sv, len);
1447 send = sbegin + len;
1452 if (*s == '+' || *s == '-')
1455 /* next must be digit or '.' */
1459 } while (isDIGIT(*s));
1462 while (isDIGIT(*s)) /* optional digits after "." */
1466 else if (*s == '.') {
1468 /* no digits before '.' means we need digits after it */
1472 } while (isDIGIT(*s));
1481 * we return 1 if the number can be converted to _integer_ with atol()
1482 * and 2 if you need (int)atof().
1486 /* we can have an optional exponent part */
1487 if (*s == 'e' || *s == 'E') {
1490 if (*s == '+' || *s == '-')
1495 } while (isDIGIT(*s));
1504 if (len == 10 && memEQ(sbegin, "0 but true", 10))
1510 sv_2pv_nolen(register SV *sv)
1513 return sv_2pv(sv, &n_a);
1517 sv_2pv(register SV *sv, STRLEN *lp)
1522 char tmpbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
1528 if (SvGMAGICAL(sv)) {
1535 (void)sprintf(tmpbuf,"%ld",(long)SvIVX(sv));
1540 SET_NUMERIC_STANDARD();
1541 Gconvert(SvNVX(sv), DBL_DIG, 0, tmpbuf);
1546 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1548 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
1549 warner(WARN_UNINITIALIZED, PL_warn_uninit);
1555 if (SvTHINKFIRST(sv)) {
1558 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)))
1559 return SvPV(tmpstr,*lp);
1566 switch (SvTYPE(sv)) {
1568 if ( ((SvFLAGS(sv) &
1569 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
1570 == (SVs_OBJECT|SVs_RMG))
1571 && strEQ(s=HvNAME(SvSTASH(sv)), "Regexp")
1572 && (mg = mg_find(sv, 'r'))) {
1574 regexp *re = (regexp *)mg->mg_obj;
1577 char *fptr = "msix";
1582 U16 reganch = (re->reganch & PMf_COMPILETIME) >> 12;
1584 while(ch = *fptr++) {
1586 reflags[left++] = ch;
1589 reflags[right--] = ch;
1594 reflags[left] = '-';
1598 mg->mg_len = re->prelen + 4 + left;
1599 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
1600 Copy("(?", mg->mg_ptr, 2, char);
1601 Copy(reflags, mg->mg_ptr+2, left, char);
1602 Copy(":", mg->mg_ptr+left+2, 1, char);
1603 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
1604 mg->mg_ptr[mg->mg_len - 1] = ')';
1605 mg->mg_ptr[mg->mg_len] = 0;
1607 PL_reginterp_cnt += re->program[0].next_off;
1619 case SVt_PVBM: s = "SCALAR"; break;
1620 case SVt_PVLV: s = "LVALUE"; break;
1621 case SVt_PVAV: s = "ARRAY"; break;
1622 case SVt_PVHV: s = "HASH"; break;
1623 case SVt_PVCV: s = "CODE"; break;
1624 case SVt_PVGV: s = "GLOB"; break;
1625 case SVt_PVFM: s = "FORMAT"; break;
1626 case SVt_PVIO: s = "IO"; break;
1627 default: s = "UNKNOWN"; break;
1631 sv_setpvf(tsv, "%s=%s", HvNAME(SvSTASH(sv)), s);
1634 sv_catpvf(tsv, "(0x%lx)", (unsigned long)sv);
1640 if (SvREADONLY(sv)) {
1642 SET_NUMERIC_STANDARD();
1643 Gconvert(SvNVX(sv), DBL_DIG, 0, tmpbuf);
1648 (void)sprintf(tmpbuf,"%ld",(long)SvIVX(sv));
1654 if (ckWARN(WARN_UNINITIALIZED))
1655 warner(WARN_UNINITIALIZED, PL_warn_uninit);
1661 (void)SvUPGRADE(sv, SVt_PV);
1663 if (SvTYPE(sv) < SVt_PVNV)
1664 sv_upgrade(sv, SVt_PVNV);
1667 olderrno = errno; /* some Xenix systems wipe out errno here */
1669 if (SvNVX(sv) == 0.0)
1670 (void)strcpy(s,"0");
1674 SET_NUMERIC_STANDARD();
1675 Gconvert(SvNVX(sv), DBL_DIG, 0, s);
1678 #ifdef FIXNEGATIVEZERO
1679 if (*s == '-' && s[1] == '0' && !s[2])
1688 else if (SvIOKp(sv)) {
1689 U32 oldIOK = SvIOK(sv);
1690 if (SvTYPE(sv) < SVt_PVIV)
1691 sv_upgrade(sv, SVt_PVIV);
1692 olderrno = errno; /* some Xenix systems wipe out errno here */
1693 sv_setpviv(sv, SvIVX(sv));
1703 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
1704 warner(WARN_UNINITIALIZED, PL_warn_uninit);
1708 *lp = s - SvPVX(sv);
1711 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%lx 2pv(%s)\n",(unsigned long)sv,SvPVX(sv)));
1715 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
1716 /* Sneaky stuff here */
1720 tsv = newSVpv(tmpbuf, 0);
1736 len = strlen(tmpbuf);
1738 #ifdef FIXNEGATIVEZERO
1739 if (len == 2 && t[0] == '-' && t[1] == '0') {
1744 (void)SvUPGRADE(sv, SVt_PV);
1746 s = SvGROW(sv, len + 1);
1754 /* This function is only called on magical items */
1756 sv_2bool(register SV *sv)
1766 if (SvAMAGIC(sv) && (tmpsv = AMG_CALLun(sv,bool_)))
1767 return SvTRUE(tmpsv);
1768 return SvRV(sv) != 0;
1771 register XPV* Xpvtmp;
1772 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
1773 (*Xpvtmp->xpv_pv > '0' ||
1774 Xpvtmp->xpv_cur > 1 ||
1775 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
1782 return SvIVX(sv) != 0;
1785 return SvNVX(sv) != 0.0;
1792 /* Note: sv_setsv() should not be called with a source string that needs
1793 * to be reused, since it may destroy the source string if it is marked
1798 sv_setsv(SV *dstr, register SV *sstr)
1801 register U32 sflags;
1807 SV_CHECK_THINKFIRST(dstr);
1809 sstr = &PL_sv_undef;
1810 stype = SvTYPE(sstr);
1811 dtype = SvTYPE(dstr);
1813 if (dtype == SVt_PVGV && (SvFLAGS(dstr) & SVf_FAKE)) {
1814 sv_unglob(dstr); /* so fake GLOB won't perpetuate */
1815 sv_setpvn(dstr, "", 0);
1816 (void)SvPOK_only(dstr);
1817 dtype = SvTYPE(dstr);
1822 /* There's a lot of redundancy below but we're going for speed here */
1827 if (dtype != SVt_PVGV) {
1828 (void)SvOK_off(dstr);
1836 sv_upgrade(dstr, SVt_IV);
1839 sv_upgrade(dstr, SVt_PVNV);
1843 sv_upgrade(dstr, SVt_PVIV);
1846 (void)SvIOK_only(dstr);
1847 SvIVX(dstr) = SvIVX(sstr);
1858 sv_upgrade(dstr, SVt_NV);
1863 sv_upgrade(dstr, SVt_PVNV);
1866 SvNVX(dstr) = SvNVX(sstr);
1867 (void)SvNOK_only(dstr);
1875 sv_upgrade(dstr, SVt_RV);
1876 else if (dtype == SVt_PVGV &&
1877 SvTYPE(SvRV(sstr)) == SVt_PVGV) {
1880 if (PL_curcop->cop_stash != GvSTASH(dstr))
1881 GvIMPORTED_on(dstr);
1891 sv_upgrade(dstr, SVt_PV);
1894 if (dtype < SVt_PVIV)
1895 sv_upgrade(dstr, SVt_PVIV);
1898 if (dtype < SVt_PVNV)
1899 sv_upgrade(dstr, SVt_PVNV);
1906 croak("Bizarre copy of %s in %s", sv_reftype(sstr, 0),
1907 PL_op_name[PL_op->op_type]);
1909 croak("Bizarre copy of %s", sv_reftype(sstr, 0));
1913 if (dtype <= SVt_PVGV) {
1915 if (dtype != SVt_PVGV) {
1916 char *name = GvNAME(sstr);
1917 STRLEN len = GvNAMELEN(sstr);
1918 sv_upgrade(dstr, SVt_PVGV);
1919 sv_magic(dstr, dstr, '*', name, len);
1920 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
1921 GvNAME(dstr) = savepvn(name, len);
1922 GvNAMELEN(dstr) = len;
1923 SvFAKE_on(dstr); /* can coerce to non-glob */
1925 /* ahem, death to those who redefine active sort subs */
1926 else if (PL_curstackinfo->si_type == PERLSI_SORT
1927 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
1928 croak("Can't redefine active sort subroutine %s",
1930 (void)SvOK_off(dstr);
1931 GvINTRO_off(dstr); /* one-shot flag */
1933 GvGP(dstr) = gp_ref(GvGP(sstr));
1935 if (PL_curcop->cop_stash != GvSTASH(dstr))
1936 GvIMPORTED_on(dstr);
1943 if (SvGMAGICAL(sstr)) {
1945 if (SvTYPE(sstr) != stype) {
1946 stype = SvTYPE(sstr);
1947 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
1951 if (stype == SVt_PVLV)
1952 SvUPGRADE(dstr, SVt_PVNV);
1954 SvUPGRADE(dstr, stype);
1957 sflags = SvFLAGS(sstr);
1959 if (sflags & SVf_ROK) {
1960 if (dtype >= SVt_PV) {
1961 if (dtype == SVt_PVGV) {
1962 SV *sref = SvREFCNT_inc(SvRV(sstr));
1964 int intro = GvINTRO(dstr);
1968 GvGP(dstr)->gp_refcnt--;
1969 GvINTRO_off(dstr); /* one-shot flag */
1970 Newz(602,gp, 1, GP);
1971 GvGP(dstr) = gp_ref(gp);
1972 GvSV(dstr) = NEWSV(72,0);
1973 GvLINE(dstr) = PL_curcop->cop_line;
1974 GvEGV(dstr) = (GV*)dstr;
1977 switch (SvTYPE(sref)) {
1980 SAVESPTR(GvAV(dstr));
1982 dref = (SV*)GvAV(dstr);
1983 GvAV(dstr) = (AV*)sref;
1984 if (PL_curcop->cop_stash != GvSTASH(dstr))
1985 GvIMPORTED_AV_on(dstr);
1989 SAVESPTR(GvHV(dstr));
1991 dref = (SV*)GvHV(dstr);
1992 GvHV(dstr) = (HV*)sref;
1993 if (PL_curcop->cop_stash != GvSTASH(dstr))
1994 GvIMPORTED_HV_on(dstr);
1998 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
1999 SvREFCNT_dec(GvCV(dstr));
2000 GvCV(dstr) = Nullcv;
2001 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
2002 PL_sub_generation++;
2004 SAVESPTR(GvCV(dstr));
2007 dref = (SV*)GvCV(dstr);
2008 if (GvCV(dstr) != (CV*)sref) {
2009 CV* cv = GvCV(dstr);
2011 if (!GvCVGEN((GV*)dstr) &&
2012 (CvROOT(cv) || CvXSUB(cv)))
2014 SV *const_sv = cv_const_sv(cv);
2015 bool const_changed = TRUE;
2017 const_changed = sv_cmp(const_sv,
2018 op_const_sv(CvSTART((CV*)sref),
2020 /* ahem, death to those who redefine
2021 * active sort subs */
2022 if (PL_curstackinfo->si_type == PERLSI_SORT &&
2023 PL_sortcop == CvSTART(cv))
2025 "Can't redefine active sort subroutine %s",
2026 GvENAME((GV*)dstr));
2027 if (ckWARN(WARN_REDEFINE) || (const_changed && const_sv)) {
2028 if (!(CvGV(cv) && GvSTASH(CvGV(cv))
2029 && HvNAME(GvSTASH(CvGV(cv)))
2030 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
2032 warner(WARN_REDEFINE, const_sv ?
2033 "Constant subroutine %s redefined"
2034 : "Subroutine %s redefined",
2035 GvENAME((GV*)dstr));
2038 cv_ckproto(cv, (GV*)dstr,
2039 SvPOK(sref) ? SvPVX(sref) : Nullch);
2041 GvCV(dstr) = (CV*)sref;
2042 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
2043 GvASSUMECV_on(dstr);
2044 PL_sub_generation++;
2046 if (PL_curcop->cop_stash != GvSTASH(dstr))
2047 GvIMPORTED_CV_on(dstr);
2051 SAVESPTR(GvIOp(dstr));
2053 dref = (SV*)GvIOp(dstr);
2054 GvIOp(dstr) = (IO*)sref;
2058 SAVESPTR(GvSV(dstr));
2060 dref = (SV*)GvSV(dstr);
2062 if (PL_curcop->cop_stash != GvSTASH(dstr))
2063 GvIMPORTED_SV_on(dstr);
2074 (void)SvOOK_off(dstr); /* backoff */
2075 Safefree(SvPVX(dstr));
2076 SvLEN(dstr)=SvCUR(dstr)=0;
2079 (void)SvOK_off(dstr);
2080 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
2082 if (sflags & SVp_NOK) {
2084 SvNVX(dstr) = SvNVX(sstr);
2086 if (sflags & SVp_IOK) {
2087 (void)SvIOK_on(dstr);
2088 SvIVX(dstr) = SvIVX(sstr);
2090 if (SvAMAGIC(sstr)) {
2094 else if (sflags & SVp_POK) {
2097 * Check to see if we can just swipe the string. If so, it's a
2098 * possible small lose on short strings, but a big win on long ones.
2099 * It might even be a win on short strings if SvPVX(dstr)
2100 * has to be allocated and SvPVX(sstr) has to be freed.
2103 if (SvTEMP(sstr) && /* slated for free anyway? */
2104 SvREFCNT(sstr) == 1 && /* and no other references to it? */
2105 !(sflags & SVf_OOK)) /* and not involved in OOK hack? */
2107 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
2109 SvFLAGS(dstr) &= ~SVf_OOK;
2110 Safefree(SvPVX(dstr) - SvIVX(dstr));
2113 Safefree(SvPVX(dstr));
2115 (void)SvPOK_only(dstr);
2116 SvPV_set(dstr, SvPVX(sstr));
2117 SvLEN_set(dstr, SvLEN(sstr));
2118 SvCUR_set(dstr, SvCUR(sstr));
2120 (void)SvOK_off(sstr);
2121 SvPV_set(sstr, Nullch);
2126 else { /* have to copy actual string */
2127 STRLEN len = SvCUR(sstr);
2129 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
2130 Move(SvPVX(sstr),SvPVX(dstr),len,char);
2131 SvCUR_set(dstr, len);
2132 *SvEND(dstr) = '\0';
2133 (void)SvPOK_only(dstr);
2136 if (sflags & SVp_NOK) {
2138 SvNVX(dstr) = SvNVX(sstr);
2140 if (sflags & SVp_IOK) {
2141 (void)SvIOK_on(dstr);
2142 SvIVX(dstr) = SvIVX(sstr);
2145 else if (sflags & SVp_NOK) {
2146 SvNVX(dstr) = SvNVX(sstr);
2147 (void)SvNOK_only(dstr);
2149 (void)SvIOK_on(dstr);
2150 SvIVX(dstr) = SvIVX(sstr);
2153 else if (sflags & SVp_IOK) {
2154 (void)SvIOK_only(dstr);
2155 SvIVX(dstr) = SvIVX(sstr);
2158 if (dtype == SVt_PVGV) {
2159 if (ckWARN(WARN_UNSAFE))
2160 warner(WARN_UNSAFE, "Undefined value assigned to typeglob");
2163 (void)SvOK_off(dstr);
2169 sv_setsv_mg(SV *dstr, register SV *sstr)
2171 sv_setsv(dstr,sstr);
2176 sv_setpvn(register SV *sv, register const char *ptr, register STRLEN len)
2178 register char *dptr;
2179 assert(len >= 0); /* STRLEN is probably unsigned, so this may
2180 elicit a warning, but it won't hurt. */
2181 SV_CHECK_THINKFIRST(sv);
2186 if (SvTYPE(sv) >= SVt_PV) {
2187 if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
2191 sv_upgrade(sv, SVt_PV);
2193 SvGROW(sv, len + 1);
2195 Move(ptr,dptr,len,char);
2198 (void)SvPOK_only(sv); /* validate pointer */
2203 sv_setpvn_mg(register SV *sv, register const char *ptr, register STRLEN len)
2205 sv_setpvn(sv,ptr,len);
2210 sv_setpv(register SV *sv, register const char *ptr)
2212 register STRLEN len;
2214 SV_CHECK_THINKFIRST(sv);
2220 if (SvTYPE(sv) >= SVt_PV) {
2221 if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
2225 sv_upgrade(sv, SVt_PV);
2227 SvGROW(sv, len + 1);
2228 Move(ptr,SvPVX(sv),len+1,char);
2230 (void)SvPOK_only(sv); /* validate pointer */
2235 sv_setpv_mg(register SV *sv, register const char *ptr)
2242 sv_usepvn(register SV *sv, register char *ptr, register STRLEN len)
2244 SV_CHECK_THINKFIRST(sv);
2245 (void)SvUPGRADE(sv, SVt_PV);
2250 (void)SvOOK_off(sv);
2252 Safefree(SvPVX(sv));
2253 Renew(ptr, len+1, char);
2256 SvLEN_set(sv, len+1);
2258 (void)SvPOK_only(sv); /* validate pointer */
2263 sv_usepvn_mg(register SV *sv, register char *ptr, register STRLEN len)
2265 sv_usepvn(sv,ptr,len);
2270 sv_check_thinkfirst(register SV *sv)
2272 if (SvREADONLY(sv)) {
2274 if (PL_curcop != &PL_compiling)
2275 croak(PL_no_modify);
2282 sv_chop(register SV *sv, register char *ptr) /* like set but assuming ptr is in sv */
2286 register STRLEN delta;
2288 if (!ptr || !SvPOKp(sv))
2290 SV_CHECK_THINKFIRST(sv);
2291 if (SvTYPE(sv) < SVt_PVIV)
2292 sv_upgrade(sv,SVt_PVIV);
2296 SvFLAGS(sv) |= SVf_OOK;
2298 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVp_IOK|SVp_NOK);
2299 delta = ptr - SvPVX(sv);
2307 sv_catpvn(register SV *sv, register const char *ptr, register STRLEN len)
2312 junk = SvPV_force(sv, tlen);
2313 SvGROW(sv, tlen + len + 1);
2316 Move(ptr,SvPVX(sv)+tlen,len,char);
2319 (void)SvPOK_only(sv); /* validate pointer */
2324 sv_catpvn_mg(register SV *sv, register const char *ptr, register STRLEN len)
2326 sv_catpvn(sv,ptr,len);
2331 sv_catsv(SV *dstr, register SV *sstr)
2337 if (s = SvPV(sstr, len))
2338 sv_catpvn(dstr,s,len);
2342 sv_catsv_mg(SV *dstr, register SV *sstr)
2344 sv_catsv(dstr,sstr);
2349 sv_catpv(register SV *sv, register const char *ptr)
2351 register STRLEN len;
2357 junk = SvPV_force(sv, tlen);
2359 SvGROW(sv, tlen + len + 1);
2362 Move(ptr,SvPVX(sv)+tlen,len+1,char);
2364 (void)SvPOK_only(sv); /* validate pointer */
2369 sv_catpv_mg(register SV *sv, register const char *ptr)
2385 sv_upgrade(sv, SVt_PV);
2386 SvGROW(sv, len + 1);
2391 /* name is assumed to contain an SV* if (name && namelen == HEf_SVKEY) */
2394 sv_magic(register SV *sv, SV *obj, int how, const char *name, I32 namlen)
2398 if (SvREADONLY(sv)) {
2400 if (PL_curcop != &PL_compiling && !strchr("gBf", how))
2401 croak(PL_no_modify);
2403 if (SvMAGICAL(sv) || (how == 't' && SvTYPE(sv) >= SVt_PVMG)) {
2404 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
2411 (void)SvUPGRADE(sv, SVt_PVMG);
2413 Newz(702,mg, 1, MAGIC);
2414 mg->mg_moremagic = SvMAGIC(sv);
2417 if (!obj || obj == sv || how == '#' || how == 'r')
2421 mg->mg_obj = SvREFCNT_inc(obj);
2422 mg->mg_flags |= MGf_REFCOUNTED;
2425 mg->mg_len = namlen;
2428 mg->mg_ptr = savepvn(name, namlen);
2429 else if (namlen == HEf_SVKEY)
2430 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
2434 mg->mg_virtual = &PL_vtbl_sv;
2437 mg->mg_virtual = &PL_vtbl_amagic;
2440 mg->mg_virtual = &PL_vtbl_amagicelem;
2446 mg->mg_virtual = &PL_vtbl_bm;
2449 mg->mg_virtual = &PL_vtbl_regdata;
2452 mg->mg_virtual = &PL_vtbl_regdatum;
2455 mg->mg_virtual = &PL_vtbl_env;
2458 mg->mg_virtual = &PL_vtbl_fm;
2461 mg->mg_virtual = &PL_vtbl_envelem;
2464 mg->mg_virtual = &PL_vtbl_mglob;
2467 mg->mg_virtual = &PL_vtbl_isa;
2470 mg->mg_virtual = &PL_vtbl_isaelem;
2473 mg->mg_virtual = &PL_vtbl_nkeys;
2480 mg->mg_virtual = &PL_vtbl_dbline;
2484 mg->mg_virtual = &PL_vtbl_mutex;
2486 #endif /* USE_THREADS */
2487 #ifdef USE_LOCALE_COLLATE
2489 mg->mg_virtual = &PL_vtbl_collxfrm;
2491 #endif /* USE_LOCALE_COLLATE */
2493 mg->mg_virtual = &PL_vtbl_pack;
2497 mg->mg_virtual = &PL_vtbl_packelem;
2500 mg->mg_virtual = &PL_vtbl_regexp;
2503 mg->mg_virtual = &PL_vtbl_sig;
2506 mg->mg_virtual = &PL_vtbl_sigelem;
2509 mg->mg_virtual = &PL_vtbl_taint;
2513 mg->mg_virtual = &PL_vtbl_uvar;
2516 mg->mg_virtual = &PL_vtbl_vec;
2519 mg->mg_virtual = &PL_vtbl_substr;
2522 mg->mg_virtual = &PL_vtbl_defelem;
2525 mg->mg_virtual = &PL_vtbl_glob;
2528 mg->mg_virtual = &PL_vtbl_arylen;
2531 mg->mg_virtual = &PL_vtbl_pos;
2533 case '~': /* Reserved for use by extensions not perl internals. */
2534 /* Useful for attaching extension internal data to perl vars. */
2535 /* Note that multiple extensions may clash if magical scalars */
2536 /* etc holding private data from one are passed to another. */
2540 croak("Don't know how to handle magic of type '%c'", how);
2544 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
2548 sv_unmagic(SV *sv, int type)
2552 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
2555 for (mg = *mgp; mg; mg = *mgp) {
2556 if (mg->mg_type == type) {
2557 MGVTBL* vtbl = mg->mg_virtual;
2558 *mgp = mg->mg_moremagic;
2559 if (vtbl && (vtbl->svt_free != NULL))
2560 (VTBL->svt_free)(sv, mg);
2561 if (mg->mg_ptr && mg->mg_type != 'g')
2562 if (mg->mg_len >= 0)
2563 Safefree(mg->mg_ptr);
2564 else if (mg->mg_len == HEf_SVKEY)
2565 SvREFCNT_dec((SV*)mg->mg_ptr);
2566 if (mg->mg_flags & MGf_REFCOUNTED)
2567 SvREFCNT_dec(mg->mg_obj);
2571 mgp = &mg->mg_moremagic;
2575 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_IOK|SVp_NOK|SVp_POK)) >> PRIVSHIFT;
2582 sv_insert(SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
2586 register char *midend;
2587 register char *bigend;
2593 croak("Can't modify non-existent substring");
2594 SvPV_force(bigstr, curlen);
2595 if (offset + len > curlen) {
2596 SvGROW(bigstr, offset+len+1);
2597 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
2598 SvCUR_set(bigstr, offset+len);
2601 i = littlelen - len;
2602 if (i > 0) { /* string might grow */
2603 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
2604 mid = big + offset + len;
2605 midend = bigend = big + SvCUR(bigstr);
2608 while (midend > mid) /* shove everything down */
2609 *--bigend = *--midend;
2610 Move(little,big+offset,littlelen,char);
2616 Move(little,SvPVX(bigstr)+offset,len,char);
2621 big = SvPVX(bigstr);
2624 bigend = big + SvCUR(bigstr);
2626 if (midend > bigend)
2627 croak("panic: sv_insert");
2629 if (mid - big > bigend - midend) { /* faster to shorten from end */
2631 Move(little, mid, littlelen,char);
2634 i = bigend - midend;
2636 Move(midend, mid, i,char);
2640 SvCUR_set(bigstr, mid - big);
2643 else if (i = mid - big) { /* faster from front */
2644 midend -= littlelen;
2646 sv_chop(bigstr,midend-i);
2651 Move(little, mid, littlelen,char);
2653 else if (littlelen) {
2654 midend -= littlelen;
2655 sv_chop(bigstr,midend);
2656 Move(little,midend,littlelen,char);
2659 sv_chop(bigstr,midend);
2664 /* make sv point to what nstr did */
2667 sv_replace(register SV *sv, register SV *nsv)
2669 U32 refcnt = SvREFCNT(sv);
2670 SV_CHECK_THINKFIRST(sv);
2671 if (SvREFCNT(nsv) != 1)
2672 warn("Reference miscount in sv_replace()");
2673 if (SvMAGICAL(sv)) {
2677 sv_upgrade(nsv, SVt_PVMG);
2678 SvMAGIC(nsv) = SvMAGIC(sv);
2679 SvFLAGS(nsv) |= SvMAGICAL(sv);
2685 assert(!SvREFCNT(sv));
2686 StructCopy(nsv,sv,SV);
2687 SvREFCNT(sv) = refcnt;
2688 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
2693 sv_clear(register SV *sv)
2697 assert(SvREFCNT(sv) == 0);
2701 if (PL_defstash) { /* Still have a symbol table? */
2706 Zero(&tmpref, 1, SV);
2707 sv_upgrade(&tmpref, SVt_RV);
2709 SvREADONLY_on(&tmpref); /* DESTROY() could be naughty */
2710 SvREFCNT(&tmpref) = 1;
2713 stash = SvSTASH(sv);
2714 destructor = gv_fetchmethod(SvSTASH(sv), "DESTROY");
2717 PUSHSTACKi(PERLSI_DESTROY);
2718 SvRV(&tmpref) = SvREFCNT_inc(sv);
2723 perl_call_sv((SV*)GvCV(destructor),
2724 G_DISCARD|G_EVAL|G_KEEPERR);
2730 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
2732 del_XRV(SvANY(&tmpref));
2736 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
2737 SvOBJECT_off(sv); /* Curse the object. */
2738 if (SvTYPE(sv) != SVt_PVIO)
2739 --PL_sv_objcount; /* XXX Might want something more general */
2742 if (PL_in_clean_objs)
2743 croak("DESTROY created new reference to dead object");
2744 /* DESTROY gave object new lease on life */
2748 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv))
2751 switch (SvTYPE(sv)) {
2754 IoIFP(sv) != PerlIO_stdin() &&
2755 IoIFP(sv) != PerlIO_stdout() &&
2756 IoIFP(sv) != PerlIO_stderr())
2758 Safefree(IoTOP_NAME(sv));
2759 Safefree(IoFMT_NAME(sv));
2760 Safefree(IoBOTTOM_NAME(sv));
2775 SvREFCNT_dec(LvTARG(sv));
2779 Safefree(GvNAME(sv));
2780 /* cannot decrease stash refcount yet, as we might recursively delete
2781 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
2782 of stash until current sv is completely gone.
2783 -- JohnPC, 27 Mar 1998 */
2784 stash = GvSTASH(sv);
2790 (void)SvOOK_off(sv);
2795 SvREFCNT_dec(SvRV(sv));
2796 else if (SvPVX(sv) && SvLEN(sv))
2797 Safefree(SvPVX(sv));
2807 switch (SvTYPE(sv)) {
2823 del_XPVIV(SvANY(sv));
2826 del_XPVNV(SvANY(sv));
2829 del_XPVMG(SvANY(sv));
2832 del_XPVLV(SvANY(sv));
2835 del_XPVAV(SvANY(sv));
2838 del_XPVHV(SvANY(sv));
2841 del_XPVCV(SvANY(sv));
2844 del_XPVGV(SvANY(sv));
2845 /* code duplication for increased performance. */
2846 SvFLAGS(sv) &= SVf_BREAK;
2847 SvFLAGS(sv) |= SVTYPEMASK;
2848 /* decrease refcount of the stash that owns this GV, if any */
2850 SvREFCNT_dec(stash);
2851 return; /* not break, SvFLAGS reset already happened */
2853 del_XPVBM(SvANY(sv));
2856 del_XPVFM(SvANY(sv));
2859 del_XPVIO(SvANY(sv));
2862 SvFLAGS(sv) &= SVf_BREAK;
2863 SvFLAGS(sv) |= SVTYPEMASK;
2870 ATOMIC_INC(SvREFCNT(sv));
2877 int refcount_is_zero;
2881 if (SvREFCNT(sv) == 0) {
2882 if (SvFLAGS(sv) & SVf_BREAK)
2884 if (PL_in_clean_all) /* All is fair */
2886 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
2887 /* make sure SvREFCNT(sv)==0 happens very seldom */
2888 SvREFCNT(sv) = (~(U32)0)/2;
2891 warn("Attempt to free unreferenced scalar");
2894 ATOMIC_DEC_AND_TEST(refcount_is_zero, SvREFCNT(sv));
2895 if (!refcount_is_zero)
2899 warn("Attempt to free temp prematurely: SV 0x%lx", (unsigned long)sv);
2903 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
2904 /* make sure SvREFCNT(sv)==0 happens very seldom */
2905 SvREFCNT(sv) = (~(U32)0)/2;
2914 sv_len(register SV *sv)
2923 len = mg_length(sv);
2925 junk = SvPV(sv, len);
2930 sv_len_utf8(register SV *sv)
2941 len = mg_length(sv);
2944 s = (U8*)SvPV(sv, len);
2955 sv_pos_u2b(register SV *sv, I32* offsetp, I32* lenp)
2960 I32 uoffset = *offsetp;
2966 start = s = (U8*)SvPV(sv, len);
2968 while (s < send && uoffset--)
2972 *offsetp = s - start;
2976 while (s < send && ulen--)
2986 sv_pos_b2u(register SV *sv, I32* offsetp)
2995 s = (U8*)SvPV(sv, len);
2997 croak("panic: bad byte offset");
2998 send = s + *offsetp;
3005 warn("Malformed UTF-8 character");
3013 sv_eq(register SV *str1, register SV *str2)
3025 pv1 = SvPV(str1, cur1);
3030 pv2 = SvPV(str2, cur2);
3035 return memEQ(pv1, pv2, cur1);
3039 sv_cmp(register SV *str1, register SV *str2)
3042 char *pv1 = str1 ? SvPV(str1, cur1) : (char *) NULL;
3044 char *pv2 = str2 ? SvPV(str2, cur2) : (char *) NULL;
3048 return cur2 ? -1 : 0;
3053 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
3056 return retval < 0 ? -1 : 1;
3061 return cur1 < cur2 ? -1 : 1;
3065 sv_cmp_locale(register SV *sv1, register SV *sv2)
3067 #ifdef USE_LOCALE_COLLATE
3073 if (PL_collation_standard)
3077 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
3079 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
3081 if (!pv1 || !len1) {
3092 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
3095 return retval < 0 ? -1 : 1;
3098 * When the result of collation is equality, that doesn't mean
3099 * that there are no differences -- some locales exclude some
3100 * characters from consideration. So to avoid false equalities,
3101 * we use the raw string as a tiebreaker.
3107 #endif /* USE_LOCALE_COLLATE */
3109 return sv_cmp(sv1, sv2);
3112 #ifdef USE_LOCALE_COLLATE
3114 * Any scalar variable may carry an 'o' magic that contains the
3115 * scalar data of the variable transformed to such a format that
3116 * a normal memory comparison can be used to compare the data
3117 * according to the locale settings.
3120 sv_collxfrm(SV *sv, STRLEN *nxp)
3124 mg = SvMAGICAL(sv) ? mg_find(sv, 'o') : (MAGIC *) NULL;
3125 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
3130 Safefree(mg->mg_ptr);
3132 if ((xf = mem_collxfrm(s, len, &xlen))) {
3133 if (SvREADONLY(sv)) {
3136 return xf + sizeof(PL_collation_ix);
3139 sv_magic(sv, 0, 'o', 0, 0);
3140 mg = mg_find(sv, 'o');
3153 if (mg && mg->mg_ptr) {
3155 return mg->mg_ptr + sizeof(PL_collation_ix);
3163 #endif /* USE_LOCALE_COLLATE */
3166 sv_gets(register SV *sv, register PerlIO *fp, I32 append)
3171 register STDCHAR rslast;
3172 register STDCHAR *bp;
3176 SV_CHECK_THINKFIRST(sv);
3177 (void)SvUPGRADE(sv, SVt_PV);
3180 if (RsSNARF(PL_rs)) {
3184 else if (RsRECORD(PL_rs)) {
3185 I32 recsize, bytesread;
3188 /* Grab the size of the record we're getting */
3189 recsize = SvIV(SvRV(PL_rs));
3190 (void)SvPOK_only(sv); /* Validate pointer */
3191 buffer = SvGROW(sv, recsize + 1);
3194 /* VMS wants read instead of fread, because fread doesn't respect */
3195 /* RMS record boundaries. This is not necessarily a good thing to be */
3196 /* doing, but we've got no other real choice */
3197 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
3199 bytesread = PerlIO_read(fp, buffer, recsize);
3201 SvCUR_set(sv, bytesread);
3202 buffer[bytesread] = '\0';
3203 return(SvCUR(sv) ? SvPVX(sv) : Nullch);
3205 else if (RsPARA(PL_rs)) {
3210 rsptr = SvPV(PL_rs, rslen);
3211 rslast = rslen ? rsptr[rslen - 1] : '\0';
3213 if (RsPARA(PL_rs)) { /* have to do this both before and after */
3214 do { /* to make sure file boundaries work right */
3217 i = PerlIO_getc(fp);
3221 PerlIO_ungetc(fp,i);
3227 /* See if we know enough about I/O mechanism to cheat it ! */
3229 /* This used to be #ifdef test - it is made run-time test for ease
3230 of abstracting out stdio interface. One call should be cheap
3231 enough here - and may even be a macro allowing compile
3235 if (PerlIO_fast_gets(fp)) {
3238 * We're going to steal some values from the stdio struct
3239 * and put EVERYTHING in the innermost loop into registers.
3241 register STDCHAR *ptr;
3245 #if defined(VMS) && defined(PERLIO_IS_STDIO)
3246 /* An ungetc()d char is handled separately from the regular
3247 * buffer, so we getc() it back out and stuff it in the buffer.
3249 i = PerlIO_getc(fp);
3250 if (i == EOF) return 0;
3251 *(--((*fp)->_ptr)) = (unsigned char) i;
3255 /* Here is some breathtakingly efficient cheating */
3257 cnt = PerlIO_get_cnt(fp); /* get count into register */
3258 (void)SvPOK_only(sv); /* validate pointer */
3259 if (SvLEN(sv) - append <= cnt + 1) { /* make sure we have the room */
3260 if (cnt > 80 && SvLEN(sv) > append) {
3261 shortbuffered = cnt - SvLEN(sv) + append + 1;
3262 cnt -= shortbuffered;
3266 /* remember that cnt can be negative */
3267 SvGROW(sv, append + (cnt <= 0 ? 2 : (cnt + 1)));
3272 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
3273 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
3274 DEBUG_P(PerlIO_printf(Perl_debug_log,
3275 "Screamer: entering, ptr=%ld, cnt=%ld\n",(long)ptr,(long)cnt));
3276 DEBUG_P(PerlIO_printf(Perl_debug_log,
3277 "Screamer: entering: FILE * thinks ptr=%ld, cnt=%ld, base=%ld\n",
3278 (long)PerlIO_get_ptr(fp), (long)PerlIO_get_cnt(fp),
3279 (long)(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
3284 while (cnt > 0) { /* this | eat */
3286 if ((*bp++ = *ptr++) == rslast) /* really | dust */
3287 goto thats_all_folks; /* screams | sed :-) */
3291 Copy(ptr, bp, cnt, char); /* this | eat */
3292 bp += cnt; /* screams | dust */
3293 ptr += cnt; /* louder | sed :-) */
3298 if (shortbuffered) { /* oh well, must extend */
3299 cnt = shortbuffered;
3301 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
3303 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
3304 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
3308 DEBUG_P(PerlIO_printf(Perl_debug_log,
3309 "Screamer: going to getc, ptr=%ld, cnt=%ld\n",(long)ptr,(long)cnt));
3310 PerlIO_set_ptrcnt(fp, ptr, cnt); /* deregisterize cnt and ptr */
3311 DEBUG_P(PerlIO_printf(Perl_debug_log,
3312 "Screamer: pre: FILE * thinks ptr=%ld, cnt=%ld, base=%ld\n",
3313 (long)PerlIO_get_ptr(fp), (long)PerlIO_get_cnt(fp),
3314 (long)(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
3315 /* This used to call 'filbuf' in stdio form, but as that behaves like
3316 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
3317 another abstraction. */
3318 i = PerlIO_getc(fp); /* get more characters */
3319 DEBUG_P(PerlIO_printf(Perl_debug_log,
3320 "Screamer: post: FILE * thinks ptr=%ld, cnt=%ld, base=%ld\n",
3321 (long)PerlIO_get_ptr(fp), (long)PerlIO_get_cnt(fp),
3322 (long)(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
3323 cnt = PerlIO_get_cnt(fp);
3324 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
3325 DEBUG_P(PerlIO_printf(Perl_debug_log,
3326 "Screamer: after getc, ptr=%ld, cnt=%ld\n",(long)ptr,(long)cnt));
3328 if (i == EOF) /* all done for ever? */
3329 goto thats_really_all_folks;
3331 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
3333 SvGROW(sv, bpx + cnt + 2);
3334 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
3336 *bp++ = i; /* store character from PerlIO_getc */
3338 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
3339 goto thats_all_folks;
3343 if ((rslen > 1 && (bp - (STDCHAR*)SvPVX(sv) < rslen)) ||
3344 memNE((char*)bp - rslen, rsptr, rslen))
3345 goto screamer; /* go back to the fray */
3346 thats_really_all_folks:
3348 cnt += shortbuffered;
3349 DEBUG_P(PerlIO_printf(Perl_debug_log,
3350 "Screamer: quitting, ptr=%ld, cnt=%ld\n",(long)ptr,(long)cnt));
3351 PerlIO_set_ptrcnt(fp, ptr, cnt); /* put these back or we're in trouble */
3352 DEBUG_P(PerlIO_printf(Perl_debug_log,
3353 "Screamer: end: FILE * thinks ptr=%ld, cnt=%ld, base=%ld\n",
3354 (long)PerlIO_get_ptr(fp), (long)PerlIO_get_cnt(fp),
3355 (long)(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
3357 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
3358 DEBUG_P(PerlIO_printf(Perl_debug_log,
3359 "Screamer: done, len=%ld, string=|%.*s|\n",
3360 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
3364 /*The big, slow, and stupid way */
3369 register STDCHAR *bpe = buf + sizeof(buf);
3371 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = i) != rslast && bp < bpe)
3372 ; /* keep reading */
3376 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
3377 /* Accomodate broken VAXC compiler, which applies U8 cast to
3378 * both args of ?: operator, causing EOF to change into 255
3380 if (cnt) { i = (U8)buf[cnt - 1]; } else { i = EOF; }
3384 sv_catpvn(sv, (char *) buf, cnt);
3386 sv_setpvn(sv, (char *) buf, cnt);
3388 if (i != EOF && /* joy */
3390 SvCUR(sv) < rslen ||
3391 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
3395 * If we're reading from a TTY and we get a short read,
3396 * indicating that the user hit his EOF character, we need
3397 * to notice it now, because if we try to read from the TTY
3398 * again, the EOF condition will disappear.
3400 * The comparison of cnt to sizeof(buf) is an optimization
3401 * that prevents unnecessary calls to feof().
3405 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
3410 if (RsPARA(PL_rs)) { /* have to do this both before and after */
3411 while (i != EOF) { /* to make sure file boundaries work right */
3412 i = PerlIO_getc(fp);
3414 PerlIO_ungetc(fp,i);
3421 win32_strip_return(sv);
3424 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
3429 sv_inc(register SV *sv)
3438 if (SvTHINKFIRST(sv)) {
3439 if (SvREADONLY(sv)) {
3441 if (PL_curcop != &PL_compiling)
3442 croak(PL_no_modify);
3446 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
3453 flags = SvFLAGS(sv);
3454 if (flags & SVp_NOK) {
3455 (void)SvNOK_only(sv);
3459 if (flags & SVp_IOK) {
3460 if (SvIVX(sv) == IV_MAX)
3461 sv_setnv(sv, (double)IV_MAX + 1.0);
3463 (void)SvIOK_only(sv);
3468 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
3469 if ((flags & SVTYPEMASK) < SVt_PVNV)
3470 sv_upgrade(sv, SVt_NV);
3472 (void)SvNOK_only(sv);
3476 while (isALPHA(*d)) d++;
3477 while (isDIGIT(*d)) d++;
3479 SET_NUMERIC_STANDARD();
3480 sv_setnv(sv,atof(SvPVX(sv)) + 1.0); /* punt */
3484 while (d >= SvPVX(sv)) {
3492 /* MKS: The original code here died if letters weren't consecutive.
3493 * at least it didn't have to worry about non-C locales. The
3494 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
3495 * arranged in order (although not consecutively) and that only
3496 * [A-Za-z] are accepted by isALPHA in the C locale.
3498 if (*d != 'z' && *d != 'Z') {
3499 do { ++*d; } while (!isALPHA(*d));
3502 *(d--) -= 'z' - 'a';
3507 *(d--) -= 'z' - 'a' + 1;
3511 /* oh,oh, the number grew */
3512 SvGROW(sv, SvCUR(sv) + 2);
3514 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
3523 sv_dec(register SV *sv)
3531 if (SvTHINKFIRST(sv)) {
3532 if (SvREADONLY(sv)) {
3534 if (PL_curcop != &PL_compiling)
3535 croak(PL_no_modify);
3539 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
3546 flags = SvFLAGS(sv);
3547 if (flags & SVp_NOK) {
3549 (void)SvNOK_only(sv);
3552 if (flags & SVp_IOK) {
3553 if (SvIVX(sv) == IV_MIN)
3554 sv_setnv(sv, (double)IV_MIN - 1.0);
3556 (void)SvIOK_only(sv);
3561 if (!(flags & SVp_POK)) {
3562 if ((flags & SVTYPEMASK) < SVt_PVNV)
3563 sv_upgrade(sv, SVt_NV);
3565 (void)SvNOK_only(sv);
3568 SET_NUMERIC_STANDARD();
3569 sv_setnv(sv,atof(SvPVX(sv)) - 1.0); /* punt */
3572 /* Make a string that will exist for the duration of the expression
3573 * evaluation. Actually, it may have to last longer than that, but
3574 * hopefully we won't free it until it has been assigned to a
3575 * permanent location. */
3581 PL_tmps_max += (PL_tmps_max < 512) ? 128 : 512;
3582 Renew(PL_tmps_stack, PL_tmps_max, SV*);
3586 sv_mortalcopy(SV *oldstr)
3595 sv_setsv(sv,oldstr);
3596 if (++PL_tmps_ix >= PL_tmps_max)
3598 PL_tmps_stack[PL_tmps_ix] = sv;
3612 SvFLAGS(sv) = SVs_TEMP;
3613 if (++PL_tmps_ix >= PL_tmps_max)
3615 PL_tmps_stack[PL_tmps_ix] = sv;
3619 /* same thing without the copying */
3622 sv_2mortal(register SV *sv)
3627 if (SvREADONLY(sv) && SvIMMORTAL(sv))
3629 if (++PL_tmps_ix >= PL_tmps_max)
3631 PL_tmps_stack[PL_tmps_ix] = sv;
3637 newSVpv(const char *s, STRLEN len)
3647 sv_setpvn(sv,s,len);
3652 newSVpvn(const char *s, STRLEN len)
3660 sv_setpvn(sv,s,len);
3665 newSVpvf(const char* pat, ...)
3674 va_start(args, pat);
3675 sv_vsetpvfn(sv, pat, strlen(pat), &args, Null(SV**), 0, Null(bool*));
3708 newRV_noinc(SV *tmpRef)
3717 sv_upgrade(sv, SVt_RV);
3727 return newRV_noinc(SvREFCNT_inc(tmpRef));
3730 /* make an exact duplicate of old */
3733 newSVsv(register SV *old)
3739 if (SvTYPE(old) == SVTYPEMASK) {
3740 warn("semi-panic: attempt to dup freed string");
3758 sv_reset(register char *s, HV *stash)
3771 if (!*s) { /* reset ?? searches */
3772 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
3773 pm->op_pmdynflags &= ~PMdf_USED;
3778 /* reset variables */
3780 if (!HvARRAY(stash))
3783 Zero(todo, 256, char);
3790 for ( ; i <= max; i++) {
3793 for (i = 0; i <= (I32) HvMAX(stash); i++) {
3794 for (entry = HvARRAY(stash)[i];
3796 entry = HeNEXT(entry))
3798 if (!todo[(U8)*HeKEY(entry)])
3800 gv = (GV*)HeVAL(entry);
3802 if (SvTHINKFIRST(sv)) {
3803 if (!SvREADONLY(sv) && SvROK(sv))
3808 if (SvTYPE(sv) >= SVt_PV) {
3810 if (SvPVX(sv) != Nullch)
3817 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
3819 #ifndef VMS /* VMS has no environ array */
3821 environ[0] = Nullch;
3836 switch (SvTYPE(sv)) {
3844 croak("Bad filehandle: %s", GvNAME(gv));
3848 croak(PL_no_usym, "filehandle");
3850 return sv_2io(SvRV(sv));
3851 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
3857 croak("Bad filehandle: %s", SvPV(sv,n_a));
3864 sv_2cv(SV *sv, HV **st, GV **gvp, I32 lref)
3871 return *gvp = Nullgv, Nullcv;
3872 switch (SvTYPE(sv)) {
3892 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
3893 tryAMAGICunDEREF(to_cv);
3896 if (SvTYPE(sv) == SVt_PVCV) {
3905 croak("Not a subroutine reference");
3910 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
3916 if (lref && !GvCVu(gv)) {
3919 tmpsv = NEWSV(704,0);
3920 gv_efullname3(tmpsv, gv, Nullch);
3921 newSUB(start_subparse(FALSE, 0),
3922 newSVOP(OP_CONST, 0, tmpsv),
3927 croak("Unable to create sub named \"%s\"", SvPV(sv,n_a));
3934 sv_true(register SV *sv)
3941 if ((tXpv = (XPV*)SvANY(sv)) &&
3942 (*tXpv->xpv_pv > '0' ||
3943 tXpv->xpv_cur > 1 ||
3944 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
3951 return SvIVX(sv) != 0;
3954 return SvNVX(sv) != 0.0;
3956 return sv_2bool(sv);
3962 sv_iv(register SV *sv)
3970 sv_uv(register SV *sv)
3978 sv_nv(register SV *sv)
3993 return sv_2pv(sv, &n_a);
3997 sv_pvn(SV *sv, STRLEN *lp)
4003 return sv_2pv(sv, lp);
4007 sv_pvn_force(SV *sv, STRLEN *lp)
4011 if (SvREADONLY(sv)) {
4013 if (PL_curcop != &PL_compiling)
4014 croak(PL_no_modify);
4021 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
4022 if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV) {
4029 croak("Can't coerce %s to string in %s", sv_reftype(sv,0),
4030 PL_op_name[PL_op->op_type]);
4035 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
4040 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
4041 SvGROW(sv, len + 1);
4042 Move(s,SvPVX(sv),len,char);
4047 SvPOK_on(sv); /* validate pointer */
4049 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%lx 2pv(%s)\n",
4050 (unsigned long)sv,SvPVX(sv)));
4057 sv_reftype(SV *sv, int ob)
4059 if (ob && SvOBJECT(sv))
4060 return HvNAME(SvSTASH(sv));
4062 switch (SvTYPE(sv)) {
4076 case SVt_PVLV: return "LVALUE";
4077 case SVt_PVAV: return "ARRAY";
4078 case SVt_PVHV: return "HASH";
4079 case SVt_PVCV: return "CODE";
4080 case SVt_PVGV: return "GLOB";
4081 case SVt_PVFM: return "FORMAT";
4082 default: return "UNKNOWN";
4103 sv_isa(SV *sv, const char *name)
4115 return strEQ(HvNAME(SvSTASH(sv)), name);
4119 newSVrv(SV *rv, const char *classname)
4129 SV_CHECK_THINKFIRST(rv);
4132 if (SvTYPE(rv) < SVt_RV)
4133 sv_upgrade(rv, SVt_RV);
4136 SvRV(rv) = SvREFCNT_inc(sv);
4140 HV* stash = gv_stashpv(classname, TRUE);
4141 (void)sv_bless(rv, stash);
4147 sv_setref_pv(SV *rv, const char *classname, void *pv)
4150 sv_setsv(rv, &PL_sv_undef);
4154 sv_setiv(newSVrv(rv,classname), (IV)pv);
4159 sv_setref_iv(SV *rv, const char *classname, IV iv)
4161 sv_setiv(newSVrv(rv,classname), iv);
4166 sv_setref_nv(SV *rv, const char *classname, double nv)
4168 sv_setnv(newSVrv(rv,classname), nv);
4173 sv_setref_pvn(SV *rv, const char *classname, char *pv, I32 n)
4175 sv_setpvn(newSVrv(rv,classname), pv, n);
4180 sv_bless(SV *sv, HV *stash)
4185 croak("Can't bless non-reference value");
4187 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
4188 if (SvREADONLY(tmpRef))
4189 croak(PL_no_modify);
4190 if (SvOBJECT(tmpRef)) {
4191 if (SvTYPE(tmpRef) != SVt_PVIO)
4193 SvREFCNT_dec(SvSTASH(tmpRef));
4196 SvOBJECT_on(tmpRef);
4197 if (SvTYPE(tmpRef) != SVt_PVIO)
4199 (void)SvUPGRADE(tmpRef, SVt_PVMG);
4200 SvSTASH(tmpRef) = (HV*)SvREFCNT_inc(stash);
4213 assert(SvTYPE(sv) == SVt_PVGV);
4218 SvREFCNT_dec(GvSTASH(sv));
4219 GvSTASH(sv) = Nullhv;
4221 sv_unmagic(sv, '*');
4222 Safefree(GvNAME(sv));
4224 SvFLAGS(sv) &= ~SVTYPEMASK;
4225 SvFLAGS(sv) |= SVt_PVMG;
4235 if (SvREFCNT(rv) != 1 || SvREADONLY(rv))
4238 sv_2mortal(rv); /* Schedule for freeing later */
4244 sv_magic((sv), Nullsv, 't', Nullch, 0);
4250 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
4251 MAGIC *mg = mg_find(sv, 't');
4260 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
4261 MAGIC *mg = mg_find(sv, 't');
4262 if (mg && ((mg->mg_len & 1) || (mg->mg_len & 2) && mg->mg_obj == sv))
4269 sv_setpviv(SV *sv, IV iv)
4272 char buf[TYPE_DIGITS(UV)];
4273 char *ptr = buf + sizeof(buf);
4278 sv_setpvn(sv, "", 0);
4287 *--ptr = '0' + (uv % 10);
4289 len = (buf + sizeof(buf)) - ptr;
4290 /* taking advantage of SvCUR(sv) == 0 */
4291 SvGROW(sv, sign + len + 1);
4295 memcpy(p, ptr, len);
4298 SvCUR(sv) = p - SvPVX(sv);
4303 sv_setpviv_mg(SV *sv, IV iv)
4310 sv_setpvf(SV *sv, const char* pat, ...)
4313 va_start(args, pat);
4314 sv_vsetpvfn(sv, pat, strlen(pat), &args, Null(SV**), 0, Null(bool*));
4320 sv_setpvf_mg(SV *sv, const char* pat, ...)
4323 va_start(args, pat);
4324 sv_vsetpvfn(sv, pat, strlen(pat), &args, Null(SV**), 0, Null(bool*));
4330 sv_catpvf(SV *sv, const char* pat, ...)
4333 va_start(args, pat);
4334 sv_vcatpvfn(sv, pat, strlen(pat), &args, Null(SV**), 0, Null(bool*));
4339 sv_catpvf_mg(SV *sv, const char* pat, ...)
4342 va_start(args, pat);
4343 sv_vcatpvfn(sv, pat, strlen(pat), &args, Null(SV**), 0, Null(bool*));
4349 sv_vsetpvfn(SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *used_locale)
4351 sv_setpvn(sv, "", 0);
4352 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, used_locale);
4356 sv_vcatpvfn(SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *used_locale)
4364 static char nullstr[] = "(null)";
4366 /* no matter what, this is a string now */
4367 (void)SvPV_force(sv, origlen);
4369 /* special-case "", "%s", and "%_" */
4372 if (patlen == 2 && pat[0] == '%') {
4376 char *s = va_arg(*args, char*);
4377 sv_catpv(sv, s ? s : nullstr);
4379 else if (svix < svmax)
4380 sv_catsv(sv, *svargs);
4384 sv_catsv(sv, va_arg(*args, SV*));
4387 /* See comment on '_' below */
4392 patend = (char*)pat + patlen;
4393 for (p = (char*)pat; p < patend; p = q) {
4401 bool has_precis = FALSE;
4406 STRLEN esignlen = 0;
4408 char *eptr = Nullch;
4410 char ebuf[TYPE_DIGITS(int) * 2 + 16]; /* large enough for "%#.#f" */
4421 for (q = p; q < patend && *q != '%'; ++q) ;
4423 sv_catpvn(sv, p, q - p);
4461 case '1': case '2': case '3':
4462 case '4': case '5': case '6':
4463 case '7': case '8': case '9':
4466 width = width * 10 + (*q++ - '0');
4471 i = va_arg(*args, int);
4473 i = (svix < svmax) ? SvIVx(svargs[svix++]) : 0;
4475 width = (i < 0) ? -i : i;
4486 i = va_arg(*args, int);
4488 i = (svix < svmax) ? SvIVx(svargs[svix++]) : 0;
4489 precis = (i < 0) ? 0 : i;
4495 precis = precis * 10 + (*q++ - '0');
4504 #if 0 /* when quads have better support within Perl */
4505 if (*(q + 1) == 'l') {
4532 uv = va_arg(*args, int);
4534 uv = (svix < svmax) ? SvIVx(svargs[svix++]) : 0;
4536 eptr = (char*)utf8buf;
4537 elen = uv_to_utf8((U8*)eptr, uv) - utf8buf;
4541 c = va_arg(*args, int);
4543 c = (svix < svmax) ? SvIVx(svargs[svix++]) : 0;
4550 eptr = va_arg(*args, char*);
4552 elen = strlen(eptr);
4555 elen = sizeof nullstr - 1;
4558 else if (svix < svmax) {
4559 eptr = SvPVx(svargs[svix++], elen);
4561 if (has_precis && precis < elen) {
4563 sv_pos_u2b(svargs[svix - 1], &p, 0); /* sticks at end */
4566 if (width) { /* fudge width (can't fudge elen) */
4567 width += elen - sv_len_utf8(svargs[svix - 1]);
4575 * The "%_" hack might have to be changed someday,
4576 * if ISO or ANSI decide to use '_' for something.
4577 * So we keep it hidden from users' code.
4581 eptr = SvPVx(va_arg(*args, SV*), elen);
4584 if (has_precis && elen > precis)
4592 uv = (UV)va_arg(*args, void*);
4594 uv = (svix < svmax) ? (UV)svargs[svix++] : 0;
4605 case 'h': iv = (short)va_arg(*args, int); break;
4606 default: iv = va_arg(*args, int); break;
4607 case 'l': iv = va_arg(*args, long); break;
4608 case 'V': iv = va_arg(*args, IV); break;
4612 iv = (svix < svmax) ? SvIVx(svargs[svix++]) : 0;
4614 case 'h': iv = (short)iv; break;
4615 default: iv = (int)iv; break;
4616 case 'l': iv = (long)iv; break;
4623 esignbuf[esignlen++] = plus;
4627 esignbuf[esignlen++] = '-';
4657 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
4658 default: uv = va_arg(*args, unsigned); break;
4659 case 'l': uv = va_arg(*args, unsigned long); break;
4660 case 'V': uv = va_arg(*args, UV); break;
4664 uv = (svix < svmax) ? SvUVx(svargs[svix++]) : 0;
4666 case 'h': uv = (unsigned short)uv; break;
4667 default: uv = (unsigned)uv; break;
4668 case 'l': uv = (unsigned long)uv; break;
4674 eptr = ebuf + sizeof ebuf;
4680 p = (c == 'X') ? "0123456789ABCDEF" : "0123456789abcdef";
4686 esignbuf[esignlen++] = '0';
4687 esignbuf[esignlen++] = c; /* 'x' or 'X' */
4693 *--eptr = '0' + dig;
4695 if (alt && *eptr != '0')
4701 *--eptr = '0' + dig;
4703 if (alt && *eptr != '0')
4706 default: /* it had better be ten or less */
4709 *--eptr = '0' + dig;
4710 } while (uv /= base);
4713 elen = (ebuf + sizeof ebuf) - eptr;
4716 zeros = precis - elen;
4717 else if (precis == 0 && elen == 1 && *eptr == '0')
4722 /* FLOATING POINT */
4725 c = 'f'; /* maybe %F isn't supported here */
4731 /* This is evil, but floating point is even more evil */
4734 nv = va_arg(*args, double);
4736 nv = (svix < svmax) ? SvNVx(svargs[svix++]) : 0.0;
4739 if (c != 'e' && c != 'E') {
4741 (void)frexp(nv, &i);
4742 if (i == PERL_INT_MIN)
4743 die("panic: frexp");
4745 need = BIT_DIGITS(i);
4747 need += has_precis ? precis : 6; /* known default */
4751 need += 20; /* fudge factor */
4752 if (PL_efloatsize < need) {
4753 Safefree(PL_efloatbuf);
4754 PL_efloatsize = need + 20; /* more fudge */
4755 New(906, PL_efloatbuf, PL_efloatsize, char);
4758 eptr = ebuf + sizeof ebuf;
4763 do { *--eptr = '0' + (base % 10); } while (base /= 10);
4768 do { *--eptr = '0' + (base % 10); } while (base /= 10);
4780 (void)sprintf(PL_efloatbuf, eptr, nv);
4782 eptr = PL_efloatbuf;
4783 elen = strlen(PL_efloatbuf);
4787 * User-defined locales may include arbitrary characters.
4788 * And, unfortunately, some system may alloc the "C" locale
4789 * to be overridden by a malicious user.
4792 *used_locale = TRUE;
4793 #endif /* LC_NUMERIC */
4800 i = SvCUR(sv) - origlen;
4803 case 'h': *(va_arg(*args, short*)) = i; break;
4804 default: *(va_arg(*args, int*)) = i; break;
4805 case 'l': *(va_arg(*args, long*)) = i; break;
4806 case 'V': *(va_arg(*args, IV*)) = i; break;
4809 else if (svix < svmax)
4810 sv_setuv(svargs[svix++], (UV)i);
4811 continue; /* not "break" */
4817 if (!args && ckWARN(WARN_PRINTF) &&
4818 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
4819 SV *msg = sv_newmortal();
4820 sv_setpvf(msg, "Invalid conversion in %s: ",
4821 (PL_op->op_type == OP_PRTF) ? "printf" : "sprintf");
4823 sv_catpvf(msg, isPRINT(c) ? "\"%%%c\"" : "\"%%\\%03o\"",
4826 sv_catpv(msg, "end of string");
4827 warner(WARN_PRINTF, "%_", msg); /* yes, this is reentrant */
4830 /* output mangled stuff ... */
4836 /* ... right here, because formatting flags should not apply */
4837 SvGROW(sv, SvCUR(sv) + elen + 1);
4839 memcpy(p, eptr, elen);
4842 SvCUR(sv) = p - SvPVX(sv);
4843 continue; /* not "break" */
4846 have = esignlen + zeros + elen;
4847 need = (have > width ? have : width);
4850 SvGROW(sv, SvCUR(sv) + need + 1);
4852 if (esignlen && fill == '0') {
4853 for (i = 0; i < esignlen; i++)
4857 memset(p, fill, gap);
4860 if (esignlen && fill != '0') {
4861 for (i = 0; i < esignlen; i++)
4865 for (i = zeros; i; i--)
4869 memcpy(p, eptr, elen);
4873 memset(p, ' ', gap);
4877 SvCUR(sv) = p - SvPVX(sv);