Mercurial > pidgin
view plugins/jabber/rate.c @ 1911:db3104dda736
[gaim-migrate @ 1921]
Mike Heffner's redesigned UI.
I changed around a lot of things from his patch, not because they weren't good or needed or anything like that; most of the changes I made just made the patch smaller. I moved functions back to where they originally where and renamed them back to what they originally were. Granted the names aren't as... good as the changes Mike made, but eh, it made my life a lot easier when I could see the meat of the changes without all the cosmetic details.
The only thing I really changed about his patch was I made the list BROWSE instead of SINGLE so that there wouldn't be need for a deselect callback. Oh yeah, and update_show_plugins is called from different places (so that plugins can call load_plugin and have the window update properly).
committer: Tailor Script <tailor@pidgin.im>
author | Eric Warmenhoven <eric@warmenhoven.org> |
---|---|
date | Tue, 29 May 2001 09:46:05 +0000 |
parents | afa63ac2fd84 |
children |
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; }