/* Copyright (C) 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; either version 2 of the License, or (at your option) any later version. 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 */ /* Definitions needed for myisamchk/mariachk.c */ /* Entries marked as "QQ to be removed" are NOT used to pass check/repair options to xxx_check.c. They are used internally by xxxchk.c or/and ha_xxxx.cc and should NOT be stored together with other flags. They should be removed from the following list to make addition of new flags possible. */ #ifndef _myisamchk_h #define _myisamchk_h #define T_AUTO_INC 1 #define T_AUTO_REPAIR 2 /* QQ to be removed */ #define T_BACKUP_DATA 4 #define T_CALC_CHECKSUM 8 #define T_CHECK 16 #define T_CHECK_ONLY_CHANGED 32 #define T_CREATE_MISSING_KEYS 64 #define T_DESCRIPT 128 #define T_DONT_CHECK_CHECKSUM 256 #define T_EXTEND 512 #define T_FAST (1L << 10) #define T_FORCE_CREATE (1L << 11) #define T_FORCE_UNIQUENESS (1L << 12) #define T_INFO (1L << 13) #define T_MEDIUM (1L << 14) #define T_QUICK (1L << 15) #define T_READONLY (1L << 16) #define T_REP (1L << 17) #define T_REP_BY_SORT (1L << 18) #define T_REP_PARALLEL (1L << 19) #define T_RETRY_WITHOUT_QUICK (1L << 20) #define T_SAFE_REPAIR (1L << 21) #define T_SILENT (1L << 22) #define T_SORT_INDEX (1L << 23) #define T_SORT_RECORDS (1L << 24) #define T_STATISTICS (1L << 25) #define T_UNPACK (1L << 26) #define T_UPDATE_STATE (1L << 27) #define T_VERBOSE (1L << 28) #define T_VERY_SILENT (1L << 29) #define T_WAIT_FOREVER (1L << 30) #define T_WRITE_LOOP ((ulong) 1L << 31) #define T_ZEROFILL ((ulonglong) 1L << 32) #define T_ZEROFILL_KEEP_LSN ((ulonglong) 1L << 33) /** If repair should not bump create_rename_lsn */ #define T_NO_CREATE_RENAME_LSN ((ulonglong) 1L << 34) #define T_CREATE_UNIQUE_BY_SORT ((ulonglong) 1L << 35) #define T_SUPPRESS_ERR_HANDLING ((ulonglong) 1L << 36) #define T_FORCE_SORT_MEMORY ((ulonglong) 1L << 37) #define T_REP_ANY (T_REP | T_REP_BY_SORT | T_REP_PARALLEL) /* Flags used by xxxxchk.c or/and ha_xxxx.cc that are NOT passed to xxxcheck.c follows: */ #define TT_USEFRM 1 #define TT_FOR_UPGRADE 2 /* Bits set in out_flag */ #define O_NEW_DATA 2 #define O_DATA_LOST 4 typedef struct st_sort_key_blocks /* Used when sorting */ { uchar *buff, *end_pos; uchar lastkey[HA_MAX_POSSIBLE_KEY_BUFF]; uint last_length; int inited; } SORT_KEY_BLOCKS; /* MARIA/MYISAM supports several statistics collection methods. Currently statistics collection method is not stored in MARIA file and has to be specified for each table analyze/repair operation in MI_CHECK::stats_method. */ typedef enum { /* Treat NULLs as inequal when collecting statistics (default for 4.1/5.0) */ MI_STATS_METHOD_NULLS_NOT_EQUAL, /* Treat NULLs as equal when collecting statistics (like 4.0 did) */ MI_STATS_METHOD_NULLS_EQUAL, /* Ignore NULLs - count only tuples without NULLs in the index components */ MI_STATS_METHOD_IGNORE_NULLS } enum_handler_stats_method; typedef struct st_handler_check_param { char *isam_file_name; MY_TMPDIR *tmpdir; void *thd; const char *db_name, *table_name, *op_name; ulonglong auto_increment_value; ulonglong max_data_file_length; ulonglong keys_in_use; ulonglong max_record_length; /* The next two are used to collect statistics, see update_key_parts for description. */ ulonglong unique_count[HA_MAX_KEY_SEG + 1]; ulonglong notnull_count[HA_MAX_KEY_SEG + 1]; my_off_t search_after_block; my_off_t new_file_pos, key_file_blocks; my_off_t keydata, totaldata, key_blocks, start_check_pos; my_off_t used, empty, splits, del_length, link_used, lost; ha_rows total_records, total_deleted, records,del_blocks; ha_rows full_page_count, tail_count; ha_checksum record_checksum, glob_crc; ha_checksum key_crc[HA_MAX_POSSIBLE_KEY]; ha_checksum tmp_key_crc[HA_MAX_POSSIBLE_KEY]; ha_checksum tmp_record_checksum; ulonglong org_key_map; ulonglong testflag; /* Following is used to check if rows are visible */ ulonglong max_trid, max_found_trid; ulonglong not_visible_rows_found; ulonglong sort_buffer_length; ulonglong use_buffers; /* Used as param to getopt() */ size_t read_buffer_length, write_buffer_length, sort_key_blocks; time_t backup_time; /* To sign backup files */ ulong rec_per_key_part[HA_MAX_KEY_SEG * HA_MAX_POSSIBLE_KEY]; double new_rec_per_key_part[HA_MAX_KEY_SEG * HA_MAX_POSSIBLE_KEY]; uint out_flag, warning_printed, error_printed, note_printed, verbose; uint opt_sort_key, total_files, max_level; uint key_cache_block_size, pagecache_block_size; int tmpfile_createflag, err_count; myf myf_rw; uint16 language; my_bool using_global_keycache, opt_lock_memory, opt_follow_links; my_bool retry_repair, force_sort, calc_checksum, static_row_size; char temp_filename[FN_REFLEN]; IO_CACHE read_cache; enum_handler_stats_method stats_method; /* For reporting progress */ uint stage, max_stage; uint progress_counter; /* How often to call _report_progress() */ ulonglong progress, max_progress; mysql_mutex_t print_msg_mutex; my_bool need_print_msg_lock; myf malloc_flags; } HA_CHECK; typedef struct st_sort_ftbuf { uchar *buf, *end; int count; uchar lastkey[HA_MAX_KEY_BUFF]; } SORT_FT_BUF; typedef struct st_buffpek { my_off_t file_pos; /* Where we are in the sort file */ uchar *base, *key; /* Key pointers */ ha_rows count; /* Number of rows in table */ ha_rows mem_count; /* Numbers of keys in memory */ ha_rows max_keys; /* Max keys in buffert */ } BUFFPEK; #endif /* _myisamchk_h */