forked from beanstalkd/beanstalkd
-
Notifications
You must be signed in to change notification settings - Fork 0
/
tube.c
125 lines (101 loc) · 2.15 KB
/
tube.c
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
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include "dat.h"
struct ms tubes;
tube
make_tube(const char *name)
{
tube t;
t = new(struct tube);
if (!t) return NULL;
t->name[MAX_TUBE_NAME_LEN - 1] = '\0';
strncpy(t->name, name, MAX_TUBE_NAME_LEN - 1);
if (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.rec = job_setheappos;
t->delay.rec = job_setheappos;
t->buried = (struct job) { };
t->buried.prev = t->buried.next = &t->buried;
ms_init(&t->waiting, NULL, NULL);
ms_init(&t->fanout, NULL, NULL);
return t;
}
static void
tube_free(tube t)
{
prot_remove_tube(t);
free(t->ready.data);
free(t->delay.data);
ms_clear(&t->waiting);
ms_clear(&t->fanout);
free(t);
}
void
tube_dref(tube t)
{
if (!t) return;
if (t->refs < 1) return twarnx("refs is zero for tube: %s", t->name);
--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(const char *name)
{
tube t;
size_t i;
for (i = 0; i < tubes.used; i++) {
t = tubes.items[i];
if (strncmp(t->name, name, MAX_TUBE_NAME_LEN) == 0) return t;
}
return NULL;
}
tube
tube_find_or_make(const char *name)
{
return tube_find(name) ? : make_and_insert_tube(name);
}
int
tube_bind(tube s, tube t)
{
if (!s || !t) return 0;
if (ms_contains(&s->fanout, t))
return 2;
if (t->fanout.used)
return 0; // cycle
if (!ms_append(&s->fanout, t))
return 0;
tube_iref(s);
tube_iref(t);
return 1;
}
int
tube_unbind(tube s, tube t)
{
if (ms_remove(&s->fanout, t)) {
tube_dref(s);
tube_dref(t);
return 1;
}
return 0;
}