linux 数据结构查询,LINUX常用数据结构

《LINUX常用数据结构》由会员分享，可在线阅读，更多相关《LINUX常用数据结构(7页珍藏版)》请在人人文库网上搜索。

1、* List definitions.*/#define LIST_HEAD(name, type)struct name struct type *lh_first;/* first element */#define LIST_ENTRY(type)struct struct type *le_next;/* next element */struct type *le_prev;/* address of previous next element */* List functions.*/#defineLIST_INIT(head) (head)-lh_first = NULL;#de。

2、fine LIST_INSERT_AFTER(listelm, elm, field) if (elm)-field.le_next = (listelm)-field.le_next) != NULL)(listelm)-field.le_next-field.le_prev =&(elm)-field.le_next;(listelm)-field.le_next = (elm);(elm)-field.le_prev = &(listelm)-field.le_next;#define LIST_INSERT_HEAD(head, elm, field) if (elm)-field.l。

3、e_next = (head)-lh_first) != NULL)(head)-lh_first-field.le_prev = &(elm)-field.le_next;(head)-lh_first = (elm);(elm)-field.le_prev = &(head)-lh_first;#define LIST_REMOVE(elm, field) if (elm)-field.le_next != NULL)(elm)-field.le_next-field.le_prev = (elm)-field.le_prev;*(elm)-field.le_prev = (elm)-fi。

4、eld.le_next;/* Tail queue definitions.*/#define TAILQ_HEAD(name, type)struct name struct type *tqh_first;/* first element */struct type *tqh_last;/* addr of last next element */#define TAILQ_ENTRY(type)struct struct type *tqe_next;/* next element */struct type *tqe_prev;/* address of previous next e。

5、lement */* Tail queue functions.*/#defineTAILQ_INIT(head) (head)-tqh_first = NULL;(head)-tqh_last = &(head)-tqh_first;#define TAILQ_INSERT_HEAD(head, elm, field) if (elm)-field.tqe_next = (head)-tqh_first) != NULL)(elm)-field.tqe_next-field.tqe_prev =&(elm)-field.tqe_next;else(head)-tqh_last = &(elm。

6、)-field.tqe_next;(head)-tqh_first = (elm);(elm)-field.tqe_prev = &(head)-tqh_first;#define TAILQ_INSERT_TAIL(head, elm, field) (elm)-field.tqe_next = NULL;(elm)-field.tqe_prev = (head)-tqh_last;*(head)-tqh_last = (elm);(head)-tqh_last = &(elm)-field.tqe_next;#define TAILQ_INSERT_AFTER(head, listelm,。

7、 elm, field) if (elm)-field.tqe_next = (listelm)-field.tqe_next) != NULL)(elm)-field.tqe_next-field.tqe_prev = &(elm)-field.tqe_next;else(head)-tqh_last = &(elm)-field.tqe_next;(listelm)-field.tqe_next = (elm);(elm)-field.tqe_prev = &(listelm)-field.tqe_next;#define TAILQ_REMOVE(head, elm, field) if。

8、 (elm)-field.tqe_next) != NULL)(elm)-field.tqe_next-field.tqe_prev = (elm)-field.tqe_prev;else(head)-tqh_last = (elm)-field.tqe_prev;*(elm)-field.tqe_prev = (elm)-field.tqe_next;/* Circular queue definitions.*/#define CIRCLEQ_HEAD(name, type)struct name struct type *cqh_first;/* first element */stru。

9、ct type *cqh_last;/* last element */#define CIRCLEQ_ENTRY(type)struct struct type *cqe_next;/* next element */struct type *cqe_prev;/* previous element */* Circular queue functions.*/#defineCIRCLEQ_INIT(head) (head)-cqh_first = (void *)(head);(head)-cqh_last = (void *)(head);#define CIRCLEQ_INSERT_A。

10、FTER(head, listelm, elm, field) (elm)-field.cqe_next = (listelm)-field.cqe_next;(elm)-field.cqe_prev = (listelm);if (listelm)-field.cqe_next = (void *)(head)(head)-cqh_last = (elm);else(listelm)-field.cqe_next-field.cqe_prev = (elm);(listelm)-field.cqe_next = (elm);#define CIRCLEQ_INSERT_BEFORE(head。

11、, listelm, elm, field) (elm)-field.cqe_next = (listelm);(elm)-field.cqe_prev = (listelm)-field.cqe_prev;if (listelm)-field.cqe_prev = (void *)(head)(head)-cqh_first = (elm);else(listelm)-field.cqe_prev-field.cqe_next = (elm);(listelm)-field.cqe_prev = (elm);#define CIRCLEQ_INSERT_HEAD(head, elm, fie。

12、ld) (elm)-field.cqe_next = (head)-cqh_first;(elm)-field.cqe_prev = (void *)(head);if (head)-cqh_last = (void *)(head)(head)-cqh_last = (elm);else(head)-cqh_first-field.cqe_prev = (elm);(head)-cqh_first = (elm);#define CIRCLEQ_INSERT_TAIL(head, elm, field) (elm)-field.cqe_next = (void *)(head);(elm)-。

13、field.cqe_prev = (head)-cqh_last;if (head)-cqh_first = (void *)(head)(head)-cqh_first = (elm);else(head)-cqh_last-field.cqe_next = (elm);(head)-cqh_last = (elm);#defineCIRCLEQ_REMOVE(head, elm, field) if (elm)-field.cqe_next = (void *)(head)(head)-cqh_last = (elm)-field.cqe_prev;else(elm)-field.cqe_。

14、next-field.cqe_prev =(elm)-field.cqe_prev;if (elm)-field.cqe_prev = (void *)(head)(head)-cqh_first = (elm)-field.cqe_next;else(elm)-field.cqe_prev-field.cqe_next =(elm)-field.cqe_next;#endif/* sys/queue.h */2:使用：声明结构struct testint a ;int b;LIST_ENTRY(test)test_t;声明队头LIST_HEAD(list_test,test)testtp;/初始化队列LIST_INIT(testtp);struct test*ttp,tp;/插入队列操作，注意首先分配内存ttp=(struct test*)malloc(sizeof(struct test);LIST_INSERT_HEAD(testtp,ttp,test_t);/删除操作LIST_REMOVE(ttp,test_t);free(ttp);内在的分配与释放操作均需手工进行。