forked from beanstalkd/beanstalkd
-
Notifications
You must be signed in to change notification settings - Fork 0
/
conn.c
277 lines (221 loc) · 4.75 KB
/
conn.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
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
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include <limits.h>
#include <unistd.h>
#include "dat.h"
#define SAFETY_MARGIN (1000000000) /* 1 second */
static int cur_conn_ct = 0, cur_worker_ct = 0, cur_producer_ct = 0;
static uint tot_conn_ct = 0;
int verbose = 0;
static void
on_watch(ms a, tube t, size_t i)
{
tube_iref(t);
t->watching_ct++;
}
static void
on_ignore(ms a, tube t, size_t i)
{
t->watching_ct--;
tube_dref(t);
}
conn
make_conn(int fd, char start_state, tube use, tube watch)
{
job j;
conn c;
c = new(struct conn);
if (!c) return twarn("OOM"), (conn) 0;
ms_init(&c->watch, (ms_event_fn) on_watch, (ms_event_fn) on_ignore);
if (!ms_append(&c->watch, watch)) {
free(c);
return twarn("OOM"), (conn) 0;
}
TUBE_ASSIGN(c->use, use);
use->using_ct++;
c->sock.fd = fd;
c->state = start_state;
c->pending_timeout = -1;
c->tickpos = -1;
c->prev = c->next = c; /* must be out of a linked list right now */
j = &c->reserved_jobs;
j->prev = j->next = j;
/* stats */
cur_conn_ct++;
tot_conn_ct++;
return c;
}
void
conn_set_producer(conn c)
{
if (c->type & CONN_TYPE_PRODUCER) return;
c->type |= CONN_TYPE_PRODUCER;
cur_producer_ct++; /* stats */
}
void
conn_set_worker(conn c)
{
if (c->type & CONN_TYPE_WORKER) return;
c->type |= CONN_TYPE_WORKER;
cur_worker_ct++; /* stats */
}
int
count_cur_conns()
{
return cur_conn_ct;
}
uint
count_tot_conns()
{
return tot_conn_ct;
}
int
count_cur_producers()
{
return cur_producer_ct;
}
int
count_cur_workers()
{
return cur_worker_ct;
}
static int
has_reserved_job(conn c)
{
return job_list_any_p(&c->reserved_jobs);
}
static int64
conntickat(conn c)
{
int margin = 0, should_timeout = 0;
int64 t = INT64_MAX;
if (conn_waiting(c)) {
margin = SAFETY_MARGIN;
}
if (has_reserved_job(c)) {
t = soonest_job(c)->r.deadline_at - nanoseconds() - margin;
should_timeout = 1;
}
if (c->pending_timeout >= 0) {
t = min(t, ((int64)c->pending_timeout) * 1000000000);
should_timeout = 1;
}
if (should_timeout) {
return nanoseconds() + t;
}
return 0;
}
void
connwant(conn c, int rw, conn list)
{
c->rw = rw;
conn_insert(list, c);
connsched(c);
}
void
connsched(conn c)
{
c->tickat = conntickat(c);
srvschedconn(c->srv, c);
}
static int
conn_list_any_p(conn head)
{
return head->next != head || head->prev != head;
}
conn
conn_remove(conn c)
{
if (!conn_list_any_p(c)) return NULL; /* not in a doubly-linked list */
c->next->prev = c->prev;
c->prev->next = c->next;
c->prev = c->next = c;
return c;
}
void
conn_insert(conn head, conn c)
{
if (conn_list_any_p(c)) return; /* already in a linked list */
c->prev = head->prev;
c->next = head;
head->prev->next = c;
head->prev = c;
}
/* return the reserved job with the earliest deadline,
* or NULL if there's no reserved job */
job
soonest_job(conn c)
{
job j = NULL;
job soonest = c->soonest_job;
if (soonest == NULL) {
for (j = c->reserved_jobs.next; j != &c->reserved_jobs; j = j->next) {
if (j->r.deadline_at <= (soonest ? : j)->r.deadline_at) soonest = j;
}
}
c->soonest_job = soonest;
return soonest;
}
int
has_reserved_this_job(conn c, job j)
{
return j && j->r.state == Reserved && j->reserver == c;
}
/* return true if c has a reserved job with less than one second until its
* deadline */
int
conn_has_close_deadline(conn c)
{
int64 t = nanoseconds();
job j = soonest_job(c);
return j && t >= j->r.deadline_at - SAFETY_MARGIN;
}
int
conn_ready(conn c)
{
size_t i;
for (i = 0; i < c->watch.used; i++) {
if (((tube) c->watch.items[i])->ready.len) return 1;
}
return 0;
}
int
connless(conn a, conn b)
{
return a->tickat < b->tickat;
}
void
connrec(conn c, int i)
{
c->tickpos = i;
}
void
conn_close(conn c)
{
sockwant(&c->sock, 0);
close(c->sock.fd);
if (verbose) {
printf("close %d\n", c->sock.fd);
}
job_free(c->in_job);
/* was this a peek or stats command? */
if (c->out_job && !c->out_job->r.id) job_free(c->out_job);
c->in_job = c->out_job = NULL;
c->in_job_read = 0;
if (c->type & CONN_TYPE_PRODUCER) cur_producer_ct--; /* stats */
if (c->type & CONN_TYPE_WORKER) cur_worker_ct--; /* stats */
cur_conn_ct--; /* stats */
remove_waiting_conn(c);
conn_remove(c);
if (has_reserved_job(c)) enqueue_reserved_jobs(c);
ms_clear(&c->watch);
c->use->using_ct--;
TUBE_ASSIGN(c->use, NULL);
if (c->tickpos > -1) {
heapremove(&c->srv->conns, c->tickpos);
}
free(c);
}