Data Fields | |
unsigned | magic |
for making sure we point to a btree | |
ccn_btnodeid | nextnodeid |
for allocating new btree nodes | |
struct ccn_btree_io * | io |
storage layer | |
struct hashtb * | resident |
of ccn_btree_node, by nodeid | |
ccn_btnodeid | nextsplit |
oversize node that needs splitting | |
ccn_btnodeid | missedsplit |
should stay zero | |
int | errors |
counter for detected errors | |
int | cleanreq |
if nonzero, cleaning might be needed | |
int | full |
split internal nodes bigger than this | |
int | full0 |
split leaf nodes bigger than this | |
int | nodebytes |
limit size of node | |
int | nodepool |
limit resident size |
Definition at line 124 of file btree.h.
unsigned ccn_btree::magic |
for making sure we point to a btree
Definition at line 125 of file btree.h.
Referenced by ccn_btree_create(), ccn_btree_destroy(), ccn_btree_getnode(), and finalize_node().
for allocating new btree nodes
Definition at line 126 of file btree.h.
Referenced by ccn_btree_create(), ccn_btree_grow_a_level(), ccn_btree_split(), example_btree_small(), r_store_init(), test_basic_btree_insert_entry(), test_btree_inserts_from_stdin(), and test_insert_content().
struct ccn_btree_io* ccn_btree::io [read] |
storage layer
Definition at line 127 of file btree.h.
Referenced by ccn_btree_close_node(), ccn_btree_create(), ccn_btree_destroy(), ccn_btree_getnode(), ccn_btree_prepare_for_update(), r_store_index_cleaner(), r_store_index_needs_cleaning(), and r_store_init().
struct hashtb* ccn_btree::resident [read] |
of ccn_btree_node, by nodeid
Definition at line 128 of file btree.h.
Referenced by ccn_btree_check(), ccn_btree_create(), ccn_btree_destroy(), ccn_btree_getnode(), ccn_btree_rnode(), r_store_index_cleaner(), and test_btree_init().
oversize node that needs splitting
Definition at line 129 of file btree.h.
Referenced by ccn_btree_check(), ccn_btree_split(), r_store_content_btree_insert(), and test_btree_inserts_from_stdin().
should stay zero
Definition at line 130 of file btree.h.
Referenced by ccn_btree_check(), ccn_btree_split(), and test_btree_inserts_from_stdin().
counter for detected errors
Definition at line 131 of file btree.h.
Referenced by ccn_btree_check(), ccn_btree_create(), ccn_btree_destroy(), ccn_btree_grow_a_level(), ccn_btree_note_error(), test_basic_btree_insert_entry(), and test_btree_inserts_from_stdin().
if nonzero, cleaning might be needed
Definition at line 132 of file btree.h.
Referenced by ccn_btree_getnode(), ccn_btree_prepare_for_update(), r_store_index_cleaner(), and r_store_index_needs_cleaning().
int ccn_btree::full |
split internal nodes bigger than this
Definition at line 134 of file btree.h.
Referenced by ccn_btree_create(), ccn_btree_oversize(), r_store_init(), test_btree_inserts_from_stdin(), and test_insert_content().
int ccn_btree::full0 |
split leaf nodes bigger than this
Definition at line 135 of file btree.h.
Referenced by ccn_btree_create(), ccn_btree_oversize(), and r_store_init().
limit size of node
Definition at line 136 of file btree.h.
Referenced by ccn_btree_oversize(), and r_store_init().
limit resident size
Definition at line 137 of file btree.h.
Referenced by r_store_index_cleaner(), and r_store_init().