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 <libcfs/libcfs.h>
45 /* non-0 = don't match */
46 int cfs_strncasecmp(const char *s1, const char *s2, size_t n)
48 if (s1 == NULL || s2 == NULL)
54 while (n-- != 0 && tolower(*s1) == tolower(*s2)) {
55 if (n == 0 || *s1 == '\0' || *s2 == '\0')
61 return tolower(*(unsigned char *)s1) - tolower(*(unsigned char *)s2);
63 EXPORT_SYMBOL(cfs_strncasecmp);
65 /* Convert a text string to a bitmask */
66 int cfs_str2mask(const char *str, const char *(*bit2str)(int bit),
67 int *oldmask, int minmask, int allmask)
71 int newmask = minmask, i, len, found = 0;
74 /* <str> must be a list of tokens separated by whitespace
75 * and optionally an operator ('+' or '-'). If an operator
76 * appears first in <str>, '*oldmask' is used as the starting point
77 * (relative), otherwise minmask is used (absolute). An operator
78 * applies to all following tokens up to the next operator. */
84 if (*str == '+' || *str == '-') {
87 /* only if first token is relative */
91 if (*str == 0) /* trailing op */
95 /* find token length */
96 for (len = 0; str[len] != 0 && !isspace(str[len]) &&
97 str[len] != '+' && str[len] != '-'; len++);
101 for (i = 0; i < 32; i++) {
102 debugstr = bit2str(i);
103 if (debugstr != NULL &&
104 strlen(debugstr) == len &&
105 cfs_strncasecmp(str, debugstr, len) == 0) {
107 newmask &= ~(1 << i);
114 if (!found && len == 3 &&
115 (cfs_strncasecmp(str, "ALL", len) == 0)) {
123 CWARN("unknown mask '%.*s'.\n"
124 "mask usage: [+|-]<all|type> ...\n", len, str);
133 EXPORT_SYMBOL(cfs_str2mask);
135 /* Duplicate a string in a platform-independent way */
136 char *cfs_strdup(const char *str, u_int32_t flags)
138 size_t lenz; /* length of str + zero byte */
141 lenz = strlen(str) + 1;
143 dup_str = kmalloc(lenz, flags);
147 memcpy(dup_str, str, lenz);
151 EXPORT_SYMBOL(cfs_strdup);
154 * cfs_{v}snprintf() return the actual size that is printed rather than
155 * the size that would be printed in standard functions.
158 int cfs_vsnprintf(char *buf, size_t size, const char *fmt, va_list args)
163 i = vsnprintf(buf, size, fmt, args);
165 return (i >= size ? size - 1 : i);
167 EXPORT_SYMBOL(cfs_vsnprintf);
170 int cfs_snprintf(char *buf, size_t size, const char *fmt, ...)
176 i = cfs_vsnprintf(buf, size, fmt, args);
181 EXPORT_SYMBOL(cfs_snprintf);
183 /* get the first string out of @str */
184 char *cfs_firststr(char *str, size_t size)
189 /* trim leading spaces */
190 while (i < size && *str && isspace(*str)) {
195 /* string with all spaces */
200 while (i < size && *end != '\0' && !isspace(*end)) {
209 EXPORT_SYMBOL(cfs_firststr);
212 cfs_trimwhite(char *str)
216 while (cfs_iswhite(*str))
219 end = str + strlen(str);
221 if (!cfs_iswhite(end[-1]))
229 EXPORT_SYMBOL(cfs_trimwhite);
232 * Extracts tokens from strings.
234 * Looks for \a delim in string \a next, sets \a res to point to
235 * substring before the delimiter, sets \a next right after the found
238 * \retval 1 if \a res points to a string of non-whitespace characters
239 * \retval 0 otherwise
242 cfs_gettok(struct cfs_lstr *next, char delim, struct cfs_lstr *res)
246 if (next->ls_str == NULL)
249 /* skip leading white spaces */
250 while (next->ls_len) {
251 if (!cfs_iswhite(*next->ls_str))
257 if (next->ls_len == 0) /* whitespaces only */
260 if (*next->ls_str == delim) {
261 /* first non-writespace is the delimiter */
265 res->ls_str = next->ls_str;
266 end = memchr(next->ls_str, delim, next->ls_len);
268 /* there is no the delimeter in the string */
269 end = next->ls_str + next->ls_len;
272 next->ls_str = end + 1;
273 next->ls_len -= (end - res->ls_str + 1);
276 /* skip ending whitespaces */
277 while (--end != res->ls_str) {
278 if (!cfs_iswhite(*end))
282 res->ls_len = end - res->ls_str + 1;
285 EXPORT_SYMBOL(cfs_gettok);
288 * Converts string to integer.
290 * Accepts decimal and hexadecimal number recordings.
292 * \retval 1 if first \a nob chars of \a str convert to decimal or
293 * hexadecimal integer in the range [\a min, \a max]
294 * \retval 0 otherwise
297 cfs_str2num_check(char *str, int nob, unsigned *num,
298 unsigned min, unsigned max)
302 str = cfs_trimwhite(str);
303 *num = strtoul(str, &endp, 0);
307 for (; endp < str + nob; endp++) {
308 if (!cfs_iswhite(*endp))
312 return (*num >= min && *num <= max);
314 EXPORT_SYMBOL(cfs_str2num_check);
317 * Parses \<range_expr\> token of the syntax. If \a bracketed is false,
318 * \a src should only have a single token which can be \<number\> or \*
320 * \retval pointer to allocated range_expr and initialized
321 * range_expr::re_lo, range_expr::re_hi and range_expr:re_stride if \a
324 * \<number\> '-' \<number\> |
325 * \<number\> '-' \<number\> '/' \<number\>
326 * \retval 0 will be returned if it can be parsed, otherwise -EINVAL or
327 * -ENOMEM will be returned.
330 cfs_range_expr_parse(struct cfs_lstr *src, unsigned min, unsigned max,
331 int bracketed, struct cfs_range_expr **expr)
333 struct cfs_range_expr *re;
336 LIBCFS_ALLOC(re, sizeof(*re));
340 if (src->ls_len == 1 && src->ls_str[0] == '*') {
347 if (cfs_str2num_check(src->ls_str, src->ls_len,
348 &re->re_lo, min, max)) {
349 /* <number> is parsed */
350 re->re_hi = re->re_lo;
355 if (!bracketed || !cfs_gettok(src, '-', &tok))
358 if (!cfs_str2num_check(tok.ls_str, tok.ls_len,
359 &re->re_lo, min, max))
363 if (cfs_str2num_check(src->ls_str, src->ls_len,
364 &re->re_hi, min, max)) {
365 /* <number> - <number> is parsed */
370 /* go to check <number> '-' <number> '/' <number> */
371 if (cfs_gettok(src, '/', &tok)) {
372 if (!cfs_str2num_check(tok.ls_str, tok.ls_len,
373 &re->re_hi, min, max))
376 /* <number> - <number> / ... */
377 if (cfs_str2num_check(src->ls_str, src->ls_len,
378 &re->re_stride, min, max)) {
379 /* <number> - <number> / <number> is parsed */
389 LIBCFS_FREE(re, sizeof(*re));
392 EXPORT_SYMBOL(cfs_range_expr_parse);
395 * Print the range expression \a re into specified \a buffer.
396 * If \a bracketed is true, expression does not need additional
399 * \retval number of characters written
402 cfs_range_expr_print(char *buffer, int count, struct cfs_range_expr *expr,
412 if (expr->re_lo == expr->re_hi)
413 i = cfs_snprintf(buffer, count, "%u", expr->re_lo);
414 else if (expr->re_stride == 1)
415 i = cfs_snprintf(buffer, count, "%s%u-%u%s",
416 s, expr->re_lo, expr->re_hi, e);
418 i = cfs_snprintf(buffer, count, "%s%u-%u/%u%s",
419 s, expr->re_lo, expr->re_hi,
425 * Print a list of range expressions (\a expr_list) into specified \a buffer.
426 * If the list contains several expressions, separate them with comma
427 * and surround the list with brackets.
429 * \retval number of characters written
432 cfs_expr_list_print(char *buffer, int count, struct cfs_expr_list *expr_list)
434 struct cfs_range_expr *expr;
441 cfs_list_for_each_entry(expr, &expr_list->el_exprs, re_link)
445 i += cfs_snprintf(buffer + i, count - i, "[");
447 cfs_list_for_each_entry(expr, &expr_list->el_exprs, re_link) {
449 i += cfs_snprintf(buffer + i, count - i, ",");
450 i += cfs_range_expr_print(buffer + i, count - i, expr,
455 i += cfs_snprintf(buffer + i, count - i, "]");
459 EXPORT_SYMBOL(cfs_expr_list_print);
462 * Matches value (\a value) against ranges expression list \a expr_list.
464 * \retval 1 if \a value matches
465 * \retval 0 otherwise
468 cfs_expr_list_match(__u32 value, struct cfs_expr_list *expr_list)
470 struct cfs_range_expr *expr;
472 cfs_list_for_each_entry(expr, &expr_list->el_exprs, re_link) {
473 if (value >= expr->re_lo && value <= expr->re_hi &&
474 ((value - expr->re_lo) % expr->re_stride) == 0)
480 EXPORT_SYMBOL(cfs_expr_list_match);
483 * Convert express list (\a expr_list) to an array of all matched values
485 * \retval N N is total number of all matched values
486 * \retval 0 if expression list is empty
487 * \retval < 0 for failure
490 cfs_expr_list_values(struct cfs_expr_list *expr_list, int max, __u32 **valpp)
492 struct cfs_range_expr *expr;
497 cfs_list_for_each_entry(expr, &expr_list->el_exprs, re_link) {
498 for (i = expr->re_lo; i <= expr->re_hi; i++) {
499 if (((i - expr->re_lo) % expr->re_stride) == 0)
504 if (count == 0) /* empty expression list */
508 CERROR("Number of values %d exceeds max allowed %d\n",
513 LIBCFS_ALLOC(val, sizeof(val[0]) * count);
518 cfs_list_for_each_entry(expr, &expr_list->el_exprs, re_link) {
519 for (i = expr->re_lo; i <= expr->re_hi; i++) {
520 if (((i - expr->re_lo) % expr->re_stride) == 0)
528 EXPORT_SYMBOL(cfs_expr_list_values);
531 * Frees cfs_range_expr structures of \a expr_list.
536 cfs_expr_list_free(struct cfs_expr_list *expr_list)
538 while (!cfs_list_empty(&expr_list->el_exprs)) {
539 struct cfs_range_expr *expr;
541 expr = cfs_list_entry(expr_list->el_exprs.next,
542 struct cfs_range_expr, re_link),
543 cfs_list_del(&expr->re_link);
544 LIBCFS_FREE(expr, sizeof(*expr));
547 LIBCFS_FREE(expr_list, sizeof(*expr_list));
549 EXPORT_SYMBOL(cfs_expr_list_free);
552 * Parses \<cfs_expr_list\> token of the syntax.
554 * \retval 0 if \a str parses to \<number\> | \<expr_list\>
555 * \retval -errno otherwise
558 cfs_expr_list_parse(char *str, int len, unsigned min, unsigned max,
559 struct cfs_expr_list **elpp)
561 struct cfs_expr_list *expr_list;
562 struct cfs_range_expr *expr;
566 LIBCFS_ALLOC(expr_list, sizeof(*expr_list));
567 if (expr_list == NULL)
573 CFS_INIT_LIST_HEAD(&expr_list->el_exprs);
575 if (src.ls_str[0] == '[' &&
576 src.ls_str[src.ls_len - 1] == ']') {
581 while (src.ls_str != NULL) {
584 if (!cfs_gettok(&src, ',', &tok)) {
589 rc = cfs_range_expr_parse(&tok, min, max, 1, &expr);
593 cfs_list_add_tail(&expr->re_link,
594 &expr_list->el_exprs);
597 rc = cfs_range_expr_parse(&src, min, max, 0, &expr);
599 cfs_list_add_tail(&expr->re_link,
600 &expr_list->el_exprs);
605 cfs_expr_list_free(expr_list);
611 EXPORT_SYMBOL(cfs_expr_list_parse);
614 * Frees cfs_expr_list structures of \a list.
616 * For each struct cfs_expr_list structure found on \a list it frees
617 * range_expr list attached to it and frees the cfs_expr_list itself.
622 cfs_expr_list_free_list(cfs_list_t *list)
624 struct cfs_expr_list *el;
626 while (!cfs_list_empty(list)) {
627 el = cfs_list_entry(list->next,
628 struct cfs_expr_list, el_link);
629 cfs_list_del(&el->el_link);
630 cfs_expr_list_free(el);
633 EXPORT_SYMBOL(cfs_expr_list_free_list);
636 cfs_ip_addr_parse(char *str, int len, cfs_list_t *list)
638 struct cfs_expr_list *el;
647 while (src.ls_str != NULL) {
650 if (!cfs_gettok(&src, '.', &res)) {
655 rc = cfs_expr_list_parse(res.ls_str, res.ls_len, 0, 255, &el);
659 cfs_list_add_tail(&el->el_link, list);
668 cfs_expr_list_free_list(list);
672 EXPORT_SYMBOL(cfs_ip_addr_parse);
675 * Matches address (\a addr) against address set encoded in \a list.
677 * \retval 1 if \a addr matches
678 * \retval 0 otherwise
681 cfs_ip_addr_match(__u32 addr, cfs_list_t *list)
683 struct cfs_expr_list *el;
686 cfs_list_for_each_entry_reverse(el, list, el_link) {
687 if (!cfs_expr_list_match(addr & 0xff, el))
695 EXPORT_SYMBOL(cfs_ip_addr_match);
698 cfs_ip_addr_free(cfs_list_t *list)
700 cfs_expr_list_free_list(list);
702 EXPORT_SYMBOL(cfs_ip_addr_free);