Chore: fix comments
This commit is contained in:
parent
d4ef916b40
commit
e0bc58a731
3 changed files with 0 additions and 25 deletions
|
@ -8,15 +8,6 @@
|
||||||
#include <string.h>
|
#include <string.h>
|
||||||
#include <sys/types.h>
|
#include <sys/types.h>
|
||||||
|
|
||||||
#include "../io.h"
|
|
||||||
|
|
||||||
/**
|
|
||||||
* @brief This implementation optimizes small operations and uses SIMD
|
|
||||||
*
|
|
||||||
* @param _ unused
|
|
||||||
* @param filename name of the file to load
|
|
||||||
* @param out
|
|
||||||
*/
|
|
||||||
void md2_hash_1(size_t len, const uint8_t buf[len], uint8_t out[16]);
|
void md2_hash_1(size_t len, const uint8_t buf[len], uint8_t out[16]);
|
||||||
void md2_checksum_1(size_t len, uint8_t* buf);
|
void md2_checksum_1(size_t len, uint8_t* buf);
|
||||||
|
|
||||||
|
|
|
@ -10,13 +10,6 @@
|
||||||
#include <sys/types.h>
|
#include <sys/types.h>
|
||||||
#include <unistd.h>
|
#include <unistd.h>
|
||||||
|
|
||||||
/**
|
|
||||||
* @brief Diese Implementierung benutzt Threads zum Berechnen des Hashs
|
|
||||||
*
|
|
||||||
* @param len
|
|
||||||
* @param buf
|
|
||||||
* @param out
|
|
||||||
*/
|
|
||||||
void md2_hash_3(size_t len, const uint8_t buf[len], uint8_t out[16]);
|
void md2_hash_3(size_t len, const uint8_t buf[len], uint8_t out[16]);
|
||||||
|
|
||||||
#endif // MD2_3_H
|
#endif // MD2_3_H
|
|
@ -49,15 +49,6 @@ void MD2Final PROTO_LIST((unsigned char[16], MD2_CTX *));
|
||||||
#include <string.h>
|
#include <string.h>
|
||||||
#include <sys/types.h>
|
#include <sys/types.h>
|
||||||
|
|
||||||
#include "../../io.h"
|
|
||||||
|
|
||||||
/**
|
|
||||||
* @brief This implementation is the reference implementation
|
|
||||||
*
|
|
||||||
* @param _ unused
|
|
||||||
* @param filename name of the file to load
|
|
||||||
* @param out
|
|
||||||
*/
|
|
||||||
void md2_hash_ref(size_t len, const uint8_t buf[len], uint8_t out[16]);
|
void md2_hash_ref(size_t len, const uint8_t buf[len], uint8_t out[16]);
|
||||||
|
|
||||||
#endif // MD2_REF_H
|
#endif // MD2_REF_H
|
Loading…
Reference in a new issue