1*4882a593Smuzhiyun // SPDX-License-Identifier: GPL-2.0 OR Linux-OpenIB
2*4882a593Smuzhiyun
3*4882a593Smuzhiyun /**
4*4882a593Smuzhiyun * ibumad BPF sample user side
5*4882a593Smuzhiyun *
6*4882a593Smuzhiyun * This program is free software; you can redistribute it and/or
7*4882a593Smuzhiyun * modify it under the terms of version 2 of the GNU General Public
8*4882a593Smuzhiyun * License as published by the Free Software Foundation.
9*4882a593Smuzhiyun *
10*4882a593Smuzhiyun * Copyright(c) 2018 Ira Weiny, Intel Corporation
11*4882a593Smuzhiyun */
12*4882a593Smuzhiyun
13*4882a593Smuzhiyun #include <linux/bpf.h>
14*4882a593Smuzhiyun #include <signal.h>
15*4882a593Smuzhiyun #include <stdio.h>
16*4882a593Smuzhiyun #include <stdlib.h>
17*4882a593Smuzhiyun #include <string.h>
18*4882a593Smuzhiyun #include <unistd.h>
19*4882a593Smuzhiyun #include <sys/types.h>
20*4882a593Smuzhiyun #include <limits.h>
21*4882a593Smuzhiyun
22*4882a593Smuzhiyun #include <sys/resource.h>
23*4882a593Smuzhiyun #include <getopt.h>
24*4882a593Smuzhiyun #include <net/if.h>
25*4882a593Smuzhiyun
26*4882a593Smuzhiyun #include "bpf_load.h"
27*4882a593Smuzhiyun #include "bpf_util.h"
28*4882a593Smuzhiyun #include <bpf/libbpf.h>
29*4882a593Smuzhiyun
dump_counts(int fd)30*4882a593Smuzhiyun static void dump_counts(int fd)
31*4882a593Smuzhiyun {
32*4882a593Smuzhiyun __u32 key;
33*4882a593Smuzhiyun __u64 value;
34*4882a593Smuzhiyun
35*4882a593Smuzhiyun for (key = 0; key < 256; key++) {
36*4882a593Smuzhiyun if (bpf_map_lookup_elem(fd, &key, &value)) {
37*4882a593Smuzhiyun printf("failed to read key %u\n", key);
38*4882a593Smuzhiyun continue;
39*4882a593Smuzhiyun }
40*4882a593Smuzhiyun if (value)
41*4882a593Smuzhiyun printf("0x%02x : %llu\n", key, value);
42*4882a593Smuzhiyun }
43*4882a593Smuzhiyun }
44*4882a593Smuzhiyun
dump_all_counts(void)45*4882a593Smuzhiyun static void dump_all_counts(void)
46*4882a593Smuzhiyun {
47*4882a593Smuzhiyun printf("Read 'Class : count'\n");
48*4882a593Smuzhiyun dump_counts(map_fd[0]);
49*4882a593Smuzhiyun printf("Write 'Class : count'\n");
50*4882a593Smuzhiyun dump_counts(map_fd[1]);
51*4882a593Smuzhiyun }
52*4882a593Smuzhiyun
dump_exit(int sig)53*4882a593Smuzhiyun static void dump_exit(int sig)
54*4882a593Smuzhiyun {
55*4882a593Smuzhiyun dump_all_counts();
56*4882a593Smuzhiyun exit(0);
57*4882a593Smuzhiyun }
58*4882a593Smuzhiyun
59*4882a593Smuzhiyun static const struct option long_options[] = {
60*4882a593Smuzhiyun {"help", no_argument, NULL, 'h'},
61*4882a593Smuzhiyun {"delay", required_argument, NULL, 'd'},
62*4882a593Smuzhiyun };
63*4882a593Smuzhiyun
usage(char * cmd)64*4882a593Smuzhiyun static void usage(char *cmd)
65*4882a593Smuzhiyun {
66*4882a593Smuzhiyun printf("eBPF test program to count packets from various IP addresses\n"
67*4882a593Smuzhiyun "Usage: %s <options>\n"
68*4882a593Smuzhiyun " --help, -h this menu\n"
69*4882a593Smuzhiyun " --delay, -d <delay> wait <delay> sec between prints [1 - 1000000]\n"
70*4882a593Smuzhiyun , cmd
71*4882a593Smuzhiyun );
72*4882a593Smuzhiyun }
73*4882a593Smuzhiyun
main(int argc,char ** argv)74*4882a593Smuzhiyun int main(int argc, char **argv)
75*4882a593Smuzhiyun {
76*4882a593Smuzhiyun unsigned long delay = 5;
77*4882a593Smuzhiyun int longindex = 0;
78*4882a593Smuzhiyun int opt;
79*4882a593Smuzhiyun char bpf_file[256];
80*4882a593Smuzhiyun
81*4882a593Smuzhiyun /* Create the eBPF kernel code path name.
82*4882a593Smuzhiyun * This follows the pattern of all of the other bpf samples
83*4882a593Smuzhiyun */
84*4882a593Smuzhiyun snprintf(bpf_file, sizeof(bpf_file), "%s_kern.o", argv[0]);
85*4882a593Smuzhiyun
86*4882a593Smuzhiyun /* Do one final dump when exiting */
87*4882a593Smuzhiyun signal(SIGINT, dump_exit);
88*4882a593Smuzhiyun signal(SIGTERM, dump_exit);
89*4882a593Smuzhiyun
90*4882a593Smuzhiyun while ((opt = getopt_long(argc, argv, "hd:rSw",
91*4882a593Smuzhiyun long_options, &longindex)) != -1) {
92*4882a593Smuzhiyun switch (opt) {
93*4882a593Smuzhiyun case 'd':
94*4882a593Smuzhiyun delay = strtoul(optarg, NULL, 0);
95*4882a593Smuzhiyun if (delay == ULONG_MAX || delay < 0 ||
96*4882a593Smuzhiyun delay > 1000000) {
97*4882a593Smuzhiyun fprintf(stderr, "ERROR: invalid delay : %s\n",
98*4882a593Smuzhiyun optarg);
99*4882a593Smuzhiyun usage(argv[0]);
100*4882a593Smuzhiyun return 1;
101*4882a593Smuzhiyun }
102*4882a593Smuzhiyun break;
103*4882a593Smuzhiyun default:
104*4882a593Smuzhiyun case 'h':
105*4882a593Smuzhiyun usage(argv[0]);
106*4882a593Smuzhiyun return 1;
107*4882a593Smuzhiyun }
108*4882a593Smuzhiyun }
109*4882a593Smuzhiyun
110*4882a593Smuzhiyun if (load_bpf_file(bpf_file)) {
111*4882a593Smuzhiyun fprintf(stderr, "ERROR: failed to load eBPF from file : %s\n",
112*4882a593Smuzhiyun bpf_file);
113*4882a593Smuzhiyun return 1;
114*4882a593Smuzhiyun }
115*4882a593Smuzhiyun
116*4882a593Smuzhiyun while (1) {
117*4882a593Smuzhiyun sleep(delay);
118*4882a593Smuzhiyun dump_all_counts();
119*4882a593Smuzhiyun }
120*4882a593Smuzhiyun
121*4882a593Smuzhiyun return 0;
122*4882a593Smuzhiyun }
123