aboutsummaryrefslogtreecommitdiffstats
path: root/libsha2.h
diff options
context:
space:
mode:
authorMattias Andrée <maandree@kth.se>2019-02-10 11:28:30 +0100
committerMattias Andrée <maandree@kth.se>2019-02-10 11:28:30 +0100
commitd84edd9500e6e22ba49c76dc93a7c0731755d008 (patch)
tree5238a0362e0f70ea44fa40906c86102d5a50a4eb /libsha2.h
parentFix warnings (diff)
downloadlibsha2-d84edd9500e6e22ba49c76dc93a7c0731755d008.tar.gz
libsha2-d84edd9500e6e22ba49c76dc93a7c0731755d008.tar.bz2
libsha2-d84edd9500e6e22ba49c76dc93a7c0731755d008.tar.xz
Fix libsha2_digest + minor improvements
Signed-off-by: Mattias Andrée <maandree@kth.se>
Diffstat (limited to '')
-rw-r--r--libsha2.h14
1 files changed, 0 insertions, 14 deletions
diff --git a/libsha2.h b/libsha2.h
index 801c6be..e410271 100644
--- a/libsha2.h
+++ b/libsha2.h
@@ -49,12 +49,6 @@ enum libsha2_algorithm {
* exposing two versions of each function: one to wipe data,
* and one not to wipe data to gain speed, now you can use use
* `explicit_bzero` (or `memset`) when you are done.
- *
- * This data structure is flat (it contains dynamic pointers)
- * and can be marshalled and unmarshalled naïvely, and does
- * not need destroyed; however, if you when to marshall it
- * using as little memory as possible, this are comments
- * about data that does not need to be mashalled
*/
struct libsha2_state {
/**
@@ -133,14 +127,6 @@ struct libsha2_state {
unsigned char chunk[128];
/**
- * Space for storing the last bits and
- * the padding
- *
- * Does not need to be marshalled
- */
- char appendix[256];
-
- /**
* The size of the chunks, in bytes
*/
size_t chunk_size;