mirror of
https://github.com/transmission/transmission
synced 2024-12-26 09:37:56 +00:00
f2b4a59eda
If we use composition on these objects we can save a handful of pointers per peer. This isn't a big deal, but it's an easy/safe change to do.
68 lines
1.6 KiB
C
68 lines
1.6 KiB
C
/*
|
|
* This file Copyright (C) Mnemosyne LLC
|
|
*
|
|
* 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$
|
|
*/
|
|
|
|
#include <assert.h>
|
|
|
|
#include "transmission.h"
|
|
#include "history.h"
|
|
#include "utils.h"
|
|
|
|
void
|
|
tr_historyAdd( tr_recentHistory * h, time_t now, unsigned int n )
|
|
{
|
|
if( h->slices[h->newest].date + (time_t)h->precision >= now )
|
|
h->slices[h->newest].n += n;
|
|
else {
|
|
if( ++h->newest == h->sliceCount ) h->newest = 0;
|
|
h->slices[h->newest].date = now;
|
|
h->slices[h->newest].n = n;
|
|
}
|
|
}
|
|
|
|
unsigned int
|
|
tr_historyGet( const tr_recentHistory * h, time_t now, unsigned int sec )
|
|
{
|
|
unsigned int n = 0;
|
|
const time_t cutoff = (now?now:tr_time()) - sec;
|
|
int i = h->newest;
|
|
|
|
for( ;; )
|
|
{
|
|
if( h->slices[i].date <= cutoff )
|
|
break;
|
|
|
|
n += h->slices[i].n;
|
|
|
|
if( --i == -1 ) i = h->sliceCount - 1; /* circular history */
|
|
if( i == h->newest ) break; /* we've come all the way around */
|
|
}
|
|
|
|
return n;
|
|
}
|
|
|
|
void
|
|
tr_historyConstruct( tr_recentHistory * h, unsigned int seconds, unsigned int precision )
|
|
{
|
|
memset( h, 0, sizeof( tr_recentHistory ) );
|
|
|
|
assert( precision <= seconds );
|
|
|
|
h->precision = precision;
|
|
h->sliceCount = seconds / precision;
|
|
h->slices = tr_new0( struct tr_history_slice, h->sliceCount );
|
|
}
|
|
|
|
void
|
|
tr_historyDestruct( tr_recentHistory * h )
|
|
{
|
|
tr_free( h->slices );
|
|
}
|