New feature: virtual map trie-based suffix matching

This introduces a trie-based suffix matching feature using nested virtual maps (vmaps) for hierarchical string matching, improves hashing functions by reducing memory and performance overhead, and refactors token allocation to use a slab allocator for safer and more efficient memory handling. Key highlights include new trie APIs for insertion, querying, and deletion, optimized hash functions with chunked processing and inline conversions, enhanced tokenization with stricter validation, and updates to tests to align with these changes. Additionally, the commits include opportunistic refactors of vmap modularity, memory management standardization, and code alignment with kernel memory practices, ensuring better maintainability, performance, and resource safety for eBPF programs.