This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
Coverity reports that Storable can potentially cause a NULL pointer
[perl5.git] / ext / Storable / Storable.xs
CommitLineData
7a6a85bf 1/*
6ad89a2f 2 * Store and retrieve mechanism.
7a6a85bf
RG
3 *
4 * Copyright (c) 1995-2000, Raphael Manfredi
5 *
9e21b3d0
JH
6 * You may redistribute only under the same terms as Perl 5, as specified
7 * in the README file that comes with the distribution.
7a6a85bf 8 *
7a6a85bf
RG
9 */
10
138ec36d 11#define PERL_NO_GET_CONTEXT /* we want efficiency */
7a6a85bf
RG
12#include <EXTERN.h>
13#include <perl.h>
a3bf621f
JH
14#include <XSUB.h>
15
eadddfac 16#ifndef PATCHLEVEL
fac63a07 17#include <patchlevel.h> /* Perl's one, needed since 5.6 */
069d7f71 18#endif
7a6a85bf 19
fac63a07 20#if !defined(PERL_VERSION) || PERL_VERSION < 8
3f575d8d
NC
21#include "ppport.h" /* handle old perls */
22#endif
23
e8189732 24#if 0
9e21b3d0
JH
25#define DEBUGME /* Debug mode, turns assertions on as well */
26#define DASSERT /* Assertion mode */
27#endif
7a6a85bf
RG
28
29/*
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.
32 */
33#ifndef USE_PERLIO
34#ifndef PERLIO_IS_STDIO
35#define PerlIO FILE
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 */
43
44/*
45 * Earlier versions of perl might be used, we can't assume they have the latest!
46 */
f0ffaed8
JH
47
48#ifndef PERL_VERSION /* For perls < 5.6 */
e993d95c 49#define PERL_VERSION PATCHLEVEL
7a6a85bf
RG
50#ifndef newRV_noinc
51#define newRV_noinc(sv) ((Sv = newRV(sv)), --SvREFCNT(SvRV(Sv)), Sv)
52#endif
e993d95c 53#if (PATCHLEVEL <= 4) /* Older perls (<= 5.004) lack PL_ namespace */
7a6a85bf
RG
54#define PL_sv_yes sv_yes
55#define PL_sv_no sv_no
56#define PL_sv_undef sv_undef
e993d95c 57#if (SUBVERSION <= 4) /* 5.004_04 has been reported to lack newSVpvn */
dd19458b 58#define newSVpvn newSVpv
7a6a85bf 59#endif
e993d95c 60#endif /* PATCHLEVEL <= 4 */
7a6a85bf
RG
61#ifndef HvSHAREKEYS_off
62#define HvSHAREKEYS_off(hv) /* Ignore */
63#endif
f0ffaed8
JH
64#ifndef AvFILLp /* Older perls (<=5.003) lack AvFILLp */
65#define AvFILLp AvFILL
66#endif
67typedef double NV; /* Older perls lack the NV type */
cc964657
JH
68#define IVdf "ld" /* Various printf formats for Perl types */
69#define UVuf "lu"
70#define UVof "lo"
71#define UVxf "lx"
72#define INT2PTR(t,v) (t)(IV)(v)
73#define PTR2UV(v) (unsigned long)(v)
f0ffaed8 74#endif /* PERL_VERSION -- perls < 5.6 */
7a6a85bf 75
cc964657 76#ifndef NVef /* The following were not part of perl 5.6 */
9e21b3d0
JH
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
82#else
cc964657
JH
83#define NVef "e"
84#define NVff "f"
85#define NVgf "g"
86#endif
87#endif
88
0bb78401
AMS
89#ifndef SvRV_set
90#define SvRV_set(sv, val) \
91 STMT_START { \
92 assert(SvTYPE(sv) >= SVt_RV); \
93 (((XRV*)SvANY(sv))->xrv_rv = (val)); \
94 } STMT_END
95#endif
aec614a5
NC
96
97#ifndef PERL_UNUSED_DECL
98# ifdef HASATTRIBUTE
99# if (defined(__GNUC__) && defined(__cplusplus)) || defined(__INTEL_COMPILER)
100# define PERL_UNUSED_DECL
101# else
102# define PERL_UNUSED_DECL __attribute__((unused))
103# endif
27da23d5 104# else
aec614a5 105# define PERL_UNUSED_DECL
27da23d5 106# endif
27da23d5
JH
107#endif
108
109#ifndef dNOOP
110#define dNOOP extern int Perl___notused PERL_UNUSED_DECL
111#endif
112
113#ifndef dVAR
114#define dVAR dNOOP
115#endif
116
bfcb3514 117#ifndef HvRITER_set
0bb78401 118# define HvRITER_set(hv,r) (HvRITER(hv) = r)
bfcb3514
NC
119#endif
120#ifndef HvEITER_set
0bb78401 121# define HvEITER_set(hv,r) (HvEITER(hv) = r)
bfcb3514
NC
122#endif
123
124#ifndef HvRITER_get
125# define HvRITER_get HvRITER
126#endif
127#ifndef HvEITER_get
128# define HvEITER_get HvEITER
129#endif
130
131#ifndef HvNAME_get
132#define HvNAME_get HvNAME
133#endif
134
ca732855
NC
135#ifndef HvPLACEHOLDERS_get
136# define HvPLACEHOLDERS_get HvPLACEHOLDERS
137#endif
138
7a6a85bf 139#ifdef DEBUGME
8be2b38b
JH
140
141#ifndef DASSERT
142#define DASSERT
143#endif
144
90826881
JH
145/*
146 * TRACEME() will only output things when the $Storable::DEBUGME is true.
147 */
148
111e03c1
RG
149#define TRACEME(x) \
150 STMT_START { \
90826881 151 if (SvTRUE(perl_get_sv("Storable::DEBUGME", TRUE))) \
111e03c1
RG
152 { PerlIO_stdoutf x; PerlIO_stdoutf("\n"); } \
153 } STMT_END
7a6a85bf
RG
154#else
155#define TRACEME(x)
8be2b38b 156#endif /* DEBUGME */
7a6a85bf
RG
157
158#ifdef DASSERT
111e03c1
RG
159#define ASSERT(x,y) \
160 STMT_START { \
7a6a85bf
RG
161 if (!(x)) { \
162 PerlIO_stdoutf("ASSERT FAILED (\"%s\", line %d): ", \
163 __FILE__, __LINE__); \
164 PerlIO_stdoutf y; PerlIO_stdoutf("\n"); \
165 } \
111e03c1 166 } STMT_END
7a6a85bf
RG
167#else
168#define ASSERT(x,y)
169#endif
170
171/*
172 * Type markers.
173 */
174
175#define C(x) ((char) (x)) /* For markers with dynamic retrieval handling */
176
177#define SX_OBJECT C(0) /* Already stored object */
dd19458b 178#define SX_LSCALAR C(1) /* Scalar (large binary) follows (length, data) */
7a6a85bf
RG
179#define SX_ARRAY C(2) /* Array forthcominng (size, item list) */
180#define SX_HASH C(3) /* Hash forthcoming (size, key/value pair list) */
181#define SX_REF C(4) /* Reference to object forthcoming */
182#define SX_UNDEF C(5) /* Undefined scalar */
183#define SX_INTEGER C(6) /* Integer forthcoming */
184#define SX_DOUBLE C(7) /* Double forthcoming */
185#define SX_BYTE C(8) /* (signed) byte forthcoming */
186#define SX_NETINT C(9) /* Integer in network order forthcoming */
dd19458b 187#define SX_SCALAR C(10) /* Scalar (binary, small) follows (length, data) */
f062ea6c
PN
188#define SX_TIED_ARRAY C(11) /* Tied array forthcoming */
189#define SX_TIED_HASH C(12) /* Tied hash forthcoming */
190#define SX_TIED_SCALAR C(13) /* Tied scalar forthcoming */
7a6a85bf
RG
191#define SX_SV_UNDEF C(14) /* Perl's immortal PL_sv_undef */
192#define SX_SV_YES C(15) /* Perl's immortal PL_sv_yes */
193#define SX_SV_NO C(16) /* Perl's immortal PL_sv_no */
194#define SX_BLESS C(17) /* Object is blessed */
195#define SX_IX_BLESS C(18) /* Object is blessed, classname given by index */
196#define SX_HOOK C(19) /* Stored via hook, user-defined */
197#define SX_OVERLOAD C(20) /* Overloaded reference */
f062ea6c
PN
198#define SX_TIED_KEY C(21) /* Tied magic key forthcoming */
199#define SX_TIED_IDX C(22) /* Tied magic index forthcoming */
200#define SX_UTF8STR C(23) /* UTF-8 string forthcoming (small) */
201#define SX_LUTF8STR C(24) /* UTF-8 string forthcoming (large) */
202#define SX_FLAG_HASH C(25) /* Hash with flags forthcoming (size, flags, key/flags/value triplet list) */
464b080a 203#define SX_CODE C(26) /* Code references as perl source code */
c3c53033
NC
204#define SX_WEAKREF C(27) /* Weak reference to object forthcoming */
205#define SX_WEAKOVERLOAD C(28) /* Overloaded weak reference */
206#define SX_ERROR C(29) /* Error */
7a6a85bf
RG
207
208/*
209 * Those are only used to retrieve "old" pre-0.6 binary images.
210 */
211#define SX_ITEM 'i' /* An array item introducer */
212#define SX_IT_UNDEF 'I' /* Undefined array item */
d1be9408
JF
213#define SX_KEY 'k' /* A hash key introducer */
214#define SX_VALUE 'v' /* A hash value introducer */
7a6a85bf
RG
215#define SX_VL_UNDEF 'V' /* Undefined hash value */
216
217/*
218 * Those are only used to retrieve "old" pre-0.7 binary images
219 */
220
221#define SX_CLASS 'b' /* Object is blessed, class name length <255 */
f062ea6c 222#define SX_LG_CLASS 'B' /* Object is blessed, class name length >255 */
7a6a85bf
RG
223#define SX_STORED 'X' /* End of object */
224
225/*
226 * Limits between short/long length representation.
227 */
228
229#define LG_SCALAR 255 /* Large scalar length limit */
230#define LG_BLESS 127 /* Large classname bless limit */
231
232/*
233 * Operation types
234 */
235
236#define ST_STORE 0x1 /* Store operation */
237#define ST_RETRIEVE 0x2 /* Retrieval operation */
238#define ST_CLONE 0x4 /* Deep cloning operation */
239
240/*
241 * The following structure is used for hash table key retrieval. Since, when
242 * retrieving objects, we'll be facing blessed hash references, it's best
243 * to pre-allocate that buffer once and resize it as the need arises, never
244 * freeing it (keys will be saved away someplace else anyway, so even large
245 * keys are not enough a motivation to reclaim that space).
246 *
247 * This structure is also used for memory store/retrieve operations which
248 * happen in a fixed place before being malloc'ed elsewhere if persistency
249 * is required. Hence the aptr pointer.
250 */
251struct extendable {
252 char *arena; /* Will hold hash key strings, resized as needed */
253 STRLEN asiz; /* Size of aforementionned buffer */
254 char *aptr; /* Arena pointer, for in-place read/write ops */
255 char *aend; /* First invalid address */
256};
257
258/*
259 * At store time:
d1be9408 260 * A hash table records the objects which have already been stored.
7a6a85bf
RG
261 * Those are referred to as SX_OBJECT in the file, and their "tag" (i.e.
262 * an arbitrary sequence number) is used to identify them.
263 *
264 * At retrieve time:
265 * An array table records the objects which have already been retrieved,
266 * as seen by the tag determind by counting the objects themselves. The
267 * reference to that retrieved object is kept in the table, and is returned
268 * when an SX_OBJECT is found bearing that same tag.
269 *
270 * The same processing is used to record "classname" for blessed objects:
271 * indexing by a hash at store time, and via an array at retrieve time.
272 */
273
274typedef unsigned long stag_t; /* Used by pre-0.6 binary format */
275
276/*
277 * The following "thread-safe" related defines were contributed by
278 * Murray Nesbitt <murray@activestate.com> and integrated by RAM, who
279 * only renamed things a little bit to ensure consistency with surrounding
280 * code. -- RAM, 14/09/1999
281 *
282 * The original patch suffered from the fact that the stcxt_t structure
283 * was global. Murray tried to minimize the impact on the code as much as
284 * possible.
285 *
286 * Starting with 0.7, Storable can be re-entrant, via the STORABLE_xxx hooks
287 * on objects. Therefore, the notion of context needs to be generalized,
288 * threading or not.
289 */
290
291#define MY_VERSION "Storable(" XS_VERSION ")"
292
530b72ba
NC
293
294/*
295 * Conditional UTF8 support.
296 *
297 */
298#ifdef SvUTF8_on
299#define STORE_UTF8STR(pv, len) STORE_PV_LEN(pv, len, SX_UTF8STR, SX_LUTF8STR)
300#define HAS_UTF8_SCALARS
301#ifdef HeKUTF8
302#define HAS_UTF8_HASHES
303#define HAS_UTF8_ALL
304#else
305/* 5.6 perl has utf8 scalars but not hashes */
306#endif
307#else
308#define SvUTF8(sv) 0
309#define STORE_UTF8STR(pv, len) CROAK(("panic: storing UTF8 in non-UTF8 perl"))
310#endif
311#ifndef HAS_UTF8_ALL
312#define UTF8_CROAK() CROAK(("Cannot retrieve UTF8 data in non-UTF8 perl"))
313#endif
c3c53033
NC
314#ifndef SvWEAKREF
315#define WEAKREF_CROAK() CROAK(("Cannot retrieve weak references in this perl"))
316#endif
530b72ba
NC
317
318#ifdef HvPLACEHOLDERS
319#define HAS_RESTRICTED_HASHES
320#else
321#define HVhek_PLACEHOLD 0x200
322#define RESTRICTED_HASH_CROAK() CROAK(("Cannot retrieve restricted hash"))
323#endif
324
325#ifdef HvHASKFLAGS
326#define HAS_HASH_KEY_FLAGS
327#endif
328
ab923da1
NC
329#ifdef ptr_table_new
330#define USE_PTR_TABLE
331#endif
332
dd19458b
JH
333/*
334 * Fields s_tainted and s_dirty are prefixed with s_ because Perl's include
335 * files remap tainted and dirty when threading is enabled. That's bad for
336 * perl to remap such common words. -- RAM, 29/09/00
337 */
338
0723351e 339struct stcxt;
7a6a85bf
RG
340typedef struct stcxt {
341 int entry; /* flags recursion */
342 int optype; /* type of traversal operation */
ab923da1
NC
343 /* which objects have been seen, store time.
344 tags are numbers, which are cast to (SV *) and stored directly */
345#ifdef USE_PTR_TABLE
346 /* use pseen if we have ptr_tables. We have to store tag+1, because
347 tag numbers start at 0, and we can't store (SV *) 0 in a ptr_table
348 without it being confused for a fetch lookup failure. */
349 struct ptr_tbl *pseen;
350 /* Still need hseen for the 0.6 file format code. */
351#endif
352 HV *hseen;
e993d95c
JH
353 AV *hook_seen; /* which SVs were returned by STORABLE_freeze() */
354 AV *aseen; /* which objects have been seen, retrieve time */
dfd91409 355 IV where_is_undef; /* index in aseen of PL_sv_undef */
e993d95c
JH
356 HV *hclass; /* which classnames have been seen, store time */
357 AV *aclass; /* which classnames have been seen, retrieve time */
358 HV *hook; /* cache for hook methods per class name */
359 IV tagnum; /* incremented at store time for each seen object */
360 IV classnum; /* incremented at store time for each seen classname */
361 int netorder; /* true if network order used */
362 int s_tainted; /* true if input source is tainted, at retrieve time */
363 int forgive_me; /* whether to be forgiving... */
464b080a
SR
364 int deparse; /* whether to deparse code refs */
365 SV *eval; /* whether to eval source code */
e993d95c 366 int canonical; /* whether to store hashes sorted by key */
530b72ba
NC
367#ifndef HAS_RESTRICTED_HASHES
368 int derestrict; /* whether to downgrade restrcted hashes */
369#endif
370#ifndef HAS_UTF8_ALL
371 int use_bytes; /* whether to bytes-ify utf8 */
372#endif
e8189732 373 int accept_future_minor; /* croak immediately on future minor versions? */
dd19458b 374 int s_dirty; /* context is dirty due to CROAK() -- can be cleaned */
e993d95c
JH
375 int membuf_ro; /* true means membuf is read-only and msaved is rw */
376 struct extendable keybuf; /* for hash key retrieval */
377 struct extendable membuf; /* for memory store/retrieve operations */
378 struct extendable msaved; /* where potentially valid mbuf is saved */
7a6a85bf
RG
379 PerlIO *fio; /* where I/O are performed, NULL for memory */
380 int ver_major; /* major of version for retrieved object */
381 int ver_minor; /* minor of version for retrieved object */
aa07b2f6 382 SV *(**retrieve_vtbl)(pTHX_ struct stcxt *, const char *); /* retrieve dispatch table */
111e03c1
RG
383 SV *prev; /* contexts chained backwards in real recursion */
384 SV *my_sv; /* the blessed scalar who's SvPVX() I am */
7a6a85bf
RG
385} stcxt_t;
386
111e03c1
RG
387#define NEW_STORABLE_CXT_OBJ(cxt) \
388 STMT_START { \
389 SV *self = newSV(sizeof(stcxt_t) - 1); \
390 SV *my_sv = newRV_noinc(self); \
391 sv_bless(my_sv, gv_stashpv("Storable::Cxt", TRUE)); \
392 cxt = (stcxt_t *)SvPVX(self); \
393 Zero(cxt, 1, stcxt_t); \
394 cxt->my_sv = my_sv; \
395 } STMT_END
396
7a6a85bf
RG
397#if defined(MULTIPLICITY) || defined(PERL_OBJECT) || defined(PERL_CAPI)
398
e993d95c 399#if (PATCHLEVEL <= 4) && (SUBVERSION < 68)
7a6a85bf
RG
400#define dSTCXT_SV \
401 SV *perinterp_sv = perl_get_sv(MY_VERSION, FALSE)
402#else /* >= perl5.004_68 */
403#define dSTCXT_SV \
404 SV *perinterp_sv = *hv_fetch(PL_modglobal, \
405 MY_VERSION, sizeof(MY_VERSION)-1, TRUE)
406#endif /* < perl5.004_68 */
407
408#define dSTCXT_PTR(T,name) \
111e03c1 409 T name = ((perinterp_sv && SvIOK(perinterp_sv) && SvIVX(perinterp_sv) \
436c6dd3 410 ? (T)SvPVX(SvRV(INT2PTR(SV*,SvIVX(perinterp_sv)))) : (T) 0))
7a6a85bf
RG
411#define dSTCXT \
412 dSTCXT_SV; \
413 dSTCXT_PTR(stcxt_t *, cxt)
414
111e03c1
RG
415#define INIT_STCXT \
416 dSTCXT; \
417 NEW_STORABLE_CXT_OBJ(cxt); \
418 sv_setiv(perinterp_sv, PTR2IV(cxt->my_sv))
7a6a85bf 419
111e03c1
RG
420#define SET_STCXT(x) \
421 STMT_START { \
7a6a85bf 422 dSTCXT_SV; \
111e03c1
RG
423 sv_setiv(perinterp_sv, PTR2IV(x->my_sv)); \
424 } STMT_END
7a6a85bf
RG
425
426#else /* !MULTIPLICITY && !PERL_OBJECT && !PERL_CAPI */
427
85535365 428static stcxt_t *Context_ptr = NULL;
7a6a85bf 429#define dSTCXT stcxt_t *cxt = Context_ptr
85535365 430#define SET_STCXT(x) Context_ptr = x
111e03c1
RG
431#define INIT_STCXT \
432 dSTCXT; \
85535365
RG
433 NEW_STORABLE_CXT_OBJ(cxt); \
434 SET_STCXT(cxt)
111e03c1 435
7a6a85bf
RG
436
437#endif /* MULTIPLICITY || PERL_OBJECT || PERL_CAPI */
438
439/*
440 * KNOWN BUG:
441 * Croaking implies a memory leak, since we don't use setjmp/longjmp
442 * to catch the exit and free memory used during store or retrieve
443 * operations. This is not too difficult to fix, but I need to understand
444 * how Perl does it, and croaking is exceptional anyway, so I lack the
445 * motivation to do it.
446 *
447 * The current workaround is to mark the context as dirty when croaking,
448 * so that data structures can be freed whenever we renter Storable code
449 * (but only *then*: it's a workaround, not a fix).
450 *
451 * This is also imperfect, because we don't really know how far they trapped
452 * the croak(), and when we were recursing, we won't be able to clean anything
453 * but the topmost context stacked.
454 */
455
111e03c1 456#define CROAK(x) STMT_START { cxt->s_dirty = 1; croak x; } STMT_END
7a6a85bf
RG
457
458/*
459 * End of "thread-safe" related definitions.
460 */
461
462/*
9e21b3d0
JH
463 * LOW_32BITS
464 *
465 * Keep only the low 32 bits of a pointer (used for tags, which are not
466 * really pointers).
467 */
468
469#if PTRSIZE <= 4
470#define LOW_32BITS(x) ((I32) (x))
471#else
472#define LOW_32BITS(x) ((I32) ((unsigned long) (x) & 0xffffffffUL))
473#endif
474
475/*
476 * oI, oS, oC
477 *
478 * Hack for Crays, where sizeof(I32) == 8, and which are big-endians.
479 * Used in the WLEN and RLEN macros.
480 */
481
482#if INTSIZE > 4
483#define oI(x) ((I32 *) ((char *) (x) + 4))
484#define oS(x) ((x) - 4)
485#define oC(x) (x = 0)
486#define CRAY_HACK
487#else
488#define oI(x) (x)
489#define oS(x) (x)
490#define oC(x)
491#endif
492
493/*
7a6a85bf
RG
494 * key buffer handling
495 */
496#define kbuf (cxt->keybuf).arena
497#define ksiz (cxt->keybuf).asiz
111e03c1
RG
498#define KBUFINIT() \
499 STMT_START { \
7a6a85bf
RG
500 if (!kbuf) { \
501 TRACEME(("** allocating kbuf of 128 bytes")); \
502 New(10003, kbuf, 128, char); \
503 ksiz = 128; \
504 } \
111e03c1
RG
505 } STMT_END
506#define KBUFCHK(x) \
507 STMT_START { \
7a6a85bf 508 if (x >= ksiz) { \
e993d95c 509 TRACEME(("** extending kbuf to %d bytes (had %d)", x+1, ksiz)); \
7a6a85bf
RG
510 Renew(kbuf, x+1, char); \
511 ksiz = x+1; \
512 } \
111e03c1 513 } STMT_END
7a6a85bf
RG
514
515/*
516 * memory buffer handling
517 */
518#define mbase (cxt->membuf).arena
519#define msiz (cxt->membuf).asiz
520#define mptr (cxt->membuf).aptr
521#define mend (cxt->membuf).aend
522
523#define MGROW (1 << 13)
524#define MMASK (MGROW - 1)
525
526#define round_mgrow(x) \
527 ((unsigned long) (((unsigned long) (x) + MMASK) & ~MMASK))
528#define trunc_int(x) \
529 ((unsigned long) ((unsigned long) (x) & ~(sizeof(int)-1)))
530#define int_aligned(x) \
531 ((unsigned long) (x) == trunc_int(x))
532
111e03c1
RG
533#define MBUF_INIT(x) \
534 STMT_START { \
7a6a85bf
RG
535 if (!mbase) { \
536 TRACEME(("** allocating mbase of %d bytes", MGROW)); \
537 New(10003, mbase, MGROW, char); \
2cc1b180 538 msiz = (STRLEN)MGROW; \
7a6a85bf
RG
539 } \
540 mptr = mbase; \
541 if (x) \
542 mend = mbase + x; \
543 else \
544 mend = mbase + msiz; \
111e03c1 545 } STMT_END
7a6a85bf
RG
546
547#define MBUF_TRUNC(x) mptr = mbase + x
548#define MBUF_SIZE() (mptr - mbase)
549
550/*
e993d95c
JH
551 * MBUF_SAVE_AND_LOAD
552 * MBUF_RESTORE
553 *
554 * Those macros are used in do_retrieve() to save the current memory
555 * buffer into cxt->msaved, before MBUF_LOAD() can be used to retrieve
556 * data from a string.
557 */
111e03c1
RG
558#define MBUF_SAVE_AND_LOAD(in) \
559 STMT_START { \
e993d95c
JH
560 ASSERT(!cxt->membuf_ro, ("mbase not already saved")); \
561 cxt->membuf_ro = 1; \
562 TRACEME(("saving mbuf")); \
563 StructCopy(&cxt->membuf, &cxt->msaved, struct extendable); \
564 MBUF_LOAD(in); \
111e03c1 565 } STMT_END
e993d95c 566
111e03c1
RG
567#define MBUF_RESTORE() \
568 STMT_START { \
e993d95c
JH
569 ASSERT(cxt->membuf_ro, ("mbase is read-only")); \
570 cxt->membuf_ro = 0; \
571 TRACEME(("restoring mbuf")); \
572 StructCopy(&cxt->msaved, &cxt->membuf, struct extendable); \
111e03c1 573 } STMT_END
e993d95c
JH
574
575/*
7a6a85bf
RG
576 * Use SvPOKp(), because SvPOK() fails on tainted scalars.
577 * See store_scalar() for other usage of this workaround.
578 */
111e03c1
RG
579#define MBUF_LOAD(v) \
580 STMT_START { \
e993d95c 581 ASSERT(cxt->membuf_ro, ("mbase is read-only")); \
7a6a85bf
RG
582 if (!SvPOKp(v)) \
583 CROAK(("Not a scalar string")); \
584 mptr = mbase = SvPV(v, msiz); \
585 mend = mbase + msiz; \
111e03c1 586 } STMT_END
7a6a85bf 587
111e03c1
RG
588#define MBUF_XTEND(x) \
589 STMT_START { \
7a6a85bf
RG
590 int nsz = (int) round_mgrow((x)+msiz); \
591 int offset = mptr - mbase; \
e993d95c
JH
592 ASSERT(!cxt->membuf_ro, ("mbase is not read-only")); \
593 TRACEME(("** extending mbase from %d to %d bytes (wants %d new)", \
594 msiz, nsz, (x))); \
7a6a85bf
RG
595 Renew(mbase, nsz, char); \
596 msiz = nsz; \
597 mptr = mbase + offset; \
598 mend = mbase + nsz; \
111e03c1 599 } STMT_END
7a6a85bf 600
111e03c1
RG
601#define MBUF_CHK(x) \
602 STMT_START { \
7a6a85bf
RG
603 if ((mptr + (x)) > mend) \
604 MBUF_XTEND(x); \
111e03c1 605 } STMT_END
7a6a85bf 606
111e03c1
RG
607#define MBUF_GETC(x) \
608 STMT_START { \
7a6a85bf
RG
609 if (mptr < mend) \
610 x = (int) (unsigned char) *mptr++; \
611 else \
612 return (SV *) 0; \
111e03c1 613 } STMT_END
7a6a85bf 614
9e21b3d0 615#ifdef CRAY_HACK
111e03c1
RG
616#define MBUF_GETINT(x) \
617 STMT_START { \
9e21b3d0
JH
618 oC(x); \
619 if ((mptr + 4) <= mend) { \
620 memcpy(oI(&x), mptr, 4); \
621 mptr += 4; \
622 } else \
623 return (SV *) 0; \
111e03c1 624 } STMT_END
9e21b3d0 625#else
111e03c1
RG
626#define MBUF_GETINT(x) \
627 STMT_START { \
7a6a85bf
RG
628 if ((mptr + sizeof(int)) <= mend) { \
629 if (int_aligned(mptr)) \
630 x = *(int *) mptr; \
631 else \
632 memcpy(&x, mptr, sizeof(int)); \
633 mptr += sizeof(int); \
634 } else \
635 return (SV *) 0; \
111e03c1 636 } STMT_END
9e21b3d0 637#endif
7a6a85bf 638
111e03c1
RG
639#define MBUF_READ(x,s) \
640 STMT_START { \
7a6a85bf
RG
641 if ((mptr + (s)) <= mend) { \
642 memcpy(x, mptr, s); \
643 mptr += s; \
644 } else \
645 return (SV *) 0; \
111e03c1 646 } STMT_END
7a6a85bf 647
111e03c1
RG
648#define MBUF_SAFEREAD(x,s,z) \
649 STMT_START { \
7a6a85bf
RG
650 if ((mptr + (s)) <= mend) { \
651 memcpy(x, mptr, s); \
652 mptr += s; \
653 } else { \
654 sv_free(z); \
655 return (SV *) 0; \
656 } \
111e03c1 657 } STMT_END
7a6a85bf 658
111e03c1
RG
659#define MBUF_PUTC(c) \
660 STMT_START { \
7a6a85bf
RG
661 if (mptr < mend) \
662 *mptr++ = (char) c; \
663 else { \
664 MBUF_XTEND(1); \
665 *mptr++ = (char) c; \
666 } \
111e03c1 667 } STMT_END
7a6a85bf 668
9e21b3d0 669#ifdef CRAY_HACK
111e03c1
RG
670#define MBUF_PUTINT(i) \
671 STMT_START { \
9e21b3d0
JH
672 MBUF_CHK(4); \
673 memcpy(mptr, oI(&i), 4); \
674 mptr += 4; \
111e03c1 675 } STMT_END
9e21b3d0 676#else
111e03c1
RG
677#define MBUF_PUTINT(i) \
678 STMT_START { \
7a6a85bf
RG
679 MBUF_CHK(sizeof(int)); \
680 if (int_aligned(mptr)) \
681 *(int *) mptr = i; \
682 else \
683 memcpy(mptr, &i, sizeof(int)); \
684 mptr += sizeof(int); \
111e03c1 685 } STMT_END
9e21b3d0 686#endif
7a6a85bf 687
111e03c1
RG
688#define MBUF_WRITE(x,s) \
689 STMT_START { \
7a6a85bf
RG
690 MBUF_CHK(s); \
691 memcpy(mptr, x, s); \
692 mptr += s; \
111e03c1 693 } STMT_END
7a6a85bf
RG
694
695/*
7a6a85bf
RG
696 * Possible return values for sv_type().
697 */
698
699#define svis_REF 0
700#define svis_SCALAR 1
701#define svis_ARRAY 2
702#define svis_HASH 3
703#define svis_TIED 4
704#define svis_TIED_ITEM 5
464b080a
SR
705#define svis_CODE 6
706#define svis_OTHER 7
7a6a85bf
RG
707
708/*
709 * Flags for SX_HOOK.
710 */
711
712#define SHF_TYPE_MASK 0x03
713#define SHF_LARGE_CLASSLEN 0x04
714#define SHF_LARGE_STRLEN 0x08
715#define SHF_LARGE_LISTLEN 0x10
716#define SHF_IDX_CLASSNAME 0x20
717#define SHF_NEED_RECURSE 0x40
718#define SHF_HAS_LIST 0x80
719
720/*
b12202d0 721 * Types for SX_HOOK (last 2 bits in flags).
7a6a85bf
RG
722 */
723
724#define SHT_SCALAR 0
725#define SHT_ARRAY 1
726#define SHT_HASH 2
b12202d0
JH
727#define SHT_EXTRA 3 /* Read extra byte for type */
728
729/*
730 * The following are held in the "extra byte"...
731 */
732
733#define SHT_TSCALAR 4 /* 4 + 0 -- tied scalar */
734#define SHT_TARRAY 5 /* 4 + 1 -- tied array */
735#define SHT_THASH 6 /* 4 + 2 -- tied hash */
7a6a85bf
RG
736
737/*
e16e2ff8
NC
738 * per hash flags for flagged hashes
739 */
740
741#define SHV_RESTRICTED 0x01
742
743/*
744 * per key flags for flagged hashes
745 */
746
747#define SHV_K_UTF8 0x01
748#define SHV_K_WASUTF8 0x02
749#define SHV_K_LOCKED 0x04
750#define SHV_K_ISSV 0x08
751#define SHV_K_PLACEHOLDER 0x10
752
753/*
7a6a85bf
RG
754 * Before 0.6, the magic string was "perl-store" (binary version number 0).
755 *
756 * Since 0.6 introduced many binary incompatibilities, the magic string has
757 * been changed to "pst0" to allow an old image to be properly retrieved by
758 * a newer Storable, but ensure a newer image cannot be retrieved with an
759 * older version.
760 *
761 * At 0.7, objects are given the ability to serialize themselves, and the
762 * set of markers is extended, backward compatibility is not jeopardized,
763 * so the binary version number could have remained unchanged. To correctly
764 * spot errors if a file making use of 0.7-specific extensions is given to
765 * 0.6 for retrieval, the binary version was moved to "2". And I'm introducing
766 * a "minor" version, to better track this kind of evolution from now on.
767 *
768 */
2aeb6432
NC
769static const char old_magicstr[] = "perl-store"; /* Magic number before 0.6 */
770static const char magicstr[] = "pst0"; /* Used as a magic number */
7a6a85bf 771
2aeb6432
NC
772#define MAGICSTR_BYTES 'p','s','t','0'
773#define OLDMAGICSTR_BYTES 'p','e','r','l','-','s','t','o','r','e'
774
ee0f7aac
NC
775/* 5.6.x introduced the ability to have IVs as long long.
776 However, Configure still defined BYTEORDER based on the size of a long.
777 Storable uses the BYTEORDER value as part of the header, but doesn't
778 explicity store sizeof(IV) anywhere in the header. Hence on 5.6.x built
779 with IV as long long on a platform that uses Configure (ie most things
780 except VMS and Windows) headers are identical for the different IV sizes,
781 despite the files containing some fields based on sizeof(IV)
782 Erk. Broken-ness.
783 5.8 is consistent - the following redifinition kludge is only needed on
784 5.6.x, but the interwork is needed on 5.8 while data survives in files
785 with the 5.6 header.
786
787*/
788
789#if defined (IVSIZE) && (IVSIZE == 8) && (LONGSIZE == 4)
790#ifndef NO_56_INTERWORK_KLUDGE
791#define USE_56_INTERWORK_KLUDGE
792#endif
793#if BYTEORDER == 0x1234
794#undef BYTEORDER
795#define BYTEORDER 0x12345678
796#else
797#if BYTEORDER == 0x4321
798#undef BYTEORDER
799#define BYTEORDER 0x87654321
800#endif
801#endif
802#endif
803
2aeb6432
NC
804#if BYTEORDER == 0x1234
805#define BYTEORDER_BYTES '1','2','3','4'
806#else
807#if BYTEORDER == 0x12345678
808#define BYTEORDER_BYTES '1','2','3','4','5','6','7','8'
ee0f7aac
NC
809#ifdef USE_56_INTERWORK_KLUDGE
810#define BYTEORDER_BYTES_56 '1','2','3','4'
811#endif
2aeb6432
NC
812#else
813#if BYTEORDER == 0x87654321
814#define BYTEORDER_BYTES '8','7','6','5','4','3','2','1'
ee0f7aac
NC
815#ifdef USE_56_INTERWORK_KLUDGE
816#define BYTEORDER_BYTES_56 '4','3','2','1'
817#endif
2aeb6432
NC
818#else
819#if BYTEORDER == 0x4321
820#define BYTEORDER_BYTES '4','3','2','1'
821#else
c597ea9d 822#error Unknown byteorder. Please append your byteorder to Storable.xs
2aeb6432
NC
823#endif
824#endif
825#endif
826#endif
827
828static const char byteorderstr[] = {BYTEORDER_BYTES, 0};
ee0f7aac
NC
829#ifdef USE_56_INTERWORK_KLUDGE
830static const char byteorderstr_56[] = {BYTEORDER_BYTES_56, 0};
831#endif
530b72ba 832
e16e2ff8 833#define STORABLE_BIN_MAJOR 2 /* Binary major "version" */
c3c53033 834#define STORABLE_BIN_MINOR 7 /* Binary minor "version" */
530b72ba 835
c3c53033 836#if (PATCHLEVEL <= 5)
530b72ba 837#define STORABLE_BIN_WRITE_MINOR 4
e16e2ff8 838#else
c3c53033
NC
839/*
840 * Perl 5.6.0 onwards can do weak references.
e16e2ff8 841*/
c3c53033
NC
842#define STORABLE_BIN_WRITE_MINOR 7
843#endif /* (PATCHLEVEL <= 5) */
7a6a85bf 844
e9822705 845#if (PATCHLEVEL < 8 || (PATCHLEVEL == 8 && SUBVERSION < 1))
fcaa57e7
AMS
846#define PL_sv_placeholder PL_sv_undef
847#endif
848
7a6a85bf
RG
849/*
850 * Useful store shortcuts...
851 */
852
a8b7ef86
AMS
853/*
854 * Note that if you put more than one mark for storing a particular
855 * type of thing, *and* in the retrieve_foo() function you mark both
856 * the thingy's you get off with SEEN(), you *must* increase the
857 * tagnum with cxt->tagnum++ along with this macro!
858 * - samv 20Jan04
859 */
111e03c1
RG
860#define PUTMARK(x) \
861 STMT_START { \
7a6a85bf
RG
862 if (!cxt->fio) \
863 MBUF_PUTC(x); \
864 else if (PerlIO_putc(cxt->fio, x) == EOF) \
865 return -1; \
111e03c1 866 } STMT_END
7a6a85bf 867
111e03c1
RG
868#define WRITE_I32(x) \
869 STMT_START { \
9e21b3d0
JH
870 ASSERT(sizeof(x) == sizeof(I32), ("writing an I32")); \
871 if (!cxt->fio) \
872 MBUF_PUTINT(x); \
873 else if (PerlIO_write(cxt->fio, oI(&x), oS(sizeof(x))) != oS(sizeof(x))) \
874 return -1; \
111e03c1 875 } STMT_END
9e21b3d0 876
7a6a85bf 877#ifdef HAS_HTONL
111e03c1
RG
878#define WLEN(x) \
879 STMT_START { \
7a6a85bf
RG
880 if (cxt->netorder) { \
881 int y = (int) htonl(x); \
882 if (!cxt->fio) \
883 MBUF_PUTINT(y); \
9e21b3d0 884 else if (PerlIO_write(cxt->fio,oI(&y),oS(sizeof(y))) != oS(sizeof(y))) \
7a6a85bf
RG
885 return -1; \
886 } else { \
887 if (!cxt->fio) \
888 MBUF_PUTINT(x); \
9e21b3d0 889 else if (PerlIO_write(cxt->fio,oI(&x),oS(sizeof(x))) != oS(sizeof(x))) \
7a6a85bf
RG
890 return -1; \
891 } \
111e03c1 892 } STMT_END
7a6a85bf 893#else
9e21b3d0 894#define WLEN(x) WRITE_I32(x)
7a6a85bf
RG
895#endif
896
111e03c1
RG
897#define WRITE(x,y) \
898 STMT_START { \
7a6a85bf
RG
899 if (!cxt->fio) \
900 MBUF_WRITE(x,y); \
901 else if (PerlIO_write(cxt->fio, x, y) != y) \
902 return -1; \
111e03c1 903 } STMT_END
7a6a85bf 904
111e03c1
RG
905#define STORE_PV_LEN(pv, len, small, large) \
906 STMT_START { \
7a6a85bf
RG
907 if (len <= LG_SCALAR) { \
908 unsigned char clen = (unsigned char) len; \
dd19458b 909 PUTMARK(small); \
7a6a85bf
RG
910 PUTMARK(clen); \
911 if (len) \
912 WRITE(pv, len); \
913 } else { \
dd19458b 914 PUTMARK(large); \
7a6a85bf
RG
915 WLEN(len); \
916 WRITE(pv, len); \
917 } \
111e03c1 918 } STMT_END
7a6a85bf 919
dd19458b
JH
920#define STORE_SCALAR(pv, len) STORE_PV_LEN(pv, len, SX_SCALAR, SX_LSCALAR)
921
922/*
20bb3f55 923 * Store &PL_sv_undef in arrays without recursing through store().
7a6a85bf 924 */
20bb3f55 925#define STORE_SV_UNDEF() \
111e03c1 926 STMT_START { \
7a6a85bf 927 cxt->tagnum++; \
20bb3f55 928 PUTMARK(SX_SV_UNDEF); \
111e03c1 929 } STMT_END
7a6a85bf
RG
930
931/*
932 * Useful retrieve shortcuts...
933 */
934
935#define GETCHAR() \
936 (cxt->fio ? PerlIO_getc(cxt->fio) : (mptr >= mend ? EOF : (int) *mptr++))
937
111e03c1
RG
938#define GETMARK(x) \
939 STMT_START { \
7a6a85bf
RG
940 if (!cxt->fio) \
941 MBUF_GETC(x); \
76df4757 942 else if ((int) (x = PerlIO_getc(cxt->fio)) == EOF) \
7a6a85bf 943 return (SV *) 0; \
111e03c1 944 } STMT_END
7a6a85bf 945
111e03c1
RG
946#define READ_I32(x) \
947 STMT_START { \
9e21b3d0
JH
948 ASSERT(sizeof(x) == sizeof(I32), ("reading an I32")); \
949 oC(x); \
7a6a85bf
RG
950 if (!cxt->fio) \
951 MBUF_GETINT(x); \
9e21b3d0 952 else if (PerlIO_read(cxt->fio, oI(&x), oS(sizeof(x))) != oS(sizeof(x))) \
7a6a85bf 953 return (SV *) 0; \
111e03c1 954 } STMT_END
9e21b3d0
JH
955
956#ifdef HAS_NTOHL
111e03c1
RG
957#define RLEN(x) \
958 STMT_START { \
9e21b3d0 959 oC(x); \
7a6a85bf
RG
960 if (!cxt->fio) \
961 MBUF_GETINT(x); \
9e21b3d0 962 else if (PerlIO_read(cxt->fio, oI(&x), oS(sizeof(x))) != oS(sizeof(x))) \
7a6a85bf 963 return (SV *) 0; \
9e21b3d0
JH
964 if (cxt->netorder) \
965 x = (int) ntohl(x); \
111e03c1 966 } STMT_END
9e21b3d0
JH
967#else
968#define RLEN(x) READ_I32(x)
7a6a85bf
RG
969#endif
970
111e03c1
RG
971#define READ(x,y) \
972 STMT_START { \
7a6a85bf
RG
973 if (!cxt->fio) \
974 MBUF_READ(x, y); \
975 else if (PerlIO_read(cxt->fio, x, y) != y) \
976 return (SV *) 0; \
111e03c1 977 } STMT_END
7a6a85bf 978
111e03c1
RG
979#define SAFEREAD(x,y,z) \
980 STMT_START { \
7a6a85bf
RG
981 if (!cxt->fio) \
982 MBUF_SAFEREAD(x,y,z); \
983 else if (PerlIO_read(cxt->fio, x, y) != y) { \
984 sv_free(z); \
985 return (SV *) 0; \
986 } \
111e03c1 987 } STMT_END
7a6a85bf
RG
988
989/*
990 * This macro is used at retrieve time, to remember where object 'y', bearing a
991 * given tag 'tagnum', has been retrieved. Next time we see an SX_OBJECT marker,
992 * we'll therefore know where it has been retrieved and will be able to
993 * share the same reference, as in the original stored memory image.
b12202d0
JH
994 *
995 * We also need to bless objects ASAP for hooks (which may compute "ref $x"
996 * on the objects given to STORABLE_thaw and expect that to be defined), and
997 * also for overloaded objects (for which we might not find the stash if the
998 * object is not blessed yet--this might occur for overloaded objects that
999 * refer to themselves indirectly: if we blessed upon return from a sub
1000 * retrieve(), the SX_OBJECT marker we'd found could not have overloading
1001 * restored on it because the underlying object would not be blessed yet!).
1002 *
1003 * To achieve that, the class name of the last retrieved object is passed down
1004 * recursively, and the first SEEN() call for which the class name is not NULL
1005 * will bless the object.
dfd91409
NC
1006 *
1007 * i should be true iff sv is immortal (ie PL_sv_yes, PL_sv_no or PL_sv_undef)
7a6a85bf 1008 */
dfd91409 1009#define SEEN(y,c,i) \
111e03c1 1010 STMT_START { \
7a6a85bf
RG
1011 if (!y) \
1012 return (SV *) 0; \
dfd91409 1013 if (av_store(cxt->aseen, cxt->tagnum++, i ? (SV*)(y) : SvREFCNT_inc(y)) == 0) \
7a6a85bf 1014 return (SV *) 0; \
43d061fe 1015 TRACEME(("aseen(#%d) = 0x%"UVxf" (refcnt=%d)", cxt->tagnum-1, \
b12202d0
JH
1016 PTR2UV(y), SvREFCNT(y)-1)); \
1017 if (c) \
1018 BLESS((SV *) (y), c); \
111e03c1 1019 } STMT_END
7a6a85bf
RG
1020
1021/*
1022 * Bless `s' in `p', via a temporary reference, required by sv_bless().
1023 */
111e03c1
RG
1024#define BLESS(s,p) \
1025 STMT_START { \
7a6a85bf
RG
1026 SV *ref; \
1027 HV *stash; \
43d061fe 1028 TRACEME(("blessing 0x%"UVxf" in %s", PTR2UV(s), (p))); \
7a6a85bf
RG
1029 stash = gv_stashpv((p), TRUE); \
1030 ref = newRV_noinc(s); \
1031 (void) sv_bless(ref, stash); \
b162af07 1032 SvRV_set(ref, NULL); \
7a6a85bf 1033 SvREFCNT_dec(ref); \
111e03c1 1034 } STMT_END
138ec36d
BC
1035/*
1036 * sort (used in store_hash) - conditionally use qsort when
1037 * sortsv is not available ( <= 5.6.1 ).
1038 */
1039
1040#if (PATCHLEVEL <= 6)
1041
1042#if defined(USE_ITHREADS)
1043
1044#define STORE_HASH_SORT \
1045 ENTER; { \
1046 PerlInterpreter *orig_perl = PERL_GET_CONTEXT; \
1047 SAVESPTR(orig_perl); \
1048 PERL_SET_CONTEXT(aTHX); \
1049 qsort((char *) AvARRAY(av), len, sizeof(SV *), sortcmp); \
1050 } LEAVE;
1051
1052#else /* ! USE_ITHREADS */
7a6a85bf 1053
138ec36d
BC
1054#define STORE_HASH_SORT \
1055 qsort((char *) AvARRAY(av), len, sizeof(SV *), sortcmp);
1056
1057#endif /* USE_ITHREADS */
1058
1059#else /* PATCHLEVEL > 6 */
1060
1061#define STORE_HASH_SORT \
1062 sortsv(AvARRAY(av), len, Perl_sv_cmp);
1063
1064#endif /* PATCHLEVEL <= 6 */
1065
1066static int store(pTHX_ stcxt_t *cxt, SV *sv);
aa07b2f6 1067static SV *retrieve(pTHX_ stcxt_t *cxt, const char *cname);
7a6a85bf
RG
1068
1069/*
1070 * Dynamic dispatching table for SV store.
1071 */
1072
138ec36d
BC
1073static int store_ref(pTHX_ stcxt_t *cxt, SV *sv);
1074static int store_scalar(pTHX_ stcxt_t *cxt, SV *sv);
1075static int store_array(pTHX_ stcxt_t *cxt, AV *av);
1076static int store_hash(pTHX_ stcxt_t *cxt, HV *hv);
1077static int store_tied(pTHX_ stcxt_t *cxt, SV *sv);
1078static int store_tied_item(pTHX_ stcxt_t *cxt, SV *sv);
1079static int store_code(pTHX_ stcxt_t *cxt, CV *cv);
1080static int store_other(pTHX_ stcxt_t *cxt, SV *sv);
1081static int store_blessed(pTHX_ stcxt_t *cxt, SV *sv, int type, HV *pkg);
1082
93ad979b
MB
1083typedef int (*sv_store_t)(pTHX_ stcxt_t *cxt, SV *sv);
1084
5c271e25 1085static const sv_store_t sv_store[] = {
93ad979b
MB
1086 (sv_store_t)store_ref, /* svis_REF */
1087 (sv_store_t)store_scalar, /* svis_SCALAR */
1088 (sv_store_t)store_array, /* svis_ARRAY */
1089 (sv_store_t)store_hash, /* svis_HASH */
1090 (sv_store_t)store_tied, /* svis_TIED */
1091 (sv_store_t)store_tied_item, /* svis_TIED_ITEM */
1092 (sv_store_t)store_code, /* svis_CODE */
1093 (sv_store_t)store_other, /* svis_OTHER */
7a6a85bf
RG
1094};
1095
1096#define SV_STORE(x) (*sv_store[x])
1097
1098/*
1099 * Dynamic dispatching tables for SV retrieval.
1100 */
1101
aa07b2f6
SP
1102static SV *retrieve_lscalar(pTHX_ stcxt_t *cxt, const char *cname);
1103static SV *retrieve_lutf8str(pTHX_ stcxt_t *cxt, const char *cname);
1104static SV *old_retrieve_array(pTHX_ stcxt_t *cxt, const char *cname);
1105static SV *old_retrieve_hash(pTHX_ stcxt_t *cxt, const char *cname);
1106static SV *retrieve_ref(pTHX_ stcxt_t *cxt, const char *cname);
1107static SV *retrieve_undef(pTHX_ stcxt_t *cxt, const char *cname);
1108static SV *retrieve_integer(pTHX_ stcxt_t *cxt, const char *cname);
1109static SV *retrieve_double(pTHX_ stcxt_t *cxt, const char *cname);
1110static SV *retrieve_byte(pTHX_ stcxt_t *cxt, const char *cname);
1111static SV *retrieve_netint(pTHX_ stcxt_t *cxt, const char *cname);
1112static SV *retrieve_scalar(pTHX_ stcxt_t *cxt, const char *cname);
1113static SV *retrieve_utf8str(pTHX_ stcxt_t *cxt, const char *cname);
1114static SV *retrieve_tied_array(pTHX_ stcxt_t *cxt, const char *cname);
1115static SV *retrieve_tied_hash(pTHX_ stcxt_t *cxt, const char *cname);
1116static SV *retrieve_tied_scalar(pTHX_ stcxt_t *cxt, const char *cname);
1117static SV *retrieve_other(pTHX_ stcxt_t *cxt, const char *cname);
1118
1119typedef SV* (*sv_retrieve_t)(pTHX_ stcxt_t *cxt, const char *name);
93ad979b
MB
1120
1121static const sv_retrieve_t sv_old_retrieve[] = {
1122 0, /* SX_OBJECT -- entry unused dynamically */
1123 (sv_retrieve_t)retrieve_lscalar, /* SX_LSCALAR */
1124 (sv_retrieve_t)old_retrieve_array, /* SX_ARRAY -- for pre-0.6 binaries */
1125 (sv_retrieve_t)old_retrieve_hash, /* SX_HASH -- for pre-0.6 binaries */
1126 (sv_retrieve_t)retrieve_ref, /* SX_REF */
1127 (sv_retrieve_t)retrieve_undef, /* SX_UNDEF */
1128 (sv_retrieve_t)retrieve_integer, /* SX_INTEGER */
1129 (sv_retrieve_t)retrieve_double, /* SX_DOUBLE */
1130 (sv_retrieve_t)retrieve_byte, /* SX_BYTE */
1131 (sv_retrieve_t)retrieve_netint, /* SX_NETINT */
1132 (sv_retrieve_t)retrieve_scalar, /* SX_SCALAR */
1133 (sv_retrieve_t)retrieve_tied_array, /* SX_ARRAY */
1134 (sv_retrieve_t)retrieve_tied_hash, /* SX_HASH */
1135 (sv_retrieve_t)retrieve_tied_scalar, /* SX_SCALAR */
1136 (sv_retrieve_t)retrieve_other, /* SX_SV_UNDEF not supported */
1137 (sv_retrieve_t)retrieve_other, /* SX_SV_YES not supported */
1138 (sv_retrieve_t)retrieve_other, /* SX_SV_NO not supported */
1139 (sv_retrieve_t)retrieve_other, /* SX_BLESS not supported */
1140 (sv_retrieve_t)retrieve_other, /* SX_IX_BLESS not supported */
1141 (sv_retrieve_t)retrieve_other, /* SX_HOOK not supported */
1142 (sv_retrieve_t)retrieve_other, /* SX_OVERLOADED not supported */
1143 (sv_retrieve_t)retrieve_other, /* SX_TIED_KEY not supported */
1144 (sv_retrieve_t)retrieve_other, /* SX_TIED_IDX not supported */
1145 (sv_retrieve_t)retrieve_other, /* SX_UTF8STR not supported */
1146 (sv_retrieve_t)retrieve_other, /* SX_LUTF8STR not supported */
1147 (sv_retrieve_t)retrieve_other, /* SX_FLAG_HASH not supported */
1148 (sv_retrieve_t)retrieve_other, /* SX_CODE not supported */
1149 (sv_retrieve_t)retrieve_other, /* SX_WEAKREF not supported */
1150 (sv_retrieve_t)retrieve_other, /* SX_WEAKOVERLOAD not supported */
1151 (sv_retrieve_t)retrieve_other, /* SX_ERROR */
7a6a85bf
RG
1152};
1153
aa07b2f6
SP
1154static SV *retrieve_array(pTHX_ stcxt_t *cxt, const char *cname);
1155static SV *retrieve_hash(pTHX_ stcxt_t *cxt, const char *cname);
1156static SV *retrieve_sv_undef(pTHX_ stcxt_t *cxt, const char *cname);
1157static SV *retrieve_sv_yes(pTHX_ stcxt_t *cxt, const char *cname);
1158static SV *retrieve_sv_no(pTHX_ stcxt_t *cxt, const char *cname);
1159static SV *retrieve_blessed(pTHX_ stcxt_t *cxt, const char *cname);
1160static SV *retrieve_idx_blessed(pTHX_ stcxt_t *cxt, const char *cname);
1161static SV *retrieve_hook(pTHX_ stcxt_t *cxt, const char *cname);
1162static SV *retrieve_overloaded(pTHX_ stcxt_t *cxt, const char *cname);
1163static SV *retrieve_tied_key(pTHX_ stcxt_t *cxt, const char *cname);
1164static SV *retrieve_tied_idx(pTHX_ stcxt_t *cxt, const char *cname);
1165static SV *retrieve_flag_hash(pTHX_ stcxt_t *cxt, const char *cname);
1166static SV *retrieve_code(pTHX_ stcxt_t *cxt, const char *cname);
1167static SV *retrieve_weakref(pTHX_ stcxt_t *cxt, const char *cname);
1168static SV *retrieve_weakoverloaded(pTHX_ stcxt_t *cxt, const char *cname);
138ec36d 1169
93ad979b 1170static const sv_retrieve_t sv_retrieve[] = {
7a6a85bf 1171 0, /* SX_OBJECT -- entry unused dynamically */
93ad979b
MB
1172 (sv_retrieve_t)retrieve_lscalar, /* SX_LSCALAR */
1173 (sv_retrieve_t)retrieve_array, /* SX_ARRAY */
1174 (sv_retrieve_t)retrieve_hash, /* SX_HASH */
1175 (sv_retrieve_t)retrieve_ref, /* SX_REF */
1176 (sv_retrieve_t)retrieve_undef, /* SX_UNDEF */
1177 (sv_retrieve_t)retrieve_integer, /* SX_INTEGER */
1178 (sv_retrieve_t)retrieve_double, /* SX_DOUBLE */
1179 (sv_retrieve_t)retrieve_byte, /* SX_BYTE */
1180 (sv_retrieve_t)retrieve_netint, /* SX_NETINT */
1181 (sv_retrieve_t)retrieve_scalar, /* SX_SCALAR */
1182 (sv_retrieve_t)retrieve_tied_array, /* SX_ARRAY */
1183 (sv_retrieve_t)retrieve_tied_hash, /* SX_HASH */
1184 (sv_retrieve_t)retrieve_tied_scalar, /* SX_SCALAR */
1185 (sv_retrieve_t)retrieve_sv_undef, /* SX_SV_UNDEF */
1186 (sv_retrieve_t)retrieve_sv_yes, /* SX_SV_YES */
1187 (sv_retrieve_t)retrieve_sv_no, /* SX_SV_NO */
1188 (sv_retrieve_t)retrieve_blessed, /* SX_BLESS */
1189 (sv_retrieve_t)retrieve_idx_blessed, /* SX_IX_BLESS */
1190 (sv_retrieve_t)retrieve_hook, /* SX_HOOK */
1191 (sv_retrieve_t)retrieve_overloaded, /* SX_OVERLOAD */
1192 (sv_retrieve_t)retrieve_tied_key, /* SX_TIED_KEY */
1193 (sv_retrieve_t)retrieve_tied_idx, /* SX_TIED_IDX */
1194 (sv_retrieve_t)retrieve_utf8str, /* SX_UTF8STR */
1195 (sv_retrieve_t)retrieve_lutf8str, /* SX_LUTF8STR */
1196 (sv_retrieve_t)retrieve_flag_hash, /* SX_HASH */
1197 (sv_retrieve_t)retrieve_code, /* SX_CODE */
1198 (sv_retrieve_t)retrieve_weakref, /* SX_WEAKREF */
1199 (sv_retrieve_t)retrieve_weakoverloaded, /* SX_WEAKOVERLOAD */
1200 (sv_retrieve_t)retrieve_other, /* SX_ERROR */
7a6a85bf
RG
1201};
1202
1203#define RETRIEVE(c,x) (*(c)->retrieve_vtbl[(x) >= SX_ERROR ? SX_ERROR : (x)])
1204
138ec36d 1205static SV *mbuf2sv(pTHX);
7a6a85bf
RG
1206
1207/***
1208 *** Context management.
1209 ***/
1210
1211/*
1212 * init_perinterp
1213 *
1214 * Called once per "thread" (interpreter) to initialize some global context.
1215 */
138ec36d 1216static void init_perinterp(pTHX)
f0ffaed8 1217{
7a6a85bf
RG
1218 INIT_STCXT;
1219
1220 cxt->netorder = 0; /* true if network order used */
1221 cxt->forgive_me = -1; /* whether to be forgiving... */
0b6a08b2 1222 cxt->accept_future_minor = -1; /* would otherwise occur too late */
7a6a85bf
RG
1223}
1224
1225/*
e993d95c
JH
1226 * reset_context
1227 *
1228 * Called at the end of every context cleaning, to perform common reset
1229 * operations.
1230 */
1231static void reset_context(stcxt_t *cxt)
1232{
1233 cxt->entry = 0;
1234 cxt->s_dirty = 0;
1235 cxt->optype &= ~(ST_STORE|ST_RETRIEVE); /* Leave ST_CLONE alone */
1236}
1237
1238/*
7a6a85bf
RG
1239 * init_store_context
1240 *
1241 * Initialize a new store context for real recursion.
1242 */
f0ffaed8 1243static void init_store_context(
138ec36d 1244 pTHX_
f0ffaed8
JH
1245 stcxt_t *cxt,
1246 PerlIO *f,
1247 int optype,
1248 int network_order)
7a6a85bf
RG
1249{
1250 TRACEME(("init_store_context"));
1251
1252 cxt->netorder = network_order;
1253 cxt->forgive_me = -1; /* Fetched from perl if needed */
464b080a
SR
1254 cxt->deparse = -1; /* Idem */
1255 cxt->eval = NULL; /* Idem */
7a6a85bf
RG
1256 cxt->canonical = -1; /* Idem */
1257 cxt->tagnum = -1; /* Reset tag numbers */
1258 cxt->classnum = -1; /* Reset class numbers */
1259 cxt->fio = f; /* Where I/O are performed */
1260 cxt->optype = optype; /* A store, or a deep clone */
1261 cxt->entry = 1; /* No recursion yet */
1262
1263 /*
1264 * The `hseen' table is used to keep track of each SV stored and their
1265 * associated tag numbers is special. It is "abused" because the
1266 * values stored are not real SV, just integers cast to (SV *),
1267 * which explains the freeing below.
1268 *
1269 * It is also one possible bottlneck to achieve good storing speed,
1270 * so the "shared keys" optimization is turned off (unlikely to be
1271 * of any use here), and the hash table is "pre-extended". Together,
1272 * those optimizations increase the throughput by 12%.
1273 */
1274
ab923da1
NC
1275#ifdef USE_PTR_TABLE
1276 cxt->pseen = ptr_table_new();
1277 cxt->hseen = 0;
1278#else
7a6a85bf
RG
1279 cxt->hseen = newHV(); /* Table where seen objects are stored */
1280 HvSHAREKEYS_off(cxt->hseen);
ab923da1 1281#endif
7a6a85bf
RG
1282 /*
1283 * The following does not work well with perl5.004_04, and causes
1284 * a core dump later on, in a completely unrelated spot, which
1285 * makes me think there is a memory corruption going on.
1286 *
1287 * Calling hv_ksplit(hseen, HBUCKETS) instead of manually hacking
1288 * it below does not make any difference. It seems to work fine
1289 * with perl5.004_68 but given the probable nature of the bug,
1290 * that does not prove anything.
1291 *
1292 * It's a shame because increasing the amount of buckets raises
1293 * store() throughput by 5%, but until I figure this out, I can't
1294 * allow for this to go into production.
1295 *
1296 * It is reported fixed in 5.005, hence the #if.
1297 */
f0ffaed8 1298#if PERL_VERSION >= 5
7a6a85bf 1299#define HBUCKETS 4096 /* Buckets for %hseen */
ab923da1 1300#ifndef USE_PTR_TABLE
7a6a85bf
RG
1301 HvMAX(cxt->hseen) = HBUCKETS - 1; /* keys %hseen = $HBUCKETS; */
1302#endif
ab923da1 1303#endif
7a6a85bf
RG
1304
1305 /*
1306 * The `hclass' hash uses the same settings as `hseen' above, but it is
1307 * used to assign sequential tags (numbers) to class names for blessed
1308 * objects.
1309 *
1310 * We turn the shared key optimization on.
1311 */
1312
1313 cxt->hclass = newHV(); /* Where seen classnames are stored */
1314
f0ffaed8 1315#if PERL_VERSION >= 5
7a6a85bf
RG
1316 HvMAX(cxt->hclass) = HBUCKETS - 1; /* keys %hclass = $HBUCKETS; */
1317#endif
1318
1319 /*
1320 * The `hook' hash table is used to keep track of the references on
1321 * the STORABLE_freeze hook routines, when found in some class name.
1322 *
1323 * It is assumed that the inheritance tree will not be changed during
1324 * storing, and that no new method will be dynamically created by the
1325 * hooks.
1326 */
1327
1328 cxt->hook = newHV(); /* Table where hooks are cached */
90826881
JH
1329
1330 /*
1331 * The `hook_seen' array keeps track of all the SVs returned by
1332 * STORABLE_freeze hooks for us to serialize, so that they are not
1333 * reclaimed until the end of the serialization process. Each SV is
1334 * only stored once, the first time it is seen.
1335 */
1336
1337 cxt->hook_seen = newAV(); /* Lists SVs returned by STORABLE_freeze */
7a6a85bf
RG
1338}
1339
1340/*
1341 * clean_store_context
1342 *
1343 * Clean store context by
1344 */
138ec36d 1345static void clean_store_context(pTHX_ stcxt_t *cxt)
7a6a85bf
RG
1346{
1347 HE *he;
1348
1349 TRACEME(("clean_store_context"));
1350
1351 ASSERT(cxt->optype & ST_STORE, ("was performing a store()"));
1352
1353 /*
1354 * Insert real values into hashes where we stored faked pointers.
1355 */
1356
ab923da1 1357#ifndef USE_PTR_TABLE
e993d95c
JH
1358 if (cxt->hseen) {
1359 hv_iterinit(cxt->hseen);
1360 while ((he = hv_iternext(cxt->hseen))) /* Extra () for -Wall, grr.. */
da5add9b 1361 HeVAL(he) = &PL_sv_undef;
e993d95c 1362 }
ab923da1 1363#endif
7a6a85bf 1364
e993d95c
JH
1365 if (cxt->hclass) {
1366 hv_iterinit(cxt->hclass);
1367 while ((he = hv_iternext(cxt->hclass))) /* Extra () for -Wall, grr.. */
da5add9b 1368 HeVAL(he) = &PL_sv_undef;
e993d95c 1369 }
7a6a85bf
RG
1370
1371 /*
1372 * And now dispose of them...
862382c7
JH
1373 *
1374 * The surrounding if() protection has been added because there might be
1375 * some cases where this routine is called more than once, during
1376 * exceptionnal events. This was reported by Marc Lehmann when Storable
1377 * is executed from mod_perl, and the fix was suggested by him.
1378 * -- RAM, 20/12/2000
1379 */
1380
ab923da1
NC
1381#ifdef USE_PTR_TABLE
1382 if (cxt->pseen) {
1383 struct ptr_tbl *pseen = cxt->pseen;
1384 cxt->pseen = 0;
1385 ptr_table_free(pseen);
1386 }
1387 assert(!cxt->hseen);
1388#else
862382c7
JH
1389 if (cxt->hseen) {
1390 HV *hseen = cxt->hseen;
1391 cxt->hseen = 0;
1392 hv_undef(hseen);
1393 sv_free((SV *) hseen);
1394 }
ab923da1 1395#endif
7a6a85bf 1396
862382c7
JH
1397 if (cxt->hclass) {
1398 HV *hclass = cxt->hclass;
1399 cxt->hclass = 0;
1400 hv_undef(hclass);
1401 sv_free((SV *) hclass);
1402 }
7a6a85bf 1403
862382c7
JH
1404 if (cxt->hook) {
1405 HV *hook = cxt->hook;
1406 cxt->hook = 0;
1407 hv_undef(hook);
1408 sv_free((SV *) hook);
1409 }
7a6a85bf 1410
862382c7
JH
1411 if (cxt->hook_seen) {
1412 AV *hook_seen = cxt->hook_seen;
1413 cxt->hook_seen = 0;
1414 av_undef(hook_seen);
1415 sv_free((SV *) hook_seen);
1416 }
90826881 1417
e8189732 1418 cxt->forgive_me = -1; /* Fetched from perl if needed */
464b080a
SR
1419 cxt->deparse = -1; /* Idem */
1420 if (cxt->eval) {
1421 SvREFCNT_dec(cxt->eval);
1422 }
1423 cxt->eval = NULL; /* Idem */
e8189732
NC
1424 cxt->canonical = -1; /* Idem */
1425
e993d95c 1426 reset_context(cxt);
7a6a85bf
RG
1427}
1428
1429/*
1430 * init_retrieve_context
1431 *
1432 * Initialize a new retrieve context for real recursion.
1433 */
138ec36d 1434static void init_retrieve_context(pTHX_ stcxt_t *cxt, int optype, int is_tainted)
7a6a85bf
RG
1435{
1436 TRACEME(("init_retrieve_context"));
1437
1438 /*
1439 * The hook hash table is used to keep track of the references on
1440 * the STORABLE_thaw hook routines, when found in some class name.
1441 *
1442 * It is assumed that the inheritance tree will not be changed during
1443 * storing, and that no new method will be dynamically created by the
1444 * hooks.
1445 */
1446
1447 cxt->hook = newHV(); /* Caches STORABLE_thaw */
1448
ab923da1
NC
1449#ifdef USE_PTR_TABLE
1450 cxt->pseen = 0;
1451#endif
1452
7a6a85bf
RG
1453 /*
1454 * If retrieving an old binary version, the cxt->retrieve_vtbl variable
1455 * was set to sv_old_retrieve. We'll need a hash table to keep track of
1456 * the correspondance between the tags and the tag number used by the
1457 * new retrieve routines.
1458 */
1459
2cc1b180
JH
1460 cxt->hseen = (((void*)cxt->retrieve_vtbl == (void*)sv_old_retrieve)
1461 ? newHV() : 0);
7a6a85bf
RG
1462
1463 cxt->aseen = newAV(); /* Where retrieved objects are kept */
dfd91409 1464 cxt->where_is_undef = -1; /* Special case for PL_sv_undef */
7a6a85bf
RG
1465 cxt->aclass = newAV(); /* Where seen classnames are kept */
1466 cxt->tagnum = 0; /* Have to count objects... */
1467 cxt->classnum = 0; /* ...and class names as well */
1468 cxt->optype = optype;
dd19458b 1469 cxt->s_tainted = is_tainted;
7a6a85bf 1470 cxt->entry = 1; /* No recursion yet */
530b72ba
NC
1471#ifndef HAS_RESTRICTED_HASHES
1472 cxt->derestrict = -1; /* Fetched from perl if needed */
1473#endif
1474#ifndef HAS_UTF8_ALL
1475 cxt->use_bytes = -1; /* Fetched from perl if needed */
1476#endif
e8189732 1477 cxt->accept_future_minor = -1; /* Fetched from perl if needed */
7a6a85bf
RG
1478}
1479
1480/*
1481 * clean_retrieve_context
1482 *
1483 * Clean retrieve context by
1484 */
138ec36d 1485static void clean_retrieve_context(pTHX_ stcxt_t *cxt)
7a6a85bf
RG
1486{
1487 TRACEME(("clean_retrieve_context"));
1488
1489 ASSERT(cxt->optype & ST_RETRIEVE, ("was performing a retrieve()"));
1490
862382c7
JH
1491 if (cxt->aseen) {
1492 AV *aseen = cxt->aseen;
1493 cxt->aseen = 0;
1494 av_undef(aseen);
1495 sv_free((SV *) aseen);
1496 }
dfd91409 1497 cxt->where_is_undef = -1;
7a6a85bf 1498
862382c7
JH
1499 if (cxt->aclass) {
1500 AV *aclass = cxt->aclass;
1501 cxt->aclass = 0;
1502 av_undef(aclass);
1503 sv_free((SV *) aclass);
1504 }
7a6a85bf 1505
862382c7
JH
1506 if (cxt->hook) {
1507 HV *hook = cxt->hook;
1508 cxt->hook = 0;
1509 hv_undef(hook);
1510 sv_free((SV *) hook);
1511 }
7a6a85bf 1512
862382c7
JH
1513 if (cxt->hseen) {
1514 HV *hseen = cxt->hseen;
1515 cxt->hseen = 0;
1516 hv_undef(hseen);
1517 sv_free((SV *) hseen); /* optional HV, for backward compat. */
1518 }
7a6a85bf 1519
e8189732
NC
1520#ifndef HAS_RESTRICTED_HASHES
1521 cxt->derestrict = -1; /* Fetched from perl if needed */
1522#endif
1523#ifndef HAS_UTF8_ALL
1524 cxt->use_bytes = -1; /* Fetched from perl if needed */
1525#endif
1526 cxt->accept_future_minor = -1; /* Fetched from perl if needed */
1527
e993d95c 1528 reset_context(cxt);
7a6a85bf
RG
1529}
1530
1531/*
1532 * clean_context
1533 *
1534 * A workaround for the CROAK bug: cleanup the last context.
1535 */
138ec36d 1536static void clean_context(pTHX_ stcxt_t *cxt)
7a6a85bf
RG
1537{
1538 TRACEME(("clean_context"));
1539
dd19458b 1540 ASSERT(cxt->s_dirty, ("dirty context"));
7a6a85bf 1541
e993d95c
JH
1542 if (cxt->membuf_ro)
1543 MBUF_RESTORE();
1544
1545 ASSERT(!cxt->membuf_ro, ("mbase is not read-only"));
1546
7a6a85bf 1547 if (cxt->optype & ST_RETRIEVE)
138ec36d 1548 clean_retrieve_context(aTHX_ cxt);
e993d95c 1549 else if (cxt->optype & ST_STORE)
138ec36d 1550 clean_store_context(aTHX_ cxt);
e993d95c
JH
1551 else
1552 reset_context(cxt);
862382c7
JH
1553
1554 ASSERT(!cxt->s_dirty, ("context is clean"));
e993d95c 1555 ASSERT(cxt->entry == 0, ("context is reset"));
7a6a85bf
RG
1556}
1557
1558/*
1559 * allocate_context
1560 *
1561 * Allocate a new context and push it on top of the parent one.
1562 * This new context is made globally visible via SET_STCXT().
1563 */
138ec36d 1564static stcxt_t *allocate_context(pTHX_ stcxt_t *parent_cxt)
7a6a85bf
RG
1565{
1566 stcxt_t *cxt;
1567
1568 TRACEME(("allocate_context"));
1569
dd19458b 1570 ASSERT(!parent_cxt->s_dirty, ("parent context clean"));
7a6a85bf 1571
111e03c1
RG
1572 NEW_STORABLE_CXT_OBJ(cxt);
1573 cxt->prev = parent_cxt->my_sv;
7a6a85bf
RG
1574 SET_STCXT(cxt);
1575
e993d95c
JH
1576 ASSERT(!cxt->s_dirty, ("clean context"));
1577
7a6a85bf
RG
1578 return cxt;
1579}
1580
1581/*
1582 * free_context
1583 *
1584 * Free current context, which cannot be the "root" one.
1585 * Make the context underneath globally visible via SET_STCXT().
1586 */
138ec36d 1587static void free_context(pTHX_ stcxt_t *cxt)
7a6a85bf 1588{
111e03c1 1589 stcxt_t *prev = (stcxt_t *)(cxt->prev ? SvPVX(SvRV(cxt->prev)) : 0);
7a6a85bf
RG
1590
1591 TRACEME(("free_context"));
1592
dd19458b 1593 ASSERT(!cxt->s_dirty, ("clean context"));
7a6a85bf
RG
1594 ASSERT(prev, ("not freeing root context"));
1595
111e03c1 1596 SvREFCNT_dec(cxt->my_sv);
7a6a85bf 1597 SET_STCXT(prev);
e993d95c
JH
1598
1599 ASSERT(cxt, ("context not void"));
7a6a85bf
RG
1600}
1601
1602/***
1603 *** Predicates.
1604 ***/
1605
1606/*
1607 * is_storing
1608 *
1609 * Tells whether we're in the middle of a store operation.
1610 */
c3551ae4 1611static int is_storing(pTHX)
7a6a85bf
RG
1612{
1613 dSTCXT;
1614
1615 return cxt->entry && (cxt->optype & ST_STORE);
1616}
1617
1618/*
1619 * is_retrieving
1620 *
1621 * Tells whether we're in the middle of a retrieve operation.
1622 */
c3551ae4 1623static int is_retrieving(pTHX)
7a6a85bf
RG
1624{
1625 dSTCXT;
1626
1627 return cxt->entry && (cxt->optype & ST_RETRIEVE);
1628}
1629
1630/*
1631 * last_op_in_netorder
1632 *
1633 * Returns whether last operation was made using network order.
1634 *
1635 * This is typically out-of-band information that might prove useful
1636 * to people wishing to convert native to network order data when used.
1637 */
c3551ae4 1638static int last_op_in_netorder(pTHX)
7a6a85bf
RG
1639{
1640 dSTCXT;
1641
1642 return cxt->netorder;
1643}
1644
1645/***
1646 *** Hook lookup and calling routines.
1647 ***/
1648
1649/*
1650 * pkg_fetchmeth
1651 *
1652 * A wrapper on gv_fetchmethod_autoload() which caches results.
1653 *
1654 * Returns the routine reference as an SV*, or null if neither the package
1655 * nor its ancestors know about the method.
1656 */
f0ffaed8 1657static SV *pkg_fetchmeth(
138ec36d 1658 pTHX_
f0ffaed8
JH
1659 HV *cache,
1660 HV *pkg,
1661 char *method)
7a6a85bf
RG
1662{
1663 GV *gv;
1664 SV *sv;
bfcb3514
NC
1665 const char *hvname = HvNAME_get(pkg);
1666
7a6a85bf
RG
1667
1668 /*
1669 * The following code is the same as the one performed by UNIVERSAL::can
1670 * in the Perl core.
1671 */
1672
1673 gv = gv_fetchmethod_autoload(pkg, method, FALSE);
1674 if (gv && isGV(gv)) {
1675 sv = newRV((SV*) GvCV(gv));
bfcb3514 1676 TRACEME(("%s->%s: 0x%"UVxf, hvname, method, PTR2UV(sv)));
7a6a85bf
RG
1677 } else {
1678 sv = newSVsv(&PL_sv_undef);
bfcb3514 1679 TRACEME(("%s->%s: not found", hvname, method));
7a6a85bf
RG
1680 }
1681
1682 /*
1683 * Cache the result, ignoring failure: if we can't store the value,
1684 * it just won't be cached.
1685 */
1686
bfcb3514 1687 (void) hv_store(cache, hvname, strlen(hvname), sv, 0);
7a6a85bf
RG
1688
1689 return SvOK(sv) ? sv : (SV *) 0;
1690}
1691
1692/*
1693 * pkg_hide
1694 *
1695 * Force cached value to be undef: hook ignored even if present.
1696 */
f0ffaed8 1697static void pkg_hide(
138ec36d 1698 pTHX_
f0ffaed8
JH
1699 HV *cache,
1700 HV *pkg,
1701 char *method)
7a6a85bf 1702{
bfcb3514 1703 const char *hvname = HvNAME_get(pkg);
7a6a85bf 1704 (void) hv_store(cache,
bfcb3514 1705 hvname, strlen(hvname), newSVsv(&PL_sv_undef), 0);
7a6a85bf
RG
1706}
1707
1708/*
212e9bde
JH
1709 * pkg_uncache
1710 *
1711 * Discard cached value: a whole fetch loop will be retried at next lookup.
1712 */
1713static void pkg_uncache(
138ec36d 1714 pTHX_
212e9bde
JH
1715 HV *cache,
1716 HV *pkg,
1717 char *method)
1718{
bfcb3514
NC
1719 const char *hvname = HvNAME_get(pkg);
1720 (void) hv_delete(cache, hvname, strlen(hvname), G_DISCARD);
212e9bde
JH
1721}
1722
1723/*
7a6a85bf
RG
1724 * pkg_can
1725 *
1726 * Our own "UNIVERSAL::can", which caches results.
1727 *
1728 * Returns the routine reference as an SV*, or null if the object does not
1729 * know about the method.
1730 */
f0ffaed8 1731static SV *pkg_can(
138ec36d 1732 pTHX_
f0ffaed8
JH
1733 HV *cache,
1734 HV *pkg,
1735 char *method)
7a6a85bf
RG
1736{
1737 SV **svh;
1738 SV *sv;
bfcb3514 1739 const char *hvname = HvNAME_get(pkg);
7a6a85bf 1740
bfcb3514 1741 TRACEME(("pkg_can for %s->%s", hvname, method));
7a6a85bf
RG
1742
1743 /*
1744 * Look into the cache to see whether we already have determined
1745 * where the routine was, if any.
1746 *
1747 * NOTA BENE: we don't use `method' at all in our lookup, since we know
1748 * that only one hook (i.e. always the same) is cached in a given cache.
1749 */
1750
bfcb3514 1751 svh = hv_fetch(cache, hvname, strlen(hvname), FALSE);
7a6a85bf
RG
1752 if (svh) {
1753 sv = *svh;
1754 if (!SvOK(sv)) {
bfcb3514 1755 TRACEME(("cached %s->%s: not found", hvname, method));
7a6a85bf
RG
1756 return (SV *) 0;
1757 } else {
43d061fe 1758 TRACEME(("cached %s->%s: 0x%"UVxf,
bfcb3514 1759 hvname, method, PTR2UV(sv)));
7a6a85bf
RG
1760 return sv;
1761 }
1762 }
1763
1764 TRACEME(("not cached yet"));
138ec36d 1765 return pkg_fetchmeth(aTHX_ cache, pkg, method); /* Fetch and cache */
7a6a85bf
RG
1766}
1767
1768/*
1769 * scalar_call
1770 *
1771 * Call routine as obj->hook(av) in scalar context.
1772 * Propagates the single returned value if not called in void context.
1773 */
f0ffaed8 1774static SV *scalar_call(
138ec36d 1775 pTHX_
f0ffaed8
JH
1776 SV *obj,
1777 SV *hook,
1778 int cloning,
1779 AV *av,
1780 I32 flags)
7a6a85bf
RG
1781{
1782 dSP;
1783 int count;
1784 SV *sv = 0;
1785
1786 TRACEME(("scalar_call (cloning=%d)", cloning));
1787
1788 ENTER;
1789 SAVETMPS;
1790
1791 PUSHMARK(sp);
1792 XPUSHs(obj);
1793 XPUSHs(sv_2mortal(newSViv(cloning))); /* Cloning flag */
1794 if (av) {
1795 SV **ary = AvARRAY(av);
1796 int cnt = AvFILLp(av) + 1;
1797 int i;
1798 XPUSHs(ary[0]); /* Frozen string */
1799 for (i = 1; i < cnt; i++) {
43d061fe
JH
1800 TRACEME(("pushing arg #%d (0x%"UVxf")...",
1801 i, PTR2UV(ary[i])));
7a6a85bf
RG
1802 XPUSHs(sv_2mortal(newRV(ary[i])));
1803 }
1804 }
1805 PUTBACK;
1806
1807 TRACEME(("calling..."));
1808 count = perl_call_sv(hook, flags); /* Go back to Perl code */
1809 TRACEME(("count = %d", count));
1810
1811 SPAGAIN;
1812
1813 if (count) {
1814 sv = POPs;
1815 SvREFCNT_inc(sv); /* We're returning it, must stay alive! */
1816 }
1817
1818 PUTBACK;
1819 FREETMPS;
1820 LEAVE;
1821
1822 return sv;
1823}
1824
1825/*
1826 * array_call
1827 *
f9a1036d 1828 * Call routine obj->hook(cloning) in list context.
7a6a85bf
RG
1829 * Returns the list of returned values in an array.
1830 */
f0ffaed8 1831static AV *array_call(
138ec36d 1832 pTHX_
f0ffaed8
JH
1833 SV *obj,
1834 SV *hook,
1835 int cloning)
7a6a85bf
RG
1836{
1837 dSP;
1838 int count;
1839 AV *av;
1840 int i;
1841
f0ffaed8 1842 TRACEME(("array_call (cloning=%d)", cloning));
7a6a85bf
RG
1843
1844 ENTER;
1845 SAVETMPS;
1846
1847 PUSHMARK(sp);
1848 XPUSHs(obj); /* Target object */
1849 XPUSHs(sv_2mortal(newSViv(cloning))); /* Cloning flag */
1850 PUTBACK;
1851
1852 count = perl_call_sv(hook, G_ARRAY); /* Go back to Perl code */
1853
1854 SPAGAIN;
1855
1856 av = newAV();
1857 for (i = count - 1; i >= 0; i--) {
1858 SV *sv = POPs;
1859 av_store(av, i, SvREFCNT_inc(sv));
1860 }
1861
1862 PUTBACK;
1863 FREETMPS;
1864 LEAVE;
1865
1866 return av;
1867}
1868
1869/*
1870 * known_class
1871 *
1872 * Lookup the class name in the `hclass' table and either assign it a new ID
1873 * or return the existing one, by filling in `classnum'.
1874 *
1875 * Return true if the class was known, false if the ID was just generated.
1876 */
f0ffaed8 1877static int known_class(
138ec36d 1878 pTHX_
f0ffaed8
JH
1879 stcxt_t *cxt,
1880 char *name, /* Class name */
1881 int len, /* Name length */
1882 I32 *classnum)
7a6a85bf
RG
1883{
1884 SV **svh;
1885 HV *hclass = cxt->hclass;
1886
1887 TRACEME(("known_class (%s)", name));
1888
1889 /*
1890 * Recall that we don't store pointers in this hash table, but tags.
1891 * Therefore, we need LOW_32BITS() to extract the relevant parts.
1892 */
1893
1894 svh = hv_fetch(hclass, name, len, FALSE);
1895 if (svh) {
1896 *classnum = LOW_32BITS(*svh);
1897 return TRUE;
1898 }
1899
1900 /*
1901 * Unknown classname, we need to record it.
7a6a85bf
RG
1902 */
1903
1904 cxt->classnum++;
3341c981 1905 if (!hv_store(hclass, name, len, INT2PTR(SV*, cxt->classnum), 0))
7a6a85bf
RG
1906 CROAK(("Unable to record new classname"));
1907
1908 *classnum = cxt->classnum;
1909 return FALSE;
1910}
1911
1912/***
1913 *** Sepcific store routines.
1914 ***/
1915
1916/*
1917 * store_ref
1918 *
1919 * Store a reference.
1920 * Layout is SX_REF <object> or SX_OVERLOAD <object>.
1921 */
138ec36d 1922static int store_ref(pTHX_ stcxt_t *cxt, SV *sv)
7a6a85bf 1923{
c3c53033 1924 int is_weak = 0;
43d061fe 1925 TRACEME(("store_ref (0x%"UVxf")", PTR2UV(sv)));
7a6a85bf
RG
1926
1927 /*
1928 * Follow reference, and check if target is overloaded.
1929 */
1930
96466a21 1931#ifdef SvWEAKREF
c3c53033
NC
1932 if (SvWEAKREF(sv))
1933 is_weak = 1;
1934 TRACEME(("ref (0x%"UVxf") is%s weak", PTR2UV(sv), is_weak ? "" : "n't"));
1935#endif
7a6a85bf
RG
1936 sv = SvRV(sv);
1937
1938 if (SvOBJECT(sv)) {
1939 HV *stash = (HV *) SvSTASH(sv);
1940 if (stash && Gv_AMG(stash)) {
9e21b3d0 1941 TRACEME(("ref (0x%"UVxf") is overloaded", PTR2UV(sv)));
c3c53033 1942 PUTMARK(is_weak ? SX_WEAKOVERLOAD : SX_OVERLOAD);
7a6a85bf 1943 } else
c3c53033 1944 PUTMARK(is_weak ? SX_WEAKREF : SX_REF);
7a6a85bf 1945 } else
c3c53033 1946 PUTMARK(is_weak ? SX_WEAKREF : SX_REF);
7a6a85bf 1947
138ec36d 1948 return store(aTHX_ cxt, sv);
7a6a85bf
RG
1949}
1950
1951/*
1952 * store_scalar
1953 *
1954 * Store a scalar.
1955 *
e16e2ff8 1956 * Layout is SX_LSCALAR <length> <data>, SX_SCALAR <length> <data> or SX_UNDEF.
7a6a85bf
RG
1957 * The <data> section is omitted if <length> is 0.
1958 *
1959 * If integer or double, the layout is SX_INTEGER <data> or SX_DOUBLE <data>.
1960 * Small integers (within [-127, +127]) are stored as SX_BYTE <byte>.
1961 */
138ec36d 1962static int store_scalar(pTHX_ stcxt_t *cxt, SV *sv)
7a6a85bf
RG
1963{
1964 IV iv;
1965 char *pv;
1966 STRLEN len;
1967 U32 flags = SvFLAGS(sv); /* "cc -O" may put it in register */
1968
43d061fe 1969 TRACEME(("store_scalar (0x%"UVxf")", PTR2UV(sv)));
7a6a85bf
RG
1970
1971 /*
1972 * For efficiency, break the SV encapsulation by peaking at the flags
1973 * directly without using the Perl macros to avoid dereferencing
1974 * sv->sv_flags each time we wish to check the flags.
1975 */
1976
1977 if (!(flags & SVf_OK)) { /* !SvOK(sv) */
1978 if (sv == &PL_sv_undef) {
1979 TRACEME(("immortal undef"));
1980 PUTMARK(SX_SV_UNDEF);
1981 } else {
86bbd6dc 1982 TRACEME(("undef at 0x%"UVxf, PTR2UV(sv)));
7a6a85bf
RG
1983 PUTMARK(SX_UNDEF);
1984 }
1985 return 0;
1986 }
1987
1988 /*
1989 * Always store the string representation of a scalar if it exists.
1990 * Gisle Aas provided me with this test case, better than a long speach:
1991 *
1992 * perl -MDevel::Peek -le '$a="abc"; $a+0; Dump($a)'
1993 * SV = PVNV(0x80c8520)
1994 * REFCNT = 1
1995 * FLAGS = (NOK,POK,pNOK,pPOK)
1996 * IV = 0
1997 * NV = 0
1998 * PV = 0x80c83d0 "abc"\0
1999 * CUR = 3
2000 * LEN = 4
2001 *
2002 * Write SX_SCALAR, length, followed by the actual data.
2003 *
2004 * Otherwise, write an SX_BYTE, SX_INTEGER or an SX_DOUBLE as
2005 * appropriate, followed by the actual (binary) data. A double
2006 * is written as a string if network order, for portability.
2007 *
2008 * NOTE: instead of using SvNOK(sv), we test for SvNOKp(sv).
2009 * The reason is that when the scalar value is tainted, the SvNOK(sv)
2010 * value is false.
2011 *
2012 * The test for a read-only scalar with both POK and NOK set is meant
2013 * to quickly detect &PL_sv_yes and &PL_sv_no without having to pay the
2014 * address comparison for each scalar we store.
2015 */
2016
2017#define SV_MAYBE_IMMORTAL (SVf_READONLY|SVf_POK|SVf_NOK)
2018
2019 if ((flags & SV_MAYBE_IMMORTAL) == SV_MAYBE_IMMORTAL) {
2020 if (sv == &PL_sv_yes) {
2021 TRACEME(("immortal yes"));
2022 PUTMARK(SX_SV_YES);
2023 } else if (sv == &PL_sv_no) {
2024 TRACEME(("immortal no"));
2025 PUTMARK(SX_SV_NO);
2026 } else {
2027 pv = SvPV(sv, len); /* We know it's SvPOK */
2028 goto string; /* Share code below */
2029 }
db670f21
NC
2030 } else if (flags & SVf_POK) {
2031 /* public string - go direct to string read. */
2032 goto string_readlen;
2033 } else if (
2034#if (PATCHLEVEL <= 6)
2035 /* For 5.6 and earlier NV flag trumps IV flag, so only use integer
2036 direct if NV flag is off. */
2037 (flags & (SVf_NOK | SVf_IOK)) == SVf_IOK
2038#else
2039 /* 5.7 rules are that if IV public flag is set, IV value is as
2040 good, if not better, than NV value. */
2041 flags & SVf_IOK
2042#endif
2043 ) {
2044 iv = SvIV(sv);
2045 /*
2046 * Will come here from below with iv set if double is an integer.
2047 */
2048 integer:
7a6a85bf 2049
db670f21
NC
2050 /* Sorry. This isn't in 5.005_56 (IIRC) or earlier. */
2051#ifdef SVf_IVisUV
2052 /* Need to do this out here, else 0xFFFFFFFF becomes iv of -1
2053 * (for example) and that ends up in the optimised small integer
2054 * case.
2055 */
2056 if ((flags & SVf_IVisUV) && SvUV(sv) > IV_MAX) {
2057 TRACEME(("large unsigned integer as string, value = %"UVuf, SvUV(sv)));
2058 goto string_readlen;
2059 }
2060#endif
2061 /*
2062 * Optimize small integers into a single byte, otherwise store as
2063 * a real integer (converted into network order if they asked).
2064 */
7a6a85bf 2065
db670f21
NC
2066 if (iv >= -128 && iv <= 127) {
2067 unsigned char siv = (unsigned char) (iv + 128); /* [0,255] */
2068 PUTMARK(SX_BYTE);
2069 PUTMARK(siv);
2070 TRACEME(("small integer stored as %d", siv));
2071 } else if (cxt->netorder) {
2072#ifndef HAS_HTONL
2073 TRACEME(("no htonl, fall back to string for integer"));
2074 goto string_readlen;
2075#else
2076 I32 niv;
7a6a85bf 2077
7a6a85bf 2078
db670f21
NC
2079#if IVSIZE > 4
2080 if (
2081#ifdef SVf_IVisUV
2082 /* Sorry. This isn't in 5.005_56 (IIRC) or earlier. */
2083 ((flags & SVf_IVisUV) && SvUV(sv) > 0x7FFFFFFF) ||
2084#endif
2085 (iv > 0x7FFFFFFF) || (iv < -0x80000000)) {
2086 /* Bigger than 32 bits. */
2087 TRACEME(("large network order integer as string, value = %"IVdf, iv));
2088 goto string_readlen;
2089 }
2090#endif
7a6a85bf 2091
db670f21
NC
2092 niv = (I32) htonl((I32) iv);
2093 TRACEME(("using network order"));
2094 PUTMARK(SX_NETINT);
2095 WRITE_I32(niv);
2096#endif
2097 } else {
2098 PUTMARK(SX_INTEGER);
2099 WRITE(&iv, sizeof(iv));
2100 }
2101
2102 TRACEME(("ok (integer 0x%"UVxf", value = %"IVdf")", PTR2UV(sv), iv));
2103 } else if (flags & SVf_NOK) {
2104 NV nv;
2105#if (PATCHLEVEL <= 6)
2106 nv = SvNV(sv);
2107 /*
2108 * Watch for number being an integer in disguise.
2109 */
2110 if (nv == (NV) (iv = I_V(nv))) {
2111 TRACEME(("double %"NVff" is actually integer %"IVdf, nv, iv));
2112 goto integer; /* Share code above */
2113 }
2114#else
7a6a85bf 2115
db670f21 2116 SvIV_please(sv);
3ddd445a 2117 if (SvIOK_notUV(sv)) {
db670f21
NC
2118 iv = SvIV(sv);
2119 goto integer; /* Share code above */
2120 }
2121 nv = SvNV(sv);
2122#endif
7a6a85bf 2123
db670f21
NC
2124 if (cxt->netorder) {
2125 TRACEME(("double %"NVff" stored as string", nv));
2126 goto string_readlen; /* Share code below */
2127 }
7a6a85bf 2128
db670f21
NC
2129 PUTMARK(SX_DOUBLE);
2130 WRITE(&nv, sizeof(nv));
7a6a85bf 2131
db670f21 2132 TRACEME(("ok (double 0x%"UVxf", value = %"NVff")", PTR2UV(sv), nv));
7a6a85bf 2133
db670f21
NC
2134 } else if (flags & (SVp_POK | SVp_NOK | SVp_IOK)) {
2135 I32 wlen; /* For 64-bit machines */
7a6a85bf 2136
db670f21
NC
2137 string_readlen:
2138 pv = SvPV(sv, len);
7a6a85bf 2139
db670f21
NC
2140 /*
2141 * Will come here from above if it was readonly, POK and NOK but
2142 * neither &PL_sv_yes nor &PL_sv_no.
2143 */
2144 string:
2145
2146 wlen = (I32) len; /* WLEN via STORE_SCALAR expects I32 */
2147 if (SvUTF8 (sv))
2148 STORE_UTF8STR(pv, wlen);
2149 else
2150 STORE_SCALAR(pv, wlen);
2151 TRACEME(("ok (scalar 0x%"UVxf" '%s', length = %"IVdf")",
2152 PTR2UV(sv), SvPVX(sv), (IV)len));
7a6a85bf 2153 } else
db670f21
NC
2154 CROAK(("Can't determine type of %s(0x%"UVxf")",
2155 sv_reftype(sv, FALSE),
2156 PTR2UV(sv)));
2157 return 0; /* Ok, no recursion on scalars */
7a6a85bf
RG
2158}
2159
2160/*
2161 * store_array
2162 *
2163 * Store an array.
2164 *
2165 * Layout is SX_ARRAY <size> followed by each item, in increading index order.
2166 * Each item is stored as <object>.
2167 */
138ec36d 2168static int store_array(pTHX_ stcxt_t *cxt, AV *av)
7a6a85bf
RG
2169{
2170 SV **sav;
2171 I32 len = av_len(av) + 1;
2172 I32 i;
2173 int ret;
2174
43d061fe 2175 TRACEME(("store_array (0x%"UVxf")", PTR2UV(av)));
7a6a85bf
RG
2176
2177 /*
2178 * Signal array by emitting SX_ARRAY, followed by the array length.
2179 */
2180
2181 PUTMARK(SX_ARRAY);
2182 WLEN(len);
2183 TRACEME(("size = %d", len));
2184
2185 /*
2186 * Now store each item recursively.
2187 */
2188
2189 for (i = 0; i < len; i++) {
2190 sav = av_fetch(av, i, 0);
2191 if (!sav) {
2192 TRACEME(("(#%d) undef item", i));
20bb3f55 2193 STORE_SV_UNDEF();
7a6a85bf
RG
2194 continue;
2195 }
2196 TRACEME(("(#%d) item", i));
138ec36d 2197 if ((ret = store(aTHX_ cxt, *sav))) /* Extra () for -Wall, grr... */
7a6a85bf
RG
2198 return ret;
2199 }
2200
2201 TRACEME(("ok (array)"));
2202
2203 return 0;
2204}
2205
138ec36d
BC
2206
2207#if (PATCHLEVEL <= 6)
2208
7a6a85bf
RG
2209/*
2210 * sortcmp
2211 *
2212 * Sort two SVs
2213 * Borrowed from perl source file pp_ctl.c, where it is used by pp_sort.
2214 */
2215static int
f0ffaed8 2216sortcmp(const void *a, const void *b)
7a6a85bf 2217{
138ec36d
BC
2218#if defined(USE_ITHREADS)
2219 dTHX;
2220#endif /* USE_ITHREADS */
2221 return sv_cmp(*(SV * const *) a, *(SV * const *) b);
7a6a85bf
RG
2222}
2223
138ec36d 2224#endif /* PATCHLEVEL <= 6 */
7a6a85bf
RG
2225
2226/*
2227 * store_hash
2228 *
d1be9408 2229 * Store a hash table.
7a6a85bf 2230 *
e16e2ff8
NC
2231 * For a "normal" hash (not restricted, no utf8 keys):
2232 *
7a6a85bf
RG
2233 * Layout is SX_HASH <size> followed by each key/value pair, in random order.
2234 * Values are stored as <object>.
2235 * Keys are stored as <length> <data>, the <data> section being omitted
2236 * if length is 0.
c194a0a3
TB
2237 *
2238 * For a "fancy" hash (restricted or utf8 keys):
2239 *
2240 * Layout is SX_FLAG_HASH <size> <hash flags> followed by each key/value pair,
e16e2ff8
NC
2241 * in random order.
2242 * Values are stored as <object>.
2243 * Keys are stored as <flags> <length> <data>, the <data> section being omitted
2244 * if length is 0.
2245 * Currently the only hash flag is "restriced"
2246 * Key flags are as for hv.h
7a6a85bf 2247 */
138ec36d 2248static int store_hash(pTHX_ stcxt_t *cxt, HV *hv)
7a6a85bf 2249{
27da23d5 2250 dVAR;
530b72ba
NC
2251 I32 len =
2252#ifdef HAS_RESTRICTED_HASHES
2253 HvTOTALKEYS(hv);
2254#else
2255 HvKEYS(hv);
2256#endif
7a6a85bf
RG
2257 I32 i;
2258 int ret = 0;
2259 I32 riter;
2260 HE *eiter;
530b72ba
NC
2261 int flagged_hash = ((SvREADONLY(hv)
2262#ifdef HAS_HASH_KEY_FLAGS
2263 || HvHASKFLAGS(hv)
2264#endif
2265 ) ? 1 : 0);
e16e2ff8 2266 unsigned char hash_flags = (SvREADONLY(hv) ? SHV_RESTRICTED : 0);
7a6a85bf 2267
e16e2ff8
NC
2268 if (flagged_hash) {
2269 /* needs int cast for C++ compilers, doesn't it? */
2270 TRACEME(("store_hash (0x%"UVxf") (flags %x)", PTR2UV(hv),
2271 (int) hash_flags));
2272 } else {
2273 TRACEME(("store_hash (0x%"UVxf")", PTR2UV(hv)));
2274 }
7a6a85bf
RG
2275
2276 /*
2277 * Signal hash by emitting SX_HASH, followed by the table length.
2278 */
2279
e16e2ff8
NC
2280 if (flagged_hash) {
2281 PUTMARK(SX_FLAG_HASH);
2282 PUTMARK(hash_flags);
2283 } else {
2284 PUTMARK(SX_HASH);
2285 }
7a6a85bf
RG
2286 WLEN(len);
2287 TRACEME(("size = %d", len));
2288
2289 /*
2290 * Save possible iteration state via each() on that table.
2291 */
2292
bfcb3514
NC
2293 riter = HvRITER_get(hv);
2294 eiter = HvEITER_get(hv);
7a6a85bf
RG
2295 hv_iterinit(hv);
2296
2297 /*
2298 * Now store each item recursively.
2299 *
2300 * If canonical is defined to some true value then store each
2301 * key/value pair in sorted order otherwise the order is random.
2302 * Canonical order is irrelevant when a deep clone operation is performed.
2303 *
2304 * Fetch the value from perl only once per store() operation, and only
2305 * when needed.
2306 */
2307
2308 if (
2309 !(cxt->optype & ST_CLONE) && (cxt->canonical == 1 ||
2310 (cxt->canonical < 0 && (cxt->canonical =
e16e2ff8 2311 (SvTRUE(perl_get_sv("Storable::canonical", TRUE)) ? 1 : 0))))
7a6a85bf
RG
2312 ) {
2313 /*
2314 * Storing in order, sorted by key.
2315 * Run through the hash, building up an array of keys in a
2316 * mortal array, sort the array and then run through the
2317 * array.
2318 */
2319
2320 AV *av = newAV();
2321
e16e2ff8
NC
2322 /*av_extend (av, len);*/
2323
7a6a85bf
RG
2324 TRACEME(("using canonical order"));
2325
2326 for (i = 0; i < len; i++) {
530b72ba 2327#ifdef HAS_RESTRICTED_HASHES
e16e2ff8 2328 HE *he = hv_iternext_flags(hv, HV_ITERNEXT_WANTPLACEHOLDERS);
530b72ba
NC
2329#else
2330 HE *he = hv_iternext(hv);
2331#endif
0d326098
NC
2332 SV *key;
2333
2334 if (!he)
2335 CROAK(("Hash %p inconsistent - expected %d keys, %dth is NULL", hv, len, i));
2336 key = hv_iterkeysv(he);
7a6a85bf
RG
2337 av_store(av, AvFILLp(av)+1, key); /* av_push(), really */
2338 }
2339
138ec36d 2340 STORE_HASH_SORT;
7a6a85bf
RG
2341
2342 for (i = 0; i < len; i++) {
dfd91409 2343#ifdef HAS_RESTRICTED_HASHES
ca732855 2344 int placeholders = (int)HvPLACEHOLDERS_get(hv);
dfd91409
NC
2345#endif
2346 unsigned char flags = 0;
7a6a85bf 2347 char *keyval;
e16e2ff8
NC
2348 STRLEN keylen_tmp;
2349 I32 keylen;
7a6a85bf 2350 SV *key = av_shift(av);
dfd91409
NC
2351 /* This will fail if key is a placeholder.
2352 Track how many placeholders we have, and error if we
2353 "see" too many. */
7a6a85bf 2354 HE *he = hv_fetch_ent(hv, key, 0, 0);
dfd91409
NC
2355 SV *val;
2356
2357 if (he) {
2358 if (!(val = HeVAL(he))) {
2359 /* Internal error, not I/O error */
2360 return 1;
2361 }
2362 } else {
2363#ifdef HAS_RESTRICTED_HASHES
2364 /* Should be a placeholder. */
2365 if (placeholders-- < 0) {
2366 /* This should not happen - number of
2367 retrieves should be identical to
2368 number of placeholders. */
2369 return 1;
2370 }
2371 /* Value is never needed, and PL_sv_undef is
2372 more space efficient to store. */
2373 val = &PL_sv_undef;
2374 ASSERT (flags == 0,
2375 ("Flags not 0 but %d", flags));
2376 flags = SHV_K_PLACEHOLDER;
2377#else
2378 return 1;
2379#endif
2380 }
7a6a85bf
RG
2381
2382 /*
2383 * Store value first.
2384 */
2385
9e21b3d0 2386 TRACEME(("(#%d) value 0x%"UVxf, i, PTR2UV(val)));
7a6a85bf 2387
138ec36d 2388 if ((ret = store(aTHX_ cxt, val))) /* Extra () for -Wall, grr... */
7a6a85bf
RG
2389 goto out;
2390
2391 /*
2392 * Write key string.
2393 * Keys are written after values to make sure retrieval
2394 * can be optimal in terms of memory usage, where keys are
2395 * read into a fixed unique buffer called kbuf.
2396 * See retrieve_hash() for details.
2397 */
2398
e16e2ff8
NC
2399 /* Implementation of restricted hashes isn't nicely
2400 abstracted: */
dfd91409
NC
2401 if ((hash_flags & SHV_RESTRICTED) && SvREADONLY(val)) {
2402 flags |= SHV_K_LOCKED;
2403 }
e16e2ff8
NC
2404
2405 keyval = SvPV(key, keylen_tmp);
2406 keylen = keylen_tmp;
530b72ba
NC
2407#ifdef HAS_UTF8_HASHES
2408 /* If you build without optimisation on pre 5.6
2409 then nothing spots that SvUTF8(key) is always 0,
2410 so the block isn't optimised away, at which point
2411 the linker dislikes the reference to
2412 bytes_from_utf8. */
e16e2ff8
NC
2413 if (SvUTF8(key)) {
2414 const char *keysave = keyval;
2415 bool is_utf8 = TRUE;
2416
2417 /* Just casting the &klen to (STRLEN) won't work
2418 well if STRLEN and I32 are of different widths.
2419 --jhi */
2420 keyval = (char*)bytes_from_utf8((U8*)keyval,
2421 &keylen_tmp,
2422 &is_utf8);
2423
2424 /* If we were able to downgrade here, then than
2425 means that we have a key which only had chars
2426 0-255, but was utf8 encoded. */
2427
2428 if (keyval != keysave) {
2429 keylen = keylen_tmp;
2430 flags |= SHV_K_WASUTF8;
2431 } else {
2432 /* keylen_tmp can't have changed, so no need
2433 to assign back to keylen. */
2434 flags |= SHV_K_UTF8;
2435 }
2436 }
530b72ba 2437#endif
e16e2ff8
NC
2438
2439 if (flagged_hash) {
2440 PUTMARK(flags);
2441 TRACEME(("(#%d) key '%s' flags %x %u", i, keyval, flags, *keyval));
2442 } else {
fcaa57e7
AMS
2443 /* This is a workaround for a bug in 5.8.0
2444 that causes the HEK_WASUTF8 flag to be
2445 set on an HEK without the hash being
2446 marked as having key flags. We just
2447 cross our fingers and drop the flag.
2448 AMS 20030901 */
2449 assert (flags == 0 || flags == SHV_K_WASUTF8);
e16e2ff8
NC
2450 TRACEME(("(#%d) key '%s'", i, keyval));
2451 }
7a6a85bf
RG
2452 WLEN(keylen);
2453 if (keylen)
2454 WRITE(keyval, keylen);
e16e2ff8
NC
2455 if (flags & SHV_K_WASUTF8)
2456 Safefree (keyval);
7a6a85bf
RG
2457 }
2458
2459 /*
2460 * Free up the temporary array
2461 */
2462
2463 av_undef(av);
2464 sv_free((SV *) av);
2465
2466 } else {
2467
2468 /*
2469 * Storing in "random" order (in the order the keys are stored
a6d05634 2470 * within the hash). This is the default and will be faster!
7a6a85bf
RG
2471 */
2472
2473 for (i = 0; i < len; i++) {
0bb78401 2474 char *key = 0;
7a6a85bf 2475 I32 len;
e16e2ff8 2476 unsigned char flags;
530b72ba 2477#ifdef HV_ITERNEXT_WANTPLACEHOLDERS
e16e2ff8 2478 HE *he = hv_iternext_flags(hv, HV_ITERNEXT_WANTPLACEHOLDERS);
530b72ba
NC
2479#else
2480 HE *he = hv_iternext(hv);
2481#endif
e16e2ff8
NC
2482 SV *val = (he ? hv_iterval(hv, he) : 0);
2483 SV *key_sv = NULL;
2484 HEK *hek;
7a6a85bf
RG
2485
2486 if (val == 0)
2487 return 1; /* Internal error, not I/O error */
2488
dfd91409
NC
2489 /* Implementation of restricted hashes isn't nicely
2490 abstracted: */
2491 flags
2492 = (((hash_flags & SHV_RESTRICTED)
2493 && SvREADONLY(val))
2494 ? SHV_K_LOCKED : 0);
2495
2496 if (val == &PL_sv_placeholder) {
2497 flags |= SHV_K_PLACEHOLDER;
2498 val = &PL_sv_undef;
2499 }
2500
7a6a85bf
RG
2501 /*
2502 * Store value first.
2503 */
2504
9e21b3d0 2505 TRACEME(("(#%d) value 0x%"UVxf, i, PTR2UV(val)));
7a6a85bf 2506
138ec36d 2507 if ((ret = store(aTHX_ cxt, val))) /* Extra () for -Wall, grr... */
7a6a85bf
RG
2508 goto out;
2509
e16e2ff8
NC
2510
2511 hek = HeKEY_hek(he);
2512 len = HEK_LEN(hek);
2513 if (len == HEf_SVKEY) {
2514 /* This is somewhat sick, but the internal APIs are
2515 * such that XS code could put one of these in in
2516 * a regular hash.
2517 * Maybe we should be capable of storing one if
2518 * found.
2519 */
2520 key_sv = HeKEY_sv(he);
2521 flags |= SHV_K_ISSV;
2522 } else {
2523 /* Regular string key. */
530b72ba 2524#ifdef HAS_HASH_KEY_FLAGS
e16e2ff8
NC
2525 if (HEK_UTF8(hek))
2526 flags |= SHV_K_UTF8;
2527 if (HEK_WASUTF8(hek))
2528 flags |= SHV_K_WASUTF8;
530b72ba 2529#endif
e16e2ff8
NC
2530 key = HEK_KEY(hek);
2531 }
7a6a85bf
RG
2532 /*
2533 * Write key string.
2534 * Keys are written after values to make sure retrieval
2535 * can be optimal in terms of memory usage, where keys are
2536 * read into a fixed unique buffer called kbuf.
2537 * See retrieve_hash() for details.
2538 */
2539
e16e2ff8
NC
2540 if (flagged_hash) {
2541 PUTMARK(flags);
2542 TRACEME(("(#%d) key '%s' flags %x", i, key, flags));
2543 } else {
fcaa57e7
AMS
2544 /* This is a workaround for a bug in 5.8.0
2545 that causes the HEK_WASUTF8 flag to be
2546 set on an HEK without the hash being
2547 marked as having key flags. We just
2548 cross our fingers and drop the flag.
2549 AMS 20030901 */
2550 assert (flags == 0 || flags == SHV_K_WASUTF8);
e16e2ff8
NC
2551 TRACEME(("(#%d) key '%s'", i, key));
2552 }
2553 if (flags & SHV_K_ISSV) {
138ec36d 2554 store(aTHX_ cxt, key_sv);
e16e2ff8
NC
2555 } else {
2556 WLEN(len);
2557 if (len)
7a6a85bf 2558 WRITE(key, len);
e16e2ff8 2559 }
7a6a85bf
RG
2560 }
2561 }
2562
43d061fe 2563 TRACEME(("ok (hash 0x%"UVxf")", PTR2UV(hv)));
7a6a85bf
RG
2564
2565out:
bfcb3514
NC
2566 HvRITER_set(hv, riter); /* Restore hash iterator state */
2567 HvEITER_set(hv, eiter);
7a6a85bf
RG
2568
2569 return ret;
2570}
2571
2572/*
464b080a
SR
2573 * store_code
2574 *
2575 * Store a code reference.
2576 *
2577 * Layout is SX_CODE <length> followed by a scalar containing the perl
2578 * source code of the code reference.
2579 */
138ec36d 2580static int store_code(pTHX_ stcxt_t *cxt, CV *cv)
464b080a
SR
2581{
2582#if PERL_VERSION < 6
2583 /*
2584 * retrieve_code does not work with perl 5.005 or less
2585 */
138ec36d 2586 return store_other(aTHX_ cxt, (SV*)cv);
464b080a
SR
2587#else
2588 dSP;
2589 I32 len;
c5661c80 2590 int count, reallen;
464b080a
SR
2591 SV *text, *bdeparse;
2592
2593 TRACEME(("store_code (0x%"UVxf")", PTR2UV(cv)));
2594
2595 if (
2596 cxt->deparse == 0 ||
2597 (cxt->deparse < 0 && !(cxt->deparse =
2598 SvTRUE(perl_get_sv("Storable::Deparse", TRUE)) ? 1 : 0))
2599 ) {
138ec36d 2600 return store_other(aTHX_ cxt, (SV*)cv);
464b080a
SR
2601 }
2602
2603 /*
2604 * Require B::Deparse. At least B::Deparse 0.61 is needed for
2605 * blessed code references.
2606 */
17625bd2 2607 /* Ownership of both SVs is passed to load_module, which frees them. */
464b080a
SR
2608 load_module(PERL_LOADMOD_NOIMPORT, newSVpvn("B::Deparse",10), newSVnv(0.61));
2609
2610 ENTER;
2611 SAVETMPS;
2612
2613 /*
2614 * create the B::Deparse object
2615 */
2616
2617 PUSHMARK(sp);
2618 XPUSHs(sv_2mortal(newSVpvn("B::Deparse",10)));
2619 PUTBACK;
2620 count = call_method("new", G_SCALAR);
2621 SPAGAIN;
2622 if (count != 1)
2623 CROAK(("Unexpected return value from B::Deparse::new\n"));
2624 bdeparse = POPs;
2625
2626 /*
2627 * call the coderef2text method
2628 */
2629
2630 PUSHMARK(sp);
2631 XPUSHs(bdeparse); /* XXX is this already mortal? */
2632 XPUSHs(sv_2mortal(newRV_inc((SV*)cv)));
2633 PUTBACK;
2634 count = call_method("coderef2text", G_SCALAR);
2635 SPAGAIN;
2636 if (count != 1)
2637 CROAK(("Unexpected return value from B::Deparse::coderef2text\n"));
2638
2639 text = POPs;
dfe4365a 2640 len = SvCUR(text);
e3feee4e 2641 reallen = strlen(SvPV_nolen(text));
464b080a
SR
2642
2643 /*
2644 * Empty code references or XS functions are deparsed as
2645 * "(prototype) ;" or ";".
2646 */
2647
e3feee4e 2648 if (len == 0 || *(SvPV_nolen(text)+reallen-1) == ';') {
464b080a
SR
2649 CROAK(("The result of B::Deparse::coderef2text was empty - maybe you're trying to serialize an XS function?\n"));
2650 }
2651
2652 /*
2653 * Signal code by emitting SX_CODE.
2654 */
2655
2656 PUTMARK(SX_CODE);
a8b7ef86 2657 cxt->tagnum++; /* necessary, as SX_CODE is a SEEN() candidate */
464b080a 2658 TRACEME(("size = %d", len));
e3feee4e 2659 TRACEME(("code = %s", SvPV_nolen(text)));
464b080a
SR
2660
2661 /*
2662 * Now store the source code.
2663 */
2664
e3feee4e 2665 STORE_SCALAR(SvPV_nolen(text), len);
464b080a
SR
2666
2667 FREETMPS;
2668 LEAVE;
2669
2670 TRACEME(("ok (code)"));
2671
2672 return 0;
2673#endif
2674}
2675
2676/*
7a6a85bf
RG
2677 * store_tied
2678 *
2679 * When storing a tied object (be it a tied scalar, array or hash), we lay out
2680 * a special mark, followed by the underlying tied object. For instance, when
2681 * dealing with a tied hash, we store SX_TIED_HASH <hash object>, where
2682 * <hash object> stands for the serialization of the tied hash.
2683 */
138ec36d 2684static int store_tied(pTHX_ stcxt_t *cxt, SV *sv)
7a6a85bf
RG
2685{
2686 MAGIC *mg;
72edffd8 2687 SV *obj = NULL;
7a6a85bf
RG
2688 int ret = 0;
2689 int svt = SvTYPE(sv);
2690 char mtype = 'P';
2691
43d061fe 2692 TRACEME(("store_tied (0x%"UVxf")", PTR2UV(sv)));
7a6a85bf
RG
2693
2694 /*
2695 * We have a small run-time penalty here because we chose to factorise
2696 * all tieds objects into the same routine, and not have a store_tied_hash,
2697 * a store_tied_array, etc...
2698 *
2699 * Don't use a switch() statement, as most compilers don't optimize that
2700 * well for 2/3 values. An if() else if() cascade is just fine. We put
2701 * tied hashes first, as they are the most likely beasts.
2702 */
2703
2704 if (svt == SVt_PVHV) {
2705 TRACEME(("tied hash"));
2706 PUTMARK(SX_TIED_HASH); /* Introduces tied hash */
2707 } else if (svt == SVt_PVAV) {
2708 TRACEME(("tied array"));
2709 PUTMARK(SX_TIED_ARRAY); /* Introduces tied array */
2710 } else {
2711 TRACEME(("tied scalar"));
2712 PUTMARK(SX_TIED_SCALAR); /* Introduces tied scalar */
2713 mtype = 'q';
2714 }
2715
2716 if (!(mg = mg_find(sv, mtype)))
2717 CROAK(("No magic '%c' found while storing tied %s", mtype,
2718 (svt == SVt_PVHV) ? "hash" :
2719 (svt == SVt_PVAV) ? "array" : "scalar"));
2720
2721 /*
2722 * The mg->mg_obj found by mg_find() above actually points to the
2723 * underlying tied Perl object implementation. For instance, if the
2724 * original SV was that of a tied array, then mg->mg_obj is an AV.
2725 *
2726 * Note that we store the Perl object as-is. We don't call its FETCH
2727 * method along the way. At retrieval time, we won't call its STORE
2728 * method either, but the tieing magic will be re-installed. In itself,
2729 * that ensures that the tieing semantics are preserved since futher
2730 * accesses on the retrieved object will indeed call the magic methods...
2731 */
2732
72edffd8
AMS
2733 /* [#17040] mg_obj is NULL for scalar self-ties. AMS 20030416 */
2734 obj = mg->mg_obj ? mg->mg_obj : newSV(0);
138ec36d 2735 if ((ret = store(aTHX_ cxt, obj)))
7a6a85bf
RG
2736 return ret;
2737
2738 TRACEME(("ok (tied)"));
2739
2740 return 0;
2741}
2742
2743/*
2744 * store_tied_item
2745 *
2746 * Stores a reference to an item within a tied structure:
2747 *
2748 * . \$h{key}, stores both the (tied %h) object and 'key'.
2749 * . \$a[idx], stores both the (tied @a) object and 'idx'.
2750 *
2751 * Layout is therefore either:
2752 * SX_TIED_KEY <object> <key>
2753 * SX_TIED_IDX <object> <index>
2754 */
138ec36d 2755static int store_tied_item(pTHX_ stcxt_t *cxt, SV *sv)
7a6a85bf
RG
2756{
2757 MAGIC *mg;
2758 int ret;
2759
43d061fe 2760 TRACEME(("store_tied_item (0x%"UVxf")", PTR2UV(sv)));
7a6a85bf
RG
2761
2762 if (!(mg = mg_find(sv, 'p')))
2763 CROAK(("No magic 'p' found while storing reference to tied item"));
2764
2765 /*
2766 * We discriminate between \$h{key} and \$a[idx] via mg_ptr.
2767 */
2768
2769 if (mg->mg_ptr) {
2770 TRACEME(("store_tied_item: storing a ref to a tied hash item"));
2771 PUTMARK(SX_TIED_KEY);
9e21b3d0 2772 TRACEME(("store_tied_item: storing OBJ 0x%"UVxf, PTR2UV(mg->mg_obj)));
7a6a85bf 2773
138ec36d 2774 if ((ret = store(aTHX_ cxt, mg->mg_obj))) /* Extra () for -Wall, grr... */
7a6a85bf
RG
2775 return ret;
2776
9e21b3d0 2777 TRACEME(("store_tied_item: storing PTR 0x%"UVxf, PTR2UV(mg->mg_ptr)));
7a6a85bf 2778
138ec36d 2779 if ((ret = store(aTHX_ cxt, (SV *) mg->mg_ptr))) /* Idem, for -Wall */
7a6a85bf
RG
2780 return ret;
2781 } else {
2782 I32 idx = mg->mg_len;
2783
2784 TRACEME(("store_tied_item: storing a ref to a tied array item "));
2785 PUTMARK(SX_TIED_IDX);
9e21b3d0 2786 TRACEME(("store_tied_item: storing OBJ 0x%"UVxf, PTR2UV(mg->mg_obj)));
7a6a85bf 2787
138ec36d 2788 if ((ret = store(aTHX_ cxt, mg->mg_obj))) /* Idem, for -Wall */
7a6a85bf
RG
2789 return ret;
2790
2791 TRACEME(("store_tied_item: storing IDX %d", idx));
2792
2793 WLEN(idx);
2794 }
2795
2796 TRACEME(("ok (tied item)"));
2797
2798 return 0;
2799}
2800
2801/*
2802 * store_hook -- dispatched manually, not via sv_store[]
2803 *
2804 * The blessed SV is serialized by a hook.
2805 *
2806 * Simple Layout is:
2807 *
2808 * SX_HOOK <flags> <len> <classname> <len2> <str> [<len3> <object-IDs>]
2809 *
2810 * where <flags> indicates how long <len>, <len2> and <len3> are, whether
2811 * the trailing part [] is present, the type of object (scalar, array or hash).
2812 * There is also a bit which says how the classname is stored between:
2813 *
2814 * <len> <classname>
2815 * <index>
2816 *
2817 * and when the <index> form is used (classname already seen), the "large
2818 * classname" bit in <flags> indicates how large the <index> is.
2819 *
2820 * The serialized string returned by the hook is of length <len2> and comes
2821 * next. It is an opaque string for us.
2822 *
2823 * Those <len3> object IDs which are listed last represent the extra references
2824 * not directly serialized by the hook, but which are linked to the object.
2825 *
2826 * When recursion is mandated to resolve object-IDs not yet seen, we have
2827 * instead, with <header> being flags with bits set to indicate the object type
2828 * and that recursion was indeed needed:
2829 *
2830 * SX_HOOK <header> <object> <header> <object> <flags>
2831 *
2832 * that same header being repeated between serialized objects obtained through
2833 * recursion, until we reach flags indicating no recursion, at which point
2834 * we know we've resynchronized with a single layout, after <flags>.
b12202d0
JH
2835 *
2836 * When storing a blessed ref to a tied variable, the following format is
2837 * used:
2838 *
2839 * SX_HOOK <flags> <extra> ... [<len3> <object-IDs>] <magic object>
2840 *
2841 * The first <flags> indication carries an object of type SHT_EXTRA, and the
2842 * real object type is held in the <extra> flag. At the very end of the
2843 * serialization stream, the underlying magic object is serialized, just like
2844 * any other tied variable.
7a6a85bf 2845 */
f0ffaed8 2846static int store_hook(
138ec36d 2847 pTHX_
f0ffaed8
JH
2848 stcxt_t *cxt,
2849 SV *sv,
2850 int type,
2851 HV *pkg,
2852 SV *hook)
7a6a85bf
RG
2853{
2854 I32 len;
0723351e 2855 char *classname;
7a6a85bf
RG
2856 STRLEN len2;
2857 SV *ref;
2858 AV *av;
2859 SV **ary;
2860 int count; /* really len3 + 1 */
2861 unsigned char flags;
2862 char *pv;
2863 int i;
2864 int recursed = 0; /* counts recursion */
2865 int obj_type; /* object type, on 2 bits */
2866 I32 classnum;
2867 int ret;
2868 int clone = cxt->optype & ST_CLONE;
e993d95c
JH
2869 char mtype = '\0'; /* for blessed ref to tied structures */
2870 unsigned char eflags = '\0'; /* used when object type is SHT_EXTRA */
7a6a85bf 2871
bfcb3514 2872 TRACEME(("store_hook, classname \"%s\", tagged #%d", HvNAME_get(pkg), cxt->tagnum));
7a6a85bf
RG
2873
2874 /*
2875 * Determine object type on 2 bits.
2876 */
2877
2878 switch (type) {
2879 case svis_SCALAR:
2880 obj_type = SHT_SCALAR;
2881 break;
2882 case svis_ARRAY:
2883 obj_type = SHT_ARRAY;
2884 break;
2885 case svis_HASH:
2886 obj_type = SHT_HASH;
2887 break;
b12202d0
JH
2888 case svis_TIED:
2889 /*
2890 * Produced by a blessed ref to a tied data structure, $o in the
2891 * following Perl code.
2892 *
2893 * my %h;
2894 * tie %h, 'FOO';
2895 * my $o = bless \%h, 'BAR';
2896 *
2897 * Signal the tie-ing magic by setting the object type as SHT_EXTRA
2898 * (since we have only 2 bits in <flags> to store the type), and an
2899 * <extra> byte flag will be emitted after the FIRST <flags> in the
2900 * stream, carrying what we put in `eflags'.
2901 */
2902 obj_type = SHT_EXTRA;
2903 switch (SvTYPE(sv)) {
2904 case SVt_PVHV:
2905 eflags = (unsigned char) SHT_THASH;
2906 mtype = 'P';
2907 break;
2908 case SVt_PVAV:
2909 eflags = (unsigned char) SHT_TARRAY;
2910 mtype = 'P';
2911 break;
2912 default:
2913 eflags = (unsigned char) SHT_TSCALAR;
2914 mtype = 'q';
2915 break;
2916 }
2917 break;
7a6a85bf
RG
2918 default:
2919 CROAK(("Unexpected object type (%d) in store_hook()", type));
2920 }
2921 flags = SHF_NEED_RECURSE | obj_type;
2922
bfcb3514 2923 classname = HvNAME_get(pkg);
0723351e 2924 len = strlen(classname);
7a6a85bf
RG
2925
2926 /*
2927 * To call the hook, we need to fake a call like:
2928 *
2929 * $object->STORABLE_freeze($cloning);
2930 *
2931 * but we don't have the $object here. For instance, if $object is
2932 * a blessed array, what we have in `sv' is the array, and we can't
2933 * call a method on those.
2934 *
2935 * Therefore, we need to create a temporary reference to the object and
2936 * make the call on that reference.
2937 */
2938
0723351e 2939 TRACEME(("about to call STORABLE_freeze on class %s", classname));
7a6a85bf
RG
2940
2941 ref = newRV_noinc(sv); /* Temporary reference */
138ec36d 2942 av = array_call(aTHX_ ref, hook, clone); /* @a = $object->STORABLE_freeze($c) */
b162af07 2943 SvRV_set(ref, NULL);
7a6a85bf
RG
2944 SvREFCNT_dec(ref); /* Reclaim temporary reference */
2945
2946 count = AvFILLp(av) + 1;
2947 TRACEME(("store_hook, array holds %d items", count));
2948
2949 /*
2950 * If they return an empty list, it means they wish to ignore the
2951 * hook for this class (and not just this instance -- that's for them
2952 * to handle if they so wish).
2953 *
2954 * Simply disable the cached entry for the hook (it won't be recomputed
2955 * since it's present in the cache) and recurse to store_blessed().
2956 */
2957
2958 if (!count) {
2959 /*
2960 * They must not change their mind in the middle of a serialization.
2961 */
2962
0723351e 2963 if (hv_fetch(cxt->hclass, classname, len, FALSE))
7a6a85bf 2964 CROAK(("Too late to ignore hooks for %s class \"%s\"",
0723351e 2965 (cxt->optype & ST_CLONE) ? "cloning" : "storing", classname));
7a6a85bf 2966
138ec36d 2967 pkg_hide(aTHX_ cxt->hook, pkg, "STORABLE_freeze");
7a6a85bf 2968
138ec36d 2969 ASSERT(!pkg_can(aTHX_ cxt->hook, pkg, "STORABLE_freeze"), ("hook invisible"));
0723351e 2970 TRACEME(("ignoring STORABLE_freeze in class \"%s\"", classname));
7a6a85bf 2971
138ec36d 2972 return store_blessed(aTHX_ cxt, sv, type, pkg);
7a6a85bf
RG
2973 }
2974
2975 /*
2976 * Get frozen string.
2977 */
2978
2979 ary = AvARRAY(av);
2980 pv = SvPV(ary[0], len2);
2f796f32
AMS
2981 /* We can't use pkg_can here because it only caches one method per
2982 * package */
2983 {
2984 GV* gv = gv_fetchmethod_autoload(pkg, "STORABLE_attach", FALSE);
2985 if (gv && isGV(gv)) {
2986 if (count > 1)
2987 CROAK(("Freeze cannot return references if %s class is using STORABLE_attach", classname));
2988 goto check_done;
2989 }
2990 }
7a6a85bf
RG
2991
2992 /*
7a6a85bf
RG
2993 * If they returned more than one item, we need to serialize some
2994 * extra references if not already done.
2995 *
10ffa93f 2996 * Loop over the array, starting at position #1, and for each item,
7a6a85bf
RG
2997 * ensure it is a reference, serialize it if not already done, and
2998 * replace the entry with the tag ID of the corresponding serialized
2999 * object.
3000 *
3001 * We CHEAT by not calling av_fetch() and read directly within the
3002 * array, for speed.
3003 */
3004
3005 for (i = 1; i < count; i++) {
ab923da1
NC
3006#ifdef USE_PTR_TABLE
3007 char *fake_tag;
3008#else
7a6a85bf 3009 SV **svh;
ab923da1 3010#endif
90826881
JH
3011 SV *rsv = ary[i];
3012 SV *xsv;
ab923da1 3013 SV *tag;
90826881 3014 AV *av_hook = cxt->hook_seen;
7a6a85bf 3015
90826881
JH
3016 if (!SvROK(rsv))
3017 CROAK(("Item #%d returned by STORABLE_freeze "
0723351e 3018 "for %s is not a reference", i, classname));
90826881 3019 xsv = SvRV(rsv); /* Follow ref to know what to look for */
7a6a85bf
RG
3020
3021 /*
3022 * Look in hseen and see if we have a tag already.
3023 * Serialize entry if not done already, and get its tag.
3024 */
ab923da1
NC
3025
3026#ifdef USE_PTR_TABLE
3027 /* Fakery needed because ptr_table_fetch returns zero for a
3028 failure, whereas the existing code assumes that it can
3029 safely store a tag zero. So for ptr_tables we store tag+1
3030 */
0bb78401 3031 if ((fake_tag = ptr_table_fetch(cxt->pseen, xsv)))
ab923da1
NC
3032 goto sv_seen; /* Avoid moving code too far to the right */
3033#else
13689cfe 3034 if ((svh = hv_fetch(cxt->hseen, (char *) &xsv, sizeof(xsv), FALSE)))
7a6a85bf 3035 goto sv_seen; /* Avoid moving code too far to the right */
ab923da1 3036#endif
7a6a85bf 3037
9e21b3d0 3038 TRACEME(("listed object %d at 0x%"UVxf" is unknown", i-1, PTR2UV(xsv)));
7a6a85bf
RG
3039
3040 /*
3041 * We need to recurse to store that object and get it to be known
3042 * so that we can resolve the list of object-IDs at retrieve time.
3043 *
3044 * The first time we do this, we need to emit the proper header
3045 * indicating that we recursed, and what the type of object is (the
3046 * object we're storing via a user-hook). Indeed, during retrieval,
3047 * we'll have to create the object before recursing to retrieve the
3048 * others, in case those would point back at that object.
3049 */
3050
b12202d0
JH
3051 /* [SX_HOOK] <flags> [<extra>] <object>*/
3052 if (!recursed++) {
7a6a85bf 3053 PUTMARK(SX_HOOK);
b12202d0
JH
3054 PUTMARK(flags);
3055 if (obj_type == SHT_EXTRA)
3056 PUTMARK(eflags);
3057 } else
3058 PUTMARK(flags);
7a6a85bf 3059
138ec36d 3060 if ((ret = store(aTHX_ cxt, xsv))) /* Given by hook for us to store */
7a6a85bf
RG
3061 return ret;
3062
ab923da1
NC
3063#ifdef USE_PTR_TABLE
3064 fake_tag = ptr_table_fetch(cxt->pseen, xsv);
3065 if (!sv)
3066 CROAK(("Could not serialize item #%d from hook in %s", i, classname));
3067#else
7a6a85bf
RG
3068 svh = hv_fetch(cxt->hseen, (char *) &xsv, sizeof(xsv), FALSE);
3069 if (!svh)
0723351e 3070 CROAK(("Could not serialize item #%d from hook in %s", i, classname));
ab923da1 3071#endif
7a6a85bf 3072 /*
90826881
JH
3073 * It was the first time we serialized `xsv'.
3074 *
3075 * Keep this SV alive until the end of the serialization: if we
3076 * disposed of it right now by decrementing its refcount, and it was
3077 * a temporary value, some next temporary value allocated during
3078 * another STORABLE_freeze might take its place, and we'd wrongly
3079 * assume that new SV was already serialized, based on its presence
3080 * in cxt->hseen.
3081 *
3082 * Therefore, push it away in cxt->hook_seen.
7a6a85bf
RG
3083 */
3084
90826881
JH
3085 av_store(av_hook, AvFILLp(av_hook)+1, SvREFCNT_inc(xsv));
3086
7a6a85bf 3087 sv_seen:
90826881
JH
3088 /*
3089 * Dispose of the REF they returned. If we saved the `xsv' away
3090 * in the array of returned SVs, that will not cause the underlying
3091 * referenced SV to be reclaimed.
3092 */
3093
3094 ASSERT(SvREFCNT(xsv) > 1, ("SV will survive disposal of its REF"));
3095 SvREFCNT_dec(rsv); /* Dispose of reference */
3096
3097 /*
3098 * Replace entry with its tag (not a real SV, so no refcnt increment)
3099 */
3100
ab923da1
NC
3101#ifdef USE_PTR_TABLE
3102 tag = (SV *)--fake_tag;
3103#else
3104 tag = *svh;
3105#endif
672ac946 3106 ary[i] = tag;
76edffbb 3107 TRACEME(("listed object %d at 0x%"UVxf" is tag #%"UVuf,
ab923da1 3108 i-1, PTR2UV(xsv), PTR2UV(tag)));
7a6a85bf
RG
3109 }
3110
3111 /*
dd19458b
JH
3112 * Allocate a class ID if not already done.
3113 *
3114 * This needs to be done after the recursion above, since at retrieval
3115 * time, we'll see the inner objects first. Many thanks to
3116 * Salvador Ortiz Garcia <sog@msg.com.mx> who spot that bug and
3117 * proposed the right fix. -- RAM, 15/09/2000
3118 */
3119
2f796f32 3120check_done:
0723351e
NC
3121 if (!known_class(aTHX_ cxt, classname, len, &classnum)) {
3122 TRACEME(("first time we see class %s, ID = %d", classname, classnum));
dd19458b
JH
3123 classnum = -1; /* Mark: we must store classname */
3124 } else {
0723351e 3125 TRACEME(("already seen class %s, ID = %d", classname, classnum));
dd19458b
JH
3126 }
3127
3128 /*
7a6a85bf
RG
3129 * Compute leading flags.
3130 */
3131
3132 flags = obj_type;
3133 if (((classnum == -1) ? len : classnum) > LG_SCALAR)
3134 flags |= SHF_LARGE_CLASSLEN;
3135 if (classnum != -1)
3136 flags |= SHF_IDX_CLASSNAME;
3137 if (len2 > LG_SCALAR)
3138 flags |= SHF_LARGE_STRLEN;
3139 if (count > 1)
3140 flags |= SHF_HAS_LIST;
3141 if (count > (LG_SCALAR + 1))
3142 flags |= SHF_LARGE_LISTLEN;
3143
3144 /*
3145 * We're ready to emit either serialized form:
3146 *
3147 * SX_HOOK <flags> <len> <classname> <len2> <str> [<len3> <object-IDs>]
3148 * SX_HOOK <flags> <index> <len2> <str> [<len3> <object-IDs>]
3149 *
3150 * If we recursed, the SX_HOOK has already been emitted.
3151 */
3152
9e21b3d0
JH
3153 TRACEME(("SX_HOOK (recursed=%d) flags=0x%x "
3154 "class=%"IVdf" len=%"IVdf" len2=%"IVdf" len3=%d",
d67b2c17 3155 recursed, flags, (IV)classnum, (IV)len, (IV)len2, count-1));
7a6a85bf 3156
b12202d0
JH
3157 /* SX_HOOK <flags> [<extra>] */
3158 if (!recursed) {
7a6a85bf 3159 PUTMARK(SX_HOOK);
b12202d0
JH
3160 PUTMARK(flags);
3161 if (obj_type == SHT_EXTRA)
3162 PUTMARK(eflags);
3163 } else
3164 PUTMARK(flags);
7a6a85bf
RG
3165
3166 /* <len> <classname> or <index> */
3167 if (flags & SHF_IDX_CLASSNAME) {
3168 if (flags & SHF_LARGE_CLASSLEN)
3169 WLEN(classnum);
3170 else {
3171 unsigned char cnum = (unsigned char) classnum;
3172 PUTMARK(cnum);
3173 }
3174 } else {
3175 if (flags & SHF_LARGE_CLASSLEN)
3176 WLEN(len);
3177 else {
3178 unsigned char clen = (unsigned char) len;
3179 PUTMARK(clen);
3180 }
0723351e 3181 WRITE(classname, len); /* Final \0 is omitted */
7a6a85bf
RG
3182 }
3183
3184 /* <len2> <frozen-str> */
cc964657
JH
3185 if (flags & SHF_LARGE_STRLEN) {
3186 I32 wlen2 = len2; /* STRLEN might be 8 bytes */
3187 WLEN(wlen2); /* Must write an I32 for 64-bit machines */
3188 } else {
7a6a85bf
RG
3189 unsigned char clen = (unsigned char) len2;
3190 PUTMARK(clen);
3191 }
3192 if (len2)
7c436af3 3193 WRITE(pv, (SSize_t)len2); /* Final \0 is omitted */
7a6a85bf
RG
3194
3195 /* [<len3> <object-IDs>] */
3196 if (flags & SHF_HAS_LIST) {
3197 int len3 = count - 1;
3198 if (flags & SHF_LARGE_LISTLEN)
3199 WLEN(len3);
3200 else {
3201 unsigned char clen = (unsigned char) len3;
3202 PUTMARK(clen);
3203 }
3204
3205 /*
3206 * NOTA BENE, for 64-bit machines: the ary[i] below does not yield a
3207 * real pointer, rather a tag number, well under the 32-bit limit.
3208 */
3209
3210 for (i = 1; i < count; i++) {
3211 I32 tagval = htonl(LOW_32BITS(ary[i]));
9e21b3d0 3212 WRITE_I32(tagval);
7a6a85bf
RG
3213 TRACEME(("object %d, tag #%d", i-1, ntohl(tagval)));
3214 }
3215 }
3216
3217 /*
3218 * Free the array. We need extra care for indices after 0, since they
3219 * don't hold real SVs but integers cast.
3220 */
3221
3222 if (count > 1)
3223 AvFILLp(av) = 0; /* Cheat, nothing after 0 interests us */
3224 av_undef(av);
3225 sv_free((SV *) av);
3226
b12202d0
JH
3227 /*
3228 * If object was tied, need to insert serialization of the magic object.
3229 */
3230
3231 if (obj_type == SHT_EXTRA) {
3232 MAGIC *mg;
3233
3234 if (!(mg = mg_find(sv, mtype))) {
3235 int svt = SvTYPE(sv);
3236 CROAK(("No magic '%c' found while storing ref to tied %s with hook",
3237 mtype, (svt == SVt_PVHV) ? "hash" :
3238 (svt == SVt_PVAV) ? "array" : "scalar"));
3239 }
3240
3241 TRACEME(("handling the magic object 0x%"UVxf" part of 0x%"UVxf,
3242 PTR2UV(mg->mg_obj), PTR2UV(sv)));
3243
3244 /*
3245 * [<magic object>]
3246 */
3247
138ec36d 3248 if ((ret = store(aTHX_ cxt, mg->mg_obj))) /* Extra () for -Wall, grr... */
b12202d0
JH
3249 return ret;
3250 }
3251
7a6a85bf
RG
3252 return 0;
3253}
3254
3255/*
3256 * store_blessed -- dispatched manually, not via sv_store[]
3257 *
3258 * Check whether there is a STORABLE_xxx hook defined in the class or in one
3259 * of its ancestors. If there is, then redispatch to store_hook();
3260 *
3261 * Otherwise, the blessed SV is stored using the following layout:
3262 *
3263 * SX_BLESS <flag> <len> <classname> <object>
3264 *
3265 * where <flag> indicates whether <len> is stored on 0 or 4 bytes, depending
3266 * on the high-order bit in flag: if 1, then length follows on 4 bytes.
3267 * Otherwise, the low order bits give the length, thereby giving a compact
3268 * representation for class names less than 127 chars long.
3269 *
3270 * Each <classname> seen is remembered and indexed, so that the next time
3271 * an object in the blessed in the same <classname> is stored, the following
3272 * will be emitted:
3273 *
3274 * SX_IX_BLESS <flag> <index> <object>
3275 *
3276 * where <index> is the classname index, stored on 0 or 4 bytes depending
3277 * on the high-order bit in flag (same encoding as above for <len>).
3278 */
f0ffaed8 3279static int store_blessed(
138ec36d 3280 pTHX_
f0ffaed8
JH
3281 stcxt_t *cxt,
3282 SV *sv,
3283 int type,
3284 HV *pkg)
7a6a85bf
RG
3285{
3286 SV *hook;
3287 I32 len;
0723351e 3288 char *classname;
7a6a85bf
RG
3289 I32 classnum;
3290
bfcb3514 3291 TRACEME(("store_blessed, type %d, class \"%s\"", type, HvNAME_get(pkg)));
7a6a85bf
RG
3292
3293 /*
3294 * Look for a hook for this blessed SV and redirect to store_hook()
3295 * if needed.
3296 */
3297
138ec36d 3298 hook = pkg_can(aTHX_ cxt->hook, pkg, "STORABLE_freeze");
7a6a85bf 3299 if (hook)
138ec36d 3300 return store_hook(aTHX_ cxt, sv, type, pkg, hook);
7a6a85bf
RG
3301
3302 /*
3303 * This is a blessed SV without any serialization hook.
3304 */
3305
bfcb3514 3306 classname = HvNAME_get(pkg);
0723351e 3307 len = strlen(classname);
7a6a85bf 3308
43d061fe 3309 TRACEME(("blessed 0x%"UVxf" in %s, no hook: tagged #%d",
5e081687 3310 PTR2UV(sv), classname, cxt->tagnum));
7a6a85bf
RG
3311
3312 /*
3313 * Determine whether it is the first time we see that class name (in which
3314 * case it will be stored in the SX_BLESS form), or whether we already
3315 * saw that class name before (in which case the SX_IX_BLESS form will be
3316 * used).
3317 */
3318
0723351e
NC
3319 if (known_class(aTHX_ cxt, classname, len, &classnum)) {
3320 TRACEME(("already seen class %s, ID = %d", classname, classnum));
7a6a85bf
RG
3321 PUTMARK(SX_IX_BLESS);
3322 if (classnum <= LG_BLESS) {
3323 unsigned char cnum = (unsigned char) classnum;
3324 PUTMARK(cnum);
3325 } else {
3326 unsigned char flag = (unsigned char) 0x80;
3327 PUTMARK(flag);
3328 WLEN(classnum);
3329 }
3330 } else {
0723351e 3331 TRACEME(("first time we see class %s, ID = %d", classname, classnum));
7a6a85bf
RG
3332 PUTMARK(SX_BLESS);
3333 if (len <= LG_BLESS) {
3334 unsigned char clen = (unsigned char) len;
3335 PUTMARK(clen);
3336 } else {
3337 unsigned char flag = (unsigned char) 0x80;
3338 PUTMARK(flag);
3339 WLEN(len); /* Don't BER-encode, this should be rare */
3340 }
0723351e 3341 WRITE(classname, len); /* Final \0 is omitted */
7a6a85bf
RG
3342 }
3343
3344 /*
3345 * Now emit the <object> part.
3346 */
3347
138ec36d 3348 return SV_STORE(type)(aTHX_ cxt, sv);
7a6a85bf
RG
3349}
3350
3351/*
3352 * store_other
3353 *
3354 * We don't know how to store the item we reached, so return an error condition.
3355 * (it's probably a GLOB, some CODE reference, etc...)
3356 *
3357 * If they defined the `forgive_me' variable at the Perl level to some
3358 * true value, then don't croak, just warn, and store a placeholder string
3359 * instead.
3360 */
138ec36d 3361static int store_other(pTHX_ stcxt_t *cxt, SV *sv)
7a6a85bf 3362{
cc964657 3363 I32 len;
27da23d5 3364 char buf[80];
7a6a85bf
RG
3365
3366 TRACEME(("store_other"));
3367
3368 /*
3369 * Fetch the value from perl only once per store() operation.
3370 */
3371
3372 if (
3373 cxt->forgive_me == 0 ||
3374 (cxt->forgive_me < 0 && !(cxt->forgive_me =
3375 SvTRUE(perl_get_sv("Storable::forgive_me", TRUE)) ? 1 : 0))
3376 )
3377 CROAK(("Can't store %s items", sv_reftype(sv, FALSE)));
3378
43d061fe
JH
3379 warn("Can't store item %s(0x%"UVxf")",
3380 sv_reftype(sv, FALSE), PTR2UV(sv));
7a6a85bf
RG
3381
3382 /*
3383 * Store placeholder string as a scalar instead...
3384 */
3385
13689cfe 3386 (void) sprintf(buf, "You lost %s(0x%"UVxf")%c", sv_reftype(sv, FALSE),
e993d95c 3387 PTR2UV(sv), (char) 0);
7a6a85bf
RG
3388
3389 len = strlen(buf);
3390 STORE_SCALAR(buf, len);
1cf92b12 3391 TRACEME(("ok (dummy \"%s\", length = %"IVdf")", buf, (IV) len));
7a6a85bf
RG
3392
3393 return 0;
3394}
3395
3396/***
3397 *** Store driving routines
3398 ***/
3399
3400/*
3401 * sv_type
3402 *
3403 * WARNING: partially duplicates Perl's sv_reftype for speed.
3404 *
3405 * Returns the type of the SV, identified by an integer. That integer
3406 * may then be used to index the dynamic routine dispatch table.
3407 */
138ec36d 3408static int sv_type(pTHX_ SV *sv)
7a6a85bf
RG
3409{
3410 switch (SvTYPE(sv)) {
3411 case SVt_NULL:
3412 case SVt_IV:
3413 case SVt_NV:
3414 /*
3415 * No need to check for ROK, that can't be set here since there
3416 * is no field capable of hodling the xrv_rv reference.
3417 */
3418 return svis_SCALAR;
3419 case SVt_PV:
3420 case SVt_RV:
3421 case SVt_PVIV:
3422 case SVt_PVNV:
3423 /*
3424 * Starting from SVt_PV, it is possible to have the ROK flag
3425 * set, the pointer to the other SV being either stored in
3426 * the xrv_rv (in the case of a pure SVt_RV), or as the
3427 * xpv_pv field of an SVt_PV and its heirs.
3428 *
3429 * However, those SV cannot be magical or they would be an
3430 * SVt_PVMG at least.
3431 */
3432 return SvROK(sv) ? svis_REF : svis_SCALAR;
3433 case SVt_PVMG:
3434 case SVt_PVLV: /* Workaround for perl5.004_04 "LVALUE" bug */
3435 if (SvRMAGICAL(sv) && (mg_find(sv, 'p')))
3436 return svis_TIED_ITEM;
3437 /* FALL THROUGH */
3438 case SVt_PVBM:
3439 if (SvRMAGICAL(sv) && (mg_find(sv, 'q')))
3440 return svis_TIED;
3441 return SvROK(sv) ? svis_REF : svis_SCALAR;
3442 case SVt_PVAV:
3443 if (SvRMAGICAL(sv) && (mg_find(sv, 'P')))
3444 return svis_TIED;
3445 return svis_ARRAY;
3446 case SVt_PVHV:
3447 if (SvRMAGICAL(sv) && (mg_find(sv, 'P')))
3448 return svis_TIED;
3449 return svis_HASH;
464b080a
SR
3450 case SVt_PVCV:
3451 return svis_CODE;
7a6a85bf
RG
3452 default:
3453 break;
3454 }
3455
3456 return svis_OTHER;
3457}
3458
3459/*
3460 * store
3461 *
3462 * Recursively store objects pointed to by the sv to the specified file.
3463 *
3464 * Layout is <content> or SX_OBJECT <tagnum> if we reach an already stored
3465 * object (one for which storage has started -- it may not be over if we have
3466 * a self-referenced structure). This data set forms a stored <object>.
3467 */
138ec36d 3468static int store(pTHX_ stcxt_t *cxt, SV *sv)
7a6a85bf
RG
3469{
3470 SV **svh;
3471 int ret;
7a6a85bf 3472 int type;
ab923da1
NC
3473#ifdef USE_PTR_TABLE
3474 struct ptr_tbl *pseen = cxt->pseen;
3475#else
43d061fe 3476 HV *hseen = cxt->hseen;
ab923da1 3477#endif
7a6a85bf 3478
43d061fe 3479 TRACEME(("store (0x%"UVxf")", PTR2UV(sv)));
7a6a85bf
RG
3480
3481 /*
3482 * If object has already been stored, do not duplicate data.
3483 * Simply emit the SX_OBJECT marker followed by its tag data.
3484 * The tag is always written in network order.
3485 *
3486 * NOTA BENE, for 64-bit machines: the "*svh" below does not yield a
3487 * real pointer, rather a tag number (watch the insertion code below).
464b080a 3488 * That means it probably safe to assume it is well under the 32-bit limit,
7a6a85bf
RG
3489 * and makes the truncation safe.
3490 * -- RAM, 14/09/1999
3491 */
3492
ab923da1
NC
3493#ifdef USE_PTR_TABLE
3494 svh = ptr_table_fetch(pseen, sv);
3495#else
7a6a85bf 3496 svh = hv_fetch(hseen, (char *) &sv, sizeof(sv), FALSE);
ab923da1 3497#endif
7a6a85bf 3498 if (svh) {
dfd91409
NC
3499 I32 tagval;
3500
3501 if (sv == &PL_sv_undef) {
3502 /* We have seen PL_sv_undef before, but fake it as
3503 if we have not.
3504
3505 Not the simplest solution to making restricted
3506 hashes work on 5.8.0, but it does mean that
3507 repeated references to the one true undef will
3508 take up less space in the output file.
3509 */
3510 /* Need to jump past the next hv_store, because on the
3511 second store of undef the old hash value will be
17625bd2 3512 SvREFCNT_dec()ed, and as Storable cheats horribly
dfd91409
NC
3513 by storing non-SVs in the hash a SEGV will ensure.
3514 Need to increase the tag number so that the
3515 receiver has no idea what games we're up to. This
3516 special casing doesn't affect hooks that store
3517 undef, as the hook routine does its own lookup into
3518 hseen. Also this means that any references back
3519 to PL_sv_undef (from the pathological case of hooks
3520 storing references to it) will find the seen hash
3521 entry for the first time, as if we didn't have this
3522 hackery here. (That hseen lookup works even on 5.8.0
3523 because it's a key of &PL_sv_undef and a value
3524 which is a tag number, not a value which is
3525 PL_sv_undef.) */
3526 cxt->tagnum++;
3527 type = svis_SCALAR;
3528 goto undef_special_case;
3529 }
3530
ab923da1
NC
3531#ifdef USE_PTR_TABLE
3532 tagval = htonl(LOW_32BITS(((char *)svh)-1));
3533#else
dfd91409 3534 tagval = htonl(LOW_32BITS(*svh));
ab923da1 3535#endif
7a6a85bf 3536
9e21b3d0 3537 TRACEME(("object 0x%"UVxf" seen as #%d", PTR2UV(sv), ntohl(tagval)));
7a6a85bf
RG
3538
3539 PUTMARK(SX_OBJECT);
9e21b3d0 3540 WRITE_I32(tagval);
7a6a85bf
RG
3541 return 0;
3542 }
3543
3544 /*
3545 * Allocate a new tag and associate it with the address of the sv being
3546 * stored, before recursing...
3547 *
3548 * In order to avoid creating new SvIVs to hold the tagnum we just
d1be9408 3549 * cast the tagnum to an SV pointer and store that in the hash. This
7a6a85bf
RG
3550 * means that we must clean up the hash manually afterwards, but gives
3551 * us a 15% throughput increase.
3552 *
7a6a85bf
RG
3553 */
3554
3555 cxt->tagnum++;
ab923da1
NC
3556#ifdef USE_PTR_TABLE
3557 ptr_table_store(pseen, sv, INT2PTR(SV*, 1 + cxt->tagnum));
3558#else
7a6a85bf 3559 if (!hv_store(hseen,
3341c981 3560 (char *) &sv, sizeof(sv), INT2PTR(SV*, cxt->tagnum), 0))
7a6a85bf 3561 return -1;
ab923da1 3562#endif
7a6a85bf
RG
3563
3564 /*
3565 * Store `sv' and everything beneath it, using appropriate routine.
3566 * Abort immediately if we get a non-zero status back.
3567 */
3568
138ec36d 3569 type = sv_type(aTHX_ sv);
7a6a85bf 3570
dfd91409 3571undef_special_case:
43d061fe
JH
3572 TRACEME(("storing 0x%"UVxf" tag #%d, type %d...",
3573 PTR2UV(sv), cxt->tagnum, type));
7a6a85bf
RG
3574
3575 if (SvOBJECT(sv)) {
3576 HV *pkg = SvSTASH(sv);
138ec36d 3577 ret = store_blessed(aTHX_ cxt, sv, type, pkg);
7a6a85bf 3578 } else
138ec36d 3579 ret = SV_STORE(type)(aTHX_ cxt, sv);
7a6a85bf 3580
43d061fe
JH
3581 TRACEME(("%s (stored 0x%"UVxf", refcnt=%d, %s)",
3582 ret ? "FAILED" : "ok", PTR2UV(sv),
7a6a85bf
RG
3583 SvREFCNT(sv), sv_reftype(sv, FALSE)));
3584
3585 return ret;
3586}
3587
3588/*
3589 * magic_write
3590 *
3591 * Write magic number and system information into the file.
3592 * Layout is <magic> <network> [<len> <byteorder> <sizeof int> <sizeof long>
3593 * <sizeof ptr>] where <len> is the length of the byteorder hexa string.
3594 * All size and lenghts are written as single characters here.
3595 *
3596 * Note that no byte ordering info is emitted when <network> is true, since
3597 * integers will be emitted in network order in that case.
3598 */
138ec36d 3599static int magic_write(pTHX_ stcxt_t *cxt)
7a6a85bf 3600{
2aeb6432
NC
3601 /*
3602 * Starting with 0.6, the "use_network_order" byte flag is also used to
3603 * indicate the version number of the binary image, encoded in the upper
3604 * bits. The bit 0 is always used to indicate network order.
3605 */
3606 /*
3607 * Starting with 0.7, a full byte is dedicated to the minor version of
3608 * the binary format, which is incremented only when new markers are
3609 * introduced, for instance, but when backward compatibility is preserved.
3610 */
7a6a85bf 3611
2aeb6432
NC
3612 /* Make these at compile time. The WRITE() macro is sufficiently complex
3613 that it saves about 200 bytes doing it this way and only using it
3614 once. */
3615 static const unsigned char network_file_header[] = {
3616 MAGICSTR_BYTES,
3617 (STORABLE_BIN_MAJOR << 1) | 1,
3618 STORABLE_BIN_WRITE_MINOR
3619 };
3620 static const unsigned char file_header[] = {
3621 MAGICSTR_BYTES,
3622 (STORABLE_BIN_MAJOR << 1) | 0,
3623 STORABLE_BIN_WRITE_MINOR,
3624 /* sizeof the array includes the 0 byte at the end: */
3625 (char) sizeof (byteorderstr) - 1,
3626 BYTEORDER_BYTES,
3627 (unsigned char) sizeof(int),
3628 (unsigned char) sizeof(long),
3629 (unsigned char) sizeof(char *),
3630 (unsigned char) sizeof(NV)
3631 };
ee0f7aac
NC
3632#ifdef USE_56_INTERWORK_KLUDGE
3633 static const unsigned char file_header_56[] = {
3634 MAGICSTR_BYTES,
3635 (STORABLE_BIN_MAJOR << 1) | 0,
3636 STORABLE_BIN_WRITE_MINOR,
3637 /* sizeof the array includes the 0 byte at the end: */