📄 hv.h
字号:
getting the length. *//* This macro may go away without notice. */#define HvNAME_HEK(hv) (SvOOK(hv) ? HvAUX(hv)->xhv_name : NULL)#define HvNAME_get(hv) ((SvOOK(hv) && (HvAUX(hv)->xhv_name)) \ ? HEK_KEY(HvAUX(hv)->xhv_name) : NULL)#define HvNAMELEN_get(hv) ((SvOOK(hv) && (HvAUX(hv)->xhv_name)) \ ? HEK_LEN(HvAUX(hv)->xhv_name) : 0)/* the number of keys (including any placeholers) */#define XHvTOTALKEYS(xhv) ((xhv)->xhv_keys)/* * HvKEYS gets the number of keys that actually exist(), and is provided * for backwards compatibility with old XS code. The core uses HvUSEDKEYS * (keys, excluding placeholdes) and HvTOTALKEYS (including placeholders) */#define HvKEYS(hv) HvUSEDKEYS(hv)#define HvUSEDKEYS(hv) (HvTOTALKEYS(hv) - HvPLACEHOLDERS_get(hv))#define HvTOTALKEYS(hv) XHvTOTALKEYS((XPVHV*) SvANY(hv))#define HvPLACEHOLDERS(hv) (*Perl_hv_placeholders_p(aTHX_ (HV*)hv))#define HvPLACEHOLDERS_get(hv) (SvMAGIC(hv) ? Perl_hv_placeholders_get(aTHX_ (HV*)hv) : 0)#define HvPLACEHOLDERS_set(hv,p) Perl_hv_placeholders_set(aTHX_ (HV*)hv, p)#define HvSHAREKEYS(hv) (SvFLAGS(hv) & SVphv_SHAREKEYS)#define HvSHAREKEYS_on(hv) (SvFLAGS(hv) |= SVphv_SHAREKEYS)#define HvSHAREKEYS_off(hv) (SvFLAGS(hv) &= ~SVphv_SHAREKEYS)/* This is an optimisation flag. It won't be set if all hash keys have a 0 * flag. Currently the only flags relate to utf8. * Hence it won't be set if all keys are 8 bit only. It will be set if any key * is utf8 (including 8 bit keys that were entered as utf8, and need upgrading * when retrieved during iteration. It may still be set when there are no longer * any utf8 keys. * See HVhek_ENABLEHVKFLAGS for the trigger. */#define HvHASKFLAGS(hv) (SvFLAGS(hv) & SVphv_HASKFLAGS)#define HvHASKFLAGS_on(hv) (SvFLAGS(hv) |= SVphv_HASKFLAGS)#define HvHASKFLAGS_off(hv) (SvFLAGS(hv) &= ~SVphv_HASKFLAGS)#define HvLAZYDEL(hv) (SvFLAGS(hv) & SVphv_LAZYDEL)#define HvLAZYDEL_on(hv) (SvFLAGS(hv) |= SVphv_LAZYDEL)#define HvLAZYDEL_off(hv) (SvFLAGS(hv) &= ~SVphv_LAZYDEL)#define HvREHASH(hv) (SvFLAGS(hv) & SVphv_REHASH)#define HvREHASH_on(hv) (SvFLAGS(hv) |= SVphv_REHASH)#define HvREHASH_off(hv) (SvFLAGS(hv) &= ~SVphv_REHASH)#define Nullhe Null(HE*)#define HeNEXT(he) (he)->hent_next#define HeKEY_hek(he) (he)->hent_hek#define HeKEY(he) HEK_KEY(HeKEY_hek(he))#define HeKEY_sv(he) (*(SV**)HeKEY(he))#define HeKLEN(he) HEK_LEN(HeKEY_hek(he))#define HeKUTF8(he) HEK_UTF8(HeKEY_hek(he))#define HeKWASUTF8(he) HEK_WASUTF8(HeKEY_hek(he))#define HeKREHASH(he) HEK_REHASH(HeKEY_hek(he))#define HeKLEN_UTF8(he) (HeKUTF8(he) ? -HeKLEN(he) : HeKLEN(he))#define HeKFLAGS(he) HEK_FLAGS(HeKEY_hek(he))#define HeVAL(he) (he)->he_valu.hent_val#define HeHASH(he) HEK_HASH(HeKEY_hek(he))#define HePV(he,lp) ((HeKLEN(he) == HEf_SVKEY) ? \ SvPV(HeKEY_sv(he),lp) : \ ((lp = HeKLEN(he)), HeKEY(he)))#define HeSVKEY(he) ((HeKEY(he) && \ HeKLEN(he) == HEf_SVKEY) ? \ HeKEY_sv(he) : NULL)#define HeSVKEY_force(he) (HeKEY(he) ? \ ((HeKLEN(he) == HEf_SVKEY) ? \ HeKEY_sv(he) : \ sv_2mortal(newSVpvn(HeKEY(he), \ HeKLEN(he)))) : \ &PL_sv_undef)#define HeSVKEY_set(he,sv) ((HeKLEN(he) = HEf_SVKEY), (HeKEY_sv(he) = sv))#define Nullhek Null(HEK*)#define HEK_BASESIZE STRUCT_OFFSET(HEK, hek_key[0])#define HEK_HASH(hek) (hek)->hek_hash#define HEK_LEN(hek) (hek)->hek_len#define HEK_KEY(hek) (hek)->hek_key#define HEK_FLAGS(hek) (*((unsigned char *)(HEK_KEY(hek))+HEK_LEN(hek)+1))#define HVhek_UTF8 0x01 /* Key is utf8 encoded. */#define HVhek_WASUTF8 0x02 /* Key is bytes here, but was supplied as utf8. */#define HVhek_REHASH 0x04 /* This key is in an hv using a custom HASH . */#define HVhek_UNSHARED 0x08 /* This key isn't a shared hash key. */#define HVhek_FREEKEY 0x100 /* Internal flag to say key is malloc()ed. */#define HVhek_PLACEHOLD 0x200 /* Internal flag to create placeholder. * (may change, but Storable is a core module) */#define HVhek_MASK 0xFF/* Which flags enable HvHASKFLAGS? Somewhat a hack on a hack, as HVhek_REHASH is only needed because the rehash flag has to be duplicated into all keys as hv_iternext has no access to the hash flags. At this point Storable's tests get upset, because sometimes hashes are "keyed" and sometimes not, depending on the order of data insertion, and whether it triggered rehashing. So currently HVhek_REHASH is exempt. Similarly UNSHARED*/ #define HVhek_ENABLEHVKFLAGS (HVhek_MASK & ~(HVhek_REHASH|HVhek_UNSHARED))#define HEK_UTF8(hek) (HEK_FLAGS(hek) & HVhek_UTF8)#define HEK_UTF8_on(hek) (HEK_FLAGS(hek) |= HVhek_UTF8)#define HEK_UTF8_off(hek) (HEK_FLAGS(hek) &= ~HVhek_UTF8)#define HEK_WASUTF8(hek) (HEK_FLAGS(hek) & HVhek_WASUTF8)#define HEK_WASUTF8_on(hek) (HEK_FLAGS(hek) |= HVhek_WASUTF8)#define HEK_WASUTF8_off(hek) (HEK_FLAGS(hek) &= ~HVhek_WASUTF8)#define HEK_REHASH(hek) (HEK_FLAGS(hek) & HVhek_REHASH)#define HEK_REHASH_on(hek) (HEK_FLAGS(hek) |= HVhek_REHASH)/* calculate HV array allocation */#ifndef PERL_USE_LARGE_HV_ALLOC/* Default to allocating the correct size - default to assuming that malloc() is not broken and is efficient at allocating blocks sized at powers-of-two.*/ # define PERL_HV_ARRAY_ALLOC_BYTES(size) ((size) * sizeof(HE*))#else# define MALLOC_OVERHEAD 16# define PERL_HV_ARRAY_ALLOC_BYTES(size) \ (((size) < 64) \ ? (size) * sizeof(HE*) \ : (size) * sizeof(HE*) * 2 - MALLOC_OVERHEAD)#endif/* Flags for hv_iternext_flags. */#define HV_ITERNEXT_WANTPLACEHOLDERS 0x01 /* Don't skip placeholders. */#define hv_iternext(hv) hv_iternext_flags(hv, 0)#define hv_magic(hv, gv, how) sv_magic((SV*)(hv), (SV*)(gv), how, NULL, 0)/* available as a function in hv.c */#define Perl_sharepvn(sv, len, hash) HEK_KEY(share_hek(sv, len, hash))#define sharepvn(sv, len, hash) Perl_sharepvn(sv, len, hash)#define share_hek_hek(hek) \ (++(((struct shared_he *)(((char *)hek) \ - STRUCT_OFFSET(struct shared_he, \ shared_he_hek))) \ ->shared_he_he.he_valu.hent_refcount), \ hek)#define hv_store_ent(zlonk, awk, touche, zgruppp) \ ((HE *) hv_common((zlonk), (awk), NULL, 0, 0, HV_FETCH_ISSTORE, \ (touche), (zgruppp)))#define hv_exists_ent(zlonk, awk, zgruppp) \ (hv_common((zlonk), (awk), NULL, 0, 0, HV_FETCH_ISEXISTS, 0, (zgruppp))\ ? TRUE : FALSE)#define hv_fetch_ent(zlonk, awk, touche, zgruppp) \ ((HE *) hv_common((zlonk), (awk), NULL, 0, 0, \ ((touche) ? HV_FETCH_LVALUE : 0), NULL, (zgruppp)))#define hv_delete_ent(zlonk, awk, touche, zgruppp) \ ((SV *) hv_common((zlonk), (awk), NULL, 0, 0, (touche) | HV_DELETE, \ NULL, (zgruppp)))#define hv_store_flags(urkk, zamm, clunk, thwape, sploosh, eee_yow) \ ((SV**) hv_common((urkk), NULL, (zamm), (clunk), (eee_yow), \ (HV_FETCH_ISSTORE|HV_FETCH_JUST_SV), (thwape), \ (sploosh)))#define hv_store(urkk, zamm, clunk, thwape, sploosh) \ ((SV**) hv_common_key_len((urkk), (zamm), (clunk), \ (HV_FETCH_ISSTORE|HV_FETCH_JUST_SV), \ (thwape), (sploosh)))#define hv_exists(urkk, zamm, clunk) \ (hv_common_key_len((urkk), (zamm), (clunk), HV_FETCH_ISEXISTS, NULL, 0) \ ? TRUE : FALSE)#define hv_fetch(urkk, zamm, clunk, pam) \ ((SV**) hv_common_key_len((urkk), (zamm), (clunk), (pam) \ ? (HV_FETCH_JUST_SV | HV_FETCH_LVALUE) \ : HV_FETCH_JUST_SV, NULL, 0))#define hv_delete(urkk, zamm, clunk, pam) \ ((SV*) hv_common_key_len((urkk), (zamm), (clunk), \ (pam) | HV_DELETE, NULL, 0))/* This refcounted he structure is used for storing the hints used for lexical pragmas. Without threads, it's basically struct he + refcount. With threads, life gets more complex as the structure needs to be shared between threads (because it hangs from OPs, which are shared), hence the alternate definition and mutex. */struct refcounted_he;#ifdef PERL_CORE/* Gosh. This really isn't a good name any longer. */struct refcounted_he { struct refcounted_he *refcounted_he_next; /* next entry in chain */#ifdef USE_ITHREADS U32 refcounted_he_hash; U32 refcounted_he_keylen;#else HEK *refcounted_he_hek; /* hint key */#endif union { IV refcounted_he_u_iv; UV refcounted_he_u_uv; STRLEN refcounted_he_u_len; void *refcounted_he_u_ptr; /* Might be useful in future */ } refcounted_he_val; U32 refcounted_he_refcnt; /* reference count */ /* First byte is flags. Then NUL-terminated value. Then for ithreads, non-NUL terminated key. */ char refcounted_he_data[1];};/* Flag bits are HVhek_UTF8, HVhek_WASUTF8, then */#define HVrhek_undef 0x00 /* Value is undef. */#define HVrhek_delete 0x10 /* Value is placeholder - signifies delete. */#define HVrhek_IV 0x20 /* Value is IV. */#define HVrhek_UV 0x30 /* Value is UV. */#define HVrhek_PV 0x40 /* Value is a (byte) string. */#define HVrhek_PV_UTF8 0x50 /* Value is a (utf8) string. *//* Two spare. As these have to live in the optree, you can't store anything interpreter specific, such as SVs. :-( */#define HVrhek_typemask 0x70#ifdef USE_ITHREADS/* A big expression to find the key offset */#define REF_HE_KEY(chain) \ ((((chain->refcounted_he_data[0] & 0x60) == 0x40) \ ? chain->refcounted_he_val.refcounted_he_u_len + 1 : 0) \ + 1 + chain->refcounted_he_data)#endif# ifdef USE_ITHREADS# define HINTS_REFCNT_LOCK MUTEX_LOCK(&PL_hints_mutex)# define HINTS_REFCNT_UNLOCK MUTEX_UNLOCK(&PL_hints_mutex)# else# define HINTS_REFCNT_LOCK NOOP# define HINTS_REFCNT_UNLOCK NOOP# endif#endif#ifdef USE_ITHREADS# define HINTS_REFCNT_INIT MUTEX_INIT(&PL_hints_mutex)# define HINTS_REFCNT_TERM MUTEX_DESTROY(&PL_hints_mutex)#else# define HINTS_REFCNT_INIT NOOP# define HINTS_REFCNT_TERM NOOP#endif/* Hash actions * Passed in PERL_MAGIC_uvar calls */#define HV_DISABLE_UVAR_XKEY 0x01/* We need to ensure that these don't clash with G_DISCARD, which is 2, as it is documented as being passed to hv_delete(). */#define HV_FETCH_ISSTORE 0x04#define HV_FETCH_ISEXISTS 0x08#define HV_FETCH_LVALUE 0x10#define HV_FETCH_JUST_SV 0x20#define HV_DELETE 0x40/* * Local variables: * c-indentation-style: bsd * c-basic-offset: 4 * indent-tabs-mode: t * End: * * ex: set ts=8 sts=4 sw=4 noet: */
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -