mirror of
https://github.com/MariaDB/server.git
synced 2025-10-31 10:56:12 +01:00
109 lines
3.9 KiB
C
109 lines
3.9 KiB
C
/* Copyright (c) 2000, 2016, Oracle and/or its affiliates. All rights reserved.
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; version 2 of the License.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1335 USA */
|
|
|
|
#ifndef _tree_h
|
|
#define _tree_h
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
#include "my_base.h" /* get 'enum ha_rkey_function' */
|
|
#include "my_alloc.h" /* MEM_ROOT */
|
|
|
|
/* Worst case tree is half full. This gives use 2^(MAX_TREE_HEIGHT/2) leafs */
|
|
#define MAX_TREE_HEIGHT 64
|
|
|
|
#define ELEMENT_KEY(tree,element)\
|
|
(tree->offset_to_key ? (void*)((uchar*) element+tree->offset_to_key) :\
|
|
*((void**) (element+1)))
|
|
|
|
#define tree_set_pointer(element,ptr) *((uchar **) (element+1))=((uchar*) (ptr))
|
|
|
|
/*
|
|
A tree with its flag set to TREE_ONLY_DUPS behaves differently on inserting
|
|
an element that is not in the tree:
|
|
the element is not added at all, but instead tree_insert() returns a special
|
|
address TREE_ELEMENT_UNIQUE as an indication that the function has not failed
|
|
due to lack of memory.
|
|
*/
|
|
|
|
#define TREE_ELEMENT_UNIQUE ((TREE_ELEMENT *) 1)
|
|
#define TREE_NO_DUPS 1
|
|
#define TREE_ONLY_DUPS 2
|
|
|
|
typedef enum { left_root_right, right_root_left } TREE_WALK;
|
|
typedef uint32 element_count;
|
|
typedef int (*tree_walk_action)(void *,element_count,void *);
|
|
|
|
typedef enum { free_init, free_free, free_end } TREE_FREE;
|
|
typedef int (*tree_element_free)(void*, TREE_FREE, void *);
|
|
|
|
typedef struct st_tree_element {
|
|
struct st_tree_element *left,*right;
|
|
uint32 count:31,
|
|
colour:1; /* black is marked as 1 */
|
|
} TREE_ELEMENT;
|
|
|
|
#define ELEMENT_CHILD(element, offs) (*(TREE_ELEMENT**)((char*)element + offs))
|
|
|
|
typedef struct st_tree {
|
|
TREE_ELEMENT *root;
|
|
TREE_ELEMENT **parents[MAX_TREE_HEIGHT];
|
|
uint offset_to_key,elements_in_tree,size_of_element;
|
|
size_t memory_limit, allocated;
|
|
qsort_cmp2 compare;
|
|
void *custom_arg;
|
|
MEM_ROOT mem_root;
|
|
my_bool with_delete;
|
|
tree_element_free free;
|
|
myf my_flags;
|
|
uint flag;
|
|
} TREE;
|
|
|
|
/* Functions on whole tree */
|
|
void init_tree(TREE *tree, size_t default_alloc_size, size_t memory_limit,
|
|
int size, qsort_cmp2 compare,
|
|
tree_element_free free_element, void *custom_arg,
|
|
myf my_flags);
|
|
int delete_tree(TREE*, my_bool abort);
|
|
int reset_tree(TREE*);
|
|
|
|
/* similar to delete tree, except we do not my_free() blocks in mem_root */
|
|
#define is_tree_inited(tree) ((tree)->root != 0)
|
|
|
|
/* Functions on leafs */
|
|
TREE_ELEMENT *tree_insert(TREE *tree,void *key, uint key_size,
|
|
void *custom_arg);
|
|
void *tree_search(TREE *tree, void *key, void *custom_arg);
|
|
int tree_walk(TREE *tree,tree_walk_action action,
|
|
void *argument, TREE_WALK visit);
|
|
int tree_delete(TREE *tree, void *key, uint key_size, void *custom_arg);
|
|
void *tree_search_key(TREE *tree, const void *key,
|
|
TREE_ELEMENT **parents, TREE_ELEMENT ***last_pos,
|
|
enum ha_rkey_function flag, void *custom_arg);
|
|
void *tree_search_edge(TREE *tree, TREE_ELEMENT **parents,
|
|
TREE_ELEMENT ***last_pos, int child_offs);
|
|
void *tree_search_next(TREE *tree, TREE_ELEMENT ***last_pos, int l_offs,
|
|
int r_offs);
|
|
ha_rows tree_record_pos(TREE *tree, const void *key,
|
|
enum ha_rkey_function search_flag, void *custom_arg);
|
|
#define reset_free_element(tree) (tree)->free= 0
|
|
|
|
#define TREE_ELEMENT_EXTRA_SIZE (sizeof(TREE_ELEMENT) + sizeof(void*))
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|
|
#endif
|