From nobody Tue Feb 10 00:03:07 2026 Received: from mail-pj1-f74.google.com (mail-pj1-f74.google.com [209.85.216.74]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by smtp.subspace.kernel.org (Postfix) with ESMTPS id 975F323BF8F for ; Wed, 21 May 2025 22:54:14 +0000 (UTC) Authentication-Results: smtp.subspace.kernel.org; arc=none smtp.client-ip=209.85.216.74 ARC-Seal: i=1; a=rsa-sha256; d=subspace.kernel.org; s=arc-20240116; t=1747868057; cv=none; b=FslHjRS+SL3BavEkBIy0tCcrfKsPJuexSJnKUhg4HP/4e/m64yBSm3EDThFTcAOE7Yt2YM0uYp3A/jWcbshYAZqAtFOKz6Gv+9OEG8iK49vjOI1pt6RT2ZsSEJPia7TCfkhpJI043AXUYFUwxWGEoZkwE7haYOWSFs+BmTHydII= ARC-Message-Signature: i=1; a=rsa-sha256; d=subspace.kernel.org; s=arc-20240116; t=1747868057; c=relaxed/simple; bh=d2rJA7G+jwUoRMjm3TQ8lzd6ZwA1L33yy/0oEX1JfxE=; h=Date:In-Reply-To:Mime-Version:References:Message-ID:Subject:From: To:Content-Type; b=rpXVqFaJI0SMKTHtmyYe30BlVCN/I0MHkKRak3WEB1zix9lphPod26lF/WpyGF+Ts0ukpsh/9I6yfAeQYBuE1bRxsGs2mSyiZQYU/MsBNqdB7x1FvM7bWew2vCarcaUUJpiGS/3AZLEirVoB8mKQ23bknx1OmXCZA3egexSpv3E= ARC-Authentication-Results: i=1; smtp.subspace.kernel.org; dmarc=pass (p=reject dis=none) header.from=google.com; spf=pass smtp.mailfrom=flex--yuzhuo.bounces.google.com; dkim=pass (2048-bit key) header.d=google.com header.i=@google.com header.b=c6saEHfE; arc=none smtp.client-ip=209.85.216.74 Authentication-Results: smtp.subspace.kernel.org; dmarc=pass (p=reject dis=none) header.from=google.com Authentication-Results: smtp.subspace.kernel.org; spf=pass smtp.mailfrom=flex--yuzhuo.bounces.google.com Authentication-Results: smtp.subspace.kernel.org; dkim=pass (2048-bit key) header.d=google.com header.i=@google.com header.b="c6saEHfE" Received: by mail-pj1-f74.google.com with SMTP id 98e67ed59e1d1-30e9659a391so4569597a91.0 for ; Wed, 21 May 2025 15:54:14 -0700 (PDT) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=google.com; s=20230601; t=1747868054; x=1748472854; darn=vger.kernel.org; h=to:from:subject:message-id:references:mime-version:in-reply-to:date :from:to:cc:subject:date:message-id:reply-to; bh=//ERDOnJgsKO7BhUhvUMeqTIqu4t02IBQ8dRbwwSono=; b=c6saEHfETcGUCj7QBMP6CIyOnkw/TRduq2VOdU+OvoxiGFfM7txzGOdDM4Ke1pfzrJ lMrfF1wmrtXgpqB3bcES4xzuUj7PbMW95jfT/6IP7s3neg8Xz1vcpOXYVx7ZnOmaWN2D jFp1MmLs+hCnM9CBqKsJnrbP65x3IdiZuwpy2/z2JyB+rOf+f8qkpy+HgysQ9xet4t6w 4aX2b+nsnLDsCZxG0Bm0oxx9n0oFNGvNHNQ0RSAinwl4GzwhGsAL7RxgRDnVgZCPXcQI 2YZQmMidsgX/REuZyoVlv6E7UiWze/57xbgi4CM/jSWj7F1bcEGIcm2KX/UW5Q3HUHuT 9CVQ== X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20230601; t=1747868054; x=1748472854; h=to:from:subject:message-id:references:mime-version:in-reply-to:date :x-gm-message-state:from:to:cc:subject:date:message-id:reply-to; bh=//ERDOnJgsKO7BhUhvUMeqTIqu4t02IBQ8dRbwwSono=; b=ZMRlwUGhoNgrEXz26vO0bm6Yn1helg0yC9iKsRlf12nuVrDsVVD2MLZ2T4H2rLHM+b KaxuzXkgdufvj7Dk5Kj+gulsAg2vhfbniZv7P0ymRyP3qjxtzNH8ZtE2R7WtjkEjO1h/ pPhVyzjTseK8nqhIx69Kj2KjVGGkWGllc0SHHForZ2uNy3+XRq6ZDx6tyAbzplgANG6V +BGUBiO4YqKHZap+2qiwtReCDJodyBPjv55mFN8FFGPgZ7ftd3BHEkj6sJWN3QZMAYkE E288mjIA2uNIdKw6kRRTF2FqBIIITHEQGNXqNqkwItI5O+9JI+wYhYMQfXVxo9uEUSJp t5lA== X-Forwarded-Encrypted: i=1; AJvYcCW6QaQWCqvfyfkA0Qztke2PqJ1gg9e4yb+aRDBTHt8X9f14l8hvhpS2+fMt+ss2zPx9VomnKD2BCS6WwtQ=@vger.kernel.org X-Gm-Message-State: AOJu0Yz69A52H8pfC7zNuTFiS/glmkTmdoz+MBTHFyjbmZoizwKbKmH4 YtvCcnHNFs6fHPvZHUNs4on4fC2sM0ab8mv2rYKVyS3cKNEtRDc0uUvjwTQvNZzp0gXYd1oDWCg VElpgcA== X-Google-Smtp-Source: AGHT+IHkKbwEjL2MD72gwxTrxDKE8LBZSKj9LKUcEYr9R6Vukr4nHcCEGBKYkRqfgFqDJbthREUj1MrZ6EA= X-Received: from pjb7.prod.google.com ([2002:a17:90b:2f07:b0:2fe:800f:23a]) (user=yuzhuo job=prod-delivery.src-stubby-dispatcher) by 2002:a17:90b:4f4c:b0:301:a0e9:66f with SMTP id 98e67ed59e1d1-30e830ebf11mr36896809a91.14.1747868053829; Wed, 21 May 2025 15:54:13 -0700 (PDT) Date: Wed, 21 May 2025 15:53:05 -0700 In-Reply-To: <20250521225307.743726-1-yuzhuo@google.com> Precedence: bulk X-Mailing-List: linux-kernel@vger.kernel.org List-Id: List-Subscribe: List-Unsubscribe: Mime-Version: 1.0 References: <20250521225307.743726-1-yuzhuo@google.com> X-Mailer: git-send-email 2.49.0.1164.gab81da1b16-goog Message-ID: <20250521225307.743726-3-yuzhuo@google.com> Subject: [PATCH v1 2/4] perf tools: Add sha1 utils From: Yuzhuo Jing To: Peter Zijlstra , Ingo Molnar , Arnaldo Carvalho de Melo , Namhyung Kim , Mark Rutland , Alexander Shishkin , Jiri Olsa , Ian Rogers , Adrian Hunter , Liang Kan , Nathan Chancellor , Nick Desaulniers , Bill Wendling , Justin Stitt , "Steven Rostedt (Google)" , James Clark , Tomas Glozar , Leo Yan , Guilherme Amadio , Yuzhuo Jing , Yang Jihong , "Masami Hiramatsu (Google)" , Adhemerval Zanella , Wei Yang , Ard Biesheuvel , "Mike Rapoport (Microsoft)" , Athira Rajeev , Kajol Jain , Aditya Gupta , Charlie Jenkins , "Steinar H. Gunderson" , "Dr. David Alan Gilbert" , Herbert Xu , Jeff Johnson , Al Viro , linux-kernel@vger.kernel.org, linux-perf-users@vger.kernel.org, llvm@lists.linux.dev Content-Transfer-Encoding: quoted-printable Content-Type: text/plain; charset="utf-8" Those new files are derived from the kernel tree, namely: tools/perf/util/sha1.c from lib/crypto/sha1.c tools/perf/util/sha1.h from include/crypto/sha1.h tools/perf/util/sha1_base.h from include/crypto/sha1_base.h tools/perf/util/sha1_generic.c from crypto/sha1_generic.c The reason that we are not syncing them with the kernel tree like other tools header files is because of the deep dependency in include/crypto/hash.h. It's painful to import the whole kernel crypto driver infrastructure into tools. The derived files get rid of struct shash_desc definition, and directly operates on the struct sha1_state. Signed-off-by: Yuzhuo Jing --- tools/perf/util/Build | 2 + tools/perf/util/sha1.c | 122 +++++++++++++++++++++++++++++++++ tools/perf/util/sha1.h | 41 +++++++++++ tools/perf/util/sha1_base.h | 103 ++++++++++++++++++++++++++++ tools/perf/util/sha1_generic.c | 49 +++++++++++++ 5 files changed, 317 insertions(+) create mode 100644 tools/perf/util/sha1.c create mode 100644 tools/perf/util/sha1.h create mode 100644 tools/perf/util/sha1_base.h create mode 100644 tools/perf/util/sha1_generic.c diff --git a/tools/perf/util/Build b/tools/perf/util/Build index 7910d908c814..ecee96b3f3fa 100644 --- a/tools/perf/util/Build +++ b/tools/perf/util/Build @@ -41,6 +41,8 @@ perf-util-y +=3D rbtree.o perf-util-y +=3D libstring.o perf-util-y +=3D bitmap.o perf-util-y +=3D hweight.o +perf-util-y +=3D sha1.o +perf-util-y +=3D sha1_generic.o perf-util-y +=3D smt.o perf-util-y +=3D strbuf.o perf-util-y +=3D string.o diff --git a/tools/perf/util/sha1.c b/tools/perf/util/sha1.c new file mode 100644 index 000000000000..5ae658afb56b --- /dev/null +++ b/tools/perf/util/sha1.c @@ -0,0 +1,122 @@ +// SPDX-License-Identifier: GPL-2.0 +/* + * SHA1 routine optimized to do word accesses rather than byte accesses, + * and to avoid unnecessary copies into the context array. + * + * This was based on the git SHA1 implementation. + */ + +#include +#include +#include +#include + +#include "sha1.h" + +/* + * If you have 32 registers or more, the compiler can (and should) + * try to change the array[] accesses into registers. However, on + * machines with less than ~25 registers, that won't really work, + * and at least gcc will make an unholy mess of it. + * + * So to avoid that mess which just slows things down, we force + * the stores to memory to actually happen (we might be better off + * with a 'W(t)=3D(val);asm("":"+m" (W(t))' there instead, as + * suggested by Artur Skawina - that will also make gcc unable to + * try to do the silly "optimize away loads" part because it won't + * see what the value will be). + * + * Ben Herrenschmidt reports that on PPC, the C version comes close + * to the optimized asm with this (ie on PPC you don't want that + * 'volatile', since there are lots of registers). + * + * On ARM we get the best code generation by forcing a full memory barrier + * between each SHA_ROUND, otherwise gcc happily get wild with spilling and + * the stack frame size simply explode and performance goes down the drain. + */ + +#ifdef CONFIG_X86 + #define setW(x, val) (*(volatile __u32 *)&W(x) =3D (val)) +#elif defined(CONFIG_ARM) + #define setW(x, val) do { W(x) =3D (val); __asm__("":::"memory"); } whil= e (0) +#else + #define setW(x, val) (W(x) =3D (val)) +#endif + +/* This "rolls" over the 512-bit array */ +#define W(x) (array[(x)&15]) + +/* + * Where do we get the source from? The first 16 iterations get it from + * the input data, the next mix it from the 512-bit array. + */ +#define SHA_SRC(t) get_unaligned_be32((__u32 *)data + t) +#define SHA_MIX(t) rol32(W(t+13) ^ W(t+8) ^ W(t+2) ^ W(t), 1) + +#define SHA_ROUND(t, input, fn, constant, A, B, C, D, E) do { \ + __u32 TEMP =3D input(t); setW(t, TEMP); \ + E +=3D TEMP + rol32(A,5) + (fn) + (constant); \ + B =3D ror32(B, 2); \ + TEMP =3D E; E =3D D; D =3D C; C =3D B; B =3D A; A =3D TEMP; } while (0) + +#define T_0_15(t, A, B, C, D, E) SHA_ROUND(t, SHA_SRC, (((C^D)&B)^D) , 0x= 5a827999, A, B, C, D, E ) +#define T_16_19(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (((C^D)&B)^D) , 0x= 5a827999, A, B, C, D, E ) +#define T_20_39(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (B^C^D) , 0x6ed9eb= a1, A, B, C, D, E ) +#define T_40_59(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, ((B&C)+(D&(B^C))) = , 0x8f1bbcdc, A, B, C, D, E ) +#define T_60_79(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (B^C^D) , 0xca62c= 1d6, A, B, C, D, E ) + +/** + * sha1_transform - single block SHA1 transform (deprecated) + * + * @digest: 160 bit digest to update + * @data: 512 bits of data to hash + * @array: 16 words of workspace (see note) + * + * This function executes SHA-1's internal compression function. It updat= es the + * 160-bit internal state (@digest) with a single 512-bit data block (@dat= a). + * + * Don't use this function. SHA-1 is no longer considered secure. And ev= en if + * you do have to use SHA-1, this isn't the correct way to hash something = with + * SHA-1 as this doesn't handle padding and finalization. + * + * Note: If the hash is security sensitive, the caller should be sure + * to clear the workspace. This is left to the caller to avoid + * unnecessary clears between chained hashing operations. + */ +void sha1_transform(__u32 *digest, const char *data, __u32 *array) +{ + __u32 A, B, C, D, E; + unsigned int i =3D 0; + + A =3D digest[0]; + B =3D digest[1]; + C =3D digest[2]; + D =3D digest[3]; + E =3D digest[4]; + + /* Round 1 - iterations 0-16 take their input from 'data' */ + for (; i < 16; ++i) + T_0_15(i, A, B, C, D, E); + + /* Round 1 - tail. Input from 512-bit mixing array */ + for (; i < 20; ++i) + T_16_19(i, A, B, C, D, E); + + /* Round 2 */ + for (; i < 40; ++i) + T_20_39(i, A, B, C, D, E); + + /* Round 3 */ + for (; i < 60; ++i) + T_40_59(i, A, B, C, D, E); + + /* Round 4 */ + for (; i < 80; ++i) + T_60_79(i, A, B, C, D, E); + + digest[0] +=3D A; + digest[1] +=3D B; + digest[2] +=3D C; + digest[3] +=3D D; + digest[4] +=3D E; +} diff --git a/tools/perf/util/sha1.h b/tools/perf/util/sha1.h new file mode 100644 index 000000000000..9da4ece49bc6 --- /dev/null +++ b/tools/perf/util/sha1.h @@ -0,0 +1,41 @@ +/* SPDX-License-Identifier: GPL-2.0 */ +/* + * Common values for SHA-1 algorithms + */ + +#ifndef _CRYPTO_SHA1_H +#define _CRYPTO_SHA1_H + +#include + +#define SHA1_DIGEST_SIZE 20 +#define SHA1_BLOCK_SIZE 64 + +#define SHA1_H0 0x67452301UL +#define SHA1_H1 0xefcdab89UL +#define SHA1_H2 0x98badcfeUL +#define SHA1_H3 0x10325476UL +#define SHA1_H4 0xc3d2e1f0UL + +struct sha1_state { + u32 state[SHA1_DIGEST_SIZE / 4]; + u64 count; + u8 buffer[SHA1_BLOCK_SIZE]; +}; + +extern int crypto_sha1_update(struct sha1_state *desc, const u8 *data, + unsigned int len); + +extern int crypto_sha1_finup(struct sha1_state *desc, const u8 *data, + unsigned int len, u8 *hash); + +/* + * An implementation of SHA-1's compression function. Don't use in new co= de! + * You shouldn't be using SHA-1, and even if you *have* to use SHA-1, this= isn't + * the correct way to hash something with SHA-1 (use crypto_shash instead). + */ +#define SHA1_DIGEST_WORDS (SHA1_DIGEST_SIZE / 4) +#define SHA1_WORKSPACE_WORDS 16 +void sha1_transform(__u32 *digest, const char *data, __u32 *W); + +#endif /* _CRYPTO_SHA1_H */ diff --git a/tools/perf/util/sha1_base.h b/tools/perf/util/sha1_base.h new file mode 100644 index 000000000000..cea22c5a4952 --- /dev/null +++ b/tools/perf/util/sha1_base.h @@ -0,0 +1,103 @@ +/* SPDX-License-Identifier: GPL-2.0-only */ +/* + * sha1_base.h - core logic for SHA-1 implementations + * + * Copyright (C) 2015 Linaro Ltd + */ + +#ifndef _CRYPTO_SHA1_BASE_H +#define _CRYPTO_SHA1_BASE_H + +#include + +#include +#include + +#include "sha1.h" + +typedef void (sha1_block_fn)(struct sha1_state *sst, u8 const *src, int bl= ocks); + +static inline int sha1_base_init(struct sha1_state *sctx) +{ + sctx->state[0] =3D SHA1_H0; + sctx->state[1] =3D SHA1_H1; + sctx->state[2] =3D SHA1_H2; + sctx->state[3] =3D SHA1_H3; + sctx->state[4] =3D SHA1_H4; + sctx->count =3D 0; + + return 0; +} + +static inline int sha1_base_do_update(struct sha1_state *sctx, + const u8 *data, + unsigned int len, + sha1_block_fn *block_fn) +{ + unsigned int partial =3D sctx->count % SHA1_BLOCK_SIZE; + + sctx->count +=3D len; + + if (unlikely((partial + len) >=3D SHA1_BLOCK_SIZE)) { + int blocks; + + if (partial) { + int p =3D SHA1_BLOCK_SIZE - partial; + + memcpy(sctx->buffer + partial, data, p); + data +=3D p; + len -=3D p; + + block_fn(sctx, sctx->buffer, 1); + } + + blocks =3D len / SHA1_BLOCK_SIZE; + len %=3D SHA1_BLOCK_SIZE; + + if (blocks) { + block_fn(sctx, data, blocks); + data +=3D blocks * SHA1_BLOCK_SIZE; + } + partial =3D 0; + } + if (len) + memcpy(sctx->buffer + partial, data, len); + + return 0; +} + +static inline int sha1_base_do_finalize(struct sha1_state *sctx, + sha1_block_fn *block_fn) +{ + const int bit_offset =3D SHA1_BLOCK_SIZE - sizeof(__be64); + __be64 *bits =3D (__be64 *)(sctx->buffer + bit_offset); + unsigned int partial =3D sctx->count % SHA1_BLOCK_SIZE; + + sctx->buffer[partial++] =3D 0x80; + if (partial > bit_offset) { + memset(sctx->buffer + partial, 0x0, SHA1_BLOCK_SIZE - partial); + partial =3D 0; + + block_fn(sctx, sctx->buffer, 1); + } + + memset(sctx->buffer + partial, 0x0, bit_offset - partial); + *bits =3D cpu_to_be64(sctx->count << 3); + block_fn(sctx, sctx->buffer, 1); + + return 0; +} + +static inline int sha1_base_finish(struct sha1_state *sctx, u8 *out) +{ + __be32 *digest =3D (__be32 *)out; + int i; + + for (i =3D 0; i < SHA1_DIGEST_SIZE / (int)sizeof(__be32); i++) + put_unaligned_be32(sctx->state[i], digest++); + + memzero_explicit(sctx, sizeof(*sctx)); + return 0; +} + +#endif /* _CRYPTO_SHA1_BASE_H */ diff --git a/tools/perf/util/sha1_generic.c b/tools/perf/util/sha1_generic.c new file mode 100644 index 000000000000..b0a7af370d59 --- /dev/null +++ b/tools/perf/util/sha1_generic.c @@ -0,0 +1,49 @@ +// SPDX-License-Identifier: GPL-2.0-or-later +/* + * Cryptographic API. + * + * SHA1 Secure Hash Algorithm. + * + * Derived from cryptoapi implementation, adapted for in-place + * scatterlist interface. + * + * Copyright (c) Alan Smithee. + * Copyright (c) Andrew McDonald + * Copyright (c) Jean-Francois Dive + */ +#include +#include +#include + +#include "sha1_base.h" + +static void sha1_generic_block_fn(struct sha1_state *sst, u8 const *src, + int blocks) +{ + u32 temp[SHA1_WORKSPACE_WORDS]; + + while (blocks--) { + sha1_transform(sst->state, (const char *)src, temp); + src +=3D SHA1_BLOCK_SIZE; + } + memzero_explicit(temp, sizeof(temp)); +} + +int crypto_sha1_update(struct sha1_state *desc, const u8 *data, + unsigned int len) +{ + return sha1_base_do_update(desc, data, len, sha1_generic_block_fn); +} + +static int sha1_final(struct sha1_state *desc, u8 *out) +{ + sha1_base_do_finalize(desc, sha1_generic_block_fn); + return sha1_base_finish(desc, out); +} + +int crypto_sha1_finup(struct sha1_state *desc, const u8 *data, + unsigned int len, u8 *out) +{ + sha1_base_do_update(desc, data, len, sha1_generic_block_fn); + return sha1_final(desc, out); +} --=20 2.49.0.1164.gab81da1b16-goog