sfzq/MessageQueue.cpp at main · stevefolta/sfzq · 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
#include "MessageQueue.h"

enum {
	defaultCapacity = 100,
	};


MessageQueue::MessageQueue(int capacity_in)
{
	capacity = (capacity_in > 0 ? capacity_in : defaultCapacity);
	ring = new Message[capacity];
	head = tail = 0;
}


MessageQueue::~MessageQueue()
{
	delete[] ring;
}


MessageQueue::Message* MessageQueue::back()
{
	if (is_full())
		return nullptr;

	return &ring[tail];
}

void MessageQueue::push()
{
	tail = (tail + 1) % capacity;
}

void MessageQueue::send(int message)
{
	Message* msg = back();
	if (msg) {
		msg->id = message;
		push();
		}
}

void MessageQueue::send(int message, void* param)
{
	Message* msg = back();
	if (msg) {
		msg->id = message;
		msg->param = param;
		push();
		}
}

void MessageQueue::send(int message, int64_t num)
{
	Message* msg = back();
	if (msg) {
		msg->id = message;
		msg->num = num;
		push();
		}
}


MessageQueue::Message MessageQueue::pop_front()
{
	if (is_empty())
		return { -1 };
	Message result = ring[head];
	pop();
	return result;
}

MessageQueue::Message* MessageQueue::front()
{
	if (is_empty())
		return nullptr;

	return &ring[head];
}

void MessageQueue::pop()
{
	head = (head + 1) % capacity;
}


bool MessageQueue::is_empty()
{
	return tail == head;
}


bool MessageQueue::is_full()
{
	return (tail + 1) % capacity == head;
}