nk = node->d.s.key + shift;
k = key + shift;
- bit = 1 << 7;
+ bit = 1U << 7;
while (rbits > 0) {
if ((*nk & bit) != (*k & bit)) {
guint levels_uncompress)
{
guint8 *nkey = node->d.s.key + start_level / NBBY;
- guint8 bit = 1 << (7 - start_level % NBBY);
+ guint8 bit = 1U << (7 - start_level % NBBY);
struct radix_compressed_node *leaf, *next;
/* Make compressed leaf */
bit >>= 1;
if (bit == 0) {
nkey ++;
- bit = 1 << 7;
+ bit = 1U << 7;
}
node = next;
levels_uncompress --;
if (bit == 0) {
k ++;
nkey ++;
- bit = 1 << 7;
+ bit = 1U << 7;
kremain --;
}
}
gsize kremain = keylen;
uintptr_t oldval = RADIX_NO_VALUE;
- bit = 1 << 7;
+ bit = 1U << 7;
node = tree->root;
g_assert (keybits >= masklen);
bit >>= 1;
if (bit == 0) {
k ++;
- bit = 1 << 7;
+ bit = 1U << 7;
kremain --;
}
cur_level ++;
{
radix_compressed_t *tree;
- tree = g_slice_alloc (sizeof (radix_tree_t));
+ tree = g_slice_alloc (sizeof (*tree));
if (tree == NULL) {
return NULL;
}