## Mercurial > ~mikael > mcabber > hg

### view mcabber/libjabber/rate.c @ 219:8b6adc3f1acc

Find changesets by keywords (author, files, the commit message), revision
number or hash, or revset expression.

[/trunk] Changeset 231 by mikael
* TODO minor update

author | mikael |
---|---|

date | Tue, 31 May 2005 16:56:49 +0000 |

parents | bf3d6e241714 |

children | ec86d759ed54 |

line wrap: on

line source

/* * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. * * Jabber * Copyright (C) 1998-1999 The Jabber Team http://jabber.org/ */ #include "jabber.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; }