mirror of
https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git
synced 2024-08-21 16:29:59 +00:00
![Liam Howlett](/assets/img/avatar_default.png)
Rename the fallthrough attribute to better align with the kernel version. Copy the definition from include/linux/compiler_attributes.h including the #else clause. Adding the #else clause allows the tools compiler.h header to drop the check for a definition entirely and keeps both definitions together. Change any __fallthrough statements to fallthrough anywhere it was used within perf. This allows other tools to use the same key word as the kernel. Committer notes: Did some missing conversions to: builtin-list.c Also included gtk.h before the 'fallthrough' definition in: tools/perf/ui/gtk/hists.c tools/perf/ui/gtk/helpline.c tools/perf/ui/gtk/browser.c As it is the arg name for a macro in glib.h: /var/home/acme/git/perf-tools-next/tools/include/linux/compiler-gcc.h:16:55: error: missing binary operator before token "(" 16 | # define fallthrough __attribute__((__fallthrough__)) | ^ /usr/include/glib-2.0/glib/gmacros.h:637:28: note: in expansion of macro ‘fallthrough’ 637 | #if g_macro__has_attribute(fallthrough) Reviewed-by: Miguel Ojeda <ojeda@kernel.org> Signed-off-by: Liam Howlett <Liam.Howlett@oracle.com> Cc: Ingo Molnar <mingo@redhat.com> Cc: Mark Rutland <mark.rutland@arm.com> Cc: Miguel Ojeda <ojeda@kernel.org> Cc: Nathan Chancellor <nathan@kernel.org> Cc: Nick Desaulniers <ndesaulniers@google.com> Cc: Peter Zijlstra <peterz@infradead.org> Cc: Rasmus Villemoes <linux@rasmusvillemoes.dk> Cc: Tom Rix <trix@redhat.com> Cc: linux-sparse@vger.kernel.org <linux-sparse@vger.kernel.org> Cc: llvm@lists.linux.dev <llvm@lists.linux.dev> Link: https://lore.kernel.org/r/20221125154947.2163498-1-Liam.Howlett@oracle.com Signed-off-by: Arnaldo Carvalho de Melo <acme@redhat.com>
303 lines
6.3 KiB
C
303 lines
6.3 KiB
C
// SPDX-License-Identifier: GPL-2.0
|
|
#include "string2.h"
|
|
#include <linux/kernel.h>
|
|
#include <linux/string.h>
|
|
#include <stdlib.h>
|
|
|
|
#include <linux/ctype.h>
|
|
|
|
const char *graph_dotted_line =
|
|
"---------------------------------------------------------------------"
|
|
"---------------------------------------------------------------------"
|
|
"---------------------------------------------------------------------";
|
|
const char *dots =
|
|
"....................................................................."
|
|
"....................................................................."
|
|
".....................................................................";
|
|
|
|
/*
|
|
* perf_atoll()
|
|
* Parse (\d+)(b|B|kb|KB|mb|MB|gb|GB|tb|TB) (e.g. "256MB")
|
|
* and return its numeric value
|
|
*/
|
|
s64 perf_atoll(const char *str)
|
|
{
|
|
s64 length;
|
|
char *p;
|
|
char c;
|
|
|
|
if (!isdigit(str[0]))
|
|
goto out_err;
|
|
|
|
length = strtoll(str, &p, 10);
|
|
switch (c = *p++) {
|
|
case 'b': case 'B':
|
|
if (*p)
|
|
goto out_err;
|
|
|
|
fallthrough;
|
|
case '\0':
|
|
return length;
|
|
default:
|
|
goto out_err;
|
|
/* two-letter suffices */
|
|
case 'k': case 'K':
|
|
length <<= 10;
|
|
break;
|
|
case 'm': case 'M':
|
|
length <<= 20;
|
|
break;
|
|
case 'g': case 'G':
|
|
length <<= 30;
|
|
break;
|
|
case 't': case 'T':
|
|
length <<= 40;
|
|
break;
|
|
}
|
|
/* we want the cases to match */
|
|
if (islower(c)) {
|
|
if (strcmp(p, "b") != 0)
|
|
goto out_err;
|
|
} else {
|
|
if (strcmp(p, "B") != 0)
|
|
goto out_err;
|
|
}
|
|
return length;
|
|
|
|
out_err:
|
|
return -1;
|
|
}
|
|
|
|
/* Character class matching */
|
|
static bool __match_charclass(const char *pat, char c, const char **npat)
|
|
{
|
|
bool complement = false, ret = true;
|
|
|
|
if (*pat == '!') {
|
|
complement = true;
|
|
pat++;
|
|
}
|
|
if (*pat++ == c) /* First character is special */
|
|
goto end;
|
|
|
|
while (*pat && *pat != ']') { /* Matching */
|
|
if (*pat == '-' && *(pat + 1) != ']') { /* Range */
|
|
if (*(pat - 1) <= c && c <= *(pat + 1))
|
|
goto end;
|
|
if (*(pat - 1) > *(pat + 1))
|
|
goto error;
|
|
pat += 2;
|
|
} else if (*pat++ == c)
|
|
goto end;
|
|
}
|
|
if (!*pat)
|
|
goto error;
|
|
ret = false;
|
|
|
|
end:
|
|
while (*pat && *pat != ']') /* Searching closing */
|
|
pat++;
|
|
if (!*pat)
|
|
goto error;
|
|
*npat = pat + 1;
|
|
return complement ? !ret : ret;
|
|
|
|
error:
|
|
return false;
|
|
}
|
|
|
|
/* Glob/lazy pattern matching */
|
|
static bool __match_glob(const char *str, const char *pat, bool ignore_space,
|
|
bool case_ins)
|
|
{
|
|
while (*str && *pat && *pat != '*') {
|
|
if (ignore_space) {
|
|
/* Ignore spaces for lazy matching */
|
|
if (isspace(*str)) {
|
|
str++;
|
|
continue;
|
|
}
|
|
if (isspace(*pat)) {
|
|
pat++;
|
|
continue;
|
|
}
|
|
}
|
|
if (*pat == '?') { /* Matches any single character */
|
|
str++;
|
|
pat++;
|
|
continue;
|
|
} else if (*pat == '[') /* Character classes/Ranges */
|
|
if (__match_charclass(pat + 1, *str, &pat)) {
|
|
str++;
|
|
continue;
|
|
} else
|
|
return false;
|
|
else if (*pat == '\\') /* Escaped char match as normal char */
|
|
pat++;
|
|
if (case_ins) {
|
|
if (tolower(*str) != tolower(*pat))
|
|
return false;
|
|
} else if (*str != *pat)
|
|
return false;
|
|
str++;
|
|
pat++;
|
|
}
|
|
/* Check wild card */
|
|
if (*pat == '*') {
|
|
while (*pat == '*')
|
|
pat++;
|
|
if (!*pat) /* Tail wild card matches all */
|
|
return true;
|
|
while (*str)
|
|
if (__match_glob(str++, pat, ignore_space, case_ins))
|
|
return true;
|
|
}
|
|
return !*str && !*pat;
|
|
}
|
|
|
|
/**
|
|
* strglobmatch - glob expression pattern matching
|
|
* @str: the target string to match
|
|
* @pat: the pattern string to match
|
|
*
|
|
* This returns true if the @str matches @pat. @pat can includes wildcards
|
|
* ('*','?') and character classes ([CHARS], complementation and ranges are
|
|
* also supported). Also, this supports escape character ('\') to use special
|
|
* characters as normal character.
|
|
*
|
|
* Note: if @pat syntax is broken, this always returns false.
|
|
*/
|
|
bool strglobmatch(const char *str, const char *pat)
|
|
{
|
|
return __match_glob(str, pat, false, false);
|
|
}
|
|
|
|
bool strglobmatch_nocase(const char *str, const char *pat)
|
|
{
|
|
return __match_glob(str, pat, false, true);
|
|
}
|
|
|
|
/**
|
|
* strlazymatch - matching pattern strings lazily with glob pattern
|
|
* @str: the target string to match
|
|
* @pat: the pattern string to match
|
|
*
|
|
* This is similar to strglobmatch, except this ignores spaces in
|
|
* the target string.
|
|
*/
|
|
bool strlazymatch(const char *str, const char *pat)
|
|
{
|
|
return __match_glob(str, pat, true, false);
|
|
}
|
|
|
|
/**
|
|
* strtailcmp - Compare the tail of two strings
|
|
* @s1: 1st string to be compared
|
|
* @s2: 2nd string to be compared
|
|
*
|
|
* Return 0 if whole of either string is same as another's tail part.
|
|
*/
|
|
int strtailcmp(const char *s1, const char *s2)
|
|
{
|
|
int i1 = strlen(s1);
|
|
int i2 = strlen(s2);
|
|
while (--i1 >= 0 && --i2 >= 0) {
|
|
if (s1[i1] != s2[i2])
|
|
return s1[i1] - s2[i2];
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
char *asprintf_expr_inout_ints(const char *var, bool in, size_t nints, int *ints)
|
|
{
|
|
/*
|
|
* FIXME: replace this with an expression using log10() when we
|
|
* find a suitable implementation, maybe the one in the dvb drivers...
|
|
*
|
|
* "%s == %d || " = log10(MAXINT) * 2 + 8 chars for the operators
|
|
*/
|
|
size_t size = nints * 28 + 1; /* \0 */
|
|
size_t i, printed = 0;
|
|
char *expr = malloc(size);
|
|
|
|
if (expr) {
|
|
const char *or_and = "||", *eq_neq = "==";
|
|
char *e = expr;
|
|
|
|
if (!in) {
|
|
or_and = "&&";
|
|
eq_neq = "!=";
|
|
}
|
|
|
|
for (i = 0; i < nints; ++i) {
|
|
if (printed == size)
|
|
goto out_err_overflow;
|
|
|
|
if (i > 0)
|
|
printed += scnprintf(e + printed, size - printed, " %s ", or_and);
|
|
printed += scnprintf(e + printed, size - printed,
|
|
"%s %s %d", var, eq_neq, ints[i]);
|
|
}
|
|
}
|
|
|
|
return expr;
|
|
|
|
out_err_overflow:
|
|
free(expr);
|
|
return NULL;
|
|
}
|
|
|
|
/* Like strpbrk(), but not break if it is right after a backslash (escaped) */
|
|
char *strpbrk_esc(char *str, const char *stopset)
|
|
{
|
|
char *ptr;
|
|
|
|
do {
|
|
ptr = strpbrk(str, stopset);
|
|
if (ptr == str ||
|
|
(ptr == str + 1 && *(ptr - 1) != '\\'))
|
|
break;
|
|
str = ptr + 1;
|
|
} while (ptr && *(ptr - 1) == '\\' && *(ptr - 2) != '\\');
|
|
|
|
return ptr;
|
|
}
|
|
|
|
/* Like strdup, but do not copy a single backslash */
|
|
char *strdup_esc(const char *str)
|
|
{
|
|
char *s, *d, *p, *ret = strdup(str);
|
|
|
|
if (!ret)
|
|
return NULL;
|
|
|
|
d = strchr(ret, '\\');
|
|
if (!d)
|
|
return ret;
|
|
|
|
s = d + 1;
|
|
do {
|
|
if (*s == '\0') {
|
|
*d = '\0';
|
|
break;
|
|
}
|
|
p = strchr(s + 1, '\\');
|
|
if (p) {
|
|
memmove(d, s, p - s);
|
|
d += p - s;
|
|
s = p + 1;
|
|
} else
|
|
memmove(d, s, strlen(s) + 1);
|
|
} while (p);
|
|
|
|
return ret;
|
|
}
|
|
|
|
unsigned int hex(char c)
|
|
{
|
|
if (c >= '0' && c <= '9')
|
|
return c - '0';
|
|
if (c >= 'a' && c <= 'f')
|
|
return c - 'a' + 10;
|
|
return c - 'A' + 10;
|
|
}
|