Loading storage/csv/ha_tina.cc +0 −91 Original line number Diff line number Diff line Loading @@ -764,77 +764,6 @@ int ha_tina::delete_row(const byte * buf) DBUG_RETURN(0); } /* Fill buf with value from key. Simply this is used for a single index read with a key. */ int ha_tina::index_read(byte * buf, const byte * key, uint key_len __attribute__((unused)), enum ha_rkey_function find_flag __attribute__((unused))) { DBUG_ENTER("ha_tina::index_read"); DBUG_ASSERT(0); DBUG_RETURN(HA_ADMIN_NOT_IMPLEMENTED); } /* Fill buf with value from key. Simply this is used for a single index read with a key. Whatever the current key is we will use it. This is what will be in "index". */ int ha_tina::index_read_idx(byte * buf, uint index, const byte * key, uint key_len __attribute__((unused)), enum ha_rkey_function find_flag __attribute__((unused))) { DBUG_ENTER("ha_tina::index_read_idx"); DBUG_ASSERT(0); DBUG_RETURN(HA_ADMIN_NOT_IMPLEMENTED); } /* Read the next position in the index. */ int ha_tina::index_next(byte * buf) { DBUG_ENTER("ha_tina::index_next"); DBUG_ASSERT(0); DBUG_RETURN(HA_ADMIN_NOT_IMPLEMENTED); } /* Read the previous position in the index. */ int ha_tina::index_prev(byte * buf) { DBUG_ENTER("ha_tina::index_prev"); DBUG_ASSERT(0); DBUG_RETURN(HA_ADMIN_NOT_IMPLEMENTED); } /* Read the first position in the index */ int ha_tina::index_first(byte * buf) { DBUG_ENTER("ha_tina::index_first"); DBUG_ASSERT(0); DBUG_RETURN(HA_ADMIN_NOT_IMPLEMENTED); } /* Read the last position in the index With this we don't need to do a filesort() with index. We just read the last row and call previous. */ int ha_tina::index_last(byte * buf) { DBUG_ENTER("ha_tina::index_last"); DBUG_ASSERT(0); DBUG_RETURN(HA_ADMIN_NOT_IMPLEMENTED); } /* All table scans call this first. Loading Loading @@ -975,17 +904,6 @@ int ha_tina::extra(enum ha_extra_function operation) DBUG_RETURN(0); } /* This is no longer used. */ int ha_tina::reset(void) { DBUG_ENTER("ha_tina::reset"); ha_tina::extra(HA_EXTRA_RESET); DBUG_RETURN(0); } /* Called after each table scan. In particular after deletes, and updates. In the last case we employ chain of deleted Loading Loading @@ -1063,15 +981,6 @@ int ha_tina::delete_all_rows() DBUG_RETURN(rc); } /* Always called by the start of a transaction (or by "lock tables"); */ int ha_tina::external_lock(THD *thd, int lock_type) { DBUG_ENTER("ha_tina::external_lock"); DBUG_RETURN(0); // No external locking } /* Called by the database to lock the table. Keep in mind that this is an internal lock. Loading storage/csv/ha_tina.h +0 −10 Original line number Diff line number Diff line Loading @@ -113,14 +113,6 @@ class ha_tina: public handler int write_row(byte * buf); int update_row(const byte * old_data, byte * new_data); int delete_row(const byte * buf); int index_read(byte * buf, const byte * key, uint key_len, enum ha_rkey_function find_flag); int index_read_idx(byte * buf, uint idx, const byte * key, uint key_len, enum ha_rkey_function find_flag); int index_next(byte * buf); int index_prev(byte * buf); int index_first(byte * buf); int index_last(byte * buf); int rnd_init(bool scan=1); int rnd_next(byte *buf); int rnd_pos(byte * buf, byte *pos); Loading @@ -128,8 +120,6 @@ class ha_tina: public handler void position(const byte *record); void info(uint); int extra(enum ha_extra_function operation); int reset(void); int external_lock(THD *thd, int lock_type); int delete_all_rows(void); int create(const char *name, TABLE *form, HA_CREATE_INFO *create_info); Loading Loading
storage/csv/ha_tina.cc +0 −91 Original line number Diff line number Diff line Loading @@ -764,77 +764,6 @@ int ha_tina::delete_row(const byte * buf) DBUG_RETURN(0); } /* Fill buf with value from key. Simply this is used for a single index read with a key. */ int ha_tina::index_read(byte * buf, const byte * key, uint key_len __attribute__((unused)), enum ha_rkey_function find_flag __attribute__((unused))) { DBUG_ENTER("ha_tina::index_read"); DBUG_ASSERT(0); DBUG_RETURN(HA_ADMIN_NOT_IMPLEMENTED); } /* Fill buf with value from key. Simply this is used for a single index read with a key. Whatever the current key is we will use it. This is what will be in "index". */ int ha_tina::index_read_idx(byte * buf, uint index, const byte * key, uint key_len __attribute__((unused)), enum ha_rkey_function find_flag __attribute__((unused))) { DBUG_ENTER("ha_tina::index_read_idx"); DBUG_ASSERT(0); DBUG_RETURN(HA_ADMIN_NOT_IMPLEMENTED); } /* Read the next position in the index. */ int ha_tina::index_next(byte * buf) { DBUG_ENTER("ha_tina::index_next"); DBUG_ASSERT(0); DBUG_RETURN(HA_ADMIN_NOT_IMPLEMENTED); } /* Read the previous position in the index. */ int ha_tina::index_prev(byte * buf) { DBUG_ENTER("ha_tina::index_prev"); DBUG_ASSERT(0); DBUG_RETURN(HA_ADMIN_NOT_IMPLEMENTED); } /* Read the first position in the index */ int ha_tina::index_first(byte * buf) { DBUG_ENTER("ha_tina::index_first"); DBUG_ASSERT(0); DBUG_RETURN(HA_ADMIN_NOT_IMPLEMENTED); } /* Read the last position in the index With this we don't need to do a filesort() with index. We just read the last row and call previous. */ int ha_tina::index_last(byte * buf) { DBUG_ENTER("ha_tina::index_last"); DBUG_ASSERT(0); DBUG_RETURN(HA_ADMIN_NOT_IMPLEMENTED); } /* All table scans call this first. Loading Loading @@ -975,17 +904,6 @@ int ha_tina::extra(enum ha_extra_function operation) DBUG_RETURN(0); } /* This is no longer used. */ int ha_tina::reset(void) { DBUG_ENTER("ha_tina::reset"); ha_tina::extra(HA_EXTRA_RESET); DBUG_RETURN(0); } /* Called after each table scan. In particular after deletes, and updates. In the last case we employ chain of deleted Loading Loading @@ -1063,15 +981,6 @@ int ha_tina::delete_all_rows() DBUG_RETURN(rc); } /* Always called by the start of a transaction (or by "lock tables"); */ int ha_tina::external_lock(THD *thd, int lock_type) { DBUG_ENTER("ha_tina::external_lock"); DBUG_RETURN(0); // No external locking } /* Called by the database to lock the table. Keep in mind that this is an internal lock. Loading
storage/csv/ha_tina.h +0 −10 Original line number Diff line number Diff line Loading @@ -113,14 +113,6 @@ class ha_tina: public handler int write_row(byte * buf); int update_row(const byte * old_data, byte * new_data); int delete_row(const byte * buf); int index_read(byte * buf, const byte * key, uint key_len, enum ha_rkey_function find_flag); int index_read_idx(byte * buf, uint idx, const byte * key, uint key_len, enum ha_rkey_function find_flag); int index_next(byte * buf); int index_prev(byte * buf); int index_first(byte * buf); int index_last(byte * buf); int rnd_init(bool scan=1); int rnd_next(byte *buf); int rnd_pos(byte * buf, byte *pos); Loading @@ -128,8 +120,6 @@ class ha_tina: public handler void position(const byte *record); void info(uint); int extra(enum ha_extra_function operation); int reset(void); int external_lock(THD *thd, int lock_type); int delete_all_rows(void); int create(const char *name, TABLE *form, HA_CREATE_INFO *create_info); Loading