blob: d9fc2b63c9ee951dee5fc748c1defc6740342aff (
plain)
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
|
/* Copyright (C) 2021 CZ.NIC, z.s.p.o. <knot-dns@labs.nic.cz>
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 <https://www.gnu.org/licenses/>.
*/
#include "knot/worker/queue.h"
#include "contrib/mempattern.h"
void worker_queue_init(worker_queue_t *queue)
{
if (!queue) {
return;
}
memset(queue, 0, sizeof(worker_queue_t));
init_list(&queue->list);
mm_ctx_init(&queue->mm_ctx);
}
void worker_queue_deinit(worker_queue_t *queue)
{
ptrlist_free(&queue->list, &queue->mm_ctx);
}
void worker_queue_enqueue(worker_queue_t *queue, worker_task_t *task)
{
if (!queue || !task) {
return;
}
ptrlist_add(&queue->list, task, &queue->mm_ctx);
}
worker_task_t *worker_queue_dequeue(worker_queue_t *queue)
{
if (!queue) {
return NULL;
}
worker_task_t *task = NULL;
if (!EMPTY_LIST(queue->list)) {
ptrnode_t *node = HEAD(queue->list);
task = (void *)node->d;
rem_node(&node->n);
queue->mm_ctx.free(&node->n);
}
return task;
}
size_t worker_queue_length(worker_queue_t *queue)
{
return queue ? list_size(&queue->list) : 0;
}
|
