The "active" bit in node.status is not used.
authorGuus Sliepen <guus@tinc-vpn.org>
Sat, 11 Nov 2006 13:43:00 +0000 (13:43 +0000)
committerGuus Sliepen <guus@tinc-vpn.org>
Sat, 11 Nov 2006 13:43:00 +0000 (13:43 +0000)
src/net_setup.c
src/node.h

index d03869e624ea5e9e327e3d921ac8679493c34000..4bac3f0b0d637498f68b2f0ba84c1d7cae422f2f 100644 (file)
@@ -437,7 +437,6 @@ bool setup_myself(void)
 
        myself->nexthop = myself;
        myself->via = myself;
 
        myself->nexthop = myself;
        myself->via = myself;
-       myself->status.active = true;
        myself->status.reachable = true;
        node_add(myself);
 
        myself->status.reachable = true;
        node_add(myself);
 
index 2ea96922233fe0e3a3dfaef5a2af0664e1b917fc..4b3224e3cab4da7822f5441c729598a03a50a8de 100644 (file)
@@ -31,7 +31,7 @@
 
 typedef union node_status_t {
        struct {
 
 typedef union node_status_t {
        struct {
-               int active:1;                           /* 1 if active.. */
+               int unused_active:1;                    /* 1 if active (not used for nodes) */
                int validkey:1;                         /* 1 if we currently have a valid key for him */
                int waitingforkey:1;                    /* 1 if we already sent out a request */
                int visited:1;                          /* 1 if this node has been visited by one of the graph algorithms */
                int validkey:1;                         /* 1 if we currently have a valid key for him */
                int waitingforkey:1;                    /* 1 if we already sent out a request */
                int visited:1;                          /* 1 if this node has been visited by one of the graph algorithms */