Files
hakmem/core/hakmem_shared_pool.h
Moe Charm (CI) 9830237d56 Phase 12: SP-SLOT Box data structures (Task SP-1)
Added per-slot state management for Shared SuperSlab Pool optimization.

Problem:
- Current: 1 SuperSlab mixes multiple classes (C0-C7)
- SuperSlab freed only when ALL classes empty (active_slabs==0)
- Result: SuperSlabs rarely freed, LRU cache unused

Solution: SP-SLOT Box
- Track each slab slot state: UNUSED/ACTIVE/EMPTY
- Per-class free slot lists for efficient reuse
- Free SuperSlab only when ALL slots empty

New Structures:
1. SlotState enum - Per-slot state (UNUSED/ACTIVE/EMPTY)
2. SharedSlot - Per-slot metadata (state, class_idx, slab_idx)
3. SharedSSMeta - Per-SuperSlab slot array management
4. FreeSlotList - Per-class free slot lists

Extended SharedSuperSlabPool:
- free_slots[TINY_NUM_CLASSES_SS] - Per-class lists
- ss_metadata[] - SuperSlab metadata array

Next Steps:
- Task SP-2: Implement 3-stage acquire_slab logic
- Task SP-3: Convert release_slab to slot-based
- Expected: Significant mmap/munmap reduction

🤖 Generated with [Claude Code](https://claude.com/claude-code)

Co-Authored-By: Claude <noreply@anthropic.com>
2025-11-14 07:59:33 +09:00

123 lines
4.5 KiB
C

#pragma once
#include <stdint.h>
#include <pthread.h>
#include <stdatomic.h>
#include "superslab/superslab_types.h"
// Shared SuperSlab Pool (Phase 12-2 skeleton)
// Multiple tiny size classes share a global set of SuperSlab instances.
// This header exposes the minimal API used by refill/free hot paths in Phase 12.
#ifdef __cplusplus
extern "C" {
#endif
// ============================================================================
// Phase 12: SP-SLOT Box - Per-Slot State Management
// ============================================================================
//
// Problem:
// - Current design: 1 SuperSlab mixes multiple classes (C0-C7)
// - SuperSlab freed only when ALL classes empty (active_slabs==0)
// - Result: SuperSlabs rarely freed, LRU cache unused
//
// Solution:
// - Track each slab slot's state individually (UNUSED/ACTIVE/EMPTY)
// - Maintain per-class free slot lists for reuse
// - Free SuperSlab only when ALL slots empty
//
// Benefits:
// - Empty slabs from one class can be reused by same class immediately
// - Reduces mmap/munmap churn significantly
// - Enables LRU cache for fully empty SuperSlabs
// Slot state for each (SuperSlab, slab_idx) pair
typedef enum {
SLOT_UNUSED = 0, // Never used yet
SLOT_ACTIVE, // Assigned to a class (meta->used > 0 or freelist non-empty)
SLOT_EMPTY // Was assigned, now empty (meta->used==0, remote==0)
} SlotState;
// Per-slot metadata
typedef struct {
SlotState state;
uint8_t class_idx; // Valid when state != SLOT_UNUSED (0-7)
uint8_t slab_idx; // SuperSlab-internal index (0-31)
} SharedSlot;
// Per-SuperSlab metadata for slot management
#define MAX_SLOTS_PER_SS 32 // Typical: 1MB SS has 32 slabs of 32KB each
typedef struct SharedSSMeta {
SuperSlab* ss; // Physical SuperSlab pointer
SharedSlot slots[MAX_SLOTS_PER_SS]; // Slot state for each slab
uint8_t active_slots; // Number of SLOT_ACTIVE slots
uint8_t total_slots; // Total available slots (from ss_slabs_capacity)
struct SharedSSMeta* next; // For free list linking
} SharedSSMeta;
// Free slot entry for per-class reuse lists
typedef struct {
SharedSSMeta* meta; // Which SuperSlab metadata
uint8_t slot_idx; // Which slot within that SuperSlab
} FreeSlotEntry;
// Per-class free slot list (max capacity for now: 256 entries per class)
#define MAX_FREE_SLOTS_PER_CLASS 256
typedef struct {
FreeSlotEntry entries[MAX_FREE_SLOTS_PER_CLASS];
uint32_t count; // Number of free slots available
} FreeSlotList;
typedef struct SharedSuperSlabPool {
SuperSlab** slabs; // Dynamic array of SuperSlab*
uint32_t capacity; // Allocated entries in slabs[]
uint32_t total_count; // Total SuperSlabs ever allocated (<= capacity)
uint32_t active_count; // SuperSlabs that have >0 active slabs
pthread_mutex_t alloc_lock; // Protects pool metadata and grow/scan operations
// Per-class hints: last known SuperSlab with a free slab for that class.
// Read lock-free (best-effort), updated under alloc_lock.
SuperSlab* class_hints[TINY_NUM_CLASSES_SS];
// LRU cache integration hooks (Phase 9/12, optional for now)
SuperSlab* lru_head;
SuperSlab* lru_tail;
uint32_t lru_count;
// ========== Phase 12: SP-SLOT Management ==========
// Per-class free slot lists for efficient reuse
FreeSlotList free_slots[TINY_NUM_CLASSES_SS];
// SharedSSMeta array for all SuperSlabs in pool
SharedSSMeta* ss_metadata; // Dynamic array
uint32_t ss_meta_capacity; // Allocated entries
uint32_t ss_meta_count; // Used entries
} SharedSuperSlabPool;
// Global singleton
extern SharedSuperSlabPool g_shared_pool;
// Initialize shared pool (idempotent, thread-safe wrt multiple callers on startup paths)
void shared_pool_init(void);
// Get/allocate a SuperSlab registered in the pool.
// Returns non-NULL on success, NULL on failure.
SuperSlab* shared_pool_acquire_superslab(void);
// Acquire a slab for class_idx from shared pool.
// On success:
// *ss_out = SuperSlab containing slab
// *slab_idx_out = slab index [0, SLABS_PER_SUPERSLAB_MAX)
// Returns 0 on success, non-zero on failure.
int shared_pool_acquire_slab(int class_idx, SuperSlab** ss_out, int* slab_idx_out);
// Release an empty slab back to pool (mark as unassigned).
// Caller must ensure TinySlabMeta.used == 0.
void shared_pool_release_slab(SuperSlab* ss, int slab_idx);
#ifdef __cplusplus
}
#endif