blob: b71a342b90825b8b553b83e7908db179ed99bfb9 [file] [log] [blame]
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +02001// SPDX-License-Identifier: GPL-2.0
Björn Töpeldac09142018-05-18 14:00:21 +02002/* Copyright(c) 2017 - 2018 Intel Corporation. */
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +02003
4#include <assert.h>
5#include <errno.h>
6#include <getopt.h>
7#include <libgen.h>
8#include <linux/bpf.h>
9#include <linux/if_link.h>
10#include <linux/if_xdp.h>
11#include <linux/if_ether.h>
12#include <net/if.h>
13#include <signal.h>
14#include <stdbool.h>
15#include <stdio.h>
16#include <stdlib.h>
17#include <string.h>
18#include <net/ethernet.h>
19#include <sys/resource.h>
20#include <sys/socket.h>
21#include <sys/mman.h>
22#include <time.h>
23#include <unistd.h>
24#include <pthread.h>
25#include <locale.h>
26#include <sys/types.h>
27#include <poll.h>
28
29#include "bpf_load.h"
30#include "bpf_util.h"
Jakub Kicinski2bf3e2e2018-05-14 22:35:02 -070031#include <bpf/bpf.h>
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +020032
33#include "xdpsock.h"
34
35#ifndef SOL_XDP
36#define SOL_XDP 283
37#endif
38
39#ifndef AF_XDP
40#define AF_XDP 44
41#endif
42
43#ifndef PF_XDP
44#define PF_XDP AF_XDP
45#endif
46
47#define NUM_FRAMES 131072
48#define FRAME_HEADROOM 0
Björn Töpela412ef52018-06-04 13:57:14 +020049#define FRAME_SHIFT 11
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +020050#define FRAME_SIZE 2048
51#define NUM_DESCS 1024
52#define BATCH_SIZE 16
53
54#define FQ_NUM_DESCS 1024
55#define CQ_NUM_DESCS 1024
56
57#define DEBUG_HEXDUMP 0
58
Björn Töpela412ef52018-06-04 13:57:14 +020059typedef __u64 u64;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +020060typedef __u32 u32;
61
62static unsigned long prev_time;
63
64enum benchmark_type {
65 BENCH_RXDROP = 0,
66 BENCH_TXONLY = 1,
67 BENCH_L2FWD = 2,
68};
69
70static enum benchmark_type opt_bench = BENCH_RXDROP;
71static u32 opt_xdp_flags;
72static const char *opt_if = "";
73static int opt_ifindex;
74static int opt_queue;
75static int opt_poll;
76static int opt_shared_packet_buffer;
77static int opt_interval = 1;
78
79struct xdp_umem_uqueue {
80 u32 cached_prod;
81 u32 cached_cons;
82 u32 mask;
83 u32 size;
Björn Töpel1c4917d2018-05-22 09:35:00 +020084 u32 *producer;
85 u32 *consumer;
Björn Töpela412ef52018-06-04 13:57:14 +020086 u64 *ring;
Björn Töpel1c4917d2018-05-22 09:35:00 +020087 void *map;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +020088};
89
90struct xdp_umem {
Björn Töpela412ef52018-06-04 13:57:14 +020091 char *frames;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +020092 struct xdp_umem_uqueue fq;
93 struct xdp_umem_uqueue cq;
94 int fd;
95};
96
97struct xdp_uqueue {
98 u32 cached_prod;
99 u32 cached_cons;
100 u32 mask;
101 u32 size;
Björn Töpel1c4917d2018-05-22 09:35:00 +0200102 u32 *producer;
103 u32 *consumer;
104 struct xdp_desc *ring;
105 void *map;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200106};
107
108struct xdpsock {
109 struct xdp_uqueue rx;
110 struct xdp_uqueue tx;
111 int sfd;
112 struct xdp_umem *umem;
113 u32 outstanding_tx;
114 unsigned long rx_npkts;
115 unsigned long tx_npkts;
116 unsigned long prev_rx_npkts;
117 unsigned long prev_tx_npkts;
118};
119
120#define MAX_SOCKS 4
121static int num_socks;
122struct xdpsock *xsks[MAX_SOCKS];
123
124static unsigned long get_nsecs(void)
125{
126 struct timespec ts;
127
128 clock_gettime(CLOCK_MONOTONIC, &ts);
129 return ts.tv_sec * 1000000000UL + ts.tv_nsec;
130}
131
132static void dump_stats(void);
133
134#define lassert(expr) \
135 do { \
136 if (!(expr)) { \
137 fprintf(stderr, "%s:%s:%i: Assertion failed: " \
138 #expr ": errno: %d/\"%s\"\n", \
139 __FILE__, __func__, __LINE__, \
140 errno, strerror(errno)); \
141 dump_stats(); \
142 exit(EXIT_FAILURE); \
143 } \
144 } while (0)
145
146#define barrier() __asm__ __volatile__("": : :"memory")
147#define u_smp_rmb() barrier()
148#define u_smp_wmb() barrier()
149#define likely(x) __builtin_expect(!!(x), 1)
150#define unlikely(x) __builtin_expect(!!(x), 0)
151
152static const char pkt_data[] =
153 "\x3c\xfd\xfe\x9e\x7f\x71\xec\xb1\xd7\x98\x3a\xc0\x08\x00\x45\x00"
154 "\x00\x2e\x00\x00\x00\x00\x40\x11\x88\x97\x05\x08\x07\x08\xc8\x14"
155 "\x1e\x04\x10\x92\x10\x92\x00\x1a\x6d\xa3\x34\x33\x1f\x69\x40\x6b"
156 "\x54\x59\xb6\x14\x2d\x11\x44\xbf\xaf\xd9\xbe\xaa";
157
158static inline u32 umem_nb_free(struct xdp_umem_uqueue *q, u32 nb)
159{
160 u32 free_entries = q->size - (q->cached_prod - q->cached_cons);
161
162 if (free_entries >= nb)
163 return free_entries;
164
165 /* Refresh the local tail pointer */
Björn Töpel1c4917d2018-05-22 09:35:00 +0200166 q->cached_cons = *q->consumer;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200167
168 return q->size - (q->cached_prod - q->cached_cons);
169}
170
171static inline u32 xq_nb_free(struct xdp_uqueue *q, u32 ndescs)
172{
173 u32 free_entries = q->cached_cons - q->cached_prod;
174
175 if (free_entries >= ndescs)
176 return free_entries;
177
178 /* Refresh the local tail pointer */
Björn Töpel1c4917d2018-05-22 09:35:00 +0200179 q->cached_cons = *q->consumer + q->size;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200180 return q->cached_cons - q->cached_prod;
181}
182
183static inline u32 umem_nb_avail(struct xdp_umem_uqueue *q, u32 nb)
184{
185 u32 entries = q->cached_prod - q->cached_cons;
186
187 if (entries == 0) {
Björn Töpel1c4917d2018-05-22 09:35:00 +0200188 q->cached_prod = *q->producer;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200189 entries = q->cached_prod - q->cached_cons;
190 }
191
192 return (entries > nb) ? nb : entries;
193}
194
195static inline u32 xq_nb_avail(struct xdp_uqueue *q, u32 ndescs)
196{
197 u32 entries = q->cached_prod - q->cached_cons;
198
199 if (entries == 0) {
Björn Töpel1c4917d2018-05-22 09:35:00 +0200200 q->cached_prod = *q->producer;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200201 entries = q->cached_prod - q->cached_cons;
202 }
203
204 return (entries > ndescs) ? ndescs : entries;
205}
206
207static inline int umem_fill_to_kernel_ex(struct xdp_umem_uqueue *fq,
208 struct xdp_desc *d,
209 size_t nb)
210{
211 u32 i;
212
213 if (umem_nb_free(fq, nb) < nb)
214 return -ENOSPC;
215
216 for (i = 0; i < nb; i++) {
217 u32 idx = fq->cached_prod++ & fq->mask;
218
Björn Töpela412ef52018-06-04 13:57:14 +0200219 fq->ring[idx] = d[i].addr;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200220 }
221
222 u_smp_wmb();
223
Björn Töpel1c4917d2018-05-22 09:35:00 +0200224 *fq->producer = fq->cached_prod;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200225
226 return 0;
227}
228
Björn Töpela412ef52018-06-04 13:57:14 +0200229static inline int umem_fill_to_kernel(struct xdp_umem_uqueue *fq, u64 *d,
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200230 size_t nb)
231{
232 u32 i;
233
234 if (umem_nb_free(fq, nb) < nb)
235 return -ENOSPC;
236
237 for (i = 0; i < nb; i++) {
238 u32 idx = fq->cached_prod++ & fq->mask;
239
Björn Töpel1c4917d2018-05-22 09:35:00 +0200240 fq->ring[idx] = d[i];
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200241 }
242
243 u_smp_wmb();
244
Björn Töpel1c4917d2018-05-22 09:35:00 +0200245 *fq->producer = fq->cached_prod;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200246
247 return 0;
248}
249
250static inline size_t umem_complete_from_kernel(struct xdp_umem_uqueue *cq,
Björn Töpela412ef52018-06-04 13:57:14 +0200251 u64 *d, size_t nb)
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200252{
253 u32 idx, i, entries = umem_nb_avail(cq, nb);
254
255 u_smp_rmb();
256
257 for (i = 0; i < entries; i++) {
258 idx = cq->cached_cons++ & cq->mask;
Björn Töpel1c4917d2018-05-22 09:35:00 +0200259 d[i] = cq->ring[idx];
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200260 }
261
262 if (entries > 0) {
263 u_smp_wmb();
264
Björn Töpel1c4917d2018-05-22 09:35:00 +0200265 *cq->consumer = cq->cached_cons;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200266 }
267
268 return entries;
269}
270
Björn Töpela412ef52018-06-04 13:57:14 +0200271static inline void *xq_get_data(struct xdpsock *xsk, u64 addr)
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200272{
Björn Töpela412ef52018-06-04 13:57:14 +0200273 return &xsk->umem->frames[addr];
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200274}
275
276static inline int xq_enq(struct xdp_uqueue *uq,
277 const struct xdp_desc *descs,
278 unsigned int ndescs)
279{
Björn Töpel1c4917d2018-05-22 09:35:00 +0200280 struct xdp_desc *r = uq->ring;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200281 unsigned int i;
282
283 if (xq_nb_free(uq, ndescs) < ndescs)
284 return -ENOSPC;
285
286 for (i = 0; i < ndescs; i++) {
287 u32 idx = uq->cached_prod++ & uq->mask;
288
Björn Töpela412ef52018-06-04 13:57:14 +0200289 r[idx].addr = descs[i].addr;
Björn Töpel1c4917d2018-05-22 09:35:00 +0200290 r[idx].len = descs[i].len;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200291 }
292
293 u_smp_wmb();
294
Björn Töpel1c4917d2018-05-22 09:35:00 +0200295 *uq->producer = uq->cached_prod;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200296 return 0;
297}
298
299static inline int xq_enq_tx_only(struct xdp_uqueue *uq,
Björn Töpela412ef52018-06-04 13:57:14 +0200300 unsigned int id, unsigned int ndescs)
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200301{
Björn Töpel1c4917d2018-05-22 09:35:00 +0200302 struct xdp_desc *r = uq->ring;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200303 unsigned int i;
304
305 if (xq_nb_free(uq, ndescs) < ndescs)
306 return -ENOSPC;
307
308 for (i = 0; i < ndescs; i++) {
309 u32 idx = uq->cached_prod++ & uq->mask;
310
Björn Töpela412ef52018-06-04 13:57:14 +0200311 r[idx].addr = (id + i) << FRAME_SHIFT;
Björn Töpel1c4917d2018-05-22 09:35:00 +0200312 r[idx].len = sizeof(pkt_data) - 1;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200313 }
314
315 u_smp_wmb();
316
Björn Töpel1c4917d2018-05-22 09:35:00 +0200317 *uq->producer = uq->cached_prod;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200318 return 0;
319}
320
321static inline int xq_deq(struct xdp_uqueue *uq,
322 struct xdp_desc *descs,
323 int ndescs)
324{
Björn Töpel1c4917d2018-05-22 09:35:00 +0200325 struct xdp_desc *r = uq->ring;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200326 unsigned int idx;
327 int i, entries;
328
329 entries = xq_nb_avail(uq, ndescs);
330
331 u_smp_rmb();
332
333 for (i = 0; i < entries; i++) {
334 idx = uq->cached_cons++ & uq->mask;
Björn Töpel1c4917d2018-05-22 09:35:00 +0200335 descs[i] = r[idx];
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200336 }
337
338 if (entries > 0) {
339 u_smp_wmb();
340
Björn Töpel1c4917d2018-05-22 09:35:00 +0200341 *uq->consumer = uq->cached_cons;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200342 }
343
344 return entries;
345}
346
347static void swap_mac_addresses(void *data)
348{
349 struct ether_header *eth = (struct ether_header *)data;
350 struct ether_addr *src_addr = (struct ether_addr *)&eth->ether_shost;
351 struct ether_addr *dst_addr = (struct ether_addr *)&eth->ether_dhost;
352 struct ether_addr tmp;
353
354 tmp = *src_addr;
355 *src_addr = *dst_addr;
356 *dst_addr = tmp;
357}
358
Björn Töpela412ef52018-06-04 13:57:14 +0200359static void hex_dump(void *pkt, size_t length, u64 addr)
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200360{
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200361 const unsigned char *address = (unsigned char *)pkt;
362 const unsigned char *line = address;
363 size_t line_size = 32;
364 unsigned char c;
Björn Töpela412ef52018-06-04 13:57:14 +0200365 char buf[32];
366 int i = 0;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200367
Björn Töpela412ef52018-06-04 13:57:14 +0200368 if (!DEBUG_HEXDUMP)
369 return;
370
371 sprintf(buf, "addr=%llu", addr);
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200372 printf("length = %zu\n", length);
Björn Töpela412ef52018-06-04 13:57:14 +0200373 printf("%s | ", buf);
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200374 while (length-- > 0) {
375 printf("%02X ", *address++);
376 if (!(++i % line_size) || (length == 0 && i % line_size)) {
377 if (length == 0) {
378 while (i++ % line_size)
379 printf("__ ");
380 }
381 printf(" | "); /* right close */
382 while (line < address) {
383 c = *line++;
384 printf("%c", (c < 33 || c == 255) ? 0x2E : c);
385 }
386 printf("\n");
387 if (length > 0)
Björn Töpela412ef52018-06-04 13:57:14 +0200388 printf("%s | ", buf);
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200389 }
390 }
391 printf("\n");
392}
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200393
394static size_t gen_eth_frame(char *frame)
395{
396 memcpy(frame, pkt_data, sizeof(pkt_data) - 1);
397 return sizeof(pkt_data) - 1;
398}
399
400static struct xdp_umem *xdp_umem_configure(int sfd)
401{
402 int fq_size = FQ_NUM_DESCS, cq_size = CQ_NUM_DESCS;
Björn Töpel1c4917d2018-05-22 09:35:00 +0200403 struct xdp_mmap_offsets off;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200404 struct xdp_umem_reg mr;
405 struct xdp_umem *umem;
Björn Töpel1c4917d2018-05-22 09:35:00 +0200406 socklen_t optlen;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200407 void *bufs;
408
409 umem = calloc(1, sizeof(*umem));
410 lassert(umem);
411
412 lassert(posix_memalign(&bufs, getpagesize(), /* PAGE_SIZE aligned */
413 NUM_FRAMES * FRAME_SIZE) == 0);
414
415 mr.addr = (__u64)bufs;
416 mr.len = NUM_FRAMES * FRAME_SIZE;
Björn Töpela412ef52018-06-04 13:57:14 +0200417 mr.chunk_size = FRAME_SIZE;
418 mr.headroom = FRAME_HEADROOM;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200419
420 lassert(setsockopt(sfd, SOL_XDP, XDP_UMEM_REG, &mr, sizeof(mr)) == 0);
421 lassert(setsockopt(sfd, SOL_XDP, XDP_UMEM_FILL_RING, &fq_size,
422 sizeof(int)) == 0);
423 lassert(setsockopt(sfd, SOL_XDP, XDP_UMEM_COMPLETION_RING, &cq_size,
424 sizeof(int)) == 0);
425
Björn Töpel1c4917d2018-05-22 09:35:00 +0200426 optlen = sizeof(off);
427 lassert(getsockopt(sfd, SOL_XDP, XDP_MMAP_OFFSETS, &off,
428 &optlen) == 0);
429
430 umem->fq.map = mmap(0, off.fr.desc +
Björn Töpela412ef52018-06-04 13:57:14 +0200431 FQ_NUM_DESCS * sizeof(u64),
Björn Töpel1c4917d2018-05-22 09:35:00 +0200432 PROT_READ | PROT_WRITE,
433 MAP_SHARED | MAP_POPULATE, sfd,
434 XDP_UMEM_PGOFF_FILL_RING);
435 lassert(umem->fq.map != MAP_FAILED);
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200436
437 umem->fq.mask = FQ_NUM_DESCS - 1;
438 umem->fq.size = FQ_NUM_DESCS;
Björn Töpel1c4917d2018-05-22 09:35:00 +0200439 umem->fq.producer = umem->fq.map + off.fr.producer;
440 umem->fq.consumer = umem->fq.map + off.fr.consumer;
441 umem->fq.ring = umem->fq.map + off.fr.desc;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200442
Björn Töpel1c4917d2018-05-22 09:35:00 +0200443 umem->cq.map = mmap(0, off.cr.desc +
Björn Töpela412ef52018-06-04 13:57:14 +0200444 CQ_NUM_DESCS * sizeof(u64),
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200445 PROT_READ | PROT_WRITE,
446 MAP_SHARED | MAP_POPULATE, sfd,
447 XDP_UMEM_PGOFF_COMPLETION_RING);
Björn Töpel1c4917d2018-05-22 09:35:00 +0200448 lassert(umem->cq.map != MAP_FAILED);
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200449
450 umem->cq.mask = CQ_NUM_DESCS - 1;
451 umem->cq.size = CQ_NUM_DESCS;
Björn Töpel1c4917d2018-05-22 09:35:00 +0200452 umem->cq.producer = umem->cq.map + off.cr.producer;
453 umem->cq.consumer = umem->cq.map + off.cr.consumer;
454 umem->cq.ring = umem->cq.map + off.cr.desc;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200455
Björn Töpela412ef52018-06-04 13:57:14 +0200456 umem->frames = bufs;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200457 umem->fd = sfd;
458
459 if (opt_bench == BENCH_TXONLY) {
460 int i;
461
Björn Töpela412ef52018-06-04 13:57:14 +0200462 for (i = 0; i < NUM_FRAMES * FRAME_SIZE; i += FRAME_SIZE)
463 (void)gen_eth_frame(&umem->frames[i]);
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200464 }
465
466 return umem;
467}
468
469static struct xdpsock *xsk_configure(struct xdp_umem *umem)
470{
471 struct sockaddr_xdp sxdp = {};
Björn Töpel1c4917d2018-05-22 09:35:00 +0200472 struct xdp_mmap_offsets off;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200473 int sfd, ndescs = NUM_DESCS;
474 struct xdpsock *xsk;
475 bool shared = true;
Björn Töpel1c4917d2018-05-22 09:35:00 +0200476 socklen_t optlen;
Björn Töpela412ef52018-06-04 13:57:14 +0200477 u64 i;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200478
479 sfd = socket(PF_XDP, SOCK_RAW, 0);
480 lassert(sfd >= 0);
481
482 xsk = calloc(1, sizeof(*xsk));
483 lassert(xsk);
484
485 xsk->sfd = sfd;
486 xsk->outstanding_tx = 0;
487
488 if (!umem) {
489 shared = false;
490 xsk->umem = xdp_umem_configure(sfd);
491 } else {
492 xsk->umem = umem;
493 }
494
495 lassert(setsockopt(sfd, SOL_XDP, XDP_RX_RING,
496 &ndescs, sizeof(int)) == 0);
497 lassert(setsockopt(sfd, SOL_XDP, XDP_TX_RING,
498 &ndescs, sizeof(int)) == 0);
Björn Töpel1c4917d2018-05-22 09:35:00 +0200499 optlen = sizeof(off);
500 lassert(getsockopt(sfd, SOL_XDP, XDP_MMAP_OFFSETS, &off,
501 &optlen) == 0);
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200502
503 /* Rx */
Björn Töpel1c4917d2018-05-22 09:35:00 +0200504 xsk->rx.map = mmap(NULL,
505 off.rx.desc +
506 NUM_DESCS * sizeof(struct xdp_desc),
507 PROT_READ | PROT_WRITE,
508 MAP_SHARED | MAP_POPULATE, sfd,
509 XDP_PGOFF_RX_RING);
510 lassert(xsk->rx.map != MAP_FAILED);
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200511
512 if (!shared) {
Björn Töpela412ef52018-06-04 13:57:14 +0200513 for (i = 0; i < NUM_DESCS * FRAME_SIZE; i += FRAME_SIZE)
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200514 lassert(umem_fill_to_kernel(&xsk->umem->fq, &i, 1)
515 == 0);
516 }
517
518 /* Tx */
Björn Töpel1c4917d2018-05-22 09:35:00 +0200519 xsk->tx.map = mmap(NULL,
520 off.tx.desc +
521 NUM_DESCS * sizeof(struct xdp_desc),
522 PROT_READ | PROT_WRITE,
523 MAP_SHARED | MAP_POPULATE, sfd,
524 XDP_PGOFF_TX_RING);
525 lassert(xsk->tx.map != MAP_FAILED);
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200526
527 xsk->rx.mask = NUM_DESCS - 1;
528 xsk->rx.size = NUM_DESCS;
Björn Töpel1c4917d2018-05-22 09:35:00 +0200529 xsk->rx.producer = xsk->rx.map + off.rx.producer;
530 xsk->rx.consumer = xsk->rx.map + off.rx.consumer;
531 xsk->rx.ring = xsk->rx.map + off.rx.desc;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200532
533 xsk->tx.mask = NUM_DESCS - 1;
534 xsk->tx.size = NUM_DESCS;
Björn Töpel1c4917d2018-05-22 09:35:00 +0200535 xsk->tx.producer = xsk->tx.map + off.tx.producer;
536 xsk->tx.consumer = xsk->tx.map + off.tx.consumer;
537 xsk->tx.ring = xsk->tx.map + off.tx.desc;
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200538
539 sxdp.sxdp_family = PF_XDP;
540 sxdp.sxdp_ifindex = opt_ifindex;
541 sxdp.sxdp_queue_id = opt_queue;
542 if (shared) {
543 sxdp.sxdp_flags = XDP_SHARED_UMEM;
544 sxdp.sxdp_shared_umem_fd = umem->fd;
545 }
546
547 lassert(bind(sfd, (struct sockaddr *)&sxdp, sizeof(sxdp)) == 0);
548
549 return xsk;
550}
551
552static void print_benchmark(bool running)
553{
554 const char *bench_str = "INVALID";
555
556 if (opt_bench == BENCH_RXDROP)
557 bench_str = "rxdrop";
558 else if (opt_bench == BENCH_TXONLY)
559 bench_str = "txonly";
560 else if (opt_bench == BENCH_L2FWD)
561 bench_str = "l2fwd";
562
563 printf("%s:%d %s ", opt_if, opt_queue, bench_str);
564 if (opt_xdp_flags & XDP_FLAGS_SKB_MODE)
565 printf("xdp-skb ");
566 else if (opt_xdp_flags & XDP_FLAGS_DRV_MODE)
567 printf("xdp-drv ");
568 else
569 printf(" ");
570
571 if (opt_poll)
572 printf("poll() ");
573
574 if (running) {
575 printf("running...");
576 fflush(stdout);
577 }
578}
579
580static void dump_stats(void)
581{
582 unsigned long now = get_nsecs();
583 long dt = now - prev_time;
584 int i;
585
586 prev_time = now;
587
588 for (i = 0; i < num_socks; i++) {
589 char *fmt = "%-15s %'-11.0f %'-11lu\n";
590 double rx_pps, tx_pps;
591
592 rx_pps = (xsks[i]->rx_npkts - xsks[i]->prev_rx_npkts) *
593 1000000000. / dt;
594 tx_pps = (xsks[i]->tx_npkts - xsks[i]->prev_tx_npkts) *
595 1000000000. / dt;
596
597 printf("\n sock%d@", i);
598 print_benchmark(false);
599 printf("\n");
600
601 printf("%-15s %-11s %-11s %-11.2f\n", "", "pps", "pkts",
602 dt / 1000000000.);
603 printf(fmt, "rx", rx_pps, xsks[i]->rx_npkts);
604 printf(fmt, "tx", tx_pps, xsks[i]->tx_npkts);
605
606 xsks[i]->prev_rx_npkts = xsks[i]->rx_npkts;
607 xsks[i]->prev_tx_npkts = xsks[i]->tx_npkts;
608 }
609}
610
611static void *poller(void *arg)
612{
613 (void)arg;
614 for (;;) {
615 sleep(opt_interval);
616 dump_stats();
617 }
618
619 return NULL;
620}
621
622static void int_exit(int sig)
623{
624 (void)sig;
625 dump_stats();
626 bpf_set_link_xdp_fd(opt_ifindex, -1, opt_xdp_flags);
627 exit(EXIT_SUCCESS);
628}
629
630static struct option long_options[] = {
631 {"rxdrop", no_argument, 0, 'r'},
632 {"txonly", no_argument, 0, 't'},
633 {"l2fwd", no_argument, 0, 'l'},
634 {"interface", required_argument, 0, 'i'},
635 {"queue", required_argument, 0, 'q'},
636 {"poll", no_argument, 0, 'p'},
637 {"shared-buffer", no_argument, 0, 's'},
638 {"xdp-skb", no_argument, 0, 'S'},
639 {"xdp-native", no_argument, 0, 'N'},
640 {"interval", required_argument, 0, 'n'},
641 {0, 0, 0, 0}
642};
643
644static void usage(const char *prog)
645{
646 const char *str =
647 " Usage: %s [OPTIONS]\n"
648 " Options:\n"
649 " -r, --rxdrop Discard all incoming packets (default)\n"
650 " -t, --txonly Only send packets\n"
651 " -l, --l2fwd MAC swap L2 forwarding\n"
652 " -i, --interface=n Run on interface n\n"
653 " -q, --queue=n Use queue n (default 0)\n"
654 " -p, --poll Use poll syscall\n"
655 " -s, --shared-buffer Use shared packet buffer\n"
656 " -S, --xdp-skb=n Use XDP skb-mod\n"
657 " -N, --xdp-native=n Enfore XDP native mode\n"
658 " -n, --interval=n Specify statistics update interval (default 1 sec).\n"
659 "\n";
660 fprintf(stderr, str, prog);
661 exit(EXIT_FAILURE);
662}
663
664static void parse_command_line(int argc, char **argv)
665{
666 int option_index, c;
667
668 opterr = 0;
669
670 for (;;) {
671 c = getopt_long(argc, argv, "rtli:q:psSNn:", long_options,
672 &option_index);
673 if (c == -1)
674 break;
675
676 switch (c) {
677 case 'r':
678 opt_bench = BENCH_RXDROP;
679 break;
680 case 't':
681 opt_bench = BENCH_TXONLY;
682 break;
683 case 'l':
684 opt_bench = BENCH_L2FWD;
685 break;
686 case 'i':
687 opt_if = optarg;
688 break;
689 case 'q':
690 opt_queue = atoi(optarg);
691 break;
692 case 's':
693 opt_shared_packet_buffer = 1;
694 break;
695 case 'p':
696 opt_poll = 1;
697 break;
698 case 'S':
699 opt_xdp_flags |= XDP_FLAGS_SKB_MODE;
700 break;
701 case 'N':
702 opt_xdp_flags |= XDP_FLAGS_DRV_MODE;
703 break;
704 case 'n':
705 opt_interval = atoi(optarg);
706 break;
707 default:
708 usage(basename(argv[0]));
709 }
710 }
711
712 opt_ifindex = if_nametoindex(opt_if);
713 if (!opt_ifindex) {
714 fprintf(stderr, "ERROR: interface \"%s\" does not exist\n",
715 opt_if);
716 usage(basename(argv[0]));
717 }
718}
719
720static void kick_tx(int fd)
721{
722 int ret;
723
724 ret = sendto(fd, NULL, 0, MSG_DONTWAIT, NULL, 0);
725 if (ret >= 0 || errno == ENOBUFS || errno == EAGAIN)
726 return;
727 lassert(0);
728}
729
730static inline void complete_tx_l2fwd(struct xdpsock *xsk)
731{
Björn Töpela412ef52018-06-04 13:57:14 +0200732 u64 descs[BATCH_SIZE];
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200733 unsigned int rcvd;
734 size_t ndescs;
735
736 if (!xsk->outstanding_tx)
737 return;
738
739 kick_tx(xsk->sfd);
740 ndescs = (xsk->outstanding_tx > BATCH_SIZE) ? BATCH_SIZE :
741 xsk->outstanding_tx;
742
743 /* re-add completed Tx buffers */
744 rcvd = umem_complete_from_kernel(&xsk->umem->cq, descs, ndescs);
745 if (rcvd > 0) {
746 umem_fill_to_kernel(&xsk->umem->fq, descs, rcvd);
747 xsk->outstanding_tx -= rcvd;
748 xsk->tx_npkts += rcvd;
749 }
750}
751
752static inline void complete_tx_only(struct xdpsock *xsk)
753{
Björn Töpela412ef52018-06-04 13:57:14 +0200754 u64 descs[BATCH_SIZE];
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200755 unsigned int rcvd;
756
757 if (!xsk->outstanding_tx)
758 return;
759
760 kick_tx(xsk->sfd);
761
762 rcvd = umem_complete_from_kernel(&xsk->umem->cq, descs, BATCH_SIZE);
763 if (rcvd > 0) {
764 xsk->outstanding_tx -= rcvd;
765 xsk->tx_npkts += rcvd;
766 }
767}
768
769static void rx_drop(struct xdpsock *xsk)
770{
771 struct xdp_desc descs[BATCH_SIZE];
772 unsigned int rcvd, i;
773
774 rcvd = xq_deq(&xsk->rx, descs, BATCH_SIZE);
775 if (!rcvd)
776 return;
777
778 for (i = 0; i < rcvd; i++) {
Björn Töpela412ef52018-06-04 13:57:14 +0200779 char *pkt = xq_get_data(xsk, descs[i].addr);
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200780
Björn Töpela412ef52018-06-04 13:57:14 +0200781 hex_dump(pkt, descs[i].len, descs[i].addr);
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200782 }
783
784 xsk->rx_npkts += rcvd;
785
786 umem_fill_to_kernel_ex(&xsk->umem->fq, descs, rcvd);
787}
788
789static void rx_drop_all(void)
790{
791 struct pollfd fds[MAX_SOCKS + 1];
792 int i, ret, timeout, nfds = 1;
793
794 memset(fds, 0, sizeof(fds));
795
796 for (i = 0; i < num_socks; i++) {
797 fds[i].fd = xsks[i]->sfd;
798 fds[i].events = POLLIN;
799 timeout = 1000; /* 1sn */
800 }
801
802 for (;;) {
803 if (opt_poll) {
804 ret = poll(fds, nfds, timeout);
805 if (ret <= 0)
806 continue;
807 }
808
809 for (i = 0; i < num_socks; i++)
810 rx_drop(xsks[i]);
811 }
812}
813
814static void tx_only(struct xdpsock *xsk)
815{
816 int timeout, ret, nfds = 1;
817 struct pollfd fds[nfds + 1];
818 unsigned int idx = 0;
819
820 memset(fds, 0, sizeof(fds));
821 fds[0].fd = xsk->sfd;
822 fds[0].events = POLLOUT;
823 timeout = 1000; /* 1sn */
824
825 for (;;) {
826 if (opt_poll) {
827 ret = poll(fds, nfds, timeout);
828 if (ret <= 0)
829 continue;
830
831 if (fds[0].fd != xsk->sfd ||
832 !(fds[0].revents & POLLOUT))
833 continue;
834 }
835
836 if (xq_nb_free(&xsk->tx, BATCH_SIZE) >= BATCH_SIZE) {
837 lassert(xq_enq_tx_only(&xsk->tx, idx, BATCH_SIZE) == 0);
838
839 xsk->outstanding_tx += BATCH_SIZE;
840 idx += BATCH_SIZE;
841 idx %= NUM_FRAMES;
842 }
843
844 complete_tx_only(xsk);
845 }
846}
847
848static void l2fwd(struct xdpsock *xsk)
849{
850 for (;;) {
851 struct xdp_desc descs[BATCH_SIZE];
852 unsigned int rcvd, i;
853 int ret;
854
855 for (;;) {
856 complete_tx_l2fwd(xsk);
857
858 rcvd = xq_deq(&xsk->rx, descs, BATCH_SIZE);
859 if (rcvd > 0)
860 break;
861 }
862
863 for (i = 0; i < rcvd; i++) {
Björn Töpela412ef52018-06-04 13:57:14 +0200864 char *pkt = xq_get_data(xsk, descs[i].addr);
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200865
866 swap_mac_addresses(pkt);
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200867
Björn Töpela412ef52018-06-04 13:57:14 +0200868 hex_dump(pkt, descs[i].len, descs[i].addr);
Magnus Karlssonb4b8faa2018-05-02 13:01:36 +0200869 }
870
871 xsk->rx_npkts += rcvd;
872
873 ret = xq_enq(&xsk->tx, descs, rcvd);
874 lassert(ret == 0);
875 xsk->outstanding_tx += rcvd;
876 }
877}
878
879int main(int argc, char **argv)
880{
881 struct rlimit r = {RLIM_INFINITY, RLIM_INFINITY};
882 char xdp_filename[256];
883 int i, ret, key = 0;
884 pthread_t pt;
885
886 parse_command_line(argc, argv);
887
888 if (setrlimit(RLIMIT_MEMLOCK, &r)) {
889 fprintf(stderr, "ERROR: setrlimit(RLIMIT_MEMLOCK) \"%s\"\n",
890 strerror(errno));
891 exit(EXIT_FAILURE);
892 }
893
894 snprintf(xdp_filename, sizeof(xdp_filename), "%s_kern.o", argv[0]);
895
896 if (load_bpf_file(xdp_filename)) {
897 fprintf(stderr, "ERROR: load_bpf_file %s\n", bpf_log_buf);
898 exit(EXIT_FAILURE);
899 }
900
901 if (!prog_fd[0]) {
902 fprintf(stderr, "ERROR: load_bpf_file: \"%s\"\n",
903 strerror(errno));
904 exit(EXIT_FAILURE);
905 }
906
907 if (bpf_set_link_xdp_fd(opt_ifindex, prog_fd[0], opt_xdp_flags) < 0) {
908 fprintf(stderr, "ERROR: link set xdp fd failed\n");
909 exit(EXIT_FAILURE);
910 }
911
912 ret = bpf_map_update_elem(map_fd[0], &key, &opt_queue, 0);
913 if (ret) {
914 fprintf(stderr, "ERROR: bpf_map_update_elem qidconf\n");
915 exit(EXIT_FAILURE);
916 }
917
918 /* Create sockets... */
919 xsks[num_socks++] = xsk_configure(NULL);
920
921#if RR_LB
922 for (i = 0; i < MAX_SOCKS - 1; i++)
923 xsks[num_socks++] = xsk_configure(xsks[0]->umem);
924#endif
925
926 /* ...and insert them into the map. */
927 for (i = 0; i < num_socks; i++) {
928 key = i;
929 ret = bpf_map_update_elem(map_fd[1], &key, &xsks[i]->sfd, 0);
930 if (ret) {
931 fprintf(stderr, "ERROR: bpf_map_update_elem %d\n", i);
932 exit(EXIT_FAILURE);
933 }
934 }
935
936 signal(SIGINT, int_exit);
937 signal(SIGTERM, int_exit);
938 signal(SIGABRT, int_exit);
939
940 setlocale(LC_ALL, "");
941
942 ret = pthread_create(&pt, NULL, poller, NULL);
943 lassert(ret == 0);
944
945 prev_time = get_nsecs();
946
947 if (opt_bench == BENCH_RXDROP)
948 rx_drop_all();
949 else if (opt_bench == BENCH_TXONLY)
950 tx_only(xsks[0]);
951 else
952 l2fwd(xsks[0]);
953
954 return 0;
955}