feat 新的运行时环境

runtime/libutils/cbuild.toml

@@ -0,0 +1,7 @@
+[package]
+name = "libutils"
+version = "0.1.0"
+
+dependencies = [
+    { name = "core", path = "../libcore" }
+]

runtime/libutils/include/hashtable.h

@@ -0,0 +1,123 @@
+/**
+ * @file hashtable.h
+ * @brief 开放寻址法哈希表实现
+ * 
+ * 提供基于向量容器的哈希表实现，支持动态扩容和墓碑机制
+ */
+
+#ifndef __SMCC_HASHTABLE_H__
+#define __SMCC_HASHTABLE_H__
+
+#include <libcore.h>
+#include "vector.h"
+
+/**
+ * @enum ht_entry_state_t
+ * @brief 哈希表条目状态标识
+ */
+typedef enum hash_table_entry_state {
+    ENTRY_EMPTY,    /**< 空槽位（从未使用过） */
+    ENTRY_ACTIVE,   /**< 有效条目（包含键值对） */
+    ENTRY_TOMBSTONE /**< 墓碑标记（已删除条目） */
+} ht_entry_state_t;
+
+/**
+ * @struct hash_entry_t
+ * @brief 哈希表条目结构
+ * 
+ * @note key/value内存由调用者管理，哈希表不负责其生命周期
+ */
+typedef struct hash_entry {
+    const void* key;        /**< 键指针（不可变） */
+    void* value;            /**< 值指针 */
+    u32 hash;            /**< 预计算的哈希值（避免重复计算） */
+    ht_entry_state_t state; /**< 当前条目状态 */
+} hash_entry_t;
+
+/**
+ * @struct hash_table_t
+ * @brief 哈希表主体结构
+ * 
+ * 使用开放寻址法实现，采用墓碑标记处理删除操作
+ */
+typedef struct hash_table {
+    VECTOR_HEADER(entries, hash_entry_t);  /**< 条目存储容器 */
+    u32 count;           /**< 有效条目数量（不含墓碑） */
+    u32 tombstone_count; /**< 墓碑条目数量 */
+    /**
+     * @brief 哈希函数指针
+     * @param key 键指针
+     * @return 32位无符号哈希值
+     */
+    u32 (*hash_func)(const void* key);
+    /**
+     * @brief 键比较函数指针
+     * @param key1 第一个键指针
+     * @param key2 第二个键指针
+     * @return 相同返回0，不同返回非0
+     */
+    int(*key_cmp)(const void* key1, const void* key2);
+} hash_table_t;
+
+/**
+ * @brief 初始化哈希表结构
+ * @param ht 哈希表实例指针
+ * 
+ * @warning 必须设置hash_func和key_cmp后才能使用
+ */
+void init_hashtable(hash_table_t* ht);
+
+/**
+ * @brief 插入/更新键值对
+ * @param ht 哈希表实例指针
+ * @param key 键指针
+ * @param value 值指针
+ * @return 被替换的旧值指针（无替换返回NULL）
+ */
+void* hashtable_set(hash_table_t* ht, const void* key, void* value);
+
+/**
+ * @brief 查找键对应值
+ * @param ht 哈希表实例指针
+ * @param key 查找键指针
+ * @return 找到返回值指针，未找到返回NULL
+ */
+void* hashtable_get(hash_table_t* ht, const void* key);
+
+/**
+ * @brief 删除键值对
+ * @param ht 哈希表实例指针
+ * @param key 要删除的键指针
+ * @return 被删除的值指针（不存在返回NULL）
+ * 
+ * @note 实际采用墓碑标记方式删除
+ */
+void* hashtable_del(hash_table_t* ht, const void* key);
+
+/**
+ * @brief 销毁哈希表
+ * @param ht 哈希表实例指针
+ * 
+ * @note 仅释放哈希表内部内存，不会释放key/value内存
+ */
+void hashtable_destory(hash_table_t* ht);
+
+/**
+ * @typedef hash_table_iter_func
+ * @brief 哈希表迭代回调函数类型
+ * @param key 当前键指针
+ * @param value 当前值指针
+ * @param context 用户上下文指针
+ * @return 返回非0停止迭代
+ */
+typedef int (*hash_table_iter_func)(const void* key, void* value, void* context);
+
+/**
+ * @brief 遍历哈希表所有有效条目
+ * @param ht 哈希表实例指针
+ * @param iter_func 迭代回调函数
+ * @param context 用户上下文指针
+ */
+void hashtable_foreach(hash_table_t* ht, hash_table_iter_func iter_func, void* context);
+
+#endif // __SMCC_HASHTABLE_H__

runtime/libutils/include/kllist.h

@@ -0,0 +1,158 @@
+/**
+ * kllist.h is a list implement by linux kernel list
+ * @link https://njusecourse.feishu.cn/wiki/I8vkw2zkwiEInUkujTJc7zzOnwf
+ * @link https://kernelnewlbies.org/FAQ/LinkedLists
+ * @link https://lwn.net/Articles/887097/
+ * @link https://liuluheng.github.io/wiki/public_html/Embedded-System/kernel/list-and-hlist.html
+ */
+
+#ifndef __KLLIST_H__
+#define __KLLIST_H__
+
+#ifndef NULL
+#define NULL (0)
+#define __NULL_KLIST_DEFINED__
+#endif
+
+#ifndef container_of
+// Magic: https://radek.io/posts/magical-container_of-macro/
+// StackOverflow: https://stackoverflow.com/q/15832301/1833118
+#ifdef __GNUC__
+#define container_of(ptr, type, member) ({                      \
+        const typeof( ((type *)0)->member ) *__mptr = (ptr);    \
+        (type *)( (char *)__mptr - offsetof(type,member) );})
+#else
+#define container_of(ptr, type, member) ({                      \
+        const void *__mptr = (ptr);    \
+        (type *)( (char *)__mptr - offsetof(type,member) );})
+#endif
+#endif
+
+/**
+ * used by list
+ */
+struct list_head {
+    struct list_head *next, *prev;
+};
+
+/**
+ * list init
+ * @example 
+ * 1. struct list_head your_list = LIST_HEAD_INIT(your_list);
+ * 2. struct list_head your_list; INIT_LIST_HEAD(&your_list);
+ * 3. LIST_HEAD(your_list); => struct your_list = { &(your_list), &(your_list) };
+ */
+
+#define LIST_HEAD_INIT(name) { &(name), &(name) }
+static inline void INIT_LIST_HEAD(struct list_head *list) {
+    list->next = list;
+    list->prev = list;
+}
+#define LIST_HEAD(name) \
+    struct list_head name = LIST_HEAD_INIT(name)
+
+/**
+ * list add
+ */
+
+static inline void __list_add(struct list_head *newl,
+                              struct list_head *prev,
+                              struct list_head *next) {
+    next->prev = newl;
+    newl->next = next;
+    newl->prev = prev;
+    prev->next = newl;
+}
+
+static inline void list_add(struct list_head *newl, struct list_head *head) {
+    __list_add(newl, head, head->next);
+}
+
+static inline void list_add_tail(struct list_head *newl, struct list_head *head) {
+    __list_add(newl, head->prev, head);
+}
+
+/**
+ * list delete
+ */
+
+static inline void __list_del(struct list_head * prev, struct list_head * next) {
+    next->prev = prev;
+    prev->next = next;
+}
+
+static inline void list_del(struct list_head *entry) {
+    __list_del(entry->prev, entry->next);
+    entry->next = NULL;
+	entry->prev = NULL;
+}
+
+/**
+ * list_is_first -- tests whether @list is the first entry in list @head
+ * @list: the entry to test
+ * @head: the head of the list
+ */
+static inline int list_is_first(const struct list_head *list, const struct list_head *head) {
+	return list->prev == head;
+}
+
+/**
+ * list_is_last - tests whether @list is the last entry in list @head
+ * @list: the entry to test
+ * @head: the head of the list
+ */
+static inline int list_is_last(const struct list_head *list, const struct list_head *head) {
+	return list->next == head;
+}
+
+/**
+ * list_is_head - tests whether @list is the list @head
+ * @list: the entry to test
+ * @head: the head of the list
+ */
+static inline int list_is_head(const struct list_head *list, const struct list_head *head) {
+	return list == head;
+}
+
+/**
+ * list_empty - tests whether a list is empty
+ * @head: the list to test.
+ */
+static inline int list_empty(const struct list_head *head) {
+	return head->next == head;
+}
+
+/**
+ * list_for_each	-	iterate over a list
+ * @pos:	the &struct list_head to use as a loop cursor.
+ * @head:	the head for your list.
+ */
+#define list_for_each(pos, head) \
+	for (pos = (head)->next; !list_is_head(pos, (head)); pos = pos->next)
+
+/**
+ * list_for_each_prev	-	iterate over a list backwards
+ * @pos:	the &struct list_head to use as a loop cursor.
+ * @head:	the head for your list.
+ */
+#define list_for_each_prev(pos, head) \
+	for (pos = (head)->prev; !list_is_head(pos, (head)); pos = pos->prev)
+
+/**
+ * list sort
+ *   by linux kernel 6.3.1 /lib/list_sort.c
+ *     it remain use sigle linked list to merge sort
+ * @link https://www.geeksforgeeks.org/merge-sort-for-linked-list/
+ */
+
+#ifdef HAVE_KLIST_SORT
+typedef int (*list_cmp_func_t)(void *,
+	const struct list_head *, const struct list_head *);
+static void list_sort(void *priv, struct list_head *head, list_cmp_func_t cmp);
+#endif
+
+#if defined(__NULL_KLIST_DEFINED__) && !defined(__NULL_KLIST_DEFINED_NOMOVE__)
+#undef NULL
+#endif
+
+#endif

runtime/libutils/include/libutils.h

@@ -0,0 +1,11 @@
+#ifndef __SMCC_UTILS_H__
+#define __SMCC_UTILS_H__ 
+
+#include <libcore.h>
+#include "vector.h"
+#include "kllist.h"
+#include "hashtable.h"
+#include "string.h"
+#include "strpool.h"
+
+#endif // __SMCC_UTILS_H__

runtime/libutils/include/strpool.h

@@ -0,0 +1,51 @@
+/**
+ * @file strpool.h
+ * @brief 字符串池实现
+ * 
+ * 提供字符串驻留（String Interning）功能，保证相同字符串的唯一性存储
+ */
+
+#ifndef __SMCC_STRPOOL_H__
+#define __SMCC_STRPOOL_H__
+
+#include <libcore.h>
+#include "hashtable.h"
+#include "string.h"
+
+/**
+ * @struct strpool_t
+ * @brief 字符串池上下文
+ * 
+ * 组合哈希表和专用内存分配器实现的高效字符串存储池
+ */
+typedef struct strpool {
+    hash_table_t ht;       /**< 哈希表用于快速查找已存储字符串 */
+} strpool_t;
+
+/**
+ * @brief 初始化字符串池
+ * @param pool 字符串池实例指针
+ */
+void init_strpool(strpool_t* pool);
+
+/**
+ * @brief 驻留字符串到池中
+ * @param pool 字符串池实例指针
+ * @param str 要驻留的 C 字符串
+ * @return 池中唯一字符串的持久指针
+ * 
+ * @note 返回值生命周期与字符串池一致
+ * @note 重复插入相同字符串会返回已有指针
+ */
+const char* strpool_intern(strpool_t* pool, const char* str);
+
+/**
+ * @brief 销毁字符串池
+ * @param pool 字符串池实例指针
+ * 
+ * @warning 销毁后已获取的字符串指针将失效
+ * @note 会自动释放所有驻留字符串内存
+ */
+void strpool_destroy(strpool_t* pool);
+
+#endif // __SMCC_STRPOOL_H__

runtime/libutils/include/vector.h

@@ -0,0 +1,119 @@
+/**
+ * @file vector.h
+ * @brief 动态数组（Vector）实现
+ * 
+ * 提供类型安全的动态数组容器实现，支持自动扩容和基本操作
+ */
+
+#ifndef __SMCC_DS_VECTOR_H__
+#define __SMCC_DS_VECTOR_H__
+
+#include <libcore.h>
+
+#define __vec_realloc   smcc_realloc
+#define __vec_free      smcc_free
+
+/** @defgroup vector_struct 数据结构定义 */
+
+/**
+ * @def VECTOR_HEADER(name, type)
+ * @brief 声明向量结构体
+ * @param name 结构体变量名
+ * @param type 存储的数据类型
+ * 
+ * 生成包含size/cap/data三个字段的结构体定义：
+ * - size: 当前元素数量
+ * - cap: 数组容量
+ * - data: 存储数组指针
+ */
+#define VECTOR_HEADER(name, type) \
+    struct { \
+        isize size;   /**< 当前元素数量 */ \
+        isize cap;    /**< 数组容量 */ \
+        type *data;       /**< 数据存储指针 */ \
+    } name
+
+/** @defgroup vector_operations 向量操作宏 */
+
+/**
+ * @def vector_init(vec)
+ * @brief 初始化向量结构体
+ * @param vec 要初始化的向量结构体变量
+ * 
+ * @note 此宏不会分配内存，仅做零初始化
+ */
+#define vector_init(vec) \
+    do { \
+        (vec).size = 0, \
+        (vec).cap = 0, \
+        (vec).data = 0; \
+    } while(0)
+
+/**
+ * @def vector_push(vec, value)
+ * @brief 添加元素到向量末尾
+ * @param vec 目标向量结构体
+ * @param value 要添加的值（需匹配存储类型）
+ * 
+ * @note 当容量不足时自动扩容为2倍（初始容量为8）
+ * @warning 内存分配失败时会触发LOG_FATAL
+ */
+#define vector_push(vec, value) \
+    do { \
+        if (vec.size >= vec.cap) { \
+            int cap = vec.cap ? vec.cap * 2 : 8; \
+            void* data = __vec_realloc(vec.data, cap * sizeof(*vec.data)); \
+            if (!data) { \
+                LOG_FATAL("vector_push: rt_realloc failed\n"); \
+            } \
+            (vec).cap = cap; \
+            (vec).data = data; \
+        } \
+        (vec).data[(vec).size++] = value; \
+    } while(0)
+
+/**
+ * @def vector_pop(vec)
+ * @brief 弹出最后一个元素
+ * @param vec 目标向量结构体
+ * @return 最后元素的引用
+ * @warning 需确保size > 0时使用
+ */
+#define vector_pop(vec) \
+    ((vec).data[--(vec).size])
+
+/**
+ * @def vector_at(vec, idx)
+ * @brief 获取指定索引元素
+ * @param vec 目标向量结构体
+ * @param idx 元素索引（0 <= idx < size）
+ * @return 对应元素的引用
+ */
+#define vector_at(vec, idx) \
+    (((vec).data)[idx])
+
+/**
+ * @def vector_idx(vec, ptr)
+ * @brief 获取元素指针对应的索引
+ * @param vec 目标向量结构体
+ * @param ptr 元素指针（需在data数组范围内）
+ * @return 元素索引值
+ */
+#define vector_idx(vec, ptr) \
+    ((ptr) - (vec).data)
+
+/**
+ * @def vector_free(vec)
+ * @brief 释放向量内存
+ * @param vec 目标向量结构体
+ * 
+ * @note 释放后需重新初始化才能再次使用
+ */
+#define vector_free(vec) \
+    do { \
+        __vec_free((vec).data); \
+        (vec).data = NULL; \
+        (vec).size = (vec).cap = 0; \
+    } while(0)
+
+#endif // __SMCC_DS_VECTOR_H__

runtime/libutils/src/hashtable.c

@@ -0,0 +1,140 @@
+#include <hashtable.h>
+
+#define INIT_HASH_TABLE_SIZE (32)
+
+void init_hashtable(hash_table_t* ht) {
+    vector_init(ht->entries);
+    ht->count = 0;
+    ht->tombstone_count = 0;
+    // Assert(ht->key_cmp != NULL && ht->hash_func != NULL);
+}
+
+static int next_power_of_two(int n) {
+    n--;
+    n |= n >> 1;
+    n |= n >> 2;
+    n |= n >> 4;
+    n |= n >> 8;
+    n |= n >> 16;
+    return n + 1;
+}
+
+static hash_entry_t* find_entry(hash_table_t* ht, const void* key, u32 hash) {
+    if (ht->entries.cap == 0) return NULL;
+    
+    u32 index = hash & (ht->entries.cap - 1); // 容量是2的幂
+    u32 probe = 0;
+
+    hash_entry_t* tombstone = NULL;
+    
+    while (1) {
+        hash_entry_t* entry = &vector_at(ht->entries, index);
+        if (entry->state == ENTRY_EMPTY) {
+            return tombstone ? tombstone : entry;
+        }
+        
+        if (entry->state == ENTRY_TOMBSTONE) {
+            if (!tombstone) tombstone = entry;
+        } else if (entry->hash == hash && ht->key_cmp(entry->key, key) == 0) {
+            return entry;
+        }
+        
+        // Liner finding
+        index = (index + 1) & (ht->entries.cap - 1);
+        probe++;
+        if (probe >= ht->entries.cap) break;
+    }
+    LOG_ERROR("hashset_find: hash table is full");
+    return NULL;
+}
+
+static void adjust_capacity(hash_table_t* ht, int new_cap) {
+    new_cap = next_power_of_two(new_cap);
+    Assert(new_cap >= ht->entries.cap);
+
+    VECTOR_HEADER(old_entries, hash_entry_t);
+    old_entries.data = ht->entries.data;
+    old_entries.cap = ht->entries.cap;
+
+    // Not used size but for gdb python extention debug
+    ht->entries.size = new_cap;
+    ht->entries.cap = new_cap;
+    ht->entries.data = smcc_realloc(NULL, new_cap * sizeof(hash_entry_t));
+    smcc_memset(ht->entries.data, 0, new_cap * sizeof(hash_entry_t));
+
+    // rehash the all of the old data
+    for (usize i = 0; i < old_entries.cap; i++) {
+        hash_entry_t* entry = &vector_at(old_entries, i);
+        if (entry->state == ENTRY_ACTIVE) {
+            hash_entry_t* dest = find_entry(ht, entry->key, entry->hash);
+            *dest = *entry;
+        }
+    }
+
+    vector_free(old_entries);
+    ht->tombstone_count = 0;
+}
+
+void* hashtable_set(hash_table_t* ht, const void* key, void* value) {
+    if (ht->count + ht->tombstone_count >= ht->entries.cap * 0.75) {
+        int new_cap = ht->entries.cap < INIT_HASH_TABLE_SIZE ? INIT_HASH_TABLE_SIZE : ht->entries.cap * 2;
+        adjust_capacity(ht, new_cap);
+    }
+
+    u32 hash = ht->hash_func(key);
+    hash_entry_t* entry = find_entry(ht, key, hash);
+    
+    void* old_value = NULL;
+    if (entry->state == ENTRY_ACTIVE) {
+        old_value = entry->value;
+    } else {
+        if (entry->state == ENTRY_TOMBSTONE) ht->tombstone_count--;
+        ht->count++;
+    }
+    
+    entry->key = key;
+    entry->value = value;
+    entry->hash = hash;
+    entry->state = ENTRY_ACTIVE;
+    return old_value;
+}
+
+void* hashtable_get(hash_table_t* ht, const void* key) {
+    if (ht->entries.cap == 0) return NULL;
+    
+    u32 hash = ht->hash_func(key);
+    hash_entry_t* entry = find_entry(ht, key, hash);
+    return (entry && entry->state == ENTRY_ACTIVE) ? entry->value : NULL;
+}
+
+void* hashtable_del(hash_table_t* ht, const void* key) {
+    if (ht->entries.cap == 0) return NULL;
+    
+    u32 hash = ht->hash_func(key);
+    hash_entry_t* entry = find_entry(ht, key, hash);
+    
+    if (entry == NULL || entry->state != ENTRY_ACTIVE) return NULL;
+    
+    void* value = entry->value;
+    entry->state = ENTRY_TOMBSTONE;
+    ht->count--;
+    ht->tombstone_count++;
+    return value;
+}
+
+void hashtable_destory(hash_table_t* ht) {
+    vector_free(ht->entries);
+    ht->count = 0;
+    ht->tombstone_count = 0;
+}
+
+void hashtable_foreach(hash_table_t* ht, hash_table_iter_func iter_func, void* context) {
+    for (usize i = 0; i < ht->entries.cap; i++) {
+        hash_entry_t* entry = &vector_at(ht->entries, i);
+        if (entry->state == ENTRY_ACTIVE) {
+            if (!iter_func(entry->key, entry->value, context)) {
+                break; // enable callback function terminal the iter
+            }
+        }
+    }
+}

runtime/libutils/src/strpool.c

@@ -0,0 +1,47 @@
+#include "strpool.h"
+
+u32 rt_strhash(const char* s) {
+    u32 hash = 2166136261u; // FNV-1a偏移基础值
+    while (*s) {
+        hash ^= *s++;
+        hash *= 16777619u;
+    }
+    return hash;
+}
+
+int rt_strcmp(const char* s1, const char* s2) {
+    while (*s1 && *s2 && *s1 == *s2) {
+        s1++;
+        s2++;
+    }
+    return *s1 - *s2;
+}
+
+void init_strpool(strpool_t* pool) {
+    pool->ht.hash_func = (u32(*)(const void*))rt_strhash;
+    pool->ht.key_cmp = (int(*)(const void*, const void*))rt_strcmp;
+    init_hashtable(&pool->ht);
+}
+
+const char* strpool_intern(strpool_t* pool, const char* str) {
+    void* existing = hashtable_get(&pool->ht, str);
+    if (existing) {
+        return existing;
+    }
+
+    rt_size_t len = rt_strlen(str) + 1;
+    char* new_str = lalloc_alloc(&pool->stralloc, len);
+    if (!new_str) {
+        LOG_ERROR("strpool: Failed to allocate memory for string");
+        return NULL;
+    }
+    rt_memcpy(new_str, str, len);
+
+    hashtable_set(&pool->ht, new_str, new_str);
+    return new_str;
+}
+
+void strpool_destroy(strpool_t* pool) {
+    hashtable_destory(&pool->ht);
+    lalloc_destroy(&pool->stralloc);
+}

runtime/libutils/src/vector-gdb.py

@@ -0,0 +1,112 @@
+# vector_gdb.py
+import gdb # type: ignore
+from gdb.printing import PrettyPrinter # type: ignore
+
+class VectorPrinter:
+    """兼容新旧注册方式的最终方案"""
+    
+    def __init__(self, val: gdb.Value):
+        self.val:gdb.Value = val
+        
+    def check_type(self) -> bool:
+        """类型检查（兼容匿名结构体）"""
+        try:
+            if self.val.type.code != gdb.TYPE_CODE_STRUCT:
+                return False
+            fields = self.val.type.fields()
+            if not fields:
+                return False
+            exp = ['size', 'cap', 'data']
+            for t in fields:
+                if t.name in exp:
+                    exp.remove(t.name)
+                else:
+                    return False
+            return True
+        except gdb.error:
+            return False
+    
+    def to_string(self):
+        if not self.check_type():
+            return "Not a vector"
+            
+        return "vector({} size={}, cap={})".format(
+            self.val.address,
+            self.val['size'],
+            self.val['cap'],
+        )
+    
+    def display_hint(self):
+        return 'array'
+    
+    def children(self):
+        """生成数组元素（关键改进点）"""
+        if not self.check_type():
+            return []
+            
+        size = int(self.val['size'])
+        cap = int(self.val['cap'])
+        data_ptr = self.val['data']
+        
+        if cap == 0 or data_ptr == 0:
+            return []
+        
+        # 使用 GDB 内置数组转换
+        array = data_ptr.dereference()
+        array = array.cast(data_ptr.type.target().array(cap - 1))
+        
+        for i in range(size):
+            # state = "<used>" if i < size else "<unused>"
+            try:
+                value = array[i]
+                yield (f"[{i}] {value.type} {value.address}", value)
+            except gdb.MemoryError:
+                yield (f"[{i}]", "<invalid>")
+
+# 注册方式一：传统append方法（您之前有效的方式）self
+def append_printer():
+    gdb.pretty_printers.append(
+        lambda val: VectorPrinter(val) if VectorPrinter(val).check_type() else None
+    )
+
+# 注册方式二：新版注册方法（备用方案）  
+def register_new_printer():
+    class VectorPrinterLocator(PrettyPrinter):
+        def __init__(self):
+            super().__init__("vector_printer")
+            
+        def __call__(self, val):
+            ret = VectorPrinter(val).check_type()
+            print(f"ret {ret}, type {val.type}, {[(i.name, i.type) for i in  val.type.fields()]}")
+            return None
+    
+    gdb.printing.register_pretty_printer(
+        gdb.current_objfile(),
+        VectorPrinterLocator()
+    )
+
+# 双重注册保证兼容性
+append_printer()  # 保留您原来有效的方式
+# register_new_printer()  # 添加新版注册
+
+class VectorInfoCommand(gdb.Command):
+    """保持原有命令不变"""
+    def __init__(self):
+        super().__init__("vector_info", gdb.COMMAND_USER)
+        
+    def invoke(self, argument, from_tty):
+        val = gdb.parse_and_eval(argument)
+        printer = VectorPrinter(val)
+        
+        if not printer.check_type():
+            print("Invalid vector")
+            return
+            
+        print("=== Vector Details ===")
+        print("Size:", val['size'])
+        print("Capacity:", val['cap'])
+        print("Elements:")
+        for name, value in printer.children():
+            print(f"  {name}: {value}")
+
+VectorInfoCommand()