blob: b660042fd43ada093f0a1f6f5ccfb52fdca36969 [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. Smith2f21eb32007-09-09 06:44:34 +000021
22
23/* Some useful types */
24
25#if SIZEOF_INT == 4
Antoine Pitrouf95a1b32010-05-09 15:52:27 +000026typedef unsigned int SHA1_INT32; /* 32-bit integer */
27typedef PY_LONG_LONG SHA1_INT64; /* 64-bit integer */
Gregory P. Smith2f21eb32007-09-09 06:44:34 +000028#else
29/* not defined. compilation will die. */
30#endif
31
32/* The SHA1 block size and message digest sizes, in bytes */
33
34#define SHA1_BLOCKSIZE 64
35#define SHA1_DIGESTSIZE 20
36
37/* The structure for storing SHA1 info */
38
39struct sha1_state {
40 SHA1_INT64 length;
41 SHA1_INT32 state[5], curlen;
42 unsigned char buf[SHA1_BLOCKSIZE];
43};
44
45typedef struct {
46 PyObject_HEAD
47
48 struct sha1_state hash_state;
49} SHA1object;
50
51
52/* ------------------------------------------------------------------------
53 *
54 * This code for the SHA1 algorithm was noted as public domain. The
55 * original headers are pasted below.
56 *
57 * Several changes have been made to make it more compatible with the
58 * Python environment and desired interface.
59 *
60 */
61
62/* LibTomCrypt, modular cryptographic library -- Tom St Denis
63 *
64 * LibTomCrypt is a library that provides various cryptographic
65 * algorithms in a highly modular and flexible manner.
66 *
67 * The library is free for all purposes without any express
68 * guarantee it works.
69 *
70 * Tom St Denis, tomstdenis@gmail.com, http://libtom.org
71 */
72
73/* rotate the hard way (platform optimizations could be done) */
74#define ROL(x, y) ( (((unsigned long)(x)<<(unsigned long)((y)&31)) | (((unsigned long)(x)&0xFFFFFFFFUL)>>(unsigned long)(32-((y)&31)))) & 0xFFFFFFFFUL)
75#define ROLc(x, y) ( (((unsigned long)(x)<<(unsigned long)((y)&31)) | (((unsigned long)(x)&0xFFFFFFFFUL)>>(unsigned long)(32-((y)&31)))) & 0xFFFFFFFFUL)
76
77/* Endian Neutral macros that work on all platforms */
78
79#define STORE32H(x, y) \
80 { (y)[0] = (unsigned char)(((x)>>24)&255); (y)[1] = (unsigned char)(((x)>>16)&255); \
81 (y)[2] = (unsigned char)(((x)>>8)&255); (y)[3] = (unsigned char)((x)&255); }
82
83#define LOAD32H(x, y) \
84 { x = ((unsigned long)((y)[0] & 255)<<24) | \
85 ((unsigned long)((y)[1] & 255)<<16) | \
86 ((unsigned long)((y)[2] & 255)<<8) | \
87 ((unsigned long)((y)[3] & 255)); }
88
89#define STORE64H(x, y) \
90 { (y)[0] = (unsigned char)(((x)>>56)&255); (y)[1] = (unsigned char)(((x)>>48)&255); \
91 (y)[2] = (unsigned char)(((x)>>40)&255); (y)[3] = (unsigned char)(((x)>>32)&255); \
92 (y)[4] = (unsigned char)(((x)>>24)&255); (y)[5] = (unsigned char)(((x)>>16)&255); \
93 (y)[6] = (unsigned char)(((x)>>8)&255); (y)[7] = (unsigned char)((x)&255); }
94
95#ifndef MIN
96 #define MIN(x, y) ( ((x)<(y))?(x):(y) )
97#endif
98
99
100/* SHA1 macros */
101
102#define F0(x,y,z) (z ^ (x & (y ^ z)))
103#define F1(x,y,z) (x ^ y ^ z)
104#define F2(x,y,z) ((x & y) | (z & (x | y)))
105#define F3(x,y,z) (x ^ y ^ z)
106
107static void sha1_compress(struct sha1_state *sha1, unsigned char *buf)
108{
109 SHA1_INT32 a,b,c,d,e,W[80],i;
110
111 /* copy the state into 512-bits into W[0..15] */
112 for (i = 0; i < 16; i++) {
113 LOAD32H(W[i], buf + (4*i));
114 }
115
116 /* copy state */
117 a = sha1->state[0];
118 b = sha1->state[1];
119 c = sha1->state[2];
120 d = sha1->state[3];
121 e = sha1->state[4];
122
123 /* expand it */
124 for (i = 16; i < 80; i++) {
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000125 W[i] = ROL(W[i-3] ^ W[i-8] ^ W[i-14] ^ W[i-16], 1);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000126 }
127
128 /* compress */
129 /* round one */
Brett Cannonf079c572010-07-23 15:43:14 +0000130 #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);
131 #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);
132 #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);
133 #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 +0000134
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000135 for (i = 0; i < 20; ) {
Brett Cannonf079c572010-07-23 15:43:14 +0000136 FF_0(a,b,c,d,e,i++);
137 FF_0(e,a,b,c,d,i++);
138 FF_0(d,e,a,b,c,i++);
139 FF_0(c,d,e,a,b,i++);
140 FF_0(b,c,d,e,a,i++);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000141 }
142
143 /* round two */
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000144 for (; i < 40; ) {
Brett Cannonf079c572010-07-23 15:43:14 +0000145 FF_1(a,b,c,d,e,i++);
146 FF_1(e,a,b,c,d,i++);
147 FF_1(d,e,a,b,c,i++);
148 FF_1(c,d,e,a,b,i++);
149 FF_1(b,c,d,e,a,i++);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000150 }
151
152 /* round three */
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000153 for (; i < 60; ) {
Brett Cannonf079c572010-07-23 15:43:14 +0000154 FF_2(a,b,c,d,e,i++);
155 FF_2(e,a,b,c,d,i++);
156 FF_2(d,e,a,b,c,i++);
157 FF_2(c,d,e,a,b,i++);
158 FF_2(b,c,d,e,a,i++);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000159 }
160
161 /* round four */
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000162 for (; i < 80; ) {
Brett Cannonf079c572010-07-23 15:43:14 +0000163 FF_3(a,b,c,d,e,i++);
164 FF_3(e,a,b,c,d,i++);
165 FF_3(d,e,a,b,c,i++);
166 FF_3(c,d,e,a,b,i++);
167 FF_3(b,c,d,e,a,i++);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000168 }
169
Brett Cannonf079c572010-07-23 15:43:14 +0000170 #undef FF_0
171 #undef FF_1
172 #undef FF_2
173 #undef FF_3
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000174
175 /* store */
176 sha1->state[0] = sha1->state[0] + a;
177 sha1->state[1] = sha1->state[1] + b;
178 sha1->state[2] = sha1->state[2] + c;
179 sha1->state[3] = sha1->state[3] + d;
180 sha1->state[4] = sha1->state[4] + e;
181}
182
183/**
184 Initialize the hash state
185 @param sha1 The hash state you wish to initialize
186*/
187void sha1_init(struct sha1_state *sha1)
188{
189 assert(sha1 != NULL);
190 sha1->state[0] = 0x67452301UL;
191 sha1->state[1] = 0xefcdab89UL;
192 sha1->state[2] = 0x98badcfeUL;
193 sha1->state[3] = 0x10325476UL;
194 sha1->state[4] = 0xc3d2e1f0UL;
195 sha1->curlen = 0;
196 sha1->length = 0;
197}
198
199/**
200 Process a block of memory though the hash
201 @param sha1 The hash state
202 @param in The data to hash
203 @param inlen The length of the data (octets)
204*/
205void sha1_process(struct sha1_state *sha1,
206 const unsigned char *in, unsigned long inlen)
207{
208 unsigned long n;
209
210 assert(sha1 != NULL);
211 assert(in != NULL);
212 assert(sha1->curlen <= sizeof(sha1->buf));
213
214 while (inlen > 0) {
215 if (sha1->curlen == 0 && inlen >= SHA1_BLOCKSIZE) {
216 sha1_compress(sha1, (unsigned char *)in);
217 sha1->length += SHA1_BLOCKSIZE * 8;
218 in += SHA1_BLOCKSIZE;
219 inlen -= SHA1_BLOCKSIZE;
220 } else {
221 n = MIN(inlen, (SHA1_BLOCKSIZE - sha1->curlen));
222 memcpy(sha1->buf + sha1->curlen, in, (size_t)n);
223 sha1->curlen += n;
224 in += n;
225 inlen -= n;
226 if (sha1->curlen == SHA1_BLOCKSIZE) {
227 sha1_compress(sha1, sha1->buf);
228 sha1->length += 8*SHA1_BLOCKSIZE;
229 sha1->curlen = 0;
230 }
231 }
232 }
233}
234
235/**
236 Terminate the hash to get the digest
237 @param sha1 The hash state
238 @param out [out] The destination of the hash (20 bytes)
239*/
240void sha1_done(struct sha1_state *sha1, unsigned char *out)
241{
242 int i;
243
244 assert(sha1 != NULL);
245 assert(out != NULL);
246 assert(sha1->curlen < sizeof(sha1->buf));
247
248 /* increase the length of the message */
249 sha1->length += sha1->curlen * 8;
250
251 /* append the '1' bit */
252 sha1->buf[sha1->curlen++] = (unsigned char)0x80;
253
254 /* if the length is currently above 56 bytes we append zeros
255 * then compress. Then we can fall back to padding zeros and length
256 * encoding like normal.
257 */
258 if (sha1->curlen > 56) {
259 while (sha1->curlen < 64) {
260 sha1->buf[sha1->curlen++] = (unsigned char)0;
261 }
262 sha1_compress(sha1, sha1->buf);
263 sha1->curlen = 0;
264 }
265
266 /* pad upto 56 bytes of zeroes */
267 while (sha1->curlen < 56) {
268 sha1->buf[sha1->curlen++] = (unsigned char)0;
269 }
270
271 /* store length */
272 STORE64H(sha1->length, sha1->buf+56);
273 sha1_compress(sha1, sha1->buf);
274
275 /* copy output */
276 for (i = 0; i < 5; i++) {
277 STORE32H(sha1->state[i], out+(4*i));
278 }
279}
280
281
282/* .Source: /cvs/libtom/libtomcrypt/src/hashes/sha1.c,v $ */
283/* .Revision: 1.10 $ */
284/* .Date: 2007/05/12 14:25:28 $ */
285
286/*
287 * End of copied SHA1 code.
288 *
289 * ------------------------------------------------------------------------
290 */
291
292static PyTypeObject SHA1type;
293
294
295static SHA1object *
296newSHA1object(void)
297{
298 return (SHA1object *)PyObject_New(SHA1object, &SHA1type);
299}
300
301
302/* Internal methods for a hash object */
303
304static void
305SHA1_dealloc(PyObject *ptr)
306{
307 PyObject_Del(ptr);
308}
309
310
311/* External methods for a hash object */
312
313PyDoc_STRVAR(SHA1_copy__doc__, "Return a copy of the hash object.");
314
315static PyObject *
316SHA1_copy(SHA1object *self, PyObject *unused)
317{
318 SHA1object *newobj;
319
Christian Heimes90aa7642007-12-19 02:45:37 +0000320 if (Py_TYPE(self) == &SHA1type) {
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000321 if ( (newobj = newSHA1object())==NULL)
322 return NULL;
323 } else {
324 if ( (newobj = newSHA1object())==NULL)
325 return NULL;
326 }
327
328 newobj->hash_state = self->hash_state;
329 return (PyObject *)newobj;
330}
331
332PyDoc_STRVAR(SHA1_digest__doc__,
333"Return the digest value as a string of binary data.");
334
335static PyObject *
336SHA1_digest(SHA1object *self, PyObject *unused)
337{
338 unsigned char digest[SHA1_DIGESTSIZE];
339 struct sha1_state temp;
340
341 temp = self->hash_state;
342 sha1_done(&temp, digest);
Christian Heimes72b710a2008-05-26 13:28:38 +0000343 return PyBytes_FromStringAndSize((const char *)digest, SHA1_DIGESTSIZE);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000344}
345
346PyDoc_STRVAR(SHA1_hexdigest__doc__,
347"Return the digest value as a string of hexadecimal digits.");
348
349static PyObject *
350SHA1_hexdigest(SHA1object *self, PyObject *unused)
351{
352 unsigned char digest[SHA1_DIGESTSIZE];
353 struct sha1_state temp;
354 PyObject *retval;
355 Py_UNICODE *hex_digest;
356 int i, j;
357
358 /* Get the raw (binary) digest value */
359 temp = self->hash_state;
360 sha1_done(&temp, digest);
361
362 /* Create a new string */
363 retval = PyUnicode_FromStringAndSize(NULL, SHA1_DIGESTSIZE * 2);
364 if (!retval)
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000365 return NULL;
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000366 hex_digest = PyUnicode_AS_UNICODE(retval);
367 if (!hex_digest) {
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000368 Py_DECREF(retval);
369 return NULL;
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000370 }
371
372 /* Make hex version of the digest */
373 for(i=j=0; i<SHA1_DIGESTSIZE; i++) {
374 char c;
375 c = (digest[i] >> 4) & 0xf;
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000376 c = (c>9) ? c+'a'-10 : c + '0';
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000377 hex_digest[j++] = c;
378 c = (digest[i] & 0xf);
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000379 c = (c>9) ? c+'a'-10 : c + '0';
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000380 hex_digest[j++] = c;
381 }
382 return retval;
383}
384
385PyDoc_STRVAR(SHA1_update__doc__,
386"Update this hash object's state with the provided string.");
387
388static PyObject *
389SHA1_update(SHA1object *self, PyObject *args)
390{
Gregory P. Smith365a1862009-02-12 07:35:29 +0000391 PyObject *obj;
Martin v. Löwis7b9cb252008-08-14 15:52:23 +0000392 Py_buffer buf;
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000393
Gregory P. Smith365a1862009-02-12 07:35:29 +0000394 if (!PyArg_ParseTuple(args, "O:update", &obj))
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000395 return NULL;
396
Gregory P. Smith365a1862009-02-12 07:35:29 +0000397 GET_BUFFER_VIEW_OR_ERROUT(obj, &buf);
398
Martin v. Löwis7b9cb252008-08-14 15:52:23 +0000399 sha1_process(&self->hash_state, buf.buf, buf.len);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000400
Martin v. Löwis7b9cb252008-08-14 15:52:23 +0000401 PyBuffer_Release(&buf);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000402 Py_INCREF(Py_None);
403 return Py_None;
404}
405
406static PyMethodDef SHA1_methods[] = {
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000407 {"copy", (PyCFunction)SHA1_copy, METH_NOARGS, SHA1_copy__doc__},
408 {"digest", (PyCFunction)SHA1_digest, METH_NOARGS, SHA1_digest__doc__},
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000409 {"hexdigest", (PyCFunction)SHA1_hexdigest, METH_NOARGS, SHA1_hexdigest__doc__},
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000410 {"update", (PyCFunction)SHA1_update, METH_VARARGS, SHA1_update__doc__},
411 {NULL, NULL} /* sentinel */
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000412};
413
414static PyObject *
415SHA1_get_block_size(PyObject *self, void *closure)
416{
Christian Heimes217cfd12007-12-02 14:31:20 +0000417 return PyLong_FromLong(SHA1_BLOCKSIZE);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000418}
419
420static PyObject *
421SHA1_get_name(PyObject *self, void *closure)
422{
423 return PyUnicode_FromStringAndSize("SHA1", 3);
424}
425
426static PyObject *
427sha1_get_digest_size(PyObject *self, void *closure)
428{
Christian Heimes217cfd12007-12-02 14:31:20 +0000429 return PyLong_FromLong(SHA1_DIGESTSIZE);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000430}
431
432
433static PyGetSetDef SHA1_getseters[] = {
434 {"block_size",
435 (getter)SHA1_get_block_size, NULL,
436 NULL,
437 NULL},
438 {"name",
439 (getter)SHA1_get_name, NULL,
440 NULL,
441 NULL},
442 {"digest_size",
443 (getter)sha1_get_digest_size, NULL,
444 NULL,
445 NULL},
446 {NULL} /* Sentinel */
447};
448
449static PyTypeObject SHA1type = {
450 PyVarObject_HEAD_INIT(NULL, 0)
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000451 "_sha1.sha1", /*tp_name*/
452 sizeof(SHA1object), /*tp_size*/
453 0, /*tp_itemsize*/
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000454 /* methods */
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000455 SHA1_dealloc, /*tp_dealloc*/
456 0, /*tp_print*/
457 0, /*tp_getattr*/
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000458 0, /*tp_setattr*/
Mark Dickinsone94c6792009-02-02 20:36:42 +0000459 0, /*tp_reserved*/
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000460 0, /*tp_repr*/
461 0, /*tp_as_number*/
462 0, /*tp_as_sequence*/
463 0, /*tp_as_mapping*/
464 0, /*tp_hash*/
465 0, /*tp_call*/
466 0, /*tp_str*/
467 0, /*tp_getattro*/
468 0, /*tp_setattro*/
469 0, /*tp_as_buffer*/
470 Py_TPFLAGS_DEFAULT, /*tp_flags*/
471 0, /*tp_doc*/
472 0, /*tp_traverse*/
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000473 0, /*tp_clear*/
474 0, /*tp_richcompare*/
475 0, /*tp_weaklistoffset*/
476 0, /*tp_iter*/
477 0, /*tp_iternext*/
478 SHA1_methods, /* tp_methods */
479 NULL, /* tp_members */
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000480 SHA1_getseters, /* tp_getset */
481};
482
483
484/* The single module-level function: new() */
485
486PyDoc_STRVAR(SHA1_new__doc__,
487"Return a new SHA1 hash object; optionally initialized with a string.");
488
489static PyObject *
490SHA1_new(PyObject *self, PyObject *args, PyObject *kwdict)
491{
492 static char *kwlist[] = {"string", NULL};
493 SHA1object *new;
Gregory P. Smith365a1862009-02-12 07:35:29 +0000494 PyObject *data_obj = NULL;
Martin v. Löwis7b9cb252008-08-14 15:52:23 +0000495 Py_buffer buf;
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000496
Gregory P. Smith365a1862009-02-12 07:35:29 +0000497 if (!PyArg_ParseTupleAndKeywords(args, kwdict, "|O:new", kwlist,
498 &data_obj)) {
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000499 return NULL;
500 }
501
Gregory P. Smith365a1862009-02-12 07:35:29 +0000502 if (data_obj)
503 GET_BUFFER_VIEW_OR_ERROUT(data_obj, &buf);
504
Hirokazu Yamamoto84047492009-03-03 07:49:01 +0000505 if ((new = newSHA1object()) == NULL) {
506 if (data_obj)
507 PyBuffer_Release(&buf);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000508 return NULL;
Hirokazu Yamamoto84047492009-03-03 07:49:01 +0000509 }
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000510
511 sha1_init(&new->hash_state);
512
513 if (PyErr_Occurred()) {
514 Py_DECREF(new);
Hirokazu Yamamoto84047492009-03-03 07:49:01 +0000515 if (data_obj)
516 PyBuffer_Release(&buf);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000517 return NULL;
518 }
Gregory P. Smith365a1862009-02-12 07:35:29 +0000519 if (data_obj) {
Martin v. Löwis7b9cb252008-08-14 15:52:23 +0000520 sha1_process(&new->hash_state, buf.buf, buf.len);
Hirokazu Yamamoto84047492009-03-03 07:49:01 +0000521 PyBuffer_Release(&buf);
Martin v. Löwis7b9cb252008-08-14 15:52:23 +0000522 }
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000523
524 return (PyObject *)new;
525}
526
527
528/* List of functions exported by this module */
529
530static struct PyMethodDef SHA1_functions[] = {
531 {"sha1",(PyCFunction)SHA1_new, METH_VARARGS|METH_KEYWORDS,SHA1_new__doc__},
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000532 {NULL, NULL} /* Sentinel */
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000533};
534
535
536/* Initialize this module. */
537
538#define insint(n,v) { PyModule_AddIntConstant(m,n,v); }
539
Martin v. Löwis1a214512008-06-11 05:26:20 +0000540
541static struct PyModuleDef _sha1module = {
Antoine Pitrouf95a1b32010-05-09 15:52:27 +0000542 PyModuleDef_HEAD_INIT,
543 "_sha1",
544 NULL,
545 -1,
546 SHA1_functions,
547 NULL,
548 NULL,
549 NULL,
550 NULL
Martin v. Löwis1a214512008-06-11 05:26:20 +0000551};
552
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000553PyMODINIT_FUNC
Martin v. Löwis1a214512008-06-11 05:26:20 +0000554PyInit__sha1(void)
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000555{
Christian Heimes90aa7642007-12-19 02:45:37 +0000556 Py_TYPE(&SHA1type) = &PyType_Type;
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000557 if (PyType_Ready(&SHA1type) < 0)
Martin v. Löwis1a214512008-06-11 05:26:20 +0000558 return NULL;
559 return PyModule_Create(&_sha1module);
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000560}