stash: refresh the index before deciding if the work tree is dirty
[git/dscho.git] / arm / sha1.c
blob9e3ae038e818f4e21bc50f864fc5204f6fa44daa
1 /*
2 * SHA-1 implementation optimized for ARM
4 * Copyright: (C) 2005 by Nicolas Pitre <nico@cam.org>
5 * Created: September 17, 2005
6 */
8 #include <string.h>
9 #include "sha1.h"
11 extern void sha_transform(uint32_t *hash, const unsigned char *data, uint32_t *W);
13 void SHA1_Init(SHA_CTX *c)
15 c->len = 0;
16 c->hash[0] = 0x67452301;
17 c->hash[1] = 0xefcdab89;
18 c->hash[2] = 0x98badcfe;
19 c->hash[3] = 0x10325476;
20 c->hash[4] = 0xc3d2e1f0;
23 void SHA1_Update(SHA_CTX *c, const void *p, unsigned long n)
25 uint32_t workspace[80];
26 unsigned int partial;
27 unsigned long done;
29 partial = c->len & 0x3f;
30 c->len += n;
31 if ((partial + n) >= 64) {
32 if (partial) {
33 done = 64 - partial;
34 memcpy(c->buffer + partial, p, done);
35 sha_transform(c->hash, c->buffer, workspace);
36 partial = 0;
37 } else
38 done = 0;
39 while (n >= done + 64) {
40 sha_transform(c->hash, p + done, workspace);
41 done += 64;
43 } else
44 done = 0;
45 if (n - done)
46 memcpy(c->buffer + partial, p + done, n - done);
49 void SHA1_Final(unsigned char *hash, SHA_CTX *c)
51 uint64_t bitlen;
52 uint32_t bitlen_hi, bitlen_lo;
53 unsigned int i, offset, padlen;
54 unsigned char bits[8];
55 static const unsigned char padding[64] = { 0x80, };
57 bitlen = c->len << 3;
58 offset = c->len & 0x3f;
59 padlen = ((offset < 56) ? 56 : (64 + 56)) - offset;
60 SHA1_Update(c, padding, padlen);
62 bitlen_hi = bitlen >> 32;
63 bitlen_lo = bitlen & 0xffffffff;
64 bits[0] = bitlen_hi >> 24;
65 bits[1] = bitlen_hi >> 16;
66 bits[2] = bitlen_hi >> 8;
67 bits[3] = bitlen_hi;
68 bits[4] = bitlen_lo >> 24;
69 bits[5] = bitlen_lo >> 16;
70 bits[6] = bitlen_lo >> 8;
71 bits[7] = bitlen_lo;
72 SHA1_Update(c, bits, 8);
74 for (i = 0; i < 5; i++) {
75 uint32_t v = c->hash[i];
76 hash[0] = v >> 24;
77 hash[1] = v >> 16;
78 hash[2] = v >> 8;
79 hash[3] = v;
80 hash += 4;