ifscanner/concurent_queue.cpp at master · mourogurt/ifscanner · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
#include "concurent_queue.h"

ConcurentQueue::ConcurentQueue()
{
	first = nullptr;
	back = nullptr;
	queue_size = 0;
	max_size = 50;
	critical_queue = 0;
}

ConcurentQueue::ConcurentQueue(bool crit)
{
	first = nullptr;
	back = nullptr;
	queue_size = 0;
	max_size = 50;
	critical_queue = crit;
}

void ConcurentQueue::push(Buffer* bufin)
{
	std::unique_lock<std::mutex> mlock(lock_mutex);
	if (queue_size == max_size)
	{
		if ((!critical_queue) && (max_size!=0))
			wait_cond.wait(mlock,[&](){return queue_size <= max_size;});
		if ((critical_queue) && (max_size!=0))
		{
			mlock.unlock();
			Buffer* retbuf = pop();
			mlock.lock();
			if (retbuf != NULL)
			{
				if (retbuf->buff != NULL)
					delete [] retbuf->buff;
				delete retbuf;
			}
		}
	}
	if (first==NULL)
	{
		first = new Spisok;
		first->buf = bufin;
		back = first;
	} else if (first == back)
	{
		Spisok* sp = new Spisok;
		sp->buf = bufin;
		back = sp;
		first -> next = back;
	} else
	{
		Spisok* sp = new Spisok;
		sp->buf = bufin;
		back->next = sp;
		back = sp;
	}
	queue_size++;
	wait_cond.notify_one();
	mlock.unlock();
}

Buffer* ConcurentQueue::pop()
{
	std::unique_lock<std::mutex> mlock(lock_mutex);
	Buffer* retbuf;
	if (queue_size == 0)
	{
		if ((!critical_queue) && (max_size!=0))
			wait_cond.wait(mlock,[&](){return queue_size > 0;});
		if ((critical_queue) && (max_size!=0))
		{
			Buffer* retbuf = new Buffer;
			retbuf->buff = new char;
			retbuf->buff[0] = '\0';
			retbuf->buffsize = 1;
			mlock.unlock();
			push(retbuf);
			mlock.lock();
		}
	}
	if (first==back)
	{
		retbuf = first->buf;
		delete first;
		first = nullptr;
	} else
	{
		Spisok* dlspsk;
		retbuf = first->buf;
		dlspsk = first;
		first = first -> next;
		delete dlspsk;
	}
	queue_size--;
	wait_cond.notify_one();
	mlock.unlock();
	return retbuf;
}

size_t ConcurentQueue::size()
{
	return queue_size;
}

void ConcurentQueue::set_max_size(size_t maxin)
{
	max_size = maxin;
}

void ConcurentQueue::set_priority(bool prior)
{
	critical_queue = prior;
}

void ConcurentQueue::clean()
{
	while (first != nullptr)
	{
		Buffer* retbuf = pop();
		if (retbuf != NULL)
		{
			if (retbuf->buff != NULL)
				delete [] retbuf->buff;
			delete retbuf;
		}

	}
}

ConcurentQueue::~ConcurentQueue()
{
	clean();
}