4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
20 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
21 * CA 95054 USA or visit www.sun.com if you need additional information or
27 * Copyright (c) 2008, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
30 * Copyright (c) 2012, Intel Corporation.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
36 * String manipulation functions.
38 * libcfs/libcfs/libcfs_string.c
40 * Author: Nathan Rutman <nathan.rutman@sun.com>
43 #include "../../include/linux/libcfs/libcfs.h"
45 /* Convert a text string to a bitmask */
46 int cfs_str2mask(const char *str, const char *(*bit2str)(int bit),
47 int *oldmask, int minmask, int allmask)
51 int newmask = minmask, i, len, found = 0;
53 /* <str> must be a list of tokens separated by whitespace
54 * and optionally an operator ('+' or '-'). If an operator
55 * appears first in <str>, '*oldmask' is used as the starting point
56 * (relative), otherwise minmask is used (absolute). An operator
57 * applies to all following tokens up to the next operator. */
58 while (*str != '\0') {
63 if (*str == '+' || *str == '-') {
66 /* only if first token is relative */
70 if (*str == '\0') /* trailing op */
74 /* find token length */
76 while (str[len] != '\0' && !isspace(str[len]) &&
77 str[len] != '+' && str[len] != '-')
82 for (i = 0; i < 32; i++) {
83 debugstr = bit2str(i);
84 if (debugstr != NULL &&
85 strlen(debugstr) == len &&
86 strncasecmp(str, debugstr, len) == 0) {
95 if (!found && len == 3 &&
96 (strncasecmp(str, "ALL", len) == 0)) {
104 CWARN("unknown mask '%.*s'.\n"
105 "mask usage: [+|-]<all|type> ...\n", len, str);
115 /* get the first string out of @str */
116 char *cfs_firststr(char *str, size_t size)
121 /* trim leading spaces */
122 while (i < size && *str && isspace(*str)) {
127 /* string with all spaces */
132 while (i < size && *end != '\0' && !isspace(*end)) {
141 EXPORT_SYMBOL(cfs_firststr);
144 cfs_trimwhite(char *str)
148 while (isspace(*str))
151 end = str + strlen(str);
153 if (!isspace(end[-1]))
161 EXPORT_SYMBOL(cfs_trimwhite);
164 * Extracts tokens from strings.
166 * Looks for \a delim in string \a next, sets \a res to point to
167 * substring before the delimiter, sets \a next right after the found
170 * \retval 1 if \a res points to a string of non-whitespace characters
171 * \retval 0 otherwise
174 cfs_gettok(struct cfs_lstr *next, char delim, struct cfs_lstr *res)
178 if (next->ls_str == NULL)
181 /* skip leading white spaces */
182 while (next->ls_len) {
183 if (!isspace(*next->ls_str))
189 if (next->ls_len == 0) /* whitespaces only */
192 if (*next->ls_str == delim) {
193 /* first non-writespace is the delimiter */
197 res->ls_str = next->ls_str;
198 end = memchr(next->ls_str, delim, next->ls_len);
200 /* there is no the delimeter in the string */
201 end = next->ls_str + next->ls_len;
204 next->ls_str = end + 1;
205 next->ls_len -= (end - res->ls_str + 1);
208 /* skip ending whitespaces */
209 while (--end != res->ls_str) {
214 res->ls_len = end - res->ls_str + 1;
219 * Converts string to integer.
221 * Accepts decimal and hexadecimal number recordings.
223 * \retval 1 if first \a nob chars of \a str convert to decimal or
224 * hexadecimal integer in the range [\a min, \a max]
225 * \retval 0 otherwise
228 cfs_str2num_check(char *str, int nob, unsigned *num,
229 unsigned min, unsigned max)
233 str = cfs_trimwhite(str);
234 *num = strtoul(str, &endp, 0);
238 for (; endp < str + nob; endp++) {
243 return (*num >= min && *num <= max);
247 * Parses \<range_expr\> token of the syntax. If \a bracketed is false,
248 * \a src should only have a single token which can be \<number\> or \*
250 * \retval pointer to allocated range_expr and initialized
251 * range_expr::re_lo, range_expr::re_hi and range_expr:re_stride if \a
254 * \<number\> '-' \<number\> |
255 * \<number\> '-' \<number\> '/' \<number\>
256 * \retval 0 will be returned if it can be parsed, otherwise -EINVAL or
257 * -ENOMEM will be returned.
260 cfs_range_expr_parse(struct cfs_lstr *src, unsigned min, unsigned max,
261 int bracketed, struct cfs_range_expr **expr)
263 struct cfs_range_expr *re;
266 LIBCFS_ALLOC(re, sizeof(*re));
270 if (src->ls_len == 1 && src->ls_str[0] == '*') {
277 if (cfs_str2num_check(src->ls_str, src->ls_len,
278 &re->re_lo, min, max)) {
279 /* <number> is parsed */
280 re->re_hi = re->re_lo;
285 if (!bracketed || !cfs_gettok(src, '-', &tok))
288 if (!cfs_str2num_check(tok.ls_str, tok.ls_len,
289 &re->re_lo, min, max))
293 if (cfs_str2num_check(src->ls_str, src->ls_len,
294 &re->re_hi, min, max)) {
295 /* <number> - <number> is parsed */
300 /* go to check <number> '-' <number> '/' <number> */
301 if (cfs_gettok(src, '/', &tok)) {
302 if (!cfs_str2num_check(tok.ls_str, tok.ls_len,
303 &re->re_hi, min, max))
306 /* <number> - <number> / ... */
307 if (cfs_str2num_check(src->ls_str, src->ls_len,
308 &re->re_stride, min, max)) {
309 /* <number> - <number> / <number> is parsed */
319 LIBCFS_FREE(re, sizeof(*re));
324 * Matches value (\a value) against ranges expression list \a expr_list.
326 * \retval 1 if \a value matches
327 * \retval 0 otherwise
330 cfs_expr_list_match(__u32 value, struct cfs_expr_list *expr_list)
332 struct cfs_range_expr *expr;
334 list_for_each_entry(expr, &expr_list->el_exprs, re_link) {
335 if (value >= expr->re_lo && value <= expr->re_hi &&
336 ((value - expr->re_lo) % expr->re_stride) == 0)
344 * Convert express list (\a expr_list) to an array of all matched values
346 * \retval N N is total number of all matched values
347 * \retval 0 if expression list is empty
348 * \retval < 0 for failure
351 cfs_expr_list_values(struct cfs_expr_list *expr_list, int max, __u32 **valpp)
353 struct cfs_range_expr *expr;
358 list_for_each_entry(expr, &expr_list->el_exprs, re_link) {
359 for (i = expr->re_lo; i <= expr->re_hi; i++) {
360 if (((i - expr->re_lo) % expr->re_stride) == 0)
365 if (count == 0) /* empty expression list */
369 CERROR("Number of values %d exceeds max allowed %d\n",
374 LIBCFS_ALLOC(val, sizeof(val[0]) * count);
379 list_for_each_entry(expr, &expr_list->el_exprs, re_link) {
380 for (i = expr->re_lo; i <= expr->re_hi; i++) {
381 if (((i - expr->re_lo) % expr->re_stride) == 0)
389 EXPORT_SYMBOL(cfs_expr_list_values);
392 * Frees cfs_range_expr structures of \a expr_list.
397 cfs_expr_list_free(struct cfs_expr_list *expr_list)
399 while (!list_empty(&expr_list->el_exprs)) {
400 struct cfs_range_expr *expr;
402 expr = list_entry(expr_list->el_exprs.next,
403 struct cfs_range_expr, re_link),
404 list_del(&expr->re_link);
405 LIBCFS_FREE(expr, sizeof(*expr));
408 LIBCFS_FREE(expr_list, sizeof(*expr_list));
410 EXPORT_SYMBOL(cfs_expr_list_free);
413 * Parses \<cfs_expr_list\> token of the syntax.
415 * \retval 1 if \a str parses to \<number\> | \<expr_list\>
416 * \retval 0 otherwise
419 cfs_expr_list_parse(char *str, int len, unsigned min, unsigned max,
420 struct cfs_expr_list **elpp)
422 struct cfs_expr_list *expr_list;
423 struct cfs_range_expr *expr;
427 LIBCFS_ALLOC(expr_list, sizeof(*expr_list));
428 if (expr_list == NULL)
434 INIT_LIST_HEAD(&expr_list->el_exprs);
436 if (src.ls_str[0] == '[' &&
437 src.ls_str[src.ls_len - 1] == ']') {
442 while (src.ls_str != NULL) {
445 if (!cfs_gettok(&src, ',', &tok)) {
450 rc = cfs_range_expr_parse(&tok, min, max, 1, &expr);
454 list_add_tail(&expr->re_link,
455 &expr_list->el_exprs);
458 rc = cfs_range_expr_parse(&src, min, max, 0, &expr);
460 list_add_tail(&expr->re_link,
461 &expr_list->el_exprs);
466 cfs_expr_list_free(expr_list);
472 EXPORT_SYMBOL(cfs_expr_list_parse);
475 * Frees cfs_expr_list structures of \a list.
477 * For each struct cfs_expr_list structure found on \a list it frees
478 * range_expr list attached to it and frees the cfs_expr_list itself.
483 cfs_expr_list_free_list(struct list_head *list)
485 struct cfs_expr_list *el;
487 while (!list_empty(list)) {
488 el = list_entry(list->next,
489 struct cfs_expr_list, el_link);
490 list_del(&el->el_link);
491 cfs_expr_list_free(el);
496 cfs_ip_addr_parse(char *str, int len, struct list_head *list)
498 struct cfs_expr_list *el;
507 while (src.ls_str != NULL) {
510 if (!cfs_gettok(&src, '.', &res)) {
515 rc = cfs_expr_list_parse(res.ls_str, res.ls_len, 0, 255, &el);
519 list_add_tail(&el->el_link, list);
528 cfs_expr_list_free_list(list);
532 EXPORT_SYMBOL(cfs_ip_addr_parse);
535 * Matches address (\a addr) against address set encoded in \a list.
537 * \retval 1 if \a addr matches
538 * \retval 0 otherwise
541 cfs_ip_addr_match(__u32 addr, struct list_head *list)
543 struct cfs_expr_list *el;
546 list_for_each_entry_reverse(el, list, el_link) {
547 if (!cfs_expr_list_match(addr & 0xff, el))
555 EXPORT_SYMBOL(cfs_ip_addr_match);
558 cfs_ip_addr_free(struct list_head *list)
560 cfs_expr_list_free_list(list);
562 EXPORT_SYMBOL(cfs_ip_addr_free);