sql_class.cc 77.5 KB
Newer Older
unknown's avatar
unknown committed
1
/* Copyright (C) 2000 MySQL AB & MySQL Finland AB & TCX DataKonsult AB
unknown's avatar
unknown committed
2

unknown's avatar
unknown committed
3 4 5 6
   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation; either version 2 of the License, or
   (at your option) any later version.
unknown's avatar
unknown committed
7

unknown's avatar
unknown committed
8 9 10 11
   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.
unknown's avatar
unknown committed
12

unknown's avatar
unknown committed
13 14 15 16 17 18 19 20 21 22 23 24
   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
**
*****************************************************************************/

25
#ifdef USE_PRAGMA_IMPLEMENTATION
unknown's avatar
unknown committed
26 27 28 29
#pragma implementation				// gcc: Class implementation
#endif

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

unknown's avatar
unknown committed
40 41
#include "sp_rcontext.h"
#include "sp_cache.h"
42

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

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

52

unknown's avatar
unknown committed
53 54 55 56
/*****************************************************************************
** Instansiate templates
*****************************************************************************/

57
#ifdef HAVE_EXPLICIT_TEMPLATE_INSTANTIATION
unknown's avatar
unknown committed
58 59 60 61 62 63 64 65 66 67 68 69 70 71 72
/* 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
****************************************************************************/

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

80
extern "C" void free_user_var(user_var_entry *entry)
unknown's avatar
unknown committed
81 82 83 84 85 86 87
{
  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));
}

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

93 94

/*
95
  Test if a foreign key (= generated key) is a prefix of the given key
96 97 98 99 100 101 102 103 104 105 106 107 108 109
  (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)
110
{
111 112 113 114
  /* Ensure that 'a' is the generated key */
  if (a->generated)
  {
    if (b->generated && a->columns.elements > b->columns.elements)
115
      swap_variables(Key*, a, b);               // Put shorter key in 'a'
116 117
  }
  else
118
  {
119 120
    if (!b->generated)
      return TRUE;                              // No foreign key
121
    swap_variables(Key*, a, b);                 // Put generated key in 'a'
122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137
  }

  /* 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++))
138
    {
139 140 141 142 143
      if (*col1 == *col2)
      {
        found= TRUE;
	break;
      }
144
    }
145 146 147 148 149 150 151 152 153 154
    if (!found)
      return TRUE;                              // Error
  }
  return FALSE;                                 // Is prefix
#else
  while ((col1= col_it1++))
  {
    col2= col_it2++;
    if (!(*col1 == *col2))
      return TRUE;
155
  }
156 157
  return FALSE;                                 // Is prefix
#endif
158 159 160
}


unknown's avatar
unknown committed
161 162 163
/****************************************************************************
** Thread specific functions
****************************************************************************/
164

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

171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189
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;
}

unknown's avatar
unknown committed
190 191 192 193 194
void **thd_ha_data(const THD *thd, const struct handlerton *hton)
{
  return (void **) thd->ha_data + hton->slot;
}

195

unknown's avatar
unknown committed
196 197 198 199 200
/*
  Pass nominal parameters to Statement constructor only to ensure that
  the destructor works OK in case of error. The main_mem_root will be
  re-initialized in init().
*/
unknown's avatar
unknown committed
201

202
THD::THD()
unknown's avatar
unknown committed
203
  :Statement(CONVENTIONAL_EXECUTION, 0, ALLOC_ROOT_MIN_BLOCK_SIZE, 0),
204
   Open_tables_state(refresh_version), rli_fake(0),
205
   lock_id(&main_lock_id),
206 207 208 209
   user_time(0), in_sub_stmt(0),
#ifdef HAVE_ROW_BASED_REPLICATION
   binlog_table_maps(0),
#endif /*HAVE_ROW_BASED_REPLICATION*/
210
   global_read_lock(0), is_fatal_error(0),
211
   rand_used(0), time_zone_used(0),
212 213 214 215
   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),
216
   in_lock_tables(0), bootstrap(0), derived_tables_processing(FALSE),
217
   stmt_depends_on_first_successful_insert_id_in_prev_stmt(FALSE),
218
   spcont(NULL)
unknown's avatar
unknown committed
219
{
unknown's avatar
unknown committed
220
  stmt_arena= this;
221
  thread_stack= 0;
222
  db= 0;
223
  catalog= (char*)"std"; // the only catalog we have for now
224 225
  main_security_ctx.init();
  security_ctx= &main_security_ctx;
unknown's avatar
unknown committed
226
  locked=some_tables_deleted=no_errors=password= 0;
unknown's avatar
unknown committed
227
  query_start_used= 0;
228
  count_cuted_fields= CHECK_FIELD_IGNORE;
unknown's avatar
SCRUM  
unknown committed
229
  killed= NOT_KILLED;
230
  db_length= col_access=0;
unknown's avatar
unknown committed
231
  query_error= tmp_table_used= 0;
232
  hash_clear(&handler_tables_hash);
unknown's avatar
unknown committed
233
  tmp_table=0;
234
  used_tables=0;
235
  cuted_fields= sent_row_count= row_count= 0L;
236
  limit_found_rows= 0;
237
  statement_id_counter= 0UL;
238 239 240
#ifdef ERROR_INJECT_SUPPORT
  error_inject_value= 0UL;
#endif
241
  // Must be reset to handle error with THD's created for init of mysqld
unknown's avatar
unknown committed
242
  lex->current_select= 0;
unknown's avatar
unknown committed
243
  start_time=(time_t) 0;
244
  time_after_lock=(time_t) 0;
unknown's avatar
unknown committed
245
  current_linfo =  0;
246
  slave_thread = 0;
unknown's avatar
unknown committed
247
  variables.pseudo_thread_id= 0;
248
  one_shot_set= 0;
249
  file_id = 0;
250
  query_id= 0;
251
  warn_id= 0;
252
  db_charset= global_system_variables.collation_database;
253
  bzero(ha_data, sizeof(ha_data));
unknown's avatar
unknown committed
254
  mysys_var=0;
255
  binlog_evt_union.do_union= FALSE;
256
  enable_slow_log= 0;
257 258
#ifndef DBUG_OFF
  dbug_sentry=THD_SENTRY_MAGIC;
259
#endif
260
#ifndef EMBEDDED_LIBRARY
unknown's avatar
unknown committed
261
  net.vio=0;
262
#endif
263
  client_capabilities= 0;                       // minimalistic client
264
  net.last_error[0]=0;                          // If error on boot
265
  query_cache_init_query(&net);                 // If error on boot
unknown's avatar
unknown committed
266
  ull=0;
267 268
  system_thread= NON_SYSTEM_THREAD;
  cleanup_done= abort_on_warning= no_warnings_for_error= 0;
269
  peer_port= 0;					// For SHOW PROCESSLIST
270 271 272
#ifdef HAVE_ROW_BASED_REPLICATION
  transaction.m_pending_rows_event= 0;
#endif
unknown's avatar
unknown committed
273 274 275 276 277
#ifdef	__WIN__
  real_id = 0;
#endif
#ifdef SIGNAL_WITH_VIO_CLOSE
  active_vio = 0;
278
#endif
279
  pthread_mutex_init(&LOCK_delete, MY_MUTEX_INIT_FAST);
unknown's avatar
unknown committed
280 281 282

  /* Variables with default values */
  proc_info="login";
283
  where= THD::DEFAULT_WHERE;
unknown's avatar
unknown committed
284
  server_id = ::server_id;
285
  slave_net = 0;
unknown's avatar
unknown committed
286
  command=COM_CONNECT;
unknown's avatar
unknown committed
287
  *scramble= '\0';
unknown's avatar
unknown committed
288

unknown's avatar
unknown committed
289
  init();
unknown's avatar
unknown committed
290
  /* Initialize sub structures */
291
  init_sql_alloc(&warn_root, WARN_ALLOC_BLOCK_SIZE, WARN_ALLOC_PREALLOC_SIZE);
292
  user_connect=(USER_CONN *)0;
293
  hash_init(&user_vars, system_charset_info, USER_VARS_HASH_SIZE, 0, 0,
unknown's avatar
unknown committed
294
	    (hash_get_key) get_var_key,
295
	    (hash_free_key) free_user_var, 0);
296

297 298
  sp_proc_cache= NULL;
  sp_func_cache= NULL;
299

unknown's avatar
unknown committed
300 301 302
  /* For user vars replication*/
  if (opt_bin_log)
    my_init_dynamic_array(&user_var_events,
303
			  sizeof(BINLOG_USER_VAR_EVENT *), 16, 16);
unknown's avatar
unknown committed
304 305 306
  else
    bzero((char*) &user_var_events, sizeof(user_var_events));

307 308 309 310 311
  /* Protocol */
  protocol= &protocol_simple;			// Default protocol
  protocol_simple.init(this);
  protocol_prep.init(this);

unknown's avatar
unknown committed
312
  tablespace_op=FALSE;
313 314
  ulong tmp=sql_rnd_with_mutex();
  randominit(&rand, tmp + (ulong) &rand, tmp + (ulong) ::query_id);
315
  substitute_null_with_insert_id = FALSE;
316 317
  thr_lock_info_init(&lock_info); /* safety: will be reset after start */
  thr_lock_owner_init(&main_lock_id, &lock_info);
unknown's avatar
unknown committed
318 319
}

unknown's avatar
unknown committed
320 321 322 323 324 325 326

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

void THD::init(void)
{
327 328
  pthread_mutex_lock(&LOCK_global_system_variables);
  variables= global_system_variables;
329 330 331 332 333 334
  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);
335
#ifdef WITH_NDBCLUSTER_STORAGE_ENGINE
336 337
  variables.ndb_use_transactions= 1;
#endif
338
  pthread_mutex_unlock(&LOCK_global_system_variables);
unknown's avatar
unknown committed
339
  server_status= SERVER_STATUS_AUTOCOMMIT;
340 341
  if (variables.sql_mode & MODE_NO_BACKSLASH_ESCAPES)
    server_status|= SERVER_STATUS_NO_BACKSLASH_ESCAPES;
unknown's avatar
unknown committed
342 343
  options= thd_startup_options;
  open_options=ha_open_options;
344 345 346
  update_lock_default= (variables.low_priority_updates ?
			TL_WRITE_LOW_PRIORITY :
			TL_WRITE);
unknown's avatar
unknown committed
347
  session_tx_isolation= (enum_tx_isolation) variables.tx_isolation;
348 349 350
  warn_list.empty();
  bzero((char*) warn_count, sizeof(warn_count));
  total_warn_count= 0;
351
  update_charset();
352
#ifdef HAVE_ROW_BASED_REPLICATION
353
  reset_current_stmt_binlog_row_based();
354
#endif /*HAVE_ROW_BASED_REPLICATION*/
355
  bzero((char *) &status_var, sizeof(status_var));
unknown's avatar
unknown committed
356
  variables.lc_time_names = &my_locale_en_US;
unknown's avatar
unknown committed
357 358
}

359

360 361 362 363 364 365 366 367
/*
  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()
{
368
  ha_enable_transaction(this,TRUE);
369

unknown's avatar
unknown committed
370
  reset_root_defaults(mem_root, variables.query_alloc_block_size,
371
                      variables.query_prealloc_size);
372
#ifdef USING_TRANSACTIONS
373 374 375
  reset_root_defaults(&transaction.mem_root,
                      variables.trans_alloc_block_size,
                      variables.trans_prealloc_size);
376
#endif
377 378
  transaction.xid_state.xid.null();
  transaction.xid_state.in_thd=1;
379 380 381
}


unknown's avatar
unknown committed
382 383 384 385 386 387 388 389 390 391 392 393 394 395
/*
  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();
unknown's avatar
unknown committed
396
  cleanup_done= 0;
unknown's avatar
unknown committed
397
  init();
398
  stmt_map.reset();
399
  hash_init(&user_vars, system_charset_info, USER_VARS_HASH_SIZE, 0, 0,
unknown's avatar
unknown committed
400
	    (hash_get_key) get_var_key,
unknown's avatar
unknown committed
401
	    (hash_free_key) free_user_var, 0);
402 403
  sp_cache_clear(&sp_proc_cache);
  sp_cache_clear(&sp_func_cache);
unknown's avatar
unknown committed
404 405 406
}


unknown's avatar
unknown committed
407 408 409
/* Do operations that may take a long time */

void THD::cleanup(void)
unknown's avatar
unknown committed
410
{
unknown's avatar
unknown committed
411
  DBUG_ENTER("THD::cleanup");
unknown's avatar
unknown committed
412
#ifdef ENABLE_WHEN_BINLOG_WILL_BE_ABLE_TO_PREPARE
413 414 415 416
  if (transaction.xid_state.xa_state == XA_PREPARED)
  {
#error xid_state in the cache should be replaced by the allocated value
  }
unknown's avatar
unknown committed
417
#endif
418
  {
unknown's avatar
unknown committed
419
    ha_rollback(this);
420 421
    xid_cache_delete(&transaction.xid_state);
  }
unknown's avatar
unknown committed
422 423 424 425 426
  if (locked_tables)
  {
    lock=locked_tables; locked_tables=0;
    close_thread_tables(this);
  }
427
  mysql_ha_flush(this, (TABLE_LIST*) 0,
428
                 MYSQL_HA_CLOSE_FINAL | MYSQL_HA_FLUSH_ALL, FALSE);
429
  hash_free(&handler_tables_hash);
430 431
  delete_dynamic(&user_var_events);
  hash_free(&user_vars);
unknown's avatar
unknown committed
432
  close_temporary_tables(this);
433 434 435
  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));
436
  
437
  sp_cache_clear(&sp_proc_cache);
438 439
  sp_cache_clear(&sp_func_cache);

unknown's avatar
unknown committed
440 441 442
  if (global_read_lock)
    unlock_global_read_lock(this);
  if (ull)
443
  {
unknown's avatar
unknown committed
444 445 446 447
    pthread_mutex_lock(&LOCK_user_locks);
    item_user_lock_release(ull);
    pthread_mutex_unlock(&LOCK_user_locks);
    ull= 0;
448
  }
449

unknown's avatar
unknown committed
450 451 452 453
  cleanup_done=1;
  DBUG_VOID_RETURN;
}

unknown's avatar
unknown committed
454

unknown's avatar
unknown committed
455 456
THD::~THD()
{
457
  THD_CHECK_SENTRY(this);
unknown's avatar
unknown committed
458
  DBUG_ENTER("~THD()");
459 460 461
  /* Ensure that no one is using THD */
  pthread_mutex_lock(&LOCK_delete);
  pthread_mutex_unlock(&LOCK_delete);
462
  add_to_status(&global_status_var, &status_var);
463

unknown's avatar
unknown committed
464
  /* Close connection */
unknown's avatar
unknown committed
465
#ifndef EMBEDDED_LIBRARY
unknown's avatar
unknown committed
466 467 468
  if (net.vio)
  {
    vio_delete(net.vio);
unknown's avatar
unknown committed
469
    net_end(&net);
unknown's avatar
unknown committed
470
  }
471
#endif
472
  stmt_map.reset();                     /* close all prepared statements */
473
  DBUG_ASSERT(lock_info.n_cursors == 0);
unknown's avatar
unknown committed
474 475
  if (!cleanup_done)
    cleanup();
476

unknown's avatar
unknown committed
477
  ha_close_connection(this);
unknown's avatar
unknown committed
478

479 480
  DBUG_PRINT("info", ("freeing security context"));
  main_security_ctx.destroy();
481
  safeFree(db);
482
  free_root(&warn_root,MYF(0));
483
#ifdef USING_TRANSACTIONS
484
  free_root(&transaction.mem_root,MYF(0));
485
#endif
unknown's avatar
unknown committed
486
  mysys_var=0;					// Safety (shouldn't be needed)
487
  pthread_mutex_destroy(&LOCK_delete);
488
#ifndef DBUG_OFF
unknown's avatar
unknown committed
489
  dbug_sentry= THD_SENTRY_GONE;
490
#endif  
491 492 493 494 495
#ifndef EMBEDDED_LIBRARY
  if (rli_fake)
    delete rli_fake;
#endif

unknown's avatar
unknown committed
496 497 498
  DBUG_VOID_RETURN;
}

499

500
/*
unknown's avatar
unknown committed
501 502 503 504 505 506
  Add all status variables to another status variable array

  SYNOPSIS
   add_to_status()
   to_var       add to this array
   from_var     from this array
507 508 509 510 511 512 513 514 515

  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)
{
516 517
  ulong *end= (ulong*) ((byte*) to_var +
                        offsetof(STATUS_VAR, last_system_status_var) +
518 519 520 521 522 523 524
			sizeof(ulong));
  ulong *to= (ulong*) to_var, *from= (ulong*) from_var;

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

525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549
/*
  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++);
}

550

unknown's avatar
SCRUM  
unknown committed
551
void THD::awake(THD::killed_state state_to_set)
552
{
553 554
  DBUG_ENTER("THD::awake");
  DBUG_PRINT("enter", ("this=0x%lx", this));
555
  THD_CHECK_SENTRY(this);
556 557
  safe_mutex_assert_owner(&LOCK_delete); 

unknown's avatar
SCRUM  
unknown committed
558 559
  killed= state_to_set;
  if (state_to_set != THD::KILL_QUERY)
560
  {
unknown's avatar
SCRUM  
unknown committed
561
    thr_alarm_kill(real_id);
562
#ifdef SIGNAL_WITH_VIO_CLOSE
563
    close_active_vio();
564
#endif    
565
  }
566
  if (mysys_var)
unknown's avatar
unknown committed
567 568 569 570 571 572 573 574 575
  {
    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.
576 577 578 579 580
      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.
581

582
      Note that there is a small chance we fail to kill. If victim has locked
583 584 585 586 587
      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
588
      see it immediately and so may have time to reach the cond_wait().
unknown's avatar
unknown committed
589
    */
590
    if (mysys_var->current_cond && mysys_var->current_mutex)
591
    {
unknown's avatar
unknown committed
592 593 594
      pthread_mutex_lock(mysys_var->current_mutex);
      pthread_cond_broadcast(mysys_var->current_cond);
      pthread_mutex_unlock(mysys_var->current_mutex);
595
    }
unknown's avatar
unknown committed
596 597
    pthread_mutex_unlock(&mysys_var->mutex);
  }
598
  DBUG_VOID_RETURN;
599 600
}

unknown's avatar
unknown committed
601 602 603 604
/*
  Remember the location of thread info, the structure needed for
  sql_alloc() and the structure for the net buffer
*/
unknown's avatar
unknown committed
605 606 607

bool THD::store_globals()
{
608 609 610 611 612 613
  /*
    Assert that thread_stack is initialized: it's necessary to be able
    to track stack overrun.
  */
  DBUG_ASSERT(this->thread_stack);

614
  if (my_pthread_setspecific_ptr(THR_THD,  this) ||
unknown's avatar
unknown committed
615
      my_pthread_setspecific_ptr(THR_MALLOC, &mem_root))
616 617 618
    return 1;
  mysys_var=my_thread_var;
  dbug_thread_id=my_thread_id();
unknown's avatar
unknown committed
619 620 621 622
  /*
    By default 'slave_proxy_id' is 'thread_id'. They may later become different
    if this is the slave SQL thread.
  */
623
  variables.pseudo_thread_id= thread_id;
624 625 626 627
  /*
    We have to call thr_lock_info_init() again here as THD may have been
    created in another thread
  */
628
  thr_lock_info_init(&lock_info);
629
  return 0;
unknown's avatar
unknown committed
630 631
}

unknown's avatar
unknown committed
632

633 634 635 636 637
/*
  Cleanup after query.

  SYNOPSIS
    THD::cleanup_after_query()
638

639
  DESCRIPTION
unknown's avatar
unknown committed
640
    This function is used to reset thread data to its default state.
641 642 643 644 645 646 647

  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.
*/
unknown's avatar
unknown committed
648

649 650
void THD::cleanup_after_query()
{
651 652 653 654 655 656
  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();
  }
657
  if (first_successful_insert_id_in_cur_stmt > 0)
658
  {
659 660 661 662
    /* 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;
unknown's avatar
unknown committed
663
    substitute_null_with_insert_id= TRUE;
664
  }
665
  arg_of_last_insert_id_function= 0;
666
  /* Free Items that were created during this execution */
667
  free_items();
668 669
  /* Reset where. */
  where= THD::DEFAULT_WHERE;
670 671
}

unknown's avatar
unknown committed
672

unknown's avatar
unknown committed
673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698
/*
  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;
699
  uint dummy_errors;
unknown's avatar
unknown committed
700 701 702 703 704 705
  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,
706
			       from, from_length, from_cs, &dummy_errors);
unknown's avatar
unknown committed
707 708 709 710 711
  to->str[to->length]=0;			// Safety
  DBUG_RETURN(0);
}


712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728
/*
  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)
{
729 730
  uint dummy_errors;
  if (convert_buffer.copy(s->ptr(), s->length(), from_cs, to_cs, &dummy_errors))
731 732 733 734 735 736 737 738 739 740 741
    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;
}

742

unknown's avatar
unknown committed
743 744 745 746 747 748
/*
  Update some cache variables when character set changes
*/

void THD::update_charset()
{
749 750 751 752 753 754 755
  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);
unknown's avatar
unknown committed
756 757 758
  charset_is_character_set_filesystem= 
    !String::needs_conversion(0, charset(),
                              variables.character_set_filesystem, &not_used);
unknown's avatar
unknown committed
759 760 761
}


762 763 764 765 766 767 768 769 770 771 772 773 774 775
/* 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 */
776

777 778
void THD::add_changed_table(TABLE *table)
{
779
  DBUG_ENTER("THD::add_changed_table(table)");
780

unknown's avatar
unknown committed
781
  DBUG_ASSERT((options & (OPTION_NOT_AUTOCOMMIT | OPTION_BEGIN)) &&
782
	      table->file->has_transactions());
unknown's avatar
unknown committed
783 784
  add_changed_table(table->s->table_cache_key.str,
                    table->s->table_cache_key.length);
unknown's avatar
unknown committed
785
  DBUG_VOID_RETURN;
unknown's avatar
unknown committed
786
}
787

788

unknown's avatar
unknown committed
789 790 791
void THD::add_changed_table(const char *key, long key_length)
{
  DBUG_ENTER("THD::add_changed_table(key)");
792 793
  CHANGED_TABLE_LIST **prev_changed = &transaction.changed_tables;
  CHANGED_TABLE_LIST *curr = transaction.changed_tables;
794

795
  for (; curr; prev_changed = &(curr->next), curr = curr->next)
796
  {
unknown's avatar
unknown committed
797
    int cmp =  (long)curr->key_length - (long)key_length;
798 799
    if (cmp < 0)
    {
800
      list_include(prev_changed, curr, changed_table_dup(key, key_length));
801
      DBUG_PRINT("info", 
802
		 ("key_length %u %u", key_length, (*prev_changed)->key_length));
803 804 805 806
      DBUG_VOID_RETURN;
    }
    else if (cmp == 0)
    {
unknown's avatar
unknown committed
807
      cmp = memcmp(curr->key, key, curr->key_length);
808 809
      if (cmp < 0)
      {
810
	list_include(prev_changed, curr, changed_table_dup(key, key_length));
811
	DBUG_PRINT("info", 
unknown's avatar
unknown committed
812
		   ("key_length %u %u", key_length,
813
		    (*prev_changed)->key_length));
814 815 816 817 818 819 820 821 822
	DBUG_VOID_RETURN;
      }
      else if (cmp == 0)
      {
	DBUG_PRINT("info", ("already in list"));
	DBUG_VOID_RETURN;
      }
    }
  }
823
  *prev_changed = changed_table_dup(key, key_length);
unknown's avatar
unknown committed
824
  DBUG_PRINT("info", ("key_length %u %u", key_length,
825
		      (*prev_changed)->key_length));
826 827 828
  DBUG_VOID_RETURN;
}

829

unknown's avatar
unknown committed
830
CHANGED_TABLE_LIST* THD::changed_table_dup(const char *key, long key_length)
831 832 833
{
  CHANGED_TABLE_LIST* new_table = 
    (CHANGED_TABLE_LIST*) trans_alloc(ALIGN_SIZE(sizeof(CHANGED_TABLE_LIST))+
unknown's avatar
unknown committed
834
				      key_length + 1);
835 836
  if (!new_table)
  {
837 838
    my_error(EE_OUTOFMEMORY, MYF(ME_BELL),
             ALIGN_SIZE(sizeof(TABLE_LIST)) + key_length + 1);
unknown's avatar
SCRUM  
unknown committed
839
    killed= KILL_CONNECTION;
840 841 842 843 844 845
    return 0;
  }

  new_table->key = (char *) (((byte*)new_table)+
			     ALIGN_SIZE(sizeof(CHANGED_TABLE_LIST)));
  new_table->next = 0;
unknown's avatar
unknown committed
846 847
  new_table->key_length = key_length;
  ::memcpy(new_table->key, key, key_length);
848 849 850
  return new_table;
}

851

unknown's avatar
unknown committed
852 853 854 855
int THD::send_explain_fields(select_result *result)
{
  List<Item> field_list;
  Item *item;
856
  CHARSET_INFO *cs= system_charset_info;
857
  field_list.push_back(new Item_return_int("id",3, MYSQL_TYPE_LONGLONG));
858
  field_list.push_back(new Item_empty_string("select_type", 19, cs));
unknown's avatar
unknown committed
859 860
  field_list.push_back(item= new Item_empty_string("table", NAME_LEN, cs));
  item->maybe_null= 1;
unknown's avatar
unknown committed
861 862
  if (lex->describe & DESCRIBE_PARTITIONS)
  {
863 864 865 866
    /* 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);
unknown's avatar
unknown committed
867 868
    item->maybe_null= 1;
  }
unknown's avatar
unknown committed
869 870
  field_list.push_back(item= new Item_empty_string("type", 10, cs));
  item->maybe_null= 1;
unknown's avatar
unknown committed
871
  field_list.push_back(item=new Item_empty_string("possible_keys",
872
						  NAME_LEN*MAX_KEY, cs));
unknown's avatar
unknown committed
873
  item->maybe_null=1;
874
  field_list.push_back(item=new Item_empty_string("key", NAME_LEN, cs));
unknown's avatar
unknown committed
875
  item->maybe_null=1;
unknown's avatar
unknown committed
876 877
  field_list.push_back(item=new Item_empty_string("key_len",
						  NAME_LEN*MAX_KEY));
unknown's avatar
unknown committed
878 879
  item->maybe_null=1;
  field_list.push_back(item=new Item_empty_string("ref",
880
						  NAME_LEN*MAX_REF_PARTS, cs));
unknown's avatar
unknown committed
881
  item->maybe_null=1;
unknown's avatar
unknown committed
882 883
  field_list.push_back(item= new Item_return_int("rows", 10,
                                                 MYSQL_TYPE_LONGLONG));
884 885 886 887 888
  if (lex->describe & DESCRIBE_EXTENDED)
  {
    field_list.push_back(item= new Item_float("filtered", 0.1234, 2, 4));
    item->maybe_null=1;
  }
unknown's avatar
unknown committed
889
  item->maybe_null= 1;
890
  field_list.push_back(new Item_empty_string("Extra", 255, cs));
891 892
  return (result->send_fields(field_list,
                              Protocol::SEND_NUM_ROWS | Protocol::SEND_EOF));
unknown's avatar
unknown committed
893
}
894

unknown's avatar
unknown committed
895 896 897
#ifdef SIGNAL_WITH_VIO_CLOSE
void THD::close_active_vio()
{
unknown's avatar
unknown committed
898
  DBUG_ENTER("close_active_vio");
unknown's avatar
unknown committed
899
  safe_mutex_assert_owner(&LOCK_delete); 
unknown's avatar
unknown committed
900
#ifndef EMBEDDED_LIBRARY
unknown's avatar
unknown committed
901 902 903 904 905
  if (active_vio)
  {
    vio_close(active_vio);
    active_vio = 0;
  }
unknown's avatar
unknown committed
906
#endif
907
  DBUG_VOID_RETURN;
unknown's avatar
unknown committed
908 909 910
}
#endif

911

912 913 914 915 916
struct Item_change_record: public ilink
{
  Item **place;
  Item *old_value;
  /* Placement new was hidden by `new' in ilink (TODO: check): */
917
  static void *operator new(size_t size, void *mem) { return mem; }
918 919
  static void operator delete(void *ptr, size_t size) {}
  static void operator delete(void *ptr, void *mem) { /* never called */ }
920 921 922 923 924 925
};


/*
  Register an item tree tree transformation, performed by the query
  optimizer. We need a pointer to runtime_memroot because it may be !=
unknown's avatar
unknown committed
926
  thd->mem_root (due to possible set_n_backup_active_arena called for thd).
927 928 929 930 931 932 933 934 935 936 937 938 939 940
*/

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)
  {
941 942 943 944
    /*
      OOM, thd->fatal_error() is called by the error handler of the
      memroot. Just return.
    */
945 946 947 948 949
    return;
  }
  change= new (change_mem) Item_change_record;
  change->place= place;
  change->old_value= old_value;
950
  change_list.append(change);
951 952 953 954 955 956 957
}


void THD::rollback_item_tree_changes()
{
  I_List_iterator<Item_change_record> it(change_list);
  Item_change_record *change;
unknown's avatar
unknown committed
958 959
  DBUG_ENTER("rollback_item_tree_changes");

960 961 962 963
  while ((change= it++))
    *change->place= change->old_value;
  /* We can forget about changes memory: it's allocated in runtime memroot */
  change_list.empty();
unknown's avatar
unknown committed
964
  DBUG_VOID_RETURN;
965 966 967
}


unknown's avatar
unknown committed
968 969 970 971 972 973 974 975 976
/*****************************************************************************
** Functions to provide a interface to select results
*****************************************************************************/

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

977 978
void select_result::send_error(uint errcode,const char *err)
{
unknown's avatar
unknown committed
979
  my_message(errcode, err, MYF(0));
980 981
}

982 983 984 985 986 987

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

988 989 990
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);
unknown's avatar
unknown committed
991 992 993 994 995

sql_exchange::sql_exchange(char *name,bool flag)
  :file_name(name), opt_enclosed(0), dumpfile(flag), skip_lines(0)
{
  field_term= &default_field_term;
unknown's avatar
SCRUM  
unknown committed
996
  enclosed=   line_start= &my_empty_string;
unknown's avatar
unknown committed
997 998 999 1000
  line_term=  &default_line_term;
  escaped=    &default_escaped;
}

1001
bool select_send::send_fields(List<Item> &list, uint flags)
unknown's avatar
unknown committed
1002
{
1003 1004 1005 1006
  bool res;
  if (!(res= thd->protocol->send_fields(&list, flags)))
    status= 1;
  return res;
unknown's avatar
unknown committed
1007 1008
}

1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030
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;
}


unknown's avatar
unknown committed
1031 1032 1033 1034
/* Send data to client. Returns 0 if ok */

bool select_send::send_data(List<Item> &items)
{
1035
  if (unit->offset_limit_cnt)
unknown's avatar
unknown committed
1036
  {						// using limit offset,count
1037
    unit->offset_limit_cnt--;
1038
    return 0;
unknown's avatar
unknown committed
1039
  }
1040

unknown's avatar
unknown committed
1041 1042 1043 1044 1045
  /*
    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
  */
1046
  ha_release_temporary_latches(thd);
1047

1048 1049 1050
  List_iterator_fast<Item> li(items);
  Protocol *protocol= thd->protocol;
  char buff[MAX_FIELD_WIDTH];
unknown's avatar
unknown committed
1051
  String buffer(buff, sizeof(buff), &my_charset_bin);
1052
  DBUG_ENTER("select_send::send_data");
1053 1054

  protocol->prepare_for_resend();
unknown's avatar
unknown committed
1055 1056 1057
  Item *item;
  while ((item=li++))
  {
1058
    if (item->send(protocol, &buffer))
unknown's avatar
unknown committed
1059
    {
1060
      protocol->free();				// Free used buffer
unknown's avatar
unknown committed
1061
      my_message(ER_OUT_OF_RESOURCES, ER(ER_OUT_OF_RESOURCES), MYF(0));
1062
      break;
unknown's avatar
unknown committed
1063 1064
    }
  }
1065
  thd->sent_row_count++;
1066
  if (!thd->vio_ok())
1067
    DBUG_RETURN(0);
1068
  if (!thd->net.report_error)
1069
    DBUG_RETURN(protocol->write());
1070
  protocol->remove_last_row();
1071
  DBUG_RETURN(1);
unknown's avatar
unknown committed
1072 1073 1074 1075
}

bool select_send::send_eof()
{
1076 1077 1078 1079 1080 1081
  /* 
    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);
1082

unknown's avatar
unknown committed
1083 1084 1085
  /* Unlock tables before sending packet to gain some speed */
  if (thd->lock)
  {
1086 1087
    mysql_unlock_tables(thd, thd->lock);
    thd->lock=0;
unknown's avatar
unknown committed
1088
  }
unknown's avatar
unknown committed
1089 1090
  if (!thd->net.report_error)
  {
unknown's avatar
unknown committed
1091
    ::send_eof(thd);
1092
    status= 0;
unknown's avatar
unknown committed
1093 1094 1095 1096
    return 0;
  }
  else
    return 1;
unknown's avatar
unknown committed
1097 1098 1099
}


1100 1101 1102
/************************************************************************
  Handling writing to file
************************************************************************/
unknown's avatar
unknown committed
1103

1104 1105
void select_to_file::send_error(uint errcode,const char *err)
{
unknown's avatar
unknown committed
1106
  my_message(errcode, err, MYF(0));
1107 1108 1109 1110 1111 1112 1113 1114
  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;
  }
}
unknown's avatar
unknown committed
1115 1116


1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142
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;
}


1143
select_to_file::~select_to_file()
unknown's avatar
unknown committed
1144 1145 1146 1147 1148 1149 1150
{
  if (file >= 0)
  {					// This only happens in case of error
    (void) end_io_cache(&cache);
    (void) my_close(file,MYF(0));
    file= -1;
  }
1151 1152 1153 1154 1155 1156 1157 1158
}

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

select_export::~select_export()
{
1159
  thd->sent_row_count=row_count;
unknown's avatar
unknown committed
1160 1161
}

1162

1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180
/*
  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)
unknown's avatar
unknown committed
1181
{
1182 1183
  File file;
  uint option= MY_UNPACK_FILENAME;
1184

unknown's avatar
unknown committed
1185
#ifdef DONT_ALLOW_FULL_LOAD_DATA_PATHS
1186
  option|= MY_REPLACE_DIR;			// Force use of db directory
unknown's avatar
unknown committed
1187
#endif
1188

unknown's avatar
unknown committed
1189
  if (!dirname_length(exchange->file_name))
1190
  {
unknown's avatar
unknown committed
1191 1192
    strxnmov(path, FN_REFLEN-1, mysql_real_data_home, thd->db ? thd->db : "",
             NullS);
1193 1194 1195 1196 1197
    (void) fn_format(path, exchange->file_name, path, "", option);
  }
  else
    (void) fn_format(path, exchange->file_name, mysql_real_data_home, "", option);
    
1198
  if (!access(path, F_OK))
unknown's avatar
unknown committed
1199
  {
1200
    my_error(ER_FILE_EXISTS_ERROR, MYF(0), exchange->file_name);
unknown's avatar
unknown committed
1201
    return -1;
unknown's avatar
unknown committed
1202 1203
  }
  /* Create the file world readable */
unknown's avatar
unknown committed
1204
  if ((file= my_create(path, 0666, O_WRONLY|O_EXCL, MYF(MY_WME))) < 0)
1205
    return file;
unknown's avatar
unknown committed
1206
#ifdef HAVE_FCHMOD
1207
  (void) fchmod(file, 0666);			// Because of umask()
unknown's avatar
unknown committed
1208
#else
1209
  (void) chmod(path, 0666);
unknown's avatar
unknown committed
1210
#endif
1211
  if (init_io_cache(cache, file, 0L, WRITE_CACHE, 0L, 1, MYF(MY_WME)))
unknown's avatar
unknown committed
1212
  {
1213
    my_close(file, MYF(0));
1214
    my_delete(path, MYF(0));  // Delete file on error, it was just created 
1215
    return -1;
unknown's avatar
unknown committed
1216
  }
1217
  return file;
1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228
}


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);

1229
  if ((file= create_file(thd, path, exchange, &cache)) < 0)
1230
    return 1;
unknown's avatar
unknown committed
1231 1232
  /* Check if there is any blobs in data */
  {
unknown's avatar
unknown committed
1233
    List_iterator_fast<Item> li(list);
unknown's avatar
unknown committed
1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264
    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)
{

1265
  DBUG_ENTER("select_export::send_data");
unknown's avatar
unknown committed
1266 1267
  char buff[MAX_FIELD_WIDTH],null_buff[2],space[MAX_FIELD_WIDTH];
  bool space_inited=0;
unknown's avatar
unknown committed
1268
  String tmp(buff,sizeof(buff),&my_charset_bin),*res;
unknown's avatar
unknown committed
1269 1270
  tmp.length(0);

1271
  if (unit->offset_limit_cnt)
unknown's avatar
unknown committed
1272
  {						// using limit offset,count
1273
    unit->offset_limit_cnt--;
unknown's avatar
unknown committed
1274 1275 1276 1277 1278 1279
    DBUG_RETURN(0);
  }
  row_count++;
  Item *item;
  char *buff_ptr=buff;
  uint used_length=0,items_left=items.elements;
unknown's avatar
unknown committed
1280
  List_iterator_fast<Item> li(items);
unknown's avatar
unknown committed
1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 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 1328

  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
unknown's avatar
unknown committed
1329 1330
          CHARSET_INFO *res_charset=res->charset();
	  if (use_mb(res_charset))
unknown's avatar
unknown committed
1331 1332
	  {
	    int l;
unknown's avatar
unknown committed
1333
	    if ((l=my_ismbchar(res_charset, pos, end)))
unknown's avatar
unknown committed
1334 1335 1336 1337 1338 1339 1340 1341 1342 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
	    {
	      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;
1369
	for (; length > sizeof(space) ; length-=sizeof(space))
unknown's avatar
unknown committed
1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406
	{
	  if (my_b_write(&cache,(byte*) space,sizeof(space)))
	    goto err;
	}
	if (my_b_write(&cache,(byte*) space,length))
	  goto err;
      }
    }
    buff_ptr=buff;				// Place separators here
    if (res && (!exchange->opt_enclosed || result_type == STRING_RESULT))
    {
      memcpy(buff_ptr,exchange->enclosed->ptr(),exchange->enclosed->length());
      buff_ptr+=exchange->enclosed->length();
    }
    if (--items_left)
    {
      memcpy(buff_ptr,exchange->field_term->ptr(),field_term_length);
      buff_ptr+=field_term_length;
    }
    if (my_b_write(&cache,(byte*) buff,(uint) (buff_ptr-buff)))
      goto err;
  }
  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
1407 1408
select_dump::prepare(List<Item> &list __attribute__((unused)),
		     SELECT_LEX_UNIT *u)
unknown's avatar
unknown committed
1409
{
1410
  unit= u;
1411
  return (int) ((file= create_file(thd, path, exchange, &cache)) < 0);
unknown's avatar
unknown committed
1412 1413 1414 1415 1416
}


bool select_dump::send_data(List<Item> &items)
{
unknown's avatar
unknown committed
1417
  List_iterator_fast<Item> li(items);
unknown's avatar
unknown committed
1418
  char buff[MAX_FIELD_WIDTH];
unknown's avatar
unknown committed
1419
  String tmp(buff,sizeof(buff),&my_charset_bin),*res;
unknown's avatar
unknown committed
1420 1421
  tmp.length(0);
  Item *item;
1422
  DBUG_ENTER("select_dump::send_data");
unknown's avatar
unknown committed
1423

1424
  if (unit->offset_limit_cnt)
unknown's avatar
unknown committed
1425
  {						// using limit offset,count
1426
    unit->offset_limit_cnt--;
unknown's avatar
unknown committed
1427 1428 1429 1430
    DBUG_RETURN(0);
  }
  if (row_count++ > 1) 
  {
unknown's avatar
unknown committed
1431
    my_message(ER_TOO_MANY_ROWS, ER(ER_TOO_MANY_ROWS), MYF(0));
unknown's avatar
unknown committed
1432 1433 1434 1435 1436
    goto err;
  }
  while ((item=li++))
  {
    res=item->str_result(&tmp);
1437
    if (!res)					// If NULL
unknown's avatar
unknown committed
1438
    {
1439 1440
      if (my_b_write(&cache,(byte*) "",1))
	goto err;
unknown's avatar
unknown committed
1441 1442 1443
    }
    else if (my_b_write(&cache,(byte*) res->ptr(),res->length()))
    {
1444
      my_error(ER_ERROR_ON_WRITE, MYF(0), path, my_errno);
unknown's avatar
unknown committed
1445 1446 1447 1448 1449 1450 1451 1452 1453
      goto err;
    }
  }
  DBUG_RETURN(0);
err:
  DBUG_RETURN(1);
}


1454
select_subselect::select_subselect(Item_subselect *item_arg)
1455
{
1456
  item= item_arg;
1457 1458
}

1459

unknown's avatar
unknown committed
1460
bool select_singlerow_subselect::send_data(List<Item> &items)
1461
{
unknown's avatar
unknown committed
1462 1463
  DBUG_ENTER("select_singlerow_subselect::send_data");
  Item_singlerow_subselect *it= (Item_singlerow_subselect *)item;
unknown's avatar
unknown committed
1464 1465
  if (it->assigned())
  {
1466
    my_message(ER_SUBQUERY_NO_1_ROW, ER(ER_SUBQUERY_NO_1_ROW), MYF(0));
unknown's avatar
unknown committed
1467 1468 1469
    DBUG_RETURN(1);
  }
  if (unit->offset_limit_cnt)
unknown's avatar
unknown committed
1470
  {				          // Using limit offset,count
unknown's avatar
unknown committed
1471 1472
    unit->offset_limit_cnt--;
    DBUG_RETURN(0);
1473
  }
unknown's avatar
unknown committed
1474
  List_iterator_fast<Item> li(items);
1475 1476 1477
  Item *val_item;
  for (uint i= 0; (val_item= li++); i++)
    it->store(i, val_item);
unknown's avatar
unknown committed
1478
  it->assigned(1);
unknown's avatar
unknown committed
1479
  DBUG_RETURN(0);
1480
}
unknown's avatar
unknown committed
1481

1482

1483 1484 1485 1486 1487 1488 1489 1490
void select_max_min_finder_subselect::cleanup()
{
  DBUG_ENTER("select_max_min_finder_subselect::cleanup");
  cache= 0;
  DBUG_VOID_RETURN;
}


1491 1492 1493
bool select_max_min_finder_subselect::send_data(List<Item> &items)
{
  DBUG_ENTER("select_max_min_finder_subselect::send_data");
1494
  Item_maxmin_subselect *it= (Item_maxmin_subselect *)item;
1495 1496
  List_iterator_fast<Item> li(items);
  Item *val_item= li++;
1497
  it->register_value();
1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519
  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;
unknown's avatar
unknown committed
1520 1521 1522
      case DECIMAL_RESULT:
        op= &select_max_min_finder_subselect::cmp_decimal;
        break;
1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538
      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()
{
  Item *maxmin= ((Item_singlerow_subselect *)item)->el(0);
1539
  double val1= cache->val_real(), val2= maxmin->val_real();
1540 1541 1542 1543
  if (fmax)
    return (cache->null_value && !maxmin->null_value) ||
      (!cache->null_value && !maxmin->null_value &&
       val1 > val2);
1544 1545 1546
  return (maxmin->null_value && !cache->null_value) ||
    (!cache->null_value && !maxmin->null_value &&
     val1 < val2);
1547 1548 1549 1550 1551 1552 1553 1554 1555 1556
}

bool select_max_min_finder_subselect::cmp_int()
{
  Item *maxmin= ((Item_singlerow_subselect *)item)->el(0);
  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);
1557 1558 1559
  return (maxmin->null_value && !cache->null_value) ||
    (!cache->null_value && !maxmin->null_value &&
     val1 < val2);
1560 1561
}

unknown's avatar
unknown committed
1562 1563 1564 1565 1566 1567 1568 1569 1570
bool select_max_min_finder_subselect::cmp_decimal()
{
  Item *maxmin= ((Item_singlerow_subselect *)item)->el(0);
  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) ;
1571 1572 1573
  return (maxmin->null_value && !cache->null_value) ||
    (!cache->null_value && !maxmin->null_value &&
     my_decimal_cmp(cvalue,mvalue) < 0);
unknown's avatar
unknown committed
1574 1575
}

1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589
bool select_max_min_finder_subselect::cmp_str()
{
  String *val1, *val2, buf1, buf2;
  Item *maxmin= ((Item_singlerow_subselect *)item)->el(0);
  /*
    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) ;
1590 1591 1592
  return (maxmin->null_value && !cache->null_value) ||
    (!cache->null_value && !maxmin->null_value &&
     sortcmp(val1, val2, cache->collation.collation) < 0);
1593 1594
}

unknown's avatar
unknown committed
1595 1596 1597 1598 1599 1600 1601 1602 1603 1604
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;
unknown's avatar
unknown committed
1605
  it->assigned(1);
unknown's avatar
unknown committed
1606 1607 1608
  DBUG_RETURN(0);
}

unknown's avatar
unknown committed
1609 1610

/***************************************************************************
1611
  Dump of select to variables
unknown's avatar
unknown committed
1612
***************************************************************************/
1613

1614
int select_dumpvar::prepare(List<Item> &list, SELECT_LEX_UNIT *u)
unknown's avatar
unknown committed
1615
{
1616
  List_iterator_fast<Item> li(list);
unknown's avatar
unknown committed
1617
  List_iterator_fast<my_var> gl(var_list);
unknown's avatar
unknown committed
1618
  Item *item;
1619

1620 1621
  local_vars.empty();				// Clear list if SP
  unit= u;
1622
  row_count= 0;
1623

1624
  if (var_list.elements != list.elements)
unknown's avatar
unknown committed
1625
  {
unknown's avatar
unknown committed
1626 1627
    my_message(ER_WRONG_NUMBER_OF_COLUMNS_IN_SELECT,
               ER(ER_WRONG_NUMBER_OF_COLUMNS_IN_SELECT), MYF(0));
1628
    return 1;
unknown's avatar
unknown committed
1629
  }
1630
  while ((item=li++))
unknown's avatar
unknown committed
1631
  {
1632
    my_var *mv= gl++;
unknown's avatar
unknown committed
1633
    if (mv->local)
1634
    {
1635 1636
      Item_splocal *var= new Item_splocal(mv->s, mv->offset, mv->type);
      (void)local_vars.push_back(var);
unknown's avatar
unknown committed
1637
#ifndef DBUG_OFF
1638
      var->m_sp= mv->sp;
1639 1640
#endif
    }
unknown's avatar
unknown committed
1641 1642
    else
    {
1643
      Item_func_set_user_var *var= new Item_func_set_user_var(mv->s, item);
unknown's avatar
unknown committed
1644 1645 1646
      /*
        Item_func_set_user_var can't substitute something else on its place =>
        0 can be passed as last argument (reference on item)
unknown's avatar
unknown committed
1647
        Item_func_set_user_var can't be fixed after creation, so we do not
1648
        check var->fixed
unknown's avatar
unknown committed
1649
      */
1650 1651 1652
      var->fix_fields(thd, 0);
      var->fix_length_and_dec();
      vars.push_back(var);
unknown's avatar
unknown committed
1653
    }
unknown's avatar
unknown committed
1654
  }
1655 1656
  return 0;
}
1657

1658

1659 1660 1661 1662 1663 1664 1665
void select_dumpvar::cleanup()
{
  vars.empty();
  row_count=0;
}


unknown's avatar
unknown committed
1666
Query_arena::Type Query_arena::type() const
1667
{
unknown's avatar
unknown committed
1668
  DBUG_ASSERT(0); /* Should never be called */
1669
  return STATEMENT;
1670 1671 1672
}


1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687
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;
}


1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700
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");
}

1701 1702 1703 1704
/*
  Statement functions 
*/

unknown's avatar
unknown committed
1705 1706 1707 1708
Statement::Statement(enum enum_state state_arg, ulong id_arg,
                     ulong alloc_block_size, ulong prealloc_size)
  :Query_arena(&main_mem_root, state_arg),
  id(id_arg),
1709
  mark_used_columns(MARK_COLUMNS_READ),
1710 1711
  lex(&main_lex),
  query(0),
1712 1713
  query_length(0),
  cursor(0)
1714
{
1715
  name.str= NULL;
unknown's avatar
unknown committed
1716
  init_sql_alloc(&main_mem_root, alloc_block_size, prealloc_size);
1717 1718 1719
}


unknown's avatar
unknown committed
1720
Query_arena::Type Statement::type() const
1721 1722 1723 1724 1725 1726 1727 1728
{
  return STATEMENT;
}


void Statement::set_statement(Statement *stmt)
{
  id=             stmt->id;
1729
  mark_used_columns=   stmt->mark_used_columns;
1730 1731 1732
  lex=            stmt->lex;
  query=          stmt->query;
  query_length=   stmt->query_length;
1733
  cursor=         stmt->cursor;
1734 1735 1736
}


1737 1738 1739
void
Statement::set_n_backup_statement(Statement *stmt, Statement *backup)
{
1740
  DBUG_ENTER("Statement::set_n_backup_statement");
1741 1742
  backup->set_statement(this);
  set_statement(stmt);
1743
  DBUG_VOID_RETURN;
1744 1745 1746 1747 1748
}


void Statement::restore_backup_statement(Statement *stmt, Statement *backup)
{
1749
  DBUG_ENTER("Statement::restore_backup_statement");
1750 1751
  stmt->set_statement(this);
  set_statement(backup);
1752
  DBUG_VOID_RETURN;
1753 1754 1755
}


1756
void THD::end_statement()
1757 1758 1759 1760 1761
{
  /* Cleanup SQL processing state to resuse this statement in next query. */
  lex_end(lex);
  delete lex->result;
  lex->result= 0;
1762 1763
  /* Note that free_list is freed in cleanup_after_query() */

1764 1765 1766 1767 1768 1769 1770
  /*
    Don't free mem_root, as mem_root is freed in the end of dispatch_command
    (once for any command).
  */
}


unknown's avatar
unknown committed
1771
void THD::set_n_backup_active_arena(Query_arena *set, Query_arena *backup)
unknown's avatar
unknown committed
1772
{
unknown's avatar
unknown committed
1773
  DBUG_ENTER("THD::set_n_backup_active_arena");
1774
  DBUG_ASSERT(backup->is_backup_arena == FALSE);
1775

unknown's avatar
unknown committed
1776 1777
  backup->set_query_arena(this);
  set_query_arena(set);
unknown's avatar
unknown committed
1778
#ifndef DBUG_OFF
1779
  backup->is_backup_arena= TRUE;
unknown's avatar
unknown committed
1780
#endif
1781
  DBUG_VOID_RETURN;
unknown's avatar
unknown committed
1782 1783 1784
}


unknown's avatar
unknown committed
1785
void THD::restore_active_arena(Query_arena *set, Query_arena *backup)
1786
{
unknown's avatar
unknown committed
1787
  DBUG_ENTER("THD::restore_active_arena");
1788
  DBUG_ASSERT(backup->is_backup_arena);
unknown's avatar
unknown committed
1789 1790
  set->set_query_arena(this);
  set_query_arena(backup);
unknown's avatar
unknown committed
1791
#ifndef DBUG_OFF
1792
  backup->is_backup_arena= FALSE;
1793
#endif
unknown's avatar
unknown committed
1794
  DBUG_VOID_RETURN;
1795 1796
}

1797 1798
Statement::~Statement()
{
1799 1800 1801 1802 1803
  /*
    We must free `main_mem_root', not `mem_root' (pointer), to work
    correctly if this statement is used as a backup statement,
    for which `mem_root' may point to some other statement.
  */
unknown's avatar
unknown committed
1804
  free_root(&main_mem_root, MYF(0));
1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822
}

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;
}

1823 1824
static byte *get_stmt_name_hash_key(Statement *entry, uint *length,
                                    my_bool not_used __attribute__((unused)))
1825 1826 1827 1828 1829
{
  *length=(uint) entry->name.length;
  return (byte*) entry->name.str;
}

1830 1831 1832 1833 1834
C_MODE_END

Statement_map::Statement_map() :
  last_found_statement(0)
{
1835 1836 1837 1838 1839
  enum
  {
    START_STMT_HASH_SIZE = 16,
    START_NAME_HASH_SIZE = 16
  };
1840
  hash_init(&st_hash, &my_charset_bin, START_STMT_HASH_SIZE, 0, 0,
1841 1842
            get_statement_id_as_hash_key,
            delete_statement_as_hash_key, MYF(0));
1843
  hash_init(&names_hash, system_charset_info, START_NAME_HASH_SIZE, 0, 0,
1844 1845
            (hash_get_key) get_stmt_name_hash_key,
            NULL,MYF(0));
1846 1847
}

1848

1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870
/*
  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)
1871
{
1872
  if (my_hash_insert(&st_hash, (byte*) statement))
1873
  {
1874 1875 1876 1877 1878 1879 1880 1881
    /*
      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;
  }
1882
  if (statement->name.str && my_hash_insert(&names_hash, (byte*) statement))
1883
  {
1884 1885
    my_error(ER_OUT_OF_RESOURCES, MYF(0));
    goto err_names_hash;
1886
  }
1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897
  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);
1898 1899
    my_error(ER_MAX_PREPARED_STMT_COUNT_REACHED, MYF(0),
             max_prepared_stmt_count);
1900 1901 1902 1903 1904
    goto err_max;
  }
  prepared_stmt_count++;
  pthread_mutex_unlock(&LOCK_prepared_stmt_count);

1905
  last_found_statement= statement;
1906 1907 1908 1909 1910 1911 1912 1913 1914
  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;
1915 1916
}

1917

1918 1919
void Statement_map::close_transient_cursors()
{
1920
#ifdef TO_BE_IMPLEMENTED
1921 1922 1923
  Statement *stmt;
  while ((stmt= transient_cursor_list.head()))
    stmt->close_cursor();                 /* deletes itself from the list */
1924
#endif
1925 1926 1927
}


1928 1929 1930 1931 1932 1933
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);
1934

1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953
  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;
1954 1955
}

1956

1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968
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);
}

1969 1970 1971
bool select_dumpvar::send_data(List<Item> &items)
{
  List_iterator_fast<Item_func_set_user_var> li(vars);
unknown's avatar
unknown committed
1972 1973
  List_iterator_fast<Item_splocal> var_li(local_vars);
  List_iterator_fast<my_var> my_li(var_list);
1974
  List_iterator<Item> it(items);
1975
  Item_func_set_user_var *xx;
unknown's avatar
unknown committed
1976 1977
  Item_splocal *yy;
  my_var *zz;
1978
  DBUG_ENTER("select_dumpvar::send_data");
1979

1980
  if (unit->offset_limit_cnt)
1981
  {						// using limit offset,count
1982 1983 1984
    unit->offset_limit_cnt--;
    DBUG_RETURN(0);
  }
1985 1986
  if (row_count++) 
  {
unknown's avatar
unknown committed
1987
    my_message(ER_TOO_MANY_ROWS, ER(ER_TOO_MANY_ROWS), MYF(0));
1988 1989
    DBUG_RETURN(1);
  }
1990
  while ((zz=my_li++) && (it++))
unknown's avatar
unknown committed
1991
  {
unknown's avatar
unknown committed
1992 1993 1994 1995
    if (zz->local)
    {
      if ((yy=var_li++)) 
      {
1996
	if (thd->spcont->set_variable(current_thd, yy->get_var_idx(),
1997
                                      it.ref()))
1998
	  DBUG_RETURN(1);
unknown's avatar
unknown committed
1999 2000 2001 2002 2003
      }
    }
    else
    {
      if ((xx=li++))
unknown's avatar
unknown committed
2004
      {
2005
        xx->check(0);
unknown's avatar
unknown committed
2006
	xx->update();
unknown's avatar
unknown committed
2007
      }
unknown's avatar
unknown committed
2008
    }
unknown's avatar
unknown committed
2009
  }
unknown's avatar
unknown committed
2010 2011 2012 2013 2014
  DBUG_RETURN(0);
}

bool select_dumpvar::send_eof()
{
2015
  if (! row_count)
unknown's avatar
unknown committed
2016 2017
    push_warning(thd, MYSQL_ERROR::WARN_LEVEL_WARN,
                 ER_SP_FETCH_NO_DATA, ER(ER_SP_FETCH_NO_DATA));
2018 2019
  ::send_ok(thd,row_count);
  return 0;
unknown's avatar
unknown committed
2020
}
2021 2022 2023 2024 2025 2026 2027

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

void TMP_TABLE_PARAM::init()
{
2028 2029
  DBUG_ENTER("TMP_TABLE_PARAM::init");
  DBUG_PRINT("enter", ("this: 0x%lx", (ulong)this));
2030 2031 2032
  field_count= sum_func_count= func_count= hidden_field_count= 0;
  group_parts= group_length= group_null_parts= 0;
  quick_group= 1;
unknown's avatar
unknown committed
2033
  table_charset= 0;
2034
  precomputed_group_by= 0;
2035
  DBUG_VOID_RETURN;
2036
}
2037 2038 2039 2040


void thd_increment_bytes_sent(ulong length)
{
unknown's avatar
unknown committed
2041
  THD *thd=current_thd;
unknown's avatar
unknown committed
2042
  if (likely(thd != 0))
unknown's avatar
unknown committed
2043 2044 2045
  { /* current_thd==0 when close_connection() calls net_send_error() */
    thd->status_var.bytes_sent+= length;
  }
2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064
}


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));
}
2065

2066

2067
void Security_context::init()
2068 2069 2070
{
  host= user= priv_user= ip= 0;
  host_or_ip= "connecting host";
2071
  priv_host[0]= '\0';
2072 2073 2074 2075 2076 2077
#ifndef NO_EMBEDDED_ACCESS_CHECKS
  db_access= NO_ACCESS;
#endif
}


2078
void Security_context::destroy()
2079 2080 2081 2082 2083 2084 2085 2086 2087 2088
{
  // If not pointer to constant
  if (host != my_localhost)
    safeFree(host);
  if (user != delayed_user)
    safeFree(user);
  safeFree(ip);
}


2089
void Security_context::skip_grants()
2090 2091 2092 2093 2094 2095 2096 2097 2098
{
  /* privileges for the user are unknown everything is allowed */
  host_or_ip= (char *)"";
  master_access= ~NO_ACCESS;
  priv_user= (char *)"";
  *priv_host= '\0';
}


2099 2100 2101 2102 2103 2104 2105
bool Security_context::set_user(char *user_arg)
{
  safeFree(user);
  user= my_strdup(user_arg, MYF(0));
  return user == 0;
}

unknown's avatar
unknown committed
2106

2107 2108 2109 2110 2111 2112 2113 2114
/****************************************************************************
  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.
****************************************************************************/

2115
void THD::reset_n_backup_open_tables_state(Open_tables_state *backup)
2116
{
2117 2118
  DBUG_ENTER("reset_n_backup_open_tables_state");
  backup->set_open_tables_state(this);
2119
  reset_open_tables_state();
2120
  state_flags|= Open_tables_state::BACKUPS_AVAIL;
2121
  DBUG_VOID_RETURN;
2122 2123 2124
}


2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136
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);
2137 2138
  DBUG_VOID_RETURN;
}
2139 2140


2141

2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154
/****************************************************************************
  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
2155
  - Value of last_insert_id() is saved and restored
2156 2157 2158 2159
  - 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
2160
  - new savepoint level is created and destroyed
2161 2162 2163 2164 2165 2166

  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.
2167 2168

    We do not reset value of last_insert_id().
2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182
****************************************************************************/

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;
2183
  backup->savepoints= transaction.savepoints;
2184 2185 2186 2187
  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;
2188

2189
  if ((!lex->requires_prelocking() || is_update_query(lex->sql_command)) &&
2190
      !current_stmt_binlog_row_based)
2191
  {
2192
    options&= ~OPTION_BIN_LOG;
2193
  }    
2194 2195 2196 2197 2198 2199
  /* Disable result sets */
  client_capabilities &= ~CLIENT_MULTI_RESULTS;
  in_sub_stmt|= new_state;
  examined_row_count= 0;
  sent_row_count= 0;
  cuted_fields= 0;
2200
  transaction.savepoints= 0;
2201
  first_successful_insert_id_in_cur_stmt= 0;
2202 2203 2204 2205 2206 2207 2208 2209

  /* 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)
{
2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224
  /*
    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;
2225 2226 2227 2228
  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;
2229 2230 2231 2232
  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;
2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243
  limit_found_rows= backup->limit_found_rows;
  sent_row_count=   backup->sent_row_count;
  client_capabilities= backup->client_capabilities;

  /*
    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;
}
2244 2245 2246 2247 2248 2249


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

2250 2251 2252 2253 2254 2255
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)))
{
2256 2257
  *length=((XID_STATE*)ptr)->xid.key_length();
  return ((XID_STATE*)ptr)->xid.key();
2258 2259 2260 2261 2262
}

static void xid_free_hash (void *ptr)
{
  if (!((XID_STATE*)ptr)->in_thd)
unknown's avatar
unknown committed
2263
    my_free((gptr)ptr, MYF(0));
2264 2265 2266 2267 2268
}

bool xid_cache_init()
{
  pthread_mutex_init(&LOCK_xid_cache, MY_MUTEX_INIT_FAST);
unknown's avatar
unknown committed
2269 2270
  return hash_init(&xid_cache, &my_charset_bin, 100, 0, 0,
                   xid_get_hash_key, xid_free_hash, 0) != 0;
2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284
}

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);
2285
  XID_STATE *res=(XID_STATE *)hash_search(&xid_cache, xid->key(), xid->key_length());
2286 2287 2288 2289
  pthread_mutex_unlock(&LOCK_xid_cache);
  return res;
}

2290

2291 2292 2293 2294 2295
bool xid_cache_insert(XID *xid, enum xa_states xa_state)
{
  XID_STATE *xs;
  my_bool res;
  pthread_mutex_lock(&LOCK_xid_cache);
2296
  if (hash_search(&xid_cache, xid->key(), xid->key_length()))
2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310
    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;
}

2311

2312 2313 2314
bool xid_cache_insert(XID_STATE *xid_state)
{
  pthread_mutex_lock(&LOCK_xid_cache);
2315 2316
  DBUG_ASSERT(hash_search(&xid_cache, xid_state->xid.key(),
                          xid_state->xid.key_length())==0);
2317 2318 2319 2320 2321
  my_bool res=my_hash_insert(&xid_cache, (byte*)xid_state);
  pthread_mutex_unlock(&LOCK_xid_cache);
  return res;
}

2322

2323 2324 2325 2326 2327 2328 2329
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);
}

2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364
/*
  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
#ifdef HAVE_ROW_BASED_REPLICATION

/*
  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,
unknown's avatar
unknown committed
2365 2366
                                       bool is_transactional,
				       RowsEventT *hint __attribute__((unused)))
2367
{
2368
  DBUG_ENTER("binlog_prepare_pending_rows_event");
2369
  /* Pre-conditions */
2370
  DBUG_ASSERT(table->s->table_map_id != ~0UL);
2371 2372 2373 2374 2375 2376 2377 2378 2379

  /* 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())
2380
    DBUG_RETURN(NULL);
2381 2382 2383 2384

  Rows_log_event* pending= binlog_get_pending_rows_event();

  if (unlikely(pending && !pending->is_valid()))
2385
    DBUG_RETURN(NULL);
2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409

  /*
    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))
2410
      DBUG_RETURN(NULL);
2411 2412 2413 2414 2415 2416 2417 2418
    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;
2419
      DBUG_RETURN(NULL);
2420 2421
    }

2422
    DBUG_RETURN(ev);               /* This is the new pending event */
2423
  }
2424
  DBUG_RETURN(pending);        /* This is the current pending event */
2425 2426
}

unknown's avatar
unknown committed
2427
#ifdef HAVE_EXPLICIT_TEMPLATE_INSTANTIATION
2428
/*
2429
  Instantiate the versions we need, we have -fno-implicit-template as
2430 2431 2432
  compiling option.
*/
template Rows_log_event*
unknown's avatar
unknown committed
2433 2434 2435
THD::binlog_prepare_pending_rows_event(TABLE*, uint32, MY_BITMAP const*,
				       my_size_t, my_size_t, bool,
				       Write_rows_log_event*);
2436 2437

template Rows_log_event*
unknown's avatar
unknown committed
2438 2439 2440
THD::binlog_prepare_pending_rows_event(TABLE*, uint32, MY_BITMAP const*,
				       my_size_t colcnt, my_size_t, bool,
				       Delete_rows_log_event *);
2441 2442

template Rows_log_event* 
unknown's avatar
unknown committed
2443 2444 2445
THD::binlog_prepare_pending_rows_event(TABLE*, uint32, MY_BITMAP const*,
				       my_size_t colcnt, my_size_t, bool,
				       Update_rows_log_event *);
unknown's avatar
unknown committed
2446
#endif
2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 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
static char const* 
field_type_name(enum_field_types type) 
{
  switch (type) 
  {
  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";
}

2510

2511 2512 2513 2514 2515 2516 2517 2518 2519 2520
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];
2521
    length+= blob->get_length((const char *) (data + blob->offset())) + 2;
2522 2523 2524 2525 2526
  }

  return length;
}

2527

2528 2529 2530
my_size_t THD::pack_row(TABLE *table, MY_BITMAP const* cols, byte *row_data, 
                        const byte *record) const
{
2531
  Field **p_field= table->field, *field;
2532
  int n_null_bytes= table->s->null_bytes;
2533 2534
  byte *ptr;
  uint i;
2535 2536
  my_ptrdiff_t const rec_offset= record - table->record[0];
  my_ptrdiff_t const def_offset= table->s->default_values - table->record[0];
2537
  memcpy(row_data, record, n_null_bytes);
2538
  ptr= row_data+n_null_bytes;
2539

2540
  for (i= 0 ; (field= *p_field) ; i++, p_field++)
2541 2542
  {
    if (bitmap_is_set(cols,i))
2543 2544 2545
    {
      my_ptrdiff_t const offset=
        field->is_null(rec_offset) ? def_offset : rec_offset;
2546 2547 2548
      field->move_field_offset(offset);
      ptr= (byte*)field->pack((char *) ptr, field->ptr);
      field->move_field_offset(-offset);
2549
    }
2550
  }
2551
  return (static_cast<my_size_t>(ptr - row_data));
2552 2553
}

2554

2555 2556 2557 2558
int THD::binlog_write_row(TABLE* table, bool is_trans, 
                          MY_BITMAP const* cols, my_size_t colcnt, 
                          byte const *record) 
{ 
2559
  DBUG_ASSERT(current_stmt_binlog_row_based && mysql_bin_log.is_open());
2560

2561 2562 2563
  /*
    Pack records into format for transfer. We are allocating more
    memory than needed, but that doesn't matter.
2564 2565 2566 2567
  */
  bool error= 0;
  byte *row_data= table->write_row_record;
  my_size_t const max_len= max_row_length(table, record);
2568 2569 2570 2571
  my_size_t len;
  Rows_log_event *ev;
  
  /* Allocate room for a row (if needed) */
2572 2573 2574 2575 2576
  if (!row_data)
  {
    if (!table->s->blob_fields)
    {
      /* multiply max_len by 2 so it can be used for update_row as well */
2577 2578
      table->write_row_record= (byte *) alloc_root(&table->mem_root,
                                                   2*max_len);
2579 2580 2581 2582
      if (!table->write_row_record)
        return HA_ERR_OUT_OF_MEM;
      row_data= table->write_row_record;
    }
2583
    else if (unlikely(!(row_data= (byte *) my_malloc(max_len, MYF(MY_WME)))))
2584 2585
      return HA_ERR_OUT_OF_MEM;
  }
2586
  len= pack_row(table, cols, row_data, record);
2587

2588 2589 2590
  ev= binlog_prepare_pending_rows_event(table, server_id, cols, colcnt,
                                        len, is_trans,
                                        static_cast<Write_rows_log_event*>(0));
2591 2592 2593 2594 2595

  /* add_row_data copies row_data to internal buffer */
  error= likely(ev != 0) ? ev->add_row_data(row_data,len) : HA_ERR_OUT_OF_MEM ;

  if (table->write_row_record == 0)
2596
    my_free((gptr) row_data, MYF(MY_WME));
2597 2598 2599 2600 2601 2602 2603 2604 2605

  return error;
}

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)
{ 
2606
  DBUG_ASSERT(current_stmt_binlog_row_based && mysql_bin_log.is_open());
2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620

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

  byte *row_data= table->write_row_record;
  byte *before_row, *after_row;
  if (row_data != 0)
  {
    before_row= row_data;
    after_row= before_row + before_maxlen;
  }
  else
  {
2621
    if (unlikely(!(row_data= (byte*)my_multi_malloc(MYF(MY_WME),
2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632
                                             &before_row, before_maxlen,
                                             &after_row, after_maxlen,
                                             NULL))))
      return HA_ERR_OUT_OF_MEM;
  }

  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);
  
unknown's avatar
unknown committed
2633 2634 2635 2636
  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);
2637

unknown's avatar
unknown committed
2638 2639 2640 2641
  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));
2642

2643 2644 2645
  error=
    unlikely(!ev) ||
    ev->add_row_data(before_row, before_size) ||
2646 2647 2648 2649 2650
    ev->add_row_data(after_row, after_size);

  if (!table->write_row_record)
  {
    /* add_row_data copies row_data to internal buffer */
2651
    my_free((gptr)row_data, MYF(MY_WME));
2652 2653 2654 2655 2656 2657 2658 2659 2660
  }
  
  return error;
}

int THD::binlog_delete_row(TABLE* table, bool is_trans, 
                           MY_BITMAP const* cols, my_size_t colcnt,
                           byte const *record)
{ 
2661
  DBUG_ASSERT(current_stmt_binlog_row_based && mysql_bin_log.is_open());
2662 2663 2664 2665 2666 2667 2668 2669

  /* 
     Pack records into format for transfer. We are allocating more
     memory than needed, but that doesn't matter.
  */
  bool error= 0;
  my_size_t const max_len= max_row_length(table, record);
  byte *row_data= table->write_row_record;
2670
  if (!row_data && unlikely(!(row_data= (byte*)my_malloc(max_len, MYF(MY_WME)))))
2671 2672 2673
    return HA_ERR_OUT_OF_MEM;
  my_size_t const len= pack_row(table, cols, row_data, record);

unknown's avatar
unknown committed
2674 2675 2676 2677
  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));
2678 2679 2680 2681 2682

  error= (unlikely(!ev)) || ev->add_row_data(row_data, len);

  /* add_row_data copies row_data */
  if (table->write_row_record == 0)
2683
    my_free((gptr)row_data, MYF(MY_WME));
2684 2685 2686 2687 2688 2689 2690 2691

  return error;
}


int THD::binlog_flush_pending_rows_event(bool stmt_end)
{
  DBUG_ENTER("THD::binlog_flush_pending_rows_event");
2692 2693 2694 2695 2696 2697
  /*
    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())
2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710
    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;
2711
      binlog_table_maps= 0;
2712 2713
    }

2714 2715
    error= mysql_bin_log.flush_and_set_pending_rows_event(this, 0);
  }
2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733

  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);
  }
}

#endif /* HAVE_ROW_BASED_REPLICATION */

/*
  Member function that will log query, either row-based or
2734 2735
  statement-based depending on the value of the 'current_stmt_binlog_row_based'
  the value of the 'qtype' flag.
2736 2737 2738 2739 2740

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

2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751
  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.

2752 2753 2754 2755 2756 2757 2758 2759
  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");
2760
  DBUG_PRINT("enter", ("qtype=%d, query='%s'", qtype, query));
2761
  DBUG_ASSERT(query && mysql_bin_log.is_open());
2762

2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777
  /*
    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().
  */
#ifdef HAVE_ROW_BASED_REPLICATION
  if (this->prelocked_mode == NON_PRELOCKED)
    if (int error= binlog_flush_pending_rows_event(TRUE))
      DBUG_RETURN(error);
#endif /*HAVE_ROW_BASED_REPLICATION*/

2778
  switch (qtype) {
2779 2780 2781 2782 2783 2784
  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.

2785
      Make sure to change in check_table_binlog_row_based() according
2786 2787 2788
      to how you treat this.
    */
  case THD::ROW_QUERY_TYPE:
2789
#ifdef HAVE_ROW_BASED_REPLICATION
2790
    if (current_stmt_binlog_row_based)
2791
      DBUG_RETURN(0);
2792
#endif
2793 2794 2795
    /* Otherwise, we fall through */
  case THD::STMT_QUERY_TYPE:
    /*
2796 2797
      The MYSQL_LOG::write() function will set the STMT_END_F flag and
      flush the pending rows event if necessary.
2798 2799 2800
     */
    {
      Query_log_event qinfo(this, query, query_len, is_trans, suppress_use);
2801
#ifdef HAVE_ROW_BASED_REPLICATION
2802
      qinfo.flags|= LOG_EVENT_UPDATE_TABLE_MAP_VERSION_F;
2803
#endif
2804 2805 2806 2807 2808 2809 2810
      /*
        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);
2811
#ifdef HAVE_ROW_BASED_REPLICATION
2812
      binlog_table_maps= 0;
2813
#endif /*HAVE_ROW_BASED_REPLICATION*/
2814
      DBUG_RETURN(error);
2815 2816 2817 2818 2819 2820 2821 2822 2823 2824
    }
    break;

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

2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846
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);
}

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