thread pool

之前的代码,在执行完任务后,没有对任务进行释放,是有将任务队列改成任务资源回收重复利用以减少内存频繁分配释放的想法,这里还是先加上了,作为半成品用着先。

pool.h

#ifndef _TASK_QUEUE_
#define _TASK_QUEUE_
#include <pthread.h>
//#include <stdarg.h>
#ifdef __cpluscplus_
extern "C"{
#endif
struct pool_tasks{
	//task interface
        void (*excute)(void* param);
	//task param
        void* param;
	//task queue link
        struct pool_tasks* next;
};
struct pool_ctx{
	//numbers of thead
        int worker_size;
	//max size of threads pool
        int max_worker_size;//
	//size indicate the task numbers in the queue 
        int queue_size;
	//a flag to control the workers exit or not,set to 1 means exit,0 means continue running
        int exit;
	//dynamic space to store all worker threads id
        pthread_t *threads_id;
        pthread_mutex_t queue_mutex;
        pthread_cond_t worker_cond;
	//
        struct pool_tasks* header;
        struct pool_tasks* tailer;
};

struct pool_ctx* thread_pool_init(int);
int thread_pool_add(struct pool_ctx*,void*,void (*)(void*));
int thread_pool_close(struct pool_ctx*);
#ifdef __cplusplus
}
#endif
#endif


pool.c

#include <errno.h>
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include "thread_pool.h"

void pthread_main(void* arg){
	struct pool_ctx* pool = (struct pool_ctx*)arg;
	while(1/*!pool->exit*/){
		struct pool_tasks* exce_task = NULL;
		pthread_mutex_lock(&pool->queue_mutex);
		if(pool->queue_size == 0 && pool->exit){//exit
			pthread_mutex_unlock(&pool->queue_mutex);
                        break;
		}
		if(pool->queue_size == 0){//sleep
			pthread_cond_wait(&pool->worker_cond,&pool->queue_mutex);
                        pthread_mutex_unlock(&pool->queue_mutex);
		}
		else{//there are tasks in the queue
			//get the head task from queue
                        exce_task = pool->header;
                        //move next task up to the head of the queue
                        pool->header = pool->header->next;
                        if(0 == --pool->queue_size)
				pool->tailer = NULL;

                        pthread_mutex_unlock(&pool->queue_mutex);
                        
                        //excute task...
                        exce_task->excute(exce_task->param);
                        //free task?
                        //no,we don't free the data here instead of letting the client to free it
                        //by himself in the business
                        free(exce_task);//20140928
                        exce_task = NULL;//20140928
		}
	}
} 
struct pool_ctx* thread_pool_init(int size){
	//allocate memory for pool
	struct pool_ctx* pool = (struct pool_ctx*)malloc(/*size **/sizeof(struct pool_ctx));
	//malloc failed
	if(NULL == pool){
		printf("create thread pool error.errno=%d,%s\n",errno,strerror(errno));
		return NULL;
	}

	//initialize mutex
	if(0 != pthread_mutex_init(&pool->queue_mutex,NULL)){
		printf("pthread_mutex_init queue_mutex error,errno=%d,%s,free pool\n",errno,strerror(errno));
		//free the memory allocated before,then return NULL.
		free(pool);
		return NULL;
	}

	//initialize cond
	if(0 != pthread_cond_init(&pool->worker_cond,NULL)){
		printf("pthread_cond_init worker_cond error,errno=%d,%s,free pool\n",errno,strerror);
		//destroy mutex initialized beore
		pthread_mutex_destroy(&pool->queue_mutex);
		//free memory allocated before
		free(pool);
		//return
		return NULL;
	}

	//allocate sequence memory space for multiple pthread_t id
	pool->threads_id = (pthread_t*)malloc(size * sizeof(pthread_t));
	if(NULL == pool->threads_id){
		printf("malloc multiple pthread_t error,errno=%d,%s\n",errno,strerror(errno));
		//destroy mutex initialized beore
                pthread_mutex_destroy(&pool->queue_mutex);
		//destroy cond initialized before
		pthread_cond_destroy(&pool->worker_cond);
                //free memory allocated before
                free(pool);
                //return
                return NULL;
	}
	
	
        pool->max_worker_size = size;
        pool->worker_size = size;
        pool->queue_size = 0;
        pool->exit = 0;
        pool->header = NULL;
        pool->tailer = NULL;

	//create worker threads
	int idx;
	for(idx = 0; idx < size; ++ idx)
		pthread_create(&pool->threads_id[idx],NULL,(void*(*)(void*))pthread_main,pool);

	return pool;
}

int thread_pool_add(struct pool_ctx* pool,void* param,void (*call_back)(void* param)){
	if(NULL == pool){
		printf("thread pool is null..add return.\n");
		return -1;
	}
	if(NULL == call_back){
		printf("task function is NULL,no task added.\n");
		return -1;
	}
	struct pool_tasks* new_task = malloc(sizeof(struct pool_tasks));
	if(NULL == new_task){
		printf("create new task error,errno=%d,%s\n",errno,strerror(errno));
		return -1;
	}
	new_task->param = param;
	new_task->excute = call_back;
	new_task->next = NULL;
	pthread_mutex_lock(&pool->queue_mutex);
	if(0 == pool->queue_size){
		pool->header = new_task;
		pool->tailer = new_task;
	}
	else{
		pool->tailer->next = new_task;
		pool->tailer = new_task;
	}
	++pool->queue_size;
	pthread_cond_signal(&pool->worker_cond);
	pthread_mutex_unlock(&pool->queue_mutex);
}

int thread_pool_close(struct pool_ctx* pool){
	if(NULL == pool)
		return 0;

	//set the global flag to exit,and broadcast the signal
	pthread_mutex_lock(&pool->queue_mutex);
	pool->exit = 1;
	//release the queue
	/*while(pool->queue_size > 0){
		pool_tasks* tmp = pool->header;
		pool->header = pool->header->next;
		--pool->queue_size;
		free(tmp);
	}*/
	pthread_cond_broadcast(&pool->worker_cond);
	pthread_mutex_unlock(&pool->queue_mutex);

	//join all worker threads
	int idx;
	for(idx = 0; idx < pool->worker_size; ++ idx)
		pthread_join(pool->threads_id[idx],NULL);
	//release threads resource
	free(pool->threads_id);
	pool->threads_id = NULL;

	//release mutex and cond
	pthread_cond_destroy(&pool->worker_cond);
	pthread_mutex_destroy(&pool->queue_mutex);
	free(pool);
	pool = NULL;

	return 0;
}


test.c

#include <stdio.h>
#include "thread_pool.h"
void mycb(void* arg);
int main(int argc,char** argv){
        struct pool_ctx* pool = thread_pool_init(5);
        int i;
        for(i =0;i < 1000; ++i)
                thread_pool_add(pool,(void*)i,(void (*)(void*))mycb);
        thread_pool_close(pool);
        return 0;
}
void mycb(void* arg){
        int i = (int)arg;
        printf("%d\n",i);
}
gcc -g -c thread_pool.c -lthread -o threadpool.o
gcc -lpthread thread_pool_test.c threadpool.o



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
东南亚位于我国倡导推进的“一带一路”海陆交汇地带,作为当今全球发展最为迅速的地区之一,近年来区域内生产总值实现了显著且稳定的增长。根据东盟主要经济体公布的最新数据,印度尼西亚2023年国内生产总值(GDP)增长5.05%;越南2023年经济增长5.05%;马来西亚2023年经济增速为3.7%;泰国2023年经济增长1.9%;新加坡2023年经济增长1.1%;柬埔寨2023年经济增速预计为5.6%。 东盟国家在“一带一路”沿线国家中的总体GDP经济规模、贸易总额与国外直接投资均为最大,因此有着举足轻重的地位和作用。当前,东盟与中国已互相成为双方最大的交易伙伴。中国-东盟贸易总额已从2013年的443亿元增长至 2023年合计超逾6.4万亿元,占中国外贸总值的15.4%。在过去20余年中,东盟国家不断在全球多变的格局里面临挑战并寻求机遇。2023东盟国家主要经济体受到国内消费、国外投资、货币政策、旅游业复苏、和大宗商品出口价企稳等方面的提振,经济显现出稳步增长态势和强韧性的潜能。 本调研报告旨在深度挖掘东南亚市场的增长潜力与发展机会,分析东南亚市场竞争态势、销售模式、客户偏好、整体市场营商环境,为国内企业出海开展业务提供客观参考意见。 本文核心内容: 市场空间:全球行业市场空间、东南亚市场发展空间。 竞争态势:全球份额,东南亚市场企业份额。 销售模式:东南亚市场销售模式、本地代理商 客户情况:东南亚本地客户及偏好分析 营商环境:东南亚营商环境分析 本文纳入的企业包括国外及印尼本土企业,以及相关上下游企业等,部分名单 QYResearch是全球知名的大型咨询公司,行业涵盖各高科技行业产业链细分市场,横跨如半导体产业链(半导体设备及零部件、半导体材料、集成电路、制造、封测、分立器件、传感器、光电器件)、光伏产业链(设备、硅料/硅片、电池片、组件、辅料支架、逆变器、电站终端)、新能源汽车产业链(动力电池及材料、电驱电控、汽车半导体/电子、整车、充电桩)、通信产业链(通信系统设备、终端设备、电子元器件、射频前端、光模块、4G/5G/6G、宽带、IoT、数字经济、AI)、先进材料产业链(金属材料、高分子材料、陶瓷材料、纳米材料等)、机械制造产业链(数控机床、工程机械、电气机械、3C自动化、工业机器人、激光、工控、无人机)、食品药品、医疗器械、农业等。邮箱:market@qyresearch.com

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值