X-Git-Url: https://www.tinc-vpn.org/git/browse?p=tinc;a=blobdiff_plain;f=src%2Fprotocol.c;h=85133954b89ad642675c480c4e9756a21d5c6640;hp=c7f4b561d1a47dc1ed02e3e5fa2328d41063d8e2;hb=73d77dd416b87b7c4e9b6aa450f64846235cd2b4;hpb=013a2e159e42c46808ea8d0b6abd57525db30a50 diff --git a/src/protocol.c b/src/protocol.c index c7f4b561..85133954 100644 --- a/src/protocol.c +++ b/src/protocol.c @@ -1,7 +1,7 @@ /* protocol.c -- handle the meta-protocol, basic functions - Copyright (C) 1999-2001 Ivo Timmermans , - 2000,2001 Guus Sliepen + Copyright (C) 1999-2005 Ivo Timmermans, + 2000-2006 Guus Sliepen 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 @@ -17,7 +17,7 @@ along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. - $Id: protocol.c,v 1.32 2003/08/24 20:38:27 guus Exp $ + $Id$ */ #include "system.h" @@ -30,6 +30,8 @@ #include "utils.h" #include "xalloc.h" +bool tunnelserver = false; + /* Jumptable for the request handlers */ static bool (*request_handlers[])(connection_t *) = { @@ -73,7 +75,7 @@ bool send_request(connection_t *c, const char *format, ...) cp(); - /* Use vsnprintf instead of vasprintf: faster, no memory + /* Use vsnprintf instead of vxasprintf: faster, no memory fragmentation, cleanup is automatic, and there is a limit on the input buffer anyway */ @@ -219,7 +221,7 @@ bool seen_request(char *request) ifdebug(SCARY_THINGS) logger(LOG_DEBUG, _("Already seen request")); return true; } else { - new = (past_request_t *) xmalloc(sizeof(*new)); + new = xmalloc(sizeof(*new)); new->request = xstrdup(request); new->firstseen = now; avl_insert(past_request_tree, new); @@ -237,9 +239,9 @@ void age_past_requests(void) for(node = past_request_tree->head; node; node = next) { next = node->next; - p = (past_request_t *) node->data; + p = node->data; - if(p->firstseen + pingtimeout < now) + if(p->firstseen + pinginterval < now) avl_delete_node(past_request_tree, node), deleted++; else left++;