sp_head.cc 105 KB
Newer Older
1
/* Copyright 2002-2008 MySQL AB, 2008 Sun Microsystems, Inc.
2 3 4

   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
unknown's avatar
unknown committed
5
   the Free Software Foundation; version 2 of the License.
6 7 8 9 10 11 12 13 14 15

   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with this program; if not, write to the Free Software
   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA */

16
#include "mysql_priv.h"
17
#include "sql_prepare.h"
18
#include "probes_mysql.h"
19
#ifdef USE_PRAGMA_IMPLEMENTATION
20 21 22
#pragma implementation
#endif
#include "sp_head.h"
23
#include "sp.h"
24 25
#include "sp_pcontext.h"
#include "sp_rcontext.h"
26
#include "sp_cache.h"
27

unknown's avatar
unknown committed
28 29 30 31 32 33 34
/*
  Sufficient max length of printed destinations and frame offsets (all uints).
*/
#define SP_INSTR_UINT_MAXLEN  8
#define SP_STMT_PRINT_MAXLEN 40


35 36
#include <my_user.h>

37 38
extern "C" uchar *sp_table_key(const uchar *ptr, size_t *plen, my_bool first);

39 40 41
Item_result
sp_map_result_type(enum enum_field_types type)
{
42
  switch (type) {
43
  case MYSQL_TYPE_BIT:
44 45 46 47 48 49 50
  case MYSQL_TYPE_TINY:
  case MYSQL_TYPE_SHORT:
  case MYSQL_TYPE_LONG:
  case MYSQL_TYPE_LONGLONG:
  case MYSQL_TYPE_INT24:
    return INT_RESULT;
  case MYSQL_TYPE_DECIMAL:
unknown's avatar
unknown committed
51 52
  case MYSQL_TYPE_NEWDECIMAL:
    return DECIMAL_RESULT;
53 54 55 56 57 58 59 60
  case MYSQL_TYPE_FLOAT:
  case MYSQL_TYPE_DOUBLE:
    return REAL_RESULT;
  default:
    return STRING_RESULT;
  }
}

61 62 63 64 65

Item::Type
sp_map_item_type(enum enum_field_types type)
{
  switch (type) {
66
  case MYSQL_TYPE_BIT:
67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84
  case MYSQL_TYPE_TINY:
  case MYSQL_TYPE_SHORT:
  case MYSQL_TYPE_LONG:
  case MYSQL_TYPE_LONGLONG:
  case MYSQL_TYPE_INT24:
    return Item::INT_ITEM;
  case MYSQL_TYPE_DECIMAL:
  case MYSQL_TYPE_NEWDECIMAL:
    return Item::DECIMAL_ITEM;
  case MYSQL_TYPE_FLOAT:
  case MYSQL_TYPE_DOUBLE:
    return Item::REAL_ITEM;
  default:
    return Item::STRING_ITEM;
  }
}


unknown's avatar
unknown committed
85
/**
86 87
  Return a string representation of the Item value.

unknown's avatar
unknown committed
88 89
  @param thd     thread handle
  @param str     string buffer for representation of the value
90

unknown's avatar
unknown committed
91 92 93
  @note
    If the item has a string result type, the string is escaped
    according to its character set.
94

unknown's avatar
unknown committed
95 96 97 98
  @retval
    NULL      on error
  @retval
    non-NULL  a pointer to valid a valid string on success
99 100 101
*/

static String *
102
sp_get_item_value(THD *thd, Item *item, String *str)
103 104 105 106 107
{
  switch (item->result_type()) {
  case REAL_RESULT:
  case INT_RESULT:
  case DECIMAL_RESULT:
108 109 110
    if (item->field_type() != MYSQL_TYPE_BIT)
      return item->val_str(str);
    else {/* Bit type is handled as binary string */}
111 112 113 114 115 116 117
  case STRING_RESULT:
    {
      String *result= item->val_str(str);
      
      if (!result)
        return NULL;
      
118 119 120
      {
        char buf_holder[STRING_BUFFER_USUAL_SIZE];
        String buf(buf_holder, sizeof(buf_holder), result->charset());
121
        CHARSET_INFO *cs= thd->variables.character_set_client;
122 123 124 125 126 127

        /* We must reset length of the buffer, because of String specificity. */
        buf.length(0);

        buf.append('_');
        buf.append(result->charset()->csname);
128
        if (cs->escape_with_backslash_is_dangerous)
129
          buf.append(' ');
130
        append_query_string(cs, result, &buf);
131 132 133
        buf.append(" COLLATE '");
        buf.append(item->collation.collation->name);
        buf.append('\'');
134 135 136 137
        str->copy(buf);

        return str;
      }
138 139 140 141 142 143 144 145 146
    }

  case ROW_RESULT:
  default:
    return NULL;
  }
}


unknown's avatar
unknown committed
147 148 149 150 151 152
/**
   Returns a combination of:
   - sp_head::MULTI_RESULTS: added if the 'cmd' is a command that might
     result in multiple result sets being sent back.
   - sp_head::CONTAINS_DYNAMIC_SQL: added if 'cmd' is one of PREPARE,
     EXECUTE, DEALLOCATE.
153 154 155 156
*/

uint
sp_get_flags_for_command(LEX *lex)
157
{
158 159 160 161 162 163 164 165 166 167
  uint flags;

  switch (lex->sql_command) {
  case SQLCOM_SELECT:
    if (lex->result)
    {
      flags= 0;                      /* This is a SELECT with INTO clause */
      break;
    }
    /* fallthrough */
168
  case SQLCOM_ANALYZE:
169 170 171
  case SQLCOM_OPTIMIZE:
  case SQLCOM_PRELOAD_KEYS:
  case SQLCOM_ASSIGN_TO_KEYCACHE:
172
  case SQLCOM_CHECKSUM:
173
  case SQLCOM_CHECK:
174
  case SQLCOM_HA_READ:
175
  case SQLCOM_SHOW_AUTHORS:
176 177
  case SQLCOM_SHOW_BINLOGS:
  case SQLCOM_SHOW_BINLOG_EVENTS:
178
  case SQLCOM_SHOW_RELAYLOG_EVENTS:
179 180
  case SQLCOM_SHOW_CHARSETS:
  case SQLCOM_SHOW_COLLATIONS:
181
  case SQLCOM_SHOW_CONTRIBUTORS:
182 183 184 185
  case SQLCOM_SHOW_CREATE:
  case SQLCOM_SHOW_CREATE_DB:
  case SQLCOM_SHOW_CREATE_FUNC:
  case SQLCOM_SHOW_CREATE_PROC:
186
  case SQLCOM_SHOW_CREATE_EVENT:
unknown's avatar
unknown committed
187
  case SQLCOM_SHOW_CREATE_TRIGGER:
188 189 190
  case SQLCOM_SHOW_DATABASES:
  case SQLCOM_SHOW_ERRORS:
  case SQLCOM_SHOW_FIELDS:
191
  case SQLCOM_SHOW_FUNC_CODE:
192
  case SQLCOM_SHOW_GRANTS:
193 194 195
  case SQLCOM_SHOW_ENGINE_STATUS:
  case SQLCOM_SHOW_ENGINE_LOGS:
  case SQLCOM_SHOW_ENGINE_MUTEX:
196
  case SQLCOM_SHOW_EVENTS:
197 198 199 200 201 202
  case SQLCOM_SHOW_KEYS:
  case SQLCOM_SHOW_MASTER_STAT:
  case SQLCOM_SHOW_NEW_MASTER:
  case SQLCOM_SHOW_OPEN_TABLES:
  case SQLCOM_SHOW_PRIVILEGES:
  case SQLCOM_SHOW_PROCESSLIST:
203
  case SQLCOM_SHOW_PROC_CODE:
204 205 206 207 208 209 210
  case SQLCOM_SHOW_SLAVE_HOSTS:
  case SQLCOM_SHOW_SLAVE_STAT:
  case SQLCOM_SHOW_STATUS:
  case SQLCOM_SHOW_STATUS_FUNC:
  case SQLCOM_SHOW_STATUS_PROC:
  case SQLCOM_SHOW_STORAGE_ENGINES:
  case SQLCOM_SHOW_TABLES:
211
  case SQLCOM_SHOW_TABLE_STATUS:
212 213
  case SQLCOM_SHOW_VARIABLES:
  case SQLCOM_SHOW_WARNS:
214
  case SQLCOM_REPAIR:
215 216 217 218 219 220 221 222 223 224 225 226 227 228 229
    flags= sp_head::MULTI_RESULTS;
    break;
  /*
    EXECUTE statement may return a result set, but doesn't have to.
    We can't, however, know it in advance, and therefore must add
    this statement here. This is ok, as is equivalent to a result-set
    statement within an IF condition.
  */
  case SQLCOM_EXECUTE:
    flags= sp_head::MULTI_RESULTS | sp_head::CONTAINS_DYNAMIC_SQL;
    break;
  case SQLCOM_PREPARE:
  case SQLCOM_DEALLOCATE_PREPARE:
    flags= sp_head::CONTAINS_DYNAMIC_SQL;
    break;
230 231 232 233 234 235 236 237 238 239 240 241
  case SQLCOM_CREATE_TABLE:
    if (lex->create_info.options & HA_LEX_CREATE_TMP_TABLE)
      flags= 0;
    else
      flags= sp_head::HAS_COMMIT_OR_ROLLBACK;
    break;
  case SQLCOM_DROP_TABLE:
    if (lex->drop_temporary)
      flags= 0;
    else
      flags= sp_head::HAS_COMMIT_OR_ROLLBACK;
    break;
242 243 244 245 246 247
  case SQLCOM_FLUSH:
    flags= sp_head::HAS_SQLCOM_FLUSH;
    break;
  case SQLCOM_RESET:
    flags= sp_head::HAS_SQLCOM_RESET;
    break;
248 249 250 251 252 253
  case SQLCOM_CREATE_INDEX:
  case SQLCOM_CREATE_DB:
  case SQLCOM_CREATE_VIEW:
  case SQLCOM_CREATE_TRIGGER:
  case SQLCOM_CREATE_USER:
  case SQLCOM_ALTER_TABLE:
254 255
  case SQLCOM_GRANT:
  case SQLCOM_REVOKE:
256 257 258 259 260
  case SQLCOM_BEGIN:
  case SQLCOM_RENAME_TABLE:
  case SQLCOM_RENAME_USER:
  case SQLCOM_DROP_INDEX:
  case SQLCOM_DROP_DB:
261
  case SQLCOM_REVOKE_ALL:
262 263 264 265 266 267
  case SQLCOM_DROP_USER:
  case SQLCOM_DROP_VIEW:
  case SQLCOM_DROP_TRIGGER:
  case SQLCOM_TRUNCATE:
  case SQLCOM_COMMIT:
  case SQLCOM_ROLLBACK:
268
  case SQLCOM_LOAD:
269 270 271 272 273 274 275
  case SQLCOM_LOCK_TABLES:
  case SQLCOM_CREATE_PROCEDURE:
  case SQLCOM_CREATE_SPFUNCTION:
  case SQLCOM_ALTER_PROCEDURE:
  case SQLCOM_ALTER_FUNCTION:
  case SQLCOM_DROP_PROCEDURE:
  case SQLCOM_DROP_FUNCTION:
276 277 278
  case SQLCOM_CREATE_EVENT:
  case SQLCOM_ALTER_EVENT:
  case SQLCOM_DROP_EVENT:
279 280
  case SQLCOM_INSTALL_PLUGIN:
  case SQLCOM_UNINSTALL_PLUGIN:
281 282
    flags= sp_head::HAS_COMMIT_OR_ROLLBACK;
    break;
283
  default:
284 285
    flags= 0;
    break;
286
  }
287
  return flags;
288 289
}

unknown's avatar
unknown committed
290
/**
291
  Prepare an Item for evaluation (call of fix_fields).
292

unknown's avatar
unknown committed
293 294
  @param thd       thread handler
  @param it_addr   pointer on item refernce
295

unknown's avatar
unknown committed
296 297 298 299
  @retval
    NULL      error
  @retval
    non-NULL  prepared item
300 301
*/

302
Item *
303 304 305
sp_prepare_func_item(THD* thd, Item **it_addr)
{
  DBUG_ENTER("sp_prepare_func_item");
306
  it_addr= (*it_addr)->this_item_addr(thd, it_addr);
307

308 309 310
  if (!(*it_addr)->fixed &&
      ((*it_addr)->fix_fields(thd, it_addr) ||
       (*it_addr)->check_cols(1)))
311 312 313 314 315 316 317 318
  {
    DBUG_PRINT("info", ("fix_fields() failed"));
    DBUG_RETURN(NULL);
  }
  DBUG_RETURN(*it_addr);
}


unknown's avatar
unknown committed
319
/**
320
  Evaluate an expression and store the result in the field.
321

unknown's avatar
unknown committed
322 323 324
  @param thd                    current thread object
  @param result_field           the field to store the result
  @param expr_item_ptr          the root item of the expression
325

unknown's avatar
unknown committed
326
  @retval
327
    FALSE  on success
unknown's avatar
unknown committed
328
  @retval
329
    TRUE   on error
330
*/
331

332
bool
333
sp_eval_expr(THD *thd, Field *result_field, Item **expr_item_ptr)
334
{
335
  Item *expr_item;
336 337 338 339
  enum_check_fields save_count_cuted_fields= thd->count_cuted_fields;
  bool save_abort_on_warning= thd->abort_on_warning;
  bool save_stmt_modified_non_trans_table= 
    thd->transaction.stmt.modified_non_trans_table;
340

341
  DBUG_ENTER("sp_eval_expr");
342

unknown's avatar
unknown committed
343
  if (!*expr_item_ptr)
344
    goto error;
unknown's avatar
unknown committed
345

346
  if (!(expr_item= sp_prepare_func_item(thd, expr_item_ptr)))
347
    goto error;
348

349 350 351
  /*
    Set THD flags to emit warnings/errors in case of overflow/type errors
    during saving the item into the field.
352

353 354 355 356 357 358 359
    Save original values and restore them after save.
  */
  
  thd->count_cuted_fields= CHECK_FIELD_ERROR_FOR_NULL;
  thd->abort_on_warning=
    thd->variables.sql_mode &
    (MODE_STRICT_TRANS_TABLES | MODE_STRICT_ALL_TABLES);
unknown's avatar
unknown committed
360
  thd->transaction.stmt.modified_non_trans_table= FALSE;
361

362
  /* Save the value in the field. Convert the value if needed. */
363

364
  expr_item->save_in_field(result_field, 0);
365

366 367
  thd->count_cuted_fields= save_count_cuted_fields;
  thd->abort_on_warning= save_abort_on_warning;
unknown's avatar
unknown committed
368
  thd->transaction.stmt.modified_non_trans_table= save_stmt_modified_non_trans_table;
369

370 371
  if (!thd->is_error())
    DBUG_RETURN(FALSE);
372

373 374 375 376 377 378 379 380 381
error:
  /*
    In case of error during evaluation, leave the result field set to NULL.
    Sic: we can't do it in the beginning of the function because the 
    result field might be needed for its own re-evaluation, e.g. case of 
    set x = x + 1;
  */
  result_field->set_null();
  DBUG_RETURN (TRUE);
382 383
}

384 385 386 387 388 389 390

/*
 *
 *  sp_name
 *
 */

391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413
sp_name::sp_name(THD *thd, char *key, uint key_len)
{
  m_sroutines_key.str= key;
  m_sroutines_key.length= key_len;
  m_qname.str= ++key;
  m_qname.length= key_len - 1;
  if ((m_name.str= strchr(m_qname.str, '.')))
  {
    m_db.length= m_name.str - key;
    m_db.str= strmake_root(thd->mem_root, key, m_db.length);
    m_name.str++;
    m_name.length= m_qname.length - m_db.length - 1;
  }
  else
  {
    m_name.str= m_qname.str;
    m_name.length= m_qname.length;
    m_db.str= 0;
    m_db.length= 0;
  }
  m_explicit_name= false;
}

414

unknown's avatar
unknown committed
415 416 417
/**
  Init the qualified name from the db and name.
*/
418 419 420
void
sp_name::init_qname(THD *thd)
{
421 422 423
  const uint dot= !!m_db.length;
  /* m_sroutines format: m_type + [database + dot] + name + nul */
  m_sroutines_key.length= 1 + m_db.length + dot + m_name.length;
424
  if (!(m_sroutines_key.str= (char*) thd->alloc(m_sroutines_key.length + 1)))
425 426 427
    return;
  m_qname.length= m_sroutines_key.length - 1;
  m_qname.str= m_sroutines_key.str + 1;
428 429 430 431
  sprintf(m_qname.str, "%.*s%.*s%.*s",
          (int) m_db.length, (m_db.length ? m_db.str : ""),
          dot, ".",
          (int) m_name.length, m_name.str);
432 433
}

434

unknown's avatar
unknown committed
435 436
/**
  Check that the name 'ident' is ok.  It's assumed to be an 'ident'
unknown's avatar
unknown committed
437 438 439 440
  from the parser, so we only have to check length and trailing spaces.
  The former is a standard requirement (and 'show status' assumes a
  non-empty name), the latter is a mysql:ism as trailing spaces are
  removed by get_field().
unknown's avatar
unknown committed
441 442 443 444 445

  @retval
    TRUE    bad name
  @retval
    FALSE   name is ok
unknown's avatar
unknown committed
446
*/
447 448

bool
449
check_routine_name(LEX_STRING *ident)
450
{
451 452
  if (!ident || !ident->str || !ident->str[0] ||
      ident->str[ident->length-1] == ' ')
unknown's avatar
unknown committed
453
  { 
454 455 456 457 458 459 460 461 462 463 464
    my_error(ER_SP_WRONG_NAME, MYF(0), ident->str);
    return TRUE;
  }
  if (check_string_char_length(ident, "", NAME_CHAR_LEN,
                               system_charset_info, 1))
  {
    my_error(ER_TOO_LONG_IDENT, MYF(0), ident->str);
    return TRUE;
  }

  return FALSE;
465
}
466

467 468 469 470 471 472 473

/*
 *
 *  sp_head
 *
 */

474
void *
475
sp_head::operator new(size_t size) throw()
476 477 478 479 480
{
  DBUG_ENTER("sp_head::operator new");
  MEM_ROOT own_root;
  sp_head *sp;

481
  init_sql_alloc(&own_root, MEM_ROOT_BLOCK_SIZE, MEM_ROOT_PREALLOC);
unknown's avatar
unknown committed
482
  sp= (sp_head *) alloc_root(&own_root, size);
483
  if (sp == NULL)
484
    DBUG_RETURN(NULL);
unknown's avatar
unknown committed
485
  sp->main_mem_root= own_root;
486
  DBUG_PRINT("info", ("mem_root 0x%lx", (ulong) &sp->mem_root));
487 488 489 490
  DBUG_RETURN(sp);
}

void 
unknown's avatar
unknown committed
491
sp_head::operator delete(void *ptr, size_t size) throw()
492 493 494
{
  DBUG_ENTER("sp_head::operator delete");
  MEM_ROOT own_root;
495 496 497 498

  if (ptr == NULL)
    DBUG_VOID_RETURN;

unknown's avatar
unknown committed
499
  sp_head *sp= (sp_head *) ptr;
500

unknown's avatar
unknown committed
501 502
  /* Make a copy of main_mem_root as free_root will free the sp */
  own_root= sp->main_mem_root;
503 504
  DBUG_PRINT("info", ("mem_root 0x%lx moved to 0x%lx",
                      (ulong) &sp->mem_root, (ulong) &own_root));
505 506 507 508 509
  free_root(&own_root, MYF(0));

  DBUG_VOID_RETURN;
}

510

511
sp_head::sp_head()
512
  :Query_arena(&main_mem_root, INITIALIZED_FOR_SP),
513
   m_flags(0), m_recursion_level(0), m_next_cached_sp(0),
514
   m_cont_level(0)
515
{
516
  const LEX_STRING str_reset= { NULL, 0 };
517 518 519 520 521

  m_first_instance= this;
  m_first_free_instance= this;
  m_last_cached_sp= this;

522
  m_return_field_def.charset = NULL;
523 524 525 526 527 528
  /*
    FIXME: the only use case when name is NULL is events, and it should
    be rewritten soon. Remove the else part and replace 'if' with
    an assert when this is done.
  */
  m_db= m_name= m_qname= str_reset;
529

530
  DBUG_ENTER("sp_head::sp_head");
531 532

  m_backpatch.empty();
533
  m_cont_backpatch.empty();
534
  m_lex.empty();
Konstantin Osipov's avatar
Konstantin Osipov committed
535 536 537
  my_hash_init(&m_sptabs, system_charset_info, 0, 0, 0, sp_table_key, 0, 0);
  my_hash_init(&m_sroutines, system_charset_info, 0, 0, 0, sp_sroutine_key,
               0, 0);
unknown's avatar
unknown committed
538 539 540 541

  m_body_utf8.str= NULL;
  m_body_utf8.length= 0;

542 543 544
  DBUG_VOID_RETURN;
}

545

546
void
547
sp_head::init(LEX *lex)
548 549
{
  DBUG_ENTER("sp_head::init");
550

551
  lex->spcont= m_pcont= new sp_pcontext();
552

553 554 555
  if (!lex->spcont)
    DBUG_VOID_RETURN;

556 557 558 559 560
  /*
    Altough trg_table_fields list is used only in triggers we init for all
    types of stored procedures to simplify reset_lex()/restore_lex() code.
  */
  lex->trg_table_fields.empty();
561
  my_init_dynamic_array(&m_instr, sizeof(sp_instr *), 16, 8);
562 563 564 565 566 567 568 569 570

  m_param_begin= NULL;
  m_param_end= NULL;

  m_body_begin= NULL ;

  m_qname.str= NULL;
  m_qname.length= 0;

571 572
  m_explicit_name= false;

573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590
  m_db.str= NULL;
  m_db.length= 0;

  m_name.str= NULL;
  m_name.length= 0;

  m_params.str= NULL;
  m_params.length= 0;

  m_body.str= NULL;
  m_body.length= 0;

  m_defstr.str= NULL;
  m_defstr.length= 0;

  m_sroutines_key.str= NULL;
  m_sroutines_key.length= 0;

591
  m_return_field_def.charset= NULL;
592

593 594 595
  DBUG_VOID_RETURN;
}

596

597
void
598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614
sp_head::init_sp_name(THD *thd, sp_name *spname)
{
  DBUG_ENTER("sp_head::init_sp_name");

  /* Must be initialized in the parser. */

  DBUG_ASSERT(spname && spname->m_db.str && spname->m_db.length);

  /* We have to copy strings to get them into the right memroot. */

  m_db.length= spname->m_db.length;
  m_db.str= strmake_root(thd->mem_root, spname->m_db.str, spname->m_db.length);

  m_name.length= spname->m_name.length;
  m_name.str= strmake_root(thd->mem_root, spname->m_name.str,
                           spname->m_name.length);

615 616
  m_explicit_name= spname->m_explicit_name;

617 618 619
  if (spname->m_qname.length == 0)
    spname->init_qname(thd);

620
  m_sroutines_key.length= spname->m_sroutines_key.length;
621 622 623
  m_sroutines_key.str= (char*) memdup_root(thd->mem_root,
                                           spname->m_sroutines_key.str,
                                           spname->m_sroutines_key.length + 1);
624 625 626 627
  m_sroutines_key.str[0]= static_cast<char>(m_type);

  m_qname.length= m_sroutines_key.length - 1;
  m_qname.str= m_sroutines_key.str + 1;
628 629

  DBUG_VOID_RETURN;
630 631 632
}


633
void
unknown's avatar
unknown committed
634
sp_head::set_body_start(THD *thd, const char *begin_ptr)
635
{
unknown's avatar
unknown committed
636
  m_body_begin= begin_ptr;
637
  thd->m_parser_state->m_lip.body_utf8_start(thd, begin_ptr);
unknown's avatar
unknown committed
638 639 640 641 642
}


void
sp_head::set_stmt_end(THD *thd)
643
{
644
  Lex_input_stream *lip= & thd->m_parser_state->m_lip; /* shortcut */
unknown's avatar
unknown committed
645 646 647
  const char *end_ptr= lip->get_cpp_ptr(); /* shortcut */

  /* Make the string of parameters. */
648

649
  if (m_param_begin && m_param_end)
650
  {
651
    m_params.length= m_param_end - m_param_begin;
unknown's avatar
unknown committed
652
    m_params.str= thd->strmake(m_param_begin, m_params.length);
653
  }
654

unknown's avatar
unknown committed
655
  /* Remember end pointer for further dumping of whole statement. */
656

unknown's avatar
unknown committed
657 658 659 660 661 662
  thd->lex->stmt_definition_end= end_ptr;

  /* Make the string of body (in the original character set). */

  m_body.length= end_ptr - m_body_begin;
  m_body.str= thd->strmake(m_body_begin, m_body.length);
663 664
  trim_whitespace(thd->charset(), & m_body);

unknown's avatar
unknown committed
665
  /* Make the string of UTF-body. */
666

unknown's avatar
unknown committed
667 668 669 670 671 672
  lip->body_utf8_append(end_ptr);

  m_body_utf8.length= lip->get_body_utf8_length();
  m_body_utf8.str= thd->strmake(lip->get_body_utf8_str(), m_body_utf8.length);
  trim_whitespace(thd->charset(), & m_body_utf8);

673
  /*
unknown's avatar
unknown committed
674 675
    Make the string of whole stored-program-definition query (in the
    original character set).
676 677
  */

unknown's avatar
unknown committed
678 679 680
  m_defstr.length= end_ptr - lip->get_cpp_buf();
  m_defstr.str= thd->strmake(lip->get_cpp_buf(), m_defstr.length);
  trim_whitespace(thd->charset(), & m_defstr);
681 682
}

683 684

static TYPELIB *
unknown's avatar
unknown committed
685
create_typelib(MEM_ROOT *mem_root, Create_field *field_def, List<String> *src)
unknown's avatar
unknown committed
686 687
{
  TYPELIB *result= NULL;
688 689
  CHARSET_INFO *cs= field_def->charset;
  DBUG_ENTER("create_typelib");
unknown's avatar
unknown committed
690

unknown's avatar
unknown committed
691 692 693 694 695 696
  if (src->elements)
  {
    result= (TYPELIB*) alloc_root(mem_root, sizeof(TYPELIB));
    result->count= src->elements;
    result->name= "";
    if (!(result->type_names=(const char **)
697
          alloc_root(mem_root,(sizeof(char *)+sizeof(int))*(result->count+1))))
unknown's avatar
unknown committed
698 699
      DBUG_RETURN(0);
    result->type_lengths= (uint*)(result->type_names + result->count+1);
unknown's avatar
unknown committed
700
    List_iterator<String> it(*src);
unknown's avatar
unknown committed
701 702
    String conv;
    for (uint i=0; i < result->count; i++)
703
    {
unknown's avatar
unknown committed
704 705 706 707
      uint32 dummy;
      uint length;
      String *tmp= it++;

708 709 710 711 712
      if (String::needs_conversion(tmp->length(), tmp->charset(),
      				   cs, &dummy))
      {
        uint cnv_errs;
        conv.copy(tmp->ptr(), tmp->length(), tmp->charset(), cs, &cnv_errs);
unknown's avatar
unknown committed
713 714 715 716

        length= conv.length();
        result->type_names[i]= (char*) strmake_root(mem_root, conv.ptr(),
                                                    length);
717
      }
unknown's avatar
unknown committed
718 719 720 721
      else
      {
        length= tmp->length();
        result->type_names[i]= strmake_root(mem_root, tmp->ptr(), length);
722
      }
723 724

      // Strip trailing spaces.
unknown's avatar
unknown committed
725 726 727
      length= cs->cset->lengthsp(cs, result->type_names[i], length);
      result->type_lengths[i]= length;
      ((uchar *)result->type_names[i])[length]= '\0';
728
    }
unknown's avatar
unknown committed
729
    result->type_names[result->count]= 0;
730
    result->type_lengths[result->count]= 0;
unknown's avatar
unknown committed
731
  }
unknown's avatar
unknown committed
732
  DBUG_RETURN(result);
unknown's avatar
unknown committed
733 734
}

735

736 737 738
int
sp_head::create(THD *thd)
{
739
  DBUG_ENTER("sp_head::create");
740 741
  DBUG_PRINT("info", ("type: %d name: %s params: %s body: %s",
		      m_type, m_name.str, m_params.str, m_body.str));
742

unknown's avatar
unknown committed
743
  DBUG_RETURN(sp_create_routine(thd, m_type, this));
744 745
}

746 747
sp_head::~sp_head()
{
unknown's avatar
unknown committed
748
  DBUG_ENTER("sp_head::~sp_head");
749
  destroy();
750
  delete m_next_cached_sp;
751 752
  if (m_thd)
    restore_thd_mem_root(m_thd);
unknown's avatar
unknown committed
753
  DBUG_VOID_RETURN;
754 755
}

756 757 758
void
sp_head::destroy()
{
759 760
  sp_instr *i;
  LEX *lex;
unknown's avatar
unknown committed
761 762
  DBUG_ENTER("sp_head::destroy");
  DBUG_PRINT("info", ("name: %s", m_name.str));
763 764 765

  for (uint ip = 0 ; (i = get_instr(ip)) ; ip++)
    delete i;
766 767
  delete_dynamic(&m_instr);
  m_pcont->destroy();
768
  free_items();
769 770 771 772 773 774 775 776 777 778

  /*
    If we have non-empty LEX stack then we just came out of parser with
    error. Now we should delete all auxilary LEXes and restore original
    THD::lex (In this case sp_head::restore_thd_mem_root() was not called
    too, so m_thd points to the current thread context).
    It is safe to not update LEX::ptr because further query string parsing
    and execution will be stopped anyway.
  */
  DBUG_ASSERT(m_lex.is_empty() || m_thd);
779 780
  while ((lex= (LEX *)m_lex.pop()))
  {
781
    lex_end(m_thd->lex);
782 783
    delete m_thd->lex;
    m_thd->lex= lex;
784
  }
785

Konstantin Osipov's avatar
Konstantin Osipov committed
786 787
  my_hash_free(&m_sptabs);
  my_hash_free(&m_sroutines);
788
  DBUG_VOID_RETURN;
789
}
790

unknown's avatar
unknown committed
791

unknown's avatar
unknown committed
792
/**
793 794 795 796
  This is only used for result fields from functions (both during
  fix_length_and_dec() and evaluation).
*/

unknown's avatar
unknown committed
797
Field *
798 799
sp_head::create_result_field(uint field_max_length, const char *field_name,
                             TABLE *table)
unknown's avatar
unknown committed
800
{
801
  uint field_length;
unknown's avatar
unknown committed
802
  Field *field;
803 804 805 806 807 808

  DBUG_ENTER("sp_head::create_result_field");

  field_length= !m_return_field_def.length ?
                field_max_length : m_return_field_def.length;

809
  field= ::make_field(table->s,                     /* TABLE_SHARE ptr */
810
                      (uchar*) 0,                   /* field ptr */
811 812 813 814 815 816 817 818 819
                      field_length,                 /* field [max] length */
                      (uchar*) "",                  /* null ptr */
                      0,                            /* null bit */
                      m_return_field_def.pack_flag,
                      m_return_field_def.sql_type,
                      m_return_field_def.charset,
                      m_return_field_def.geom_type,
                      Field::NONE,                  /* unreg check */
                      m_return_field_def.interval,
820
                      field_name ? field_name : (const char *) m_name.str);
unknown's avatar
unknown committed
821 822 823

  if (field)
    field->init(table);
824
  
unknown's avatar
unknown committed
825 826 827
  DBUG_RETURN(field);
}

828 829 830 831 832 833 834 835 836

int cmp_splocal_locations(Item_splocal * const *a, Item_splocal * const *b)
{
  return (int)((*a)->pos_in_query - (*b)->pos_in_query);
}


/*
  StoredRoutinesBinlogging
837 838 839
  This paragraph applies only to statement-based binlogging. Row-based
  binlogging does not need anything special like this.

840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870
  Top-down overview:

  1. Statements

  Statements that have is_update_query(stmt) == TRUE are written into the
  binary log verbatim.
  Examples:
    UPDATE tbl SET tbl.x = spfunc_w_side_effects()
    UPDATE tbl SET tbl.x=1 WHERE spfunc_w_side_effect_that_returns_false(tbl.y)

  Statements that have is_update_query(stmt) == FALSE (e.g. SELECTs) are not
  written into binary log. Instead we catch function calls the statement
  makes and write it into binary log separately (see #3).
  
  2. PROCEDURE calls

  CALL statements are not written into binary log. Instead
  * Any FUNCTION invocation (in SET, IF, WHILE, OPEN CURSOR and other SP
    instructions) is written into binlog separately.

  * Each statement executed in SP is binlogged separately, according to rules
    in #1, with the exception that we modify query string: we replace uses
    of SP local variables with NAME_CONST('spvar_name', <spvar-value>) calls.
    This substitution is done in subst_spvars().

  3. FUNCTION calls
  
  In sp_head::execute_function(), we check 
   * If this function invocation is done from a statement that is written
     into the binary log.
   * If there were any attempts to write events to the binary log during
871 872
     function execution (grep for start_union_events and stop_union_events)

873
   If the answers are No and Yes, we write the function call into the binary
874
   log as "SELECT spfunc(<param1value>, <param2value>, ...)"
875 876 877 878 879 880 881 882 883 884 885 886
  
  
  4. Miscellaneous issues.
  
  4.1 User variables. 

  When we call mysql_bin_log.write() for an SP statement, thd->user_var_events
  must hold set<{var_name, value}> pairs for all user variables used during 
  the statement execution.
  This set is produced by tracking user variable reads during statement
  execution. 

887
  For SPs, this has the following implications:
888 889 890 891 892 893 894 895 896 897 898 899
  1) thd->user_var_events may contain events from several SP statements and 
     needs to be valid after exection of these statements was finished. In 
     order to achieve that, we
     * Allocate user_var_events array elements on appropriate mem_root (grep
       for user_var_events_alloc).
     * Use is_query_in_union() to determine if user_var_event is created.
     
  2) We need to empty thd->user_var_events after we have wrote a function
     call. This is currently done by making 
     reset_dynamic(&thd->user_var_events);
     calls in several different places. (TODO cosider moving this into
     mysql_bin_log.write() function)
900 901 902 903 904 905 906 907

  4.2 Auto_increment storage in binlog

  As we may write two statements to binlog from one single logical statement
  (case of "SELECT func1(),func2()": it is binlogged as "SELECT func1()" and
  then "SELECT func2()"), we need to reset auto_increment binlog variables
  after each binlogged SELECT. Otherwise, the auto_increment value of the
  first SELECT would be used for the second too.
908 909 910
*/


unknown's avatar
unknown committed
911 912 913
/**
  Replace thd->query{_length} with a string that one can write to
  the binlog.
914 915

  The binlog-suitable string is produced by replacing references to SP local 
unknown's avatar
unknown committed
916 917 918 919 920 921 922 923 924 925 926 927
  variables with NAME_CONST('sp_var_name', value) calls.

  @param thd        Current thread.
  @param instr      Instruction (we look for Item_splocal instances in
                    instr->free_list)
  @param query_str  Original query string

  @return
    - FALSE  on success.
    thd->query{_length} either has been appropriately replaced or there
    is no need for replacements.
    - TRUE   out of memory error.
928 929
*/

930 931
static bool
subst_spvars(THD *thd, sp_instr *instr, LEX_STRING *query_str)
932 933 934
{
  DBUG_ENTER("subst_spvars");

935 936 937 938
  Dynamic_array<Item_splocal*> sp_vars_uses;
  char *pbuf, *cur, buffer[512];
  String qbuf(buffer, sizeof(buffer), &my_charset_bin);
  int prev_pos, res, buf_len;
939

940 941 942 943
  /* Find all instances of Item_splocal used in this statement */
  for (Item *item= instr->free_list; item; item= item->next)
  {
    if (item->is_splocal())
944
    {
945 946 947
      Item_splocal *item_spl= (Item_splocal*)item;
      if (item_spl->pos_in_query)
        sp_vars_uses.append(item_spl);
948
    }
949 950 951 952 953 954
  }
  if (!sp_vars_uses.elements())
    DBUG_RETURN(FALSE);
    
  /* Sort SP var refs by their occurences in the query */
  sp_vars_uses.sort(cmp_splocal_locations);
955

956 957 958 959 960 961 962
  /* 
    Construct a statement string where SP local var refs are replaced
    with "NAME_CONST(name, value)"
  */
  qbuf.length(0);
  cur= query_str->str;
  prev_pos= res= 0;
963 964
  thd->query_name_consts= 0;
  
965 966 967 968
  for (Item_splocal **splocal= sp_vars_uses.front(); 
       splocal < sp_vars_uses.back(); splocal++)
  {
    Item *val;
969

970 971 972 973 974 975 976
    char str_buffer[STRING_BUFFER_USUAL_SIZE];
    String str_value_holder(str_buffer, sizeof(str_buffer),
                            &my_charset_latin1);
    String *str_value;
    
    /* append the text between sp ref occurences */
    res|= qbuf.append(cur + prev_pos, (*splocal)->pos_in_query - prev_pos);
unknown's avatar
unknown committed
977
    prev_pos= (*splocal)->pos_in_query + (*splocal)->len_in_query;
978 979 980 981 982 983
    
    /* append the spvar substitute */
    res|= qbuf.append(STRING_WITH_LEN(" NAME_CONST('"));
    res|= qbuf.append((*splocal)->m_name.str, (*splocal)->m_name.length);
    res|= qbuf.append(STRING_WITH_LEN("',"));
    res|= (*splocal)->fix_fields(thd, (Item **) splocal);
984

985
    if (res)
986
      break;
987

988
    val= (*splocal)->this_item();
989
    DBUG_PRINT("info", ("print 0x%lx", (long) val));
990 991 992 993 994 995 996 997
    str_value= sp_get_item_value(thd, val, &str_value_holder);
    if (str_value)
      res|= qbuf.append(*str_value);
    else
      res|= qbuf.append(STRING_WITH_LEN("NULL"));
    res|= qbuf.append(')');
    if (res)
      break;
998 999
      
    thd->query_name_consts++;
1000 1001 1002 1003
  }
  res|= qbuf.append(cur + prev_pos, query_str->length - prev_pos);
  if (res)
    DBUG_RETURN(TRUE);
1004

1005 1006 1007 1008 1009
  /*
    Allocate additional space at the end of the new query string for the
    query_cache_send_result_to_client function.
  */
  buf_len= qbuf.length() + thd->db_length + 1 + QUERY_CACHE_FLAGS_SIZE + 1;
unknown's avatar
unknown committed
1010
  if ((pbuf= (char *) alloc_root(thd->mem_root, buf_len)))
1011 1012 1013
  {
    memcpy(pbuf, qbuf.ptr(), qbuf.length());
    pbuf[qbuf.length()]= 0;
1014
  }
1015 1016 1017
  else
    DBUG_RETURN(TRUE);

1018
  thd->set_query(pbuf, qbuf.length());
1019

1020
  DBUG_RETURN(FALSE);
1021 1022 1023
}


1024 1025 1026 1027 1028
/*
  Return appropriate error about recursion limit reaching

  SYNOPSIS
    sp_head::recursion_level_error()
unknown's avatar
unknown committed
1029
    thd		Thread handle
1030 1031 1032 1033 1034 1035

  NOTE
    For functions and triggers we return error about prohibited recursion.
    For stored procedures we return about reaching recursion limit.
*/

unknown's avatar
unknown committed
1036
void sp_head::recursion_level_error(THD *thd)
1037 1038 1039 1040 1041
{
  if (m_type == TYPE_ENUM_PROCEDURE)
  {
    my_error(ER_SP_RECURSION_LIMIT, MYF(0),
             thd->variables.max_sp_recursion_depth,
1042
             m_name.str);
1043 1044 1045 1046 1047 1048
  }
  else
    my_error(ER_SP_NO_RECURSION, MYF(0));
}


unknown's avatar
unknown committed
1049 1050
/**
  Execute the routine. The main instruction jump loop is there.
1051
  Assume the parameters already set.
unknown's avatar
unknown committed
1052 1053 1054 1055 1056
  @todo
    - Will write this SP statement into binlog separately 
    (TODO: consider changing the condition to "not inside event union")

  @retval
1057
    FALSE  on success
unknown's avatar
unknown committed
1058
  @retval
1059
    TRUE   on error
1060 1061
*/

1062 1063
bool
sp_head::execute(THD *thd)
1064
{
1065
  DBUG_ENTER("sp_head::execute");
1066 1067 1068 1069
  char saved_cur_db_name_buf[NAME_LEN+1];
  LEX_STRING saved_cur_db_name=
    { saved_cur_db_name_buf, sizeof(saved_cur_db_name_buf) };
  bool cur_db_changed= FALSE;
1070
  sp_rcontext *ctx;
1071
  bool err_status= FALSE;
1072
  uint ip= 0;
1073
  ulong save_sql_mode;
1074
  bool save_abort_on_warning;
unknown's avatar
unknown committed
1075
  Query_arena *old_arena;
1076 1077 1078
  /* per-instruction arena */
  MEM_ROOT execute_mem_root;
  Query_arena execute_arena(&execute_mem_root, INITIALIZED_FOR_SP),
unknown's avatar
unknown committed
1079
              backup_arena;
1080
  query_id_t old_query_id;
1081 1082 1083 1084
  TABLE *old_derived_tables;
  LEX *old_lex;
  Item_change_list old_change_list;
  String old_packet;
1085
  Reprepare_observer *save_reprepare_observer= thd->m_reprepare_observer;
unknown's avatar
unknown committed
1086
  Object_creation_ctx *saved_creation_ctx;
Marc Alff's avatar
Marc Alff committed
1087
  Warning_info *saved_warning_info, warning_info(thd->warning_info->warn_id());
unknown's avatar
unknown committed
1088

1089
  /* Use some extra margin for possible SP recursion and functions */
1090
  if (check_stack_overrun(thd, 8 * STACK_MIN_SIZE, (uchar*)&old_packet))
1091
    DBUG_RETURN(TRUE);
1092

1093
  /* init per-instruction memroot */
1094
  init_sql_alloc(&execute_mem_root, MEM_ROOT_BLOCK_SIZE, 0);
1095 1096

  DBUG_ASSERT(!(m_flags & IS_INVOKED));
1097
  m_flags|= IS_INVOKED;
1098
  m_first_instance->m_first_free_instance= m_next_cached_sp;
unknown's avatar
unknown committed
1099 1100 1101 1102 1103 1104 1105 1106 1107
  if (m_next_cached_sp)
  {
    DBUG_PRINT("info",
               ("first free for 0x%lx ++: 0x%lx->0x%lx  level: %lu  flags %x",
                (ulong)m_first_instance, (ulong) this,
                (ulong) m_next_cached_sp,
                m_next_cached_sp->m_recursion_level,
                m_next_cached_sp->m_flags));
  }
1108 1109 1110 1111 1112 1113 1114 1115 1116
  /*
    Check that if there are not any instances after this one then
    pointer to the last instance points on this instance or if there are
    some instances after this one then recursion level of next instance
    greater then recursion level of current instance on 1
  */
  DBUG_ASSERT((m_next_cached_sp == 0 &&
               m_first_instance->m_last_cached_sp == this) ||
              (m_recursion_level + 1 == m_next_cached_sp->m_recursion_level));
1117

unknown's avatar
unknown committed
1118 1119 1120 1121 1122 1123
  /*
    NOTE: The SQL Standard does not specify the context that should be
    preserved for stored routines. However, at SAP/Walldorf meeting it was
    decided that current database should be preserved.
  */

1124
  if (m_db.length &&
1125 1126 1127
      (err_status= mysql_opt_change_db(thd, &m_db, &saved_cur_db_name, FALSE,
                                       &cur_db_changed)))
  {
1128
    goto done;
1129
  }
1130

1131
  if ((ctx= thd->spcont))
1132
    ctx->clear_handler();
1133
  thd->is_slave_error= 0;
unknown's avatar
unknown committed
1134
  old_arena= thd->stmt_arena;
1135

Marc Alff's avatar
Marc Alff committed
1136 1137 1138 1139 1140
  /* Push a new warning information area. */
  warning_info.append_warning_info(thd, thd->warning_info);
  saved_warning_info= thd->warning_info;
  thd->warning_info= &warning_info;

1141 1142 1143 1144 1145 1146
  /*
    Switch query context. This has to be done early as this is sometimes
    allocated trough sql_alloc
  */
  saved_creation_ctx= m_creation_ctx->set_n_backup(thd);

1147 1148 1149 1150 1151 1152 1153
  /*
    We have to save/restore this info when we are changing call level to
    be able properly do close_thread_tables() in instructions.
  */
  old_query_id= thd->query_id;
  old_derived_tables= thd->derived_tables;
  thd->derived_tables= 0;
1154 1155
  save_sql_mode= thd->variables.sql_mode;
  thd->variables.sql_mode= m_sql_mode;
1156
  save_abort_on_warning= thd->abort_on_warning;
1157
  thd->abort_on_warning= 0;
1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175
  /**
    When inside a substatement (a stored function or trigger
    statement), clear the metadata observer in THD, if any.
    Remember the value of the observer here, to be able
    to restore it when leaving the substatement.

    We reset the observer to suppress errors when a substatement
    uses temporary tables. If a temporary table does not exist
    at start of the main statement, it's not prelocked
    and thus is not validated with other prelocked tables.

    Later on, when the temporary table is opened, metadata
    versions mismatch, expectedly.

    The proper solution for the problem is to re-validate tables
    of substatements (Bug#12257, Bug#27011, Bug#32868, Bug#33000),
    but it's not implemented yet.
  */
1176
  thd->m_reprepare_observer= 0;
1177

1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198
  /*
    It is also more efficient to save/restore current thd->lex once when
    do it in each instruction
  */
  old_lex= thd->lex;
  /*
    We should also save Item tree change list to avoid rollback something
    too early in the calling query.
  */
  old_change_list= thd->change_list;
  thd->change_list.empty();
  /*
    Cursors will use thd->packet, so they may corrupt data which was prepared
    for sending by upper level. OTOH cursors in the same routine can share this
    buffer safely so let use use routine-local packet instead of having own
    packet buffer for each cursor.

    It is probably safe to use same thd->convert_buff everywhere.
  */
  old_packet.swap(thd->packet);

1199 1200 1201 1202
  /*
    Switch to per-instruction arena here. We can do it since we cleanup
    arena after every instruction.
  */
unknown's avatar
unknown committed
1203
  thd->set_n_backup_active_arena(&execute_arena, &backup_arena);
1204 1205 1206 1207 1208

  /*
    Save callers arena in order to store instruction results and out
    parameters in it later during sp_eval_func_item()
  */
unknown's avatar
unknown committed
1209
  thd->spcont->callers_arena= &backup_arena;
1210

1211
#if defined(ENABLED_PROFILING)
1212 1213 1214
  /* Discard the initial part of executing routines. */
  thd->profiling.discard_current_query();
#endif
1215 1216 1217
  do
  {
    sp_instr *i;
1218
    uint hip;			// Handler ip
1219

1220
#if defined(ENABLED_PROFILING)
1221 1222 1223 1224 1225 1226 1227 1228 1229
    /* 
     Treat each "instr" of a routine as discrete unit that could be profiled.
     Profiling only records information for segments of code that set the
     source of the query, and almost all kinds of instructions in s-p do not.
    */
    thd->profiling.finish_current_query();
    thd->profiling.start_new_query("continuing inside routine");
#endif

1230 1231
    i = get_instr(ip);	// Returns NULL when we're done.
    if (i == NULL)
1232
    {
1233
#if defined(ENABLED_PROFILING)
1234 1235
      thd->profiling.discard_current_query();
#endif
1236
      break;
1237 1238
    }

1239
    DBUG_PRINT("execute", ("Instruction %u", ip));
1240

1241 1242 1243
    /* Don't change NOW() in FUNCTION or TRIGGER */
    if (!thd->in_sub_stmt)
      thd->set_time();		// Make current_time() et al work
1244
    
1245
    /*
unknown's avatar
unknown committed
1246
      We have to set thd->stmt_arena before executing the instruction
1247 1248 1249 1250
      to store in the instruction free_list all new items, created
      during the first execution (for example expanding of '*' or the
      items made during other permanent subquery transformations).
    */
unknown's avatar
unknown committed
1251
    thd->stmt_arena= i;
1252
    
1253 1254 1255 1256 1257
    /* 
      Will write this SP statement into binlog separately 
      (TODO: consider changing the condition to "not inside event union")
    */
    if (thd->prelocked_mode == NON_PRELOCKED)
1258
      thd->user_var_events_alloc= thd->mem_root;
1259

1260
    err_status= i->execute(thd, &ip);
1261

1262 1263
    if (i->free_list)
      cleanup_items(i->free_list);
1264 1265 1266 1267 1268 1269 1270 1271 1272 1273
    
    /* 
      If we've set thd->user_var_events_alloc to mem_root of this SP
      statement, clean all the events allocated in it.
    */
    if (thd->prelocked_mode == NON_PRELOCKED)
    {
      reset_dynamic(&thd->user_var_events);
      thd->user_var_events_alloc= NULL;//DEBUG
    }
1274

1275
    /* we should cleanup free_list and memroot, used by instruction */
1276
    thd->cleanup_after_query();
1277
    free_root(&execute_mem_root, MYF(0));    
1278

unknown's avatar
unknown committed
1279 1280
    /*
      Check if an exception has occurred and a handler has been found
1281 1282 1283 1284
      Note: We have to check even if err_status == FALSE, since warnings (and
      some errors) don't return a non-zero value. We also have to check even
      if thd->killed != 0, since some errors return with this even when a
      handler has been found (e.g. "bad data").
unknown's avatar
unknown committed
1285
    */
1286
    if (ctx)
1287
    {
Marc Alff's avatar
Marc Alff committed
1288
      uint handler_index;
1289

Marc Alff's avatar
Marc Alff committed
1290
      switch (ctx->found_handler(& hip, & handler_index)) {
1291 1292 1293
      case SP_HANDLER_NONE:
	break;
      case SP_HANDLER_CONTINUE:
unknown's avatar
unknown committed
1294 1295
        thd->restore_active_arena(&execute_arena, &backup_arena);
        thd->set_n_backup_active_arena(&execute_arena, &backup_arena);
1296
        ctx->push_hstack(i->get_cont_dest());
Marc Alff's avatar
Marc Alff committed
1297
        /* Fall through */
1298
      default:
Marc Alff's avatar
Marc Alff committed
1299 1300
        if (ctx->end_partial_result_set)
          thd->protocol->end_partial_result_set(thd);
1301
	ip= hip;
1302
	err_status= FALSE;
1303
	ctx->clear_handler();
Marc Alff's avatar
Marc Alff committed
1304
	ctx->enter_handler(hip, handler_index);
unknown's avatar
unknown committed
1305
        thd->clear_error();
1306
        thd->is_fatal_error= 0;
1307
	thd->killed= THD::NOT_KILLED;
1308
        thd->mysys_var->abort= 0;
1309 1310
	continue;
      }
Marc Alff's avatar
Marc Alff committed
1311 1312

      ctx->end_partial_result_set= FALSE;
1313
    }
Marc Alff's avatar
Marc Alff committed
1314
  } while (!err_status && !thd->killed && !thd->is_fatal_error);
1315

1316
#if defined(ENABLED_PROFILING)
1317 1318 1319 1320
  thd->profiling.finish_current_query();
  thd->profiling.start_new_query("tail end of routine");
#endif

unknown's avatar
unknown committed
1321 1322 1323 1324 1325 1326
  /* Restore query context. */

  m_creation_ctx->restore_env(thd, saved_creation_ctx);

  /* Restore arena. */

unknown's avatar
unknown committed
1327
  thd->restore_active_arena(&execute_arena, &backup_arena);
1328

1329
  thd->spcont->pop_all_cursors(); // To avoid memory leaks after an error
1330

1331 1332 1333 1334 1335 1336 1337 1338 1339 1340
  /* Restore all saved */
  old_packet.swap(thd->packet);
  DBUG_ASSERT(thd->change_list.is_empty());
  thd->change_list= old_change_list;
  /* To avoid wiping out thd->change_list on old_change_list destruction */
  old_change_list.empty();
  thd->lex= old_lex;
  thd->query_id= old_query_id;
  DBUG_ASSERT(!thd->derived_tables);
  thd->derived_tables= old_derived_tables;
1341
  thd->variables.sql_mode= save_sql_mode;
1342
  thd->abort_on_warning= save_abort_on_warning;
1343
  thd->m_reprepare_observer= save_reprepare_observer;
1344

unknown's avatar
unknown committed
1345
  thd->stmt_arena= old_arena;
1346
  state= EXECUTED;
1347

Marc Alff's avatar
Marc Alff committed
1348 1349 1350 1351
  /* Restore the caller's original warning information area. */
  saved_warning_info->merge_with_routine_info(thd, thd->warning_info);
  thd->warning_info= saved_warning_info;

1352
 done:
1353 1354
  DBUG_PRINT("info", ("err_status: %d  killed: %d  is_slave_error: %d  report_error: %d",
		      err_status, thd->killed, thd->is_slave_error,
1355
                      thd->is_error()));
1356

unknown's avatar
unknown committed
1357
  if (thd->killed)
1358
    err_status= TRUE;
1359 1360 1361 1362
  /*
    If the DB has changed, the pointer has changed too, but the
    original thd->db will then have been freed
  */
1363
  if (cur_db_changed && !thd->killed)
1364
  {
1365
    /*
1366 1367
      Force switching back to the saved current database, because it may be
      NULL. In this case, mysql_change_db() would generate an error.
1368
    */
1369 1370

    err_status|= mysql_change_db(thd, &saved_cur_db_name, TRUE);
1371
  }
1372
  m_flags&= ~IS_INVOKED;
1373 1374 1375 1376 1377
  DBUG_PRINT("info",
             ("first free for 0x%lx --: 0x%lx->0x%lx, level: %lu, flags %x",
              (ulong) m_first_instance,
              (ulong) m_first_instance->m_first_free_instance,
              (ulong) this, m_recursion_level, m_flags));
1378 1379 1380 1381 1382 1383 1384 1385 1386
  /*
    Check that we have one of following:

    1) there are not free instances which means that this instance is last
    in the list of instances (pointer to the last instance point on it and
    ther are not other instances after this one in the list)

    2) There are some free instances which mean that first free instance
    should go just after this one and recursion level of that free instance
unknown's avatar
unknown committed
1387
    should be on 1 more then recursion level of this instance.
1388 1389 1390 1391 1392 1393 1394 1395 1396
  */
  DBUG_ASSERT((m_first_instance->m_first_free_instance == 0 &&
               this == m_first_instance->m_last_cached_sp &&
               m_next_cached_sp == 0) ||
              (m_first_instance->m_first_free_instance != 0 &&
               m_first_instance->m_first_free_instance == m_next_cached_sp &&
               m_first_instance->m_first_free_instance->m_recursion_level ==
               m_recursion_level + 1));
  m_first_instance->m_first_free_instance= this;
1397 1398 1399 1400 1401 1402

  DBUG_RETURN(err_status);
}


#ifndef NO_EMBEDDED_ACCESS_CHECKS
unknown's avatar
unknown committed
1403
/**
1404 1405 1406 1407 1408
  set_routine_security_ctx() changes routine security context, and
  checks if there is an EXECUTE privilege in new context.  If there is
  no EXECUTE privilege, it changes the context back and returns a
  error.

unknown's avatar
unknown committed
1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422
  @param thd         thread handle
  @param sp          stored routine to change the context for
  @param is_proc     TRUE is procedure, FALSE if function
  @param save_ctx    pointer to an old security context

  @todo
    - Cache if the definer has the right to use the object on the
    first usage and only reset the cache if someone does a GRANT
    statement that 'may' affect this.

  @retval
    TRUE   if there was a error, and the context wasn't changed.
  @retval
    FALSE  if the context was changed.
1423 1424 1425 1426 1427 1428 1429
*/

bool
set_routine_security_ctx(THD *thd, sp_head *sp, bool is_proc,
                         Security_context **save_ctx)
{
  *save_ctx= 0;
1430 1431 1432 1433 1434
  if (sp->m_chistics->suid != SP_IS_NOT_SUID &&
      sp->m_security_ctx.change_security_context(thd, &sp->m_definer_user,
                                                 &sp->m_definer_host,
                                                 &sp->m_db,
                                                 save_ctx))
1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450
    return TRUE;

  /*
    If we changed context to run as another user, we need to check the
    access right for the new context again as someone may have revoked
    the right to use the procedure from this user.

    TODO:
      Cache if the definer has the right to use the object on the
      first usage and only reset the cache if someone does a GRANT
      statement that 'may' affect this.
  */
  if (*save_ctx &&
      check_routine_access(thd, EXECUTE_ACL,
                           sp->m_db.str, sp->m_name.str, is_proc, FALSE))
  {
1451
    sp->m_security_ctx.restore_security_context(thd, *save_ctx);
1452 1453 1454 1455 1456 1457 1458 1459 1460
    *save_ctx= 0;
    return TRUE;
  }

  return FALSE;
}
#endif // ! NO_EMBEDDED_ACCESS_CHECKS


1461 1462
/**
  Execute trigger stored program.
1463

unknown's avatar
unknown committed
1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479
  - changes security context for triggers
  - switch to new memroot
  - call sp_head::execute
  - restore old memroot
  - restores security context

  @param thd               Thread handle
  @param db                database name
  @param table             table name
  @param grant_info        GRANT_INFO structure to be filled with
                           information about definer's privileges
                           on subject table

  @todo
    - TODO: we should create sp_rcontext once per command and reuse it
    on subsequent executions of a trigger.
1480

unknown's avatar
unknown committed
1481 1482 1483 1484
  @retval
    FALSE  on success
  @retval
    TRUE   on error
1485 1486 1487
*/

bool
1488 1489 1490
sp_head::execute_trigger(THD *thd,
                         const LEX_STRING *db_name,
                         const LEX_STRING *table_name,
1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502
                         GRANT_INFO *grant_info)
{
  sp_rcontext *octx = thd->spcont;
  sp_rcontext *nctx = NULL;
  bool err_status= FALSE;
  MEM_ROOT call_mem_root;
  Query_arena call_arena(&call_mem_root, Query_arena::INITIALIZED_FOR_SP);
  Query_arena backup_arena;

  DBUG_ENTER("sp_head::execute_trigger");
  DBUG_PRINT("info", ("trigger %s", m_name.str));

1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542
#ifndef NO_EMBEDDED_ACCESS_CHECKS
  Security_context *save_ctx= NULL;


  if (m_chistics->suid != SP_IS_NOT_SUID &&
      m_security_ctx.change_security_context(thd,
                                             &m_definer_user,
                                             &m_definer_host,
                                             &m_db,
                                             &save_ctx))
    DBUG_RETURN(TRUE);

  /*
    Fetch information about table-level privileges for subject table into
    GRANT_INFO instance. The access check itself will happen in
    Item_trigger_field, where this information will be used along with
    information about column-level privileges.
  */

  fill_effective_table_privileges(thd,
                                  grant_info,
                                  db_name->str,
                                  table_name->str);

  /* Check that the definer has TRIGGER privilege on the subject table. */

  if (!(grant_info->privilege & TRIGGER_ACL))
  {
    char priv_desc[128];
    get_privilege_desc(priv_desc, sizeof(priv_desc), TRIGGER_ACL);

    my_error(ER_TABLEACCESS_DENIED_ERROR, MYF(0), priv_desc,
             thd->security_ctx->priv_user, thd->security_ctx->host_or_ip,
             table_name->str);

    m_security_ctx.restore_security_context(thd, save_ctx);
    DBUG_RETURN(TRUE);
  }
#endif // NO_EMBEDDED_ACCESS_CHECKS

1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574
  /*
    Prepare arena and memroot for objects which lifetime is whole
    duration of trigger call (sp_rcontext, it's tables and items,
    sp_cursor and Item_cache holders for case expressions).  We can't
    use caller's arena/memroot for those objects because in this case
    some fixed amount of memory will be consumed for each trigger
    invocation and so statements which involve lot of them will hog
    memory.

    TODO: we should create sp_rcontext once per command and reuse it
    on subsequent executions of a trigger.
  */
  init_sql_alloc(&call_mem_root, MEM_ROOT_BLOCK_SIZE, 0);
  thd->set_n_backup_active_arena(&call_arena, &backup_arena);

  if (!(nctx= new sp_rcontext(m_pcont, 0, octx)) ||
      nctx->init(thd))
  {
    err_status= TRUE;
    goto err_with_cleanup;
  }

#ifndef DBUG_OFF
  nctx->sp= this;
#endif

  thd->spcont= nctx;

  err_status= execute(thd);

err_with_cleanup:
  thd->restore_active_arena(&call_arena, &backup_arena);
1575 1576 1577 1578 1579

#ifndef NO_EMBEDDED_ACCESS_CHECKS
  m_security_ctx.restore_security_context(thd, save_ctx);
#endif // NO_EMBEDDED_ACCESS_CHECKS

1580 1581 1582 1583 1584
  delete nctx;
  call_arena.free_items();
  free_root(&call_mem_root, MYF(0));
  thd->spcont= octx;

1585 1586 1587
  if (thd->killed)
    thd->send_kill_message();

1588
  DBUG_RETURN(err_status);
1589 1590 1591
}


unknown's avatar
unknown committed
1592 1593 1594
/**
  Execute a function.

1595
   - evaluate parameters
1596 1597
   - changes security context for SUID routines
   - switch to new memroot
1598
   - call sp_head::execute
1599
   - restore old memroot
1600
   - evaluate the return value
1601
   - restores security context
1602

unknown's avatar
unknown committed
1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619
  @param thd               Thread handle
  @param argp              Passed arguments (these are items from containing
                           statement?)
  @param argcount          Number of passed arguments. We need to check if
                           this is correct.
  @param return_value_fld  Save result here.

  @todo
    We should create sp_rcontext once per command and reuse
    it on subsequent executions of a function/trigger.

  @todo
    In future we should associate call arena/mem_root with
    sp_rcontext and allocate all these objects (and sp_rcontext
    itself) on it directly rather than juggle with arenas.

  @retval
1620
    FALSE  on success
unknown's avatar
unknown committed
1621
  @retval
1622
    TRUE   on error
1623 1624
*/

1625 1626 1627
bool
sp_head::execute_function(THD *thd, Item **argp, uint argcount,
                          Field *return_value_fld)
1628
{
1629 1630
  ulonglong binlog_save_options;
  bool need_binlog_call;
1631
  uint arg_no;
1632 1633
  sp_rcontext *octx = thd->spcont;
  sp_rcontext *nctx = NULL;
1634 1635
  char buf[STRING_BUFFER_USUAL_SIZE];
  String binlog_buf(buf, sizeof(buf), &my_charset_bin);
1636
  bool err_status= FALSE;
1637 1638 1639
  MEM_ROOT call_mem_root;
  Query_arena call_arena(&call_mem_root, Query_arena::INITIALIZED_FOR_SP);
  Query_arena backup_arena;
1640 1641 1642
  DBUG_ENTER("sp_head::execute_function");
  DBUG_PRINT("info", ("function %s", m_name.str));

1643
  LINT_INIT(binlog_save_options);
1644 1645 1646 1647 1648 1649 1650

  /*
    Check that the function is called with all specified arguments.

    If it is not, use my_error() to report an error, or it will not terminate
    the invoking query properly.
  */
1651
  if (argcount != m_pcont->context_var_count())
unknown's avatar
unknown committed
1652
  {
unknown's avatar
unknown committed
1653
    /*
1654
      Need to use my_error here, or it will not terminate the
unknown's avatar
unknown committed
1655 1656
      invoking query properly.
    */
1657
    my_error(ER_SP_WRONG_NO_OF_ARGS, MYF(0),
1658
             "FUNCTION", m_qname.str, m_pcont->context_var_count(), argcount);
1659
    DBUG_RETURN(TRUE);
unknown's avatar
unknown committed
1660
  }
1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673
  /*
    Prepare arena and memroot for objects which lifetime is whole
    duration of function call (sp_rcontext, it's tables and items,
    sp_cursor and Item_cache holders for case expressions).
    We can't use caller's arena/memroot for those objects because
    in this case some fixed amount of memory will be consumed for
    each function/trigger invocation and so statements which involve
    lot of them will hog memory.
    TODO: we should create sp_rcontext once per command and reuse
    it on subsequent executions of a function/trigger.
  */
  init_sql_alloc(&call_mem_root, MEM_ROOT_BLOCK_SIZE, 0);
  thd->set_n_backup_active_arena(&call_arena, &backup_arena);
1674 1675 1676 1677

  if (!(nctx= new sp_rcontext(m_pcont, return_value_fld, octx)) ||
      nctx->init(thd))
  {
1678 1679 1680
    thd->restore_active_arena(&call_arena, &backup_arena);
    err_status= TRUE;
    goto err_with_cleanup;
1681 1682
  }

1683 1684 1685 1686 1687 1688 1689 1690
  /*
    We have to switch temporarily back to callers arena/memroot.
    Function arguments belong to the caller and so the may reference
    memory which they will allocate during calculation long after
    this function call will be finished (e.g. in Item::cleanup()).
  */
  thd->restore_active_arena(&call_arena, &backup_arena);

1691
#ifndef DBUG_OFF
1692
  nctx->sp= this;
1693
#endif
1694 1695

  /* Pass arguments. */
1696
  for (arg_no= 0; arg_no < argcount; arg_no++)
1697
  {
1698 1699
    /* Arguments must be fixed in Item_func_sp::fix_fields */
    DBUG_ASSERT(argp[arg_no]->fixed);
1700

1701
    if ((err_status= nctx->set_variable(thd, arg_no, &(argp[arg_no]))))
1702
      goto err_with_cleanup;
1703
  }
1704

1705 1706 1707 1708 1709
  /*
    If row-based binlogging, we don't need to binlog the function's call, let
    each substatement be binlogged its way.
  */
  need_binlog_call= mysql_bin_log.is_open() &&
1710
    (thd->options & OPTION_BIN_LOG) && !thd->current_stmt_binlog_row_based;
1711

1712 1713 1714 1715 1716
  /*
    Remember the original arguments for unrolled replication of functions
    before they are changed by execution.
  */
  if (need_binlog_call)
1717
  {
1718 1719
    binlog_buf.length(0);
    binlog_buf.append(STRING_WITH_LEN("SELECT "));
1720 1721
    append_identifier(thd, &binlog_buf, m_db.str, m_db.length);
    binlog_buf.append('.');
1722 1723 1724
    append_identifier(thd, &binlog_buf, m_name.str, m_name.length);
    binlog_buf.append('(');
    for (arg_no= 0; arg_no < argcount; arg_no++)
1725
    {
1726 1727
      String str_value_holder;
      String *str_value;
1728

1729 1730
      if (arg_no)
        binlog_buf.append(',');
1731

1732
      str_value= sp_get_item_value(thd, nctx->get_item(arg_no),
1733
                                   &str_value_holder);
1734

1735 1736 1737 1738 1739 1740
      if (str_value)
        binlog_buf.append(*str_value);
      else
        binlog_buf.append(STRING_WITH_LEN("NULL"));
    }
    binlog_buf.append(')');
1741
  }
1742 1743
  thd->spcont= nctx;

1744 1745 1746 1747 1748 1749 1750 1751 1752
#ifndef NO_EMBEDDED_ACCESS_CHECKS
  Security_context *save_security_ctx;
  if (set_routine_security_ctx(thd, this, FALSE, &save_security_ctx))
  {
    err_status= TRUE;
    goto err_with_cleanup;
  }
#endif

1753
  if (need_binlog_call)
1754
  {
1755
    query_id_t q;
1756
    reset_dynamic(&thd->user_var_events);
1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768
    /*
      In case of artificially constructed events for function calls
      we have separate union for each such event and hence can't use
      query_id of real calling statement as the start of all these
      unions (this will break logic of replication of user-defined
      variables). So we use artifical value which is guaranteed to
      be greater than all query_id's of all statements belonging
      to previous events/unions.
      Possible alternative to this is logging of all function invocations
      as one select and not resetting THD::user_var_events before
      each invocation.
    */
Konstantin Osipov's avatar
Konstantin Osipov committed
1769
    pthread_mutex_lock(&LOCK_thread_count);
1770
    q= global_query_id;
Konstantin Osipov's avatar
Konstantin Osipov committed
1771
    pthread_mutex_unlock(&LOCK_thread_count);
1772
    mysql_bin_log.start_union_events(thd, q + 1);
1773 1774
    binlog_save_options= thd->options;
    thd->options&= ~OPTION_BIN_LOG;
1775
  }
1776

1777 1778 1779 1780 1781 1782 1783 1784 1785 1786
  /*
    Switch to call arena/mem_root so objects like sp_cursor or
    Item_cache holders for case expressions can be allocated on it.

    TODO: In future we should associate call arena/mem_root with
          sp_rcontext and allocate all these objects (and sp_rcontext
          itself) on it directly rather than juggle with arenas.
  */
  thd->set_n_backup_active_arena(&call_arena, &backup_arena);

1787
  err_status= execute(thd);
1788

1789 1790
  thd->restore_active_arena(&call_arena, &backup_arena);

1791
  if (need_binlog_call)
1792
  {
1793 1794 1795
    mysql_bin_log.stop_union_events(thd);
    thd->options= binlog_save_options;
    if (thd->binlog_evt_union.unioned_events)
1796
    {
1797
      int errcode = query_error_code(thd, thd->killed == THD::NOT_KILLED);
1798
      Query_log_event qinfo(thd, binlog_buf.ptr(), binlog_buf.length(),
1799
                            thd->binlog_evt_union.unioned_events_trans, FALSE, errcode);
1800 1801 1802 1803 1804 1805 1806 1807
      if (mysql_bin_log.write(&qinfo) &&
          thd->binlog_evt_union.unioned_events_trans)
      {
        push_warning(thd, MYSQL_ERROR::WARN_LEVEL_WARN, ER_UNKNOWN_ERROR,
                     "Invoked ROUTINE modified a transactional table but MySQL "
                     "failed to reflect this change in the binary log");
      }
      reset_dynamic(&thd->user_var_events);
1808 1809 1810
      /* Forget those values, in case more function calls are binlogged: */
      thd->stmt_depends_on_first_successful_insert_id_in_prev_stmt= 0;
      thd->auto_inc_intervals_in_cur_stmt_for_binlog.empty();
1811 1812
    }
  }
1813

1814
  if (!err_status)
1815
  {
1816
    /* We need result only in function but not in trigger */
1817

1818
    if (!nctx->is_return_value_set())
1819
    {
1820
      my_error(ER_SP_NORETURNEND, MYF(0), m_name.str);
1821
      err_status= TRUE;
1822 1823
    }
  }
1824

1825
#ifndef NO_EMBEDDED_ACCESS_CHECKS
1826
  m_security_ctx.restore_security_context(thd, save_security_ctx);
1827
#endif
1828 1829

err_with_cleanup:
1830
  delete nctx;
1831 1832
  call_arena.free_items();
  free_root(&call_mem_root, MYF(0));
1833
  thd->spcont= octx;
1834

1835
  DBUG_RETURN(err_status);
1836 1837
}

1838

unknown's avatar
unknown committed
1839
/**
1840 1841 1842 1843
  Execute a procedure. 

  The function does the following steps:
   - Set all parameters 
1844
   - changes security context for SUID routines
1845 1846
   - call sp_head::execute
   - copy back values of INOUT and OUT parameters
1847
   - restores security context
1848

unknown's avatar
unknown committed
1849 1850 1851 1852
  @param thd    Thread handle
  @param args   List of values passed as arguments.

  @retval
1853
    FALSE  on success
unknown's avatar
unknown committed
1854
  @retval
1855
    TRUE   on error
1856 1857
*/

1858 1859
bool
sp_head::execute_procedure(THD *thd, List<Item> *args)
1860
{
1861
  bool err_status= FALSE;
1862
  uint params = m_pcont->context_var_count();
1863
  sp_rcontext *save_spcont, *octx;
1864
  sp_rcontext *nctx = NULL;
unknown's avatar
unknown committed
1865
  bool save_enable_slow_log= false;
1866
  bool save_log_general= false;
1867 1868
  DBUG_ENTER("sp_head::execute_procedure");
  DBUG_PRINT("info", ("procedure %s", m_name.str));
1869

unknown's avatar
unknown committed
1870 1871
  if (args->elements != params)
  {
1872
    my_error(ER_SP_WRONG_NO_OF_ARGS, MYF(0), "PROCEDURE",
1873
             m_qname.str, params, args->elements);
1874
    DBUG_RETURN(TRUE);
unknown's avatar
unknown committed
1875 1876
  }

1877
  save_spcont= octx= thd->spcont;
1878 1879
  if (! octx)
  {				// Create a temporary old context
1880 1881 1882 1883 1884 1885 1886
    if (!(octx= new sp_rcontext(m_pcont, NULL, octx)) ||
        octx->init(thd))
    {
      delete octx; /* Delete octx if it was init() that failed. */
      DBUG_RETURN(TRUE);
    }
    
1887
#ifndef DBUG_OFF
1888
    octx->sp= 0;
1889
#endif
1890 1891 1892 1893 1894 1895
    thd->spcont= octx;

    /* set callers_arena to thd, for upper-level function to work */
    thd->spcont->callers_arena= thd;
  }

1896 1897
  if (!(nctx= new sp_rcontext(m_pcont, NULL, octx)) ||
      nctx->init(thd))
1898
  {
1899
    delete nctx; /* Delete nctx if it was init() that failed. */
1900
    thd->spcont= save_spcont;
1901
    DBUG_RETURN(TRUE);
1902
  }
1903
#ifndef DBUG_OFF
1904
  nctx->sp= this;
1905
#endif
1906

1907
  if (params > 0)
1908
  {
1909
    List_iterator<Item> it_args(*args);
1910

1911
    DBUG_PRINT("info",(" %.*s: eval args", (int) m_name.length, m_name.str));
1912 1913

    for (uint i= 0 ; i < params ; i++)
1914
    {
1915
      Item *arg_item= it_args++;
1916

1917 1918 1919
      if (!arg_item)
        break;

1920 1921
      sp_variable_t *spvar= m_pcont->find_variable(i);

1922
      if (!spvar)
1923 1924
        continue;

1925
      if (spvar->mode != sp_param_in)
1926
      {
1927 1928 1929 1930
        Settable_routine_parameter *srp=
          arg_item->get_settable_routine_parameter();

        if (!srp)
1931 1932 1933 1934 1935
        {
          my_error(ER_SP_NOT_VAR_ARG, MYF(0), i+1, m_qname.str);
          err_status= TRUE;
          break;
        }
1936 1937

        srp->set_required_privilege(spvar->mode == sp_param_inout);
1938 1939
      }

1940
      if (spvar->mode == sp_param_out)
1941 1942 1943 1944
      {
        Item_null *null_item= new Item_null();

        if (!null_item ||
1945
            nctx->set_variable(thd, i, (Item **)&null_item))
1946 1947 1948 1949 1950 1951 1952
        {
          err_status= TRUE;
          break;
        }
      }
      else
      {
1953
        if (nctx->set_variable(thd, i, it_args.ref()))
1954 1955 1956 1957
        {
          err_status= TRUE;
          break;
        }
1958
      }
1959
    }
1960

Konstantin Osipov's avatar
Konstantin Osipov committed
1961 1962 1963
    /*
      Okay, got values for all arguments. Close tables that might be used by
      arguments evaluation. If arguments evaluation required prelocking mode,
1964
      we'll leave it here.
1965 1966
    */
    if (!thd->in_sub_stmt)
1967 1968
    {
      thd->lex->unit.cleanup();
Konstantin Osipov's avatar
Konstantin Osipov committed
1969 1970 1971 1972 1973

      thd_proc_info(thd, "closing tables");
      close_thread_tables(thd);
      thd_proc_info(thd, 0);

1974 1975
      thd->rollback_item_tree_changes();
    }
1976

1977 1978
    DBUG_PRINT("info",(" %.*s: eval args done", (int) m_name.length, 
                       m_name.str));
1979
  }
1980
  if (!(m_flags & LOG_SLOW_STATEMENTS) && thd->enable_slow_log)
unknown's avatar
unknown committed
1981 1982
  {
    DBUG_PRINT("info", ("Disabling slow log for the execution"));
1983
    save_enable_slow_log= true;
unknown's avatar
unknown committed
1984 1985
    thd->enable_slow_log= FALSE;
  }
1986 1987 1988 1989 1990 1991 1992
  if (!(m_flags & LOG_GENERAL_LOG) && !(thd->options & OPTION_LOG_OFF))
  {
    DBUG_PRINT("info", ("Disabling general log for the execution"));
    save_log_general= true;
    /* disable this bit */
    thd->options |= OPTION_LOG_OFF;
  }
1993 1994
  thd->spcont= nctx;

1995 1996 1997 1998 1999 2000
#ifndef NO_EMBEDDED_ACCESS_CHECKS
  Security_context *save_security_ctx= 0;
  if (!err_status)
    err_status= set_routine_security_ctx(thd, this, TRUE, &save_security_ctx);
#endif

2001 2002
  if (!err_status)
    err_status= execute(thd);
2003

2004 2005 2006 2007
  if (save_log_general)
    thd->options &= ~OPTION_LOG_OFF;
  if (save_enable_slow_log)
    thd->enable_slow_log= true;
2008 2009 2010 2011 2012 2013 2014
  /*
    In the case when we weren't able to employ reuse mechanism for
    OUT/INOUT paranmeters, we should reallocate memory. This
    allocation should be done on the arena which will live through
    all execution of calling routine.
  */
  thd->spcont->callers_arena= octx->callers_arena;
2015

2016
  if (!err_status && params > 0)
2017
  {
2018
    List_iterator<Item> it_args(*args);
2019

unknown's avatar
unknown committed
2020 2021 2022 2023
    /*
      Copy back all OUT or INOUT values to the previous frame, or
      set global user variables
    */
2024
    for (uint i= 0 ; i < params ; i++)
2025
    {
2026 2027 2028 2029 2030
      Item *arg_item= it_args++;

      if (!arg_item)
        break;

2031
      sp_variable_t *spvar= m_pcont->find_variable(i);
2032

2033
      if (spvar->mode == sp_param_in)
2034 2035
        continue;

2036 2037 2038 2039 2040
      Settable_routine_parameter *srp=
        arg_item->get_settable_routine_parameter();

      DBUG_ASSERT(srp);

2041
      if (srp->set_value(thd, octx, nctx->get_item_addr(i)))
2042
      {
2043 2044
        err_status= TRUE;
        break;
2045
      }
2046

2047
      Send_field *out_param_info= new (thd->mem_root) Send_field();
2048 2049 2050 2051 2052 2053 2054 2055
      nctx->get_item(i)->make_field(out_param_info);
      out_param_info->db_name= m_db.str;
      out_param_info->table_name= m_name.str;
      out_param_info->org_table_name= m_name.str;
      out_param_info->col_name= spvar->name.str;
      out_param_info->org_col_name= spvar->name.str;

      srp->set_out_param_info(out_param_info);
2056 2057 2058
    }
  }

2059 2060
#ifndef NO_EMBEDDED_ACCESS_CHECKS
  if (save_security_ctx)
2061
    m_security_ctx.restore_security_context(thd, save_security_ctx);
2062 2063
#endif

2064
  if (!save_spcont)
2065
    delete octx;
2066

2067
  delete nctx;
2068
  thd->spcont= save_spcont;
2069

2070
  DBUG_RETURN(err_status);
2071 2072 2073
}


2074
/**
2075
  Reset lex during parsing, before we parse a sub statement.
2076 2077 2078 2079 2080 2081 2082 2083 2084

  @param thd Thread handler.

  @return Error state
    @retval true An error occurred.
    @retval false Success.
*/

bool
2085 2086
sp_head::reset_lex(THD *thd)
{
2087 2088
  DBUG_ENTER("sp_head::reset_lex");
  LEX *sublex;
2089
  LEX *oldlex= thd->lex;
2090

2091 2092 2093 2094 2095
  sublex= new (thd->mem_root)st_lex_local;
  if (sublex == 0)
    DBUG_RETURN(TRUE);

  thd->lex= sublex;
2096
  (void)m_lex.push_front(oldlex);
unknown's avatar
unknown committed
2097

2098 2099
  /* Reset most stuff. */
  lex_start(thd);
unknown's avatar
unknown committed
2100

2101
  /* And keep the SP stuff too */
2102 2103
  sublex->sphead= oldlex->sphead;
  sublex->spcont= oldlex->spcont;
2104 2105
  /* And trigger related stuff too */
  sublex->trg_chistics= oldlex->trg_chistics;
2106
  sublex->trg_table_fields.empty();
2107
  sublex->sp_lex_in_use= FALSE;
2108 2109 2110 2111 2112 2113 2114 2115 2116

  /* Reset type info. */

  sublex->charset= NULL;
  sublex->length= NULL;
  sublex->dec= NULL;
  sublex->interval_list.empty();
  sublex->type= 0;

2117
  DBUG_RETURN(FALSE);
2118 2119
}

unknown's avatar
unknown committed
2120
/// Restore lex during parsing, after we have parsed a sub statement.
2121 2122 2123
void
sp_head::restore_lex(THD *thd)
{
2124 2125
  DBUG_ENTER("sp_head::restore_lex");
  LEX *sublex= thd->lex;
2126 2127 2128
  LEX *oldlex;

  sublex->set_trg_event_type_for_tables();
2129

2130
  oldlex= (LEX *)m_lex.pop();
2131 2132
  if (! oldlex)
    return;			// Nothing to restore
2133

2134
  oldlex->trg_table_fields.push_back(&sublex->trg_table_fields);
2135

unknown's avatar
unknown committed
2136 2137 2138 2139 2140
  /*
    If this substatement needs row-based, the entire routine does too (we
    cannot switch from statement-based to row-based only for this
    substatement).
  */
2141
  if (sublex->is_stmt_unsafe())
unknown's avatar
unknown committed
2142 2143
    m_flags|= BINLOG_ROW_BASED_IF_MIXED;

2144
  /*
2145 2146
    Add routines which are used by statement to respective set for
    this routine.
2147
  */
2148
  sp_update_sp_used_routines(&m_sroutines, &sublex->sroutines);
2149 2150 2151 2152 2153
  /*
    Merge tables used by this statement (but not by its functions or
    procedures) to multiset of tables used by this routine.
  */
  merge_table_list(thd, sublex->query_tables, sublex);
2154
  if (! sublex->sp_lex_in_use)
2155 2156
  {
    lex_end(sublex);
2157
    delete sublex;
2158
  }
2159
  thd->lex= oldlex;
2160
  DBUG_VOID_RETURN;
2161 2162
}

unknown's avatar
unknown committed
2163 2164 2165
/**
  Put the instruction on the backpatch list, associated with the label.
*/
2166
int
2167
sp_head::push_backpatch(sp_instr *i, sp_label_t *lab)
2168
{
2169
  bp_t *bp= (bp_t *)sql_alloc(sizeof(bp_t));
2170

2171 2172 2173 2174 2175
  if (!bp)
    return 1;
  bp->lab= lab;
  bp->instr= i;
  return m_backpatch.push_front(bp);
2176 2177
}

unknown's avatar
unknown committed
2178 2179 2180 2181
/**
  Update all instruction with this label in the backpatch list to
  the current position.
*/
2182
void
2183
sp_head::backpatch(sp_label_t *lab)
2184
{
2185
  bp_t *bp;
2186
  uint dest= instructions();
2187
  List_iterator_fast<bp_t> li(m_backpatch);
2188

unknown's avatar
unknown committed
2189
  DBUG_ENTER("sp_head::backpatch");
2190
  while ((bp= li++))
2191
  {
2192
    if (bp->lab == lab)
unknown's avatar
unknown committed
2193 2194 2195
    {
      DBUG_PRINT("info", ("backpatch: (m_ip %d, label 0x%lx <%s>) to dest %d",
                          bp->instr->m_ip, (ulong) lab, lab->name, dest));
2196
      bp->instr->backpatch(dest, lab->ctx);
unknown's avatar
unknown committed
2197
    }
2198
  }
unknown's avatar
unknown committed
2199
  DBUG_VOID_RETURN;
2200 2201
}

unknown's avatar
unknown committed
2202
/**
unknown's avatar
unknown committed
2203
  Prepare an instance of Create_field for field creation (fill all necessary
2204 2205
  attributes).

unknown's avatar
unknown committed
2206 2207 2208 2209
  @param[in]  thd          Thread handle
  @param[in]  lex          Yacc parsing context
  @param[in]  field_type   Field type
  @param[out] field_def    An instance of create_field to be filled
2210

unknown's avatar
unknown committed
2211
  @retval
2212
    FALSE  on success
unknown's avatar
unknown committed
2213
  @retval
2214 2215 2216 2217 2218 2219
    TRUE   on error
*/

bool
sp_head::fill_field_definition(THD *thd, LEX *lex,
                               enum enum_field_types field_type,
unknown's avatar
unknown committed
2220
                               Create_field *field_def)
2221 2222 2223 2224 2225 2226 2227 2228
{
  LEX_STRING cmt = { 0, 0 };
  uint unused1= 0;
  int unused2= 0;

  if (field_def->init(thd, (char*) "", field_type, lex->length, lex->dec,
                      lex->type, (Item*) 0, (Item*) 0, &cmt, 0,
                      &lex->interval_list,
unknown's avatar
unknown committed
2229 2230
                      lex->charset ? lex->charset :
                                     thd->variables.collation_database,
2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249
                      lex->uint_geom_type))
    return TRUE;

  if (field_def->interval_list.elements)
    field_def->interval= create_typelib(mem_root, field_def,
                                        &field_def->interval_list);

  sp_prepare_create_field(thd, field_def);

  if (prepare_create_field(field_def, &unused1, &unused2, &unused2,
                           HA_CAN_GEOMETRY))
  {
    return TRUE;
  }

  return FALSE;
}


2250
int
2251
sp_head::new_cont_backpatch(sp_instr_opt_meta *i)
2252 2253 2254 2255 2256 2257
{
  m_cont_level+= 1;
  if (i)
  {
    /* Use the cont. destination slot to store the level */
    i->m_cont_dest= m_cont_level;
2258 2259
    if (m_cont_backpatch.push_front(i))
      return 1;
2260
  }
2261
  return 0;
2262 2263
}

2264
int
2265
sp_head::add_cont_backpatch(sp_instr_opt_meta *i)
2266 2267
{
  i->m_cont_dest= m_cont_level;
2268
  return m_cont_backpatch.push_front(i);
2269 2270 2271 2272 2273 2274 2275
}

void
sp_head::do_cont_backpatch()
{
  uint dest= instructions();
  uint lev= m_cont_level--;
2276
  sp_instr_opt_meta *i;
2277 2278 2279 2280 2281 2282 2283 2284

  while ((i= m_cont_backpatch.head()) && i->m_cont_dest == lev)
  {
    i->m_cont_dest= dest;
    (void)m_cont_backpatch.pop();
  }
}

2285
void
2286
sp_head::set_info(longlong created, longlong modified,
2287
		  st_sp_chistics *chistics, ulong sql_mode)
2288 2289 2290
{
  m_created= created;
  m_modified= modified;
unknown's avatar
unknown committed
2291 2292
  m_chistics= (st_sp_chistics *) memdup_root(mem_root, (char*) chistics,
                                             sizeof(*chistics));
2293 2294 2295
  if (m_chistics->comment.length == 0)
    m_chistics->comment.str= 0;
  else
unknown's avatar
unknown committed
2296
    m_chistics->comment.str= strmake_root(mem_root,
2297 2298
					  m_chistics->comment.str,
					  m_chistics->comment.length);
2299
  m_sql_mode= sql_mode;
2300 2301
}

2302 2303

void
unknown's avatar
unknown committed
2304
sp_head::set_definer(const char *definer, uint definerlen)
2305
{
unknown's avatar
unknown committed
2306
  char user_name_holder[USERNAME_LENGTH + 1];
unknown's avatar
unknown committed
2307
  LEX_STRING user_name= { user_name_holder, USERNAME_LENGTH };
2308

2309
  char host_name_holder[HOSTNAME_LENGTH + 1];
2310
  LEX_STRING host_name= { host_name_holder, HOSTNAME_LENGTH };
2311

2312 2313
  parse_user(definer, definerlen, user_name.str, &user_name.length,
             host_name.str, &host_name.length);
2314

2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326
  set_definer(&user_name, &host_name);
}


void
sp_head::set_definer(const LEX_STRING *user_name, const LEX_STRING *host_name)
{
  m_definer_user.str= strmake_root(mem_root, user_name->str, user_name->length);
  m_definer_user.length= user_name->length;

  m_definer_host.str= strmake_root(mem_root, host_name->str, host_name->length);
  m_definer_host.length= host_name->length;
2327 2328 2329
}


2330 2331 2332
void
sp_head::reset_thd_mem_root(THD *thd)
{
2333
  DBUG_ENTER("sp_head::reset_thd_mem_root");
2334
  m_thd_root= thd->mem_root;
unknown's avatar
unknown committed
2335
  thd->mem_root= &main_mem_root;
2336 2337 2338
  DBUG_PRINT("info", ("mem_root 0x%lx moved to thd mem root 0x%lx",
                      (ulong) &mem_root, (ulong) &thd->mem_root));
  free_list= thd->free_list; // Keep the old list
2339 2340
  thd->free_list= NULL;	// Start a new one
  m_thd= thd;
2341
  DBUG_VOID_RETURN;
2342 2343 2344 2345 2346
}

void
sp_head::restore_thd_mem_root(THD *thd)
{
2347 2348
  DBUG_ENTER("sp_head::restore_thd_mem_root");
  Item *flist= free_list;	// The old list
unknown's avatar
unknown committed
2349
  set_query_arena(thd);         // Get new free_list and mem_root
2350
  state= INITIALIZED_FOR_SP;
2351

2352 2353
  DBUG_PRINT("info", ("mem_root 0x%lx returned from thd mem root 0x%lx",
                      (ulong) &mem_root, (ulong) &thd->mem_root));
2354 2355 2356
  thd->free_list= flist;	// Restore the old one
  thd->mem_root= m_thd_root;
  m_thd= NULL;
2357
  DBUG_VOID_RETURN;
2358 2359 2360
}


unknown's avatar
unknown committed
2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371
/**
  Check if a user has access right to a routine.

  @param thd		    Thread handler
  @param sp		    SP
  @param full_access       Set to 1 if the user has SELECT right to the
                           'mysql.proc' able or is the owner of the routine
  @retval
    false ok
  @retval
    true  error
2372 2373 2374
*/

bool check_show_routine_access(THD *thd, sp_head *sp, bool *full_access)
2375 2376 2377 2378 2379
{
  TABLE_LIST tables;
  bzero((char*) &tables,sizeof(tables));
  tables.db= (char*) "mysql";
  tables.table_name= tables.alias= (char*) "proc";
2380 2381
  *full_access= (!check_table_access(thd, SELECT_ACL, &tables, FALSE,
                                     1, TRUE) ||
2382 2383 2384 2385
                 (!strcmp(sp->m_definer_user.str,
                          thd->security_ctx->priv_user) &&
                  !strcmp(sp->m_definer_host.str,
                          thd->security_ctx->priv_host)));
2386
  if (!*full_access)
2387 2388
    return check_some_routine_access(thd, sp->m_db.str, sp->m_name.str,
                                     sp->m_type == TYPE_ENUM_PROCEDURE);
2389 2390 2391 2392
  return 0;
}


unknown's avatar
unknown committed
2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406
/**
  Implement SHOW CREATE statement for stored routines.

  @param thd  Thread context.
  @param type         Stored routine type
                      (TYPE_ENUM_PROCEDURE or TYPE_ENUM_FUNCTION)

  @return Error status.
    @retval FALSE on success
    @retval TRUE on error
*/

bool
sp_head::show_create_routine(THD *thd, int type)
unknown's avatar
unknown committed
2407
{
unknown's avatar
unknown committed
2408 2409 2410 2411 2412 2413 2414 2415
  const char *col1_caption= type == TYPE_ENUM_PROCEDURE ?
                            "Procedure" : "Function";

  const char *col3_caption= type == TYPE_ENUM_PROCEDURE ?
                            "Create Procedure" : "Create Function";

  bool err_status;

unknown's avatar
unknown committed
2416
  Protocol *protocol= thd->protocol;
unknown's avatar
unknown committed
2417 2418
  List<Item> fields;

2419
  LEX_STRING sql_mode;
unknown's avatar
unknown committed
2420

2421
  bool full_access;
unknown's avatar
unknown committed
2422 2423 2424 2425 2426 2427

  DBUG_ENTER("sp_head::show_create_routine");
  DBUG_PRINT("info", ("routine %s", m_name.str));

  DBUG_ASSERT(type == TYPE_ENUM_PROCEDURE ||
              type == TYPE_ENUM_FUNCTION);
unknown's avatar
unknown committed
2428

2429
  if (check_show_routine_access(thd, this, &full_access))
unknown's avatar
unknown committed
2430
    DBUG_RETURN(TRUE);
2431

unknown's avatar
unknown committed
2432 2433 2434 2435 2436
  sys_var_thd_sql_mode::symbolic_mode_representation(
      thd, m_sql_mode, &sql_mode);

  /* Send header. */

unknown's avatar
unknown committed
2437
  fields.push_back(new Item_empty_string(col1_caption, NAME_CHAR_LEN));
unknown's avatar
unknown committed
2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454
  fields.push_back(new Item_empty_string("sql_mode", sql_mode.length));

  {
    /*
      NOTE: SQL statement field must be not less than 1024 in order not to
      confuse old clients.
    */

    Item_empty_string *stmt_fld=
      new Item_empty_string(col3_caption,
                            max(m_defstr.length, 1024));

    stmt_fld->maybe_null= TRUE;

    fields.push_back(stmt_fld);
  }

unknown's avatar
unknown committed
2455 2456 2457 2458 2459 2460 2461 2462 2463
  fields.push_back(new Item_empty_string("character_set_client",
                                         MY_CS_NAME_SIZE));

  fields.push_back(new Item_empty_string("collation_connection",
                                         MY_CS_NAME_SIZE));

  fields.push_back(new Item_empty_string("Database Collation",
                                         MY_CS_NAME_SIZE));

2464
  if (protocol->send_result_set_metadata(&fields,
unknown's avatar
unknown committed
2465 2466 2467 2468 2469 2470
                            Protocol::SEND_NUM_ROWS | Protocol::SEND_EOF))
  {
    DBUG_RETURN(TRUE);
  }

  /* Send data. */
2471

unknown's avatar
unknown committed
2472
  protocol->prepare_for_resend();
unknown's avatar
unknown committed
2473

unknown's avatar
unknown committed
2474
  protocol->store(m_name.str, m_name.length, system_charset_info);
unknown's avatar
unknown committed
2475 2476
  protocol->store(sql_mode.str, sql_mode.length, system_charset_info);

2477
  if (full_access)
2478 2479
    protocol->store(m_defstr.str, m_defstr.length,
                    m_creation_ctx->get_client_cs());
2480 2481
  else
    protocol->store_null();
2482

unknown's avatar
unknown committed
2483 2484 2485 2486 2487

  protocol->store(m_creation_ctx->get_client_cs()->csname, system_charset_info);
  protocol->store(m_creation_ctx->get_connection_cl()->name, system_charset_info);
  protocol->store(m_creation_ctx->get_db_cl()->name, system_charset_info);

unknown's avatar
unknown committed
2488 2489 2490
  err_status= protocol->write();

  if (!err_status)
2491
    my_eof(thd);
unknown's avatar
unknown committed
2492 2493

  DBUG_RETURN(err_status);
unknown's avatar
unknown committed
2494 2495
}

2496

unknown's avatar
unknown committed
2497 2498


unknown's avatar
unknown committed
2499 2500
/**
  Add instruction to SP.
2501

unknown's avatar
unknown committed
2502
  @param instr   Instruction
2503 2504
*/

2505
int sp_head::add_instr(sp_instr *instr)
2506 2507 2508
{
  instr->free_list= m_thd->free_list;
  m_thd->free_list= 0;
2509 2510 2511 2512 2513 2514 2515
  /*
    Memory root of every instruction is designated for permanent
    transformations (optimizations) made on the parsed tree during
    the first execution. It points to the memory root of the
    entire stored procedure, as their life span is equal.
  */
  instr->mem_root= &main_mem_root;
Alexey Botchkov's avatar
Alexey Botchkov committed
2516
  return insert_dynamic(&m_instr, (uchar*)&instr);
unknown's avatar
unknown committed
2517
}
2518

2519

unknown's avatar
unknown committed
2520
/**
2521
  Do some minimal optimization of the code:
unknown's avatar
unknown committed
2522 2523 2524
    -# Mark used instructions
    -# While doing this, shortcut jumps to jump instructions
    -# Compact the code, removing unused instructions.
2525 2526 2527 2528

  This is the main mark and move loop; it relies on the following methods
  in sp_instr and its subclasses:

unknown's avatar
unknown committed
2529 2530 2531 2532 2533
    - opt_mark()         :  Mark instruction as reachable
    - opt_shortcut_jump():  Shortcut jumps to the final destination;
                           used by opt_mark().
    - opt_move()         :  Update moved instruction
    - set_destination()  :  Set the new destination (jump instructions only)
2534 2535 2536
*/

void sp_head::optimize()
2537 2538 2539 2540 2541
{
  List<sp_instr> bp;
  sp_instr *i;
  uint src, dst;

2542
  opt_mark();
2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555

  bp.empty();
  src= dst= 0;
  while ((i= get_instr(src)))
  {
    if (! i->marked)
    {
      delete i;
      src+= 1;
    }
    else
    {
      if (src != dst)
Marc Alff's avatar
Marc Alff committed
2556 2557
      {
        /* Move the instruction and update prev. jumps */
2558 2559 2560
	sp_instr *ibp;
	List_iterator_fast<sp_instr> li(bp);

2561
	set_dynamic(&m_instr, (uchar*)&i, dst);
2562
	while ((ibp= li++))
2563 2564 2565 2566
        {
          sp_instr_opt_meta *im= static_cast<sp_instr_opt_meta *>(ibp);
          im->set_destination(src, dst);
        }
2567 2568 2569 2570 2571 2572 2573 2574 2575 2576
      }
      i->opt_move(dst, &bp);
      src+= 1;
      dst+= 1;
    }
  }
  m_instr.elements= dst;
  bp.empty();
}

2577 2578 2579 2580 2581 2582 2583 2584
void sp_head::add_mark_lead(uint ip, List<sp_instr> *leads)
{
  sp_instr *i= get_instr(ip);

  if (i && ! i->marked)
    leads->push_front(i);
}

2585
void
2586
sp_head::opt_mark()
2587
{
2588
  uint ip;
2589
  sp_instr *i;
2590
  List<sp_instr> leads;
2591

2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620
  /*
    Forward flow analysis algorithm in the instruction graph:
    - first, add the entry point in the graph (the first instruction) to the
      'leads' list of paths to explore.
    - while there are still leads to explore:
      - pick one lead, and follow the path forward. Mark instruction reached.
        Stop only if the end of the routine is reached, or the path converge
        to code already explored (marked).
      - while following a path, collect in the 'leads' list any fork to
        another path (caused by conditional jumps instructions), so that these
        paths can be explored as well.
  */

  /* Add the entry point */
  i= get_instr(0);
  leads.push_front(i);

  /* For each path of code ... */
  while (leads.elements != 0)
  {
    i= leads.pop();

    /* Mark the entire path, collecting new leads. */
    while (i && ! i->marked)
    {
      ip= i->opt_mark(this, & leads);
      i= get_instr(ip);
    }
  }
2621 2622
}

2623

unknown's avatar
unknown committed
2624
#ifndef DBUG_OFF
unknown's avatar
unknown committed
2625
/**
2626
  Return the routine instructions as a result set.
unknown's avatar
unknown committed
2627 2628
  @return
    0 if ok, !=0 on error.
2629
*/
unknown's avatar
unknown committed
2630 2631 2632 2633 2634 2635 2636
int
sp_head::show_routine_code(THD *thd)
{
  Protocol *protocol= thd->protocol;
  char buff[2048];
  String buffer(buff, sizeof(buff), system_charset_info);
  List<Item> field_list;
2637
  sp_instr *i;
unknown's avatar
unknown committed
2638
  bool full_access;
2639
  int res= 0;
unknown's avatar
unknown committed
2640 2641
  uint ip;
  DBUG_ENTER("sp_head::show_routine_code");
2642
  DBUG_PRINT("info", ("procedure: %s", m_name.str));
unknown's avatar
unknown committed
2643 2644 2645 2646 2647 2648 2649

  if (check_show_routine_access(thd, this, &full_access) || !full_access)
    DBUG_RETURN(1);

  field_list.push_back(new Item_uint("Pos", 9));
  // 1024 is for not to confuse old clients
  field_list.push_back(new Item_empty_string("Instruction",
2650 2651
                                             max(buffer.length(), 1024)));
  if (protocol->send_result_set_metadata(&field_list, Protocol::SEND_NUM_ROWS |
unknown's avatar
unknown committed
2652 2653 2654 2655 2656
                                         Protocol::SEND_EOF))
    DBUG_RETURN(1);

  for (ip= 0; (i = get_instr(ip)) ; ip++)
  {
2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672
    /* 
      Consistency check. If these are different something went wrong
      during optimization.
    */
    if (ip != i->m_ip)
    {
      const char *format= "Instruction at position %u has m_ip=%u";
      char tmp[sizeof(format) + 2*SP_INSTR_UINT_MAXLEN + 1];

      sprintf(tmp, format, ip, i->m_ip);
      /*
        Since this is for debugging purposes only, we don't bother to
        introduce a special error code for it.
      */
      push_warning(thd, MYSQL_ERROR::WARN_LEVEL_WARN, ER_UNKNOWN_ERROR, tmp);
    }
unknown's avatar
unknown committed
2673 2674 2675 2676 2677
    protocol->prepare_for_resend();
    protocol->store((longlong)ip);

    buffer.set("", 0, system_charset_info);
    i->print(&buffer);
2678
    protocol->store(buffer.ptr(), buffer.length(), system_charset_info);
unknown's avatar
unknown committed
2679 2680 2681
    if ((res= protocol->write()))
      break;
  }
unknown's avatar
unknown committed
2682 2683

  if (!res)
2684
    my_eof(thd);
unknown's avatar
unknown committed
2685 2686 2687 2688 2689 2690

  DBUG_RETURN(res);
}
#endif // ifndef DBUG_OFF


unknown's avatar
unknown committed
2691
/**
2692 2693 2694 2695
  Prepare LEX and thread for execution of instruction, if requested open
  and lock LEX's tables, execute instruction's core function, perform
  cleanup afterwards.

unknown's avatar
unknown committed
2696 2697 2698 2699 2700 2701 2702 2703
  @param thd           thread context
  @param nextp         out - next instruction
  @param open_tables   if TRUE then check read access to tables in LEX's table
                       list and open and lock them (used in instructions which
                       need to calculate some expression and don't execute
                       complete statement).
  @param sp_instr      instruction for which we prepare context, and which core
                       function execute by calling its exec_core() method.
2704

unknown's avatar
unknown committed
2705
  @note
2706 2707 2708
    We are not saving/restoring some parts of THD which may need this because
    we do this once for whole routine execution in sp_head::execute().

unknown's avatar
unknown committed
2709
  @return
2710 2711 2712 2713 2714 2715 2716 2717
    0/non-0 - Success/Failure
*/

int
sp_lex_keeper::reset_lex_and_exec_core(THD *thd, uint *nextp,
                                       bool open_tables, sp_instr* instr)
{
  int res= 0;
2718
  DBUG_ENTER("reset_lex_and_exec_core");
2719

unknown's avatar
unknown committed
2720 2721 2722 2723 2724 2725 2726
  /* 
    The flag is saved at the entry to the following substatement.
    It's reset further in the common code part.
    It's merged with the saved parent's value at the exit of this func.
  */
  bool parent_modified_non_trans_table= thd->transaction.stmt.modified_non_trans_table;
  thd->transaction.stmt.modified_non_trans_table= FALSE;
2727 2728 2729 2730 2731 2732 2733 2734 2735
  DBUG_ASSERT(!thd->derived_tables);
  DBUG_ASSERT(thd->change_list.is_empty());
  /*
    Use our own lex.
    We should not save old value since it is saved/restored in
    sp_head::execute() when we are entering/leaving routine.
  */
  thd->lex= m_lex;

Konstantin Osipov's avatar
Konstantin Osipov committed
2736
  pthread_mutex_lock(&LOCK_thread_count);
2737
  thd->query_id= next_query_id();
Konstantin Osipov's avatar
Konstantin Osipov committed
2738
  pthread_mutex_unlock(&LOCK_thread_count);
2739

2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757
  if (thd->prelocked_mode == NON_PRELOCKED)
  {
    /*
      This statement will enter/leave prelocked mode on its own.
      Entering prelocked mode changes table list and related members
      of LEX, so we'll need to restore them.
    */
    if (lex_query_tables_own_last)
    {
      /*
        We've already entered/left prelocked mode with this statement.
        Attach the list of tables that need to be prelocked and mark m_lex
        as having such list attached.
      */
      *lex_query_tables_own_last= prelocking_tables;
      m_lex->mark_as_requiring_prelocking(lex_query_tables_own_last);
    }
  }
2758

2759
  reinit_stmt_before_use(thd, m_lex);
2760 2761

  if (open_tables)
2762
    res= instr->exec_open_and_lock_tables(thd, m_lex->query_tables);
2763 2764

  if (!res)
2765
  {
2766
    res= instr->exec_core(thd, nextp);
2767 2768
    DBUG_PRINT("info",("exec_core returned: %d", res));
  }
2769 2770 2771

  m_lex->unit.cleanup();

2772
  thd_proc_info(thd, "closing tables");
2773
  /* Here we also commit or rollback the current statement. */
2774
  close_thread_tables(thd);
2775
  thd_proc_info(thd, 0);
2776

2777
  if (m_lex->query_tables_own_last)
2778
  {
2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791
    /*
      We've entered and left prelocking mode when executing statement
      stored in m_lex. 
      m_lex->query_tables(->next_global)* list now has a 'tail' - a list
      of tables that are added for prelocking. (If this is the first
      execution, the 'tail' was added by open_tables(), otherwise we've
      attached it above in this function).
      Now we'll save the 'tail', and detach it.
    */
    lex_query_tables_own_last= m_lex->query_tables_own_last;
    prelocking_tables= *lex_query_tables_own_last;
    *lex_query_tables_own_last= NULL;
    m_lex->mark_as_requiring_prelocking(NULL);
2792
  }
2793
  thd->rollback_item_tree_changes();
2794 2795 2796
  /* Update the state of the active arena. */
  thd->stmt_arena->state= Query_arena::EXECUTED;

unknown's avatar
unknown committed
2797 2798 2799 2800 2801
  /*
    Merge here with the saved parent's values
    what is needed from the substatement gained
  */
  thd->transaction.stmt.modified_non_trans_table |= parent_modified_non_trans_table;
2802 2803 2804 2805 2806 2807 2808 2809 2810
  /*
    Unlike for PS we should not call Item's destructors for newly created
    items after execution of each instruction in stored routine. This is
    because SP often create Item (like Item_int, Item_string etc...) when
    they want to store some value in local variable, pass return value and
    etc... So their life time should be longer than one instruction.

    cleanup_items() is called in sp_head::execute()
  */
2811
  DBUG_RETURN(res || thd->is_error());
2812 2813 2814
}


unknown's avatar
unknown committed
2815 2816 2817 2818
/*
  sp_instr class functions
*/

2819
int sp_instr::exec_open_and_lock_tables(THD *thd, TABLE_LIST *tables)
2820 2821 2822 2823 2824 2825 2826
{
  int result;

  /*
    Check whenever we have access to tables for this statement
    and open and lock them before executing instructions core function.
  */
2827
  if (check_table_access(thd, SELECT_ACL, tables, FALSE, UINT_MAX, FALSE)
2828 2829 2830 2831 2832 2833 2834 2835
      || open_and_lock_tables(thd, tables))
    result= -1;
  else
    result= 0;

  return result;
}

2836
uint sp_instr::get_cont_dest()
2837
{
2838
  return (m_ip+1);
2839 2840 2841
}


2842
int sp_instr::exec_core(THD *thd, uint *nextp)
2843
{
2844 2845
  DBUG_ASSERT(0);
  return 0;
2846 2847
}

unknown's avatar
unknown committed
2848 2849 2850 2851
/*
  sp_instr_stmt class functions
*/

2852
int
2853
sp_instr_stmt::execute(THD *thd, uint *nextp)
2854
{
2855 2856
  char *query;
  uint32 query_length;
2857
  int res;
2858
  DBUG_ENTER("sp_instr_stmt::execute");
2859
  DBUG_PRINT("info", ("command: %d", m_lex_keeper.sql_command()));
2860

2861 2862
  query= thd->query();
  query_length= thd->query_length();
2863
#if defined(ENABLED_PROFILING)
2864 2865 2866
  /* This s-p instr is profilable and will be captured. */
  thd->profiling.set_query_source(m_query.str, m_query.length);
#endif
2867
  if (!(res= alloc_query(thd, m_query.str, m_query.length)) &&
2868
      !(res=subst_spvars(thd, this, &m_query)))
2869
  {
2870 2871 2872 2873
    /*
      (the order of query cache and subst_spvars calls is irrelevant because
      queries with SP vars can't be cached)
    */
2874
    if (unlikely((thd->options & OPTION_LOG_OFF)==0))
2875
      general_log_write(thd, COM_QUERY, thd->query(), thd->query_length());
2876

2877
    if (query_cache_send_result_to_client(thd,
2878 2879
          thd->query(), 
          thd->query_length()) <= 0)
2880
    {
2881
      res= m_lex_keeper.reset_lex_and_exec_core(thd, nextp, FALSE, this);
2882

Marc Alff's avatar
Marc Alff committed
2883
      if (thd->stmt_da->is_eof())
2884
        thd->protocol->end_statement();
2885 2886 2887

      query_cache_end_of_result(thd);

unknown's avatar
unknown committed
2888 2889
      if (!res && unlikely(thd->enable_slow_log))
        log_slow_statement(thd);
2890
    }
2891 2892
    else
      *nextp= m_ip+1;
2893
    thd->set_query(query, query_length);
2894
    thd->query_name_consts= 0;
2895 2896

    if (!thd->is_error())
Marc Alff's avatar
Marc Alff committed
2897
      thd->stmt_da->reset_diagnostics_area();
2898
  }
2899
  DBUG_RETURN(res || thd->is_error());
2900 2901
}

2902

2903 2904 2905
void
sp_instr_stmt::print(String *str)
{
unknown's avatar
unknown committed
2906 2907
  uint i, len;

2908 2909
  /* stmt CMD "..." */
  if (str->reserve(SP_STMT_PRINT_MAXLEN+SP_INSTR_UINT_MAXLEN+8))
2910
    return;
2911
  str->qs_append(STRING_WITH_LEN("stmt "));
2912
  str->qs_append((uint)m_lex_keeper.sql_command());
2913
  str->qs_append(STRING_WITH_LEN(" \""));
unknown's avatar
unknown committed
2914 2915 2916 2917 2918
  len= m_query.length;
  /*
    Print the query string (but not too much of it), just to indicate which
    statement it is.
  */
2919 2920
  if (len > SP_STMT_PRINT_MAXLEN)
    len= SP_STMT_PRINT_MAXLEN-3;
unknown's avatar
unknown committed
2921 2922
  /* Copy the query string and replace '\n' with ' ' in the process */
  for (i= 0 ; i < len ; i++)
2923
  {
unknown's avatar
unknown committed
2924 2925 2926 2927
    char c= m_query.str[i];
    if (c == '\n')
      c= ' ';
    str->qs_append(c);
2928
  }
2929
  if (m_query.length > SP_STMT_PRINT_MAXLEN)
2930
    str->qs_append(STRING_WITH_LEN("...")); /* Indicate truncated string */
2931
  str->qs_append('"');
2932
}
unknown's avatar
unknown committed
2933

2934

2935
int
2936
sp_instr_stmt::exec_core(THD *thd, uint *nextp)
2937
{
2938
  MYSQL_QUERY_EXEC_START(thd->query(),
2939 2940 2941
                         thd->thread_id,
                         (char *) (thd->db ? thd->db : ""),
                         thd->security_ctx->priv_user,
2942
                         (char *)thd->security_ctx->host_or_ip,
2943
                         3);
2944
  int res= mysql_execute_command(thd);
2945
  MYSQL_QUERY_EXEC_DONE(res);
2946
  *nextp= m_ip+1;
2947
  return res;
2948 2949
}

unknown's avatar
unknown committed
2950 2951 2952 2953 2954

/*
  sp_instr_set class functions
*/

2955
int
2956
sp_instr_set::execute(THD *thd, uint *nextp)
2957
{
2958 2959
  DBUG_ENTER("sp_instr_set::execute");
  DBUG_PRINT("info", ("offset: %u", m_offset));
2960 2961 2962 2963

  DBUG_RETURN(m_lex_keeper.reset_lex_and_exec_core(thd, nextp, TRUE, this));
}

unknown's avatar
unknown committed
2964

2965 2966 2967
int
sp_instr_set::exec_core(THD *thd, uint *nextp)
{
2968
  int res= thd->spcont->set_variable(thd, m_offset, &m_value);
2969

2970
  if (res && thd->spcont->found_handler_here())
2971 2972
  {
    /*
2973 2974
      Failed to evaluate the value, and a handler has been found. Reset the
      variable to NULL.
2975 2976
    */

2977 2978 2979
    if (thd->spcont->set_variable(thd, m_offset, 0))
    {
      /* If this also failed, let's abort. */
2980

2981 2982
      sp_rcontext *spcont= thd->spcont;
    
2983
      thd->spcont= NULL;           /* Avoid handlers */
2984 2985 2986 2987 2988
      my_error(ER_OUT_OF_RESOURCES, MYF(0));
      spcont->clear_handler();
      thd->spcont= spcont;
    }
  }
2989

2990
  *nextp = m_ip+1;
2991
  return res;
2992 2993
}

2994 2995 2996
void
sp_instr_set::print(String *str)
{
2997 2998
  /* set name@offset ... */
  int rsrv = SP_INSTR_UINT_MAXLEN+6;
2999
  sp_variable_t *var = m_ctx->find_variable(m_offset);
unknown's avatar
unknown committed
3000 3001 3002 3003

  /* 'var' should always be non-null, but just in case... */
  if (var)
    rsrv+= var->name.length;
3004 3005
  if (str->reserve(rsrv))
    return;
3006
  str->qs_append(STRING_WITH_LEN("set "));
unknown's avatar
unknown committed
3007 3008
  if (var)
  {
3009 3010
    str->qs_append(var->name.str, var->name.length);
    str->qs_append('@');
unknown's avatar
unknown committed
3011
  }
3012
  str->qs_append(m_offset);
3013
  str->qs_append(' ');
3014
  m_value->print(str, QT_ORDINARY);
3015 3016
}

3017

unknown's avatar
unknown committed
3018 3019 3020 3021
/*
  sp_instr_set_trigger_field class functions
*/

3022 3023 3024 3025
int
sp_instr_set_trigger_field::execute(THD *thd, uint *nextp)
{
  DBUG_ENTER("sp_instr_set_trigger_field::execute");
3026 3027 3028 3029 3030 3031 3032
  DBUG_RETURN(m_lex_keeper.reset_lex_and_exec_core(thd, nextp, TRUE, this));
}


int
sp_instr_set_trigger_field::exec_core(THD *thd, uint *nextp)
{
3033
  const int res= (trigger_field->set_value(thd, &value) ? -1 : 0);
3034 3035
  *nextp = m_ip+1;
  return res;
3036 3037 3038 3039 3040
}

void
sp_instr_set_trigger_field::print(String *str)
{
3041
  str->append(STRING_WITH_LEN("set_trigger_field "));
3042
  trigger_field->print(str, QT_ORDINARY);
3043
  str->append(STRING_WITH_LEN(":="));
3044
  value->print(str, QT_ORDINARY);
3045 3046
}

3047 3048 3049 3050
/*
  sp_instr_opt_meta
*/

3051
uint sp_instr_opt_meta::get_cont_dest()
3052
{
3053
  return m_cont_dest;
3054 3055
}

unknown's avatar
unknown committed
3056 3057 3058 3059 3060

/*
 sp_instr_jump class functions
*/

3061 3062 3063 3064 3065 3066 3067 3068 3069 3070
int
sp_instr_jump::execute(THD *thd, uint *nextp)
{
  DBUG_ENTER("sp_instr_jump::execute");
  DBUG_PRINT("info", ("destination: %u", m_dest));

  *nextp= m_dest;
  DBUG_RETURN(0);
}

3071 3072 3073
void
sp_instr_jump::print(String *str)
{
3074 3075
  /* jump dest */
  if (str->reserve(SP_INSTR_UINT_MAXLEN+5))
3076
    return;
3077
  str->qs_append(STRING_WITH_LEN("jump "));
3078 3079 3080
  str->qs_append(m_dest);
}

3081
uint
3082
sp_instr_jump::opt_mark(sp_head *sp, List<sp_instr> *leads)
3083
{
3084
  m_dest= opt_shortcut_jump(sp, this);
3085 3086
  if (m_dest != m_ip+1)		/* Jumping to following instruction? */
    marked= 1;
3087 3088 3089 3090 3091
  m_optdest= sp->get_instr(m_dest);
  return m_dest;
}

uint
3092
sp_instr_jump::opt_shortcut_jump(sp_head *sp, sp_instr *start)
3093 3094 3095 3096 3097 3098
{
  uint dest= m_dest;
  sp_instr *i;

  while ((i= sp->get_instr(dest)))
  {
3099
    uint ndest;
3100

3101
    if (start == i || this == i)
3102 3103
      break;
    ndest= i->opt_shortcut_jump(sp, start);
3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120
    if (ndest == dest)
      break;
    dest= ndest;
  }
  return dest;
}

void
sp_instr_jump::opt_move(uint dst, List<sp_instr> *bp)
{
  if (m_dest > m_ip)
    bp->push_back(this);	// Forward
  else if (m_optdest)
    m_dest= m_optdest->m_ip;	// Backward
  m_ip= dst;
}

unknown's avatar
unknown committed
3121 3122 3123 3124 3125

/*
  sp_instr_jump_if_not class functions
*/

3126 3127 3128
int
sp_instr_jump_if_not::execute(THD *thd, uint *nextp)
{
3129 3130
  DBUG_ENTER("sp_instr_jump_if_not::execute");
  DBUG_PRINT("info", ("destination: %u", m_dest));
3131 3132 3133 3134 3135 3136 3137
  DBUG_RETURN(m_lex_keeper.reset_lex_and_exec_core(thd, nextp, TRUE, this));
}


int
sp_instr_jump_if_not::exec_core(THD *thd, uint *nextp)
{
3138 3139
  Item *it;
  int res;
3140

3141
  it= sp_prepare_func_item(thd, &m_expr);
3142
  if (! it)
3143
  {
3144
    res= -1;
3145
  }
3146
  else
3147 3148
  {
    res= 0;
3149
    if (! it->val_bool())
3150 3151 3152 3153
      *nextp = m_dest;
    else
      *nextp = m_ip+1;
  }
3154 3155

  return res;
3156
}
3157

unknown's avatar
unknown committed
3158

3159 3160 3161
void
sp_instr_jump_if_not::print(String *str)
{
3162
  /* jump_if_not dest(cont) ... */
3163
  if (str->reserve(2*SP_INSTR_UINT_MAXLEN+14+32)) // Add some for the expr. too
3164
    return;
3165
  str->qs_append(STRING_WITH_LEN("jump_if_not "));
3166
  str->qs_append(m_dest);
3167
  str->qs_append('(');
3168
  str->qs_append(m_cont_dest);
3169
  str->qs_append(STRING_WITH_LEN(") "));
3170
  m_expr->print(str, QT_ORDINARY);
3171 3172
}

unknown's avatar
unknown committed
3173

3174
uint
3175
sp_instr_jump_if_not::opt_mark(sp_head *sp, List<sp_instr> *leads)
3176 3177 3178 3179 3180 3181
{
  sp_instr *i;

  marked= 1;
  if ((i= sp->get_instr(m_dest)))
  {
3182
    m_dest= i->opt_shortcut_jump(sp, this);
3183 3184
    m_optdest= sp->get_instr(m_dest);
  }
3185
  sp->add_mark_lead(m_dest, leads);
3186 3187 3188 3189 3190
  if ((i= sp->get_instr(m_cont_dest)))
  {
    m_cont_dest= i->opt_shortcut_jump(sp, this);
    m_cont_optdest= sp->get_instr(m_cont_dest);
  }
3191
  sp->add_mark_lead(m_cont_dest, leads);
3192 3193 3194
  return m_ip+1;
}

3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214
void
sp_instr_jump_if_not::opt_move(uint dst, List<sp_instr> *bp)
{
  /*
    cont. destinations may point backwards after shortcutting jumps
    during the mark phase. If it's still pointing forwards, only
    push this for backpatching if sp_instr_jump::opt_move() will not
    do it (i.e. if the m_dest points backwards).
   */
  if (m_cont_dest > m_ip)
  {                             // Forward
    if (m_dest < m_ip)
      bp->push_back(this);
  }
  else if (m_cont_optdest)
    m_cont_dest= m_cont_optdest->m_ip; // Backward
  /* This will take care of m_dest and m_ip */
  sp_instr_jump::opt_move(dst, bp);
}

unknown's avatar
unknown committed
3215 3216 3217 3218

/*
  sp_instr_freturn class functions
*/
3219

3220
int
3221
sp_instr_freturn::execute(THD *thd, uint *nextp)
3222
{
3223
  DBUG_ENTER("sp_instr_freturn::execute");
3224 3225 3226 3227 3228 3229 3230
  DBUG_RETURN(m_lex_keeper.reset_lex_and_exec_core(thd, nextp, TRUE, this));
}


int
sp_instr_freturn::exec_core(THD *thd, uint *nextp)
{
3231 3232 3233 3234
  /*
    Change <next instruction pointer>, so that this will be the last
    instruction in the stored function.
  */
3235

3236
  *nextp= UINT_MAX;
3237

3238 3239 3240 3241 3242 3243 3244 3245
  /*
    Evaluate the value of return expression and store it in current runtime
    context.

    NOTE: It's necessary to evaluate result item right here, because we must
    do it in scope of execution the current context/block.
  */

3246
  return thd->spcont->set_return_value(thd, &m_value);
3247
}
3248

3249 3250 3251
void
sp_instr_freturn::print(String *str)
{
3252
  /* freturn type expr... */
3253
  if (str->reserve(1024+8+32)) // Add some for the expr. too
3254
    return;
3255
  str->qs_append(STRING_WITH_LEN("freturn "));
3256
  str->qs_append((uint)m_type);
3257
  str->qs_append(' ');
3258
  m_value->print(str, QT_ORDINARY);
3259 3260
}

unknown's avatar
unknown committed
3261 3262 3263 3264
/*
  sp_instr_hpush_jump class functions
*/

3265 3266 3267 3268 3269 3270 3271 3272
int
sp_instr_hpush_jump::execute(THD *thd, uint *nextp)
{
  DBUG_ENTER("sp_instr_hpush_jump::execute");
  List_iterator_fast<sp_cond_type_t> li(m_cond);
  sp_cond_type_t *p;

  while ((p= li++))
Marc Alff's avatar
Marc Alff committed
3273
    thd->spcont->push_handler(p, m_ip+1, m_type);
3274 3275 3276 3277 3278

  *nextp= m_dest;
  DBUG_RETURN(0);
}

unknown's avatar
unknown committed
3279

3280 3281 3282
void
sp_instr_hpush_jump::print(String *str)
{
3283 3284
  /* hpush_jump dest fsize type */
  if (str->reserve(SP_INSTR_UINT_MAXLEN*2 + 21))
3285
    return;
3286
  str->qs_append(STRING_WITH_LEN("hpush_jump "));
3287
  str->qs_append(m_dest);
3288
  str->qs_append(' ');
3289
  str->qs_append(m_frame);
unknown's avatar
unknown committed
3290
  switch (m_type) {
unknown's avatar
unknown committed
3291
  case SP_HANDLER_NONE:
3292
    str->qs_append(STRING_WITH_LEN(" NONE")); // This would be a bug
unknown's avatar
unknown committed
3293 3294
    break;
  case SP_HANDLER_EXIT:
3295
    str->qs_append(STRING_WITH_LEN(" EXIT"));
unknown's avatar
unknown committed
3296 3297
    break;
  case SP_HANDLER_CONTINUE:
3298
    str->qs_append(STRING_WITH_LEN(" CONTINUE"));
unknown's avatar
unknown committed
3299 3300
    break;
  case SP_HANDLER_UNDO:
3301
    str->qs_append(STRING_WITH_LEN(" UNDO"));
unknown's avatar
unknown committed
3302 3303
    break;
  default:
unknown's avatar
unknown committed
3304 3305
    // This would be a bug as well
    str->qs_append(STRING_WITH_LEN(" UNKNOWN:"));
unknown's avatar
unknown committed
3306 3307
    str->qs_append(m_type);
  }
3308 3309
}

unknown's avatar
unknown committed
3310

3311
uint
3312
sp_instr_hpush_jump::opt_mark(sp_head *sp, List<sp_instr> *leads)
3313 3314 3315 3316 3317 3318
{
  sp_instr *i;

  marked= 1;
  if ((i= sp->get_instr(m_dest)))
  {
3319
    m_dest= i->opt_shortcut_jump(sp, this);
3320 3321
    m_optdest= sp->get_instr(m_dest);
  }
3322
  sp->add_mark_lead(m_dest, leads);
3323 3324 3325
  return m_ip+1;
}

unknown's avatar
unknown committed
3326 3327 3328 3329 3330

/*
  sp_instr_hpop class functions
*/

3331 3332 3333 3334 3335 3336 3337 3338 3339
int
sp_instr_hpop::execute(THD *thd, uint *nextp)
{
  DBUG_ENTER("sp_instr_hpop::execute");
  thd->spcont->pop_handlers(m_count);
  *nextp= m_ip+1;
  DBUG_RETURN(0);
}

3340 3341 3342
void
sp_instr_hpop::print(String *str)
{
3343 3344
  /* hpop count */
  if (str->reserve(SP_INSTR_UINT_MAXLEN+5))
3345
    return;
3346
  str->qs_append(STRING_WITH_LEN("hpop "));
3347 3348 3349
  str->qs_append(m_count);
}

3350

unknown's avatar
unknown committed
3351 3352 3353 3354
/*
  sp_instr_hreturn class functions
*/

3355 3356 3357 3358
int
sp_instr_hreturn::execute(THD *thd, uint *nextp)
{
  DBUG_ENTER("sp_instr_hreturn::execute");
3359 3360 3361 3362 3363 3364
  if (m_dest)
    *nextp= m_dest;
  else
  {
    *nextp= thd->spcont->pop_hstack();
  }
3365
  thd->spcont->exit_handler();
3366 3367
  DBUG_RETURN(0);
}
3368

unknown's avatar
unknown committed
3369

3370 3371 3372
void
sp_instr_hreturn::print(String *str)
{
3373 3374
  /* hreturn framesize dest */
  if (str->reserve(SP_INSTR_UINT_MAXLEN*2 + 9))
3375
    return;
3376
  str->qs_append(STRING_WITH_LEN("hreturn "));
3377
  str->qs_append(m_frame);
3378
  if (m_dest)
3379
  {
3380
    str->qs_append(' ');
3381
    str->qs_append(m_dest);
3382
  }
3383 3384
}

unknown's avatar
unknown committed
3385

3386
uint
3387
sp_instr_hreturn::opt_mark(sp_head *sp, List<sp_instr> *leads)
3388
{
3389
  marked= 1;
3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402
  
  if (m_dest)
  {
    /*
      This is an EXIT handler; next instruction step is in m_dest.
     */
    return m_dest;
  }
  
  /*
    This is a CONTINUE handler; next instruction step will come from
    the handler stack and not from opt_mark.
   */
3403
  return UINT_MAX;
3404 3405
}

3406

unknown's avatar
unknown committed
3407 3408 3409 3410
/*
  sp_instr_cpush class functions
*/

3411 3412 3413
int
sp_instr_cpush::execute(THD *thd, uint *nextp)
{
unknown's avatar
unknown committed
3414
  Query_arena backup_arena;
3415
  DBUG_ENTER("sp_instr_cpush::execute");
3416 3417 3418 3419 3420

  /*
    We should create cursors in the callers arena, as
    it could be (and usually is) used in several instructions.
  */
unknown's avatar
unknown committed
3421
  thd->set_n_backup_active_arena(thd->spcont->callers_arena, &backup_arena);
3422

3423
  thd->spcont->push_cursor(&m_lex_keeper, this);
3424

unknown's avatar
unknown committed
3425
  thd->restore_active_arena(thd->spcont->callers_arena, &backup_arena);
3426

3427
  *nextp= m_ip+1;
3428

3429 3430 3431
  DBUG_RETURN(0);
}

unknown's avatar
unknown committed
3432

3433 3434 3435
void
sp_instr_cpush::print(String *str)
{
unknown's avatar
unknown committed
3436 3437
  LEX_STRING n;
  my_bool found= m_ctx->find_cursor(m_cursor, &n);
3438 3439
  /* cpush name@offset */
  uint rsrv= SP_INSTR_UINT_MAXLEN+7;
unknown's avatar
unknown committed
3440

3441 3442 3443 3444
  if (found)
    rsrv+= n.length;
  if (str->reserve(rsrv))
    return;
3445
  str->qs_append(STRING_WITH_LEN("cpush "));
unknown's avatar
unknown committed
3446 3447
  if (found)
  {
3448 3449
    str->qs_append(n.str, n.length);
    str->qs_append('@');
unknown's avatar
unknown committed
3450 3451
  }
  str->qs_append(m_cursor);
3452 3453
}

unknown's avatar
unknown committed
3454 3455 3456 3457 3458

/*
  sp_instr_cpop class functions
*/

3459 3460 3461 3462 3463 3464 3465 3466 3467
int
sp_instr_cpop::execute(THD *thd, uint *nextp)
{
  DBUG_ENTER("sp_instr_cpop::execute");
  thd->spcont->pop_cursors(m_count);
  *nextp= m_ip+1;
  DBUG_RETURN(0);
}

unknown's avatar
unknown committed
3468

3469 3470 3471
void
sp_instr_cpop::print(String *str)
{
3472 3473
  /* cpop count */
  if (str->reserve(SP_INSTR_UINT_MAXLEN+5))
3474
    return;
3475
  str->qs_append(STRING_WITH_LEN("cpop "));
3476 3477 3478
  str->qs_append(m_count);
}

unknown's avatar
unknown committed
3479 3480 3481 3482 3483

/*
  sp_instr_copen class functions
*/

unknown's avatar
unknown committed
3484 3485 3486 3487 3488
/**
  @todo
    Assert that we either have an error or a cursor
*/

3489 3490 3491
int
sp_instr_copen::execute(THD *thd, uint *nextp)
{
3492 3493 3494 3495
  /*
    We don't store a pointer to the cursor in the instruction to be
    able to reuse the same instruction among different threads in future.
  */
3496 3497 3498 3499 3500 3501 3502 3503
  sp_cursor *c= thd->spcont->get_cursor(m_cursor);
  int res;
  DBUG_ENTER("sp_instr_copen::execute");

  if (! c)
    res= -1;
  else
  {
3504 3505
    sp_lex_keeper *lex_keeper= c->get_lex_keeper();
    Query_arena *old_arena= thd->stmt_arena;
3506

3507 3508 3509 3510 3511 3512 3513 3514 3515 3516 3517 3518 3519 3520 3521 3522 3523 3524 3525
    /*
      Get the Query_arena from the cpush instruction, which contains
      the free_list of the query, so new items (if any) are stored in
      the right free_list, and we can cleanup after each open.
    */
    thd->stmt_arena= c->get_instr();
    res= lex_keeper->reset_lex_and_exec_core(thd, nextp, FALSE, this);
    /* Cleanup the query's items */
    if (thd->stmt_arena->free_list)
      cleanup_items(thd->stmt_arena->free_list);
    thd->stmt_arena= old_arena;
    /*
      Work around the fact that errors in selects are not returned properly
      (but instead converted into a warning), so if a condition handler
      caught, we have lost the result code.
    */
    if (!res)
    {
      uint dummy1, dummy2;
3526

3527 3528
      if (thd->spcont->found_handler(&dummy1, &dummy2))
        res= -1;
3529
    }
3530
    /* TODO: Assert here that we either have an error or a cursor */
3531 3532 3533 3534
  }
  DBUG_RETURN(res);
}

unknown's avatar
unknown committed
3535

3536 3537 3538
int
sp_instr_copen::exec_core(THD *thd, uint *nextp)
{
3539 3540
  sp_cursor *c= thd->spcont->get_cursor(m_cursor);
  int res= c->open(thd);
3541 3542 3543 3544
  *nextp= m_ip+1;
  return res;
}

3545 3546 3547
void
sp_instr_copen::print(String *str)
{
unknown's avatar
unknown committed
3548 3549
  LEX_STRING n;
  my_bool found= m_ctx->find_cursor(m_cursor, &n);
3550 3551
  /* copen name@offset */
  uint rsrv= SP_INSTR_UINT_MAXLEN+7;
unknown's avatar
unknown committed
3552

3553 3554 3555 3556
  if (found)
    rsrv+= n.length;
  if (str->reserve(rsrv))
    return;
3557
  str->qs_append(STRING_WITH_LEN("copen "));
unknown's avatar
unknown committed
3558 3559
  if (found)
  {
3560 3561
    str->qs_append(n.str, n.length);
    str->qs_append('@');
unknown's avatar
unknown committed
3562
  }
3563 3564 3565
  str->qs_append(m_cursor);
}

unknown's avatar
unknown committed
3566 3567 3568 3569 3570

/*
  sp_instr_cclose class functions
*/

3571 3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 3584 3585
int
sp_instr_cclose::execute(THD *thd, uint *nextp)
{
  sp_cursor *c= thd->spcont->get_cursor(m_cursor);
  int res;
  DBUG_ENTER("sp_instr_cclose::execute");

  if (! c)
    res= -1;
  else
    res= c->close(thd);
  *nextp= m_ip+1;
  DBUG_RETURN(res);
}

unknown's avatar
unknown committed
3586

3587 3588 3589
void
sp_instr_cclose::print(String *str)
{
unknown's avatar
unknown committed
3590 3591
  LEX_STRING n;
  my_bool found= m_ctx->find_cursor(m_cursor, &n);
3592 3593
  /* cclose name@offset */
  uint rsrv= SP_INSTR_UINT_MAXLEN+8;
unknown's avatar
unknown committed
3594

3595 3596 3597 3598
  if (found)
    rsrv+= n.length;
  if (str->reserve(rsrv))
    return;
3599
  str->qs_append(STRING_WITH_LEN("cclose "));
unknown's avatar
unknown committed
3600 3601
  if (found)
  {
3602 3603
    str->qs_append(n.str, n.length);
    str->qs_append('@');
unknown's avatar
unknown committed
3604
  }
3605 3606 3607
  str->qs_append(m_cursor);
}

unknown's avatar
unknown committed
3608 3609 3610 3611 3612

/*
  sp_instr_cfetch class functions
*/

3613 3614 3615 3616 3617
int
sp_instr_cfetch::execute(THD *thd, uint *nextp)
{
  sp_cursor *c= thd->spcont->get_cursor(m_cursor);
  int res;
unknown's avatar
unknown committed
3618
  Query_arena backup_arena;
3619 3620
  DBUG_ENTER("sp_instr_cfetch::execute");

3621
  res= c ? c->fetch(thd, &m_varlist) : -1;
3622

3623 3624 3625
  *nextp= m_ip+1;
  DBUG_RETURN(res);
}
3626

unknown's avatar
unknown committed
3627

3628 3629 3630
void
sp_instr_cfetch::print(String *str)
{
3631 3632
  List_iterator_fast<struct sp_variable> li(m_varlist);
  sp_variable_t *pv;
unknown's avatar
unknown committed
3633 3634
  LEX_STRING n;
  my_bool found= m_ctx->find_cursor(m_cursor, &n);
3635 3636
  /* cfetch name@offset vars... */
  uint rsrv= SP_INSTR_UINT_MAXLEN+8;
3637

3638 3639 3640 3641
  if (found)
    rsrv+= n.length;
  if (str->reserve(rsrv))
    return;
3642
  str->qs_append(STRING_WITH_LEN("cfetch "));
unknown's avatar
unknown committed
3643 3644
  if (found)
  {
3645 3646
    str->qs_append(n.str, n.length);
    str->qs_append('@');
unknown's avatar
unknown committed
3647
  }
3648 3649 3650
  str->qs_append(m_cursor);
  while ((pv= li++))
  {
3651
    if (str->reserve(pv->name.length+SP_INSTR_UINT_MAXLEN+2))
3652 3653 3654 3655
      return;
    str->qs_append(' ');
    str->qs_append(pv->name.str, pv->name.length);
    str->qs_append('@');
3656 3657 3658 3659
    str->qs_append(pv->offset);
  }
}

unknown's avatar
unknown committed
3660 3661 3662 3663 3664

/*
  sp_instr_error class functions
*/

3665 3666 3667 3668 3669
int
sp_instr_error::execute(THD *thd, uint *nextp)
{
  DBUG_ENTER("sp_instr_error::execute");

unknown's avatar
unknown committed
3670
  my_message(m_errcode, ER(m_errcode), MYF(0));
3671 3672 3673 3674
  *nextp= m_ip+1;
  DBUG_RETURN(-1);
}

unknown's avatar
unknown committed
3675

3676 3677 3678
void
sp_instr_error::print(String *str)
{
3679 3680
  /* error code */
  if (str->reserve(SP_INSTR_UINT_MAXLEN+6))
3681
    return;
3682
  str->qs_append(STRING_WITH_LEN("error "));
3683 3684 3685
  str->qs_append(m_errcode);
}

3686

3687 3688 3689 3690 3691 3692 3693 3694 3695 3696 3697 3698 3699 3700 3701 3702
/**************************************************************************
  sp_instr_set_case_expr class implementation
**************************************************************************/

int
sp_instr_set_case_expr::execute(THD *thd, uint *nextp)
{
  DBUG_ENTER("sp_instr_set_case_expr::execute");

  DBUG_RETURN(m_lex_keeper.reset_lex_and_exec_core(thd, nextp, TRUE, this));
}


int
sp_instr_set_case_expr::exec_core(THD *thd, uint *nextp)
{
3703
  int res= thd->spcont->set_case_expr(thd, m_case_expr_id, &m_case_expr);
3704 3705 3706 3707 3708 3709 3710 3711 3712 3713 3714 3715 3716

  if (res &&
      !thd->spcont->get_case_expr(m_case_expr_id) &&
      thd->spcont->found_handler_here())
  {
    /*
      Failed to evaluate the value, the case expression is still not
      initialized, and a handler has been found. Set to NULL so we can continue.
    */

    Item *null_item= new Item_null();
    
    if (!null_item ||
3717
        thd->spcont->set_case_expr(thd, m_case_expr_id, &null_item))
3718 3719 3720 3721 3722
    {
      /* If this also failed, we have to abort. */

      sp_rcontext *spcont= thd->spcont;
    
3723
      thd->spcont= NULL;           /* Avoid handlers */
3724 3725 3726 3727 3728
      my_error(ER_OUT_OF_RESOURCES, MYF(0));
      spcont->clear_handler();
      thd->spcont= spcont;
    }
  }
3729 3730
  else
    *nextp= m_ip+1;
3731

3732
  return res;
3733 3734 3735 3736 3737 3738
}


void
sp_instr_set_case_expr::print(String *str)
{
3739 3740 3741 3742 3743
  /* set_case_expr (cont) id ... */
  str->reserve(2*SP_INSTR_UINT_MAXLEN+18+32); // Add some extra for expr too
  str->qs_append(STRING_WITH_LEN("set_case_expr ("));
  str->qs_append(m_cont_dest);
  str->qs_append(STRING_WITH_LEN(") "));
3744
  str->qs_append(m_case_expr_id);
3745
  str->qs_append(' ');
3746
  m_case_expr->print(str, QT_ORDINARY);
3747 3748
}

3749
uint
3750
sp_instr_set_case_expr::opt_mark(sp_head *sp, List<sp_instr> *leads)
3751 3752 3753 3754 3755 3756 3757 3758 3759
{
  sp_instr *i;

  marked= 1;
  if ((i= sp->get_instr(m_cont_dest)))
  {
    m_cont_dest= i->opt_shortcut_jump(sp, this);
    m_cont_optdest= sp->get_instr(m_cont_dest);
  }
3760
  sp->add_mark_lead(m_cont_dest, leads);
3761 3762 3763 3764 3765 3766 3767 3768 3769 3770 3771 3772 3773
  return m_ip+1;
}

void
sp_instr_set_case_expr::opt_move(uint dst, List<sp_instr> *bp)
{
  if (m_cont_dest > m_ip)
    bp->push_back(this);        // Forward
  else if (m_cont_optdest)
    m_cont_dest= m_cont_optdest->m_ip; // Backward
  m_ip= dst;
}

3774

unknown's avatar
unknown committed
3775
/* ------------------------------------------------------------------ */
3776

3777 3778

/*
3779 3780 3781 3782
  Structure that represent all instances of one table
  in optimized multi-set of tables used by routine.
*/

3783 3784
typedef struct st_sp_table
{
3785 3786 3787 3788 3789 3790 3791 3792
  /*
    Multi-set key:
      db_name\0table_name\0alias\0 - for normal tables
      db_name\0table_name\0        - for temporary tables
    Note that in both cases we don't take last '\0' into account when
    we count length of key.
  */
  LEX_STRING qname;
unknown's avatar
unknown committed
3793 3794 3795
  uint db_length, table_name_length;
  bool temp;               /* true if corresponds to a temporary table */
  thr_lock_type lock_type; /* lock type used for prelocking */
3796 3797
  uint lock_count;
  uint query_lock_count;
3798
  uint8 trg_event_map;
3799 3800
} SP_TABLE;

3801 3802

uchar *sp_table_key(const uchar *ptr, size_t *plen, my_bool first)
3803 3804 3805
{
  SP_TABLE *tab= (SP_TABLE *)ptr;
  *plen= tab->qname.length;
3806
  return (uchar *)tab->qname.str;
3807 3808
}

3809

unknown's avatar
unknown committed
3810
/**
3811 3812 3813
  Merge the list of tables used by some query into the multi-set of
  tables used by routine.

unknown's avatar
unknown committed
3814 3815 3816 3817
  @param thd                 thread context
  @param table               table list
  @param lex_for_tmp_check   LEX of the query for which we are merging
                             table list.
3818

unknown's avatar
unknown committed
3819
  @note
3820 3821 3822
    This method will use LEX provided to check whenever we are creating
    temporary table and mark it as such in target multi-set.

unknown's avatar
unknown committed
3823 3824 3825 3826
  @retval
    TRUE    Success
  @retval
    FALSE   Error
3827 3828
*/

3829
bool
3830
sp_head::merge_table_list(THD *thd, TABLE_LIST *table, LEX *lex_for_tmp_check)
3831
{
3832 3833 3834 3835 3836 3837 3838 3839
  SP_TABLE *tab;

  if (lex_for_tmp_check->sql_command == SQLCOM_DROP_TABLE &&
      lex_for_tmp_check->drop_temporary)
    return TRUE;

  for (uint i= 0 ; i < m_sptabs.records ; i++)
  {
Konstantin Osipov's avatar
Konstantin Osipov committed
3840
    tab= (SP_TABLE*) my_hash_element(&m_sptabs, i);
3841 3842 3843
    tab->query_lock_count= 0;
  }

3844
  for (; table ; table= table->next_global)
3845
    if (!table->derived && !table->schema_table)
3846
    {
unknown's avatar
unknown committed
3847
      char tname[(NAME_LEN + 1) * 3];           // db\0table\0alias\0
3848 3849 3850 3851
      uint tlen, alen;

      tlen= table->db_length;
      memcpy(tname, table->db, tlen);
unknown's avatar
unknown committed
3852
      tname[tlen++]= '\0';
3853 3854
      memcpy(tname+tlen, table->table_name, table->table_name_length);
      tlen+= table->table_name_length;
unknown's avatar
unknown committed
3855
      tname[tlen++]= '\0';
3856 3857 3858 3859 3860
      alen= strlen(table->alias);
      memcpy(tname+tlen, table->alias, alen);
      tlen+= alen;
      tname[tlen]= '\0';

unknown's avatar
unknown committed
3861 3862 3863 3864 3865 3866 3867 3868
      /*
        Upgrade the lock type because this table list will be used
        only in pre-locked mode, in which DELAYED inserts are always
        converted to normal inserts.
      */
      if (table->lock_type == TL_WRITE_DELAYED)
        table->lock_type= TL_WRITE;

3869
      /*
3870 3871 3872
        We ignore alias when we check if table was already marked as temporary
        (and therefore should not be prelocked). Otherwise we will erroneously
        treat table with same name but with different alias as non-temporary.
3873
      */
Konstantin Osipov's avatar
Konstantin Osipov committed
3874 3875
      if ((tab= (SP_TABLE*) my_hash_search(&m_sptabs, (uchar *)tname, tlen)) ||
          ((tab= (SP_TABLE*) my_hash_search(&m_sptabs, (uchar *)tname,
3876 3877
                                        tlen - alen - 1)) &&
           tab->temp))
3878
      {
3879 3880
        if (tab->lock_type < table->lock_type)
          tab->lock_type= table->lock_type; // Use the table with the highest lock type
3881 3882 3883
        tab->query_lock_count++;
        if (tab->query_lock_count > tab->lock_count)
          tab->lock_count++;
3884
        tab->trg_event_map|= table->trg_event_map;
3885 3886 3887 3888 3889
      }
      else
      {
	if (!(tab= (SP_TABLE *)thd->calloc(sizeof(SP_TABLE))))
	  return FALSE;
3890
	if (lex_for_tmp_check->sql_command == SQLCOM_CREATE_TABLE &&
3891 3892
	    lex_for_tmp_check->query_tables == table &&
	    lex_for_tmp_check->create_info.options & HA_LEX_CREATE_TMP_TABLE)
3893
        {
3894
	  tab->temp= TRUE;
3895 3896 3897 3898 3899 3900 3901
          tab->qname.length= tlen - alen - 1;
        }
        else
          tab->qname.length= tlen;
        tab->qname.str= (char*) thd->memdup(tname, tab->qname.length + 1);
        if (!tab->qname.str)
          return FALSE;
unknown's avatar
unknown committed
3902 3903
        tab->table_name_length= table->table_name_length;
        tab->db_length= table->db_length;
3904
        tab->lock_type= table->lock_type;
3905
        tab->lock_count= tab->query_lock_count= 1;
3906
        tab->trg_event_map= table->trg_event_map;
3907
	my_hash_insert(&m_sptabs, (uchar *)tab);
3908 3909 3910 3911 3912 3913
      }
    }
  return TRUE;
}


unknown's avatar
unknown committed
3914
/**
3915
  Add tables used by routine to the table list.
3916

3917 3918
    Converts multi-set of tables used by this routine to table list and adds
    this list to the end of table list specified by 'query_tables_last_ptr'.
3919

3920 3921
    Elements of list will be allocated in PS memroot, so this list will be
    persistent between PS executions.
3922

unknown's avatar
unknown committed
3923 3924 3925 3926 3927 3928 3929 3930 3931 3932 3933
  @param[in] thd                        Thread context
  @param[in,out] query_tables_last_ptr  Pointer to the next_global member of
    last element of the list where tables
    will be added (or to its root).
  @param[in] belong_to_view             Uppermost view which uses this routine,
    0 if none.

  @retval
    TRUE    if some elements were added
  @retval
    FALSE   otherwise.
3934
*/
3935

3936 3937
bool
sp_head::add_used_tables_to_table_list(THD *thd,
3938 3939
                                       TABLE_LIST ***query_tables_last_ptr,
                                       TABLE_LIST *belong_to_view)
3940 3941
{
  uint i;
unknown's avatar
unknown committed
3942
  Query_arena *arena, backup;
3943 3944 3945 3946
  bool result= FALSE;
  DBUG_ENTER("sp_head::add_used_tables_to_table_list");

  /*
3947 3948 3949 3950 3951 3952
    Use persistent arena for table list allocation to be PS/SP friendly.
    Note that we also have to copy database/table names and alias to PS/SP
    memory since current instance of sp_head object can pass away before
    next execution of PS/SP for which tables are added to prelocking list.
    This will be fixed by introducing of proper invalidation mechanism
    once new TDC is ready.
3953
  */
unknown's avatar
unknown committed
3954
  arena= thd->activate_stmt_arena_if_needed(&backup);
3955

3956
  for (i=0 ; i < m_sptabs.records ; i++)
3957
  {
3958
    char *tab_buff, *key_buff;
unknown's avatar
unknown committed
3959
    TABLE_LIST *table;
Konstantin Osipov's avatar
Konstantin Osipov committed
3960
    SP_TABLE *stab= (SP_TABLE*) my_hash_element(&m_sptabs, i);
3961 3962 3963
    if (stab->temp)
      continue;

3964
    if (!(tab_buff= (char *)thd->calloc(ALIGN_SIZE(sizeof(TABLE_LIST)) *
3965 3966 3967
                                        stab->lock_count)) ||
        !(key_buff= (char*)thd->memdup(stab->qname.str,
                                       stab->qname.length + 1)))
3968
      DBUG_RETURN(FALSE);
3969

3970 3971 3972 3973
    for (uint j= 0; j < stab->lock_count; j++)
    {
      table= (TABLE_LIST *)tab_buff;

3974
      table->db= key_buff;
unknown's avatar
unknown committed
3975 3976 3977 3978
      table->db_length= stab->db_length;
      table->table_name= table->db + table->db_length + 1;
      table->table_name_length= stab->table_name_length;
      table->alias= table->table_name + table->table_name_length + 1;
3979
      table->lock_type= stab->lock_type;
3980 3981
      table->cacheable_table= 1;
      table->prelocking_placeholder= 1;
3982
      table->belong_to_view= belong_to_view;
3983
      table->trg_event_map= stab->trg_event_map;
3984 3985 3986 3987 3988 3989 3990 3991 3992 3993

      /* Everyting else should be zeroed */

      **query_tables_last_ptr= table;
      table->prev_global= *query_tables_last_ptr;
      *query_tables_last_ptr= &table->next_global;

      tab_buff+= ALIGN_SIZE(sizeof(TABLE_LIST));
      result= TRUE;
    }
3994
  }
3995 3996

  if (arena)
unknown's avatar
unknown committed
3997
    thd->restore_active_arena(arena, &backup);
3998 3999

  DBUG_RETURN(result);
4000 4001
}

unknown's avatar
unknown committed
4002

unknown's avatar
unknown committed
4003
/**
unknown's avatar
unknown committed
4004 4005 4006 4007
  Simple function for adding an explicetly named (systems) table to
  the global table list, e.g. "mysql", "proc".
*/

4008 4009 4010 4011 4012 4013 4014 4015 4016 4017 4018 4019 4020 4021 4022
TABLE_LIST *
sp_add_to_query_tables(THD *thd, LEX *lex,
		       const char *db, const char *name,
		       thr_lock_type locktype)
{
  TABLE_LIST *table;

  if (!(table= (TABLE_LIST *)thd->calloc(sizeof(TABLE_LIST))))
    return NULL;
  table->db_length= strlen(db);
  table->db= thd->strmake(db, table->db_length);
  table->table_name_length= strlen(name);
  table->table_name= thd->strmake(name, table->table_name_length);
  table->alias= thd->strdup(name);
  table->lock_type= locktype;
4023
  table->select_lex= lex->current_select;
4024 4025 4026 4027 4028
  table->cacheable_table= 1;
  
  lex->add_to_query_tables(table);
  return table;
}
4029