#include <semaphore.h>
int sem_init(sem_t *sem, int pshared, unsigned int value);

#include <semaphore.h>
int sem_destroy(sem_t *sem);

#include <semaphore.h>
int sem_wait(sem_t *sem);

#include <semaphore.h>
int sem_post(sem_t *sem);

#pragma once
#include <iostream>
#include <vector>
#include <semaphore.h>
#include <pthread.h>
//環(huán)形隊(duì)列默認(rèn)容量
const static int defaultcap = 8;
//環(huán)形隊(duì)列核心接口：PV操作以及加鎖解鎖
template<class T>
class RingQueue{
private:
    void P(sem_t &sem)
    {
        sem_wait(&sem);
    }
    void V(sem_t &sem)
    {
        sem_post(&sem);
    }
    void Lock(pthread_mutex_t &mutex)
    {
        pthread_mutex_lock(&mutex);
    }
    void Unlock(pthread_mutex_t &mutex)
    {
        pthread_mutex_unlock(&mutex);
    }
public:
	//初始化
    RingQueue(int cap = defaultcap)
    :ringqueue_(cap), cap_(cap), c_step_(0), p_step_(0)
    {
        sem_init(&cdata_sem_, 0, 0);
        sem_init(&pspace_sem_, 0, cap);
		//生產(chǎn)者消費(fèi)者的鎖
        pthread_mutex_init(&c_mutex_, nullptr);
        pthread_mutex_init(&p_mutex_, nullptr);
    }
    void Push(const T &in) // 生產(chǎn)活動(dòng)
    {
    	//調(diào)用P函數(shù)檢查隊(duì)列中是否有可用空間，沒(méi)有可用空間線程會(huì)阻塞
        P(pspace_sem_);
		//這里為什么要先P后加鎖，下面詳談
        Lock(p_mutex_); 
        ringqueue_[p_step_] = in;
        // 位置后移，維持環(huán)形特性
        p_step_++;
        p_step_ %= cap_;
        Unlock(p_mutex_); 

        V(cdata_sem_);

    }
    void Pop(T *out)       // 消費(fèi)活動(dòng)
    {
        P(cdata_sem_);

        Lock(c_mutex_); 
        *out = ringqueue_[c_step_];
        // 位置后移，維持環(huán)形特性
        c_step_++;
        c_step_ %= cap_;
        Unlock(c_mutex_); 

        V(pspace_sem_);
    }
    //析構(gòu)銷毀
    ~RingQueue()
    {
        sem_destroy(&cdata_sem_);
        sem_destroy(&pspace_sem_);

        pthread_mutex_destroy(&c_mutex_);
        pthread_mutex_destroy(&p_mutex_);
    }
private:
    std::vector<T> ringqueue_;// 環(huán)形隊(duì)列的底層實(shí)現(xiàn)
    int cap_;		   		  // 隊(duì)列容量

    int c_step_;       		  // 消費(fèi)者下標(biāo)
    int p_step_;      		  // 生產(chǎn)者下標(biāo)

    sem_t cdata_sem_; 		  // 隊(duì)中可用數(shù)據(jù)資源
    sem_t pspace_sem_;		  // 隊(duì)中可用空間資源

    pthread_mutex_t c_mutex_; // 消費(fèi)者鎖
    pthread_mutex_t p_mutex_; // 生產(chǎn)者鎖
};

#pragma once
#include <iostream>
#include <string>

std::string opers="+-*/%";

enum{
    DivZero=1,
    ModZero,
    Unknown
};

class Task
{
public:
    Task()
    {}
    Task(int x, int y, char op) : data1_(x), data2_(y), oper_(op), result_(0), exitcode_(0)
    {}
    void run()
    {
        switch (oper_)
        {
        case '+':
            result_ = data1_ + data2_;
            break;
        case '-':
            result_ = data1_ - data2_;
            break;
        case '*':
            result_ = data1_ * data2_;
            break;
        case '/':
            {
                if(data2_ == 0) exitcode_ = DivZero;
                else result_ = data1_ / data2_;
            }
            break;
        case '%':
           {
                if(data2_ == 0) exitcode_ = ModZero;
                else result_ = data1_ % data2_;
            }            break;
        default:
            exitcode_ = Unknown;
            break;
        }
    }
    void operator ()()
    {
        run();
    }
    std::string GetResult()
    {
        std::string r = std::to_string(data1_);
        r += oper_;
        r += std::to_string(data2_);
        r += "=";
        r += std::to_string(result_);
        r += "[code: ";
        r += std::to_string(exitcode_);
        r += "]";

        return r;
    }
    std::string GetTask()
    {
        std::string r = std::to_string(data1_);
        r += oper_;
        r += std::to_string(data2_);
        r += "=?";
        return r;
    }
    ~Task()
    {}

private:
    int data1_;
    int data2_;
    char oper_;

    int result_;
    int exitcode_;
};

#include <iostream>
#include <pthread.h>
#include <unistd.h>
#include <ctime>
#include "RingQueue.hpp"
#include "Task.hpp"

using namespace std;
//這個(gè)結(jié)構(gòu)體是方便我們打印的時(shí)候查看方便的
struct ThreadData
{
    RingQueue<Task> *rq;   //環(huán)形隊(duì)列
    std::string threadname;//線程名字
};

void *Productor(void *args)
{
    ThreadData *td = static_cast<ThreadData*>(args);
    RingQueue<Task> *rq = td->rq;
    std::string name = td->threadname;
    int len = opers.size();
    while (true)
    {
        // 模擬獲取數(shù)據(jù)
        int data1 = rand() % 10 + 1;
        usleep(10);
        int data2 = rand() % 10;
        char op = opers[rand() % len];
        Task t(data1, data2, op);

        // 生產(chǎn)數(shù)據(jù)
        rq->Push(t);
        cout << "Productor task done, task is : " << t.GetTask() << " who: " << name << endl;

        sleep(1);
    }
    return nullptr;
}

void *Consumer(void *args)
{
    ThreadData *td = static_cast<ThreadData*>(args);
    RingQueue<Task> *rq = td->rq;
    std::string name = td->threadname;

    while (true)
    {
        // 消費(fèi)數(shù)據(jù)
        Task t;
        rq->Pop(&t);
       
        // 處理數(shù)據(jù)
        t();
        cout << "Consumer get task, task is : " << t.GetTask() << " who: " << name << " result: " << t.GetResult() << endl;
    }
    return nullptr;
}

int main()
{
    srand(time(nullptr));
    RingQueue<Task> *rq = new RingQueue<Task>(10);

    pthread_t c[5], p[3];
    
	//這里我們?yōu)榱朔奖悴榭?，統(tǒng)一用單生產(chǎn)單消費(fèi)
    for (int i = 0; i < 1; i++)
    {
        ThreadData *td = new ThreadData();
        td->rq = rq;
        td->threadname = "Productor-" + std::to_string(i);

        pthread_create(p + i, nullptr, Productor, td);
    }
    for (int i = 0; i < 1; i++)
    {
        ThreadData *td = new ThreadData();
        td->rq = rq;
        td->threadname = "Consumer-" + std::to_string(i);

        pthread_create(c + i, nullptr, Consumer, td);
    }

    for (int i = 0; i < 1; i++)
    {
        pthread_join(p[i], nullptr);
    }
    for (int i = 0; i < 1; i++)
    {
        pthread_join(c[i], nullptr);
    }

    return 0;
}