59 lines
1.3 KiB
C
59 lines
1.3 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 <string.h> /* memset () */
|
|
|
|
#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 == now)
|
|
{
|
|
h->slices[h->newest].n += n;
|
|
}
|
|
else
|
|
{
|
|
if (++h->newest == TR_RECENT_HISTORY_PERIOD_SEC)
|
|
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 = TR_RECENT_HISTORY_PERIOD_SEC - 1; /* circular history */
|
|
|
|
if (i == h->newest)
|
|
break; /* we've come all the way around */
|
|
}
|
|
|
|
return n;
|
|
}
|