From 3189f954ebdf739831a40e1b336505da60ea66c6 Mon Sep 17 00:00:00 2001 From: Vibhav Pant Date: Thu, 9 Feb 2017 18:43:31 +0530 Subject: [PATCH] bytecode.c (exec_byte_code): don't check hash code in linear search. * src/bytecode.c (exec_byte_code): Don't check that the hash code is not nil when linear scanning the jump table. Hash tables for are declared with :size as the exact number of cases, so each entry i should have a hash code. When BYTE_CODE_SAFE, do it as a sanity check. --- src/bytecode.c | 6 ++++-- 1 file changed, 4 insertions(+), 2 deletions(-) diff --git a/src/bytecode.c b/src/bytecode.c index 9bb7bd4e685..fb10a6d6914 100644 --- a/src/bytecode.c +++ b/src/bytecode.c @@ -1430,8 +1430,10 @@ exec_byte_code (Lisp_Object bytestr, Lisp_Object vector, Lisp_Object maxdepth, FIXME: 5 is arbitrarily chosen. */ for (i = 0; i < HASH_TABLE_SIZE (h); i++) { - if (!NILP (HASH_HASH (h, i)) && - (EQ (v1, HASH_KEY (h, i)) || +#ifdef BYTE_CODE_SAFE + eassert (!NILP (HASH_HASH (h, i))); +#endif + if ((EQ (v1, HASH_KEY (h, i)) || (h->test.cmpfn && h->test.cmpfn (&h->test, v1, HASH_KEY (h, i))))) { -- 2.39.2