*allocated structs, as these are not going to be needed again.
p4raw-id: //depot/perl@29664
HV* xmg_stash; /* class package */
};
-#if 0
-typedef struct xpvav xpvav_allocated;
-#else
typedef struct {
SSize_t xav_fill; /* Index of last element present */
SSize_t xav_max; /* max index for which array has space */
} xmg_u;
HV* xmg_stash; /* class package */
} xpvav_allocated;
-#endif
/* SV** xav_alloc; */
#define xav_alloc xiv_u.xivu_p1
#define xhv_keys xiv_u.xivu_iv
-#if 0
-typedef struct xpvhv xpvhv_allocated;
-#else
typedef struct {
STRLEN xhv_fill; /* how full xhv_array currently is */
STRLEN xhv_max; /* subscript of last element of xhv_array */
} xmg_u;
HV* xmg_stash; /* class package */
} xpvhv_allocated;
-#endif
/* hash a key */
/* FYI: This is the "One-at-a-Time" algorithm by Bob Jenkins
STRLEN xpv_len; /* allocated size */
};
-#if 0
-typedef struct xpv xpv_allocated;
-#else
typedef struct {
STRLEN xpv_cur; /* length of svu_pv as a C string */
STRLEN xpv_len; /* allocated size */
} xpv_allocated;
-#endif
struct xpviv {
union {
} xiv_u;
};
-#if 0
-typedef struct xpviv xpviv_allocated;
-#else
typedef struct {
STRLEN xpv_cur; /* length of svu_pv as a C string */
STRLEN xpv_len; /* allocated size */
HEK * xivu_namehek;
} xiv_u;
} xpviv_allocated;
-#endif
#define xiv_iv xiv_u.xivu_iv