put.c
1.71 KB
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
/**
* \file
*
* \author Georg Hopp
*
* \copyright
* Copyright © 2014 Georg Hopp
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "trbase.h"
#include "tr/queue.h"
static
inline
void
_TR_queueResize(TR_Queue this, size_t split)
{
#define VPSIZE(elem) ((elem) * sizeof(void*))
void ** new = TR_malloc(VPSIZE(this->size + 1));
size_t new_size = TR_getUsableSize(new) / sizeof(void *);
#define GROWTH (new_size - this->size)
memcpy(new, this->data, VPSIZE(split));
memcpy(
new + GROWTH + this->start,
&(this->data[this->start]),
VPSIZE(this->size - this->start));
this->start = GROWTH + this->start;
this->size = new_size;
}
void
TR_queuePutFirst(TR_Queue this, void * msg)
{
size_t next = this->start == 0 ? this->size - 1: this->start - 1;
this->data[next] = msg;
this->start = next;
if (next == this->end) {
_TR_queueResize(this, this->end);
}
}
void
TR_queuePut(TR_Queue this, void * msg)
{
this->data[this->end] = msg;
this->end = this->end + 1 == this->size ? 0 : this->end + 1;
if (this->end == this->start) {
_TR_queueResize(this, this->end);
}
}
// vim: set ts=4 sw=4: