put struct list_head and struct hlist_head into the application

最新推荐文章于 2024-10-10 22:52:16 发布
最新推荐文章于 2024-10-10 22:52:16 发布
阅读量1.2k 收藏 1
点赞数
分类专栏： linux programming 文章标签： struct list application each buffer null
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/thewayma/article/details/3680503
版权



#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 1024


LIST_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 function
unsigned 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 LIST
struct 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)

#endif



the item.txt is as the following:

theway@gmail.com
taheway@gmail.com
theway@gmail.com
th1eway@gmail.com
theway@gmail.com
theway@gmail.com
theaway@sina.com
thedway@gmail.com
theway@gmail.com
theway@gmail.com
thaeway@gmail.com
theway@gmail.com
theway@gmail.com
theaway@sina.com
thaeaway@sina.com
theaway@sina.com
theaway@sina.com
theaaway@sina.com
1theaway@sina.com
theaway@sina.com.cn
theaway@sina.com
abc@163.com
w12@eamil.bjut.edu
theuo@emails.bjut.edu.cn
the_way_ma@hotmail.com
13810sdfs737611
13310gggggggggggg737611
1aaaaaaaa38d0737611
13810d3774356611
1
2
3
4
5
6
7
35434
thewayma
关注
专栏目录
探索 io_uring：理解高效异步 IO 的工作原理与实现细节
一枚菜鸡
07-20 1061
io_uring 是一个 Linux 内核提供的高性能异步 I/O 框架，最初在 Linux 5.1 版本中引入。它的设计目标是解决传统的异步 I/O 模型（如 epoll 或者 POSIX AIO）在大规模 I/O 操作中效率不高的问题。关键特点和优势包括：零拷贝操作：io_uring 允许应用程序直接将数据从用户空间提交给内核，而无需在用户空间和内核空间之间进行额外的数据拷贝操作，从而减少了系统调用的开销。
18.1 KSM实现
Do one thing at a time, and do well.
07-21 904
KSM在初始化是会创建一个名为"ksmd"的内核线程。 [mm/ksm.c] static int __init ksm_init(void) { struct task_struct *ksm_thread; int err; err = ksm_slab_init(); if (err) goto out; ksm_thread = kthread_run(ksm_scan_thread, NULL, "ksmd"); if (I
操作系统与存储：解析Linux内核全新异步IO引擎io_uring设计与实现
腾讯技术工程
02-19 1667
作者：draculaqian，腾讯后台开发工程师引言存储场景中，我们对性能的要求非常高。在存储引擎底层的IO技术选型时，可能会有如下讨论关于IO的讨论。http://davmac.org/...
SOCK_RAW Demystified
u014304293的专栏
10-26 1041
// SOCK_RAW Demystified by ithilgore - ithilgore.ryu.L@gmail.com sock-raw.org / sock-raw.homeunix.org May 2008 0x0. Index 0x1. Introduction 0x2. Creation 0x3. IP_HDRINCL 0x4. raw input 0x5. raw
OVS 源码分析
junhanyan的博客
03-22 3562
OVS 核心代码 datapath 目录ovs-switchdOVS数据库管理ofproto OVS 架构 OVS 主要的数据结构 数据结构关系图 主要的数据结构和数据结构的参数 数据结构代码 vvport /** - struct vport - one port within a datapath - @rcu: RCU callback
Android Binder design and implementation
vichie2008的专栏
06-19 1811
copy from http://www.programering.com/a/MjMyMDMwATQ.html Abstract Binder is a Android system interprocess communication (IPC) is one of the ways. Linux already has a pipeline, system V IPC, socket I
Android进程间通信（IPC）机制Binder简要介绍和学习计划
zhaoweixing1989的专栏
04-19 2318
在Android系统中，每一个应用程序都是由一些Activity和Service组成的，一般Service运行在独立的进程中，而Activity有可能运行在同一个进程中，也有可能运行在不同的进程中。那么，不在同一个进程的Activity或者Service是如何通信的呢？这就是本文中要介绍的Binder进程间通信机制了。         我们知道，Android系统是基于Linux内核的，而Lin
The Virtual Filesystem (Linux)
weixin_33671935的博客
06-04 108
2019独角兽企业重金招聘Python工程师标准>>> ...
lvs四层负载均衡
fengcai_ke的博客
07-18 807
lvs源码分析
Android Binder 机制初步学习 笔记（一）—— 概述及数据结构介绍
小石不识月，呼作白玉盘。
09-25 903
Binder 机制简介 Binder 基础数据结构分析
Android 8.0系统源码分析--应用进程启动过程分析
红旺永福
12-24 2124
Android 8.0源码分析
linux netlink详解
白日梦想家霍华特的博客
04-29 560
netlink从用户态到内核态原理解析
深入理解Linux内核第3版--笔记-3.pdf
u011961033的专栏
10-16 739
Chapter 12. The Virtual Filesystem    five standard Unix file:       1:regular files,2.directories,3.symbolic links,4.Device files,5. pipes    12.1. The Role of the Virtual Filesystem (VFS)     Fi...
Android 8.0系统源码分析--Binder进程间通信（二）
红旺永福
12-03 2136
Android 8.0系统源码分析--Binder进程间通信（二），按照老罗书的结构，结合8.0最新源码来分析android移动操作系统。
Linux---signal(usr mode application) 编程
thewayma的专栏
09-30 961
Linux---signal(usr mode application) 编程##uid_t getuid(void);uid_t geteuid(void);组ID,有效组IDuid_t getgid(void);uid_t getegid(void);信号不可靠的signalAPI#void (*signal)(int sig,void (*func)(int)))(int)typedef v
linux中wait系统调用
thewayma的专栏
11-23 701
系统中的僵尸进程都要由wait系统调用来回收，下面就通过实战看一看wait的具体用法：wait的函数原型是：#include /* 提供类型pid_t的定义 */#include pid_t wait(int *status);进程一旦调用了wait，就立即阻塞自己，由wait自动分析是否当前进程的某个子进程已经退出，如果让它找到了这样一个已经变成僵尸的子进
linux process fork related
thewayma的专栏
11-23 596
to demonstrate the underlying principle of the unix api fork and fork-related contents(wait waitpid) etc, i wrote these two pieces of code as following , both of which repersented my personal understa
图解Redis 03 | List数据类型的原理及应用场景
最新发布
大厂小码农的博客
10-10 757
List是一个简单的字符串列表，按照元素的插入顺序进行排序。您可以从头部或尾部添加元素到这个列表中。列表的最大长度为2^32 - 1，即支持多达40亿个元素。
解释struct crypto_queue { struct list_head list; struct list_head *backlog; unsigned int qlen; unsigned int max_qlen; };
07-15
struct list_head list; // 队列的链表头 struct list_head *backlog; // 指向积压请求的指针 unsigned int qlen; // 队列中当前的请求数量 unsigned int max_qlen; // 队列的最大容量 }; ``` 下面对每个成员...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值