int n, m, sh;
struct idtree_layer *p, *pn;
struct idtree_layer *pa[MAX_LEVEL+1];
- unsigned int l, id, oid;
+ unsigned int l;
+ int id, oid;
uint32_t bm;
memset(pa, 0, sizeof(pa));
*/
sh = IDTREE_BITS * (l + 1);
if (oid >> sh == id >> sh)
- continue;
+ continue;
else
goto restart;
}
* present. If so, tain't one of ours!
*/
if (n + IDTREE_BITS < 31 &&
- (id & ~(~0 << MAX_ID_SHIFT)) >> (n + IDTREE_BITS))
+ (id & ~(~0U << MAX_ID_SHIFT)) >> (n + IDTREE_BITS))
return NULL;
/* Mask off upper bits we don't use for the search. */