1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
|
/* Copyright (C) 2000-2002, 2004 MySQL AB
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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
/* This file is included in all heap-files */
#ifndef PLUGIN_HEAP_HEAP_PRIV_H
#define PLUGIN_HEAP_HEAP_PRIV_H
#include "config.h"
#include <drizzled/base.h>
#include "drizzled/internal/my_sys.h"
#include "drizzled/charset_info.h"
#include "drizzled/internal/my_pthread.h"
#include "heap.h" /* Structs & some defines */
#include "drizzled/my_tree.h"
#include <list>
/*
When allocating keys /rows in the internal block structure, do it
within the following boundaries.
The challenge is to find the balance between allocate as few blocks
as possible and keep memory consumption down.
*/
#define CHUNK_STATUS_DELETED 0 /* this chunk has been deleted and can be reused */
#define CHUNK_STATUS_ACTIVE 1 /* this chunk represents the first part of a live record */
#define CHUNK_STATUS_LINKED 2 /* this chunk is a continuation from another chunk (part of chunkset) */
/* Some extern variables */
extern std::list<HP_SHARE *> heap_share_list;
extern std::list<HP_INFO *> heap_open_list;
#define test_active(info) \
if (!(info->update & HA_STATE_AKTIV))\
{ errno=HA_ERR_NO_ACTIVE_RECORD; return(-1); }
#define hp_find_hash(A,B) ((HASH_INFO*) hp_find_block((A),(B)))
/* Find pos for record and update it in info->current_ptr */
#define hp_find_record(info,pos) (info)->current_ptr= hp_find_block(&(info)->s->recordspace.block,pos)
#define get_chunk_status(info,ptr) (ptr[(info)->offset_status])
#define get_chunk_count(info,rec_length) ((rec_length + (info)->chunk_dataspace_length - 1) / (info)->chunk_dataspace_length)
typedef struct st_hp_hash_info
{
struct st_hp_hash_info *next_key;
unsigned char *ptr_to_rec;
} HASH_INFO;
typedef struct {
HA_KEYSEG *keyseg;
uint32_t key_length;
uint32_t search_flag;
} heap_rb_param;
/* Prototypes for intern functions */
extern HP_SHARE *hp_find_named_heap(const char *name);
extern int hp_rectest(HP_INFO *info,const unsigned char *old);
extern unsigned char *hp_find_block(HP_BLOCK *info,uint32_t pos);
extern int hp_get_new_block(HP_BLOCK *info, size_t* alloc_length);
extern void hp_free(HP_SHARE *info);
extern unsigned char *hp_free_level(HP_BLOCK *block,uint32_t level,HP_PTRS *pos,
unsigned char *last_pos);
extern int hp_write_key(HP_INFO *info, HP_KEYDEF *keyinfo,
const unsigned char *record, unsigned char *recpos);
extern int hp_rb_write_key(HP_INFO *info, HP_KEYDEF *keyinfo,
const unsigned char *record, unsigned char *recpos);
extern int hp_rb_delete_key(HP_INFO *info,HP_KEYDEF *keyinfo,
const unsigned char *record,unsigned char *recpos,int flag);
extern int hp_delete_key(HP_INFO *info,HP_KEYDEF *keyinfo,
const unsigned char *record,unsigned char *recpos,int flag);
extern HASH_INFO *_heap_find_hash(HP_BLOCK *block,uint32_t pos);
extern unsigned char *hp_search(HP_INFO *info,HP_KEYDEF *keyinfo,const unsigned char *key,
uint32_t nextflag);
extern unsigned char *hp_search_next(HP_INFO *info, HP_KEYDEF *keyinfo,
const unsigned char *key, HASH_INFO *pos);
extern uint32_t hp_rec_hashnr(HP_KEYDEF *keyinfo,const unsigned char *rec);
extern uint32_t hp_mask(uint32_t hashnr,uint32_t buffmax,uint32_t maxlength);
extern void hp_movelink(HASH_INFO *pos,HASH_INFO *next_link,
HASH_INFO *newlink);
extern int hp_rec_key_cmp(HP_KEYDEF *keydef,const unsigned char *rec1,
const unsigned char *rec2,
bool diff_if_only_endspace_difference);
extern void hp_make_key(HP_KEYDEF *keydef,unsigned char *key,const unsigned char *rec);
extern uint32_t hp_rb_make_key(HP_KEYDEF *keydef, unsigned char *key,
const unsigned char *rec, unsigned char *recpos);
extern uint32_t hp_rb_key_length(HP_KEYDEF *keydef, const unsigned char *key);
extern uint32_t hp_rb_null_key_length(HP_KEYDEF *keydef, const unsigned char *key);
extern uint32_t hp_rb_var_key_length(HP_KEYDEF *keydef, const unsigned char *key);
extern bool hp_if_null_in_key(HP_KEYDEF *keyinfo, const unsigned char *record);
extern int hp_close(HP_INFO *info);
extern void hp_clear(HP_SHARE *info);
extern uint32_t hp_rb_pack_key(HP_KEYDEF *keydef,
unsigned char *key, const unsigned char *old,
drizzled::key_part_map keypart_map);
/* Chunkset management (alloc/free/encode/decode) functions */
extern unsigned char *hp_allocate_chunkset(HP_DATASPACE *info, uint32_t chunk_count);
extern int hp_reallocate_chunkset(HP_DATASPACE *info, uint32_t chunk_count, unsigned char* pos);
extern void hp_free_chunks(HP_DATASPACE *info, unsigned char *pos);
extern void hp_clear_dataspace(HP_DATASPACE *info);
extern uint32_t hp_get_encoded_data_length(HP_SHARE *info, const unsigned char *record, uint32_t *chunk_count);
extern void hp_copy_record_data_to_chunkset(HP_SHARE *info, const unsigned char *record, unsigned char *pos);
extern void hp_extract_record(HP_SHARE *info, unsigned char *record, const unsigned char *pos);
extern uint32_t hp_process_record_data_to_chunkset(HP_SHARE *info, const unsigned char *record, unsigned char *pos, uint32_t is_compare);
extern pthread_mutex_t THR_LOCK_heap;
#endif /* PLUGIN_HEAP_HEAP_PRIV_H */
|