← Back to branch summary

~drizzle-trunk/drizzle/development

« back to all changes in this revision

Viewing changes to mysys/my_tree.h

  • Committer: Monty Taylor
  • Date: 2008-12-24 01:49:53 UTC
  • mto: This revision was merged to the branch mainline in revision 751.
  • Revision ID: mordred@inaugust.com-20081224014953-rc9p7a162p74y889
Fixed connect.test.

Show diffs side-by-side

added added

removed removed

Lines of Context:
mysys/my_tree.h
20
20
#endif
21
21
 
22
22
#include <drizzled/base.h>              /* get 'enum ha_rkey_function' */
 
23
#include <mysys/my_sys.h>
23
24
 
24
25
/* Worst case tree is half full. This gives use 2^(MAX_TREE_HEIGHT/2) leafs */
25
26
#define MAX_TREE_HEIGHT 64
26
27
 
27
28
#define ELEMENT_KEY(tree,element)\
28
 
(tree->offset_to_key ? (void*)((uchar*) element+tree->offset_to_key) :\
 
29
(tree->offset_to_key ? (void*)((unsigned char*) element+tree->offset_to_key) :\
29
30
                        *((void**) (element+1)))
30
31
 
31
 
#define tree_set_pointer(element,ptr) *((uchar **) (element+1))=((uchar*) (ptr))
 
32
#define tree_set_pointer(element,ptr) *((unsigned char **) (element+1))=((unsigned char*) (ptr))
32
33
 
33
34
#define TREE_NO_DUPS 1
34
35
 
50
51
typedef struct st_tree {
51
52
  TREE_ELEMENT *root,null_element;
52
53
  TREE_ELEMENT **parents[MAX_TREE_HEIGHT];
53
 
  uint offset_to_key,elements_in_tree,size_of_element;
 
54
  uint32_t offset_to_key,elements_in_tree,size_of_element;
54
55
  uint32_t memory_limit, allocated;
55
56
  qsort_cmp2 compare;
56
57
  void *custom_arg;
57
58
  MEM_ROOT mem_root;
58
59
  bool with_delete;
59
60
  tree_element_free free;
60
 
  uint flag;
 
61
  uint32_t flag;
61
62
} TREE;
62
63
 
63
64
        /* Functions on whole tree */
66
67
               tree_element_free free_element, void *custom_arg);
67
68
void delete_tree(TREE*);
68
69
void reset_tree(TREE*);
69
 
  /* similar to delete tree, except we do not my_free() blocks in mem_root
 
70
  /* similar to delete tree, except we do not free() blocks in mem_root
70
71
   */
71
72
#define is_tree_inited(tree) ((tree)->root != 0)
72
73
 
73
74
        /* Functions on leafs */
74
 
TREE_ELEMENT *tree_insert(TREE *tree,void *key, uint key_size, 
 
75
TREE_ELEMENT *tree_insert(TREE *tree,void *key, uint32_t key_size,
75
76
                          void *custom_arg);
76
77
void *tree_search(TREE *tree, void *key, void *custom_arg);
77
78
int tree_walk(TREE *tree,tree_walk_action action,
78
79
              void *argument, TREE_WALK visit);
79
 
int tree_delete(TREE *tree, void *key, uint key_size, void *custom_arg);
80
 
void *tree_search_key(TREE *tree, const void *key, 
 
80
int tree_delete(TREE *tree, void *key, uint32_t key_size, void *custom_arg);
 
81
void *tree_search_key(TREE *tree, const void *key,
81
82
                      TREE_ELEMENT **parents, TREE_ELEMENT ***last_pos,
82
83
                      enum ha_rkey_function flag, void *custom_arg);
83
 
void *tree_search_edge(TREE *tree, TREE_ELEMENT **parents, 
 
84
void *tree_search_edge(TREE *tree, TREE_ELEMENT **parents,
84
85
                        TREE_ELEMENT ***last_pos, int child_offs);
85
 
void *tree_search_next(TREE *tree, TREE_ELEMENT ***last_pos, int l_offs, 
 
86
void *tree_search_next(TREE *tree, TREE_ELEMENT ***last_pos, int l_offs,
86
87
                       int r_offs);
87
 
ha_rows tree_record_pos(TREE *tree, const void *key, 
 
88
ha_rows tree_record_pos(TREE *tree, const void *key,
88
89
                     enum ha_rkey_function search_flag, void *custom_arg);
89
90
 
90
91
#define TREE_ELEMENT_EXTRA_SIZE (sizeof(TREE_ELEMENT) + sizeof(void*))