1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
|
/*
* Ostatnia aktualizacja:
*
* - $Id: rate.c,v 1.3 2002/12/14 19:36:11 mati Exp $
*
*/
#include "libtlen.h"
jlimit jlimit_new(int maxt, int maxp)
{
pool p;
jlimit r;
p = pool_new();
r = pmalloc(p,sizeof(_jlimit));
r->key = NULL;
r->start = r->points = 0;
r->maxt = maxt;
r->maxp = maxp;
r->p = p;
return r;
}
void jlimit_free(jlimit r)
{
if(r != NULL)
{
if(r->key != NULL) free(r->key);
pool_free(r->p);
}
}
int jlimit_check(jlimit r, char *key, int points)
{
int now = time(NULL);
if(r == NULL) return 0;
/* make sure we didn't go over the time frame or get a null/new key */
if((now - r->start) > r->maxt || key == NULL || j_strcmp(key,r->key) != 0)
{ /* start a new key */
free(r->key);
if(key != NULL)
/* We use strdup instead of pstrdup since r->key needs to be free'd before
and more often than the rest of the rlimit structure */
r->key = strdup(key);
else
r->key = NULL;
r->start = now;
r->points = 0;
}
r->points += points;
/* if we're within the time frame and over the point limit */
if(r->points > r->maxp && (now - r->start) < r->maxt)
{
return 1; /* we don't reset the rate here, so that it remains rated until the time runs out */
}
return 0;
}
|
