sql_class.cc 82.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 19 20 21 22 23
   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 */


/*****************************************************************************
**
** This file implements classes defined in sql_class.h
** Especially the classes to handle a result from a select
**
*****************************************************************************/

24
#ifdef USE_PRAGMA_IMPLEMENTATION
bk@work.mysql.com's avatar
bk@work.mysql.com committed
25 26 27 28
#pragma implementation				// gcc: Class implementation
#endif

#include "mysql_priv.h"
29 30
#include <my_bitmap.h>
#include "log_event.h"
bk@work.mysql.com's avatar
bk@work.mysql.com committed
31 32
#include <m_ctype.h>
#include <sys/stat.h>
33
#include <thr_alarm.h>
bk@work.mysql.com's avatar
bk@work.mysql.com committed
34 35 36
#ifdef	__WIN__
#include <io.h>
#endif
37
#include <mysys_err.h>
bk@work.mysql.com's avatar
bk@work.mysql.com committed
38

monty@mysql.com's avatar
monty@mysql.com committed
39 40
#include "sp_rcontext.h"
#include "sp_cache.h"
41

42 43 44 45 46
/*
  The following is used to initialise Table_ident with a internal
  table name
*/
char internal_table_name[2]= "*";
47
char empty_c_string[1]= {0};    /* used for not defined db */
48

49 50
const char * const THD::DEFAULT_WHERE= "field list";

51

bk@work.mysql.com's avatar
bk@work.mysql.com committed
52 53 54 55
/*****************************************************************************
** Instansiate templates
*****************************************************************************/

56
#ifdef HAVE_EXPLICIT_TEMPLATE_INSTANTIATION
bk@work.mysql.com's avatar
bk@work.mysql.com committed
57 58 59 60 61 62 63 64 65 66 67 68 69 70 71
/* Used templates */
template class List<Key>;
template class List_iterator<Key>;
template class List<key_part_spec>;
template class List_iterator<key_part_spec>;
template class List<Alter_drop>;
template class List_iterator<Alter_drop>;
template class List<Alter_column>;
template class List_iterator<Alter_column>;
#endif

/****************************************************************************
** User variables
****************************************************************************/

72 73
extern "C" byte *get_var_key(user_var_entry *entry, uint *length,
			     my_bool not_used __attribute__((unused)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
74 75 76 77 78
{
  *length=(uint) entry->name.length;
  return (byte*) entry->name.str;
}

79
extern "C" void free_user_var(user_var_entry *entry)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
80 81 82 83 84 85 86
{
  char *pos= (char*) entry+ALIGN_SIZE(sizeof(*entry));
  if (entry->value && entry->value != pos)
    my_free(entry->value, MYF(0));
  my_free((char*) entry,MYF(0));
}

87 88 89 90 91
bool key_part_spec::operator==(const key_part_spec& other) const
{
  return length == other.length && !strcmp(field_name, other.field_name);
}

92 93

/*
94
  Test if a foreign key (= generated key) is a prefix of the given key
95 96 97 98 99 100 101 102 103 104 105 106 107 108
  (ignoring key name, key type and order of columns)

  NOTES:
    This is only used to test if an index for a FOREIGN KEY exists

  IMPLEMENTATION
    We only compare field names

  RETURN
    0	Generated key is a prefix of other key
    1	Not equal
*/

bool foreign_key_prefix(Key *a, Key *b)
109
{
110 111 112 113
  /* Ensure that 'a' is the generated key */
  if (a->generated)
  {
    if (b->generated && a->columns.elements > b->columns.elements)
114
      swap_variables(Key*, a, b);               // Put shorter key in 'a'
115 116
  }
  else
117
  {
118 119
    if (!b->generated)
      return TRUE;                              // No foreign key
120
    swap_variables(Key*, a, b);                 // Put generated key in 'a'
121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136
  }

  /* Test if 'a' is a prefix of 'b' */
  if (a->columns.elements > b->columns.elements)
    return TRUE;                                // Can't be prefix

  List_iterator<key_part_spec> col_it1(a->columns);
  List_iterator<key_part_spec> col_it2(b->columns);
  const key_part_spec *col1, *col2;

#ifdef ENABLE_WHEN_INNODB_CAN_HANDLE_SWAPED_FOREIGN_KEY_COLUMNS
  while ((col1= col_it1++))
  {
    bool found= 0;
    col_it2.rewind();
    while ((col2= col_it2++))
137
    {
138 139 140 141 142
      if (*col1 == *col2)
      {
        found= TRUE;
	break;
      }
143
    }
144 145 146 147 148 149 150 151 152 153
    if (!found)
      return TRUE;                              // Error
  }
  return FALSE;                                 // Is prefix
#else
  while ((col1= col_it1++))
  {
    col2= col_it2++;
    if (!(*col1 == *col2))
      return TRUE;
154
  }
155 156
  return FALSE;                                 // Is prefix
#endif
157 158 159
}


bk@work.mysql.com's avatar
bk@work.mysql.com committed
160 161 162
/****************************************************************************
** Thread specific functions
****************************************************************************/
163

164
Open_tables_state::Open_tables_state(ulong version_arg)
165
  :version(version_arg), state_flags(0U)
166 167 168 169
{
  reset_open_tables_state();
}

170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188
my_bool thd_in_lock_tables(const THD *thd)
{
  return thd->in_lock_tables;
}


my_bool thd_tablespace_op(const THD *thd)
{
  return thd->tablespace_op;
}


const char *thd_proc_info(THD *thd, const char *info)
{
  const char *old_info= thd->proc_info;
  thd->proc_info= info;
  return old_info;
}

189 190 191 192 193
void **thd_ha_data(const THD *thd, const struct handlerton *hton)
{
  return (void **) thd->ha_data + hton->slot;
}

194

bk@work.mysql.com's avatar
bk@work.mysql.com committed
195

196
THD::THD()
197 198
   :Statement(&main_lex, &main_mem_root, CONVENTIONAL_EXECUTION,
              /* statement id */ 0),
199
   Open_tables_state(refresh_version), rli_fake(0),
200
   lock_id(&main_lock_id),
201 202
   user_time(0), in_sub_stmt(0),
   binlog_table_maps(0),
203
   global_read_lock(0), is_fatal_error(0),
204
   rand_used(0), time_zone_used(0),
205 206 207 208
   arg_of_last_insert_id_function(FALSE),
   first_successful_insert_id_in_prev_stmt(0),
   first_successful_insert_id_in_prev_stmt_for_binlog(0),
   first_successful_insert_id_in_cur_stmt(0),
209
   in_lock_tables(0), bootstrap(0), derived_tables_processing(FALSE),
210
   stmt_depends_on_first_successful_insert_id_in_prev_stmt(FALSE),
211
   spcont(NULL)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
212
{
213 214
  ulong tmp;

215 216 217 218 219 220
  /*
    Pass nominal parameters to init_alloc_root only to ensure that
    the destructor works OK in case of an error. The main_mem_root
    will be re-initialized in init_for_queries().
  */
  init_sql_alloc(&main_mem_root, ALLOC_ROOT_MIN_BLOCK_SIZE, 0);
konstantin@mysql.com's avatar
konstantin@mysql.com committed
221
  stmt_arena= this;
222
  thread_stack= 0;
223
  db= 0;
224
  catalog= (char*)"std"; // the only catalog we have for now
225 226
  main_security_ctx.init();
  security_ctx= &main_security_ctx;
pem@mysql.com's avatar
pem@mysql.com committed
227
  locked=some_tables_deleted=no_errors=password= 0;
konstantin@oak.local's avatar
konstantin@oak.local committed
228
  query_start_used= 0;
229
  count_cuted_fields= CHECK_FIELD_IGNORE;
hf@genie.(none)'s avatar
SCRUM  
hf@genie.(none) committed
230
  killed= NOT_KILLED;
231
  db_length= col_access=0;
232
  query_error= tmp_table_used= 0;
233
  hash_clear(&handler_tables_hash);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
234
  tmp_table=0;
235
  used_tables=0;
236
  cuted_fields= sent_row_count= row_count= 0L;
237
  limit_found_rows= 0;
238
  statement_id_counter= 0UL;
239 240 241
#ifdef ERROR_INJECT_SUPPORT
  error_inject_value= 0UL;
#endif
242
  // Must be reset to handle error with THD's created for init of mysqld
konstantin@oak.local's avatar
konstantin@oak.local committed
243
  lex->current_select= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
244
  start_time=(time_t) 0;
245
  time_after_lock=(time_t) 0;
246
  current_linfo =  0;
247
  slave_thread = 0;
248
  thread_id= variables.pseudo_thread_id= 0;
249
  one_shot_set= 0;
250
  file_id = 0;
251
  query_id= 0;
252
  warn_id= 0;
253
  db_charset= global_system_variables.collation_database;
254
  bzero(ha_data, sizeof(ha_data));
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
255
  mysys_var=0;
256
  binlog_evt_union.do_union= FALSE;
257
  enable_slow_log= 0;
258 259
#ifndef DBUG_OFF
  dbug_sentry=THD_SENTRY_MAGIC;
260
#endif
261
#ifndef EMBEDDED_LIBRARY
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
262
  net.vio=0;
263
#endif
264
  client_capabilities= 0;                       // minimalistic client
265
  net.last_error[0]=0;                          // If error on boot
266
#ifdef HAVE_QUERY_CACHE
267
  query_cache_init_query(&net);                 // If error on boot
268
#endif
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
269
  ull=0;
270 271
  system_thread= NON_SYSTEM_THREAD;
  cleanup_done= abort_on_warning= no_warnings_for_error= 0;
272
  peer_port= 0;					// For SHOW PROCESSLIST
273
  transaction.m_pending_rows_event= 0;
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
274 275
#ifdef SIGNAL_WITH_VIO_CLOSE
  active_vio = 0;
276
#endif
277
  pthread_mutex_init(&LOCK_delete, MY_MUTEX_INIT_FAST);
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
278 279 280

  /* Variables with default values */
  proc_info="login";
281
  where= THD::DEFAULT_WHERE;
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
282
  server_id = ::server_id;
283
  slave_net = 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
284
  command=COM_CONNECT;
285
  *scramble= '\0';
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
286

287
  init();
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
288
  /* Initialize sub structures */
289
  init_sql_alloc(&warn_root, WARN_ALLOC_BLOCK_SIZE, WARN_ALLOC_PREALLOC_SIZE);
290
  user_connect=(USER_CONN *)0;
291
  hash_init(&user_vars, system_charset_info, USER_VARS_HASH_SIZE, 0, 0,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
292
	    (hash_get_key) get_var_key,
293
	    (hash_free_key) free_user_var, 0);
294

295 296
  sp_proc_cache= NULL;
  sp_func_cache= NULL;
297

298 299 300
  /* For user vars replication*/
  if (opt_bin_log)
    my_init_dynamic_array(&user_var_events,
301
			  sizeof(BINLOG_USER_VAR_EVENT *), 16, 16);
302 303 304
  else
    bzero((char*) &user_var_events, sizeof(user_var_events));

305
  /* Protocol */
306 307 308
  protocol= &protocol_text;			// Default protocol
  protocol_text.init(this);
  protocol_binary.init(this);
309

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
310
  tablespace_op=FALSE;
311 312
  tmp= sql_rnd_with_mutex();
  randominit(&rand, tmp + (ulong) &rand, tmp + (ulong) ::global_query_id);
313
  substitute_null_with_insert_id = FALSE;
314 315
  thr_lock_info_init(&lock_info); /* safety: will be reset after start */
  thr_lock_owner_init(&main_lock_id, &lock_info);
316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347

  m_internal_handler= NULL;
}


void THD::push_internal_handler(Internal_error_handler *handler)
{
  /*
    TODO: The current implementation is limited to 1 handler at a time only.
    THD and sp_rcontext need to be modified to use a common handler stack.
  */
  DBUG_ASSERT(m_internal_handler == NULL);
  m_internal_handler= handler;
}


bool THD::handle_error(uint sql_errno,
                       MYSQL_ERROR::enum_warning_level level)
{
  if (m_internal_handler)
  {
    return m_internal_handler->handle_error(sql_errno, level, this);
  }

  return FALSE;                                 // 'FALSE', as per coding style
}


void THD::pop_internal_handler()
{
  DBUG_ASSERT(m_internal_handler != NULL);
  m_internal_handler= NULL;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
348 349
}

350 351 352 353 354 355 356

/*
  Init common variables that has to be reset on start and on change_user
*/

void THD::init(void)
{
357 358
  pthread_mutex_lock(&LOCK_global_system_variables);
  variables= global_system_variables;
359 360 361 362 363 364
  variables.time_format= date_time_format_copy((THD*) 0,
					       variables.time_format);
  variables.date_format= date_time_format_copy((THD*) 0,
					       variables.date_format);
  variables.datetime_format= date_time_format_copy((THD*) 0,
						   variables.datetime_format);
365
  pthread_mutex_unlock(&LOCK_global_system_variables);
366
  server_status= SERVER_STATUS_AUTOCOMMIT;
367 368
  if (variables.sql_mode & MODE_NO_BACKSLASH_ESCAPES)
    server_status|= SERVER_STATUS_NO_BACKSLASH_ESCAPES;
369
  options= thd_startup_options;
370
  no_trans_update.stmt= no_trans_update.all= FALSE;
371
  open_options=ha_open_options;
372 373 374
  update_lock_default= (variables.low_priority_updates ?
			TL_WRITE_LOW_PRIORITY :
			TL_WRITE);
375
  session_tx_isolation= (enum_tx_isolation) variables.tx_isolation;
376 377 378
  warn_list.empty();
  bzero((char*) warn_count, sizeof(warn_count));
  total_warn_count= 0;
379
  update_charset();
380
  reset_current_stmt_binlog_row_based();
381
  bzero((char *) &status_var, sizeof(status_var));
bar@mysql.com's avatar
bar@mysql.com committed
382
  variables.lc_time_names = &my_locale_en_US;
383 384
}

385

386 387 388 389 390 391 392 393
/*
  Init THD for query processing.
  This has to be called once before we call mysql_parse.
  See also comments in sql_class.h.
*/

void THD::init_for_queries()
{
394
  set_time(); 
395
  ha_enable_transaction(this,TRUE);
396

397
  reset_root_defaults(mem_root, variables.query_alloc_block_size,
398
                      variables.query_prealloc_size);
399
#ifdef USING_TRANSACTIONS
400 401 402
  reset_root_defaults(&transaction.mem_root,
                      variables.trans_alloc_block_size,
                      variables.trans_prealloc_size);
403
#endif
404 405
  transaction.xid_state.xid.null();
  transaction.xid_state.in_thd=1;
406 407 408
}


409 410 411 412 413 414 415 416 417 418 419 420 421 422
/*
  Do what's needed when one invokes change user

  SYNOPSIS
    change_user()

  IMPLEMENTATION
    Reset all resources that are connection specific
*/


void THD::change_user(void)
{
  cleanup();
423
  killed= NOT_KILLED;
424
  cleanup_done= 0;
425
  init();
426
  stmt_map.reset();
427
  hash_init(&user_vars, system_charset_info, USER_VARS_HASH_SIZE, 0, 0,
428
	    (hash_get_key) get_var_key,
429
	    (hash_free_key) free_user_var, 0);
430 431
  sp_cache_clear(&sp_proc_cache);
  sp_cache_clear(&sp_func_cache);
432 433 434
}


monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
435 436 437
/* Do operations that may take a long time */

void THD::cleanup(void)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
438
{
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
439
  DBUG_ENTER("THD::cleanup");
440 441
  DBUG_ASSERT(cleanup_done == 0);

442
  killed= KILL_CONNECTION;
443
#ifdef ENABLE_WHEN_BINLOG_WILL_BE_ABLE_TO_PREPARE
444 445 446 447
  if (transaction.xid_state.xa_state == XA_PREPARED)
  {
#error xid_state in the cache should be replaced by the allocated value
  }
448
#endif
449
  {
serg@serg.mylan's avatar
serg@serg.mylan committed
450
    ha_rollback(this);
451 452
    xid_cache_delete(&transaction.xid_state);
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
453 454 455 456 457
  if (locked_tables)
  {
    lock=locked_tables; locked_tables=0;
    close_thread_tables(this);
  }
458
  mysql_ha_flush(this, (TABLE_LIST*) 0,
459
                 MYSQL_HA_CLOSE_FINAL | MYSQL_HA_FLUSH_ALL, FALSE);
460
  hash_free(&handler_tables_hash);
461 462
  delete_dynamic(&user_var_events);
  hash_free(&user_vars);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
463
  close_temporary_tables(this);
464 465 466
  my_free((char*) variables.time_format, MYF(MY_ALLOW_ZERO_PTR));
  my_free((char*) variables.date_format, MYF(MY_ALLOW_ZERO_PTR));
  my_free((char*) variables.datetime_format, MYF(MY_ALLOW_ZERO_PTR));
467
  
468
  sp_cache_clear(&sp_proc_cache);
469 470
  sp_cache_clear(&sp_func_cache);

471 472 473
  if (global_read_lock)
    unlock_global_read_lock(this);
  if (ull)
474
  {
475 476 477
    pthread_mutex_lock(&LOCK_user_locks);
    item_user_lock_release(ull);
    pthread_mutex_unlock(&LOCK_user_locks);
478
  }
479

monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
480 481 482 483
  cleanup_done=1;
  DBUG_VOID_RETURN;
}

484

monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
485 486
THD::~THD()
{
487
  THD_CHECK_SENTRY(this);
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
488
  DBUG_ENTER("~THD()");
489 490 491
  /* Ensure that no one is using THD */
  pthread_mutex_lock(&LOCK_delete);
  pthread_mutex_unlock(&LOCK_delete);
492
  add_to_status(&global_status_var, &status_var);
493

monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
494
  /* Close connection */
serg@serg.mylan's avatar
serg@serg.mylan committed
495
#ifndef EMBEDDED_LIBRARY
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
496 497 498
  if (net.vio)
  {
    vio_delete(net.vio);
serg@serg.mylan's avatar
serg@serg.mylan committed
499
    net_end(&net);
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
500
  }
501
#endif
502
  stmt_map.reset();                     /* close all prepared statements */
503
  DBUG_ASSERT(lock_info.n_cursors == 0);
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
504 505
  if (!cleanup_done)
    cleanup();
506

serg@serg.mylan's avatar
serg@serg.mylan committed
507
  ha_close_connection(this);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
508

509 510
  DBUG_PRINT("info", ("freeing security context"));
  main_security_ctx.destroy();
511
  safeFree(db);
512
  free_root(&warn_root,MYF(0));
513
#ifdef USING_TRANSACTIONS
514
  free_root(&transaction.mem_root,MYF(0));
515
#endif
bk@work.mysql.com's avatar
bk@work.mysql.com committed
516
  mysys_var=0;					// Safety (shouldn't be needed)
517
  pthread_mutex_destroy(&LOCK_delete);
518
#ifndef DBUG_OFF
konstantin@oak.local's avatar
konstantin@oak.local committed
519
  dbug_sentry= THD_SENTRY_GONE;
520
#endif  
521 522 523 524 525
#ifndef EMBEDDED_LIBRARY
  if (rli_fake)
    delete rli_fake;
#endif

526
  free_root(&main_mem_root, MYF(0));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
527 528 529
  DBUG_VOID_RETURN;
}

530

531
/*
532 533 534 535 536 537
  Add all status variables to another status variable array

  SYNOPSIS
   add_to_status()
   to_var       add to this array
   from_var     from this array
538 539 540 541 542 543 544 545 546

  NOTES
    This function assumes that all variables are long/ulong.
    If this assumption will change, then we have to explictely add
    the other variables after the while loop
*/

void add_to_status(STATUS_VAR *to_var, STATUS_VAR *from_var)
{
547 548
  ulong *end= (ulong*) ((byte*) to_var +
                        offsetof(STATUS_VAR, last_system_status_var) +
549 550 551 552 553 554 555
			sizeof(ulong));
  ulong *to= (ulong*) to_var, *from= (ulong*) from_var;

  while (to != end)
    *(to++)+= *(from++);
}

556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580
/*
  Add the difference between two status variable arrays to another one.

  SYNOPSIS
    add_diff_to_status
    to_var       add to this array
    from_var     from this array
    dec_var      minus this array
  
  NOTE
    This function assumes that all variables are long/ulong.
*/

void add_diff_to_status(STATUS_VAR *to_var, STATUS_VAR *from_var,
                        STATUS_VAR *dec_var)
{
  ulong *end= (ulong*) ((byte*) to_var + offsetof(STATUS_VAR,
						  last_system_status_var) +
			sizeof(ulong));
  ulong *to= (ulong*) to_var, *from= (ulong*) from_var, *dec= (ulong*) dec_var;

  while (to != end)
    *(to++)+= *(from++) - *(dec++);
}

581

hf@genie.(none)'s avatar
SCRUM  
hf@genie.(none) committed
582
void THD::awake(THD::killed_state state_to_set)
583
{
584
  DBUG_ENTER("THD::awake");
585
  DBUG_PRINT("enter", ("this: 0x%lx", (long) this));
586
  THD_CHECK_SENTRY(this);
587 588
  safe_mutex_assert_owner(&LOCK_delete); 

hf@genie.(none)'s avatar
SCRUM  
hf@genie.(none) committed
589 590
  killed= state_to_set;
  if (state_to_set != THD::KILL_QUERY)
591
  {
592 593 594
    thr_alarm_kill(thread_id);
    if (!slave_thread)
      thread_scheduler.post_kill_notification(this);
595
#ifdef SIGNAL_WITH_VIO_CLOSE
596
    close_active_vio();
597
#endif    
598
  }
599
  if (mysys_var)
600 601 602 603 604 605 606 607 608
  {
    pthread_mutex_lock(&mysys_var->mutex);
    if (!system_thread)		// Don't abort locks
      mysys_var->abort=1;
    /*
      This broadcast could be up in the air if the victim thread
      exits the cond in the time between read and broadcast, but that is
      ok since all we want to do is to make the victim thread get out
      of waiting on current_cond.
609 610 611 612 613
      If we see a non-zero current_cond: it cannot be an old value (because
      then exit_cond() should have run and it can't because we have mutex); so
      it is the true value but maybe current_mutex is not yet non-zero (we're
      in the middle of enter_cond() and there is a "memory order
      inversion"). So we test the mutex too to not lock 0.
614

615
      Note that there is a small chance we fail to kill. If victim has locked
616 617 618 619 620
      current_mutex, but hasn't yet entered enter_cond() (which means that
      current_cond and current_mutex are 0), then the victim will not get
      a signal and it may wait "forever" on the cond (until
      we issue a second KILL or the status it's waiting for happens).
      It's true that we have set its thd->killed but it may not
621
      see it immediately and so may have time to reach the cond_wait().
622
    */
623
    if (mysys_var->current_cond && mysys_var->current_mutex)
624
    {
625 626 627
      pthread_mutex_lock(mysys_var->current_mutex);
      pthread_cond_broadcast(mysys_var->current_cond);
      pthread_mutex_unlock(mysys_var->current_mutex);
628
    }
629 630
    pthread_mutex_unlock(&mysys_var->mutex);
  }
631
  DBUG_VOID_RETURN;
632 633
}

634 635 636 637
/*
  Remember the location of thread info, the structure needed for
  sql_alloc() and the structure for the net buffer
*/
bk@work.mysql.com's avatar
bk@work.mysql.com committed
638 639 640

bool THD::store_globals()
{
641 642 643 644
  /*
    Assert that thread_stack is initialized: it's necessary to be able
    to track stack overrun.
  */
645
  DBUG_ASSERT(thread_stack);
646

647
  if (my_pthread_setspecific_ptr(THR_THD,  this) ||
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
648
      my_pthread_setspecific_ptr(THR_MALLOC, &mem_root))
649 650
    return 1;
  mysys_var=my_thread_var;
guilhem@mysql.com's avatar
guilhem@mysql.com committed
651
  /*
652 653
    Let mysqld define the thread id (not mysys)
    This allows us to move THD to different threads if needed.
guilhem@mysql.com's avatar
guilhem@mysql.com committed
654
  */
655 656 657
  mysys_var->id= thread_id;
  real_id= pthread_self();                      // For debugging

658 659 660 661
  /*
    We have to call thr_lock_info_init() again here as THD may have been
    created in another thread
  */
662
  thr_lock_info_init(&lock_info);
663
  return 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
664 665
}

666

667 668 669 670 671
/*
  Cleanup after query.

  SYNOPSIS
    THD::cleanup_after_query()
672

673
  DESCRIPTION
674
    This function is used to reset thread data to its default state.
675 676 677 678 679 680 681

  NOTE
    This function is not suitable for setting thread data to some
    non-default values, as there is only one replication thread, so
    different master threads may overwrite data of each other on
    slave.
*/
682

683 684
void THD::cleanup_after_query()
{
685 686 687 688 689 690 691 692 693 694
  /*
    Reset rand_used so that detection of calls to rand() will save random 
    seeds if needed by the slave.

    Do not reset rand_used if inside a stored function or trigger because 
    only the call to these operations is logged. Thus only the calling 
    statement needs to detect rand() calls made by its substatements. These
    substatements must not set rand_used to 0 because it would remove the
    detection of rand() by the calling statement. 
  */
695 696 697 698 699
  if (!in_sub_stmt) /* stored functions and triggers are a special case */
  {
    /* Forget those values, for next binlogger: */
    stmt_depends_on_first_successful_insert_id_in_prev_stmt= 0;
    auto_inc_intervals_in_cur_stmt_for_binlog.empty();
700
    rand_used= 0;
701
  }
702
  if (first_successful_insert_id_in_cur_stmt > 0)
703
  {
704 705 706 707
    /* set what LAST_INSERT_ID() will return */
    first_successful_insert_id_in_prev_stmt= 
      first_successful_insert_id_in_cur_stmt;
    first_successful_insert_id_in_cur_stmt= 0;
evgen@sunlight.local's avatar
evgen@sunlight.local committed
708
    substitute_null_with_insert_id= TRUE;
709
  }
710
  arg_of_last_insert_id_function= 0;
711
  /* Free Items that were created during this execution */
712
  free_items();
713 714
  /* Reset where. */
  where= THD::DEFAULT_WHERE;
715 716
}

717

monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
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
/*
  Convert a string to another character set

  SYNOPSIS
    convert_string()
    to				Store new allocated string here
    to_cs			New character set for allocated string
    from			String to convert
    from_length			Length of string to convert
    from_cs			Original character set

  NOTES
    to will be 0-terminated to make it easy to pass to system funcs

  RETURN
    0	ok
    1	End of memory.
        In this case to->str will point to 0 and to->length will be 0.
*/

bool THD::convert_string(LEX_STRING *to, CHARSET_INFO *to_cs,
			 const char *from, uint from_length,
			 CHARSET_INFO *from_cs)
{
  DBUG_ENTER("convert_string");
  size_s new_length= to_cs->mbmaxlen * from_length;
744
  uint dummy_errors;
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
745 746 747 748 749 750
  if (!(to->str= alloc(new_length+1)))
  {
    to->length= 0;				// Safety fix
    DBUG_RETURN(1);				// EOM
  }
  to->length= copy_and_convert((char*) to->str, new_length, to_cs,
751
			       from, from_length, from_cs, &dummy_errors);
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
752 753 754 755 756
  to->str[to->length]=0;			// Safety
  DBUG_RETURN(0);
}


757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773
/*
  Convert string from source character set to target character set inplace.

  SYNOPSIS
    THD::convert_string

  DESCRIPTION
    Convert string using convert_buffer - buffer for character set 
    conversion shared between all protocols.

  RETURN
    0   ok
   !0   out of memory
*/

bool THD::convert_string(String *s, CHARSET_INFO *from_cs, CHARSET_INFO *to_cs)
{
774 775
  uint dummy_errors;
  if (convert_buffer.copy(s->ptr(), s->length(), from_cs, to_cs, &dummy_errors))
776 777 778 779 780 781 782 783 784 785 786
    return TRUE;
  /* If convert_buffer >> s copying is more efficient long term */
  if (convert_buffer.alloced_length() >= convert_buffer.length() * 2 ||
      !s->is_alloced())
  {
    return s->copy(convert_buffer);
  }
  s->swap(convert_buffer);
  return FALSE;
}

787

monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
788 789 790 791 792 793
/*
  Update some cache variables when character set changes
*/

void THD::update_charset()
{
794 795 796 797 798 799 800
  uint32 not_used;
  charset_is_system_charset= !String::needs_conversion(0,charset(),
                                                       system_charset_info,
                                                       &not_used);
  charset_is_collation_connection= 
    !String::needs_conversion(0,charset(),variables.collation_connection,
                              &not_used);
801 802 803
  charset_is_character_set_filesystem= 
    !String::needs_conversion(0, charset(),
                              variables.character_set_filesystem, &not_used);
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
804 805 806
}


807 808 809 810 811 812 813 814 815 816 817 818 819 820
/* routings to adding tables to list of changed in transaction tables */

inline static void list_include(CHANGED_TABLE_LIST** prev,
				CHANGED_TABLE_LIST* curr,
				CHANGED_TABLE_LIST* new_table)
{
  if (new_table)
  {
    *prev = new_table;
    (*prev)->next = curr;
  }
}

/* add table to list of changed in transaction tables */
821

822 823
void THD::add_changed_table(TABLE *table)
{
824
  DBUG_ENTER("THD::add_changed_table(table)");
825

826
  DBUG_ASSERT((options & (OPTION_NOT_AUTOCOMMIT | OPTION_BEGIN)) &&
827
	      table->file->has_transactions());
828 829
  add_changed_table(table->s->table_cache_key.str,
                    table->s->table_cache_key.length);
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
830
  DBUG_VOID_RETURN;
831
}
832

833

834 835 836
void THD::add_changed_table(const char *key, long key_length)
{
  DBUG_ENTER("THD::add_changed_table(key)");
837 838
  CHANGED_TABLE_LIST **prev_changed = &transaction.changed_tables;
  CHANGED_TABLE_LIST *curr = transaction.changed_tables;
839

840
  for (; curr; prev_changed = &(curr->next), curr = curr->next)
841
  {
842
    int cmp =  (long)curr->key_length - (long)key_length;
843 844
    if (cmp < 0)
    {
845
      list_include(prev_changed, curr, changed_table_dup(key, key_length));
846
      DBUG_PRINT("info", 
847 848
		 ("key_length: %ld  %u", key_length,
                  (*prev_changed)->key_length));
849 850 851 852
      DBUG_VOID_RETURN;
    }
    else if (cmp == 0)
    {
853
      cmp = memcmp(curr->key, key, curr->key_length);
854 855
      if (cmp < 0)
      {
856
	list_include(prev_changed, curr, changed_table_dup(key, key_length));
857
	DBUG_PRINT("info", 
858
		   ("key_length:  %ld  %u", key_length,
859
		    (*prev_changed)->key_length));
860 861 862 863 864 865 866 867 868
	DBUG_VOID_RETURN;
      }
      else if (cmp == 0)
      {
	DBUG_PRINT("info", ("already in list"));
	DBUG_VOID_RETURN;
      }
    }
  }
869
  *prev_changed = changed_table_dup(key, key_length);
870
  DBUG_PRINT("info", ("key_length: %ld  %u", key_length,
871
		      (*prev_changed)->key_length));
872 873 874
  DBUG_VOID_RETURN;
}

875

876
CHANGED_TABLE_LIST* THD::changed_table_dup(const char *key, long key_length)
877 878 879
{
  CHANGED_TABLE_LIST* new_table = 
    (CHANGED_TABLE_LIST*) trans_alloc(ALIGN_SIZE(sizeof(CHANGED_TABLE_LIST))+
880
				      key_length + 1);
881 882
  if (!new_table)
  {
883 884
    my_error(EE_OUTOFMEMORY, MYF(ME_BELL),
             ALIGN_SIZE(sizeof(TABLE_LIST)) + key_length + 1);
hf@genie.(none)'s avatar
SCRUM  
hf@genie.(none) committed
885
    killed= KILL_CONNECTION;
886 887 888 889 890 891
    return 0;
  }

  new_table->key = (char *) (((byte*)new_table)+
			     ALIGN_SIZE(sizeof(CHANGED_TABLE_LIST)));
  new_table->next = 0;
892 893
  new_table->key_length = key_length;
  ::memcpy(new_table->key, key, key_length);
894 895 896
  return new_table;
}

897

bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
898 899 900 901
int THD::send_explain_fields(select_result *result)
{
  List<Item> field_list;
  Item *item;
902
  CHARSET_INFO *cs= system_charset_info;
903
  field_list.push_back(new Item_return_int("id",3, MYSQL_TYPE_LONGLONG));
904
  field_list.push_back(new Item_empty_string("select_type", 19, cs));
905
  field_list.push_back(item= new Item_empty_string("table", NAME_CHAR_LEN, cs));
igor@rurik.mysql.com's avatar
igor@rurik.mysql.com committed
906
  item->maybe_null= 1;
907 908
  if (lex->describe & DESCRIBE_PARTITIONS)
  {
909 910 911 912
    /* Maximum length of string that make_used_partitions_str() can produce */
    item= new Item_empty_string("partitions", MAX_PARTITIONS * (1 + FN_LEN),
                                cs);
    field_list.push_back(item);
913 914
    item->maybe_null= 1;
  }
igor@rurik.mysql.com's avatar
igor@rurik.mysql.com committed
915 916
  field_list.push_back(item= new Item_empty_string("type", 10, cs));
  item->maybe_null= 1;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
917
  field_list.push_back(item=new Item_empty_string("possible_keys",
918
						  NAME_CHAR_LEN*MAX_KEY, cs));
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
919
  item->maybe_null=1;
920
  field_list.push_back(item=new Item_empty_string("key", NAME_CHAR_LEN, cs));
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
921
  item->maybe_null=1;
922
  field_list.push_back(item=new Item_empty_string("key_len",
923
						  NAME_CHAR_LEN*MAX_KEY));
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
924 925
  item->maybe_null=1;
  field_list.push_back(item=new Item_empty_string("ref",
926 927
                                                  NAME_CHAR_LEN*MAX_REF_PARTS,
                                                  cs));
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
928
  item->maybe_null=1;
igor@rurik.mysql.com's avatar
igor@rurik.mysql.com committed
929 930
  field_list.push_back(item= new Item_return_int("rows", 10,
                                                 MYSQL_TYPE_LONGLONG));
931 932 933 934 935
  if (lex->describe & DESCRIBE_EXTENDED)
  {
    field_list.push_back(item= new Item_float("filtered", 0.1234, 2, 4));
    item->maybe_null=1;
  }
igor@rurik.mysql.com's avatar
igor@rurik.mysql.com committed
936
  item->maybe_null= 1;
937
  field_list.push_back(new Item_empty_string("Extra", 255, cs));
938 939
  return (result->send_fields(field_list,
                              Protocol::SEND_NUM_ROWS | Protocol::SEND_EOF));
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
940
}
941

942 943 944
#ifdef SIGNAL_WITH_VIO_CLOSE
void THD::close_active_vio()
{
945
  DBUG_ENTER("close_active_vio");
946
  safe_mutex_assert_owner(&LOCK_delete); 
947
#ifndef EMBEDDED_LIBRARY
948 949 950 951 952
  if (active_vio)
  {
    vio_close(active_vio);
    active_vio = 0;
  }
953
#endif
954
  DBUG_VOID_RETURN;
955 956 957
}
#endif

958

959 960 961 962 963
struct Item_change_record: public ilink
{
  Item **place;
  Item *old_value;
  /* Placement new was hidden by `new' in ilink (TODO: check): */
964
  static void *operator new(size_t size, void *mem) { return mem; }
965 966
  static void operator delete(void *ptr, size_t size) {}
  static void operator delete(void *ptr, void *mem) { /* never called */ }
967 968 969 970 971 972
};


/*
  Register an item tree tree transformation, performed by the query
  optimizer. We need a pointer to runtime_memroot because it may be !=
konstantin@mysql.com's avatar
konstantin@mysql.com committed
973
  thd->mem_root (due to possible set_n_backup_active_arena called for thd).
974 975 976 977 978 979 980 981 982 983 984 985 986 987
*/

void THD::nocheck_register_item_tree_change(Item **place, Item *old_value,
                                            MEM_ROOT *runtime_memroot)
{
  Item_change_record *change;
  /*
    Now we use one node per change, which adds some memory overhead,
    but still is rather fast as we use alloc_root for allocations.
    A list of item tree changes of an average query should be short.
  */
  void *change_mem= alloc_root(runtime_memroot, sizeof(*change));
  if (change_mem == 0)
  {
988 989 990 991
    /*
      OOM, thd->fatal_error() is called by the error handler of the
      memroot. Just return.
    */
992 993 994 995 996
    return;
  }
  change= new (change_mem) Item_change_record;
  change->place= place;
  change->old_value= old_value;
997
  change_list.append(change);
998 999 1000 1001 1002 1003 1004
}


void THD::rollback_item_tree_changes()
{
  I_List_iterator<Item_change_record> it(change_list);
  Item_change_record *change;
monty@mysql.com's avatar
monty@mysql.com committed
1005 1006
  DBUG_ENTER("rollback_item_tree_changes");

1007 1008 1009 1010
  while ((change= it++))
    *change->place= change->old_value;
  /* We can forget about changes memory: it's allocated in runtime memroot */
  change_list.empty();
monty@mysql.com's avatar
monty@mysql.com committed
1011
  DBUG_VOID_RETURN;
1012 1013 1014
}


bk@work.mysql.com's avatar
bk@work.mysql.com committed
1015 1016 1017 1018 1019 1020 1021 1022 1023
/*****************************************************************************
** Functions to provide a interface to select results
*****************************************************************************/

select_result::select_result()
{
  thd=current_thd;
}

1024 1025
void select_result::send_error(uint errcode,const char *err)
{
1026
  my_message(errcode, err, MYF(0));
1027 1028
}

1029 1030 1031 1032 1033 1034

void select_result::cleanup()
{
  /* do nothing */
}

1035 1036 1037 1038 1039 1040 1041
bool select_result::check_simple_select() const
{
  my_error(ER_SP_BAD_CURSOR_QUERY, MYF(0));
  return TRUE;
}


1042 1043 1044
static String default_line_term("\n",default_charset_info);
static String default_escaped("\\",default_charset_info);
static String default_field_term("\t",default_charset_info);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1045 1046 1047 1048 1049

sql_exchange::sql_exchange(char *name,bool flag)
  :file_name(name), opt_enclosed(0), dumpfile(flag), skip_lines(0)
{
  field_term= &default_field_term;
hf@deer.(none)'s avatar
SCRUM  
hf@deer.(none) committed
1050
  enclosed=   line_start= &my_empty_string;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1051 1052
  line_term=  &default_line_term;
  escaped=    &default_escaped;
1053
  cs= NULL;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1054 1055
}

1056
bool select_send::send_fields(List<Item> &list, uint flags)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1057
{
1058 1059 1060 1061
  bool res;
  if (!(res= thd->protocol->send_fields(&list, flags)))
    status= 1;
  return res;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1062 1063
}

1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085
void select_send::abort()
{
  DBUG_ENTER("select_send::abort");
  if (status && thd->spcont &&
      thd->spcont->find_handler(thd->net.last_errno,
                                MYSQL_ERROR::WARN_LEVEL_ERROR))
  {
    /*
      Executing stored procedure without a handler.
      Here we should actually send an error to the client,
      but as an error will break a multiple result set, the only thing we
      can do for now is to nicely end the current data set and remembering
      the error so that the calling routine will abort
    */
    thd->net.report_error= 0;
    send_eof();
    thd->net.report_error= 1; // Abort SP
  }
  DBUG_VOID_RETURN;
}


bk@work.mysql.com's avatar
bk@work.mysql.com committed
1086 1087 1088 1089
/* Send data to client. Returns 0 if ok */

bool select_send::send_data(List<Item> &items)
{
1090
  if (unit->offset_limit_cnt)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1091
  {						// using limit offset,count
1092
    unit->offset_limit_cnt--;
1093
    return 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1094
  }
1095

monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
1096 1097 1098 1099 1100
  /*
    We may be passing the control from mysqld to the client: release the
    InnoDB adaptive hash S-latch to avoid thread deadlocks if it was reserved
    by thd
  */
1101
  ha_release_temporary_latches(thd);
1102

1103 1104 1105
  List_iterator_fast<Item> li(items);
  Protocol *protocol= thd->protocol;
  char buff[MAX_FIELD_WIDTH];
1106
  String buffer(buff, sizeof(buff), &my_charset_bin);
1107
  DBUG_ENTER("select_send::send_data");
1108 1109

  protocol->prepare_for_resend();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1110 1111 1112
  Item *item;
  while ((item=li++))
  {
1113
    if (item->send(protocol, &buffer))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1114
    {
1115
      protocol->free();				// Free used buffer
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1116
      my_message(ER_OUT_OF_RESOURCES, ER(ER_OUT_OF_RESOURCES), MYF(0));
1117
      break;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1118 1119
    }
  }
1120
  thd->sent_row_count++;
1121
  if (!thd->vio_ok())
1122
    DBUG_RETURN(0);
1123
  if (!thd->net.report_error)
1124
    DBUG_RETURN(protocol->write());
1125
  protocol->remove_last_row();
1126
  DBUG_RETURN(1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1127 1128 1129 1130
}

bool select_send::send_eof()
{
1131 1132 1133 1134 1135 1136
  /* 
    We may be passing the control from mysqld to the client: release the
    InnoDB adaptive hash S-latch to avoid thread deadlocks if it was reserved
    by thd 
  */
  ha_release_temporary_latches(thd);
1137

bk@work.mysql.com's avatar
bk@work.mysql.com committed
1138 1139 1140
  /* Unlock tables before sending packet to gain some speed */
  if (thd->lock)
  {
1141 1142
    mysql_unlock_tables(thd, thd->lock);
    thd->lock=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1143
  }
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1144 1145
  if (!thd->net.report_error)
  {
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1146
    ::send_eof(thd);
1147
    status= 0;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1148 1149 1150 1151
    return 0;
  }
  else
    return 1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1152 1153 1154
}


1155 1156 1157
/************************************************************************
  Handling writing to file
************************************************************************/
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1158

1159 1160
void select_to_file::send_error(uint errcode,const char *err)
{
1161
  my_message(errcode, err, MYF(0));
1162 1163 1164 1165 1166 1167 1168 1169
  if (file > 0)
  {
    (void) end_io_cache(&cache);
    (void) my_close(file,MYF(0));
    (void) my_delete(path,MYF(0));		// Delete file on error
    file= -1;
  }
}
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1170 1171


1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197
bool select_to_file::send_eof()
{
  int error= test(end_io_cache(&cache));
  if (my_close(file,MYF(MY_WME)))
    error= 1;
  if (!error)
    ::send_ok(thd,row_count);
  file= -1;
  return error;
}


void select_to_file::cleanup()
{
  /* In case of error send_eof() may be not called: close the file here. */
  if (file >= 0)
  {
    (void) end_io_cache(&cache);
    (void) my_close(file,MYF(0));
    file= -1;
  }
  path[0]= '\0';
  row_count= 0;
}


1198
select_to_file::~select_to_file()
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1199 1200 1201 1202 1203 1204 1205
{
  if (file >= 0)
  {					// This only happens in case of error
    (void) end_io_cache(&cache);
    (void) my_close(file,MYF(0));
    file= -1;
  }
1206 1207 1208 1209 1210 1211 1212 1213
}

/***************************************************************************
** Export of select to textfile
***************************************************************************/

select_export::~select_export()
{
1214
  thd->sent_row_count=row_count;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1215 1216
}

1217

1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235
/*
  Create file with IO cache

  SYNOPSIS
    create_file()
    thd			Thread handle
    path		File name
    exchange		Excange class
    cache		IO cache

  RETURN
    >= 0 	File handle
   -1		Error
*/


static File create_file(THD *thd, char *path, sql_exchange *exchange,
			IO_CACHE *cache)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1236
{
1237
  File file;
1238
  uint option= MY_UNPACK_FILENAME | MY_RELATIVE_PATH;
1239

bk@work.mysql.com's avatar
bk@work.mysql.com committed
1240
#ifdef DONT_ALLOW_FULL_LOAD_DATA_PATHS
1241
  option|= MY_REPLACE_DIR;			// Force use of db directory
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1242
#endif
1243

hf@deer.(none)'s avatar
hf@deer.(none) committed
1244
  if (!dirname_length(exchange->file_name))
1245
  {
1246 1247
    strxnmov(path, FN_REFLEN-1, mysql_real_data_home, thd->db ? thd->db : "",
             NullS);
1248 1249 1250 1251
    (void) fn_format(path, exchange->file_name, path, "", option);
  }
  else
    (void) fn_format(path, exchange->file_name, mysql_real_data_home, "", option);
1252 1253 1254 1255 1256 1257 1258 1259 1260

  if (opt_secure_file_priv &&
      strncmp(opt_secure_file_priv, path, strlen(opt_secure_file_priv)))
  {
    /* Write only allowed to dir or subdir specified by secure_file_priv */
    my_error(ER_OPTION_PREVENTS_STATEMENT, MYF(0), "--secure-file-priv");
    return -1;
  }

1261
  if (!access(path, F_OK))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1262
  {
1263
    my_error(ER_FILE_EXISTS_ERROR, MYF(0), exchange->file_name);
1264
    return -1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1265 1266
  }
  /* Create the file world readable */
serg@serg.mylan's avatar
serg@serg.mylan committed
1267
  if ((file= my_create(path, 0666, O_WRONLY|O_EXCL, MYF(MY_WME))) < 0)
1268
    return file;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1269
#ifdef HAVE_FCHMOD
1270
  (void) fchmod(file, 0666);			// Because of umask()
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1271
#else
1272
  (void) chmod(path, 0666);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1273
#endif
1274
  if (init_io_cache(cache, file, 0L, WRITE_CACHE, 0L, 1, MYF(MY_WME)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1275
  {
1276
    my_close(file, MYF(0));
1277
    my_delete(path, MYF(0));  // Delete file on error, it was just created 
1278
    return -1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1279
  }
1280
  return file;
1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291
}


int
select_export::prepare(List<Item> &list, SELECT_LEX_UNIT *u)
{
  bool blob_flag=0;
  unit= u;
  if ((uint) strlen(exchange->file_name) + NAME_LEN >= FN_REFLEN)
    strmake(path,exchange->file_name,FN_REFLEN-1);

1292
  if ((file= create_file(thd, path, exchange, &cache)) < 0)
1293
    return 1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1294 1295
  /* Check if there is any blobs in data */
  {
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
1296
    List_iterator_fast<Item> li(list);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327
    Item *item;
    while ((item=li++))
    {
      if (item->max_length >= MAX_BLOB_WIDTH)
      {
	blob_flag=1;
	break;
      }
    }
  }
  field_term_length=exchange->field_term->length();
  if (!exchange->line_term->length())
    exchange->line_term=exchange->field_term;	// Use this if it exists
  field_sep_char= (exchange->enclosed->length() ? (*exchange->enclosed)[0] :
		   field_term_length ? (*exchange->field_term)[0] : INT_MAX);
  escape_char=	(exchange->escaped->length() ? (*exchange->escaped)[0] : -1);
  line_sep_char= (exchange->line_term->length() ?
		  (*exchange->line_term)[0] : INT_MAX);
  if (!field_term_length)
    exchange->opt_enclosed=0;
  if (!exchange->enclosed->length())
    exchange->opt_enclosed=1;			// A little quicker loop
  fixed_row_size= (!field_term_length && !exchange->enclosed->length() &&
		   !blob_flag);
  return 0;
}


bool select_export::send_data(List<Item> &items)
{

1328
  DBUG_ENTER("select_export::send_data");
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1329 1330
  char buff[MAX_FIELD_WIDTH],null_buff[2],space[MAX_FIELD_WIDTH];
  bool space_inited=0;
1331
  String tmp(buff,sizeof(buff),&my_charset_bin),*res;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1332 1333
  tmp.length(0);

1334
  if (unit->offset_limit_cnt)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1335
  {						// using limit offset,count
1336
    unit->offset_limit_cnt--;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1337 1338 1339 1340 1341
    DBUG_RETURN(0);
  }
  row_count++;
  Item *item;
  uint used_length=0,items_left=items.elements;
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
1342
  List_iterator_fast<Item> li(items);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390

  if (my_b_write(&cache,(byte*) exchange->line_start->ptr(),
		 exchange->line_start->length()))
    goto err;
  while ((item=li++))
  {
    Item_result result_type=item->result_type();
    res=item->str_result(&tmp);
    if (res && (!exchange->opt_enclosed || result_type == STRING_RESULT))
    {
      if (my_b_write(&cache,(byte*) exchange->enclosed->ptr(),
		     exchange->enclosed->length()))
	goto err;
    }
    if (!res)
    {						// NULL
      if (!fixed_row_size)
      {
	if (escape_char != -1)			// Use \N syntax
	{
	  null_buff[0]=escape_char;
	  null_buff[1]='N';
	  if (my_b_write(&cache,(byte*) null_buff,2))
	    goto err;
	}
	else if (my_b_write(&cache,(byte*) "NULL",4))
	  goto err;
      }
      else
      {
	used_length=0;				// Fill with space
      }
    }
    else
    {
      if (fixed_row_size)
	used_length=min(res->length(),item->max_length);
      else
	used_length=res->length();
      if (result_type == STRING_RESULT && escape_char != -1)
      {
	char *pos,*start,*end;

	for (start=pos=(char*) res->ptr(),end=pos+used_length ;
	     pos != end ;
	     pos++)
	{
#ifdef USE_MB
1391 1392
          CHARSET_INFO *res_charset=res->charset();
	  if (use_mb(res_charset))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1393 1394
	  {
	    int l;
1395
	    if ((l=my_ismbchar(res_charset, pos, end)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430
	    {
	      pos += l-1;
	      continue;
	    }
	  }
#endif
	  if ((int) *pos == escape_char || (int) *pos == field_sep_char ||
	      (int) *pos == line_sep_char || !*pos)
	  {
	    char tmp_buff[2];
	    tmp_buff[0]= escape_char;
	    tmp_buff[1]= *pos ? *pos : '0';
	    if (my_b_write(&cache,(byte*) start,(uint) (pos-start)) ||
		my_b_write(&cache,(byte*) tmp_buff,2))
	      goto err;
	    start=pos+1;
	  }
	}
	if (my_b_write(&cache,(byte*) start,(uint) (pos-start)))
	  goto err;
      }
      else if (my_b_write(&cache,(byte*) res->ptr(),used_length))
	goto err;
    }
    if (fixed_row_size)
    {						// Fill with space
      if (item->max_length > used_length)
      {
	/* QQ:  Fix by adding a my_b_fill() function */
	if (!space_inited)
	{
	  space_inited=1;
	  bfill(space,sizeof(space),' ');
	}
	uint length=item->max_length-used_length;
1431
	for (; length > sizeof(space) ; length-=sizeof(space))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1432 1433 1434 1435 1436 1437 1438 1439 1440 1441
	{
	  if (my_b_write(&cache,(byte*) space,sizeof(space)))
	    goto err;
	}
	if (my_b_write(&cache,(byte*) space,length))
	  goto err;
      }
    }
    if (res && (!exchange->opt_enclosed || result_type == STRING_RESULT))
    {
1442 1443 1444
      if (my_b_write(&cache, (byte*) exchange->enclosed->ptr(),
                     exchange->enclosed->length()))
        goto err;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1445 1446 1447
    }
    if (--items_left)
    {
1448 1449 1450
      if (my_b_write(&cache, (byte*) exchange->field_term->ptr(),
                     field_term_length))
        goto err;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467
    }
  }
  if (my_b_write(&cache,(byte*) exchange->line_term->ptr(),
		 exchange->line_term->length()))
    goto err;
  DBUG_RETURN(0);
err:
  DBUG_RETURN(1);
}


/***************************************************************************
** Dump  of select to a binary file
***************************************************************************/


int
1468 1469
select_dump::prepare(List<Item> &list __attribute__((unused)),
		     SELECT_LEX_UNIT *u)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1470
{
1471
  unit= u;
1472
  return (int) ((file= create_file(thd, path, exchange, &cache)) < 0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1473 1474 1475 1476 1477
}


bool select_dump::send_data(List<Item> &items)
{
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
1478
  List_iterator_fast<Item> li(items);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1479
  char buff[MAX_FIELD_WIDTH];
1480
  String tmp(buff,sizeof(buff),&my_charset_bin),*res;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1481 1482
  tmp.length(0);
  Item *item;
1483
  DBUG_ENTER("select_dump::send_data");
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1484

1485
  if (unit->offset_limit_cnt)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1486
  {						// using limit offset,count
1487
    unit->offset_limit_cnt--;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1488 1489 1490 1491
    DBUG_RETURN(0);
  }
  if (row_count++ > 1) 
  {
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1492
    my_message(ER_TOO_MANY_ROWS, ER(ER_TOO_MANY_ROWS), MYF(0));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1493 1494 1495 1496 1497
    goto err;
  }
  while ((item=li++))
  {
    res=item->str_result(&tmp);
1498
    if (!res)					// If NULL
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1499
    {
1500 1501
      if (my_b_write(&cache,(byte*) "",1))
	goto err;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1502 1503 1504
    }
    else if (my_b_write(&cache,(byte*) res->ptr(),res->length()))
    {
1505
      my_error(ER_ERROR_ON_WRITE, MYF(0), path, my_errno);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1506 1507 1508 1509 1510 1511 1512 1513 1514
      goto err;
    }
  }
  DBUG_RETURN(0);
err:
  DBUG_RETURN(1);
}


1515
select_subselect::select_subselect(Item_subselect *item_arg)
1516
{
1517
  item= item_arg;
1518 1519
}

1520

1521
bool select_singlerow_subselect::send_data(List<Item> &items)
1522
{
1523 1524
  DBUG_ENTER("select_singlerow_subselect::send_data");
  Item_singlerow_subselect *it= (Item_singlerow_subselect *)item;
Sinisa@sinisa.nasamreza.org's avatar
Sinisa@sinisa.nasamreza.org committed
1525 1526
  if (it->assigned())
  {
1527
    my_message(ER_SUBQUERY_NO_1_ROW, ER(ER_SUBQUERY_NO_1_ROW), MYF(0));
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1528 1529 1530
    DBUG_RETURN(1);
  }
  if (unit->offset_limit_cnt)
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1531
  {				          // Using limit offset,count
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1532 1533
    unit->offset_limit_cnt--;
    DBUG_RETURN(0);
1534
  }
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1535
  List_iterator_fast<Item> li(items);
1536 1537 1538
  Item *val_item;
  for (uint i= 0; (val_item= li++); i++)
    it->store(i, val_item);
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1539
  it->assigned(1);
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1540
  DBUG_RETURN(0);
1541
}
1542

1543

1544 1545 1546 1547 1548 1549 1550 1551
void select_max_min_finder_subselect::cleanup()
{
  DBUG_ENTER("select_max_min_finder_subselect::cleanup");
  cache= 0;
  DBUG_VOID_RETURN;
}


1552 1553 1554
bool select_max_min_finder_subselect::send_data(List<Item> &items)
{
  DBUG_ENTER("select_max_min_finder_subselect::send_data");
1555
  Item_maxmin_subselect *it= (Item_maxmin_subselect *)item;
1556 1557
  List_iterator_fast<Item> li(items);
  Item *val_item= li++;
1558
  it->register_value();
1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580
  if (it->assigned())
  {
    cache->store(val_item);
    if ((this->*op)())
      it->store(0, cache);
  }
  else
  {
    if (!cache)
    {
      cache= Item_cache::get_cache(val_item->result_type());
      switch (val_item->result_type())
      {
      case REAL_RESULT:
	op= &select_max_min_finder_subselect::cmp_real;
	break;
      case INT_RESULT:
	op= &select_max_min_finder_subselect::cmp_int;
	break;
      case STRING_RESULT:
	op= &select_max_min_finder_subselect::cmp_str;
	break;
1581 1582 1583
      case DECIMAL_RESULT:
        op= &select_max_min_finder_subselect::cmp_decimal;
        break;
1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598
      case ROW_RESULT:
        // This case should never be choosen
	DBUG_ASSERT(0);
	op= 0;
      }
    }
    cache->store(val_item);
    it->store(0, cache);
  }
  it->assigned(1);
  DBUG_RETURN(0);
}

bool select_max_min_finder_subselect::cmp_real()
{
1599
  Item *maxmin= ((Item_singlerow_subselect *)item)->element_index(0);
1600
  double val1= cache->val_real(), val2= maxmin->val_real();
1601 1602 1603 1604
  if (fmax)
    return (cache->null_value && !maxmin->null_value) ||
      (!cache->null_value && !maxmin->null_value &&
       val1 > val2);
1605 1606 1607
  return (maxmin->null_value && !cache->null_value) ||
    (!cache->null_value && !maxmin->null_value &&
     val1 < val2);
1608 1609 1610 1611
}

bool select_max_min_finder_subselect::cmp_int()
{
1612
  Item *maxmin= ((Item_singlerow_subselect *)item)->element_index(0);
1613 1614 1615 1616 1617
  longlong val1= cache->val_int(), val2= maxmin->val_int();
  if (fmax)
    return (cache->null_value && !maxmin->null_value) ||
      (!cache->null_value && !maxmin->null_value &&
       val1 > val2);
1618 1619 1620
  return (maxmin->null_value && !cache->null_value) ||
    (!cache->null_value && !maxmin->null_value &&
     val1 < val2);
1621 1622
}

1623 1624
bool select_max_min_finder_subselect::cmp_decimal()
{
1625
  Item *maxmin= ((Item_singlerow_subselect *)item)->element_index(0);
1626 1627 1628 1629 1630 1631
  my_decimal cval, *cvalue= cache->val_decimal(&cval);
  my_decimal mval, *mvalue= maxmin->val_decimal(&mval);
  if (fmax)
    return (cache->null_value && !maxmin->null_value) ||
      (!cache->null_value && !maxmin->null_value &&
       my_decimal_cmp(cvalue, mvalue) > 0) ;
1632 1633 1634
  return (maxmin->null_value && !cache->null_value) ||
    (!cache->null_value && !maxmin->null_value &&
     my_decimal_cmp(cvalue,mvalue) < 0);
1635 1636
}

1637 1638 1639
bool select_max_min_finder_subselect::cmp_str()
{
  String *val1, *val2, buf1, buf2;
1640
  Item *maxmin= ((Item_singlerow_subselect *)item)->element_index(0);
1641 1642 1643 1644 1645 1646 1647 1648 1649 1650
  /*
    as far as both operand is Item_cache buf1 & buf2 will not be used,
    but added for safety
  */
  val1= cache->val_str(&buf1);
  val2= maxmin->val_str(&buf1);
  if (fmax)
    return (cache->null_value && !maxmin->null_value) ||
      (!cache->null_value && !maxmin->null_value &&
       sortcmp(val1, val2, cache->collation.collation) > 0) ;
1651 1652 1653
  return (maxmin->null_value && !cache->null_value) ||
    (!cache->null_value && !maxmin->null_value &&
     sortcmp(val1, val2, cache->collation.collation) < 0);
1654 1655
}

1656 1657 1658 1659 1660 1661 1662 1663 1664 1665
bool select_exists_subselect::send_data(List<Item> &items)
{
  DBUG_ENTER("select_exists_subselect::send_data");
  Item_exists_subselect *it= (Item_exists_subselect *)item;
  if (unit->offset_limit_cnt)
  {				          // Using limit offset,count
    unit->offset_limit_cnt--;
    DBUG_RETURN(0);
  }
  it->value= 1;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1666
  it->assigned(1);
1667 1668 1669
  DBUG_RETURN(0);
}

Sinisa@sinisa.nasamreza.org's avatar
Sinisa@sinisa.nasamreza.org committed
1670 1671

/***************************************************************************
1672
  Dump of select to variables
Sinisa@sinisa.nasamreza.org's avatar
Sinisa@sinisa.nasamreza.org committed
1673
***************************************************************************/
1674

1675
int select_dumpvar::prepare(List<Item> &list, SELECT_LEX_UNIT *u)
Sinisa@sinisa.nasamreza.org's avatar
Sinisa@sinisa.nasamreza.org committed
1676
{
1677
  unit= u;
1678
  
1679
  if (var_list.elements != list.elements)
Sinisa@sinisa.nasamreza.org's avatar
Sinisa@sinisa.nasamreza.org committed
1680
  {
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1681 1682
    my_message(ER_WRONG_NUMBER_OF_COLUMNS_IN_SELECT,
               ER(ER_WRONG_NUMBER_OF_COLUMNS_IN_SELECT), MYF(0));
1683
    return 1;
1684
  }               
1685 1686
  return 0;
}
1687

1688

1689 1690 1691 1692 1693 1694 1695
bool select_dumpvar::check_simple_select() const
{
  my_error(ER_SP_BAD_CURSOR_SELECT, MYF(0));
  return TRUE;
}


1696 1697
void select_dumpvar::cleanup()
{
1698
  row_count= 0;
1699 1700 1701
}


serg@serg.mylan's avatar
serg@serg.mylan committed
1702
Query_arena::Type Query_arena::type() const
1703
{
monty@mysql.com's avatar
monty@mysql.com committed
1704
  DBUG_ASSERT(0); /* Should never be called */
1705
  return STATEMENT;
1706 1707 1708
}


1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723
void Query_arena::free_items()
{
  Item *next;
  DBUG_ENTER("Query_arena::free_items");
  /* This works because items are allocated with sql_alloc() */
  for (; free_list; free_list= next)
  {
    next= free_list->next;
    free_list->delete_self();
  }
  /* Postcondition: free_list is 0 */
  DBUG_VOID_RETURN;
}


1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736
void Query_arena::set_query_arena(Query_arena *set)
{
  mem_root=  set->mem_root;
  free_list= set->free_list;
  state= set->state;
}


void Query_arena::cleanup_stmt()
{
  DBUG_ASSERT("Query_arena::cleanup_stmt()" == "not implemented");
}

1737 1738 1739 1740
/*
  Statement functions 
*/

1741 1742 1743
Statement::Statement(LEX *lex_arg, MEM_ROOT *mem_root_arg,
                     enum enum_state state_arg, ulong id_arg)
  :Query_arena(mem_root_arg, state_arg),
1744
  id(id_arg),
1745
  mark_used_columns(MARK_COLUMNS_READ),
1746
  lex(lex_arg),
1747
  query(0),
1748 1749
  query_length(0),
  cursor(0)
1750
{
1751
  name.str= NULL;
1752 1753 1754
}


serg@serg.mylan's avatar
serg@serg.mylan committed
1755
Query_arena::Type Statement::type() const
1756 1757 1758 1759 1760 1761 1762 1763
{
  return STATEMENT;
}


void Statement::set_statement(Statement *stmt)
{
  id=             stmt->id;
1764
  mark_used_columns=   stmt->mark_used_columns;
1765 1766 1767
  lex=            stmt->lex;
  query=          stmt->query;
  query_length=   stmt->query_length;
1768
  cursor=         stmt->cursor;
1769 1770 1771
}


1772 1773 1774
void
Statement::set_n_backup_statement(Statement *stmt, Statement *backup)
{
1775
  DBUG_ENTER("Statement::set_n_backup_statement");
1776 1777
  backup->set_statement(this);
  set_statement(stmt);
1778
  DBUG_VOID_RETURN;
1779 1780 1781 1782 1783
}


void Statement::restore_backup_statement(Statement *stmt, Statement *backup)
{
1784
  DBUG_ENTER("Statement::restore_backup_statement");
1785 1786
  stmt->set_statement(this);
  set_statement(backup);
1787
  DBUG_VOID_RETURN;
1788 1789 1790
}


1791
void THD::end_statement()
1792
{
1793
  /* Cleanup SQL processing state to reuse this statement in next query. */
1794 1795 1796
  lex_end(lex);
  delete lex->result;
  lex->result= 0;
1797 1798
  /* Note that free_list is freed in cleanup_after_query() */

1799 1800 1801 1802 1803 1804 1805
  /*
    Don't free mem_root, as mem_root is freed in the end of dispatch_command
    (once for any command).
  */
}


konstantin@mysql.com's avatar
konstantin@mysql.com committed
1806
void THD::set_n_backup_active_arena(Query_arena *set, Query_arena *backup)
1807
{
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1808
  DBUG_ENTER("THD::set_n_backup_active_arena");
1809
  DBUG_ASSERT(backup->is_backup_arena == FALSE);
1810

konstantin@mysql.com's avatar
konstantin@mysql.com committed
1811 1812
  backup->set_query_arena(this);
  set_query_arena(set);
monty@mysql.com's avatar
monty@mysql.com committed
1813
#ifndef DBUG_OFF
1814
  backup->is_backup_arena= TRUE;
monty@mysql.com's avatar
monty@mysql.com committed
1815
#endif
1816
  DBUG_VOID_RETURN;
1817 1818 1819
}


konstantin@mysql.com's avatar
konstantin@mysql.com committed
1820
void THD::restore_active_arena(Query_arena *set, Query_arena *backup)
1821
{
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1822
  DBUG_ENTER("THD::restore_active_arena");
1823
  DBUG_ASSERT(backup->is_backup_arena);
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1824 1825
  set->set_query_arena(this);
  set_query_arena(backup);
monty@mysql.com's avatar
monty@mysql.com committed
1826
#ifndef DBUG_OFF
1827
  backup->is_backup_arena= FALSE;
1828
#endif
monty@mysql.com's avatar
monty@mysql.com committed
1829
  DBUG_VOID_RETURN;
1830 1831
}

1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851
Statement::~Statement()
{
}

C_MODE_START

static byte *
get_statement_id_as_hash_key(const byte *record, uint *key_length,
                             my_bool not_used __attribute__((unused)))
{
  const Statement *statement= (const Statement *) record; 
  *key_length= sizeof(statement->id);
  return (byte *) &((const Statement *) statement)->id;
}

static void delete_statement_as_hash_key(void *key)
{
  delete (Statement *) key;
}

1852 1853
static byte *get_stmt_name_hash_key(Statement *entry, uint *length,
                                    my_bool not_used __attribute__((unused)))
1854 1855 1856 1857 1858
{
  *length=(uint) entry->name.length;
  return (byte*) entry->name.str;
}

1859 1860 1861 1862 1863
C_MODE_END

Statement_map::Statement_map() :
  last_found_statement(0)
{
1864 1865 1866 1867 1868
  enum
  {
    START_STMT_HASH_SIZE = 16,
    START_NAME_HASH_SIZE = 16
  };
1869
  hash_init(&st_hash, &my_charset_bin, START_STMT_HASH_SIZE, 0, 0,
1870 1871
            get_statement_id_as_hash_key,
            delete_statement_as_hash_key, MYF(0));
1872
  hash_init(&names_hash, system_charset_info, START_NAME_HASH_SIZE, 0, 0,
1873 1874
            (hash_get_key) get_stmt_name_hash_key,
            NULL,MYF(0));
1875 1876
}

1877

1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899
/*
  Insert a new statement to the thread-local statement map.

  DESCRIPTION
    If there was an old statement with the same name, replace it with the
    new one. Otherwise, check if max_prepared_stmt_count is not reached yet,
    increase prepared_stmt_count, and insert the new statement. It's okay
    to delete an old statement and fail to insert the new one.

  POSTCONDITIONS
    All named prepared statements are also present in names_hash.
    Statement names in names_hash are unique.
    The statement is added only if prepared_stmt_count < max_prepard_stmt_count
    last_found_statement always points to a valid statement or is 0

  RETURN VALUE
    0  success
    1  error: out of resources or max_prepared_stmt_count limit has been
       reached. An error is sent to the client, the statement is deleted.
*/

int Statement_map::insert(THD *thd, Statement *statement)
1900
{
1901
  if (my_hash_insert(&st_hash, (byte*) statement))
1902
  {
1903 1904 1905 1906 1907 1908 1909 1910
    /*
      Delete is needed only in case of an insert failure. In all other
      cases hash_delete will also delete the statement.
    */
    delete statement;
    my_error(ER_OUT_OF_RESOURCES, MYF(0));
    goto err_st_hash;
  }
1911
  if (statement->name.str && my_hash_insert(&names_hash, (byte*) statement))
1912
  {
1913 1914
    my_error(ER_OUT_OF_RESOURCES, MYF(0));
    goto err_names_hash;
1915
  }
1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926
  pthread_mutex_lock(&LOCK_prepared_stmt_count);
  /*
    We don't check that prepared_stmt_count is <= max_prepared_stmt_count
    because we would like to allow to lower the total limit
    of prepared statements below the current count. In that case
    no new statements can be added until prepared_stmt_count drops below
    the limit.
  */
  if (prepared_stmt_count >= max_prepared_stmt_count)
  {
    pthread_mutex_unlock(&LOCK_prepared_stmt_count);
1927 1928
    my_error(ER_MAX_PREPARED_STMT_COUNT_REACHED, MYF(0),
             max_prepared_stmt_count);
1929 1930 1931 1932 1933
    goto err_max;
  }
  prepared_stmt_count++;
  pthread_mutex_unlock(&LOCK_prepared_stmt_count);

1934
  last_found_statement= statement;
1935 1936 1937 1938 1939 1940 1941 1942 1943
  return 0;

err_max:
  if (statement->name.str)
    hash_delete(&names_hash, (byte*) statement);
err_names_hash:
  hash_delete(&st_hash, (byte*) statement);
err_st_hash:
  return 1;
1944 1945
}

1946

1947 1948
void Statement_map::close_transient_cursors()
{
1949
#ifdef TO_BE_IMPLEMENTED
1950 1951 1952
  Statement *stmt;
  while ((stmt= transient_cursor_list.head()))
    stmt->close_cursor();                 /* deletes itself from the list */
1953
#endif
1954 1955 1956
}


1957 1958 1959 1960 1961 1962
void Statement_map::erase(Statement *statement)
{
  if (statement == last_found_statement)
    last_found_statement= 0;
  if (statement->name.str)
    hash_delete(&names_hash, (byte *) statement);
1963

1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982
  hash_delete(&st_hash, (byte *) statement);
  pthread_mutex_lock(&LOCK_prepared_stmt_count);
  DBUG_ASSERT(prepared_stmt_count > 0);
  prepared_stmt_count--;
  pthread_mutex_unlock(&LOCK_prepared_stmt_count);
}


void Statement_map::reset()
{
  /* Must be first, hash_free will reset st_hash.records */
  pthread_mutex_lock(&LOCK_prepared_stmt_count);
  DBUG_ASSERT(prepared_stmt_count >= st_hash.records);
  prepared_stmt_count-= st_hash.records;
  pthread_mutex_unlock(&LOCK_prepared_stmt_count);

  my_hash_reset(&names_hash);
  my_hash_reset(&st_hash);
  last_found_statement= 0;
1983 1984
}

1985

1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997
Statement_map::~Statement_map()
{
  /* Must go first, hash_free will reset st_hash.records */
  pthread_mutex_lock(&LOCK_prepared_stmt_count);
  DBUG_ASSERT(prepared_stmt_count >= st_hash.records);
  prepared_stmt_count-= st_hash.records;
  pthread_mutex_unlock(&LOCK_prepared_stmt_count);

  hash_free(&names_hash);
  hash_free(&st_hash);
}

1998 1999
bool select_dumpvar::send_data(List<Item> &items)
{
2000
  List_iterator_fast<my_var> var_li(var_list);
2001
  List_iterator<Item> it(items);
2002
  Item *item;
2003
  my_var *mv;
2004
  DBUG_ENTER("select_dumpvar::send_data");
2005

2006
  if (unit->offset_limit_cnt)
2007
  {						// using limit offset,count
2008 2009 2010
    unit->offset_limit_cnt--;
    DBUG_RETURN(0);
  }
2011 2012
  if (row_count++) 
  {
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
2013
    my_message(ER_TOO_MANY_ROWS, ER(ER_TOO_MANY_ROWS), MYF(0));
2014 2015
    DBUG_RETURN(1);
  }
2016
  while ((mv= var_li++) && (item= it++))
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
2017
  {
2018
    if (mv->local)
2019
    {
2020 2021
      if (thd->spcont->set_variable(thd, mv->offset, &item))
	    DBUG_RETURN(1);
2022 2023 2024
    }
    else
    {
2025 2026 2027
      Item_func_set_user_var *suv= new Item_func_set_user_var(mv->s, item);
      suv->fix_fields(thd, 0);
      suv->check(0);
2028
      suv->update();
2029
    }
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
2030
  }
Sinisa@sinisa.nasamreza.org's avatar
Sinisa@sinisa.nasamreza.org committed
2031 2032 2033 2034 2035
  DBUG_RETURN(0);
}

bool select_dumpvar::send_eof()
{
2036
  if (! row_count)
serg@serg.mylan's avatar
serg@serg.mylan committed
2037 2038
    push_warning(thd, MYSQL_ERROR::WARN_LEVEL_WARN,
                 ER_SP_FETCH_NO_DATA, ER(ER_SP_FETCH_NO_DATA));
2039 2040
  ::send_ok(thd,row_count);
  return 0;
Sinisa@sinisa.nasamreza.org's avatar
Sinisa@sinisa.nasamreza.org committed
2041
}
2042 2043 2044 2045 2046 2047 2048

/****************************************************************************
  TMP_TABLE_PARAM
****************************************************************************/

void TMP_TABLE_PARAM::init()
{
2049 2050
  DBUG_ENTER("TMP_TABLE_PARAM::init");
  DBUG_PRINT("enter", ("this: 0x%lx", (ulong)this));
2051 2052 2053
  field_count= sum_func_count= func_count= hidden_field_count= 0;
  group_parts= group_length= group_null_parts= 0;
  quick_group= 1;
2054
  table_charset= 0;
2055
  precomputed_group_by= 0;
2056
  DBUG_VOID_RETURN;
2057
}
2058 2059 2060 2061


void thd_increment_bytes_sent(ulong length)
{
serg@serg.mylan's avatar
serg@serg.mylan committed
2062
  THD *thd=current_thd;
lars@mysql.com's avatar
lars@mysql.com committed
2063
  if (likely(thd != 0))
serg@serg.mylan's avatar
serg@serg.mylan committed
2064 2065 2066
  { /* current_thd==0 when close_connection() calls net_send_error() */
    thd->status_var.bytes_sent+= length;
  }
2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085
}


void thd_increment_bytes_received(ulong length)
{
  current_thd->status_var.bytes_received+= length;
}


void thd_increment_net_big_packet_count(ulong length)
{
  current_thd->status_var.net_big_packet_count+= length;
}


void THD::set_status_var_init()
{
  bzero((char*) &status_var, sizeof(status_var));
}
2086

2087

2088
void Security_context::init()
2089 2090 2091
{
  host= user= priv_user= ip= 0;
  host_or_ip= "connecting host";
2092
  priv_host[0]= '\0';
2093 2094 2095 2096 2097 2098
#ifndef NO_EMBEDDED_ACCESS_CHECKS
  db_access= NO_ACCESS;
#endif
}


2099
void Security_context::destroy()
2100 2101 2102 2103 2104 2105 2106 2107 2108 2109
{
  // If not pointer to constant
  if (host != my_localhost)
    safeFree(host);
  if (user != delayed_user)
    safeFree(user);
  safeFree(ip);
}


2110
void Security_context::skip_grants()
2111 2112 2113 2114 2115 2116 2117 2118 2119
{
  /* privileges for the user are unknown everything is allowed */
  host_or_ip= (char *)"";
  master_access= ~NO_ACCESS;
  priv_user= (char *)"";
  *priv_host= '\0';
}


2120 2121 2122 2123 2124 2125 2126
bool Security_context::set_user(char *user_arg)
{
  safeFree(user);
  user= my_strdup(user_arg, MYF(0));
  return user == 0;
}

2127

2128 2129 2130 2131 2132 2133 2134 2135
/****************************************************************************
  Handling of open and locked tables states.

  This is used when we want to open/lock (and then close) some tables when
  we already have a set of tables open and locked. We use these methods for
  access to mysql.proc table to find definitions of stored routines.
****************************************************************************/

2136
void THD::reset_n_backup_open_tables_state(Open_tables_state *backup)
2137
{
2138 2139
  DBUG_ENTER("reset_n_backup_open_tables_state");
  backup->set_open_tables_state(this);
2140
  reset_open_tables_state();
2141
  state_flags|= Open_tables_state::BACKUPS_AVAIL;
2142
  DBUG_VOID_RETURN;
2143 2144 2145
}


2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157
void THD::restore_backup_open_tables_state(Open_tables_state *backup)
{
  DBUG_ENTER("restore_backup_open_tables_state");
  /*
    Before we will throw away current open tables state we want
    to be sure that it was properly cleaned up.
  */
  DBUG_ASSERT(open_tables == 0 && temporary_tables == 0 &&
              handler_tables == 0 && derived_tables == 0 &&
              lock == 0 && locked_tables == 0 &&
              prelocked_mode == NON_PRELOCKED);
  set_open_tables_state(backup);
2158 2159
  DBUG_VOID_RETURN;
}
2160 2161


2162

2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175
/****************************************************************************
  Handling of statement states in functions and triggers.

  This is used to ensure that the function/trigger gets a clean state
  to work with and does not cause any side effects of the calling statement.

  It also allows most stored functions and triggers to replicate even
  if they are used items that would normally be stored in the binary
  replication (like last_insert_id() etc...)

  The following things is done
  - Disable binary logging for the duration of the statement
  - Disable multi-result-sets for the duration of the statement
2176
  - Value of last_insert_id() is saved and restored
2177 2178 2179 2180
  - Value set by 'SET INSERT_ID=#' is reset and restored
  - Value for found_rows() is reset and restored
  - examined_row_count is added to the total
  - cuted_fields is added to the total
2181
  - new savepoint level is created and destroyed
2182 2183 2184 2185 2186 2187

  NOTES:
    Seed for random() is saved for the first! usage of RAND()
    We reset examined_row_count and cuted_fields and add these to the
    result to ensure that if we have a bug that would reset these within
    a function, we are not loosing any rows from the main statement.
2188 2189

    We do not reset value of last_insert_id().
2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203
****************************************************************************/

void THD::reset_sub_statement_state(Sub_statement_state *backup,
                                    uint new_state)
{
  backup->options=         options;
  backup->in_sub_stmt=     in_sub_stmt;
  backup->no_send_ok=      net.no_send_ok;
  backup->enable_slow_log= enable_slow_log;
  backup->limit_found_rows= limit_found_rows;
  backup->examined_row_count= examined_row_count;
  backup->sent_row_count=   sent_row_count;
  backup->cuted_fields=     cuted_fields;
  backup->client_capabilities= client_capabilities;
2204
  backup->savepoints= transaction.savepoints;
2205 2206 2207 2208
  backup->first_successful_insert_id_in_prev_stmt= 
    first_successful_insert_id_in_prev_stmt;
  backup->first_successful_insert_id_in_cur_stmt= 
    first_successful_insert_id_in_cur_stmt;
2209

2210
  if ((!lex->requires_prelocking() || is_update_query(lex->sql_command)) &&
2211
      !current_stmt_binlog_row_based)
2212
  {
2213
    options&= ~OPTION_BIN_LOG;
2214
  }
2215 2216 2217 2218 2219

  if ((backup->options & OPTION_BIN_LOG) && is_update_query(lex->sql_command)&&
      !current_stmt_binlog_row_based)
    mysql_bin_log.start_union_events(this, this->query_id);

2220 2221 2222 2223 2224 2225
  /* Disable result sets */
  client_capabilities &= ~CLIENT_MULTI_RESULTS;
  in_sub_stmt|= new_state;
  examined_row_count= 0;
  sent_row_count= 0;
  cuted_fields= 0;
2226
  transaction.savepoints= 0;
2227
  first_successful_insert_id_in_cur_stmt= 0;
2228 2229 2230 2231 2232 2233 2234 2235

  /* Surpress OK packets in case if we will execute statements */
  net.no_send_ok= TRUE;
}


void THD::restore_sub_statement_state(Sub_statement_state *backup)
{
2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250
  /*
    To save resources we want to release savepoints which were created
    during execution of function or trigger before leaving their savepoint
    level. It is enough to release first savepoint set on this level since
    all later savepoints will be released automatically.
  */
  if (transaction.savepoints)
  {
    SAVEPOINT *sv;
    for (sv= transaction.savepoints; sv->prev; sv= sv->prev)
    {}
    /* ha_release_savepoint() never returns error. */
    (void)ha_release_savepoint(this, sv);
  }
  transaction.savepoints= backup->savepoints;
2251 2252 2253 2254
  options=          backup->options;
  in_sub_stmt=      backup->in_sub_stmt;
  net.no_send_ok=   backup->no_send_ok;
  enable_slow_log=  backup->enable_slow_log;
2255 2256 2257 2258
  first_successful_insert_id_in_prev_stmt= 
    backup->first_successful_insert_id_in_prev_stmt;
  first_successful_insert_id_in_cur_stmt= 
    backup->first_successful_insert_id_in_cur_stmt;
2259 2260 2261 2262
  limit_found_rows= backup->limit_found_rows;
  sent_row_count=   backup->sent_row_count;
  client_capabilities= backup->client_capabilities;

2263 2264 2265
  if ((options & OPTION_BIN_LOG) && is_update_query(lex->sql_command) &&
    !current_stmt_binlog_row_based)
    mysql_bin_log.stop_union_events(this);
2266

2267 2268 2269 2270 2271 2272 2273
  /*
    The following is added to the old values as we are interested in the
    total complexity of the query
  */
  examined_row_count+= backup->examined_row_count;
  cuted_fields+=       backup->cuted_fields;
}
2274 2275 2276 2277 2278 2279


/***************************************************************************
  Handling of XA id cacheing
***************************************************************************/

2280 2281 2282 2283 2284 2285
pthread_mutex_t LOCK_xid_cache;
HASH xid_cache;

static byte *xid_get_hash_key(const byte *ptr,uint *length,
                                  my_bool not_used __attribute__((unused)))
{
2286 2287
  *length=((XID_STATE*)ptr)->xid.key_length();
  return ((XID_STATE*)ptr)->xid.key();
2288 2289 2290 2291 2292
}

static void xid_free_hash (void *ptr)
{
  if (!((XID_STATE*)ptr)->in_thd)
kent@mysql.com's avatar
kent@mysql.com committed
2293
    my_free((gptr)ptr, MYF(0));
2294 2295 2296 2297 2298
}

bool xid_cache_init()
{
  pthread_mutex_init(&LOCK_xid_cache, MY_MUTEX_INIT_FAST);
serg@sergbook.mysql.com's avatar
serg@sergbook.mysql.com committed
2299 2300
  return hash_init(&xid_cache, &my_charset_bin, 100, 0, 0,
                   xid_get_hash_key, xid_free_hash, 0) != 0;
2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314
}

void xid_cache_free()
{
  if (hash_inited(&xid_cache))
  {
    hash_free(&xid_cache);
    pthread_mutex_destroy(&LOCK_xid_cache);
  }
}

XID_STATE *xid_cache_search(XID *xid)
{
  pthread_mutex_lock(&LOCK_xid_cache);
2315
  XID_STATE *res=(XID_STATE *)hash_search(&xid_cache, xid->key(), xid->key_length());
2316 2317 2318 2319
  pthread_mutex_unlock(&LOCK_xid_cache);
  return res;
}

2320

2321 2322 2323 2324 2325
bool xid_cache_insert(XID *xid, enum xa_states xa_state)
{
  XID_STATE *xs;
  my_bool res;
  pthread_mutex_lock(&LOCK_xid_cache);
2326
  if (hash_search(&xid_cache, xid->key(), xid->key_length()))
2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340
    res=0;
  else if (!(xs=(XID_STATE *)my_malloc(sizeof(*xs), MYF(MY_WME))))
    res=1;
  else
  {
    xs->xa_state=xa_state;
    xs->xid.set(xid);
    xs->in_thd=0;
    res=my_hash_insert(&xid_cache, (byte*)xs);
  }
  pthread_mutex_unlock(&LOCK_xid_cache);
  return res;
}

2341

2342 2343 2344
bool xid_cache_insert(XID_STATE *xid_state)
{
  pthread_mutex_lock(&LOCK_xid_cache);
2345 2346
  DBUG_ASSERT(hash_search(&xid_cache, xid_state->xid.key(),
                          xid_state->xid.key_length())==0);
2347 2348 2349 2350 2351
  my_bool res=my_hash_insert(&xid_cache, (byte*)xid_state);
  pthread_mutex_unlock(&LOCK_xid_cache);
  return res;
}

2352

2353 2354 2355 2356 2357 2358 2359
void xid_cache_delete(XID_STATE *xid_state)
{
  pthread_mutex_lock(&LOCK_xid_cache);
  hash_delete(&xid_cache, (byte *)xid_state);
  pthread_mutex_unlock(&LOCK_xid_cache);
}

2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393
/*
  Implementation of interface to write rows to the binary log through the
  thread.  The thread is responsible for writing the rows it has
  inserted/updated/deleted.
*/

#ifndef MYSQL_CLIENT

/*
  Template member function for ensuring that there is an rows log
  event of the apropriate type before proceeding.

  PRE CONDITION:
    - Events of type 'RowEventT' have the type code 'type_code'.
    
  POST CONDITION:
    If a non-NULL pointer is returned, the pending event for thread 'thd' will
    be an event of type 'RowEventT' (which have the type code 'type_code')
    will either empty or have enough space to hold 'needed' bytes.  In
    addition, the columns bitmap will be correct for the row, meaning that
    the pending event will be flushed if the columns in the event differ from
    the columns suppled to the function.

  RETURNS
    If no error, a non-NULL pending event (either one which already existed or
    the newly created one).
    If error, NULL.
 */

template <class RowsEventT> Rows_log_event* 
THD::binlog_prepare_pending_rows_event(TABLE* table, uint32 serv_id,
                                       MY_BITMAP const* cols,
                                       my_size_t colcnt,
                                       my_size_t needed,
2394 2395
                                       bool is_transactional,
				       RowsEventT *hint __attribute__((unused)))
2396
{
2397
  DBUG_ENTER("binlog_prepare_pending_rows_event");
2398
  /* Pre-conditions */
2399
  DBUG_ASSERT(table->s->table_map_id != ~0UL);
2400 2401 2402 2403 2404 2405 2406 2407 2408

  /* Fetch the type code for the RowsEventT template parameter */
  int const type_code= RowsEventT::TYPE_CODE;

  /*
    There is no good place to set up the transactional data, so we
    have to do it here.
  */
  if (binlog_setup_trx_data())
2409
    DBUG_RETURN(NULL);
2410 2411 2412 2413

  Rows_log_event* pending= binlog_get_pending_rows_event();

  if (unlikely(pending && !pending->is_valid()))
2414
    DBUG_RETURN(NULL);
2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438

  /*
    Check if the current event is non-NULL and a write-rows
    event. Also check if the table provided is mapped: if it is not,
    then we have switched to writing to a new table.
    If there is no pending event, we need to create one. If there is a pending
    event, but it's not about the same table id, or not of the same type
    (between Write, Update and Delete), or not the same affected columns, or
    going to be too big, flush this event to disk and create a new pending
    event.
  */
  if (!pending ||
      pending->server_id != serv_id || 
      pending->get_table_id() != table->s->table_map_id ||
      pending->get_type_code() != type_code || 
      pending->get_data_size() + needed > opt_binlog_rows_event_max_size || 
      pending->get_width() != colcnt ||
      !bitmap_cmp(pending->get_cols(), cols)) 
  {
    /* Create a new RowsEventT... */
    Rows_log_event* const
	ev= new RowsEventT(this, table, table->s->table_map_id, cols,
                           is_transactional);
    if (unlikely(!ev))
2439
      DBUG_RETURN(NULL);
2440 2441 2442 2443 2444 2445 2446 2447
    ev->server_id= serv_id; // I don't like this, it's too easy to forget.
    /*
      flush the pending event and replace it with the newly created
      event...
    */
    if (unlikely(mysql_bin_log.flush_and_set_pending_rows_event(this, ev)))
    {
      delete ev;
2448
      DBUG_RETURN(NULL);
2449 2450
    }

2451
    DBUG_RETURN(ev);               /* This is the new pending event */
2452
  }
2453
  DBUG_RETURN(pending);        /* This is the current pending event */
2454 2455
}

2456
#ifdef HAVE_EXPLICIT_TEMPLATE_INSTANTIATION
2457
/*
2458
  Instantiate the versions we need, we have -fno-implicit-template as
2459 2460 2461
  compiling option.
*/
template Rows_log_event*
2462 2463 2464
THD::binlog_prepare_pending_rows_event(TABLE*, uint32, MY_BITMAP const*,
				       my_size_t, my_size_t, bool,
				       Write_rows_log_event*);
2465 2466

template Rows_log_event*
2467 2468 2469
THD::binlog_prepare_pending_rows_event(TABLE*, uint32, MY_BITMAP const*,
				       my_size_t colcnt, my_size_t, bool,
				       Delete_rows_log_event *);
2470 2471

template Rows_log_event* 
2472 2473 2474
THD::binlog_prepare_pending_rows_event(TABLE*, uint32, MY_BITMAP const*,
				       my_size_t colcnt, my_size_t, bool,
				       Update_rows_log_event *);
2475
#endif
2476 2477

#ifdef NOT_USED
2478 2479 2480
static char const* 
field_type_name(enum_field_types type) 
{
2481
  switch (type) {
2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538
  case MYSQL_TYPE_DECIMAL:
    return "MYSQL_TYPE_DECIMAL";
  case MYSQL_TYPE_TINY:
    return "MYSQL_TYPE_TINY";
  case MYSQL_TYPE_SHORT:
    return "MYSQL_TYPE_SHORT";
  case MYSQL_TYPE_LONG:
    return "MYSQL_TYPE_LONG";
  case MYSQL_TYPE_FLOAT:
    return "MYSQL_TYPE_FLOAT";
  case MYSQL_TYPE_DOUBLE:
    return "MYSQL_TYPE_DOUBLE";
  case MYSQL_TYPE_NULL:
    return "MYSQL_TYPE_NULL";
  case MYSQL_TYPE_TIMESTAMP:
    return "MYSQL_TYPE_TIMESTAMP";
  case MYSQL_TYPE_LONGLONG:
    return "MYSQL_TYPE_LONGLONG";
  case MYSQL_TYPE_INT24:
    return "MYSQL_TYPE_INT24";
  case MYSQL_TYPE_DATE:
    return "MYSQL_TYPE_DATE";
  case MYSQL_TYPE_TIME:
    return "MYSQL_TYPE_TIME";
  case MYSQL_TYPE_DATETIME:
    return "MYSQL_TYPE_DATETIME";
  case MYSQL_TYPE_YEAR:
    return "MYSQL_TYPE_YEAR";
  case MYSQL_TYPE_NEWDATE:
    return "MYSQL_TYPE_NEWDATE";
  case MYSQL_TYPE_VARCHAR:
    return "MYSQL_TYPE_VARCHAR";
  case MYSQL_TYPE_BIT:
    return "MYSQL_TYPE_BIT";
  case MYSQL_TYPE_NEWDECIMAL:
    return "MYSQL_TYPE_NEWDECIMAL";
  case MYSQL_TYPE_ENUM:
    return "MYSQL_TYPE_ENUM";
  case MYSQL_TYPE_SET:
    return "MYSQL_TYPE_SET";
  case MYSQL_TYPE_TINY_BLOB:
    return "MYSQL_TYPE_TINY_BLOB";
  case MYSQL_TYPE_MEDIUM_BLOB:
    return "MYSQL_TYPE_MEDIUM_BLOB";
  case MYSQL_TYPE_LONG_BLOB:
    return "MYSQL_TYPE_LONG_BLOB";
  case MYSQL_TYPE_BLOB:
    return "MYSQL_TYPE_BLOB";
  case MYSQL_TYPE_VAR_STRING:
    return "MYSQL_TYPE_VAR_STRING";
  case MYSQL_TYPE_STRING:
    return "MYSQL_TYPE_STRING";
  case MYSQL_TYPE_GEOMETRY:
    return "MYSQL_TYPE_GEOMETRY";
  }
  return "Unknown";
}
2539
#endif
2540

2541

2542 2543 2544 2545 2546 2547 2548 2549 2550 2551
my_size_t THD::max_row_length_blob(TABLE *table, const byte *data) const
{
  my_size_t length= 0;
  TABLE_SHARE *table_s= table->s;
  uint* const beg= table_s->blob_field;
  uint* const end= beg + table_s->blob_fields;

  for (uint *ptr= beg ; ptr != end ; ++ptr)
  {
    Field_blob* const blob= (Field_blob*) table->field[*ptr];
2552 2553 2554
    length+= blob->get_length((const char*) (data +
                                             blob->offset(table->record[0]))) +
      HA_KEY_BLOB_LENGTH;
2555 2556 2557 2558 2559
  }

  return length;
}

2560

2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599
/*
  Pack a record of data for a table into a format suitable for
  transfer via the binary log.

  SYNOPSIS
    THD::pack_row()
    table     Table describing the format of the record
    cols      Bitmap with a set bit for each column that should be
              stored in the row
    row_data  Pointer to memory where row will be written
    record    Pointer to record that should be packed. It is assumed
              that the pointer refers to either record[0] or
              record[1], but no such check is made since the code does
              not rely on that.

  DESCRIPTION

    The format for a row in transfer with N fields is the following:

    ceil(N/8) null bytes:
        One null bit for every column *regardless of whether it can be
        null or not*. This simplifies the decoding. Observe that the
        number of null bits is equal to the number of set bits in the
        'cols' bitmap. The number of null bytes is the smallest number
        of bytes necessary to store the null bits.

        Padding bits are 1.

    N packets:
        Each field is stored in packed format.


  RETURN VALUE

    The number of bytes written at 'row_data'.
 */
my_size_t
THD::pack_row(TABLE *table, MY_BITMAP const* cols,
              byte *const row_data, const byte *record) const
2600
{
2601
  Field **p_field= table->field, *field;
2602 2603 2604
  int const null_byte_count= (bitmap_bits_set(cols) + 7) / 8;
  byte *pack_ptr = row_data + null_byte_count;
  byte *null_ptr = row_data;
2605 2606
  my_ptrdiff_t const rec_offset= record - table->record[0];
  my_ptrdiff_t const def_offset= table->s->default_values - table->record[0];
2607

2608 2609 2610 2611 2612 2613 2614 2615 2616
  /*
    We write the null bits and the packed records using one pass
    through all the fields. The null bytes are written little-endian,
    i.e., the first fields are in the first byte.
   */
  unsigned int null_bits= (1U << 8) - 1;
  // Mask to mask out the correct but among the null bits
  unsigned int null_mask= 1U;
  for ( ; (field= *p_field) ; p_field++)
2617
  {
2618 2619 2620
    DBUG_PRINT("debug", ("null_mask=%d; null_ptr=%p; row_data=%p; null_byte_count=%d",
                         null_mask, null_ptr, row_data, null_byte_count));
    if (bitmap_is_set(cols, p_field - table->field))
2621
    {
2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635
      my_ptrdiff_t offset;
      if (field->is_null(rec_offset))
      {
        offset= def_offset;
        null_bits |= null_mask;
      }
      else
      {
        offset= rec_offset;
        null_bits &= ~null_mask;

        /*
          We only store the data of the field if it is non-null
         */
mats@romeo.(none)'s avatar
mats@romeo.(none) committed
2636
        pack_ptr= (byte*)field->pack((char *) pack_ptr, field->ptr + offset);
2637 2638 2639 2640 2641 2642 2643 2644 2645 2646
      }

      null_mask <<= 1;
      if ((null_mask & 0xFF) == 0)
      {
        DBUG_ASSERT(null_ptr < row_data + null_byte_count);
        null_mask = 1U;
        *null_ptr++ = null_bits;
        null_bits= (1U << 8) - 1;
      }
2647
    }
2648
  }
2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665

  /*
    Write the last (partial) byte, if there is one
  */
  if ((null_mask & 0xFF) > 1)
  {
    DBUG_ASSERT(null_ptr < row_data + null_byte_count);
    *null_ptr++ = null_bits;
  }

  /*
    The null pointer should now point to the first byte of the
    packed data. If it doesn't, something is very wrong.
  */
  DBUG_ASSERT(null_ptr == row_data + null_byte_count);

  return static_cast<my_size_t>(pack_ptr - row_data);
2666 2667
}

2668

2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700
namespace {
  /**
     Class to handle temporary allocation of memory for row data.

     The responsibilities of the class is to provide memory for
     packing one or two rows of packed data (depending on what
     constructor is called).

     In order to make the allocation more efficient for "simple" rows,
     i.e., rows that do not contain any blobs, a pointer to the
     allocated memory is of memory is stored in the table structure
     for simple rows.  If memory for a table containing a blob field
     is requested, only memory for that is allocated, and subsequently
     released when the object is destroyed.

   */
  class Row_data_memory {
  public:
    /**
      Build an object to keep track of a block-local piece of memory
      for storing a row of data.

      @param table
      Table where the pre-allocated memory is stored.

      @param length
      Length of data that is needed, if the record contain blobs.
     */
    Row_data_memory(TABLE *table, my_size_t const len1)
      : m_memory(0)
    {
#ifndef DBUG_OFF
2701
      m_alloc_checked= FALSE;
2702 2703 2704 2705 2706 2707 2708 2709 2710 2711
#endif
      allocate_memory(table, len1);
      m_ptr[0]= has_memory() ? m_memory : 0;
      m_ptr[1]= 0;
    }

    Row_data_memory(TABLE *table, my_size_t const len1, my_size_t const len2)
      : m_memory(0)
    {
#ifndef DBUG_OFF
2712
      m_alloc_checked= FALSE;
2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732
#endif
      allocate_memory(table, len1 + len2);
      m_ptr[0]= has_memory() ? m_memory        : 0;
      m_ptr[1]= has_memory() ? m_memory + len1 : 0;
    }

    ~Row_data_memory()
    {
      if (m_memory != 0 && m_release_memory_on_destruction)
        my_free((gptr) m_memory, MYF(MY_WME));
    }

    /**
       Is there memory allocated?

       @retval true There is memory allocated
       @retval false Memory allocation failed
     */
    bool has_memory() const {
#ifndef DBUG_OFF
2733
      m_alloc_checked= TRUE;
2734 2735 2736 2737
#endif
      return m_memory != 0;
    }

2738
    byte *slot(uint s)
2739
    {
2740
      DBUG_ASSERT(s < sizeof(m_ptr)/sizeof(*m_ptr));
2741
      DBUG_ASSERT(m_ptr[s] != 0);
2742
      DBUG_ASSERT(m_alloc_checked == TRUE);
2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771
      return m_ptr[s];
    }

  private:
    void allocate_memory(TABLE *const table, my_size_t const total_length)
    {
      if (table->s->blob_fields == 0)
      {
        /*
          The maximum length of a packed record is less than this
          length. We use this value instead of the supplied length
          when allocating memory for records, since we don't know how
          the memory will be used in future allocations.

          Since table->s->reclength is for unpacked records, we have
          to add two bytes for each field, which can potentially be
          added to hold the length of a packed field.
        */
        my_size_t const maxlen= table->s->reclength + 2 * table->s->fields;

        /*
          Allocate memory for two records if memory hasn't been
          allocated. We allocate memory for two records so that it can
          be used when processing update rows as well.
        */
        if (table->write_row_record == 0)
          table->write_row_record=
            (byte *) alloc_root(&table->mem_root, 2 * maxlen);
        m_memory= table->write_row_record;
2772
        m_release_memory_on_destruction= FALSE;
2773 2774 2775 2776
      }
      else
      {
        m_memory= (byte *) my_malloc(total_length, MYF(MY_WME));
2777
        m_release_memory_on_destruction= TRUE;
2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790
      }
    }

#ifndef DBUG_OFF
    mutable bool m_alloc_checked;
#endif
    bool m_release_memory_on_destruction;
    byte *m_memory;
    byte *m_ptr[2];
  };
}


2791 2792 2793 2794
int THD::binlog_write_row(TABLE* table, bool is_trans, 
                          MY_BITMAP const* cols, my_size_t colcnt, 
                          byte const *record) 
{ 
2795
  DBUG_ASSERT(current_stmt_binlog_row_based && mysql_bin_log.is_open());
2796

2797 2798 2799
  /*
    Pack records into format for transfer. We are allocating more
    memory than needed, but that doesn't matter.
2800
  */
2801 2802 2803
  Row_data_memory memory(table, max_row_length(table, record));
  if (!memory.has_memory())
    return HA_ERR_OUT_OF_MEM;
2804

2805
  byte *row_data= memory.slot(0);
2806

2807
  my_size_t const len= pack_row(table, cols, row_data, record);
2808

2809 2810 2811 2812 2813 2814 2815 2816 2817
  Rows_log_event* const ev=
    binlog_prepare_pending_rows_event(table, server_id, cols, colcnt,
                                      len, is_trans,
                                      static_cast<Write_rows_log_event*>(0));

  if (unlikely(ev == 0))
    return HA_ERR_OUT_OF_MEM;

  return ev->add_row_data(row_data, len);
2818 2819 2820 2821 2822 2823 2824
}

int THD::binlog_update_row(TABLE* table, bool is_trans,
                           MY_BITMAP const* cols, my_size_t colcnt,
                           const byte *before_record,
                           const byte *after_record)
{ 
2825
  DBUG_ASSERT(current_stmt_binlog_row_based && mysql_bin_log.is_open());
2826 2827 2828 2829

  my_size_t const before_maxlen = max_row_length(table, before_record);
  my_size_t const after_maxlen  = max_row_length(table, after_record);

2830 2831 2832 2833 2834 2835
  Row_data_memory row_data(table, before_maxlen, after_maxlen);
  if (!row_data.has_memory())
    return HA_ERR_OUT_OF_MEM;

  byte *before_row= row_data.slot(0);
  byte *after_row= row_data.slot(1);
2836 2837 2838 2839 2840

  my_size_t const before_size= pack_row(table, cols, before_row, 
                                        before_record);
  my_size_t const after_size= pack_row(table, cols, after_row, 
                                       after_record);
2841 2842 2843 2844 2845 2846

  /*
    Don't print debug messages when running valgrind since they can
    trigger false warnings.
   */
#ifndef HAVE_purify
2847 2848 2849 2850
  DBUG_DUMP("before_record", (const char *)before_record, table->s->reclength);
  DBUG_DUMP("after_record", (const char *)after_record, table->s->reclength);
  DBUG_DUMP("before_row", (const char *)before_row, before_size);
  DBUG_DUMP("after_row", (const char *)after_row, after_size);
2851
#endif
2852

2853 2854 2855 2856
  Rows_log_event* const ev=
    binlog_prepare_pending_rows_event(table, server_id, cols, colcnt,
				      before_size + after_size, is_trans,
				      static_cast<Update_rows_log_event*>(0));
2857

2858 2859 2860 2861
  if (unlikely(ev == 0))
    return HA_ERR_OUT_OF_MEM;

  return
2862
    ev->add_row_data(before_row, before_size) ||
2863 2864 2865 2866 2867 2868 2869
    ev->add_row_data(after_row, after_size);
}

int THD::binlog_delete_row(TABLE* table, bool is_trans, 
                           MY_BITMAP const* cols, my_size_t colcnt,
                           byte const *record)
{ 
2870
  DBUG_ASSERT(current_stmt_binlog_row_based && mysql_bin_log.is_open());
2871 2872 2873 2874 2875

  /* 
     Pack records into format for transfer. We are allocating more
     memory than needed, but that doesn't matter.
  */
2876 2877
  Row_data_memory memory(table, max_row_length(table, record));
  if (unlikely(!memory.has_memory()))
2878
    return HA_ERR_OUT_OF_MEM;
2879 2880 2881

  byte *row_data= memory.slot(0);

2882 2883
  my_size_t const len= pack_row(table, cols, row_data, record);

2884 2885 2886 2887
  Rows_log_event* const ev=
    binlog_prepare_pending_rows_event(table, server_id, cols, colcnt,
				      len, is_trans,
				      static_cast<Delete_rows_log_event*>(0));
2888

2889 2890
  if (unlikely(ev == 0))
    return HA_ERR_OUT_OF_MEM;
2891

2892
  return ev->add_row_data(row_data, len);
2893 2894 2895 2896 2897 2898
}


int THD::binlog_flush_pending_rows_event(bool stmt_end)
{
  DBUG_ENTER("THD::binlog_flush_pending_rows_event");
2899 2900 2901 2902 2903 2904
  /*
    We shall flush the pending event even if we are not in row-based
    mode: it might be the case that we left row-based mode before
    flushing anything (e.g., if we have explicitly locked tables).
   */
  if (!mysql_bin_log.is_open())
2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917
    DBUG_RETURN(0);

  /*
    Mark the event as the last event of a statement if the stmt_end
    flag is set.
  */
  int error= 0;
  if (Rows_log_event *pending= binlog_get_pending_rows_event())
  {
    if (stmt_end)
    {
      pending->set_flags(Rows_log_event::STMT_END_F);
      pending->flags|= LOG_EVENT_UPDATE_TABLE_MAP_VERSION_F;
2918
      binlog_table_maps= 0;
2919 2920
    }

2921 2922
    error= mysql_bin_log.flush_and_set_pending_rows_event(this, 0);
  }
2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938

  DBUG_RETURN(error);
}


void THD::binlog_delete_pending_rows_event()
{
  if (Rows_log_event *pending= binlog_get_pending_rows_event())
  {
    delete pending;
    binlog_set_pending_rows_event(0);
  }
}

/*
  Member function that will log query, either row-based or
2939 2940
  statement-based depending on the value of the 'current_stmt_binlog_row_based'
  the value of the 'qtype' flag.
2941 2942 2943 2944 2945

  This function should be called after the all calls to ha_*_row()
  functions have been issued, but before tables are unlocked and
  closed.

2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956
  OBSERVE
    There shall be no writes to any system table after calling
    binlog_query(), so these writes has to be moved to before the call
    of binlog_query() for correct functioning.

    This is necessesary not only for RBR, but the master might crash
    after binlogging the query but before changing the system tables.
    This means that the slave and the master are not in the same state
    (after the master has restarted), so therefore we have to
    eliminate this problem.

2957 2958 2959 2960 2961 2962 2963 2964
  RETURN VALUE
    Error code, or 0 if no error.
*/
int THD::binlog_query(THD::enum_binlog_query_type qtype,
                      char const *query, ulong query_len,
                      bool is_trans, bool suppress_use)
{
  DBUG_ENTER("THD::binlog_query");
2965
  DBUG_PRINT("enter", ("qtype=%d, query='%s'", qtype, query));
2966
  DBUG_ASSERT(query && mysql_bin_log.is_open());
2967

2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980
  /*
    If we are not in prelocked mode, mysql_unlock_tables() will be
    called after this binlog_query(), so we have to flush the pending
    rows event with the STMT_END_F set to unlock all tables at the
    slave side as well.

    If we are in prelocked mode, the flushing will be done inside the
    top-most close_thread_tables().
  */
  if (this->prelocked_mode == NON_PRELOCKED)
    if (int error= binlog_flush_pending_rows_event(TRUE))
      DBUG_RETURN(error);

2981
  switch (qtype) {
2982 2983 2984 2985
  case THD::ROW_QUERY_TYPE:
    if (current_stmt_binlog_row_based)
      DBUG_RETURN(0);
    /* Otherwise, we fall through */
2986 2987 2988 2989 2990 2991
  case THD::MYSQL_QUERY_TYPE:
    /*
      Using this query type is a conveniece hack, since we have been
      moving back and forth between using RBR for replication of
      system tables and not using it.

2992
      Make sure to change in check_table_binlog_row_based() according
2993 2994 2995 2996
      to how you treat this.
    */
  case THD::STMT_QUERY_TYPE:
    /*
2997 2998
      The MYSQL_LOG::write() function will set the STMT_END_F flag and
      flush the pending rows event if necessary.
2999 3000 3001 3002
     */
    {
      Query_log_event qinfo(this, query, query_len, is_trans, suppress_use);
      qinfo.flags|= LOG_EVENT_UPDATE_TABLE_MAP_VERSION_F;
3003 3004 3005 3006 3007 3008 3009 3010 3011
      /*
        Binlog table maps will be irrelevant after a Query_log_event
        (they are just removed on the slave side) so after the query
        log event is written to the binary log, we pretend that no
        table maps were written.
       */
      int error= mysql_bin_log.write(&qinfo);
      binlog_table_maps= 0;
      DBUG_RETURN(error);
3012 3013 3014 3015 3016 3017 3018 3019 3020 3021
    }
    break;

  case THD::QUERY_TYPE_COUNT:
  default:
    DBUG_ASSERT(0 <= qtype && qtype < QUERY_TYPE_COUNT);
  }
  DBUG_RETURN(0);
}

3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043
bool Discrete_intervals_list::append(ulonglong start, ulonglong val,
                                 ulonglong incr)
{
  DBUG_ENTER("Discrete_intervals_list::append");
  /* first, see if this can be merged with previous */
  if ((head == NULL) || tail->merge_if_contiguous(start, val, incr))
  {
    /* it cannot, so need to add a new interval */
    Discrete_interval *new_interval= new Discrete_interval(start, val, incr);
    if (unlikely(new_interval == NULL)) // out of memory
      DBUG_RETURN(1);
    DBUG_PRINT("info",("adding new auto_increment interval"));
    if (head == NULL)
      head= current= new_interval;
    else
      tail->next= new_interval;
    tail= new_interval;
    elements++;
  }
  DBUG_RETURN(0);
}

3044
#endif /* !defined(MYSQL_CLIENT) */