1 /*-
2 * Copyright (c) 2010 Isilon Systems, Inc.
3 * Copyright (c) 2010 iX Systems, Inc.
4 * Copyright (c) 2010 Panasas, Inc.
5 * Copyright (c) 2013-2017 Mellanox Technologies, Ltd.
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice unmodified, this list of conditions, and the following
13 * disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 *
18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
19 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
20 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
21 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
22 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
23 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
27 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 *
29 * $FreeBSD$
30 */
31 #ifndef _LINUXKPI_LINUX_STRING_H_
32 #define _LINUXKPI_LINUX_STRING_H_
33
34 #include <sys/ctype.h>
35
36 #include <linux/types.h>
37 #include <linux/gfp.h>
38 #include <linux/slab.h>
39 #include <linux/uaccess.h>
40 #include <linux/err.h>
41
42 #include <sys/libkern.h>
43
44 #define strnicmp(...) strncasecmp(__VA_ARGS__)
45
46 static inline int
match_string(const char * const * table,int n,const char * key)47 match_string(const char *const *table, int n, const char *key)
48 {
49 int i;
50
51 for (i = 0; i != n && table[i] != NULL; i++) {
52 if (strcmp(table[i], key) == 0)
53 return (i);
54 }
55 return (-EINVAL);
56 }
57
58 static inline void *
memdup_user(const void * ptr,size_t len)59 memdup_user(const void *ptr, size_t len)
60 {
61 void *retval;
62 int error;
63
64 retval = malloc(len, M_KMALLOC, M_WAITOK);
65 error = linux_copyin(ptr, retval, len);
66 if (error != 0) {
67 free(retval, M_KMALLOC);
68 return (ERR_PTR(error));
69 }
70 return (retval);
71 }
72
73 static inline void *
memdup_user_nul(const void * ptr,size_t len)74 memdup_user_nul(const void *ptr, size_t len)
75 {
76 char *retval;
77 int error;
78
79 retval = malloc(len + 1, M_KMALLOC, M_WAITOK);
80 error = linux_copyin(ptr, retval, len);
81 if (error != 0) {
82 free(retval, M_KMALLOC);
83 return (ERR_PTR(error));
84 }
85 retval[len] = '\0';
86 return (retval);
87 }
88
89 static inline void *
kmemdup(const void * src,size_t len,gfp_t gfp)90 kmemdup(const void *src, size_t len, gfp_t gfp)
91 {
92 void *dst;
93
94 dst = kmalloc(len, gfp);
95 if (dst != NULL)
96 memcpy(dst, src, len);
97 return (dst);
98 }
99
100 static inline char *
kstrdup(const char * string,gfp_t gfp)101 kstrdup(const char *string, gfp_t gfp)
102 {
103 char *retval;
104 size_t len;
105
106 if (string == NULL)
107 return (NULL);
108 len = strlen(string) + 1;
109 retval = kmalloc(len, gfp);
110 if (retval != NULL)
111 memcpy(retval, string, len);
112 return (retval);
113 }
114
115 static inline char *
kstrndup(const char * string,size_t len,gfp_t gfp)116 kstrndup(const char *string, size_t len, gfp_t gfp)
117 {
118 char *retval;
119
120 if (string == NULL)
121 return (NULL);
122 retval = kmalloc(len + 1, gfp);
123 if (retval != NULL)
124 strncpy(retval, string, len);
125 return (retval);
126 }
127
128 static inline const char *
kstrdup_const(const char * src,gfp_t gfp)129 kstrdup_const(const char *src, gfp_t gfp)
130 {
131 return (kmemdup(src, strlen(src) + 1, gfp));
132 }
133
134 static inline char *
skip_spaces(const char * str)135 skip_spaces(const char *str)
136 {
137 while (isspace(*str))
138 ++str;
139 return (__DECONST(char *, str));
140 }
141
142 static inline void *
memchr_inv(const void * start,int c,size_t length)143 memchr_inv(const void *start, int c, size_t length)
144 {
145 const u8 *ptr;
146 const u8 *end;
147 u8 ch;
148
149 ch = c;
150 ptr = start;
151 end = ptr + length;
152
153 while (ptr != end) {
154 if (*ptr != ch)
155 return (__DECONST(void *, ptr));
156 ptr++;
157 }
158 return (NULL);
159 }
160
161 static inline size_t
str_has_prefix(const char * str,const char * prefix)162 str_has_prefix(const char *str, const char *prefix)
163 {
164 size_t len;
165
166 len = strlen(prefix);
167 return (strncmp(str, prefix, len) == 0 ? len : 0);
168 }
169
170 static inline char *
strreplace(char * str,char old,char new)171 strreplace(char *str, char old, char new)
172 {
173 char *p;
174
175 p = strchrnul(str, old);
176 while (p != NULL && *p != '\0') {
177 *p = new;
178 p = strchrnul(str, old);
179 }
180 return (p);
181 }
182
183 static inline ssize_t
strscpy(char * dst,const char * src,size_t len)184 strscpy(char* dst, const char* src, size_t len)
185 {
186 size_t i;
187
188 if (len <= INT_MAX) {
189 for (i = 0; i < len; i++)
190 if ('\0' == (dst[i] = src[i]))
191 return ((ssize_t)i);
192 if (i != 0)
193 dst[--i] = '\0';
194 }
195
196 return (-E2BIG);
197 }
198
199 #endif /* _LINUXKPI_LINUX_STRING_H_ */
200