threadpool

#if !defined(_GNU_SOURCE)
#define _GNU_SOURCE
#endif

#define MIN_NUMBER 10

#include <stdio.h>
#include <stdlib.h>
#include <pthread.h>

//task structure
struct task
{
    int task_id;
    void (*function_pointer)(void);
    struct task* next;
};

//total tasks
int total_tasks = 0;

//request errors
int request_errors = 0;

//recursive mutex
pthread_mutex_t task_queue_mutex = PTHREAD_RECURSIVE_MUTEX_INITIALIZER_NP;

//conditional variable
pthread_cond_t active_task = PTHREAD_COND_INITIALIZER;

//thread ID's
int thr_id[MIN_NUMBER];

//thread array
pthread_t p_threads[MIN_NUMBER];

//linked list head
struct task* tasks = NULL;

//last node
struct task* bottom_task = NULL;

/*
*
*/

/*
*
*/

void *add_task(int task_num, pthread_mutex_t* mutex,
               pthread_cond_t* cond, void (*fp)(void))
{
    struct task* enqueue_task;
    int rs = 0; //return status

    enqueue_task = (struct task*)malloc(sizeof(struct task));

    if (!enqueue_task)
    {
        request_errors++;
        return;
    }

    enqueue_task->task_id = task_num;
    enqueue_task->function_pointer = fp;
    enqueue_task->next = NULL;

    rs = pthread_mutex_lock(mutex);

    if (total_tasks == 0)
    {
        tasks = enqueue_task;
        bottom_task = enqueue_task;
    }
    else
    {
        bottom_task->next = enqueue_task;
        bottom_task = enqueue_task;
    }

    total_tasks++;

    rs = pthread_mutex_unlock(mutex);

    rs = pthread_cond_signal(cond);
}

struct task* get_task(pthread_mutex_t* mutex)
{
    int rs;
    struct task* task;

    rs = pthread_mutex_lock(mutex);

    if (total_tasks > 0)
    {
        task = tasks;
        tasks = task->next;

        if (tasks == NULL)
        {
            bottom_task = NULL;
        }
        total_tasks--;
    }
    else
    {
        task = NULL;
    }

    rs = pthread_mutex_unlock(mutex);

    return task;
}

void execute_task(struct task* task, int thread_id)
{
    if (task)
    {

    }
}

void* handle_requests_loop(void* data)
{
    int rs;
    struct task* task;
    int thread_id = *((int*)data);

    rs = pthread_mutex_lock(&task_queue_mutex);

    while (1)
    {
        if (total_tasks > 0)
        {
            task = get_task(&task_queue_mutex);
            if (task)
            {
                rs = pthread_mutex_unlock(&task_queue_mutex);
                execute_task(task, thread_id);
                free(task);
                rs = pthread_mutex_lock(&task_queue_mutex);
            }
            else
            {
                rs = pthread_cond_wait(&active_task, &task_queue_mutex);
            }
        }
    }
}

int thread_pool_init(int num_threads)
{
    int iterator;

    for (iterator = 0; iterator < num_threads; iterator++)
    {
        thr_id[iterator] = iterator;
        pthread_create(&p_threads[iterator], NULL, handle_requests_loop,
                       (void *)&thr_id[iterator]);
    }
    return 0;
}
/*
*
*/

void func()
{
    printf("Hello/n");
}

int main()
{
    thread_pool_init(MIN_NUMBER);
    int i;
    void (*x)(void);
    x = func;
    for (i = 0; i < 11; i++)
    {
    add_task(i, &task_queue_mutex, &active_task, *x);
    }

    return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值