From: Sven-Haegar Koch Date: Sat, 28 May 2011 01:08:31 +0000 (+0200) Subject: sparse fixup: error: dubious one-bit signed bitfield X-Git-Tag: release-1.1pre1~42 X-Git-Url: https://git.librecmc.org/?a=commitdiff_plain;h=b995243ac3d9605003996ba879808ddcbc77ae15;p=oweals%2Ftinc.git sparse fixup: error: dubious one-bit signed bitfield --- diff --git a/src/connection.h b/src/connection.h index 77ca87a..a7db40a 100644 --- a/src/connection.h +++ b/src/connection.h @@ -33,18 +33,18 @@ #define OPTION_CLAMP_MSS 0x0008 typedef struct connection_status_t { - int pinged:1; /* sent ping */ - int active:1; /* 1 if active.. */ - int connecting:1; /* 1 if we are waiting for a non-blocking connect() to finish */ - int termreq:1; /* the termination of this connection was requested */ - int remove_unused:1; /* Set to 1 if you want this connection removed */ - int timeout_unused:1; /* 1 if gotten timeout */ - int encryptout:1; /* 1 if we can encrypt outgoing traffic */ - int decryptin:1; /* 1 if we have to decrypt incoming traffic */ - int mst:1; /* 1 if this connection is part of a minimum spanning tree */ - int control:1; - int pcap:1; - int unused:21; + unsigned int pinged:1; /* sent ping */ + unsigned int active:1; /* 1 if active.. */ + unsigned int connecting:1; /* 1 if we are waiting for a non-blocking connect() to finish */ + unsigned int termreq:1; /* the termination of this connection was requested */ + unsigned int remove_unused:1; /* Set to 1 if you want this connection removed */ + unsigned int timeout_unused:1; /* 1 if gotten timeout */ + unsigned int encryptout:1; /* 1 if we can encrypt outgoing traffic */ + unsigned int decryptin:1; /* 1 if we have to decrypt incoming traffic */ + unsigned int mst:1; /* 1 if this connection is part of a minimum spanning tree */ + unsigned int control:1; + unsigned int pcap:1; + unsigned int unused:21; } connection_status_t; #include "edge.h" diff --git a/src/node.h b/src/node.h index 9164085..4173737 100644 --- a/src/node.h +++ b/src/node.h @@ -29,13 +29,13 @@ #include "subnet.h" typedef struct node_status_t { - 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 unused_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 unused_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 unused:26; } node_status_t; typedef struct node_t {