Linux Audio

Check our new training course

Loading...
v3.5.6
  1#include "util.h"
  2#include "string.h"
 
 
 
 
 
 
 
 
 
 
 
 
 
 
  3
  4#define K 1024LL
  5/*
  6 * perf_atoll()
  7 * Parse (\d+)(b|B|kb|KB|mb|MB|gb|GB|tb|TB) (e.g. "256MB")
  8 * and return its numeric value
  9 */
 10s64 perf_atoll(const char *str)
 11{
 12	unsigned int i;
 13	s64 length = -1, unit = 1;
 
 14
 15	if (!isdigit(str[0]))
 16		goto out_err;
 17
 18	for (i = 1; i < strlen(str); i++) {
 19		switch (str[i]) {
 20		case 'B':
 21		case 'b':
 22			break;
 23		case 'K':
 24			if (str[i + 1] != 'B')
 25				goto out_err;
 26			else
 27				goto kilo;
 28		case 'k':
 29			if (str[i + 1] != 'b')
 30				goto out_err;
 31kilo:
 32			unit = K;
 33			break;
 34		case 'M':
 35			if (str[i + 1] != 'B')
 36				goto out_err;
 37			else
 38				goto mega;
 39		case 'm':
 40			if (str[i + 1] != 'b')
 41				goto out_err;
 42mega:
 43			unit = K * K;
 
 
 
 
 
 
 
 44			break;
 45		case 'G':
 46			if (str[i + 1] != 'B')
 47				goto out_err;
 48			else
 49				goto giga;
 50		case 'g':
 51			if (str[i + 1] != 'b')
 52				goto out_err;
 53giga:
 54			unit = K * K * K;
 55			break;
 56		case 'T':
 57			if (str[i + 1] != 'B')
 58				goto out_err;
 59			else
 60				goto tera;
 61		case 't':
 62			if (str[i + 1] != 'b')
 63				goto out_err;
 64tera:
 65			unit = K * K * K * K;
 66			break;
 67		case '\0':	/* only specified figures */
 68			unit = 1;
 69			break;
 70		default:
 71			if (!isdigit(str[i]))
 72				goto out_err;
 73			break;
 74		}
 75	}
 76
 77	length = atoll(str) * unit;
 78	goto out;
 79
 80out_err:
 81	length = -1;
 82out:
 83	return length;
 84}
 85
 86/*
 87 * Helper function for splitting a string into an argv-like array.
 88 * originally copied from lib/argv_split.c
 89 */
 90static const char *skip_sep(const char *cp)
 91{
 92	while (*cp && isspace(*cp))
 93		cp++;
 94
 95	return cp;
 96}
 97
 98static const char *skip_arg(const char *cp)
 99{
100	while (*cp && !isspace(*cp))
101		cp++;
102
103	return cp;
104}
105
106static int count_argc(const char *str)
107{
108	int count = 0;
109
110	while (*str) {
111		str = skip_sep(str);
112		if (*str) {
113			count++;
114			str = skip_arg(str);
115		}
116	}
117
118	return count;
119}
120
121/**
122 * argv_free - free an argv
123 * @argv - the argument vector to be freed
124 *
125 * Frees an argv and the strings it points to.
126 */
127void argv_free(char **argv)
128{
129	char **p;
130	for (p = argv; *p; p++)
131		free(*p);
132
133	free(argv);
134}
135
136/**
137 * argv_split - split a string at whitespace, returning an argv
138 * @str: the string to be split
139 * @argcp: returned argument count
140 *
141 * Returns an array of pointers to strings which are split out from
142 * @str.  This is performed by strictly splitting on white-space; no
143 * quote processing is performed.  Multiple whitespace characters are
144 * considered to be a single argument separator.  The returned array
145 * is always NULL-terminated.  Returns NULL on memory allocation
146 * failure.
147 */
148char **argv_split(const char *str, int *argcp)
149{
150	int argc = count_argc(str);
151	char **argv = zalloc(sizeof(*argv) * (argc+1));
152	char **argvp;
153
154	if (argv == NULL)
155		goto out;
156
157	if (argcp)
158		*argcp = argc;
159
160	argvp = argv;
161
162	while (*str) {
163		str = skip_sep(str);
164
165		if (*str) {
166			const char *p = str;
167			char *t;
168
169			str = skip_arg(str);
170
171			t = strndup(p, str-p);
172			if (t == NULL)
173				goto fail;
174			*argvp++ = t;
175		}
176	}
177	*argvp = NULL;
178
179out:
180	return argv;
181
182fail:
183	argv_free(argv);
184	return NULL;
185}
186
187/* Character class matching */
188static bool __match_charclass(const char *pat, char c, const char **npat)
189{
190	bool complement = false, ret = true;
191
192	if (*pat == '!') {
193		complement = true;
194		pat++;
195	}
196	if (*pat++ == c)	/* First character is special */
197		goto end;
198
199	while (*pat && *pat != ']') {	/* Matching */
200		if (*pat == '-' && *(pat + 1) != ']') {	/* Range */
201			if (*(pat - 1) <= c && c <= *(pat + 1))
202				goto end;
203			if (*(pat - 1) > *(pat + 1))
204				goto error;
205			pat += 2;
206		} else if (*pat++ == c)
207			goto end;
208	}
209	if (!*pat)
210		goto error;
211	ret = false;
212
213end:
214	while (*pat && *pat != ']')	/* Searching closing */
215		pat++;
216	if (!*pat)
217		goto error;
218	*npat = pat + 1;
219	return complement ? !ret : ret;
220
221error:
222	return false;
223}
224
225/* Glob/lazy pattern matching */
226static bool __match_glob(const char *str, const char *pat, bool ignore_space)
 
227{
228	while (*str && *pat && *pat != '*') {
229		if (ignore_space) {
230			/* Ignore spaces for lazy matching */
231			if (isspace(*str)) {
232				str++;
233				continue;
234			}
235			if (isspace(*pat)) {
236				pat++;
237				continue;
238			}
239		}
240		if (*pat == '?') {	/* Matches any single character */
241			str++;
242			pat++;
243			continue;
244		} else if (*pat == '[')	/* Character classes/Ranges */
245			if (__match_charclass(pat + 1, *str, &pat)) {
246				str++;
247				continue;
248			} else
249				return false;
250		else if (*pat == '\\') /* Escaped char match as normal char */
251			pat++;
252		if (*str++ != *pat++)
 
 
 
253			return false;
 
 
254	}
255	/* Check wild card */
256	if (*pat == '*') {
257		while (*pat == '*')
258			pat++;
259		if (!*pat)	/* Tail wild card matches all */
260			return true;
261		while (*str)
262			if (__match_glob(str++, pat, ignore_space))
263				return true;
264	}
265	return !*str && !*pat;
266}
267
268/**
269 * strglobmatch - glob expression pattern matching
270 * @str: the target string to match
271 * @pat: the pattern string to match
272 *
273 * This returns true if the @str matches @pat. @pat can includes wildcards
274 * ('*','?') and character classes ([CHARS], complementation and ranges are
275 * also supported). Also, this supports escape character ('\') to use special
276 * characters as normal character.
277 *
278 * Note: if @pat syntax is broken, this always returns false.
279 */
280bool strglobmatch(const char *str, const char *pat)
281{
282	return __match_glob(str, pat, false);
 
 
 
 
 
283}
284
285/**
286 * strlazymatch - matching pattern strings lazily with glob pattern
287 * @str: the target string to match
288 * @pat: the pattern string to match
289 *
290 * This is similar to strglobmatch, except this ignores spaces in
291 * the target string.
292 */
293bool strlazymatch(const char *str, const char *pat)
294{
295	return __match_glob(str, pat, true);
296}
297
298/**
299 * strtailcmp - Compare the tail of two strings
300 * @s1: 1st string to be compared
301 * @s2: 2nd string to be compared
302 *
303 * Return 0 if whole of either string is same as another's tail part.
304 */
305int strtailcmp(const char *s1, const char *s2)
306{
307	int i1 = strlen(s1);
308	int i2 = strlen(s2);
309	while (--i1 >= 0 && --i2 >= 0) {
310		if (s1[i1] != s2[i2])
311			return s1[i1] - s2[i2];
312	}
313	return 0;
314}
315
v5.9
  1// SPDX-License-Identifier: GPL-2.0
  2#include "string2.h"
  3#include <linux/kernel.h>
  4#include <linux/string.h>
  5#include <stdlib.h>
  6
  7#include <linux/ctype.h>
  8
  9const char *graph_dotted_line =
 10	"---------------------------------------------------------------------"
 11	"---------------------------------------------------------------------"
 12	"---------------------------------------------------------------------";
 13const char *dots =
 14	"....................................................................."
 15	"....................................................................."
 16	".....................................................................";
 17
 18#define K 1024LL
 19/*
 20 * perf_atoll()
 21 * Parse (\d+)(b|B|kb|KB|mb|MB|gb|GB|tb|TB) (e.g. "256MB")
 22 * and return its numeric value
 23 */
 24s64 perf_atoll(const char *str)
 25{
 26	s64 length;
 27	char *p;
 28	char c;
 29
 30	if (!isdigit(str[0]))
 31		goto out_err;
 32
 33	length = strtoll(str, &p, 10);
 34	switch (c = *p++) {
 35		case 'b': case 'B':
 36			if (*p)
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 37				goto out_err;
 38
 39			__fallthrough;
 40		case '\0':
 41			return length;
 42		default:
 43			goto out_err;
 44		/* two-letter suffices */
 45		case 'k': case 'K':
 46			length <<= 10;
 47			break;
 48		case 'm': case 'M':
 49			length <<= 20;
 
 
 
 
 
 
 
 
 50			break;
 51		case 'g': case 'G':
 52			length <<= 30;
 
 
 
 
 
 
 
 
 53			break;
 54		case 't': case 'T':
 55			length <<= 40;
 56			break;
 
 
 
 
 
 57	}
 58	/* we want the cases to match */
 59	if (islower(c)) {
 60		if (strcmp(p, "b") != 0)
 61			goto out_err;
 62	} else {
 63		if (strcmp(p, "B") != 0)
 64			goto out_err;
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 65	}
 66	return length;
 
 
 
 67
 68out_err:
 69	return -1;
 
 70}
 71
 72/* Character class matching */
 73static bool __match_charclass(const char *pat, char c, const char **npat)
 74{
 75	bool complement = false, ret = true;
 76
 77	if (*pat == '!') {
 78		complement = true;
 79		pat++;
 80	}
 81	if (*pat++ == c)	/* First character is special */
 82		goto end;
 83
 84	while (*pat && *pat != ']') {	/* Matching */
 85		if (*pat == '-' && *(pat + 1) != ']') {	/* Range */
 86			if (*(pat - 1) <= c && c <= *(pat + 1))
 87				goto end;
 88			if (*(pat - 1) > *(pat + 1))
 89				goto error;
 90			pat += 2;
 91		} else if (*pat++ == c)
 92			goto end;
 93	}
 94	if (!*pat)
 95		goto error;
 96	ret = false;
 97
 98end:
 99	while (*pat && *pat != ']')	/* Searching closing */
100		pat++;
101	if (!*pat)
102		goto error;
103	*npat = pat + 1;
104	return complement ? !ret : ret;
105
106error:
107	return false;
108}
109
110/* Glob/lazy pattern matching */
111static bool __match_glob(const char *str, const char *pat, bool ignore_space,
112			bool case_ins)
113{
114	while (*str && *pat && *pat != '*') {
115		if (ignore_space) {
116			/* Ignore spaces for lazy matching */
117			if (isspace(*str)) {
118				str++;
119				continue;
120			}
121			if (isspace(*pat)) {
122				pat++;
123				continue;
124			}
125		}
126		if (*pat == '?') {	/* Matches any single character */
127			str++;
128			pat++;
129			continue;
130		} else if (*pat == '[')	/* Character classes/Ranges */
131			if (__match_charclass(pat + 1, *str, &pat)) {
132				str++;
133				continue;
134			} else
135				return false;
136		else if (*pat == '\\') /* Escaped char match as normal char */
137			pat++;
138		if (case_ins) {
139			if (tolower(*str) != tolower(*pat))
140				return false;
141		} else if (*str != *pat)
142			return false;
143		str++;
144		pat++;
145	}
146	/* Check wild card */
147	if (*pat == '*') {
148		while (*pat == '*')
149			pat++;
150		if (!*pat)	/* Tail wild card matches all */
151			return true;
152		while (*str)
153			if (__match_glob(str++, pat, ignore_space, case_ins))
154				return true;
155	}
156	return !*str && !*pat;
157}
158
159/**
160 * strglobmatch - glob expression pattern matching
161 * @str: the target string to match
162 * @pat: the pattern string to match
163 *
164 * This returns true if the @str matches @pat. @pat can includes wildcards
165 * ('*','?') and character classes ([CHARS], complementation and ranges are
166 * also supported). Also, this supports escape character ('\') to use special
167 * characters as normal character.
168 *
169 * Note: if @pat syntax is broken, this always returns false.
170 */
171bool strglobmatch(const char *str, const char *pat)
172{
173	return __match_glob(str, pat, false, false);
174}
175
176bool strglobmatch_nocase(const char *str, const char *pat)
177{
178	return __match_glob(str, pat, false, true);
179}
180
181/**
182 * strlazymatch - matching pattern strings lazily with glob pattern
183 * @str: the target string to match
184 * @pat: the pattern string to match
185 *
186 * This is similar to strglobmatch, except this ignores spaces in
187 * the target string.
188 */
189bool strlazymatch(const char *str, const char *pat)
190{
191	return __match_glob(str, pat, true, false);
192}
193
194/**
195 * strtailcmp - Compare the tail of two strings
196 * @s1: 1st string to be compared
197 * @s2: 2nd string to be compared
198 *
199 * Return 0 if whole of either string is same as another's tail part.
200 */
201int strtailcmp(const char *s1, const char *s2)
202{
203	int i1 = strlen(s1);
204	int i2 = strlen(s2);
205	while (--i1 >= 0 && --i2 >= 0) {
206		if (s1[i1] != s2[i2])
207			return s1[i1] - s2[i2];
208	}
209	return 0;
210}
211
212char *asprintf_expr_inout_ints(const char *var, bool in, size_t nints, int *ints)
213{
214	/*
215	 * FIXME: replace this with an expression using log10() when we
216	 * find a suitable implementation, maybe the one in the dvb drivers...
217	 *
218	 * "%s == %d || " = log10(MAXINT) * 2 + 8 chars for the operators
219	 */
220	size_t size = nints * 28 + 1; /* \0 */
221	size_t i, printed = 0;
222	char *expr = malloc(size);
223
224	if (expr) {
225		const char *or_and = "||", *eq_neq = "==";
226		char *e = expr;
227
228		if (!in) {
229			or_and = "&&";
230			eq_neq = "!=";
231		}
232
233		for (i = 0; i < nints; ++i) {
234			if (printed == size)
235				goto out_err_overflow;
236
237			if (i > 0)
238				printed += scnprintf(e + printed, size - printed, " %s ", or_and);
239			printed += scnprintf(e + printed, size - printed,
240					     "%s %s %d", var, eq_neq, ints[i]);
241		}
242	}
243
244	return expr;
245
246out_err_overflow:
247	free(expr);
248	return NULL;
249}
250
251/* Like strpbrk(), but not break if it is right after a backslash (escaped) */
252char *strpbrk_esc(char *str, const char *stopset)
253{
254	char *ptr;
255
256	do {
257		ptr = strpbrk(str, stopset);
258		if (ptr == str ||
259		    (ptr == str + 1 && *(ptr - 1) != '\\'))
260			break;
261		str = ptr + 1;
262	} while (ptr && *(ptr - 1) == '\\' && *(ptr - 2) != '\\');
263
264	return ptr;
265}
266
267/* Like strdup, but do not copy a single backslash */
268char *strdup_esc(const char *str)
269{
270	char *s, *d, *p, *ret = strdup(str);
271
272	if (!ret)
273		return NULL;
274
275	d = strchr(ret, '\\');
276	if (!d)
277		return ret;
278
279	s = d + 1;
280	do {
281		if (*s == '\0') {
282			*d = '\0';
283			break;
284		}
285		p = strchr(s + 1, '\\');
286		if (p) {
287			memmove(d, s, p - s);
288			d += p - s;
289			s = p + 1;
290		} else
291			memmove(d, s, strlen(s) + 1);
292	} while (p);
293
294	return ret;
295}