表目管理代码示例（迸发访问，多重索引查找，添加，删除，）

于 2017-05-21 17:57:42 发布
阅读量559 收藏 1
点赞数
分类专栏： Linux应用开发技术
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.youkuaiyun.com/crazycoder8848/article/details/72599928
版权

由于在下水平相当有限，不当之处还望大家不吝赐教。


程序设计中，常常会涉及到各种各样的表目的管理。

如表目的添加，删除，查找等。

其中，查找操作，有可能需要支持多种方式，例如，根据id查找，根据某个属性查找，或者根据多个属性进行查找等。

另外，还需要妥善处理好迸发问题，又要兼顾效率。

那么要如何设计表管理模块，才能实现这些目标呢？

这里上一份代码，供大家参考。

注意，完整的可运行代码，在Linux-dev-framework软件包中（详细信息可参考http://blog.youkuaiyun.com/crazycoder8848/article/details/22491525）。


1. 头文件 tab_xxx.h

/* 
 * 本软件为免费、开源软件。
 * 本软件的版权(包括源码及二进制发布版本)归一切公众所有。
 * 您可以自由使用、传播本软件。
 * 您也可以以任何形式、任何目的使用本软件(包括源码及二进制发布版本)，而不受任何版权限制。
 * =====================
 * 作者: 孙明保
 * 邮箱: sunmingbao@126.com
 */

#ifndef __TAB_XXX_H_
#define __TAB_XXX_H_

#include <stdint.h>
#include <pthread.h>
#include "list.h"

typedef struct
{
	struct list_head  all;
	struct list_head  by_id;
	struct list_head  by_key;

	uint32_t ref_cnt;
	pthread_spinlock_t lock;

	uint16_t id;
	uint32_t a;
	uint32_t b;
	uint32_t c;
	uint32_t priv_data;
} t_tab_xxx_entry;

int tab_xxx_init(int max_entry_num);

int tab_xxx_add_entry(uint32_t a, uint32_t b, uint32_t c, uint32_t priv_data);
int tab_xxx_del_entry_by_key(uint32_t a, uint32_t b, uint32_t c);
void * tab_xxx_get_entry_by_key(uint32_t a, uint32_t b, uint32_t c);
void * tab_xxx_get_entry_by_id(uint16_t id);
void   tab_xxx_put(t_tab_xxx_entry *pt_entry);
uint32_t tab_xxx_entry_num();
void tab_xxx_dump_all_entry();
#endif

2. 实现文件  tab_xxx.c 

/* 
 * 本软件为免费、开源软件。
 * 本软件的版权(包括源码及二进制发布版本)归一切公众所有。
 * 您可以自由使用、传播本软件。
 * 您也可以以任何形式、任何目的使用本软件(包括源码及二进制发布版本)，而不受任何版权限制。
 * =====================
 * 作者: 孙明保
 * 邮箱: sunmingbao@126.com
 */

#include <errno.h>
#include "tab_xxx.h"
#include "debug.h"
#include "mm.h"

#define    MAX_HASH_LINE_NUM    (1024)

typedef struct
{
	MM_HANDLE mem_pool;

	pthread_spinlock_t add_del_lock;

	uint32_t           entry_num_in_use;
	
	struct list_head   link_all;
	pthread_spinlock_t link_lock_all;
	
	struct list_head  hash_tab_by_id[MAX_HASH_LINE_NUM];
	pthread_spinlock_t hash_line_lock_by_id[MAX_HASH_LINE_NUM];
	
	struct list_head  hash_tab_by_key[MAX_HASH_LINE_NUM];
	pthread_spinlock_t hash_line_lock_by_key[MAX_HASH_LINE_NUM];
} t_xxx_tab;


static t_xxx_tab the_tab_xxx;

static uint32_t id_hash(uint16_t id)
{
    return id % MAX_HASH_LINE_NUM;
}

static uint32_t key_hash(uint32_t a, uint32_t b, uint32_t c)
{
    return (a*b*c) % MAX_HASH_LINE_NUM;
}

static void *search_entry_by_id_in_link(struct list_head   *head, uint16_t id)
{
	t_tab_xxx_entry *pt_entry;
	struct list_head *pos;
	
	list_for_each(pos, head)
	{
		pt_entry = list_entry(pos, t_tab_xxx_entry, by_id);
		if (id == pt_entry->id)
		{
			return pt_entry;
		}

	}

	return NULL;
}

static void *search_entry_by_id(uint16_t id)
{
	int line = id_hash(id);
	
	t_tab_xxx_entry *pt_entry;

	pthread_spin_lock(&(the_tab_xxx.hash_line_lock_by_id[line]));
	pt_entry = search_entry_by_id_in_link(&(the_tab_xxx.hash_tab_by_id[line]), id);
	pthread_spin_unlock(&(the_tab_xxx.hash_line_lock_by_id[line]));

	return pt_entry;
}

#define    MIN_ENTRY_ID    (1)
#define    MAX_ENTRY_ID    (65535)

static uint16_t gen_id()
{
	static     uint16_t     next_id = MIN_ENTRY_ID;
	uint16_t     ret;
	
	while (search_entry_by_id(next_id))
	{
		next_id++;
		
		if (next_id>MAX_ENTRY_ID)
			next_id = MIN_ENTRY_ID;
	}

	ret = next_id;

	next_id++;
		
	if (next_id>MAX_ENTRY_ID)
		next_id = MIN_ENTRY_ID;
	return ret;
}

static void *search_entry_by_key_in_link(struct list_head   *head, uint32_t a, uint32_t b, uint32_t c)
{
	t_tab_xxx_entry *pt_entry;
	struct list_head *pos;
	
	list_for_each(pos, head)
	{
		pt_entry = list_entry(pos, t_tab_xxx_entry, by_key);
		if ((a == pt_entry->a) &&
			(b == pt_entry->b) &&
			(c == pt_entry->c))
		{
			return pt_entry;
		}

	}

	return NULL;
}

static void *search_entry_by_key(uint32_t a, uint32_t b, uint32_t c)
{
	int line = key_hash(a, b, c);
	
	t_tab_xxx_entry *pt_entry;

	pthread_spin_lock(&(the_tab_xxx.hash_line_lock_by_key[line]));
	pt_entry = search_entry_by_key_in_link(&(the_tab_xxx.hash_tab_by_key[line]), a, b, c);
	pthread_spin_unlock(&(the_tab_xxx.hash_line_lock_by_key[line]));

	return pt_entry;
}

static void do_add_entry_to_all(t_tab_xxx_entry *pt_entry)
{
	pthread_spin_lock(&(the_tab_xxx.link_lock_all));
	list_add(&(pt_entry->all), &(the_tab_xxx.link_all));
	pthread_spin_unlock(&(the_tab_xxx.link_lock_all));
}

static void do_add_entry_to_id_hash(t_tab_xxx_entry *pt_entry)
{
	int line = id_hash(pt_entry->id);

	pthread_spin_lock(&(the_tab_xxx.hash_line_lock_by_id[line]));
	list_add(&(pt_entry->by_id), &(the_tab_xxx.hash_tab_by_id[line]));
	pthread_spin_unlock(&(the_tab_xxx.hash_line_lock_by_id[line]));

}
static void do_add_entry_to_key_hash(t_tab_xxx_entry *pt_entry)
{
	int line = key_hash(pt_entry->a, pt_entry->b, pt_entry->c);

	pthread_spin_lock(&(the_tab_xxx.hash_line_lock_by_key[line]));
	list_add(&(pt_entry->by_key), &(the_tab_xxx.hash_tab_by_key[line]));
	pthread_spin_unlock(&(the_tab_xxx.hash_line_lock_by_key[line]));

}


static void add_entry_into_tab(t_tab_xxx_entry *pt_entry)
{

    do_add_entry_to_id_hash(pt_entry);
	do_add_entry_to_key_hash(pt_entry);
	do_add_entry_to_all(pt_entry);
    the_tab_xxx.entry_num_in_use++;
}

static void do_del_entry_from_all(t_tab_xxx_entry *pt_entry)
{
	pthread_spin_lock(&(the_tab_xxx.link_lock_all));
	list_del(&(pt_entry->all));
	pthread_spin_unlock(&(the_tab_xxx.link_lock_all));
}

static void do_del_entry_from_id_hash(t_tab_xxx_entry *pt_entry)
{
	int line = id_hash(pt_entry->id);

	pthread_spin_lock(&(the_tab_xxx.hash_line_lock_by_id[line]));
	list_del(&(pt_entry->by_id));
	pthread_spin_unlock(&(the_tab_xxx.hash_line_lock_by_id[line]));

}
static void do_del_entry_from_key_hash(t_tab_xxx_entry *pt_entry)
{
	int line = key_hash(pt_entry->a, pt_entry->b, pt_entry->c);

	pthread_spin_lock(&(the_tab_xxx.hash_line_lock_by_key[line]));
	list_del(&(pt_entry->by_key));
	pthread_spin_unlock(&(the_tab_xxx.hash_line_lock_by_key[line]));

}

static void del_entry_from_tab(t_tab_xxx_entry *pt_entry)
{

    do_del_entry_from_id_hash(pt_entry);
	do_del_entry_from_key_hash(pt_entry);
	do_del_entry_from_all(pt_entry);
    the_tab_xxx.entry_num_in_use--;
}

int tab_xxx_init(int max_entry_num)
{
    int i;
	
    the_tab_xxx.mem_pool = create_buffer_manager(sizeof(t_tab_xxx_entry), max_entry_num);
	if (NULL == the_tab_xxx.mem_pool)
	{
        errno = ENOMEM;
		goto FAIL_EXIT;
	}

	pthread_spin_init(&(the_tab_xxx.add_del_lock), PTHREAD_PROCESS_PRIVATE);

	the_tab_xxx.entry_num_in_use = 0;
	INIT_LIST_HEAD(&(the_tab_xxx.link_all));
	pthread_spin_init(&(the_tab_xxx.link_lock_all), PTHREAD_PROCESS_PRIVATE);

	for (i=0; i<MAX_HASH_LINE_NUM; i++)
	{
		INIT_LIST_HEAD(&(the_tab_xxx.hash_tab_by_id[i]));
		pthread_spin_init(&(the_tab_xxx.hash_line_lock_by_id[i]), PTHREAD_PROCESS_PRIVATE);

		INIT_LIST_HEAD(&(the_tab_xxx.hash_tab_by_key[i]));
		pthread_spin_init(&(the_tab_xxx.hash_line_lock_by_key[i]), PTHREAD_PROCESS_PRIVATE);

	}
	
    return 0;
	
FAIL_EXIT:
	return -1;
}

static void build_new_entry(t_tab_xxx_entry *pt_entry, uint32_t a, uint32_t b, uint32_t c, uint32_t priv_data)
{
	pt_entry->id = gen_id();
	pt_entry->a = a;
	pt_entry->b = b;
	pt_entry->c = c;
	pt_entry->priv_data = priv_data;
	
	pt_entry->ref_cnt=1;
	pthread_spin_init(&(pt_entry->lock), PTHREAD_PROCESS_PRIVATE);

}

static void inc_entry_ref_cnt(t_tab_xxx_entry *pt_entry)
{
	pthread_spin_lock(&(pt_entry->lock));
	pt_entry->ref_cnt++;
	pthread_spin_unlock(&(pt_entry->lock));

}

static uint32_t dec_entry_ref_cnt(t_tab_xxx_entry *pt_entry)
{
    uint32_t ret;
	pthread_spin_lock(&(pt_entry->lock));
	pt_entry->ref_cnt--;
	ret = pt_entry->ref_cnt;
	pthread_spin_unlock(&(pt_entry->lock));

    return ret;
}

int tab_xxx_add_entry(uint32_t a, uint32_t b, uint32_t c, uint32_t priv_data)
{
    int ret = 0;
	t_tab_xxx_entry *pt_entry;
	
	pthread_spin_lock(&(the_tab_xxx.add_del_lock));

    if (NULL != search_entry_by_key(a, b, c))
	{
	    errno = EEXIST;
		ret = -1;
		goto EXIT;
	}

	pt_entry = alloc_buffer(the_tab_xxx.mem_pool);
    if (NULL == pt_entry)
	{
	    errno = ENOMEM;
		ret = -1;
		goto EXIT;
	}

	build_new_entry(pt_entry, a, b, c, priv_data);
    add_entry_into_tab(pt_entry);
	ret = pt_entry->id;

EXIT:
	pthread_spin_unlock(&(the_tab_xxx.add_del_lock));
	return ret;
}

void * tab_xxx_get_entry_by_key(uint32_t a, uint32_t b, uint32_t c)
{
	int line = key_hash(a, b, c);
	
	t_tab_xxx_entry *pt_entry;

	pthread_spin_lock(&(the_tab_xxx.hash_line_lock_by_key[line]));
	pt_entry = search_entry_by_key_in_link(&(the_tab_xxx.hash_tab_by_key[line]), a, b, c);
	if (pt_entry)
	{
        inc_entry_ref_cnt(pt_entry);
	}
	pthread_spin_unlock(&(the_tab_xxx.hash_line_lock_by_key[line]));

	return pt_entry;
}

void * tab_xxx_get_entry_by_id(uint16_t id)
{
	int line = id_hash(id);
	
	t_tab_xxx_entry *pt_entry;

	pthread_spin_lock(&(the_tab_xxx.hash_line_lock_by_id[line]));
	pt_entry = search_entry_by_id_in_link(&(the_tab_xxx.hash_tab_by_id[line]), id);
	if (pt_entry)
	{
		inc_entry_ref_cnt(pt_entry);
	}
	pthread_spin_unlock(&(the_tab_xxx.hash_line_lock_by_id[line]));

	return pt_entry;
}


void   tab_xxx_put(t_tab_xxx_entry *pt_entry)
{
    uint32_t ret = dec_entry_ref_cnt(pt_entry);
	
	if (0 == ret)
	{
	    /* everything needed for delete has been done, except free buffer */
		free_buffer(the_tab_xxx.mem_pool, pt_entry);
	}
}

int tab_xxx_del_entry_by_key(uint32_t a, uint32_t b, uint32_t c)
{
	int ret = 0;
	t_tab_xxx_entry *pt_entry;
	
	pthread_spin_lock(&(the_tab_xxx.add_del_lock));
	pt_entry = search_entry_by_key(a, b, c);

	if (!pt_entry)
	{
		errno = ESRCH;
		ret = -1;
		goto EXIT;
	}


	del_entry_from_tab(pt_entry);
	tab_xxx_put(pt_entry);

EXIT:
	pthread_spin_unlock(&(the_tab_xxx.add_del_lock));
	return ret;
}


uint32_t tab_xxx_entry_num()
{
	uint32_t   entry_num_in_use;
	
	pthread_spin_lock(&(the_tab_xxx.add_del_lock));
	entry_num_in_use = the_tab_xxx.entry_num_in_use;
	pthread_spin_unlock(&(the_tab_xxx.add_del_lock));

	return entry_num_in_use;
}

void tab_xxx_dump_all_entry()
{
	t_tab_xxx_entry *pt_entry;
	
	struct list_head *pos, *head;
	
	pthread_spin_lock(&(the_tab_xxx.add_del_lock));

	head = &(the_tab_xxx.link_all);
	
	list_for_each(pos, head)
	{
		pt_entry = list_entry(pos, t_tab_xxx_entry, all);
		printf("id=%hu", pt_entry->id);

	}
	pthread_spin_unlock(&(the_tab_xxx.add_del_lock));
}


评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值