mirror of
https://github.com/transmission/transmission.git
synced 2025-12-24 20:35:36 +00:00
d7930984ef
There're places where manual intervention is still required as uncrustify is not ideal (unfortunately), but at least one may rely on it to do the right thing most of the time (e.g. when sending in a patch). The style itself is quite different from what we had before but making it uniform across all the codebase is the key. I also hope that it'll make the code more readable (YMMV) and less sensitive to further changes.
94 lines
2.0 KiB
C
94 lines
2.0 KiB
C
/*
|
|
* This file Copyright (C) 2008-2014 Mnemosyne LLC
|
|
*
|
|
* It may be used under the GNU GPL versions 2 or 3
|
|
* or any future license endorsed by Mnemosyne LLC.
|
|
*
|
|
*/
|
|
|
|
#ifndef __TRANSMISSION__
|
|
#error only libtransmission should #include this header.
|
|
#endif
|
|
|
|
#pragma once
|
|
|
|
#include "transmission.h"
|
|
|
|
/** @brief Implementation of the BitTorrent spec's Bitfield array of bits */
|
|
typedef struct tr_bitfield
|
|
{
|
|
uint8_t* bits;
|
|
size_t alloc_count;
|
|
|
|
size_t bit_count;
|
|
|
|
size_t true_count;
|
|
|
|
/* Special cases for when full or empty but we don't know the bitCount.
|
|
This occurs when a magnet link's peers send have all / have none */
|
|
bool have_all_hint;
|
|
bool have_none_hint;
|
|
}
|
|
tr_bitfield;
|
|
|
|
/***
|
|
****
|
|
***/
|
|
|
|
void tr_bitfieldSetHasAll(tr_bitfield*);
|
|
|
|
void tr_bitfieldSetHasNone(tr_bitfield*);
|
|
|
|
void tr_bitfieldAdd(tr_bitfield*, size_t bit);
|
|
|
|
void tr_bitfieldRem(tr_bitfield*, size_t bit);
|
|
|
|
void tr_bitfieldAddRange(tr_bitfield*, size_t begin, size_t end);
|
|
|
|
void tr_bitfieldRemRange(tr_bitfield*, size_t begin, size_t end);
|
|
|
|
/***
|
|
**** life cycle
|
|
***/
|
|
|
|
extern const tr_bitfield TR_BITFIELD_INIT;
|
|
|
|
void tr_bitfieldConstruct(tr_bitfield*, size_t bit_count);
|
|
|
|
static inline void tr_bitfieldDestruct(tr_bitfield* b)
|
|
{
|
|
tr_bitfieldSetHasNone(b);
|
|
}
|
|
|
|
/***
|
|
****
|
|
***/
|
|
|
|
void tr_bitfieldSetFromFlags(tr_bitfield*, const bool* bytes, size_t n);
|
|
|
|
void tr_bitfieldSetFromBitfield(tr_bitfield*, const tr_bitfield*);
|
|
|
|
void tr_bitfieldSetRaw(tr_bitfield*, const void* bits, size_t byte_count, bool bounded);
|
|
|
|
void* tr_bitfieldGetRaw(const tr_bitfield* b, size_t* byte_count);
|
|
|
|
/***
|
|
****
|
|
***/
|
|
|
|
size_t tr_bitfieldCountRange(const tr_bitfield*, size_t begin, size_t end);
|
|
|
|
size_t tr_bitfieldCountTrueBits(const tr_bitfield* b);
|
|
|
|
static inline bool tr_bitfieldHasAll(const tr_bitfield* b)
|
|
{
|
|
return b->bit_count ? (b->true_count == b->bit_count) : b->have_all_hint;
|
|
}
|
|
|
|
static inline bool tr_bitfieldHasNone(const tr_bitfield* b)
|
|
{
|
|
return b->bit_count ? (b->true_count == 0) : b->have_none_hint;
|
|
}
|
|
|
|
bool tr_bitfieldHas(const tr_bitfield* b, size_t n);
|