Thomas Gleixner | 40b0b3f | 2019-06-03 07:44:46 +0200 | [diff] [blame] | 1 | // SPDX-License-Identifier: GPL-2.0-only |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2 | /* |
| 3 | * lib/parser.c - simple parser for mount, etc. options. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4 | */ |
| 5 | |
| 6 | #include <linux/ctype.h> |
Paul Gortmaker | 8bc3bcc | 2011-11-16 21:29:17 -0500 | [diff] [blame] | 7 | #include <linux/types.h> |
| 8 | #include <linux/export.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 9 | #include <linux/parser.h> |
| 10 | #include <linux/slab.h> |
| 11 | #include <linux/string.h> |
| 12 | |
| 13 | /** |
| 14 | * match_one: - Determines if a string matches a simple pattern |
Lucas De Marchi | 25985ed | 2011-03-30 22:57:33 -0300 | [diff] [blame] | 15 | * @s: the string to examine for presence of the pattern |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 16 | * @p: the string containing the pattern |
| 17 | * @args: array of %MAX_OPT_ARGS &substring_t elements. Used to return match |
| 18 | * locations. |
| 19 | * |
| 20 | * Description: Determines if the pattern @p is present in string @s. Can only |
| 21 | * match extremely simple token=arg style patterns. If the pattern is found, |
| 22 | * the location(s) of the arguments will be returned in the @args array. |
| 23 | */ |
David Howells | ef4533f | 2007-05-03 03:10:39 -0700 | [diff] [blame] | 24 | static int match_one(char *s, const char *p, substring_t args[]) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 25 | { |
| 26 | char *meta; |
| 27 | int argc = 0; |
| 28 | |
| 29 | if (!p) |
| 30 | return 1; |
| 31 | |
| 32 | while(1) { |
| 33 | int len = -1; |
| 34 | meta = strchr(p, '%'); |
| 35 | if (!meta) |
| 36 | return strcmp(p, s) == 0; |
| 37 | |
| 38 | if (strncmp(p, s, meta-p)) |
| 39 | return 0; |
| 40 | |
| 41 | s += meta - p; |
| 42 | p = meta + 1; |
| 43 | |
| 44 | if (isdigit(*p)) |
David Howells | ef4533f | 2007-05-03 03:10:39 -0700 | [diff] [blame] | 45 | len = simple_strtoul(p, (char **) &p, 10); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 46 | else if (*p == '%') { |
| 47 | if (*s++ != '%') |
| 48 | return 0; |
| 49 | p++; |
| 50 | continue; |
| 51 | } |
| 52 | |
| 53 | if (argc >= MAX_OPT_ARGS) |
| 54 | return 0; |
| 55 | |
| 56 | args[argc].from = s; |
| 57 | switch (*p++) { |
André Goddard Rosa | b5f54b0 | 2009-12-14 18:01:08 -0800 | [diff] [blame] | 58 | case 's': { |
| 59 | size_t str_len = strlen(s); |
| 60 | |
| 61 | if (str_len == 0) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 62 | return 0; |
André Goddard Rosa | b5f54b0 | 2009-12-14 18:01:08 -0800 | [diff] [blame] | 63 | if (len == -1 || len > str_len) |
| 64 | len = str_len; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 65 | args[argc].to = s + len; |
| 66 | break; |
André Goddard Rosa | b5f54b0 | 2009-12-14 18:01:08 -0800 | [diff] [blame] | 67 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 68 | case 'd': |
| 69 | simple_strtol(s, &args[argc].to, 0); |
| 70 | goto num; |
| 71 | case 'u': |
| 72 | simple_strtoul(s, &args[argc].to, 0); |
| 73 | goto num; |
| 74 | case 'o': |
| 75 | simple_strtoul(s, &args[argc].to, 8); |
| 76 | goto num; |
| 77 | case 'x': |
| 78 | simple_strtoul(s, &args[argc].to, 16); |
| 79 | num: |
| 80 | if (args[argc].to == args[argc].from) |
| 81 | return 0; |
| 82 | break; |
| 83 | default: |
| 84 | return 0; |
| 85 | } |
| 86 | s = args[argc].to; |
| 87 | argc++; |
| 88 | } |
| 89 | } |
| 90 | |
| 91 | /** |
| 92 | * match_token: - Find a token (and optional args) in a string |
| 93 | * @s: the string to examine for token/argument pairs |
| 94 | * @table: match_table_t describing the set of allowed option tokens and the |
| 95 | * arguments that may be associated with them. Must be terminated with a |
| 96 | * &struct match_token whose pattern is set to the NULL pointer. |
| 97 | * @args: array of %MAX_OPT_ARGS &substring_t elements. Used to return match |
| 98 | * locations. |
| 99 | * |
| 100 | * Description: Detects which if any of a set of token strings has been passed |
| 101 | * to it. Tokens can include up to MAX_OPT_ARGS instances of basic c-style |
| 102 | * format identifiers which will be taken into account when matching the |
| 103 | * tokens, and whose locations will be returned in the @args array. |
| 104 | */ |
Steven Whitehouse | a447c09 | 2008-10-13 10:46:57 +0100 | [diff] [blame] | 105 | int match_token(char *s, const match_table_t table, substring_t args[]) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 106 | { |
David Howells | ef4533f | 2007-05-03 03:10:39 -0700 | [diff] [blame] | 107 | const struct match_token *p; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 108 | |
| 109 | for (p = table; !match_one(s, p->pattern, args) ; p++) |
| 110 | ; |
| 111 | |
| 112 | return p->token; |
| 113 | } |
Andrew Morton | a3d2cca | 2014-01-23 15:54:13 -0800 | [diff] [blame] | 114 | EXPORT_SYMBOL(match_token); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 115 | |
| 116 | /** |
| 117 | * match_number: scan a number in the given base from a substring_t |
| 118 | * @s: substring to be scanned |
| 119 | * @result: resulting integer on success |
| 120 | * @base: base to use when converting string |
| 121 | * |
| 122 | * Description: Given a &substring_t and a base, attempts to parse the substring |
| 123 | * as a number in that base. On success, sets @result to the integer represented |
Alex Elder | 77dd3b0 | 2012-10-04 17:13:16 -0700 | [diff] [blame] | 124 | * by the string and returns 0. Returns -ENOMEM, -EINVAL, or -ERANGE on failure. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 125 | */ |
| 126 | static int match_number(substring_t *s, int *result, int base) |
| 127 | { |
| 128 | char *endp; |
| 129 | char *buf; |
| 130 | int ret; |
Alex Elder | 77dd3b0 | 2012-10-04 17:13:16 -0700 | [diff] [blame] | 131 | long val; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 132 | |
Eric Biggers | 36c8d1e | 2018-10-30 15:05:30 -0700 | [diff] [blame] | 133 | buf = match_strdup(s); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 134 | if (!buf) |
| 135 | return -ENOMEM; |
Alex Elder | 77dd3b0 | 2012-10-04 17:13:16 -0700 | [diff] [blame] | 136 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 137 | ret = 0; |
Alex Elder | 77dd3b0 | 2012-10-04 17:13:16 -0700 | [diff] [blame] | 138 | val = simple_strtol(buf, &endp, base); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 139 | if (endp == buf) |
| 140 | ret = -EINVAL; |
Alex Elder | 77dd3b0 | 2012-10-04 17:13:16 -0700 | [diff] [blame] | 141 | else if (val < (long)INT_MIN || val > (long)INT_MAX) |
| 142 | ret = -ERANGE; |
| 143 | else |
| 144 | *result = (int) val; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 145 | kfree(buf); |
| 146 | return ret; |
| 147 | } |
| 148 | |
| 149 | /** |
James Smart | a317178 | 2016-10-21 23:51:54 +0300 | [diff] [blame] | 150 | * match_u64int: scan a number in the given base from a substring_t |
| 151 | * @s: substring to be scanned |
| 152 | * @result: resulting u64 on success |
| 153 | * @base: base to use when converting string |
| 154 | * |
| 155 | * Description: Given a &substring_t and a base, attempts to parse the substring |
| 156 | * as a number in that base. On success, sets @result to the integer represented |
| 157 | * by the string and returns 0. Returns -ENOMEM, -EINVAL, or -ERANGE on failure. |
| 158 | */ |
| 159 | static int match_u64int(substring_t *s, u64 *result, int base) |
| 160 | { |
| 161 | char *buf; |
| 162 | int ret; |
| 163 | u64 val; |
James Smart | a317178 | 2016-10-21 23:51:54 +0300 | [diff] [blame] | 164 | |
Eric Biggers | 4ed97b3 | 2018-10-30 15:05:26 -0700 | [diff] [blame] | 165 | buf = match_strdup(s); |
James Smart | a317178 | 2016-10-21 23:51:54 +0300 | [diff] [blame] | 166 | if (!buf) |
| 167 | return -ENOMEM; |
James Smart | a317178 | 2016-10-21 23:51:54 +0300 | [diff] [blame] | 168 | |
| 169 | ret = kstrtoull(buf, base, &val); |
| 170 | if (!ret) |
| 171 | *result = val; |
| 172 | kfree(buf); |
| 173 | return ret; |
| 174 | } |
| 175 | |
| 176 | /** |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 177 | * match_int: - scan a decimal representation of an integer from a substring_t |
| 178 | * @s: substring_t to be scanned |
| 179 | * @result: resulting integer on success |
| 180 | * |
| 181 | * Description: Attempts to parse the &substring_t @s as a decimal integer. On |
| 182 | * success, sets @result to the integer represented by the string and returns 0. |
Namjae Jeon | 5376962 | 2013-02-21 16:44:08 -0800 | [diff] [blame] | 183 | * Returns -ENOMEM, -EINVAL, or -ERANGE on failure. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 184 | */ |
| 185 | int match_int(substring_t *s, int *result) |
| 186 | { |
| 187 | return match_number(s, result, 0); |
| 188 | } |
Andrew Morton | a3d2cca | 2014-01-23 15:54:13 -0800 | [diff] [blame] | 189 | EXPORT_SYMBOL(match_int); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 190 | |
| 191 | /** |
James Smart | a317178 | 2016-10-21 23:51:54 +0300 | [diff] [blame] | 192 | * match_u64: - scan a decimal representation of a u64 from |
| 193 | * a substring_t |
| 194 | * @s: substring_t to be scanned |
| 195 | * @result: resulting unsigned long long on success |
| 196 | * |
| 197 | * Description: Attempts to parse the &substring_t @s as a long decimal |
| 198 | * integer. On success, sets @result to the integer represented by the |
| 199 | * string and returns 0. |
| 200 | * Returns -ENOMEM, -EINVAL, or -ERANGE on failure. |
| 201 | */ |
| 202 | int match_u64(substring_t *s, u64 *result) |
| 203 | { |
| 204 | return match_u64int(s, result, 0); |
| 205 | } |
| 206 | EXPORT_SYMBOL(match_u64); |
| 207 | |
| 208 | /** |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 209 | * match_octal: - scan an octal representation of an integer from a substring_t |
| 210 | * @s: substring_t to be scanned |
| 211 | * @result: resulting integer on success |
| 212 | * |
| 213 | * Description: Attempts to parse the &substring_t @s as an octal integer. On |
| 214 | * success, sets @result to the integer represented by the string and returns |
Namjae Jeon | 5376962 | 2013-02-21 16:44:08 -0800 | [diff] [blame] | 215 | * 0. Returns -ENOMEM, -EINVAL, or -ERANGE on failure. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 216 | */ |
| 217 | int match_octal(substring_t *s, int *result) |
| 218 | { |
| 219 | return match_number(s, result, 8); |
| 220 | } |
Andrew Morton | a3d2cca | 2014-01-23 15:54:13 -0800 | [diff] [blame] | 221 | EXPORT_SYMBOL(match_octal); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 222 | |
| 223 | /** |
| 224 | * match_hex: - scan a hex representation of an integer from a substring_t |
| 225 | * @s: substring_t to be scanned |
| 226 | * @result: resulting integer on success |
| 227 | * |
| 228 | * Description: Attempts to parse the &substring_t @s as a hexadecimal integer. |
| 229 | * On success, sets @result to the integer represented by the string and |
Namjae Jeon | 5376962 | 2013-02-21 16:44:08 -0800 | [diff] [blame] | 230 | * returns 0. Returns -ENOMEM, -EINVAL, or -ERANGE on failure. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 231 | */ |
| 232 | int match_hex(substring_t *s, int *result) |
| 233 | { |
| 234 | return match_number(s, result, 16); |
| 235 | } |
Andrew Morton | a3d2cca | 2014-01-23 15:54:13 -0800 | [diff] [blame] | 236 | EXPORT_SYMBOL(match_hex); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 237 | |
| 238 | /** |
Du, Changbin | aace050 | 2014-01-23 15:54:12 -0800 | [diff] [blame] | 239 | * match_wildcard: - parse if a string matches given wildcard pattern |
| 240 | * @pattern: wildcard pattern |
| 241 | * @str: the string to be parsed |
| 242 | * |
| 243 | * Description: Parse the string @str to check if matches wildcard |
| 244 | * pattern @pattern. The pattern may contain two type wildcardes: |
| 245 | * '*' - matches zero or more characters |
| 246 | * '?' - matches one character |
| 247 | * If it's matched, return true, else return false. |
| 248 | */ |
| 249 | bool match_wildcard(const char *pattern, const char *str) |
| 250 | { |
| 251 | const char *s = str; |
| 252 | const char *p = pattern; |
| 253 | bool star = false; |
| 254 | |
| 255 | while (*s) { |
| 256 | switch (*p) { |
| 257 | case '?': |
| 258 | s++; |
| 259 | p++; |
| 260 | break; |
| 261 | case '*': |
| 262 | star = true; |
| 263 | str = s; |
| 264 | if (!*++p) |
| 265 | return true; |
| 266 | pattern = p; |
| 267 | break; |
| 268 | default: |
| 269 | if (*s == *p) { |
| 270 | s++; |
| 271 | p++; |
| 272 | } else { |
| 273 | if (!star) |
| 274 | return false; |
| 275 | str++; |
| 276 | s = str; |
| 277 | p = pattern; |
| 278 | } |
| 279 | break; |
| 280 | } |
| 281 | } |
| 282 | |
| 283 | if (*p == '*') |
| 284 | ++p; |
| 285 | return !*p; |
| 286 | } |
Andrew Morton | a3d2cca | 2014-01-23 15:54:13 -0800 | [diff] [blame] | 287 | EXPORT_SYMBOL(match_wildcard); |
Du, Changbin | aace050 | 2014-01-23 15:54:12 -0800 | [diff] [blame] | 288 | |
| 289 | /** |
Markus Armbruster | b32a09d | 2008-02-26 09:57:11 -0600 | [diff] [blame] | 290 | * match_strlcpy: - Copy the characters from a substring_t to a sized buffer |
| 291 | * @dest: where to copy to |
| 292 | * @src: &substring_t to copy |
| 293 | * @size: size of destination buffer |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 294 | * |
Markus Armbruster | b32a09d | 2008-02-26 09:57:11 -0600 | [diff] [blame] | 295 | * Description: Copy the characters in &substring_t @src to the |
| 296 | * c-style string @dest. Copy no more than @size - 1 characters, plus |
| 297 | * the terminating NUL. Return length of @src. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 298 | */ |
Markus Armbruster | b32a09d | 2008-02-26 09:57:11 -0600 | [diff] [blame] | 299 | size_t match_strlcpy(char *dest, const substring_t *src, size_t size) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 300 | { |
Markus Armbruster | b32a09d | 2008-02-26 09:57:11 -0600 | [diff] [blame] | 301 | size_t ret = src->to - src->from; |
| 302 | |
| 303 | if (size) { |
| 304 | size_t len = ret >= size ? size - 1 : ret; |
| 305 | memcpy(dest, src->from, len); |
| 306 | dest[len] = '\0'; |
| 307 | } |
| 308 | return ret; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 309 | } |
Andrew Morton | a3d2cca | 2014-01-23 15:54:13 -0800 | [diff] [blame] | 310 | EXPORT_SYMBOL(match_strlcpy); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 311 | |
| 312 | /** |
| 313 | * match_strdup: - allocate a new string with the contents of a substring_t |
| 314 | * @s: &substring_t to copy |
| 315 | * |
| 316 | * Description: Allocates and returns a string filled with the contents of |
| 317 | * the &substring_t @s. The caller is responsible for freeing the returned |
| 318 | * string with kfree(). |
| 319 | */ |
David Howells | ef4533f | 2007-05-03 03:10:39 -0700 | [diff] [blame] | 320 | char *match_strdup(const substring_t *s) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 321 | { |
Eric Biggers | 30f7bc9 | 2018-10-30 15:05:22 -0700 | [diff] [blame] | 322 | return kmemdup_nul(s->from, s->to - s->from, GFP_KERNEL); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 323 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 324 | EXPORT_SYMBOL(match_strdup); |