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
|
#include "dat.h"
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
struct Ms tubes;
Tube *
make_tube(const char *name)
{
Tube *t = new(Tube);
if (!t)
return NULL;
strncpy(t->name, name, MAX_TUBE_NAME_LEN);
if (t->name[MAX_TUBE_NAME_LEN - 1] != '\0') {
t->name[MAX_TUBE_NAME_LEN - 1] = '\0';
twarnx("truncating tube name");
}
t->ready.less = job_pri_less;
t->delay.less = job_delay_less;
t->ready.setpos = job_setpos;
t->delay.setpos = job_setpos;
Job j = {.tube = NULL};
t->buried = j;
t->buried.prev = t->buried.next = &t->buried;
ms_init(&t->waiting_conns, NULL, NULL);
return t;
}
static void
tube_free(Tube *t)
{
ms_remove(&tubes, t);
free(t->ready.data);
free(t->delay.data);
ms_clear(&t->waiting_conns);
free(t);
}
void
tube_dref(Tube *t)
{
if (!t) return;
if (t->refs < 1) {
twarnx("refs is zero for tube: %s", t->name);
return;
}
--t->refs;
if (t->refs < 1)
tube_free(t);
}
void
tube_iref(Tube *t)
{
if (!t) return;
++t->refs;
}
static Tube *
make_and_insert_tube(const char *name)
{
int r;
Tube *t = NULL;
t = make_tube(name);
if (!t)
return NULL;
/* We want this global tube list to behave like "weak" refs, so don't
* increment the ref count. */
r = ms_append(&tubes, t);
if (!r)
return tube_dref(t), (Tube *) 0;
return t;
}
Tube *
tube_find(Ms *tubeset, const char *name)
{
size_t i;
for (i = 0; i < tubeset->len; i++) {
Tube *t = tubeset->items[i];
if (strncmp(t->name, name, MAX_TUBE_NAME_LEN) == 0)
return t;
}
return NULL;
}
Tube *
tube_find_or_make(const char *name)
{
Tube *t = tube_find(&tubes, name);
if (t)
return t;
return make_and_insert_tube(name);
}
|
