基于list.h的简单学生管理系统

      这两天看了linux内核里面经典的list.h文件，看的似懂非懂，心想要是就这样放过去了，过段时间肯定连影子记不起来了，所以决定自己动手试试，能否将这个文件里面的函数和宏应用起来。想法很完美，但时间起来确实费了不少周折，但后来想想收获到的东西，心理感觉还是蛮有成就的。。。好了，具体的过程就不多说了，代码贴出来先～

 

首先是自己定制的"list.h"文件“mylist.h”,(也就是把程序中要用到的宏和函数粘出来另存)。

/*********************************** ** author:heqiang******************* ** date:sep,4th 2010**************** ************************************ **/ #ifndef _LINUX_LIST_H #define _LINUX_LIST_H #define LIST_POISON1 ((void *) 0x00100100) #define LIST_POISON2 ((void *) 0x00200200) #define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER) #define container_of(ptr, type, member) ({/ const typeof( ((type *)0)->member ) *__mptr = (ptr);/ (type *)( (char *)__mptr - offsetof(type,member) );}) 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) static inline void INIT_LIST_HEAD(struct list_head *list) { list->next = list; list->prev = list; } 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; } static inline void list_add(struct list_head *new, struct list_head *head)// { __list_add(new, head, head->next); } static inline void list_add_tail(struct list_head *new, struct list_head *head) { __list_add(new, head->prev, head); } static inline void __list_del(struct list_head * prev, struct list_head * next) { next->prev = prev; prev->next = next; } static inline void list_del(struct list_head *entry) { __list_del(entry->prev, entry->next); entry->next = LIST_POISON1; entry->prev = LIST_POISON2; } static inline void list_replace(struct list_head *old, struct list_head *new) { new->next = old->next; new->next->prev = new; new->prev = old->prev; new->prev->next = new; } static inline void list_replace_init(struct list_head *old, struct list_head *new) { list_replace(old, new); INIT_LIST_HEAD(old); } static inline void list_del_init(struct list_head *entry) { __list_del(entry->prev, entry->next); INIT_LIST_HEAD(entry); } static inline void list_move(struct list_head *list, struct list_head *head) { __list_del(list->prev, list->next); list_add(list, head); } static inline void list_move_tail(struct list_head *list, struct list_head *head) { __list_del(list->prev, list->next); list_add_tail(list, head); } static inline int list_is_last(const struct list_head *list, const struct list_head *head) { return list->next == head; } static inline int list_empty(const struct list_head *head) { return head->next == head; } static inline int list_empty_careful(const struct list_head *head) { struct list_head *next = head->next; return (next == head) && (next == head->prev); } static inline void __list_splice(struct list_head *list, struct list_head *head) { struct list_head *first = list->next; struct list_head *last = list->prev; struct list_head *at = head->next; first->prev = head; head->next = first; last->next = at; at->prev = last; } static inline void list_splice(struct list_head *list, struct list_head *head) { if (!list_empty(list)) __list_splice(list, head); } static inline void list_splice_init(struct list_head *list, struct list_head *head) { if (!list_empty(list)) { __list_splice(list, head); INIT_LIST_HEAD(list); } } #define list_entry(ptr, type, member) / container_of(ptr, type, member) #define list_for_each(pos, head) / for (pos = (head)->next;pos != (head); / pos = pos->next) #define __list_for_each(pos, head) / for (pos = (head)->next; pos != (head); pos = pos->next) #define list_for_each_prev(pos, head) / for (pos = (head)->prev; pos != (head); / pos = pos->prev) #define list_for_each_safe(pos, n, head) / for (pos = (head)->next, n = pos->next; pos != (head); / pos = n, n = pos->next) #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)) #define list_for_each_entry_reverse(pos, head, member) / for (pos = list_entry((head)->prev, typeof(*pos), member); / &pos->member != (head); / pos = list_entry(pos->member.prev, typeof(*pos), member)) #define list_prepare_entry(pos, head, member) / ((pos) ? : list_entry(head, typeof(*pos), member)) #define list_for_each_entry_continue(pos, head, member) / for (pos = list_entry(pos->member.next, typeof(*pos), member); / prefetch(pos->member.next), &pos->member != (head); / pos = list_entry(pos->member.next, typeof(*pos), member)) #define list_for_each_entry_from(pos, head, member) / for (; prefetch(pos->member.next), &pos->member != (head); / pos = list_entry(pos->member.next, typeof(*pos), member)) #define list_for_each_entry_safe(pos, n, head, member) / for (pos = list_entry((head)->next, typeof(*pos), member), / n = list_entry(pos->member.next, typeof(*pos), member); / &pos->member != (head); / pos = n, n = list_entry(n->member.next, typeof(*n), member)) #define list_for_each_entry_safe_continue(pos, n, head, member) / for (pos = list_entry(pos->member.next, typeof(*pos), member), / n = list_entry(pos->member.next, typeof(*pos), member); / &pos->member != (head); / pos = n, n = list_entry(n->member.next, typeof(*n), member)) #define list_for_each_entry_safe_from(pos, n, head, member) / for (n = list_entry(pos->member.next, typeof(*pos), member); / &pos->member != (head); / pos = n, n = list_entry(n->member.next, typeof(*n), member)) #define list_for_each_entry_safe_reverse(pos, n, head, member) / for (pos = list_entry((head)->prev, typeof(*pos), member), / n = list_entry(pos->member.prev, typeof(*pos), member); / &pos->member != (head); / pos = n, n = list_entry(n->member.prev, typeof(*n), member)) #endif

在定制这个头文件时，遇到了很多问题，因为在内核的源码中，“list.h”头文件通常还会包含许多头文件，它里面的宏还会嵌套很多其他头文件里面的宏，如果单独将其拷贝出来，会遇到很多错误，这样，你就要想办法降低耦合度，以使程序能正常运行。。。

下面是自己写的小程序，实现了基本的功能，其中的读写文件的功能还没能实现，有待于后期补充，我会尽快将其完善的。

 

 

/***********************************

** author:heqiang*******************

** date:sep,4th 2010****************

***********************************/

 

#include <stdio.h> #include <stdlib.h> #include <string.h> #include <sys/types.h> #include <sys/stat.h> #include <fcntl.h> #include "mylist.h" struct student { int num; char name[20]; struct list_head list; }; typedef struct student mystu; void stu_add(struct list_head *ptr); void stu_del(struct list_head *ptr); void stu_modi(struct list_head *ptr); void stu_sear(struct list_head *ptr); void stu_trav(struct list_head *ptr); int read_info(); int write_info(); int main(int argc, char *argv[]) { int select=0; mystu mylist; INIT_LIST_HEAD(&mylist.list);/*初始化链表头*/ do { printf("***************************************/n"); printf("/t**1.Add student info**/n"); printf("/t**2.Delete student info**/n"); printf("/t**3.Modify student info**/n"); printf("/t**4.Search student info**/n"); printf("/t**5.Traversal student info**/n"); printf("/t**0.Exit/n"); printf("/tmake your choice:"); scanf("%d",&select); fflush(stdin); switch(select) { case 0: printf("Thanks for using.../n");break; case 1: stu_add(&mylist.list);break; case 2: stu_del(&mylist.list);break; case 3: stu_modi(&mylist.list);break; case 4: stu_sear(&mylist.list);break; case 5: stu_trav(&mylist.list);break; default:printf("/tError input!/n");break; } }while(select != 0); return 0; } /*添加学生信息*/ void stu_add(struct list_head *ptr) { int id=0; char *str; mystu *tmp; printf("please input num:"); scanf("%d",&id); printf("please input name:"); str=(char *)malloc(sizeof(char)*20); //fgets(str,20,stdin); scanf("%s",str); tmp=(mystu*)malloc(sizeof(mystu)); tmp->num=id; //tmp->name = (char *)malloc(sizeof(char)*20); strncpy(tmp->name,str,20); //tmp->name=str; list_add(&(tmp->list),ptr); return; } void stu_del(struct list_head *ptr) { int id=0; char c; struct list_head *pos; mystu *tmp; printf("please input the num you want to delete:"); scanf("%d",&id); printf("/n"); list_for_each(pos,ptr) { tmp=list_entry(pos,struct student,list); if(tmp->num == id) { printf("Truely deleted ?"); fflush(stdout); c=getchar(); c=getchar(); if(c == 'y'|| c == 'Y') { list_del(pos); printf("/nDelete success!/n"); break; } } } if(pos == ptr) printf("/tNo such student info~/n"); printf("/t/npress any key to continue.../n"); getchar(); getchar(); } void stu_modi(struct list_head *ptr) { int id=0; char c; struct list_head *pos; mystu *new,*tmp=NULL; new=(mystu *)malloc(sizeof(mystu)); printf("please input the num you want to modify:"); scanf("%d",&id); printf("/nnew num :"); scanf("%d",&new->num); //str=(char *)malloc(sizeof(char)*20); printf("/nnew name:"); scanf("%s",new->name); printf("/n"); list_for_each(pos,ptr) { tmp=list_entry(pos,struct student,list); if(tmp->num == id) { //printf("num name/n"); //printf("%2d %s/n",i,tmp->name); printf("Truely replace ?"); fflush(stdin); c=getchar(); c=getchar(); if(c == 'y'|| c == 'Y') { list_replace_init(pos,&(new->list)); printf("/nReplaced success!/n"); } break; } } if(pos == ptr) printf("/tNo such student info~/n"); printf("/t/npress any key to continue.../n"); fflush(stdin); getchar(); getchar(); } void stu_sear(struct list_head *ptr) { int i=0; mystu *tmp=NULL; tmp=(mystu *)malloc(sizeof(mystu)); struct list_head *pos; printf("please input the num you want to search:"); scanf("%d",&i); printf("/n"); list_for_each(pos,ptr) { tmp=list_entry(pos,struct student,list); if(tmp->num == i) { printf("num name/n"); printf("%2d %s/n",i,tmp->name); break; } } if(pos == ptr) printf("/tNo such student info~/n"); printf("/t/npress any key to continue.../n"); fflush(stdin); getchar(); getchar(); } void stu_trav(struct list_head *ptr) { struct list_head *pos; mystu *tmp = NULL; //tmp=(mystu *)malloc(sizeof(mystu)); list_for_each(pos,ptr) { tmp=list_entry(pos,struct student,list); printf("/n*********************/n"); printf("num name/n"); printf("%2d %s/n",tmp->num,tmp->name); } } int read_info() { ; } int save_info() { ; }  

大家对于我的程序中不合理或还有更好想法的意见可以随时告知我哦～  

我的邮箱：heqiang1068@gmail.com