rpst_node
rpst_update_parents(struct rpst_node *n)
struct rpst_node *n = t->t_root;
static struct rpst_node *
rpst_insert_node1(struct rpst_node **where, struct rpst_node *n, uint64_t mask)
struct rpst_node *parent;
struct rpst_node *cur;
struct rpst_node *
rpst_insert_node(struct rpst_tree *t, struct rpst_node *n)
static inline struct rpst_node **
rpst_find_pptr(struct rpst_tree *t, struct rpst_node *n,
struct rpst_node **parentp)
struct rpst_node * const parent = n->n_parent;
rpst_remove_node_at(struct rpst_node *parent, struct rpst_node **where,
struct rpst_node *cur)
struct rpst_node *tmp[2];
struct rpst_node *selected;
struct rpst_node *c;
rpst_remove_node(struct rpst_tree *t, struct rpst_node *n)
struct rpst_node *parent;
struct rpst_node **where;
rpst_iterator_match_p(const struct rpst_node *n, const struct rpst_iterator *it)
struct rpst_node *
struct rpst_node *n;
rpst_node_on_edge_p(const struct rpst_node *n, uint64_t val, uint64_t mask)
rpst_maxidx(const struct rpst_node *n, uint64_t max_x, uint64_t mask)
rpst_minidx(const struct rpst_node *n, uint64_t min_x, uint64_t mask)
struct rpst_node *
struct rpst_node *n;
struct rpst_node *next;
struct rpst_node **where;
rpst_dump_node(const struct rpst_node *n, unsigned int depth)
struct rpst_node n;
struct rpst_node *rn;
struct rpst_node *o;
struct rpst_node *t_root;
struct rpst_node *n_parent;
struct rpst_node *n_children[2];
struct rpst_node *it_cur;
struct rpst_node *rpst_insert_node(struct rpst_tree *, struct rpst_node *);
void rpst_remove_node(struct rpst_tree *, struct rpst_node *);
struct rpst_node *rpst_iterate_first(struct rpst_tree *, uint64_t, uint64_t,
struct rpst_node *rpst_iterate_next(struct rpst_iterator *);