/* Copyright (C) 2000 MySQL AB & MySQL Finland AB & TCX DataKonsult 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 */ /* Structs that defines the TABLE */ class Item; /* Needed by ORDER */ class GRANT_TABLE; class st_select_lex_unit; /* Order clause list element */ typedef struct st_order { struct st_order *next; Item **item; /* Point at item in select fields */ bool asc; /* true if ascending */ bool free_me; /* true if item isn't shared */ bool in_field_list; /* true if in select field list */ Field *field; /* If tmp-table group */ char *buff; /* If tmp-table group */ table_map used,depend_map; } ORDER; typedef struct st_grant_info { GRANT_TABLE *grant_table; uint version; ulong privilege; ulong want_privilege; } GRANT_INFO; enum tmp_table_type {NO_TMP_TABLE=0, TMP_TABLE=1, TRANSACTIONAL_TMP_TABLE=2}; typedef struct st_filesort_info { IO_CACHE *io_cache; /* If sorted through filebyte */ byte *addon_buf; /* Pointer to a buffer if sorted with fields */ uint addon_length; /* Length of the buffer */ struct st_sort_addon_field *addon_field; /* Pointer to the fields info */ void (*unpack)(struct st_sort_addon_field *, byte *); /* To unpack back */ byte *record_pointers; /* If sorted in memory */ ha_rows found_records; /* How many records in sort */ } FILESORT_INFO; /* Table key cache assignment descriptor */ /* In future the similar structure is to be used for an assignment of an index to a key cache: the index name will be added. The name of the database catalog will be added as well. The descriptors for the current assignments are put in the assignment cache: assign_cache. If a table is not found in the cache it is considered assigned to the default key cache. */ typedef struct st_key_cache_asmt { char *db_name; /* db the table belongs to */ char *table_name; /* the name of the table */ char *table_key; /* key for the assignment cache */ uint key_length; /* the length of this key */ struct st_key_cache_var *key_cache; /* reference to the key cache */ struct st_key_cache_asmt **prev; /* links in the chain all assignments */ struct st_key_cache_asmt *next; /* to this cache */ struct st_my_thread_var *queue; /* queue of requests for assignment */ uint requests; /* number of current requests */ bool to_reassign; /* marked when reassigning all cache */ bool triggered; /* marked when assignment is triggered*/ } KEY_CACHE_ASMT; /* Table cache entry struct */ class Field_timestamp; class Field_blob; struct st_table { handler *file; KEY_CACHE_VAR *key_cache; /* Ref to the key cache the table assigned to*/ KEY_CACHE_ASMT *key_cache_asmt;/* Only when opened for key cache assignment */ Field **field; /* Pointer to fields */ Field_blob **blob_field; /* Pointer to blob fields */ HASH name_hash; /* hash of field names */ byte *record[2]; /* Pointer to records */ byte *default_values; /* Record with default values for INSERT */ byte *insert_values; /* used by INSERT ... UPDATE */ uint fields; /* field count */ uint reclength; /* Recordlength */ uint rec_buff_length; uint keys,key_parts,primary_key,max_key_length,max_unique_length; uint total_key_length; uint uniques; uint null_fields; /* number of null fields */ uint blob_fields; /* number of blob fields */ key_map keys_in_use, keys_for_keyread, read_only_keys; key_map quick_keys, used_keys, keys_in_use_for_query; KEY *key_info; /* data of keys in database */ TYPELIB keynames; /* Pointers to keynames */ ha_rows max_rows; /* create information */ ha_rows min_rows; /* create information */ ulong avg_row_length; /* create information */ ulong raid_chunksize; TYPELIB fieldnames; /* Pointer to fieldnames */ TYPELIB *intervals; /* pointer to interval info */ enum db_type db_type; /* table_type for handler */ enum row_type row_type; /* How rows are stored */ uint db_create_options; /* Create options from database */ uint db_options_in_use; /* Options in use */ uint db_record_offset; /* if HA_REC_IN_SEQ */ uint db_stat; /* mode of file as in handler.h */ uint raid_type,raid_chunks; uint status; /* Used by postfix.. */ uint system; /* Set if system record */ ulong time_stamp; /* Set to offset+1 of record */ uint timestamp_field_offset; uint next_number_index; uint blob_ptr_size; /* 4 or 8 */ uint next_number_key_offset; int current_lock; /* Type of lock on table */ enum tmp_table_type tmp_table; my_bool copy_blobs; /* copy_blobs when storing */ my_bool null_row; /* All columns are null */ my_bool maybe_null,outer_join; /* Used with OUTER JOIN */ my_bool force_index; my_bool distinct,const_table,no_rows; my_bool key_read, bulk_insert; my_bool crypted; my_bool db_low_byte_first; /* Portable row format */ my_bool locked_by_flush; my_bool locked_by_name; my_bool fulltext_searched; my_bool crashed; my_bool is_view; my_bool no_keyread; my_bool clear_query_id; /* To reset query_id for tables and cols */ my_bool auto_increment_field_not_null; Field *next_number_field, /* Set if next_number is activated */ *found_next_number_field, /* Set on open */ *rowid_field; Field_timestamp *timestamp_field; my_string comment; /* Comment about table */ CHARSET_INFO *table_charset; /* Default charset of string fields */ REGINFO reginfo; /* field connections */ MEM_ROOT mem_root; GRANT_INFO grant; char *table_cache_key; char *table_name,*real_name,*path; uint key_length; /* Length of key */ uint tablenr,used_fields,null_bytes; table_map map; /* ID bit of table (1,2,4,8,16...) */ ulong version,flush_version; uchar *null_flags; FILESORT_INFO sort; ORDER *group; ha_rows quick_rows[MAX_KEY]; uint quick_key_parts[MAX_KEY]; key_part_map const_key_parts[MAX_KEY]; ulong query_id; union /* Temporary variables */ { uint temp_pool_slot; /* Used by intern temp tables */ struct st_table_list *pos_in_table_list; }; /* number of select if it is derived table */ uint derived_select_number; THD *in_use; /* Which thread uses this */ struct st_table *next,*prev; }; #define JOIN_TYPE_LEFT 1 #define JOIN_TYPE_RIGHT 2 typedef struct st_table_list { struct st_table_list *next; char *db, *alias, *real_name; char *option; /* Used by cache index */ Item *on_expr; /* Used with outer join */ struct st_table_list *natural_join; /* natural join on this table*/ /* ... join ... USE INDEX ... IGNORE INDEX */ List *use_index, *ignore_index; TABLE *table; /* opened table */ st_table_list *table_list; /* pointer to node of list of all tables */ class st_select_lex_unit *derived; /* SELECT_LEX_UNIT of derived table */ GRANT_INFO grant; thr_lock_type lock_type; uint outer_join; /* Which join type */ uint shared; /* Used in union or in multi-upd */ uint32 db_length, real_name_length; bool straight; /* optimize with prev table */ bool updating; /* for replicate-do/ignore table */ bool force_index; /* Prefer index over table scan */ bool ignore_leaves; /* Preload only non-leaf nodes */ } TABLE_LIST; typedef struct st_changed_table_list { struct st_changed_table_list *next; char *key; uint32 key_length; } CHANGED_TABLE_LIST; typedef struct st_open_table_list { struct st_open_table_list *next; char *db,*table; uint32 in_use,locked; } OPEN_TABLE_LIST;