Function intmap_add_

ccan/ccan/intmap/intmap.c:82–114

}

bool intmap_add_(struct intmap *map, intmap_index_t index, const void *value)
{
	struct intmap *n;

	assert(value);

	/* Empty map? */
	if (intmap_empty_(map)) {
		map->u.i = index;
		map->v = (void *)value;
		return true;
	}

	n = map;
	/* Anything with NULL value is a node. */
	while (!n->v) {
		int crit = critbit(n);
		intmap_index_t mask = prefix_mask(crit);
		u8 direction = (index >> crit) & 1;

		if ((index & mask) != (n->u.n->prefix_and_critbit & mask))
			return split_node(n, n->u.n->prefix_and_critbit & mask,
					  index, value);
		n = &n->u.n->child[direction];
	}

	if (index == n->u.i) {
		errno = EEXIST;
		return false;
	}

	return split_node(n, n->u.i, index, value);
}

void *intmap_del_(struct intmap *map, intmap_index_t index)
{