diff options
| author | Vibhav Pant <vibhavp@gmail.com> | 2017-02-09 18:43:31 +0530 |
|---|---|---|
| committer | Vibhav Pant <vibhavp@gmail.com> | 2017-02-09 18:43:31 +0530 |
| commit | 3189f954ebdf739831a40e1b336505da60ea66c6 (patch) | |
| tree | 0c4d55a8976b40371dee69d55e5ee66fec1b0086 /src/bytecode.c | |
| parent | dde800c8c9ea198996229d03df1fc45c7d057339 (diff) | |
| download | emacs-3189f954ebdf739831a40e1b336505da60ea66c6.tar.gz | |
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.
Diffstat (limited to 'src/bytecode.c')
| -rw-r--r-- | src/bytecode.c | 6 |
1 files 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))))) { |