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-run.h | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'core/module-run.h') diff --git a/core/module-run.h b/core/module-run.h index c0d6c41..c56e7b1 100644 --- a/core/module-run.h +++ b/core/module-run.h @@ -108,8 +108,8 @@ extern const size_t pure_list_layout[]; /* A packed list's index (docs/design/022), where its keys are whole: the * first position of each bucket (u32), whether the keys are whole, the * buckets' width as a shift, the first bucket's start, the first key and - * the last (i64). */ -enum { PACK_FIRST_AT, PACK_WHOLE_AT, PACK_SHIFT_AT, PACK_ORIGIN_AT, PACK_LOW_AT, PACK_HIGH_AT }; + * the last (i64), and how many buckets (size_t). */ +enum { PACK_FIRST_AT, PACK_WHOLE_AT, PACK_SHIFT_AT, PACK_ORIGIN_AT, PACK_LOW_AT, PACK_HIGH_AT, PACK_BUCKETS_AT }; extern const size_t pure_pack_layout[]; /* A module's code compiled (AArch64 Linux; elsewhere, or with PURE_JIT=0 in -- cgit v1.2.3