-
Notifications
You must be signed in to change notification settings - Fork 71
/
rr.c
539 lines (431 loc) · 15.6 KB
/
rr.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
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
/*
* Copyright 2016 Google Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/*
* This file implements six different state machines:
* TCP_RR client/server, UDP_RR client/server, and TCP_CRR client/server
*
* Note that there is a high degree of overlap, for example the TCP_RR server
* TCP_CRR server state machines are identical. The state machines are broken
* down into small callback functions which each perform some small task, such
* as sending a message, opening a socket connection, or gathering statistics.
*/
#include "coef.h"
#include "common.h"
#include "countdown_cond.h"
#include "flow.h"
#include "histo.h"
#include "percentiles.h"
#include "print.h"
#include "rr.h"
#include "snaps.h"
#include "socket.h"
#include "stats.h"
#include "thread.h"
#define NEPER_EPOLL_MASK (EPOLLHUP | EPOLLRDHUP | EPOLLERR)
typedef ssize_t (*rr_send_t)(struct flow *, const char *, size_t, int);
typedef ssize_t (*rr_recv_t)(struct flow *, char *, size_t);
struct rr_state {
rr_send_t rr_send;
rr_recv_t rr_recv;
ssize_t rr_xfer; /* # of bytes remaining in the current send or recv */
struct timespec rr_ts_0; /* timestamp just after previous recv() */
struct timespec rr_ts_1; /* timestamp just before current send() */
struct timespec rr_ts_2; /* timestamp just after current recv() */
struct sockaddr_storage rr_peer; /* for UDP servers */
socklen_t rr_peerlen;
};
struct rr_snap_opaque {
double min;
double max;
double mean;
double stddev;
double percentile[0];
};
static void rr_server_state_0(struct flow *, uint32_t);
static void rr_client_state_0(struct flow *, uint32_t);
static void crr_client_state_0(struct flow *, uint32_t);
/*
* Some protocol-specific send/recv wrappers for the state machine.
* UDP server sockets receive traffic from many different clients and
* therefore need to use recvfrom() and sendto().
*/
static ssize_t rr_fn_send(struct flow *f, const char *buf, size_t len,
int flags)
{
struct thread *t = flow_thread(f);
t->io_stats.tx_ops++;
t->io_stats.tx_bytes += len;
return send(flow_fd(f), buf, len, flags);
}
static ssize_t rr_fn_sendto(struct flow *f, const char *buf, size_t len,
int flags)
{
const struct rr_state *rr = flow_opaque(f);
struct thread *t = flow_thread(f);
t->io_stats.tx_ops++;
t->io_stats.tx_bytes += len;
return sendto(flow_fd(f), buf, len, flags, (void *)&rr->rr_peer,
rr->rr_peerlen);
}
static ssize_t rr_fn_recv(struct flow *f, char *buf, size_t len)
{
struct thread *t = flow_thread(f);
ssize_t ret;
ret = recv(flow_fd(f), buf, len, 0);
t->io_stats.rx_ops++;
t->io_stats.rx_bytes += ret > 0 ? ret : 0;
return ret;
}
static ssize_t rr_fn_recvfrom(struct flow *f, char *buf, size_t len)
{
struct rr_state *rr = flow_opaque(f);
struct thread *t = flow_thread(f);
ssize_t ret;
rr->rr_peerlen = sizeof(struct sockaddr_storage);
ret = recvfrom(flow_fd(f), buf, len, 0, (void *)&rr->rr_peer,
&rr->rr_peerlen);
t->io_stats.rx_ops++;
t->io_stats.rx_bytes += ret > 0 ? ret : 0;
return ret;
}
/* Allocate a message buffer for a rr flow. */
static void *rr_alloc(struct thread *t)
{
const struct options *opts = t->opts;
size_t len;
if (t->f_mbuf)
return t->f_mbuf;
len = MAX(opts->request_size, opts->response_size);
len = MIN(len, opts->buffer_size);
t->f_mbuf = calloc_or_die(len, sizeof(char), t->cb);
return t->f_mbuf;
}
static struct neper_stat *rr_latency_init(struct flow *f)
{
const struct thread *t = flow_thread(f);
int size;
if (t->opts->nostats)
return NULL;
struct neper_histo *histo = neper_histo_new(t, DEFAULT_K_BITS);
size = sizeof(struct rr_snap_opaque) + t->opts->percentiles.p_count * sizeof(double);
return neper_stat_init(f, histo, size);
}
static ssize_t rr_send_size(struct thread *t) {
if (t->opts->client) {
return t->opts->request_size;
}
return t->opts->response_size;
}
static ssize_t rr_recv_size(struct thread *t) {
if (t->opts->client) {
return t->opts->response_size;
}
return t->opts->request_size;
}
static void rr_state_init(struct thread *t, int fd,
void (*state)(struct flow *, uint32_t),
uint32_t event)
{
struct rr_state *rr = calloc_or_die(1, sizeof(struct rr_state), t->cb);
// Request is always first.
rr->rr_xfer = t->opts->request_size;
common_gettime(&rr->rr_ts_2); /* This initializes TCP_CRR stats. */
switch (t->fn->fn_type) {
case SOCK_STREAM:
rr->rr_send = rr_fn_send;
rr->rr_recv = rr_fn_recv;
break;
case SOCK_DGRAM:
rr->rr_send = rr_fn_sendto;
rr->rr_recv = rr_fn_recvfrom;
break;
}
const struct flow_create_args args = {
.thread = t,
.fd = fd,
.events = event,
.opaque = rr,
.handler = state,
.mbuf_alloc = rr_alloc,
.stat = rr_latency_init
};
flow_create(&args);
}
/*
* Return values of true for rr_do_send() and rr_do_recv() mean the transfer was
* successfully completed and the state machine may therefore advance.
*/
static bool rr_do_send(struct flow *f, uint32_t events, rr_send_t rr_send)
{
struct thread *t = flow_thread(f);
const struct options *opts = t->opts;
struct rr_state *rr = flow_opaque(f);
if (events & ~(NEPER_EPOLL_MASK | EPOLLOUT))
LOG_ERROR(t->cb, "%s(): unknown event(s) %x", __func__, events);
if (events & NEPER_EPOLL_MASK) {
flow_delete(f);
return false;
}
ssize_t len = rr->rr_xfer;
if ((len == opts->request_size) && opts->client)
common_gettime(&rr->rr_ts_1);
int flags = 0;
if (len > opts->buffer_size) {
len = opts->buffer_size;
flags |= MSG_MORE;
}
ssize_t n = rr_send(f, flow_mbuf(f), len, flags);
if (n == -1) {
PLOG_ERROR(t->cb, "send");
return false;
}
rr->rr_xfer -= n;
if (rr->rr_xfer)
return false;
// Transition to receiving.
rr->rr_xfer = rr_recv_size(t);
return true;
}
static bool rr_do_recv(struct flow *f, uint32_t events, rr_recv_t rr_recv)
{
struct thread *t = flow_thread(f);
const struct options *opts = t->opts;
struct rr_state *rr = flow_opaque(f);
if (events & ~(NEPER_EPOLL_MASK | EPOLLIN))
LOG_ERROR(t->cb, "%s(): unknown event(s) %x", __func__, events);
if (events & NEPER_EPOLL_MASK) {
flow_delete(f);
return false;
}
ssize_t len = rr->rr_xfer;
if (len > opts->buffer_size)
len = opts->buffer_size;
ssize_t n;
do {
n = rr_recv(f, flow_mbuf(f), len);
} while(n == -1 && errno == EINTR);
if (n == -1) {
PLOG_ERROR(t->cb, "read");
return false;
}
if (n == 0) {
flow_delete(f);
return false;
}
rr->rr_xfer -= n;
if (rr->rr_xfer)
return false;
if (opts->client) {
rr->rr_ts_0 = rr->rr_ts_2;
common_gettime(&rr->rr_ts_2);
}
t->transactions++;
// Transition to sending.
rr->rr_xfer = rr_send_size(t);
return true;
}
static void rr_snapshot(struct thread *t, struct neper_stat *stat,
struct neper_snap *snap)
{
struct neper_histo *histo = stat->histo(stat);
neper_histo_epoch(histo);
struct rr_snap_opaque *opaque = (void *)&snap->opaque;
opaque->min = neper_histo_min(histo);
opaque->max = neper_histo_max(histo);
opaque->mean = neper_histo_mean(histo);
opaque->stddev = neper_histo_stddev(histo);
for (int i = 0; i < t->opts->percentiles.p_count; i++)
opaque->percentile[i] = neper_histo_percent(histo, i);
}
static bool rr_do_compl(struct flow *f,
const struct timespec *then,
const struct timespec *now)
{
double elapsed = seconds_between(then, now);
struct thread *t = flow_thread(f);
bool last = false;
struct neper_stat *stat = flow_stat(f);
struct neper_histo *histo = stat->histo(stat);
neper_histo_event(histo, elapsed);
if (t->data_pending) {
/* data vs time mode, last rr? */
if (!countdown_cond_commit(t->data_pending)) {
LOG_INFO(t->cb, "last transaction received");
last = true;
}
}
stat->event(t, stat, 1, last, rr_snapshot);
return last;
}
/* The state machine for RR clients: */
static void rr_client_state_1(struct flow *f, uint32_t events)
{
struct thread *t = flow_thread(f);
if (rr_do_recv(f, events, rr_fn_recv)) {
struct rr_state *rr = flow_opaque(f);
if (rr_do_compl(f, &rr->rr_ts_1, &rr->rr_ts_2))
return;
if (!t->opts->delay && rr_do_send(f, EPOLLOUT, rr_fn_send))
return;
flow_mod(f, rr_client_state_0, EPOLLOUT, true);
}
}
static void rr_client_state_0(struct flow *f, uint32_t events)
{
struct thread *t = flow_thread(f);
if (t->data_pending && countdown_cond_dec(t->data_pending) < 0) {
/* data vs time mode and no more transactons to send */
return;
}
if (t->opts->delay && flow_postpone(f))
return;
if (rr_do_send(f, events, rr_fn_send))
flow_mod(f, rr_client_state_1, EPOLLIN, true);
}
/* The state machine for CRR clients: */
static void crr_client_state_1(struct flow *f, uint32_t events)
{
if (rr_do_recv(f, events, rr_fn_recv)) {
struct rr_state *rr = flow_opaque(f);
if (rr_do_compl(f, &rr->rr_ts_0, &rr->rr_ts_2))
return;
flow_reconnect(f, crr_client_state_0, EPOLLOUT);
}
}
static void crr_client_state_0(struct flow *f, uint32_t events)
{
struct thread *t = flow_thread(f);
if (t->data_pending && countdown_cond_dec(t->data_pending) < 0) {
/* data vs time mode and no more transactons to send */
return;
}
if (rr_do_send(f, events, rr_fn_send))
flow_mod(f, crr_client_state_1, EPOLLIN, true);
}
/* The state machine for servers: */
static void rr_server_state_2(struct flow *f, uint32_t events)
{
struct rr_state *rr = flow_opaque(f);
struct thread *t = flow_thread(f);
struct neper_stat *stat = flow_stat(f);
struct neper_histo *histo = stat ? stat->histo(stat) : NULL;
if (rr_do_send(f, events, rr->rr_send)) {
if (stat) {
/* rr server has no meaningful latency to measure. */
neper_histo_event(histo, 0.0);
stat->event(t, stat, 1, false, rr_snapshot);
}
flow_mod(f, rr_server_state_0, EPOLLIN, false);
}
}
static void rr_server_state_1(struct flow *f)
{
flow_mod(f, rr_server_state_2, EPOLLOUT, false);
}
static void rr_server_state_0(struct flow *f, uint32_t events)
{
struct rr_state *rr = flow_opaque(f);
if (rr_do_recv(f, events, rr->rr_recv))
rr_server_state_1(f);
}
/* These functions point the state machines at their first handler functions. */
void crr_flow_init(struct thread *t, int fd)
{
void (*state)(struct flow *, uint32_t);
uint32_t event;
if (t->opts->client) {
state = crr_client_state_0;
event = EPOLLOUT;
} else {
state = rr_server_state_0; /* crr & rr servers are identical */
event = EPOLLIN;
}
rr_state_init(t, fd, state, event);
}
void rr_flow_init(struct thread *t, int fd)
{
void (*state)(struct flow *, uint32_t);
uint32_t event;
if (t->opts->client) {
state = rr_client_state_0;
event = EPOLLOUT;
} else {
state = rr_server_state_0;
event = EPOLLIN;
}
rr_state_init(t, fd, state, event);
}
/*
* Statistics. Ignore everything below this line, which (a) has not been
* changed and (b) is about to be completely replaced.
*/
static void rr_print_snap(struct thread *t, int flow_index,
const struct neper_snap *snap, FILE *csv)
{
if (snap && csv) {
const struct rr_snap_opaque *rso = (void *)&snap->opaque;
fprintf(csv, ",%f,%f,%f,%f",
rso->min, rso->mean, rso->max, rso->stddev);
for (int i = 0; i < t->opts->percentiles.p_count; i++)
fprintf(csv, ",%f", rso->percentile[i]);
fprintf(csv, "\n");
}
}
static int
fn_add(struct neper_stat *stat, void *ptr)
{
struct neper_histo *src = stat->histo(stat);
struct neper_histo *des = ptr;
neper_histo_add(des, src);
return 0;
}
int rr_report_stats(struct thread *tinfo)
{
const struct options *opts = tinfo[0].opts;
const char *path = opts->all_samples;
struct callbacks *cb = tinfo[0].cb;
FILE *csv = NULL;
int i;
if (opts->nostats)
return 0;
int num_events = thread_stats_events(tinfo);
PRINT(cb, "num_transactions", "%d", num_events);
struct neper_histo *sum = neper_histo_new(tinfo, DEFAULT_K_BITS);
for (i = 0; i < opts->num_threads; i++)
tinfo[i].stats->sumforeach(tinfo[i].stats, fn_add, sum);
neper_histo_epoch(sum);
neper_histo_print(sum);
neper_histo_delete(sum);
if (path) {
csv = print_header(path, "transactions,transactions/s",
"", cb);
print_latency_header(csv, &opts->percentiles);
}
struct neper_coef *coef = neper_stat_print(tinfo, csv, rr_print_snap);
if (coef) {
double thru = coef->thruput(coef);
struct options *w_opts = (struct options *)opts;
w_opts->local_rate = thru; /* bits/s */
PRINT(cb, "throughput", "%.2f", thru);
coef->fini(coef);
} else {
LOG_ERROR(cb, "%s: not able to find coef", __func__);
return -1;
}
if (csv)
fclose(csv);
return 0;
}