线程安全队列的实现 Linux version

最新推荐文章于 2023-12-02 23:22:20 发布

martin_liang

最新推荐文章于 2023-12-02 23:22:20 发布

阅读量971

点赞数

分类专栏： Linux 编程文章标签： linux signal null include input

本文链接：https://blog.csdn.net/martin_liang/article/details/7596759

版权

Linux 编程专栏收录该内容

27 篇文章 0 订阅

订阅专栏

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

static pthread_mutex_t mutexLock;
static pthread_cond_t condNotFull;
static pthread_cond_t condNotEmpty;

static int queueSize   = 0;
static int curQueSize  = 0;

static int curFrontIdx = 0;
static int curRearIdx  = 0;

static int *pQueue     = NULL;

int initialize()
{
    int a;

    scanf("input the queue size: %d\n", a);
    if (a < 1)
    {
        printf("queue size must be bigger than 0\n");
        return -1;
    }
    queueSize = a;

    pQueue = (int *)malloc(sizeof(int) * queueSize);
    if (NULL == pQueue)
    {
        printf("no more memory is availabe\n");
        return -1;
    }

    pthread_mutex_init(mutexLock, NULL);
    pthread_cond_init(condNotFull, NULL);
    pthread_cond_init(condNotEmpty, NULL);

    return 0;
}


void enqueue(int element)
{
    pthread_mutex_lock(&mutexLock);

    while (curQueSize >= queueSize)
    {
        pthread_cond_wait(&condNotFull, &mutexLock);
    }

    pQueue[curRearIdx] = element;
    curRearIdx = (curRearIdx + 1) % queueSize;
    ++curQueSize;

    pthread_mutex_unlock(&mutexLock);


    //populate the signal anyway
    pthread_cond_signal(&condNotEmpty);
} 


int dequeue()
{
    int retVal;

    pthread_mutex_lock(&mutexLock);

    while (0 == curQueSize)
    {
        pthread_cond_wait(&condNotEmpty, &mutexLock);
    } 

    retVal = pQueue[curFrontIdx];
    curFrontIdx = (curFrontIdx + 1) % queueSize;
    --curSize;

    pthread_mutex_unlock(&mutexLock);


    // populate the signal anyway
    pthread_cond_signal(&condNotFull);

    reutrn retVal;
}