From fccde3d57f9eafaf9d91edd666fe8128e619a4e5 Mon Sep 17 00:00:00 2001 From: eunhhu Date: Mon, 5 Oct 2026 10:52:22 +0100 Subject: Read a slice's bucket and first cell some rounds ahead of the loop that opens it, read an item and find it in key bits as one, branch back once a round: BFS core 19.6 to 14.9 ms (022) --- core/module-list.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'core/module-list.c') diff --git a/core/module-list.c b/core/module-list.c index 7a1e08b..fb6fff6 100644 --- a/core/module-list.c +++ b/core/module-list.c @@ -1492,7 +1492,7 @@ const size_t pure_list_layout[] = { const size_t pure_pack_layout[] = { [PACK_FIRST_AT] = offsetof(Pack, first), [PACK_WHOLE_AT] = offsetof(Pack, whole), [PACK_SHIFT_AT] = offsetof(Pack, shift), [PACK_ORIGIN_AT] = offsetof(Pack, origin_whole), [PACK_LOW_AT] = offsetof(Pack, low_whole), - [PACK_HIGH_AT] = offsetof(Pack, high_whole)}; + [PACK_HIGH_AT] = offsetof(Pack, high_whole), [PACK_BUCKETS_AT] = offsetof(Pack, buckets)}; bool pure_list_lookup(const PureList *list, unsigned key_field, PureCell key, unsigned field, PureCell *cell) { bool found; -- cgit v1.2.3