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
|
/* Copyright (C) 2000-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., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */
/* class for the the heap Cursor */
#pragma once
#include <drizzled/cursor.h>
#include <drizzled/thr_lock.h>
typedef struct st_heap_info HP_INFO;
typedef unsigned char *HEAP_PTR;
class ha_heap : public drizzled::Cursor
{
HP_INFO *file;
/* number of records changed since last statistics update */
uint32_t records_changed;
uint32_t key_stat_version;
bool internal_table;
public:
ha_heap(drizzled::plugin::StorageEngine &engine, drizzled::Table &table);
~ha_heap() {}
Cursor *clone(drizzled::memory::Root *mem_root);
const char *index_type(uint32_t inx);
double scan_time()
{ return (double) (stats.records+stats.deleted) / 20.0+10; }
double read_time(uint32_t, uint32_t,
drizzled::ha_rows rows)
{ return (double) rows / 20.0+1; }
int doOpen(const drizzled::identifier::Table &identifier, int mode, uint32_t test_if_locked);
int close(void);
void set_keys_for_scanning(void);
int doInsertRecord(unsigned char * buf);
int doUpdateRecord(const unsigned char * old_data, unsigned char * new_data);
int doDeleteRecord(const unsigned char * buf);
virtual void get_auto_increment(uint64_t offset, uint64_t increment,
uint64_t nb_desired_values,
uint64_t *first_value,
uint64_t *nb_reserved_values);
int index_read_map(unsigned char * buf, const unsigned char * key,
drizzled::key_part_map keypart_map,
enum drizzled::ha_rkey_function find_flag);
int index_read_last_map(unsigned char *buf, const unsigned char *key,
drizzled::key_part_map keypart_map);
int index_read_idx_map(unsigned char * buf, uint32_t index,
const unsigned char * key,
drizzled::key_part_map keypart_map,
enum drizzled::ha_rkey_function find_flag);
int index_next(unsigned char * buf);
int index_prev(unsigned char * buf);
int index_first(unsigned char * buf);
int index_last(unsigned char * buf);
int doStartTableScan(bool scan);
int rnd_next(unsigned char *buf);
int rnd_pos(unsigned char * buf, unsigned char *pos);
void position(const unsigned char *record);
int info(uint);
int extra(enum drizzled::ha_extra_function operation);
int reset();
int delete_all_rows(void);
int disable_indexes(uint32_t mode);
int enable_indexes(uint32_t mode);
int indexes_are_disabled(void);
drizzled::ha_rows records_in_range(uint32_t inx,
drizzled::key_range *min_key,
drizzled::key_range *max_key);
void drop_table();
int cmp_ref(const unsigned char *ref1, const unsigned char *ref2);
int reset_auto_increment(uint64_t value)
{
file->getShare()->auto_increment= value;
return 0;
}
private:
void update_key_stats();
};
|