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
278
|
/*
* Ouroboros - Copyright (C) 2016 - 2020
*
* Timerwheel
*
* Dimitri Staessens <dimitri.staessens@ugent.be>
* Sander Vrijders <sander.vrijders@ugent.be>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public License
* version 2.1 as published by the Free Software Foundation.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., http://www.fsf.org/about/contact/.
*/
#include <ouroboros/list.h>
#define RXMQ_S 16 /* defines #slots */
#define RXMQ_M 24 /* defines max delay (us) */
#define RXMQ_R (RXMQ_M - RXMQ_S) /* defines resolution (us) */
#define RXMQ_SLOTS (1 << RXMQ_S)
#define RXMQ_MAX (1 << RXMQ_M) /* us */
/* Small inacurracy to avoid slow division by MILLION. */
#define ts_to_ms(ts) (ts.tv_sec * 1000 + (ts.tv_nsec >> 20))
#define ts_to_us(ts) (ts.tv_sec * MILLION + (ts.tv_nsec >> 10))
#define ts_to_slot(ts) ((ts_to_us(ts) >> RXMQ_R) & (RXMQ_SLOTS - 1))
struct rxm {
struct list_head next;
uint32_t seqno;
struct shm_du_buff * sdb;
uint8_t * head;
uint8_t * tail;
time_t t0; /* Time when original was sent (s). */
size_t mul; /* RTO multiplier. */
struct frcti * frcti;
};
struct {
struct list_head wheel[RXMQ_SLOTS];
size_t prv; /* Last processed slot. */
pthread_mutex_t lock;
} rw;
static void rxmwheel_fini(void)
{
size_t i;
struct list_head * p;
struct list_head * h;
for (i = 0; i < RXMQ_SLOTS; ++i) {
list_for_each_safe(p, h, &rw.wheel[i]) {
struct rxm * rxm = list_entry(p, struct rxm, next);
list_del(&rxm->next);
shm_du_buff_ack(rxm->sdb);
ipcp_sdb_release(rxm->sdb);
free(rxm);
}
}
}
static int rxmwheel_init(void)
{
struct timespec now;
size_t i;
if (pthread_mutex_init(&rw.lock, NULL))
return -1;
clock_gettime(PTHREAD_COND_CLOCK, &now);
/* Mark the previous timeslot as the last one processed. */
rw.prv = (ts_to_slot(now) - 1) & (RXMQ_SLOTS - 1);
for (i = 0; i < RXMQ_SLOTS; ++i)
list_head_init(&rw.wheel[i]);
return 0;
}
static void rxmwheel_clear(int fd)
{
size_t i;
/* FIXME: Add list element to avoid looping over full rxmwheel. */
pthread_mutex_lock(&rw.lock);
for (i = 0; i < RXMQ_SLOTS; ++i) {
struct list_head * p;
struct list_head * h;
list_for_each_safe(p, h, &rw.wheel[i]) {
struct rxm * r = list_entry(p, struct rxm, next);
if (r->frcti->fd == fd) {
list_del(&r->next);
shm_du_buff_ack(r->sdb);
ipcp_sdb_release(r->sdb);
free(r);
}
}
}
pthread_mutex_unlock(&rw.lock);
}
static void check_probe(struct frcti * frcti,
uint32_t seqno)
{
/* disable rtt probe if this packet */
/* TODO: This should be locked, but lock reversal! */
if (frcti->probe && ((frcti->rttseq + 1) == seqno)) {
/* Backoff to avoid never updating rtt */
frcti->srtt_us += frcti->mdev_us;
frcti->probe = false;
}
}
/* Return fd on r-timer expiry. */
static int rxmwheel_move(void)
{
struct timespec now;
struct list_head * p;
struct list_head * h;
size_t slot;
size_t i;
pthread_mutex_lock(&rw.lock);
clock_gettime(PTHREAD_COND_CLOCK, &now);
slot = ts_to_slot(now);
i = rw.prv;
if (slot < i)
slot += RXMQ_SLOTS;
while (i++ < slot) {
list_for_each_safe(p, h, &rw.wheel[i & (RXMQ_SLOTS - 1)]) {
struct rxm * r;
struct frct_cr * snd_cr;
struct frct_cr * rcv_cr;
size_t rslot;
ssize_t idx;
struct shm_du_buff * sdb;
uint8_t * head;
struct flow * f;
r = list_entry(p, struct rxm, next);
list_del(&r->next);
snd_cr = &r->frcti->snd_cr;
rcv_cr = &r->frcti->rcv_cr;
shm_du_buff_ack(r->sdb);
/* Has been ack'd, remove. */
if ((int) (r->seqno - snd_cr->lwe) < 0) {
ipcp_sdb_release(r->sdb);
free(r);
continue;
}
/* Disable using this seqno as rto probe. */
check_probe(r->frcti, r->seqno);
/* Check for r-timer expiry. */
if (ts_to_ms(now) - r->t0 > r->frcti->r) {
int fd = r->frcti->fd;
pthread_mutex_unlock(&rw.lock);
ipcp_sdb_release(r->sdb);
free(r);
return fd;
}
/* Copy the payload, safe rtx in other layers. */
if (ipcp_sdb_reserve(&sdb, r->tail - r->head)) {
/* FIXME: reschedule send instead of failing? */
int fd = r->frcti->fd;
pthread_mutex_unlock(&rw.lock);
ipcp_sdb_release(r->sdb);
free(r);
return fd;
}
idx = shm_du_buff_get_idx(sdb);
head = shm_du_buff_head(sdb);
memcpy(head, r->head, r->tail - r->head);
/* Release the old copy. */
ipcp_sdb_release(r->sdb);
/* Update ackno and make sure DRF is not set. */
((struct frct_pci *) head)->ackno = ntoh32(rcv_cr->lwe);
((struct frct_pci *) head)->flags &= ~FRCT_DRF;
f = &ai.flows[r->frcti->fd];
/* Retransmit the copy. FIXME: cancel flow */
if (shm_rbuff_write(f->tx_rb, idx)) {
int fd = r->frcti->fd;
pthread_mutex_unlock(&rw.lock);
ipcp_sdb_release(sdb);
free(r);
/* FIXME: reschedule send? */
return fd;
}
/* Reschedule. */
shm_du_buff_wait_ack(sdb);
shm_flow_set_notify(f->set, f->flow_id, FLOW_PKT);
r->head = head;
r->tail = shm_du_buff_tail(sdb);
r->sdb = sdb;
/* Schedule at least in the next time slot */
rslot = (slot + MAX((f->frcti->rto >> RXMQ_R), 1))
& (RXMQ_SLOTS - 1);
list_add_tail(&r->next, &rw.wheel[rslot]);
}
}
rw.prv = slot & (RXMQ_SLOTS - 1);
pthread_mutex_unlock(&rw.lock);
return 0;
}
static int rxmwheel_add(struct frcti * frcti,
uint32_t seqno,
struct shm_du_buff * sdb)
{
struct timespec now;
struct rxm * r;
size_t slot;
r = malloc(sizeof(*r));
if (r == NULL)
return -ENOMEM;
pthread_mutex_lock(&rw.lock);
clock_gettime(PTHREAD_COND_CLOCK, &now);
r->t0 = ts_to_us(now);
r->mul = 0;
r->seqno = seqno;
r->sdb = sdb;
r->head = shm_du_buff_head(sdb);
r->tail = shm_du_buff_tail(sdb);
r->frcti = frcti;
slot = (((r->t0 + frcti->rto) >> RXMQ_R) + 1) & (RXMQ_SLOTS - 1);
list_add_tail(&r->next, &rw.wheel[slot]);
shm_du_buff_wait_ack(sdb);
pthread_mutex_unlock(&rw.lock);
return 0;
}
|
