C語言雙向循環(huán)鏈表api（源自gluster源碼）
基本的操作如增加、刪除和遍歷等

創(chuàng)新互聯(lián)長期為近1000家客戶提供的網(wǎng)站建設(shè)服務(wù)，團(tuán)隊(duì)從業(yè)經(jīng)驗(yàn)10年，關(guān)注不同地域、不同群體，并針對(duì)不同對(duì)象提供差異化的產(chǎn)品和服務(wù)；打造開放共贏平臺(tái)，與合作伙伴共同營造健康的互聯(lián)網(wǎng)生態(tài)環(huán)境。為班瑪企業(yè)提供專業(yè)的成都網(wǎng)站設(shè)計(jì)、網(wǎng)站建設(shè)，班瑪網(wǎng)站改版等技術(shù)服務(wù)。擁有十載豐富建站經(jīng)驗(yàn)和眾多成功案例,為您定制開發(fā)。

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

/*定義表頭*/
struct list_head {
    struct list_head *next;
    struct list_head *prev;
};

/*表頭初始化*/
#define INIT_LIST_HEAD(head) do {           \
        (head)->next = (head)->prev = head; \
    } while (0)

/*增加*/
static inline void
list_add (struct list_head *new, struct list_head *head)
{
    new->prev = head;
    new->next = head->next;

    new->prev->next = new;
    new->next->prev = new;
}

/*刪除*/
static inline void
list_del (struct list_head *old)
{
    old->prev->next = old->next;
    old->next->prev = old->prev;

    old->next = (void *)0xbabebabe;
    old->prev = (void *)0xcafecafe;
}

/*判斷鏈表是否為空*/
static inline int
list_empty (struct list_head *head)
{
    return (head->next == head);
}

#define list_entry(ptr, type, member)                   \
    ((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member)))

#define list_for_each(pos, head)                                        \
    for (pos = (head)->next; pos != (head); pos = pos->next)

/*遍歷，關(guān)于list_for_each_entry，百度*/
#define list_for_each_entry(pos, head, member)              \
    for (pos = list_entry((head)->next, typeof(*pos), member);  \
         &pos->member != (head);                    \
         pos = list_entry(pos->member.next, typeof(*pos), member))

/*例：先定義一個(gè)結(jié)構(gòu)體*/
typedef struct student
{                   
    int num;        //學(xué)號(hào)
    int score;      //分?jǐn)?shù)
    char name[20];
    struct list_head student_list;
}STU;

STU *head=NULL;

int main(void)
{
    STU *new=NULL;

    new = (STU *)malloc(sizeof(STU));
    bzero(new, sizeof(STU));
    new->num = 8;
    new->score = 8;
    strcpy(new->name, "8888");
    /*鏈表初始化*/
    if(head == NULL)
    {
        // head = (STU *)malloc(sizeof(STU));
        // bzero(head, sizeof(STU));
        head = new;
        INIT_LIST_HEAD(&head->student_list);
    }
    else
    {
        list_add(&new->student_list, &head->student_list);
    }

    if(list_empty(&head->student_list))
    {
        printf("list only head\n");
        printf("head->num:%d, score:%d, name:%s\n", head->num, head->score, head->name);
    }
    /*將新成員插入鏈表*/
    int i;
    for(i=0;i<5;i++)
    {
        new = (STU *)malloc(sizeof(STU));
        bzero(new, sizeof(STU));
        new->num = i;
        new->score = i+1;
        strcpy(new->name, "2233");
        list_add(&new->student_list, &head->student_list);
    }
    /*刪除指定的成員*/
    STU *pos=NULL;
    list_for_each_entry(pos, &head->student_list, student_list)
    {
        if(pos->num == 2){
            list_del(&pos->student_list);
            free(pos);
            pos = NULL;
            break;
            // printf("num:%d, score:%d, name:%s\n", pos->num, pos->score, pos->name);
        }
    }
    /*遍歷鏈表*/
    list_for_each_entry(pos, &head->student_list, student_list)
    {
        printf("num:%d, score:%d, name:%s\n", pos->num, pos->score, pos->name);
    }
    return 0;
}

分享文章：C語言雙向循環(huán)鏈表api（源自gluster源碼）
網(wǎng)址分享：http://jinyejixie.com/article48/ijdhhp.html

成都網(wǎng)站建設(shè)公司_創(chuàng)新互聯(lián)，為您提供網(wǎng)站收錄、商城網(wǎng)站、軟件開發(fā)、品牌網(wǎng)站制作、虛擬主機(jī)、品牌網(wǎng)站設(shè)計(jì)

廣告

聲明：本網(wǎng)站發(fā)布的內(nèi)容（圖片、視頻和文字）以用戶投稿、用戶轉(zhuǎn)載內(nèi)容為主，如果涉及侵權(quán)請(qǐng)盡快告知，我們將會(huì)在第一時(shí)間刪除。文章觀點(diǎn)不代表本網(wǎng)站立場(chǎng)，如需處理請(qǐng)聯(lián)系客服。電話：028-86922220；郵箱：631063699@qq.com。內(nèi)容未經(jīng)允許不得轉(zhuǎn)載，或轉(zhuǎn)載時(shí)需注明來源： 創(chuàng)新互聯(lián)