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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
|
/*-*- Mode: C; c-basic-offset: 8 -*-*/
#include <assert.h>
#include "macro.h"
#include "job.h"
Job* job_new(Manager *m, JobType type, Name *name) {
Job *j;
assert(m);
assert(type < _JOB_TYPE_MAX);
assert(name);
if (!(j = new0(Job, 1)))
return NULL;
j->manager = m;
j->id = m->current_job_id++;
j->type = type;
j->name = name;
/* We don't link it here, that's what job_dependency() is for */
return j;
}
void job_free(Job *j) {
assert(j);
/* Detach from next 'bigger' objects */
if (j->linked) {
if (j->name->meta.job == j)
j->name->meta.job = NULL;
hashmap_remove(j->manager->jobs, UINT32_TO_PTR(j->id));
}
manager_transaction_unlink_job(j->manager, j);
free(j);
}
JobDependency* job_dependency_new(Job *subject, Job *object, bool matters) {
JobDependency *l;
assert(object);
/* Adds a new job link, which encodes that the 'subject' job
* needs the 'object' job in some way. If 'subject' is NULL
* this means the 'anchor' job (i.e. the one the user
* explcitily asked for) is the requester. */
if (!(l = new0(JobDependency, 1)))
return NULL;
l->subject = subject;
l->object = object;
l->matters = matters;
if (subject) {
l->subject_next = subject->subject_list;
subject->subject_list = l;
} else {
l->subject_next = object->manager->transaction_anchor;
object->manager->transaction_anchor = l;
}
if (l->subject_next)
l->subject_next->subject_prev = l;
l->subject_prev = NULL;
if ((l->object_next = object->object_list))
l->object_next->object_prev = l;
l->object_prev = NULL;
object->object_list = l;
return l;
}
void job_dependency_free(JobDependency *l) {
assert(l);
if (l->subject_prev)
l->subject_prev->subject_next = l->subject_next;
else if (l->subject)
l->subject->subject_list = l->subject_next;
else
l->object->manager->transaction_anchor = l->subject_next;
if (l->subject_next)
l->subject_next->subject_prev = l->subject_prev;
if (l->object_prev)
l->object_prev->object_next = l->object_next;
else
l->object->object_list = l->object_next;
if (l->object_next)
l->object_next->object_prev = l->object_prev;
free(l);
}
void job_dependency_delete(Job *subject, Job *object, bool *matters) {
JobDependency *l;
assert(object);
for (l = object->object_list; l; l = l->object_next) {
assert(l->object == object);
if (l->subject == subject)
break;
}
if (!l) {
if (matters)
*matters = false;
return;
}
if (matters)
*matters = l->matters;
job_dependency_free(l);
}
void job_dump(Job *j, FILE*f, const char *prefix) {
static const char* const job_type_table[_JOB_TYPE_MAX] = {
[JOB_START] = "start",
[JOB_STOP] = "stop",
[JOB_VERIFY_STARTED] = "verify-started",
[JOB_RELOAD] = "reload",
[JOB_RELOAD_OR_START] = "reload-or-start",
[JOB_RESTART] = "restart",
[JOB_TRY_RESTART] = "try-restart",
};
static const char* const job_state_table[_JOB_STATE_MAX] = {
[JOB_WAITING] = "waiting",
[JOB_RUNNING] = "running",
[JOB_DONE] = "done"
};
assert(j);
assert(f);
fprintf(f,
"%sJob %u:\n"
"%s\tAction: %s → %s\n"
"%s\tState: %s\n",
prefix, j->id,
prefix, name_id(j->name), job_type_table[j->type],
prefix, job_state_table[j->state]);
}
bool job_is_anchor(Job *j) {
JobDependency *l;
assert(j);
for (l = j->object_list; l; l = l->object_next)
if (!l->subject)
return true;
return false;
}
|
