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 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282
|
/*
* Copyright © 2012 Kristian Høgsberg
* Copyright 2025 Collabora, Ltd.
*
* 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:
*
* 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.
*/
#include "config.h"
#include <stdbool.h>
#include <stdlib.h>
#include <stdint.h>
#include <stdio.h>
#include <string.h>
#include <assert.h>
#include <errno.h>
#include <wayland-util.h>
#include <libweston/config-parser.h>
#include "string-helpers.h"
#include "xalloc.h"
static bool
handle_option(const struct weston_option *option, char *value)
{
char* p;
switch (option->type) {
case WESTON_OPTION_INTEGER:
if (!safe_strtoint(value, option->data))
return false;
return true;
case WESTON_OPTION_UNSIGNED_INTEGER:
errno = 0;
* (uint32_t *) option->data = strtoul(value, &p, 10);
if (errno != 0 || p == value || *p != '\0')
return false;
return true;
case WESTON_OPTION_STRING:
* (char **) option->data = strdup(value);
return true;
default:
assert(0);
return false;
}
}
static bool
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]) {
* (bool *) options[k].data = true;
return true;
}
} else if (arg[len+2] == '=') {
return handle_option(options + k, arg + len + 3);
}
}
return false;
}
static bool
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);
}
return false;
}
static bool
short_option(const struct weston_option *options, int count, char *arg)
{
int k;
if (!arg[1])
return false;
for (k = 0; k < count; k++) {
if (options[k].short_name != arg[1])
continue;
if (options[k].type == WESTON_OPTION_BOOLEAN) {
if (!arg[2]) {
* (bool *) options[k].data = true;
return true;
}
} else if (arg[2]) {
return handle_option(options + k, arg + 2);
} else {
return false;
}
}
return false;
}
static bool
short_option_with_arg(const struct weston_option *options, int count, char *arg, char *param)
{
int k;
if (!arg[1])
return false;
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);
}
return false;
}
int
parse_options(const struct weston_option *options,
int count, int *argc, char *argv[])
{
int i, j;
int ignore_options = 0;
for (i = 1, j = 1; i < *argc; i++) {
if (argv[i][0] == '-' && ignore_options == 0) {
if (argv[i][1] == '-') {
if (strlen(argv[i]) == 2) {
/* '--' to ignore the remaining options */
i--; /* reinsert the '--' entry */
ignore_options = 1;
continue;
}
/* Long option, e.g. --foo or --foo=bar */
if (long_option(options, count, argv[i]))
continue;
/* ...also handle --foo bar */
if (i + 1 < *argc &&
long_option_with_arg(options, count,
argv[i], argv[i+1])) {
i++;
continue;
}
} 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;
}
}
}
argv[j++] = argv[i];
}
argv[j] = NULL;
*argc = j;
return j;
}
/** 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
};
}
|