queue.c
1.46 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
/**
* \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 <stdarg.h>
#include "trbase.h"
#include "tr/queue.h"
static
int
queueCtor(void * _this, va_list * params)
{
TR_Queue this = _this;
this->data = (void **)TR_malloc(32 * sizeof(void *));
this->size = TR_getUsableSize(this->data) / sizeof(void *);
this->start = this->end = 0;
this->free_msgs = 1;
return 0;
}
static
void
queueDtor(void * _this)
{
TR_Queue this = _this;
size_t i;
if (this->free_msgs) {
for (
i = this->start;
i != this->end;
i = i + 1 == this->size ? 0 : i + 1) {
if (this->data[i]) {
TR_delete(this->data[i]);
}
}
}
TR_MEM_FREE(this->data);
}
TR_INIT_IFACE(TR_Class, queueCtor, queueDtor, NULL);
TR_CREATE_CLASS(TR_Queue, NULL, NULL, TR_IF(TR_Class));
// vim: set ts=4 sw=4: