- int active:1; /* 1 if active.. */
- 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 reachable:1; /* 1 if this node is reachable in the graph */
- int indirect:1; /* 1 if this node is not directly reachable by us */
- int unused:26;
+ unsigned int unused_active:1; /* 1 if active (not used for nodes) */
+ unsigned int validkey:1; /* 1 if we currently have a valid key for him */
+ unsigned int waitingforkey:1; /* 1 if we already sent out a request */
+ unsigned int visited:1; /* 1 if this node has been visited by one of the graph algorithms */
+ unsigned int reachable:1; /* 1 if this node is reachable in the graph */
+ unsigned int indirect:1; /* 1 if this node is not directly reachable by us */
+ unsigned int sptps:1; /* 1 if this node supports SPTPS */
+ unsigned int udp_confirmed:1; /* 1 if the address is one that we received UDP traffic on */
+ unsigned int send_locally:1; /* 1 if the next UDP packet should be sent on the local network */
+ unsigned int udppacket:1; /* 1 if the most recently received packet was UDP */
+ unsigned int validkey_in:1; /* 1 if we have sent a valid key to him */
+ unsigned int unused:21;