mirror of https://github.com/F-Stack/f-stack.git
172 lines
3.5 KiB
C
172 lines
3.5 KiB
C
/* SPDX-License-Identifier: BSD-3-Clause
|
|
* Copyright(c) 2016-2017 Intel Corporation
|
|
*/
|
|
|
|
#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;
|
|
}
|