crypto: Assume blocksize is a power of 2
commiteba29771c006d6a689e946fa57334a2ce370c45c
authorRichard Henderson <richard.henderson@linaro.org>
Fri, 28 Aug 2020 17:05:08 +0000 (28 10:05 -0700)
committerDaniel P. Berrangé <berrange@redhat.com>
Thu, 10 Sep 2020 10:02:23 +0000 (10 11:02 +0100)
treeb2a2a6559e18f89dabbea68cc124875956b7a37d
parentca04c3cf15961e4a01c729a24b00bf804f59ac23
crypto: Assume blocksize is a power of 2

The check in the encode/decode path using full division has a
noticeable amount of overhead.  By asserting the blocksize is
a power of 2, we can reduce this check to a mask.

Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
Signed-off-by: Daniel P. Berrangé <berrange@redhat.com>
crypto/cipher-builtin.c
crypto/cipher-gcrypt.c
crypto/cipher-nettle.c
crypto/cipher.c