transmission/libtransmission/bitset.h

134 lines
3.0 KiB
C
Raw Normal View History

2009-11-24 03:37:54 +00:00
/*
2010-01-04 21:00:47 +00:00
* This file Copyright (C) 2009-2010 Mnemosyne LLC
2009-11-24 03:37:54 +00:00
*
* This file is licensed by the GPL version 2. Works owned by the
* Transmission project are granted a special exemption to clause 2(b)
* so that the bulk of its code can remain under the MIT license.
* This exemption does not extend to derived works not owned by
* the Transmission project.
*
* $Id$
2009-11-24 03:37:54 +00:00
*/
#ifndef __TRANSMISSION__
#error only libtransmission should #include this header.
#endif
#ifndef TR_BITSET_H
#define TR_BITSET_H 1
#include "transmission.h"
#include "bitfield.h"
/** @brief like a tr_bitfield, but supports haveAll and haveNone */
2009-11-24 03:37:54 +00:00
typedef struct tr_bitset
{
tr_bool haveAll;
tr_bool haveNone;
tr_bitfield bitfield;
}
tr_bitset;
static inline void
tr_bitsetConstructor( tr_bitset * b, size_t size )
2009-11-24 03:37:54 +00:00
{
tr_bitfieldConstruct( &b->bitfield, size );
}
static inline void
2009-11-24 03:37:54 +00:00
tr_bitsetDestructor( tr_bitset * b )
{
tr_bitfieldDestruct( &b->bitfield );
}
static inline void
2009-11-24 03:37:54 +00:00
tr_bitsetReserve( tr_bitset * b, size_t size )
{
if( b->bitfield.bitCount < size )
{
tr_bitfield * tmp = tr_bitfieldDup( &b->bitfield );
2009-11-24 03:37:54 +00:00
tr_bitfieldDestruct( &b->bitfield );
tr_bitfieldConstruct( &b->bitfield, size );
if( ( tmp->bits != NULL ) && ( tmp->byteCount > 0 ) )
memcpy( b->bitfield.bits, tmp->bits, tmp->byteCount );
tr_bitfieldFree( tmp );
2009-11-24 03:37:54 +00:00
}
}
static inline tr_bool
2009-11-24 03:37:54 +00:00
tr_bitsetHasFast( const tr_bitset * b, const size_t nth )
{
if( b->haveAll ) return TRUE;
if( b->haveNone ) return FALSE;
if( nth >= b->bitfield.bitCount ) return FALSE;
2009-11-24 03:37:54 +00:00
return tr_bitfieldHasFast( &b->bitfield, nth );
}
static inline tr_bool
2009-11-24 03:37:54 +00:00
tr_bitsetHas( const tr_bitset * b, const size_t nth )
{
if( b->haveAll ) return TRUE;
if( b->haveNone ) return FALSE;
if( nth >= b->bitfield.bitCount ) return FALSE;
2009-11-24 03:37:54 +00:00
return tr_bitfieldHas( &b->bitfield, nth );
}
static inline void
2009-11-24 03:37:54 +00:00
tr_bitsetOr( tr_bitfield * a, const tr_bitset * b )
{
if( b->haveAll )
tr_bitfieldAddRange( a, 0, a->bitCount );
else if( !b->haveNone )
tr_bitfieldOr( a, &b->bitfield );
}
/* set 'a' to all the flags that were in 'a' but not 'b' */
static inline void
2009-11-24 03:37:54 +00:00
tr_bitsetDifference( tr_bitfield * a, const tr_bitset * b )
{
if( b->haveAll )
tr_bitfieldClear( a );
else if( !b->haveNone )
tr_bitfieldDifference( a, &b->bitfield );
}
static inline double
2009-11-24 03:37:54 +00:00
tr_bitsetPercent( const tr_bitset * b )
{
if( b->haveAll ) return 1.0;
if( b->haveNone ) return 0.0;
if( b->bitfield.bitCount == 0 ) return 0.0;
return tr_bitfieldCountTrueBits( &b->bitfield ) / (double)b->bitfield.bitCount;
}
static inline void
2009-11-24 03:37:54 +00:00
tr_bitsetSetHaveAll( tr_bitset * b )
{
b->haveAll = 1;
b->haveNone = 0;
}
static inline void
2009-11-24 03:37:54 +00:00
tr_bitsetSetHaveNone( tr_bitset * b )
{
b->haveAll = 0;
b->haveNone = 1;
}
static inline int
tr_bitsetAdd( tr_bitset * b, size_t i )
2009-11-24 03:37:54 +00:00
{
int ret = 0;
if( !b->haveAll ) {
b->haveNone = 0;
tr_bitsetReserve( b, i+1 );
2009-11-24 03:37:54 +00:00
ret = tr_bitfieldAdd( &b->bitfield, i );
}
return ret;
}
#endif