#include <stdio.h>#include <string.h>#include “list.h”//open email.txt with the help of the struct list_head and struct hlist_head of the kernel#define HASH_NUM 1024 //number of the hash table#define STRING_NUM 1024LIST_HEAD(list); struct hlist_head hlist[HASH_NUM];struct ST{ char str[STRING_NUM]; struct list_head i_list; struct hlist_node i_hash;};//classical stirng hash functionunsigned int gethash(char *str){ register unsigned int h; register unsigned char *p; for(h=0, p = (unsigned char *)str; *p ; p++) h = 31 * h + *p; return h;}void attach(char* buf, struct ST* ch){ unsigned int hash = gethash(buf); printf(“%d—%s”,hash % HASH_NUM,buf); strcpy(ch->str, buf); list_add(&ch->i_list, &list); INIT_HLIST_NODE(&ch->i_hash); hlist_add_head(&ch->i_hash, &hlist[hash % HASH_NUM]);}void output_list(struct list_head*head){ struct list_head *queue; struct ST* now; list_for_each(queue, &list) { now = list_entry(queue, struct ST, i_list); printf(“%s”,now->str); }}int main(){ char buffer[STRING_NUM]; unsigned int hash; FILE* fp; INIT_LIST_HEAD(&list); for(hash = 0; hash < HASH_NUM; ++hash) INIT_HLIST_HEAD(&hlist[hash]); if ((fp = fopen(“./item.txt”, “r”)) ==NULL){ printf(“Error opening file/n”); return -1; } struct ST st[100]; memset(st, 0, sizeof(st)); int i=0; //int len=0; fgets(buffer,sizeof(buffer),fp); while(buffer&&!feof(fp)) { //len=strlen(buffer); //printf(“%d: %s”,++i,buffer); attach(buffer,&st[i++]); fgets(buffer,sizeof(buffer),fp); } //output_list(&list); struct ST * search; struct hlist_node *hp; char buf[50]; printf(“/n/ninput :/n”); scanf(“%s”,buf); strcat(buf,”/n”); //通过hash串查找内容”maqian” hash = gethash(buf); printf(“/n/n/nhash %d/n”,hash % HASH_NUM); hlist_for_each(hp, &hlist[hash % HASH_NUM]) { search = hlist_entry(hp, struct ST, i_hash); printf(“hash search result: %s/n”, search->str); } fclose(fp); return 0;}the list.h is #ifndef _LINUX_LIST_H#define _LINUX_LIST_H#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) ); } )static inline void prefetch(const void *x) {;}static inline void prefetchw(const void *x) {;}#define LIST_POISON1 ((void *) 0x00100100)#define LIST_POISON2 ((void *) 0x00200200)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);}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_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_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;}/*** 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){ if (!list_empty(list)) __list_splice(list, head);}/*** list_splice_init – join two lists and reinitialise the emptied list.* @list: the new list to add.* @head: the place to add it in the first list.** The list at @list is reinitialised*/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; prefetch(pos->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; prefetch(pos->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); / prefetch(pos->member.next), &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); / prefetch(pos->member.prev), &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_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))//HASH LISTstruct hlist_head { struct hlist_node *first;};struct hlist_node { struct hlist_node *next, **pprev;};#define HLIST_HEAD_INIT { .first = NULL }#define HLIST_HEAD(name) struct hlist_head name = { .first = NULL }#define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL)#define INIT_HLIST_NODE(ptr) ((ptr)->next = NULL, (ptr)->pprev = NULL)static inline int hlist_unhashed(const struct hlist_node *h){ return !h->pprev;}static inline int hlist_empty(const struct hlist_head *h){ return !h->first;}static inline void __hlist_del(struct hlist_node *n){ struct hlist_node *next = n->next; struct hlist_node **pprev = n->pprev; *pprev = next; if (next) next->pprev = pprev;}static inline void hlist_del(struct hlist_node *n){ __hlist_del(n); n->next = LIST_POISON1; n->pprev = LIST_POISON2;}static inline void hlist_del_init(struct hlist_node *n){ if (n->pprev) { __hlist_del(n); INIT_HLIST_NODE(n); }}static inline void hlist_add_head(struct hlist_node *n, struct hlist_head *h){ struct hlist_node *first = h->first; n->next = first; if (first) first->pprev = &n->next; h->first = n; n->pprev = &h->first;}/* next must be != NULL */static inline void hlist_add_before(struct hlist_node *n, struct hlist_node *next){ n->pprev = next->pprev; n->next = next; next->pprev = &n->next; *(n->pprev) = n;}static inline void hlist_add_after(struct hlist_node *n, struct hlist_node *next){ next->next = n->next; n->next = next; next->pprev = &n->next; if(next->next) next->next->pprev = &next->next;}#define hlist_entry(ptr, type, member) container_of(ptr,type,member)#define hlist_for_each(pos, head) / for (pos = (head)->first; pos && ({ prefetch(pos->next); 1; }); / pos = pos->next)#define hlist_for_each_safe(pos, n, head) / for (pos = (head)->first; pos && ({ n = pos->next; 1; }); / pos = n)#define hlist_for_each_entry(tpos, pos, head, member) / for (pos = (head)->first; / pos && ({ prefetch(pos->next); 1;}) && / ({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); / pos = pos->next)#define hlist_for_each_entry_continue(tpos, pos, member) / for (pos = (pos)->next; / pos && ({ prefetch(pos->next); 1;}) && / ({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); / pos = pos->next)#define hlist_for_each_entry_from(tpos, pos, member) / for (; pos && ({ prefetch(pos->next); 1;}) && / ({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); / pos = pos->next)#define hlist_for_each_entry_safe(tpos, pos, n, head, member) / for (pos = (head)->first; / pos && ({ n = pos->next; 1; }) && / ({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); / pos = n)#endifthe item.txt is as the following:theway@gmail.comtaheway@gmail.comtheway@gmail.comth1eway@gmail.comtheway@gmail.comtheway@gmail.comtheaway@sina.comthedway@gmail.comtheway@gmail.comtheway@gmail.comthaeway@gmail.comtheway@gmail.comtheway@gmail.comtheaway@sina.comthaeaway@sina.comtheaway@sina.comtheaway@sina.comtheaaway@sina.com1theaway@sina.comtheaway@sina.com.cntheaway@sina.comabc@163.comw12@eamil.bjut.edutheuo@emails.bjut.edu.cnthe_way_ma@hotmail.com13810sdfs73761113310gggggggggggg7376111aaaaaaaa38d073761113810d3774356611123456735434没有一种不通过蔑视、忍受和奋斗就可以征服的命运。
