blob: d5065ce13490862c1915c3c78fe42cb3c4070a29 [file] [log] [blame]
Gregory P. Smith2f21eb32007-09-09 06:44:34 +00001/* SHA1 module */
2
3/* This module provides an interface to the SHA1 algorithm */
4
5/* See below for information about the original code this module was
6 based upon. Additional work performed by:
7
8 Andrew Kuchling (amk@amk.ca)
9 Greg Stein (gstein@lyra.org)
10 Trevor Perrin (trevp@trevp.net)
11
12 Copyright (C) 2005-2007 Gregory P. Smith (greg@krypto.org)
13 Licensed to PSF under a Contributor Agreement.
14
15*/
16
17/* SHA1 objects */
18
19#include "Python.h"
Gregory P. Smith365a1862009-02-12 07:35:29 +000020#include "hashlib.h"
Gregory P. Smith8cb65692015-04-25 23:22:26 +000021#include "pystrhex.h"
Gregory P. Smith2f21eb32007-09-09 06:44:34 +000022
Martin v. Löwis501b13c2014-07-27 14:20:23 +020023/*[clinic input]
24module _sha1
25class SHA1Type "SHA1object *" "&PyType_Type"
26[clinic start generated code]*/
27/*[clinic end generated code: output=da39a3ee5e6b4b0d input=3dc9a20d1becb759]*/
Gregory P. Smith2f21eb32007-09-09 06:44:34 +000028
29/* Some useful types */
30
31#if SIZEOF_INT == 4
Antoine Pitrouf95a1b32010-05-09 15:52:27 +000032typedef unsigned int SHA1_INT32; /* 32-bit integer */
Benjamin Petersonaf580df2016-09-06 10:46:49 -070033typedef long long SHA1_INT64; /* 64-bit integer */
Gregory P. Smith2f21eb32007-09-09 06:44:34 +000034#else
35/* not defined. compilation will die. */
36#endif
37
38/* The SHA1 block size and message digest sizes, in bytes */
39
40#define SHA1_BLOCKSIZE 64
41#define SHA1_DIGESTSIZE 20
42
43/* The structure for storing SHA1 info */
44
45struct sha1_state {
46 SHA1_INT64 length;
47 SHA1_INT32 state[5], curlen;
48 unsigned char buf[SHA1_BLOCKSIZE];
49};
50
51typedef struct {
52 PyObject_HEAD
53
54 struct sha1_state hash_state;
55} SHA1object;
56
Serhiy Storchaka1009bf12015-04-03 23:53:51 +030057#include "clinic/sha1module.c.h"
Gregory P. Smith2f21eb32007-09-09 06:44:34 +000058
59/* ------------------------------------------------------------------------
60 *
61 * This code for the SHA1 algorithm was noted as public domain. The
62 * original headers are pasted below.
63 *
64 * Several changes have been made to make it more compatible with the
65 * Python environment and desired interface.
66 *
67 */
68
69/* LibTomCrypt, modular cryptographic library -- Tom St Denis
70 *
71 * LibTomCrypt is a library that provides various cryptographic
72 * algorithms in a highly modular and flexible manner.
73 *
74 * The library is free for all purposes without any express
75 * guarantee it works.
76 *
77 * Tom St Denis, tomstdenis@gmail.com, http://libtom.org
78 */
79
80/* rotate the hard way (platform optimizations could be done) */
81#define ROL(x, y) ( (((unsigned long)(x)<<(unsigned long)((y)&31)) | (((unsigned long)(x)&0xFFFFFFFFUL)>>(unsigned long)(32-((y)&31)))) & 0xFFFFFFFFUL)
82#define ROLc(x, y) ( (((unsigned long)(x)<<(unsigned long)((y)&31)) | (((unsigned long)(x)&0xFFFFFFFFUL)>>(unsigned long)(32-((y)&31)))) & 0xFFFFFFFFUL)
83
84/* Endian Neutral macros that work on all platforms */
85
86#define STORE32H(x, y) \
87 { (y)[0] = (unsigned char)(((x)>>24)&255); (y)[1] = (unsigned char)(((x)>>16)&255); \
88 (y)[2] = (unsigned char)(((x)>>8)&255); (y)[3] = (unsigned char)((x)&255); }
89
90#define LOAD32H(x, y) \
91 { x = ((unsigned long)((y)[0] & 255)<<24) | \
92 ((unsigned long)((y)[1] & 255)<<16) | \
93 ((unsigned long)((y)[2] & 255)<<8) | \
94 ((unsigned long)((y)[3] & 255)); }
95
96#define STORE64H(x, y) \
97 { (y)[0] = (unsigned char)(((x)>>56)&255); (y)[1] = (unsigned char)(((x)>>48)&255); \
98 (y)[2] = (unsigned char)(((x)>>40)&255); (y)[3] = (unsigned char)(((x)>>32)&255); \
99 (y)[4] = (unsigned char)(((x)>>24)&255); (y)[5] = (unsigned char)(((x)>>16)&255); \
100 (y)[6] = (unsigned char)(((x)>>8)&255); (y)[7] = (unsigned char)((x)&255); }
101
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000102
103/* SHA1 macros */
104
105#define F0(x,y,z) (z ^ (x & (y ^ z)))
106#define F1(x,y,z) (x ^ y ^ z)
107#define F2(x,y,z) ((x & y) | (z & (x | y)))
108#define F3(x,y,z) (x ^ y ^ z)
109
110static void sha1_compress(struct sha1_state *sha1, unsigned char *buf)
111{
112 SHA1_INT32 a,b,c,d,e,W[80],i;
113
114 /* copy the state into 512-bits into W[0..15] */
115 for (i = 0; i < 16; i++) {
116 LOAD32H(W[i], buf + (4*i));
117 }
118
119 /* copy state */
120 a = sha1->state[0];
121 b = sha1->state[1];
122 c = sha1->state[2];
123 d = sha1->state[3];
124 e = sha1->state[4];
125
126 /* expand it */
127 for (i = 16; i < 80; i++) {
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000128 W[i] = ROL(W[i-3] ^ W[i-8] ^ W[i-14] ^ W[i-16], 1);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000129 }
130
131 /* compress */
132 /* round one */
Brett Cannonf079c572010-07-23 15:43:14 +0000133 #define FF_0(a,b,c,d,e,i) e = (ROLc(a, 5) + F0(b,c,d) + e + W[i] + 0x5a827999UL); b = ROLc(b, 30);
134 #define FF_1(a,b,c,d,e,i) e = (ROLc(a, 5) + F1(b,c,d) + e + W[i] + 0x6ed9eba1UL); b = ROLc(b, 30);
135 #define FF_2(a,b,c,d,e,i) e = (ROLc(a, 5) + F2(b,c,d) + e + W[i] + 0x8f1bbcdcUL); b = ROLc(b, 30);
136 #define FF_3(a,b,c,d,e,i) e = (ROLc(a, 5) + F3(b,c,d) + e + W[i] + 0xca62c1d6UL); b = ROLc(b, 30);
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000137
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000138 for (i = 0; i < 20; ) {
Brett Cannonf079c572010-07-23 15:43:14 +0000139 FF_0(a,b,c,d,e,i++);
140 FF_0(e,a,b,c,d,i++);
141 FF_0(d,e,a,b,c,i++);
142 FF_0(c,d,e,a,b,i++);
143 FF_0(b,c,d,e,a,i++);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000144 }
145
146 /* round two */
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000147 for (; i < 40; ) {
Brett Cannonf079c572010-07-23 15:43:14 +0000148 FF_1(a,b,c,d,e,i++);
149 FF_1(e,a,b,c,d,i++);
150 FF_1(d,e,a,b,c,i++);
151 FF_1(c,d,e,a,b,i++);
152 FF_1(b,c,d,e,a,i++);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000153 }
154
155 /* round three */
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000156 for (; i < 60; ) {
Brett Cannonf079c572010-07-23 15:43:14 +0000157 FF_2(a,b,c,d,e,i++);
158 FF_2(e,a,b,c,d,i++);
159 FF_2(d,e,a,b,c,i++);
160 FF_2(c,d,e,a,b,i++);
161 FF_2(b,c,d,e,a,i++);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000162 }
163
164 /* round four */
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000165 for (; i < 80; ) {
Brett Cannonf079c572010-07-23 15:43:14 +0000166 FF_3(a,b,c,d,e,i++);
167 FF_3(e,a,b,c,d,i++);
168 FF_3(d,e,a,b,c,i++);
169 FF_3(c,d,e,a,b,i++);
170 FF_3(b,c,d,e,a,i++);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000171 }
172
Brett Cannonf079c572010-07-23 15:43:14 +0000173 #undef FF_0
174 #undef FF_1
175 #undef FF_2
176 #undef FF_3
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000177
178 /* store */
179 sha1->state[0] = sha1->state[0] + a;
180 sha1->state[1] = sha1->state[1] + b;
181 sha1->state[2] = sha1->state[2] + c;
182 sha1->state[3] = sha1->state[3] + d;
183 sha1->state[4] = sha1->state[4] + e;
184}
185
186/**
187 Initialize the hash state
188 @param sha1 The hash state you wish to initialize
189*/
doko@ubuntu.com1e5be8c2012-06-21 17:05:50 +0200190static void
191sha1_init(struct sha1_state *sha1)
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000192{
193 assert(sha1 != NULL);
194 sha1->state[0] = 0x67452301UL;
195 sha1->state[1] = 0xefcdab89UL;
196 sha1->state[2] = 0x98badcfeUL;
197 sha1->state[3] = 0x10325476UL;
198 sha1->state[4] = 0xc3d2e1f0UL;
199 sha1->curlen = 0;
200 sha1->length = 0;
201}
202
203/**
204 Process a block of memory though the hash
205 @param sha1 The hash state
206 @param in The data to hash
207 @param inlen The length of the data (octets)
208*/
doko@ubuntu.com1e5be8c2012-06-21 17:05:50 +0200209static void
210sha1_process(struct sha1_state *sha1,
Victor Stinner0fcab4a2011-01-04 12:59:15 +0000211 const unsigned char *in, Py_ssize_t inlen)
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000212{
Victor Stinner0fcab4a2011-01-04 12:59:15 +0000213 Py_ssize_t n;
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000214
215 assert(sha1 != NULL);
216 assert(in != NULL);
217 assert(sha1->curlen <= sizeof(sha1->buf));
218
219 while (inlen > 0) {
220 if (sha1->curlen == 0 && inlen >= SHA1_BLOCKSIZE) {
221 sha1_compress(sha1, (unsigned char *)in);
222 sha1->length += SHA1_BLOCKSIZE * 8;
223 in += SHA1_BLOCKSIZE;
224 inlen -= SHA1_BLOCKSIZE;
225 } else {
Victor Stinner640c35c2013-06-04 23:14:37 +0200226 n = Py_MIN(inlen, (Py_ssize_t)(SHA1_BLOCKSIZE - sha1->curlen));
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000227 memcpy(sha1->buf + sha1->curlen, in, (size_t)n);
Victor Stinner56cb1252012-10-31 00:33:57 +0100228 sha1->curlen += (SHA1_INT32)n;
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000229 in += n;
230 inlen -= n;
231 if (sha1->curlen == SHA1_BLOCKSIZE) {
232 sha1_compress(sha1, sha1->buf);
233 sha1->length += 8*SHA1_BLOCKSIZE;
234 sha1->curlen = 0;
235 }
236 }
237 }
238}
239
240/**
241 Terminate the hash to get the digest
242 @param sha1 The hash state
243 @param out [out] The destination of the hash (20 bytes)
244*/
doko@ubuntu.com1e5be8c2012-06-21 17:05:50 +0200245static void
246sha1_done(struct sha1_state *sha1, unsigned char *out)
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000247{
248 int i;
249
250 assert(sha1 != NULL);
251 assert(out != NULL);
252 assert(sha1->curlen < sizeof(sha1->buf));
253
254 /* increase the length of the message */
255 sha1->length += sha1->curlen * 8;
256
257 /* append the '1' bit */
258 sha1->buf[sha1->curlen++] = (unsigned char)0x80;
259
260 /* if the length is currently above 56 bytes we append zeros
261 * then compress. Then we can fall back to padding zeros and length
262 * encoding like normal.
263 */
264 if (sha1->curlen > 56) {
265 while (sha1->curlen < 64) {
266 sha1->buf[sha1->curlen++] = (unsigned char)0;
267 }
268 sha1_compress(sha1, sha1->buf);
269 sha1->curlen = 0;
270 }
271
272 /* pad upto 56 bytes of zeroes */
273 while (sha1->curlen < 56) {
274 sha1->buf[sha1->curlen++] = (unsigned char)0;
275 }
276
277 /* store length */
278 STORE64H(sha1->length, sha1->buf+56);
279 sha1_compress(sha1, sha1->buf);
280
281 /* copy output */
282 for (i = 0; i < 5; i++) {
283 STORE32H(sha1->state[i], out+(4*i));
284 }
285}
286
287
288/* .Source: /cvs/libtom/libtomcrypt/src/hashes/sha1.c,v $ */
289/* .Revision: 1.10 $ */
290/* .Date: 2007/05/12 14:25:28 $ */
291
292/*
293 * End of copied SHA1 code.
294 *
295 * ------------------------------------------------------------------------
296 */
297
298static PyTypeObject SHA1type;
299
300
301static SHA1object *
302newSHA1object(void)
303{
304 return (SHA1object *)PyObject_New(SHA1object, &SHA1type);
305}
306
307
308/* Internal methods for a hash object */
309
310static void
311SHA1_dealloc(PyObject *ptr)
312{
313 PyObject_Del(ptr);
314}
315
316
317/* External methods for a hash object */
318
Martin v. Löwis501b13c2014-07-27 14:20:23 +0200319/*[clinic input]
320SHA1Type.copy
321
322Return a copy of the hash object.
323[clinic start generated code]*/
324
Martin v. Löwis501b13c2014-07-27 14:20:23 +0200325static PyObject *
326SHA1Type_copy_impl(SHA1object *self)
Serhiy Storchaka1009bf12015-04-03 23:53:51 +0300327/*[clinic end generated code: output=b4e001264620f02a input=b7eae10df6f89b36]*/
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000328{
329 SHA1object *newobj;
330
Benjamin Peterson51ce29c2013-04-15 21:38:25 -0400331 if ((newobj = newSHA1object()) == NULL)
332 return NULL;
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000333
334 newobj->hash_state = self->hash_state;
335 return (PyObject *)newobj;
336}
337
Martin v. Löwis501b13c2014-07-27 14:20:23 +0200338/*[clinic input]
339SHA1Type.digest
340
341Return the digest value as a string of binary data.
342[clinic start generated code]*/
343
Martin v. Löwis501b13c2014-07-27 14:20:23 +0200344static PyObject *
345SHA1Type_digest_impl(SHA1object *self)
Serhiy Storchaka1009bf12015-04-03 23:53:51 +0300346/*[clinic end generated code: output=2f05302a7aa2b5cb input=205d47e1927fd009]*/
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000347{
348 unsigned char digest[SHA1_DIGESTSIZE];
349 struct sha1_state temp;
350
351 temp = self->hash_state;
352 sha1_done(&temp, digest);
Christian Heimes72b710a2008-05-26 13:28:38 +0000353 return PyBytes_FromStringAndSize((const char *)digest, SHA1_DIGESTSIZE);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000354}
355
Martin v. Löwis501b13c2014-07-27 14:20:23 +0200356/*[clinic input]
357SHA1Type.hexdigest
358
359Return the digest value as a string of hexadecimal digits.
360[clinic start generated code]*/
361
Martin v. Löwis501b13c2014-07-27 14:20:23 +0200362static PyObject *
363SHA1Type_hexdigest_impl(SHA1object *self)
Serhiy Storchaka1009bf12015-04-03 23:53:51 +0300364/*[clinic end generated code: output=4161fd71e68c6659 input=97691055c0c74ab0]*/
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000365{
366 unsigned char digest[SHA1_DIGESTSIZE];
367 struct sha1_state temp;
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000368
369 /* Get the raw (binary) digest value */
370 temp = self->hash_state;
371 sha1_done(&temp, digest);
372
Gregory P. Smith8cb65692015-04-25 23:22:26 +0000373 return _Py_strhex((const char *)digest, SHA1_DIGESTSIZE);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000374}
375
Martin v. Löwis501b13c2014-07-27 14:20:23 +0200376/*[clinic input]
377SHA1Type.update
378
379 obj: object
380 /
381
382Update this hash object's state with the provided string.
383[clinic start generated code]*/
384
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000385static PyObject *
Martin v. Löwis501b13c2014-07-27 14:20:23 +0200386SHA1Type_update(SHA1object *self, PyObject *obj)
Serhiy Storchaka1009bf12015-04-03 23:53:51 +0300387/*[clinic end generated code: output=d9902f0e5015e9ae input=aad8e07812edbba3]*/
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000388{
Martin v. Löwis7b9cb252008-08-14 15:52:23 +0000389 Py_buffer buf;
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000390
Gregory P. Smith365a1862009-02-12 07:35:29 +0000391 GET_BUFFER_VIEW_OR_ERROUT(obj, &buf);
392
Martin v. Löwis7b9cb252008-08-14 15:52:23 +0000393 sha1_process(&self->hash_state, buf.buf, buf.len);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000394
Martin v. Löwis7b9cb252008-08-14 15:52:23 +0000395 PyBuffer_Release(&buf);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000396 Py_INCREF(Py_None);
397 return Py_None;
398}
399
400static PyMethodDef SHA1_methods[] = {
Martin v. Löwis501b13c2014-07-27 14:20:23 +0200401 SHA1TYPE_COPY_METHODDEF
402 SHA1TYPE_DIGEST_METHODDEF
403 SHA1TYPE_HEXDIGEST_METHODDEF
404 SHA1TYPE_UPDATE_METHODDEF
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000405 {NULL, NULL} /* sentinel */
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000406};
407
408static PyObject *
409SHA1_get_block_size(PyObject *self, void *closure)
410{
Christian Heimes217cfd12007-12-02 14:31:20 +0000411 return PyLong_FromLong(SHA1_BLOCKSIZE);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000412}
413
414static PyObject *
415SHA1_get_name(PyObject *self, void *closure)
416{
Christian Heimes37d5ceb2013-08-15 18:31:48 +0200417 return PyUnicode_FromStringAndSize("sha1", 4);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000418}
419
420static PyObject *
421sha1_get_digest_size(PyObject *self, void *closure)
422{
Christian Heimes217cfd12007-12-02 14:31:20 +0000423 return PyLong_FromLong(SHA1_DIGESTSIZE);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000424}
425
426
427static PyGetSetDef SHA1_getseters[] = {
428 {"block_size",
429 (getter)SHA1_get_block_size, NULL,
430 NULL,
431 NULL},
432 {"name",
433 (getter)SHA1_get_name, NULL,
434 NULL,
435 NULL},
436 {"digest_size",
437 (getter)sha1_get_digest_size, NULL,
438 NULL,
439 NULL},
440 {NULL} /* Sentinel */
441};
442
443static PyTypeObject SHA1type = {
444 PyVarObject_HEAD_INIT(NULL, 0)
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000445 "_sha1.sha1", /*tp_name*/
446 sizeof(SHA1object), /*tp_size*/
447 0, /*tp_itemsize*/
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000448 /* methods */
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000449 SHA1_dealloc, /*tp_dealloc*/
450 0, /*tp_print*/
451 0, /*tp_getattr*/
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000452 0, /*tp_setattr*/
Mark Dickinsone94c6792009-02-02 20:36:42 +0000453 0, /*tp_reserved*/
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000454 0, /*tp_repr*/
455 0, /*tp_as_number*/
456 0, /*tp_as_sequence*/
457 0, /*tp_as_mapping*/
458 0, /*tp_hash*/
459 0, /*tp_call*/
460 0, /*tp_str*/
461 0, /*tp_getattro*/
462 0, /*tp_setattro*/
463 0, /*tp_as_buffer*/
464 Py_TPFLAGS_DEFAULT, /*tp_flags*/
465 0, /*tp_doc*/
466 0, /*tp_traverse*/
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000467 0, /*tp_clear*/
468 0, /*tp_richcompare*/
469 0, /*tp_weaklistoffset*/
470 0, /*tp_iter*/
471 0, /*tp_iternext*/
472 SHA1_methods, /* tp_methods */
473 NULL, /* tp_members */
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000474 SHA1_getseters, /* tp_getset */
475};
476
477
478/* The single module-level function: new() */
479
Martin v. Löwis501b13c2014-07-27 14:20:23 +0200480/*[clinic input]
481_sha1.sha1
482
483 string: object(c_default="NULL") = b''
484
485Return a new SHA1 hash object; optionally initialized with a string.
486[clinic start generated code]*/
487
Martin v. Löwis501b13c2014-07-27 14:20:23 +0200488static PyObject *
Serhiy Storchaka1a2b24f2016-07-07 17:35:15 +0300489_sha1_sha1_impl(PyObject *module, PyObject *string)
490/*[clinic end generated code: output=e5982830d1dece51 input=27ea54281d995ec2]*/
Martin v. Löwis501b13c2014-07-27 14:20:23 +0200491{
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000492 SHA1object *new;
Martin v. Löwis7b9cb252008-08-14 15:52:23 +0000493 Py_buffer buf;
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000494
Martin v. Löwis501b13c2014-07-27 14:20:23 +0200495 if (string)
496 GET_BUFFER_VIEW_OR_ERROUT(string, &buf);
Gregory P. Smith365a1862009-02-12 07:35:29 +0000497
Hirokazu Yamamoto84047492009-03-03 07:49:01 +0000498 if ((new = newSHA1object()) == NULL) {
Martin v. Löwis501b13c2014-07-27 14:20:23 +0200499 if (string)
Hirokazu Yamamoto84047492009-03-03 07:49:01 +0000500 PyBuffer_Release(&buf);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000501 return NULL;
Hirokazu Yamamoto84047492009-03-03 07:49:01 +0000502 }
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000503
504 sha1_init(&new->hash_state);
505
506 if (PyErr_Occurred()) {
507 Py_DECREF(new);
Martin v. Löwis501b13c2014-07-27 14:20:23 +0200508 if (string)
Hirokazu Yamamoto84047492009-03-03 07:49:01 +0000509 PyBuffer_Release(&buf);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000510 return NULL;
511 }
Martin v. Löwis501b13c2014-07-27 14:20:23 +0200512 if (string) {
Martin v. Löwis7b9cb252008-08-14 15:52:23 +0000513 sha1_process(&new->hash_state, buf.buf, buf.len);
Hirokazu Yamamoto84047492009-03-03 07:49:01 +0000514 PyBuffer_Release(&buf);
Martin v. Löwis7b9cb252008-08-14 15:52:23 +0000515 }
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000516
517 return (PyObject *)new;
518}
519
520
521/* List of functions exported by this module */
522
523static struct PyMethodDef SHA1_functions[] = {
Martin v. Löwis501b13c2014-07-27 14:20:23 +0200524 _SHA1_SHA1_METHODDEF
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000525 {NULL, NULL} /* Sentinel */
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000526};
527
528
529/* Initialize this module. */
530
531#define insint(n,v) { PyModule_AddIntConstant(m,n,v); }
532
Martin v. Löwis1a214512008-06-11 05:26:20 +0000533
534static struct PyModuleDef _sha1module = {
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000535 PyModuleDef_HEAD_INIT,
536 "_sha1",
537 NULL,
538 -1,
539 SHA1_functions,
540 NULL,
541 NULL,
542 NULL,
543 NULL
Martin v. Löwis1a214512008-06-11 05:26:20 +0000544};
545
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000546PyMODINIT_FUNC
Martin v. Löwis1a214512008-06-11 05:26:20 +0000547PyInit__sha1(void)
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000548{
Christian Heimes327dd732013-10-22 15:05:23 +0200549 PyObject *m;
550
Christian Heimes90aa7642007-12-19 02:45:37 +0000551 Py_TYPE(&SHA1type) = &PyType_Type;
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000552 if (PyType_Ready(&SHA1type) < 0)
Martin v. Löwis1a214512008-06-11 05:26:20 +0000553 return NULL;
Christian Heimes327dd732013-10-22 15:05:23 +0200554
555 m = PyModule_Create(&_sha1module);
556 if (m == NULL)
557 return NULL;
558
559 Py_INCREF((PyObject *)&SHA1type);
560 PyModule_AddObject(m, "SHA1Type", (PyObject *)&SHA1type);
561 return m;
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000562}