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
|
/*-
* BSD LICENSE
*
* Copyright(c) 2016-2017 Intel Corporation. All rights reserved.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Intel Corporation nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <getopt.h>
#include <stdarg.h>
#include <errno.h>
#include <rte_memory.h>
#include <rte_string_fns.h>
#include "common.h"
#include "args.h"
#include "init.h"
/* 1M flows by default */
#define DEFAULT_NUM_FLOWS 0x100000
/* global var for number of nodes - extern in header */
uint8_t num_nodes;
/* global var for number of flows - extern in header */
uint32_t num_flows = DEFAULT_NUM_FLOWS;
static const char *progname;
/**
* Prints out usage information to stdout
*/
static void
usage(void)
{
printf("%s [EAL options] -- -p PORTMASK -n NUM_NODES -f NUM_FLOWS\n"
" -p PORTMASK: hexadecimal bitmask of ports to use\n"
" -n NUM_NODES: number of node processes to use\n"
" -f NUM_FLOWS: number of flows to be added in the EFD table\n",
progname);
}
/**
* The ports to be used by the application are passed in
* the form of a bitmask. This function parses the bitmask
* and places the port numbers to be used into the port[]
* array variable
*/
static int
parse_portmask(uint8_t max_ports, const char *portmask)
{
char *end = NULL;
unsigned long pm;
uint8_t count = 0;
if (portmask == NULL || *portmask == '\0')
return -1;
/* convert parameter to a number and verify */
pm = strtoul(portmask, &end, 16);
if (end == NULL || *end != '\0' || pm == 0)
return -1;
/* loop through bits of the mask and mark ports */
while (pm != 0) {
if (pm & 0x01) { /* bit is set in mask, use port */
if (count >= max_ports)
printf("WARNING: requested port %u not present"
" - ignoring\n", (unsigned int)count);
else
info->id[info->num_ports++] = count;
}
pm = (pm >> 1);
count++;
}
return 0;
}
/**
* Take the number of nodes parameter passed to the app
* and convert to a number to store in the num_nodes variable
*/
static int
parse_num_nodes(const char *nodes)
{
char *end = NULL;
unsigned long temp;
if (nodes == NULL || *nodes == '\0')
return -1;
temp = strtoul(nodes, &end, 10);
if (end == NULL || *end != '\0' || temp == 0)
return -1;
num_nodes = (uint8_t)temp;
return 0;
}
static int
parse_num_flows(const char *flows)
{
char *end = NULL;
/* parse hexadecimal string */
num_flows = strtoul(flows, &end, 16);
if ((flows[0] == '\0') || (end == NULL) || (*end != '\0'))
return -1;
if (num_flows == 0)
return -1;
return 0;
}
/**
* The application specific arguments follow the DPDK-specific
* arguments which are stripped by the DPDK init. This function
* processes these application arguments, printing usage info
* on error.
*/
int
parse_app_args(uint8_t max_ports, int argc, char *argv[])
{
int option_index, opt;
char **argvopt = argv;
static struct option lgopts[] = { /* no long options */
{NULL, 0, 0, 0 }
};
progname = argv[0];
while ((opt = getopt_long(argc, argvopt, "n:f:p:", lgopts,
&option_index)) != EOF) {
switch (opt) {
case 'p':
if (parse_portmask(max_ports, optarg) != 0) {
usage();
return -1;
}
break;
case 'n':
if (parse_num_nodes(optarg) != 0) {
usage();
return -1;
}
break;
case 'f':
if (parse_num_flows(optarg) != 0) {
usage();
return -1;
}
break;
default:
printf("ERROR: Unknown option '%c'\n", opt);
usage();
return -1;
}
}
if (info->num_ports == 0 || num_nodes == 0) {
usage();
return -1;
}
if (info->num_ports % 2 != 0) {
printf("ERROR: application requires an even "
"number of ports to use\n");
return -1;
}
return 0;
}
|
