2012-03-11 21:05:57 -04:00
|
|
|
/*
|
|
|
|
|
* Copyright © 2012 Kristian Høgsberg
|
2025-07-29 15:55:02 +03:00
|
|
|
* Copyright 2025 Collabora, Ltd.
|
2012-03-11 21:05:57 -04:00
|
|
|
*
|
2015-06-11 14:20:17 -07:00
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining
|
|
|
|
|
* a copy of this software and associated documentation files (the
|
|
|
|
|
* "Software"), to deal in the Software without restriction, including
|
|
|
|
|
* without limitation the rights to use, copy, modify, merge, publish,
|
|
|
|
|
* distribute, sublicense, and/or sell copies of the Software, and to
|
|
|
|
|
* permit persons to whom the Software is furnished to do so, subject to
|
|
|
|
|
* the following conditions:
|
2012-03-11 21:05:57 -04:00
|
|
|
*
|
2015-06-11 14:20:17 -07:00
|
|
|
* The above copyright notice and this permission notice (including the
|
|
|
|
|
* next paragraph) shall be included in all copies or substantial
|
|
|
|
|
* portions of the Software.
|
|
|
|
|
*
|
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
|
|
|
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
|
|
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
|
|
|
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
|
|
|
|
|
* BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
|
|
|
|
|
* ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
|
|
|
|
|
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
|
|
|
* SOFTWARE.
|
2012-03-11 21:05:57 -04:00
|
|
|
*/
|
|
|
|
|
|
2013-05-22 18:03:19 +03:00
|
|
|
#include "config.h"
|
|
|
|
|
|
2017-05-24 21:23:15 +01:00
|
|
|
#include <stdbool.h>
|
2012-03-11 21:05:57 -04:00
|
|
|
#include <stdlib.h>
|
|
|
|
|
#include <stdint.h>
|
|
|
|
|
#include <stdio.h>
|
|
|
|
|
#include <string.h>
|
|
|
|
|
#include <assert.h>
|
2016-08-03 17:40:50 -07:00
|
|
|
#include <errno.h>
|
2012-03-11 21:05:57 -04:00
|
|
|
|
2025-07-29 15:55:02 +03:00
|
|
|
#include <wayland-util.h>
|
2019-04-04 14:27:31 +03:00
|
|
|
#include <libweston/config-parser.h>
|
2016-08-03 17:40:52 -07:00
|
|
|
#include "string-helpers.h"
|
2025-07-29 15:55:02 +03:00
|
|
|
#include "xalloc.h"
|
2012-03-11 21:05:57 -04:00
|
|
|
|
2017-05-24 21:23:15 +01:00
|
|
|
static bool
|
2012-03-11 21:05:57 -04:00
|
|
|
handle_option(const struct weston_option *option, char *value)
|
|
|
|
|
{
|
2014-08-19 18:13:09 -07:00
|
|
|
char* p;
|
|
|
|
|
|
2012-03-11 21:05:57 -04:00
|
|
|
switch (option->type) {
|
|
|
|
|
case WESTON_OPTION_INTEGER:
|
2016-08-03 17:40:52 -07:00
|
|
|
if (!safe_strtoint(value, option->data))
|
2017-05-24 21:23:15 +01:00
|
|
|
return false;
|
|
|
|
|
return true;
|
2012-03-11 21:05:57 -04:00
|
|
|
case WESTON_OPTION_UNSIGNED_INTEGER:
|
2016-08-03 17:40:50 -07:00
|
|
|
errno = 0;
|
option-parser: Require integer option string values to be base-10
The third arg to strtol() specifies the base to assume for the number.
When 0 is passed, as is currently done in option-parser.c, hexadecimal
and octal numbers are permitted and automatically detected and
converted.
In weston and the weston clients and tests using option-parser.c, the
options are all things that can be expected to be specified in base 10:
widths, heights, counts, scales, font sizes, ports, ttys, connectors,
etc. The subsurfaces client uses two modes, limited to values 0 and 1
only. The zuc testsuite has a --random parameter for specifying a seed,
which is the only option where using hexadecimal or octal numbers might
conceivably happen.
The benefit of limiting this to base-10 is to eliminate surprises when
parsing numbers from the command line. Also, by making the code
consistent with other usages of strtol/strtoul, it may make it possible
to factor out the common code in the future.
Signed-off-by: Bryce Harrington <bryce@osg.samsung.com>
2016-07-08 17:44:10 -07:00
|
|
|
* (uint32_t *) option->data = strtoul(value, &p, 10);
|
2016-08-03 17:40:50 -07:00
|
|
|
if (errno != 0 || p == value || *p != '\0')
|
2017-05-24 21:23:15 +01:00
|
|
|
return false;
|
|
|
|
|
return true;
|
2012-03-11 21:05:57 -04:00
|
|
|
case WESTON_OPTION_STRING:
|
|
|
|
|
* (char **) option->data = strdup(value);
|
2017-05-24 21:23:15 +01:00
|
|
|
return true;
|
2012-03-11 21:05:57 -04:00
|
|
|
default:
|
|
|
|
|
assert(0);
|
2019-08-06 20:06:02 +03:00
|
|
|
return false;
|
2012-03-11 21:05:57 -04:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2017-05-24 21:23:15 +01:00
|
|
|
static bool
|
2014-08-19 18:13:09 -07:00
|
|
|
long_option(const struct weston_option *options, int count, char *arg)
|
|
|
|
|
{
|
|
|
|
|
int k, len;
|
|
|
|
|
|
|
|
|
|
for (k = 0; k < count; k++) {
|
|
|
|
|
if (!options[k].name)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
len = strlen(options[k].name);
|
|
|
|
|
if (strncmp(options[k].name, arg + 2, len) != 0)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (options[k].type == WESTON_OPTION_BOOLEAN) {
|
|
|
|
|
if (!arg[len + 2]) {
|
2019-11-26 00:32:22 +00:00
|
|
|
* (bool *) options[k].data = true;
|
2014-08-19 18:13:09 -07:00
|
|
|
|
2017-05-24 21:23:15 +01:00
|
|
|
return true;
|
2014-08-19 18:13:09 -07:00
|
|
|
}
|
|
|
|
|
} else if (arg[len+2] == '=') {
|
|
|
|
|
return handle_option(options + k, arg + len + 3);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2017-05-24 21:23:15 +01:00
|
|
|
return false;
|
2014-08-19 18:13:09 -07:00
|
|
|
}
|
|
|
|
|
|
2017-05-24 21:23:15 +01:00
|
|
|
static bool
|
2017-05-08 12:47:55 -04:00
|
|
|
long_option_with_arg(const struct weston_option *options, int count, char *arg,
|
|
|
|
|
char *param)
|
|
|
|
|
{
|
|
|
|
|
int k, len;
|
|
|
|
|
|
|
|
|
|
for (k = 0; k < count; k++) {
|
|
|
|
|
if (!options[k].name)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
len = strlen(options[k].name);
|
|
|
|
|
if (strncmp(options[k].name, arg + 2, len) != 0)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
/* Since long_option() should handle all booleans, we should
|
|
|
|
|
* never reach this
|
|
|
|
|
*/
|
|
|
|
|
assert(options[k].type != WESTON_OPTION_BOOLEAN);
|
|
|
|
|
|
|
|
|
|
return handle_option(options + k, param);
|
|
|
|
|
}
|
|
|
|
|
|
2017-05-24 21:23:15 +01:00
|
|
|
return false;
|
2017-05-08 12:47:55 -04:00
|
|
|
}
|
|
|
|
|
|
2017-05-24 21:23:15 +01:00
|
|
|
static bool
|
2014-08-19 18:13:09 -07:00
|
|
|
short_option(const struct weston_option *options, int count, char *arg)
|
|
|
|
|
{
|
|
|
|
|
int k;
|
|
|
|
|
|
|
|
|
|
if (!arg[1])
|
2017-05-24 21:23:15 +01:00
|
|
|
return false;
|
2014-08-19 18:13:09 -07:00
|
|
|
|
|
|
|
|
for (k = 0; k < count; k++) {
|
|
|
|
|
if (options[k].short_name != arg[1])
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (options[k].type == WESTON_OPTION_BOOLEAN) {
|
|
|
|
|
if (!arg[2]) {
|
2019-11-26 00:32:22 +00:00
|
|
|
* (bool *) options[k].data = true;
|
2014-08-19 18:13:09 -07:00
|
|
|
|
2017-05-24 21:23:15 +01:00
|
|
|
return true;
|
2014-08-19 18:13:09 -07:00
|
|
|
}
|
2016-02-11 15:25:56 -08:00
|
|
|
} else if (arg[2]) {
|
2014-08-19 18:13:09 -07:00
|
|
|
return handle_option(options + k, arg + 2);
|
2016-02-11 15:25:56 -08:00
|
|
|
} else {
|
2017-05-24 21:23:15 +01:00
|
|
|
return false;
|
2014-08-19 18:13:09 -07:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2017-05-24 21:23:15 +01:00
|
|
|
return false;
|
2014-08-19 18:13:09 -07:00
|
|
|
}
|
|
|
|
|
|
2017-05-24 21:23:15 +01:00
|
|
|
static bool
|
2016-02-11 15:25:56 -08:00
|
|
|
short_option_with_arg(const struct weston_option *options, int count, char *arg, char *param)
|
|
|
|
|
{
|
|
|
|
|
int k;
|
|
|
|
|
|
|
|
|
|
if (!arg[1])
|
2017-05-24 21:23:15 +01:00
|
|
|
return false;
|
2016-02-11 15:25:56 -08:00
|
|
|
|
|
|
|
|
for (k = 0; k < count; k++) {
|
|
|
|
|
if (options[k].short_name != arg[1])
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (options[k].type == WESTON_OPTION_BOOLEAN)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
return handle_option(options + k, param);
|
|
|
|
|
}
|
|
|
|
|
|
2017-05-24 21:23:15 +01:00
|
|
|
return false;
|
2016-02-11 15:25:56 -08:00
|
|
|
}
|
|
|
|
|
|
2012-03-11 21:05:57 -04:00
|
|
|
int
|
|
|
|
|
parse_options(const struct weston_option *options,
|
2013-02-20 15:27:49 -05:00
|
|
|
int count, int *argc, char *argv[])
|
2012-03-11 21:05:57 -04:00
|
|
|
{
|
2014-08-19 18:13:09 -07:00
|
|
|
int i, j;
|
2023-10-21 15:59:00 -04:00
|
|
|
int ignore_options = 0;
|
2012-03-11 21:05:57 -04:00
|
|
|
|
2013-02-20 15:27:49 -05:00
|
|
|
for (i = 1, j = 1; i < *argc; i++) {
|
2023-10-21 15:59:00 -04:00
|
|
|
if (argv[i][0] == '-' && ignore_options == 0) {
|
2014-08-19 18:13:09 -07:00
|
|
|
if (argv[i][1] == '-') {
|
2023-10-21 15:59:00 -04:00
|
|
|
if (strlen(argv[i]) == 2) {
|
|
|
|
|
/* '--' to ignore the remaining options */
|
|
|
|
|
i--; /* reinsert the '--' entry */
|
|
|
|
|
ignore_options = 1;
|
|
|
|
|
continue;
|
|
|
|
|
}
|
2016-02-11 15:25:56 -08:00
|
|
|
/* Long option, e.g. --foo or --foo=bar */
|
2014-08-19 18:13:09 -07:00
|
|
|
if (long_option(options, count, argv[i]))
|
|
|
|
|
continue;
|
2016-02-11 15:25:56 -08:00
|
|
|
|
2017-05-08 12:47:55 -04:00
|
|
|
/* ...also handle --foo bar */
|
|
|
|
|
if (i + 1 < *argc &&
|
|
|
|
|
long_option_with_arg(options, count,
|
|
|
|
|
argv[i], argv[i+1])) {
|
|
|
|
|
i++;
|
|
|
|
|
continue;
|
|
|
|
|
}
|
2016-02-11 15:25:56 -08:00
|
|
|
} else {
|
|
|
|
|
/* Short option, e.g -f or -f42 */
|
|
|
|
|
if (short_option(options, count, argv[i]))
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
/* ...also handle -f 42 */
|
|
|
|
|
if (i+1 < *argc &&
|
|
|
|
|
short_option_with_arg(options, count, argv[i], argv[i+1])) {
|
|
|
|
|
i++;
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
}
|
2012-03-11 21:05:57 -04:00
|
|
|
}
|
2014-08-19 18:13:09 -07:00
|
|
|
argv[j++] = argv[i];
|
2012-03-11 21:05:57 -04:00
|
|
|
}
|
|
|
|
|
argv[j] = NULL;
|
2013-02-20 15:27:49 -05:00
|
|
|
*argc = j;
|
2012-03-11 21:05:57 -04:00
|
|
|
|
|
|
|
|
return j;
|
|
|
|
|
}
|
2025-07-29 15:55:02 +03:00
|
|
|
|
|
|
|
|
/** Free string array contents
|
|
|
|
|
*
|
|
|
|
|
* Does not free \c strarr itself but resets it.
|
|
|
|
|
*/
|
|
|
|
|
void
|
|
|
|
|
weston_string_array_fini(struct weston_string_array *strarr)
|
|
|
|
|
{
|
|
|
|
|
size_t i;
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < strarr->len; i++)
|
|
|
|
|
free(strarr->array[i]);
|
|
|
|
|
free(strarr->array);
|
|
|
|
|
strarr->len = 0;
|
|
|
|
|
strarr->array = NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static bool
|
|
|
|
|
is_space_for_split(char c)
|
|
|
|
|
{
|
|
|
|
|
return c == ' ' || c == '\t' || c == '\n' || c == '\r';
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/** Split a string at spaces, tabs, CRs, LFs
|
|
|
|
|
*
|
|
|
|
|
* \param str An arbitrary string, can be empty but not NULL.
|
|
|
|
|
* \return An array of sub-strings. Must be finalized with
|
|
|
|
|
* weston_string_array_fini().
|
|
|
|
|
*
|
|
|
|
|
* Takes the given string, and splits it into items. Empty items are skipped.
|
|
|
|
|
* The items are returned in the array in the same order they appeared in the
|
|
|
|
|
* string. Spaces, tabs, newlines or carriage returns will not be present in
|
|
|
|
|
* the items as they cannot be escaped.
|
|
|
|
|
*/
|
|
|
|
|
struct weston_string_array
|
|
|
|
|
weston_parse_space_separated_list(const char *str)
|
|
|
|
|
{
|
|
|
|
|
struct wl_array arr;
|
|
|
|
|
const char *p = str;
|
|
|
|
|
char **item;
|
|
|
|
|
|
|
|
|
|
wl_array_init(&arr);
|
|
|
|
|
|
|
|
|
|
while (*p) {
|
|
|
|
|
const char *end = p;
|
|
|
|
|
while (*end && !is_space_for_split(*end))
|
|
|
|
|
end++;
|
|
|
|
|
size_t len = end - p;
|
|
|
|
|
|
|
|
|
|
if (len > 0) {
|
|
|
|
|
item = wl_array_add(&arr, sizeof *item);
|
|
|
|
|
|
|
|
|
|
*item = strndup(p, len);
|
|
|
|
|
abort_oom_if_null(*item);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
p = end;
|
|
|
|
|
|
|
|
|
|
/* Skip whitespaces */
|
|
|
|
|
while (*p && is_space_for_split(*p))
|
|
|
|
|
p++;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return (struct weston_string_array){
|
|
|
|
|
.len = arr.size / sizeof *item,
|
|
|
|
|
.array = arr.data
|
|
|
|
|
};
|
|
|
|
|
}
|