library for inclusion into tinc (http://tinc.nl.linux.org/) by
Guus Sliepen <guus@sliepen.eu.org>.
- $Id: avl_tree.c,v 1.1.2.11 2002/09/09 22:32:24 guus Exp $
+ $Id: avl_tree.c,v 1.1.2.12 2002/09/10 09:40:15 guus Exp $
*/
#include <stdio.h>
void avl_insert_before(avl_tree_t *tree, avl_node_t *before,
avl_node_t *node)
{
- if(!before)
- return tree->tail ? avl_insert_after(tree, tree->tail, node) : avl_insert_top(tree, node);
+ if(!before) {
+ if(tree->tail)
+ avl_insert_after(tree, tree->tail, node);
+ else
+ avl_insert_top(tree, node);
+ return;
+ }
node->next = before;
node->parent = before;
node->prev = before->prev;
- if(before->left)
- return avl_insert_after(tree, before->prev, node);
+ if(before->left) {
+ avl_insert_after(tree, before->prev, node);
+ return;
+ }
if(before->prev)
before->prev->next = node;
void avl_insert_after(avl_tree_t *tree, avl_node_t *after, avl_node_t *node)
{
- if(!after)
- return tree->head ? avl_insert_before(tree, tree->head,
- node) : avl_insert_top(tree,
- node);
+ if(!after) {
+ if(tree->head)
+ avl_insert_before(tree, tree->head, node);
+ else
+ avl_insert_top(tree, node);
+ return;
+ }
- if(after->right)
- return avl_insert_before(tree, after->next, node);
+ if(after->right) {
+ avl_insert_before(tree, after->next, node);
+ return;
+ }
node->prev = after;
node->parent = after;
#include <errno.h>
#include <signal.h>
#include <sys/types.h>
+#include <signal.h>
#include <fcntl.h>
/* read_pid
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
- $Id: graph.c,v 1.1.2.19 2002/09/09 21:24:34 guus Exp $
+ $Id: graph.c,v 1.1.2.20 2002/09/10 09:40:21 guus Exp $
*/
/* We need to generate two trees from the graph:
if(n->status.visited != n->status.reachable) {
n->status.reachable = !n->status.reachable;
- if(debug_lvl >= DEBUG_TRAFFIC)
+ if(debug_lvl >= DEBUG_TRAFFIC) {
if(n->status.reachable)
syslog(LOG_DEBUG, _("Node %s (%s) became reachable"),
n->name, n->hostname);
else
syslog(LOG_DEBUG, _("Node %s (%s) became unreachable"),
n->name, n->hostname);
+ }
n->status.validkey = 0;
n->status.waitingforkey = 0;
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
- $Id: meta.c,v 1.1.2.30 2002/09/09 22:32:39 guus Exp $
+ $Id: meta.c,v 1.1.2.31 2002/09/10 09:40:25 guus Exp $
*/
#include "config.h"
int receive_meta(connection_t *c)
{
- int x, l = sizeof(x);
+ int x;
+ socklen_t l = sizeof(x);
int oldlen, i;
int lenin, reqlen;
int decrypted = 0;
/* Decrypt */
if(c->status.decryptin && !decrypted) {
- EVP_DecryptUpdate(c->inctx, inbuf, &lenin, c->buffer + oldlen,
- lenin);
+ EVP_DecryptUpdate(c->inctx, inbuf, &lenin, c->buffer + oldlen, lenin);
memcpy(c->buffer + oldlen, inbuf, lenin);
decrypted = 1;
}
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
- $Id: process.c,v 1.1.2.47 2002/09/09 22:32:49 guus Exp $
+ $Id: process.c,v 1.1.2.48 2002/09/10 09:40:25 guus Exp $
*/
#include "config.h"
__attribute__ ((noreturn));
void _execute_script(const char *scriptname, char **envp)
{
- char *s;
-
cp();
while(*envp)