Mercurial > dropbear

comparison libtomcrypt/src/hashes/helper/hash_memory.c @ 382:0cbe8f6dbf9e

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
propagate from branch 'au.asn.ucc.matt.ltc.dropbear' (head 2af22fb4e878750b88f80f90d439b316d229796f) to branch 'au.asn.ucc.matt.dropbear' (head 02c413252c90e9de8e03d91e9939dde3029f5c0a)
author Matt Johnston <matt@ucc.asn.au>
date Thu, 11 Jan 2007 02:41:05 +0000
parents 1b9e69c058d2
children f849a5ca2efc
comparison
equal deleted inserted replaced
379:b66a00272a90 382:0cbe8f6dbf9e
4 * algorithms in a highly modular and flexible manner. 4 * algorithms in a highly modular and flexible manner.
5 * 5 *
6 * The library is free for all purposes without any express 6 * The library is free for all purposes without any express
7 * guarantee it works. 7 * guarantee it works.
8 * 8 *
9 * Tom St Denis, [email protected], http://libtomcrypt.org 9 * Tom St Denis, [email protected], http://libtomcrypt.com
10 */ 10 */
11 #include "tomcrypt.h" 11 #include "tomcrypt.h"
12 12
13 /** 13 /**
14 @file hash_memory.c 14 @file hash_memory.c
36 if ((err = hash_is_valid(hash)) != CRYPT_OK) { 36 if ((err = hash_is_valid(hash)) != CRYPT_OK) {
37 return err; 37 return err;
38 } 38 }
39 39
40 if (*outlen < hash_descriptor[hash].hashsize) { 40 if (*outlen < hash_descriptor[hash].hashsize) {
41 *outlen = hash_descriptor[hash].hashsize;
41 return CRYPT_BUFFER_OVERFLOW; 42 return CRYPT_BUFFER_OVERFLOW;
42 } 43 }
43 44
44 md = XMALLOC(sizeof(hash_state)); 45 md = XMALLOC(sizeof(hash_state));
45 if (md == NULL) { 46 if (md == NULL) {
62 63
63 return err; 64 return err;
64 } 65 }
65 66
66 /* $Source: /cvs/libtom/libtomcrypt/src/hashes/helper/hash_memory.c,v $ */ 67 /* $Source: /cvs/libtom/libtomcrypt/src/hashes/helper/hash_memory.c,v $ */
67 /* $Revision: 1.3 $ */ 68 /* $Revision: 1.5 $ */
68 /* $Date: 2005/05/05 14:35:58 $ */ 69 /* $Date: 2006/06/16 21:53:41 $ */