/* * Harbour Project source code: * SHA2 Harbour wrappers * * Copyright 2009 Viktor Szakats (vszakats.net/harbour) * www - http://harbour-project.org * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2, or (at your option) * any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this software; see the file COPYING.txt. If not, write to * the Free Software Foundation, Inc., 59 Temple Place, Suite 330, * Boston, MA 02111-1307 USA (or visit the web site http://www.gnu.org/). * * As a special exception, the Harbour Project gives permission for * additional uses of the text contained in its release of Harbour. * * The exception is that, if you link the Harbour libraries with other * files to produce an executable, this does not by itself cause the * resulting executable to be covered by the GNU General Public License. * Your use of that executable is in no way restricted on account of * linking the Harbour library code into it. * * This exception does not however invalidate any other reasons why * the executable file might be covered by the GNU General Public License. * * This exception applies only to the code released by the Harbour * Project under the name Harbour. If you copy code from other * Harbour Project or Free Software Foundation releases into a copy of * Harbour, as the General Public License permits, the exception does * not apply to the code that you add in this way. To avoid misleading * anyone as to the status of such modified files, you must delete * this exception notice from them. * * If you write modifications of your own for Harbour, it is your choice * whether to permit this exception to apply to your modifications. * If you do not wish that, delete this exception notice. * */ #include "hbapi.h" #include "sha2.h" HB_FUNC( HB_SHA224 ) { unsigned char digest[ SHA224_DIGEST_SIZE ]; sha224_ctx ctx; hb_sha224_init( &ctx ); #if HB_SIZE_MAX > UINT_MAX { const char * buffer = hb_parcx( 1 ); HB_SIZE nCount = hb_parclen( 1 ); HB_SIZE nDone = 0; while( nCount ) { unsigned int uiChunk; if( nCount > ( HB_SIZE ) UINT_MAX ) { uiChunk = UINT_MAX; nCount -= ( HB_SIZE ) uiChunk; } else { uiChunk = ( unsigned int ) nCount; nCount = 0; } hb_sha224_update( &ctx, buffer + nDone, uiChunk ); nDone += ( HB_SIZE ) uiChunk; } } #else hb_sha224_update( &ctx, hb_parcx( 1 ), hb_parclen( 1 ) ); #endif hb_sha224_final( &ctx, digest ); if( ! hb_parl( 2 ) ) { char hex[ ( sizeof( digest ) * 2 ) + 1 ]; hb_strtohex( ( char * ) digest, sizeof( digest ), hex ); hb_retclen( hex, HB_SIZEOFARRAY( hex ) - 1 ); } else hb_retclen( ( char * ) digest, sizeof( digest ) ); } HB_FUNC( HB_SHA256 ) { unsigned char digest[ SHA256_DIGEST_SIZE ]; sha256_ctx ctx; hb_sha256_init( &ctx ); #if HB_SIZE_MAX > UINT_MAX { const char * buffer = hb_parcx( 1 ); HB_SIZE nCount = hb_parclen( 1 ); HB_SIZE nDone = 0; while( nCount ) { unsigned int uiChunk; if( nCount > ( HB_SIZE ) UINT_MAX ) { uiChunk = UINT_MAX; nCount -= ( HB_SIZE ) uiChunk; } else { uiChunk = ( unsigned int ) nCount; nCount = 0; } hb_sha256_update( &ctx, buffer + nDone, uiChunk ); nDone += ( HB_SIZE ) uiChunk; } } #else hb_sha256_update( &ctx, hb_parcx( 1 ), hb_parclen( 1 ) ); #endif hb_sha256_final( &ctx, digest ); if( ! hb_parl( 2 ) ) { char hex[ ( sizeof( digest ) * 2 ) + 1 ]; hb_strtohex( ( char * ) digest, sizeof( digest ), hex ); hb_retclen( hex, HB_SIZEOFARRAY( hex ) - 1 ); } else hb_retclen( ( char * ) digest, sizeof( digest ) ); } HB_FUNC( HB_SHA384 ) { unsigned char digest[ SHA384_DIGEST_SIZE ]; sha384_ctx ctx; hb_sha384_init( &ctx ); #if HB_SIZE_MAX > UINT_MAX { const char * buffer = hb_parcx( 1 ); HB_SIZE nCount = hb_parclen( 1 ); HB_SIZE nDone = 0; while( nCount ) { unsigned int uiChunk; if( nCount > ( HB_SIZE ) UINT_MAX ) { uiChunk = UINT_MAX; nCount -= ( HB_SIZE ) uiChunk; } else { uiChunk = ( unsigned int ) nCount; nCount = 0; } hb_sha384_update( &ctx, buffer + nDone, uiChunk ); nDone += ( HB_SIZE ) uiChunk; } } #else hb_sha384_update( &ctx, hb_parcx( 1 ), hb_parclen( 1 ) ); #endif hb_sha384_final( &ctx, digest ); if( ! hb_parl( 2 ) ) { char hex[ ( sizeof( digest ) * 2 ) + 1 ]; hb_strtohex( ( char * ) digest, sizeof( digest ), hex ); hb_retclen( hex, HB_SIZEOFARRAY( hex ) - 1 ); } else hb_retclen( ( char * ) digest, sizeof( digest ) ); } HB_FUNC( HB_SHA512 ) { unsigned char digest[ SHA512_DIGEST_SIZE ]; sha512_ctx ctx; hb_sha512_init( &ctx ); #if HB_SIZE_MAX > UINT_MAX { const char * buffer = hb_parcx( 1 ); HB_SIZE nCount = hb_parclen( 1 ); HB_SIZE nDone = 0; while( nCount ) { unsigned int uiChunk; if( nCount > ( HB_SIZE ) UINT_MAX ) { uiChunk = UINT_MAX; nCount -= ( HB_SIZE ) uiChunk; } else { uiChunk = ( unsigned int ) nCount; nCount = 0; } hb_sha512_update( &ctx, buffer + nDone, uiChunk ); nDone += ( HB_SIZE ) uiChunk; } } #else hb_sha512_update( &ctx, hb_parcx( 1 ), hb_parclen( 1 ) ); #endif hb_sha512_final( &ctx, digest ); if( ! hb_parl( 2 ) ) { char hex[ ( sizeof( digest ) * 2 ) + 1 ]; hb_strtohex( ( char * ) digest, sizeof( digest ), hex ); hb_retclen( hex, HB_SIZEOFARRAY( hex ) - 1 ); } else hb_retclen( ( char * ) digest, sizeof( digest ) ); }