1 /*
2 * GPL HEADER START
3 *
4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
5 *
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.
9 *
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).
15 *
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
19 *
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
22 * have any questions.
23 *
24 * GPL HEADER END
25 */
26 /*
27 * Copyright (c) 2008, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
29 *
30 * Copyright (c) 2012, Intel Corporation.
31 */
32 /*
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
35 *
36 * libcfs/include/libcfs/libcfs_string.h
37 *
38 * Generic string manipulation functions.
39 *
40 * Author: Nathan Rutman <nathan.rutman@sun.com>
41 */
42
43 #ifndef __LIBCFS_STRING_H__
44 #define __LIBCFS_STRING_H__
45
46 /* libcfs_string.c */
47 /* string comparison ignoring case */
48 int cfs_strncasecmp(const char *s1, const char *s2, size_t n);
49 /* Convert a text string to a bitmask */
50 int cfs_str2mask(const char *str, const char *(*bit2str)(int bit),
51 int *oldmask, int minmask, int allmask);
52 /* trim leading and trailing space characters */
53 char *cfs_firststr(char *str, size_t size);
54
55 /**
56 * Structure to represent NULL-less strings.
57 */
58 struct cfs_lstr {
59 char *ls_str;
60 int ls_len;
61 };
62
63 /*
64 * Structure to represent \<range_expr\> token of the syntax.
65 */
66 struct cfs_range_expr {
67 /*
68 * Link to cfs_expr_list::el_exprs.
69 */
70 struct list_head re_link;
71 __u32 re_lo;
72 __u32 re_hi;
73 __u32 re_stride;
74 };
75
76 struct cfs_expr_list {
77 struct list_head el_link;
78 struct list_head el_exprs;
79 };
80
81 char *cfs_trimwhite(char *str);
82 int cfs_gettok(struct cfs_lstr *next, char delim, struct cfs_lstr *res);
83 int cfs_str2num_check(char *str, int nob, unsigned *num,
84 unsigned min, unsigned max);
85 int cfs_expr_list_match(__u32 value, struct cfs_expr_list *expr_list);
86 int cfs_expr_list_values(struct cfs_expr_list *expr_list,
87 int max, __u32 **values);
88 static inline void
cfs_expr_list_values_free(__u32 * values,int num)89 cfs_expr_list_values_free(__u32 *values, int num)
90 {
91 /* This array is allocated by LIBCFS_ALLOC(), so it shouldn't be freed
92 * by OBD_FREE() if it's called by module other than libcfs & LNet,
93 * otherwise we will see fake memory leak */
94 LIBCFS_FREE(values, num * sizeof(values[0]));
95 }
96
97 void cfs_expr_list_free(struct cfs_expr_list *expr_list);
98 int cfs_expr_list_parse(char *str, int len, unsigned min, unsigned max,
99 struct cfs_expr_list **elpp);
100 void cfs_expr_list_free_list(struct list_head *list);
101 int cfs_ip_addr_parse(char *str, int len, struct list_head *list);
102 int cfs_ip_addr_match(__u32 addr, struct list_head *list);
103 void cfs_ip_addr_free(struct list_head *list);
104
105 #define strtoul(str, endp, base) simple_strtoul(str, endp, base)
106
107 #endif
108