数据结构
lidaqiang99
这个作者很懒,什么都没留下…
展开
-
内核链表的应用
#include #include "dlist_public.h" int LIST_initHead(LIST_S_NODE *pstHead) { if (NULL == pstHead) { return -1; } pstHead->next = pstHead; return 0; } int LIST_add(LIST原创 2013-12-18 21:41:24 · 750 阅读 · 0 评论 -
栈
#include #include #include #include "stack.h" #include "stack_public.h" static SEQ_S_STACK s_stack; SEQ_S_STACK *STACK_getDev(void) { return &s_stack; } int STACK_init(SEQ_S_STACK *pStack)原创 2013-12-19 20:53:40 · 808 阅读 · 0 评论 -
内核缓冲区应用
#include #define FIFO_SIZE (1024) typedef struct tagS_FIFO { unsigned int ulSize; unsigned int ulIn; unsigned int ulOut; char *pBuf; }S_FIFO; int FIFO_min(unsigned int ulFirst原创 2013-12-20 23:00:48 · 911 阅读 · 0 评论