pt_bitlen_t
const pt_bitlen_t slots = 1 << PTN_BRANCH_BITLEN(parent);
const pt_bitlen_t bitlen = PTN_BRANCH_BITLEN(ptn);
const pt_bitlen_t mask_len = PTN_MASK_BITLEN(ptn);
const pt_bitlen_t slots = 1 << bitlen;
ptree_mask_node_p(pt_tree_t *pt, const void *item, pt_bitlen_t *lenp)
const pt_bitlen_t bitlen = PTN_BRANCH_BITLEN(ptn);
const pt_node_t *ptn, pt_bitoff_t bitoff, pt_bitlen_t bitlen)
const pt_bitlen_t bitlen = PTN_BRANCH_BITLEN(ptn);
const pt_bitlen_t mask_len = PTN_MASK_BITLEN(mask);
const pt_bitlen_t node_mask_len = PTN_MASK_BITLEN(ptn);
const pt_bitlen_t leaf_masklen = PTN_MASK_BITLEN(leaf);
const pt_bitlen_t target_masklen = PTN_MASK_BITLEN(target);
const pt_bitlen_t target_masklen = PTN_MASK_BITLEN(target);
ptree_insert_mask_node(pt_tree_t *pt, void *item, pt_bitlen_t mask_len)
const pt_bitlen_t mask_len = PTN_MASK_BITLEN(ptn);
const pt_bitlen_t parent_bitlen = PTN_BRANCH_BITLEN(parent);
pt_bitoff_t, pt_bitlen_t, void *);
pt_bitoff_t, pt_bitlen_t, void *);
pt_bitoff_t, pt_bitlen_t, void *);
bool ptree_insert_mask_node(pt_tree_t *, void *, pt_bitlen_t);
bool ptree_mask_node_p(pt_tree_t *, const void *, pt_bitlen_t *);