25
25
#define MAX_TREE_HEIGHT 64
27
27
#define ELEMENT_KEY(tree,element)\
28
(tree->offset_to_key ? (void*)((unsigned char*) element+tree->offset_to_key) :\
28
(tree->offset_to_key ? (void*)((uchar*) element+tree->offset_to_key) :\
29
29
*((void**) (element+1)))
31
#define tree_set_pointer(element,ptr) *((unsigned char **) (element+1))=((unsigned char*) (ptr))
31
#define tree_set_pointer(element,ptr) *((uchar **) (element+1))=((uchar*) (ptr))
33
33
#define TREE_NO_DUPS 1
50
50
typedef struct st_tree {
51
51
TREE_ELEMENT *root,null_element;
52
52
TREE_ELEMENT **parents[MAX_TREE_HEIGHT];
53
uint32_t offset_to_key,elements_in_tree,size_of_element;
53
uint offset_to_key,elements_in_tree,size_of_element;
54
54
uint32_t memory_limit, allocated;
55
55
qsort_cmp2 compare;
59
59
tree_element_free free;
63
63
/* Functions on whole tree */
66
66
tree_element_free free_element, void *custom_arg);
67
67
void delete_tree(TREE*);
68
68
void reset_tree(TREE*);
69
/* similar to delete tree, except we do not free() blocks in mem_root
69
/* similar to delete tree, except we do not my_free() blocks in mem_root
71
71
#define is_tree_inited(tree) ((tree)->root != 0)
73
73
/* Functions on leafs */
74
TREE_ELEMENT *tree_insert(TREE *tree,void *key, uint32_t key_size,
74
TREE_ELEMENT *tree_insert(TREE *tree,void *key, uint key_size,
76
76
void *tree_search(TREE *tree, void *key, void *custom_arg);
77
77
int tree_walk(TREE *tree,tree_walk_action action,
78
78
void *argument, TREE_WALK visit);
79
int tree_delete(TREE *tree, void *key, uint32_t key_size, void *custom_arg);
79
int tree_delete(TREE *tree, void *key, uint key_size, void *custom_arg);
80
80
void *tree_search_key(TREE *tree, const void *key,
81
81
TREE_ELEMENT **parents, TREE_ELEMENT ***last_pos,
82
82
enum ha_rkey_function flag, void *custom_arg);