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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
|
/*
* Copyright (c) 2022 Egor Tensin <Egor.Tensin@gmail.com>
* This file is part of the "cimple" project.
* For details, see https://github.com/egor-tensin/cimple.
* Distributed under the MIT License.
*/
#include "run_queue.h"
#include "log.h"
#include "msg.h"
#include <stdlib.h>
#include <string.h>
#include <sys/queue.h>
struct run {
char *url;
char *rev;
int id;
SIMPLEQ_ENTRY(run) entries;
};
int run_create(struct run **_entry, const char *_url, const char *_rev, int id)
{
struct run *entry = malloc(sizeof(struct run));
if (!entry) {
log_errno("malloc");
goto fail;
}
char *url = strdup(_url);
if (!url) {
log_errno("strdup");
goto free_entry;
}
char *rev = strdup(_rev);
if (!rev) {
log_errno("strdup");
goto free_url;
}
entry->url = url;
entry->rev = rev;
entry->id = id;
*_entry = entry;
return 0;
free_url:
free(url);
free_entry:
free(entry);
fail:
return -1;
}
int run_from_msg(struct run **run, const struct msg *msg)
{
size_t msg_len = msg_get_length(msg);
if (msg_len != 3) {
log_err("Invalid number of arguments for a message: %zu\n", msg_len);
msg_dump(msg);
return -1;
}
const char **argv = msg_get_strings(msg);
/* We don't know the ID yet. */
return run_create(run, argv[1], argv[2], 0);
}
void run_destroy(struct run *entry)
{
free(entry->rev);
free(entry->url);
free(entry);
}
const char *run_get_url(const struct run *entry)
{
return entry->url;
}
const char *run_get_rev(const struct run *entry)
{
return entry->rev;
}
int run_get_id(const struct run *entry)
{
return entry->id;
}
void run_set_id(struct run *entry, int id)
{
entry->id = id;
}
void run_queue_create(struct run_queue *queue)
{
SIMPLEQ_INIT(queue);
}
void run_queue_destroy(struct run_queue *queue)
{
struct run *entry1 = SIMPLEQ_FIRST(queue);
while (entry1) {
struct run *entry2 = SIMPLEQ_NEXT(entry1, entries);
run_destroy(entry1);
entry1 = entry2;
}
SIMPLEQ_INIT(queue);
}
int run_queue_is_empty(const struct run_queue *queue)
{
return SIMPLEQ_EMPTY(queue);
}
void run_queue_add_first(struct run_queue *queue, struct run *entry)
{
SIMPLEQ_INSERT_HEAD(queue, entry, entries);
}
void run_queue_add_last(struct run_queue *queue, struct run *entry)
{
SIMPLEQ_INSERT_TAIL(queue, entry, entries);
}
struct run *run_queue_remove_first(struct run_queue *queue)
{
struct run *entry = SIMPLEQ_FIRST(queue);
SIMPLEQ_REMOVE_HEAD(queue, entries);
return entry;
}
|
