projects
/
tinc
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Fix forwarding of edge updates.
[tinc]
/
src
/
protocol.c
diff --git
a/src/protocol.c
b/src/protocol.c
index
5de30d7
..
5d5518f
100644
(file)
--- a/
src/protocol.c
+++ b/
src/protocol.c
@@
-1,7
+1,7
@@
/*
protocol.c -- handle the meta-protocol, basic functions
Copyright (C) 1999-2005 Ivo Timmermans,
/*
protocol.c -- handle the meta-protocol, basic functions
Copyright (C) 1999-2005 Ivo Timmermans,
- 2000-20
09
Guus Sliepen <guus@tinc-vpn.org>
+ 2000-20
13
Guus Sliepen <guus@tinc-vpn.org>
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
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
@@
-68,7
+68,7
@@
bool check_id(const char *id) {
bool send_request(connection_t *c, const char *format, ...) {
va_list args;
char buffer[MAXBUFSIZE];
bool send_request(connection_t *c, const char *format, ...) {
va_list args;
char buffer[MAXBUFSIZE];
- int len, request;
+ int len, request
= 0
;
/* Use vsnprintf instead of vxasprintf: faster, no memory
fragmentation, cleanup is automatic, and there is a limit on the
/* Use vsnprintf instead of vxasprintf: faster, no memory
fragmentation, cleanup is automatic, and there is a limit on the
@@
-96,7
+96,7
@@
bool send_request(connection_t *c, const char *format, ...) {
buffer[len++] = '\n';
buffer[len++] = '\n';
- if(c ==
broadcast
) {
+ if(c ==
everyone
) {
broadcast_meta(NULL, buffer, len);
return true;
} else
broadcast_meta(NULL, buffer, len);
return true;
} else
@@
-214,7
+214,7
@@
void age_past_requests(void) {
next = node->next;
p = node->data;
next = node->next;
p = node->data;
- if(p->firstseen + pinginterval < now)
+ if(p->firstseen + pinginterval <
=
now)
avl_delete_node(past_request_tree, node), deleted++;
else
left++;
avl_delete_node(past_request_tree, node), deleted++;
else
left++;