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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
|
/* Copyright (C) 2000-2002, 2004, 2006 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 */
/*
remove all records from database
Identical as hp_create() and hp_open() but used HP_SHARE* instead of name and
database remains open.
*/
#include "heapdef.h"
void heap_clear(HP_INFO *info)
{
hp_clear(info->s);
}
void hp_clear(HP_SHARE *info)
{
hp_clear_dataspace(&info->recordspace);
hp_clear_keys(info);
info->records= 0;
info->blength=1;
info->changed=0;
return;
}
/*
Clear all keys.
SYNOPSIS
heap_clear_keys()
info A pointer to the heap storage engine HP_INFO struct.
DESCRIPTION
Delete all trees of all indexes and leave them empty.
RETURN
void
*/
void heap_clear_keys(HP_INFO *info)
{
hp_clear(info->s);
}
/*
Clear all keys.
SYNOPSIS
hp_clear_keys()
info A pointer to the heap storage engine HP_SHARE struct.
DESCRIPTION
Delete all trees of all indexes and leave them empty.
RETURN
void
*/
void hp_clear_keys(HP_SHARE *info)
{
uint key;
for (key=0 ; key < info->keys ; key++)
{
HP_KEYDEF *keyinfo = info->keydef + key;
if (keyinfo->algorithm == HA_KEY_ALG_BTREE)
{
delete_tree(&keyinfo->rb_tree);
}
else
{
HP_BLOCK *block= &keyinfo->block;
if (block->levels)
VOID(hp_free_level(block,block->levels,block->root,(uchar*) 0));
block->levels=0;
block->last_allocated=0;
keyinfo->hash_buckets= 0;
}
}
info->index_length=0;
return;
}
/*
Disable all indexes.
SYNOPSIS
heap_disable_indexes()
info A pointer to the heap storage engine HP_INFO struct.
DESCRIPTION
Disable and clear (remove contents of) all indexes.
RETURN
0 ok
*/
int heap_disable_indexes(HP_INFO *info)
{
HP_SHARE *share= info->s;
if (share->keys)
{
hp_clear_keys(share);
share->currently_disabled_keys= share->keys;
share->keys= 0;
}
return 0;
}
/*
Enable all indexes
SYNOPSIS
heap_enable_indexes()
info A pointer to the heap storage engine HP_INFO struct.
DESCRIPTION
Enable all indexes. The indexes might have been disabled
by heap_disable_index() before.
The function works only if both data and indexes are empty,
since the heap storage engine cannot repair the indexes.
To be sure, call handler::delete_all_rows() before.
RETURN
0 ok
HA_ERR_CRASHED data or index is non-empty.
*/
int heap_enable_indexes(HP_INFO *info)
{
int error= 0;
HP_SHARE *share= info->s;
if (share->recordspace.total_data_length || share->index_length)
error= HA_ERR_CRASHED;
else
if (share->currently_disabled_keys)
{
share->keys= share->currently_disabled_keys;
share->currently_disabled_keys= 0;
}
return error;
}
/*
Test if indexes are disabled.
SYNOPSIS
heap_indexes_are_disabled()
info A pointer to the heap storage engine HP_INFO struct.
DESCRIPTION
Test if indexes are disabled.
RETURN
0 indexes are not disabled
1 all indexes are disabled
[2 non-unique indexes are disabled - NOT YET IMPLEMENTED]
*/
int heap_indexes_are_disabled(HP_INFO *info)
{
HP_SHARE *share= info->s;
return (! share->keys && share->currently_disabled_keys);
}
|