ptrdiff_t i;
struct Lisp_Hash_Table *h = XHASH_TABLE(jmp_table);
-#ifdef BYTE_CODE_SAFE
- /* Hash tables for switch are declared with :size set to exact
- number of cases, so this should always be true. */
- eassert (HASH_TABLE_SIZE (h) == h->count);
-#endif
-
if (h->count <= 5)
{ /* Do a linear search if there are not many cases
FIXME: 5 is arbitrarily chosen. */
#ifdef BYTE_CODE_SAFE
eassert (!NILP (HASH_HASH (h, i)));
#endif
+ /* Hash tables for switch are declared with :size set to the
+ exact number of cases, thus
+ HASH_TABLE_SIZE (h) == h->count. */
+
if ((EQ (v1, HASH_KEY (h, i)) ||
(h->test.cmpfn &&
h->test.cmpfn (&h->test, v1, HASH_KEY (h, i)))))