ha_heap.h

/* 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/


#ifdef USE_PRAGMA_INTERFACE
#pragma interface /* gcc class implementation */
#endif

/* class for the the heap handler */

#include <heap.h>

class ha_heap: public handler
{
HP_INFO *file;
HP_SHARE *internal_share;
key_map btree_keys;
/* number of records changed since last statistics update */
uint records_changed;
uint key_stat_version;
my_bool internal_table;
public:
ha_heap(handlerton *hton, TABLE_SHARE *table);
~ha_heap() {}
handler *clone(const char *name, MEM_ROOT *mem_root);
const char *table_type() const
{
return (table->in_use->variables.sql_mode & MODE_MYSQL323) ?
"HEAP" : "MEMORY";
}
const char *index_type(uint inx)
{
return ((table_share->key_info[inx].algorithm == HA_KEY_ALG_BTREE) ?
"BTREE" : "HASH");
}
/* Rows also use a fixed-size format */
enum row_type get_row_type() const { return ROW_TYPE_FIXED; }
const char **bas_ext() const;
ulonglong table_flags() const
{
return (HA_FAST_KEY_READ | HA_NO_BLOBS | HA_NULL_IN_KEY |
HA_BINLOG_ROW_CAPABLE | HA_BINLOG_STMT_CAPABLE |
HA_REC_NOT_IN_SEQ | HA_CAN_INSERT_DELAYED | HA_NO_TRANSACTIONS |
HA_HAS_RECORDS | HA_STATS_RECORDS_IS_EXACT);
}
ulong index_flags(uint inx, uint part, bool all_parts) const
{
return ((table_share->key_info[inx].algorithm == HA_KEY_ALG_BTREE) ?
HA_READ_NEXT | HA_READ_PREV | HA_READ_ORDER | HA_READ_RANGE :
HA_ONLY_WHOLE_INDEX | HA_KEY_SCAN_NOT_ROR);
}
const key_map *keys_to_use_for_scanning() { return &btree_keys; }
uint max_supported_keys() const { return MAX_KEY; }
uint max_supported_key_part_length() const { return MAX_KEY_LENGTH; }
double scan_time()
{ return (double) (stats.records+stats.deleted) / 20.0+10; }
double read_time(uint index, uint ranges, ha_rows rows)
{ return (double) rows / 20.0+1; }

int open(const char *name, int mode, uint test_if_locked);
int close(void);
void set_keys_for_scanning(void);
int write_row(uchar * buf);
int update_row(const uchar * old_data, uchar * new_data);
int delete_row(const uchar * buf);
virtual void get_auto_increment(ulonglong offset, ulonglong increment,
ulonglong nb_desired_values,
ulonglong *first_value,
ulonglong *nb_reserved_values);
int index_read_map(uchar * buf, const uchar * key, key_part_map keypart_map,
enum ha_rkey_function find_flag);
int index_read_last_map(uchar *buf, const uchar *key, key_part_map keypart_map);
int index_read_idx_map(uchar * buf, uint index, const uchar * key,
key_part_map keypart_map,
enum ha_rkey_function find_flag);
int index_next(uchar * buf);
int index_prev(uchar * buf);
int index_first(uchar * buf);
int index_last(uchar * buf);
int rnd_init(bool scan);
int rnd_next(uchar *buf);
int rnd_pos(uchar * buf, uchar *pos);
void position(const uchar *record);
int info(uint);
int extra(enum ha_extra_function operation);
int reset();
int external_lock(THD *thd, int lock_type);
int delete_all_rows(void);
int reset_auto_increment(ulonglong value);
int disable_indexes(uint mode);
int enable_indexes(uint mode);
int indexes_are_disabled(void);
ha_rows records_in_range(uint inx, key_range *min_key, key_range *max_key);
int delete_table(const char *from);
void drop_table(const char *name);
int rename_table(const char * from, const char * to);
int create(const char *name, TABLE *form, HA_CREATE_INFO *create_info);
void update_create_info(HA_CREATE_INFO *create_info);

THR_LOCK_DATA **store_lock(THD *thd, THR_LOCK_DATA **to,
enum thr_lock_type lock_type);
int cmp_ref(const uchar *ref1, const uchar *ref2)
{
return memcmp(ref1, ref2, sizeof(HEAP_PTR));
}
bool check_if_incompatible_data(HA_CREATE_INFO *info, uint table_changes);
private:
void update_key_stats();
};

转载于:https://www.cnblogs.com/bigshuai/archive/2012/02/22/2362699.html

-rw------- 1 Ruby Ruby 198 Jun 19 03:22 backup_label.old drwx------ 8 Ruby Ruby 4096 Jun 19 03:22 base -rw------- 1 Ruby Ruby 0 Jun 19 03:22 build_completed.done -rw------- 1 Ruby Ruby 1310 Jun 19 03:14 cacert.pem drwx------ 4 Ruby Ruby 4096 Jun 19 03:22 dbe_perf_standby -rw------- 1 Ruby Ruby 72 Jul 13 21:37 disable_conn_file -rw------- 1 Ruby Ruby 1 Jul 14 03:13 disc_readonly_test -rw------- 1 Ruby Ruby 56 Jun 19 03:22 full_backup_label -rw------- 1 Ruby Ruby 44905 Jun 19 22:00 gaussdb.conf -rw------- 1 Ruby Ruby 44905 Jun 19 22:00 gaussdb.conf.bak -rw------- 1 Ruby Ruby 1024 Jun 19 03:18 gaussdb.conf.lock -rw------- 1 Ruby Ruby 44905 Jun 19 22:00 gaussdb.conf.wal.bak drwx------ 3 Ruby Ruby 20480 Jul 11 03:27 global -rw------- 1 Ruby Ruby 1 Jun 19 03:22 gs_build.pid drwx------ 2 Ruby Ruby 4096 Jun 19 03:23 gs_esn -rw------- 1 Ruby Ruby 354 Jun 19 03:18 gs_gazelle.conf -rw------- 1 Ruby Ruby 5480 Jun 19 03:37 gs_hba.conf -rw------- 1 Ruby Ruby 5480 Jun 19 03:37 gs_hba.conf.bak -rw------- 1 Ruby Ruby 1024 Jun 19 03:22 gs_hba.conf.lock -rw------- 1 Ruby Ruby 1669 Jun 19 03:23 gs_ident.conf drwx------ 2 Ruby Ruby 4096 Jun 19 03:23 gs_license drwx------ 2 Ruby Ruby 4096 Jul 13 21:37 gs_local_barriers -rw------- 1 Ruby Ruby 1048577 Jul 11 03:27 gs_shared_mem_kpi.meta -rw------- 1 Ruby Ruby 4915200 Jun 19 03:22 gswlm_userinfo.cfg drwx------ 2 Ruby Ruby 4096 Jun 19 03:22 hotpatch -rw------- 1 Ruby Ruby 4 Jul 13 21:37 logger_file -rw------- 1 Ruby Ruby 48 Jun 19 03:22 paxosinfo -rw------- 1 Ruby Ruby 48 Jun 19 03:22 paxosinfo.backup drwx------ 2 Ruby Ruby 4096 Jul 13 21:37 pg_cbm drwx------ 2 Ruby Ruby 4096 Jun 19 03:22 pg_clog drwx------ 2 Ruby Ruby 4096 Jun 19 03:22 pg_csnlog -rw------- 1 Ruby Ruby 0 Jul 14 02:43 pg_ctl.lock drwx------ 2 Ruby Ruby 4096 Jun 19 03:22 pg_errorinfo drwx------ 4 Ruby Ruby 4096 Jun 19 03:22 pg_llog drwx------ 2 Ruby Ruby 4096 Jun 19 03:18 pg_location drwx------ 2 Ruby Ruby 4096 Jun 19 03:22 pg_logical drwx------ 4 Ruby Ruby 4096 Jun 19 03:22 pg_multixact drwx------ 2 Ruby Ruby 4096 Jul 11 03:27 pg_notify drwx------ 5 Ruby Ruby 4096 Jul 13 21:37 pg_replslot drwx------ 2 Ruby Ruby 4096 Jun 19 03:22 pg_serial drwx------ 2 Ruby Ruby 4096 Jun 19 03:22 pg_snapshots drwx------ 2 Ruby Ruby 4096 Jul 13 21:38 pg_stat_tmp drwx------ 2 Ruby Ruby 4096 Jun 19 03:22 pg_tblspc drwx------ 2 Ruby Ruby 4096 Jun 19 03:22 pg_twophase -rw------- 1 Ruby Ruby 4 Jun 19 03:22 PG_VERSION drwx------ 3 Ruby Ruby 4096 Jul 13 21:37 pg_xlog -rw------- 1 Ruby Ruby 115 Jul 13 21:37 postmaster.opts -rw------- 1 Ruby Ruby 0 Jun 19 03:22 postmaster.pid.lock -rw------- 1 Ruby Ruby 10 Jun 19 03:22 rewind_lable -rw------- 1 Ruby Ruby 4372 Jun 19 03:14 server.crt -rw------- 1 Ruby Ruby 1766 Jun 19 03:14 server.key -rw------- 1 Ruby Ruby 56 Jun 19 03:18 server.key.cipher -rw------- 1 Ruby Ruby 24 Jun 19 03:18 server.key.rand -rw------- 1 Ruby Ruby 4 Jul 13 21:37 term_file drwx------ 5 Ruby Ruby 4096 Jun 19 03:22 undo
07-15
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值