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
|
#include "ci_queue.h"
#include "log.h"
#include <stdlib.h>
#include <string.h>
#include <sys/queue.h>
int ci_queue_entry_create(struct ci_queue_entry **entry, const char *_url, const char *_rev)
{
char *url, *rev;
url = strdup(_url);
if (!url) {
log_errno("strdup");
goto fail;
}
rev = strdup(_rev);
if (!rev) {
log_errno("strdup");
goto free_url;
}
*entry = malloc(sizeof(struct ci_queue_entry));
if (!*entry) {
log_errno("malloc");
goto free_rev;
}
(*entry)->url = url;
(*entry)->rev = rev;
return 0;
free_rev:
free(rev);
free_url:
free(url);
fail:
return -1;
}
void ci_queue_entry_destroy(struct ci_queue_entry *entry)
{
free(entry->rev);
free(entry->url);
free(entry);
}
void ci_queue_create(struct ci_queue *queue)
{
STAILQ_INIT(queue);
}
void ci_queue_destroy(struct ci_queue *queue)
{
struct ci_queue_entry *entry1, *entry2;
entry1 = STAILQ_FIRST(queue);
while (entry1) {
entry2 = STAILQ_NEXT(entry1, entries);
ci_queue_entry_destroy(entry1);
entry1 = entry2;
}
STAILQ_INIT(queue);
}
int ci_queue_is_empty(const struct ci_queue *queue)
{
return STAILQ_EMPTY(queue);
}
void ci_queue_push(struct ci_queue *queue, struct ci_queue_entry *entry)
{
STAILQ_INSERT_TAIL(queue, entry, entries);
}
void ci_queue_push_head(struct ci_queue *queue, struct ci_queue_entry *entry)
{
STAILQ_INSERT_HEAD(queue, entry, entries);
}
struct ci_queue_entry *ci_queue_pop(struct ci_queue *queue)
{
struct ci_queue_entry *entry;
entry = STAILQ_FIRST(queue);
STAILQ_REMOVE_HEAD(queue, entries);
return entry;
}
|
