2 * Store and retrieve mechanism.
4 * Copyright (c) 1995-2000, Raphael Manfredi
6 * You may redistribute only under the same terms as Perl 5, as specified
7 * in the README file that comes with the distribution.
11 #define PERL_NO_GET_CONTEXT /* we want efficiency */
17 #include <patchlevel.h> /* Perl's one, needed since 5.6 */
20 #if !defined(PERL_VERSION) || PERL_VERSION < 8
21 #include "ppport.h" /* handle old perls */
25 #define DEBUGME /* Debug mode, turns assertions on as well */
26 #define DASSERT /* Assertion mode */
30 * Pre PerlIO time when none of USE_PERLIO and PERLIO_IS_STDIO is defined
31 * Provide them with the necessary defines so they can build with pre-5.004.
34 #ifndef PERLIO_IS_STDIO
36 #define PerlIO_getc(x) getc(x)
37 #define PerlIO_putc(f,x) putc(x,f)
38 #define PerlIO_read(x,y,z) fread(y,1,z,x)
39 #define PerlIO_write(x,y,z) fwrite(y,1,z,x)
40 #define PerlIO_stdoutf printf
41 #endif /* PERLIO_IS_STDIO */
42 #endif /* USE_PERLIO */
45 * Earlier versions of perl might be used, we can't assume they have the latest!
48 #ifndef PERL_VERSION /* For perls < 5.6 */
49 #define PERL_VERSION PATCHLEVEL
51 #define newRV_noinc(sv) ((Sv = newRV(sv)), --SvREFCNT(SvRV(Sv)), Sv)
53 #if (PATCHLEVEL <= 4) /* Older perls (<= 5.004) lack PL_ namespace */
54 #define PL_sv_yes sv_yes
55 #define PL_sv_no sv_no
56 #define PL_sv_undef sv_undef
57 #if (SUBVERSION <= 4) /* 5.004_04 has been reported to lack newSVpvn */
58 #define newSVpvn newSVpv
60 #endif /* PATCHLEVEL <= 4 */
61 #ifndef HvSHAREKEYS_off
62 #define HvSHAREKEYS_off(hv) /* Ignore */
64 #ifndef AvFILLp /* Older perls (<=5.003) lack AvFILLp */
65 #define AvFILLp AvFILL
67 typedef double NV; /* Older perls lack the NV type */
68 #define IVdf "ld" /* Various printf formats for Perl types */
72 #define INT2PTR(t,v) (t)(IV)(v)
73 #define PTR2UV(v) (unsigned long)(v)
74 #endif /* PERL_VERSION -- perls < 5.6 */
76 #ifndef NVef /* The following were not part of perl 5.6 */
77 #if defined(USE_LONG_DOUBLE) && \
78 defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
79 #define NVef PERL_PRIeldbl
80 #define NVff PERL_PRIfldbl
81 #define NVgf PERL_PRIgldbl
90 # if (defined(__GNUC__) && defined(__cplusplus)) || defined(__INTEL_COMPILER)
91 # define PERL_UNUSED_DECL
93 # define PERL_UNUSED_DECL __attribute__((unused))
96 # define PERL_UNUSED_DECL
100 #define dNOOP extern int Perl___notused PERL_UNUSED_DECL
114 * TRACEME() will only output things when the $Storable::DEBUGME is true.
119 if (SvTRUE(perl_get_sv("Storable::DEBUGME", TRUE))) \
120 { PerlIO_stdoutf x; PerlIO_stdoutf("\n"); } \
127 #define ASSERT(x,y) \
130 PerlIO_stdoutf("ASSERT FAILED (\"%s\", line %d): ", \
131 __FILE__, __LINE__); \
132 PerlIO_stdoutf y; PerlIO_stdoutf("\n"); \
143 #define C(x) ((char) (x)) /* For markers with dynamic retrieval handling */
145 #define SX_OBJECT C(0) /* Already stored object */
146 #define SX_LSCALAR C(1) /* Scalar (large binary) follows (length, data) */
147 #define SX_ARRAY C(2) /* Array forthcominng (size, item list) */
148 #define SX_HASH C(3) /* Hash forthcoming (size, key/value pair list) */
149 #define SX_REF C(4) /* Reference to object forthcoming */
150 #define SX_UNDEF C(5) /* Undefined scalar */
151 #define SX_INTEGER C(6) /* Integer forthcoming */
152 #define SX_DOUBLE C(7) /* Double forthcoming */
153 #define SX_BYTE C(8) /* (signed) byte forthcoming */
154 #define SX_NETINT C(9) /* Integer in network order forthcoming */
155 #define SX_SCALAR C(10) /* Scalar (binary, small) follows (length, data) */
156 #define SX_TIED_ARRAY C(11) /* Tied array forthcoming */
157 #define SX_TIED_HASH C(12) /* Tied hash forthcoming */
158 #define SX_TIED_SCALAR C(13) /* Tied scalar forthcoming */
159 #define SX_SV_UNDEF C(14) /* Perl's immortal PL_sv_undef */
160 #define SX_SV_YES C(15) /* Perl's immortal PL_sv_yes */
161 #define SX_SV_NO C(16) /* Perl's immortal PL_sv_no */
162 #define SX_BLESS C(17) /* Object is blessed */
163 #define SX_IX_BLESS C(18) /* Object is blessed, classname given by index */
164 #define SX_HOOK C(19) /* Stored via hook, user-defined */
165 #define SX_OVERLOAD C(20) /* Overloaded reference */
166 #define SX_TIED_KEY C(21) /* Tied magic key forthcoming */
167 #define SX_TIED_IDX C(22) /* Tied magic index forthcoming */
168 #define SX_UTF8STR C(23) /* UTF-8 string forthcoming (small) */
169 #define SX_LUTF8STR C(24) /* UTF-8 string forthcoming (large) */
170 #define SX_FLAG_HASH C(25) /* Hash with flags forthcoming (size, flags, key/flags/value triplet list) */
171 #define SX_CODE C(26) /* Code references as perl source code */
172 #define SX_WEAKREF C(27) /* Weak reference to object forthcoming */
173 #define SX_WEAKOVERLOAD C(28) /* Overloaded weak reference */
174 #define SX_ERROR C(29) /* Error */
177 * Those are only used to retrieve "old" pre-0.6 binary images.
179 #define SX_ITEM 'i' /* An array item introducer */
180 #define SX_IT_UNDEF 'I' /* Undefined array item */
181 #define SX_KEY 'k' /* A hash key introducer */
182 #define SX_VALUE 'v' /* A hash value introducer */
183 #define SX_VL_UNDEF 'V' /* Undefined hash value */
186 * Those are only used to retrieve "old" pre-0.7 binary images
189 #define SX_CLASS 'b' /* Object is blessed, class name length <255 */
190 #define SX_LG_CLASS 'B' /* Object is blessed, class name length >255 */
191 #define SX_STORED 'X' /* End of object */
194 * Limits between short/long length representation.
197 #define LG_SCALAR 255 /* Large scalar length limit */
198 #define LG_BLESS 127 /* Large classname bless limit */
204 #define ST_STORE 0x1 /* Store operation */
205 #define ST_RETRIEVE 0x2 /* Retrieval operation */
206 #define ST_CLONE 0x4 /* Deep cloning operation */
209 * The following structure is used for hash table key retrieval. Since, when
210 * retrieving objects, we'll be facing blessed hash references, it's best
211 * to pre-allocate that buffer once and resize it as the need arises, never
212 * freeing it (keys will be saved away someplace else anyway, so even large
213 * keys are not enough a motivation to reclaim that space).
215 * This structure is also used for memory store/retrieve operations which
216 * happen in a fixed place before being malloc'ed elsewhere if persistency
217 * is required. Hence the aptr pointer.
220 char *arena; /* Will hold hash key strings, resized as needed */
221 STRLEN asiz; /* Size of aforementionned buffer */
222 char *aptr; /* Arena pointer, for in-place read/write ops */
223 char *aend; /* First invalid address */
228 * A hash table records the objects which have already been stored.
229 * Those are referred to as SX_OBJECT in the file, and their "tag" (i.e.
230 * an arbitrary sequence number) is used to identify them.
233 * An array table records the objects which have already been retrieved,
234 * as seen by the tag determind by counting the objects themselves. The
235 * reference to that retrieved object is kept in the table, and is returned
236 * when an SX_OBJECT is found bearing that same tag.
238 * The same processing is used to record "classname" for blessed objects:
239 * indexing by a hash at store time, and via an array at retrieve time.
242 typedef unsigned long stag_t; /* Used by pre-0.6 binary format */
245 * The following "thread-safe" related defines were contributed by
246 * Murray Nesbitt <murray@activestate.com> and integrated by RAM, who
247 * only renamed things a little bit to ensure consistency with surrounding
248 * code. -- RAM, 14/09/1999
250 * The original patch suffered from the fact that the stcxt_t structure
251 * was global. Murray tried to minimize the impact on the code as much as
254 * Starting with 0.7, Storable can be re-entrant, via the STORABLE_xxx hooks
255 * on objects. Therefore, the notion of context needs to be generalized,
259 #define MY_VERSION "Storable(" XS_VERSION ")"
263 * Conditional UTF8 support.
267 #define STORE_UTF8STR(pv, len) STORE_PV_LEN(pv, len, SX_UTF8STR, SX_LUTF8STR)
268 #define HAS_UTF8_SCALARS
270 #define HAS_UTF8_HASHES
273 /* 5.6 perl has utf8 scalars but not hashes */
277 #define STORE_UTF8STR(pv, len) CROAK(("panic: storing UTF8 in non-UTF8 perl"))
280 #define UTF8_CROAK() CROAK(("Cannot retrieve UTF8 data in non-UTF8 perl"))
283 #define WEAKREF_CROAK() CROAK(("Cannot retrieve weak references in this perl"))
286 #ifdef HvPLACEHOLDERS
287 #define HAS_RESTRICTED_HASHES
289 #define HVhek_PLACEHOLD 0x200
290 #define RESTRICTED_HASH_CROAK() CROAK(("Cannot retrieve restricted hash"))
294 #define HAS_HASH_KEY_FLAGS
298 * Fields s_tainted and s_dirty are prefixed with s_ because Perl's include
299 * files remap tainted and dirty when threading is enabled. That's bad for
300 * perl to remap such common words. -- RAM, 29/09/00
304 typedef struct stcxt {
305 int entry; /* flags recursion */
306 int optype; /* type of traversal operation */
307 HV *hseen; /* which objects have been seen, store time */
308 AV *hook_seen; /* which SVs were returned by STORABLE_freeze() */
309 AV *aseen; /* which objects have been seen, retrieve time */
310 IV where_is_undef; /* index in aseen of PL_sv_undef */
311 HV *hclass; /* which classnames have been seen, store time */
312 AV *aclass; /* which classnames have been seen, retrieve time */
313 HV *hook; /* cache for hook methods per class name */
314 IV tagnum; /* incremented at store time for each seen object */
315 IV classnum; /* incremented at store time for each seen classname */
316 int netorder; /* true if network order used */
317 int s_tainted; /* true if input source is tainted, at retrieve time */
318 int forgive_me; /* whether to be forgiving... */
319 int deparse; /* whether to deparse code refs */
320 SV *eval; /* whether to eval source code */
321 int canonical; /* whether to store hashes sorted by key */
322 #ifndef HAS_RESTRICTED_HASHES
323 int derestrict; /* whether to downgrade restrcted hashes */
326 int use_bytes; /* whether to bytes-ify utf8 */
328 int accept_future_minor; /* croak immediately on future minor versions? */
329 int s_dirty; /* context is dirty due to CROAK() -- can be cleaned */
330 int membuf_ro; /* true means membuf is read-only and msaved is rw */
331 struct extendable keybuf; /* for hash key retrieval */
332 struct extendable membuf; /* for memory store/retrieve operations */
333 struct extendable msaved; /* where potentially valid mbuf is saved */
334 PerlIO *fio; /* where I/O are performed, NULL for memory */
335 int ver_major; /* major of version for retrieved object */
336 int ver_minor; /* minor of version for retrieved object */
337 SV *(**retrieve_vtbl)(pTHX_ struct stcxt *, char *); /* retrieve dispatch table */
338 SV *prev; /* contexts chained backwards in real recursion */
339 SV *my_sv; /* the blessed scalar who's SvPVX() I am */
342 #define NEW_STORABLE_CXT_OBJ(cxt) \
344 SV *self = newSV(sizeof(stcxt_t) - 1); \
345 SV *my_sv = newRV_noinc(self); \
346 sv_bless(my_sv, gv_stashpv("Storable::Cxt", TRUE)); \
347 cxt = (stcxt_t *)SvPVX(self); \
348 Zero(cxt, 1, stcxt_t); \
349 cxt->my_sv = my_sv; \
352 #if defined(MULTIPLICITY) || defined(PERL_OBJECT) || defined(PERL_CAPI)
354 #if (PATCHLEVEL <= 4) && (SUBVERSION < 68)
356 SV *perinterp_sv = perl_get_sv(MY_VERSION, FALSE)
357 #else /* >= perl5.004_68 */
359 SV *perinterp_sv = *hv_fetch(PL_modglobal, \
360 MY_VERSION, sizeof(MY_VERSION)-1, TRUE)
361 #endif /* < perl5.004_68 */
363 #define dSTCXT_PTR(T,name) \
364 T name = ((perinterp_sv && SvIOK(perinterp_sv) && SvIVX(perinterp_sv) \
365 ? (T)SvPVX(SvRV(INT2PTR(SV*,SvIVX(perinterp_sv)))) : (T) 0))
368 dSTCXT_PTR(stcxt_t *, cxt)
372 NEW_STORABLE_CXT_OBJ(cxt); \
373 sv_setiv(perinterp_sv, PTR2IV(cxt->my_sv))
375 #define SET_STCXT(x) \
378 sv_setiv(perinterp_sv, PTR2IV(x->my_sv)); \
381 #else /* !MULTIPLICITY && !PERL_OBJECT && !PERL_CAPI */
383 static stcxt_t *Context_ptr = NULL;
384 #define dSTCXT stcxt_t *cxt = Context_ptr
385 #define SET_STCXT(x) Context_ptr = x
388 NEW_STORABLE_CXT_OBJ(cxt); \
392 #endif /* MULTIPLICITY || PERL_OBJECT || PERL_CAPI */
396 * Croaking implies a memory leak, since we don't use setjmp/longjmp
397 * to catch the exit and free memory used during store or retrieve
398 * operations. This is not too difficult to fix, but I need to understand
399 * how Perl does it, and croaking is exceptional anyway, so I lack the
400 * motivation to do it.
402 * The current workaround is to mark the context as dirty when croaking,
403 * so that data structures can be freed whenever we renter Storable code
404 * (but only *then*: it's a workaround, not a fix).
406 * This is also imperfect, because we don't really know how far they trapped
407 * the croak(), and when we were recursing, we won't be able to clean anything
408 * but the topmost context stacked.
411 #define CROAK(x) STMT_START { cxt->s_dirty = 1; croak x; } STMT_END
414 * End of "thread-safe" related definitions.
420 * Keep only the low 32 bits of a pointer (used for tags, which are not
425 #define LOW_32BITS(x) ((I32) (x))
427 #define LOW_32BITS(x) ((I32) ((unsigned long) (x) & 0xffffffffUL))
433 * Hack for Crays, where sizeof(I32) == 8, and which are big-endians.
434 * Used in the WLEN and RLEN macros.
438 #define oI(x) ((I32 *) ((char *) (x) + 4))
439 #define oS(x) ((x) - 4)
440 #define oC(x) (x = 0)
449 * key buffer handling
451 #define kbuf (cxt->keybuf).arena
452 #define ksiz (cxt->keybuf).asiz
456 TRACEME(("** allocating kbuf of 128 bytes")); \
457 New(10003, kbuf, 128, char); \
464 TRACEME(("** extending kbuf to %d bytes (had %d)", x+1, ksiz)); \
465 Renew(kbuf, x+1, char); \
471 * memory buffer handling
473 #define mbase (cxt->membuf).arena
474 #define msiz (cxt->membuf).asiz
475 #define mptr (cxt->membuf).aptr
476 #define mend (cxt->membuf).aend
478 #define MGROW (1 << 13)
479 #define MMASK (MGROW - 1)
481 #define round_mgrow(x) \
482 ((unsigned long) (((unsigned long) (x) + MMASK) & ~MMASK))
483 #define trunc_int(x) \
484 ((unsigned long) ((unsigned long) (x) & ~(sizeof(int)-1)))
485 #define int_aligned(x) \
486 ((unsigned long) (x) == trunc_int(x))
488 #define MBUF_INIT(x) \
491 TRACEME(("** allocating mbase of %d bytes", MGROW)); \
492 New(10003, mbase, MGROW, char); \
493 msiz = (STRLEN)MGROW; \
499 mend = mbase + msiz; \
502 #define MBUF_TRUNC(x) mptr = mbase + x
503 #define MBUF_SIZE() (mptr - mbase)
509 * Those macros are used in do_retrieve() to save the current memory
510 * buffer into cxt->msaved, before MBUF_LOAD() can be used to retrieve
511 * data from a string.
513 #define MBUF_SAVE_AND_LOAD(in) \
515 ASSERT(!cxt->membuf_ro, ("mbase not already saved")); \
516 cxt->membuf_ro = 1; \
517 TRACEME(("saving mbuf")); \
518 StructCopy(&cxt->membuf, &cxt->msaved, struct extendable); \
522 #define MBUF_RESTORE() \
524 ASSERT(cxt->membuf_ro, ("mbase is read-only")); \
525 cxt->membuf_ro = 0; \
526 TRACEME(("restoring mbuf")); \
527 StructCopy(&cxt->msaved, &cxt->membuf, struct extendable); \
531 * Use SvPOKp(), because SvPOK() fails on tainted scalars.
532 * See store_scalar() for other usage of this workaround.
534 #define MBUF_LOAD(v) \
536 ASSERT(cxt->membuf_ro, ("mbase is read-only")); \
538 CROAK(("Not a scalar string")); \
539 mptr = mbase = SvPV(v, msiz); \
540 mend = mbase + msiz; \
543 #define MBUF_XTEND(x) \
545 int nsz = (int) round_mgrow((x)+msiz); \
546 int offset = mptr - mbase; \
547 ASSERT(!cxt->membuf_ro, ("mbase is not read-only")); \
548 TRACEME(("** extending mbase from %d to %d bytes (wants %d new)", \
550 Renew(mbase, nsz, char); \
552 mptr = mbase + offset; \
553 mend = mbase + nsz; \
556 #define MBUF_CHK(x) \
558 if ((mptr + (x)) > mend) \
562 #define MBUF_GETC(x) \
565 x = (int) (unsigned char) *mptr++; \
571 #define MBUF_GETINT(x) \
574 if ((mptr + 4) <= mend) { \
575 memcpy(oI(&x), mptr, 4); \
581 #define MBUF_GETINT(x) \
583 if ((mptr + sizeof(int)) <= mend) { \
584 if (int_aligned(mptr)) \
587 memcpy(&x, mptr, sizeof(int)); \
588 mptr += sizeof(int); \
594 #define MBUF_READ(x,s) \
596 if ((mptr + (s)) <= mend) { \
597 memcpy(x, mptr, s); \
603 #define MBUF_SAFEREAD(x,s,z) \
605 if ((mptr + (s)) <= mend) { \
606 memcpy(x, mptr, s); \
614 #define MBUF_PUTC(c) \
617 *mptr++ = (char) c; \
620 *mptr++ = (char) c; \
625 #define MBUF_PUTINT(i) \
628 memcpy(mptr, oI(&i), 4); \
632 #define MBUF_PUTINT(i) \
634 MBUF_CHK(sizeof(int)); \
635 if (int_aligned(mptr)) \
638 memcpy(mptr, &i, sizeof(int)); \
639 mptr += sizeof(int); \
643 #define MBUF_WRITE(x,s) \
646 memcpy(mptr, x, s); \
651 * Possible return values for sv_type().
655 #define svis_SCALAR 1
659 #define svis_TIED_ITEM 5
667 #define SHF_TYPE_MASK 0x03
668 #define SHF_LARGE_CLASSLEN 0x04
669 #define SHF_LARGE_STRLEN 0x08
670 #define SHF_LARGE_LISTLEN 0x10
671 #define SHF_IDX_CLASSNAME 0x20
672 #define SHF_NEED_RECURSE 0x40
673 #define SHF_HAS_LIST 0x80
676 * Types for SX_HOOK (last 2 bits in flags).
682 #define SHT_EXTRA 3 /* Read extra byte for type */
685 * The following are held in the "extra byte"...
688 #define SHT_TSCALAR 4 /* 4 + 0 -- tied scalar */
689 #define SHT_TARRAY 5 /* 4 + 1 -- tied array */
690 #define SHT_THASH 6 /* 4 + 2 -- tied hash */
693 * per hash flags for flagged hashes
696 #define SHV_RESTRICTED 0x01
699 * per key flags for flagged hashes
702 #define SHV_K_UTF8 0x01
703 #define SHV_K_WASUTF8 0x02
704 #define SHV_K_LOCKED 0x04
705 #define SHV_K_ISSV 0x08
706 #define SHV_K_PLACEHOLDER 0x10
709 * Before 0.6, the magic string was "perl-store" (binary version number 0).
711 * Since 0.6 introduced many binary incompatibilities, the magic string has
712 * been changed to "pst0" to allow an old image to be properly retrieved by
713 * a newer Storable, but ensure a newer image cannot be retrieved with an
716 * At 0.7, objects are given the ability to serialize themselves, and the
717 * set of markers is extended, backward compatibility is not jeopardized,
718 * so the binary version number could have remained unchanged. To correctly
719 * spot errors if a file making use of 0.7-specific extensions is given to
720 * 0.6 for retrieval, the binary version was moved to "2". And I'm introducing
721 * a "minor" version, to better track this kind of evolution from now on.
724 static const char old_magicstr[] = "perl-store"; /* Magic number before 0.6 */
725 static const char magicstr[] = "pst0"; /* Used as a magic number */
727 #define MAGICSTR_BYTES 'p','s','t','0'
728 #define OLDMAGICSTR_BYTES 'p','e','r','l','-','s','t','o','r','e'
730 /* 5.6.x introduced the ability to have IVs as long long.
731 However, Configure still defined BYTEORDER based on the size of a long.
732 Storable uses the BYTEORDER value as part of the header, but doesn't
733 explicity store sizeof(IV) anywhere in the header. Hence on 5.6.x built
734 with IV as long long on a platform that uses Configure (ie most things
735 except VMS and Windows) headers are identical for the different IV sizes,
736 despite the files containing some fields based on sizeof(IV)
738 5.8 is consistent - the following redifinition kludge is only needed on
739 5.6.x, but the interwork is needed on 5.8 while data survives in files
744 #if defined (IVSIZE) && (IVSIZE == 8) && (LONGSIZE == 4)
745 #ifndef NO_56_INTERWORK_KLUDGE
746 #define USE_56_INTERWORK_KLUDGE
748 #if BYTEORDER == 0x1234
750 #define BYTEORDER 0x12345678
752 #if BYTEORDER == 0x4321
754 #define BYTEORDER 0x87654321
759 #if BYTEORDER == 0x1234
760 #define BYTEORDER_BYTES '1','2','3','4'
762 #if BYTEORDER == 0x12345678
763 #define BYTEORDER_BYTES '1','2','3','4','5','6','7','8'
764 #ifdef USE_56_INTERWORK_KLUDGE
765 #define BYTEORDER_BYTES_56 '1','2','3','4'
768 #if BYTEORDER == 0x87654321
769 #define BYTEORDER_BYTES '8','7','6','5','4','3','2','1'
770 #ifdef USE_56_INTERWORK_KLUDGE
771 #define BYTEORDER_BYTES_56 '4','3','2','1'
774 #if BYTEORDER == 0x4321
775 #define BYTEORDER_BYTES '4','3','2','1'
777 #error Unknown byteorder. Please append your byteorder to Storable.xs
783 static const char byteorderstr[] = {BYTEORDER_BYTES, 0};
784 #ifdef USE_56_INTERWORK_KLUDGE
785 static const char byteorderstr_56[] = {BYTEORDER_BYTES_56, 0};
788 #define STORABLE_BIN_MAJOR 2 /* Binary major "version" */
789 #define STORABLE_BIN_MINOR 7 /* Binary minor "version" */
791 #if (PATCHLEVEL <= 5)
792 #define STORABLE_BIN_WRITE_MINOR 4
795 * Perl 5.6.0 onwards can do weak references.
797 #define STORABLE_BIN_WRITE_MINOR 7
798 #endif /* (PATCHLEVEL <= 5) */
800 #if (PATCHLEVEL < 8 || (PATCHLEVEL == 8 && SUBVERSION < 1))
801 #define PL_sv_placeholder PL_sv_undef
805 * Useful store shortcuts...
809 * Note that if you put more than one mark for storing a particular
810 * type of thing, *and* in the retrieve_foo() function you mark both
811 * the thingy's you get off with SEEN(), you *must* increase the
812 * tagnum with cxt->tagnum++ along with this macro!
819 else if (PerlIO_putc(cxt->fio, x) == EOF) \
823 #define WRITE_I32(x) \
825 ASSERT(sizeof(x) == sizeof(I32), ("writing an I32")); \
828 else if (PerlIO_write(cxt->fio, oI(&x), oS(sizeof(x))) != oS(sizeof(x))) \
835 if (cxt->netorder) { \
836 int y = (int) htonl(x); \
839 else if (PerlIO_write(cxt->fio,oI(&y),oS(sizeof(y))) != oS(sizeof(y))) \
844 else if (PerlIO_write(cxt->fio,oI(&x),oS(sizeof(x))) != oS(sizeof(x))) \
849 #define WLEN(x) WRITE_I32(x)
856 else if (PerlIO_write(cxt->fio, x, y) != y) \
860 #define STORE_PV_LEN(pv, len, small, large) \
862 if (len <= LG_SCALAR) { \
863 unsigned char clen = (unsigned char) len; \
875 #define STORE_SCALAR(pv, len) STORE_PV_LEN(pv, len, SX_SCALAR, SX_LSCALAR)
878 * Store &PL_sv_undef in arrays without recursing through store().
880 #define STORE_SV_UNDEF() \
883 PUTMARK(SX_SV_UNDEF); \
887 * Useful retrieve shortcuts...
891 (cxt->fio ? PerlIO_getc(cxt->fio) : (mptr >= mend ? EOF : (int) *mptr++))
897 else if ((int) (x = PerlIO_getc(cxt->fio)) == EOF) \
901 #define READ_I32(x) \
903 ASSERT(sizeof(x) == sizeof(I32), ("reading an I32")); \
907 else if (PerlIO_read(cxt->fio, oI(&x), oS(sizeof(x))) != oS(sizeof(x))) \
917 else if (PerlIO_read(cxt->fio, oI(&x), oS(sizeof(x))) != oS(sizeof(x))) \
920 x = (int) ntohl(x); \
923 #define RLEN(x) READ_I32(x)
930 else if (PerlIO_read(cxt->fio, x, y) != y) \
934 #define SAFEREAD(x,y,z) \
937 MBUF_SAFEREAD(x,y,z); \
938 else if (PerlIO_read(cxt->fio, x, y) != y) { \
945 * This macro is used at retrieve time, to remember where object 'y', bearing a
946 * given tag 'tagnum', has been retrieved. Next time we see an SX_OBJECT marker,
947 * we'll therefore know where it has been retrieved and will be able to
948 * share the same reference, as in the original stored memory image.
950 * We also need to bless objects ASAP for hooks (which may compute "ref $x"
951 * on the objects given to STORABLE_thaw and expect that to be defined), and
952 * also for overloaded objects (for which we might not find the stash if the
953 * object is not blessed yet--this might occur for overloaded objects that
954 * refer to themselves indirectly: if we blessed upon return from a sub
955 * retrieve(), the SX_OBJECT marker we'd found could not have overloading
956 * restored on it because the underlying object would not be blessed yet!).
958 * To achieve that, the class name of the last retrieved object is passed down
959 * recursively, and the first SEEN() call for which the class name is not NULL
960 * will bless the object.
962 * i should be true iff sv is immortal (ie PL_sv_yes, PL_sv_no or PL_sv_undef)
964 #define SEEN(y,c,i) \
968 if (av_store(cxt->aseen, cxt->tagnum++, i ? (SV*)(y) : SvREFCNT_inc(y)) == 0) \
970 TRACEME(("aseen(#%d) = 0x%"UVxf" (refcnt=%d)", cxt->tagnum-1, \
971 PTR2UV(y), SvREFCNT(y)-1)); \
973 BLESS((SV *) (y), c); \
977 * Bless `s' in `p', via a temporary reference, required by sv_bless().
983 TRACEME(("blessing 0x%"UVxf" in %s", PTR2UV(s), (p))); \
984 stash = gv_stashpv((p), TRUE); \
985 ref = newRV_noinc(s); \
986 (void) sv_bless(ref, stash); \
987 SvRV_set(ref, NULL); \
991 * sort (used in store_hash) - conditionally use qsort when
992 * sortsv is not available ( <= 5.6.1 ).
995 #if (PATCHLEVEL <= 6)
997 #if defined(USE_ITHREADS)
999 #define STORE_HASH_SORT \
1001 PerlInterpreter *orig_perl = PERL_GET_CONTEXT; \
1002 SAVESPTR(orig_perl); \
1003 PERL_SET_CONTEXT(aTHX); \
1004 qsort((char *) AvARRAY(av), len, sizeof(SV *), sortcmp); \
1007 #else /* ! USE_ITHREADS */
1009 #define STORE_HASH_SORT \
1010 qsort((char *) AvARRAY(av), len, sizeof(SV *), sortcmp);
1012 #endif /* USE_ITHREADS */
1014 #else /* PATCHLEVEL > 6 */
1016 #define STORE_HASH_SORT \
1017 sortsv(AvARRAY(av), len, Perl_sv_cmp);
1019 #endif /* PATCHLEVEL <= 6 */
1021 static int store(pTHX_ stcxt_t *cxt, SV *sv);
1022 static SV *retrieve(pTHX_ stcxt_t *cxt, char *cname);
1025 * Dynamic dispatching table for SV store.
1028 static int store_ref(pTHX_ stcxt_t *cxt, SV *sv);
1029 static int store_scalar(pTHX_ stcxt_t *cxt, SV *sv);
1030 static int store_array(pTHX_ stcxt_t *cxt, AV *av);
1031 static int store_hash(pTHX_ stcxt_t *cxt, HV *hv);
1032 static int store_tied(pTHX_ stcxt_t *cxt, SV *sv);
1033 static int store_tied_item(pTHX_ stcxt_t *cxt, SV *sv);
1034 static int store_code(pTHX_ stcxt_t *cxt, CV *cv);
1035 static int store_other(pTHX_ stcxt_t *cxt, SV *sv);
1036 static int store_blessed(pTHX_ stcxt_t *cxt, SV *sv, int type, HV *pkg);
1038 typedef int (*sv_store_t)(pTHX_ stcxt_t *cxt, SV *sv);
1040 static const sv_store_t sv_store[] = {
1041 (sv_store_t)store_ref, /* svis_REF */
1042 (sv_store_t)store_scalar, /* svis_SCALAR */
1043 (sv_store_t)store_array, /* svis_ARRAY */
1044 (sv_store_t)store_hash, /* svis_HASH */
1045 (sv_store_t)store_tied, /* svis_TIED */
1046 (sv_store_t)store_tied_item, /* svis_TIED_ITEM */
1047 (sv_store_t)store_code, /* svis_CODE */
1048 (sv_store_t)store_other, /* svis_OTHER */
1051 #define SV_STORE(x) (*sv_store[x])
1054 * Dynamic dispatching tables for SV retrieval.
1057 static SV *retrieve_lscalar(pTHX_ stcxt_t *cxt, char *cname);
1058 static SV *retrieve_lutf8str(pTHX_ stcxt_t *cxt, char *cname);
1059 static SV *old_retrieve_array(pTHX_ stcxt_t *cxt, char *cname);
1060 static SV *old_retrieve_hash(pTHX_ stcxt_t *cxt, char *cname);
1061 static SV *retrieve_ref(pTHX_ stcxt_t *cxt, char *cname);
1062 static SV *retrieve_undef(pTHX_ stcxt_t *cxt, char *cname);
1063 static SV *retrieve_integer(pTHX_ stcxt_t *cxt, char *cname);
1064 static SV *retrieve_double(pTHX_ stcxt_t *cxt, char *cname);
1065 static SV *retrieve_byte(pTHX_ stcxt_t *cxt, char *cname);
1066 static SV *retrieve_netint(pTHX_ stcxt_t *cxt, char *cname);
1067 static SV *retrieve_scalar(pTHX_ stcxt_t *cxt, char *cname);
1068 static SV *retrieve_utf8str(pTHX_ stcxt_t *cxt, char *cname);
1069 static SV *retrieve_tied_array(pTHX_ stcxt_t *cxt, char *cname);
1070 static SV *retrieve_tied_hash(pTHX_ stcxt_t *cxt, char *cname);
1071 static SV *retrieve_tied_scalar(pTHX_ stcxt_t *cxt, char *cname);
1072 static SV *retrieve_other(pTHX_ stcxt_t *cxt, char *cname);
1074 typedef SV* (*sv_retrieve_t)(pTHX_ stcxt_t *cxt, char *name);
1076 static const sv_retrieve_t sv_old_retrieve[] = {
1077 0, /* SX_OBJECT -- entry unused dynamically */
1078 (sv_retrieve_t)retrieve_lscalar, /* SX_LSCALAR */
1079 (sv_retrieve_t)old_retrieve_array, /* SX_ARRAY -- for pre-0.6 binaries */
1080 (sv_retrieve_t)old_retrieve_hash, /* SX_HASH -- for pre-0.6 binaries */
1081 (sv_retrieve_t)retrieve_ref, /* SX_REF */
1082 (sv_retrieve_t)retrieve_undef, /* SX_UNDEF */
1083 (sv_retrieve_t)retrieve_integer, /* SX_INTEGER */
1084 (sv_retrieve_t)retrieve_double, /* SX_DOUBLE */
1085 (sv_retrieve_t)retrieve_byte, /* SX_BYTE */
1086 (sv_retrieve_t)retrieve_netint, /* SX_NETINT */
1087 (sv_retrieve_t)retrieve_scalar, /* SX_SCALAR */
1088 (sv_retrieve_t)retrieve_tied_array, /* SX_ARRAY */
1089 (sv_retrieve_t)retrieve_tied_hash, /* SX_HASH */
1090 (sv_retrieve_t)retrieve_tied_scalar, /* SX_SCALAR */
1091 (sv_retrieve_t)retrieve_other, /* SX_SV_UNDEF not supported */
1092 (sv_retrieve_t)retrieve_other, /* SX_SV_YES not supported */
1093 (sv_retrieve_t)retrieve_other, /* SX_SV_NO not supported */
1094 (sv_retrieve_t)retrieve_other, /* SX_BLESS not supported */
1095 (sv_retrieve_t)retrieve_other, /* SX_IX_BLESS not supported */
1096 (sv_retrieve_t)retrieve_other, /* SX_HOOK not supported */
1097 (sv_retrieve_t)retrieve_other, /* SX_OVERLOADED not supported */
1098 (sv_retrieve_t)retrieve_other, /* SX_TIED_KEY not supported */
1099 (sv_retrieve_t)retrieve_other, /* SX_TIED_IDX not supported */
1100 (sv_retrieve_t)retrieve_other, /* SX_UTF8STR not supported */
1101 (sv_retrieve_t)retrieve_other, /* SX_LUTF8STR not supported */
1102 (sv_retrieve_t)retrieve_other, /* SX_FLAG_HASH not supported */
1103 (sv_retrieve_t)retrieve_other, /* SX_CODE not supported */
1104 (sv_retrieve_t)retrieve_other, /* SX_WEAKREF not supported */
1105 (sv_retrieve_t)retrieve_other, /* SX_WEAKOVERLOAD not supported */
1106 (sv_retrieve_t)retrieve_other, /* SX_ERROR */
1109 static SV *retrieve_array(pTHX_ stcxt_t *cxt, char *cname);
1110 static SV *retrieve_hash(pTHX_ stcxt_t *cxt, char *cname);
1111 static SV *retrieve_sv_undef(pTHX_ stcxt_t *cxt, char *cname);
1112 static SV *retrieve_sv_yes(pTHX_ stcxt_t *cxt, char *cname);
1113 static SV *retrieve_sv_no(pTHX_ stcxt_t *cxt, char *cname);
1114 static SV *retrieve_blessed(pTHX_ stcxt_t *cxt, char *cname);
1115 static SV *retrieve_idx_blessed(pTHX_ stcxt_t *cxt, char *cname);
1116 static SV *retrieve_hook(pTHX_ stcxt_t *cxt, char *cname);
1117 static SV *retrieve_overloaded(pTHX_ stcxt_t *cxt, char *cname);
1118 static SV *retrieve_tied_key(pTHX_ stcxt_t *cxt, char *cname);
1119 static SV *retrieve_tied_idx(pTHX_ stcxt_t *cxt, char *cname);
1120 static SV *retrieve_flag_hash(pTHX_ stcxt_t *cxt, char *cname);
1121 static SV *retrieve_code(pTHX_ stcxt_t *cxt, char *cname);
1122 static SV *retrieve_weakref(pTHX_ stcxt_t *cxt, char *cname);
1123 static SV *retrieve_weakoverloaded(pTHX_ stcxt_t *cxt, char *cname);
1125 static const sv_retrieve_t sv_retrieve[] = {
1126 0, /* SX_OBJECT -- entry unused dynamically */
1127 (sv_retrieve_t)retrieve_lscalar, /* SX_LSCALAR */
1128 (sv_retrieve_t)retrieve_array, /* SX_ARRAY */
1129 (sv_retrieve_t)retrieve_hash, /* SX_HASH */
1130 (sv_retrieve_t)retrieve_ref, /* SX_REF */
1131 (sv_retrieve_t)retrieve_undef, /* SX_UNDEF */
1132 (sv_retrieve_t)retrieve_integer, /* SX_INTEGER */
1133 (sv_retrieve_t)retrieve_double, /* SX_DOUBLE */
1134 (sv_retrieve_t)retrieve_byte, /* SX_BYTE */
1135 (sv_retrieve_t)retrieve_netint, /* SX_NETINT */
1136 (sv_retrieve_t)retrieve_scalar, /* SX_SCALAR */
1137 (sv_retrieve_t)retrieve_tied_array, /* SX_ARRAY */
1138 (sv_retrieve_t)retrieve_tied_hash, /* SX_HASH */
1139 (sv_retrieve_t)retrieve_tied_scalar, /* SX_SCALAR */
1140 (sv_retrieve_t)retrieve_sv_undef, /* SX_SV_UNDEF */
1141 (sv_retrieve_t)retrieve_sv_yes, /* SX_SV_YES */
1142 (sv_retrieve_t)retrieve_sv_no, /* SX_SV_NO */
1143 (sv_retrieve_t)retrieve_blessed, /* SX_BLESS */
1144 (sv_retrieve_t)retrieve_idx_blessed, /* SX_IX_BLESS */
1145 (sv_retrieve_t)retrieve_hook, /* SX_HOOK */
1146 (sv_retrieve_t)retrieve_overloaded, /* SX_OVERLOAD */
1147 (sv_retrieve_t)retrieve_tied_key, /* SX_TIED_KEY */
1148 (sv_retrieve_t)retrieve_tied_idx, /* SX_TIED_IDX */
1149 (sv_retrieve_t)retrieve_utf8str, /* SX_UTF8STR */
1150 (sv_retrieve_t)retrieve_lutf8str, /* SX_LUTF8STR */
1151 (sv_retrieve_t)retrieve_flag_hash, /* SX_HASH */
1152 (sv_retrieve_t)retrieve_code, /* SX_CODE */
1153 (sv_retrieve_t)retrieve_weakref, /* SX_WEAKREF */
1154 (sv_retrieve_t)retrieve_weakoverloaded, /* SX_WEAKOVERLOAD */
1155 (sv_retrieve_t)retrieve_other, /* SX_ERROR */
1158 #define RETRIEVE(c,x) (*(c)->retrieve_vtbl[(x) >= SX_ERROR ? SX_ERROR : (x)])
1160 static SV *mbuf2sv(pTHX);
1163 *** Context management.
1169 * Called once per "thread" (interpreter) to initialize some global context.
1171 static void init_perinterp(pTHX)
1175 cxt->netorder = 0; /* true if network order used */
1176 cxt->forgive_me = -1; /* whether to be forgiving... */
1177 cxt->accept_future_minor = -1; /* would otherwise occur too late */
1183 * Called at the end of every context cleaning, to perform common reset
1186 static void reset_context(stcxt_t *cxt)
1190 cxt->optype &= ~(ST_STORE|ST_RETRIEVE); /* Leave ST_CLONE alone */
1194 * init_store_context
1196 * Initialize a new store context for real recursion.
1198 static void init_store_context(
1205 TRACEME(("init_store_context"));
1207 cxt->netorder = network_order;
1208 cxt->forgive_me = -1; /* Fetched from perl if needed */
1209 cxt->deparse = -1; /* Idem */
1210 cxt->eval = NULL; /* Idem */
1211 cxt->canonical = -1; /* Idem */
1212 cxt->tagnum = -1; /* Reset tag numbers */
1213 cxt->classnum = -1; /* Reset class numbers */
1214 cxt->fio = f; /* Where I/O are performed */
1215 cxt->optype = optype; /* A store, or a deep clone */
1216 cxt->entry = 1; /* No recursion yet */
1219 * The `hseen' table is used to keep track of each SV stored and their
1220 * associated tag numbers is special. It is "abused" because the
1221 * values stored are not real SV, just integers cast to (SV *),
1222 * which explains the freeing below.
1224 * It is also one possible bottlneck to achieve good storing speed,
1225 * so the "shared keys" optimization is turned off (unlikely to be
1226 * of any use here), and the hash table is "pre-extended". Together,
1227 * those optimizations increase the throughput by 12%.
1230 cxt->hseen = newHV(); /* Table where seen objects are stored */
1231 HvSHAREKEYS_off(cxt->hseen);
1234 * The following does not work well with perl5.004_04, and causes
1235 * a core dump later on, in a completely unrelated spot, which
1236 * makes me think there is a memory corruption going on.
1238 * Calling hv_ksplit(hseen, HBUCKETS) instead of manually hacking
1239 * it below does not make any difference. It seems to work fine
1240 * with perl5.004_68 but given the probable nature of the bug,
1241 * that does not prove anything.
1243 * It's a shame because increasing the amount of buckets raises
1244 * store() throughput by 5%, but until I figure this out, I can't
1245 * allow for this to go into production.
1247 * It is reported fixed in 5.005, hence the #if.
1249 #if PERL_VERSION >= 5
1250 #define HBUCKETS 4096 /* Buckets for %hseen */
1251 HvMAX(cxt->hseen) = HBUCKETS - 1; /* keys %hseen = $HBUCKETS; */
1255 * The `hclass' hash uses the same settings as `hseen' above, but it is
1256 * used to assign sequential tags (numbers) to class names for blessed
1259 * We turn the shared key optimization on.
1262 cxt->hclass = newHV(); /* Where seen classnames are stored */
1264 #if PERL_VERSION >= 5
1265 HvMAX(cxt->hclass) = HBUCKETS - 1; /* keys %hclass = $HBUCKETS; */
1269 * The `hook' hash table is used to keep track of the references on
1270 * the STORABLE_freeze hook routines, when found in some class name.
1272 * It is assumed that the inheritance tree will not be changed during
1273 * storing, and that no new method will be dynamically created by the
1277 cxt->hook = newHV(); /* Table where hooks are cached */
1280 * The `hook_seen' array keeps track of all the SVs returned by
1281 * STORABLE_freeze hooks for us to serialize, so that they are not
1282 * reclaimed until the end of the serialization process. Each SV is
1283 * only stored once, the first time it is seen.
1286 cxt->hook_seen = newAV(); /* Lists SVs returned by STORABLE_freeze */
1290 * clean_store_context
1292 * Clean store context by
1294 static void clean_store_context(pTHX_ stcxt_t *cxt)
1298 TRACEME(("clean_store_context"));
1300 ASSERT(cxt->optype & ST_STORE, ("was performing a store()"));
1303 * Insert real values into hashes where we stored faked pointers.
1307 hv_iterinit(cxt->hseen);
1308 while ((he = hv_iternext(cxt->hseen))) /* Extra () for -Wall, grr.. */
1309 HeVAL(he) = &PL_sv_undef;
1313 hv_iterinit(cxt->hclass);
1314 while ((he = hv_iternext(cxt->hclass))) /* Extra () for -Wall, grr.. */
1315 HeVAL(he) = &PL_sv_undef;
1319 * And now dispose of them...
1321 * The surrounding if() protection has been added because there might be
1322 * some cases where this routine is called more than once, during
1323 * exceptionnal events. This was reported by Marc Lehmann when Storable
1324 * is executed from mod_perl, and the fix was suggested by him.
1325 * -- RAM, 20/12/2000
1329 HV *hseen = cxt->hseen;
1332 sv_free((SV *) hseen);
1336 HV *hclass = cxt->hclass;
1339 sv_free((SV *) hclass);
1343 HV *hook = cxt->hook;
1346 sv_free((SV *) hook);
1349 if (cxt->hook_seen) {
1350 AV *hook_seen = cxt->hook_seen;
1352 av_undef(hook_seen);
1353 sv_free((SV *) hook_seen);
1356 cxt->forgive_me = -1; /* Fetched from perl if needed */
1357 cxt->deparse = -1; /* Idem */
1359 SvREFCNT_dec(cxt->eval);
1361 cxt->eval = NULL; /* Idem */
1362 cxt->canonical = -1; /* Idem */
1368 * init_retrieve_context
1370 * Initialize a new retrieve context for real recursion.
1372 static void init_retrieve_context(pTHX_ stcxt_t *cxt, int optype, int is_tainted)
1374 TRACEME(("init_retrieve_context"));
1377 * The hook hash table is used to keep track of the references on
1378 * the STORABLE_thaw hook routines, when found in some class name.
1380 * It is assumed that the inheritance tree will not be changed during
1381 * storing, and that no new method will be dynamically created by the
1385 cxt->hook = newHV(); /* Caches STORABLE_thaw */
1388 * If retrieving an old binary version, the cxt->retrieve_vtbl variable
1389 * was set to sv_old_retrieve. We'll need a hash table to keep track of
1390 * the correspondance between the tags and the tag number used by the
1391 * new retrieve routines.
1394 cxt->hseen = (((void*)cxt->retrieve_vtbl == (void*)sv_old_retrieve)
1397 cxt->aseen = newAV(); /* Where retrieved objects are kept */
1398 cxt->where_is_undef = -1; /* Special case for PL_sv_undef */
1399 cxt->aclass = newAV(); /* Where seen classnames are kept */
1400 cxt->tagnum = 0; /* Have to count objects... */
1401 cxt->classnum = 0; /* ...and class names as well */
1402 cxt->optype = optype;
1403 cxt->s_tainted = is_tainted;
1404 cxt->entry = 1; /* No recursion yet */
1405 #ifndef HAS_RESTRICTED_HASHES
1406 cxt->derestrict = -1; /* Fetched from perl if needed */
1408 #ifndef HAS_UTF8_ALL
1409 cxt->use_bytes = -1; /* Fetched from perl if needed */
1411 cxt->accept_future_minor = -1; /* Fetched from perl if needed */
1415 * clean_retrieve_context
1417 * Clean retrieve context by
1419 static void clean_retrieve_context(pTHX_ stcxt_t *cxt)
1421 TRACEME(("clean_retrieve_context"));
1423 ASSERT(cxt->optype & ST_RETRIEVE, ("was performing a retrieve()"));
1426 AV *aseen = cxt->aseen;
1429 sv_free((SV *) aseen);
1431 cxt->where_is_undef = -1;
1434 AV *aclass = cxt->aclass;
1437 sv_free((SV *) aclass);
1441 HV *hook = cxt->hook;
1444 sv_free((SV *) hook);
1448 HV *hseen = cxt->hseen;
1451 sv_free((SV *) hseen); /* optional HV, for backward compat. */
1454 #ifndef HAS_RESTRICTED_HASHES
1455 cxt->derestrict = -1; /* Fetched from perl if needed */
1457 #ifndef HAS_UTF8_ALL
1458 cxt->use_bytes = -1; /* Fetched from perl if needed */
1460 cxt->accept_future_minor = -1; /* Fetched from perl if needed */
1468 * A workaround for the CROAK bug: cleanup the last context.
1470 static void clean_context(pTHX_ stcxt_t *cxt)
1472 TRACEME(("clean_context"));
1474 ASSERT(cxt->s_dirty, ("dirty context"));
1479 ASSERT(!cxt->membuf_ro, ("mbase is not read-only"));
1481 if (cxt->optype & ST_RETRIEVE)
1482 clean_retrieve_context(aTHX_ cxt);
1483 else if (cxt->optype & ST_STORE)
1484 clean_store_context(aTHX_ cxt);
1488 ASSERT(!cxt->s_dirty, ("context is clean"));
1489 ASSERT(cxt->entry == 0, ("context is reset"));
1495 * Allocate a new context and push it on top of the parent one.
1496 * This new context is made globally visible via SET_STCXT().
1498 static stcxt_t *allocate_context(pTHX_ stcxt_t *parent_cxt)
1502 TRACEME(("allocate_context"));
1504 ASSERT(!parent_cxt->s_dirty, ("parent context clean"));
1506 NEW_STORABLE_CXT_OBJ(cxt);
1507 cxt->prev = parent_cxt->my_sv;
1510 ASSERT(!cxt->s_dirty, ("clean context"));
1518 * Free current context, which cannot be the "root" one.
1519 * Make the context underneath globally visible via SET_STCXT().
1521 static void free_context(pTHX_ stcxt_t *cxt)
1523 stcxt_t *prev = (stcxt_t *)(cxt->prev ? SvPVX(SvRV(cxt->prev)) : 0);
1525 TRACEME(("free_context"));
1527 ASSERT(!cxt->s_dirty, ("clean context"));
1528 ASSERT(prev, ("not freeing root context"));
1530 SvREFCNT_dec(cxt->my_sv);
1533 ASSERT(cxt, ("context not void"));
1543 * Tells whether we're in the middle of a store operation.
1545 int is_storing(pTHX)
1549 return cxt->entry && (cxt->optype & ST_STORE);
1555 * Tells whether we're in the middle of a retrieve operation.
1557 int is_retrieving(pTHX)
1561 return cxt->entry && (cxt->optype & ST_RETRIEVE);
1565 * last_op_in_netorder
1567 * Returns whether last operation was made using network order.
1569 * This is typically out-of-band information that might prove useful
1570 * to people wishing to convert native to network order data when used.
1572 int last_op_in_netorder(pTHX)
1576 return cxt->netorder;
1580 *** Hook lookup and calling routines.
1586 * A wrapper on gv_fetchmethod_autoload() which caches results.
1588 * Returns the routine reference as an SV*, or null if neither the package
1589 * nor its ancestors know about the method.
1591 static SV *pkg_fetchmeth(
1601 * The following code is the same as the one performed by UNIVERSAL::can
1605 gv = gv_fetchmethod_autoload(pkg, method, FALSE);
1606 if (gv && isGV(gv)) {
1607 sv = newRV((SV*) GvCV(gv));
1608 TRACEME(("%s->%s: 0x%"UVxf, HvNAME(pkg), method, PTR2UV(sv)));
1610 sv = newSVsv(&PL_sv_undef);
1611 TRACEME(("%s->%s: not found", HvNAME(pkg), method));
1615 * Cache the result, ignoring failure: if we can't store the value,
1616 * it just won't be cached.
1619 (void) hv_store(cache, HvNAME(pkg), strlen(HvNAME(pkg)), sv, 0);
1621 return SvOK(sv) ? sv : (SV *) 0;
1627 * Force cached value to be undef: hook ignored even if present.
1629 static void pkg_hide(
1635 (void) hv_store(cache,
1636 HvNAME(pkg), strlen(HvNAME(pkg)), newSVsv(&PL_sv_undef), 0);
1642 * Discard cached value: a whole fetch loop will be retried at next lookup.
1644 static void pkg_uncache(
1650 (void) hv_delete(cache, HvNAME(pkg), strlen(HvNAME(pkg)), G_DISCARD);
1656 * Our own "UNIVERSAL::can", which caches results.
1658 * Returns the routine reference as an SV*, or null if the object does not
1659 * know about the method.
1670 TRACEME(("pkg_can for %s->%s", HvNAME(pkg), method));
1673 * Look into the cache to see whether we already have determined
1674 * where the routine was, if any.
1676 * NOTA BENE: we don't use `method' at all in our lookup, since we know
1677 * that only one hook (i.e. always the same) is cached in a given cache.
1680 svh = hv_fetch(cache, HvNAME(pkg), strlen(HvNAME(pkg)), FALSE);
1684 TRACEME(("cached %s->%s: not found", HvNAME(pkg), method));
1687 TRACEME(("cached %s->%s: 0x%"UVxf,
1688 HvNAME(pkg), method, PTR2UV(sv)));
1693 TRACEME(("not cached yet"));
1694 return pkg_fetchmeth(aTHX_ cache, pkg, method); /* Fetch and cache */
1700 * Call routine as obj->hook(av) in scalar context.
1701 * Propagates the single returned value if not called in void context.
1703 static SV *scalar_call(
1715 TRACEME(("scalar_call (cloning=%d)", cloning));
1722 XPUSHs(sv_2mortal(newSViv(cloning))); /* Cloning flag */
1724 SV **ary = AvARRAY(av);
1725 int cnt = AvFILLp(av) + 1;
1727 XPUSHs(ary[0]); /* Frozen string */
1728 for (i = 1; i < cnt; i++) {
1729 TRACEME(("pushing arg #%d (0x%"UVxf")...",
1730 i, PTR2UV(ary[i])));
1731 XPUSHs(sv_2mortal(newRV(ary[i])));
1736 TRACEME(("calling..."));
1737 count = perl_call_sv(hook, flags); /* Go back to Perl code */
1738 TRACEME(("count = %d", count));
1744 SvREFCNT_inc(sv); /* We're returning it, must stay alive! */
1757 * Call routine obj->hook(cloning) in list context.
1758 * Returns the list of returned values in an array.
1760 static AV *array_call(
1771 TRACEME(("array_call (cloning=%d)", cloning));
1777 XPUSHs(obj); /* Target object */
1778 XPUSHs(sv_2mortal(newSViv(cloning))); /* Cloning flag */
1781 count = perl_call_sv(hook, G_ARRAY); /* Go back to Perl code */
1786 for (i = count - 1; i >= 0; i--) {
1788 av_store(av, i, SvREFCNT_inc(sv));
1801 * Lookup the class name in the `hclass' table and either assign it a new ID
1802 * or return the existing one, by filling in `classnum'.
1804 * Return true if the class was known, false if the ID was just generated.
1806 static int known_class(
1809 char *name, /* Class name */
1810 int len, /* Name length */
1814 HV *hclass = cxt->hclass;
1816 TRACEME(("known_class (%s)", name));
1819 * Recall that we don't store pointers in this hash table, but tags.
1820 * Therefore, we need LOW_32BITS() to extract the relevant parts.
1823 svh = hv_fetch(hclass, name, len, FALSE);
1825 *classnum = LOW_32BITS(*svh);
1830 * Unknown classname, we need to record it.
1834 if (!hv_store(hclass, name, len, INT2PTR(SV*, cxt->classnum), 0))
1835 CROAK(("Unable to record new classname"));
1837 *classnum = cxt->classnum;
1842 *** Sepcific store routines.
1848 * Store a reference.
1849 * Layout is SX_REF <object> or SX_OVERLOAD <object>.
1851 static int store_ref(pTHX_ stcxt_t *cxt, SV *sv)
1854 TRACEME(("store_ref (0x%"UVxf")", PTR2UV(sv)));
1857 * Follow reference, and check if target is overloaded.
1863 TRACEME(("ref (0x%"UVxf") is%s weak", PTR2UV(sv), is_weak ? "" : "n't"));
1868 HV *stash = (HV *) SvSTASH(sv);
1869 if (stash && Gv_AMG(stash)) {
1870 TRACEME(("ref (0x%"UVxf") is overloaded", PTR2UV(sv)));
1871 PUTMARK(is_weak ? SX_WEAKOVERLOAD : SX_OVERLOAD);
1873 PUTMARK(is_weak ? SX_WEAKREF : SX_REF);
1875 PUTMARK(is_weak ? SX_WEAKREF : SX_REF);
1877 return store(aTHX_ cxt, sv);
1885 * Layout is SX_LSCALAR <length> <data>, SX_SCALAR <length> <data> or SX_UNDEF.
1886 * The <data> section is omitted if <length> is 0.
1888 * If integer or double, the layout is SX_INTEGER <data> or SX_DOUBLE <data>.
1889 * Small integers (within [-127, +127]) are stored as SX_BYTE <byte>.
1891 static int store_scalar(pTHX_ stcxt_t *cxt, SV *sv)
1896 U32 flags = SvFLAGS(sv); /* "cc -O" may put it in register */
1898 TRACEME(("store_scalar (0x%"UVxf")", PTR2UV(sv)));
1901 * For efficiency, break the SV encapsulation by peaking at the flags
1902 * directly without using the Perl macros to avoid dereferencing
1903 * sv->sv_flags each time we wish to check the flags.
1906 if (!(flags & SVf_OK)) { /* !SvOK(sv) */
1907 if (sv == &PL_sv_undef) {
1908 TRACEME(("immortal undef"));
1909 PUTMARK(SX_SV_UNDEF);
1911 TRACEME(("undef at 0x%"UVxf, PTR2UV(sv)));
1918 * Always store the string representation of a scalar if it exists.
1919 * Gisle Aas provided me with this test case, better than a long speach:
1921 * perl -MDevel::Peek -le '$a="abc"; $a+0; Dump($a)'
1922 * SV = PVNV(0x80c8520)
1924 * FLAGS = (NOK,POK,pNOK,pPOK)
1927 * PV = 0x80c83d0 "abc"\0
1931 * Write SX_SCALAR, length, followed by the actual data.
1933 * Otherwise, write an SX_BYTE, SX_INTEGER or an SX_DOUBLE as
1934 * appropriate, followed by the actual (binary) data. A double
1935 * is written as a string if network order, for portability.
1937 * NOTE: instead of using SvNOK(sv), we test for SvNOKp(sv).
1938 * The reason is that when the scalar value is tainted, the SvNOK(sv)
1941 * The test for a read-only scalar with both POK and NOK set is meant
1942 * to quickly detect &PL_sv_yes and &PL_sv_no without having to pay the
1943 * address comparison for each scalar we store.
1946 #define SV_MAYBE_IMMORTAL (SVf_READONLY|SVf_POK|SVf_NOK)
1948 if ((flags & SV_MAYBE_IMMORTAL) == SV_MAYBE_IMMORTAL) {
1949 if (sv == &PL_sv_yes) {
1950 TRACEME(("immortal yes"));
1952 } else if (sv == &PL_sv_no) {
1953 TRACEME(("immortal no"));
1956 pv = SvPV(sv, len); /* We know it's SvPOK */
1957 goto string; /* Share code below */
1959 } else if (flags & SVf_POK) {
1960 /* public string - go direct to string read. */
1961 goto string_readlen;
1963 #if (PATCHLEVEL <= 6)
1964 /* For 5.6 and earlier NV flag trumps IV flag, so only use integer
1965 direct if NV flag is off. */
1966 (flags & (SVf_NOK | SVf_IOK)) == SVf_IOK
1968 /* 5.7 rules are that if IV public flag is set, IV value is as
1969 good, if not better, than NV value. */
1975 * Will come here from below with iv set if double is an integer.
1979 /* Sorry. This isn't in 5.005_56 (IIRC) or earlier. */
1981 /* Need to do this out here, else 0xFFFFFFFF becomes iv of -1
1982 * (for example) and that ends up in the optimised small integer
1985 if ((flags & SVf_IVisUV) && SvUV(sv) > IV_MAX) {
1986 TRACEME(("large unsigned integer as string, value = %"UVuf, SvUV(sv)));
1987 goto string_readlen;
1991 * Optimize small integers into a single byte, otherwise store as
1992 * a real integer (converted into network order if they asked).
1995 if (iv >= -128 && iv <= 127) {
1996 unsigned char siv = (unsigned char) (iv + 128); /* [0,255] */
1999 TRACEME(("small integer stored as %d", siv));
2000 } else if (cxt->netorder) {
2002 TRACEME(("no htonl, fall back to string for integer"));
2003 goto string_readlen;
2011 /* Sorry. This isn't in 5.005_56 (IIRC) or earlier. */
2012 ((flags & SVf_IVisUV) && SvUV(sv) > 0x7FFFFFFF) ||
2014 (iv > 0x7FFFFFFF) || (iv < -0x80000000)) {
2015 /* Bigger than 32 bits. */
2016 TRACEME(("large network order integer as string, value = %"IVdf, iv));
2017 goto string_readlen;
2021 niv = (I32) htonl((I32) iv);
2022 TRACEME(("using network order"));
2027 PUTMARK(SX_INTEGER);
2028 WRITE(&iv, sizeof(iv));
2031 TRACEME(("ok (integer 0x%"UVxf", value = %"IVdf")", PTR2UV(sv), iv));
2032 } else if (flags & SVf_NOK) {
2034 #if (PATCHLEVEL <= 6)
2037 * Watch for number being an integer in disguise.
2039 if (nv == (NV) (iv = I_V(nv))) {
2040 TRACEME(("double %"NVff" is actually integer %"IVdf, nv, iv));
2041 goto integer; /* Share code above */
2046 if (SvIOK_notUV(sv)) {
2048 goto integer; /* Share code above */
2053 if (cxt->netorder) {
2054 TRACEME(("double %"NVff" stored as string", nv));
2055 goto string_readlen; /* Share code below */
2059 WRITE(&nv, sizeof(nv));
2061 TRACEME(("ok (double 0x%"UVxf", value = %"NVff")", PTR2UV(sv), nv));
2063 } else if (flags & (SVp_POK | SVp_NOK | SVp_IOK)) {
2064 I32 wlen; /* For 64-bit machines */
2070 * Will come here from above if it was readonly, POK and NOK but
2071 * neither &PL_sv_yes nor &PL_sv_no.
2075 wlen = (I32) len; /* WLEN via STORE_SCALAR expects I32 */
2077 STORE_UTF8STR(pv, wlen);
2079 STORE_SCALAR(pv, wlen);
2080 TRACEME(("ok (scalar 0x%"UVxf" '%s', length = %"IVdf")",
2081 PTR2UV(sv), SvPVX(sv), (IV)len));
2083 CROAK(("Can't determine type of %s(0x%"UVxf")",
2084 sv_reftype(sv, FALSE),
2086 return 0; /* Ok, no recursion on scalars */
2094 * Layout is SX_ARRAY <size> followed by each item, in increading index order.
2095 * Each item is stored as <object>.
2097 static int store_array(pTHX_ stcxt_t *cxt, AV *av)
2100 I32 len = av_len(av) + 1;
2104 TRACEME(("store_array (0x%"UVxf")", PTR2UV(av)));
2107 * Signal array by emitting SX_ARRAY, followed by the array length.
2112 TRACEME(("size = %d", len));
2115 * Now store each item recursively.
2118 for (i = 0; i < len; i++) {
2119 sav = av_fetch(av, i, 0);
2121 TRACEME(("(#%d) undef item", i));
2125 TRACEME(("(#%d) item", i));
2126 if ((ret = store(aTHX_ cxt, *sav))) /* Extra () for -Wall, grr... */
2130 TRACEME(("ok (array)"));
2136 #if (PATCHLEVEL <= 6)
2142 * Borrowed from perl source file pp_ctl.c, where it is used by pp_sort.
2145 sortcmp(const void *a, const void *b)
2147 #if defined(USE_ITHREADS)
2149 #endif /* USE_ITHREADS */
2150 return sv_cmp(*(SV * const *) a, *(SV * const *) b);
2153 #endif /* PATCHLEVEL <= 6 */
2158 * Store a hash table.
2160 * For a "normal" hash (not restricted, no utf8 keys):
2162 * Layout is SX_HASH <size> followed by each key/value pair, in random order.
2163 * Values are stored as <object>.
2164 * Keys are stored as <length> <data>, the <data> section being omitted
2167 * For a "fancy" hash (restricted or utf8 keys):
2169 * Layout is SX_FLAG_HASH <size> <hash flags> followed by each key/value pair,
2171 * Values are stored as <object>.
2172 * Keys are stored as <flags> <length> <data>, the <data> section being omitted
2174 * Currently the only hash flag is "restriced"
2175 * Key flags are as for hv.h
2177 static int store_hash(pTHX_ stcxt_t *cxt, HV *hv)
2181 #ifdef HAS_RESTRICTED_HASHES
2190 int flagged_hash = ((SvREADONLY(hv)
2191 #ifdef HAS_HASH_KEY_FLAGS
2195 unsigned char hash_flags = (SvREADONLY(hv) ? SHV_RESTRICTED : 0);
2198 /* needs int cast for C++ compilers, doesn't it? */
2199 TRACEME(("store_hash (0x%"UVxf") (flags %x)", PTR2UV(hv),
2202 TRACEME(("store_hash (0x%"UVxf")", PTR2UV(hv)));
2206 * Signal hash by emitting SX_HASH, followed by the table length.
2210 PUTMARK(SX_FLAG_HASH);
2211 PUTMARK(hash_flags);
2216 TRACEME(("size = %d", len));
2219 * Save possible iteration state via each() on that table.
2222 riter = HvRITER(hv);
2223 eiter = HvEITER(hv);
2227 * Now store each item recursively.
2229 * If canonical is defined to some true value then store each
2230 * key/value pair in sorted order otherwise the order is random.
2231 * Canonical order is irrelevant when a deep clone operation is performed.
2233 * Fetch the value from perl only once per store() operation, and only
2238 !(cxt->optype & ST_CLONE) && (cxt->canonical == 1 ||
2239 (cxt->canonical < 0 && (cxt->canonical =
2240 (SvTRUE(perl_get_sv("Storable::canonical", TRUE)) ? 1 : 0))))
2243 * Storing in order, sorted by key.
2244 * Run through the hash, building up an array of keys in a
2245 * mortal array, sort the array and then run through the
2251 /*av_extend (av, len);*/
2253 TRACEME(("using canonical order"));
2255 for (i = 0; i < len; i++) {
2256 #ifdef HAS_RESTRICTED_HASHES
2257 HE *he = hv_iternext_flags(hv, HV_ITERNEXT_WANTPLACEHOLDERS);
2259 HE *he = hv_iternext(hv);
2261 SV *key = hv_iterkeysv(he);
2262 av_store(av, AvFILLp(av)+1, key); /* av_push(), really */
2267 for (i = 0; i < len; i++) {
2268 #ifdef HAS_RESTRICTED_HASHES
2269 int placeholders = (int)HvPLACEHOLDERS(hv);
2271 unsigned char flags = 0;
2275 SV *key = av_shift(av);
2276 /* This will fail if key is a placeholder.
2277 Track how many placeholders we have, and error if we
2279 HE *he = hv_fetch_ent(hv, key, 0, 0);
2283 if (!(val = HeVAL(he))) {
2284 /* Internal error, not I/O error */
2288 #ifdef HAS_RESTRICTED_HASHES
2289 /* Should be a placeholder. */
2290 if (placeholders-- < 0) {
2291 /* This should not happen - number of
2292 retrieves should be identical to
2293 number of placeholders. */
2296 /* Value is never needed, and PL_sv_undef is
2297 more space efficient to store. */
2300 ("Flags not 0 but %d", flags));
2301 flags = SHV_K_PLACEHOLDER;
2308 * Store value first.
2311 TRACEME(("(#%d) value 0x%"UVxf, i, PTR2UV(val)));
2313 if ((ret = store(aTHX_ cxt, val))) /* Extra () for -Wall, grr... */
2318 * Keys are written after values to make sure retrieval
2319 * can be optimal in terms of memory usage, where keys are
2320 * read into a fixed unique buffer called kbuf.
2321 * See retrieve_hash() for details.
2324 /* Implementation of restricted hashes isn't nicely
2326 if ((hash_flags & SHV_RESTRICTED) && SvREADONLY(val)) {
2327 flags |= SHV_K_LOCKED;
2330 keyval = SvPV(key, keylen_tmp);
2331 keylen = keylen_tmp;
2332 #ifdef HAS_UTF8_HASHES
2333 /* If you build without optimisation on pre 5.6
2334 then nothing spots that SvUTF8(key) is always 0,
2335 so the block isn't optimised away, at which point
2336 the linker dislikes the reference to
2339 const char *keysave = keyval;
2340 bool is_utf8 = TRUE;
2342 /* Just casting the &klen to (STRLEN) won't work
2343 well if STRLEN and I32 are of different widths.
2345 keyval = (char*)bytes_from_utf8((U8*)keyval,
2349 /* If we were able to downgrade here, then than
2350 means that we have a key which only had chars
2351 0-255, but was utf8 encoded. */
2353 if (keyval != keysave) {
2354 keylen = keylen_tmp;
2355 flags |= SHV_K_WASUTF8;
2357 /* keylen_tmp can't have changed, so no need
2358 to assign back to keylen. */
2359 flags |= SHV_K_UTF8;
2366 TRACEME(("(#%d) key '%s' flags %x %u", i, keyval, flags, *keyval));
2368 /* This is a workaround for a bug in 5.8.0
2369 that causes the HEK_WASUTF8 flag to be
2370 set on an HEK without the hash being
2371 marked as having key flags. We just
2372 cross our fingers and drop the flag.
2374 assert (flags == 0 || flags == SHV_K_WASUTF8);
2375 TRACEME(("(#%d) key '%s'", i, keyval));
2379 WRITE(keyval, keylen);
2380 if (flags & SHV_K_WASUTF8)
2385 * Free up the temporary array
2394 * Storing in "random" order (in the order the keys are stored
2395 * within the hash). This is the default and will be faster!
2398 for (i = 0; i < len; i++) {
2401 unsigned char flags;
2402 #ifdef HV_ITERNEXT_WANTPLACEHOLDERS
2403 HE *he = hv_iternext_flags(hv, HV_ITERNEXT_WANTPLACEHOLDERS);
2405 HE *he = hv_iternext(hv);
2407 SV *val = (he ? hv_iterval(hv, he) : 0);
2412 return 1; /* Internal error, not I/O error */
2414 /* Implementation of restricted hashes isn't nicely
2417 = (((hash_flags & SHV_RESTRICTED)
2419 ? SHV_K_LOCKED : 0);
2421 if (val == &PL_sv_placeholder) {
2422 flags |= SHV_K_PLACEHOLDER;
2427 * Store value first.
2430 TRACEME(("(#%d) value 0x%"UVxf, i, PTR2UV(val)));
2432 if ((ret = store(aTHX_ cxt, val))) /* Extra () for -Wall, grr... */
2436 hek = HeKEY_hek(he);
2438 if (len == HEf_SVKEY) {
2439 /* This is somewhat sick, but the internal APIs are
2440 * such that XS code could put one of these in in
2442 * Maybe we should be capable of storing one if
2445 key_sv = HeKEY_sv(he);
2446 flags |= SHV_K_ISSV;
2448 /* Regular string key. */
2449 #ifdef HAS_HASH_KEY_FLAGS
2451 flags |= SHV_K_UTF8;
2452 if (HEK_WASUTF8(hek))
2453 flags |= SHV_K_WASUTF8;
2459 * Keys are written after values to make sure retrieval
2460 * can be optimal in terms of memory usage, where keys are
2461 * read into a fixed unique buffer called kbuf.
2462 * See retrieve_hash() for details.
2467 TRACEME(("(#%d) key '%s' flags %x", i, key, flags));
2469 /* This is a workaround for a bug in 5.8.0
2470 that causes the HEK_WASUTF8 flag to be
2471 set on an HEK without the hash being
2472 marked as having key flags. We just
2473 cross our fingers and drop the flag.
2475 assert (flags == 0 || flags == SHV_K_WASUTF8);
2476 TRACEME(("(#%d) key '%s'", i, key));
2478 if (flags & SHV_K_ISSV) {
2479 store(aTHX_ cxt, key_sv);
2488 TRACEME(("ok (hash 0x%"UVxf")", PTR2UV(hv)));
2491 HvRITER(hv) = riter; /* Restore hash iterator state */
2492 HvEITER(hv) = eiter;
2500 * Store a code reference.
2502 * Layout is SX_CODE <length> followed by a scalar containing the perl
2503 * source code of the code reference.
2505 static int store_code(pTHX_ stcxt_t *cxt, CV *cv)
2507 #if PERL_VERSION < 6
2509 * retrieve_code does not work with perl 5.005 or less
2511 return store_other(aTHX_ cxt, (SV*)cv);
2516 SV *text, *bdeparse;
2518 TRACEME(("store_code (0x%"UVxf")", PTR2UV(cv)));
2521 cxt->deparse == 0 ||
2522 (cxt->deparse < 0 && !(cxt->deparse =
2523 SvTRUE(perl_get_sv("Storable::Deparse", TRUE)) ? 1 : 0))
2525 return store_other(aTHX_ cxt, (SV*)cv);
2529 * Require B::Deparse. At least B::Deparse 0.61 is needed for
2530 * blessed code references.
2532 /* Ownership of both SVs is passed to load_module, which frees them. */
2533 load_module(PERL_LOADMOD_NOIMPORT, newSVpvn("B::Deparse",10), newSVnv(0.61));
2539 * create the B::Deparse object
2543 XPUSHs(sv_2mortal(newSVpvn("B::Deparse",10)));
2545 count = call_method("new", G_SCALAR);
2548 CROAK(("Unexpected return value from B::Deparse::new\n"));
2552 * call the coderef2text method
2556 XPUSHs(bdeparse); /* XXX is this already mortal? */
2557 XPUSHs(sv_2mortal(newRV_inc((SV*)cv)));
2559 count = call_method("coderef2text", G_SCALAR);
2562 CROAK(("Unexpected return value from B::Deparse::coderef2text\n"));
2566 reallen = strlen(SvPV_nolen(text));
2569 * Empty code references or XS functions are deparsed as
2570 * "(prototype) ;" or ";".
2573 if (len == 0 || *(SvPV_nolen(text)+reallen-1) == ';') {
2574 CROAK(("The result of B::Deparse::coderef2text was empty - maybe you're trying to serialize an XS function?\n"));
2578 * Signal code by emitting SX_CODE.
2582 cxt->tagnum++; /* necessary, as SX_CODE is a SEEN() candidate */
2583 TRACEME(("size = %d", len));
2584 TRACEME(("code = %s", SvPV_nolen(text)));
2587 * Now store the source code.
2590 STORE_SCALAR(SvPV_nolen(text), len);
2595 TRACEME(("ok (code)"));
2604 * When storing a tied object (be it a tied scalar, array or hash), we lay out
2605 * a special mark, followed by the underlying tied object. For instance, when
2606 * dealing with a tied hash, we store SX_TIED_HASH <hash object>, where
2607 * <hash object> stands for the serialization of the tied hash.
2609 static int store_tied(pTHX_ stcxt_t *cxt, SV *sv)
2614 int svt = SvTYPE(sv);
2617 TRACEME(("store_tied (0x%"UVxf")", PTR2UV(sv)));
2620 * We have a small run-time penalty here because we chose to factorise
2621 * all tieds objects into the same routine, and not have a store_tied_hash,
2622 * a store_tied_array, etc...
2624 * Don't use a switch() statement, as most compilers don't optimize that
2625 * well for 2/3 values. An if() else if() cascade is just fine. We put
2626 * tied hashes first, as they are the most likely beasts.
2629 if (svt == SVt_PVHV) {
2630 TRACEME(("tied hash"));
2631 PUTMARK(SX_TIED_HASH); /* Introduces tied hash */
2632 } else if (svt == SVt_PVAV) {
2633 TRACEME(("tied array"));
2634 PUTMARK(SX_TIED_ARRAY); /* Introduces tied array */
2636 TRACEME(("tied scalar"));
2637 PUTMARK(SX_TIED_SCALAR); /* Introduces tied scalar */
2641 if (!(mg = mg_find(sv, mtype)))
2642 CROAK(("No magic '%c' found while storing tied %s", mtype,
2643 (svt == SVt_PVHV) ? "hash" :
2644 (svt == SVt_PVAV) ? "array" : "scalar"));
2647 * The mg->mg_obj found by mg_find() above actually points to the
2648 * underlying tied Perl object implementation. For instance, if the
2649 * original SV was that of a tied array, then mg->mg_obj is an AV.
2651 * Note that we store the Perl object as-is. We don't call its FETCH
2652 * method along the way. At retrieval time, we won't call its STORE
2653 * method either, but the tieing magic will be re-installed. In itself,
2654 * that ensures that the tieing semantics are preserved since futher
2655 * accesses on the retrieved object will indeed call the magic methods...
2658 /* [#17040] mg_obj is NULL for scalar self-ties. AMS 20030416 */
2659 obj = mg->mg_obj ? mg->mg_obj : newSV(0);
2660 if ((ret = store(aTHX_ cxt, obj)))
2663 TRACEME(("ok (tied)"));
2671 * Stores a reference to an item within a tied structure:
2673 * . \$h{key}, stores both the (tied %h) object and 'key'.
2674 * . \$a[idx], stores both the (tied @a) object and 'idx'.
2676 * Layout is therefore either:
2677 * SX_TIED_KEY <object> <key>
2678 * SX_TIED_IDX <object> <index>
2680 static int store_tied_item(pTHX_ stcxt_t *cxt, SV *sv)
2685 TRACEME(("store_tied_item (0x%"UVxf")", PTR2UV(sv)));
2687 if (!(mg = mg_find(sv, 'p')))
2688 CROAK(("No magic 'p' found while storing reference to tied item"));
2691 * We discriminate between \$h{key} and \$a[idx] via mg_ptr.
2695 TRACEME(("store_tied_item: storing a ref to a tied hash item"));
2696 PUTMARK(SX_TIED_KEY);
2697 TRACEME(("store_tied_item: storing OBJ 0x%"UVxf, PTR2UV(mg->mg_obj)));
2699 if ((ret = store(aTHX_ cxt, mg->mg_obj))) /* Extra () for -Wall, grr... */
2702 TRACEME(("store_tied_item: storing PTR 0x%"UVxf, PTR2UV(mg->mg_ptr)));
2704 if ((ret = store(aTHX_ cxt, (SV *) mg->mg_ptr))) /* Idem, for -Wall */
2707 I32 idx = mg->mg_len;
2709 TRACEME(("store_tied_item: storing a ref to a tied array item "));
2710 PUTMARK(SX_TIED_IDX);
2711 TRACEME(("store_tied_item: storing OBJ 0x%"UVxf, PTR2UV(mg->mg_obj)));
2713 if ((ret = store(aTHX_ cxt, mg->mg_obj))) /* Idem, for -Wall */
2716 TRACEME(("store_tied_item: storing IDX %d", idx));
2721 TRACEME(("ok (tied item)"));
2727 * store_hook -- dispatched manually, not via sv_store[]
2729 * The blessed SV is serialized by a hook.
2733 * SX_HOOK <flags> <len> <classname> <len2> <str> [<len3> <object-IDs>]
2735 * where <flags> indicates how long <len>, <len2> and <len3> are, whether
2736 * the trailing part [] is present, the type of object (scalar, array or hash).
2737 * There is also a bit which says how the classname is stored between:
2742 * and when the <index> form is used (classname already seen), the "large
2743 * classname" bit in <flags> indicates how large the <index> is.
2745 * The serialized string returned by the hook is of length <len2> and comes
2746 * next. It is an opaque string for us.
2748 * Those <len3> object IDs which are listed last represent the extra references
2749 * not directly serialized by the hook, but which are linked to the object.
2751 * When recursion is mandated to resolve object-IDs not yet seen, we have
2752 * instead, with <header> being flags with bits set to indicate the object type
2753 * and that recursion was indeed needed:
2755 * SX_HOOK <header> <object> <header> <object> <flags>
2757 * that same header being repeated between serialized objects obtained through
2758 * recursion, until we reach flags indicating no recursion, at which point
2759 * we know we've resynchronized with a single layout, after <flags>.
2761 * When storing a blessed ref to a tied variable, the following format is
2764 * SX_HOOK <flags> <extra> ... [<len3> <object-IDs>] <magic object>
2766 * The first <flags> indication carries an object of type SHT_EXTRA, and the
2767 * real object type is held in the <extra> flag. At the very end of the
2768 * serialization stream, the underlying magic object is serialized, just like
2769 * any other tied variable.
2771 static int store_hook(
2785 int count; /* really len3 + 1 */
2786 unsigned char flags;
2789 int recursed = 0; /* counts recursion */
2790 int obj_type; /* object type, on 2 bits */
2793 int clone = cxt->optype & ST_CLONE;
2794 char mtype = '\0'; /* for blessed ref to tied structures */
2795 unsigned char eflags = '\0'; /* used when object type is SHT_EXTRA */
2797 TRACEME(("store_hook, classname \"%s\", tagged #%d", HvNAME(pkg), cxt->tagnum));
2800 * Determine object type on 2 bits.
2805 obj_type = SHT_SCALAR;
2808 obj_type = SHT_ARRAY;
2811 obj_type = SHT_HASH;
2815 * Produced by a blessed ref to a tied data structure, $o in the
2816 * following Perl code.
2820 * my $o = bless \%h, 'BAR';
2822 * Signal the tie-ing magic by setting the object type as SHT_EXTRA
2823 * (since we have only 2 bits in <flags> to store the type), and an
2824 * <extra> byte flag will be emitted after the FIRST <flags> in the
2825 * stream, carrying what we put in `eflags'.
2827 obj_type = SHT_EXTRA;
2828 switch (SvTYPE(sv)) {
2830 eflags = (unsigned char) SHT_THASH;
2834 eflags = (unsigned char) SHT_TARRAY;
2838 eflags = (unsigned char) SHT_TSCALAR;
2844 CROAK(("Unexpected object type (%d) in store_hook()", type));
2846 flags = SHF_NEED_RECURSE | obj_type;
2848 classname = HvNAME(pkg);
2849 len = strlen(classname);
2852 * To call the hook, we need to fake a call like:
2854 * $object->STORABLE_freeze($cloning);
2856 * but we don't have the $object here. For instance, if $object is
2857 * a blessed array, what we have in `sv' is the array, and we can't
2858 * call a method on those.
2860 * Therefore, we need to create a temporary reference to the object and
2861 * make the call on that reference.
2864 TRACEME(("about to call STORABLE_freeze on class %s", classname));
2866 ref = newRV_noinc(sv); /* Temporary reference */
2867 av = array_call(aTHX_ ref, hook, clone); /* @a = $object->STORABLE_freeze($c) */
2868 SvRV_set(ref, NULL);
2869 SvREFCNT_dec(ref); /* Reclaim temporary reference */
2871 count = AvFILLp(av) + 1;
2872 TRACEME(("store_hook, array holds %d items", count));
2875 * If they return an empty list, it means they wish to ignore the
2876 * hook for this class (and not just this instance -- that's for them
2877 * to handle if they so wish).
2879 * Simply disable the cached entry for the hook (it won't be recomputed
2880 * since it's present in the cache) and recurse to store_blessed().
2885 * They must not change their mind in the middle of a serialization.
2888 if (hv_fetch(cxt->hclass, classname, len, FALSE))
2889 CROAK(("Too late to ignore hooks for %s class \"%s\"",
2890 (cxt->optype & ST_CLONE) ? "cloning" : "storing", classname));
2892 pkg_hide(aTHX_ cxt->hook, pkg, "STORABLE_freeze");
2894 ASSERT(!pkg_can(aTHX_ cxt->hook, pkg, "STORABLE_freeze"), ("hook invisible"));
2895 TRACEME(("ignoring STORABLE_freeze in class \"%s\"", classname));
2897 return store_blessed(aTHX_ cxt, sv, type, pkg);
2901 * Get frozen string.
2905 pv = SvPV(ary[0], len2);
2906 /* We can't use pkg_can here because it only caches one method per
2909 GV* gv = gv_fetchmethod_autoload(pkg, "STORABLE_attach", FALSE);
2910 if (gv && isGV(gv)) {
2912 CROAK(("Freeze cannot return references if %s class is using STORABLE_attach", classname));
2918 * If they returned more than one item, we need to serialize some
2919 * extra references if not already done.
2921 * Loop over the array, starting at position #1, and for each item,
2922 * ensure it is a reference, serialize it if not already done, and
2923 * replace the entry with the tag ID of the corresponding serialized
2926 * We CHEAT by not calling av_fetch() and read directly within the
2930 for (i = 1; i < count; i++) {
2934 AV *av_hook = cxt->hook_seen;
2937 CROAK(("Item #%d returned by STORABLE_freeze "
2938 "for %s is not a reference", i, classname));
2939 xsv = SvRV(rsv); /* Follow ref to know what to look for */
2942 * Look in hseen and see if we have a tag already.
2943 * Serialize entry if not done already, and get its tag.
2946 if ((svh = hv_fetch(cxt->hseen, (char *) &xsv, sizeof(xsv), FALSE)))
2947 goto sv_seen; /* Avoid moving code too far to the right */
2949 TRACEME(("listed object %d at 0x%"UVxf" is unknown", i-1, PTR2UV(xsv)));
2952 * We need to recurse to store that object and get it to be known
2953 * so that we can resolve the list of object-IDs at retrieve time.
2955 * The first time we do this, we need to emit the proper header
2956 * indicating that we recursed, and what the type of object is (the
2957 * object we're storing via a user-hook). Indeed, during retrieval,
2958 * we'll have to create the object before recursing to retrieve the
2959 * others, in case those would point back at that object.
2962 /* [SX_HOOK] <flags> [<extra>] <object>*/
2966 if (obj_type == SHT_EXTRA)
2971 if ((ret = store(aTHX_ cxt, xsv))) /* Given by hook for us to store */
2974 svh = hv_fetch(cxt->hseen, (char *) &xsv, sizeof(xsv), FALSE);
2976 CROAK(("Could not serialize item #%d from hook in %s", i, classname));
2979 * It was the first time we serialized `xsv'.
2981 * Keep this SV alive until the end of the serialization: if we
2982 * disposed of it right now by decrementing its refcount, and it was
2983 * a temporary value, some next temporary value allocated during
2984 * another STORABLE_freeze might take its place, and we'd wrongly
2985 * assume that new SV was already serialized, based on its presence
2988 * Therefore, push it away in cxt->hook_seen.
2991 av_store(av_hook, AvFILLp(av_hook)+1, SvREFCNT_inc(xsv));
2995 * Dispose of the REF they returned. If we saved the `xsv' away
2996 * in the array of returned SVs, that will not cause the underlying
2997 * referenced SV to be reclaimed.
3000 ASSERT(SvREFCNT(xsv) > 1, ("SV will survive disposal of its REF"));
3001 SvREFCNT_dec(rsv); /* Dispose of reference */
3004 * Replace entry with its tag (not a real SV, so no refcnt increment)
3008 TRACEME(("listed object %d at 0x%"UVxf" is tag #%"UVuf,
3009 i-1, PTR2UV(xsv), PTR2UV(*svh)));
3013 * Allocate a class ID if not already done.
3015 * This needs to be done after the recursion above, since at retrieval
3016 * time, we'll see the inner objects first. Many thanks to
3017 * Salvador Ortiz Garcia <sog@msg.com.mx> who spot that bug and
3018 * proposed the right fix. -- RAM, 15/09/2000
3022 if (!known_class(aTHX_ cxt, classname, len, &classnum)) {
3023 TRACEME(("first time we see class %s, ID = %d", classname, classnum));
3024 classnum = -1; /* Mark: we must store classname */
3026 TRACEME(("already seen class %s, ID = %d", classname, classnum));
3030 * Compute leading flags.
3034 if (((classnum == -1) ? len : classnum) > LG_SCALAR)
3035 flags |= SHF_LARGE_CLASSLEN;
3037 flags |= SHF_IDX_CLASSNAME;
3038 if (len2 > LG_SCALAR)
3039 flags |= SHF_LARGE_STRLEN;
3041 flags |= SHF_HAS_LIST;
3042 if (count > (LG_SCALAR + 1))
3043 flags |= SHF_LARGE_LISTLEN;
3046 * We're ready to emit either serialized form:
3048 * SX_HOOK <flags> <len> <classname> <len2> <str> [<len3> <object-IDs>]
3049 * SX_HOOK <flags> <index> <len2> <str> [<len3> <object-IDs>]
3051 * If we recursed, the SX_HOOK has already been emitted.
3054 TRACEME(("SX_HOOK (recursed=%d) flags=0x%x "
3055 "class=%"IVdf" len=%"IVdf" len2=%"IVdf" len3=%d",
3056 recursed, flags, (IV)classnum, (IV)len, (IV)len2, count-1));
3058 /* SX_HOOK <flags> [<extra>] */
3062 if (obj_type == SHT_EXTRA)
3067 /* <len> <classname> or <index> */
3068 if (flags & SHF_IDX_CLASSNAME) {
3069 if (flags & SHF_LARGE_CLASSLEN)
3072 unsigned char cnum = (unsigned char) classnum;
3076 if (flags & SHF_LARGE_CLASSLEN)
3079 unsigned char clen = (unsigned char) len;
3082 WRITE(classname, len); /* Final \0 is omitted */
3085 /* <len2> <frozen-str> */
3086 if (flags & SHF_LARGE_STRLEN) {
3087 I32 wlen2 = len2; /* STRLEN might be 8 bytes */
3088 WLEN(wlen2); /* Must write an I32 for 64-bit machines */
3090 unsigned char clen = (unsigned char) len2;
3094 WRITE(pv, (SSize_t)len2); /* Final \0 is omitted */
3096 /* [<len3> <object-IDs>] */
3097 if (flags & SHF_HAS_LIST) {
3098 int len3 = count - 1;
3099 if (flags & SHF_LARGE_LISTLEN)
3102 unsigned char clen = (unsigned char) len3;
3107 * NOTA BENE, for 64-bit machines: the ary[i] below does not yield a
3108 * real pointer, rather a tag number, well under the 32-bit limit.
3111 for (i = 1; i < count; i++) {
3112 I32 tagval = htonl(LOW_32BITS(ary[i]));
3114 TRACEME(("object %d, tag #%d", i-1, ntohl(tagval)));
3119 * Free the array. We need extra care for indices after 0, since they
3120 * don't hold real SVs but integers cast.
3124 AvFILLp(av) = 0; /* Cheat, nothing after 0 interests us */
3129 * If object was tied, need to insert serialization of the magic object.
3132 if (obj_type == SHT_EXTRA) {
3135 if (!(mg = mg_find(sv, mtype))) {
3136 int svt = SvTYPE(sv);
3137 CROAK(("No magic '%c' found while storing ref to tied %s with hook",
3138 mtype, (svt == SVt_PVHV) ? "hash" :
3139 (svt == SVt_PVAV) ? "array" : "scalar"));
3142 TRACEME(("handling the magic object 0x%"UVxf" part of 0x%"UVxf,
3143 PTR2UV(mg->mg_obj), PTR2UV(sv)));
3149 if ((ret = store(aTHX_ cxt, mg->mg_obj))) /* Extra () for -Wall, grr... */
3157 * store_blessed -- dispatched manually, not via sv_store[]
3159 * Check whether there is a STORABLE_xxx hook defined in the class or in one
3160 * of its ancestors. If there is, then redispatch to store_hook();
3162 * Otherwise, the blessed SV is stored using the following layout:
3164 * SX_BLESS <flag> <len> <classname> <object>
3166 * where <flag> indicates whether <len> is stored on 0 or 4 bytes, depending
3167 * on the high-order bit in flag: if 1, then length follows on 4 bytes.
3168 * Otherwise, the low order bits give the length, thereby giving a compact
3169 * representation for class names less than 127 chars long.
3171 * Each <classname> seen is remembered and indexed, so that the next time
3172 * an object in the blessed in the same <classname> is stored, the following
3175 * SX_IX_BLESS <flag> <index> <object>
3177 * where <index> is the classname index, stored on 0 or 4 bytes depending
3178 * on the high-order bit in flag (same encoding as above for <len>).
3180 static int store_blessed(
3192 TRACEME(("store_blessed, type %d, class \"%s\"", type, HvNAME(pkg)));
3195 * Look for a hook for this blessed SV and redirect to store_hook()
3199 hook = pkg_can(aTHX_ cxt->hook, pkg, "STORABLE_freeze");
3201 return store_hook(aTHX_ cxt, sv, type, pkg, hook);
3204 * This is a blessed SV without any serialization hook.
3207 classname = HvNAME(pkg);
3208 len = strlen(classname);
3210 TRACEME(("blessed 0x%"UVxf" in %s, no hook: tagged #%d",
3211 PTR2UV(sv), classname, cxt->tagnum));
3214 * Determine whether it is the first time we see that class name (in which
3215 * case it will be stored in the SX_BLESS form), or whether we already
3216 * saw that class name before (in which case the SX_IX_BLESS form will be
3220 if (known_class(aTHX_ cxt, classname, len, &classnum)) {
3221 TRACEME(("already seen class %s, ID = %d", classname, classnum));
3222 PUTMARK(SX_IX_BLESS);
3223 if (classnum <= LG_BLESS) {
3224 unsigned char cnum = (unsigned char) classnum;
3227 unsigned char flag = (unsigned char) 0x80;
3232 TRACEME(("first time we see class %s, ID = %d", classname, classnum));
3234 if (len <= LG_BLESS) {
3235 unsigned char clen = (unsigned char) len;
3238 unsigned char flag = (unsigned char) 0x80;
3240 WLEN(len); /* Don't BER-encode, this should be rare */
3242 WRITE(classname, len); /* Final \0 is omitted */
3246 * Now emit the <object> part.
3249 return SV_STORE(type)(aTHX_ cxt, sv);
3255 * We don't know how to store the item we reached, so return an error condition.
3256 * (it's probably a GLOB, some CODE reference, etc...)
3258 * If they defined the `forgive_me' variable at the Perl level to some
3259 * true value, then don't croak, just warn, and store a placeholder string
3262 static int store_other(pTHX_ stcxt_t *cxt, SV *sv)
3267 TRACEME(("store_other"));
3270 * Fetch the value from perl only once per store() operation.
3274 cxt->forgive_me == 0 ||
3275 (cxt->forgive_me < 0 && !(cxt->forgive_me =
3276 SvTRUE(perl_get_sv("Storable::forgive_me", TRUE)) ? 1 : 0))
3278 CROAK(("Can't store %s items", sv_reftype(sv, FALSE)));
3280 warn("Can't store item %s(0x%"UVxf")",
3281 sv_reftype(sv, FALSE), PTR2UV(sv));
3284 * Store placeholder string as a scalar instead...
3287 (void) sprintf(buf, "You lost %s(0x%"UVxf")%c", sv_reftype(sv, FALSE),
3288 PTR2UV(sv), (char) 0);
3291 STORE_SCALAR(buf, len);
3292 TRACEME(("ok (dummy \"%s\", length = %"IVdf")", buf, (IV) len));
3298 *** Store driving routines
3304 * WARNING: partially duplicates Perl's sv_reftype for speed.
3306 * Returns the type of the SV, identified by an integer. That integer
3307 * may then be used to index the dynamic routine dispatch table.
3309 static int sv_type(pTHX_ SV *sv)
3311 switch (SvTYPE(sv)) {
3316 * No need to check for ROK, that can't be set here since there
3317 * is no field capable of hodling the xrv_rv reference.
3325 * Starting from SVt_PV, it is possible to have the ROK flag
3326 * set, the pointer to the other SV being either stored in
3327 * the xrv_rv (in the case of a pure SVt_RV), or as the
3328 * xpv_pv field of an SVt_PV and its heirs.
3330 * However, those SV cannot be magical or they would be an
3331 * SVt_PVMG at least.
3333 return SvROK(sv) ? svis_REF : svis_SCALAR;
3335 case SVt_PVLV: /* Workaround for perl5.004_04 "LVALUE" bug */
3336 if (SvRMAGICAL(sv) && (mg_find(sv, 'p')))
3337 return svis_TIED_ITEM;
3340 if (SvRMAGICAL(sv) && (mg_find(sv, 'q')))
3342 return SvROK(sv) ? svis_REF : svis_SCALAR;
3344 if (SvRMAGICAL(sv) && (mg_find(sv, 'P')))
3348 if (SvRMAGICAL(sv) && (mg_find(sv, 'P')))
3363 * Recursively store objects pointed to by the sv to the specified file.
3365 * Layout is <content> or SX_OBJECT <tagnum> if we reach an already stored
3366 * object (one for which storage has started -- it may not be over if we have
3367 * a self-referenced structure). This data set forms a stored <object>.
3369 static int store(pTHX_ stcxt_t *cxt, SV *sv)
3374 HV *hseen = cxt->hseen;
3376 TRACEME(("store (0x%"UVxf")", PTR2UV(sv)));
3379 * If object has already been stored, do not duplicate data.
3380 * Simply emit the SX_OBJECT marker followed by its tag data.
3381 * The tag is always written in network order.
3383 * NOTA BENE, for 64-bit machines: the "*svh" below does not yield a
3384 * real pointer, rather a tag number (watch the insertion code below).
3385 * That means it probably safe to assume it is well under the 32-bit limit,
3386 * and makes the truncation safe.
3387 * -- RAM, 14/09/1999
3390 svh = hv_fetch(hseen, (char *) &sv, sizeof(sv), FALSE);
3394 if (sv == &PL_sv_undef) {
3395 /* We have seen PL_sv_undef before, but fake it as
3398 Not the simplest solution to making restricted
3399 hashes work on 5.8.0, but it does mean that
3400 repeated references to the one true undef will
3401 take up less space in the output file.
3403 /* Need to jump past the next hv_store, because on the
3404 second store of undef the old hash value will be
3405 SvREFCNT_dec()ed, and as Storable cheats horribly
3406 by storing non-SVs in the hash a SEGV will ensure.
3407 Need to increase the tag number so that the
3408 receiver has no idea what games we're up to. This
3409 special casing doesn't affect hooks that store
3410 undef, as the hook routine does its own lookup into
3411 hseen. Also this means that any references back
3412 to PL_sv_undef (from the pathological case of hooks
3413 storing references to it) will find the seen hash
3414 entry for the first time, as if we didn't have this
3415 hackery here. (That hseen lookup works even on 5.8.0
3416 because it's a key of &PL_sv_undef and a value
3417 which is a tag number, not a value which is
3421 goto undef_special_case;
3424 tagval = htonl(LOW_32BITS(*svh));
3426 TRACEME(("object 0x%"UVxf" seen as #%d", PTR2UV(sv), ntohl(tagval)));
3434 * Allocate a new tag and associate it with the address of the sv being
3435 * stored, before recursing...
3437 * In order to avoid creating new SvIVs to hold the tagnum we just
3438 * cast the tagnum to an SV pointer and store that in the hash. This
3439 * means that we must clean up the hash manually afterwards, but gives
3440 * us a 15% throughput increase.
3445 if (!hv_store(hseen,
3446 (char *) &sv, sizeof(sv), INT2PTR(SV*, cxt->tagnum), 0))
3450 * Store `sv' and everything beneath it, using appropriate routine.
3451 * Abort immediately if we get a non-zero status back.
3454 type = sv_type(aTHX_ sv);
3457 TRACEME(("storing 0x%"UVxf" tag #%d, type %d...",
3458 PTR2UV(sv), cxt->tagnum, type));
3461 HV *pkg = SvSTASH(sv);
3462 ret = store_blessed(aTHX_ cxt, sv, type, pkg);
3464 ret = SV_STORE(type)(aTHX_ cxt, sv);
3466 TRACEME(("%s (stored 0x%"UVxf", refcnt=%d, %s)",
3467 ret ? "FAILED" : "ok", PTR2UV(sv),
3468 SvREFCNT(sv), sv_reftype(sv, FALSE)));
3476 * Write magic number and system information into the file.
3477 * Layout is <magic> <network> [<len> <byteorder> <sizeof int> <sizeof long>
3478 * <sizeof ptr>] where <len> is the length of the byteorder hexa string.
3479 * All size and lenghts are written as single characters here.
3481 * Note that no byte ordering info is emitted when <network> is true, since
3482 * integers will be emitted in network order in that case.
3484 static int magic_write(pTHX_ stcxt_t *cxt)
3487 * Starting with 0.6, the "use_network_order" byte flag is also used to
3488 * indicate the version number of the binary image, encoded in the upper
3489 * bits. The bit 0 is always used to indicate network order.
3492 * Starting with 0.7, a full byte is dedicated to the minor version of
3493 * the binary format, which is incremented only when new markers are
3494 * introduced, for instance, but when backward compatibility is preserved.
3497 /* Make these at compile time. The WRITE() macro is sufficiently complex
3498 that it saves about 200 bytes doing it this way and only using it
3500 static const unsigned char network_file_header[] = {
3502 (STORABLE_BIN_MAJOR << 1) | 1,
3503 STORABLE_BIN_WRITE_MINOR
3505 static const unsigned char file_header[] = {
3507 (STORABLE_BIN_MAJOR << 1) | 0,
3508 STORABLE_BIN_WRITE_MINOR,
3509 /* sizeof the array includes the 0 byte at the end: */
3510 (char) sizeof (byteorderstr) - 1,
3512 (unsigned char) sizeof(int),
3513 (unsigned char) sizeof(long),
3514 (unsigned char) sizeof(char *),
3515 (unsigned char) sizeof(NV)
3517 #ifdef USE_56_INTERWORK_KLUDGE
3518 static const unsigned char file_header_56[] = {
3520 (STORABLE_BIN_MAJOR << 1) | 0,
3521 STORABLE_BIN_WRITE_MINOR,
3522 /* sizeof the array includes the 0 byte at the end: */
3523 (char) sizeof (byteorderstr_56) - 1,
3525 (unsigned char) sizeof(int),
3526 (unsigned char) sizeof(long),
3527 (unsigned char) sizeof(char *),
3528 (unsigned char) sizeof(NV)
3531 const unsigned char *header;
3534 TRACEME(("magic_write on fd=%d", cxt->fio ? PerlIO_fileno(cxt->fio) : -1));
3536 if (cxt->netorder) {
3537 header = network_file_header;
3538 length = sizeof (network_file_header);
3540 #ifdef USE_56_INTERWORK_KLUDGE
3541 if (SvTRUE(perl_get_sv("Storable::interwork_56_64bit", TRUE))) {
3542 header = file_header_56;
3543 length = sizeof (file_header_56);
3547 header = file_header;
3548 length = sizeof (file_header);
3553 /* sizeof the array includes the 0 byte at the end. */
3554 header += sizeof (magicstr) - 1;
3555 length -= sizeof (magicstr) - 1;
3558 WRITE( (unsigned char*) header, length);
3560 if (!cxt->netorder) {
3561 TRACEME(("ok (magic_write byteorder = 0x%lx [%d], I%d L%d P%d D%d)",
3562 (unsigned long) BYTEORDER, (int) sizeof (byteorderstr) - 1,
3563 (int) sizeof(int), (int) sizeof(long),
3564 (int) sizeof(char *), (int) sizeof(NV)));
3572 * Common code for store operations.
3574 * When memory store is requested (f = NULL) and a non null SV* is given in
3575 * `res', it is filled with a new SV created out of the memory buffer.
3577 * It is required to provide a non-null `res' when the operation type is not
3578 * dclone() and store() is performed to memory.
3580 static int do_store(
3591 ASSERT(!(f == 0 && !(optype & ST_CLONE)) || res,
3592 ("must supply result SV pointer for real recursion to memory"));
3594 TRACEME(("do_store (optype=%d, netorder=%d)",
3595 optype, network_order));
3600 * Workaround for CROAK leak: if they enter with a "dirty" context,
3601 * free up memory for them now.
3605 clean_context(aTHX_ cxt);
3608 * Now that STORABLE_xxx hooks exist, it is possible that they try to
3609 * re-enter store() via the hooks. We need to stack contexts.
3613 cxt = allocate_context(aTHX_ cxt);
3617 ASSERT(cxt->entry == 1, ("starting new recursion"));
3618 ASSERT(!cxt->s_dirty, ("clean context"));
3621 * Ensure sv is actually a reference. From perl, we called something
3623 * pstore(aTHX_ FILE, \@array);
3624 * so we must get the scalar value behing that reference.
3628 CROAK(("Not a reference"));
3629 sv = SvRV(sv); /* So follow it to know what to store */
3632 * If we're going to store to memory, reset the buffer.
3639 * Prepare context and emit headers.
3642 init_store_context(aTHX_ cxt, f, optype, network_order);
3644 if (-1 == magic_write(aTHX_ cxt)) /* Emit magic and ILP info */
3645 return 0; /* Error */
3648 * Recursively store object...
3651 ASSERT(is_storing(aTHX), ("within store operation"));
3653 status = store(aTHX_ cxt, sv); /* Just do it! */
3656 * If they asked for a memory store and they provided an SV pointer,
3657 * make an SV string out of the buffer and fill their pointer.
3659 * When asking for ST_REAL, it's MANDATORY for the caller to provide
3660 * an SV, since context cleanup might free the buffer if we did recurse.
3661 * (unless caller is dclone(), which is aware of that).
3664 if (!cxt->fio && res)
3665 *res = mbuf2sv(aTHX);
3670 * The "root" context is never freed, since it is meant to be always
3671 * handy for the common case where no recursion occurs at all (i.e.
3672 * we enter store() outside of any Storable code and leave it, period).
3673 * We know it's the "root" context because there's nothing stacked
3678 * When deep cloning, we don't free the context: doing so would force
3679 * us to copy the data in the memory buffer. Sicne we know we're
3680 * about to enter do_retrieve...
3683 clean_store_context(aTHX_ cxt);
3684 if (cxt->prev && !(cxt->optype & ST_CLONE))
3685 free_context(aTHX_ cxt);
3687 TRACEME(("do_store returns %d", status));
3695 * Store the transitive data closure of given object to disk.
3696 * Returns 0 on error, a true value otherwise.
3698 int pstore(pTHX_ PerlIO *f, SV *sv)
3700 TRACEME(("pstore"));
3701 return do_store(aTHX_ f, sv, 0, FALSE, (SV**) 0);
3708 * Same as pstore(), but network order is used for integers and doubles are
3709 * emitted as strings.
3711 int net_pstore(pTHX_ PerlIO *f, SV *sv)
3713 TRACEME(("net_pstore"));
3714 return do_store(aTHX_ f, sv, 0, TRUE, (SV**) 0);
3724 * Build a new SV out of the content of the internal memory buffer.
3726 static SV *mbuf2sv(pTHX)
3730 return newSVpv(mbase, MBUF_SIZE());
3736 * Store the transitive data closure of given object to memory.
3737 * Returns undef on error, a scalar value containing the data otherwise.
3739 SV *mstore(pTHX_ SV *sv)
3743 TRACEME(("mstore"));
3745 if (!do_store(aTHX_ (PerlIO*) 0, sv, 0, FALSE, &out))
3746 return &PL_sv_undef;
3754 * Same as mstore(), but network order is used for integers and doubles are
3755 * emitted as strings.
3757 SV *net_mstore(pTHX_ SV *sv)
3761 TRACEME(("net_mstore"));
3763 if (!do_store(aTHX_ (PerlIO*) 0, sv, 0, TRUE, &out))
3764 return &PL_sv_undef;
3770 *** Specific retrieve callbacks.
3776 * Return an error via croak, since it is not possible that we get here
3777 * under normal conditions, when facing a file produced via pstore().
3779 static SV *retrieve_other(pTHX_ stcxt_t *cxt, char *cname)
3782 cxt->ver_major != STORABLE_BIN_MAJOR &&
3783 cxt->ver_minor != STORABLE_BIN_MINOR
3785 CROAK(("Corrupted storable %s (binary v%d.%d), current is v%d.%d",
3786 cxt->fio ? "file" : "string",
3787 cxt->ver_major, cxt->ver_minor,
3788 STORABLE_BIN_MAJOR, STORABLE_BIN_MINOR));
3790 CROAK(("Corrupted storable %s (binary v%d.%d)",
3791 cxt->fio ? "file" : "string",
3792 cxt->ver_major, cxt->ver_minor));
3795 return (SV *) 0; /* Just in case */
3799 * retrieve_idx_blessed
3801 * Layout is SX_IX_BLESS <index> <object> with SX_IX_BLESS already read.
3802 * <index> can be coded on either 1 or 5 bytes.
3804 static SV *retrieve_idx_blessed(pTHX_ stcxt_t *cxt, char *cname)
3811 TRACEME(("retrieve_idx_blessed (#%d)", cxt->tagnum));
3812 ASSERT(!cname, ("no bless-into class given here, got %s", cname));
3814 GETMARK(idx); /* Index coded on a single char? */
3819 * Fetch classname in `aclass'
3822 sva = av_fetch(cxt->aclass, idx, FALSE);
3824 CROAK(("Class name #%"IVdf" should have been seen already", (IV) idx));
3826 classname = SvPVX(*sva); /* We know it's a PV, by construction */
3828 TRACEME(("class ID %d => %s", idx, classname));
3831 * Retrieve object and bless it.
3834 sv = retrieve(aTHX_ cxt, classname); /* First SV which is SEEN will be blessed */
3842 * Layout is SX_BLESS <len> <classname> <object> with SX_BLESS already read.
3843 * <len> can be coded on either 1 or 5 bytes.
3845 static SV *retrieve_blessed(pTHX_ stcxt_t *cxt, char *cname)
3849 char buf[LG_BLESS + 1]; /* Avoid malloc() if possible */
3850 char *classname = buf;
3852 TRACEME(("retrieve_blessed (#%d)", cxt->tagnum));
3853 ASSERT(!cname, ("no bless-into class given here, got %s", cname));
3856 * Decode class name length and read that name.
3858 * Short classnames have two advantages: their length is stored on one
3859 * single byte, and the string can be read on the stack.
3862 GETMARK(len); /* Length coded on a single char? */
3865 TRACEME(("** allocating %d bytes for class name", len+1));
3866 New(10003, classname, len+1, char);
3868 READ(classname, len);
3869 classname[len] = '\0'; /* Mark string end */
3872 * It's a new classname, otherwise it would have been an SX_IX_BLESS.
3875 TRACEME(("new class name \"%s\" will bear ID = %d", classname, cxt->classnum));
3877 if (!av_store(cxt->aclass, cxt->classnum++, newSVpvn(classname, len)))
3881 * Retrieve object and bless it.
3884 sv = retrieve(aTHX_ cxt, classname); /* First SV which is SEEN will be blessed */
3885 if (classname != buf)
3886 Safefree(classname);
3894 * Layout: SX_HOOK <flags> <len> <classname> <len2> <str> [<len3> <object-IDs>]
3895 * with leading mark already read, as usual.
3897 * When recursion was involved during serialization of the object, there
3898 * is an unknown amount of serialized objects after the SX_HOOK mark. Until
3899 * we reach a <flags> marker with the recursion bit cleared.
3901 * If the first <flags> byte contains a type of SHT_EXTRA, then the real type
3902 * is held in the <extra> byte, and if the object is tied, the serialized
3903 * magic object comes at the very end:
3905 * SX_HOOK <flags> <extra> ... [<len3> <object-IDs>] <magic object>
3907 * This means the STORABLE_thaw hook will NOT get a tied variable during its
3908 * processing (since we won't have seen the magic object by the time the hook
3909 * is called). See comments below for why it was done that way.
3911 static SV *retrieve_hook(pTHX_ stcxt_t *cxt, char *cname)
3914 char buf[LG_BLESS + 1]; /* Avoid malloc() if possible */
3915 char *classname = buf;
3926 int clone = cxt->optype & ST_CLONE;
3928 unsigned int extra_type = 0;
3930 TRACEME(("retrieve_hook (#%d)", cxt->tagnum));
3931 ASSERT(!cname, ("no bless-into class given here, got %s", cname));
3934 * Read flags, which tell us about the type, and whether we need to recurse.
3940 * Create the (empty) object, and mark it as seen.
3942 * This must be done now, because tags are incremented, and during
3943 * serialization, the object tag was affected before recursion could
3947 obj_type = flags & SHF_TYPE_MASK;
3953 sv = (SV *) newAV();
3956 sv = (SV *) newHV();
3960 * Read <extra> flag to know the type of the object.
3961 * Record associated magic type for later.
3963 GETMARK(extra_type);
3964 switch (extra_type) {
3970 sv = (SV *) newAV();
3974 sv = (SV *) newHV();
3978 return retrieve_other(aTHX_ cxt, 0); /* Let it croak */
3982 return retrieve_other(aTHX_ cxt, 0); /* Let it croak */
3984 SEEN(sv, 0, 0); /* Don't bless yet */
3987 * Whilst flags tell us to recurse, do so.
3989 * We don't need to remember the addresses returned by retrieval, because
3990 * all the references will be obtained through indirection via the object
3991 * tags in the object-ID list.
3993 * We need to decrement the reference count for these objects
3994 * because, if the user doesn't save a reference to them in the hook,
3995 * they must be freed when this context is cleaned.
3998 while (flags & SHF_NEED_RECURSE) {
3999 TRACEME(("retrieve_hook recursing..."));
4000 rv = retrieve(aTHX_ cxt, 0);
4004 TRACEME(("retrieve_hook back with rv=0x%"UVxf,
4009 if (flags & SHF_IDX_CLASSNAME) {
4014 * Fetch index from `aclass'
4017 if (flags & SHF_LARGE_CLASSLEN)
4022 sva = av_fetch(cxt->aclass, idx, FALSE);
4024 CROAK(("Class name #%"IVdf" should have been seen already",
4027 classname = SvPVX(*sva); /* We know it's a PV, by construction */
4028 TRACEME(("class ID %d => %s", idx, classname));
4032 * Decode class name length and read that name.
4034 * NOTA BENE: even if the length is stored on one byte, we don't read
4035 * on the stack. Just like retrieve_blessed(), we limit the name to
4036 * LG_BLESS bytes. This is an arbitrary decision.
4039 if (flags & SHF_LARGE_CLASSLEN)
4044 if (len > LG_BLESS) {
4045 TRACEME(("** allocating %d bytes for class name", len+1));
4046 New(10003, classname, len+1, char);
4049 READ(classname, len);
4050 classname[len] = '\0'; /* Mark string end */
4053 * Record new classname.
4056 if (!av_store(cxt->aclass, cxt->classnum++, newSVpvn(classname, len)))
4060 TRACEME(("class name: %s", classname));
4063 * Decode user-frozen string length and read it in an SV.
4065 * For efficiency reasons, we read data directly into the SV buffer.
4066 * To understand that code, read retrieve_scalar()
4069 if (flags & SHF_LARGE_STRLEN)
4074 frozen = NEWSV(10002, len2);
4076 SAFEREAD(SvPVX(frozen), len2, frozen);
4077 SvCUR_set(frozen, len2);
4078 *SvEND(frozen) = '\0';
4080 (void) SvPOK_only(frozen); /* Validates string pointer */
4081 if (cxt->s_tainted) /* Is input source tainted? */
4084 TRACEME(("frozen string: %d bytes", len2));
4087 * Decode object-ID list length, if present.
4090 if (flags & SHF_HAS_LIST) {
4091 if (flags & SHF_LARGE_LISTLEN)
4097 av_extend(av, len3 + 1); /* Leave room for [0] */
4098 AvFILLp(av) = len3; /* About to be filled anyway */
4102 TRACEME(("has %d object IDs to link", len3));
4105 * Read object-ID list into array.
4106 * Because we pre-extended it, we can cheat and fill it manually.
4108 * We read object tags and we can convert them into SV* on the fly
4109 * because we know all the references listed in there (as tags)
4110 * have been already serialized, hence we have a valid correspondance
4111 * between each of those tags and the recreated SV.
4115 SV **ary = AvARRAY(av);
4117 for (i = 1; i <= len3; i++) { /* We leave [0] alone */
4124 svh = av_fetch(cxt->aseen, tag, FALSE);
4126 if (tag == cxt->where_is_undef) {
4127 /* av_fetch uses PL_sv_undef internally, hence this
4128 somewhat gruesome hack. */
4132 CROAK(("Object #%"IVdf" should have been retrieved already",
4137 ary[i] = SvREFCNT_inc(xsv);
4142 * Bless the object and look up the STORABLE_thaw hook.
4145 BLESS(sv, classname);
4147 /* Handle attach case; again can't use pkg_can because it only
4148 * caches one method */
4149 attach = gv_fetchmethod_autoload(SvSTASH(sv), "STORABLE_attach", FALSE);
4150 if (attach && isGV(attach)) {
4152 SV* attach_hook = newRV((SV*) GvCV(attach));
4155 CROAK(("STORABLE_attach called with unexpected references"));
4159 AvARRAY(av)[0] = SvREFCNT_inc(frozen);
4160 rv = newSVpv(classname, 0);
4161 attached = scalar_call(aTHX_ rv, attach_hook, clone, av, G_SCALAR);
4164 sv_derived_from(attached, classname))
4165 return SvRV(attached);
4166 CROAK(("STORABLE_attach did not return a %s object", classname));
4169 hook = pkg_can(aTHX_ cxt->hook, SvSTASH(sv), "STORABLE_thaw");
4172 * Hook not found. Maybe they did not require the module where this
4173 * hook is defined yet?
4175 * If the require below succeeds, we'll be able to find the hook.
4176 * Still, it only works reliably when each class is defined in a
4180 SV *psv = newSVpvn("require ", 8);
4181 sv_catpv(psv, classname);
4183 TRACEME(("No STORABLE_thaw defined for objects of class %s", classname));
4184 TRACEME(("Going to require module '%s' with '%s'", classname, SvPVX(psv)));
4186 perl_eval_sv(psv, G_DISCARD);
4190 * We cache results of pkg_can, so we need to uncache before attempting
4194 pkg_uncache(aTHX_ cxt->hook, SvSTASH(sv), "STORABLE_thaw");
4195 hook = pkg_can(aTHX_ cxt->hook, SvSTASH(sv), "STORABLE_thaw");
4198 CROAK(("No STORABLE_thaw defined for objects of class %s "
4199 "(even after a \"require %s;\")", classname, classname));
4203 * If we don't have an `av' yet, prepare one.
4204 * Then insert the frozen string as item [0].
4212 AvARRAY(av)[0] = SvREFCNT_inc(frozen);
4217 * $object->STORABLE_thaw($cloning, $frozen, @refs);
4219 * where $object is our blessed (empty) object, $cloning is a boolean
4220 * telling whether we're running a deep clone, $frozen is the frozen
4221 * string the user gave us in his serializing hook, and @refs, which may
4222 * be empty, is the list of extra references he returned along for us
4225 * In effect, the hook is an alternate creation routine for the class,
4226 * the object itself being already created by the runtime.
4229 TRACEME(("calling STORABLE_thaw on %s at 0x%"UVxf" (%"IVdf" args)",
4230 classname, PTR2UV(sv), (IV) AvFILLp(av) + 1));
4233 (void) scalar_call(aTHX_ rv, hook, clone, av, G_SCALAR|G_DISCARD);
4240 SvREFCNT_dec(frozen);
4243 if (!(flags & SHF_IDX_CLASSNAME) && classname != buf)
4244 Safefree(classname);
4247 * If we had an <extra> type, then the object was not as simple, and
4248 * we need to restore extra magic now.
4254 TRACEME(("retrieving magic object for 0x%"UVxf"...", PTR2UV(sv)));
4256 rv = retrieve(aTHX_ cxt, 0); /* Retrieve <magic object> */
4258 TRACEME(("restoring the magic object 0x%"UVxf" part of 0x%"UVxf,
4259 PTR2UV(rv), PTR2UV(sv)));
4261 switch (extra_type) {
4263 sv_upgrade(sv, SVt_PVMG);
4266 sv_upgrade(sv, SVt_PVAV);
4267 AvREAL_off((AV *)sv);
4270 sv_upgrade(sv, SVt_PVHV);
4273 CROAK(("Forgot to deal with extra type %d", extra_type));
4278 * Adding the magic only now, well after the STORABLE_thaw hook was called
4279 * means the hook cannot know it deals with an object whose variable is
4280 * tied. But this is happening when retrieving $o in the following case:
4284 * my $o = bless \%h, 'BAR';
4286 * The 'BAR' class is NOT the one where %h is tied into. Therefore, as
4287 * far as the 'BAR' class is concerned, the fact that %h is not a REAL
4288 * hash but a tied one should not matter at all, and remain transparent.
4289 * This means the magic must be restored by Storable AFTER the hook is
4292 * That looks very reasonable to me, but then I've come up with this
4293 * after a bug report from David Nesting, who was trying to store such
4294 * an object and caused Storable to fail. And unfortunately, it was
4295 * also the easiest way to retrofit support for blessed ref to tied objects
4296 * into the existing design. -- RAM, 17/02/2001
4299 sv_magic(sv, rv, mtype, Nullch, 0);
4300 SvREFCNT_dec(rv); /* Undo refcnt inc from sv_magic() */
4308 * Retrieve reference to some other scalar.
4309 * Layout is SX_REF <object>, with SX_REF already read.
4311 static SV *retrieve_ref(pTHX_ stcxt_t *cxt, char *cname)
4316 TRACEME(("retrieve_ref (#%d)", cxt->tagnum));
4319 * We need to create the SV that holds the reference to the yet-to-retrieve
4320 * object now, so that we may record the address in the seen table.
4321 * Otherwise, if the object to retrieve references us, we won't be able
4322 * to resolve the SX_OBJECT we'll see at that point! Hence we cannot
4323 * do the retrieve first and use rv = newRV(sv) since it will be too late
4324 * for SEEN() recording.
4327 rv = NEWSV(10002, 0);
4328 SEEN(rv, cname, 0); /* Will return if rv is null */
4329 sv = retrieve(aTHX_ cxt, 0); /* Retrieve <object> */
4331 return (SV *) 0; /* Failed */
4334 * WARNING: breaks RV encapsulation.
4336 * Now for the tricky part. We have to upgrade our existing SV, so that
4337 * it is now an RV on sv... Again, we cheat by duplicating the code
4338 * held in newSVrv(), since we already got our SV from retrieve().
4342 * SvRV(rv) = SvREFCNT_inc(sv);
4344 * here because the reference count we got from retrieve() above is
4345 * already correct: if the object was retrieved from the file, then
4346 * its reference count is one. Otherwise, if it was retrieved via
4347 * an SX_OBJECT indication, a ref count increment was done.
4351 /* No need to do anything, as rv will already be PVMG. */
4352 assert (SvTYPE(rv) >= SVt_RV);
4354 sv_upgrade(rv, SVt_RV);
4357 SvRV_set(rv, sv); /* $rv = \$sv */
4360 TRACEME(("ok (retrieve_ref at 0x%"UVxf")", PTR2UV(rv)));
4368 * Retrieve weak reference to some other scalar.
4369 * Layout is SX_WEAKREF <object>, with SX_WEAKREF already read.
4371 static SV *retrieve_weakref(pTHX_ stcxt_t *cxt, char *cname)
4375 TRACEME(("retrieve_weakref (#%d)", cxt->tagnum));
4377 sv = retrieve_ref(aTHX_ cxt, cname);
4389 * retrieve_overloaded
4391 * Retrieve reference to some other scalar with overloading.
4392 * Layout is SX_OVERLOAD <object>, with SX_OVERLOAD already read.
4394 static SV *retrieve_overloaded(pTHX_ stcxt_t *cxt, char *cname)
4400 TRACEME(("retrieve_overloaded (#%d)", cxt->tagnum));
4403 * Same code as retrieve_ref(), duplicated to avoid extra call.
4406 rv = NEWSV(10002, 0);
4407 SEEN(rv, cname, 0); /* Will return if rv is null */
4408 sv = retrieve(aTHX_ cxt, 0); /* Retrieve <object> */
4410 return (SV *) 0; /* Failed */
4413 * WARNING: breaks RV encapsulation.
4416 sv_upgrade(rv, SVt_RV);
4417 SvRV_set(rv, sv); /* $rv = \$sv */
4421 * Restore overloading magic.
4424 stash = SvTYPE(sv) ? (HV *) SvSTASH (sv) : 0;
4426 CROAK(("Cannot restore overloading on %s(0x%"UVxf
4427 ") (package <unknown>)",
4428 sv_reftype(sv, FALSE),
4431 if (!Gv_AMG(stash)) {
4432 SV *psv = newSVpvn("require ", 8);
4433 const char *package = HvNAME(stash);
4434 sv_catpv(psv, package);
4436 TRACEME(("No overloading defined for package %s", package));
4437 TRACEME(("Going to require module '%s' with '%s'", package, SvPVX(psv)));
4439 perl_eval_sv(psv, G_DISCARD);
4441 if (!Gv_AMG(stash)) {
4442 CROAK(("Cannot restore overloading on %s(0x%"UVxf
4443 ") (package %s) (even after a \"require %s;\")",
4444 sv_reftype(sv, FALSE),
4452 TRACEME(("ok (retrieve_overloaded at 0x%"UVxf")", PTR2UV(rv)));
4458 * retrieve_weakoverloaded
4460 * Retrieve weak overloaded reference to some other scalar.
4461 * Layout is SX_WEAKOVERLOADED <object>, with SX_WEAKOVERLOADED already read.
4463 static SV *retrieve_weakoverloaded(pTHX_ stcxt_t *cxt, char *cname)
4467 TRACEME(("retrieve_weakoverloaded (#%d)", cxt->tagnum));
4469 sv = retrieve_overloaded(aTHX_ cxt, cname);
4481 * retrieve_tied_array
4483 * Retrieve tied array
4484 * Layout is SX_TIED_ARRAY <object>, with SX_TIED_ARRAY already read.
4486 static SV *retrieve_tied_array(pTHX_ stcxt_t *cxt, char *cname)
4491 TRACEME(("retrieve_tied_array (#%d)", cxt->tagnum));
4493 tv = NEWSV(10002, 0);
4494 SEEN(tv, cname, 0); /* Will return if tv is null */
4495 sv = retrieve(aTHX_ cxt, 0); /* Retrieve <object> */
4497 return (SV *) 0; /* Failed */
4499 sv_upgrade(tv, SVt_PVAV);
4500 AvREAL_off((AV *)tv);
4501 sv_magic(tv, sv, 'P', Nullch, 0);
4502 SvREFCNT_dec(sv); /* Undo refcnt inc from sv_magic() */
4504 TRACEME(("ok (retrieve_tied_array at 0x%"UVxf")", PTR2UV(tv)));
4510 * retrieve_tied_hash
4512 * Retrieve tied hash
4513 * Layout is SX_TIED_HASH <object>, with SX_TIED_HASH already read.
4515 static SV *retrieve_tied_hash(pTHX_ stcxt_t *cxt, char *cname)
4520 TRACEME(("retrieve_tied_hash (#%d)", cxt->tagnum));
4522 tv = NEWSV(10002, 0);
4523 SEEN(tv, cname, 0); /* Will return if tv is null */
4524 sv = retrieve(aTHX_ cxt, 0); /* Retrieve <object> */
4526 return (SV *) 0; /* Failed */
4528 sv_upgrade(tv, SVt_PVHV);
4529 sv_magic(tv, sv, 'P', Nullch, 0);
4530 SvREFCNT_dec(sv); /* Undo refcnt inc from sv_magic() */
4532 TRACEME(("ok (retrieve_tied_hash at 0x%"UVxf")", PTR2UV(tv)));
4538 * retrieve_tied_scalar
4540 * Retrieve tied scalar
4541 * Layout is SX_TIED_SCALAR <object>, with SX_TIED_SCALAR already read.
4543 static SV *retrieve_tied_scalar(pTHX_ stcxt_t *cxt, char *cname)
4546 SV *sv, *obj = NULL;
4548 TRACEME(("retrieve_tied_scalar (#%d)", cxt->tagnum));
4550 tv = NEWSV(10002, 0);
4551 SEEN(tv, cname, 0); /* Will return if rv is null */
4552 sv = retrieve(aTHX_ cxt, 0); /* Retrieve <object> */
4554 return (SV *) 0; /* Failed */
4556 else if (SvTYPE(sv) != SVt_NULL) {
4560 sv_upgrade(tv, SVt_PVMG);
4561 sv_magic(tv, obj, 'q', Nullch, 0);
4564 /* Undo refcnt inc from sv_magic() */
4568 TRACEME(("ok (retrieve_tied_scalar at 0x%"UVxf")", PTR2UV(tv)));
4576 * Retrieve reference to value in a tied hash.
4577 * Layout is SX_TIED_KEY <object> <key>, with SX_TIED_KEY already read.
4579 static SV *retrieve_tied_key(pTHX_ stcxt_t *cxt, char *cname)
4585 TRACEME(("retrieve_tied_key (#%d)", cxt->tagnum));
4587 tv = NEWSV(10002, 0);
4588 SEEN(tv, cname, 0); /* Will return if tv is null */
4589 sv = retrieve(aTHX_ cxt, 0); /* Retrieve <object> */
4591 return (SV *) 0; /* Failed */
4593 key = retrieve(aTHX_ cxt, 0); /* Retrieve <key> */
4595 return (SV *) 0; /* Failed */
4597 sv_upgrade(tv, SVt_PVMG);
4598 sv_magic(tv, sv, 'p', (char *)key, HEf_SVKEY);
4599 SvREFCNT_dec(key); /* Undo refcnt inc from sv_magic() */
4600 SvREFCNT_dec(sv); /* Undo refcnt inc from sv_magic() */
4608 * Retrieve reference to value in a tied array.
4609 * Layout is SX_TIED_IDX <object> <idx>, with SX_TIED_IDX already read.
4611 static SV *retrieve_tied_idx(pTHX_ stcxt_t *cxt, char *cname)
4617 TRACEME(("retrieve_tied_idx (#%d)", cxt->tagnum));
4619 tv = NEWSV(10002, 0);
4620 SEEN(tv, cname, 0); /* Will return if tv is null */
4621 sv = retrieve(aTHX_ cxt, 0); /* Retrieve <object> */
4623 return (SV *) 0; /* Failed */
4625 RLEN(idx); /* Retrieve <idx> */
4627 sv_upgrade(tv, SVt_PVMG);
4628 sv_magic(tv, sv, 'p', Nullch, idx);
4629 SvREFCNT_dec(sv); /* Undo refcnt inc from sv_magic() */
4638 * Retrieve defined long (string) scalar.
4640 * Layout is SX_LSCALAR <length> <data>, with SX_LSCALAR already read.
4641 * The scalar is "long" in that <length> is larger than LG_SCALAR so it
4642 * was not stored on a single byte.
4644 static SV *retrieve_lscalar(pTHX_ stcxt_t *cxt, char *cname)
4650 TRACEME(("retrieve_lscalar (#%d), len = %"IVdf, cxt->tagnum, (IV) len));
4653 * Allocate an empty scalar of the suitable length.
4656 sv = NEWSV(10002, len);
4657 SEEN(sv, cname, 0); /* Associate this new scalar with tag "tagnum" */
4660 * WARNING: duplicates parts of sv_setpv and breaks SV data encapsulation.
4662 * Now, for efficiency reasons, read data directly inside the SV buffer,
4663 * and perform the SV final settings directly by duplicating the final
4664 * work done by sv_setpv. Since we're going to allocate lots of scalars
4665 * this way, it's worth the hassle and risk.
4668 SAFEREAD(SvPVX(sv), len, sv);
4669 SvCUR_set(sv, len); /* Record C string length */
4670 *SvEND(sv) = '\0'; /* Ensure it's null terminated anyway */
4671 (void) SvPOK_only(sv); /* Validate string pointer */
4672 if (cxt->s_tainted) /* Is input source tainted? */
4673 SvTAINT(sv); /* External data cannot be trusted */
4675 TRACEME(("large scalar len %"IVdf" '%s'", (IV) len, SvPVX(sv)));
4676 TRACEME(("ok (retrieve_lscalar at 0x%"UVxf")", PTR2UV(sv)));
4684 * Retrieve defined short (string) scalar.
4686 * Layout is SX_SCALAR <length> <data>, with SX_SCALAR already read.
4687 * The scalar is "short" so <length> is single byte. If it is 0, there
4688 * is no <data> section.
4690 static SV *retrieve_scalar(pTHX_ stcxt_t *cxt, char *cname)
4696 TRACEME(("retrieve_scalar (#%d), len = %d", cxt->tagnum, len));
4699 * Allocate an empty scalar of the suitable length.
4702 sv = NEWSV(10002, len);
4703 SEEN(sv, cname, 0); /* Associate this new scalar with tag "tagnum" */
4706 * WARNING: duplicates parts of sv_setpv and breaks SV data encapsulation.
4711 * newSV did not upgrade to SVt_PV so the scalar is undefined.
4712 * To make it defined with an empty length, upgrade it now...
4713 * Don't upgrade to a PV if the original type contains more
4714 * information than a scalar.
4716 if (SvTYPE(sv) <= SVt_PV) {
4717 sv_upgrade(sv, SVt_PV);
4720 *SvEND(sv) = '\0'; /* Ensure it's null terminated anyway */
4721 TRACEME(("ok (retrieve_scalar empty at 0x%"UVxf")", PTR2UV(sv)));
4724 * Now, for efficiency reasons, read data directly inside the SV buffer,
4725 * and perform the SV final settings directly by duplicating the final
4726 * work done by sv_setpv. Since we're going to allocate lots of scalars
4727 * this way, it's worth the hassle and risk.
4729 SAFEREAD(SvPVX(sv), len, sv);
4730 SvCUR_set(sv, len); /* Record C string length */
4731 *SvEND(sv) = '\0'; /* Ensure it's null terminated anyway */
4732 TRACEME(("small scalar len %d '%s'", len, SvPVX(sv)));
4735 (void) SvPOK_only(sv); /* Validate string pointer */
4736 if (cxt->s_tainted) /* Is input source tainted? */
4737 SvTAINT(sv); /* External data cannot be trusted */
4739 TRACEME(("ok (retrieve_scalar at 0x%"UVxf")", PTR2UV(sv)));
4746 * Like retrieve_scalar(), but tag result as utf8.
4747 * If we're retrieving UTF8 data in a non-UTF8 perl, croaks.
4749 static SV *retrieve_utf8str(pTHX_ stcxt_t *cxt, char *cname)
4753 TRACEME(("retrieve_utf8str"));
4755 sv = retrieve_scalar(aTHX_ cxt, cname);
4757 #ifdef HAS_UTF8_SCALARS
4760 if (cxt->use_bytes < 0)
4762 = (SvTRUE(perl_get_sv("Storable::drop_utf8", TRUE))
4764 if (cxt->use_bytes == 0)
4775 * Like retrieve_lscalar(), but tag result as utf8.
4776 * If we're retrieving UTF8 data in a non-UTF8 perl, croaks.
4778 static SV *retrieve_lutf8str(pTHX_ stcxt_t *cxt, char *cname)
4782 TRACEME(("retrieve_lutf8str"));
4784 sv = retrieve_lscalar(aTHX_ cxt, cname);
4786 #ifdef HAS_UTF8_SCALARS
4789 if (cxt->use_bytes < 0)
4791 = (SvTRUE(perl_get_sv("Storable::drop_utf8", TRUE))
4793 if (cxt->use_bytes == 0)
4803 * Retrieve defined integer.
4804 * Layout is SX_INTEGER <data>, whith SX_INTEGER already read.
4806 static SV *retrieve_integer(pTHX_ stcxt_t *cxt, char *cname)
4811 TRACEME(("retrieve_integer (#%d)", cxt->tagnum));
4813 READ(&iv, sizeof(iv));
4815 SEEN(sv, cname, 0); /* Associate this new scalar with tag "tagnum" */
4817 TRACEME(("integer %"IVdf, iv));
4818 TRACEME(("ok (retrieve_integer at 0x%"UVxf")", PTR2UV(sv)));
4826 * Retrieve defined integer in network order.
4827 * Layout is SX_NETINT <data>, whith SX_NETINT already read.
4829 static SV *retrieve_netint(pTHX_ stcxt_t *cxt, char *cname)
4834 TRACEME(("retrieve_netint (#%d)", cxt->tagnum));
4838 sv = newSViv((int) ntohl(iv));
4839 TRACEME(("network integer %d", (int) ntohl(iv)));
4842 TRACEME(("network integer (as-is) %d", iv));
4844 SEEN(sv, cname, 0); /* Associate this new scalar with tag "tagnum" */
4846 TRACEME(("ok (retrieve_netint at 0x%"UVxf")", PTR2UV(sv)));
4854 * Retrieve defined double.
4855 * Layout is SX_DOUBLE <data>, whith SX_DOUBLE already read.
4857 static SV *retrieve_double(pTHX_ stcxt_t *cxt, char *cname)
4862 TRACEME(("retrieve_double (#%d)", cxt->tagnum));
4864 READ(&nv, sizeof(nv));
4866 SEEN(sv, cname, 0); /* Associate this new scalar with tag "tagnum" */
4868 TRACEME(("double %"NVff, nv));
4869 TRACEME(("ok (retrieve_double at 0x%"UVxf")", PTR2UV(sv)));
4877 * Retrieve defined byte (small integer within the [-128, +127] range).
4878 * Layout is SX_BYTE <data>, whith SX_BYTE already read.
4880 static SV *retrieve_byte(pTHX_ stcxt_t *cxt, char *cname)
4884 signed char tmp; /* Workaround for AIX cc bug --H.Merijn Brand */
4886 TRACEME(("retrieve_byte (#%d)", cxt->tagnum));
4889 TRACEME(("small integer read as %d", (unsigned char) siv));
4890 tmp = (unsigned char) siv - 128;
4892 SEEN(sv, cname, 0); /* Associate this new scalar with tag "tagnum" */
4894 TRACEME(("byte %d", tmp));
4895 TRACEME(("ok (retrieve_byte at 0x%"UVxf")", PTR2UV(sv)));
4903 * Return the undefined value.
4905 static SV *retrieve_undef(pTHX_ stcxt_t *cxt, char *cname)
4909 TRACEME(("retrieve_undef"));
4920 * Return the immortal undefined value.
4922 static SV *retrieve_sv_undef(pTHX_ stcxt_t *cxt, char *cname)
4924 SV *sv = &PL_sv_undef;
4926 TRACEME(("retrieve_sv_undef"));
4928 /* Special case PL_sv_undef, as av_fetch uses it internally to mark
4929 deleted elements, and will return NULL (fetch failed) whenever it
4931 if (cxt->where_is_undef == -1) {
4932 cxt->where_is_undef = cxt->tagnum;
4941 * Return the immortal yes value.
4943 static SV *retrieve_sv_yes(pTHX_ stcxt_t *cxt, char *cname)
4945 SV *sv = &PL_sv_yes;
4947 TRACEME(("retrieve_sv_yes"));
4956 * Return the immortal no value.
4958 static SV *retrieve_sv_no(pTHX_ stcxt_t *cxt, char *cname)
4962 TRACEME(("retrieve_sv_no"));
4971 * Retrieve a whole array.
4972 * Layout is SX_ARRAY <size> followed by each item, in increading index order.
4973 * Each item is stored as <object>.
4975 * When we come here, SX_ARRAY has been read already.
4977 static SV *retrieve_array(pTHX_ stcxt_t *cxt, char *cname)
4984 TRACEME(("retrieve_array (#%d)", cxt->tagnum));
4987 * Read length, and allocate array, then pre-extend it.
4991 TRACEME(("size = %d", len));
4993 SEEN(av, cname, 0); /* Will return if array not allocated nicely */
4997 return (SV *) av; /* No data follow if array is empty */
5000 * Now get each item in turn...
5003 for (i = 0; i < len; i++) {
5004 TRACEME(("(#%d) item", i));
5005 sv = retrieve(aTHX_ cxt, 0); /* Retrieve item */
5008 if (av_store(av, i, sv) == 0)
5012 TRACEME(("ok (retrieve_array at 0x%"UVxf")", PTR2UV(av)));
5020 * Retrieve a whole hash table.
5021 * Layout is SX_HASH <size> followed by each key/value pair, in random order.
5022 * Keys are stored as <length> <data>, the <data> section being omitted
5024 * Values are stored as <object>.
5026 * When we come here, SX_HASH has been read already.
5028 static SV *retrieve_hash(pTHX_ stcxt_t *cxt, char *cname)
5036 TRACEME(("retrieve_hash (#%d)", cxt->tagnum));
5039 * Read length, allocate table.
5043 TRACEME(("size = %d", len));
5045 SEEN(hv, cname, 0); /* Will return if table not allocated properly */
5047 return (SV *) hv; /* No data follow if table empty */
5048 hv_ksplit(hv, len); /* pre-extend hash to save multiple splits */
5051 * Now get each key/value pair in turn...
5054 for (i = 0; i < len; i++) {
5059 TRACEME(("(#%d) value", i));
5060 sv = retrieve(aTHX_ cxt, 0);
5066 * Since we're reading into kbuf, we must ensure we're not
5067 * recursing between the read and the hv_store() where it's used.
5068 * Hence the key comes after the value.
5071 RLEN(size); /* Get key size */
5072 KBUFCHK((STRLEN)size); /* Grow hash key read pool if needed */
5075 kbuf[size] = '\0'; /* Mark string end, just in case */
5076 TRACEME(("(#%d) key '%s'", i, kbuf));
5079 * Enter key/value pair into hash table.
5082 if (hv_store(hv, kbuf, (U32) size, sv, 0) == 0)
5086 TRACEME(("ok (retrieve_hash at 0x%"UVxf")", PTR2UV(hv)));
5094 * Retrieve a whole hash table.
5095 * Layout is SX_HASH <size> followed by each key/value pair, in random order.
5096 * Keys are stored as <length> <data>, the <data> section being omitted
5098 * Values are stored as <object>.
5100 * When we come here, SX_HASH has been read already.
5102 static SV *retrieve_flag_hash(pTHX_ stcxt_t *cxt, char *cname)
5112 GETMARK(hash_flags);
5113 TRACEME(("retrieve_flag_hash (#%d)", cxt->tagnum));
5115 * Read length, allocate table.
5118 #ifndef HAS_RESTRICTED_HASHES
5119 if (hash_flags & SHV_RESTRICTED) {
5120 if (cxt->derestrict < 0)
5122 = (SvTRUE(perl_get_sv("Storable::downgrade_restricted", TRUE))
5124 if (cxt->derestrict == 0)
5125 RESTRICTED_HASH_CROAK();
5130 TRACEME(("size = %d, flags = %d", len, hash_flags));
5132 SEEN(hv, cname, 0); /* Will return if table not allocated properly */
5134 return (SV *) hv; /* No data follow if table empty */
5135 hv_ksplit(hv, len); /* pre-extend hash to save multiple splits */
5138 * Now get each key/value pair in turn...
5141 for (i = 0; i < len; i++) {
5143 int store_flags = 0;
5148 TRACEME(("(#%d) value", i));
5149 sv = retrieve(aTHX_ cxt, 0);
5154 #ifdef HAS_RESTRICTED_HASHES
5155 if ((hash_flags & SHV_RESTRICTED) && (flags & SHV_K_LOCKED))
5159 if (flags & SHV_K_ISSV) {
5160 /* XXX you can't set a placeholder with an SV key.
5161 Then again, you can't get an SV key.
5162 Without messing around beyond what the API is supposed to do.
5165 TRACEME(("(#%d) keysv, flags=%d", i, flags));
5166 keysv = retrieve(aTHX_ cxt, 0);
5170 if (!hv_store_ent(hv, keysv, sv, 0))
5175 * Since we're reading into kbuf, we must ensure we're not
5176 * recursing between the read and the hv_store() where it's used.
5177 * Hence the key comes after the value.
5180 if (flags & SHV_K_PLACEHOLDER) {
5182 sv = &PL_sv_placeholder;
5183 store_flags |= HVhek_PLACEHOLD;
5185 if (flags & SHV_K_UTF8) {
5186 #ifdef HAS_UTF8_HASHES
5187 store_flags |= HVhek_UTF8;
5189 if (cxt->use_bytes < 0)
5191 = (SvTRUE(perl_get_sv("Storable::drop_utf8", TRUE))
5193 if (cxt->use_bytes == 0)
5197 #ifdef HAS_UTF8_HASHES
5198 if (flags & SHV_K_WASUTF8)
5199 store_flags |= HVhek_WASUTF8;
5202 RLEN(size); /* Get key size */
5203 KBUFCHK((STRLEN)size); /* Grow hash key read pool if needed */
5206 kbuf[size] = '\0'; /* Mark string end, just in case */
5207 TRACEME(("(#%d) key '%s' flags %X store_flags %X", i, kbuf,
5208 flags, store_flags));
5211 * Enter key/value pair into hash table.
5214 #ifdef HAS_RESTRICTED_HASHES
5215 if (hv_store_flags(hv, kbuf, size, sv, 0, store_flags) == 0)
5218 if (!(store_flags & HVhek_PLACEHOLD))
5219 if (hv_store(hv, kbuf, size, sv, 0) == 0)
5224 #ifdef HAS_RESTRICTED_HASHES
5225 if (hash_flags & SHV_RESTRICTED)
5229 TRACEME(("ok (retrieve_hash at 0x%"UVxf")", PTR2UV(hv)));
5237 * Return a code reference.
5239 static SV *retrieve_code(pTHX_ stcxt_t *cxt, char *cname)
5241 #if PERL_VERSION < 6
5242 CROAK(("retrieve_code does not work with perl 5.005 or less\n"));
5245 int type, count, tagnum;
5247 SV *sv, *text, *sub;
5249 TRACEME(("retrieve_code (#%d)", cxt->tagnum));
5252 * Insert dummy SV in the aseen array so that we don't screw
5253 * up the tag numbers. We would just make the internal
5254 * scalar an untagged item in the stream, but
5255 * retrieve_scalar() calls SEEN(). So we just increase the
5258 tagnum = cxt->tagnum;
5263 * Retrieve the source of the code reference
5264 * as a small or large scalar
5270 text = retrieve_scalar(aTHX_ cxt, cname);
5273 text = retrieve_lscalar(aTHX_ cxt, cname);
5276 CROAK(("Unexpected type %d in retrieve_code\n", type));
5280 * prepend "sub " to the source
5283 sub = newSVpvn("sub ", 4);
5284 sv_catpv(sub, SvPV_nolen(text)); /* XXX no sv_catsv! */
5288 * evaluate the source to a code reference and use the CV value
5291 if (cxt->eval == NULL) {
5292 cxt->eval = perl_get_sv("Storable::Eval", TRUE);
5293 SvREFCNT_inc(cxt->eval);
5295 if (!SvTRUE(cxt->eval)) {
5297 cxt->forgive_me == 0 ||
5298 (cxt->forgive_me < 0 && !(cxt->forgive_me =
5299 SvTRUE(perl_get_sv("Storable::forgive_me", TRUE)) ? 1 : 0))
5301 CROAK(("Can't eval, please set $Storable::Eval to a true value"));
5304 /* fix up the dummy entry... */
5305 av_store(cxt->aseen, tagnum, SvREFCNT_inc(sv));
5313 if (SvROK(cxt->eval) && SvTYPE(SvRV(cxt->eval)) == SVt_PVCV) {
5314 SV* errsv = get_sv("@", TRUE);
5315 sv_setpv(errsv, ""); /* clear $@ */
5317 XPUSHs(sv_2mortal(newSVsv(sub)));
5319 count = call_sv(cxt->eval, G_SCALAR);
5322 CROAK(("Unexpected return value from $Storable::Eval callback\n"));
5324 if (SvTRUE(errsv)) {
5325 CROAK(("code %s caused an error: %s",
5326 SvPV_nolen(sub), SvPV_nolen(errsv)));
5330 cv = eval_pv(SvPV_nolen(sub), TRUE);
5332 if (cv && SvROK(cv) && SvTYPE(SvRV(cv)) == SVt_PVCV) {
5335 CROAK(("code %s did not evaluate to a subroutine reference\n", SvPV_nolen(sub)));
5338 SvREFCNT_inc(sv); /* XXX seems to be necessary */
5343 /* fix up the dummy entry... */
5344 av_store(cxt->aseen, tagnum, SvREFCNT_inc(sv));
5351 * old_retrieve_array
5353 * Retrieve a whole array in pre-0.6 binary format.
5355 * Layout is SX_ARRAY <size> followed by each item, in increading index order.
5356 * Each item is stored as SX_ITEM <object> or SX_IT_UNDEF for "holes".
5358 * When we come here, SX_ARRAY has been read already.
5360 static SV *old_retrieve_array(pTHX_ stcxt_t *cxt, char *cname)
5368 TRACEME(("old_retrieve_array (#%d)", cxt->tagnum));
5371 * Read length, and allocate array, then pre-extend it.
5375 TRACEME(("size = %d", len));
5377 SEEN(av, 0, 0); /* Will return if array not allocated nicely */
5381 return (SV *) av; /* No data follow if array is empty */
5384 * Now get each item in turn...
5387 for (i = 0; i < len; i++) {
5389 if (c == SX_IT_UNDEF) {
5390 TRACEME(("(#%d) undef item", i));
5391 continue; /* av_extend() already filled us with undef */
5394 (void) retrieve_other(aTHX_ (stcxt_t *) 0, 0); /* Will croak out */
5395 TRACEME(("(#%d) item", i));
5396 sv = retrieve(aTHX_ cxt, 0); /* Retrieve item */
5399 if (av_store(av, i, sv) == 0)
5403 TRACEME(("ok (old_retrieve_array at 0x%"UVxf")", PTR2UV(av)));
5411 * Retrieve a whole hash table in pre-0.6 binary format.
5413 * Layout is SX_HASH <size> followed by each key/value pair, in random order.
5414 * Keys are stored as SX_KEY <length> <data>, the <data> section being omitted
5416 * Values are stored as SX_VALUE <object> or SX_VL_UNDEF for "holes".
5418 * When we come here, SX_HASH has been read already.
5420 static SV *old_retrieve_hash(pTHX_ stcxt_t *cxt, char *cname)
5428 SV *sv_h_undef = (SV *) 0; /* hv_store() bug */
5430 TRACEME(("old_retrieve_hash (#%d)", cxt->tagnum));
5433 * Read length, allocate table.
5437 TRACEME(("size = %d", len));
5439 SEEN(hv, 0, 0); /* Will return if table not allocated properly */
5441 return (SV *) hv; /* No data follow if table empty */
5442 hv_ksplit(hv, len); /* pre-extend hash to save multiple splits */
5445 * Now get each key/value pair in turn...
5448 for (i = 0; i < len; i++) {
5454 if (c == SX_VL_UNDEF) {
5455 TRACEME(("(#%d) undef value", i));
5457 * Due to a bug in hv_store(), it's not possible to pass
5458 * &PL_sv_undef to hv_store() as a value, otherwise the
5459 * associated key will not be creatable any more. -- RAM, 14/01/97
5462 sv_h_undef = newSVsv(&PL_sv_undef);
5463 sv = SvREFCNT_inc(sv_h_undef);
5464 } else if (c == SX_VALUE) {
5465 TRACEME(("(#%d) value", i));
5466 sv = retrieve(aTHX_ cxt, 0);
5470 (void) retrieve_other(aTHX_ (stcxt_t *) 0, 0); /* Will croak out */
5474 * Since we're reading into kbuf, we must ensure we're not
5475 * recursing between the read and the hv_store() where it's used.
5476 * Hence the key comes after the value.
5481 (void) retrieve_other(aTHX_ (stcxt_t *) 0, 0); /* Will croak out */
5482 RLEN(size); /* Get key size */
5483 KBUFCHK((STRLEN)size); /* Grow hash key read pool if needed */
5486 kbuf[size] = '\0'; /* Mark string end, just in case */
5487 TRACEME(("(#%d) key '%s'", i, kbuf));
5490 * Enter key/value pair into hash table.
5493 if (hv_store(hv, kbuf, (U32) size, sv, 0) == 0)
5497 TRACEME(("ok (retrieve_hash at 0x%"UVxf")", PTR2UV(hv)));
5503 *** Retrieval engine.
5509 * Make sure the stored data we're trying to retrieve has been produced
5510 * on an ILP compatible system with the same byteorder. It croaks out in
5511 * case an error is detected. [ILP = integer-long-pointer sizes]
5512 * Returns null if error is detected, &PL_sv_undef otherwise.
5514 * Note that there's no byte ordering info emitted when network order was
5515 * used at store time.
5517 static SV *magic_check(pTHX_ stcxt_t *cxt)
5519 /* The worst case for a malicious header would be old magic (which is
5520 longer), major, minor, byteorder length byte of 255, 255 bytes of
5521 garbage, sizeof int, long, pointer, NV.
5522 So the worse of that we can read is 255 bytes of garbage plus 4.
5523 Err, I am assuming 8 bit bytes here. Please file a bug report if you're
5524 compiling perl on a system with chars that are larger than 8 bits.
5525 (Even Crays aren't *that* perverse).
5527 unsigned char buf[4 + 255];
5528 unsigned char *current;
5531 int use_network_order;
5534 int version_minor = 0;
5536 TRACEME(("magic_check"));
5539 * The "magic number" is only for files, not when freezing in memory.
5543 /* This includes the '\0' at the end. I want to read the extra byte,
5544 which is usually going to be the major version number. */
5545 STRLEN len = sizeof(magicstr);
5548 READ(buf, (SSize_t)(len)); /* Not null-terminated */
5550 /* Point at the byte after the byte we read. */
5551 current = buf + --len; /* Do the -- outside of macros. */
5553 if (memNE(buf, magicstr, len)) {
5555 * Try to read more bytes to check for the old magic number, which
5559 TRACEME(("trying for old magic number"));
5561 old_len = sizeof(old_magicstr) - 1;
5562 READ(current + 1, (SSize_t)(old_len - len));
5564 if (memNE(buf, old_magicstr, old_len))
5565 CROAK(("File is not a perl storable"));
5566 current = buf + old_len;
5568 use_network_order = *current;
5570 GETMARK(use_network_order);
5573 * Starting with 0.6, the "use_network_order" byte flag is also used to
5574 * indicate the version number of the binary, and therefore governs the
5575 * setting of sv_retrieve_vtbl. See magic_write().
5578 version_major = use_network_order >> 1;
5579 cxt->retrieve_vtbl = (SV*(**)(pTHX_ stcxt_t *cxt, char *cname)) (version_major ? sv_retrieve : sv_old_retrieve);
5581 TRACEME(("magic_check: netorder = 0x%x", use_network_order));
5585 * Starting with 0.7 (binary major 2), a full byte is dedicated to the
5586 * minor version of the protocol. See magic_write().
5589 if (version_major > 1)
5590 GETMARK(version_minor);
5592 cxt->ver_major = version_major;
5593 cxt->ver_minor = version_minor;
5595 TRACEME(("binary image version is %d.%d", version_major, version_minor));
5598 * Inter-operability sanity check: we can't retrieve something stored
5599 * using a format more recent than ours, because we have no way to
5600 * know what has changed, and letting retrieval go would mean a probable
5601 * failure reporting a "corrupted" storable file.
5605 version_major > STORABLE_BIN_MAJOR ||
5606 (version_major == STORABLE_BIN_MAJOR &&
5607 version_minor > STORABLE_BIN_MINOR)
5610 TRACEME(("but I am version is %d.%d", STORABLE_BIN_MAJOR,
5611 STORABLE_BIN_MINOR));
5613 if (version_major == STORABLE_BIN_MAJOR) {
5614 TRACEME(("cxt->accept_future_minor is %d",
5615 cxt->accept_future_minor));
5616 if (cxt->accept_future_minor < 0)
5617 cxt->accept_future_minor
5618 = (SvTRUE(perl_get_sv("Storable::accept_future_minor",
5621 if (cxt->accept_future_minor == 1)
5622 croak_now = 0; /* Don't croak yet. */
5625 CROAK(("Storable binary image v%d.%d more recent than I am (v%d.%d)",
5626 version_major, version_minor,
5627 STORABLE_BIN_MAJOR, STORABLE_BIN_MINOR));
5632 * If they stored using network order, there's no byte ordering
5633 * information to check.
5636 if ((cxt->netorder = (use_network_order & 0x1))) /* Extra () for -Wall */
5637 return &PL_sv_undef; /* No byte ordering info */
5639 /* In C truth is 1, falsehood is 0. Very convienient. */
5640 use_NV_size = version_major >= 2 && version_minor >= 2;
5643 length = c + 3 + use_NV_size;
5644 READ(buf, length); /* Not null-terminated */
5646 TRACEME(("byte order '%.*s' %d", c, buf, c));
5648 #ifdef USE_56_INTERWORK_KLUDGE
5649 /* No point in caching this in the context as we only need it once per
5650 retrieve, and we need to recheck it each read. */
5651 if (SvTRUE(perl_get_sv("Storable::interwork_56_64bit", TRUE))) {
5652 if ((c != (sizeof (byteorderstr_56) - 1))
5653 || memNE(buf, byteorderstr_56, c))
5654 CROAK(("Byte order is not compatible"));
5658 if ((c != (sizeof (byteorderstr) - 1)) || memNE(buf, byteorderstr, c))
5659 CROAK(("Byte order is not compatible"));
5665 if ((int) *current++ != sizeof(int))
5666 CROAK(("Integer size is not compatible"));
5669 if ((int) *current++ != sizeof(long))
5670 CROAK(("Long integer size is not compatible"));
5672 /* sizeof(char *) */
5673 if ((int) *current != sizeof(char *))
5674 CROAK(("Pointer size is not compatible"));
5678 if ((int) *++current != sizeof(NV))
5679 CROAK(("Double size is not compatible"));
5682 return &PL_sv_undef; /* OK */
5688 * Recursively retrieve objects from the specified file and return their
5689 * root SV (which may be an AV or an HV for what we care).
5690 * Returns null if there is a problem.
5692 static SV *retrieve(pTHX_ stcxt_t *cxt, char *cname)
5698 TRACEME(("retrieve"));
5701 * Grab address tag which identifies the object if we are retrieving
5702 * an older format. Since the new binary format counts objects and no
5703 * longer explicitely tags them, we must keep track of the correspondance
5706 * The following section will disappear one day when the old format is
5707 * no longer supported, hence the final "goto" in the "if" block.
5710 if (cxt->hseen) { /* Retrieving old binary */
5712 if (cxt->netorder) {
5714 READ(&nettag, sizeof(I32)); /* Ordered sequence of I32 */
5715 tag = (stag_t) nettag;
5717 READ(&tag, sizeof(stag_t)); /* Original address of the SV */
5720 if (type == SX_OBJECT) {
5722 svh = hv_fetch(cxt->hseen, (char *) &tag, sizeof(tag), FALSE);
5724 CROAK(("Old tag 0x%"UVxf" should have been mapped already",
5726 tagn = SvIV(*svh); /* Mapped tag number computed earlier below */
5729 * The following code is common with the SX_OBJECT case below.
5732 svh = av_fetch(cxt->aseen, tagn, FALSE);
5734 CROAK(("Object #%"IVdf" should have been retrieved already",
5737 TRACEME(("has retrieved #%d at 0x%"UVxf, tagn, PTR2UV(sv)));
5738 SvREFCNT_inc(sv); /* One more reference to this same sv */
5739 return sv; /* The SV pointer where object was retrieved */
5743 * Map new object, but don't increase tagnum. This will be done
5744 * by each of the retrieve_* functions when they call SEEN().
5746 * The mapping associates the "tag" initially present with a unique
5747 * tag number. See test for SX_OBJECT above to see how this is perused.
5750 if (!hv_store(cxt->hseen, (char *) &tag, sizeof(tag),
5751 newSViv(cxt->tagnum), 0))
5758 * Regular post-0.6 binary format.
5763 TRACEME(("retrieve type = %d", type));
5766 * Are we dealing with an object we should have already retrieved?
5769 if (type == SX_OBJECT) {
5773 svh = av_fetch(cxt->aseen, tag, FALSE);
5775 CROAK(("Object #%"IVdf" should have been retrieved already",
5778 TRACEME(("had retrieved #%d at 0x%"UVxf, tag, PTR2UV(sv)));
5779 SvREFCNT_inc(sv); /* One more reference to this same sv */
5780 return sv; /* The SV pointer where object was retrieved */
5781 } else if (type >= SX_ERROR && cxt->ver_minor > STORABLE_BIN_MINOR) {
5782 if (cxt->accept_future_minor < 0)
5783 cxt->accept_future_minor
5784 = (SvTRUE(perl_get_sv("Storable::accept_future_minor",
5787 if (cxt->accept_future_minor == 1) {
5788 CROAK(("Storable binary image v%d.%d contains data of type %d. "
5789 "This Storable is v%d.%d and can only handle data types up to %d",
5790 cxt->ver_major, cxt->ver_minor, type,
5791 STORABLE_BIN_MAJOR, STORABLE_BIN_MINOR, SX_ERROR - 1));
5795 first_time: /* Will disappear when support for old format is dropped */
5798 * Okay, first time through for this one.
5801 sv = RETRIEVE(cxt, type)(aTHX_ cxt, cname);
5803 return (SV *) 0; /* Failed */
5806 * Old binary formats (pre-0.7).
5808 * Final notifications, ended by SX_STORED may now follow.
5809 * Currently, the only pertinent notification to apply on the
5810 * freshly retrieved object is either:
5811 * SX_CLASS <char-len> <classname> for short classnames.
5812 * SX_LG_CLASS <int-len> <classname> for larger one (rare!).
5813 * Class name is then read into the key buffer pool used by
5814 * hash table key retrieval.
5817 if (cxt->ver_major < 2) {
5818 while ((type = GETCHAR()) != SX_STORED) {
5822 GETMARK(len); /* Length coded on a single char */
5824 case SX_LG_CLASS: /* Length coded on a regular integer */
5829 return (SV *) 0; /* Failed */
5831 KBUFCHK((STRLEN)len); /* Grow buffer as necessary */
5834 kbuf[len] = '\0'; /* Mark string end */
5839 TRACEME(("ok (retrieved 0x%"UVxf", refcnt=%d, %s)", PTR2UV(sv),
5840 SvREFCNT(sv) - 1, sv_reftype(sv, FALSE)));
5848 * Retrieve data held in file and return the root object.
5849 * Common routine for pretrieve and mretrieve.
5851 static SV *do_retrieve(
5859 int is_tainted; /* Is input source tainted? */
5860 int pre_06_fmt = 0; /* True with pre Storable 0.6 formats */
5862 TRACEME(("do_retrieve (optype = 0x%x)", optype));
5864 optype |= ST_RETRIEVE;
5867 * Sanity assertions for retrieve dispatch tables.
5870 ASSERT(sizeof(sv_old_retrieve) == sizeof(sv_retrieve),
5871 ("old and new retrieve dispatch table have same size"));
5872 ASSERT(sv_old_retrieve[SX_ERROR] == retrieve_other,
5873 ("SX_ERROR entry correctly initialized in old dispatch table"));
5874 ASSERT(sv_retrieve[SX_ERROR] == retrieve_other,
5875 ("SX_ERROR entry correctly initialized in new dispatch table"));
5878 * Workaround for CROAK leak: if they enter with a "dirty" context,
5879 * free up memory for them now.
5883 clean_context(aTHX_ cxt);
5886 * Now that STORABLE_xxx hooks exist, it is possible that they try to
5887 * re-enter retrieve() via the hooks.
5891 cxt = allocate_context(aTHX_ cxt);
5895 ASSERT(cxt->entry == 1, ("starting new recursion"));
5896 ASSERT(!cxt->s_dirty, ("clean context"));
5901 * Data is loaded into the memory buffer when f is NULL, unless `in' is
5902 * also NULL, in which case we're expecting the data to already lie
5903 * in the buffer (dclone case).
5906 KBUFINIT(); /* Allocate hash key reading pool once */
5912 const char *orig = SvPV(in, length);
5914 /* This is quite deliberate. I want the UTF8 routines
5915 to encounter the '\0' which perl adds at the end
5916 of all scalars, so that any new string also has
5919 STRLEN klen_tmp = length + 1;
5920 bool is_utf8 = TRUE;
5922 /* Just casting the &klen to (STRLEN) won't work
5923 well if STRLEN and I32 are of different widths.
5925 asbytes = (char*)bytes_from_utf8((U8*)orig,
5929 CROAK(("Frozen string corrupt - contains characters outside 0-255"));
5931 if (asbytes != orig) {
5932 /* String has been converted.
5933 There is no need to keep any reference to
5935 in = sv_newmortal();
5936 /* We donate the SV the malloc()ed string
5937 bytes_from_utf8 returned us. */
5938 SvUPGRADE(in, SVt_PV);
5940 SvPV_set(in, asbytes);
5941 SvLEN_set(in, klen_tmp);
5942 SvCUR_set(in, klen_tmp - 1);
5946 MBUF_SAVE_AND_LOAD(in);
5950 * Magic number verifications.
5952 * This needs to be done before calling init_retrieve_context()
5953 * since the format indication in the file are necessary to conduct
5954 * some of the initializations.
5957 cxt->fio = f; /* Where I/O are performed */
5959 if (!magic_check(aTHX_ cxt))
5960 CROAK(("Magic number checking on storable %s failed",
5961 cxt->fio ? "file" : "string"));
5963 TRACEME(("data stored in %s format",
5964 cxt->netorder ? "net order" : "native"));
5967 * Check whether input source is tainted, so that we don't wrongly
5968 * taint perfectly good values...
5970 * We assume file input is always tainted. If both `f' and `in' are
5971 * NULL, then we come from dclone, and tainted is already filled in
5972 * the context. That's a kludge, but the whole dclone() thing is
5973 * already quite a kludge anyway! -- RAM, 15/09/2000.
5976 is_tainted = f ? 1 : (in ? SvTAINTED(in) : cxt->s_tainted);
5977 TRACEME(("input source is %s", is_tainted ? "tainted" : "trusted"));
5978 init_retrieve_context(aTHX_ cxt, optype, is_tainted);
5980 ASSERT(is_retrieving(aTHX), ("within retrieve operation"));
5982 sv = retrieve(aTHX_ cxt, 0); /* Recursively retrieve object, get root SV */
5991 pre_06_fmt = cxt->hseen != NULL; /* Before we clean context */
5994 * The "root" context is never freed.
5997 clean_retrieve_context(aTHX_ cxt);
5998 if (cxt->prev) /* This context was stacked */
5999 free_context(aTHX_ cxt); /* It was not the "root" context */
6002 * Prepare returned value.
6006 TRACEME(("retrieve ERROR"));
6007 #if (PATCHLEVEL <= 4)
6008 /* perl 5.00405 seems to screw up at this point with an
6009 'attempt to modify a read only value' error reported in the
6010 eval { $self = pretrieve(*FILE) } in _retrieve.
6011 I can't see what the cause of this error is, but I suspect a
6012 bug in 5.004, as it seems to be capable of issuing spurious
6013 errors or core dumping with matches on $@. I'm not going to
6014 spend time on what could be a fruitless search for the cause,
6015 so here's a bodge. If you're running 5.004 and don't like
6016 this inefficiency, either upgrade to a newer perl, or you are
6017 welcome to find the problem and send in a patch.
6021 return &PL_sv_undef; /* Something went wrong, return undef */
6025 TRACEME(("retrieve got %s(0x%"UVxf")",
6026 sv_reftype(sv, FALSE), PTR2UV(sv)));
6029 * Backward compatibility with Storable-0.5@9 (which we know we
6030 * are retrieving if hseen is non-null): don't create an extra RV
6031 * for objects since we special-cased it at store time.
6033 * Build a reference to the SV returned by pretrieve even if it is
6034 * already one and not a scalar, for consistency reasons.
6037 if (pre_06_fmt) { /* Was not handling overloading by then */
6039 TRACEME(("fixing for old formats -- pre 0.6"));
6040 if (sv_type(aTHX_ sv) == svis_REF && (rv = SvRV(sv)) && SvOBJECT(rv)) {
6041 TRACEME(("ended do_retrieve() with an object -- pre 0.6"));
6047 * If reference is overloaded, restore behaviour.
6049 * NB: minor glitch here: normally, overloaded refs are stored specially
6050 * so that we can croak when behaviour cannot be re-installed, and also
6051 * avoid testing for overloading magic at each reference retrieval.
6053 * Unfortunately, the root reference is implicitely stored, so we must
6054 * check for possible overloading now. Furthermore, if we don't restore
6055 * overloading, we cannot croak as if the original ref was, because we
6056 * have no way to determine whether it was an overloaded ref or not in
6059 * It's a pity that overloading magic is attached to the rv, and not to
6060 * the underlying sv as blessing is.
6064 HV *stash = (HV *) SvSTASH(sv);
6065 SV *rv = newRV_noinc(sv);
6066 if (stash && Gv_AMG(stash)) {
6068 TRACEME(("restored overloading on root reference"));
6070 TRACEME(("ended do_retrieve() with an object"));
6074 TRACEME(("regular do_retrieve() end"));
6076 return newRV_noinc(sv);
6082 * Retrieve data held in file and return the root object, undef on error.
6084 SV *pretrieve(pTHX_ PerlIO *f)
6086 TRACEME(("pretrieve"));
6087 return do_retrieve(aTHX_ f, Nullsv, 0);
6093 * Retrieve data held in scalar and return the root object, undef on error.
6095 SV *mretrieve(pTHX_ SV *sv)
6097 TRACEME(("mretrieve"));
6098 return do_retrieve(aTHX_ (PerlIO*) 0, sv, 0);
6108 * Deep clone: returns a fresh copy of the original referenced SV tree.
6110 * This is achieved by storing the object in memory and restoring from
6111 * there. Not that efficient, but it should be faster than doing it from
6114 SV *dclone(pTHX_ SV *sv)
6118 stcxt_t *real_context;
6121 TRACEME(("dclone"));
6124 * Workaround for CROAK leak: if they enter with a "dirty" context,
6125 * free up memory for them now.
6129 clean_context(aTHX_ cxt);
6132 * do_store() optimizes for dclone by not freeing its context, should
6133 * we need to allocate one because we're deep cloning from a hook.
6136 if (!do_store(aTHX_ (PerlIO*) 0, sv, ST_CLONE, FALSE, (SV**) 0))
6137 return &PL_sv_undef; /* Error during store */
6140 * Because of the above optimization, we have to refresh the context,
6141 * since a new one could have been allocated and stacked by do_store().
6144 { dSTCXT; real_context = cxt; } /* Sub-block needed for macro */
6145 cxt = real_context; /* And we need this temporary... */
6148 * Now, `cxt' may refer to a new context.
6151 ASSERT(!cxt->s_dirty, ("clean context"));
6152 ASSERT(!cxt->entry, ("entry will not cause new context allocation"));
6155 TRACEME(("dclone stored %d bytes", size));
6159 * Since we're passing do_retrieve() both a NULL file and sv, we need
6160 * to pre-compute the taintedness of the input by setting cxt->tainted
6161 * to whatever state our own input string was. -- RAM, 15/09/2000
6163 * do_retrieve() will free non-root context.
6166 cxt->s_tainted = SvTAINTED(sv);
6167 out = do_retrieve(aTHX_ (PerlIO*) 0, Nullsv, ST_CLONE);
6169 TRACEME(("dclone returns 0x%"UVxf, PTR2UV(out)));
6179 * The Perl IO GV object distinguishes between input and output for sockets
6180 * but not for plain files. To allow Storable to transparently work on
6181 * plain files and sockets transparently, we have to ask xsubpp to fetch the
6182 * right object for us. Hence the OutputStream and InputStream declarations.
6184 * Before perl 5.004_05, those entries in the standard typemap are not
6185 * defined in perl include files, so we do that here.
6188 #ifndef OutputStream
6189 #define OutputStream PerlIO *
6190 #define InputStream PerlIO *
6191 #endif /* !OutputStream */
6193 MODULE = Storable PACKAGE = Storable::Cxt
6199 stcxt_t *cxt = (stcxt_t *)SvPVX(SvRV(self));
6203 if (!cxt->membuf_ro && mbase)
6205 if (cxt->membuf_ro && (cxt->msaved).arena)
6206 Safefree((cxt->msaved).arena);
6209 MODULE = Storable PACKAGE = Storable
6214 init_perinterp(aTHX);
6215 gv_fetchpv("Storable::drop_utf8", GV_ADDMULTI, SVt_PV);
6217 /* Only disable the used only once warning if we are in debugging mode. */
6218 gv_fetchpv("Storable::DEBUGME", GV_ADDMULTI, SVt_PV);
6220 #ifdef USE_56_INTERWORK_KLUDGE
6221 gv_fetchpv("Storable::interwork_56_64bit", GV_ADDMULTI, SVt_PV);
6227 init_perinterp(aTHX);
6234 RETVAL = pstore(aTHX_ f, obj);
6243 RETVAL = net_pstore(aTHX_ f, obj);
6251 RETVAL = mstore(aTHX_ obj);
6259 RETVAL = net_mstore(aTHX_ obj);
6267 RETVAL = pretrieve(aTHX_ f);
6275 RETVAL = mretrieve(aTHX_ sv);
6283 RETVAL = dclone(aTHX_ sv);
6288 last_op_in_netorder()
6290 RETVAL = last_op_in_netorder(aTHX);
6297 RETVAL = is_storing(aTHX);
6304 RETVAL = is_retrieving(aTHX);