?? list.h
字號:
#ifndef _LIST_H#define _LIST_H/* Simple linked list inspired by the Linux kernel list implementation */typedef struct list { struct list *prev, *next;} list_t;#define LIST_NULL -1#define LIST_SUCCESS 1#define LIST_INIT_HEAD(name) { &(name), &(name) }#define LIST(name) list_t name = LIST_INIT_HEAD(name)#define INIT_LIST(h) do { \ (h)->next = (h); (h)->prev = (h); \} while (0)#define INIT_LIST_ELM(le) do { \ (le)->next = NULL; (le)->prev = NULL; \} while (0)static inline int listelm_detach(list_t * prev, list_t * next){ next->prev = prev; prev->next = next; return LIST_SUCCESS;}static inline int listelm_add(list_t * le, list_t * prev, list_t * next){ prev->next = le; le->prev = prev; le->next = next; next->prev = le; return LIST_SUCCESS;}static inline int list_add(list_t * le, list_t * head){ if (!head || !le) return LIST_NULL; listelm_add(le, head, head->next); return LIST_SUCCESS;}static inline int list_add_tail(list_t * le, list_t * head){ if (!head || !le) return LIST_NULL; listelm_add(le, head->prev, head); return LIST_SUCCESS;}static inline int list_detach(list_t * le){ if (!le) return LIST_NULL; listelm_detach(le->prev, le->next); le->next = le->prev = NULL; return LIST_SUCCESS;}#define list_for_each(curr, head) \ for (curr = (head)->next; curr != (head); curr = curr->next)#define list_for_each_safe(pos, tmp, head) \ for (pos = (head)->next, tmp = pos->next; pos != (head); \ pos = tmp, tmp = pos->next)#define list_empty(head) ((head) == (head)->next)#define list_first(head) ((head)->next)#define list_unattached(le) ((le)->next == NULL && (le)->prev == NULL)#define list_del(le) list_detach(le)#endif /* _LIST_H */?? 快捷鍵說明
復(fù)制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -