sp_head.cc 94.4 KB
Newer Older
1 2 3 4
/* 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
unknown's avatar
unknown committed
5
   the Free Software Foundation; version 2 of the License.
6 7 8 9 10 11 12 13 14 15

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

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

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

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


33 34
#include <my_user.h>

35 36 37
Item_result
sp_map_result_type(enum enum_field_types type)
{
38
  switch (type) {
39
  case MYSQL_TYPE_BIT:
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:
unknown's avatar
unknown committed
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

Item::Type
sp_map_item_type(enum enum_field_types type)
{
  switch (type) {
62
  case MYSQL_TYPE_BIT:
63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83
  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.

84 85
  NOTE: If the item has a string result type, the string is escaped
  according to its character set.
86 87 88 89 90 91 92 93 94 95 96

  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 *
97
sp_get_item_value(THD *thd, Item *item, String *str)
98 99 100 101 102 103 104 105 106 107 108 109 110 111
{
  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;
      
112 113 114
      {
        char buf_holder[STRING_BUFFER_USUAL_SIZE];
        String buf(buf_holder, sizeof(buf_holder), result->charset());
115
        CHARSET_INFO *cs= thd->variables.character_set_client;
116 117 118 119 120 121

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

        buf.append('_');
        buf.append(result->charset()->csname);
122
        if (cs->escape_with_backslash_is_dangerous)
123
          buf.append(' ');
124
        append_query_string(cs, 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
  case SQLCOM_BACKUP_TABLE:
165 166 167
  case SQLCOM_OPTIMIZE:
  case SQLCOM_PRELOAD_KEYS:
  case SQLCOM_ASSIGN_TO_KEYCACHE:
168
  case SQLCOM_CHECKSUM:
169
  case SQLCOM_CHECK:
170
  case SQLCOM_HA_READ:
171
  case SQLCOM_SHOW_AUTHORS:
172 173 174 175 176
  case SQLCOM_SHOW_BINLOGS:
  case SQLCOM_SHOW_BINLOG_EVENTS:
  case SQLCOM_SHOW_CHARSETS:
  case SQLCOM_SHOW_COLLATIONS:
  case SQLCOM_SHOW_COLUMN_TYPES:
177
  case SQLCOM_SHOW_CONTRIBUTORS:
178 179 180 181
  case SQLCOM_SHOW_CREATE:
  case SQLCOM_SHOW_CREATE_DB:
  case SQLCOM_SHOW_CREATE_FUNC:
  case SQLCOM_SHOW_CREATE_PROC:
182
  case SQLCOM_SHOW_CREATE_EVENT:
183 184 185
  case SQLCOM_SHOW_DATABASES:
  case SQLCOM_SHOW_ERRORS:
  case SQLCOM_SHOW_FIELDS:
186
  case SQLCOM_SHOW_FUNC_CODE:
187
  case SQLCOM_SHOW_GRANTS:
188 189 190
  case SQLCOM_SHOW_ENGINE_STATUS:
  case SQLCOM_SHOW_ENGINE_LOGS:
  case SQLCOM_SHOW_ENGINE_MUTEX:
191
  case SQLCOM_SHOW_EVENTS:
192 193 194 195 196 197
  case SQLCOM_SHOW_KEYS:
  case SQLCOM_SHOW_MASTER_STAT:
  case SQLCOM_SHOW_NEW_MASTER:
  case SQLCOM_SHOW_OPEN_TABLES:
  case SQLCOM_SHOW_PRIVILEGES:
  case SQLCOM_SHOW_PROCESSLIST:
198
  case SQLCOM_SHOW_PROC_CODE:
199 200 201 202 203 204 205 206 207
  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:
208 209
  case SQLCOM_REPAIR:
  case SQLCOM_RESTORE_TABLE:
210 211 212 213 214 215 216 217 218 219 220 221 222 223 224
    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;
225 226 227 228 229 230 231 232 233 234 235 236
  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;
237 238 239 240 241 242
  case SQLCOM_FLUSH:
    flags= sp_head::HAS_SQLCOM_FLUSH;
    break;
  case SQLCOM_RESET:
    flags= sp_head::HAS_SQLCOM_RESET;
    break;
243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259
  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:
260
  case SQLCOM_LOAD:
261 262 263 264 265 266 267 268
  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:
269 270 271
  case SQLCOM_CREATE_EVENT:
  case SQLCOM_ALTER_EVENT:
  case SQLCOM_DROP_EVENT:
272 273
  case SQLCOM_INSTALL_PLUGIN:
  case SQLCOM_UNINSTALL_PLUGIN:
274 275
    flags= sp_head::HAS_COMMIT_OR_ROLLBACK;
    break;
276
  default:
277 278
    flags= 0;
    break;
279
  }
280
  return flags;
281 282
}

283 284

/*
285
  Prepare an Item for evaluation (call of fix_fields).
286 287 288 289 290 291 292 293 294 295 296

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

  RETURN
    NULL  error
    prepared item
*/

297
Item *
298 299 300
sp_prepare_func_item(THD* thd, Item **it_addr)
{
  DBUG_ENTER("sp_prepare_func_item");
301
  it_addr= (*it_addr)->this_item_addr(thd, it_addr);
302

303 304 305
  if (!(*it_addr)->fixed &&
      ((*it_addr)->fix_fields(thd, it_addr) ||
       (*it_addr)->check_cols(1)))
306 307 308 309 310 311 312 313
  {
    DBUG_PRINT("info", ("fix_fields() failed"));
    DBUG_RETURN(NULL);
  }
  DBUG_RETURN(*it_addr);
}


314
/*
315
  Evaluate an expression and store the result in the field.
316 317

  SYNOPSIS
318 319 320 321
    sp_eval_expr()
      thd                   - current thread object
      expr_item             - the root item of the expression
      result_field          - the field to store the result
322 323

  RETURN VALUES
324 325
    FALSE  on success
    TRUE   on error
326
*/
327

328
bool
329
sp_eval_expr(THD *thd, Field *result_field, Item **expr_item_ptr)
330
{
331 332
  Item *expr_item;

333
  DBUG_ENTER("sp_eval_expr");
334

unknown's avatar
unknown committed
335
  if (!*expr_item_ptr)
336
    DBUG_RETURN(TRUE);
unknown's avatar
unknown committed
337

338
  if (!(expr_item= sp_prepare_func_item(thd, expr_item_ptr)))
339
    DBUG_RETURN(TRUE);
340

341
  bool err_status= FALSE;
342

343 344 345
  /*
    Set THD flags to emit warnings/errors in case of overflow/type errors
    during saving the item into the field.
346

347 348 349 350 351
    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;
352
  bool save_no_trans_update_stmt= thd->no_trans_update.stmt;
353

354 355 356 357
  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);
358
  thd->no_trans_update.stmt= FALSE;
359

360
  /* Save the value in the field. Convert the value if needed. */
361

362
  expr_item->save_in_field(result_field, 0);
363

364 365
  thd->count_cuted_fields= save_count_cuted_fields;
  thd->abort_on_warning= save_abort_on_warning;
366
  thd->no_trans_update.stmt= save_no_trans_update_stmt;
367

368
  if (thd->net.report_error)
369
  {
370 371
    /* Return error status if something went wrong. */
    err_status= TRUE;
372
  }
373 374

  DBUG_RETURN(err_status);
375 376
}

377 378 379 380 381 382 383 384 385 386

/*
 *
 *  sp_name
 *
 */

void
sp_name::init_qname(THD *thd)
{
387 388 389 390 391
  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;
392
  sprintf(m_qname.str, "%.*s.%.*s",
393 394 395 396
	  m_db.length, (m_db.length ? m_db.str : ""),
	  m_name.length, m_name.str);
}

397

398
/*
unknown's avatar
unknown committed
399 400 401 402 403 404 405 406 407 408
  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
*/
409 410

bool
411
check_routine_name(LEX_STRING *ident)
412
{
413 414 415 416 417 418 419 420 421 422 423 424 425 426
  if (!ident || !ident->str || !ident->str[0] ||
      ident->str[ident->length-1] == ' ')
  {
    my_error(ER_SP_WRONG_NAME, MYF(0), ident->str);
    return TRUE;
  }
  if (check_string_char_length(ident, "", NAME_CHAR_LEN,
                               system_charset_info, 1))
  {
    my_error(ER_TOO_LONG_IDENT, MYF(0), ident->str);
    return TRUE;
  }

  return FALSE;
427
}
428

429 430 431 432 433 434 435 436 437
/* ------------------------------------------------------------------ */


/*
 *
 *  sp_head
 *
 */

438 439 440 441 442 443 444 445
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);
unknown's avatar
unknown committed
446 447
  sp= (sp_head *) alloc_root(&own_root, size);
  sp->main_mem_root= own_root;
448
  DBUG_PRINT("info", ("mem_root 0x%lx", (ulong) &sp->mem_root));
449 450 451 452 453 454 455 456
  DBUG_RETURN(sp);
}

void 
sp_head::operator delete(void *ptr, size_t size)
{
  DBUG_ENTER("sp_head::operator delete");
  MEM_ROOT own_root;
unknown's avatar
unknown committed
457
  sp_head *sp= (sp_head *) ptr;
458

unknown's avatar
unknown committed
459 460
  /* Make a copy of main_mem_root as free_root will free the sp */
  own_root= sp->main_mem_root;
461 462
  DBUG_PRINT("info", ("mem_root 0x%lx moved to 0x%lx",
                      (ulong) &sp->mem_root, (ulong) &own_root));
463 464 465 466 467
  free_root(&own_root, MYF(0));

  DBUG_VOID_RETURN;
}

468

469
sp_head::sp_head()
470
  :Query_arena(&main_mem_root, INITIALIZED_FOR_SP),
471
   m_flags(0), m_recursion_level(0), m_next_cached_sp(0),
472
   m_cont_level(0)
473
{
474
  const LEX_STRING str_reset= { NULL, 0 };
475 476 477 478 479

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

480
  m_return_field_def.charset = NULL;
481 482 483 484 485 486
  /*
    FIXME: the only use case when name is NULL is events, and it should
    be rewritten soon. Remove the else part and replace 'if' with
    an assert when this is done.
  */
  m_db= m_name= m_qname= str_reset;
487

488 489
  extern byte *
    sp_table_key(const byte *ptr, uint *plen, my_bool first);
490
  DBUG_ENTER("sp_head::sp_head");
491 492

  m_backpatch.empty();
493
  m_cont_backpatch.empty();
494
  m_lex.empty();
495
  hash_init(&m_sptabs, system_charset_info, 0, 0, 0, sp_table_key, 0, 0);
496
  hash_init(&m_sroutines, system_charset_info, 0, 0, 0, sp_sroutine_key, 0, 0);
497 498 499
  DBUG_VOID_RETURN;
}

500

501
void
502
sp_head::init(LEX *lex)
503 504
{
  DBUG_ENTER("sp_head::init");
505

506
  lex->spcont= m_pcont= new sp_pcontext();
507

508 509 510 511 512
  /*
    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();
513
  my_init_dynamic_array(&m_instr, sizeof(sp_instr *), 16, 8);
unknown's avatar
unknown committed
514
  m_param_begin= m_param_end= m_body_begin= 0;
515
  m_qname.str= m_db.str= m_name.str= m_params.str=
516 517
    m_body.str= m_defstr.str= 0;
  m_qname.length= m_db.length= m_name.length= m_params.length=
unknown's avatar
unknown committed
518
    m_body.length= m_defstr.length= 0;
519
  m_return_field_def.charset= NULL;
520 521 522
  DBUG_VOID_RETURN;
}

523

524
void
525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547
sp_head::init_sp_name(THD *thd, sp_name *spname)
{
  DBUG_ENTER("sp_head::init_sp_name");

  /* Must be initialized in the parser. */

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

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

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

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

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

  m_qname.length= spname->m_qname.length;
  m_qname.str= strmake_root(thd->mem_root, spname->m_qname.str,
                            m_qname.length);
548 549

  DBUG_VOID_RETURN;
550 551 552
}


553
void
554
sp_head::init_strings(THD *thd, LEX *lex)
555 556
{
  DBUG_ENTER("sp_head::init_strings");
557
  const char *endp;                            /* Used to trim the end */
unknown's avatar
unknown committed
558
  /* During parsing, we must use thd->mem_root */
unknown's avatar
unknown committed
559
  MEM_ROOT *root= thd->mem_root;
560
  Lex_input_stream *lip=thd->m_lip;
561

562
  if (m_param_begin && m_param_end)
563
  {
564
    m_params.length= m_param_end - m_param_begin;
565
    m_params.str= strmake_root(root, m_param_begin, m_params.length);
566
  }
567

568
  /* If ptr has overrun end_of_query then end_of_query is the end */
569
  endp= (lip->ptr > lip->end_of_query ? lip->end_of_query : lip->ptr);
570 571 572 573
  /*
    Trim "garbage" at the end. This is sometimes needed with the
    "/ * ! VERSION... * /" wrapper in dump files.
  */
unknown's avatar
unknown committed
574
  endp= skip_rear_comments(thd->charset(), m_body_begin, endp);
575 576

  m_body.length= endp - m_body_begin;
577
  m_body.str= strmake_root(root, m_body_begin, m_body.length);
578 579
  m_defstr.length= endp - lip->buf;
  m_defstr.str= strmake_root(root, lip->buf, m_defstr.length);
580
  DBUG_VOID_RETURN;
581 582
}

583 584 585

static TYPELIB *
create_typelib(MEM_ROOT *mem_root, create_field *field_def, List<String> *src)
unknown's avatar
unknown committed
586 587
{
  TYPELIB *result= NULL;
588 589
  CHARSET_INFO *cs= field_def->charset;
  DBUG_ENTER("create_typelib");
unknown's avatar
unknown committed
590

unknown's avatar
unknown committed
591 592 593 594 595 596
  if (src->elements)
  {
    result= (TYPELIB*) alloc_root(mem_root, sizeof(TYPELIB));
    result->count= src->elements;
    result->name= "";
    if (!(result->type_names=(const char **)
597
          alloc_root(mem_root,(sizeof(char *)+sizeof(int))*(result->count+1))))
unknown's avatar
unknown committed
598 599
      DBUG_RETURN(0);
    result->type_lengths= (uint*)(result->type_names + result->count+1);
unknown's avatar
unknown committed
600
    List_iterator<String> it(*src);
unknown's avatar
unknown committed
601 602
    String conv;
    for (uint i=0; i < result->count; i++)
603
    {
unknown's avatar
unknown committed
604 605 606 607
      uint32 dummy;
      uint length;
      String *tmp= it++;

608 609 610 611 612
      if (String::needs_conversion(tmp->length(), tmp->charset(),
      				   cs, &dummy))
      {
        uint cnv_errs;
        conv.copy(tmp->ptr(), tmp->length(), tmp->charset(), cs, &cnv_errs);
unknown's avatar
unknown committed
613 614 615 616

        length= conv.length();
        result->type_names[i]= (char*) strmake_root(mem_root, conv.ptr(),
                                                    length);
617
      }
unknown's avatar
unknown committed
618 619 620 621
      else
      {
        length= tmp->length();
        result->type_names[i]= strmake_root(mem_root, tmp->ptr(), length);
622
      }
623 624

      // Strip trailing spaces.
unknown's avatar
unknown committed
625 626 627
      length= cs->cset->lengthsp(cs, result->type_names[i], length);
      result->type_lengths[i]= length;
      ((uchar *)result->type_names[i])[length]= '\0';
628
    }
unknown's avatar
unknown committed
629
    result->type_names[result->count]= 0;
630
    result->type_lengths[result->count]= 0;
unknown's avatar
unknown committed
631
  }
unknown's avatar
unknown committed
632
  DBUG_RETURN(result);
unknown's avatar
unknown committed
633 634
}

635

636 637 638
int
sp_head::create(THD *thd)
{
639
  DBUG_ENTER("sp_head::create");
640 641
  DBUG_PRINT("info", ("type: %d name: %s params: %s body: %s",
		      m_type, m_name.str, m_params.str, m_body.str));
642

unknown's avatar
unknown committed
643
  DBUG_RETURN(sp_create_routine(thd, m_type, this));
644 645
}

646 647
sp_head::~sp_head()
{
unknown's avatar
unknown committed
648
  DBUG_ENTER("sp_head::~sp_head");
649
  destroy();
650
  delete m_next_cached_sp;
651 652
  if (m_thd)
    restore_thd_mem_root(m_thd);
unknown's avatar
unknown committed
653
  DBUG_VOID_RETURN;
654 655
}

656 657 658
void
sp_head::destroy()
{
659 660
  sp_instr *i;
  LEX *lex;
unknown's avatar
unknown committed
661 662
  DBUG_ENTER("sp_head::destroy");
  DBUG_PRINT("info", ("name: %s", m_name.str));
663 664 665

  for (uint ip = 0 ; (i = get_instr(ip)) ; ip++)
    delete i;
666 667
  delete_dynamic(&m_instr);
  m_pcont->destroy();
668
  free_items();
669 670 671 672 673 674 675 676 677 678

  /*
    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);
679 680
  while ((lex= (LEX *)m_lex.pop()))
  {
681
    lex_end(m_thd->lex);
682 683
    delete m_thd->lex;
    m_thd->lex= lex;
684
  }
685

686
  hash_free(&m_sptabs);
687
  hash_free(&m_sroutines);
688
  DBUG_VOID_RETURN;
689
}
690

unknown's avatar
unknown committed
691

692
/*
693 694 695 696
  This is only used for result fields from functions (both during
  fix_length_and_dec() and evaluation).
*/

unknown's avatar
unknown committed
697
Field *
698 699
sp_head::create_result_field(uint field_max_length, const char *field_name,
                             TABLE *table)
unknown's avatar
unknown committed
700
{
701
  uint field_length;
unknown's avatar
unknown committed
702
  Field *field;
703 704 705 706 707 708

  DBUG_ENTER("sp_head::create_result_field");

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

709 710
  field= ::make_field(table->s,                     /* TABLE_SHARE ptr */
                      (char*) 0,                    /* field ptr */
711 712 713 714 715 716 717 718 719
                      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,
720
                      field_name ? field_name : (const char *) m_name.str);
unknown's avatar
unknown committed
721 722 723

  if (field)
    field->init(table);
724
  
unknown's avatar
unknown committed
725 726 727
  DBUG_RETURN(field);
}

728 729 730 731 732 733 734 735 736

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


/*
  StoredRoutinesBinlogging
737 738 739
  This paragraph applies only to statement-based binlogging. Row-based
  binlogging does not need anything special like this.

740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770
  Top-down overview:

  1. Statements

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

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

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

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

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

773
   If the answers are No and Yes, we write the function call into the binary
774
   log as "SELECT spfunc(<param1value>, <param2value>, ...)"
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. 

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

  4.2 Auto_increment storage in binlog

  As we may write two statements to binlog from one single logical statement
  (case of "SELECT func1(),func2()": it is binlogged as "SELECT func1()" and
  then "SELECT func2()"), we need to reset auto_increment binlog variables
  after each binlogged SELECT. Otherwise, the auto_increment value of the
  first SELECT would be used for the second too.
808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826
*/


/*
  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
827 828 829 830
    FALSE  on success
           thd->query{_length} either has been appropriately replaced or there
           is no need for replacements.
    TRUE   out of memory error.
831 832
*/

833 834
static bool
subst_spvars(THD *thd, sp_instr *instr, LEX_STRING *query_str)
835 836 837 838 839
{
  DBUG_ENTER("subst_spvars");
  if (thd->prelocked_mode == NON_PRELOCKED && mysql_bin_log.is_open())
  {
    Dynamic_array<Item_splocal*> sp_vars_uses;
840 841 842
    char *pbuf, *cur, buffer[512];
    String qbuf(buffer, sizeof(buffer), &my_charset_bin);
    int prev_pos, res;
843

844
    /* Find all instances of Item_splocal used in this statement */
845 846
    for (Item *item= instr->free_list; item; item= item->next)
    {
unknown's avatar
unknown committed
847 848 849 850 851 852
      if (item->is_splocal())
      {
        Item_splocal *item_spl= (Item_splocal*)item;
        if (item_spl->pos_in_query)
          sp_vars_uses.append(item_spl);
      }
853 854
    }
    if (!sp_vars_uses.elements())
855
      DBUG_RETURN(FALSE);
856 857 858 859 860 861 862 863 864
      
    /* 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);
865 866
    cur= query_str->str;
    prev_pos= res= 0;
867 868 869
    for (Item_splocal **splocal= sp_vars_uses.front(); 
         splocal < sp_vars_uses.back(); splocal++)
    {
870
      Item *val;
871 872 873 874 875 876

      char str_buffer[STRING_BUFFER_USUAL_SIZE];
      String str_value_holder(str_buffer, sizeof(str_buffer),
                              &my_charset_latin1);
      String *str_value;
      
877
      /* append the text between sp ref occurences */
878
      res|= qbuf.append(cur + prev_pos, (*splocal)->pos_in_query - prev_pos);
879 880 881
      prev_pos= (*splocal)->pos_in_query + (*splocal)->m_name.length;
      
      /* append the spvar substitute */
882
      res|= qbuf.append(STRING_WITH_LEN(" NAME_CONST('"));
883
      res|= qbuf.append((*splocal)->m_name.str, (*splocal)->m_name.length);
884
      res|= qbuf.append(STRING_WITH_LEN("',"));
885 886 887 888 889
      res|= (*splocal)->fix_fields(thd, (Item **) splocal);

      if (res)
        break;

890
      val= (*splocal)->this_item();
unknown's avatar
unknown committed
891
      DBUG_PRINT("info", ("print 0x%lx", (long) val));
892
      str_value= sp_get_item_value(thd, val, &str_value_holder);
893 894 895 896
      if (str_value)
        res|= qbuf.append(*str_value);
      else
        res|= qbuf.append(STRING_WITH_LEN("NULL"));
897
      res|= qbuf.append(')');
898 899 900
      if (res)
        break;
    }
901
    res|= qbuf.append(cur + prev_pos, query_str->length - prev_pos);
902
    if (res)
903
      DBUG_RETURN(TRUE);
904

905
    if (!(pbuf= thd->strmake(qbuf.ptr(), qbuf.length())))
906
      DBUG_RETURN(TRUE);
907 908 909 910

    thd->query= pbuf;
    thd->query_length= qbuf.length();
  }
911
  DBUG_RETURN(FALSE);
912 913 914
}


915 916 917 918 919
/*
  Return appropriate error about recursion limit reaching

  SYNOPSIS
    sp_head::recursion_level_error()
unknown's avatar
unknown committed
920
    thd		Thread handle
921 922 923 924 925 926

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

unknown's avatar
unknown committed
927
void sp_head::recursion_level_error(THD *thd)
928 929 930 931 932
{
  if (m_type == TYPE_ENUM_PROCEDURE)
  {
    my_error(ER_SP_RECURSION_LIMIT, MYF(0),
             thd->variables.max_sp_recursion_depth,
933
             m_name.str);
934 935 936 937 938 939
  }
  else
    my_error(ER_SP_NO_RECURSION, MYF(0));
}


940 941 942 943 944
/*
  Execute the routine. The main instruction jump loop is there 
  Assume the parameters already set.
  
  RETURN
945 946
    FALSE  on success
    TRUE   on error
947 948 949

*/

950 951
bool
sp_head::execute(THD *thd)
952
{
953
  DBUG_ENTER("sp_head::execute");
unknown's avatar
unknown committed
954
  char old_db_buf[NAME_LEN+1];
unknown's avatar
unknown committed
955
  LEX_STRING old_db= { old_db_buf, sizeof(old_db_buf) };
956
  bool dbchanged;
957
  sp_rcontext *ctx;
958
  bool err_status= FALSE;
959
  uint ip= 0;
960
  ulong save_sql_mode;
961
  bool save_abort_on_warning;
unknown's avatar
unknown committed
962
  Query_arena *old_arena;
963 964 965
  /* per-instruction arena */
  MEM_ROOT execute_mem_root;
  Query_arena execute_arena(&execute_mem_root, INITIALIZED_FOR_SP),
unknown's avatar
unknown committed
966
              backup_arena;
967
  query_id_t old_query_id;
968 969 970 971
  TABLE *old_derived_tables;
  LEX *old_lex;
  Item_change_list old_change_list;
  String old_packet;
972

973
  /* Use some extra margin for possible SP recursion and functions */
974
  if (check_stack_overrun(thd, 8 * STACK_MIN_SIZE, (char*)&old_packet))
975
    DBUG_RETURN(TRUE);
976

977 978 979 980
  /* init per-instruction memroot */
  init_alloc_root(&execute_mem_root, MEM_ROOT_BLOCK_SIZE, 0);

  DBUG_ASSERT(!(m_flags & IS_INVOKED));
981
  m_flags|= IS_INVOKED;
982
  m_first_instance->m_first_free_instance= m_next_cached_sp;
unknown's avatar
unknown committed
983 984 985 986 987 988 989 990 991
  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));
  }
992 993 994 995 996 997 998 999 1000
  /*
    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));
1001

unknown's avatar
unknown committed
1002 1003 1004 1005 1006 1007
  /*
    NOTE: The SQL Standard does not specify the context that should be
    preserved for stored routines. However, at SAP/Walldorf meeting it was
    decided that current database should be preserved.
  */

1008
  if (m_db.length &&
unknown's avatar
unknown committed
1009
      (err_status= sp_use_new_db(thd, m_db, &old_db, 0, &dbchanged)))
1010
    goto done;
1011

1012
  if ((ctx= thd->spcont))
1013
    ctx->clear_handler();
1014
  thd->query_error= 0;
unknown's avatar
unknown committed
1015
  old_arena= thd->stmt_arena;
1016

1017 1018 1019 1020 1021 1022 1023
  /*
    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;
1024 1025
  save_sql_mode= thd->variables.sql_mode;
  thd->variables.sql_mode= m_sql_mode;
1026
  save_abort_on_warning= thd->abort_on_warning;
1027
  thd->abort_on_warning= 0;
1028

1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049
  /*
    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);

1050 1051 1052 1053
  /*
    Switch to per-instruction arena here. We can do it since we cleanup
    arena after every instruction.
  */
unknown's avatar
unknown committed
1054
  thd->set_n_backup_active_arena(&execute_arena, &backup_arena);
1055 1056 1057 1058 1059

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

1062 1063 1064
  do
  {
    sp_instr *i;
1065
    uint hip;			// Handler ip
1066 1067 1068 1069 1070

    i = get_instr(ip);	// Returns NULL when we're done.
    if (i == NULL)
      break;
    DBUG_PRINT("execute", ("Instruction %u", ip));
1071 1072 1073
    /* Don't change NOW() in FUNCTION or TRIGGER */
    if (!thd->in_sub_stmt)
      thd->set_time();		// Make current_time() et al work
1074
    
1075
    /*
unknown's avatar
unknown committed
1076
      We have to set thd->stmt_arena before executing the instruction
1077 1078 1079 1080
      to store in the instruction free_list all new items, created
      during the first execution (for example expanding of '*' or the
      items made during other permanent subquery transformations).
    */
unknown's avatar
unknown committed
1081
    thd->stmt_arena= i;
1082
    
1083 1084 1085 1086 1087
    /* 
      Will write this SP statement into binlog separately 
      (TODO: consider changing the condition to "not inside event union")
    */
    if (thd->prelocked_mode == NON_PRELOCKED)
1088 1089
      thd->user_var_events_alloc= thd->mem_root;
    
1090
    err_status= i->execute(thd, &ip);
1091

1092
    /*
1093 1094 1095
      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)
1096 1097
    */
    thd->net.no_send_error= 0;
1098 1099
    if (i->free_list)
      cleanup_items(i->free_list);
1100 1101 1102 1103 1104 1105 1106 1107 1108 1109
    
    /* 
      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
    }
1110

1111
    /* we should cleanup free_list and memroot, used by instruction */
1112
    thd->cleanup_after_query();
1113
    free_root(&execute_mem_root, MYF(0));    
1114

unknown's avatar
unknown committed
1115 1116
    /*
      Check if an exception has occurred and a handler has been found
1117 1118 1119 1120
      Note: We have to check even if err_status == FALSE, since warnings (and
      some errors) don't return a non-zero value. We also have to check even
      if thd->killed != 0, since some errors return with this even when a
      handler has been found (e.g. "bad data").
unknown's avatar
unknown committed
1121
    */
1122
    if (ctx)
1123 1124 1125
    {
      uint hf;

1126
      switch (ctx->found_handler(&hip, &hf)) {
1127 1128 1129
      case SP_HANDLER_NONE:
	break;
      case SP_HANDLER_CONTINUE:
unknown's avatar
unknown committed
1130 1131
        thd->restore_active_arena(&execute_arena, &backup_arena);
        thd->set_n_backup_active_arena(&execute_arena, &backup_arena);
1132
        ctx->push_hstack(i->get_cont_dest());
unknown's avatar
unknown committed
1133
        // Fall through
1134 1135
      default:
	ip= hip;
1136
	err_status= FALSE;
1137
	ctx->clear_handler();
1138
	ctx->enter_handler(hip);
unknown's avatar
unknown committed
1139
        thd->clear_error();
1140
        thd->is_fatal_error= 0;
1141
	thd->killed= THD::NOT_KILLED;
1142
        thd->mysys_var->abort= 0;
1143 1144 1145
	continue;
      }
    }
1146
  } while (!err_status && !thd->killed);
1147

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

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

1152 1153 1154 1155 1156 1157 1158 1159 1160 1161
  /* 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;
1162
  thd->variables.sql_mode= save_sql_mode;
1163
  thd->abort_on_warning= save_abort_on_warning;
1164

unknown's avatar
unknown committed
1165
  thd->stmt_arena= old_arena;
1166
  state= EXECUTED;
1167

1168
 done:
1169 1170 1171
  DBUG_PRINT("info", ("err_status: %d  killed: %d  query_error: %d  report_error: %d",
		      err_status, thd->killed, thd->query_error,
                      thd->net.report_error));
1172

unknown's avatar
unknown committed
1173
  if (thd->killed)
1174
    err_status= TRUE;
1175 1176 1177 1178
  /*
    If the DB has changed, the pointer has changed too, but the
    original thd->db will then have been freed
  */
1179
  if (dbchanged)
1180
  {
1181 1182
    /*
      No access check when changing back to where we came from.
unknown's avatar
unknown committed
1183
      (It would generate an error from mysql_change_db() when old_db=="")
1184
    */
1185
    if (! thd->killed)
1186
      err_status|= mysql_change_db(thd, &old_db, TRUE);
1187
  }
1188
  m_flags&= ~IS_INVOKED;
1189 1190 1191 1192 1193
  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));
1194 1195 1196 1197 1198 1199 1200 1201 1202
  /*
    Check that we have one of following:

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

    2) There are some free instances which mean that first free instance
    should go just after this one and recursion level of that free instance
unknown's avatar
unknown committed
1203
    should be on 1 more then recursion level of this instance.
1204 1205 1206 1207 1208 1209 1210 1211 1212
  */
  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;
1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241

  DBUG_RETURN(err_status);
}


#ifndef NO_EMBEDDED_ACCESS_CHECKS
/*
  set_routine_security_ctx() changes routine security context, and
  checks if there is an EXECUTE privilege in new context.  If there is
  no EXECUTE privilege, it changes the context back and returns a
  error.

  SYNOPSIS
    set_routine_security_ctx()
      thd         thread handle
      sp          stored routine to change the context for
      is_proc     TRUE is procedure, FALSE if function
      save_ctx    pointer to an old security context
   
  RETURN
    TRUE if there was a error, and the context wasn't changed.
    FALSE if the context was changed.
*/

bool
set_routine_security_ctx(THD *thd, sp_head *sp, bool is_proc,
                         Security_context **save_ctx)
{
  *save_ctx= 0;
1242 1243 1244 1245 1246
  if (sp->m_chistics->suid != SP_IS_NOT_SUID &&
      sp->m_security_ctx.change_security_context(thd, &sp->m_definer_user,
                                                 &sp->m_definer_host,
                                                 &sp->m_db,
                                                 save_ctx))
1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262
    return TRUE;

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

    TODO:
      Cache if the definer has the right to use the object on the
      first usage and only reset the cache if someone does a GRANT
      statement that 'may' affect this.
  */
  if (*save_ctx &&
      check_routine_access(thd, EXECUTE_ACL,
                           sp->m_db.str, sp->m_name.str, is_proc, FALSE))
  {
1263
    sp->m_security_ctx.restore_security_context(thd, *save_ctx);
1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345
    *save_ctx= 0;
    return TRUE;
  }

  return FALSE;
}
#endif // ! NO_EMBEDDED_ACCESS_CHECKS


/*
  Execute a trigger:
   - changes security context for triggers
   - switch to new memroot
   - call sp_head::execute
   - restore old memroot
   - restores security context

  SYNOPSIS
    sp_head::execute_trigger()
      thd               Thread handle
      db                database name
      table             table name
      grant_info        GRANT_INFO structure to be filled with
                        information about definer's privileges
                        on subject table
   
  RETURN
    FALSE  on success
    TRUE   on error
*/

bool
sp_head::execute_trigger(THD *thd, const char *db, const char *table,
                         GRANT_INFO *grant_info)
{
  sp_rcontext *octx = thd->spcont;
  sp_rcontext *nctx = NULL;
  bool err_status= FALSE;
  MEM_ROOT call_mem_root;
  Query_arena call_arena(&call_mem_root, Query_arena::INITIALIZED_FOR_SP);
  Query_arena backup_arena;

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

  /*
    Prepare arena and memroot for objects which lifetime is whole
    duration of trigger call (sp_rcontext, it's tables and items,
    sp_cursor and Item_cache holders for case expressions).  We can't
    use caller's arena/memroot for those objects because in this case
    some fixed amount of memory will be consumed for each trigger
    invocation and so statements which involve lot of them will hog
    memory.

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

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

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

  thd->spcont= nctx;

  err_status= execute(thd);

err_with_cleanup:
  thd->restore_active_arena(&call_arena, &backup_arena);
  delete nctx;
  call_arena.free_items();
  free_root(&call_mem_root, MYF(0));
  thd->spcont= octx;

1346
  DBUG_RETURN(err_status);
1347 1348 1349
}


1350 1351 1352
/*
  Execute a function:
   - evaluate parameters
1353 1354
   - changes security context for SUID routines
   - switch to new memroot
1355
   - call sp_head::execute
1356
   - restore old memroot
1357
   - evaluate the return value
1358
   - restores security context
1359 1360 1361

  SYNOPSIS
    sp_head::execute_function()
1362 1363 1364 1365 1366 1367
      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.
1368 1369
   
  RETURN
1370 1371
    FALSE  on success
    TRUE   on error
1372 1373
*/

1374 1375 1376
bool
sp_head::execute_function(THD *thd, Item **argp, uint argcount,
                          Field *return_value_fld)
1377
{
1378 1379
  ulonglong binlog_save_options;
  bool need_binlog_call;
1380
  uint arg_no;
1381 1382
  sp_rcontext *octx = thd->spcont;
  sp_rcontext *nctx = NULL;
1383 1384
  char buf[STRING_BUFFER_USUAL_SIZE];
  String binlog_buf(buf, sizeof(buf), &my_charset_bin);
1385
  bool err_status= FALSE;
1386 1387 1388
  MEM_ROOT call_mem_root;
  Query_arena call_arena(&call_mem_root, Query_arena::INITIALIZED_FOR_SP);
  Query_arena backup_arena;
1389 1390 1391
  DBUG_ENTER("sp_head::execute_function");
  DBUG_PRINT("info", ("function %s", m_name.str));

1392
  LINT_INIT(binlog_save_options);
1393 1394 1395 1396 1397 1398 1399

  /*
    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.
  */
1400
  if (argcount != m_pcont->context_var_count())
unknown's avatar
unknown committed
1401
  {
unknown's avatar
unknown committed
1402
    /*
1403
      Need to use my_error here, or it will not terminate the
unknown's avatar
unknown committed
1404 1405
      invoking query properly.
    */
1406
    my_error(ER_SP_WRONG_NO_OF_ARGS, MYF(0),
1407
             "FUNCTION", m_qname.str, m_pcont->context_var_count(), argcount);
1408
    DBUG_RETURN(TRUE);
unknown's avatar
unknown committed
1409
  }
1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422
  /*
    Prepare arena and memroot for objects which lifetime is whole
    duration of function call (sp_rcontext, it's tables and items,
    sp_cursor and Item_cache holders for case expressions).
    We can't use caller's arena/memroot for those objects because
    in this case some fixed amount of memory will be consumed for
    each function/trigger invocation and so statements which involve
    lot of them will hog memory.
    TODO: we should create sp_rcontext once per command and reuse
    it on subsequent executions of a function/trigger.
  */
  init_sql_alloc(&call_mem_root, MEM_ROOT_BLOCK_SIZE, 0);
  thd->set_n_backup_active_arena(&call_arena, &backup_arena);
1423 1424 1425 1426

  if (!(nctx= new sp_rcontext(m_pcont, return_value_fld, octx)) ||
      nctx->init(thd))
  {
1427 1428 1429
    thd->restore_active_arena(&call_arena, &backup_arena);
    err_status= TRUE;
    goto err_with_cleanup;
1430 1431
  }

1432 1433 1434 1435 1436 1437 1438 1439
  /*
    We have to switch temporarily back to callers arena/memroot.
    Function arguments belong to the caller and so the may reference
    memory which they will allocate during calculation long after
    this function call will be finished (e.g. in Item::cleanup()).
  */
  thd->restore_active_arena(&call_arena, &backup_arena);

1440
#ifndef DBUG_OFF
1441
  nctx->sp= this;
1442
#endif
1443 1444

  /* Pass arguments. */
1445
  for (arg_no= 0; arg_no < argcount; arg_no++)
1446
  {
1447 1448
    /* Arguments must be fixed in Item_func_sp::fix_fields */
    DBUG_ASSERT(argp[arg_no]->fixed);
1449

1450
    if ((err_status= nctx->set_variable(thd, arg_no, &(argp[arg_no]))))
1451
      goto err_with_cleanup;
1452
  }
1453

1454 1455 1456 1457 1458
  /*
    If row-based binlogging, we don't need to binlog the function's call, let
    each substatement be binlogged its way.
  */
  need_binlog_call= mysql_bin_log.is_open() &&
1459
    (thd->options & OPTION_BIN_LOG) && !thd->current_stmt_binlog_row_based;
1460

1461 1462 1463 1464 1465
  /*
    Remember the original arguments for unrolled replication of functions
    before they are changed by execution.
  */
  if (need_binlog_call)
1466
  {
1467 1468
    binlog_buf.length(0);
    binlog_buf.append(STRING_WITH_LEN("SELECT "));
1469 1470
    append_identifier(thd, &binlog_buf, m_db.str, m_db.length);
    binlog_buf.append('.');
1471 1472 1473
    append_identifier(thd, &binlog_buf, m_name.str, m_name.length);
    binlog_buf.append('(');
    for (arg_no= 0; arg_no < argcount; arg_no++)
1474
    {
1475 1476
      String str_value_holder;
      String *str_value;
1477

1478 1479
      if (arg_no)
        binlog_buf.append(',');
1480

1481
      str_value= sp_get_item_value(thd, nctx->get_item(arg_no),
1482
                                   &str_value_holder);
1483

1484 1485 1486 1487 1488 1489
      if (str_value)
        binlog_buf.append(*str_value);
      else
        binlog_buf.append(STRING_WITH_LEN("NULL"));
    }
    binlog_buf.append(')');
1490
  }
1491 1492
  thd->spcont= nctx;

1493 1494 1495 1496 1497 1498 1499 1500 1501
#ifndef NO_EMBEDDED_ACCESS_CHECKS
  Security_context *save_security_ctx;
  if (set_routine_security_ctx(thd, this, FALSE, &save_security_ctx))
  {
    err_status= TRUE;
    goto err_with_cleanup;
  }
#endif

1502
  if (need_binlog_call)
1503
  {
1504
    query_id_t q;
1505
    reset_dynamic(&thd->user_var_events);
1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518
    /*
      In case of artificially constructed events for function calls
      we have separate union for each such event and hence can't use
      query_id of real calling statement as the start of all these
      unions (this will break logic of replication of user-defined
      variables). So we use artifical value which is guaranteed to
      be greater than all query_id's of all statements belonging
      to previous events/unions.
      Possible alternative to this is logging of all function invocations
      as one select and not resetting THD::user_var_events before
      each invocation.
    */
    VOID(pthread_mutex_lock(&LOCK_thread_count));
1519
    q= global_query_id;
1520 1521
    VOID(pthread_mutex_unlock(&LOCK_thread_count));
    mysql_bin_log.start_union_events(thd, q + 1);
1522 1523
    binlog_save_options= thd->options;
    thd->options&= ~OPTION_BIN_LOG;
1524
  }
1525

1526 1527 1528 1529 1530 1531 1532 1533 1534 1535
  /*
    Switch to call arena/mem_root so objects like sp_cursor or
    Item_cache holders for case expressions can be allocated on it.

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

1536
  err_status= execute(thd);
1537

1538 1539
  thd->restore_active_arena(&call_arena, &backup_arena);

1540
  if (need_binlog_call)
1541
  {
1542 1543 1544
    mysql_bin_log.stop_union_events(thd);
    thd->options= binlog_save_options;
    if (thd->binlog_evt_union.unioned_events)
1545
    {
1546
      Query_log_event qinfo(thd, binlog_buf.ptr(), binlog_buf.length(),
1547 1548 1549 1550 1551 1552 1553 1554 1555
                            thd->binlog_evt_union.unioned_events_trans, FALSE);
      if (mysql_bin_log.write(&qinfo) &&
          thd->binlog_evt_union.unioned_events_trans)
      {
        push_warning(thd, MYSQL_ERROR::WARN_LEVEL_WARN, ER_UNKNOWN_ERROR,
                     "Invoked ROUTINE modified a transactional table but MySQL "
                     "failed to reflect this change in the binary log");
      }
      reset_dynamic(&thd->user_var_events);
1556 1557 1558
      /* Forget those values, in case more function calls are binlogged: */
      thd->stmt_depends_on_first_successful_insert_id_in_prev_stmt= 0;
      thd->auto_inc_intervals_in_cur_stmt_for_binlog.empty();
1559 1560
    }
  }
1561

1562
  if (!err_status)
1563
  {
1564
    /* We need result only in function but not in trigger */
1565

1566
    if (!nctx->is_return_value_set())
1567
    {
1568
      my_error(ER_SP_NORETURNEND, MYF(0), m_name.str);
1569
      err_status= TRUE;
1570 1571
    }
  }
1572

1573
#ifndef NO_EMBEDDED_ACCESS_CHECKS
1574
  m_security_ctx.restore_security_context(thd, save_security_ctx);
1575
#endif
1576 1577

err_with_cleanup:
1578
  delete nctx;
1579 1580
  call_arena.free_items();
  free_root(&call_mem_root, MYF(0));
1581
  thd->spcont= octx;
1582

1583
  DBUG_RETURN(err_status);
1584 1585
}

1586

1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597
/*
  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 
1598
   - changes security context for SUID routines
1599 1600
   - call sp_head::execute
   - copy back values of INOUT and OUT parameters
1601
   - restores security context
1602 1603

  RETURN
1604 1605
    FALSE  on success
    TRUE   on error
1606 1607
*/

1608 1609
bool
sp_head::execute_procedure(THD *thd, List<Item> *args)
1610
{
1611
  bool err_status= FALSE;
1612
  uint params = m_pcont->context_var_count();
1613
  sp_rcontext *save_spcont, *octx;
1614
  sp_rcontext *nctx = NULL;
unknown's avatar
unknown committed
1615
  bool save_enable_slow_log= false;
1616
  bool save_log_general= false;
1617 1618
  DBUG_ENTER("sp_head::execute_procedure");
  DBUG_PRINT("info", ("procedure %s", m_name.str));
1619

unknown's avatar
unknown committed
1620 1621
  if (args->elements != params)
  {
1622
    my_error(ER_SP_WRONG_NO_OF_ARGS, MYF(0), "PROCEDURE",
1623
             m_qname.str, params, args->elements);
1624
    DBUG_RETURN(TRUE);
unknown's avatar
unknown committed
1625 1626
  }

1627
  save_spcont= octx= thd->spcont;
1628 1629
  if (! octx)
  {				// Create a temporary old context
1630 1631 1632 1633 1634 1635 1636
    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);
    }
    
1637
#ifndef DBUG_OFF
1638
    octx->sp= 0;
1639
#endif
1640 1641 1642 1643 1644 1645
    thd->spcont= octx;

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

1646 1647
  if (!(nctx= new sp_rcontext(m_pcont, NULL, octx)) ||
      nctx->init(thd))
1648
  {
1649
    delete nctx; /* Delete nctx if it was init() that failed. */
1650
    thd->spcont= save_spcont;
1651
    DBUG_RETURN(TRUE);
1652
  }
1653
#ifndef DBUG_OFF
1654
  nctx->sp= this;
1655
#endif
1656

1657
  if (params > 0)
1658
  {
1659
    List_iterator<Item> it_args(*args);
1660

1661
    DBUG_PRINT("info",(" %.*s: eval args", m_name.length, m_name.str));
1662 1663

    for (uint i= 0 ; i < params ; i++)
1664
    {
1665
      Item *arg_item= it_args++;
1666

1667 1668 1669
      if (!arg_item)
        break;

1670 1671
      sp_variable_t *spvar= m_pcont->find_variable(i);

1672
      if (!spvar)
1673 1674
        continue;

1675
      if (spvar->mode != sp_param_in)
1676
      {
1677 1678 1679 1680
        Settable_routine_parameter *srp=
          arg_item->get_settable_routine_parameter();

        if (!srp)
1681 1682 1683 1684 1685
        {
          my_error(ER_SP_NOT_VAR_ARG, MYF(0), i+1, m_qname.str);
          err_status= TRUE;
          break;
        }
1686 1687

        srp->set_required_privilege(spvar->mode == sp_param_inout);
1688 1689
      }

1690
      if (spvar->mode == sp_param_out)
1691 1692 1693 1694
      {
        Item_null *null_item= new Item_null();

        if (!null_item ||
1695
            nctx->set_variable(thd, i, (Item **)&null_item))
1696 1697 1698 1699 1700 1701 1702
        {
          err_status= TRUE;
          break;
        }
      }
      else
      {
1703
        if (nctx->set_variable(thd, i, it_args.ref()))
1704 1705 1706 1707
        {
          err_status= TRUE;
          break;
        }
1708
      }
1709
    }
1710

1711 1712
    /* 
      Okay, got values for all arguments. Close tables that might be used by 
1713 1714
      arguments evaluation. If arguments evaluation required prelocking mode, 
      we'll leave it here.
1715 1716
    */
    if (!thd->in_sub_stmt)
1717
      close_thread_tables(thd, 0, 0);
1718 1719

    DBUG_PRINT("info",(" %.*s: eval args done", m_name.length, m_name.str));
1720
  }
1721
  if (!(m_flags & LOG_SLOW_STATEMENTS) && thd->enable_slow_log)
unknown's avatar
unknown committed
1722 1723
  {
    DBUG_PRINT("info", ("Disabling slow log for the execution"));
1724
    save_enable_slow_log= true;
unknown's avatar
unknown committed
1725 1726
    thd->enable_slow_log= FALSE;
  }
1727 1728 1729 1730 1731 1732 1733
  if (!(m_flags & LOG_GENERAL_LOG) && !(thd->options & OPTION_LOG_OFF))
  {
    DBUG_PRINT("info", ("Disabling general log for the execution"));
    save_log_general= true;
    /* disable this bit */
    thd->options |= OPTION_LOG_OFF;
  }
1734 1735
  thd->spcont= nctx;

1736 1737 1738 1739 1740 1741
#ifndef NO_EMBEDDED_ACCESS_CHECKS
  Security_context *save_security_ctx= 0;
  if (!err_status)
    err_status= set_routine_security_ctx(thd, this, TRUE, &save_security_ctx);
#endif

1742 1743
  if (!err_status)
    err_status= execute(thd);
1744

1745 1746 1747 1748
  if (save_log_general)
    thd->options &= ~OPTION_LOG_OFF;
  if (save_enable_slow_log)
    thd->enable_slow_log= true;
1749 1750 1751 1752 1753 1754 1755
  /*
    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;
1756

1757
  if (!err_status && params > 0)
1758
  {
1759
    List_iterator<Item> it_args(*args);
1760

unknown's avatar
unknown committed
1761 1762 1763 1764
    /*
      Copy back all OUT or INOUT values to the previous frame, or
      set global user variables
    */
1765
    for (uint i= 0 ; i < params ; i++)
1766
    {
1767 1768 1769 1770 1771
      Item *arg_item= it_args++;

      if (!arg_item)
        break;

1772
      sp_variable_t *spvar= m_pcont->find_variable(i);
1773

1774
      if (spvar->mode == sp_param_in)
1775 1776
        continue;

1777 1778 1779 1780 1781
      Settable_routine_parameter *srp=
        arg_item->get_settable_routine_parameter();

      DBUG_ASSERT(srp);

1782
      if (srp->set_value(thd, octx, nctx->get_item_addr(i)))
1783
      {
1784 1785
        err_status= TRUE;
        break;
1786
      }
1787 1788 1789
    }
  }

1790 1791
#ifndef NO_EMBEDDED_ACCESS_CHECKS
  if (save_security_ctx)
1792
    m_security_ctx.restore_security_context(thd, save_security_ctx);
1793 1794
#endif

1795
  if (!save_spcont)
1796
    delete octx;
1797

1798
  delete nctx;
1799
  thd->spcont= save_spcont;
1800

1801
  DBUG_RETURN(err_status);
1802 1803 1804
}


1805
// Reset lex during parsing, before we parse a sub statement.
1806 1807 1808
void
sp_head::reset_lex(THD *thd)
{
1809 1810
  DBUG_ENTER("sp_head::reset_lex");
  LEX *sublex;
1811
  LEX *oldlex= thd->lex;
1812

1813
  (void)m_lex.push_front(oldlex);
1814
  thd->lex= sublex= new st_lex;
unknown's avatar
unknown committed
1815

1816 1817
  /* Reset most stuff. */
  lex_start(thd);
unknown's avatar
unknown committed
1818

1819
  /* And keep the SP stuff too */
1820 1821
  sublex->sphead= oldlex->sphead;
  sublex->spcont= oldlex->spcont;
1822 1823
  /* And trigger related stuff too */
  sublex->trg_chistics= oldlex->trg_chistics;
1824
  sublex->trg_table_fields.empty();
1825
  sublex->sp_lex_in_use= FALSE;
1826

unknown's avatar
unknown committed
1827 1828
  sublex->in_comment= oldlex->in_comment;

1829 1830 1831 1832 1833 1834 1835 1836
  /* Reset type info. */

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

1837
  DBUG_VOID_RETURN;
1838 1839
}

1840
// Restore lex during parsing, after we have parsed a sub statement.
1841 1842 1843
void
sp_head::restore_lex(THD *thd)
{
1844 1845
  DBUG_ENTER("sp_head::restore_lex");
  LEX *sublex= thd->lex;
1846 1847 1848 1849
  LEX *oldlex= (LEX *)m_lex.pop();

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

1851
  oldlex->trg_table_fields.push_back(&sublex->trg_table_fields);
1852

unknown's avatar
unknown committed
1853 1854 1855 1856 1857
  /*
    If this substatement needs row-based, the entire routine does too (we
    cannot switch from statement-based to row-based only for this
    substatement).
  */
1858
  if (sublex->is_stmt_unsafe())
unknown's avatar
unknown committed
1859 1860
    m_flags|= BINLOG_ROW_BASED_IF_MIXED;

1861
  /*
1862 1863
    Add routines which are used by statement to respective set for
    this routine.
1864
  */
1865
  sp_update_sp_used_routines(&m_sroutines, &sublex->sroutines);
1866 1867 1868 1869 1870
  /*
    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);
1871
  if (! sublex->sp_lex_in_use)
1872 1873
  {
    lex_end(sublex);
1874
    delete sublex;
1875
  }
1876
  thd->lex= oldlex;
1877
  DBUG_VOID_RETURN;
1878 1879
}

1880
void
1881
sp_head::push_backpatch(sp_instr *i, sp_label_t *lab)
1882
{
1883
  bp_t *bp= (bp_t *)sql_alloc(sizeof(bp_t));
1884 1885 1886 1887 1888 1889 1890

  if (bp)
  {
    bp->lab= lab;
    bp->instr= i;
    (void)m_backpatch.push_front(bp);
  }
1891 1892 1893
}

void
1894
sp_head::backpatch(sp_label_t *lab)
1895
{
1896
  bp_t *bp;
1897
  uint dest= instructions();
1898
  List_iterator_fast<bp_t> li(m_backpatch);
1899

1900
  while ((bp= li++))
1901
  {
1902 1903
    if (bp->lab == lab)
      bp->instr->backpatch(dest, lab->ctx);
1904 1905 1906
  }
}

1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927
/*
  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)
{
1928
  HA_CREATE_INFO sp_db_info;
1929 1930 1931 1932
  LEX_STRING cmt = { 0, 0 };
  uint unused1= 0;
  int unused2= 0;

1933 1934
  load_db_opt_by_name(thd, m_db.str, &sp_db_info);

1935 1936 1937
  if (field_def->init(thd, (char*) "", field_type, lex->length, lex->dec,
                      lex->type, (Item*) 0, (Item*) 0, &cmt, 0,
                      &lex->interval_list,
1938 1939
                      (lex->charset ? lex->charset :
                                      sp_db_info.default_table_charset),
1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958
                      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;
}


1959
void
1960
sp_head::new_cont_backpatch(sp_instr_opt_meta *i)
1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971
{
  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
1972
sp_head::add_cont_backpatch(sp_instr_opt_meta *i)
1973 1974 1975 1976 1977 1978 1979 1980 1981 1982
{
  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--;
1983
  sp_instr_opt_meta *i;
1984 1985 1986 1987 1988 1989 1990 1991

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

1992
void
1993
sp_head::set_info(longlong created, longlong modified,
1994
		  st_sp_chistics *chistics, ulong sql_mode)
1995 1996 1997
{
  m_created= created;
  m_modified= modified;
unknown's avatar
unknown committed
1998 1999
  m_chistics= (st_sp_chistics *) memdup_root(mem_root, (char*) chistics,
                                             sizeof(*chistics));
2000 2001 2002
  if (m_chistics->comment.length == 0)
    m_chistics->comment.str= 0;
  else
unknown's avatar
unknown committed
2003
    m_chistics->comment.str= strmake_root(mem_root,
2004 2005
					  m_chistics->comment.str,
					  m_chistics->comment.length);
2006
  m_sql_mode= sql_mode;
2007 2008
}

2009 2010

void
unknown's avatar
unknown committed
2011
sp_head::set_definer(const char *definer, uint definerlen)
2012
{
unknown's avatar
unknown committed
2013
  char user_name_holder[USERNAME_LENGTH + 1];
unknown's avatar
unknown committed
2014
  LEX_STRING user_name= { user_name_holder, USERNAME_LENGTH };
2015

2016
  char host_name_holder[HOSTNAME_LENGTH + 1];
2017
  LEX_STRING host_name= { host_name_holder, HOSTNAME_LENGTH };
2018

2019 2020
  parse_user(definer, definerlen, user_name.str, &user_name.length,
             host_name.str, &host_name.length);
2021

2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033
  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;
2034 2035 2036
}


2037 2038 2039
void
sp_head::reset_thd_mem_root(THD *thd)
{
2040
  DBUG_ENTER("sp_head::reset_thd_mem_root");
2041
  m_thd_root= thd->mem_root;
unknown's avatar
unknown committed
2042
  thd->mem_root= &main_mem_root;
2043 2044 2045
  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
2046 2047
  thd->free_list= NULL;	// Start a new one
  m_thd= thd;
2048
  DBUG_VOID_RETURN;
2049 2050 2051 2052 2053
}

void
sp_head::restore_thd_mem_root(THD *thd)
{
2054 2055
  DBUG_ENTER("sp_head::restore_thd_mem_root");
  Item *flist= free_list;	// The old list
unknown's avatar
unknown committed
2056
  set_query_arena(thd);         // Get new free_list and mem_root
2057
  state= INITIALIZED_FOR_SP;
2058

2059 2060
  DBUG_PRINT("info", ("mem_root 0x%lx returned from thd mem root 0x%lx",
                      (ulong) &mem_root, (ulong) &thd->mem_root));
2061 2062 2063
  thd->free_list= flist;	// Restore the old one
  thd->mem_root= m_thd_root;
  m_thd= NULL;
2064
  DBUG_VOID_RETURN;
2065 2066 2067
}


2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082
/*
  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)
2083 2084 2085 2086 2087
{
  TABLE_LIST tables;
  bzero((char*) &tables,sizeof(tables));
  tables.db= (char*) "mysql";
  tables.table_name= tables.alias= (char*) "proc";
2088
  *full_access= (!check_table_access(thd, SELECT_ACL, &tables, 1) ||
2089 2090 2091 2092
                 (!strcmp(sp->m_definer_user.str,
                          thd->security_ctx->priv_user) &&
                  !strcmp(sp->m_definer_host.str,
                          thd->security_ctx->priv_host)));
2093
  if (!*full_access)
2094 2095
    return check_some_routine_access(thd, sp->m_db.str, sp->m_name.str,
                                     sp->m_type == TYPE_ENUM_PROCEDURE);
2096 2097 2098 2099
  return 0;
}


unknown's avatar
unknown committed
2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113
/**
  Implement SHOW CREATE statement for stored routines.

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

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

bool
sp_head::show_create_routine(THD *thd, int type)
unknown's avatar
unknown committed
2114
{
unknown's avatar
unknown committed
2115 2116 2117 2118 2119 2120 2121 2122
  const char *col1_caption= type == TYPE_ENUM_PROCEDURE ?
                            "Procedure" : "Function";

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

  bool err_status;

unknown's avatar
unknown committed
2123
  Protocol *protocol= thd->protocol;
unknown's avatar
unknown committed
2124 2125
  List<Item> fields;

2126
  LEX_STRING sql_mode;
unknown's avatar
unknown committed
2127

2128
  bool full_access;
unknown's avatar
unknown committed
2129 2130 2131 2132 2133 2134

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

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

2136
  if (check_show_routine_access(thd, this, &full_access))
unknown's avatar
unknown committed
2137 2138 2139 2140 2141 2142 2143
    DBUG_RETURN(TRUE);

  sys_var_thd_sql_mode::symbolic_mode_representation(
      thd, m_sql_mode, &sql_mode);

  /* Send header. */

unknown's avatar
unknown committed
2144
  fields.push_back(new Item_empty_string(col1_caption, NAME_CHAR_LEN));
unknown's avatar
unknown committed
2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169
  fields.push_back(new Item_empty_string("sql_mode", sql_mode.length));

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

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

    stmt_fld->maybe_null= TRUE;

    fields.push_back(stmt_fld);
  }

  if (protocol->send_fields(&fields,
                            Protocol::SEND_NUM_ROWS | Protocol::SEND_EOF))
  {
    DBUG_RETURN(TRUE);
  }

  /* Send data. */

unknown's avatar
unknown committed
2170
  protocol->prepare_for_resend();
unknown's avatar
unknown committed
2171

unknown's avatar
unknown committed
2172
  protocol->store(m_name.str, m_name.length, system_charset_info);
unknown's avatar
unknown committed
2173 2174
  protocol->store(sql_mode.str, sql_mode.length, system_charset_info);

2175
  if (full_access)
unknown's avatar
unknown committed
2176
    protocol->store(m_defstr.str, m_defstr.length, &my_charset_bin);
2177 2178
  else
    protocol->store_null();
2179

unknown's avatar
unknown committed
2180 2181 2182 2183 2184 2185
  err_status= protocol->write();

  if (!err_status)
    send_eof(thd);

  DBUG_RETURN(err_status);
unknown's avatar
unknown committed
2186 2187
}

2188

unknown's avatar
unknown committed
2189 2190


2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202
/*
  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;
2203 2204 2205 2206 2207 2208 2209
  /*
    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;
2210 2211 2212 2213
  insert_dynamic(&m_instr, (gptr)&instr);
}


2214
/*
2215 2216 2217 2218
  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
2219 2220 2221 2222

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

2223
  opt_mark()           Mark instruction as reachable
2224 2225 2226 2227
  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)
2228 2229 2230
*/

void sp_head::optimize()
2231 2232 2233 2234 2235
{
  List<sp_instr> bp;
  sp_instr *i;
  uint src, dst;

2236
  opt_mark();
2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249

  bp.empty();
  src= dst= 0;
  while ((i= get_instr(src)))
  {
    if (! i->marked)
    {
      delete i;
      src+= 1;
    }
    else
    {
      if (src != dst)
2250
      {                         // Move the instruction and update prev. jumps
2251 2252 2253 2254 2255
	sp_instr *ibp;
	List_iterator_fast<sp_instr> li(bp);

	set_dynamic(&m_instr, (gptr)&i, dst);
	while ((ibp= li++))
2256 2257 2258 2259
        {
          sp_instr_opt_meta *im= static_cast<sp_instr_opt_meta *>(ibp);
          im->set_destination(src, dst);
        }
2260 2261 2262 2263 2264 2265 2266 2267 2268 2269
      }
      i->opt_move(dst, &bp);
      src+= 1;
      dst+= 1;
    }
  }
  m_instr.elements= dst;
  bp.empty();
}

2270 2271 2272 2273 2274 2275 2276 2277
void sp_head::add_mark_lead(uint ip, List<sp_instr> *leads)
{
  sp_instr *i= get_instr(ip);

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

2278
void
2279
sp_head::opt_mark()
2280
{
2281
  uint ip;
2282
  sp_instr *i;
2283
  List<sp_instr> leads;
2284

2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313
  /*
    Forward flow analysis algorithm in the instruction graph:
    - first, add the entry point in the graph (the first instruction) to the
      'leads' list of paths to explore.
    - while there are still leads to explore:
      - pick one lead, and follow the path forward. Mark instruction reached.
        Stop only if the end of the routine is reached, or the path converge
        to code already explored (marked).
      - while following a path, collect in the 'leads' list any fork to
        another path (caused by conditional jumps instructions), so that these
        paths can be explored as well.
  */

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

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

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

2316

unknown's avatar
unknown committed
2317
#ifndef DBUG_OFF
2318 2319 2320 2321
/*
  Return the routine instructions as a result set.
  Returns 0 if ok, !=0 on error.
*/
unknown's avatar
unknown committed
2322 2323 2324 2325 2326 2327 2328
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;
2329
  sp_instr *i;
unknown's avatar
unknown committed
2330
  bool full_access;
2331
  int res= 0;
unknown's avatar
unknown committed
2332 2333
  uint ip;
  DBUG_ENTER("sp_head::show_routine_code");
2334
  DBUG_PRINT("info", ("procedure: %s", m_name.str));
unknown's avatar
unknown committed
2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348

  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++)
  {
2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364
    /* 
      Consistency check. If these are different something went wrong
      during optimization.
    */
    if (ip != i->m_ip)
    {
      const char *format= "Instruction at position %u has m_ip=%u";
      char tmp[sizeof(format) + 2*SP_INSTR_UINT_MAXLEN + 1];

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

    buffer.set("", 0, system_charset_info);
    i->print(&buffer);
2370
    protocol->store(buffer.ptr(), buffer.length(), system_charset_info);
unknown's avatar
unknown committed
2371 2372 2373 2374 2375 2376 2377 2378 2379 2380
    if ((res= protocol->write()))
      break;
  }
  send_eof(thd);

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


2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409
/*
  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;
2410
  DBUG_ENTER("reset_lex_and_exec_core");
2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421

  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));
2422
  thd->query_id= next_query_id();
2423 2424
  VOID(pthread_mutex_unlock(&LOCK_thread_count));

2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442
  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);
    }
  }
2443

2444
  reinit_stmt_before_use(thd, m_lex);
2445 2446

  if (open_tables)
2447
    res= instr->exec_open_and_lock_tables(thd, m_lex->query_tables);
2448 2449

  if (!res)
2450
  {
2451
    res= instr->exec_core(thd, nextp);
2452 2453
    DBUG_PRINT("info",("exec_core returned: %d", res));
  }
2454 2455 2456 2457 2458

  m_lex->unit.cleanup();

  thd->proc_info="closing tables";
  close_thread_tables(thd);
unknown's avatar
unknown committed
2459
  thd->proc_info= 0;
2460

2461
  if (m_lex->query_tables_own_last)
2462
  {
2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475
    /*
      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);
2476
  }
2477
  thd->rollback_item_tree_changes();
2478 2479 2480
  /* Update the state of the active arena. */
  thd->stmt_arena->state= Query_arena::EXECUTED;

2481 2482 2483 2484 2485 2486 2487 2488 2489 2490

  /*
    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()
  */
2491
  DBUG_RETURN(res || thd->net.report_error);
2492 2493 2494
}


unknown's avatar
unknown committed
2495 2496 2497 2498
/*
  sp_instr class functions
*/

2499
int sp_instr::exec_open_and_lock_tables(THD *thd, TABLE_LIST *tables)
2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515
{
  int result;

  /*
    Check whenever we have access to tables for this statement
    and open and lock them before executing instructions core function.
  */
  if (check_table_access(thd, SELECT_ACL, tables, 0)
      || open_and_lock_tables(thd, tables))
    result= -1;
  else
    result= 0;

  return result;
}

2516
uint sp_instr::get_cont_dest()
2517
{
2518
  return (m_ip+1);
2519 2520 2521
}


2522
int sp_instr::exec_core(THD *thd, uint *nextp)
2523
{
2524 2525
  DBUG_ASSERT(0);
  return 0;
2526 2527
}

unknown's avatar
unknown committed
2528 2529 2530 2531
/*
  sp_instr_stmt class functions
*/

2532
int
2533
sp_instr_stmt::execute(THD *thd, uint *nextp)
2534
{
2535 2536
  char *query;
  uint32 query_length;
2537
  int res;
2538
  DBUG_ENTER("sp_instr_stmt::execute");
2539
  DBUG_PRINT("info", ("command: %d", m_lex_keeper.sql_command()));
2540 2541 2542

  query= thd->query;
  query_length= thd->query_length;
2543 2544
  if (!(res= alloc_query(thd, m_query.str, m_query.length+1)) &&
      !(res=subst_spvars(thd, this, &m_query)))
2545
  {
2546 2547 2548 2549
    /*
      (the order of query cache and subst_spvars calls is irrelevant because
      queries with SP vars can't be cached)
    */
2550 2551 2552
    if (unlikely((thd->options & OPTION_LOG_OFF)==0))
      general_log_print(thd, COM_QUERY, "%s", thd->query);

2553 2554 2555
    if (query_cache_send_result_to_client(thd,
					  thd->query, thd->query_length) <= 0)
    {
2556
      res= m_lex_keeper.reset_lex_and_exec_core(thd, nextp, FALSE, this);
unknown's avatar
unknown committed
2557 2558
      if (!res && unlikely(thd->enable_slow_log))
        log_slow_statement(thd);
2559 2560
      query_cache_end_of_result(thd);
    }
2561 2562
    else
      *nextp= m_ip+1;
2563 2564 2565
    thd->query= query;
    thd->query_length= query_length;
  }
2566 2567 2568
  DBUG_RETURN(res);
}

2569

2570 2571 2572
void
sp_instr_stmt::print(String *str)
{
unknown's avatar
unknown committed
2573 2574
  uint i, len;

2575 2576
  /* stmt CMD "..." */
  if (str->reserve(SP_STMT_PRINT_MAXLEN+SP_INSTR_UINT_MAXLEN+8))
2577
    return;
2578
  str->qs_append(STRING_WITH_LEN("stmt "));
2579
  str->qs_append((uint)m_lex_keeper.sql_command());
2580
  str->qs_append(STRING_WITH_LEN(" \""));
unknown's avatar
unknown committed
2581 2582 2583 2584 2585
  len= m_query.length;
  /*
    Print the query string (but not too much of it), just to indicate which
    statement it is.
  */
2586 2587
  if (len > SP_STMT_PRINT_MAXLEN)
    len= SP_STMT_PRINT_MAXLEN-3;
unknown's avatar
unknown committed
2588 2589
  /* Copy the query string and replace '\n' with ' ' in the process */
  for (i= 0 ; i < len ; i++)
2590
  {
unknown's avatar
unknown committed
2591 2592 2593 2594
    char c= m_query.str[i];
    if (c == '\n')
      c= ' ';
    str->qs_append(c);
2595
  }
2596
  if (m_query.length > SP_STMT_PRINT_MAXLEN)
2597
    str->qs_append(STRING_WITH_LEN("...")); /* Indicate truncated string */
2598
  str->qs_append('"');
2599
}
unknown's avatar
unknown committed
2600

2601

2602
int
2603
sp_instr_stmt::exec_core(THD *thd, uint *nextp)
2604
{
2605 2606
  int res= mysql_execute_command(thd);
  *nextp= m_ip+1;
2607
  return res;
2608 2609
}

unknown's avatar
unknown committed
2610 2611 2612 2613 2614

/*
  sp_instr_set class functions
*/

2615
int
2616
sp_instr_set::execute(THD *thd, uint *nextp)
2617
{
2618 2619
  DBUG_ENTER("sp_instr_set::execute");
  DBUG_PRINT("info", ("offset: %u", m_offset));
2620 2621 2622 2623

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

unknown's avatar
unknown committed
2624

2625 2626 2627
int
sp_instr_set::exec_core(THD *thd, uint *nextp)
{
2628
  int res= thd->spcont->set_variable(thd, m_offset, &m_value);
2629

2630
  if (res && thd->spcont->found_handler_here())
2631 2632
  {
    /*
2633 2634
      Failed to evaluate the value, and a handler has been found. Reset the
      variable to NULL.
2635 2636
    */

2637 2638 2639
    if (thd->spcont->set_variable(thd, m_offset, 0))
    {
      /* If this also failed, let's abort. */
2640

2641 2642
      sp_rcontext *spcont= thd->spcont;
    
2643 2644 2645 2646 2647 2648
      thd->spcont= 0;           /* Avoid handlers */
      my_error(ER_OUT_OF_RESOURCES, MYF(0));
      spcont->clear_handler();
      thd->spcont= spcont;
    }
  }
2649

2650
  *nextp = m_ip+1;
2651
  return res;
2652 2653
}

2654 2655 2656
void
sp_instr_set::print(String *str)
{
2657 2658
  /* set name@offset ... */
  int rsrv = SP_INSTR_UINT_MAXLEN+6;
2659
  sp_variable_t *var = m_ctx->find_variable(m_offset);
unknown's avatar
unknown committed
2660 2661 2662 2663

  /* 'var' should always be non-null, but just in case... */
  if (var)
    rsrv+= var->name.length;
2664 2665
  if (str->reserve(rsrv))
    return;
2666
  str->qs_append(STRING_WITH_LEN("set "));
unknown's avatar
unknown committed
2667 2668
  if (var)
  {
2669 2670
    str->qs_append(var->name.str, var->name.length);
    str->qs_append('@');
unknown's avatar
unknown committed
2671
  }
2672
  str->qs_append(m_offset);
2673
  str->qs_append(' ');
2674 2675 2676
  m_value->print(str);
}

2677

unknown's avatar
unknown committed
2678 2679 2680 2681
/*
  sp_instr_set_trigger_field class functions
*/

2682 2683 2684 2685
int
sp_instr_set_trigger_field::execute(THD *thd, uint *nextp)
{
  DBUG_ENTER("sp_instr_set_trigger_field::execute");
2686 2687 2688 2689 2690 2691 2692
  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)
{
2693
  const int res= (trigger_field->set_value(thd, &value) ? -1 : 0);
2694 2695
  *nextp = m_ip+1;
  return res;
2696 2697 2698 2699 2700
}

void
sp_instr_set_trigger_field::print(String *str)
{
2701
  str->append(STRING_WITH_LEN("set_trigger_field "));
2702
  trigger_field->print(str);
2703
  str->append(STRING_WITH_LEN(":="));
2704 2705 2706
  value->print(str);
}

2707 2708 2709 2710
/*
  sp_instr_opt_meta
*/

2711
uint sp_instr_opt_meta::get_cont_dest()
2712
{
2713
  return m_cont_dest;
2714 2715
}

unknown's avatar
unknown committed
2716 2717 2718 2719 2720

/*
 sp_instr_jump class functions
*/

2721 2722 2723 2724 2725 2726 2727 2728 2729 2730
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);
}

2731 2732 2733
void
sp_instr_jump::print(String *str)
{
2734 2735
  /* jump dest */
  if (str->reserve(SP_INSTR_UINT_MAXLEN+5))
2736
    return;
2737
  str->qs_append(STRING_WITH_LEN("jump "));
2738 2739 2740
  str->qs_append(m_dest);
}

2741
uint
2742
sp_instr_jump::opt_mark(sp_head *sp, List<sp_instr> *leads)
2743
{
2744
  m_dest= opt_shortcut_jump(sp, this);
2745 2746
  if (m_dest != m_ip+1)		/* Jumping to following instruction? */
    marked= 1;
2747 2748 2749 2750 2751
  m_optdest= sp->get_instr(m_dest);
  return m_dest;
}

uint
2752
sp_instr_jump::opt_shortcut_jump(sp_head *sp, sp_instr *start)
2753 2754 2755 2756 2757 2758
{
  uint dest= m_dest;
  sp_instr *i;

  while ((i= sp->get_instr(dest)))
  {
2759
    uint ndest;
2760

2761
    if (start == i || this == i)
2762 2763
      break;
    ndest= i->opt_shortcut_jump(sp, start);
2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780
    if (ndest == dest)
      break;
    dest= ndest;
  }
  return dest;
}

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

unknown's avatar
unknown committed
2781 2782 2783 2784 2785

/*
  sp_instr_jump_if_not class functions
*/

2786 2787 2788
int
sp_instr_jump_if_not::execute(THD *thd, uint *nextp)
{
2789 2790
  DBUG_ENTER("sp_instr_jump_if_not::execute");
  DBUG_PRINT("info", ("destination: %u", m_dest));
2791 2792 2793 2794 2795 2796 2797
  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)
{
2798 2799
  Item *it;
  int res;
2800

2801
  it= sp_prepare_func_item(thd, &m_expr);
2802
  if (! it)
2803
  {
2804
    res= -1;
2805
  }
2806
  else
2807 2808
  {
    res= 0;
2809
    if (! it->val_bool())
2810 2811 2812 2813
      *nextp = m_dest;
    else
      *nextp = m_ip+1;
  }
2814 2815

  return res;
2816
}
2817

unknown's avatar
unknown committed
2818

2819 2820 2821
void
sp_instr_jump_if_not::print(String *str)
{
2822
  /* jump_if_not dest(cont) ... */
2823
  if (str->reserve(2*SP_INSTR_UINT_MAXLEN+14+32)) // Add some for the expr. too
2824
    return;
2825
  str->qs_append(STRING_WITH_LEN("jump_if_not "));
2826
  str->qs_append(m_dest);
2827
  str->qs_append('(');
2828
  str->qs_append(m_cont_dest);
2829
  str->qs_append(STRING_WITH_LEN(") "));
2830 2831 2832
  m_expr->print(str);
}

unknown's avatar
unknown committed
2833

2834
uint
2835
sp_instr_jump_if_not::opt_mark(sp_head *sp, List<sp_instr> *leads)
2836 2837 2838 2839 2840 2841
{
  sp_instr *i;

  marked= 1;
  if ((i= sp->get_instr(m_dest)))
  {
2842
    m_dest= i->opt_shortcut_jump(sp, this);
2843 2844
    m_optdest= sp->get_instr(m_dest);
  }
2845
  sp->add_mark_lead(m_dest, leads);
2846 2847 2848 2849 2850
  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);
  }
2851
  sp->add_mark_lead(m_cont_dest, leads);
2852 2853 2854
  return m_ip+1;
}

2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874
void
sp_instr_jump_if_not::opt_move(uint dst, List<sp_instr> *bp)
{
  /*
    cont. destinations may point backwards after shortcutting jumps
    during the mark phase. If it's still pointing forwards, only
    push this for backpatching if sp_instr_jump::opt_move() will not
    do it (i.e. if the m_dest points backwards).
   */
  if (m_cont_dest > m_ip)
  {                             // Forward
    if (m_dest < m_ip)
      bp->push_back(this);
  }
  else if (m_cont_optdest)
    m_cont_dest= m_cont_optdest->m_ip; // Backward
  /* This will take care of m_dest and m_ip */
  sp_instr_jump::opt_move(dst, bp);
}

unknown's avatar
unknown committed
2875 2876 2877 2878

/*
  sp_instr_freturn class functions
*/
2879

2880
int
2881
sp_instr_freturn::execute(THD *thd, uint *nextp)
2882
{
2883
  DBUG_ENTER("sp_instr_freturn::execute");
2884 2885 2886 2887 2888 2889 2890
  DBUG_RETURN(m_lex_keeper.reset_lex_and_exec_core(thd, nextp, TRUE, this));
}


int
sp_instr_freturn::exec_core(THD *thd, uint *nextp)
{
2891 2892 2893 2894
  /*
    Change <next instruction pointer>, so that this will be the last
    instruction in the stored function.
  */
2895

2896
  *nextp= UINT_MAX;
2897

2898 2899 2900 2901 2902 2903 2904 2905
  /*
    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.
  */

2906
  return thd->spcont->set_return_value(thd, &m_value);
2907
}
2908

2909 2910 2911
void
sp_instr_freturn::print(String *str)
{
2912
  /* freturn type expr... */
2913
  if (str->reserve(1024+8+32)) // Add some for the expr. too
2914
    return;
2915
  str->qs_append(STRING_WITH_LEN("freturn "));
2916
  str->qs_append((uint)m_type);
2917
  str->qs_append(' ');
2918 2919 2920
  m_value->print(str);
}

unknown's avatar
unknown committed
2921 2922 2923 2924
/*
  sp_instr_hpush_jump class functions
*/

2925 2926 2927 2928 2929 2930 2931 2932
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++))
2933
    thd->spcont->push_handler(p, m_ip+1, m_type, m_frame);
2934 2935 2936 2937 2938

  *nextp= m_dest;
  DBUG_RETURN(0);
}

unknown's avatar
unknown committed
2939

2940 2941 2942
void
sp_instr_hpush_jump::print(String *str)
{
2943 2944
  /* hpush_jump dest fsize type */
  if (str->reserve(SP_INSTR_UINT_MAXLEN*2 + 21))
2945
    return;
2946
  str->qs_append(STRING_WITH_LEN("hpush_jump "));
2947
  str->qs_append(m_dest);
2948
  str->qs_append(' ');
2949
  str->qs_append(m_frame);
unknown's avatar
unknown committed
2950
  switch (m_type) {
unknown's avatar
unknown committed
2951
  case SP_HANDLER_NONE:
2952
    str->qs_append(STRING_WITH_LEN(" NONE")); // This would be a bug
unknown's avatar
unknown committed
2953 2954
    break;
  case SP_HANDLER_EXIT:
2955
    str->qs_append(STRING_WITH_LEN(" EXIT"));
unknown's avatar
unknown committed
2956 2957
    break;
  case SP_HANDLER_CONTINUE:
2958
    str->qs_append(STRING_WITH_LEN(" CONTINUE"));
unknown's avatar
unknown committed
2959 2960
    break;
  case SP_HANDLER_UNDO:
2961
    str->qs_append(STRING_WITH_LEN(" UNDO"));
unknown's avatar
unknown committed
2962 2963
    break;
  default:
unknown's avatar
unknown committed
2964 2965
    // This would be a bug as well
    str->qs_append(STRING_WITH_LEN(" UNKNOWN:"));
unknown's avatar
unknown committed
2966 2967
    str->qs_append(m_type);
  }
2968 2969
}

unknown's avatar
unknown committed
2970

2971
uint
2972
sp_instr_hpush_jump::opt_mark(sp_head *sp, List<sp_instr> *leads)
2973 2974 2975 2976 2977 2978
{
  sp_instr *i;

  marked= 1;
  if ((i= sp->get_instr(m_dest)))
  {
2979
    m_dest= i->opt_shortcut_jump(sp, this);
2980 2981
    m_optdest= sp->get_instr(m_dest);
  }
2982
  sp->add_mark_lead(m_dest, leads);
2983 2984 2985
  return m_ip+1;
}

unknown's avatar
unknown committed
2986 2987 2988 2989 2990

/*
  sp_instr_hpop class functions
*/

2991 2992 2993 2994 2995 2996 2997 2998 2999
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);
}

3000 3001 3002
void
sp_instr_hpop::print(String *str)
{
3003 3004
  /* hpop count */
  if (str->reserve(SP_INSTR_UINT_MAXLEN+5))
3005
    return;
3006
  str->qs_append(STRING_WITH_LEN("hpop "));
3007 3008 3009
  str->qs_append(m_count);
}

3010

unknown's avatar
unknown committed
3011 3012 3013 3014
/*
  sp_instr_hreturn class functions
*/

3015 3016 3017 3018
int
sp_instr_hreturn::execute(THD *thd, uint *nextp)
{
  DBUG_ENTER("sp_instr_hreturn::execute");
3019 3020 3021 3022 3023 3024
  if (m_dest)
    *nextp= m_dest;
  else
  {
    *nextp= thd->spcont->pop_hstack();
  }
3025
  thd->spcont->exit_handler();
3026 3027
  DBUG_RETURN(0);
}
3028

unknown's avatar
unknown committed
3029

3030 3031 3032
void
sp_instr_hreturn::print(String *str)
{
3033 3034
  /* hreturn framesize dest */
  if (str->reserve(SP_INSTR_UINT_MAXLEN*2 + 9))
3035
    return;
3036
  str->qs_append(STRING_WITH_LEN("hreturn "));
3037
  str->qs_append(m_frame);
3038
  if (m_dest)
3039
  {
3040
    str->qs_append(' ');
3041
    str->qs_append(m_dest);
3042
  }
3043 3044
}

unknown's avatar
unknown committed
3045

3046
uint
3047
sp_instr_hreturn::opt_mark(sp_head *sp, List<sp_instr> *leads)
3048
{
3049
  marked= 1;
3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062
  
  if (m_dest)
  {
    /*
      This is an EXIT handler; next instruction step is in m_dest.
     */
    return m_dest;
  }
  
  /*
    This is a CONTINUE handler; next instruction step will come from
    the handler stack and not from opt_mark.
   */
3063
  return UINT_MAX;
3064 3065
}

3066

unknown's avatar
unknown committed
3067 3068 3069 3070
/*
  sp_instr_cpush class functions
*/

3071 3072 3073
int
sp_instr_cpush::execute(THD *thd, uint *nextp)
{
unknown's avatar
unknown committed
3074
  Query_arena backup_arena;
3075
  DBUG_ENTER("sp_instr_cpush::execute");
3076 3077 3078 3079 3080

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

3083
  thd->spcont->push_cursor(&m_lex_keeper, this);
3084

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

3087
  *nextp= m_ip+1;
3088

3089 3090 3091
  DBUG_RETURN(0);
}

unknown's avatar
unknown committed
3092

3093 3094 3095
void
sp_instr_cpush::print(String *str)
{
unknown's avatar
unknown committed
3096 3097
  LEX_STRING n;
  my_bool found= m_ctx->find_cursor(m_cursor, &n);
3098 3099
  /* cpush name@offset */
  uint rsrv= SP_INSTR_UINT_MAXLEN+7;
unknown's avatar
unknown committed
3100

3101 3102 3103 3104
  if (found)
    rsrv+= n.length;
  if (str->reserve(rsrv))
    return;
3105
  str->qs_append(STRING_WITH_LEN("cpush "));
unknown's avatar
unknown committed
3106 3107
  if (found)
  {
3108 3109
    str->qs_append(n.str, n.length);
    str->qs_append('@');
unknown's avatar
unknown committed
3110 3111
  }
  str->qs_append(m_cursor);
3112 3113
}

unknown's avatar
unknown committed
3114 3115 3116 3117 3118

/*
  sp_instr_cpop class functions
*/

3119 3120 3121 3122 3123 3124 3125 3126 3127
int
sp_instr_cpop::execute(THD *thd, uint *nextp)
{
  DBUG_ENTER("sp_instr_cpop::execute");
  thd->spcont->pop_cursors(m_count);
  *nextp= m_ip+1;
  DBUG_RETURN(0);
}

unknown's avatar
unknown committed
3128

3129 3130 3131
void
sp_instr_cpop::print(String *str)
{
3132 3133
  /* cpop count */
  if (str->reserve(SP_INSTR_UINT_MAXLEN+5))
3134
    return;
3135
  str->qs_append(STRING_WITH_LEN("cpop "));
3136 3137 3138
  str->qs_append(m_count);
}

unknown's avatar
unknown committed
3139 3140 3141 3142 3143

/*
  sp_instr_copen class functions
*/

3144 3145 3146
int
sp_instr_copen::execute(THD *thd, uint *nextp)
{
3147 3148 3149 3150
  /*
    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.
  */
3151 3152 3153 3154 3155 3156 3157 3158
  sp_cursor *c= thd->spcont->get_cursor(m_cursor);
  int res;
  DBUG_ENTER("sp_instr_copen::execute");

  if (! c)
    res= -1;
  else
  {
3159 3160
    sp_lex_keeper *lex_keeper= c->get_lex_keeper();
    Query_arena *old_arena= thd->stmt_arena;
3161

3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177 3178 3179 3180
    /*
      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;
3181

3182 3183
      if (thd->spcont->found_handler(&dummy1, &dummy2))
        res= -1;
3184
    }
3185
    /* TODO: Assert here that we either have an error or a cursor */
3186 3187 3188 3189
  }
  DBUG_RETURN(res);
}

unknown's avatar
unknown committed
3190

3191 3192 3193
int
sp_instr_copen::exec_core(THD *thd, uint *nextp)
{
3194 3195
  sp_cursor *c= thd->spcont->get_cursor(m_cursor);
  int res= c->open(thd);
3196 3197 3198 3199
  *nextp= m_ip+1;
  return res;
}

3200 3201 3202
void
sp_instr_copen::print(String *str)
{
unknown's avatar
unknown committed
3203 3204
  LEX_STRING n;
  my_bool found= m_ctx->find_cursor(m_cursor, &n);
3205 3206
  /* copen name@offset */
  uint rsrv= SP_INSTR_UINT_MAXLEN+7;
unknown's avatar
unknown committed
3207

3208 3209 3210 3211
  if (found)
    rsrv+= n.length;
  if (str->reserve(rsrv))
    return;
3212
  str->qs_append(STRING_WITH_LEN("copen "));
unknown's avatar
unknown committed
3213 3214
  if (found)
  {
3215 3216
    str->qs_append(n.str, n.length);
    str->qs_append('@');
unknown's avatar
unknown committed
3217
  }
3218 3219 3220
  str->qs_append(m_cursor);
}

unknown's avatar
unknown committed
3221 3222 3223 3224 3225

/*
  sp_instr_cclose class functions
*/

3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240
int
sp_instr_cclose::execute(THD *thd, uint *nextp)
{
  sp_cursor *c= thd->spcont->get_cursor(m_cursor);
  int res;
  DBUG_ENTER("sp_instr_cclose::execute");

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

unknown's avatar
unknown committed
3241

3242 3243 3244
void
sp_instr_cclose::print(String *str)
{
unknown's avatar
unknown committed
3245 3246
  LEX_STRING n;
  my_bool found= m_ctx->find_cursor(m_cursor, &n);
3247 3248
  /* cclose name@offset */
  uint rsrv= SP_INSTR_UINT_MAXLEN+8;
unknown's avatar
unknown committed
3249

3250 3251 3252 3253
  if (found)
    rsrv+= n.length;
  if (str->reserve(rsrv))
    return;
3254
  str->qs_append(STRING_WITH_LEN("cclose "));
unknown's avatar
unknown committed
3255 3256
  if (found)
  {
3257 3258
    str->qs_append(n.str, n.length);
    str->qs_append('@');
unknown's avatar
unknown committed
3259
  }
3260 3261 3262
  str->qs_append(m_cursor);
}

unknown's avatar
unknown committed
3263 3264 3265 3266 3267

/*
  sp_instr_cfetch class functions
*/

3268 3269 3270 3271 3272
int
sp_instr_cfetch::execute(THD *thd, uint *nextp)
{
  sp_cursor *c= thd->spcont->get_cursor(m_cursor);
  int res;
unknown's avatar
unknown committed
3273
  Query_arena backup_arena;
3274 3275
  DBUG_ENTER("sp_instr_cfetch::execute");

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

3278 3279 3280
  *nextp= m_ip+1;
  DBUG_RETURN(res);
}
3281

unknown's avatar
unknown committed
3282

3283 3284 3285
void
sp_instr_cfetch::print(String *str)
{
3286 3287
  List_iterator_fast<struct sp_variable> li(m_varlist);
  sp_variable_t *pv;
unknown's avatar
unknown committed
3288 3289
  LEX_STRING n;
  my_bool found= m_ctx->find_cursor(m_cursor, &n);
3290 3291
  /* cfetch name@offset vars... */
  uint rsrv= SP_INSTR_UINT_MAXLEN+8;
3292

3293 3294 3295 3296
  if (found)
    rsrv+= n.length;
  if (str->reserve(rsrv))
    return;
3297
  str->qs_append(STRING_WITH_LEN("cfetch "));
unknown's avatar
unknown committed
3298 3299
  if (found)
  {
3300 3301
    str->qs_append(n.str, n.length);
    str->qs_append('@');
unknown's avatar
unknown committed
3302
  }
3303 3304 3305
  str->qs_append(m_cursor);
  while ((pv= li++))
  {
3306
    if (str->reserve(pv->name.length+SP_INSTR_UINT_MAXLEN+2))
3307 3308 3309 3310
      return;
    str->qs_append(' ');
    str->qs_append(pv->name.str, pv->name.length);
    str->qs_append('@');
3311 3312 3313 3314
    str->qs_append(pv->offset);
  }
}

unknown's avatar
unknown committed
3315 3316 3317 3318 3319

/*
  sp_instr_error class functions
*/

3320 3321 3322 3323 3324
int
sp_instr_error::execute(THD *thd, uint *nextp)
{
  DBUG_ENTER("sp_instr_error::execute");

unknown's avatar
unknown committed
3325
  my_message(m_errcode, ER(m_errcode), MYF(0));
3326 3327 3328 3329
  *nextp= m_ip+1;
  DBUG_RETURN(-1);
}

unknown's avatar
unknown committed
3330

3331 3332 3333
void
sp_instr_error::print(String *str)
{
3334 3335
  /* error code */
  if (str->reserve(SP_INSTR_UINT_MAXLEN+6))
3336
    return;
3337
  str->qs_append(STRING_WITH_LEN("error "));
3338 3339 3340
  str->qs_append(m_errcode);
}

3341

3342 3343 3344 3345 3346 3347 3348 3349 3350 3351 3352 3353 3354 3355 3356 3357
/**************************************************************************
  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)
{
3358
  int res= thd->spcont->set_case_expr(thd, m_case_expr_id, &m_case_expr);
3359 3360 3361 3362 3363 3364 3365 3366 3367 3368 3369 3370 3371

  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 ||
3372
        thd->spcont->set_case_expr(thd, m_case_expr_id, &null_item))
3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383
    {
      /* 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;
    }
  }
3384 3385
  else
    *nextp= m_ip+1;
3386

3387
  return res;
3388 3389 3390 3391 3392 3393
}


void
sp_instr_set_case_expr::print(String *str)
{
3394 3395 3396 3397 3398
  /* 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(") "));
3399
  str->qs_append(m_case_expr_id);
3400
  str->qs_append(' ');
3401 3402 3403
  m_case_expr->print(str);
}

3404
uint
3405
sp_instr_set_case_expr::opt_mark(sp_head *sp, List<sp_instr> *leads)
3406 3407 3408 3409 3410 3411 3412 3413 3414
{
  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);
  }
3415
  sp->add_mark_lead(m_cont_dest, leads);
3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428
  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;
}

3429

unknown's avatar
unknown committed
3430
/* ------------------------------------------------------------------ */
3431

3432 3433

/*
3434 3435 3436 3437
  Structure that represent all instances of one table
  in optimized multi-set of tables used by routine.
*/

3438 3439
typedef struct st_sp_table
{
3440 3441 3442 3443 3444 3445 3446 3447
  /*
    Multi-set key:
      db_name\0table_name\0alias\0 - for normal tables
      db_name\0table_name\0        - for temporary tables
    Note that in both cases we don't take last '\0' into account when
    we count length of key.
  */
  LEX_STRING qname;
unknown's avatar
unknown committed
3448 3449 3450
  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 */
3451 3452
  uint lock_count;
  uint query_lock_count;
3453 3454 3455 3456 3457 3458 3459 3460 3461 3462
} 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;
}

3463

3464
/*
3465 3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483
  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
*/

3484
bool
3485
sp_head::merge_table_list(THD *thd, TABLE_LIST *table, LEX *lex_for_tmp_check)
3486
{
3487 3488 3489 3490 3491 3492 3493 3494 3495 3496 3497 3498
  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;
  }

3499
  for (; table ; table= table->next_global)
3500
    if (!table->derived && !table->schema_table)
3501
    {
unknown's avatar
unknown committed
3502
      char tname[(NAME_LEN + 1) * 3];           // db\0table\0alias\0
3503 3504 3505 3506
      uint tlen, alen;

      tlen= table->db_length;
      memcpy(tname, table->db, tlen);
unknown's avatar
unknown committed
3507
      tname[tlen++]= '\0';
3508 3509
      memcpy(tname+tlen, table->table_name, table->table_name_length);
      tlen+= table->table_name_length;
unknown's avatar
unknown committed
3510
      tname[tlen++]= '\0';
3511 3512 3513 3514 3515
      alen= strlen(table->alias);
      memcpy(tname+tlen, table->alias, alen);
      tlen+= alen;
      tname[tlen]= '\0';

unknown's avatar
unknown committed
3516 3517 3518 3519 3520 3521 3522 3523
      /*
        Upgrade the lock type because this table list will be used
        only in pre-locked mode, in which DELAYED inserts are always
        converted to normal inserts.
      */
      if (table->lock_type == TL_WRITE_DELAYED)
        table->lock_type= TL_WRITE;

3524
      /*
3525 3526 3527
        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.
3528
      */
3529 3530 3531 3532
      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))
3533
      {
3534 3535
        if (tab->lock_type < table->lock_type)
          tab->lock_type= table->lock_type; // Use the table with the highest lock type
3536 3537 3538
        tab->query_lock_count++;
        if (tab->query_lock_count > tab->lock_count)
          tab->lock_count++;
3539 3540 3541 3542 3543
      }
      else
      {
	if (!(tab= (SP_TABLE *)thd->calloc(sizeof(SP_TABLE))))
	  return FALSE;
3544
	if (lex_for_tmp_check->sql_command == SQLCOM_CREATE_TABLE &&
3545 3546
	    lex_for_tmp_check->query_tables == table &&
	    lex_for_tmp_check->create_info.options & HA_LEX_CREATE_TMP_TABLE)
3547
        {
3548
	  tab->temp= TRUE;
3549 3550 3551 3552 3553 3554 3555
          tab->qname.length= tlen - alen - 1;
        }
        else
          tab->qname.length= tlen;
        tab->qname.str= (char*) thd->memdup(tname, tab->qname.length + 1);
        if (!tab->qname.str)
          return FALSE;
unknown's avatar
unknown committed
3556 3557
        tab->table_name_length= table->table_name_length;
        tab->db_length= table->db_length;
3558
        tab->lock_type= table->lock_type;
3559 3560
        tab->lock_count= tab->query_lock_count= 1;
	my_hash_insert(&m_sptabs, (byte *)tab);
3561 3562 3563 3564 3565 3566
      }
    }
  return TRUE;
}


3567 3568
/*
  Add tables used by routine to the table list.
3569

3570 3571
  SYNOPSIS
    add_used_tables_to_table_list()
3572 3573 3574 3575 3576 3577
      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.
3578

3579 3580 3581
  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'.
3582

3583 3584
    Elements of list will be allocated in PS memroot, so this list will be
    persistent between PS executions.
3585

3586 3587 3588
  RETURN VALUE
    TRUE - if some elements were added, FALSE - otherwise.
*/
3589

3590 3591
bool
sp_head::add_used_tables_to_table_list(THD *thd,
3592 3593
                                       TABLE_LIST ***query_tables_last_ptr,
                                       TABLE_LIST *belong_to_view)
3594 3595
{
  uint i;
unknown's avatar
unknown committed
3596
  Query_arena *arena, backup;
3597 3598 3599 3600
  bool result= FALSE;
  DBUG_ENTER("sp_head::add_used_tables_to_table_list");

  /*
3601 3602 3603 3604 3605 3606
    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.
3607
  */
unknown's avatar
unknown committed
3608
  arena= thd->activate_stmt_arena_if_needed(&backup);
3609

3610
  for (i=0 ; i < m_sptabs.records ; i++)
3611
  {
3612
    char *tab_buff, *key_buff;
unknown's avatar
unknown committed
3613
    TABLE_LIST *table;
3614
    SP_TABLE *stab= (SP_TABLE *)hash_element(&m_sptabs, i);
3615 3616 3617
    if (stab->temp)
      continue;

3618
    if (!(tab_buff= (char *)thd->calloc(ALIGN_SIZE(sizeof(TABLE_LIST)) *
3619 3620 3621
                                        stab->lock_count)) ||
        !(key_buff= (char*)thd->memdup(stab->qname.str,
                                       stab->qname.length + 1)))
3622
      DBUG_RETURN(FALSE);
3623

3624 3625 3626 3627
    for (uint j= 0; j < stab->lock_count; j++)
    {
      table= (TABLE_LIST *)tab_buff;

3628
      table->db= key_buff;
unknown's avatar
unknown committed
3629 3630 3631 3632
      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;
3633
      table->lock_type= stab->lock_type;
3634 3635
      table->cacheable_table= 1;
      table->prelocking_placeholder= 1;
3636
      table->belong_to_view= belong_to_view;
3637 3638 3639 3640 3641 3642 3643 3644 3645 3646

      /* 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;
    }
3647
  }
3648 3649

  if (arena)
unknown's avatar
unknown committed
3650
    thd->restore_active_arena(arena, &backup);
3651 3652

  DBUG_RETURN(result);
3653 3654
}

unknown's avatar
unknown committed
3655

3656
/*
unknown's avatar
unknown committed
3657 3658 3659 3660
  Simple function for adding an explicetly named (systems) table to
  the global table list, e.g. "mysql", "proc".
*/

3661 3662 3663 3664 3665 3666 3667 3668 3669 3670 3671 3672 3673 3674 3675 3676 3677 3678
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;
3679
  table->select_lex= lex->current_select;
3680 3681 3682 3683 3684
  table->cacheable_table= 1;
  
  lex->add_to_query_tables(table);
  return table;
}
3685