**Next message:**Greg Kroah-Hartman: "Re: [PATCH 5.15 000/779] 5.15.61-rc1 review"**Previous message:**Roberto Sassu: "RE: [PATCH v11 0/9] bpf: Add kfuncs for PKCS#7 signature verification"**Messages sorted by:**[ date ] [ thread ] [ subject ] [ author ]

Delete the redundant word 'that'.

Signed-off-by: Jilin Yuan <yuanjilin@xxxxxxxxxx>

---

crypto/api.c | 2 +-

crypto/twofish_common.c | 2 +-

2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/crypto/api.c b/crypto/api.c

index 69508ae9345e..ab4b5e2b0756 100644

--- a/crypto/api.c

+++ b/crypto/api.c

@@ -321,7 +321,7 @@ struct crypto_alg *crypto_alg_mod_lookup(const char *name, u32 type, u32 mask)

/*

* If the internal flag is set for a cipher, require a caller to

- * to invoke the cipher with the internal flag to use that cipher.

+ * invoke the cipher with the internal flag to use that cipher.

* Also, if a caller wants to allocate a cipher that may or may

* not be an internal cipher, use type | CRYPTO_ALG_INTERNAL and

* !(mask & CRYPTO_ALG_INTERNAL).

diff --git a/crypto/twofish_common.c b/crypto/twofish_common.c

index d23fa531b91f..f921f30334f4 100644

--- a/crypto/twofish_common.c

+++ b/crypto/twofish_common.c

@@ -298,7 +298,7 @@ static const u32 mds[4][256] = {

* multiplication is inefficient without hardware support. To multiply

* faster, I make use of the fact x is a generator for the nonzero elements,

* so that every element p of GF(2)[x]/w(x) is either 0 or equal to (x)^n for

- * some n in 0..254. Note that that caret is exponentiation in GF(2^8),

+ * some n in 0..254. Note that caret is exponentiation in GF(2^8),

* *not* polynomial notation. So if I want to compute pq where p and q are

* in GF(2^8), I can just say:

* 1. if p=0 or q=0 then pq=0

--

2.36.1

**Next message:**Greg Kroah-Hartman: "Re: [PATCH 5.15 000/779] 5.15.61-rc1 review"**Previous message:**Roberto Sassu: "RE: [PATCH v11 0/9] bpf: Add kfuncs for PKCS#7 signature verification"**Messages sorted by:**[ date ] [ thread ] [ subject ] [ author ]