mirror of
https://github.com/UberGuidoZ/Flipper.git
synced 2024-12-24 07:20:13 +00:00
85 lines
3.0 KiB
C
85 lines
3.0 KiB
C
|
/* Declarations of functions and data types used for SHA1 sum
|
||
|
|
library functions.
|
||
|
|
Copyright (C) 2000-2001, 2003, 2005-2006, 2008-2022 Free Software
|
||
|
|
Foundation, Inc.
|
||
|
|
|
||
|
|
This file is free software: you can redistribute it and/or modify
|
||
|
|
it under the terms of the GNU Lesser General Public License as
|
||
|
|
published by the Free Software Foundation; either version 2.1 of the
|
||
|
|
License, or (at your option) any later version.
|
||
|
|
|
||
|
|
This file is distributed in the hope that it will be useful,
|
||
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
|
|
GNU Lesser General Public License for more details.
|
||
|
|
|
||
|
|
You should have received a copy of the GNU Lesser General Public License
|
||
|
|
along with this program. If not, see <https://www.gnu.org/licenses/>. */
|
||
|
|
|
||
|
|
#pragma once
|
||
|
|
|
||
|
|
#include <stdio.h>
|
||
|
|
#include <stdint.h>
|
||
|
|
|
||
|
|
#ifdef __cplusplus
|
||
|
|
extern "C" {
|
||
|
|
#endif
|
||
|
|
|
||
|
|
#define SHA1_DIGEST_SIZE 20
|
||
|
|
|
||
|
|
/* Structure to save state of computation between the single steps. */
|
||
|
|
struct sha1_ctx {
|
||
|
|
uint32_t A;
|
||
|
|
uint32_t B;
|
||
|
|
uint32_t C;
|
||
|
|
uint32_t D;
|
||
|
|
uint32_t E;
|
||
|
|
|
||
|
|
uint32_t total[2];
|
||
|
|
uint32_t buflen; /* ≥ 0, ≤ 128 */
|
||
|
|
uint32_t buffer[32]; /* 128 bytes; the first buflen bytes are in use */
|
||
|
|
};
|
||
|
|
|
||
|
|
/* Initialize structure containing state of computation. */
|
||
|
|
extern void sha1_init_ctx(struct sha1_ctx* ctx);
|
||
|
|
|
||
|
|
/* Starting with the result of former calls of this function (or the
|
||
|
|
initialization function update the context for the next LEN bytes
|
||
|
|
starting at BUFFER.
|
||
|
|
It is necessary that LEN is a multiple of 64!!! */
|
||
|
|
extern void sha1_process_block(const void* buffer, size_t len, struct sha1_ctx* ctx);
|
||
|
|
|
||
|
|
/* Starting with the result of former calls of this function (or the
|
||
|
|
initialization function update the context for the next LEN bytes
|
||
|
|
starting at BUFFER.
|
||
|
|
It is NOT required that LEN is a multiple of 64. */
|
||
|
|
extern void sha1_process_bytes(const void* buffer, size_t len, struct sha1_ctx* ctx);
|
||
|
|
|
||
|
|
/* Process the remaining bytes in the buffer and put result from CTX
|
||
|
|
in first 20 bytes following RESBUF. The result is always in little
|
||
|
|
endian byte order, so that a byte-wise output yields to the wanted
|
||
|
|
ASCII representation of the message digest. */
|
||
|
|
extern void* sha1_finish_ctx(struct sha1_ctx* ctx, void* restrict resbuf);
|
||
|
|
|
||
|
|
/* Put result from CTX in first 20 bytes following RESBUF. The result is
|
||
|
|
always in little endian byte order, so that a byte-wise output yields
|
||
|
|
to the wanted ASCII representation of the message digest. */
|
||
|
|
extern void* sha1_read_ctx(const struct sha1_ctx* ctx, void* restrict resbuf);
|
||
|
|
|
||
|
|
/* Compute SHA1 message digest for LEN bytes beginning at BUFFER. The
|
||
|
|
result is always in little endian byte order, so that a byte-wise
|
||
|
|
output yields to the wanted ASCII representation of the message
|
||
|
|
digest. */
|
||
|
|
extern void* sha1_buffer(const char* buffer, size_t len, void* restrict resblock);
|
||
|
|
|
||
|
|
#ifdef __cplusplus
|
||
|
|
}
|
||
|
|
#endif
|
||
|
|
|
||
|
|
/*
|
||
|
|
* Hey Emacs!
|
||
|
|
* Local Variables:
|
||
|
|
* coding: utf-8
|
||
|
|
* End:
|
||
|
|
*/
|