table.h 37.7 KB
Newer Older
unknown's avatar
unknown committed
1
/* Copyright (C) 2000-2006 MySQL AB
unknown's avatar
unknown committed
2

unknown's avatar
unknown committed
3 4
   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
unknown's avatar
unknown committed
5
   the Free Software Foundation; version 2 of the License.
unknown's avatar
unknown committed
6

unknown's avatar
unknown committed
7 8 9 10
   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.
unknown's avatar
unknown committed
11

unknown's avatar
unknown committed
12 13 14 15 16 17 18 19
   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 */
unknown's avatar
unknown committed
20
class Item_subselect;
unknown's avatar
unknown committed
21
class GRANT_TABLE;
22
class st_select_lex_unit;
unknown's avatar
VIEW  
unknown committed
23
class st_select_lex;
24
class partition_info;
unknown's avatar
unknown committed
25
class COND_EQUAL;
26
class Security_context;
unknown's avatar
unknown committed
27 28 29 30 31 32

/* Order clause list element */

typedef struct st_order {
  struct st_order *next;
  Item	 **item;			/* Point at item in select fields */
unknown's avatar
unknown committed
33
  Item	 *item_ptr;			/* Storage for initial item */
34
  Item   **item_copy;			/* For SPs; the original item ptr */
35 36
  int    counter;                       /* position in SELECT list, correct
                                           only if counter_used is true*/
unknown's avatar
unknown committed
37 38 39
  bool	 asc;				/* true if ascending */
  bool	 free_me;			/* true if item isn't shared  */
  bool	 in_field_list;			/* true if in select field list */
40
  bool   counter_used;                  /* parameter was counter of columns */
unknown's avatar
unknown committed
41 42
  Field  *field;			/* If tmp-table group */
  char	 *buff;				/* If tmp-table group */
43
  table_map used, depend_map;
unknown's avatar
unknown committed
44 45 46 47 48 49
} ORDER;

typedef struct st_grant_info
{
  GRANT_TABLE *grant_table;
  uint version;
unknown's avatar
unknown committed
50 51
  ulong privilege;
  ulong want_privilege;
52 53 54 55 56
  /*
    Stores the requested access acl of top level tables list. Is used to
    check access rights to the underlying tables of a view.
  */
  ulong orig_want_privilege;
unknown's avatar
unknown committed
57 58
} GRANT_INFO;

unknown's avatar
unknown committed
59 60 61 62 63
enum tmp_table_type
{
  NO_TMP_TABLE, TMP_TABLE, TRANSACTIONAL_TMP_TABLE,
  INTERNAL_TMP_TABLE, SYSTEM_TMP_TABLE
};
unknown's avatar
unknown committed
64

65 66 67 68 69 70 71
enum frm_type_enum
{
  FRMTYPE_ERROR= 0,
  FRMTYPE_TABLE,
  FRMTYPE_VIEW
};

unknown's avatar
unknown committed
72 73
enum release_type { RELEASE_NORMAL, RELEASE_WAIT_FOR_DROP };

unknown's avatar
unknown committed
74 75 76
typedef struct st_filesort_info
{
  IO_CACHE *io_cache;           /* If sorted through filebyte                */
unknown's avatar
unknown committed
77 78 79
  uchar   **sort_keys;          /* Buffer for sorting keys                   */
  byte     *buffpek;            /* Buffer for buffpek structures             */
  uint      buffpek_len;        /* Max number of buffpeks in the buffer      */
unknown's avatar
unknown committed
80 81 82 83 84 85 86 87
  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;

unknown's avatar
unknown committed
88

89
/*
90 91 92 93 94 95 96 97
  Values in this enum are used to indicate how a tables TIMESTAMP field
  should be treated. It can be set to the current timestamp on insert or
  update or both.
  WARNING: The values are used for bit operations. If you change the
  enum, you must keep the bitwise relation of the values. For example:
  (int) TIMESTAMP_AUTO_SET_ON_BOTH must be equal to
  (int) TIMESTAMP_AUTO_SET_ON_INSERT | (int) TIMESTAMP_AUTO_SET_ON_UPDATE.
  We use an enum here so that the debugger can display the value names.
98 99 100 101 102 103
*/
enum timestamp_auto_set_type
{
  TIMESTAMP_NO_AUTO_SET= 0, TIMESTAMP_AUTO_SET_ON_INSERT= 1,
  TIMESTAMP_AUTO_SET_ON_UPDATE= 2, TIMESTAMP_AUTO_SET_ON_BOTH= 3
};
104 105
#define clear_timestamp_auto_bits(_target_, _bits_) \
  (_target_)= (enum timestamp_auto_set_type)((int)(_target_) & ~(int)(_bits_))
106

unknown's avatar
unknown committed
107 108
class Field_timestamp;
class Field_blob;
109
class Table_triggers_list;
unknown's avatar
unknown committed
110

unknown's avatar
unknown committed
111 112 113 114
/*
  This structure is shared between different table objects. There is one
  instance of table share per one table in the database.
*/
115 116 117

typedef struct st_table_share
{
118
  st_table_share() {}                    /* Remove gcc warning */
unknown's avatar
unknown committed
119
  /* hash of field names (contains pointers to elements of field array) */
120 121
  HASH	name_hash;			/* hash of field names */
  MEM_ROOT mem_root;
unknown's avatar
unknown committed
122 123 124
  TYPELIB keynames;			/* Pointers to keynames */
  TYPELIB fieldnames;			/* Pointer to fieldnames */
  TYPELIB *intervals;			/* pointer to interval info */
125 126
  pthread_mutex_t mutex;                /* For locking the share  */
  pthread_cond_t cond;			/* To signal that share is ready */
unknown's avatar
unknown committed
127 128 129
  struct st_table_share *next,		/* Link to unused shares */
    **prev;
#ifdef NOT_YET
130
  struct st_table *open_tables;		/* link to open tables */
unknown's avatar
unknown committed
131 132
#endif

133 134
  /* The following is copied to each TABLE on OPEN */
  Field **field;
unknown's avatar
unknown committed
135 136
  Field **found_next_number_field;
  Field *timestamp_field;               /* Used only during open */
137 138
  KEY  *key_info;			/* data of keys in database */
  uint	*blob_field;			/* Index to blobs in Field arrray*/
unknown's avatar
unknown committed
139

140
  byte	*default_values;		/* row with default values */
141
  LEX_STRING comment;			/* Comment about table */
142 143
  CHARSET_INFO *table_charset;		/* Default charset of string fields */

144
  MY_BITMAP all_set;
145 146 147 148 149 150 151 152 153 154
  /*
    Key which is used for looking-up table in table cache and in the list
    of thread's temporary tables. Has the form of:
      "database_name\0table_name\0" + optional part for temporary tables.

    Note that all three 'table_cache_key', 'db' and 'table_name' members
    must be set (and be non-zero) for tables in table cache. They also
    should correspond to each other.
    To ensure this one can use set_table_cache() methods.
  */
unknown's avatar
unknown committed
155 156 157 158 159
  LEX_STRING table_cache_key;
  LEX_STRING db;                        /* Pointer to db */
  LEX_STRING table_name;                /* Table name (for open) */
  LEX_STRING path;                	/* Path to .frm file (from datadir) */
  LEX_STRING normalized_path;		/* unpack_filename(path) */
160
  LEX_STRING connect_string;
161 162 163 164 165 166

  /* 
     Set of keys in use, implemented as a Bitmap.
     Excludes keys disabled by ALTER TABLE ... DISABLE KEYS.
  */
  key_map keys_in_use;
167
  key_map keys_for_keyread;
unknown's avatar
unknown committed
168
  ha_rows min_rows, max_rows;		/* create information */
169 170
  ulong   avg_row_length;		/* create information */
  ulong   raid_chunksize;
171
  ulong   version, mysql_version;
172 173 174
  ulong   timestamp_offset;		/* Set to offset+1 of record */
  ulong   reclength;			/* Recordlength */

unknown's avatar
unknown committed
175
  handlerton *db_type;			/* table_type for handler */
unknown's avatar
unknown committed
176
  enum row_type row_type;		/* How rows are stored */
177 178
  enum tmp_table_type tmp_table;

unknown's avatar
unknown committed
179 180
  uint ref_count;                       /* How many TABLE objects uses this */
  uint open_count;			/* Number of tables in open list */
181
  uint blob_ptr_size;			/* 4 or 8 */
182
  uint key_block_size;			/* create key_block_size, if used */
unknown's avatar
unknown committed
183
  uint null_bytes, last_null_bit_pos;
184 185 186 187 188 189 190
  uint fields;				/* Number of fields */
  uint rec_buff_length;                 /* Size of table->record[] buffer */
  uint keys, key_parts;
  uint max_key_length, max_unique_length, total_key_length;
  uint uniques;                         /* Number of UNIQUE index */
  uint null_fields;			/* number of null fields */
  uint blob_fields;			/* number of blob fields */
unknown's avatar
unknown committed
191
  uint timestamp_field_offset;		/* Field number for timestamp field */
192
  uint varchar_fields;                  /* number of varchar fields */
unknown's avatar
unknown committed
193 194 195
  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 */
196
  uint raid_type, raid_chunks;
unknown's avatar
unknown committed
197
  uint rowid_field_offset;		/* Field_nr +1 to rowid field */
198 199 200 201
  /* Index of auto-updated TIMESTAMP field in field array */
  uint primary_key;
  uint next_number_index;
  uint next_number_key_offset;
unknown's avatar
unknown committed
202
  uint error, open_errno, errarg;       /* error from open_table_def() */
203
  uint column_bitmap_size;
unknown's avatar
unknown committed
204 205 206 207 208 209 210 211 212
  uchar frm_version;
  bool null_field_first;
  bool system;                          /* Set if system table (one record) */
  bool crypted;                         /* If .frm file is crypted */
  bool db_low_byte_first;		/* Portable row format */
  bool crashed;
  bool is_view;
  bool name_lock, replace_with_name_lock;
  bool waiting_on_cond;                 /* Protection against free */
213 214
  ulong table_map_id;                   /* for row-based replication */
  ulonglong table_map_version;
215 216 217 218 219 220 221 222 223

  /*
    Cache for row-based replication table share checks that does not
    need to be repeated. Possible values are: -1 when cache value is
    not calculated yet, 0 when table *shall not* be replicated, 1 when
    table *may* be replicated.
  */
  int cached_row_logging_check;

224 225 226 227 228 229
  /*
    TRUE if this is a system table like 'mysql.proc', which we want to be
    able to open and lock even when we already have some tables open and
    locked. To avoid deadlocks we have to put certain restrictions on
    locking of this table for writing. FALSE - otherwise.
  */
unknown's avatar
unknown committed
230
  bool system_table;
231 232 233 234 235
  /*
    This flag is set for the log tables. Used during FLUSH instances to skip
    log tables, while closing tables (since logs must be always available)
  */
  bool log_table;
unknown's avatar
unknown committed
236
#ifdef WITH_PARTITION_STORAGE_ENGINE
237
  bool auto_partitioned;
unknown's avatar
unknown committed
238 239
  const uchar *partition_info;
  uint  partition_info_len;
unknown's avatar
unknown committed
240 241
  const uchar *part_state;
  uint part_state_len;
unknown's avatar
unknown committed
242
  handlerton *default_part_db_type;
unknown's avatar
unknown committed
243
#endif
244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297


  /*
    Set share's table cache key and update its db and table name appropriately.

    SYNOPSIS
      set_table_cache_key()
        key_buff    Buffer with already built table cache key to be
                    referenced from share.
        key_length  Key length.

    NOTES
      Since 'key_buff' buffer will be referenced from share it should has same
      life-time as share itself.
      This method automatically ensures that TABLE_SHARE::table_name/db have
      appropriate values by using table cache key as their source.
  */

  void set_table_cache_key(char *key_buff, uint key_length)
  {
    table_cache_key.str= key_buff;
    table_cache_key.length= key_length;
    /*
      Let us use the fact that the key is "db/0/table_name/0" + optional
      part for temporary tables.
    */
    db.str=            table_cache_key.str;
    db.length=         strlen(db.str);
    table_name.str=    db.str + db.length + 1;
    table_name.length= strlen(table_name.str);
  }


  /*
    Set share's table cache key and update its db and table name appropriately.

    SYNOPSIS
      set_table_cache_key()
        key_buff    Buffer to be used as storage for table cache key
                    (should be at least key_length bytes).
        key         Value for table cache key.
        key_length  Key length.

    NOTE
      Since 'key_buff' buffer will be used as storage for table cache key
      it should has same life-time as share itself.
  */

  void set_table_cache_key(char *key_buff, const char *key, uint key_length)
  {
    memcpy(key_buff, key, key_length);
    set_table_cache_key(key_buff, key_length);
  }

298 299 300 301 302 303
} TABLE_SHARE;


/* Information for one open table */

struct st_table {
304 305
  st_table() {}                               /* Remove gcc warning */

306 307 308 309 310
  TABLE_SHARE	*s;
  handler	*file;
#ifdef NOT_YET
  struct st_table *used_next, **used_prev;	/* Link to used tables */
#endif
unknown's avatar
unknown committed
311
  struct st_table *open_next, **open_prev;	/* Link to open tables */
312 313 314 315 316 317
  struct st_table *next, *prev;

  THD	*in_use;                        /* Which thread uses this */
  Field **field;			/* Pointer to fields */

  byte *record[2];			/* Pointer to records */
318 319
  byte *write_row_record;		/* Used as optimisation in
					   THD::write_row */
320
  byte *insert_values;                  /* used by INSERT ... UPDATE */
321 322 323 324
  key_map quick_keys, used_keys;

  /*
    A set of keys that can be used in the query that references this
325
    table.
326 327 328 329 330 331 332 333 334 335

    All indexes disabled on the table's TABLE_SHARE (see TABLE::s) will be 
    subtracted from this set upon instantiation. Thus for any TABLE t it holds
    that t.keys_in_use_for_query is a subset of t.s.keys_in_use. Generally we 
    must not introduce any new keys here (see setup_tables).

    The set is implemented as a bitmap.
  */
  key_map keys_in_use_for_query;
  key_map merge_keys;
336 337
  KEY  *key_info;			/* data of keys in database */

unknown's avatar
unknown committed
338 339
  Field *next_number_field;		/* Set if next_number is activated */
  Field *found_next_number_field;	/* Set on open */
340 341 342 343 344 345 346 347
  Field_timestamp *timestamp_field;

  /* Table's triggers, 0 if there are no of them */
  Table_triggers_list *triggers;
  struct st_table_list *pos_in_table_list;/* Element referring to this table */
  ORDER		*group;
  const char	*alias;            	  /* alias or table name */
  uchar		*null_flags;
348 349 350
  my_bitmap_map	*bitmap_init_value;
  MY_BITMAP     def_read_set, def_write_set, tmp_set; /* containers */
  MY_BITMAP     *read_set, *write_set;          /* Active column sets */
351
  query_id_t	query_id;
352

353 354 355 356
  /* 
    For each key that has quick_keys.is_set(key) == TRUE: estimate of #records
    and max #key parts that range access would use.
  */
357
  ha_rows	quick_rows[MAX_KEY];
358 359

  /* Bitmaps of key parts that =const for the entire join. */
360
  key_part_map  const_key_parts[MAX_KEY];
361

362
  uint		quick_key_parts[MAX_KEY];
363
  uint		quick_n_ranges[MAX_KEY];
unknown's avatar
unknown committed
364

365 366 367 368 369 370 371 372 373 374
  /* 
    Estimate of number of records that satisfy SARGable part of the table
    condition, or table->file->records if no SARGable condition could be
    constructed.
    This value is used by join optimizer as an estimate of number of records
    that will pass the table condition (condition that depends on fields of 
    this table and constants)
  */
  ha_rows       quick_condition_rows;

375 376 377 378 379 380 381 382 383 384 385
  /*
    If this table has TIMESTAMP field with auto-set property (pointed by
    timestamp_field member) then this variable indicates during which
    operations (insert only/on update/in both cases) we should set this
    field to current timestamp. If there are no such field in this table
    or we should not automatically set its value during execution of current
    statement then the variable contains TIMESTAMP_NO_AUTO_SET (i.e. 0).

    Value of this variable is set for each statement in open_table() and
    if needed cleared later in statement processing code (see mysql_update()
    as example).
unknown's avatar
unknown committed
386
  */
387
  timestamp_auto_set_type timestamp_field_type;
388
  table_map	map;                    /* ID bit of table (1,2,4,8,16...) */
389 390 391 392

  uint          lock_position;          /* Position in MYSQL_LOCK.table */
  uint          lock_data_start;        /* Start pos. in MYSQL_LOCK.locks */
  uint          lock_count;             /* Number of locks */
393 394 395 396 397 398 399
  uint		tablenr,used_fields;
  uint          temp_pool_slot;		/* Used by intern temp tables */
  uint		status;                 /* What's in record[0] */
  uint		db_stat;		/* mode of file as in handler.h */
  /* number of select if it is derived table */
  uint          derived_select_number;
  int		current_lock;           /* Type of lock on table */
unknown's avatar
unknown committed
400
  my_bool copy_blobs;			/* copy_blobs when storing */
401 402

  /*
403 404 405 406 407
    0 or JOIN_TYPE_{LEFT|RIGHT}. Currently this is only compared to 0.
    If maybe_null !=0, this table is inner w.r.t. some outer join operation,
    and null_row may be true.
  */
  uint maybe_null;
unknown's avatar
unknown committed
408
  /*
409 410
    If true, the current table row is considered to have all columns set to 
    NULL, including columns declared as "not null" (see maybe_null).
unknown's avatar
unknown committed
411 412
  */
  my_bool null_row;
413
  my_bool force_index;
414
  my_bool distinct,const_table,no_rows;
415
  my_bool key_read, no_keyread;
unknown's avatar
unknown committed
416
  my_bool locked_by_flush;
417
  my_bool locked_by_logger;
unknown's avatar
unknown committed
418
  my_bool locked_by_name;
unknown's avatar
unknown committed
419
  my_bool fulltext_searched;
420 421 422
  my_bool no_cache;
  /* To signal that we should reset query_id for tables and cols */
  my_bool clear_query_id;
unknown's avatar
unknown committed
423
  my_bool auto_increment_field_not_null;
424
  my_bool insert_or_update;             /* Can be used by the handler */
unknown's avatar
unknown committed
425
  my_bool alias_name_used;		/* true if table_name is alias */
426
  my_bool get_fields_in_item_tree;      /* Signal to fix_field */
427

unknown's avatar
unknown committed
428 429 430
  REGINFO reginfo;			/* field connections */
  MEM_ROOT mem_root;
  GRANT_INFO grant;
unknown's avatar
unknown committed
431
  FILESORT_INFO sort;
unknown's avatar
unknown committed
432 433
#ifdef WITH_PARTITION_STORAGE_ENGINE
  partition_info *part_info;            /* Partition related information */
434
  bool no_partitions_used; /* If true, all partitions have been pruned away */
unknown's avatar
unknown committed
435
#endif
436 437 438

  bool fill_item_list(List<Item> *item_list) const;
  void reset_item_list(List<Item> *item_list) const;
439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471
  void clear_column_bitmaps(void);
  void prepare_for_position(void);
  void mark_columns_used_by_index_no_reset(uint index, MY_BITMAP *map);
  void mark_columns_used_by_index(uint index);
  void restore_column_maps_after_mark_index();
  void mark_auto_increment_column(void);
  void mark_columns_needed_for_update(void);
  void mark_columns_needed_for_delete(void);
  void mark_columns_needed_for_insert(void);
  inline void column_bitmaps_set(MY_BITMAP *read_set_arg,
                                 MY_BITMAP *write_set_arg)
  {
    read_set= read_set_arg;
    write_set= write_set_arg;
    if (file)
      file->column_bitmaps_signal();
  }
  inline void column_bitmaps_set_no_signal(MY_BITMAP *read_set_arg,
                                           MY_BITMAP *write_set_arg)
  {
    read_set= read_set_arg;
    write_set= write_set_arg;
  }
  inline void use_all_columns()
  {
    column_bitmaps_set(&s->all_set, &s->all_set);
  }
  inline void default_column_bitmaps()
  {
    read_set= &def_read_set;
    write_set= &def_write_set;
  }

unknown's avatar
unknown committed
472 473
};

474 475 476 477 478 479
enum enum_schema_table_state
{ 
  NOT_PROCESSED= 0,
  PROCESSED_BY_CREATE_SORT_INDEX,
  PROCESSED_BY_JOIN_EXEC
};
unknown's avatar
unknown committed
480

481 482 483 484 485
typedef struct st_foreign_key_info
{
  LEX_STRING *forein_id;
  LEX_STRING *referenced_db;
  LEX_STRING *referenced_table;
486 487
  LEX_STRING *update_method;
  LEX_STRING *delete_method;
488
  LEX_STRING *referenced_key_name;
489 490 491 492
  List<LEX_STRING> foreign_fields;
  List<LEX_STRING> referenced_fields;
} FOREIGN_KEY_INFO;

unknown's avatar
unknown committed
493 494 495
/*
  Make sure that the order of schema_tables and enum_schema_tables are the same.
*/
496 497 498

enum enum_schema_tables
{
499 500 501 502 503
  SCH_CHARSETS= 0,
  SCH_COLLATIONS,
  SCH_COLLATION_CHARACTER_SET_APPLICABILITY,
  SCH_COLUMNS,
  SCH_COLUMN_PRIVILEGES,
unknown's avatar
unknown committed
504
  SCH_ENGINES,
505
  SCH_EVENTS,
unknown's avatar
unknown committed
506
  SCH_FILES,
507 508
  SCH_GLOBAL_STATUS,
  SCH_GLOBAL_VARIABLES,
509 510
  SCH_KEY_COLUMN_USAGE,
  SCH_OPEN_TABLES,
511
  SCH_PARTITIONS,
unknown's avatar
unknown committed
512
  SCH_PLUGINS,
513
  SCH_PROCESSLIST,
514
  SCH_REFERENTIAL_CONSTRAINTS,
515 516 517
  SCH_PROCEDURES,
  SCH_SCHEMATA,
  SCH_SCHEMA_PRIVILEGES,
518 519
  SCH_SESSION_STATUS,
  SCH_SESSION_VARIABLES,
520 521 522 523 524 525 526
  SCH_STATISTICS,
  SCH_STATUS,
  SCH_TABLES,
  SCH_TABLE_CONSTRAINTS,
  SCH_TABLE_NAMES,
  SCH_TABLE_PRIVILEGES,
  SCH_TRIGGERS,
527
  SCH_USER_PRIVILEGES,
528
  SCH_VARIABLES,
529
  SCH_VIEWS
530 531 532 533 534 535 536 537 538 539 540 541 542
};


typedef struct st_field_info
{
  const char* field_name;
  uint field_length;
  enum enum_field_types field_type;
  int value;
  bool maybe_null;
  const char* old_name;
} ST_FIELD_INFO;

543

544 545 546 547 548 549 550 551
struct st_table_list;
typedef class Item COND;

typedef struct st_schema_table
{
  const char* table_name;
  ST_FIELD_INFO *fields_info;
  /* Create information_schema table */
552
  TABLE *(*create_table)  (THD *thd, struct st_table_list *table_list);
553 554 555 556 557
  /* Fill table with data */
  int (*fill_table) (THD *thd, struct st_table_list *tables, COND *cond);
  /* Handle fileds for old SHOW */
  int (*old_format) (THD *thd, struct st_schema_table *schema_table);
  int (*process_table) (THD *thd, struct st_table_list *tables,
unknown's avatar
unknown committed
558
                        TABLE *table, bool res, const char *base_name,
559 560
                        const char *file_name);
  int idx_field1, idx_field2; 
561
  bool hidden;
562 563 564
} ST_SCHEMA_TABLE;


565 566 567
#define JOIN_TYPE_LEFT	1
#define JOIN_TYPE_RIGHT	2

568 569 570
#define VIEW_ALGORITHM_UNDEFINED        0
#define VIEW_ALGORITHM_TMPTABLE         1
#define VIEW_ALGORITHM_MERGE            2
unknown's avatar
VIEW  
unknown committed
571

572 573 574 575
#define VIEW_SUID_INVOKER               0
#define VIEW_SUID_DEFINER               1
#define VIEW_SUID_DEFAULT               2

unknown's avatar
unknown committed
576
/* view WITH CHECK OPTION parameter options */
unknown's avatar
unknown committed
577 578 579 580
#define VIEW_CHECK_NONE       0
#define VIEW_CHECK_LOCAL      1
#define VIEW_CHECK_CASCADED   2

unknown's avatar
unknown committed
581 582 583 584 585
/* result of view WITH CHECK OPTION parameter check */
#define VIEW_CHECK_OK         0
#define VIEW_CHECK_ERROR      1
#define VIEW_CHECK_SKIP       2

unknown's avatar
VIEW  
unknown committed
586
struct st_lex;
587
class select_union;
588
class TMP_TABLE_PARAM;
589

590 591 592
Item *create_view_field(THD *thd, st_table_list *view, Item **field_ref,
                        const char *name);

593 594 595 596 597
struct Field_translator
{
  Item *item;
  const char *name;
};
unknown's avatar
VIEW  
unknown committed
598

599

unknown's avatar
unknown committed
600 601 602 603 604 605
/*
  Column reference of a NATURAL/USING join. Since column references in
  joins can be both from views and stored tables, may point to either a
  Field (for tables), or a Field_translator (for views).
*/

606
class Natural_join_column: public Sql_alloc
unknown's avatar
unknown committed
607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663
{
public:
  Field_translator *view_field;  /* Column reference of merge view. */
  Field            *table_field; /* Column reference of table or temp view. */
  st_table_list *table_ref; /* Original base table/view reference. */
  /*
    True if a common join column of two NATURAL/USING join operands. Notice
    that when we have a hierarchy of nested NATURAL/USING joins, a column can
    be common at some level of nesting but it may not be common at higher
    levels of nesting. Thus this flag may change depending on at which level
    we are looking at some column.
  */
  bool is_common;
public:
  Natural_join_column(Field_translator *field_param, st_table_list *tab);
  Natural_join_column(Field *field_param, st_table_list *tab);
  const char *name();
  Item *create_item(THD *thd);
  Field *field();
  const char *table_name();
  const char *db_name();
  GRANT_INFO *grant();
};


/*
  Table reference in the FROM clause.

  These table references can be of several types that correspond to
  different SQL elements. Below we list all types of TABLE_LISTs with
  the necessary conditions to determine when a TABLE_LIST instance
  belongs to a certain type.

  1) table (TABLE_LIST::view == NULL)
     - base table
       (TABLE_LIST::derived == NULL)
     - subquery - TABLE_LIST::table is a temp table
       (TABLE_LIST::derived != NULL)
     - information schema table
       (TABLE_LIST::schema_table != NULL)
       NOTICE: for schema tables TABLE_LIST::field_translation may be != NULL
  2) view (TABLE_LIST::view != NULL)
     - merge    (TABLE_LIST::effective_algorithm == VIEW_ALGORITHM_MERGE)
           also (TABLE_LIST::field_translation != NULL)
     - tmptable (TABLE_LIST::effective_algorithm == VIEW_ALGORITHM_TMPTABLE)
           also (TABLE_LIST::field_translation == NULL)
  3) nested table reference (TABLE_LIST::nested_join != NULL)
     - table sequence - e.g. (t1, t2, t3)
       TODO: how to distinguish from a JOIN?
     - general JOIN
       TODO: how to distinguish from a table sequence?
     - NATURAL JOIN
       (TABLE_LIST::natural_join != NULL)
       - JOIN ... USING
         (TABLE_LIST::join_using_fields != NULL)
*/

664 665
typedef struct st_table_list
{
666
  st_table_list() {}                          /* Remove gcc warning */
unknown's avatar
unknown committed
667 668 669 670 671
  /*
    List of tables local to a subquery (used by SQL_LIST). Considers
    views as leaves (unlike 'next_leaf' below). Created at parse time
    in st_select_lex::add_table_to_list() -> table_list.link_in_list().
  */
unknown's avatar
VIEW  
unknown committed
672 673 674
  struct st_table_list *next_local;
  /* link in a global list of all queries tables */
  struct st_table_list *next_global, **prev_global;
675
  char		*db, *alias, *table_name, *schema_table_name;
676
  char          *option;                /* Used by cache index  */
677
  Item		*on_expr;		/* Used with outer join */
678
  /*
unknown's avatar
unknown committed
679
    The structure of ON expression presented in the member above
680 681 682 683 684 685 686
    can be changed during certain optimizations. This member
    contains a snapshot of AND-OR structure of the ON expression
    made after permanent transformations of the parse tree, and is
    used to restore ON clause before every reexecution of a prepared
    statement or stored procedure.
  */
  Item          *prep_on_expr;
unknown's avatar
unknown committed
687
  COND_EQUAL    *cond_equal;            /* Used with outer join */
unknown's avatar
unknown committed
688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720
  /*
    During parsing - left operand of NATURAL/USING join where 'this' is
    the right operand. After parsing (this->natural_join == this) iff
    'this' represents a NATURAL or USING join operation. Thus after
    parsing 'this' is a NATURAL/USING join iff (natural_join != NULL).
  */
  struct st_table_list *natural_join;
  /*
    True if 'this' represents a nested join that is a NATURAL JOIN.
    For one of the operands of 'this', the member 'natural_join' points
    to the other operand of 'this'.
  */
  bool is_natural_join;
  /* Field names in a USING clause for JOIN ... USING. */
  List<String> *join_using_fields;
  /*
    Explicitly store the result columns of either a NATURAL/USING join or
    an operand of such a join.
  */
  List<Natural_join_column> *join_columns;
  /* TRUE if join_columns contains all columns of this table reference. */
  bool is_join_columns_complete;

  /*
    List of nodes in a nested join tree, that should be considered as
    leaves with respect to name resolution. The leaves are: views,
    top-most nodes representing NATURAL/USING joins, subqueries, and
    base tables. All of these TABLE_LIST instances contain a
    materialized list of columns. The list is local to a subquery.
  */
  struct st_table_list *next_name_resolution_table;
  /* Index names in a "... JOIN ... USE/IGNORE INDEX ..." clause. */
  List<String> *use_index, *ignore_index;
721 722
  TABLE        *table;                          /* opened table */
  uint          table_id; /* table id (from binlog) for opened table */
unknown's avatar
unknown committed
723 724 725 726 727
  /*
    select_result for derived table to pass it from table creation to table
    filling procedure
  */
  select_union  *derived_result;
unknown's avatar
VIEW  
unknown committed
728 729 730 731 732 733 734 735 736
  /*
    Reference from aux_tables to local list entry of main select of
    multi-delete statement:
    delete t1 from t2,t1 where t1.a<'B' and t2.b=t1.b;
    here it will be reference of first occurrence of t1 to second (as you
    can see this lists can't be merged)
  */
  st_table_list	*correspondent_table;
  st_select_lex_unit *derived;		/* SELECT_LEX_UNIT of derived table */
737 738
  ST_SCHEMA_TABLE *schema_table;        /* Information_schema table */
  st_select_lex	*schema_select_lex;
unknown's avatar
unknown committed
739 740 741 742
  /*
    True when the view field translation table is used to convert
    schema table fields for backwards compatibility with SHOW command.
  */
743
  bool schema_table_reformed;
744
  TMP_TABLE_PARAM *schema_table_param;
unknown's avatar
VIEW  
unknown committed
745 746 747
  /* link to select_lex where this table was used */
  st_select_lex	*select_lex;
  st_lex	*view;			/* link on VIEW lex for merging */
748
  Field_translator *field_translation;	/* array of VIEW fields */
749 750
  /* pointer to element after last one in translation table above */
  Field_translator *field_translation_end;
751 752 753 754 755 756 757 758 759 760 761 762
  /*
    List (based on next_local) of underlying tables of this view. I.e. it
    does not include the tables of subqueries used in the view. Is set only
    for merged views.
  */
  st_table_list	*merge_underlying_list;
  /*
    - 0 for base tables
    - in case of the view it is the list of all (not only underlying
    tables but also used in subquery ones) tables of the view.
  */
  List<st_table_list> *view_tables;
763 764
  /* most upper view this table belongs to */
  st_table_list	*belong_to_view;
765 766 767 768 769 770
  /*
    The view directly referencing this table
    (non-zero only for merged underlying tables of a view).
  */
  st_table_list	*referencing_view;
  /*
unknown's avatar
unknown committed
771 772
    Security  context (non-zero only for tables which belong
    to view with SQL SECURITY DEFINER)
773 774 775
  */
  Security_context *security_ctx;
  /*
unknown's avatar
unknown committed
776 777
    This view security context (non-zero only for views with
    SQL SECURITY DEFINER)
778 779
  */
  Security_context *view_sctx;
unknown's avatar
unknown committed
780 781 782 783 784
  /*
    List of all base tables local to a subquery including all view
    tables. Unlike 'next_local', this in this list views are *not*
    leaves. Created in setup_tables() -> make_leaves_list().
  */
785
  bool allowed_show;
786
  st_table_list	*next_leaf;
unknown's avatar
VIEW  
unknown committed
787
  Item          *where;                 /* VIEW WHERE clause condition */
unknown's avatar
unknown committed
788
  Item          *check_option;          /* WITH CHECK OPTION condition */
unknown's avatar
VIEW  
unknown committed
789
  LEX_STRING	query;			/* text of (CRETE/SELECT) statement */
790
  LEX_STRING	md5;			/* md5 of query text */
unknown's avatar
VIEW  
unknown committed
791
  LEX_STRING	source;			/* source of CREATE VIEW */
792 793
  LEX_STRING	view_db;		/* saved view database */
  LEX_STRING	view_name;		/* saved view name */
unknown's avatar
VIEW  
unknown committed
794
  LEX_STRING	timestamp;		/* GMT time stamp of last operation */
795
  st_lex_user   definer;                /* definer of view */
unknown's avatar
VIEW  
unknown committed
796
  ulonglong	file_version;		/* version of file's field set */
unknown's avatar
unknown committed
797
  ulonglong     updatable_view;         /* VIEW can be updated */
unknown's avatar
VIEW  
unknown committed
798 799
  ulonglong	revision;		/* revision control number */
  ulonglong	algorithm;		/* 0 any, 1 tmp tables , 2 merging */
800
  ulonglong     view_suid;              /* view is suid (TRUE dy default) */
unknown's avatar
unknown committed
801
  ulonglong     with_check;             /* WITH CHECK OPTION */
802 803 804 805 806
  /*
    effective value of WITH CHECK OPTION (differ for temporary table
    algorithm)
  */
  uint8         effective_with_check;
807
  uint8         effective_algorithm;    /* which algorithm was really used */
unknown's avatar
VIEW  
unknown committed
808
  GRANT_INFO	grant;
unknown's avatar
unknown committed
809 810 811 812
  /* data need by some engines in query cache*/
  ulonglong     engine_data;
  /* call back function for asking handler about caching in query cache */
  qc_engine_callback callback_func;
813
  thr_lock_type lock_type;
814
  uint		outer_join;		/* Which join type */
unknown's avatar
unknown committed
815
  uint		shared;			/* Used in multi-upd */
816 817
  uint          db_length;
  uint32        table_name_length;
818
  bool          updatable;		/* VIEW/TABLE can be updated now */
819 820
  bool		straight;		/* optimize with prev table */
  bool          updating;               /* for replicate-do/ignore table */
821 822 823
  bool		force_index;		/* prefer index over table scan */
  bool          ignore_leaves;          /* preload only non-leaf nodes */
  table_map     dep_tables;             /* tables the table depends on      */
824
  table_map     on_expr_dep_tables;     /* tables on expression depends on  */
825 826
  struct st_nested_join *nested_join;   /* if the element is a nested join  */
  st_table_list *embedding;             /* nested join containing the table */
827
  List<struct st_table_list> *join_list;/* join list the table belongs to   */
unknown's avatar
unknown committed
828
  bool		cacheable_table;	/* stop PS caching */
829
  /* used in multi-upd/views privilege check */
unknown's avatar
VIEW  
unknown committed
830 831
  bool		table_in_first_from_clause;
  bool		skip_temporary;		/* this table shouldn't be temporary */
832
  /* TRUE if this merged view contain auto_increment field */
unknown's avatar
VIEW  
unknown committed
833
  bool          contain_auto_increment;
unknown's avatar
unknown committed
834
  bool          multitable_view;        /* TRUE iff this is multitable view */
835
  bool          compact_view_format;    /* Use compact format for SHOW CREATE VIEW */
836 837
  /* view where processed */
  bool          where_processed;
838 839
  /* FRMTYPE_ERROR if any type is acceptable */
  enum frm_type_enum required_type;
unknown's avatar
unknown committed
840
  handlerton	*db_type;		/* table_type for handler */
unknown's avatar
VIEW  
unknown committed
841
  char		timestamp_buffer[20];	/* buffer for timestamp (19+1) */
842 843 844 845 846
  /*
    This TABLE_LIST object is just placeholder for prelocking, it will be
    used for implicit LOCK TABLES only and won't be used in real statement.
  */
  bool          prelocking_placeholder;
847

848
  enum enum_schema_table_state schema_table_state;
unknown's avatar
VIEW  
unknown committed
849
  void calc_md5(char *buffer);
850
  void set_underlying_merge();
unknown's avatar
unknown committed
851
  int view_check_option(THD *thd, bool ignore_failure);
852
  bool setup_underlying(THD *thd);
unknown's avatar
unknown committed
853
  void cleanup_items();
unknown's avatar
VIEW  
unknown committed
854
  bool placeholder() {return derived || view; }
855
  void print(THD *thd, String *str);
unknown's avatar
unknown committed
856 857
  bool check_single_table(st_table_list **table, table_map map,
                          st_table_list *view);
858
  bool set_insert_values(MEM_ROOT *mem_root);
859
  void hide_view_error(THD *thd);
860
  st_table_list *find_underlying_table(TABLE *table);
unknown's avatar
unknown committed
861 862 863
  st_table_list *first_leaf_for_name_resolution();
  st_table_list *last_leaf_for_name_resolution();
  bool is_leaf_for_name_resolution();
864 865
  inline st_table_list *top_table()
    { return belong_to_view ? belong_to_view : this; }
866 867 868 869 870 871 872 873 874 875 876 877 878 879
  inline bool prepare_check_option(THD *thd)
  {
    bool res= FALSE;
    if (effective_with_check)
      res= prep_check_option(thd, effective_with_check);
    return res;
  }
  inline bool prepare_where(THD *thd, Item **conds,
                            bool no_where_clause)
  {
    if (effective_algorithm == VIEW_ALGORITHM_MERGE)
      return prep_where(thd, conds, no_where_clause);
    return FALSE;
  }
880 881 882 883 884 885 886

  void register_want_access(ulong want_access);
  bool prepare_security(THD *thd);
#ifndef NO_EMBEDDED_ACCESS_CHECKS
  Security_context *find_view_security_context(THD *thd);
  bool prepare_view_securety_context(THD *thd);
#endif
887 888 889 890 891
  /*
    Cleanup for re-execution in a prepared statement or a stored
    procedure.
  */
  void reinit_before_use(THD *thd);
unknown's avatar
unknown committed
892
  Item_subselect *containing_subselect();
893

894 895 896
private:
  bool prep_check_option(THD *thd, uint8 check_opt_type);
  bool prep_where(THD *thd, Item **conds, bool no_where_clause);
897 898 899 900
  /*
    Cleanup for re-execution in a prepared statement or a stored
    procedure.
  */
unknown's avatar
unknown committed
901
} TABLE_LIST;
902

unknown's avatar
VIEW  
unknown committed
903 904
class Item;

unknown's avatar
unknown committed
905 906 907 908
/*
  Iterator over the fields of a generic table reference.
*/

unknown's avatar
VIEW  
unknown committed
909 910 911
class Field_iterator: public Sql_alloc
{
public:
912
  Field_iterator() {}                         /* Remove gcc warning */
unknown's avatar
VIEW  
unknown committed
913 914 915
  virtual ~Field_iterator() {}
  virtual void set(TABLE_LIST *)= 0;
  virtual void next()= 0;
916
  virtual bool end_of_fields()= 0;              /* Return 1 at end of list */
unknown's avatar
VIEW  
unknown committed
917
  virtual const char *name()= 0;
918
  virtual Item *create_item(THD *)= 0;
unknown's avatar
VIEW  
unknown committed
919 920 921 922
  virtual Field *field()= 0;
};


unknown's avatar
unknown committed
923 924 925 926 927
/* 
  Iterator over the fields of a base table, view with temporary
  table, or subquery.
*/

unknown's avatar
VIEW  
unknown committed
928 929 930 931 932 933 934 935
class Field_iterator_table: public Field_iterator
{
  Field **ptr;
public:
  Field_iterator_table() :ptr(0) {}
  void set(TABLE_LIST *table) { ptr= table->table->field; }
  void set_table(TABLE *table) { ptr= table->field; }
  void next() { ptr++; }
936
  bool end_of_fields() { return *ptr == 0; }
unknown's avatar
VIEW  
unknown committed
937
  const char *name();
938
  Item *create_item(THD *thd);
unknown's avatar
VIEW  
unknown committed
939 940 941 942
  Field *field() { return *ptr; }
};


unknown's avatar
unknown committed
943 944
/* Iterator over the fields of a merge view. */

unknown's avatar
VIEW  
unknown committed
945 946
class Field_iterator_view: public Field_iterator
{
947
  Field_translator *ptr, *array_end;
948
  TABLE_LIST *view;
unknown's avatar
VIEW  
unknown committed
949 950 951 952
public:
  Field_iterator_view() :ptr(0), array_end(0) {}
  void set(TABLE_LIST *table);
  void next() { ptr++; }
953
  bool end_of_fields() { return ptr == array_end; }
unknown's avatar
VIEW  
unknown committed
954
  const char *name();
955
  Item *create_item(THD *thd);
unknown's avatar
unknown committed
956
  Item **item_ptr() {return &ptr->item; }
unknown's avatar
VIEW  
unknown committed
957
  Field *field() { return 0; }
958
  inline Item *item() { return ptr->item; }
unknown's avatar
unknown committed
959 960 961 962 963 964 965 966 967 968 969
  Field_translator *field_translator() { return ptr; }
};


/*
  Field_iterator interface to the list of materialized fields of a
  NATURAL/USING join.
*/

class Field_iterator_natural_join: public Field_iterator
{
970
  List_iterator_fast<Natural_join_column> column_ref_it;
unknown's avatar
unknown committed
971 972
  Natural_join_column *cur_column_ref;
public:
973 974
  Field_iterator_natural_join() :cur_column_ref(NULL) {}
  ~Field_iterator_natural_join() {}
unknown's avatar
unknown committed
975
  void set(TABLE_LIST *table);
976
  void next();
unknown's avatar
unknown committed
977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020
  bool end_of_fields() { return !cur_column_ref; }
  const char *name() { return cur_column_ref->name(); }
  Item *create_item(THD *thd) { return cur_column_ref->create_item(thd); }
  Field *field() { return cur_column_ref->field(); }
  Natural_join_column *column_ref() { return cur_column_ref; }
};


/*
  Generic iterator over the fields of an arbitrary table reference.

  DESCRIPTION
    This class unifies the various ways of iterating over the columns
    of a table reference depending on the type of SQL entity it
    represents. If such an entity represents a nested table reference,
    this iterator encapsulates the iteration over the columns of the
    members of the table reference.

  IMPLEMENTATION
    The implementation assumes that all underlying NATURAL/USING table
    references already contain their result columns and are linked into
    the list TABLE_LIST::next_name_resolution_table.
*/

class Field_iterator_table_ref: public Field_iterator
{
  TABLE_LIST *table_ref, *first_leaf, *last_leaf;
  Field_iterator_table        table_field_it;
  Field_iterator_view         view_field_it;
  Field_iterator_natural_join natural_join_it;
  Field_iterator *field_it;
  void set_field_iterator();
public:
  Field_iterator_table_ref() :field_it(NULL) {}
  void set(TABLE_LIST *table);
  void next();
  bool end_of_fields()
  { return (table_ref == last_leaf && field_it->end_of_fields()); }
  const char *name() { return field_it->name(); }
  const char *table_name();
  const char *db_name();
  GRANT_INFO *grant();
  Item *create_item(THD *thd) { return field_it->create_item(thd); }
  Field *field() { return field_it->field(); }
unknown's avatar
unknown committed
1021
  Natural_join_column *get_or_create_column_ref(TABLE_LIST *parent_table_ref);
1022
  Natural_join_column *get_natural_column_ref();
unknown's avatar
VIEW  
unknown committed
1023 1024
};

1025

1026 1027 1028 1029
typedef struct st_nested_join
{
  List<TABLE_LIST>  join_list;       /* list of elements in the nested join */
  table_map         used_tables;     /* bitmap of tables in the nested join */
1030
  table_map         not_null_tables; /* tables that rejects nulls           */
1031
  struct st_join_table *first_nested;/* the first nested table in the plan  */
1032 1033 1034 1035 1036 1037 1038 1039 1040
  /* 
    Used to count tables in the nested join in 2 isolated places:
    1. In make_outerjoin_info(). 
    2. check_interleaving_with_nj/restore_prev_nj_state (these are called
       by the join optimizer. 
    Before each use the counters are zeroed by reset_nj_counters.
  */
  uint              counter;
  nested_join_map   nj_map;          /* Bit used to identify this nested join*/
1041
} NESTED_JOIN;
1042

1043

1044 1045
typedef struct st_changed_table_list
{
1046
  struct	st_changed_table_list *next;
1047
  char		*key;
1048 1049 1050
  uint32        key_length;
} CHANGED_TABLE_LIST;

1051

1052
typedef struct st_open_table_list{
1053 1054 1055 1056
  struct st_open_table_list *next;
  char	*db,*table;
  uint32 in_use,locked;
} OPEN_TABLE_LIST;
unknown's avatar
unknown committed
1057

1058 1059 1060 1061 1062 1063 1064
typedef struct st_table_field_w_type
{
  LEX_STRING name;
  LEX_STRING type;
  LEX_STRING cset;
} TABLE_FIELD_W_TYPE;

unknown's avatar
unknown committed
1065

1066
my_bool
1067
table_check_intact(TABLE *table, const uint table_f_count,
unknown's avatar
unknown committed
1068
                   const TABLE_FIELD_W_TYPE *table_def,
1069
                   time_t *last_create_time, int error_num);
1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104

static inline my_bitmap_map *tmp_use_all_columns(TABLE *table,
                                                 MY_BITMAP *bitmap)
{
  my_bitmap_map *old= bitmap->bitmap;
  bitmap->bitmap= table->s->all_set.bitmap;
  return old;
}


static inline void tmp_restore_column_map(MY_BITMAP *bitmap,
                                          my_bitmap_map *old)
{
  bitmap->bitmap= old;
}

/* The following is only needed for debugging */

static inline my_bitmap_map *dbug_tmp_use_all_columns(TABLE *table,
                                                      MY_BITMAP *bitmap)
{
#ifndef DBUG_OFF
  return tmp_use_all_columns(table, bitmap);
#else
  return 0;
#endif
}

static inline void dbug_tmp_restore_column_map(MY_BITMAP *bitmap,
                                               my_bitmap_map *old)
{
#ifndef DBUG_OFF
  tmp_restore_column_map(bitmap, old);
#endif
}