rec_priv           92 source3/lib/dbwrap_rbt.c 	struct db_rbt_rec *rec_priv = (struct db_rbt_rec *)rec->private_data;
rec_priv          100 source3/lib/dbwrap_rbt.c 	if (rec_priv->node != NULL) {
rec_priv          106 source3/lib/dbwrap_rbt.c 		db_rbt_parse_node(rec_priv->node, &this_key, &this_val);
rec_priv          117 source3/lib/dbwrap_rbt.c 			rec_priv->node->valuesize = data.dsize;
rec_priv          126 source3/lib/dbwrap_rbt.c 		rb_erase(&rec_priv->node->rb_node, &rec_priv->db_ctx->tree);
rec_priv          134 source3/lib/dbwrap_rbt.c 	node = (struct db_rbt_node *)talloc_size(rec_priv->db_ctx,
rec_priv          139 source3/lib/dbwrap_rbt.c 		TALLOC_FREE(rec_priv->node);
rec_priv          151 source3/lib/dbwrap_rbt.c 	TALLOC_FREE(rec_priv->node);
rec_priv          156 source3/lib/dbwrap_rbt.c 	p = &rec_priv->db_ctx->tree.rb_node;
rec_priv          183 source3/lib/dbwrap_rbt.c 	rb_insert_color(&node->rb_node, &rec_priv->db_ctx->tree);
rec_priv          190 source3/lib/dbwrap_rbt.c 	struct db_rbt_rec *rec_priv = (struct db_rbt_rec *)rec->private_data;
rec_priv          192 source3/lib/dbwrap_rbt.c 	if (rec_priv->node == NULL) {
rec_priv          196 source3/lib/dbwrap_rbt.c 	rb_erase(&rec_priv->node->rb_node, &rec_priv->db_ctx->tree);
rec_priv          197 source3/lib/dbwrap_rbt.c 	TALLOC_FREE(rec_priv->node);
rec_priv          209 source3/lib/dbwrap_rbt.c 	struct db_rbt_rec *rec_priv;
rec_priv          261 source3/lib/dbwrap_rbt.c 	rec_priv = (struct db_rbt_rec *)
rec_priv          263 source3/lib/dbwrap_rbt.c 	rec_priv->db_ctx = ctx;
rec_priv          267 source3/lib/dbwrap_rbt.c 	result->private_data = rec_priv;
rec_priv          270 source3/lib/dbwrap_rbt.c 		rec_priv->node = r;
rec_priv          275 source3/lib/dbwrap_rbt.c 		rec_priv->node = NULL;
rec_priv          277 source3/lib/dbwrap_rbt.c 			((char *)rec_priv + sizeof(*rec_priv));