Mercurial > ~mikael > mcabber > hg

comparison mcabber/libjabber/rate.c @ 25:bf3d6e241714

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
[/trunk] Changeset 41 by mikael * Add libjabber to trunk. Let the game begin! :-)
author mikael
date Sun, 27 Mar 2005 20:18:21 +0000
parents
children ec86d759ed54
comparison
equal deleted inserted replaced
24:e88b15cbf2de 25:bf3d6e241714
1 /*
2 * This program is free software; you can redistribute it and/or modify
3 * it under the terms of the GNU General Public License as published by
4 * the Free Software Foundation; either version 2 of the License, or
5 * (at your option) any later version.
6 *
7 * This program is distributed in the hope that it will be useful,
8 * but WITHOUT ANY WARRANTY; without even the implied warranty of
9 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
10 * GNU General Public License for more details.
11 *
12 * You should have received a copy of the GNU General Public License
13 * along with this program; if not, write to the Free Software
14 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
15 *
16 * Jabber
17 * Copyright (C) 1998-1999 The Jabber Team http://jabber.org/
18 */
19
20 #include "jabber.h"
21
22 jlimit jlimit_new(int maxt, int maxp)
23 {
24 pool p;
25 jlimit r;
26
27 p = pool_new();
28 r = pmalloc(p,sizeof(_jlimit));
29 r->key = NULL;
30 r->start = r->points = 0;
31 r->maxt = maxt;
32 r->maxp = maxp;
33 r->p = p;
34
35 return r;
36 }
37
38 void jlimit_free(jlimit r)
39 {
40 if(r != NULL)
41 {
42 if(r->key != NULL) free(r->key);
43 pool_free(r->p);
44 }
45 }
46
47 int jlimit_check(jlimit r, char *key, int points)
48 {
49 int now = time(NULL);
50
51 if(r == NULL) return 0;
52
53 /* make sure we didn't go over the time frame or get a null/new key */
54 if((now - r->start) > r->maxt || key == NULL || j_strcmp(key,r->key) != 0)
55 { /* start a new key */
56 free(r->key);
57 if(key != NULL)
58 /* We use strdup instead of pstrdup since r->key needs to be free'd before
59 and more often than the rest of the rlimit structure */
60 r->key = strdup(key);
61 else
62 r->key = NULL;
63 r->start = now;
64 r->points = 0;
65 }
66
67 r->points += points;
68
69 /* if we're within the time frame and over the point limit */
70 if(r->points > r->maxp && (now - r->start) < r->maxt)
71 {
72 return 1; /* we don't reset the rate here, so that it remains rated until the time runs out */
73 }
74
75 return 0;
76 }