mirror of
https://github.com/git/git.git
synced 2024-09-28 20:51:42 +02:00
d7c208a92e
Based on the mozilla SHA1 routine, but doing the input data accesses a word at a time and with 'htonl()' instead of loading bytes and shifting. It requires an architecture that is ok with unaligned 32-bit loads and a fast htonl(). Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org> Signed-off-by: Junio C Hamano <gitster@pobox.com>
22 lines
624 B
C
22 lines
624 B
C
/*
|
|
* Based on the Mozilla SHA1 (see mozilla-sha1/sha1.h),
|
|
* optimized to do word accesses rather than byte accesses,
|
|
* and to avoid unnecessary copies into the context array.
|
|
*/
|
|
|
|
typedef struct {
|
|
unsigned int H[5];
|
|
unsigned int W[16];
|
|
int lenW;
|
|
unsigned long long size;
|
|
} blk_SHA_CTX;
|
|
|
|
void blk_SHA1_Init(blk_SHA_CTX *ctx);
|
|
void blk_SHA1_Update(blk_SHA_CTX *ctx, const void *dataIn, unsigned long len);
|
|
void blk_SHA1_Final(unsigned char hashout[20], blk_SHA_CTX *ctx);
|
|
|
|
#define git_SHA_CTX blk_SHA_CTX
|
|
#define git_SHA1_Init blk_SHA1_Init
|
|
#define git_SHA1_Update blk_SHA1_Update
|
|
#define git_SHA1_Final blk_SHA1_Final
|