liteos双向链表（十二）

#include "los_list.h"
#include<stdio.h>
VOID list_test(void)
{
 /*初始化，判断是否为空*/
 printf("initial......\n");
 LOS_DL_LIST* head;
 head = (LOS_DL_LIST*)malloc(sizeof(LOS_DL_LIST));
 LOS_ListInit(head);
 if (!ListEmpty(head))
 {
 printf("initial failed\n");
 return;
 }
 /*增加一个节点，在尾端插入一个节点*/
 printf("node add and tail add......\n");
 LOS_DL_LIST* node1 = (LOS_DL_LIST*)malloc(sizeof(LOS_DL_LIST));
 LOS_DL_LIST* node2 = (LOS_DL_LIST*)malloc(sizeof(LOS_DL_LIST));
 LOS_DL_LIST* tail = (LOS_DL_LIST*)malloc(sizeof(LOS_DL_LIST));
 LOS_ListAdd(node1,head);
 LOS_ListAdd(node2,node1);
 if((node1->pstPrev == head) || (node2->pstPrev == node1)){
 printf("add node success\n");
 }
 LOS_ListTailInsert(tail,head);
 if(tail->pstPrev == node2){
 printf("add tail success\n");
}
 /*删除双向链表节点*/
 printf("delete node......\n");
 LOS_ListDelete(node1);
 free(node1);
 if(head->pstNext == node2){
 printf("delete node success\n");
 }
}