summaryrefslogtreecommitdiff
path: root/sql/ha_archive.h
diff options
context:
space:
mode:
authorunknown <brian@zim.(none)>2006-01-09 02:35:40 -0800
committerunknown <brian@zim.(none)>2006-01-09 02:35:40 -0800
commit6d8f89b8c22c034cea4df2aac4170aa7da8d3ba5 (patch)
tree8db7228601f217c993b06975e2cca60a949fe7ba /sql/ha_archive.h
parent67a6dd9fb9a50e6adf31d3af9872ade3a6a79fb6 (diff)
downloadmariadb-git-6d8f89b8c22c034cea4df2aac4170aa7da8d3ba5.tar.gz
This changeset adds support for autoincrements to archive. It allows it to have them with both unique and non-unique indexes.
Test cases will come in the next push (just doing this one so I can get a couple of reviews in). This is not the final patch. sql/field.h: Added val_int() method similar to the one like val_str() that will allow you to pop in another pointer and do a test. sql/ha_archive.cc: Adds auto_increment support to archive. Cleans up a number of other small items. sql/ha_archive.h: More additions for support of autoincrements
Diffstat (limited to 'sql/ha_archive.h')
-rw-r--r--sql/ha_archive.h22
1 files changed, 17 insertions, 5 deletions
diff --git a/sql/ha_archive.h b/sql/ha_archive.h
index 7b957060f34..ec30ca7c10f 100644
--- a/sql/ha_archive.h
+++ b/sql/ha_archive.h
@@ -18,6 +18,7 @@
#pragma interface /* gcc class implementation */
#endif
+#include <values.h>
#include <zlib.h>
#include "../storage/archive/azlib.h"
@@ -38,13 +39,14 @@ typedef struct st_archive_share {
bool dirty; /* Flag for if a flush should occur */
bool crashed; /* Meta file is crashed */
ha_rows rows_recorded; /* Number of rows in tables */
+ ulonglong auto_increment_value;
} ARCHIVE_SHARE;
/*
Version for file format.
1 - Initial Version
*/
-#define ARCHIVE_VERSION 1
+#define ARCHIVE_VERSION 2
class ha_archive: public handler
{
@@ -68,13 +70,22 @@ public:
const char **bas_ext() const;
ulong table_flags() const
{
- return (HA_REC_NOT_IN_SEQ | HA_NOT_EXACT_COUNT | HA_NO_AUTO_INCREMENT |
+ return (HA_REC_NOT_IN_SEQ | HA_NOT_EXACT_COUNT |
HA_FILE_BASED | HA_CAN_INSERT_DELAYED | HA_CAN_GEOMETRY);
}
ulong index_flags(uint idx, uint part, bool all_parts) const
{
- return 0;
+ return HA_ONLY_WHOLE_INDEX;
}
+ ulonglong get_auto_increment();
+ uint max_supported_keys() const { return 1; }
+ uint max_supported_key_length() const { return sizeof(ulonglong); }
+ uint max_supported_key_part_length() const { return sizeof(ulonglong); }
+ int index_init(uint keynr, bool sorted);
+ virtual int index_read(byte * buf, const byte * key,
+ uint key_len, enum ha_rkey_function find_flag);
+ virtual int index_read_idx(byte * buf, uint index, const byte * key,
+ uint key_len, enum ha_rkey_function find_flag);
int open(const char *name, int mode, uint test_if_locked);
int close(void);
int write_row(byte * buf);
@@ -84,8 +95,9 @@ public:
int rnd_next(byte *buf);
int rnd_pos(byte * buf, byte *pos);
int get_row(azio_stream *file_to_read, byte *buf);
- int read_meta_file(File meta_file, ha_rows *rows);
- int write_meta_file(File meta_file, ha_rows rows, bool dirty);
+ int read_meta_file(File meta_file, ha_rows *rows, ulonglong *auto_increment);
+ int write_meta_file(File meta_file, ha_rows rows,
+ ulonglong auto_increment, bool dirty);
ARCHIVE_SHARE *get_share(const char *table_name, TABLE *table);
int free_share(ARCHIVE_SHARE *share);
bool auto_repair() const { return 1; } // For the moment we just do this