summaryrefslogtreecommitdiff
path: root/hv.h
diff options
context:
space:
mode:
authorNicholas Clark <nick@ccl4.org>2021-07-31 10:01:54 +0000
committerNicholas Clark <nick@ccl4.org>2021-10-11 11:30:25 +0000
commit15b39af41614cf0fa1a6931a63dba1bbbcd2c2b5 (patch)
treed2a3d73531b2376081a0dfcbf111505d41c6970d /hv.h
parent0095ebd8b96d81e41d1fa374c2d31b189d2dee9e (diff)
downloadperl-15b39af41614cf0fa1a6931a63dba1bbbcd2c2b5.tar.gz
Delete the do_aux code from S_hsplit()
This existed to handle automatically allocating an "aux" structure for larger hashes, to save a (large) reallocation if they needed to be iterated. Now that we no longer store the aux structure in the main hash array, we don't need to take this precaution.
Diffstat (limited to 'hv.h')
-rw-r--r--hv.h12
1 files changed, 0 insertions, 12 deletions
diff --git a/hv.h b/hv.h
index b12fe0c27d..285a004a5f 100644
--- a/hv.h
+++ b/hv.h
@@ -243,18 +243,6 @@ C<SV*>.
#define PERL_HASH_DEFAULT_HvMAX 7
-/* During hsplit(), if HvMAX(hv)+1 (the new bucket count) is >= this value,
- * we preallocate the HvAUX() struct.
- * The assumption being that we are using so much space anyway we might
- * as well allocate the extra bytes and speed up later keys()
- * or each() operations. We don't do this to small hashes as we assume
- * that a) it will be easy/fast to resize them to add the iterator, and b) that
- * many of them will be objects which won't be traversed. Larger hashes however
- * will take longer to extend, and the size of the aux struct is swamped by the
- * overall length of the bucket array.
- * */
-#define PERL_HV_ALLOC_AUX_SIZE (1 << 9)
-
/* these hash entry flags ride on hent_klen (for use only in magic/tied HVs) */
#define HEf_SVKEY -2 /* hent_key is an SV* */