sp_head.cc 86 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
/* Copyright (C) 2002 MySQL AB

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

   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 */

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

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


34 35
#include <my_user.h>

36 37 38
Item_result
sp_map_result_type(enum enum_field_types type)
{
39
  switch (type) {
40 41 42 43 44 45 46
  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:
47 48
  case MYSQL_TYPE_NEWDECIMAL:
    return DECIMAL_RESULT;
49 50 51 52 53 54 55 56
  case MYSQL_TYPE_FLOAT:
  case MYSQL_TYPE_DOUBLE:
    return REAL_RESULT;
  default:
    return STRING_RESULT;
  }
}

57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82

Item::Type
sp_map_item_type(enum enum_field_types type)
{
  switch (type) {
  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;
  }
}


/*
  Return a string representation of the Item value.

83 84
  NOTE: If the item has a string result type, the string is escaped
  according to its character set.
85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112

  SYNOPSIS
    item    a pointer to the Item
    str     string buffer for representation of the value

  RETURN
    NULL  on error
    a pointer to valid a valid string on success
*/

static String *
sp_get_item_value(Item *item, String *str)
{
  Item_result result_type= item->result_type();

  switch (item->result_type()) {
  case REAL_RESULT:
  case INT_RESULT:
  case DECIMAL_RESULT:
    return item->val_str(str);

  case STRING_RESULT:
    {
      String *result= item->val_str(str);
      
      if (!result)
        return NULL;
      
113 114 115 116 117 118 119 120 121
      {
        char buf_holder[STRING_BUFFER_USUAL_SIZE];
        String buf(buf_holder, sizeof(buf_holder), result->charset());

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

        buf.append('_');
        buf.append(result->charset()->csname);
122 123 124
        if (result->charset()->escape_with_backslash_is_dangerous)
          buf.append(' ');
        append_query_string(result->charset(), result, &buf);
125 126 127 128
        str->copy(buf);

        return str;
      }
129 130 131 132 133 134 135 136 137
    }

  case ROW_RESULT:
  default:
    return NULL;
  }
}


138
/*
139 140 141 142 143 144 145 146 147 148 149 150 151
  SYNOPSIS
    sp_get_flags_for_command()

  DESCRIPTION
    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.
*/

uint
sp_get_flags_for_command(LEX *lex)
152
{
153 154 155 156 157 158 159 160 161 162
  uint flags;

  switch (lex->sql_command) {
  case SQLCOM_SELECT:
    if (lex->result)
    {
      flags= 0;                      /* This is a SELECT with INTO clause */
      break;
    }
    /* fallthrough */
163
  case SQLCOM_ANALYZE:
164 165 166
  case SQLCOM_OPTIMIZE:
  case SQLCOM_PRELOAD_KEYS:
  case SQLCOM_ASSIGN_TO_KEYCACHE:
167
  case SQLCOM_CHECKSUM:
168
  case SQLCOM_CHECK:
169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186
  case SQLCOM_HA_READ:
  case SQLCOM_SHOW_BINLOGS:
  case SQLCOM_SHOW_BINLOG_EVENTS:
  case SQLCOM_SHOW_CHARSETS:
  case SQLCOM_SHOW_COLLATIONS:
  case SQLCOM_SHOW_COLUMN_TYPES:
  case SQLCOM_SHOW_CREATE:
  case SQLCOM_SHOW_CREATE_DB:
  case SQLCOM_SHOW_CREATE_FUNC:
  case SQLCOM_SHOW_CREATE_PROC:
  case SQLCOM_SHOW_DATABASES:
  case SQLCOM_SHOW_ERRORS:
  case SQLCOM_SHOW_FIELDS:
  case SQLCOM_SHOW_GRANTS:
  case SQLCOM_SHOW_INNODB_STATUS:
  case SQLCOM_SHOW_KEYS:
  case SQLCOM_SHOW_LOGS:
  case SQLCOM_SHOW_MASTER_STAT:
187
  case SQLCOM_SHOW_MUTEX_STATUS:
188 189 190 191 192 193 194 195 196 197 198 199 200
  case SQLCOM_SHOW_NEW_MASTER:
  case SQLCOM_SHOW_OPEN_TABLES:
  case SQLCOM_SHOW_PRIVILEGES:
  case SQLCOM_SHOW_PROCESSLIST:
  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:
  case SQLCOM_SHOW_VARIABLES:
  case SQLCOM_SHOW_WARNS:
pem@mysql.com's avatar
pem@mysql.com committed
201 202
  case SQLCOM_SHOW_PROC_CODE:
  case SQLCOM_SHOW_FUNC_CODE:
203 204 205
  case SQLCOM_REPAIR:
  case SQLCOM_BACKUP_TABLE:
  case SQLCOM_RESTORE_TABLE:
206 207 208 209 210 211 212 213 214 215 216 217 218 219 220
    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;
221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259
  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;
  case SQLCOM_CREATE_INDEX:
  case SQLCOM_CREATE_DB:
  case SQLCOM_CREATE_VIEW:
  case SQLCOM_CREATE_TRIGGER:
  case SQLCOM_CREATE_USER:
  case SQLCOM_ALTER_TABLE:
  case SQLCOM_BEGIN:
  case SQLCOM_RENAME_TABLE:
  case SQLCOM_RENAME_USER:
  case SQLCOM_DROP_INDEX:
  case SQLCOM_DROP_DB:
  case SQLCOM_DROP_USER:
  case SQLCOM_DROP_VIEW:
  case SQLCOM_DROP_TRIGGER:
  case SQLCOM_TRUNCATE:
  case SQLCOM_COMMIT:
  case SQLCOM_ROLLBACK:
  case SQLCOM_LOAD_MASTER_DATA:
  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:
    flags= sp_head::HAS_COMMIT_OR_ROLLBACK;
    break;
260
  default:
261 262
    flags= 0;
    break;
263
  }
264
  return flags;
265 266
}

267 268

/*
269
  Prepare an Item for evaluation (call of fix_fields).
270 271 272 273 274 275 276 277 278 279 280

  SYNOPSIS
    sp_prepare_func_item()
    thd       thread handler
    it_addr   pointer on item refernce

  RETURN
    NULL  error
    prepared item
*/

281
Item *
282 283 284
sp_prepare_func_item(THD* thd, Item **it_addr)
{
  DBUG_ENTER("sp_prepare_func_item");
285
  it_addr= (*it_addr)->this_item_addr(thd, it_addr);
286

287 288 289
  if (!(*it_addr)->fixed &&
      ((*it_addr)->fix_fields(thd, it_addr) ||
       (*it_addr)->check_cols(1)))
290 291 292 293 294 295 296 297
  {
    DBUG_PRINT("info", ("fix_fields() failed"));
    DBUG_RETURN(NULL);
  }
  DBUG_RETURN(*it_addr);
}


298
/*
299
  Evaluate an expression and store the result in the field.
300 301

  SYNOPSIS
302 303 304 305
    sp_eval_expr()
      thd                   - current thread object
      expr_item             - the root item of the expression
      result_field          - the field to store the result
306 307

  RETURN VALUES
308 309
    FALSE  on success
    TRUE   on error
310
*/
311

312 313
bool
sp_eval_expr(THD *thd, Field *result_field, Item *expr_item)
314
{
315
  DBUG_ENTER("sp_eval_expr");
316

317 318
  if (!(expr_item= sp_prepare_func_item(thd, &expr_item)))
    DBUG_RETURN(TRUE);
319

320
  bool err_status= FALSE;
321

322 323 324
  /*
    Set THD flags to emit warnings/errors in case of overflow/type errors
    during saving the item into the field.
325

326 327 328 329 330 331
    Save original values and restore them after save.
  */
  
  enum_check_fields save_count_cuted_fields= thd->count_cuted_fields;
  bool save_abort_on_warning= thd->abort_on_warning;
  bool save_no_trans_update= thd->no_trans_update;
332

333 334 335 336 337
  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);
  thd->no_trans_update= 0;
338

339
  /* Save the value in the field. Convert the value if needed. */
340

341
  expr_item->save_in_field(result_field, 0);
342

343 344 345
  thd->count_cuted_fields= save_count_cuted_fields;
  thd->abort_on_warning= save_abort_on_warning;
  thd->no_trans_update= save_no_trans_update;
346

347
  if (thd->net.report_error)
348
  {
349 350
    /* Return error status if something went wrong. */
    err_status= TRUE;
351
  }
352 353

  DBUG_RETURN(err_status);
354 355
}

356 357 358 359 360 361 362 363 364 365

/*
 *
 *  sp_name
 *
 */

void
sp_name::init_qname(THD *thd)
{
366 367 368 369 370
  m_sroutines_key.length=  m_db.length + m_name.length + 2;
  if (!(m_sroutines_key.str= thd->alloc(m_sroutines_key.length + 1)))
    return;
  m_qname.length= m_sroutines_key.length - 1;
  m_qname.str= m_sroutines_key.str + 1;
371
  sprintf(m_qname.str, "%.*s.%.*s",
372 373 374 375
	  m_db.length, (m_db.length ? m_db.str : ""),
	  m_name.length, m_name.str);
}

376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394
sp_name *
sp_name_current_db_new(THD *thd, LEX_STRING name)
{
  sp_name *qname;

  if (! thd->db)
    qname= new sp_name(name);
  else
  {
    LEX_STRING db;

    db.length= strlen(thd->db);
    db.str= thd->strmake(thd->db, db.length);
    qname= new sp_name(db, name);
  }
  qname->init_qname(thd);
  return qname;
}

395
/*
396 397 398 399 400 401 402 403 404 405
  Check that the name 'ident' is ok. It's assumed to be an 'ident'
  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().
 
  RETURN
   TRUE  - bad name
   FALSE - name is ok
*/
406 407

bool
408
check_routine_name(LEX_STRING ident)
409 410 411
{
  return (!ident.str || !ident.str[0] || ident.str[ident.length-1] == ' ');
}
412

413 414 415 416 417 418 419 420 421
/* ------------------------------------------------------------------ */


/*
 *
 *  sp_head
 *
 */

422 423 424 425 426 427 428 429
void *
sp_head::operator new(size_t size)
{
  DBUG_ENTER("sp_head::operator new");
  MEM_ROOT own_root;
  sp_head *sp;

  init_alloc_root(&own_root, MEM_ROOT_BLOCK_SIZE, MEM_ROOT_PREALLOC);
monty@mysql.com's avatar
monty@mysql.com committed
430 431
  sp= (sp_head *) alloc_root(&own_root, size);
  sp->main_mem_root= own_root;
432
  DBUG_PRINT("info", ("mem_root 0x%lx", (ulong) &sp->mem_root));
433 434 435 436 437 438 439 440
  DBUG_RETURN(sp);
}

void 
sp_head::operator delete(void *ptr, size_t size)
{
  DBUG_ENTER("sp_head::operator delete");
  MEM_ROOT own_root;
monty@mysql.com's avatar
monty@mysql.com committed
441
  sp_head *sp= (sp_head *) ptr;
442

monty@mysql.com's avatar
monty@mysql.com committed
443 444
  /* Make a copy of main_mem_root as free_root will free the sp */
  own_root= sp->main_mem_root;
445 446
  DBUG_PRINT("info", ("mem_root 0x%lx moved to 0x%lx",
                      (ulong) &sp->mem_root, (ulong) &own_root));
447 448 449 450 451
  free_root(&own_root, MYF(0));

  DBUG_VOID_RETURN;
}

452

453
sp_head::sp_head()
454
  :Query_arena(&main_mem_root, INITIALIZED_FOR_SP),
455
   m_flags(0), m_recursion_level(0), m_next_cached_sp(0),
456 457
   m_first_instance(this), m_first_free_instance(this), m_last_cached_sp(this),
   m_cont_level(0)
458
{
459 460
  m_return_field_def.charset = NULL;

461 462
  extern byte *
    sp_table_key(const byte *ptr, uint *plen, my_bool first);
463
  DBUG_ENTER("sp_head::sp_head");
464 465

  m_backpatch.empty();
466
  m_cont_backpatch.empty();
467
  m_lex.empty();
468
  hash_init(&m_sptabs, system_charset_info, 0, 0, 0, sp_table_key, 0, 0);
469
  hash_init(&m_sroutines, system_charset_info, 0, 0, 0, sp_sroutine_key, 0, 0);
470 471 472
  DBUG_VOID_RETURN;
}

473

474
void
475
sp_head::init(LEX *lex)
476 477
{
  DBUG_ENTER("sp_head::init");
478

479
  lex->spcont= m_pcont= new sp_pcontext(NULL);
480

481 482 483 484 485
  /*
    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();
486
  my_init_dynamic_array(&m_instr, sizeof(sp_instr *), 16, 8);
487 488
  m_param_begin= m_param_end= m_body_begin= 0;
  m_qname.str= m_db.str= m_name.str= m_params.str= 
489 490
    m_body.str= m_defstr.str= 0;
  m_qname.length= m_db.length= m_name.length= m_params.length=
491
    m_body.length= m_defstr.length= 0;
492
  m_return_field_def.charset= NULL;
493 494 495 496
  DBUG_VOID_RETURN;
}

void
497
sp_head::init_strings(THD *thd, LEX *lex, sp_name *name)
498 499
{
  DBUG_ENTER("sp_head::init_strings");
500
  uchar *endp;                  /* Used to trim the end */
501
  /* During parsing, we must use thd->mem_root */
monty@mysql.com's avatar
monty@mysql.com committed
502
  MEM_ROOT *root= thd->mem_root;
503

504
  /* We have to copy strings to get them into the right memroot */
505 506
  if (name)
  {
507
    m_db.length= name->m_db.length;
508
    if (name->m_db.length == 0)
509
      m_db.str= NULL;
510 511 512 513 514 515 516 517 518 519
    else
      m_db.str= strmake_root(root, name->m_db.str, name->m_db.length);
    m_name.length= name->m_name.length;
    m_name.str= strmake_root(root, name->m_name.str, name->m_name.length);

    if (name->m_qname.length == 0)
      name->init_qname(thd);
    m_qname.length= name->m_qname.length;
    m_qname.str= strmake_root(root, name->m_qname.str, m_qname.length);
  }
520
  else if (thd->db)
521
  {
522
    m_db.length= thd->db_length;
523
    m_db.str= strmake_root(root, thd->db, m_db.length);
524
  }
525

526
  if (m_param_begin && m_param_end)
527
  {
528 529 530
    m_params.length= m_param_end - m_param_begin;
    m_params.str= strmake_root(root,
                               (char *)m_param_begin, m_params.length);
531
  }
532

533 534 535 536 537 538 539 540 541 542 543 544
  /* If ptr has overrun end_of_query then end_of_query is the end */
  endp= (lex->ptr > lex->end_of_query ? lex->end_of_query : lex->ptr);
  /*
    Trim "garbage" at the end. This is sometimes needed with the
    "/ * ! VERSION... * /" wrapper in dump files.
  */
  while (m_body_begin < endp &&
         (endp[-1] <= ' ' || endp[-1] == '*' ||
          endp[-1] == '/' || endp[-1] == ';'))
    endp-= 1;

  m_body.length= endp - m_body_begin;
545
  m_body.str= strmake_root(root, (char *)m_body_begin, m_body.length);
546
  m_defstr.length= endp - lex->buf;
547
  m_defstr.str= strmake_root(root, (char *)lex->buf, m_defstr.length);
548
  DBUG_VOID_RETURN;
549 550
}

551 552 553

static TYPELIB *
create_typelib(MEM_ROOT *mem_root, create_field *field_def, List<String> *src)
554 555
{
  TYPELIB *result= NULL;
556 557
  CHARSET_INFO *cs= field_def->charset;
  DBUG_ENTER("create_typelib");
558 559 560 561 562 563
  if (src->elements)
  {
    result= (TYPELIB*) alloc_root(mem_root, sizeof(TYPELIB));
    result->count= src->elements;
    result->name= "";
    if (!(result->type_names=(const char **)
564
          alloc_root(mem_root,(sizeof(char *)+sizeof(int))*(result->count+1))))
565
      return 0;
566
    result->type_lengths= (unsigned int *)(result->type_names + result->count+1);
567
    List_iterator<String> it(*src);
568 569
    String conv;
    for (uint i=0; i < result->count; i++)
570
    {
571 572 573 574
      uint32 dummy;
      uint length;
      String *tmp= it++;

575 576 577 578 579
      if (String::needs_conversion(tmp->length(), tmp->charset(),
      				   cs, &dummy))
      {
        uint cnv_errs;
        conv.copy(tmp->ptr(), tmp->length(), tmp->charset(), cs, &cnv_errs);
580 581 582 583

        length= conv.length();
        result->type_names[i]= (char*) strmake_root(mem_root, conv.ptr(),
                                                    length);
584
      }
585 586 587 588
      else
      {
        length= tmp->length();
        result->type_names[i]= strmake_root(mem_root, tmp->ptr(), length);
589
      }
590 591

      // Strip trailing spaces.
592 593 594
      length= cs->cset->lengthsp(cs, result->type_names[i], length);
      result->type_lengths[i]= length;
      ((uchar *)result->type_names[i])[length]= '\0';
595
    }
596
    result->type_names[result->count]= 0;
597
    result->type_lengths[result->count]= 0;
598 599 600 601
  }
  return result;
}

602

603 604 605
int
sp_head::create(THD *thd)
{
606
  DBUG_ENTER("sp_head::create");
607 608
  int ret;

609 610
  DBUG_PRINT("info", ("type: %d name: %s params: %s body: %s",
		      m_type, m_name.str, m_params.str, m_body.str));
611

612
#ifndef DBUG_OFF
613
  optimize();
614
  {
615 616 617 618 619 620
    String s;
    sp_instr *i;
    uint ip= 0;
    while ((i = get_instr(ip)))
    {
      char buf[8];
621

622 623 624 625 626 627 628 629
      sprintf(buf, "%4u: ", ip);
      s.append(buf);
      i->print(&s);
      s.append('\n');
      ip+= 1;
    }
    s.append('\0');
    DBUG_PRINT("info", ("Code %s\n%s", m_qname.str, s.ptr()));
630 631 632
  }
#endif

633
  if (m_type == TYPE_ENUM_FUNCTION)
634
    ret= sp_create_function(thd, this);
635
  else
636
    ret= sp_create_procedure(thd, this);
637

638
  DBUG_RETURN(ret);
639 640
}

641 642 643
sp_head::~sp_head()
{
  destroy();
644
  delete m_next_cached_sp;
645 646 647 648
  if (m_thd)
    restore_thd_mem_root(m_thd);
}

649 650 651
void
sp_head::destroy()
{
652 653
  sp_instr *i;
  LEX *lex;
654 655
  DBUG_ENTER("sp_head::destroy");
  DBUG_PRINT("info", ("name: %s", m_name.str));
656 657 658

  for (uint ip = 0 ; (i = get_instr(ip)) ; ip++)
    delete i;
659 660
  delete_dynamic(&m_instr);
  m_pcont->destroy();
661
  free_items();
662 663 664 665 666 667 668 669 670 671

  /*
    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);
672 673
  while ((lex= (LEX *)m_lex.pop()))
  {
674
    lex_end(m_thd->lex);
675 676
    delete m_thd->lex;
    m_thd->lex= lex;
677
  }
678

679
  hash_free(&m_sptabs);
680
  hash_free(&m_sroutines);
681
  DBUG_VOID_RETURN;
682
}
683

684

685
/*
686 687 688 689
  This is only used for result fields from functions (both during
  fix_length_and_dec() and evaluation).
*/

690
Field *
691 692
sp_head::create_result_field(uint field_max_length, const char *field_name,
                             TABLE *table)
693
{
694
  uint field_length;
695
  Field *field;
696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714

  DBUG_ENTER("sp_head::create_result_field");

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

  field= ::make_field((char*) 0,                    /* field ptr */
                      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,
                      field_name ? field_name : (const char *) m_name.str,
                      table);
  
715 716 717
  DBUG_RETURN(field);
}

718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739

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


/*
  StoredRoutinesBinlogging
  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).
740

741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757
  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
758 759
     function execution (grep for start_union_events and stop_union_events)

760
   If the answers are No and Yes, we write the function call into the binary
761
   log as "SELECT spfunc(<param1value>, <param2value>, ...)".
762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786
  
  
  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. 

  Fo SPs, this has the following implications:
  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)
787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805
*/


/*
  Replace thd->query{_length} with a string that one can write to the binlog.
 
  SYNOPSIS
    subst_spvars()
      thd        Current thread. 
      instr      Instruction (we look for Item_splocal instances in
                 instr->free_list)
      query_str  Original query string
     
  DESCRIPTION

  The binlog-suitable string is produced by replacing references to SP local 
  variables with NAME_CONST('sp_var_name', value) calls.
 
  RETURN
806 807 808 809
    FALSE  on success
           thd->query{_length} either has been appropriately replaced or there
           is no need for replacements.
    TRUE   out of memory error.
810 811
*/

812 813
static bool
subst_spvars(THD *thd, sp_instr *instr, LEX_STRING *query_str)
814 815 816 817 818
{
  DBUG_ENTER("subst_spvars");
  if (thd->prelocked_mode == NON_PRELOCKED && mysql_bin_log.is_open())
  {
    Dynamic_array<Item_splocal*> sp_vars_uses;
819 820 821
    char *pbuf, *cur, buffer[512];
    String qbuf(buffer, sizeof(buffer), &my_charset_bin);
    int prev_pos, res;
822

823
    /* Find all instances of Item_splocal used in this statement */
824 825
    for (Item *item= instr->free_list; item; item= item->next)
    {
826 827 828 829 830 831
      if (item->is_splocal())
      {
        Item_splocal *item_spl= (Item_splocal*)item;
        if (item_spl->pos_in_query)
          sp_vars_uses.append(item_spl);
      }
832 833
    }
    if (!sp_vars_uses.elements())
834
      DBUG_RETURN(FALSE);
835 836 837 838 839 840 841 842 843
      
    /* Sort SP var refs by their occurences in the query */
    sp_vars_uses.sort(cmp_splocal_locations);

    /* 
      Construct a statement string where SP local var refs are replaced
      with "NAME_CONST(name, value)"
    */
    qbuf.length(0);
844 845
    cur= query_str->str;
    prev_pos= res= 0;
846 847 848
    for (Item_splocal **splocal= sp_vars_uses.front(); 
         splocal < sp_vars_uses.back(); splocal++)
    {
849
      Item *val;
850 851 852 853 854 855

      char str_buffer[STRING_BUFFER_USUAL_SIZE];
      String str_value_holder(str_buffer, sizeof(str_buffer),
                              &my_charset_latin1);
      String *str_value;
      
856
      /* append the text between sp ref occurences */
857
      res|= qbuf.append(cur + prev_pos, (*splocal)->pos_in_query - prev_pos);
858 859 860
      prev_pos= (*splocal)->pos_in_query + (*splocal)->m_name.length;
      
      /* append the spvar substitute */
861
      res|= qbuf.append(STRING_WITH_LEN(" NAME_CONST('"));
862
      res|= qbuf.append((*splocal)->m_name.str, (*splocal)->m_name.length);
863
      res|= qbuf.append(STRING_WITH_LEN("',"));
864 865 866 867 868
      res|= (*splocal)->fix_fields(thd, (Item **) splocal);

      if (res)
        break;

869
      val= (*splocal)->this_item();
870
      DBUG_PRINT("info", ("print %p", val));
871 872 873 874 875
      str_value= sp_get_item_value(val, &str_value_holder);
      if (str_value)
        res|= qbuf.append(*str_value);
      else
        res|= qbuf.append(STRING_WITH_LEN("NULL"));
876
      res|= qbuf.append(')');
877 878 879
      if (res)
        break;
    }
880
    res|= qbuf.append(cur + prev_pos, query_str->length - prev_pos);
881
    if (res)
882
      DBUG_RETURN(TRUE);
883

884
    if (!(pbuf= thd->strmake(qbuf.ptr(), qbuf.length())))
885
      DBUG_RETURN(TRUE);
886 887 888 889

    thd->query= pbuf;
    thd->query_length= qbuf.length();
  }
890
  DBUG_RETURN(FALSE);
891 892 893
}


894 895 896 897 898
/*
  Return appropriate error about recursion limit reaching

  SYNOPSIS
    sp_head::recursion_level_error()
899
    thd		Thread handle
900 901 902 903 904 905

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

906
void sp_head::recursion_level_error(THD *thd)
907 908 909 910 911
{
  if (m_type == TYPE_ENUM_PROCEDURE)
  {
    my_error(ER_SP_RECURSION_LIMIT, MYF(0),
             thd->variables.max_sp_recursion_depth,
912
             m_name.str);
913 914 915 916 917 918
  }
  else
    my_error(ER_SP_NO_RECURSION, MYF(0));
}


919 920 921 922 923
/*
  Execute the routine. The main instruction jump loop is there 
  Assume the parameters already set.
  
  RETURN
924 925
    FALSE  on success
    TRUE   on error
926 927 928

*/

929 930
bool
sp_head::execute(THD *thd)
931
{
932
  DBUG_ENTER("sp_head::execute");
933
  char olddb[128];
934
  bool dbchanged;
935
  sp_rcontext *ctx;
936
  bool err_status= FALSE;
937
  uint ip= 0;
938
  ulong save_sql_mode;
serg@serg.mylan's avatar
serg@serg.mylan committed
939
  Query_arena *old_arena;
940 941 942
  /* per-instruction arena */
  MEM_ROOT execute_mem_root;
  Query_arena execute_arena(&execute_mem_root, INITIALIZED_FOR_SP),
konstantin@mysql.com's avatar
konstantin@mysql.com committed
943
              backup_arena;
944
  query_id_t old_query_id;
945 946 947 948
  TABLE *old_derived_tables;
  LEX *old_lex;
  Item_change_list old_change_list;
  String old_packet;
949

950
  /* Use some extra margin for possible SP recursion and functions */
951
  if (check_stack_overrun(thd, 8 * STACK_MIN_SIZE, (char*)&old_packet))
952
    DBUG_RETURN(TRUE);
953

954 955 956 957
  /* init per-instruction memroot */
  init_alloc_root(&execute_mem_root, MEM_ROOT_BLOCK_SIZE, 0);

  DBUG_ASSERT(!(m_flags & IS_INVOKED));
958
  m_flags|= IS_INVOKED;
959
  m_first_instance->m_first_free_instance= m_next_cached_sp;
960 961 962 963 964 965 966 967 968
  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));
  }
969 970 971 972 973 974 975 976 977
  /*
    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));
978

979
  dbchanged= FALSE;
980
  if (m_db.length &&
981 982
      (err_status= sp_use_new_db(thd, m_db.str, olddb, sizeof(olddb), 0,
                                 &dbchanged)))
983
    goto done;
984

985
  if ((ctx= thd->spcont))
986
    ctx->clear_handler();
987
  thd->query_error= 0;
konstantin@mysql.com's avatar
konstantin@mysql.com committed
988
  old_arena= thd->stmt_arena;
989

990 991 992 993 994 995 996
  /*
    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;
997 998
  save_sql_mode= thd->variables.sql_mode;
  thd->variables.sql_mode= m_sql_mode;
999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019
  /*
    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);

1020 1021 1022 1023
  /*
    Switch to per-instruction arena here. We can do it since we cleanup
    arena after every instruction.
  */
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1024
  thd->set_n_backup_active_arena(&execute_arena, &backup_arena);
1025 1026 1027 1028 1029

  /*
    Save callers arena in order to store instruction results and out
    parameters in it later during sp_eval_func_item()
  */
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1030
  thd->spcont->callers_arena= &backup_arena;
1031

1032 1033 1034
  do
  {
    sp_instr *i;
1035
    uint hip;			// Handler ip
1036 1037 1038 1039 1040

    i = get_instr(ip);	// Returns NULL when we're done.
    if (i == NULL)
      break;
    DBUG_PRINT("execute", ("Instruction %u", ip));
1041 1042 1043
    /* Don't change NOW() in FUNCTION or TRIGGER */
    if (!thd->in_sub_stmt)
      thd->set_time();		// Make current_time() et al work
1044
    
1045
    /*
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1046
      We have to set thd->stmt_arena before executing the instruction
1047 1048 1049 1050
      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).
    */
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1051
    thd->stmt_arena= i;
1052
    
1053 1054 1055 1056 1057
    /* 
      Will write this SP statement into binlog separately 
      (TODO: consider changing the condition to "not inside event union")
    */
    if (thd->prelocked_mode == NON_PRELOCKED)
1058 1059
      thd->user_var_events_alloc= thd->mem_root;
    
1060
    err_status= i->execute(thd, &ip);
1061

1062
    /*
1063 1064 1065
      If this SP instruction have sent eof, it has caused no_send_error to be
      set. Clear it back to allow the next instruction to send error. (multi-
      statement execution code clears no_send_error between statements too)
1066 1067
    */
    thd->net.no_send_error= 0;
1068 1069
    if (i->free_list)
      cleanup_items(i->free_list);
1070
    i->state= Query_arena::EXECUTED;
1071 1072 1073 1074 1075 1076 1077 1078 1079 1080
    
    /* 
      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
    }
1081

1082
    /* we should cleanup free_list and memroot, used by instruction */
1083
    thd->cleanup_after_query();
1084
    free_root(&execute_mem_root, MYF(0));    
1085

1086 1087
    /*
      Check if an exception has occurred and a handler has been found
1088 1089 1090 1091
      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").
1092
    */
1093
    if (ctx)
1094 1095 1096
    {
      uint hf;

1097
      switch (ctx->found_handler(&hip, &hf)) {
1098 1099 1100
      case SP_HANDLER_NONE:
	break;
      case SP_HANDLER_CONTINUE:
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1101 1102
        thd->restore_active_arena(&execute_arena, &backup_arena);
        thd->set_n_backup_active_arena(&execute_arena, &backup_arena);
1103
        ctx->push_hstack(ip);
1104
        // Fall through
1105 1106
      default:
	ip= hip;
1107
	err_status= FALSE;
1108
	ctx->clear_handler();
1109
	ctx->enter_handler(hip);
1110
        thd->clear_error();
1111
	thd->killed= THD::NOT_KILLED;
1112 1113 1114
	continue;
      }
    }
1115
  } while (!err_status && !thd->killed);
1116

konstantin@mysql.com's avatar
konstantin@mysql.com committed
1117
  thd->restore_active_arena(&execute_arena, &backup_arena);
1118 1119


1120 1121 1122 1123 1124 1125 1126 1127 1128 1129
  /* 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;
1130
  thd->variables.sql_mode= save_sql_mode;
1131

konstantin@mysql.com's avatar
konstantin@mysql.com committed
1132
  thd->stmt_arena= old_arena;
1133
  state= EXECUTED;
1134

1135
 done:
1136
  DBUG_PRINT("info", ("err_status: %d  killed: %d  query_error: %d",
1137
		      err_status, thd->killed, thd->query_error));
1138

1139
  if (thd->killed)
1140
    err_status= TRUE;
1141 1142 1143 1144
  /*
    If the DB has changed, the pointer has changed too, but the
    original thd->db will then have been freed
  */
1145
  if (dbchanged)
1146
  {
1147 1148 1149 1150
    /*
      No access check when changing back to where we came from.
      (It would generate an error from mysql_change_db() when olddb=="")
    */
1151
    if (! thd->killed)
1152
      err_status|= mysql_change_db(thd, olddb, 1);
1153
  }
1154
  m_flags&= ~IS_INVOKED;
1155 1156 1157 1158 1159
  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));
1160 1161 1162 1163 1164 1165 1166 1167 1168
  /*
    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
1169
    should be on 1 more then recursion level of this instance.
1170 1171 1172 1173 1174 1175 1176 1177 1178
  */
  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;
1179
  DBUG_RETURN(err_status);
1180 1181 1182
}


1183 1184 1185 1186 1187 1188 1189 1190
/*
  Execute a function:
   - evaluate parameters
   - call sp_head::execute
   - evaluate the return value

  SYNOPSIS
    sp_head::execute_function()
1191 1192 1193 1194 1195 1196
      thd               Thread handle
      argp              Passed arguments (these are items from containing
                        statement?)
      argcount          Number of passed arguments. We need to check if this is
                        correct.
      return_value_fld  Save result here.
1197 1198
   
  RETURN
1199 1200
    FALSE  on success
    TRUE   on error
1201 1202
*/

1203 1204 1205
bool
sp_head::execute_function(THD *thd, Item **argp, uint argcount,
                          Field *return_value_fld)
1206
{
1207
  Item_cache **param_values;
1208 1209
  ulonglong binlog_save_options;
  bool need_binlog_call;
1210
  uint params;
1211 1212
  sp_rcontext *octx = thd->spcont;
  sp_rcontext *nctx = NULL;
1213 1214 1215 1216 1217
  bool err_status= FALSE;

  DBUG_ENTER("sp_head::execute_function");
  DBUG_PRINT("info", ("function %s", m_name.str));

1218
  params = m_pcont->context_var_count();
1219 1220 1221 1222 1223 1224 1225

  /*
    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.
  */
1226

1227 1228
  if (argcount != params)
  {
1229
    /*
1230
      Need to use my_error here, or it will not terminate the
1231 1232
      invoking query properly.
    */
1233
    my_error(ER_SP_WRONG_NO_OF_ARGS, MYF(0),
1234
             "FUNCTION", m_qname.str, params, argcount);
1235
    DBUG_RETURN(TRUE);
1236 1237
  }

1238 1239 1240 1241
  /* Allocate param_values to be used for dumping the call into binlog. */

  if (!(param_values= (Item_cache**)thd->alloc(sizeof(Item_cache*)*argcount)))
    DBUG_RETURN(TRUE);
1242

1243
  // QQ Should have some error checking here? (types, etc...)
1244 1245 1246 1247 1248 1249 1250 1251

  if (!(nctx= new sp_rcontext(m_pcont, return_value_fld, octx)) ||
      nctx->init(thd))
  {
    delete nctx; /* Delete nctx if it was init() that failed. */
    DBUG_RETURN(TRUE);
  }

1252
#ifndef DBUG_OFF
1253
  nctx->sp= this;
1254
#endif
1255 1256 1257

  /* Pass arguments. */

1258
  {
1259 1260 1261 1262 1263 1264 1265 1266 1267
    uint i;
    
    for (i= 0 ; i < argcount ; i++)
    {
      if (!argp[i]->fixed && argp[i]->fix_fields(thd, &argp[i]))
      {
        err_status= TRUE;
        break;
      }
1268

1269 1270
      param_values[i]= Item_cache::get_cache(argp[i]->result_type());
      param_values[i]->store(argp[i]);
1271

1272 1273 1274 1275 1276 1277 1278
      if (nctx->set_variable(thd, i, param_values[i]))
      {
        err_status= TRUE;
        break;
      }
    }
  }
1279

1280 1281 1282 1283 1284
  if (err_status)
  {
    delete nctx;
    DBUG_RETURN(TRUE);
  }
1285

1286 1287
  thd->spcont= nctx;

1288 1289 1290
  binlog_save_options= thd->options;
  need_binlog_call= mysql_bin_log.is_open() && (thd->options & OPTION_BIN_LOG);
  if (need_binlog_call)
1291 1292
  {
    reset_dynamic(&thd->user_var_events);
1293
    mysql_bin_log.start_union_events(thd);
1294
  }
1295 1296
    
  thd->options&= ~OPTION_BIN_LOG;
1297
  err_status= execute(thd);
1298 1299 1300 1301 1302
  thd->options= binlog_save_options;
  
  if (need_binlog_call)
    mysql_bin_log.stop_union_events(thd);

1303
  if (need_binlog_call && thd->binlog_evt_union.unioned_events)
1304
  {
1305
    char buf[256];
1306 1307
    String bufstr(buf, sizeof(buf), &my_charset_bin);
    bufstr.length(0);
1308
    bufstr.append(STRING_WITH_LEN("SELECT "));
1309 1310 1311 1312
    append_identifier(thd, &bufstr, m_name.str, m_name.length);
    bufstr.append('(');
    for (uint i=0; i < argcount; i++)
    {
1313 1314 1315
      String str_value_holder;
      String *str_value;

1316 1317
      if (i)
        bufstr.append(',');
1318 1319 1320 1321 1322 1323 1324

      str_value= sp_get_item_value(param_values[i], &str_value_holder);

      if (str_value)
        bufstr.append(*str_value);
      else
        bufstr.append(STRING_WITH_LEN("NULL"));
1325 1326 1327
    }
    bufstr.append(')');
    
1328 1329 1330 1331
    Query_log_event qinfo(thd, bufstr.ptr(), bufstr.length(),
                          thd->binlog_evt_union.unioned_events_trans, FALSE);
    if (mysql_bin_log.write(&qinfo) && 
        thd->binlog_evt_union.unioned_events_trans)
1332
    {
1333 1334 1335
      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");
1336
    }
1337
    reset_dynamic(&thd->user_var_events);
1338
  }
1339

1340
  if (m_type == TYPE_ENUM_FUNCTION && !err_status)
1341
  {
1342
    /* We need result only in function but not in trigger */
1343

1344
    if (!nctx->is_return_value_set())
1345
    {
1346
      my_error(ER_SP_NORETURNEND, MYF(0), m_name.str);
1347
      err_status= TRUE;
1348 1349
    }
  }
1350

1351
  nctx->pop_all_cursors();	// To avoid memory leaks after an error
1352
  delete nctx;
1353
  thd->spcont= octx;
1354

1355
  DBUG_RETURN(err_status);
1356 1357
}

1358 1359

static Item_func_get_user_var *item_is_user_var(Item *it)
1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370
{
  if (it->type() == Item::FUNC_ITEM)
  {
    Item_func *fi= static_cast<Item_func*>(it);

    if (fi->functype() == Item_func::GUSERVAR_FUNC)
      return static_cast<Item_func_get_user_var*>(fi);
  }
  return NULL;
}

1371

1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386
/*
  Execute a procedure. 
  SYNOPSIS
    sp_head::execute_procedure()
      thd    Thread handle
      args   List of values passed as arguments.
      
  DESCRIPTION

  The function does the following steps:
   - Set all parameters 
   - call sp_head::execute
   - copy back values of INOUT and OUT parameters

  RETURN
1387 1388
    FALSE  on success
    TRUE   on error
1389 1390
*/

1391 1392
bool
sp_head::execute_procedure(THD *thd, List<Item> *args)
1393
{
1394
  bool err_status= FALSE;
1395
  uint params = m_pcont->context_var_count();
1396
  sp_rcontext *save_spcont, *octx;
1397
  sp_rcontext *nctx = NULL;
1398 1399
  DBUG_ENTER("sp_head::execute_procedure");
  DBUG_PRINT("info", ("procedure %s", m_name.str));
1400

1401 1402
  if (args->elements != params)
  {
1403
    my_error(ER_SP_WRONG_NO_OF_ARGS, MYF(0), "PROCEDURE",
1404
             m_qname.str, params, args->elements);
1405
    DBUG_RETURN(TRUE);
1406 1407
  }

1408
  save_spcont= octx= thd->spcont;
1409 1410
  if (! octx)
  {				// Create a temporary old context
1411 1412 1413 1414 1415 1416 1417
    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);
    }
    
1418
#ifndef DBUG_OFF
1419
    octx->sp= 0;
1420
#endif
1421 1422 1423 1424 1425 1426
    thd->spcont= octx;

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

1427 1428
  if (!(nctx= new sp_rcontext(m_pcont, NULL, octx)) ||
      nctx->init(thd))
1429
  {
1430
    delete nctx; /* Delete nctx if it was init() that failed. */
1431
    thd->spcont= save_spcont;
1432
    DBUG_RETURN(TRUE);
1433
  }
1434
#ifndef DBUG_OFF
1435
  nctx->sp= this;
1436
#endif
1437

1438
  if (params > 0)
1439
  {
1440
    List_iterator<Item> it_args(*args);
1441

1442
    DBUG_PRINT("info",(" %.*s: eval args", m_name.length, m_name.str));
1443 1444

    for (uint i= 0 ; i < params ; i++)
1445
    {
1446
      Item *arg_item= it_args++;
1447
      sp_variable_t *spvar= m_pcont->find_variable(i);
1448

1449 1450 1451
      if (!arg_item)
        break;

1452
      if (!spvar)
1453 1454
        continue;

1455
      if (spvar->mode != sp_param_in)
1456
      {
1457 1458 1459 1460 1461 1462 1463 1464
        if (!arg_item->is_splocal() && !item_is_user_var(arg_item))
        {
          my_error(ER_SP_NOT_VAR_ARG, MYF(0), i+1, m_qname.str);
          err_status= TRUE;
          break;
        }
      }

1465
      if (spvar->mode == sp_param_out)
1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482
      {
        Item_null *null_item= new Item_null();

        if (!null_item ||
            nctx->set_variable(thd, i, null_item))
        {
          err_status= TRUE;
          break;
        }
      }
      else
      {
        if (nctx->set_variable(thd, i, *it_args.ref()))
        {
          err_status= TRUE;
          break;
        }
1483
      }
1484
    }
1485

1486 1487
    /* 
      Okay, got values for all arguments. Close tables that might be used by 
1488 1489
      arguments evaluation. If arguments evaluation required prelocking mode, 
      we'll leave it here.
1490 1491
    */
    if (!thd->in_sub_stmt)
1492
      close_thread_tables(thd, 0, 0);
1493 1494

    DBUG_PRINT("info",(" %.*s: eval args done", m_name.length, m_name.str));
1495 1496
  }

1497 1498
  thd->spcont= nctx;

1499 1500
  if (!err_status)
    err_status= execute(thd);
1501 1502 1503 1504 1505 1506 1507 1508

  /*
    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;
1509

1510
  if (!err_status && params > 0)
1511
  {
1512
    List_iterator<Item> it_args(*args);
1513

1514 1515 1516 1517
    /*
      Copy back all OUT or INOUT values to the previous frame, or
      set global user variables
    */
1518
    for (uint i= 0 ; i < params ; i++)
1519
    {
1520 1521 1522 1523 1524
      Item *arg_item= it_args++;

      if (!arg_item)
        break;

1525
      sp_variable_t *spvar= m_pcont->find_variable(i);
1526

1527
      if (spvar->mode == sp_param_in)
1528 1529 1530
        continue;

      if (arg_item->is_splocal())
1531
      {
1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543
        if (octx->set_variable(thd,
                               ((Item_splocal*) arg_item)->get_var_idx(),
                               nctx->get_item(i)))
        {
          err_status= TRUE;
          break;
        }
      }
      else
      {
        Item_func_get_user_var *guv= item_is_user_var(arg_item);

1544
	if (guv)
1545
	{
1546 1547 1548 1549 1550 1551 1552 1553
	  Item *item= nctx->get_item(i);
	  Item_func_set_user_var *suv;

	  suv= new Item_func_set_user_var(guv->get_name(), item);
	  /*
            Item_func_set_user_var is not fixed after construction,
            call fix_fields().
	  */
1554 1555
          if ((err_status= test(!suv || suv->fix_fields(thd, &item) ||
                                suv->check() || suv->update())))
1556
            break;
1557 1558
	}
      }
1559

1560 1561 1562
    }
  }

1563
  if (!save_spcont)
1564
    delete octx;
1565

1566
  nctx->pop_all_cursors();	// To avoid memory leaks after an error
1567
  delete nctx;
1568
  thd->spcont= save_spcont;
1569

1570
  DBUG_RETURN(err_status);
1571 1572 1573
}


1574
// Reset lex during parsing, before we parse a sub statement.
1575 1576 1577
void
sp_head::reset_lex(THD *thd)
{
1578 1579
  DBUG_ENTER("sp_head::reset_lex");
  LEX *sublex;
1580
  LEX *oldlex= thd->lex;
1581
  my_lex_states state= oldlex->next_state; // Keep original next_state
1582

1583
  (void)m_lex.push_front(oldlex);
1584
  thd->lex= sublex= new st_lex;
serg@serg.mylan's avatar
serg@serg.mylan committed
1585

1586
  /* Reset most stuff. The length arguments doesn't matter here. */
monty@mysql.com's avatar
monty@mysql.com committed
1587
  lex_start(thd, oldlex->buf, (ulong) (oldlex->end_of_query - oldlex->ptr));
serg@serg.mylan's avatar
serg@serg.mylan committed
1588

1589 1590 1591 1592 1593
  /*
   * next_state is normally the same (0), but it happens that we swap lex in
   * "mid-sentence", so we must restore it.
   */
  sublex->next_state= state;
1594
  /* We must reset ptr and end_of_query again */
1595 1596 1597
  sublex->ptr= oldlex->ptr;
  sublex->end_of_query= oldlex->end_of_query;
  sublex->tok_start= oldlex->tok_start;
serg@serg.mylan's avatar
serg@serg.mylan committed
1598
  sublex->yylineno= oldlex->yylineno;
1599
  /* And keep the SP stuff too */
1600 1601
  sublex->sphead= oldlex->sphead;
  sublex->spcont= oldlex->spcont;
1602 1603
  /* And trigger related stuff too */
  sublex->trg_chistics= oldlex->trg_chistics;
1604
  sublex->trg_table_fields.empty();
1605
  sublex->sp_lex_in_use= FALSE;
1606

1607 1608
  sublex->in_comment= oldlex->in_comment;

1609 1610 1611 1612 1613 1614 1615 1616
  /* Reset type info. */

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

1617
  DBUG_VOID_RETURN;
1618 1619
}

1620
// Restore lex during parsing, after we have parsed a sub statement.
1621 1622 1623
void
sp_head::restore_lex(THD *thd)
{
1624 1625
  DBUG_ENTER("sp_head::restore_lex");
  LEX *sublex= thd->lex;
1626 1627 1628 1629
  LEX *oldlex= (LEX *)m_lex.pop();

  if (! oldlex)
    return;			// Nothing to restore
1630

1631
  // Update some state in the old one first
1632 1633
  oldlex->ptr= sublex->ptr;
  oldlex->next_state= sublex->next_state;
1634
  oldlex->trg_table_fields.push_back(&sublex->trg_table_fields);
1635

1636
  /*
1637 1638
    Add routines which are used by statement to respective set for
    this routine.
1639
  */
1640
  sp_update_sp_used_routines(&m_sroutines, &sublex->sroutines);
1641 1642 1643 1644 1645
  /*
    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);
1646
  if (! sublex->sp_lex_in_use)
1647 1648
  {
    lex_end(sublex);
1649
    delete sublex;
1650
  }
1651
  thd->lex= oldlex;
1652
  DBUG_VOID_RETURN;
1653 1654
}

1655
void
1656
sp_head::push_backpatch(sp_instr *i, sp_label_t *lab)
1657
{
1658
  bp_t *bp= (bp_t *)sql_alloc(sizeof(bp_t));
1659 1660 1661 1662 1663 1664 1665

  if (bp)
  {
    bp->lab= lab;
    bp->instr= i;
    (void)m_backpatch.push_front(bp);
  }
1666 1667 1668
}

void
1669
sp_head::backpatch(sp_label_t *lab)
1670
{
1671
  bp_t *bp;
1672
  uint dest= instructions();
1673
  List_iterator_fast<bp_t> li(m_backpatch);
1674

1675
  while ((bp= li++))
1676
  {
1677 1678
    if (bp->lab == lab)
      bp->instr->backpatch(dest, lab->ctx);
1679 1680 1681
  }
}

1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729
/*
  Prepare an instance of create_field for field creation (fill all necessary
  attributes).

  SYNOPSIS
    sp_head::fill_field_definition()
      thd         [IN] Thread handle
      lex         [IN] Yacc parsing context
      field_type  [IN] Field type
      field_def   [OUT] An instance of create_field to be filled

  RETURN
    FALSE  on success
    TRUE   on error
*/

bool
sp_head::fill_field_definition(THD *thd, LEX *lex,
                               enum enum_field_types field_type,
                               create_field *field_def)
{
  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,
                      (lex->charset ? lex->charset : default_charset_info),
                      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;
}


1730
void
1731
sp_head::new_cont_backpatch(sp_instr_opt_meta *i)
1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742
{
  m_cont_level+= 1;
  if (i)
  {
    /* Use the cont. destination slot to store the level */
    i->m_cont_dest= m_cont_level;
    (void)m_cont_backpatch.push_front(i);
  }
}

void
1743
sp_head::add_cont_backpatch(sp_instr_opt_meta *i)
1744 1745 1746 1747 1748 1749 1750 1751 1752 1753
{
  i->m_cont_dest= m_cont_level;
  (void)m_cont_backpatch.push_front(i);
}

void
sp_head::do_cont_backpatch()
{
  uint dest= instructions();
  uint lev= m_cont_level--;
1754
  sp_instr_opt_meta *i;
1755 1756 1757 1758 1759 1760 1761 1762

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

1763
void
1764
sp_head::set_info(longlong created, longlong modified,
1765
		  st_sp_chistics *chistics, ulong sql_mode)
1766 1767 1768
{
  m_created= created;
  m_modified= modified;
monty@mysql.com's avatar
monty@mysql.com committed
1769 1770
  m_chistics= (st_sp_chistics *) memdup_root(mem_root, (char*) chistics,
                                             sizeof(*chistics));
1771 1772 1773
  if (m_chistics->comment.length == 0)
    m_chistics->comment.str= 0;
  else
monty@mysql.com's avatar
monty@mysql.com committed
1774
    m_chistics->comment.str= strmake_root(mem_root,
1775 1776
					  m_chistics->comment.str,
					  m_chistics->comment.length);
1777
  m_sql_mode= sql_mode;
1778 1779
}

1780 1781

void
1782
sp_head::set_definer(const char *definer, uint definerlen)
1783
{
1784 1785
  char user_name_holder[USERNAME_LENGTH + 1];
  LEX_STRING_WITH_INIT user_name(user_name_holder, USERNAME_LENGTH);
1786

1787 1788
  char host_name_holder[HOSTNAME_LENGTH + 1];
  LEX_STRING_WITH_INIT host_name(host_name_holder, HOSTNAME_LENGTH);
1789

1790 1791
  parse_user(definer, definerlen, user_name.str, &user_name.length,
             host_name.str, &host_name.length);
1792

1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804
  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;
1805 1806 1807
}


1808 1809 1810
void
sp_head::reset_thd_mem_root(THD *thd)
{
1811
  DBUG_ENTER("sp_head::reset_thd_mem_root");
1812
  m_thd_root= thd->mem_root;
monty@mysql.com's avatar
monty@mysql.com committed
1813
  thd->mem_root= &main_mem_root;
1814 1815 1816
  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
1817 1818 1819
  thd->free_list= NULL;	// Start a new one
  /* Copy the db, since substatements will point to it */
  m_thd_db= thd->db;
monty@mysql.com's avatar
monty@mysql.com committed
1820
  thd->db= thd->strmake(thd->db, thd->db_length);
1821
  m_thd= thd;
1822
  DBUG_VOID_RETURN;
1823 1824 1825 1826 1827
}

void
sp_head::restore_thd_mem_root(THD *thd)
{
1828 1829
  DBUG_ENTER("sp_head::restore_thd_mem_root");
  Item *flist= free_list;	// The old list
konstantin@mysql.com's avatar
konstantin@mysql.com committed
1830
  set_query_arena(thd);         // Get new free_list and mem_root
1831
  state= INITIALIZED_FOR_SP;
1832

1833 1834
  DBUG_PRINT("info", ("mem_root 0x%lx returned from thd mem root 0x%lx",
                      (ulong) &mem_root, (ulong) &thd->mem_root));
1835 1836 1837 1838
  thd->free_list= flist;	// Restore the old one
  thd->db= m_thd_db;		// Restore the original db pointer
  thd->mem_root= m_thd_root;
  m_thd= NULL;
1839
  DBUG_VOID_RETURN;
1840 1841 1842
}


1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857
/*
  Check if a user has access right to a routine

  SYNOPSIS
    check_show_routine_access()
    thd			Thread handler
    sp			SP
    full_access		Set to 1 if the user has SELECT right to the
			'mysql.proc' able or is the owner of the routine
  RETURN
    0  ok
    1  error
*/

bool check_show_routine_access(THD *thd, sp_head *sp, bool *full_access)
1858 1859 1860 1861 1862
{
  TABLE_LIST tables;
  bzero((char*) &tables,sizeof(tables));
  tables.db= (char*) "mysql";
  tables.table_name= tables.alias= (char*) "proc";
1863
  *full_access= (!check_table_access(thd, SELECT_ACL, &tables, 1) ||
1864 1865 1866 1867
                 (!strcmp(sp->m_definer_user.str,
                          thd->security_ctx->priv_user) &&
                  !strcmp(sp->m_definer_host.str,
                          thd->security_ctx->priv_host)));
1868
  if (!*full_access)
1869 1870
    return check_some_routine_access(thd, sp->m_db.str, sp->m_name.str,
                                     sp->m_type == TYPE_ENUM_PROCEDURE);
1871 1872 1873 1874
  return 0;
}


1875 1876 1877 1878 1879 1880 1881 1882
int
sp_head::show_create_procedure(THD *thd)
{
  Protocol *protocol= thd->protocol;
  char buff[2048];
  String buffer(buff, sizeof(buff), system_charset_info);
  int res;
  List<Item> field_list;
1883 1884
  byte *sql_mode_str;
  ulong sql_mode_len;
1885
  bool full_access;
1886 1887
  DBUG_ENTER("sp_head::show_create_procedure");
  DBUG_PRINT("info", ("procedure %s", m_name.str));
1888

1889 1890
  LINT_INIT(sql_mode_str);
  LINT_INIT(sql_mode_len);
1891

1892
  if (check_show_routine_access(thd, this, &full_access))
pem@mysql.com's avatar
pem@mysql.com committed
1893
    DBUG_RETURN(1);
1894

1895 1896 1897 1898
  sql_mode_str=
    sys_var_thd_sql_mode::symbolic_mode_representation(thd,
                                                       m_sql_mode,
                                                       &sql_mode_len);
1899
  field_list.push_back(new Item_empty_string("Procedure", NAME_LEN));
1900
  field_list.push_back(new Item_empty_string("sql_mode", sql_mode_len));
1901 1902
  // 1024 is for not to confuse old clients
  field_list.push_back(new Item_empty_string("Create Procedure",
1903
					     max(buffer.length(), 1024)));
1904 1905
  if (protocol->send_fields(&field_list, Protocol::SEND_NUM_ROWS |
                                         Protocol::SEND_EOF))
pem@mysql.com's avatar
pem@mysql.com committed
1906
    DBUG_RETURN(1);
1907 1908
  protocol->prepare_for_resend();
  protocol->store(m_name.str, m_name.length, system_charset_info);
1909
  protocol->store((char*) sql_mode_str, sql_mode_len, system_charset_info);
1910 1911
  if (full_access)
    protocol->store(m_defstr.str, m_defstr.length, system_charset_info);
1912 1913
  res= protocol->write();
  send_eof(thd);
1914

1915 1916 1917
  DBUG_RETURN(res);
}

1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930

/*
  Add instruction to SP

  SYNOPSIS
    sp_head::add_instr()
    instr   Instruction
*/

void sp_head::add_instr(sp_instr *instr)
{
  instr->free_list= m_thd->free_list;
  m_thd->free_list= 0;
1931 1932 1933 1934 1935 1936 1937
  /*
    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;
1938 1939 1940 1941
  insert_dynamic(&m_instr, (gptr)&instr);
}


1942 1943 1944 1945 1946 1947 1948 1949
int
sp_head::show_create_function(THD *thd)
{
  Protocol *protocol= thd->protocol;
  char buff[2048];
  String buffer(buff, sizeof(buff), system_charset_info);
  int res;
  List<Item> field_list;
1950 1951
  byte *sql_mode_str;
  ulong sql_mode_len;
1952
  bool full_access;
1953 1954
  DBUG_ENTER("sp_head::show_create_function");
  DBUG_PRINT("info", ("procedure %s", m_name.str));
1955 1956
  LINT_INIT(sql_mode_str);
  LINT_INIT(sql_mode_len);
1957

1958
  if (check_show_routine_access(thd, this, &full_access))
pem@mysql.com's avatar
pem@mysql.com committed
1959
    DBUG_RETURN(1);
1960

1961 1962 1963 1964
  sql_mode_str=
    sys_var_thd_sql_mode::symbolic_mode_representation(thd,
                                                       m_sql_mode,
                                                       &sql_mode_len);
1965
  field_list.push_back(new Item_empty_string("Function",NAME_LEN));
1966
  field_list.push_back(new Item_empty_string("sql_mode", sql_mode_len));
1967 1968
  field_list.push_back(new Item_empty_string("Create Function",
					     max(buffer.length(),1024)));
1969 1970
  if (protocol->send_fields(&field_list,
                            Protocol::SEND_NUM_ROWS | Protocol::SEND_EOF))
pem@mysql.com's avatar
pem@mysql.com committed
1971
    DBUG_RETURN(1);
1972 1973
  protocol->prepare_for_resend();
  protocol->store(m_name.str, m_name.length, system_charset_info);
1974
  protocol->store((char*) sql_mode_str, sql_mode_len, system_charset_info);
1975 1976
  if (full_access)
    protocol->store(m_defstr.str, m_defstr.length, system_charset_info);
1977 1978
  res= protocol->write();
  send_eof(thd);
1979

1980 1981
  DBUG_RETURN(res);
}
1982

1983 1984

/*
1985 1986 1987 1988
  Do some minimal optimization of the code:
    1) Mark used instructions
       1.1) While doing this, shortcut jumps to jump instructions
    2) Compact the code, removing unused instructions
1989 1990 1991 1992 1993 1994 1995 1996 1997

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

  opt_mark()           Mark instruction as reachable (will recurse for jumps)
  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)
1998 1999 2000
*/

void sp_head::optimize()
2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019
{
  List<sp_instr> bp;
  sp_instr *i;
  uint src, dst;

  opt_mark(0);

  bp.empty();
  src= dst= 0;
  while ((i= get_instr(src)))
  {
    if (! i->marked)
    {
      delete i;
      src+= 1;
    }
    else
    {
      if (src != dst)
2020
      {                         // Move the instruction and update prev. jumps
2021 2022 2023 2024 2025
	sp_instr *ibp;
	List_iterator_fast<sp_instr> li(bp);

	set_dynamic(&m_instr, (gptr)&i, dst);
	while ((ibp= li++))
2026 2027 2028 2029
        {
          sp_instr_opt_meta *im= static_cast<sp_instr_opt_meta *>(ibp);
          im->set_destination(src, dst);
        }
2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048
      }
      i->opt_move(dst, &bp);
      src+= 1;
      dst+= 1;
    }
  }
  m_instr.elements= dst;
  bp.empty();
}

void
sp_head::opt_mark(uint ip)
{
  sp_instr *i;

  while ((i= get_instr(ip)) && !i->marked)
    ip= i->opt_mark(this);
}

2049

pem@mysql.com's avatar
pem@mysql.com committed
2050
#ifndef DBUG_OFF
2051 2052 2053 2054
/*
  Return the routine instructions as a result set.
  Returns 0 if ok, !=0 on error.
*/
pem@mysql.com's avatar
pem@mysql.com committed
2055 2056 2057 2058 2059 2060 2061
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;
2062
  sp_instr *i;
pem@mysql.com's avatar
pem@mysql.com committed
2063
  bool full_access;
2064
  int res= 0;
pem@mysql.com's avatar
pem@mysql.com committed
2065 2066
  uint ip;
  DBUG_ENTER("sp_head::show_routine_code");
2067
  DBUG_PRINT("info", ("procedure: %s", m_name.str));
pem@mysql.com's avatar
pem@mysql.com committed
2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081

  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",
					     max(buffer.length(), 1024)));
  if (protocol->send_fields(&field_list, Protocol::SEND_NUM_ROWS |
                                         Protocol::SEND_EOF))
    DBUG_RETURN(1);

  for (ip= 0; (i = get_instr(ip)) ; ip++)
  {
2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097
    /* 
      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);
    }
pem@mysql.com's avatar
pem@mysql.com committed
2098 2099 2100 2101 2102
    protocol->prepare_for_resend();
    protocol->store((longlong)ip);

    buffer.set("", 0, system_charset_info);
    i->print(&buffer);
2103
    protocol->store(buffer.ptr(), buffer.length(), system_charset_info);
pem@mysql.com's avatar
pem@mysql.com committed
2104 2105 2106 2107 2108 2109 2110 2111 2112 2113
    if ((res= protocol->write()))
      break;
  }
  send_eof(thd);

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


2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153
/*
  Prepare LEX and thread for execution of instruction, if requested open
  and lock LEX's tables, execute instruction's core function, perform
  cleanup afterwards.

  SYNOPSIS
    reset_lex_and_exec_core()
      thd         - thread context
      nextp       - out - next instruction
      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).
      sp_instr    - instruction for which we prepare context, and which core
                    function execute by calling its exec_core() method.

  NOTE
    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().

  RETURN VALUE
    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;

  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;

  VOID(pthread_mutex_lock(&LOCK_thread_count));
2154
  thd->query_id= next_query_id();
2155 2156
  VOID(pthread_mutex_unlock(&LOCK_thread_count));

2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176
  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);
    }
  }
    
  reinit_stmt_before_use(thd, m_lex);
2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192
  /*
    If requested check whenever we have access to tables in LEX's table list
    and open and lock them before executing instructtions core function.
  */
  if (open_tables &&
      (check_table_access(thd, SELECT_ACL, m_lex->query_tables, 0) ||
       open_and_lock_tables(thd, m_lex->query_tables)))
      res= -1;

  if (!res)
    res= instr->exec_core(thd, nextp);

  m_lex->unit.cleanup();

  thd->proc_info="closing tables";
  close_thread_tables(thd);
2193
  thd->proc_info= 0;
2194

2195
  if (m_lex->query_tables_own_last)
2196
  {
2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209
    /*
      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);
2210
  }
2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221
  thd->rollback_item_tree_changes();

  /*
    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()
  */
2222
  return res || thd->net.report_error;
2223 2224 2225
}


2226 2227 2228 2229
/*
  sp_instr class functions
*/

2230
int sp_instr::exec_core(THD *thd, uint *nextp)
2231
{
2232 2233
  DBUG_ASSERT(0);
  return 0;
2234 2235
}

2236 2237 2238 2239
/*
  sp_instr_stmt class functions
*/

2240
int
2241
sp_instr_stmt::execute(THD *thd, uint *nextp)
2242
{
2243 2244
  char *query;
  uint32 query_length;
2245
  int res;
2246
  DBUG_ENTER("sp_instr_stmt::execute");
2247
  DBUG_PRINT("info", ("command: %d", m_lex_keeper.sql_command()));
2248 2249 2250

  query= thd->query;
  query_length= thd->query_length;
2251 2252
  if (!(res= alloc_query(thd, m_query.str, m_query.length+1)) &&
      !(res=subst_spvars(thd, this, &m_query)))
2253
  {
2254 2255 2256 2257
    /*
      (the order of query cache and subst_spvars calls is irrelevant because
      queries with SP vars can't be cached)
    */
2258 2259 2260
    if (query_cache_send_result_to_client(thd,
					  thd->query, thd->query_length) <= 0)
    {
2261
      res= m_lex_keeper.reset_lex_and_exec_core(thd, nextp, FALSE, this);
2262 2263
      query_cache_end_of_result(thd);
    }
2264 2265
    else
      *nextp= m_ip+1;
2266 2267 2268
    thd->query= query;
    thd->query_length= query_length;
  }
2269 2270 2271
  DBUG_RETURN(res);
}

2272

2273 2274 2275
void
sp_instr_stmt::print(String *str)
{
pem@mysql.com's avatar
pem@mysql.com committed
2276 2277
  uint i, len;

2278 2279
  /* stmt CMD "..." */
  if (str->reserve(SP_STMT_PRINT_MAXLEN+SP_INSTR_UINT_MAXLEN+8))
2280
    return;
2281
  str->qs_append(STRING_WITH_LEN("stmt "));
2282
  str->qs_append((uint)m_lex_keeper.sql_command());
2283
  str->qs_append(STRING_WITH_LEN(" \""));
pem@mysql.com's avatar
pem@mysql.com committed
2284 2285 2286 2287 2288
  len= m_query.length;
  /*
    Print the query string (but not too much of it), just to indicate which
    statement it is.
  */
2289 2290
  if (len > SP_STMT_PRINT_MAXLEN)
    len= SP_STMT_PRINT_MAXLEN-3;
pem@mysql.com's avatar
pem@mysql.com committed
2291 2292
  /* Copy the query string and replace '\n' with ' ' in the process */
  for (i= 0 ; i < len ; i++)
2293
  {
2294 2295 2296 2297
    char c= m_query.str[i];
    if (c == '\n')
      c= ' ';
    str->qs_append(c);
2298
  }
2299
  if (m_query.length > SP_STMT_PRINT_MAXLEN)
2300
    str->qs_append(STRING_WITH_LEN("...")); /* Indicate truncated string */
2301
  str->qs_append('"');
2302
}
2303

2304

2305
int
2306
sp_instr_stmt::exec_core(THD *thd, uint *nextp)
2307
{
2308 2309
  int res= mysql_execute_command(thd);
  *nextp= m_ip+1;
2310
  return res;
2311 2312
}

2313 2314 2315 2316 2317

/*
  sp_instr_set class functions
*/

2318
int
2319
sp_instr_set::execute(THD *thd, uint *nextp)
2320
{
2321 2322
  DBUG_ENTER("sp_instr_set::execute");
  DBUG_PRINT("info", ("offset: %u", m_offset));
2323 2324 2325 2326

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

2327

2328 2329 2330
int
sp_instr_set::exec_core(THD *thd, uint *nextp)
{
2331
  int res= thd->spcont->set_variable(thd, m_offset, m_value);
2332

2333
  if (res && thd->spcont->found_handler_here())
2334 2335
  {
    /*
2336 2337
      Failed to evaluate the value, and a handler has been found. Reset the
      variable to NULL.
2338 2339
    */

2340 2341 2342
    if (thd->spcont->set_variable(thd, m_offset, 0))
    {
      /* If this also failed, let's abort. */
2343

2344 2345
      sp_rcontext *spcont= thd->spcont;
    
2346 2347 2348 2349 2350 2351
      thd->spcont= 0;           /* Avoid handlers */
      my_error(ER_OUT_OF_RESOURCES, MYF(0));
      spcont->clear_handler();
      thd->spcont= spcont;
    }
  }
2352

2353
  *nextp = m_ip+1;
2354
  return res;
2355 2356
}

2357 2358 2359
void
sp_instr_set::print(String *str)
{
2360 2361
  /* set name@offset ... */
  int rsrv = SP_INSTR_UINT_MAXLEN+6;
2362
  sp_variable_t *var = m_ctx->find_variable(m_offset);
pem@mysql.com's avatar
pem@mysql.com committed
2363 2364 2365 2366

  /* 'var' should always be non-null, but just in case... */
  if (var)
    rsrv+= var->name.length;
2367 2368
  if (str->reserve(rsrv))
    return;
2369
  str->qs_append(STRING_WITH_LEN("set "));
pem@mysql.com's avatar
pem@mysql.com committed
2370 2371
  if (var)
  {
2372 2373
    str->qs_append(var->name.str, var->name.length);
    str->qs_append('@');
pem@mysql.com's avatar
pem@mysql.com committed
2374
  }
2375
  str->qs_append(m_offset);
2376
  str->qs_append(' ');
2377 2378 2379
  m_value->print(str);
}

2380

2381 2382 2383 2384
/*
  sp_instr_set_trigger_field class functions
*/

2385 2386 2387 2388
int
sp_instr_set_trigger_field::execute(THD *thd, uint *nextp)
{
  DBUG_ENTER("sp_instr_set_trigger_field::execute");
2389 2390 2391 2392 2393 2394 2395 2396 2397 2398
  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)
{
  int res= 0;
  Item *it= sp_prepare_func_item(thd, &value);
  if (!it ||
2399
      !trigger_field->fixed && trigger_field->fix_fields(thd, 0) ||
2400
      (it->save_in_field(trigger_field->field, 0) < 0))
2401
    res= -1;
2402 2403
  *nextp = m_ip+1;
  return res;
2404 2405 2406 2407 2408
}

void
sp_instr_set_trigger_field::print(String *str)
{
2409
  str->append(STRING_WITH_LEN("set_trigger_field "));
2410
  trigger_field->print(str);
2411
  str->append(STRING_WITH_LEN(":="));
2412 2413 2414
  value->print(str);
}

2415 2416 2417 2418 2419

/*
 sp_instr_jump class functions
*/

2420 2421 2422 2423 2424 2425 2426 2427 2428 2429
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);
}

2430 2431 2432
void
sp_instr_jump::print(String *str)
{
2433 2434
  /* jump dest */
  if (str->reserve(SP_INSTR_UINT_MAXLEN+5))
2435
    return;
2436
  str->qs_append(STRING_WITH_LEN("jump "));
2437 2438 2439
  str->qs_append(m_dest);
}

2440 2441 2442
uint
sp_instr_jump::opt_mark(sp_head *sp)
{
2443
  m_dest= opt_shortcut_jump(sp, this);
2444 2445
  if (m_dest != m_ip+1)		/* Jumping to following instruction? */
    marked= 1;
2446 2447 2448 2449 2450
  m_optdest= sp->get_instr(m_dest);
  return m_dest;
}

uint
2451
sp_instr_jump::opt_shortcut_jump(sp_head *sp, sp_instr *start)
2452 2453 2454 2455 2456 2457
{
  uint dest= m_dest;
  sp_instr *i;

  while ((i= sp->get_instr(dest)))
  {
2458
    uint ndest;
2459

2460
    if (start == i || this == i)
2461 2462
      break;
    ndest= i->opt_shortcut_jump(sp, start);
2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479
    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;
}

2480 2481 2482 2483 2484

/*
  sp_instr_jump_if_not class functions
*/

2485 2486 2487
int
sp_instr_jump_if_not::execute(THD *thd, uint *nextp)
{
2488 2489
  DBUG_ENTER("sp_instr_jump_if_not::execute");
  DBUG_PRINT("info", ("destination: %u", m_dest));
2490 2491 2492 2493 2494 2495 2496
  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)
{
2497 2498
  Item *it;
  int res;
2499

2500
  it= sp_prepare_func_item(thd, &m_expr);
2501
  if (! it)
2502
  {
2503
    res= -1;
2504 2505
    *nextp = m_cont_dest;
  }
2506
  else
2507 2508
  {
    res= 0;
2509
    if (! it->val_bool())
2510 2511 2512 2513
      *nextp = m_dest;
    else
      *nextp = m_ip+1;
  }
2514 2515

  return res;
2516
}
2517

2518

2519 2520 2521
void
sp_instr_jump_if_not::print(String *str)
{
2522
  /* jump_if_not dest(cont) ... */
2523
  if (str->reserve(2*SP_INSTR_UINT_MAXLEN+14+32)) // Add some for the expr. too
2524
    return;
2525
  str->qs_append(STRING_WITH_LEN("jump_if_not "));
2526
  str->qs_append(m_dest);
2527
  str->qs_append('(');
2528
  str->qs_append(m_cont_dest);
2529
  str->qs_append(STRING_WITH_LEN(") "));
2530 2531 2532
  m_expr->print(str);
}

2533

2534 2535 2536 2537 2538 2539 2540 2541
uint
sp_instr_jump_if_not::opt_mark(sp_head *sp)
{
  sp_instr *i;

  marked= 1;
  if ((i= sp->get_instr(m_dest)))
  {
2542
    m_dest= i->opt_shortcut_jump(sp, this);
2543 2544 2545
    m_optdest= sp->get_instr(m_dest);
  }
  sp->opt_mark(m_dest);
2546 2547 2548 2549 2550 2551
  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);
  }
  sp->opt_mark(m_cont_dest);
2552 2553 2554
  return m_ip+1;
}

2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574
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);
}

2575 2576 2577 2578

/*
  sp_instr_freturn class functions
*/
2579

2580
int
2581
sp_instr_freturn::execute(THD *thd, uint *nextp)
2582
{
2583
  DBUG_ENTER("sp_instr_freturn::execute");
2584 2585 2586 2587 2588 2589 2590
  DBUG_RETURN(m_lex_keeper.reset_lex_and_exec_core(thd, nextp, TRUE, this));
}


int
sp_instr_freturn::exec_core(THD *thd, uint *nextp)
{
2591 2592 2593 2594
  /*
    Change <next instruction pointer>, so that this will be the last
    instruction in the stored function.
  */
2595

2596
  *nextp= UINT_MAX;
2597

2598 2599 2600 2601 2602 2603 2604 2605 2606
  /*
    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.
  */

  return thd->spcont->set_return_value(thd, m_value);
2607
}
2608

2609 2610 2611
void
sp_instr_freturn::print(String *str)
{
2612 2613
  /* freturn type expr... */
  if (str->reserve(UINT_MAX+8+32)) // Add some for the expr. too
2614
    return;
2615
  str->qs_append(STRING_WITH_LEN("freturn "));
2616
  str->qs_append((uint)m_type);
2617
  str->qs_append(' ');
2618 2619 2620
  m_value->print(str);
}

2621 2622 2623 2624
/*
  sp_instr_hpush_jump class functions
*/

2625 2626 2627 2628 2629 2630 2631 2632
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++))
2633
    thd->spcont->push_handler(p, m_ip+1, m_type, m_frame);
2634 2635 2636 2637 2638

  *nextp= m_dest;
  DBUG_RETURN(0);
}

2639

2640 2641 2642
void
sp_instr_hpush_jump::print(String *str)
{
2643 2644
  /* hpush_jump dest fsize type */
  if (str->reserve(SP_INSTR_UINT_MAXLEN*2 + 21))
2645
    return;
2646
  str->qs_append(STRING_WITH_LEN("hpush_jump "));
2647
  str->qs_append(m_dest);
2648
  str->qs_append(' ');
2649
  str->qs_append(m_frame);
2650
  switch (m_type) {
pem@mysql.com's avatar
pem@mysql.com committed
2651
  case SP_HANDLER_NONE:
2652
    str->qs_append(STRING_WITH_LEN(" NONE")); // This would be a bug
pem@mysql.com's avatar
pem@mysql.com committed
2653 2654
    break;
  case SP_HANDLER_EXIT:
2655
    str->qs_append(STRING_WITH_LEN(" EXIT"));
pem@mysql.com's avatar
pem@mysql.com committed
2656 2657
    break;
  case SP_HANDLER_CONTINUE:
2658
    str->qs_append(STRING_WITH_LEN(" CONTINUE"));
pem@mysql.com's avatar
pem@mysql.com committed
2659 2660
    break;
  case SP_HANDLER_UNDO:
2661
    str->qs_append(STRING_WITH_LEN(" UNDO"));
pem@mysql.com's avatar
pem@mysql.com committed
2662 2663
    break;
  default:
2664 2665
    // This would be a bug as well
    str->qs_append(STRING_WITH_LEN(" UNKNOWN:"));
pem@mysql.com's avatar
pem@mysql.com committed
2666 2667
    str->qs_append(m_type);
  }
2668 2669
}

2670

2671 2672 2673 2674 2675 2676 2677 2678
uint
sp_instr_hpush_jump::opt_mark(sp_head *sp)
{
  sp_instr *i;

  marked= 1;
  if ((i= sp->get_instr(m_dest)))
  {
2679
    m_dest= i->opt_shortcut_jump(sp, this);
2680 2681 2682 2683 2684 2685
    m_optdest= sp->get_instr(m_dest);
  }
  sp->opt_mark(m_dest);
  return m_ip+1;
}

2686 2687 2688 2689 2690

/*
  sp_instr_hpop class functions
*/

2691 2692 2693 2694 2695 2696 2697 2698 2699
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);
}

2700 2701 2702
void
sp_instr_hpop::print(String *str)
{
2703 2704
  /* hpop count */
  if (str->reserve(SP_INSTR_UINT_MAXLEN+5))
2705
    return;
2706
  str->qs_append(STRING_WITH_LEN("hpop "));
2707 2708 2709
  str->qs_append(m_count);
}

2710

2711 2712 2713 2714
/*
  sp_instr_hreturn class functions
*/

2715 2716 2717 2718
int
sp_instr_hreturn::execute(THD *thd, uint *nextp)
{
  DBUG_ENTER("sp_instr_hreturn::execute");
2719 2720 2721 2722 2723 2724
  if (m_dest)
    *nextp= m_dest;
  else
  {
    *nextp= thd->spcont->pop_hstack();
  }
2725
  thd->spcont->exit_handler();
2726 2727
  DBUG_RETURN(0);
}
2728

2729

2730 2731 2732
void
sp_instr_hreturn::print(String *str)
{
2733 2734
  /* hreturn framesize dest */
  if (str->reserve(SP_INSTR_UINT_MAXLEN*2 + 9))
2735
    return;
2736
  str->qs_append(STRING_WITH_LEN("hreturn "));
2737
  str->qs_append(m_frame);
2738
  if (m_dest)
2739
  {
2740
    str->qs_append(' ');
2741
    str->qs_append(m_dest);
2742
  }
2743 2744
}

2745

2746 2747 2748 2749 2750 2751 2752 2753 2754 2755
uint
sp_instr_hreturn::opt_mark(sp_head *sp)
{
  if (m_dest)
    return sp_instr_jump::opt_mark(sp);
  else
  {
    marked= 1;
    return UINT_MAX;
  }
2756 2757
}

2758

2759 2760 2761 2762
/*
  sp_instr_cpush class functions
*/

2763 2764 2765
int
sp_instr_cpush::execute(THD *thd, uint *nextp)
{
konstantin@mysql.com's avatar
konstantin@mysql.com committed
2766
  Query_arena backup_arena;
2767
  DBUG_ENTER("sp_instr_cpush::execute");
2768 2769 2770 2771 2772

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

2775
  thd->spcont->push_cursor(&m_lex_keeper, this);
2776

konstantin@mysql.com's avatar
konstantin@mysql.com committed
2777
  thd->restore_active_arena(thd->spcont->callers_arena, &backup_arena);
2778

2779
  *nextp= m_ip+1;
2780

2781 2782 2783
  DBUG_RETURN(0);
}

2784

2785 2786 2787
void
sp_instr_cpush::print(String *str)
{
pem@mysql.com's avatar
pem@mysql.com committed
2788 2789
  LEX_STRING n;
  my_bool found= m_ctx->find_cursor(m_cursor, &n);
2790 2791
  /* cpush name@offset */
  uint rsrv= SP_INSTR_UINT_MAXLEN+7;
pem@mysql.com's avatar
pem@mysql.com committed
2792

2793 2794 2795 2796
  if (found)
    rsrv+= n.length;
  if (str->reserve(rsrv))
    return;
2797
  str->qs_append(STRING_WITH_LEN("cpush "));
pem@mysql.com's avatar
pem@mysql.com committed
2798 2799
  if (found)
  {
2800 2801
    str->qs_append(n.str, n.length);
    str->qs_append('@');
pem@mysql.com's avatar
pem@mysql.com committed
2802 2803
  }
  str->qs_append(m_cursor);
2804 2805
}

2806 2807 2808 2809 2810

/*
  sp_instr_cpop class functions
*/

2811 2812 2813 2814 2815 2816 2817 2818 2819
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);
}

2820

2821 2822 2823
void
sp_instr_cpop::print(String *str)
{
2824 2825
  /* cpop count */
  if (str->reserve(SP_INSTR_UINT_MAXLEN+5))
2826
    return;
2827
  str->qs_append(STRING_WITH_LEN("cpop "));
2828 2829 2830
  str->qs_append(m_count);
}

2831 2832 2833 2834 2835

/*
  sp_instr_copen class functions
*/

2836 2837 2838
int
sp_instr_copen::execute(THD *thd, uint *nextp)
{
2839 2840 2841 2842
  /*
    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.
  */
2843 2844 2845 2846 2847 2848 2849 2850
  sp_cursor *c= thd->spcont->get_cursor(m_cursor);
  int res;
  DBUG_ENTER("sp_instr_copen::execute");

  if (! c)
    res= -1;
  else
  {
2851 2852
    sp_lex_keeper *lex_keeper= c->get_lex_keeper();
    Query_arena *old_arena= thd->stmt_arena;
2853

2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872
    /*
      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;
2873

2874 2875
      if (thd->spcont->found_handler(&dummy1, &dummy2))
        res= -1;
2876
    }
2877
    /* TODO: Assert here that we either have an error or a cursor */
2878 2879 2880 2881
  }
  DBUG_RETURN(res);
}

monty@mysql.com's avatar
monty@mysql.com committed
2882

2883 2884 2885
int
sp_instr_copen::exec_core(THD *thd, uint *nextp)
{
2886 2887
  sp_cursor *c= thd->spcont->get_cursor(m_cursor);
  int res= c->open(thd);
2888 2889 2890 2891
  *nextp= m_ip+1;
  return res;
}

2892 2893 2894
void
sp_instr_copen::print(String *str)
{
pem@mysql.com's avatar
pem@mysql.com committed
2895 2896
  LEX_STRING n;
  my_bool found= m_ctx->find_cursor(m_cursor, &n);
2897 2898
  /* copen name@offset */
  uint rsrv= SP_INSTR_UINT_MAXLEN+7;
pem@mysql.com's avatar
pem@mysql.com committed
2899

2900 2901 2902 2903
  if (found)
    rsrv+= n.length;
  if (str->reserve(rsrv))
    return;
2904
  str->qs_append(STRING_WITH_LEN("copen "));
pem@mysql.com's avatar
pem@mysql.com committed
2905 2906
  if (found)
  {
2907 2908
    str->qs_append(n.str, n.length);
    str->qs_append('@');
pem@mysql.com's avatar
pem@mysql.com committed
2909
  }
2910 2911 2912
  str->qs_append(m_cursor);
}

2913 2914 2915 2916 2917

/*
  sp_instr_cclose class functions
*/

2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932
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);
}

2933

2934 2935 2936
void
sp_instr_cclose::print(String *str)
{
pem@mysql.com's avatar
pem@mysql.com committed
2937 2938
  LEX_STRING n;
  my_bool found= m_ctx->find_cursor(m_cursor, &n);
2939 2940
  /* cclose name@offset */
  uint rsrv= SP_INSTR_UINT_MAXLEN+8;
pem@mysql.com's avatar
pem@mysql.com committed
2941

2942 2943 2944 2945
  if (found)
    rsrv+= n.length;
  if (str->reserve(rsrv))
    return;
2946
  str->qs_append(STRING_WITH_LEN("cclose "));
pem@mysql.com's avatar
pem@mysql.com committed
2947 2948
  if (found)
  {
2949 2950
    str->qs_append(n.str, n.length);
    str->qs_append('@');
pem@mysql.com's avatar
pem@mysql.com committed
2951
  }
2952 2953 2954
  str->qs_append(m_cursor);
}

2955 2956 2957 2958 2959

/*
  sp_instr_cfetch class functions
*/

2960 2961 2962 2963 2964
int
sp_instr_cfetch::execute(THD *thd, uint *nextp)
{
  sp_cursor *c= thd->spcont->get_cursor(m_cursor);
  int res;
konstantin@mysql.com's avatar
konstantin@mysql.com committed
2965
  Query_arena backup_arena;
2966 2967
  DBUG_ENTER("sp_instr_cfetch::execute");

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

2970 2971 2972
  *nextp= m_ip+1;
  DBUG_RETURN(res);
}
2973

2974

2975 2976 2977
void
sp_instr_cfetch::print(String *str)
{
2978 2979
  List_iterator_fast<struct sp_variable> li(m_varlist);
  sp_variable_t *pv;
pem@mysql.com's avatar
pem@mysql.com committed
2980 2981
  LEX_STRING n;
  my_bool found= m_ctx->find_cursor(m_cursor, &n);
2982 2983
  /* cfetch name@offset vars... */
  uint rsrv= SP_INSTR_UINT_MAXLEN+8;
2984

2985 2986 2987 2988
  if (found)
    rsrv+= n.length;
  if (str->reserve(rsrv))
    return;
2989
  str->qs_append(STRING_WITH_LEN("cfetch "));
pem@mysql.com's avatar
pem@mysql.com committed
2990 2991
  if (found)
  {
2992 2993
    str->qs_append(n.str, n.length);
    str->qs_append('@');
pem@mysql.com's avatar
pem@mysql.com committed
2994
  }
2995 2996 2997
  str->qs_append(m_cursor);
  while ((pv= li++))
  {
2998
    if (str->reserve(pv->name.length+SP_INSTR_UINT_MAXLEN+2))
2999 3000 3001 3002
      return;
    str->qs_append(' ');
    str->qs_append(pv->name.str, pv->name.length);
    str->qs_append('@');
3003 3004 3005 3006
    str->qs_append(pv->offset);
  }
}

3007 3008 3009 3010 3011

/*
  sp_instr_error class functions
*/

3012 3013 3014 3015 3016
int
sp_instr_error::execute(THD *thd, uint *nextp)
{
  DBUG_ENTER("sp_instr_error::execute");

bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
3017
  my_message(m_errcode, ER(m_errcode), MYF(0));
3018 3019 3020 3021
  *nextp= m_ip+1;
  DBUG_RETURN(-1);
}

3022

3023 3024 3025
void
sp_instr_error::print(String *str)
{
3026 3027
  /* error code */
  if (str->reserve(SP_INSTR_UINT_MAXLEN+6))
3028
    return;
3029
  str->qs_append(STRING_WITH_LEN("error "));
3030 3031 3032
  str->qs_append(m_errcode);
}

3033

3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074
/**************************************************************************
  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)
{
  int res= thd->spcont->set_case_expr(thd, m_case_expr_id, m_case_expr);

  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 ||
        thd->spcont->set_case_expr(thd, m_case_expr_id, null_item))
    {
      /* If this also failed, we have to abort. */

      sp_rcontext *spcont= thd->spcont;
    
      thd->spcont= 0;           /* Avoid handlers */
      my_error(ER_OUT_OF_RESOURCES, MYF(0));
      spcont->clear_handler();
      thd->spcont= spcont;
    }
3075
    *nextp= m_cont_dest;        /* For continue handler */
3076
  }
3077 3078
  else
    *nextp= m_ip+1;
3079

3080
  return res;
3081 3082 3083 3084 3085 3086
}


void
sp_instr_set_case_expr::print(String *str)
{
3087 3088 3089 3090 3091
  /* 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(") "));
3092
  str->qs_append(m_case_expr_id);
3093
  str->qs_append(' ');
3094 3095 3096
  m_case_expr->print(str);
}

3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121
uint
sp_instr_set_case_expr::opt_mark(sp_head *sp)
{
  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);
  }
  sp->opt_mark(m_cont_dest);
  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;
}

3122

3123
/* ------------------------------------------------------------------ */
3124

3125 3126 3127
/*
  Security context swapping
*/
3128

3129
#ifndef NO_EMBEDDED_ACCESS_CHECKS
3130
bool
3131
sp_change_security_context(THD *thd, sp_head *sp, Security_context **backup)
3132
{
3133
  *backup= 0;
3134 3135 3136 3137 3138
  if (sp->m_chistics->suid != SP_IS_NOT_SUID &&
      (strcmp(sp->m_definer_user.str,
              thd->security_ctx->priv_user) ||
       my_strcasecmp(system_charset_info, sp->m_definer_host.str,
                     thd->security_ctx->priv_host)))
3139
  {
3140 3141 3142 3143 3144 3145 3146 3147
    if (acl_getroot_no_password(&sp->m_security_ctx, sp->m_definer_user.str,
                                sp->m_definer_host.str,
                                sp->m_definer_host.str,
                                sp->m_db.str))
    {
      my_error(ER_NO_SUCH_USER, MYF(0), sp->m_definer_user.str,
               sp->m_definer_host.str);
      return TRUE;
3148
    }
3149 3150
    *backup= thd->security_ctx;
    thd->security_ctx= &sp->m_security_ctx;
3151
  }
3152
  return FALSE;
3153 3154 3155
}

void
3156
sp_restore_security_context(THD *thd, Security_context *backup)
3157
{
3158 3159
  if (backup)
    thd->security_ctx= backup;
3160
}
3161 3162

#endif /* NO_EMBEDDED_ACCESS_CHECKS */
3163 3164

/*
3165 3166 3167 3168
  Structure that represent all instances of one table
  in optimized multi-set of tables used by routine.
*/

3169 3170
typedef struct st_sp_table
{
3171 3172 3173 3174 3175 3176 3177 3178
  /*
    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;
serg@serg.mylan's avatar
serg@serg.mylan committed
3179 3180 3181
  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 */
3182 3183
  uint lock_count;
  uint query_lock_count;
3184 3185 3186 3187 3188 3189 3190 3191 3192 3193
} SP_TABLE;

byte *
sp_table_key(const byte *ptr, uint *plen, my_bool first)
{
  SP_TABLE *tab= (SP_TABLE *)ptr;
  *plen= tab->qname.length;
  return (byte *)tab->qname.str;
}

3194

3195
/*
3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214
  Merge the list of tables used by some query into the multi-set of
  tables used by routine.

  SYNOPSIS
    merge_table_list()
      thd               - thread context
      table             - table list
      lex_for_tmp_check - LEX of the query for which we are merging
                          table list.

  NOTE
    This method will use LEX provided to check whenever we are creating
    temporary table and mark it as such in target multi-set.

  RETURN VALUE
    TRUE  - Success
    FALSE - Error
*/

3215
bool
3216
sp_head::merge_table_list(THD *thd, TABLE_LIST *table, LEX *lex_for_tmp_check)
3217
{
3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229
  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++)
  {
    tab= (SP_TABLE *)hash_element(&m_sptabs, i);
    tab->query_lock_count= 0;
  }

3230
  for (; table ; table= table->next_global)
3231
    if (!table->derived && !table->schema_table)
3232
    {
serg@serg.mylan's avatar
serg@serg.mylan committed
3233
      char tname[(NAME_LEN + 1) * 3];           // db\0table\0alias\0
3234 3235 3236 3237
      uint tlen, alen;

      tlen= table->db_length;
      memcpy(tname, table->db, tlen);
serg@serg.mylan's avatar
serg@serg.mylan committed
3238
      tname[tlen++]= '\0';
3239 3240
      memcpy(tname+tlen, table->table_name, table->table_name_length);
      tlen+= table->table_name_length;
serg@serg.mylan's avatar
serg@serg.mylan committed
3241
      tname[tlen++]= '\0';
3242 3243 3244 3245 3246
      alen= strlen(table->alias);
      memcpy(tname+tlen, table->alias, alen);
      tlen+= alen;
      tname[tlen]= '\0';

3247
      /*
3248 3249 3250
        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.
3251
      */
3252 3253 3254 3255
      if ((tab= (SP_TABLE *)hash_search(&m_sptabs, (byte *)tname, tlen)) ||
          ((tab= (SP_TABLE *)hash_search(&m_sptabs, (byte *)tname,
                                        tlen - alen - 1)) &&
           tab->temp))
3256
      {
3257 3258
        if (tab->lock_type < table->lock_type)
          tab->lock_type= table->lock_type; // Use the table with the highest lock type
3259 3260 3261
        tab->query_lock_count++;
        if (tab->query_lock_count > tab->lock_count)
          tab->lock_count++;
3262 3263 3264 3265 3266
      }
      else
      {
	if (!(tab= (SP_TABLE *)thd->calloc(sizeof(SP_TABLE))))
	  return FALSE;
3267
	if (lex_for_tmp_check->sql_command == SQLCOM_CREATE_TABLE &&
3268 3269
	    lex_for_tmp_check->query_tables == table &&
	    lex_for_tmp_check->create_info.options & HA_LEX_CREATE_TMP_TABLE)
3270
        {
3271
	  tab->temp= TRUE;
3272 3273 3274 3275 3276 3277 3278
          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;
serg@serg.mylan's avatar
serg@serg.mylan committed
3279 3280
        tab->table_name_length= table->table_name_length;
        tab->db_length= table->db_length;
3281
        tab->lock_type= table->lock_type;
3282 3283
        tab->lock_count= tab->query_lock_count= 1;
	my_hash_insert(&m_sptabs, (byte *)tab);
3284 3285 3286 3287 3288 3289
      }
    }
  return TRUE;
}


3290 3291
/*
  Add tables used by routine to the table list.
3292

3293 3294
  SYNOPSIS
    add_used_tables_to_table_list()
3295 3296 3297 3298 3299 3300
      thd                    [in]     Thread context
      query_tables_last_ptr  [in/out] Pointer to the next_global member of
                                      last element of the list where tables
                                      will be added (or to its root).
      belong_to_view         [in]     Uppermost view which uses this routine,
                                      0 if none.
3301

3302 3303 3304
  DESCRIPTION
    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'.
3305

3306 3307
    Elements of list will be allocated in PS memroot, so this list will be
    persistent between PS executions.
3308

3309 3310 3311
  RETURN VALUE
    TRUE - if some elements were added, FALSE - otherwise.
*/
3312

3313 3314
bool
sp_head::add_used_tables_to_table_list(THD *thd,
3315 3316
                                       TABLE_LIST ***query_tables_last_ptr,
                                       TABLE_LIST *belong_to_view)
3317 3318
{
  uint i;
serg@serg.mylan's avatar
serg@serg.mylan committed
3319
  Query_arena *arena, backup;
3320 3321 3322 3323
  bool result= FALSE;
  DBUG_ENTER("sp_head::add_used_tables_to_table_list");

  /*
3324 3325 3326 3327 3328 3329
    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.
3330
  */
konstantin@mysql.com's avatar
konstantin@mysql.com committed
3331
  arena= thd->activate_stmt_arena_if_needed(&backup);
3332

3333
  for (i=0 ; i < m_sptabs.records ; i++)
3334
  {
3335
    char *tab_buff, *key_buff;
serg@serg.mylan's avatar
serg@serg.mylan committed
3336
    TABLE_LIST *table;
3337
    SP_TABLE *stab= (SP_TABLE *)hash_element(&m_sptabs, i);
3338 3339 3340
    if (stab->temp)
      continue;

3341
    if (!(tab_buff= (char *)thd->calloc(ALIGN_SIZE(sizeof(TABLE_LIST)) *
3342 3343 3344
                                        stab->lock_count)) ||
        !(key_buff= (char*)thd->memdup(stab->qname.str,
                                       stab->qname.length + 1)))
3345
      DBUG_RETURN(FALSE);
3346

3347 3348 3349 3350
    for (uint j= 0; j < stab->lock_count; j++)
    {
      table= (TABLE_LIST *)tab_buff;

3351
      table->db= key_buff;
serg@serg.mylan's avatar
serg@serg.mylan committed
3352 3353 3354 3355
      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;
3356
      table->lock_type= stab->lock_type;
3357 3358
      table->cacheable_table= 1;
      table->prelocking_placeholder= 1;
3359
      table->belong_to_view= belong_to_view;
3360 3361 3362 3363 3364 3365 3366 3367 3368 3369

      /* 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;
    }
3370
  }
3371 3372

  if (arena)
konstantin@mysql.com's avatar
konstantin@mysql.com committed
3373
    thd->restore_active_arena(arena, &backup);
3374 3375

  DBUG_RETURN(result);
3376 3377
}

3378

3379
/*
3380 3381 3382 3383
  Simple function for adding an explicetly named (systems) table to
  the global table list, e.g. "mysql", "proc".
*/

3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407
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))))
  {
    my_error(ER_OUTOFMEMORY, MYF(0), 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;
  table->select_lex= lex->current_select; // QQ?
  table->cacheable_table= 1;
  
  lex->add_to_query_tables(table);
  return table;
}
3408