循环双链表的部分基本功能

/*****************************************************
copyright (C), 2014-2015, Lighting Studio. Co.,     Ltd. 
File name：
Author:fhb    Version:0.1    Date: 
Description：
Funcion List: 
*****************************************************/


#include <stdio.h>
#include<stdlib.h>
#include<time.h>


typedef struct dbnode
{
    int num;
struct dbnode * prev;
struct dbnode * next;
}Dbnode;


typedef struct dbnode * Dblink;


void malloc_ok(Dblink * new_node)
{
*new_node = (Dblink)malloc(sizeof(Dbnode));
if(*new_node == NULL)
{
printf("creat error!\n");
exit(-1);
}
}


void create_link(Dblink * head)
{
malloc_ok(head);
(*head)->next = *head;
(*head)->prev = *head;
}


void insert_node_head(Dblink  head,Dblink new_node)
{
new_node->next = head->next;
new_node->prev = head;
head->next->prev = new_node;
head->next = new_node;
}


void insert_node_tail(Dblink  head,Dblink new_node)
{
new_node->next = head;
new_node->prev = head->prev;
head->prev->next = new_node;
head->prev = new_node;
}


Dblink find(Dblink head,int n)
{
    Dblink tmp = head->next;
if(head->next == head)
{
printf("link is empty!\n");
return NULL;
}


while(tmp->next != head && tmp->num != n)
{
tmp =tmp->next;
}
if(tmp->next == head&&tmp->num != n)
{
printf("can't find this data!\n");
return NULL;
}
else
{
return tmp;
}
}


void display_forward(Dblink head)
{
Dblink tmp = head->next;
if(head->next == head)
{
printf("the link is empty!\n");
return;
}
while(tmp->next != head)
{
printf("num=%d\n",tmp->num);
tmp = tmp->next;
}
printf("num=%d\n",tmp->num);
}


void display_backward(Dblink head)
{
Dblink tmp = head->prev;
if(head->prev == head)
{
printf("the link is empty!\n");
return;
}
while(tmp->prev != head)
{
printf("num=%d\n",tmp->num);
tmp = tmp->prev;
}
printf("num=%d\n",tmp->num);
}


void delete(Dblink head,int n)
{
    Dblink tmp = (head)->next;
while(tmp->num != n&&tmp->next != head)
{
tmp = tmp->next;
}


    if(tmp->next == head&&tmp->num != n)
{
printf("no such Dbnode!\n");
return;
}
else
{
   tmp->prev->next = tmp->next;
tmp->next->prev = tmp->prev;
free(tmp);
}
}


void remove_all(Dblink head)
{
Dblink tmp = head->next;
Dblink p = tmp;


if(head->next == head)
{
printf("the link is empty!\n");
return;
}


while(tmp->next != head)
{
        tmp = tmp->next;
free(p);
p = tmp;
}


head->next = head;
head->prev = head;
free(tmp);


printf("delete success!\n");
}


void insert_node_mid(Dblink head,Dblink new_node,int n)
{
Dblink p1 = NULL;


/*if(head->next == head)
{
new_node->next = head;
new_node->prev = head;
head->next = new_node;
head->prev = new_node;;
return;
}*/


p1 = head->next;


    while(p1->num < n&&p1->next != head)
{
p1 = p1->next;
}
if(p1->num < n)//n>尾结点，尾插入
{
new_node->next = head;
new_node->prev = head->prev;
head->prev->next = new_node;
head->prev = new_node;
return;
}
else
{
new_node->next = p1;
new_node->prev = p1->prev;
        p1->prev->next = new_node;
p1->prev = new_node;
return;
}


}




/*void revers_link(Link head)
{
Link p1 = NULL;
Link p2 = NULL;
Link p3 = NULL;


p3 = head->next;


if(p3 == head)
{
printf("the link is emtpy!\n");
return;
}


p2 = p3->next;
if(p2 == head)
{
return;
}


p1 = p2->next;
if(p1 == head)
{
        p2->next = p3;
p3->next = p1;
head->next = p2;
return;
}


while(p1->next != head)
{
p2->next = p3;
p3 = p2;
p2 = p1;
p1 = p1->next;
}
p2->next = p3;
p1->next = p2;
head->next->next = head;
head->next = p1;
return;
}*/


int main()
{
int i;


Dblink new_node = NULL;
    Dblink head = NULL;


create_link(&head);


srand(time(NULL));


for(i = 0;i < 10;i++)
{
        malloc_ok(&new_node);
// new_node->num = i;
new_node->num = rand() % 10;
printf("%d ",new_node->num);
// insert_node_tail(head,new_node);;
insert_node_mid(head,new_node,new_node->num);
//  insert_node_head(head,new_node);
}
printf("\n");

// delete(head,5);
// Dblink tmp=find(head,3);
// printf("findnum=%d\n",tmp->num);


// display_link(head);
// revers_link(head);
// printf("\n");


display_forward(head);
printf("\n");
display_backward(head);


remove_all(head);


display_forward(head);


    return 0;

}