sql_class.h 74.9 KB
Newer Older
1
/* Copyright (C) 2000-2006 MySQL AB
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
2

bk@work.mysql.com's avatar
bk@work.mysql.com 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
5
   the Free Software Foundation; version 2 of the License.
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
6

bk@work.mysql.com's avatar
bk@work.mysql.com 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.
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
11

bk@work.mysql.com's avatar
bk@work.mysql.com committed
12 13 14 15 16 17 18
   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 */


/* Classes in mysql */

19
#ifdef USE_PRAGMA_INTERFACE
bk@work.mysql.com's avatar
bk@work.mysql.com committed
20 21 22
#pragma interface			/* gcc class implementation */
#endif

23 24
#include "log.h"
#include "rpl_tblmap.h"
25

26 27 28
struct st_relay_log_info;
typedef st_relay_log_info RELAY_LOG_INFO;

bk@work.mysql.com's avatar
bk@work.mysql.com committed
29 30
class Query_log_event;
class Load_log_event;
31
class Slave_log_event;
32
class sp_rcontext;
33
class sp_cache;
34
class Lex_input_stream;
35
class Rows_log_event;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
36

37
enum enum_enable_or_disable { LEAVE_AS_IS, ENABLE, DISABLE };
38
enum enum_ha_read_modes { RFIRST, RNEXT, RPREV, RLAST, RKEY, RNEXT_SAME };
39
enum enum_duplicates { DUP_ERROR, DUP_REPLACE, DUP_UPDATE };
40 41
enum enum_delay_key_write { DELAY_KEY_WRITE_NONE, DELAY_KEY_WRITE_ON,
			    DELAY_KEY_WRITE_ALL };
42 43 44 45
enum enum_check_fields
{ CHECK_FIELD_IGNORE, CHECK_FIELD_WARN, CHECK_FIELD_ERROR_FOR_NULL };
enum enum_mark_columns
{ MARK_COLUMNS_NONE, MARK_COLUMNS_READ, MARK_COLUMNS_WRITE};
46

47
extern char internal_table_name[2];
48
extern char empty_c_string[1];
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
49
extern const char **errmesg;
50

51 52 53 54 55 56 57
#define TC_LOG_PAGE_SIZE   8192
#define TC_LOG_MIN_SIZE    (3*TC_LOG_PAGE_SIZE)

#define TC_HEURISTIC_RECOVER_COMMIT   1
#define TC_HEURISTIC_RECOVER_ROLLBACK 2
extern uint tc_heuristic_recover;

58 59 60 61 62 63 64 65 66
typedef struct st_user_var_events
{
  user_var_entry *user_var_event;
  char *value;
  ulong length;
  Item_result type;
  uint charset_number;
} BINLOG_USER_VAR_EVENT;

67 68 69
#define RP_LOCK_LOG_IS_ALREADY_LOCKED 1
#define RP_FORCE_ROTATE               2

bk@work.mysql.com's avatar
bk@work.mysql.com committed
70 71 72
typedef struct st_copy_info {
  ha_rows records;
  ha_rows deleted;
vva@eagle.mysql.r18.ru's avatar
vva@eagle.mysql.r18.ru committed
73
  ha_rows updated;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
74
  ha_rows copied;
75
  ha_rows error_count;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
76
  enum enum_duplicates handle_duplicates;
77
  int escape_char, last_errno;
78 79
  bool ignore;
  /* for INSERT ... UPDATE */
80 81
  List<Item> *update_fields;
  List<Item> *update_values;
monty@mysql.com's avatar
monty@mysql.com committed
82
  /* for VIEW ... WITH CHECK OPTION */
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
83
  TABLE_LIST *view;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
84 85 86 87 88 89 90 91
} COPY_INFO;


class key_part_spec :public Sql_alloc {
public:
  const char *field_name;
  uint length;
  key_part_spec(const char *name,uint len=0) :field_name(name), length(len) {}
92
  bool operator==(const key_part_spec& other) const;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116
};


class Alter_drop :public Sql_alloc {
public:
  enum drop_type {KEY, COLUMN };
  const char *name;
  enum drop_type type;
  Alter_drop(enum drop_type par_type,const char *par_name)
    :name(par_name), type(par_type) {}
};


class Alter_column :public Sql_alloc {
public:
  const char *name;
  Item *def;
  Alter_column(const char *par_name,Item *literal)
    :name(par_name), def(literal) {}
};


class Key :public Sql_alloc {
public:
117
  enum Keytype { PRIMARY, UNIQUE, MULTIPLE, FULLTEXT, SPATIAL, FOREIGN_KEY};
bk@work.mysql.com's avatar
bk@work.mysql.com committed
118
  enum Keytype type;
119
  KEY_CREATE_INFO key_create_info;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
120
  List<key_part_spec> columns;
121
  const char *name;
122
  bool generated;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
123

124 125 126
  Key(enum Keytype type_par, const char *name_arg,
      KEY_CREATE_INFO *key_info_arg,
      bool generated_arg, List<key_part_spec> &cols)
127 128
    :type(type_par), key_create_info(*key_info_arg), columns(cols),
    name(name_arg), generated(generated_arg)
129
  {}
bk@work.mysql.com's avatar
bk@work.mysql.com committed
130
  ~Key() {}
131
  /* Equality comparison of keys (ignoring name) */
132
  friend bool foreign_key_prefix(Key *a, Key *b);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
133 134
};

135 136 137 138 139 140 141 142 143 144 145 146 147 148 149
class Table_ident;

class foreign_key: public Key {
public:
  enum fk_match_opt { FK_MATCH_UNDEF, FK_MATCH_FULL,
		      FK_MATCH_PARTIAL, FK_MATCH_SIMPLE};
  enum fk_option { FK_OPTION_UNDEF, FK_OPTION_RESTRICT, FK_OPTION_CASCADE,
		   FK_OPTION_SET_NULL, FK_OPTION_NO_ACTION, FK_OPTION_DEFAULT};

  Table_ident *ref_table;
  List<key_part_spec> ref_columns;
  uint delete_opt, update_opt, match_opt;
  foreign_key(const char *name_arg, List<key_part_spec> &cols,
	      Table_ident *table,   List<key_part_spec> &ref_cols,
	      uint delete_opt_arg, uint update_opt_arg, uint match_opt_arg)
150
    :Key(FOREIGN_KEY, name_arg, &default_key_create_info, 0, cols),
151 152 153 154 155
    ref_table(table), ref_columns(cols),
    delete_opt(delete_opt_arg), update_opt(update_opt_arg),
    match_opt(match_opt_arg)
  {}
};
bk@work.mysql.com's avatar
bk@work.mysql.com committed
156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174

typedef struct st_mysql_lock
{
  TABLE **table;
  uint table_count,lock_count;
  THR_LOCK_DATA **locks;
} MYSQL_LOCK;


class LEX_COLUMN : public Sql_alloc
{
public:
  String column;
  uint rights;
  LEX_COLUMN (const String& x,const  uint& y ): column (x),rights (y) {}
};

#include "sql_lex.h"				/* Must be here */

175
class Delayed_insert;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
176
class select_result;
177
class Time_zone;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
178

179 180 181 182 183
#define THD_SENTRY_MAGIC 0xfeedd1ff
#define THD_SENTRY_GONE  0xdeadbeef

#define THD_CHECK_SENTRY(thd) DBUG_ASSERT(thd->dbug_sentry == THD_SENTRY_MAGIC)

184 185
struct system_variables
{
antony@ppcg5.local's avatar
antony@ppcg5.local committed
186 187 188 189 190 191 192 193 194 195 196 197 198 199
  /*
    How dynamically allocated system variables are handled:
    
    The global_system_variables and max_system_variables are "authoritative"
    They both should have the same 'version' and 'size'.
    When attempting to access a dynamic variable, if the session version
    is out of date, then the session version is updated and realloced if
    neccessary and bytes copied from global to make up for missing data.
  */ 
  ulong dynamic_variables_version;
  char* dynamic_variables_ptr;
  uint dynamic_variables_head;  /* largest valid variable offset */
  uint dynamic_variables_size;  /* how many bytes are in use */
  
200 201
  ulonglong myisam_max_extra_sort_file_size;
  ulonglong myisam_max_sort_file_size;
202 203
  ulonglong max_heap_table_size;
  ulonglong tmp_table_size;
204 205
  ha_rows select_limit;
  ha_rows max_join_size;
206
  ulong auto_increment_increment, auto_increment_offset;
207
  ulong bulk_insert_buff_size;
208 209
  ulong join_buff_size;
  ulong long_query_time;
210
  ulong max_allowed_packet;
211
  ulong max_error_count;
igor@hundin.mysql.fi's avatar
igor@hundin.mysql.fi committed
212
  ulong max_length_for_sort_data;
213
  ulong max_sort_length;
214
  ulong max_tmp_tables;
215
  ulong max_insert_delayed_threads;
ingo@mysql.com's avatar
ingo@mysql.com committed
216
  ulong multi_range_count;
217
  ulong myisam_repair_threads;
218
  ulong myisam_sort_buff_size;
219
  ulong myisam_stats_method;
220
  ulong net_buffer_length;
221
  ulong net_interactive_timeout;
222
  ulong net_read_timeout;
223
  ulong net_retry_count;
224
  ulong net_wait_timeout;
225
  ulong net_write_timeout;
226 227
  ulong optimizer_prune_level;
  ulong optimizer_search_depth;
igor@rurik.mysql.com's avatar
igor@rurik.mysql.com committed
228
  ulong preload_buff_size;
229 230 231
  ulong query_cache_type;
  ulong read_buff_size;
  ulong read_rnd_buff_size;
232
  ulong div_precincrement;
233
  ulong sortbuff_size;
234
  ulong thread_handling;
235
  ulong tx_isolation;
mskold@mysql.com's avatar
Merge  
mskold@mysql.com committed
236
  ulong completion_type;
237
  /* Determines which non-standard SQL behaviour should be enabled */
238
  ulong sql_mode;
239
  ulong max_sp_recursion_depth;
bell@sanja.is.com.ua's avatar
VIEW  
bell@sanja.is.com.ua committed
240
  /* check of key presence in updatable view */
241
  ulong updatable_views_with_limit;
242
  ulong default_week_format;
243
  ulong max_seeks_for_key;
244 245 246 247 248
  ulong range_alloc_block_size;
  ulong query_alloc_block_size;
  ulong query_prealloc_size;
  ulong trans_alloc_block_size;
  ulong trans_prealloc_size;
249
  ulong log_warnings;
250
  ulong group_concat_max_len;
251 252 253 254
  ulong ndb_autoincrement_prefetch_sz;
  ulong ndb_index_stat_cache_entries;
  ulong ndb_index_stat_update_freq;
  ulong binlog_format; // binlog format for this thd (see enum_binlog_format)
255 256 257 258
  /*
    In slave thread we need to know in behalf of which
    thread the query is being run to replicate temp tables properly
  */
259
  my_thread_id pseudo_thread_id;
260

261 262
  my_bool low_priority_updates;
  my_bool new_mode;
263 264 265 266 267
  /* 
    compatibility option:
      - index usage hints (USE INDEX without a FOR clause) behave as in 5.0 
  */
  my_bool old_mode;
268
  my_bool query_cache_wlock_invalidate;
mskold@mysql.com's avatar
mskold@mysql.com committed
269
  my_bool engine_condition_pushdown;
270
  my_bool ndb_force_send;
271
  my_bool ndb_use_copying_alter_table;
272 273
  my_bool ndb_use_exact_count;
  my_bool ndb_use_transactions;
274
  my_bool ndb_index_stat_enable;
275

276
  my_bool old_alter_table;
277
  my_bool old_passwords;
278

antony@ppcg5.local's avatar
antony@ppcg5.local committed
279
  plugin_ref table_plugin;
280

281
  /* Only charset part of these variables is sensible */
282
  CHARSET_INFO  *character_set_filesystem;
283
  CHARSET_INFO  *character_set_client;
284
  CHARSET_INFO  *character_set_results;
285

286 287 288
  /* Both charset and collation parts of these variables are important */
  CHARSET_INFO	*collation_server;
  CHARSET_INFO	*collation_database;
289
  CHARSET_INFO  *collation_connection;
290

bar@mysql.com's avatar
bar@mysql.com committed
291 292 293
  /* Locale Support */
  MY_LOCALE *lc_time_names;

294 295
  Time_zone *time_zone;

296
  /* DATE, DATETIME and MYSQL_TIME formats */
297 298 299
  DATE_TIME_FORMAT *date_format;
  DATE_TIME_FORMAT *datetime_format;
  DATE_TIME_FORMAT *time_format;
300
  my_bool sysdate_is_now;
301

302 303
};

304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326

/* per thread status variables */

typedef struct system_status_var
{
  ulong bytes_received;
  ulong bytes_sent;
  ulong com_other;
  ulong com_stat[(uint) SQLCOM_END];
  ulong created_tmp_disk_tables;
  ulong created_tmp_tables;
  ulong ha_commit_count;
  ulong ha_delete_count;
  ulong ha_read_first_count;
  ulong ha_read_last_count;
  ulong ha_read_key_count;
  ulong ha_read_next_count;
  ulong ha_read_prev_count;
  ulong ha_read_rnd_count;
  ulong ha_read_rnd_next_count;
  ulong ha_rollback_count;
  ulong ha_update_count;
  ulong ha_write_count;
327 328 329 330
  ulong ha_prepare_count;
  ulong ha_discover_count;
  ulong ha_savepoint_count;
  ulong ha_savepoint_rollback_count;
331 332 333 334 335 336 337 338 339 340 341 342

  /* KEY_CACHE parts. These are copies of the original */
  ulong key_blocks_changed;
  ulong key_blocks_used;
  ulong key_cache_r_requests;
  ulong key_cache_read;
  ulong key_cache_w_requests;
  ulong key_cache_write;
  /* END OF KEY_CACHE parts */

  ulong net_big_packet_count;
  ulong opened_tables;
343
  ulong opened_shares;
344 345 346 347 348 349 350 351 352 353
  ulong select_full_join_count;
  ulong select_full_range_join_count;
  ulong select_range_count;
  ulong select_range_check_count;
  ulong select_scan_count;
  ulong long_query_count;
  ulong filesort_merge_passes;
  ulong filesort_range_count;
  ulong filesort_rows;
  ulong filesort_scan_count;
354
  /* Prepared statements and binary protocol */
355 356 357 358 359 360
  ulong com_stmt_prepare;
  ulong com_stmt_execute;
  ulong com_stmt_send_long_data;
  ulong com_stmt_fetch;
  ulong com_stmt_reset;
  ulong com_stmt_close;
361

362 363 364 365
  /*
    Status variables which it does not make sense to add to
    global status variable counter
  */
366
  double last_query_cost;
367 368 369
} STATUS_VAR;

/*
370 371 372
  This is used for 'SHOW STATUS'. It must be updated to the last ulong
  variable in system_status_var which is makes sens to add to the global
  counter
373 374
*/

konstantin@mysql.com's avatar
konstantin@mysql.com committed
375
#define last_system_status_var com_stmt_close
376

377 378
#ifdef MYSQL_SERVER

379
void free_tmp_table(THD *thd, TABLE *entry);
380 381


382 383 384
/* The following macro is to make init of Query_arena simpler */
#ifndef DBUG_OFF
#define INIT_ARENA_DBUG_INFO is_backup_arena= 0
385 386
#else
#define INIT_ARENA_DBUG_INFO
387 388
#endif

serg@serg.mylan's avatar
serg@serg.mylan committed
389
class Query_arena
390 391 392 393 394 395 396
{
public:
  /*
    List of items created in the parser for this query. Every item puts
    itself to the list on creation (see Item::Item() for details))
  */
  Item *free_list;
397
  MEM_ROOT *mem_root;                   // Pointer to current memroot
monty@mysql.com's avatar
monty@mysql.com committed
398
#ifndef DBUG_OFF
399
  bool is_backup_arena; /* True if this arena is used for backup. */
monty@mysql.com's avatar
monty@mysql.com committed
400
#endif
serg@serg.mylan's avatar
serg@serg.mylan committed
401
  enum enum_state
402
  {
403 404
    INITIALIZED= 0, INITIALIZED_FOR_SP= 1, PREPARED= 2,
    CONVENTIONAL_EXECUTION= 3, EXECUTED= 4, ERROR= -1
405
  };
serg@serg.mylan's avatar
serg@serg.mylan committed
406

407
  enum_state state;
408 409 410 411 412 413 414

  /* We build without RTTI, so dynamic_cast can't be used. */
  enum Type
  {
    STATEMENT, PREPARED_STATEMENT, STORED_PROCEDURE
  };

415 416
  Query_arena(MEM_ROOT *mem_root_arg, enum enum_state state_arg) :
    free_list(0), mem_root(mem_root_arg), state(state_arg)
417
  { INIT_ARENA_DBUG_INFO; }
418
  /*
serg@serg.mylan's avatar
serg@serg.mylan committed
419 420
    This constructor is used only when Query_arena is created as
    backup storage for another instance of Query_arena.
421
  */
422 423
  Query_arena() { INIT_ARENA_DBUG_INFO; }

424
  virtual Type type() const;
serg@serg.mylan's avatar
serg@serg.mylan committed
425
  virtual ~Query_arena() {};
426

427
  inline bool is_stmt_prepare() const { return state == INITIALIZED; }
428 429
  inline bool is_first_sp_execute() const
  { return state == INITIALIZED_FOR_SP; }
430 431
  inline bool is_stmt_prepare_or_first_sp_execute() const
  { return (int)state < (int)PREPARED; }
432
  inline bool is_first_stmt_execute() const { return state == PREPARED; }
433 434
  inline bool is_stmt_execute() const
  { return state == PREPARED || state == EXECUTED; }
monty@mysql.com's avatar
monty@mysql.com committed
435
  inline bool is_conventional() const
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
436
  { return state == CONVENTIONAL_EXECUTION; }
437

438
  inline gptr alloc(unsigned int size) { return alloc_root(mem_root,size); }
439 440 441
  inline gptr calloc(unsigned int size)
  {
    gptr ptr;
442
    if ((ptr=alloc_root(mem_root,size)))
443 444 445 446
      bzero((char*) ptr,size);
    return ptr;
  }
  inline char *strdup(const char *str)
447
  { return strdup_root(mem_root,str); }
448
  inline char *strmake(const char *str, uint size)
449
  { return strmake_root(mem_root,str,size); }
450 451 452 453 454 455
  inline bool LEX_STRING_make(LEX_STRING *lex_str, const char *str, uint size)
  {
    return ((lex_str->str= 
             strmake_root(mem_root, str, (lex_str->length= size)))) == 0;
  }

456
  inline char *memdup(const char *str, uint size)
457
  { return memdup_root(mem_root,str,size); }
458 459 460
  inline char *memdup_w_gap(const char *str, uint size, uint gap)
  {
    gptr ptr;
461
    if ((ptr=alloc_root(mem_root,size+gap)))
462 463 464 465
      memcpy(ptr,str,size);
    return ptr;
  }

konstantin@mysql.com's avatar
konstantin@mysql.com committed
466
  void set_query_arena(Query_arena *set);
467 468

  void free_items();
469 470
  /* Close the active state associated with execution of this statement */
  virtual void cleanup_stmt();
471 472
};

473

474
class Server_side_cursor;
475

476 477 478 479
/**
  @class Statement
  @brief State of a single command executed against this connection.

480 481 482 483 484 485 486 487 488 489 490 491
  One connection can contain a lot of simultaneously running statements,
  some of which could be:
   - prepared, that is, contain placeholders,
   - opened as cursors. We maintain 1 to 1 relationship between
     statement and cursor - if user wants to create another cursor for his
     query, we create another statement for it. 
  To perform some action with statement we reset THD part to the state  of
  that statement, do the action, and then save back modified state from THD
  to the statement. It will be changed in near future, and Statement will
  be used explicitly.
*/

492
class Statement: public ilink, public Query_arena
493
{
494 495
  Statement(const Statement &rhs);              /* not implemented: */
  Statement &operator=(const Statement &rhs);   /* non-copyable */
496 497
public:
  /*
konstantin@oak.local's avatar
konstantin@oak.local committed
498
    Uniquely identifies each statement object in thread scope; change during
499
    statement lifetime. FIXME: must be const
500
  */
konstantin@oak.local's avatar
konstantin@oak.local committed
501
   ulong id;
502 503

  /*
504 505 506 507 508 509 510 511 512
    MARK_COLUMNS_NONE:  Means mark_used_colums is not set and no indicator to
                        handler of fields used is set
    MARK_COLUMNS_READ:  Means a bit in read set is set to inform handler
	                that the field is to be read. If field list contains
                        duplicates, then thd->dup_field is set to point
                        to the last found duplicate.
    MARK_COLUMNS_WRITE: Means a bit is set in write set to inform handler
			that it needs to update this field in write_row
                        and update_row.
513
  */
514
  enum enum_mark_columns mark_used_columns;
515

516
  LEX_STRING name; /* name for named prepared statements */
517 518 519 520 521
  LEX *lex;                                     // parse tree descriptor
  /*
    Points to the query associated with this statement. It's const, but
    we need to declare it char * because all table handlers are written
    in C and need to point to it.
522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538

    Note that (A) if we set query = NULL, we must at the same time set
    query_length = 0, and protect the whole operation with the
    LOCK_thread_count mutex. And (B) we are ONLY allowed to set query to a
    non-NULL value if its previous value is NULL. We do not need to protect
    operation (B) with any mutex. To avoid crashes in races, if we do not
    know that thd->query cannot change at the moment, one should print
    thd->query like this:
      (1) reserve the LOCK_thread_count mutex;
      (2) check if thd->query is NULL;
      (3) if not NULL, then print at most thd->query_length characters from
      it. We will see the query_length field as either 0, or the right value
      for it.
    Assuming that the write and read of an n-bit memory field in an n-bit
    computer is atomic, we can avoid races in the above way. 
    This printing is needed at least in SHOW PROCESSLIST and SHOW INNODB
    STATUS.
539 540 541
  */
  char *query;
  uint32 query_length;                          // current query length
542
  Server_side_cursor *cursor;
543

544 545
public:

546
  /* This constructor is called for backup statements */
547
  Statement() {}
548

549 550
  Statement(LEX *lex_arg, MEM_ROOT *mem_root_arg,
            enum enum_state state_arg, ulong id_arg);
551
  virtual ~Statement();
552 553 554

  /* Assign execution context (note: not all members) of given stmt to self */
  void set_statement(Statement *stmt);
555 556
  void set_n_backup_statement(Statement *stmt, Statement *backup);
  void restore_backup_statement(Statement *stmt, Statement *backup);
557 558
  /* return class type */
  virtual Type type() const;
559 560 561
};


562
/**
563 564 565 566 567
  Container for all statements created/used in a connection.
  Statements in Statement_map have unique Statement::id (guaranteed by id
  assignment in Statement::Statement)
  Non-empty statement names are unique too: attempt to insert a new statement
  with duplicate name causes older statement to be deleted
568

569 570
  Statements are auto-deleted when they are removed from the map and when the
  map is deleted.
571 572 573 574 575 576
*/

class Statement_map
{
public:
  Statement_map();
577

578
  int insert(THD *thd, Statement *statement);
579 580

  Statement *find_by_name(LEX_STRING *name)
581
  {
582 583 584 585
    Statement *stmt;
    stmt= (Statement*)hash_search(&names_hash, (byte*)name->str,
                                  name->length);
    return stmt;
586
  }
587 588

  Statement *find(ulong id)
589
  {
590
    if (last_found_statement == 0 || id != last_found_statement->id)
591 592 593
    {
      Statement *stmt;
      stmt= (Statement *) hash_search(&st_hash, (byte *) &id, sizeof(id));
594
      if (stmt && stmt->name.str)
595 596 597
        return NULL;
      last_found_statement= stmt;
    }
598
    return last_found_statement;
599
  }
600 601 602 603 604 605
  /*
    Close all cursors of this connection that use tables of a storage
    engine that has transaction-specific state and therefore can not
    survive COMMIT or ROLLBACK. Currently all but MyISAM cursors are closed.
  */
  void close_transient_cursors();
606
  void erase(Statement *statement);
607
  /* Erase all statements (calls Statement destructor) */
608 609
  void reset();
  ~Statement_map();
610 611
private:
  HASH st_hash;
612
  HASH names_hash;
613
  I_List<Statement> transient_cursor_list;
614
  Statement *last_found_statement;
615 616
};

617 618 619 620 621 622 623
struct st_savepoint {
  struct st_savepoint *prev;
  char                *name;
  uint                 length, nht;
};

enum xa_states {XA_NOTR=0, XA_ACTIVE, XA_IDLE, XA_PREPARED};
624
extern const char *xa_state_names[];
625

626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641
typedef struct st_xid_state {
  /* For now, this is only used to catch duplicated external xids */
  XID  xid;                           // transaction identifier
  enum xa_states xa_state;            // used by external XA only
  bool in_thd;
} XID_STATE;

extern pthread_mutex_t LOCK_xid_cache;
extern HASH xid_cache;
bool xid_cache_init(void);
void xid_cache_free(void);
XID_STATE *xid_cache_search(XID *xid);
bool xid_cache_insert(XID *xid, enum xa_states xa_state);
bool xid_cache_insert(XID_STATE *xid_state);
void xid_cache_delete(XID_STATE *xid_state);

642 643 644 645
/**
  @class Security_context
  @brief A set of THD members describing the current authenticated user.
*/
646

647 648
class Security_context {
public:
649
  Security_context() {}                       /* Remove gcc warning */
650 651 652 653
  /*
    host - host of the client
    user - user of the client, set to NULL until the user has been read from
    the connection
654
    priv_user - The user privilege we are using. May be "" for anonymous user.
655 656 657
    ip - client IP
  */
  char   *host, *user, *priv_user, *ip;
658
  /* The host privilege we are using */
659 660 661 662 663 664 665 666 667
  char   priv_host[MAX_HOSTNAME];
  /* points to host if host is available, otherwise points to ip */
  const char *host_or_ip;
  ulong master_access;                 /* Global privileges from mysql.user */
  ulong db_access;                     /* Privileges for current db */

  void init();
  void destroy();
  void skip_grants();
668
  inline char *priv_host_name()
669 670 671
  {
    return (*priv_host ? priv_host : (char *)"%");
  }
672 673
  
  bool set_user(char *user_arg);
674 675 676 677 678 679 680 681 682 683 684 685

#ifndef NO_EMBEDDED_ACCESS_CHECKS
  bool
  change_security_context(THD *thd,
                          LEX_STRING *definer_user,
                          LEX_STRING *definer_host,
                          LEX_STRING *db,
                          Security_context **backup);

  void
  restore_security_context(THD *thd, Security_context *backup);
#endif
686 687 688
};


689
/**
690 691 692 693 694 695 696 697 698 699
  A registry for item tree transformations performed during
  query optimization. We register only those changes which require
  a rollback to re-execute a prepared statement or stored procedure
  yet another time.
*/

struct Item_change_record;
typedef I_List<Item_change_record> Item_change_list;


700
/**
701 702 703 704 705 706 707 708
  Type of prelocked mode.
  See comment for THD::prelocked_mode for complete description.
*/

enum prelocked_mode_type {NON_PRELOCKED= 0, PRELOCKED= 1,
                          PRELOCKED_UNDER_LOCK_TABLES= 2};


709
/**
710
  Class that holds information about tables which were opened and locked
711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745
  by the thread. It is also used to save/restore this information in
  push_open_tables_state()/pop_open_tables_state().
*/

class Open_tables_state
{
public:
  /*
    open_tables - list of regular tables in use by this thread
    temporary_tables - list of temp tables in use by this thread
    handler_tables - list of tables that were opened with HANDLER OPEN
     and are still in use by this thread
  */
  TABLE *open_tables, *temporary_tables, *handler_tables, *derived_tables;
  /*
    During a MySQL session, one can lock tables in two modes: automatic
    or manual. In automatic mode all necessary tables are locked just before
    statement execution, and all acquired locks are stored in 'lock'
    member. Unlocking takes place automatically as well, when the
    statement ends.
    Manual mode comes into play when a user issues a 'LOCK TABLES'
    statement. In this mode the user can only use the locked tables.
    Trying to use any other tables will give an error. The locked tables are
    stored in 'locked_tables' member.  Manual locking is described in
    the 'LOCK_TABLES' chapter of the MySQL manual.
    See also lock_tables() for details.
  */
  MYSQL_LOCK *lock;
  /*
    Tables that were locked with explicit or implicit LOCK TABLES.
    (Implicit LOCK TABLES happens when we are prelocking tables for
     execution of statement which uses stored routines. See description
     THD::prelocked_mode for more info.)
  */
  MYSQL_LOCK *locked_tables;
746 747 748 749 750 751 752 753

  /*
    CREATE-SELECT keeps an extra lock for the table being
    created. This field is used to keep the extra lock available for
    lower level routines, which would otherwise miss that lock.
   */
  MYSQL_LOCK *extra_lock;

754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780
  /*
    prelocked_mode_type enum and prelocked_mode member are used for
    indicating whenever "prelocked mode" is on, and what type of
    "prelocked mode" is it.

    Prelocked mode is used for execution of queries which explicitly
    or implicitly (via views or triggers) use functions, thus may need
    some additional tables (mentioned in query table list) for their
    execution.

    First open_tables() call for such query will analyse all functions
    used by it and add all additional tables to table its list. It will
    also mark this query as requiring prelocking. After that lock_tables()
    will issue implicit LOCK TABLES for the whole table list and change
    thd::prelocked_mode to non-0. All queries called in functions invoked
    by the main query will use prelocked tables. Non-0 prelocked_mode
    will also surpress mentioned analysys in those queries thus saving
    cycles. Prelocked mode will be turned off once close_thread_tables()
    for the main query will be called.

    Note: Since not all "tables" present in table list are really locked
    thd::prelocked_mode does not imply thd::locked_tables.
  */
  prelocked_mode_type prelocked_mode;
  ulong	version;
  uint current_tablenr;

781 782 783 784 785 786 787 788 789
  enum enum_flags {
    BACKUPS_AVAIL = (1U << 0)     /* There are backups available */
  };

  /*
    Flags with information about the open tables state.
  */
  uint state_flags;

790 791 792 793
  /*
    This constructor serves for creation of Open_tables_state instances
    which are used as backup storage.
  */
794
  Open_tables_state() : state_flags(0U) { }
795 796

  Open_tables_state(ulong version_arg);
797 798 799 800 801 802 803 804 805

  void set_open_tables_state(Open_tables_state *state)
  {
    *this= *state;
  }

  void reset_open_tables_state()
  {
    open_tables= temporary_tables= handler_tables= derived_tables= 0;
806
    extra_lock= lock= locked_tables= 0;
807
    prelocked_mode= NON_PRELOCKED;
808
    state_flags= 0U;
809 810 811
  }
};

812 813 814 815
/**
  @class Sub_statement_state
  @brief Used to save context when executing a function or trigger
*/
816 817 818 819 820 821

/* Defines used for Sub_statement_state::in_sub_stmt */

#define SUB_STMT_TRIGGER 1
#define SUB_STMT_FUNCTION 2

822

823 824 825 826
class Sub_statement_state
{
public:
  ulonglong options;
827 828 829
  ulonglong first_successful_insert_id_in_prev_stmt;
  ulonglong first_successful_insert_id_in_cur_stmt, insert_id_for_cur_row;
  Discrete_interval auto_inc_interval_for_cur_row;
830 831 832 833
  ulonglong limit_found_rows;
  ha_rows    cuted_fields, sent_row_count, examined_row_count;
  ulong client_capabilities;
  uint in_sub_stmt;
834
  bool enable_slow_log;
ramil@mysql.com's avatar
ramil@mysql.com committed
835
  bool last_insert_id_used;
836
  my_bool no_send_ok;
837
  SAVEPOINT *savepoints;
838 839 840
};


841 842 843 844 845 846 847 848 849 850 851 852 853
/* Flags for the THD::system_thread variable */
enum enum_thread_type
{
  NON_SYSTEM_THREAD= 0,
  SYSTEM_THREAD_DELAYED_INSERT= 1,
  SYSTEM_THREAD_SLAVE_IO= 2,
  SYSTEM_THREAD_SLAVE_SQL= 4,
  SYSTEM_THREAD_NDBCLUSTER_BINLOG= 8,
  SYSTEM_THREAD_EVENT_SCHEDULER= 16,
  SYSTEM_THREAD_EVENT_WORKER= 32
};


malff/marcsql@weblab.(none)'s avatar
malff/marcsql@weblab.(none) committed
854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896
/**
  This class represents the interface for internal error handlers.
  Internal error handlers are exception handlers used by the server
  implementation.
*/
class Internal_error_handler
{
protected:
  Internal_error_handler() {}
  virtual ~Internal_error_handler() {}

public:
  /**
    Handle an error condition.
    This method can be implemented by a subclass to achieve any of the
    following:
    - mask an error internally, prevent exposing it to the user,
    - mask an error and throw another one instead.
    When this method returns true, the error condition is considered
    'handled', and will not be propagated to upper layers.
    It is the responsability of the code installing an internal handler
    to then check for trapped conditions, and implement logic to recover
    from the anticipated conditions trapped during runtime.

    This mechanism is similar to C++ try/throw/catch:
    - 'try' correspond to <code>THD::push_internal_handler()</code>,
    - 'throw' correspond to <code>my_error()</code>,
    which invokes <code>my_message_sql()</code>,
    - 'catch' correspond to checking how/if an internal handler was invoked,
    before removing it from the exception stack with
    <code>THD::pop_internal_handler()</code>.

    @param sql_errno the error number
    @param level the error level
    @param thd the calling thread
    @return true if the error is handled
  */
  virtual bool handle_error(uint sql_errno,
                            MYSQL_ERROR::enum_warning_level level,
                            THD *thd) = 0;
};


897 898
/**
  @class THD
899 900 901
  For each client connection we create a separate thread with THD serving as
  a thread/connection descriptor
*/
902

903
class THD :public Statement,
904
           public Open_tables_state
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
905
{
bk@work.mysql.com's avatar
bk@work.mysql.com committed
906
public:
907 908 909
  /* Used to execute base64 coded binlog events in MySQL server */
  RELAY_LOG_INFO* rli_fake;

910 911 912 913 914 915 916 917
  /*
    Constant for THD::where initialization in the beginning of every query.

    It's needed because we do not save/restore THD::where normally during
    primary (non subselect) query execution.
  */
  static const char * const DEFAULT_WHERE;

918 919
#ifdef EMBEDDED_LIBRARY
  struct st_mysql  *mysql;
hf@deer.(none)'s avatar
SCRUM  
hf@deer.(none) committed
920 921
  unsigned long	 client_stmt_id;
  unsigned long  client_param_count;
hf@deer.(none)'s avatar
hf@deer.(none) committed
922
  struct st_mysql_bind *client_params;
hf@deer.(none)'s avatar
hf@deer.(none) committed
923 924
  char *extra_data;
  ulong extra_length;
925 926 927 928 929
  struct st_mysql_data *cur_data;
  struct st_mysql_data *first_data;
  struct st_mysql_data **data_tail;
  void clear_data_list();
  struct st_mysql_data *alloc_new_dataset();
930 931 932 933 934 935
  /*
    In embedded server it points to the statement that is processed
    in the current query. We store some results directly in statement
    fields then.
  */
  struct st_mysql_stmt *current_stmt;
936
#endif
937
  NET	  net;				// client connection descriptor
938
  MEM_ROOT warn_root;			// For warnings and errors
939
  Protocol *protocol;			// Current protocol
940 941
  Protocol_text   protocol_text;	// Normal protocol
  Protocol_binary protocol_binary;	// Binary protocol
942 943
  HASH    user_vars;			// hash for user variables
  String  packet;			// dynamic buffer for network I/O
944
  String  convert_buffer;               // buffer for charset conversions
945 946 947
  struct  sockaddr_in remote;		// client socket address
  struct  rand_struct rand;		// used for authentication
  struct  system_variables variables;	// Changeable local variables
948
  struct  system_status_var status_var; // Per thread statistic vars
949
  struct  system_status_var *initial_status_var; /* used by show status */
950 951 952 953
  THR_LOCK_INFO lock_info;              // Locking info of this thread
  THR_LOCK_OWNER main_lock_id;          // To use for conventional queries
  THR_LOCK_OWNER *lock_id;              // If not main_lock_id, points to
                                        // the lock_id of a cursor.
954
  pthread_mutex_t LOCK_delete;		// Locked before thd is deleted
955
  /* all prepared statements and cursors of this connection */
956
  Statement_map stmt_map;
957 958 959 960 961 962
  /*
    A pointer to the stack frame of handle_one_connection(),
    which is called first in the thread for handling a client
  */
  char	  *thread_stack;

963 964
  /*
    db - currently selected database
965
    catalog - currently selected catalog
966 967 968 969 970
    WARNING: some members of THD (currently 'db', 'catalog' and 'query')  are
    set and alloced by the slave SQL thread (for the THD of that thread); that
    thread is (and must remain, for now) the only responsible for freeing these
    3 members. If you add members here, and you add code to set them in
    replication, don't forget to free_them_and_set_them_to_0 in replication
971 972
    properly. For details see the 'err:' label of the handle_slave_sql()
    in sql/slave.cc.
973
   */
974
  char   *db, *catalog;
975 976
  Security_context main_security_ctx;
  Security_context *security_ctx;
977

978 979
  /* remote (peer) port */
  uint16 peer_port;
980 981 982 983 984
  /*
    Points to info-string that we show in SHOW PROCESSLIST
    You are supposed to update thd->proc_info only if you have coded
    a time-consuming piece that MySQL can get stuck in for a long time.
  */
985
  const char *proc_info;
986

987
  ulong client_capabilities;		/* What the client supports */
988
  ulong max_client_packet_length;
989

990
  HASH		handler_tables_hash;
991 992 993 994 995
  /*
    One thread can hold up to one named user-level lock. This variable
    points to a lock object if the lock is present. See item_func.cc and
    chapter 'Miscellaneous functions', for functions GET_LOCK, RELEASE_LOCK. 
  */
996
  User_level_lock *ull;
997 998
#ifndef DBUG_OFF
  uint dbug_sentry; // watch out for memory corruption
999
#endif
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1000
  struct st_my_thread_var *mysys_var;
1001
  /*
1002
    Type of current query: COM_STMT_PREPARE, COM_QUERY, etc. Set from
1003 1004 1005
    first byte of the packet in do_command()
  */
  enum enum_server_command command;
1006
  uint32     server_id;
1007
  uint32     file_id;			// for LOAD DATA INFILE
1008 1009 1010 1011 1012
  /*
    Used in error messages to tell user in what part of MySQL we found an
    error. E. g. when where= "having clause", if fix_fields() fails, user
    will know that the error was in having clause.
  */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1013
  const char *where;
1014 1015
  time_t     start_time,time_after_lock,user_time;
  time_t     connect_time,thr_create_time; // track down slow pthread_create
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1016
  thr_lock_type update_lock_default;
1017
  Delayed_insert *di;
1018

1019 1020
  /* <> 0 if we are inside of trigger or stored function. */
  uint in_sub_stmt;
1021

1022 1023
  /* container for handler's private per-connection data */
  void *ha_data[MAX_HA];
1024 1025

#ifndef MYSQL_CLIENT
1026 1027
  int binlog_setup_trx_data();

1028
  /*
1029
    Public interface to write RBR events to the binlog
1030
  */
1031
  void binlog_start_trans_and_stmt();
1032 1033
  int binlog_flush_transaction_cache();
  void binlog_set_stmt_begin();
1034
  int binlog_write_table_map(TABLE *table, bool is_transactional);
1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054
  int binlog_write_row(TABLE* table, bool is_transactional,
                       MY_BITMAP const* cols, my_size_t colcnt,
                       const byte *buf);
  int binlog_delete_row(TABLE* table, bool is_transactional,
                        MY_BITMAP const* cols, my_size_t colcnt,
                        const byte *buf);
  int binlog_update_row(TABLE* table, bool is_transactional,
                        MY_BITMAP const* cols, my_size_t colcnt,
                        const byte *old_data, const byte *new_data);

  void set_server_id(uint32 sid) { server_id = sid; }

  /*
    Member functions to handle pending event for row-level logging.
  */
  template <class RowsEventT> Rows_log_event*
    binlog_prepare_pending_rows_event(TABLE* table, uint32 serv_id,
                                      MY_BITMAP const* cols,
                                      my_size_t colcnt,
                                      my_size_t needed,
1055 1056
                                      bool is_transactional,
				      RowsEventT* hint);
1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073
  Rows_log_event* binlog_get_pending_rows_event() const;
  void            binlog_set_pending_rows_event(Rows_log_event* ev);
  
  my_size_t max_row_length_blob(TABLE* table, const byte *data) const;
  my_size_t max_row_length(TABLE* table, const byte *data) const
  {
    TABLE_SHARE *table_s= table->s;
    my_size_t length= table_s->reclength + 2 * table_s->fields;
    if (table_s->blob_fields == 0)
      return length;

    return (length+max_row_length_blob(table,data));
  }

  int binlog_flush_pending_rows_event(bool stmt_end);
  void binlog_delete_pending_rows_event();

1074 1075 1076
private:
  uint binlog_table_maps; // Number of table maps currently in the binlog
public:
1077 1078 1079
  uint get_binlog_table_maps() const {
    return binlog_table_maps;
  }
1080 1081
#endif /* MYSQL_CLIENT */

1082
#ifndef MYSQL_CLIENT
1083
public:
1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109
  enum enum_binlog_query_type {
      /*
        The query can be logged row-based or statement-based
      */
      ROW_QUERY_TYPE,

      /*
        The query has to be logged statement-based
      */
      STMT_QUERY_TYPE,

      /*
        The query represents a change to a table in the "mysql"
        database and is currently mapped to ROW_QUERY_TYPE.
      */
      MYSQL_QUERY_TYPE,
      QUERY_TYPE_COUNT
  };

  int binlog_query(enum_binlog_query_type qtype,
                   char const *query, ulong query_len,
                   bool is_trans, bool suppress_use);
#endif

public:

bk@work.mysql.com's avatar
bk@work.mysql.com committed
1110
  struct st_transactions {
1111
    SAVEPOINT *savepoints;
1112 1113
    THD_TRANS all;			// Trans since BEGIN WORK
    THD_TRANS stmt;			// Trans for current statement
1114
    bool on;                            // see ha_enable_transaction()
1115 1116
    XID  xid;                           // transaction identifier
    enum xa_states xa_state;            // used by external XA only
1117
    XID_STATE xid_state;
1118 1119
    Rows_log_event *m_pending_rows_event;

1120
    /*
1121
       Tables changed in transaction (that must be invalidated in query cache).
1122
       List contain only transactional tables, that not invalidated in query
1123 1124 1125 1126 1127 1128
       cache (instead of full list of changed in transaction tables).
    */
    CHANGED_TABLE_LIST* changed_tables;
    MEM_ROOT mem_root; // Transaction-life memory allocation pool
    void cleanup()
    {
1129 1130
      changed_tables= 0;
      savepoints= 0;
1131
#ifdef USING_TRANSACTIONS
1132
      free_root(&mem_root,MYF(MY_KEEP_PREALLOC));
1133
#endif
1134
    }
1135 1136
    st_transactions()
    {
1137
#ifdef USING_TRANSACTIONS
1138
      bzero((char*)this, sizeof(*this));
1139
      xid_state.xid.null();
1140
      init_sql_alloc(&mem_root, ALLOC_ROOT_MIN_BLOCK_SIZE, 0);
1141 1142
#else
      xid_state.xa_state= XA_NOTR;
1143
#endif
1144
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1145
  } transaction;
1146
  Field      *dup_field;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1147
#ifndef __WIN__
1148
  sigset_t signals;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1149
#endif
1150 1151
#ifdef SIGNAL_WITH_VIO_CLOSE
  Vio* active_vio;
1152
#endif
1153 1154 1155 1156
  /*
    This is to track items changed during execution of a prepared
    statement/stored procedure. It's created by
    register_item_tree_change() in memory root of THD, and freed in
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1157 1158
    rollback_item_tree_changes(). For conventional execution it's always
    empty.
1159 1160 1161
  */
  Item_change_list change_list;

1162
  /*
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1163 1164
    A permanent memory area of the statement. For conventional
    execution, the parsed tree and execution runtime reside in the same
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1165
    memory root. In this case stmt_arena points to THD. In case of
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1166
    a prepared statement or a stored procedure statement, thd->mem_root
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1167
    conventionally points to runtime memory, and thd->stmt_arena
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1168 1169 1170
    points to the memory of the PS/SP, where the parsed tree of the
    statement resides. Whenever you need to perform a permanent
    transformation of a parsed tree, you should allocate new memory in
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1171 1172
    stmt_arena, to allow correct re-execution of PS/SP.
    Note: in the parser, stmt_arena == thd, even for PS/SP.
1173
  */
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1174
  Query_arena *stmt_arena;
1175 1176
  /* Tells if LAST_INSERT_ID(#) was called for the current statement */
  bool arg_of_last_insert_id_function;
1177
  /*
1178 1179
    ALL OVER THIS FILE, "insert_id" means "*automatically generated* value for
    insertion into an auto_increment column".
1180 1181
  */
  /*
1182 1183 1184 1185 1186 1187
    This is the first autogenerated insert id which was *successfully*
    inserted by the previous statement (exactly, if the previous statement
    didn't successfully insert an autogenerated insert id, then it's the one
    of the statement before, etc).
    It can also be set by SET LAST_INSERT_ID=# or SELECT LAST_INSERT_ID(#).
    It is returned by LAST_INSERT_ID().
1188
  */
1189
  ulonglong  first_successful_insert_id_in_prev_stmt;
1190
  /*
1191 1192 1193 1194
    Variant of the above, used for storing in statement-based binlog. The
    difference is that the one above can change as the execution of a stored
    function progresses, while the one below is set once and then does not
    change (which is the value which statement-based binlog needs).
1195
  */
1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250
  ulonglong  first_successful_insert_id_in_prev_stmt_for_binlog;
  /*
    This is the first autogenerated insert id which was *successfully*
    inserted by the current statement. It is maintained only to set
    first_successful_insert_id_in_prev_stmt when statement ends.
  */
  ulonglong  first_successful_insert_id_in_cur_stmt;
  /*
    We follow this logic:
    - when stmt starts, first_successful_insert_id_in_prev_stmt contains the
    first insert id successfully inserted by the previous stmt.
    - as stmt makes progress, handler::insert_id_for_cur_row changes; every
    time get_auto_increment() is called, auto_inc_intervals_for_binlog is
    augmented with the reserved interval (if statement-based binlogging).
    - at first successful insertion of an autogenerated value,
    first_successful_insert_id_in_cur_stmt is set to
    handler::insert_id_for_cur_row.
    - when stmt goes to binlog, auto_inc_intervals_for_binlog is
    binlogged if non-empty.
    - when stmt ends, first_successful_insert_id_in_prev_stmt is set to
    first_successful_insert_id_in_cur_stmt.
  */
  /*
    stmt_depends_on_first_successful_insert_id_in_prev_stmt is set when
    LAST_INSERT_ID() is used by a statement.
    If it is set, first_successful_insert_id_in_prev_stmt_for_binlog will be
    stored in the statement-based binlog.
    This variable is CUMULATIVE along the execution of a stored function or
    trigger: if one substatement sets it to 1 it will stay 1 until the
    function/trigger ends, thus making sure that
    first_successful_insert_id_in_prev_stmt_for_binlog does not change anymore
    and is propagated to the caller for binlogging.
  */
  bool       stmt_depends_on_first_successful_insert_id_in_prev_stmt;
  /*
    List of auto_increment intervals reserved by the thread so far, for
    storage in the statement-based binlog.
    Note that its minimum is not first_successful_insert_id_in_cur_stmt:
    assuming a table with an autoinc column, and this happens:
    INSERT INTO ... VALUES(3);
    SET INSERT_ID=3; INSERT IGNORE ... VALUES (NULL);
    then the latter INSERT will insert no rows
    (first_successful_insert_id_in_cur_stmt == 0), but storing "INSERT_ID=3"
    in the binlog is still needed; the list's minimum will contain 3.
  */
  Discrete_intervals_list auto_inc_intervals_in_cur_stmt_for_binlog;
  /* Used by replication and SET INSERT_ID */
  Discrete_intervals_list auto_inc_intervals_forced;
  /*
    There is BUG#19630 where statement-based replication of stored
    functions/triggers with two auto_increment columns breaks.
    We however ensure that it works when there is 0 or 1 auto_increment
    column; our rules are
    a) on master, while executing a top statement involving substatements,
    first top- or sub- statement to generate auto_increment values wins the
1251 1252 1253
    exclusive right to see its values be written to binlog (the write
    will be done by the statement or its caller), and the losers won't see
    their values be written to binlog.
1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296
    b) on slave, while replicating a top statement involving substatements,
    first top- or sub- statement to need to read auto_increment values from
    the master's binlog wins the exclusive right to read them (so the losers
    won't read their values from binlog but instead generate on their own).
    a) implies that we mustn't backup/restore
    auto_inc_intervals_in_cur_stmt_for_binlog.
    b) implies that we mustn't backup/restore auto_inc_intervals_forced.

    If there are more than 1 auto_increment columns, then intervals for
    different columns may mix into the
    auto_inc_intervals_in_cur_stmt_for_binlog list, which is logically wrong,
    but there is no point in preventing this mixing by preventing intervals
    from the secondly inserted column to come into the list, as such
    prevention would be wrong too.
    What will happen in the case of
    INSERT INTO t1 (auto_inc) VALUES(NULL);
    where t1 has a trigger which inserts into an auto_inc column of t2, is
    that in binlog we'll store the interval of t1 and the interval of t2 (when
    we store intervals, soon), then in slave, t1 will use both intervals, t2
    will use none; if t1 inserts the same number of rows as on master,
    normally the 2nd interval will not be used by t1, which is fine. t2's
    values will be wrong if t2's internal auto_increment counter is different
    from what it was on master (which is likely). In 5.1, in mixed binlogging
    mode, row-based binlogging is used for such cases where two
    auto_increment columns are inserted.
  */
  inline void record_first_successful_insert_id_in_cur_stmt(ulonglong id)
  {
    if (first_successful_insert_id_in_cur_stmt == 0)
      first_successful_insert_id_in_cur_stmt= id;
  }
  inline ulonglong read_first_successful_insert_id_in_prev_stmt(void)
  {
    if (!stmt_depends_on_first_successful_insert_id_in_prev_stmt)
    {
      /* It's the first time we read it */
      first_successful_insert_id_in_prev_stmt_for_binlog=
        first_successful_insert_id_in_prev_stmt;
      stmt_depends_on_first_successful_insert_id_in_prev_stmt= 1;
    }
    return first_successful_insert_id_in_prev_stmt;
  }
  /*
1297
    Used by Intvar_log_event::do_apply_event() and by "SET INSERT_ID=#"
1298 1299 1300 1301 1302
    (mysqlbinlog). We'll soon add a variant which can take many intervals in
    argument.
  */
  inline void force_one_auto_inc_interval(ulonglong next_id)
  {
1303
    auto_inc_intervals_forced.empty(); // in case of multiple SET INSERT_ID
1304 1305 1306
    auto_inc_intervals_forced.append(next_id, ULONGLONG_MAX, 0);
  }

1307
  ulonglong  limit_found_rows;
1308 1309
  ulonglong  options;           /* Bitmap of states */
  longlong   row_count_func;	/* For the ROW_COUNT() function */
1310
  ha_rows    cuted_fields,
1311
             sent_row_count, examined_row_count;
1312 1313 1314 1315 1316 1317
  /*
    The set of those tables whose fields are referenced in all subqueries
    of the query.
    TODO: possibly this it is incorrect to have used tables in THD because
    with more than one subquery, it is not clear what does the field mean.
  */
1318
  table_map  used_tables;
1319
  USER_CONN *user_connect;
1320
  CHARSET_INFO *db_charset;
konstantin@oak.local's avatar
konstantin@oak.local committed
1321 1322 1323
  /*
    FIXME: this, and some other variables like 'count_cuted_fields'
    maybe should be statement/cursor local, that is, moved to Statement
1324 1325
    class. With current implementation warnings produced in each prepared
    statement/cursor settle here.
konstantin@oak.local's avatar
konstantin@oak.local committed
1326
  */
1327
  List	     <MYSQL_ERROR> warn_list;
1328
  uint	     warn_count[(uint) MYSQL_ERROR::WARN_LEVEL_END];
1329
  uint	     total_warn_count;
1330 1331 1332 1333 1334 1335 1336 1337
  /*
    Id of current query. Statement can be reused to execute several queries
    query_id is global in context of the whole MySQL server.
    ID is automatically generated from mutex-protected counter.
    It's used in handler code for various purposes: to check which columns
    from table are necessary for this select, to check if it's necessary to
    update auto-updatable fields (like auto_increment and timestamp).
  */
1338
  query_id_t query_id, warn_id;
1339
  ulong      col_access;
1340

1341 1342 1343
#ifdef ERROR_INJECT_SUPPORT
  ulong      error_inject_value;
#endif
1344 1345
  /* Statement id is thread-wide. This counter is used to generate ids */
  ulong      statement_id_counter;
1346
  ulong	     rand_saved_seed1, rand_saved_seed2;
1347
  ulong      row_count;  // Row counter, mainly for errors and warnings
1348 1349
  pthread_t  real_id;                           /* For debugging */
  my_thread_id  thread_id;
1350
  uint	     tmp_table, global_read_lock;
1351 1352
  uint	     server_status,open_options;
  enum enum_thread_type system_thread;
1353
  uint       db_length;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1354
  uint       select_number;             //number of select (used for EXPLAIN)
1355 1356
  /* variables.transaction_isolation is reset to this after each commit */
  enum_tx_isolation session_tx_isolation;
1357
  enum_check_fields count_cuted_fields;
1358 1359 1360

  DYNAMIC_ARRAY user_var_events;        /* For user variables replication */
  MEM_ROOT      *user_var_events_alloc; /* Allocate above array elements here */
1361

1362 1363 1364 1365 1366 1367 1368 1369
  enum killed_state
  {
    NOT_KILLED=0,
    KILL_BAD_DATA=1,
    KILL_CONNECTION=ER_SERVER_SHUTDOWN,
    KILL_QUERY=ER_QUERY_INTERRUPTED,
    KILLED_NO_VALUE      /* means neither of the states */
  };
1370 1371
  killed_state volatile killed;

1372
  /* scramble - random string sent to client on handshake */
1373
  char	     scramble[SCRAMBLE_LENGTH+1];
1374

1375
  bool       slave_thread, one_shot_set;
1376 1377
  /* tells if current statement should binlog row-based(1) or stmt-based(0) */
  bool       current_stmt_binlog_row_based;
1378
  bool	     locked, some_tables_deleted;
1379
  bool       last_cuted_field;
1380
  bool	     no_errors, password, is_fatal_error;
1381
  bool	     query_start_used, rand_used, time_zone_used;
1382 1383
  /* for IS NULL => = last_insert_id() fix in remove_eq_conds() */
  bool       substitute_null_with_insert_id;
1384
  bool	     in_lock_tables;
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
1385
  bool       query_error, bootstrap, cleanup_done;
1386
  bool	     tmp_table_used;
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1387
  bool	     charset_is_system_charset, charset_is_collation_connection;
1388
  bool       charset_is_character_set_filesystem;
1389
  bool       enable_slow_log;   /* enable slow log for current statement */
1390 1391 1392 1393 1394
  struct {
    bool all:1;
    bool stmt:1;
  } no_trans_update;
  bool	     abort_on_warning;
mskold@mysql.com's avatar
Merge  
mskold@mysql.com committed
1395
  bool 	     got_warning;       /* Set on call to push_warning() */
1396
  bool	     no_warnings_for_error; /* no warnings on call to my_error() */
1397 1398
  /* set during loop of derived table processing */
  bool       derived_tables_processing;
1399 1400
  my_bool    tablespace_op;	/* This is TRUE in DISCARD/IMPORT TABLESPACE */

1401
  sp_rcontext *spcont;		// SP runtime context
1402 1403
  sp_cache   *sp_proc_cache;
  sp_cache   *sp_func_cache;
1404

1405 1406 1407 1408 1409
  /*
    If we do a purge of binary logs, log index info of the threads
    that are currently reading it needs to be adjusted. To do that
    each thread that is using LOG_INFO needs to adjust the pointer to it
  */
1410
  LOG_INFO*  current_linfo;
1411
  NET*       slave_net;			// network connection from slave -> m.
1412 1413 1414
  /* Used by the sys_var class to store temporary values */
  union
  {
1415 1416 1417 1418
    my_bool   my_bool_value;
    long      long_value;
    ulong     ulong_value;
    ulonglong ulonglong_value;
1419
  } sys_var_tmp;
1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438
  
  struct {
    /* 
      If true, mysql_bin_log::write(Log_event) call will not write events to 
      binlog, and maintain 2 below variables instead (use
      mysql_bin_log.start_union_events to turn this on)
    */
    bool do_union;
    /*
      If TRUE, at least one mysql_bin_log::write(Log_event) call has been
      made after last mysql_bin_log.start_union_events() call.
    */
    bool unioned_events;
    /*
      If TRUE, at least one mysql_bin_log::write(Log_event e), where 
      e.cache_stmt == TRUE call has been made after last 
      mysql_bin_log.start_union_events() call.
    */
    bool unioned_events_trans;
1439 1440 1441 1442 1443 1444
    
    /* 
      'queries' (actually SP statements) that run under inside this binlog
      union have thd->query_id >= first_query_id.
    */
    query_id_t first_query_id;
1445
  } binlog_evt_union;
1446 1447 1448 1449 1450 1451 1452 1453 1454 1455

  /**
    Character input stream consumed by the lexical analyser,
    used during parsing.
    Note that since the parser is not re-entrant, we keep only one input
    stream here. This member is valid only when executing code during parsing,
    and may point to invalid memory after that.
  */
  Lex_input_stream *m_lip;

holyfoot@vva.(none)'s avatar
holyfoot@vva.(none) committed
1456
#ifdef WITH_PARTITION_STORAGE_ENGINE
1457
  partition_info *work_part_info;
holyfoot@vva.(none)'s avatar
holyfoot@vva.(none) committed
1458
#endif
grog@mysql.com[grog]'s avatar
foo1  
grog@mysql.com[grog] committed
1459

bk@work.mysql.com's avatar
bk@work.mysql.com committed
1460 1461
  THD();
  ~THD();
1462

1463
  void init(void);
1464 1465 1466 1467 1468 1469 1470 1471 1472 1473
  /*
    Initialize memory roots necessary for query processing and (!)
    pre-allocate memory for it. We can't do that in THD constructor because
    there are use cases (acl_init, delayed inserts, watcher threads,
    killing mysqld) where it's vital to not allocate excessive and not used
    memory. Note, that we still don't return error from init_for_queries():
    if preallocation fails, we should notice that at the first call to
    alloc_root. 
  */
  void init_for_queries();
1474
  void change_user(void);
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
1475
  void cleanup(void);
1476
  void cleanup_after_query();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1477
  bool store_globals();
1478 1479
#ifdef SIGNAL_WITH_VIO_CLOSE
  inline void set_active_vio(Vio* vio)
1480
  {
1481
    pthread_mutex_lock(&LOCK_delete);
1482
    active_vio = vio;
1483
    pthread_mutex_unlock(&LOCK_delete);
1484
  }
1485
  inline void clear_active_vio()
1486
  {
1487
    pthread_mutex_lock(&LOCK_delete);
1488
    active_vio = 0;
1489
    pthread_mutex_unlock(&LOCK_delete);
1490
  }
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1491
  void close_active_vio();
1492
#endif
hf@genie.(none)'s avatar
SCRUM  
hf@genie.(none) committed
1493
  void awake(THD::killed_state state_to_set);
1494 1495
  /*
    For enter_cond() / exit_cond() to work the mutex must be got before
1496 1497
    enter_cond(); this mutex is then released by exit_cond().
    Usage must be: lock mutex; enter_cond(); your code; exit_cond().
1498
  */
1499 1500 1501 1502
  inline const char* enter_cond(pthread_cond_t *cond, pthread_mutex_t* mutex,
			  const char* msg)
  {
    const char* old_msg = proc_info;
1503
    safe_mutex_assert_owner(mutex);
1504 1505 1506 1507 1508 1509 1510
    mysys_var->current_mutex = mutex;
    mysys_var->current_cond = cond;
    proc_info = msg;
    return old_msg;
  }
  inline void exit_cond(const char* old_msg)
  {
guilhem@mysql.com's avatar
guilhem@mysql.com committed
1511 1512 1513 1514 1515 1516 1517
    /*
      Putting the mutex unlock in exit_cond() ensures that
      mysys_var->current_mutex is always unlocked _before_ mysys_var->mutex is
      locked (if that would not be the case, you'll get a deadlock if someone
      does a THD::awake() on you).
    */
    pthread_mutex_unlock(mysys_var->current_mutex);
1518 1519 1520 1521 1522 1523
    pthread_mutex_lock(&mysys_var->mutex);
    mysys_var->current_mutex = 0;
    mysys_var->current_cond = 0;
    proc_info = old_msg;
    pthread_mutex_unlock(&mysys_var->mutex);
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1524
  inline time_t query_start() { query_start_used=1; return start_time; }
monty@donna.mysql.com's avatar
monty@donna.mysql.com committed
1525
  inline void	set_time()    { if (user_time) start_time=time_after_lock=user_time; else time_after_lock=time(&start_time); }
1526
  inline void	end_time()    { time(&start_time); }
monty@donna.mysql.com's avatar
monty@donna.mysql.com committed
1527
  inline void	set_time(time_t t) { time_after_lock=start_time=user_time=t; }
1528
  inline void	lock_time()   { time(&time_after_lock); }
1529 1530 1531
  inline ulonglong found_rows(void)
  {
    return limit_found_rows;
1532
  }
1533 1534
  inline bool active_transaction()
  {
1535 1536
#ifdef USING_TRANSACTIONS
    return server_status & SERVER_STATUS_IN_TRANS;
1537 1538 1539
#else
    return 0;
#endif
1540
  }
1541 1542
  inline bool fill_derived_tables()
  {
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1543
    return !stmt_arena->is_stmt_prepare() && !lex->only_view_structure();
1544
  }
1545 1546 1547 1548
  inline bool fill_information_schema_tables()
  {
    return !stmt_arena->is_stmt_prepare();
  }
1549 1550
  inline gptr trans_alloc(unsigned int size)
  {
1551 1552
    return alloc_root(&transaction.mem_root,size);
  }
1553 1554 1555 1556

  bool convert_string(LEX_STRING *to, CHARSET_INFO *to_cs,
		      const char *from, uint from_length,
		      CHARSET_INFO *from_cs);
1557 1558 1559

  bool convert_string(String *s, CHARSET_INFO *from_cs, CHARSET_INFO *to_cs);

1560
  void add_changed_table(TABLE *table);
1561 1562
  void add_changed_table(const char *key, long key_length);
  CHANGED_TABLE_LIST * changed_table_dup(const char *key, long key_length);
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1563
  int send_explain_fields(select_result *result);
1564
#ifndef EMBEDDED_LIBRARY
1565 1566
  inline void clear_error()
  {
1567
    DBUG_ENTER("clear_error");
1568 1569 1570
    net.last_error[0]= 0;
    net.last_errno= 0;
    net.report_error= 0;
1571
    query_error= 0;
1572
    DBUG_VOID_RETURN;
1573
  }
1574
  inline bool vio_ok() const { return net.vio != 0; }
1575 1576
#else
  void clear_error();
1577
  inline bool vio_ok() const { return true; }
1578
#endif
1579 1580 1581
  inline void fatal_error()
  {
    is_fatal_error= 1;
serg@serg.mylan's avatar
serg@serg.mylan committed
1582
    net.report_error= 1;
1583
    DBUG_PRINT("error",("Fatal error set"));
1584
  }
1585
  inline CHARSET_INFO *charset() { return variables.character_set_client; }
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1586
  void update_charset();
1587

konstantin@mysql.com's avatar
konstantin@mysql.com committed
1588
  inline Query_arena *activate_stmt_arena_if_needed(Query_arena *backup)
1589 1590
  {
    /*
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1591 1592
      Use the persistent arena if we are in a prepared statement or a stored
      procedure statement and we have not already changed to use this arena.
1593
    */
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1594
    if (!stmt_arena->is_conventional() && mem_root != stmt_arena->mem_root)
1595
    {
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1596 1597
      set_n_backup_active_arena(stmt_arena, backup);
      return stmt_arena;
1598 1599 1600 1601
    }
    return 0;
  }

1602
  void change_item_tree(Item **place, Item *new_value)
1603
  {
1604
    /* TODO: check for OOM condition here */
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1605
    if (!stmt_arena->is_conventional())
1606
      nocheck_register_item_tree_change(place, *place, mem_root);
1607
    *place= new_value;
1608 1609
  }
  void nocheck_register_item_tree_change(Item **place, Item *old_value,
1610
                                         MEM_ROOT *runtime_memroot);
1611
  void rollback_item_tree_changes();
1612 1613 1614 1615 1616 1617

  /*
    Cleanup statement parse state (parse tree, lex) and execution
    state after execution of a non-prepared SQL statement.
  */
  void end_statement();
1618 1619
  inline int killed_errno() const
  {
1620 1621
    killed_state killed_val; /* to cache the volatile 'killed' */
    return (killed_val= killed) != KILL_BAD_DATA ? killed_val : 0;
1622 1623 1624
  }
  inline void send_kill_message() const
  {
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1625
    int err= killed_errno();
1626 1627
    if (err)
      my_message(err, ER(err), MYF(0));
1628
  }
1629 1630 1631 1632
  /* return TRUE if we will abort query if we make a warning now */
  inline bool really_abort_on_warning()
  {
    return (abort_on_warning &&
1633
            (!no_trans_update.stmt ||
1634 1635
             (variables.sql_mode & MODE_STRICT_ALL_TABLES)));
  }
1636
  void set_status_var_init();
1637
  bool is_context_analysis_only()
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1638
    { return stmt_arena->is_stmt_prepare() || lex->view_prepare_mode; }
1639 1640
  void reset_n_backup_open_tables_state(Open_tables_state *backup);
  void restore_backup_open_tables_state(Open_tables_state *backup);
1641 1642
  void reset_sub_statement_state(Sub_statement_state *backup, uint new_state);
  void restore_sub_statement_state(Sub_statement_state *backup);
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1643 1644
  void set_n_backup_active_arena(Query_arena *set, Query_arena *backup);
  void restore_active_arena(Query_arena *set, Query_arena *backup);
1645 1646
  inline void set_current_stmt_binlog_row_based_if_mixed()
  {
1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657
    /*
      If in a stored/function trigger, the caller should already have done the
      change. We test in_sub_stmt to prevent introducing bugs where people
      wouldn't ensure that, and would switch to row-based mode in the middle
      of executing a stored function/trigger (which is too late, see also
      reset_current_stmt_binlog_row_based()); this condition will make their
      tests fail and so force them to propagate the
      lex->binlog_row_based_if_mixed upwards to the caller.
    */
    if ((variables.binlog_format == BINLOG_FORMAT_MIXED) &&
        (in_sub_stmt == 0))
1658
      current_stmt_binlog_row_based= TRUE;
1659 1660 1661
  }
  inline void set_current_stmt_binlog_row_based()
  {
1662
    current_stmt_binlog_row_based= TRUE;
1663
  }
1664 1665
  inline void clear_current_stmt_binlog_row_based()
  {
1666
    current_stmt_binlog_row_based= FALSE;
1667
  }
1668 1669
  inline void reset_current_stmt_binlog_row_based()
  {
1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683
    /*
      If there are temporary tables, don't reset back to
      statement-based. Indeed it could be that:
      CREATE TEMPORARY TABLE t SELECT UUID(); # row-based
      # and row-based does not store updates to temp tables
      # in the binlog.
      INSERT INTO u SELECT * FROM t; # stmt-based
      and then the INSERT will fail as data inserted into t was not logged.
      So we continue with row-based until the temp table is dropped.
      If we are in a stored function or trigger, we mustn't reset in the
      middle of its execution (as the binary logging way of a stored function
      or trigger is decided when it starts executing, depending for example on
      the caller (for a stored function: if caller is SELECT or
      INSERT/UPDATE/DELETE...).
1684 1685

      Don't reset binlog format for NDB binlog injector thread.
1686
    */
1687 1688
    if ((temporary_tables == NULL) && (in_sub_stmt == 0) &&
        (system_thread != SYSTEM_THREAD_NDBCLUSTER_BINLOG))
1689 1690 1691 1692
    {
      current_stmt_binlog_row_based= 
        test(variables.binlog_format == BINLOG_FORMAT_ROW);
    }
1693
  }
1694 1695 1696

  /*
    Initialize the current database from a NULL-terminated string with length
1697 1698 1699
    If we run out of memory, we free the current database and return TRUE.
    This way the user will notice the error as there will be no current
    database selected (in addition to the error message set by malloc).
1700
  */
1701
  bool set_db(const char *new_db, uint new_db_len)
1702
  {
1703 1704 1705 1706
    /* Do not reallocate memory if current chunk is big enough. */
    if (db && new_db && db_length >= new_db_len)
      memcpy(db, new_db, new_db_len+1);
    else
1707
    {
kostja@bodhi.local's avatar
kostja@bodhi.local committed
1708 1709
      x_free(db);
      db= new_db ? my_strndup(new_db, new_db_len, MYF(MY_WME)) : NULL;
1710
    }
1711 1712
    db_length= db ? new_db_len : 0;
    return new_db && !db;
1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731
  }
  void reset_db(char *new_db, uint new_db_len)
  {
    db= new_db;
    db_length= new_db_len;
  }
  /*
    Copy the current database to the argument. Use the current arena to
    allocate memory for a deep copy: current database may be freed after
    a statement is parsed but before it's executed.
  */
  bool copy_db_to(char **p_db, uint *p_db_length)
  {
    if (db == NULL)
    {
      my_message(ER_NO_DB_ERROR, ER(ER_NO_DB_ERROR), MYF(0));
      return TRUE;
    }
    *p_db= strmake(db, db_length);
1732
    *p_db_length= db_length;
1733 1734
    return FALSE;
  }
1735
  thd_scheduler scheduler;
malff/marcsql@weblab.(none)'s avatar
malff/marcsql@weblab.(none) committed
1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760

public:
  /**
    Add an internal error handler to the thread execution context.
    @param handler the exception handler to add
  */
  void push_internal_handler(Internal_error_handler *handler);

  /**
    Handle an error condition.
    @param sql_errno the error number
    @param level the error level
    @return true if the error is handled
  */
  virtual bool handle_error(uint sql_errno,
                            MYSQL_ERROR::enum_warning_level level);

  /**
    Remove the error handler last pushed.
  */
  void pop_internal_handler();

private:
  /** The current internal error handler for this thread, or NULL. */
  Internal_error_handler *m_internal_handler;
1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776
  /**
    The lex to hold the parsed tree of conventional (non-prepared) queries.
    Whereas for prepared and stored procedure statements we use an own lex
    instance for each new query, for conventional statements we reuse
    the same lex. (@see mysql_parse for details).
  */
  LEX main_lex;
  /**
    This memory root is used for two purposes:
    - for conventional queries, to allocate structures stored in main_lex
    during parsing, and allocate runtime data (execution plan, etc.)
    during execution.
    - for prepared queries, only to allocate runtime data. The parsed
    tree itself is reused between executions and thus is stored elsewhere.
  */
  MEM_ROOT main_mem_root;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1777 1778
};

1779

1780
#define tmp_disable_binlog(A)       \
1781
  {ulonglong tmp_disable_binlog__save_options= (A)->options; \
1782
  (A)->options&= ~OPTION_BIN_LOG
1783

1784
#define reenable_binlog(A)   (A)->options= tmp_disable_binlog__save_options;}
1785

1786

bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1787
/*
1788
  Used to hold information about file and file structure in exchange
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1789
  via non-DB file (...INTO OUTFILE..., ...LOAD DATA...)
1790
  XXX: We never call destructor for objects of this class.
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1791
*/
1792

bk@work.mysql.com's avatar
bk@work.mysql.com committed
1793 1794 1795 1796 1797 1798 1799
class sql_exchange :public Sql_alloc
{
public:
  char *file_name;
  String *field_term,*enclosed,*line_term,*line_start,*escaped;
  bool opt_enclosed;
  bool dumpfile;
1800
  ulong skip_lines;
1801
  CHARSET_INFO *cs;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1802 1803 1804 1805 1806 1807
  sql_exchange(char *name,bool dumpfile_flag);
};

#include "log_event.h"

/*
1808
  This is used to get result from a select
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1809 1810
*/

1811 1812
class JOIN;

bk@work.mysql.com's avatar
bk@work.mysql.com committed
1813 1814 1815
class select_result :public Sql_alloc {
protected:
  THD *thd;
1816
  SELECT_LEX_UNIT *unit;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1817 1818 1819
public:
  select_result();
  virtual ~select_result() {};
1820 1821 1822 1823 1824
  virtual int prepare(List<Item> &list, SELECT_LEX_UNIT *u)
  {
    unit= u;
    return 0;
  }
1825
  virtual int prepare2(void) { return 0; }
1826 1827 1828 1829 1830 1831 1832
  /*
    Because of peculiarities of prepared statements protocol
    we need to know number of columns in the result set (if
    there is a result set) apart from sending columns metadata.
  */
  virtual uint field_count(List<Item> &fields) const
  { return fields.elements; }
1833
  virtual bool send_fields(List<Item> &list, uint flags)=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1834
  virtual bool send_data(List<Item> &items)=0;
1835
  virtual bool initialize_tables (JOIN *join=0) { return 0; }
1836
  virtual void send_error(uint errcode,const char *err);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1837
  virtual bool send_eof()=0;
1838 1839 1840 1841 1842 1843 1844 1845
  /**
    Check if this query returns a result set and therefore is allowed in
    cursors and set an error message if it is not the case.

    @retval FALSE     success
    @retval TRUE      error, an error message is set
  */
  virtual bool check_simple_select() const;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1846
  virtual void abort() {}
1847 1848 1849 1850 1851
  /*
    Cleanup instance of this class for next execution of a prepared
    statement/stored procedure.
  */
  virtual void cleanup();
1852
  void set_thd(THD *thd_arg) { thd= thd_arg; }
1853 1854 1855 1856 1857
#ifdef EMBEDDED_LIBRARY
  virtual void begin_dataset() {}
#else
  void begin_dataset() {}
#endif
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1858 1859 1860
};


1861 1862 1863 1864 1865 1866 1867 1868 1869
/*
  Base class for select_result descendands which intercept and
  transform result set rows. As the rows are not sent to the client,
  sending of result set metadata should be suppressed as well.
*/

class select_result_interceptor: public select_result
{
public:
1870
  select_result_interceptor() {}              /* Remove gcc warning */
1871 1872 1873 1874 1875
  uint field_count(List<Item> &fields) const { return 0; }
  bool send_fields(List<Item> &fields, uint flag) { return FALSE; }
};


bk@work.mysql.com's avatar
bk@work.mysql.com committed
1876
class select_send :public select_result {
1877
  int status;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1878
public:
1879
  select_send() :status(0) {}
1880
  bool send_fields(List<Item> &list, uint flags);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1881 1882
  bool send_data(List<Item> &items);
  bool send_eof();
1883
  virtual bool check_simple_select() const { return FALSE; }
1884
  void abort();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1885 1886 1887
};


1888
class select_to_file :public select_result_interceptor {
1889
protected:
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1890 1891 1892 1893
  sql_exchange *exchange;
  File file;
  IO_CACHE cache;
  ha_rows row_count;
1894 1895 1896 1897 1898 1899 1900
  char path[FN_REFLEN];

public:
  select_to_file(sql_exchange *ex) :exchange(ex), file(-1),row_count(0L)
  { path[0]=0; }
  ~select_to_file();
  void send_error(uint errcode,const char *err);
1901 1902
  bool send_eof();
  void cleanup();
1903 1904 1905 1906
};


class select_export :public select_to_file {
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1907 1908 1909 1910
  uint field_term_length;
  int field_sep_char,escape_char,line_sep_char;
  bool fixed_row_size;
public:
1911
  select_export(sql_exchange *ex) :select_to_file(ex) {}
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1912
  ~select_export();
1913
  int prepare(List<Item> &list, SELECT_LEX_UNIT *u);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1914 1915 1916
  bool send_data(List<Item> &items);
};

monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
1917

1918
class select_dump :public select_to_file {
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1919
public:
1920
  select_dump(sql_exchange *ex) :select_to_file(ex) {}
1921
  int prepare(List<Item> &list, SELECT_LEX_UNIT *u);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1922 1923
  bool send_data(List<Item> &items);
};
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
1924 1925


1926
class select_insert :public select_result_interceptor {
1927
 public:
bell@sanja.is.com.ua's avatar
VIEW  
bell@sanja.is.com.ua committed
1928
  TABLE_LIST *table_list;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1929 1930
  TABLE *table;
  List<Item> *fields;
1931
  ulonglong autoinc_value_of_last_inserted_row; // autogenerated or not
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1932
  COPY_INFO info;
bell@sanja.is.com.ua's avatar
VIEW  
bell@sanja.is.com.ua committed
1933
  bool insert_into_view;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1934

monty@mishka.local's avatar
monty@mishka.local committed
1935 1936
  select_insert(TABLE_LIST *table_list_par,
		TABLE *table_par, List<Item> *fields_par,
1937
		List<Item> *update_fields, List<Item> *update_values,
1938
		enum_duplicates duplic, bool ignore);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1939
  ~select_insert();
1940
  int prepare(List<Item> &list, SELECT_LEX_UNIT *u);
1941
  int prepare2(void);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1942
  bool send_data(List<Item> &items);
serg@serg.mylan's avatar
serg@serg.mylan committed
1943
  virtual void store_values(List<Item> &values);
1944
  virtual bool can_rollback_data() { return 0; }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1945 1946
  void send_error(uint errcode,const char *err);
  bool send_eof();
1947 1948
  /* not implemented: select_insert is never re-used in prepared statements */
  void cleanup();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1949 1950
};

monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
1951

bk@work.mysql.com's avatar
bk@work.mysql.com committed
1952 1953
class select_create: public select_insert {
  ORDER *group;
bell@sanja.is.com.ua's avatar
VIEW  
bell@sanja.is.com.ua committed
1954
  TABLE_LIST *create_table;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1955 1956 1957 1958 1959
  List<create_field> *extra_fields;
  List<Key> *keys;
  HA_CREATE_INFO *create_info;
  Field **field;
public:
1960
  select_create (TABLE_LIST *table_arg,
bell@sanja.is.com.ua's avatar
VIEW  
bell@sanja.is.com.ua committed
1961 1962 1963
		 HA_CREATE_INFO *create_info_par,
		 List<create_field> &fields_par,
		 List<Key> &keys_par,
1964
		 List<Item> &select_fields,enum_duplicates duplic, bool ignore)
1965
    :select_insert (NULL, NULL, &select_fields, 0, 0, duplic, ignore),
1966
    create_table(table_arg), extra_fields(&fields_par),keys(&keys_par),
lars@mysql.com's avatar
lars@mysql.com committed
1967
    create_info(create_info_par)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1968
    {}
1969
  int prepare(List<Item> &list, SELECT_LEX_UNIT *u);
1970

1971
  void binlog_show_create_table(TABLE **tables, uint count);
serg@serg.mylan's avatar
serg@serg.mylan committed
1972
  void store_values(List<Item> &values);
1973
  void send_error(uint errcode,const char *err);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1974 1975
  bool send_eof();
  void abort();
1976 1977
  virtual bool can_rollback_data() { return 1; }

1978
  // Needed for access from local class MY_HOOKS in prepare(), since thd is proteted.
1979 1980
  const THD *get_thd(void) { return thd; }
  const HA_CREATE_INFO *get_create_info() { return create_info; };
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1981 1982
};

1983 1984
#include <myisam.h>

sergefp@mysql.com's avatar
sergefp@mysql.com committed
1985 1986 1987 1988 1989
/* 
  Param to create temporary tables when doing SELECT:s 
  NOTE
    This structure is copied using memcpy as a part of JOIN.
*/
1990 1991 1992

class TMP_TABLE_PARAM :public Sql_alloc
{
1993 1994 1995 1996 1997 1998
private:
  /* Prevent use of these (not safe because of lists and copy_field) */
  TMP_TABLE_PARAM(const TMP_TABLE_PARAM &);
  void operator=(TMP_TABLE_PARAM &);

public:
1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012
  List<Item> copy_funcs;
  List<Item> save_copy_funcs;
  Copy_field *copy_field, *copy_field_end;
  Copy_field *save_copy_field, *save_copy_field_end;
  byte	    *group_buff;
  Item	    **items_to_copy;			/* Fields in tmp table */
  MI_COLUMNDEF *recinfo,*start_recinfo;
  KEY *keyinfo;
  ha_rows end_write_records;
  uint	field_count,sum_func_count,func_count;
  uint  hidden_field_count;
  uint	group_parts,group_length,group_null_parts;
  uint	quick_group;
  bool  using_indirect_summary_function;
2013 2014
  /* If >0 convert all blob fields to varchar(convert_blob_length) */
  uint  convert_blob_length; 
2015
  CHARSET_INFO *table_charset; 
2016
  bool schema_table;
2017 2018 2019 2020 2021 2022 2023
  /*
    True if GROUP BY and its aggregate functions are already computed
    by a table access method (e.g. by loose index scan). In this case
    query execution should not perform aggregation and should treat
    aggregate functions as normal functions.
  */
  bool precomputed_group_by;
2024
  bool force_copy_fields;
2025 2026

  TMP_TABLE_PARAM()
sergefp@mysql.com's avatar
sergefp@mysql.com committed
2027
    :copy_field(0), group_parts(0),
igor@rurik.mysql.com's avatar
igor@rurik.mysql.com committed
2028
     group_length(0), group_null_parts(0), convert_blob_length(0),
evgen@sunlight.local's avatar
evgen@sunlight.local committed
2029
     schema_table(0), precomputed_group_by(0), force_copy_fields(0)
2030 2031 2032 2033 2034
  {}
  ~TMP_TABLE_PARAM()
  {
    cleanup();
  }
2035
  void init(void);
2036 2037 2038 2039 2040
  inline void cleanup(void)
  {
    if (copy_field)				/* Fix for Intel compiler */
    {
      delete [] copy_field;
2041
      save_copy_field= copy_field= 0;
2042 2043 2044 2045
    }
  }
};

2046 2047
class select_union :public select_result_interceptor
{
2048
  TMP_TABLE_PARAM tmp_table_param;
2049 2050
public:
  TABLE *table;
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
2051

2052
  select_union() :table(0) {}
2053
  int prepare(List<Item> &list, SELECT_LEX_UNIT *u);
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
2054 2055 2056
  bool send_data(List<Item> &items);
  bool send_eof();
  bool flush();
2057 2058 2059 2060

  bool create_result_table(THD *thd, List<Item> *column_types,
                           bool is_distinct, ulonglong options,
                           const char *alias);
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
2061 2062
};

2063
/* Base subselect interface class */
2064
class select_subselect :public select_result_interceptor
2065
{
2066
protected:
2067 2068 2069
  Item_subselect *item;
public:
  select_subselect(Item_subselect *item);
2070
  bool send_data(List<Item> &items)=0;
2071 2072 2073
  bool send_eof() { return 0; };
};

2074
/* Single value subselect interface class */
2075
class select_singlerow_subselect :public select_subselect
2076 2077
{
public:
2078 2079 2080
  select_singlerow_subselect(Item_subselect *item_arg)
    :select_subselect(item_arg)
  {}
2081 2082 2083
  bool send_data(List<Item> &items);
};

2084 2085 2086 2087 2088 2089 2090
/* used in independent ALL/ANY optimisation */
class select_max_min_finder_subselect :public select_subselect
{
  Item_cache *cache;
  bool (select_max_min_finder_subselect::*op)();
  bool fmax;
public:
2091 2092
  select_max_min_finder_subselect(Item_subselect *item_arg, bool mx)
    :select_subselect(item_arg), cache(0), fmax(mx)
2093
  {}
mskold@mysql.com's avatar
Merge  
mskold@mysql.com committed
2094
  void cleanup();
2095 2096 2097
  bool send_data(List<Item> &items);
  bool cmp_real();
  bool cmp_int();
mskold@mysql.com's avatar
Merge  
mskold@mysql.com committed
2098
  bool cmp_decimal();
2099 2100 2101
  bool cmp_str();
};

2102 2103 2104 2105
/* EXISTS subselect interface class */
class select_exists_subselect :public select_subselect
{
public:
2106 2107
  select_exists_subselect(Item_subselect *item_arg)
    :select_subselect(item_arg){}
2108 2109 2110
  bool send_data(List<Item> &items);
};

bk@work.mysql.com's avatar
bk@work.mysql.com committed
2111 2112 2113 2114 2115 2116
/* Structs used when sorting */

typedef struct st_sort_field {
  Field *field;				/* Field to sort */
  Item	*item;				/* Item if not sorting fields */
  uint	 length;			/* Length of sort field */
2117
  uint   suffix_length;                 /* Length suffix (0-4) */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2118
  Item_result result_type;		/* Type of item */
2119 2120
  bool reverse;				/* if descending sort */
  bool need_strxnfrm;			/* If we have to use strxnfrm() */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133
} SORT_FIELD;


typedef struct st_sort_buffer {
  uint index;					/* 0 or 1 */
  uint sort_orders;
  uint change_pos;				/* If sort-fields changed */
  char **buff;
  SORT_FIELD *sortorder;
} SORT_BUFFER;

/* Structure for db & table in sql_yacc */

2134 2135
class Table_ident :public Sql_alloc
{
2136
public:
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2137 2138
  LEX_STRING db;
  LEX_STRING table;
2139
  SELECT_LEX_UNIT *sel;
2140 2141
  inline Table_ident(THD *thd, LEX_STRING db_arg, LEX_STRING table_arg,
		     bool force)
2142
    :table(table_arg), sel((SELECT_LEX_UNIT *)0)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2143
  {
2144
    if (!force && (thd->client_capabilities & CLIENT_NO_SCHEMA))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2145 2146 2147 2148
      db.str=0;
    else
      db= db_arg;
  }
2149 2150 2151 2152 2153
  inline Table_ident(LEX_STRING table_arg) 
    :table(table_arg), sel((SELECT_LEX_UNIT *)0)
  {
    db.str=0;
  }
2154 2155 2156 2157 2158 2159
  /*
    This constructor is used only for the case when we create a derived
    table. A derived table has no name and doesn't belong to any database.
    Later, if there was an alias specified for the table, it will be set
    by add_table_to_list.
  */
grog@mysql.com[grog]'s avatar
foo1  
grog@mysql.com[grog] committed
2160
  inline Table_ident(SELECT_LEX_UNIT *s) : sel(s)
2161
  {
2162
    /* We must have a table name here as this is used with add_table_to_list */
2163 2164 2165 2166
    db.str= empty_c_string;                    /* a subject to casedn_str */
    db.length= 0;
    table.str= internal_table_name;
    table.length=1;
2167
  }
2168
  bool is_derived_table() const { return test(sel); }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2169
  inline void change_db(char *db_name)
2170 2171 2172
  {
    db.str= db_name; db.length= (uint) strlen(db_name);
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2173 2174 2175 2176 2177 2178
};

// this is needed for user_vars hash
class user_var_entry
{
 public:
2179
  user_var_entry() {}                         /* Remove gcc warning */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2180 2181
  LEX_STRING name;
  char *value;
2182 2183
  ulong length;
  query_id_t update_query_id, used_query_id;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2184
  Item_result type;
2185
  bool unsigned_flag;
2186

mskold@mysql.com's avatar
Merge  
mskold@mysql.com committed
2187
  double val_real(my_bool *null_value);
2188 2189
  longlong val_int(my_bool *null_value);
  String *val_str(my_bool *null_value, String *str, uint decimals);
mskold@mysql.com's avatar
Merge  
mskold@mysql.com committed
2190
  my_decimal *val_decimal(my_bool *null_value, my_decimal *result);
2191
  DTCollation collation;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2192 2193
};

2194 2195 2196 2197 2198 2199 2200
/*
   Unique -- class for unique (removing of duplicates). 
   Puts all values to the TREE. If the tree becomes too big,
   it's dumped to the file. User can request sorted values, or
   just iterate through them. In the last case tree merging is performed in
   memory simultaneously with iteration, so it should be ~2-3x faster.
 */
2201 2202 2203 2204

class Unique :public Sql_alloc
{
  DYNAMIC_ARRAY file_ptrs;
2205 2206
  ulong max_elements;
  ulonglong max_in_memory_size;
2207 2208
  IO_CACHE file;
  TREE tree;
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
2209
  byte *record_pointers;
2210
  bool flush();
2211
  uint size;
2212 2213 2214

public:
  ulong elements;
2215
  Unique(qsort_cmp2 comp_func, void *comp_func_fixed_arg,
2216
	 uint size_arg, ulonglong max_in_memory_size_arg);
2217
  ~Unique();
2218
  ulong elements_in_tree() { return tree.elements_in_tree; }
2219
  inline bool unique_add(void *ptr)
2220
  {
mskold@mysql.com's avatar
Merge  
mskold@mysql.com committed
2221
    DBUG_ENTER("unique_add");
2222
    DBUG_PRINT("info", ("tree %u - %lu", tree.elements_in_tree, max_elements));
2223
    if (tree.elements_in_tree > max_elements && flush())
mskold@mysql.com's avatar
Merge  
mskold@mysql.com committed
2224 2225
      DBUG_RETURN(1);
    DBUG_RETURN(!tree_insert(&tree, ptr, 0, tree.custom_arg));
2226 2227 2228
  }

  bool get(TABLE *table);
2229
  static double get_use_cost(uint *buffer, uint nkeys, uint key_size, 
2230
                             ulonglong max_in_memory_size);
2231
  inline static int get_cost_calc_buff_size(ulong nkeys, uint key_size, 
2232
                                            ulonglong max_in_memory_size)
2233
  {
2234
    register ulonglong max_elems_in_tree=
2235
      (1 + max_in_memory_size / ALIGN_SIZE(sizeof(TREE_ELEMENT)+key_size));
2236
    return (int) (sizeof(uint)*(1 + nkeys/max_elems_in_tree));
2237 2238
  }

2239 2240 2241
  void reset();
  bool walk(tree_walk_action action, void *walk_action_arg);

2242 2243
  friend int unique_write_to_file(gptr key, element_count count, Unique *unique);
  friend int unique_write_to_ptrs(gptr key, element_count count, Unique *unique);
2244
};
2245

monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
2246

2247
class multi_delete :public select_result_interceptor
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
2248 2249
{
  TABLE_LIST *delete_tables, *table_being_deleted;
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
2250
  Unique **tempfiles;
2251
  ha_rows deleted, found;
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
2252 2253
  uint num_of_tables;
  int error;
2254 2255 2256 2257 2258 2259
  bool do_delete;
  /* True if at least one table we delete from is transactional */
  bool transactional_tables;
  /* True if at least one table we delete from is not transactional */
  bool normal_tables;
  bool delete_while_scanning;
2260

monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
2261
public:
2262
  multi_delete(TABLE_LIST *dt, uint num_of_tables);
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
2263 2264 2265 2266 2267
  ~multi_delete();
  int prepare(List<Item> &list, SELECT_LEX_UNIT *u);
  bool send_data(List<Item> &items);
  bool initialize_tables (JOIN *join);
  void send_error(uint errcode,const char *err);
2268
  int  do_deletes();
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
2269 2270 2271
  bool send_eof();
};

2272

2273
class multi_update :public select_result_interceptor
2274
{
2275 2276 2277
  TABLE_LIST *all_tables; /* query/update command tables */
  TABLE_LIST *leaves;     /* list of leves of join table tree */
  TABLE_LIST *update_tables, *table_being_updated;
2278
  TABLE **tmp_tables, *main_table, *table_to_update;
2279 2280 2281 2282 2283 2284 2285
  TMP_TABLE_PARAM *tmp_table_param;
  ha_rows updated, found;
  List <Item> *fields, *values;
  List <Item> **fields_for_table, **values_for_table;
  uint table_count;
  Copy_field *copy_field;
  enum enum_duplicates handle_duplicates;
2286 2287 2288 2289
  bool do_update, trans_safe;
  /* True if the update operation has made a change in a transactional table */
  bool transactional_tables;
  bool ignore;
2290 2291

public:
2292
  multi_update(TABLE_LIST *ut, TABLE_LIST *leaves_list,
2293
	       List<Item> *fields, List<Item> *values,
2294
	       enum_duplicates handle_duplicates, bool ignore);
2295
  ~multi_update();
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
2296
  int prepare(List<Item> &list, SELECT_LEX_UNIT *u);
2297 2298 2299 2300 2301 2302
  bool send_data(List<Item> &items);
  bool initialize_tables (JOIN *join);
  void send_error(uint errcode,const char *err);
  int  do_updates (bool from_send_error);
  bool send_eof();
};
2303

2304 2305 2306
class my_var : public Sql_alloc  {
public:
  LEX_STRING s;
2307
#ifndef DBUG_OFF
2308 2309 2310 2311
  /*
    Routine to which this Item_splocal belongs. Used for checking if correct
    runtime context is used for variable handling.
  */
2312
  sp_head *sp;
2313
#endif
2314 2315
  bool local;
  uint offset;
2316 2317 2318 2319
  enum_field_types type;
  my_var (LEX_STRING& j, bool i, uint o, enum_field_types t)
    :s(j), local(i), offset(o), type(t)
  {}
2320 2321
  ~my_var() {}
};
2322

2323
class select_dumpvar :public select_result_interceptor {
Sinisa@sinisa.nasamreza.org's avatar
Sinisa@sinisa.nasamreza.org committed
2324 2325
  ha_rows row_count;
public:
2326
  List<my_var> var_list;
2327
  select_dumpvar()  { var_list.empty(); row_count= 0;}
Sinisa@sinisa.nasamreza.org's avatar
Sinisa@sinisa.nasamreza.org committed
2328
  ~select_dumpvar() {}
2329
  int prepare(List<Item> &list, SELECT_LEX_UNIT *u);
Sinisa@sinisa.nasamreza.org's avatar
Sinisa@sinisa.nasamreza.org committed
2330 2331
  bool send_data(List<Item> &items);
  bool send_eof();
2332
  virtual bool check_simple_select() const;
2333
  void cleanup();
Sinisa@sinisa.nasamreza.org's avatar
Sinisa@sinisa.nasamreza.org committed
2334
};
2335

2336 2337 2338 2339 2340 2341 2342
/* Bits in sql_command_flags */

#define CF_CHANGES_DATA		1
#define CF_HAS_ROW_COUNT	2
#define CF_STATUS_COMMAND	4
#define CF_SHOW_TABLE_COMMAND	8

2343 2344 2345
/* Functions in sql_class.cc */

void add_to_status(STATUS_VAR *to_var, STATUS_VAR *from_var);
2346 2347
void add_diff_to_status(STATUS_VAR *to_var, STATUS_VAR *from_var,
                        STATUS_VAR *dec_var);
2348
#endif /* MYSQL_SERVER */