X-Git-Url: https://git.ozlabs.org/?p=ccan;a=blobdiff_plain;f=ccan%2Fidtree%2Fidtree.c;h=e10c17239cdfc407e40da7c77dfb4e5f57edc42a;hp=6e75450e67e85af287a9967cd7e88af66e147a5b;hb=4c1266e86aa8accb64ce116887e9ce2ec66dd798;hpb=6095cfd8fbd75fd65693be5dd4a1e37f9e2f8249;ds=sidebyside

diff --git a/ccan/idtree/idtree.c b/ccan/idtree/idtree.c
index 6e75450e..e10c1723 100644
--- a/ccan/idtree/idtree.c
+++ b/ccan/idtree/idtree.c
@@ -42,9 +42,9 @@
 #define MAX_LEVEL (MAX_ID_SHIFT + IDTREE_BITS - 1) / IDTREE_BITS
 #define IDTREE_FREE_MAX MAX_LEVEL + MAX_LEVEL
 
-#define set_bit(bit, v) (v) |= (1<<(bit))
-#define clear_bit(bit, v) (v) &= ~(1<<(bit))
-#define test_bit(bit, v) ((v) & (1<<(bit)))
+#define set_bit(bit, v) (v) |= (1U<<(bit))
+#define clear_bit(bit, v) (v) &= ~(1U<<(bit))
+#define test_bit(bit, v) ((v) & (1U<<(bit)))
 
 struct idtree_layer {
 	uint32_t		 bitmap;
@@ -122,7 +122,7 @@ restart:
 			/* no space available go back to previous layer. */
 			l++;
 			oid = id;
-			id = (id | ((1 << (IDTREE_BITS*l))-1)) + 1;
+			id = (id | ((1U << (IDTREE_BITS*l))-1)) + 1;
 
 			/* if already at the top layer, we need to grow */
 			if (!(p = pa[l])) {