- 论坛徽章:
- 0
|
本帖最后由 liuchang8877 于 2012-07-27 10:46 编辑
- //内核中有关链表的实现的 头文件 list.h
- #ifndef _LINUX_LIST_H
- #define _LINUX_LIST_H
- //#if defined(__KERNEL__) || defined(_LVM_H_INCLUDE)
- /*
- * Simple doubly linked list implementation.
- *
- * Some of the internal functions ("__xxx") are useful when
- * manipulating whole lists rather than single entries, as
- * sometimes we already know the next/prev entries and we can
- * generate better code by using them directly rather than
- * using the generic single-entry routines.
- */
- struct list_head {
- struct list_head *next, *prev;
- };
- #define LIST_HEAD_INIT(name) { &(name), &(name) }
- #define LIST_HEAD(name) \
- struct list_head name = LIST_HEAD_INIT(name)
- #define INIT_LIST_HEAD(ptr) do { \
- (ptr)->next = (ptr); (ptr)->prev = (ptr); \
- } while (0)
- /*
- * Insert a new entry between two known consecutive entries.
- *
- * This is only for internal list manipulation where we know
- * the prev/next entries already!
- */
- static __inline__ void __list_add(struct list_head * new,
- struct list_head * prev,
- struct list_head * next)
- {
- next->prev = new;
- new->next = next;
- new->prev = prev;
- prev->next = new;
- }
- /**
- * list_add - add a new entry
- * @new: new entry to be added
- * @head: list head to add it after
- *
- * Insert a new entry after the specified head.
- * This is good for implementing stacks.
- */
- static __inline__ void list_add(struct list_head *new, struct list_head *head)
- {
- __list_add(new, head, head->next);
- }
- /**
- * list_add_tail - add a new entry
- * @new: new entry to be added
- * @head: list head to add it before
- *
- * Insert a new entry before the specified head.
- * This is useful for implementing queues.
- */
- static __inline__ void list_add_tail(struct list_head *new, struct list_head *head)
- {
- __list_add(new, head->prev, head);
- }
- /**
- * list_get_tail - get end
- * @head: list head to add it before
- *
- * Return the end
- */
- static __inline__ struct list_head* list_get_end(struct list_head *head)
- {
- return head->prev;
- }
- static __inline__ struct list_head* list_get_head(struct list_head *head)
- {
- return head->next;
- }
- /*
- * Delete a list entry by making the prev/next entries
- * point to each other.
- *
- * This is only for internal list manipulation where we know
- * the prev/next entries already!
- */
- static __inline__ void __list_del(struct list_head * prev,
- struct list_head * next)
- {
- next->prev = prev;
- prev->next = next;
- }
- /**
- * list_del - deletes entry from list.
- * @entry: the element to delete from the list.
- * Note: list_empty on entry does not return true after this, the entry is in an undefined state.
- */
- static __inline__ void list_del(struct list_head *entry)
- {
- __list_del(entry->prev, entry->next);
- entry->next = entry->prev = 0;
- }
- /**
- * list_del_init - deletes entry from list and reinitialize it.
- * @entry: the element to delete from the list.
- */
- static __inline__ void list_del_init(struct list_head *entry)
- {
- __list_del(entry->prev, entry->next);
- INIT_LIST_HEAD(entry);
- }
- /**
- * list_empty - tests whether a list is empty
- * @head: the list to test.
- */
- static __inline__ int list_empty(struct list_head *head)
- {
- return head->next == head;
- }
- /**
- * list_splice - join two lists
- * @list: the new list to add.
- * @head: the place to add it in the first list.
- */
- static __inline__ void list_splice(struct list_head *list, struct list_head *head)
- {
- struct list_head *first = list->next;
- if (first != list) {
- struct list_head *last = list->prev;
- struct list_head *at = head->next;
- first->prev = head;
- head->next = first;
- last->next = at;
- at->prev = last;
- }
- }
- /**
- * list_entry - get the struct for this entry
- * @ptr: the &struct list_head pointer.
- * @type: the type of the struct this is embedded in.
- * @member: the name of the list_struct within the struct.
- */
- #define list_entry(ptr, type, member) \
- ((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member)))
- /**
- * list_for_each - iterate over a list
- * @pos: the &struct list_head to use as a loop counter.
- * @head: the head for your list.
- */
- #define list_for_each(pos, head) \
- for (pos = (head)->next; pos != (head); \
- pos = pos->next)
-
- /**
- * list_for_each_safe - iterate over a list safe against removal of list entry
- * @pos: the &struct list_head to use as a loop counter.
- * @n: another &struct list_head to use as temporary storage
- * @head: the head for your list.
- */
- #define list_for_each_safe(pos, n, head) \
- for (pos = (head)->next, n = pos->next; pos != (head); \
- pos = n, n = pos->next)
- //#endif /* __KERNEL__ || _LVM_H_INCLUDE */
- #endif
复制代码
- 这是带有 结构体说明的 简单使用的例子,希望大家多多指教
- /* STRUCT */
- typedef struct xml_value{
- struct list_head list;
- char * key_value;
- }xml_value;
- typedef struct XMLConfInfo {
- xml_value *xml_value;
- int key_count;
- xmlDocPtr doc;
- xmlDocPtr xsd;
- xmlChar *xsd_string;
- char errmsg[XML_ERROMSG_LEN];
- char *dict;
- char *dict_bak;
- } XMLConfInfo;
- xml_value* init_xmL_value(char *value)
- {
- //get a new node
- xml_value* key = (xml_value*)malloc(sizeof(xml_value));
- memcpy(key->key_value,value,strlen(value));
- key->key_value[strlen(value)] = '\0';
-
- if(NULL == key->key_value){
- printf("[ERROR] xmlconf:malloc value out of memory\n");
- free(key);
- }
- return key;
- }
- void add_xml_value(XMLConfInfo *info,xml_value *key)
- {
- list_add((struct list_head*)info->xml_value,(struct list_head*)&key);
- info->key_count++;
- }
- /* 原有版本
- void del_xml_value(XMLConfInfo *info)
- {
- int i ;
- int count = info->key_count;
- struct list_head * list = NULL;
- for(i=0; i<count; i++){
- list = list_get_head((struct list_head *)&info->xml_value);
- list_del(list);
- info->key_count--;
- }
- }*/
- //2012.7.27 修改后
- 354 void del_xml_value(XMLConfInfo *info)
- 355 {
- 356 int i ;
- 357 int count = info->key_count;
- 358 struct list_head * list = NULL;
- 359
- 360 for(i=0; i<count; i++){
- 361 list = list_get_head((struct list_head *)&info->xml_value);
- 362 list_del(list);
- 363 free(((xml_value *)list)->key_value);
- 364 free(list);
- 365 info->key_count--;
- 366 }
- 367
- 368 }
复制代码 |
|