Comprehensive legacy cleanup and architecture consolidation
Summary of Changes: MOVED TO ARCHIVE: - core/hakmem_tiny_legacy_slow_box.inc → archive/ * Slow path legacy code preserved for reference * Superseded by Gatekeeper Box architecture - core/superslab_allocate.c → archive/superslab_allocate_legacy.c * Legacy SuperSlab allocation implementation * Functionality integrated into new Box system - core/superslab_head.c → archive/superslab_head_legacy.c * Legacy slab head management * Refactored through Box architecture REMOVED DEAD CODE: - Eliminated unused allocation policy variants from ss_allocation_box.c * Reduced from 127+ lines of conditional logic to focused implementation * Removed: old policy branches, unused allocation strategies * Kept: current Box-based allocation path ADDED NEW INFRASTRUCTURE: - core/superslab_head_stub.c (41 lines) * Minimal stub for backward compatibility * Delegates to new architecture - Enhanced core/superslab_cache.c (75 lines added) * Added missing API functions for cache management * Proper interface for SuperSlab cache integration REFACTORED CORE SYSTEMS: - core/hakmem_super_registry.c * Moved registration logic from scattered locations * Centralized SuperSlab registry management - core/hakmem_tiny.c * Removed 27 lines of redundant initialization * Simplified through Box architecture - core/hakmem_tiny_alloc.inc * Streamlined allocation path to use Gatekeeper * Removed legacy decision logic - core/box/ss_allocation_box.c/h * Dramatically simplified allocation policy * Removed conditional branches for unused strategies * Focused on current Box-based approach BUILD SYSTEM: - Updated Makefile for archive structure - Removed obsolete object file references - Maintained build compatibility SAFETY & TESTING: - All deletions verified: no broken references - Build verification: RELEASE=0 and RELEASE=1 pass - Smoke tests: 100% pass rate - Functional verification: allocation/free intact Architecture Consolidation: Before: Multiple overlapping allocation paths with legacy code branches After: Single unified path through Gatekeeper Boxes with clear architecture Benefits: - Reduced code size and complexity - Improved maintainability - Single source of truth for allocation logic - Better diagnostic/observability hooks - Foundation for future optimizations 🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude <noreply@anthropic.com>
This commit is contained in:
@ -119,9 +119,10 @@ static inline void ptr_trace_dump_now(const char* reason) { (void)reason; }
|
||||
g_tiny_next_tag = (tag); \
|
||||
g_tiny_next_file = __FILE__; \
|
||||
g_tiny_next_line = __LINE__; \
|
||||
/* Use only depth-0 return address; deeper frames are unsafe. */ \
|
||||
g_tiny_next_ra0 = __builtin_return_address(0); \
|
||||
g_tiny_next_ra1 = __builtin_return_address(1); \
|
||||
g_tiny_next_ra2 = __builtin_return_address(2); \
|
||||
g_tiny_next_ra1 = NULL; \
|
||||
g_tiny_next_ra2 = NULL; \
|
||||
(void)(off); \
|
||||
tiny_next_write((cls), (node), (value)); \
|
||||
ptr_trace_record((tag), (cls), (node), (value), (size_t)(off)); \
|
||||
@ -145,9 +146,10 @@ static inline void ptr_trace_dump_now(const char* reason) { (void)reason; }
|
||||
g_tiny_next_tag = (tag); \
|
||||
g_tiny_next_file = __FILE__; \
|
||||
g_tiny_next_line = __LINE__; \
|
||||
/* Depth-0 return address only; avoid unsafe frame walks. */ \
|
||||
g_tiny_next_ra0 = __builtin_return_address(0); \
|
||||
g_tiny_next_ra1 = __builtin_return_address(1); \
|
||||
g_tiny_next_ra2 = __builtin_return_address(2); \
|
||||
g_tiny_next_ra1 = NULL; \
|
||||
g_tiny_next_ra2 = NULL; \
|
||||
(void)(tag); (void)(off); \
|
||||
tiny_next_write((cls), (node), (value)); \
|
||||
} while (0)
|
||||
|
||||
Reference in New Issue
Block a user