forked from Minki/linux
7b5a080b3c
The shash interface replaces the current synchronous hash interface. It improves over hash in two ways. Firstly shash is reentrant, meaning that the same tfm may be used by two threads simultaneously as all hashing state is stored in a local descriptor. The other enhancement is that shash no longer takes scatter list entries. This is because shash is specifically designed for synchronous algorithms and as such scatter lists are unnecessary. All existing hash users will be converted to shash once the algorithms have been completely converted. There is also a new finup function that combines update with final. This will be extended to ahash once the algorithm conversion is done. This is also the first time that an algorithm type has their own registration function. Existing algorithm types will be converted to this way in due course. Signed-off-by: Herbert Xu <herbert@gondor.apana.org.au> |
||
|---|---|---|
| .. | ||
| internal | ||
| aead.h | ||
| aes.h | ||
| algapi.h | ||
| authenc.h | ||
| b128ops.h | ||
| ctr.h | ||
| des.h | ||
| gf128mul.h | ||
| hash.h | ||
| rng.h | ||
| scatterwalk.h | ||
| sha.h | ||
| skcipher.h | ||
| twofish.h | ||