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
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
|
/* -*- mode: c++; c-basic-offset: 2; indent-tabs-mode: nil; -*-
* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
*
* Copyright (C) 2008 Sun Microsystems
*
* 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-1301 USA
*/
#ifndef DRIZZLED_PLUGIN_STORAGE_ENGINE_H
#define DRIZZLED_PLUGIN_STORAGE_ENGINE_H
#include <drizzled/definitions.h>
#include <drizzled/plugin.h>
#include <drizzled/handler_structs.h>
#include <drizzled/message/table.pb.h>
#include <drizzled/registry.h>
#include <bitset>
#include <string>
#include <vector>
class TableList;
class Session;
class XID;
class handler;
class TableShare;
typedef struct st_mysql_lex_string LEX_STRING;
typedef bool (stat_print_fn)(Session *session, const char *type, uint32_t type_len,
const char *file, uint32_t file_len,
const char *status, uint32_t status_len);
enum ha_stat_type { HA_ENGINE_STATUS, HA_ENGINE_LOGS, HA_ENGINE_MUTEX };
/* Possible flags of a StorageEngine (there can be 32 of them) */
enum engine_flag_bits {
HTON_BIT_ALTER_NOT_SUPPORTED, // Engine does not support alter
HTON_BIT_CAN_RECREATE, // Delete all is used for truncate
HTON_BIT_HIDDEN, // Engine does not appear in lists
HTON_BIT_FLUSH_AFTER_RENAME,
HTON_BIT_NOT_USER_SELECTABLE,
HTON_BIT_TEMPORARY_NOT_SUPPORTED, // Having temporary tables not supported
HTON_BIT_TEMPORARY_ONLY,
HTON_BIT_FILE_BASED, // use for check_lowercase_names
HTON_BIT_HAS_DATA_DICTIONARY,
HTON_BIT_SIZE
};
static const std::bitset<HTON_BIT_SIZE> HTON_NO_FLAGS(0);
static const std::bitset<HTON_BIT_SIZE> HTON_ALTER_NOT_SUPPORTED(1 << HTON_BIT_ALTER_NOT_SUPPORTED);
static const std::bitset<HTON_BIT_SIZE> HTON_CAN_RECREATE(1 << HTON_BIT_CAN_RECREATE);
static const std::bitset<HTON_BIT_SIZE> HTON_HIDDEN(1 << HTON_BIT_HIDDEN);
static const std::bitset<HTON_BIT_SIZE> HTON_FLUSH_AFTER_RENAME(1 << HTON_BIT_FLUSH_AFTER_RENAME);
static const std::bitset<HTON_BIT_SIZE> HTON_NOT_USER_SELECTABLE(1 << HTON_BIT_NOT_USER_SELECTABLE);
static const std::bitset<HTON_BIT_SIZE> HTON_TEMPORARY_NOT_SUPPORTED(1 << HTON_BIT_TEMPORARY_NOT_SUPPORTED);
static const std::bitset<HTON_BIT_SIZE> HTON_TEMPORARY_ONLY(1 << HTON_BIT_TEMPORARY_ONLY);
static const std::bitset<HTON_BIT_SIZE> HTON_FILE_BASED(1 << HTON_BIT_FILE_BASED);
static const std::bitset<HTON_BIT_SIZE> HTON_HAS_DATA_DICTIONARY(1 << HTON_BIT_HAS_DATA_DICTIONARY);
class Table;
class TableNameIteratorImplementation;
/*
StorageEngine is a singleton structure - one instance per storage engine -
to provide access to storage engine functionality that works on the
"global" level (unlike handler class that works on a per-table basis)
usually StorageEngine instance is defined statically in ha_xxx.cc as
static StorageEngine { ... } xxx_engine;
savepoint_*, prepare, recover, and *_by_xid pointers can be 0.
*/
class StorageEngine
{
/*
Name used for storage engine.
*/
const std::string name;
const bool two_phase_commit;
bool enabled;
const std::bitset<HTON_BIT_SIZE> flags; /* global handler flags */
/*
to store per-savepoint data storage engine is provided with an area
of a requested size (0 is ok here).
savepoint_offset must be initialized statically to the size of
the needed memory to store per-savepoint information.
After xxx_init it is changed to be an offset to savepoint storage
area and need not be used by storage engine.
see binlog_engine and binlog_savepoint_set/rollback for an example.
*/
size_t savepoint_offset;
size_t orig_savepoint_offset;
std::vector<std::string> aliases;
void setTransactionReadWrite(Session* session);
protected:
/**
* Implementing classes should override these to provide savepoint
* functionality.
*/
virtual int savepoint_set_hook(Session *, void *) { return 0; }
virtual int savepoint_rollback_hook(Session *, void *) { return 0; }
virtual int savepoint_release_hook(Session *, void *) { return 0; }
public:
StorageEngine(const std::string name_arg,
const std::bitset<HTON_BIT_SIZE> &flags_arg= HTON_NO_FLAGS,
size_t savepoint_offset_arg= 0,
bool support_2pc= false);
virtual ~StorageEngine();
static int getTableProto(const char* path,
drizzled::message::Table *table_proto);
virtual int getTableProtoImplementation(const char* path,
drizzled::message::Table *table_proto)
{
(void)path;
(void)table_proto;
return ENOENT;
}
/*
each storage engine has it's own memory area (actually a pointer)
in the session, for storing per-connection information.
It is accessed as
session->ha_data[xxx_engine.slot]
slot number is initialized by MySQL after xxx_init() is called.
*/
uint32_t slot;
inline uint32_t getSlot (void) { return slot; }
inline void setSlot (uint32_t value) { slot= value; }
const std::vector<std::string>& getAliases()
{
return aliases;
}
void addAlias(std::string alias)
{
aliases.push_back(alias);
}
bool has_2pc()
{
return two_phase_commit;
}
bool is_enabled() const
{
return enabled;
}
bool is_user_selectable() const
{
return not flags.test(HTON_BIT_NOT_USER_SELECTABLE);
}
bool check_flag(const engine_flag_bits flag) const
{
return flags.test(flag);
}
void enable() { enabled= true; }
void disable() { enabled= false; }
std::string getName() const { return name; }
/*
StorageEngine methods:
close_connection is only called if
session->ha_data[xxx_engine.slot] is non-zero, so even if you don't need
this storage area - set it to something, so that MySQL would know
this storage engine was accessed in this connection
*/
virtual int close_connection(Session *)
{
return 0;
}
/*
'all' is true if it's a real commit, that makes persistent changes
'all' is false if it's not in fact a commit but an end of the
statement that is part of the transaction.
NOTE 'all' is also false in auto-commit mode where 'end of statement'
and 'real commit' mean the same event.
*/
virtual int commit(Session *, bool)
{
return 0;
}
virtual int rollback(Session *, bool)
{
return 0;
}
/*
The void * points to an uninitialized storage area of requested size
(see savepoint_offset description)
*/
int savepoint_set(Session *session, void *sp)
{
return savepoint_set_hook(session, (unsigned char *)sp+savepoint_offset);
}
/*
The void * points to a storage area, that was earlier passed
to the savepoint_set call
*/
int savepoint_rollback(Session *session, void *sp)
{
return savepoint_rollback_hook(session,
(unsigned char *)sp+savepoint_offset);
}
int savepoint_release(Session *session, void *sp)
{
return savepoint_release_hook(session,
(unsigned char *)sp+savepoint_offset);
}
virtual int prepare(Session *, bool) { return 0; }
virtual int recover(XID *, uint32_t) { return 0; }
virtual int commit_by_xid(XID *) { return 0; }
virtual int rollback_by_xid(XID *) { return 0; }
virtual handler *create(TableShare *, MEM_ROOT *)= 0;
/* args: path */
virtual void drop_database(char*) { }
virtual int start_consistent_snapshot(Session *) { return 0; }
virtual bool flush_logs() { return false; }
virtual bool show_status(Session *, stat_print_fn *, enum ha_stat_type)
{
return false;
}
/* args: current_session, tables, cond */
virtual int fill_files_table(Session *, TableList *,
Item *) { return 0; }
virtual int release_temporary_latches(Session *) { return false; }
/**
If frm_error() is called then we will use this to find out what file
extentions exist for the storage engine. This is also used by the default
rename_table and delete_table method in handler.cc.
For engines that have two file name extentions (separate meta/index file
and data file), the order of elements is relevant. First element of engine
file name extentions array should be meta/index file extention. Second
element - data file extention. This order is assumed by
prepare_for_repair() when REPAIR Table ... USE_FRM is issued.
*/
virtual const char **bas_ext() const =0;
protected:
virtual int createTableImplementation(Session *session,
const char *table_name,
Table *table_arg,
HA_CREATE_INFO *create_info,
drizzled::message::Table* proto)= 0;
virtual int renameTableImplementation(Session* session,
const char *from, const char *to);
virtual int deleteTableImplementation(Session* session,
const std::string table_path);
public:
int createTable(Session *session, const char *path, Table *table_arg,
HA_CREATE_INFO *create_info,
drizzled::message::Table *proto)
{
char name_buff[FN_REFLEN];
const char *table_name;
table_name= checkLowercaseNames(path, name_buff);
setTransactionReadWrite(session);
return createTableImplementation(session, table_name, table_arg,
create_info, proto);
}
int renameTable(Session *session, const char *from, const char *to)
{
setTransactionReadWrite(session);
return renameTableImplementation(session, from, to);
}
int deleteTable(Session* session, const std::string table_path)
{
setTransactionReadWrite(session);
return deleteTableImplementation(session, table_path);
}
const char *checkLowercaseNames(const char *path, char *tmp_path);
virtual TableNameIteratorImplementation* tableNameIterator(const std::string &database)
{
(void)database;
return NULL;
}
};
class TableNameIteratorImplementation
{
protected:
std::string db;
public:
TableNameIteratorImplementation(const std::string &database) : db(database)
{};
virtual ~TableNameIteratorImplementation() {};
virtual int next(std::string *name)= 0;
};
class TableNameIterator
{
private:
drizzled::Registry<StorageEngine *>::iterator engine_iter;
TableNameIteratorImplementation *current_implementation;
TableNameIteratorImplementation *default_implementation;
std::string database;
public:
TableNameIterator(const std::string &db);
~TableNameIterator();
int next(std::string *name);
};
/* lookups */
StorageEngine *ha_default_storage_engine(Session *session);
StorageEngine *ha_resolve_by_name(Session *session, std::string find_str);
handler *get_new_handler(TableShare *share, MEM_ROOT *alloc,
StorageEngine *db_type);
const std::string ha_resolve_storage_engine_name(const StorageEngine *db_type);
#endif /* DRIZZLED_PLUGIN_STORAGE_ENGINE_H */
|