大旗谷资源网 Design By www.zqyou.com
Linux C线程池
三个文件
1 tpool.h
typedef struct tpool_work {
void (*routine)(void *);
void *arg;
struct tpool_work *next;
} tpool_work_t;
typedef struct tpool {
/* pool characteristics */
int num_threads;
int max_queue_size;
/* pool state */
pthread_t *tpid;
tpool_work_t *queue;
int front, rear;
/* 剩下的任务可以做完, 但不能再加新的任务 */
int queue_closed;
/* 剩下的任务都不做了, 直接关闭 */
int shutdown;
/* pool synchronization */
pthread_mutex_t queue_lock;
pthread_cond_t queue_has_task;
pthread_cond_t queue_has_space;
pthread_cond_t queue_empty;
} *tpool_t;
void tpool_init(tpool_t *tpoolp,int num_threads, int max_queue_size);
int tpool_add_work(tpool_t tpool,void(*routine)(void *), void *arg);
int tpool_destroy(tpool_t tpool,int finish);
2 tpool.c
#include <stdlib.h>
#include <stdio.h>
#include <unistd.h>
#include <sys/types.h>
#include <string.h>
#include <pthread.h>
#include "tpool.h"
#define DEBUG
#if defined(DEBUG)
#define debug(...) do { \
flockfile(stdout); \
printf("###%p.%s: ", (void *)pthread_self(), __func__); \
printf(__VA_ARGS__); \
putchar('\n'); \
fflush(stdout); \
funlockfile(stdout); \
} while (0)
#else
#define debug(...)
#endif
void *tpool_thread(void *);
void tpool_init(tpool_t *tpoolp, int num_worker_threads, int max_queue_size)
{
int i;
tpool_t pool;
pool = (tpool_t)malloc(sizeof(struct tpool));
if (pool == NULL) {
perror("malloc");
exit(0);
}
pool->num_threads = 0;
pool->max_queue_size = max_queue_size + 1;
pool->num_threads = num_worker_threads;
pool->tpid = NULL;
pool->front = 0;
pool->rear = 0;
pool->queue_closed = 0;
pool->shutdown = 0;
if (pthread_mutex_init(&pool->queue_lock, NULL) == -1) {
perror("pthread_mutex_init");
free(pool);
exit(0);
}
if (pthread_cond_init(&pool->queue_has_space, NULL) == -1) {
perror("pthread_mutex_init");
free(pool);
exit(0);
}
if (pthread_cond_init(&pool->queue_has_task, NULL) == -1) {
perror("pthread_mutex_init");
free(pool);
exit(0);
}
if (pthread_cond_init(&pool->queue_empty, NULL) == -1) {
perror("pthread_mutex_init");
free(pool);
exit(0);
}
if ((pool->queue = malloc(sizeof(struct tpool_work) *
pool->max_queue_size)) == NULL) {
perror("malloc");
free(pool);
exit(0);
}
if ((pool->tpid = malloc(sizeof(pthread_t) * num_worker_threads)) == NULL) {
perror("malloc");
free(pool);
free(pool->queue);
exit(0);
}
for (i = 0; i < num_worker_threads; i++) {
if (pthread_create(&pool->tpid[i], NULL, tpool_thread,
(void *)pool) != 0) {
perror("pthread_create");
exit(0);
}
}
*tpoolp = pool;
}
int empty(tpool_t pool)
{
return pool->front == pool->rear;
}
int full(tpool_t pool)
{
return ((pool->rear + 1) % pool->max_queue_size == pool->front);
}
int size(tpool_t pool)
{
return (pool->rear + pool->max_queue_size -
pool->front) % pool->max_queue_size;
}
int tpool_add_work(tpool_t tpool, void(*routine)(void *), void *arg)
{
tpool_work_t *temp;
pthread_mutex_lock(&tpool->queue_lock);
while (full(tpool) && !tpool->shutdown && !tpool->queue_closed) {
pthread_cond_wait(&tpool->queue_has_space, &tpool->queue_lock);
}
if (tpool->shutdown || tpool->queue_closed) {
pthread_mutex_unlock(&tpool->queue_lock);
return -1;
}
int is_empty = empty(tpool);
temp = tpool->queue + tpool->rear;
temp->routine = routine;
temp->arg = arg;
tpool->rear = (tpool->rear + 1) % tpool->max_queue_size;
if (is_empty) {
debug("signal has task");
pthread_cond_broadcast(&tpool->queue_has_task);
}
pthread_mutex_unlock(&tpool->queue_lock);
return 0;
}
void *tpool_thread(void *arg)
{
tpool_t pool = (tpool_t)(arg);
tpool_work_t *work;
for (;;) {
pthread_mutex_lock(&pool->queue_lock);
while (empty(pool) && !pool->shutdown) {
debug("I'm sleep");
pthread_cond_wait(&pool->queue_has_task, &pool->queue_lock);
}
debug("I'm awake");
if (pool->shutdown == 1) {
debug("exit");
pthread_mutex_unlock(&pool->queue_lock);
pthread_exit(NULL);
}
int is_full = full(pool);
work = pool->queue + pool->front;
pool->front = (pool->front + 1) % pool->max_queue_size;
if (is_full) {
pthread_cond_broadcast(&pool->queue_has_space);
}
if (empty(pool)) {
pthread_cond_signal(&pool->queue_empty);
}
pthread_mutex_unlock(&pool->queue_lock);
(*(work->routine))(work->arg);
}
}
int tpool_destroy(tpool_t tpool, int finish)
{
int i;
pthread_mutex_lock(&tpool->queue_lock);
tpool->queue_closed = 1;
if (finish == 1) {
debug("wait all work done");
while (!empty(tpool)) {
pthread_cond_wait(&tpool->queue_empty, &tpool->queue_lock);
}
}
tpool->shutdown = 1;
pthread_mutex_unlock(&tpool->queue_lock);
pthread_cond_broadcast(&tpool->queue_has_task);
debug("wait worker thread exit");
for (i = 0; i < tpool->num_threads; i++) {
pthread_join(tpool->tpid[i], NULL);
}
debug("free thread pool");
free(tpool->tpid);
free(tpool->queue);
free(tpool);
}
3 tpooltest.c
#include <stdio.h>
#include <pthread.h>
#include "tpool.h"
char *str[]={"string 0", "string 1", "string 2",
"string 3", "string 4", "string 5"};
void job(void * jobstr)
{
long i, x;
for (i = 0; i < 100000000; i++) {
x = x +i;
}
printf("%s\n", (char *)jobstr);
}
int main(void)
{
int i;
tpool_t test_pool;
tpool_init(&test_pool, 8, 20);
for ( i = 0; i < 5; i++) {
tpool_add_work(test_pool, job, str[i]);
}
tpool_destroy(test_pool, 1);
return 0;
}
感谢阅读,希望能帮助到大家,谢谢大家对本站的支持!
大旗谷资源网 Design By www.zqyou.com
广告合作:本站广告合作请联系QQ:858582 申请时备注:广告合作(否则不回)
免责声明:本站文章均来自网站采集或用户投稿,网站不提供任何软件下载或自行开发的软件! 如有用户或公司发现本站内容信息存在侵权行为,请邮件告知! 858582#qq.com
免责声明:本站文章均来自网站采集或用户投稿,网站不提供任何软件下载或自行开发的软件! 如有用户或公司发现本站内容信息存在侵权行为,请邮件告知! 858582#qq.com
大旗谷资源网 Design By www.zqyou.com
暂无Linux C线程池简单实现实例的评论...
《魔兽世界》大逃杀!60人新游玩模式《强袭风暴》3月21日上线
暴雪近日发布了《魔兽世界》10.2.6 更新内容,新游玩模式《强袭风暴》即将于3月21 日在亚服上线,届时玩家将前往阿拉希高地展开一场 60 人大逃杀对战。
艾泽拉斯的冒险者已经征服了艾泽拉斯的大地及遥远的彼岸。他们在对抗世界上最致命的敌人时展现出过人的手腕,并且成功阻止终结宇宙等级的威胁。当他们在为即将于《魔兽世界》资料片《地心之战》中来袭的萨拉塔斯势力做战斗准备时,他们还需要在熟悉的阿拉希高地面对一个全新的敌人──那就是彼此。在《巨龙崛起》10.2.6 更新的《强袭风暴》中,玩家将会进入一个全新的海盗主题大逃杀式限时活动,其中包含极高的风险和史诗级的奖励。
《强袭风暴》不是普通的战场,作为一个独立于主游戏之外的活动,玩家可以用大逃杀的风格来体验《魔兽世界》,不分职业、不分装备(除了你在赛局中捡到的),光是技巧和战略的强弱之分就能决定出谁才是能坚持到最后的赢家。本次活动将会开放单人和双人模式,玩家在加入海盗主题的预赛大厅区域前,可以从强袭风暴角色画面新增好友。游玩游戏将可以累计名望轨迹,《巨龙崛起》和《魔兽世界:巫妖王之怒 经典版》的玩家都可以获得奖励。
更新日志
2025年11月23日
2025年11月23日
- 小骆驼-《草原狼2(蓝光CD)》[原抓WAV+CUE]
- 群星《欢迎来到我身边 电影原声专辑》[320K/MP3][105.02MB]
- 群星《欢迎来到我身边 电影原声专辑》[FLAC/分轨][480.9MB]
- 雷婷《梦里蓝天HQⅡ》 2023头版限量编号低速原抓[WAV+CUE][463M]
- 群星《2024好听新歌42》AI调整音效【WAV分轨】
- 王思雨-《思念陪着鸿雁飞》WAV
- 王思雨《喜马拉雅HQ》头版限量编号[WAV+CUE]
- 李健《无时无刻》[WAV+CUE][590M]
- 陈奕迅《酝酿》[WAV分轨][502M]
- 卓依婷《化蝶》2CD[WAV+CUE][1.1G]
- 群星《吉他王(黑胶CD)》[WAV+CUE]
- 齐秦《穿乐(穿越)》[WAV+CUE]
- 发烧珍品《数位CD音响测试-动向效果(九)》【WAV+CUE】
- 邝美云《邝美云精装歌集》[DSF][1.6G]
- 吕方《爱一回伤一回》[WAV+CUE][454M]