a9ddb52ad4
Phase 1 完了：環境変数整理 + fprintf デバッグガード ENV変数削除（BG/HotMag系）: - core/hakmem_tiny_init.inc: HotMag ENV 削除 (~131 lines) - core/hakmem_tiny_bg_spill.c: BG spill ENV 削除 - core/tiny_refill.h: BG remote 固定値化 - core/hakmem_tiny_slow.inc: BG refs 削除 fprintf Debug Guards (#if !HAKMEM_BUILD_RELEASE): - core/hakmem_shared_pool.c: Lock stats (~18 fprintf) - core/page_arena.c: Init/Shutdown/Stats (~27 fprintf) - core/hakmem.c: SIGSEGV init message ドキュメント整理: - 328 markdown files 削除（旧レポート・重複docs） 性能確認: - Larson: 52.35M ops/s (前回52.8M、安定動作✅) - ENV整理による機能影響なし - Debug出力は一部残存（次phase で対応） 🤖 Generated with Claude Code Co-Authored-By: Claude <noreply@anthropic.com>
63 lines
2.8 KiB
C
63 lines
2.8 KiB
C
// tiny_ready.h - Ready List box (per-class, slab-entry hints)
|
||
// Purpose: O(1)-ish adopt candidate discovery to bypass deep scans in refill.
|
||
// Design: Lock-free ring of encoded slab entries (ss+slab_idx). Best-effort hints.
|
||
// Boundary:
|
||
// - Producer: publish境界（ss_partial_publish）/ remote初入荷 / first-free（prev==NULL）で push
|
||
// - Consumer: refill境界（tiny_refill_try_fast の最初）で pop→owner取得→bind
|
||
// Runtime ENV toggle removed: Ready ring is always enabled (fixed behavior)
|
||
|
||
#pragma once
|
||
#include <stdatomic.h>
|
||
#include <stdint.h>
|
||
#include "hakmem_tiny.h"
|
||
|
||
#ifndef TINY_READY_RING
|
||
#define TINY_READY_RING 128
|
||
#endif
|
||
|
||
// Per-class ring buffer of encoded slab entries
|
||
static _Atomic(uintptr_t) g_ready_ring[TINY_NUM_CLASSES][TINY_READY_RING];
|
||
static _Atomic(uint32_t) g_ready_rr[TINY_NUM_CLASSES];
|
||
|
||
static inline int tiny_ready_enabled(void) { return 1; }
|
||
|
||
// Optional: limit scan width (ENV toggle removed; width is fixed to TINY_READY_RING)
|
||
static inline int tiny_ready_width(void) { return TINY_READY_RING; }
|
||
|
||
// Encode helpers are declared in main TU; forward here
|
||
static inline uintptr_t slab_entry_make(SuperSlab* ss, int slab_idx);
|
||
static inline SuperSlab* slab_entry_ss(uintptr_t ent);
|
||
static inline int slab_entry_idx(uintptr_t ent);
|
||
|
||
// Push: best-effort, tries a few slots, drops on contention (hint-only)
|
||
static inline void tiny_ready_push(int class_idx, SuperSlab* ss, int slab_idx) {
|
||
if (!tiny_ready_enabled()) return;
|
||
if (__builtin_expect(class_idx < 0 || class_idx >= TINY_NUM_CLASSES, 0)) return;
|
||
if (__builtin_expect(ss == NULL || slab_idx < 0 || slab_idx >= ss_slabs_capacity(ss), 0)) return;
|
||
|
||
uintptr_t ent = slab_entry_make(ss, slab_idx);
|
||
uint32_t start = atomic_fetch_add_explicit(&g_ready_rr[class_idx], 1u, memory_order_relaxed);
|
||
// Try up to 4 slots to reduce collisions
|
||
for (int k = 0; k < 4; k++) {
|
||
uint32_t idx = (start + (uint32_t)k) % (uint32_t)TINY_READY_RING;
|
||
uintptr_t expected = 0;
|
||
if (atomic_compare_exchange_weak_explicit(&g_ready_ring[class_idx][idx], &expected, ent,
|
||
memory_order_release, memory_order_relaxed)) {
|
||
return;
|
||
}
|
||
}
|
||
// Drop if all tried slots were busy (hint ring, loss is acceptable)
|
||
}
|
||
|
||
// Pop any entry; scans ring once (only on refill miss, not on hot path)
|
||
static inline uintptr_t tiny_ready_pop(int class_idx) {
|
||
if (!tiny_ready_enabled()) return (uintptr_t)0;
|
||
if (__builtin_expect(class_idx < 0 || class_idx >= TINY_NUM_CLASSES, 0)) return (uintptr_t)0;
|
||
int scan = tiny_ready_width();
|
||
for (int i = 0; i < scan; i++) {
|
||
uintptr_t ent = atomic_exchange_explicit(&g_ready_ring[class_idx][i], (uintptr_t)0, memory_order_acq_rel);
|
||
if (ent) return ent;
|
||
}
|
||
return (uintptr_t)0;
|
||
}
|