mirror of
https://github.com/transmission/transmission
synced 2024-12-25 17:17:31 +00:00
204 lines
7 KiB
C
204 lines
7 KiB
C
/******************************************************************************
|
|
* $Id$
|
|
*
|
|
* Copyright (c) 2005-2007 Transmission authors and contributors
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a
|
|
* copy of this software and associated documentation files (the "Software"),
|
|
* to deal in the Software without restriction, including without limitation
|
|
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
|
* and/or sell copies of the Software, and to permit persons to whom the
|
|
* Software is furnished to do so, subject to the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be included in
|
|
* all copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
|
|
* DEALINGS IN THE SOFTWARE.
|
|
*****************************************************************************/
|
|
|
|
#ifndef TR_UTILS_H
|
|
#define TR_UTILS_H 1
|
|
|
|
#include <stdarg.h>
|
|
|
|
void tr_msgInit( void );
|
|
|
|
#define tr_err( a... ) tr_msg( TR_MSG_ERR, ## a )
|
|
#define tr_inf( a... ) tr_msg( TR_MSG_INF, ## a )
|
|
#define tr_dbg( a... ) tr_msg( TR_MSG_DBG, ## a )
|
|
void tr_msg ( int level, char * msg, ... ) PRINTF( 2, 3 );
|
|
|
|
int tr_rand ( int );
|
|
|
|
void * tr_memmem( const void *, size_t, const void *, size_t );
|
|
|
|
/***********************************************************************
|
|
* tr_mkdir
|
|
***********************************************************************
|
|
* Create a directory and any needed parent directories.
|
|
* Note that the string passed in must be writable!
|
|
**********************************************************************/
|
|
int tr_mkdir( char * path );
|
|
|
|
/***********************************************************************
|
|
* tr_strcasecmp
|
|
***********************************************************************
|
|
* A case-insensitive strncmp()
|
|
**********************************************************************/
|
|
#define tr_strcasecmp( ff, ss ) ( tr_strncasecmp( (ff), (ss), ULONG_MAX ) )
|
|
int tr_strncasecmp( const char * first, const char * second, size_t len );
|
|
|
|
/***********************************************************************
|
|
* tr_sprintf
|
|
***********************************************************************
|
|
* Appends to the end of a buffer using printf formatting,
|
|
* growing the buffer if needed
|
|
**********************************************************************/
|
|
int tr_sprintf( char ** buf, int * used, int * max,
|
|
const char * format, ... ) PRINTF( 4, 5 );
|
|
/* gee, it sure would be nice if BeOS had va_copy() */
|
|
int tr_vsprintf( char **, int *, int *, const char *, va_list, va_list );
|
|
/* this concatenates some binary data onto the end of a buffer */
|
|
int tr_concat( char ** buf, int * used, int * max,
|
|
const char * data, int len );
|
|
|
|
/* creates a filename from a series of elements using the
|
|
correct separator for filenames. */
|
|
void tr_buildPath ( char* buf, size_t buflen,
|
|
const char * first_element, ... );
|
|
|
|
|
|
int tr_ioErrorFromErrno( void );
|
|
|
|
char * tr_errorString( int code );
|
|
|
|
/* return the current date in milliseconds */
|
|
uint64_t tr_date( void );
|
|
|
|
/* wait the specified number of milliseconds */
|
|
void tr_wait( uint64_t delay_milliseconds );
|
|
|
|
#define tr_blockPiece(a) _tr_blockPiece(tor,a)
|
|
static inline int _tr_blockPiece( const tr_torrent_t * tor, int block )
|
|
{
|
|
const tr_info_t * inf = &tor->info;
|
|
return block / ( inf->pieceSize / tor->blockSize );
|
|
}
|
|
|
|
#define tr_blockSize(a) _tr_blockSize(tor,a)
|
|
static inline int _tr_blockSize( const tr_torrent_t * tor, int block )
|
|
{
|
|
const tr_info_t * inf = &tor->info;
|
|
int dummy;
|
|
|
|
if( block != tor->blockCount - 1 ||
|
|
!( dummy = inf->totalSize % tor->blockSize ) )
|
|
{
|
|
return tor->blockSize;
|
|
}
|
|
|
|
return dummy;
|
|
}
|
|
|
|
#define tr_blockPosInPiece(a) _tr_blockPosInPiece(tor,a)
|
|
static inline int _tr_blockPosInPiece( const tr_torrent_t * tor, int block )
|
|
{
|
|
const tr_info_t * inf = &tor->info;
|
|
return tor->blockSize *
|
|
( block % ( inf->pieceSize / tor->blockSize ) );
|
|
}
|
|
|
|
#define tr_pieceCountBlocks(a) _tr_pieceCountBlocks(tor,a)
|
|
static inline int _tr_pieceCountBlocks( const tr_torrent_t * tor, int piece )
|
|
{
|
|
const tr_info_t * inf = &tor->info;
|
|
if( piece < inf->pieceCount - 1 ||
|
|
!( tor->blockCount % ( inf->pieceSize / tor->blockSize ) ) )
|
|
{
|
|
return inf->pieceSize / tor->blockSize;
|
|
}
|
|
return tor->blockCount % ( inf->pieceSize / tor->blockSize );
|
|
}
|
|
|
|
#define tr_pieceStartBlock(a) _tr_pieceStartBlock(tor,a)
|
|
static inline int _tr_pieceStartBlock( const tr_torrent_t * tor, int piece )
|
|
{
|
|
const tr_info_t * inf = &tor->info;
|
|
return piece * ( inf->pieceSize / tor->blockSize );
|
|
}
|
|
|
|
#define tr_pieceSize(a) _tr_pieceSize(tor,a)
|
|
static inline int _tr_pieceSize( const tr_torrent_t * tor, int piece )
|
|
{
|
|
const tr_info_t * inf = &tor->info;
|
|
if( piece < inf->pieceCount - 1 ||
|
|
!( inf->totalSize % inf->pieceSize ) )
|
|
{
|
|
return inf->pieceSize;
|
|
}
|
|
return inf->totalSize % inf->pieceSize;
|
|
}
|
|
|
|
#define tr_block(a,b) _tr_block(tor,a,b)
|
|
static inline int _tr_block( const tr_torrent_t * tor, int index, int begin )
|
|
{
|
|
const tr_info_t * inf = &tor->info;
|
|
return index * ( inf->pieceSize / tor->blockSize ) +
|
|
begin / tor->blockSize;
|
|
}
|
|
|
|
/***
|
|
****
|
|
***/
|
|
|
|
#define tr_new(struct_type, n_structs) \
|
|
((struct_type *) tr_malloc (((size_t) sizeof (struct_type)) * ((size_t) (n_structs))))
|
|
#define tr_new0(struct_type, n_structs) \
|
|
((struct_type *) tr_malloc0 (((size_t) sizeof (struct_type)) * ((size_t) (n_structs))))
|
|
#define tr_renew(struct_type, mem, n_structs) \
|
|
((struct_type *) realloc ((mem), ((size_t) sizeof (struct_type)) * ((size_t) (n_structs))))
|
|
|
|
void* tr_malloc ( size_t );
|
|
void* tr_malloc0 ( size_t );
|
|
void* tr_calloc ( size_t nmemb, size_t size );
|
|
void tr_free ( void* );
|
|
|
|
char* tr_strdup( const char * str );
|
|
char* tr_strndup( const char * str, int len );
|
|
|
|
/***
|
|
****
|
|
***/
|
|
|
|
struct tr_bitfield_s
|
|
{
|
|
uint8_t * bits;
|
|
size_t len;
|
|
};
|
|
|
|
tr_bitfield_t* tr_bitfieldNew( size_t bitcount );
|
|
tr_bitfield_t* tr_bitfieldDup( const tr_bitfield_t* );
|
|
void tr_bitfieldFree( tr_bitfield_t*);
|
|
|
|
void tr_bitfieldClear( tr_bitfield_t* );
|
|
void tr_bitfieldAdd( tr_bitfield_t*, size_t bit );
|
|
void tr_bitfieldRem( tr_bitfield_t*, size_t bit );
|
|
void tr_bitfieldAddRange( tr_bitfield_t *, size_t first, size_t last );
|
|
void tr_bitfieldRemRange ( tr_bitfield_t*, size_t first, size_t last );
|
|
|
|
int tr_bitfieldIsEmpty( const tr_bitfield_t* );
|
|
int tr_bitfieldHas( const tr_bitfield_t *, size_t bit );
|
|
size_t tr_bitfieldCountTrueBits( const tr_bitfield_t* );
|
|
|
|
tr_bitfield_t* tr_bitfieldNegate( tr_bitfield_t* );
|
|
tr_bitfield_t* tr_bitfieldAnd( tr_bitfield_t*, const tr_bitfield_t* );
|
|
|
|
|
|
|
|
#endif
|