亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

? 歡迎來到蟲蟲下載站! | ?? 資源下載 ?? 資源專輯 ?? 關于我們
? 蟲蟲下載站

?? libewf_hash_values.c

?? sleuthit-2.09 一個磁盤的工具集
?? C
?? 第 1 頁 / 共 2 頁
字號:
/* * libewf hash values * * Copyright (c) 2006-2007, Joachim Metz <forensics@hoffmannbv.nl>, * Hoffmann Investigations. All rights reserved. * * Refer to AUTHORS for acknowledgements. * * Redistribution and use in source and binary forms, with or without modification, * are permitted provided that the following conditions are met: * * - Redistributions of source code must retain the above copyright notice, *   this list of conditions and the following disclaimer. * - Redistributions in binary form must reproduce the above copyright notice, *   this list of conditions and the following disclaimer in the documentation *   and/or other materials provided with the distribution. * - Neither the name of the creator, related organisations, nor the names of *   its contributors may be used to endorse or promote products derived from *   this software without specific prior written permission. * - All advertising materials mentioning features or use of this software *   must acknowledge the contribution by people stated in the acknowledgements. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER, COMPANY AND CONTRIBUTORS * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * POSSIBILITY OF SUCH DAMAGE. */#include "libewf_includes.h"#include <libewf/libewf_definitions.h>#include "libewf_common.h"#include "libewf_hash_values.h"#include "libewf_notify.h"#include "libewf_string.h"#include "ewf_compress.h"#include "ewf_definitions.h"/* Allocates memory for a new hash values struct * Returns a pointer to the new instance, NULL on error */LIBEWF_HASH_VALUES *libewf_hash_values_alloc( void ){	LIBEWF_HASH_VALUES *hash_values = NULL;	size_t hash_values_size         = 0;	hash_values = (LIBEWF_HASH_VALUES *) libewf_common_alloc_cleared( LIBEWF_HASH_VALUES_SIZE, 0 );	if( hash_values == NULL )	{		LIBEWF_WARNING_PRINT( "libewf_hash_values_alloc: unable to allocate hash values.\n" );		return( NULL );	}	hash_values->amount = LIBEWF_HASH_VALUES_DEFAULT_AMOUNT;	hash_values_size    = hash_values->amount * sizeof( LIBEWF_CHAR* );	if( hash_values_size > (size_t) SSIZE_MAX )	{		LIBEWF_WARNING_PRINT( "libewf_hash_values_alloc: invalid size value exceeds maximum.\n" );		libewf_common_free( hash_values );		return( NULL );	}	hash_values->identifiers = (LIBEWF_CHAR **) libewf_common_alloc_cleared( hash_values_size, 0 );	if( hash_values->identifiers == NULL )	{		LIBEWF_WARNING_PRINT( "libewf_hash_values_alloc: unable to allocate identifiers.\n" );		libewf_common_free( hash_values );		return( NULL );	}	hash_values->values = (LIBEWF_CHAR **) libewf_common_alloc_cleared( hash_values_size, 0 );	if( hash_values->values == NULL )	{		LIBEWF_WARNING_PRINT( "libewf_hash_values_alloc: unable to allocate values.\n" );		libewf_common_free( hash_values->identifiers );		libewf_common_free( hash_values );		return( NULL );	}	hash_values->identifiers[ 0 ] = libewf_string_duplicate( _S_LIBEWF_CHAR( "MD5" ), 3 );	return( hash_values );}/* Reallocates memory for the hash values * Returns a pointer to the instance, NULL on error */LIBEWF_HASH_VALUES *libewf_hash_values_realloc( LIBEWF_HASH_VALUES *hash_values, uint32_t previous_amount, uint32_t new_amount ){	LIBEWF_CHAR **reallocation = NULL;	size_t previous_size       = previous_amount * sizeof( LIBEWF_CHAR* );	size_t new_size            = new_amount * sizeof( LIBEWF_CHAR* );	if( hash_values == NULL )	{		LIBEWF_WARNING_PRINT( "libewf_hash_values_realloc: invalid hash values.\n" );		return( NULL );	}	if( ( previous_amount > (uint32_t) INT32_MAX ) || ( new_amount > (uint32_t) INT32_MAX ) )	{		LIBEWF_WARNING_PRINT( "libewf_hash_values_realloc: invalid amount only values below 2^32 are supported.\n" );		return( NULL );	}	if( previous_amount >= new_amount )	{		LIBEWF_WARNING_PRINT( "libewf_hash_values_realloc: new amount smaller than previous amount.\n" );		return( NULL );	}	if( ( previous_size > (size_t) SSIZE_MAX ) || ( new_size > (ssize_t) SSIZE_MAX ) )	{		LIBEWF_WARNING_PRINT( "libewf_hash_values_realloc: invalid size value exceeds maximum.\n" );		return( NULL );	}	reallocation = (LIBEWF_CHAR **) libewf_common_realloc_new_cleared( hash_values->identifiers, previous_size, new_size, 0 );	if( reallocation == NULL )	{		LIBEWF_WARNING_PRINT( "libewf_hash_values_realloc: unable to reallocate identifiers.\n" );		return( NULL );	}	hash_values->identifiers = reallocation;	reallocation             = (LIBEWF_CHAR **) libewf_common_realloc_new_cleared( hash_values->values, previous_size, new_size, 0 );	if( reallocation == NULL )	{		LIBEWF_WARNING_PRINT( "libewf_hash_values_realloc: unable to reallocate values.\n" );		return( NULL );	}	hash_values->values = reallocation;	hash_values->amount = new_amount;	return( hash_values );}/* Frees memory of a hash values struct including elements */void libewf_hash_values_free( LIBEWF_HASH_VALUES *hash_values ){	uint32_t iterator = 0;	if( hash_values == NULL )	{		LIBEWF_WARNING_PRINT( "libewf_hash_values_free: invalid hash values.\n" );		return;	}	if( hash_values->values != NULL )	{		for( iterator = 0; iterator < hash_values->amount; iterator++ )		{			libewf_common_free( hash_values->identifiers[ iterator ] );			libewf_common_free( hash_values->values[ iterator ] );		}		libewf_common_free( hash_values->values );	}	libewf_common_free( hash_values );}/* Retrieves the hash value index number, or -1 on error * The index number will be larger than the amount when the identifier is not present in the hash values */int32_t libewf_hash_values_get_index( LIBEWF_HASH_VALUES *hash_values, LIBEWF_CHAR *identifier ){	size_t string_length     = 0;	size_t identifier_length = 0;	int32_t iterator         = 0;	if( hash_values == NULL )	{		LIBEWF_WARNING_PRINT( "libewf_hash_values_get_index: invalid hash values.\n" );		return( -1 );	}	if( identifier == NULL )	{		LIBEWF_WARNING_PRINT( "libewf_hash_values_get_index: invalid identifier.\n" );		return( -1 );	}	identifier_length = libewf_string_length( identifier );	if( identifier_length == 0 )	{		LIBEWF_WARNING_PRINT( "libewf_hash_values_get_index: invalid identifier.\n" );		return( -1 );	}	if( hash_values->amount > (uint32_t) INT32_MAX )	{		LIBEWF_WARNING_PRINT( "libewf_hash_values_get_index: invalid hash values amount only values below 2^32 are supported.\n" );		return( -1 );	}	for( iterator = 0; iterator < (int32_t) hash_values->amount; iterator++ )	{		if( hash_values->identifiers[ iterator ] == NULL )		{			LIBEWF_WARNING_PRINT( "libewf_hash_values_get_index: missing identifier for index: %" PRIi32 ".\n", iterator );			continue;		}		string_length = libewf_string_length( hash_values->identifiers[ iterator ] );		if( string_length == 0 )		{			LIBEWF_WARNING_PRINT( "libewf_hash_values_get_index: unable to determine length of identifier of index: %" PRIi32 ".\n", iterator );			continue;		}		if( string_length != identifier_length )		{			continue;		}		if( libewf_string_compare( identifier, hash_values->identifiers[ iterator ], identifier_length ) == 0 )		{			return( iterator );		}	}	return( iterator );}/* Retrieves a hash value in value * Length should contain the amount of characters in the string * Returns 1 if successful, 0 if value not present, -1 on error */int8_t libewf_hash_values_get_value( LIBEWF_HASH_VALUES *hash_values, LIBEWF_CHAR *identifier, LIBEWF_CHAR *value, size_t length ){	size_t hash_value_length = 0;	int32_t index            = 0;	if( value == NULL )	{		LIBEWF_WARNING_PRINT( "libewf_hash_values_get_value: invalid value.\n" );		return( -1 );	}	index = libewf_hash_values_get_index( hash_values, identifier );	if( index <= -1 )	{		LIBEWF_WARNING_PRINT( "libewf_hash_values_get_value: unable to find index for: %" PRIs_EWF ".\n", identifier );		return( -1 );	}	if( (uint32_t) index > hash_values->amount )	{		return( 0 );	}	if( hash_values->values[ index ] == NULL )	{		return( 0 );	}	hash_value_length = libewf_string_length( hash_values->values[ index ] );	/* Don't bother with empty values	 */	if( hash_value_length == 0 )	{		return( 0 );	}	/* Add 1 additional byte required for the end of string character	 */	hash_value_length += 1;	if( hash_value_length > length )	{		LIBEWF_WARNING_PRINT( "libewf_hash_values_get_value: value too small.\n" );		return( -1 );	}	if( libewf_string_copy( value, hash_values->values[ index ], hash_value_length ) == NULL )	{		LIBEWF_WARNING_PRINT( "libewf_hash_values_get_value: unable to set hash value.\n" );		return( -1 );	}	value[ hash_value_length - 1 ] = (LIBEWF_CHAR) '\0';	return( 1 );}/* Set a hash value * Length should contain the amount of characters in the string * Frees the previous hash value if necessary * Returns 1 if successful, -1 on error */int8_t libewf_hash_values_set_value( LIBEWF_HASH_VALUES *hash_values, LIBEWF_CHAR *identifier, LIBEWF_CHAR *value, size_t length ){	size_t string_length = 0;	int32_t index        = 0;	index = libewf_hash_values_get_index( hash_values, identifier );	if( index <= -1 )	{		LIBEWF_WARNING_PRINT( "libewf_hash_values_set_value: unable to find index for: %" PRIs_EWF ".\n", identifier );		return( -1 );	}	if( (uint32_t) index >= hash_values->amount )	{		string_length = libewf_string_length( identifier );		if( string_length == 0 )		{			LIBEWF_WARNING_PRINT( "libewf_hash_values_set_value: unable to determine length of identifier.\n" );			return( -1 );		}		if( libewf_hash_values_realloc( hash_values, hash_values->amount, ( index + 1 ) ) == NULL )		{			LIBEWF_WARNING_PRINT( "libewf_hash_values_set_value: unable to reallocate hash values.\n" );			return( -1 );		}		hash_values->identifiers[ index ] = libewf_string_duplicate( identifier, string_length );		if( hash_values->identifiers[ index ] == NULL )		{			LIBEWF_WARNING_PRINT( "libewf_hash_values_set_value: unable to set identifier.\n" );			libewf_common_free( hash_values->identifiers[ index ] );			hash_values->identifiers[ index ] = NULL;			return( -1 );		}	}	/* Clear the buffer of the previous hash value	 */	if( hash_values->values[ index ] != NULL )	{		libewf_common_free( hash_values->values[ index ] );		hash_values->values[ index ] = NULL;	}	/* Don't bother with empty values	 */	if( value == NULL )	{		return( 1 );	}	if( length == 0 )	{		return( 1 );	}	hash_values->values[ index ] = libewf_string_duplicate( value, length );	if( hash_values->values[ index ] == NULL )

?? 快捷鍵說明

復制代碼 Ctrl + C
搜索代碼 Ctrl + F
全屏模式 F11
切換主題 Ctrl + Shift + D
顯示快捷鍵 ?
增大字號 Ctrl + =
減小字號 Ctrl + -
亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频
日韩免费看网站| 色婷婷亚洲婷婷| 午夜成人免费电影| 亚洲一区二区三区四区不卡| 一区二区三区波多野结衣在线观看| 欧美精品一区二区三区在线| 日韩精品一区二区在线观看| 成人欧美一区二区三区黑人麻豆| 亚洲三级电影网站| 亚洲最新在线观看| 成人免费的视频| 91原创在线视频| 欧美情侣在线播放| 精品国产1区2区3区| 亚洲无线码一区二区三区| 午夜视频在线观看一区二区三区| 国产成人超碰人人澡人人澡| 色婷婷av一区二区三区大白胸 | 一区二区高清在线| 国产一本一道久久香蕉| 波多野结衣一区二区三区 | 欧美在线三级电影| 欧美日韩www| 一区二区三区在线观看欧美| 成人一级黄色片| 久久久国产午夜精品| 亚洲欧洲国产日本综合| 国产在线视频精品一区| 日本韩国欧美一区二区三区| 日韩午夜av一区| 日韩伦理av电影| 波多野结衣精品在线| 中文字幕精品一区二区精品绿巨人| 中文字幕字幕中文在线中不卡视频| 国产成人小视频| 国产亚洲欧洲997久久综合| 亚洲一区二区三区四区五区黄| 91影院在线观看| 国产精品福利影院| 麻豆成人免费电影| 色狠狠综合天天综合综合| 中文字幕一区二区三中文字幕| 国产河南妇女毛片精品久久久 | 亚洲成av人片在线| 大胆欧美人体老妇| 中文字幕一区二区三区蜜月| 波多野结衣中文字幕一区| 日本一区二区高清| 国产精品一二三四区| 石原莉奈在线亚洲三区| 国产馆精品极品| 国产亚洲自拍一区| 99久久久精品免费观看国产蜜| 日韩三级视频在线看| 久久99最新地址| 欧美午夜影院一区| 亚洲三级在线免费观看| 欧美性做爰猛烈叫床潮| 日本强好片久久久久久aaa| 色婷婷综合久久久| 日日夜夜一区二区| 久久综合给合久久狠狠狠97色69| 午夜成人免费电影| 久久免费看少妇高潮| 本田岬高潮一区二区三区| 一级特黄大欧美久久久| 日韩免费看的电影| 成人av电影观看| 天涯成人国产亚洲精品一区av| 日韩精品在线一区二区| 不卡av在线免费观看| 亚洲一区二区在线观看视频| 日韩精品一区二区三区四区视频| 国产成人高清视频| 午夜电影一区二区三区| 中文字幕国产一区| 91精品国产91久久综合桃花| 天堂久久一区二区三区| 国产日韩精品一区二区三区在线| 国产中文一区二区三区| 亚洲天堂福利av| 欧美大黄免费观看| 色偷偷成人一区二区三区91 | 国产一区二区三区蝌蚪| 亚洲精品网站在线观看| 欧美福利电影网| 亚洲一区在线视频| 国产日本亚洲高清| 91精品国产入口在线| 91丨九色丨国产丨porny| 久久99精品久久只有精品| 日韩免费一区二区| 欧美午夜宅男影院| 色综合欧美在线| 国产激情一区二区三区四区| 天天色天天爱天天射综合| 亚洲欧洲日韩av| 久久精品这里都是精品| 日韩一级片网站| 欧美日韩精品欧美日韩精品| 91猫先生在线| 成人黄色在线看| 国产一区啦啦啦在线观看| 午夜视频久久久久久| 亚洲精品中文在线影院| 国产精品二区一区二区aⅴ污介绍| 日韩精品一区二区在线观看| 欧美日韩免费一区二区三区视频| 蜜臀av性久久久久av蜜臀妖精| 亚洲一级二级在线| 亚洲色图视频网站| 亚洲天堂免费看| 亚洲天堂2014| 亚洲视频每日更新| 亚洲美女少妇撒尿| 精品国产一区二区三区不卡| 欧美一区二区视频网站| 欧美久久久久久久久| 欧美日韩三级在线| 欧美日韩精品系列| 欧美巨大另类极品videosbest | 成人精品免费网站| 岛国一区二区在线观看| 国产suv精品一区二区三区| 亚洲午夜一区二区三区| 亚洲一区二区欧美| 亚洲3atv精品一区二区三区| 午夜视频在线观看一区二区| 婷婷六月综合网| 麻豆一区二区三区| 国产永久精品大片wwwapp| 国产成人在线色| zzijzzij亚洲日本少妇熟睡| 99久久精品99国产精品| 日本大香伊一区二区三区| 欧美日韩精品综合在线| 欧美www视频| 欧美色图一区二区三区| 欧美老年两性高潮| 精品国产免费人成在线观看| 欧美激情一区二区三区在线| ●精品国产综合乱码久久久久| 亚洲精品菠萝久久久久久久| 亚洲18女电影在线观看| 美女诱惑一区二区| 国产成人精品一区二| 91黄色在线观看| 欧美一区二区三区免费视频| 久久久精品黄色| 亚洲一二三区视频在线观看| 麻豆精品一二三| yourporn久久国产精品| 欧美精品电影在线播放| 久久影院午夜片一区| 亚洲另类春色国产| 99久久精品免费| 欧美综合久久久| 精品国产乱码久久久久久1区2区 | 91麻豆精品国产91久久久久久久久| 91最新地址在线播放| 91精品国产综合久久久久久| 国产亚洲欧美日韩日本| 亚洲大片一区二区三区| 国产福利视频一区二区三区| 91色视频在线| 欧美精品一区二区三区很污很色的 | 欧美变态tickle挠乳网站| 亚洲欧美日韩一区| 久久超碰97人人做人人爱| 色av成人天堂桃色av| 久久综合久久99| 丝袜亚洲精品中文字幕一区| 不卡高清视频专区| 日韩亚洲欧美在线| 一区二区三区精品视频| 国产中文一区二区三区| 制服丝袜国产精品| 亚洲色图.com| 成人av网址在线| 久久先锋资源网| 丝袜美腿高跟呻吟高潮一区| 99久久免费精品| 国产欧美日韩中文久久| 久久成人麻豆午夜电影| 91精品国产一区二区三区香蕉| 亚洲视频狠狠干| 成人国产一区二区三区精品| 久久天堂av综合合色蜜桃网| 秋霞电影网一区二区| 国产精品18久久久久久久久| 69av一区二区三区| 亚洲成人激情自拍| 欧美怡红院视频| 亚洲女人****多毛耸耸8| 菠萝蜜视频在线观看一区| 国产欧美一区二区精品忘忧草| 久久精品国产精品青草| 欧美一二三区在线观看| 视频一区视频二区中文字幕| 精品视频在线免费看|