sp_head.cc 53 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
/* Copyright (C) 2002 MySQL AB

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

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

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

#ifdef __GNUC__
#pragma implementation
#endif

#include "mysql_priv.h"
#include "sp_head.h"
23
#include "sp.h"
24 25
#include "sp_pcontext.h"
#include "sp_rcontext.h"
26
#include "sp_cache.h"
27

28 29 30 31 32 33 34 35 36 37 38 39
Item_result
sp_map_result_type(enum enum_field_types type)
{
  switch (type)
  {
  case MYSQL_TYPE_TINY:
  case MYSQL_TYPE_SHORT:
  case MYSQL_TYPE_LONG:
  case MYSQL_TYPE_LONGLONG:
  case MYSQL_TYPE_INT24:
    return INT_RESULT;
  case MYSQL_TYPE_DECIMAL:
unknown's avatar
unknown committed
40 41
  case MYSQL_TYPE_NEWDECIMAL:
    return DECIMAL_RESULT;
42 43 44 45 46 47 48 49
  case MYSQL_TYPE_FLOAT:
  case MYSQL_TYPE_DOUBLE:
    return REAL_RESULT;
  default:
    return STRING_RESULT;
  }
}

50 51 52 53 54 55 56 57 58 59 60
/*
 * Returns TRUE if the 'cmd' is a command that might result in
 * multiple result sets being sent back.
 * Note: This does not include SQLCOM_SELECT which is treated
 *       separately in sql_yacc.yy.
 */
bool
sp_multi_results_command(enum enum_sql_command cmd)
{
  switch (cmd) {
  case SQLCOM_ANALYZE:
61
  case SQLCOM_CHECKSUM:
62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79
  case SQLCOM_HA_READ:
  case SQLCOM_SHOW_BINLOGS:
  case SQLCOM_SHOW_BINLOG_EVENTS:
  case SQLCOM_SHOW_CHARSETS:
  case SQLCOM_SHOW_COLLATIONS:
  case SQLCOM_SHOW_COLUMN_TYPES:
  case SQLCOM_SHOW_CREATE:
  case SQLCOM_SHOW_CREATE_DB:
  case SQLCOM_SHOW_CREATE_FUNC:
  case SQLCOM_SHOW_CREATE_PROC:
  case SQLCOM_SHOW_DATABASES:
  case SQLCOM_SHOW_ERRORS:
  case SQLCOM_SHOW_FIELDS:
  case SQLCOM_SHOW_GRANTS:
  case SQLCOM_SHOW_INNODB_STATUS:
  case SQLCOM_SHOW_KEYS:
  case SQLCOM_SHOW_LOGS:
  case SQLCOM_SHOW_MASTER_STAT:
80
  case SQLCOM_SHOW_MUTEX_STATUS:
81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99
  case SQLCOM_SHOW_NEW_MASTER:
  case SQLCOM_SHOW_OPEN_TABLES:
  case SQLCOM_SHOW_PRIVILEGES:
  case SQLCOM_SHOW_PROCESSLIST:
  case SQLCOM_SHOW_SLAVE_HOSTS:
  case SQLCOM_SHOW_SLAVE_STAT:
  case SQLCOM_SHOW_STATUS:
  case SQLCOM_SHOW_STATUS_FUNC:
  case SQLCOM_SHOW_STATUS_PROC:
  case SQLCOM_SHOW_STORAGE_ENGINES:
  case SQLCOM_SHOW_TABLES:
  case SQLCOM_SHOW_VARIABLES:
  case SQLCOM_SHOW_WARNS:
    return TRUE;
  default:
    return FALSE;
  }
}

100 101 102
/* Evaluate a (presumed) func item. Always returns an item, the parameter
** if nothing else.
*/
103 104
Item *
sp_eval_func_item(THD *thd, Item *it, enum enum_field_types type)
105
{
106
  DBUG_ENTER("sp_eval_func_item");
107
  it= it->this_item();
108
  DBUG_PRINT("info", ("type: %d", type));
109

110
  if (!it->fixed && it->fix_fields(thd, 0, &it))
111 112
  {
    DBUG_PRINT("info", ("fix_fields() failed"));
113
    DBUG_RETURN(NULL);
114
  }
115

116
  /* QQ How do we do this? Is there some better way? */
117
  if (type == MYSQL_TYPE_NULL)
118 119
    it= new Item_null();
  else
120
  {
121 122
    switch (sp_map_result_type(type)) {
    case INT_RESULT:
123 124 125 126
      {
	longlong i= it->val_int();

	if (it->null_value)
unknown's avatar
unknown committed
127 128
	{
	  DBUG_PRINT("info", ("INT_RESULT: null"));
129
	  it= new Item_null();
unknown's avatar
unknown committed
130
	}
131
	else
unknown's avatar
unknown committed
132 133
	{
	  DBUG_PRINT("info", ("INT_RESULT: %d", i));
unknown's avatar
unknown committed
134
          it= new Item_int(i);
unknown's avatar
unknown committed
135
	}
136 137
	break;
      }
138
    case REAL_RESULT:
139
      {
140
	double d= it->val_real();
141 142

	if (it->null_value)
unknown's avatar
unknown committed
143 144
	{
	  DBUG_PRINT("info", ("REAL_RESULT: null"));
145
	  it= new Item_null();
unknown's avatar
unknown committed
146
	}
147
	else
unknown's avatar
unknown committed
148
	{
149 150 151 152
	  /* There's some difference between Item::new_item() and the
	   * constructor; the former crashes, the latter works... weird. */
	  uint8 decimals= it->decimals;
	  uint32 max_length= it->max_length;
unknown's avatar
unknown committed
153
	  DBUG_PRINT("info", ("REAL_RESULT: %g", d));
unknown's avatar
unknown committed
154
          it= new Item_float(d);
155 156
	  it->decimals= decimals;
	  it->max_length= max_length;
unknown's avatar
unknown committed
157
	}
158 159
	break;
      }
unknown's avatar
unknown committed
160 161
    case DECIMAL_RESULT:
      {
162
        my_decimal value, *val= it->val_decimal(&value);
unknown's avatar
unknown committed
163
        if (it->null_value)
164
          it= new Item_null();
unknown's avatar
unknown committed
165
        else
166 167
          it= new Item_decimal(val);
        dbug_print_decimal("info", "DECIMAL_RESULT: %s", val);
unknown's avatar
unknown committed
168 169 170
        break;
      }
    case STRING_RESULT:
171 172
      {
	char buffer[MAX_FIELD_WIDTH];
unknown's avatar
unknown committed
173
	String tmp(buffer, sizeof(buffer), it->collation.collation);
174 175
	String *s= it->val_str(&tmp);

176
	if (it->null_value)
unknown's avatar
unknown committed
177 178
	{
	  DBUG_PRINT("info", ("default result: null"));
179
	  it= new Item_null();
unknown's avatar
unknown committed
180
	}
181
	else
unknown's avatar
unknown committed
182
	{
183 184 185
	  DBUG_PRINT("info",("default result: %*s",
                             s->length(), s->c_ptr_quick()));
	  it= new Item_string(thd->strmake(s->ptr(), s->length()),
186
			      s->length(), it->collation.collation);
unknown's avatar
unknown committed
187
	}
188 189
	break;
      }
unknown's avatar
unknown committed
190 191 192
    case ROW_RESULT:
    default:
      DBUG_ASSERT(0);
193 194 195
    }
  }

196
  DBUG_RETURN(it);
197 198
}

199 200 201 202 203 204 205 206 207 208 209

/*
 *
 *  sp_name
 *
 */

void
sp_name::init_qname(THD *thd)
{
  m_qname.length= m_db.length+m_name.length+1;
unknown's avatar
unknown committed
210
  m_qname.str= thd->alloc(m_qname.length+1);
211 212 213 214 215
  sprintf(m_qname.str, "%*s.%*s",
	  m_db.length, (m_db.length ? m_db.str : ""),
	  m_name.length, m_name.str);
}

216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235
sp_name *
sp_name_current_db_new(THD *thd, LEX_STRING name)
{
  sp_name *qname;

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

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


236 237 238 239 240 241 242 243 244
/* ------------------------------------------------------------------ */


/*
 *
 *  sp_head
 *
 */

245 246 247 248 249 250 251 252
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
253 254
  sp= (sp_head *) alloc_root(&own_root, size);
  sp->main_mem_root= own_root;
255
  DBUG_PRINT("info", ("mem_root 0x%lx", (ulong) &sp->mem_root));
256 257 258 259 260 261 262 263
  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
264
  sp_head *sp= (sp_head *) ptr;
265

unknown's avatar
unknown committed
266 267
  /* Make a copy of main_mem_root as free_root will free the sp */
  own_root= sp->main_mem_root;
268 269
  DBUG_PRINT("info", ("mem_root 0x%lx moved to 0x%lx",
                      (ulong) &sp->mem_root, (ulong) &own_root));
270 271 272 273 274
  free_root(&own_root, MYF(0));

  DBUG_VOID_RETURN;
}

275

276
sp_head::sp_head()
277
  :Item_arena((bool)FALSE), m_returns_cs(NULL), m_has_return(FALSE),
278
   m_simple_case(FALSE), m_multi_results(FALSE), m_in_handler(FALSE)
279
{
280 281
  extern byte *
    sp_table_key(const byte *ptr, uint *plen, my_bool first);
282 283
  extern byte 
    *sp_lex_sp_key(const byte *ptr, uint *plen, my_bool first);
284
  DBUG_ENTER("sp_head::sp_head");
285

286
  state= INITIALIZED;
287 288
  m_backpatch.empty();
  m_lex.empty();
289
  hash_init(&m_sptabs, system_charset_info, 0, 0, 0, sp_table_key, 0, 0);
290 291
  hash_init(&m_spfuns, system_charset_info, 0, 0, 0, sp_lex_sp_key, 0, 0);
  hash_init(&m_spprocs, system_charset_info, 0, 0, 0, sp_lex_sp_key, 0, 0);
292 293 294
  DBUG_VOID_RETURN;
}

295

296
void
297
sp_head::init(LEX *lex)
298 299
{
  DBUG_ENTER("sp_head::init");
300

301
  lex->spcont= m_pcont= new sp_pcontext(NULL);
302 303 304 305 306
  /*
    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();
307
  my_init_dynamic_array(&m_instr, sizeof(sp_instr *), 16, 8);
unknown's avatar
unknown committed
308 309
  m_param_begin= m_param_end= m_body_begin= 0;
  m_qname.str= m_db.str= m_name.str= m_params.str= 
310 311
    m_body.str= m_defstr.str= 0;
  m_qname.length= m_db.length= m_name.length= m_params.length=
unknown's avatar
unknown committed
312
    m_body.length= m_defstr.length= 0;
313
  m_returns_cs= NULL;
314 315 316 317
  DBUG_VOID_RETURN;
}

void
318
sp_head::init_strings(THD *thd, LEX *lex, sp_name *name)
319 320
{
  DBUG_ENTER("sp_head::init_strings");
321
  uint n;			/* Counter for nul trimming */ 
unknown's avatar
unknown committed
322
  /* During parsing, we must use thd->mem_root */
unknown's avatar
unknown committed
323
  MEM_ROOT *root= thd->mem_root;
324

325
  /* We have to copy strings to get them into the right memroot */
326 327
  if (name)
  {
328
    m_db.length= name->m_db.length;
329
    if (name->m_db.length == 0)
330
      m_db.str= NULL;
331 332 333 334 335 336 337 338 339 340
    else
      m_db.str= strmake_root(root, name->m_db.str, name->m_db.length);
    m_name.length= name->m_name.length;
    m_name.str= strmake_root(root, name->m_name.str, name->m_name.length);

    if (name->m_qname.length == 0)
      name->init_qname(thd);
    m_qname.length= name->m_qname.length;
    m_qname.str= strmake_root(root, name->m_qname.str, m_qname.length);
  }
341
  else if (thd->db)
342
  {
343
    m_db.length= thd->db_length;
344
    m_db.str= strmake_root(root, thd->db, m_db.length);
345
  }
346

347
  if (m_param_begin && m_param_end)
348
  {
349 350 351
    m_params.length= m_param_end - m_param_begin;
    m_params.str= strmake_root(root,
                               (char *)m_param_begin, m_params.length);
352
  }
353

354 355 356 357 358 359 360 361
  m_body.length= lex->ptr - m_body_begin;
  /* Trim nuls at the end */
  n= 0;
  while (m_body.length && m_body_begin[m_body.length-1] == '\0')
  {
    m_body.length-= 1;
    n+= 1;
  }
unknown's avatar
unknown committed
362
  m_body.str= strmake_root(root, (char *)m_body_begin, m_body.length);
363 364
  m_defstr.length= lex->ptr - lex->buf;
  m_defstr.length-= n;
unknown's avatar
unknown committed
365
  m_defstr.str= strmake_root(root, (char *)lex->buf, m_defstr.length);
366
  DBUG_VOID_RETURN;
367 368
}

unknown's avatar
unknown committed
369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389
TYPELIB *
sp_head::create_typelib(List<String> *src)
{
  TYPELIB *result= NULL;
  DBUG_ENTER("sp_head::clone_typelib");
  if (src->elements)
  {
    result= (TYPELIB*) alloc_root(mem_root, sizeof(TYPELIB));
    result->count= src->elements;
    result->name= "";
    if (!(result->type_names=(const char **)
          alloc_root(mem_root,sizeof(char *)*(result->count+1))))
      return 0;
    List_iterator<String> it(*src);
    for (uint i=0; i<result->count; i++)
      result->type_names[i]= strdup_root(mem_root, (it++)->c_ptr());
    result->type_names[result->count]= 0;
  }
  return result;
}

390 391 392
int
sp_head::create(THD *thd)
{
393
  DBUG_ENTER("sp_head::create");
394 395
  int ret;

396 397
  DBUG_PRINT("info", ("type: %d name: %s params: %s body: %s",
		      m_type, m_name.str, m_params.str, m_body.str));
398

399
#ifndef DBUG_OFF
400
  optimize();
401
  {
402 403 404 405 406 407
    String s;
    sp_instr *i;
    uint ip= 0;
    while ((i = get_instr(ip)))
    {
      char buf[8];
408

409 410 411 412 413 414 415 416
      sprintf(buf, "%4u: ", ip);
      s.append(buf);
      i->print(&s);
      s.append('\n');
      ip+= 1;
    }
    s.append('\0');
    DBUG_PRINT("info", ("Code %s\n%s", m_qname.str, s.ptr()));
417 418 419
  }
#endif

420
  if (m_type == TYPE_ENUM_FUNCTION)
421
    ret= sp_create_function(thd, this);
422
  else
423
    ret= sp_create_procedure(thd, this);
424

425
  DBUG_RETURN(ret);
426 427
}

428 429 430 431 432 433 434
sp_head::~sp_head()
{
  destroy();
  if (m_thd)
    restore_thd_mem_root(m_thd);
}

435 436 437
void
sp_head::destroy()
{
438 439
  sp_instr *i;
  LEX *lex;
unknown's avatar
unknown committed
440 441
  DBUG_ENTER("sp_head::destroy");
  DBUG_PRINT("info", ("name: %s", m_name.str));
442 443 444

  for (uint ip = 0 ; (i = get_instr(ip)) ; ip++)
    delete i;
445 446
  delete_dynamic(&m_instr);
  m_pcont->destroy();
447
  free_items(free_list);
448 449 450 451 452 453 454 455 456 457

  /*
    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);
458 459
  while ((lex= (LEX *)m_lex.pop()))
  {
460 461
    delete m_thd->lex;
    m_thd->lex= lex;
462
  }
463

464 465 466
  hash_free(&m_sptabs);
  hash_free(&m_spfuns);
  hash_free(&m_spprocs);
467
  DBUG_VOID_RETURN;
468
}
469

unknown's avatar
unknown committed
470 471 472 473 474 475 476 477 478 479 480 481 482 483 484

Field *
sp_head::make_field(uint max_length, const char *name, TABLE *dummy)
{
  Field *field;
  DBUG_ENTER("sp_head::make_field");
  field= ::make_field((char *)0,
		!m_returns_len ? max_length : m_returns_len, 
		(uchar *)"", 0, m_returns_pack, m_returns, m_returns_cs,
		(enum Field::geometry_type)0, Field::NONE, 
		m_returns_typelib,
		name ? name : (const char *)m_name.str, dummy);
  DBUG_RETURN(field);
}

485 486 487
int
sp_head::execute(THD *thd)
{
488
  DBUG_ENTER("sp_head::execute");
489
  char olddb[128];
490
  bool dbchanged;
491
  sp_rcontext *ctx;
492
  int ret= 0;
493
  uint ip= 0;
494
  Item_arena *old_arena;
495
  query_id_t old_query_id;
496 497 498 499
  TABLE *old_derived_tables;
  LEX *old_lex;
  Item_change_list old_change_list;
  String old_packet;
500

501

502
#ifndef EMBEDDED_LIBRARY
503
  if (check_stack_overrun(thd, olddb))
504 505 506 507
  {
    DBUG_RETURN(-1);
  }
#endif
508

509
  dbchanged= FALSE;
510 511
  if (m_db.length &&
      (ret= sp_use_new_db(thd, m_db.str, olddb, sizeof(olddb), 0, &dbchanged)))
512
    goto done;
513

514
  if ((ctx= thd->spcont))
515
    ctx->clear_handler();
516
  thd->query_error= 0;
517
  old_arena= thd->current_arena;
518
  thd->current_arena= this;
519

520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547
  /*
    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;
  /*
    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);

548 549 550
  do
  {
    sp_instr *i;
551
    uint hip;			// Handler ip
552 553 554 555 556

    i = get_instr(ip);	// Returns NULL when we're done.
    if (i == NULL)
      break;
    DBUG_PRINT("execute", ("Instruction %u", ip));
557
    thd->set_time();		// Make current_time() et al work
558
    ret= i->execute(thd, &ip);
559 560
    if (i->free_list)
      cleanup_items(i->free_list);
561
    // Check if an exception has occurred and a handler has been found
562 563
    // Note: We havo to check even if ret==0, since warnings (and some
    //       errors don't return a non-zero value.
564 565 566 567
    //       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").
    if (ctx)
568 569 570 571 572 573 574 575 576 577
    {
      uint hf;

      switch (ctx->found_handler(&hip, &hf))
      {
      case SP_HANDLER_NONE:
	break;
      case SP_HANDLER_CONTINUE:
	ctx->save_variables(hf);
	ctx->push_hstack(ip);
unknown's avatar
unknown committed
578
        // Fall through
579 580 581 582
      default:
	ip= hip;
	ret= 0;
	ctx->clear_handler();
583
	ctx->in_handler= TRUE;
unknown's avatar
unknown committed
584
        thd->clear_error();
585
	thd->killed= THD::NOT_KILLED;
586 587 588
	continue;
      }
    }
unknown's avatar
unknown committed
589
  } while (ret == 0 && !thd->killed);
590

591 592 593 594 595 596 597 598 599 600 601
  /* 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;

602
  cleanup_items(thd->current_arena->free_list);
603 604
  thd->current_arena= old_arena;

605
 done:
606 607
  DBUG_PRINT("info", ("ret=%d killed=%d query_error=%d",
		      ret, thd->killed, thd->query_error));
608

unknown's avatar
unknown committed
609
  if (thd->killed)
610
    ret= -1;
611 612
  /* If the DB has changed, the pointer has changed too, but the
     original thd->db will then have been freed */
613
  if (dbchanged)
614
  {
615
    if (! thd->killed)
616
      ret= sp_change_db(thd, olddb, 0);
617
  }
618 619 620 621 622 623 624
  DBUG_RETURN(ret);
}


int
sp_head::execute_function(THD *thd, Item **argp, uint argcount, Item **resp)
{
625
  DBUG_ENTER("sp_head::execute_function");
626
  DBUG_PRINT("info", ("function %s", m_name.str));
627 628 629 630
  uint csize = m_pcont->max_pvars();
  uint params = m_pcont->current_pvars();
  uint hmax = m_pcont->max_handlers();
  uint cmax = m_pcont->max_cursors();
631 632 633 634 635
  sp_rcontext *octx = thd->spcont;
  sp_rcontext *nctx = NULL;
  uint i;
  int ret;

unknown's avatar
unknown committed
636 637 638 639
  if (argcount != params)
  {
    // Need to use my_printf_error here, or it will not terminate the
    // invoking query properly.
640
    my_error(ER_SP_WRONG_NO_OF_ARGS, MYF(0),
641
             "FUNCTION", m_qname.str, params, argcount);
unknown's avatar
unknown committed
642 643 644 645
    DBUG_RETURN(-1);
  }

  // QQ Should have some error checking here? (types, etc...)
646
  nctx= new sp_rcontext(csize, hmax, cmax);
647 648
  for (i= 0 ; i < params && i < argcount ; i++)
  {
649
    sp_pvar_t *pvar = m_pcont->find_pvar(i);
650
    Item *it= sp_eval_func_item(thd, *argp++, pvar->type);
651

652 653 654 655 656 657
    if (it)
      nctx->push_item(it);
    else
    {
      DBUG_RETURN(-1);
    }
658 659
  }
  // The rest of the frame are local variables which are all IN.
660 661 662 663 664 665 666 667 668 669 670
  // Default all variables to null (those with default clauses will
  // be set by an set instruction).
  {
    Item_null *nit= NULL;	// Re-use this, and only create if needed
    for (; i < csize ; i++)
    {
      if (! nit)
	nit= new Item_null();
      nctx->push_item(nit);
    }
  }
671 672 673
  thd->spcont= nctx;

  ret= execute(thd);
674 675

  if (m_type == TYPE_ENUM_FUNCTION && ret == 0)
676
  {
677
    /* We need result only in function but not in trigger */
678 679 680 681 682 683
    Item *it= nctx->get_result();

    if (it)
      *resp= it;
    else
    {
684
      my_error(ER_SP_NORETURNEND, MYF(0), m_name.str);
685 686 687
      ret= -1;
    }
  }
688

689
  nctx->pop_all_cursors();	// To avoid memory leaks after an error
690 691 692 693
  thd->spcont= octx;
  DBUG_RETURN(ret);
}

694 695 696 697 698 699 700 701 702 703 704 705 706
static Item_func_get_user_var *
item_is_user_var(Item *it)
{
  if (it->type() == Item::FUNC_ITEM)
  {
    Item_func *fi= static_cast<Item_func*>(it);

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

707 708 709
int
sp_head::execute_procedure(THD *thd, List<Item> *args)
{
710
  DBUG_ENTER("sp_head::execute_procedure");
711
  DBUG_PRINT("info", ("procedure %s", m_name.str));
712
  int ret= 0;
713 714 715 716
  uint csize = m_pcont->max_pvars();
  uint params = m_pcont->current_pvars();
  uint hmax = m_pcont->max_handlers();
  uint cmax = m_pcont->max_cursors();
717 718
  sp_rcontext *octx = thd->spcont;
  sp_rcontext *nctx = NULL;
719
  my_bool tmp_octx = FALSE;	// True if we have allocated a temporary octx
720

unknown's avatar
unknown committed
721 722
  if (args->elements != params)
  {
723
    my_error(ER_SP_WRONG_NO_OF_ARGS, MYF(0), "PROCEDURE",
724
             m_qname.str, params, args->elements);
unknown's avatar
unknown committed
725 726 727
    DBUG_RETURN(-1);
  }

728
  if (csize > 0 || hmax > 0 || cmax > 0)
729
  {
730
    Item_null *nit= NULL;	// Re-use this, and only create if needed
731
    uint i;
732
    List_iterator_fast<Item> li(*args);
733
    Item *it;
734

735
    nctx= new sp_rcontext(csize, hmax, cmax);
736 737
    if (! octx)
    {				// Create a temporary old context
738 739
      octx= new sp_rcontext(csize, hmax, cmax);
      tmp_octx= TRUE;
740
    }
unknown's avatar
unknown committed
741
    // QQ: Should do type checking?
742 743
    for (i = 0 ; (it= li++) && i < params ; i++)
    {
744
      sp_pvar_t *pvar= m_pcont->find_pvar(i);
745

746
      if (pvar)
747
      {
748 749 750 751 752 753 754 755 756
	if (pvar->mode != sp_param_in)
	{
	  if (!it->is_splocal() && !item_is_user_var(it))
	  {
	    my_error(ER_SP_NOT_VAR_ARG, MYF(0), i+1, m_qname.str);
	    ret= -1;
	    break;
	  }
	}
757
	if (pvar->mode == sp_param_out)
758 759 760 761 762
	{
	  if (! nit)
	    nit= new Item_null();
	  nctx->push_item(nit); // OUT
	}
763
	else
764
	{
765
	  Item *it2= sp_eval_func_item(thd, it, pvar->type);
766 767 768 769 770 771 772 773 774

	  if (it2)
	    nctx->push_item(it2); // IN or INOUT
	  else
	  {
	    ret= -1;		// Eval failed
	    break;
	  }
	}
775
      }
776
    }
777

778
    // The rest of the frame are local variables which are all IN.
779 780
    // Default all variables to null (those with default clauses will
    // be set by an set instruction).
781
    for (; i < csize ; i++)
782
    {
783 784 785
      if (! nit)
	nit= new Item_null();
      nctx->push_item(nit);
786
    }
787 788 789
    thd->spcont= nctx;
  }

790 791
  if (! ret)
    ret= execute(thd);
792

unknown's avatar
unknown committed
793
  if (!ret && csize > 0)
794
  {
795
    List_iterator_fast<Item> li(*args);
796
    Item *it;
797 798 799 800

    // Copy back all OUT or INOUT values to the previous frame, or
    // set global user variables
    for (uint i = 0 ; (it= li++) && i < params ; i++)
801
    {
802
      sp_pvar_t *pvar= m_pcont->find_pvar(i);
803

804
      if (pvar->mode != sp_param_in)
805
      {
806 807 808
	if (it->is_splocal())
	  octx->set_item(static_cast<Item_splocal *>(it)->get_offset(),
			 nctx->get_item(i));
809
	else
810
	{
811 812 813
	  Item_func_get_user_var *guv= item_is_user_var(it);

	  if (guv)
814
	  {
815 816 817 818 819 820 821 822 823 824 825 826
	    Item *item= nctx->get_item(i);
	    Item_func_set_user_var *suv;

	    suv= new Item_func_set_user_var(guv->get_name(), item);
	    /*
	      we do not check suv->fixed, because it can't be fixed after
	      creation
	    */
	    suv->fix_fields(thd, NULL, &item);
	    suv->fix_length_and_dec();
	    suv->check();
	    suv->update();
827
	  }
828 829
	}
      }
830 831 832
    }
  }

833 834 835 836 837 838
  if (tmp_octx)
    octx= NULL;
  if (nctx)
    nctx->pop_all_cursors();	// To avoid memory leaks after an error
  thd->spcont= octx;

839
  DBUG_RETURN(ret);
840 841 842
}


843
// Reset lex during parsing, before we parse a sub statement.
844 845 846
void
sp_head::reset_lex(THD *thd)
{
847 848
  DBUG_ENTER("sp_head::reset_lex");
  LEX *sublex;
849
  LEX *oldlex= thd->lex;
850

851
  (void)m_lex.push_front(oldlex);
852
  thd->lex= sublex= new st_lex;
unknown's avatar
unknown committed
853

854
  /* Reset most stuff. The length arguments doesn't matter here. */
unknown's avatar
unknown committed
855
  lex_start(thd, oldlex->buf, (ulong) (oldlex->end_of_query - oldlex->ptr));
unknown's avatar
unknown committed
856

857
  /* We must reset ptr and end_of_query again */
858 859 860
  sublex->ptr= oldlex->ptr;
  sublex->end_of_query= oldlex->end_of_query;
  sublex->tok_start= oldlex->tok_start;
unknown's avatar
unknown committed
861
  sublex->yylineno= oldlex->yylineno;
862
  /* And keep the SP stuff too */
863 864
  sublex->sphead= oldlex->sphead;
  sublex->spcont= oldlex->spcont;
865 866
  /* And trigger related stuff too */
  sublex->trg_chistics= oldlex->trg_chistics;
867
  sublex->trg_table_fields.empty();
868
  sublex->sp_lex_in_use= FALSE;
869
  DBUG_VOID_RETURN;
870 871
}

872
// Restore lex during parsing, after we have parsed a sub statement.
873 874 875
void
sp_head::restore_lex(THD *thd)
{
876 877
  DBUG_ENTER("sp_head::restore_lex");
  LEX *sublex= thd->lex;
878 879
  LEX *oldlex= (LEX *)m_lex.pop();

880
  init_stmt_after_parse(thd, sublex);
881 882
  if (! oldlex)
    return;			// Nothing to restore
883

884
  // Update some state in the old one first
885 886
  oldlex->ptr= sublex->ptr;
  oldlex->next_state= sublex->next_state;
887
  oldlex->trg_table_fields.push_back(&sublex->trg_table_fields);
888

889 890 891 892 893 894 895 896 897 898 899
  /*
    Add routines which are used by statement to respective sets for
    this routine
  */
  sp_merge_hash(&m_spfuns, &sublex->spfuns);
  sp_merge_hash(&m_spprocs, &sublex->spprocs);
  /*
    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);
900 901 902
  if (! sublex->sp_lex_in_use)
    delete sublex;
  thd->lex= oldlex;
903
  DBUG_VOID_RETURN;
904 905
}

906
void
907
sp_head::push_backpatch(sp_instr *i, sp_label_t *lab)
908
{
909
  bp_t *bp= (bp_t *)sql_alloc(sizeof(bp_t));
910 911 912 913 914 915 916

  if (bp)
  {
    bp->lab= lab;
    bp->instr= i;
    (void)m_backpatch.push_front(bp);
  }
917 918 919
}

void
920
sp_head::backpatch(sp_label_t *lab)
921
{
922
  bp_t *bp;
923
  uint dest= instructions();
924
  List_iterator_fast<bp_t> li(m_backpatch);
925

926
  while ((bp= li++))
927 928 929 930
  {
    if (bp->lab == lab ||
	(bp->lab->type == SP_LAB_REF &&
	 my_strcasecmp(system_charset_info, bp->lab->name, lab->name) == 0))
931
    {
932 933 934 935 936
      if (bp->lab->type != SP_LAB_REF)
	bp->instr->backpatch(dest, lab->ctx);
      else
      {
	sp_label_t *dstlab= bp->lab->ctx->find_label(lab->name);
937

938 939 940 941 942 943
	if (dstlab)
	{
	  bp->lab= lab;
	  bp->instr->backpatch(dest, dstlab->ctx);
	}
      }
944 945 946 947 948 949 950 951 952
    }
  }
}

int
sp_head::check_backpatch(THD *thd)
{
  bp_t *bp;
  List_iterator_fast<bp_t> li(m_backpatch);
953

954 955 956 957
  while ((bp= li++))
  {
    if (bp->lab->type == SP_LAB_REF)
    {
958
      my_error(ER_SP_LILABEL_MISMATCH, MYF(0), "GOTO", bp->lab->name);
959
      return -1;
960
    }
961 962
  }
  return 0;
963 964
}

965 966 967
void
sp_head::set_info(char *definer, uint definerlen,
		  longlong created, longlong modified,
968
		  st_sp_chistics *chistics, ulong sql_mode)
969 970 971 972 973 974 975
{
  char *p= strchr(definer, '@');
  uint len;

  if (! p)
    p= definer;		// Weird...
  len= p-definer;
unknown's avatar
unknown committed
976
  m_definer_user.str= strmake_root(mem_root, definer, len);
977 978
  m_definer_user.length= len;
  len= definerlen-len-1;
unknown's avatar
unknown committed
979
  m_definer_host.str= strmake_root(mem_root, p+1, len);
980 981 982
  m_definer_host.length= len;
  m_created= created;
  m_modified= modified;
unknown's avatar
unknown committed
983 984
  m_chistics= (st_sp_chistics *) memdup_root(mem_root, (char*) chistics,
                                             sizeof(*chistics));
985 986 987
  if (m_chistics->comment.length == 0)
    m_chistics->comment.str= 0;
  else
unknown's avatar
unknown committed
988
    m_chistics->comment.str= strmake_root(mem_root,
989 990
					  m_chistics->comment.str,
					  m_chistics->comment.length);
991
  m_sql_mode= sql_mode;
992 993
}

994 995 996
void
sp_head::reset_thd_mem_root(THD *thd)
{
997
  DBUG_ENTER("sp_head::reset_thd_mem_root");
998
  m_thd_root= thd->mem_root;
unknown's avatar
unknown committed
999
  thd->mem_root= &main_mem_root;
1000 1001 1002
  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
1003 1004 1005
  thd->free_list= NULL;	// Start a new one
  /* Copy the db, since substatements will point to it */
  m_thd_db= thd->db;
unknown's avatar
unknown committed
1006
  thd->db= thd->strmake(thd->db, thd->db_length);
1007
  m_thd= thd;
1008
  DBUG_VOID_RETURN;
1009 1010 1011 1012 1013
}

void
sp_head::restore_thd_mem_root(THD *thd)
{
1014 1015
  DBUG_ENTER("sp_head::restore_thd_mem_root");
  Item *flist= free_list;	// The old list
1016 1017 1018
  set_item_arena(thd);          // Get new free_list and mem_root
  state= INITIALIZED;

1019 1020
  DBUG_PRINT("info", ("mem_root 0x%lx returned from thd mem root 0x%lx",
                      (ulong) &mem_root, (ulong) &thd->mem_root));
1021 1022 1023 1024
  thd->free_list= flist;	// Restore the old one
  thd->db= m_thd_db;		// Restore the original db pointer
  thd->mem_root= m_thd_root;
  m_thd= NULL;
1025
  DBUG_VOID_RETURN;
1026 1027 1028
}


1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043
/*
  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)
1044 1045 1046 1047 1048
{
  TABLE_LIST tables;
  bzero((char*) &tables,sizeof(tables));
  tables.db= (char*) "mysql";
  tables.table_name= tables.alias= (char*) "proc";
1049 1050 1051 1052 1053
  *full_access= (!check_table_access(thd, SELECT_ACL, &tables, 1) ||
                 (!strcmp(sp->m_definer_user.str, thd->priv_user) &&
                  !strcmp(sp->m_definer_host.str, thd->priv_host)));
  if (!*full_access)
    return check_some_routine_access(thd, sp->m_db.str, sp->m_name.str);
1054 1055 1056 1057
  return 0;
}


unknown's avatar
unknown committed
1058 1059 1060 1061 1062 1063 1064 1065
int
sp_head::show_create_procedure(THD *thd)
{
  Protocol *protocol= thd->protocol;
  char buff[2048];
  String buffer(buff, sizeof(buff), system_charset_info);
  int res;
  List<Item> field_list;
1066 1067 1068 1069
  ulong old_sql_mode;
  sys_var *sql_mode_var;
  byte *sql_mode_str;
  ulong sql_mode_len;
1070
  bool full_access;
unknown's avatar
unknown committed
1071 1072 1073

  DBUG_ENTER("sp_head::show_create_procedure");
  DBUG_PRINT("info", ("procedure %s", m_name.str));
1074 1075
  LINT_INIT(sql_mode_str);
  LINT_INIT(sql_mode_len);
1076

1077
  if (check_show_routine_access(thd, this, &full_access))
1078
    return 1;
1079
  
1080 1081 1082 1083 1084 1085
  old_sql_mode= thd->variables.sql_mode;
  thd->variables.sql_mode= m_sql_mode;
  sql_mode_var= find_sys_var("SQL_MODE", 8);
  if (sql_mode_var)
  {
    sql_mode_str= sql_mode_var->value_ptr(thd, OPT_SESSION, 0);
1086
    sql_mode_len= strlen((char*) sql_mode_str);
1087 1088 1089 1090 1091
  }

  field_list.push_back(new Item_empty_string("Procedure", NAME_LEN));
  if (sql_mode_var)
    field_list.push_back(new Item_empty_string("sql_mode", sql_mode_len));
unknown's avatar
unknown committed
1092 1093
  // 1024 is for not to confuse old clients
  field_list.push_back(new Item_empty_string("Create Procedure",
1094
					     max(buffer.length(), 1024)));
1095 1096
  if (protocol->send_fields(&field_list, Protocol::SEND_NUM_ROWS |
                                         Protocol::SEND_EOF))
1097 1098 1099 1100
  {
    res= 1;
    goto done;
  }
unknown's avatar
unknown committed
1101 1102
  protocol->prepare_for_resend();
  protocol->store(m_name.str, m_name.length, system_charset_info);
1103
  if (sql_mode_var)
1104
    protocol->store((char*) sql_mode_str, sql_mode_len, system_charset_info);
1105 1106
  if (full_access)
    protocol->store(m_defstr.str, m_defstr.length, system_charset_info);
unknown's avatar
unknown committed
1107 1108
  res= protocol->write();
  send_eof(thd);
1109 1110 1111

 done:
  thd->variables.sql_mode= old_sql_mode;
unknown's avatar
unknown committed
1112 1113 1114
  DBUG_RETURN(res);
}

1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131

/*
  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;
  insert_dynamic(&m_instr, (gptr)&instr);
}


unknown's avatar
unknown committed
1132 1133 1134 1135 1136 1137 1138 1139
int
sp_head::show_create_function(THD *thd)
{
  Protocol *protocol= thd->protocol;
  char buff[2048];
  String buffer(buff, sizeof(buff), system_charset_info);
  int res;
  List<Item> field_list;
1140 1141 1142 1143
  ulong old_sql_mode;
  sys_var *sql_mode_var;
  byte *sql_mode_str;
  ulong sql_mode_len;
1144
  bool full_access;
unknown's avatar
unknown committed
1145 1146
  DBUG_ENTER("sp_head::show_create_function");
  DBUG_PRINT("info", ("procedure %s", m_name.str));
1147 1148
  LINT_INIT(sql_mode_str);
  LINT_INIT(sql_mode_len);
1149

1150
  if (check_show_routine_access(thd, this, &full_access))
1151 1152
    return 1;

1153 1154 1155 1156 1157 1158
  old_sql_mode= thd->variables.sql_mode;
  thd->variables.sql_mode= m_sql_mode;
  sql_mode_var= find_sys_var("SQL_MODE", 8);
  if (sql_mode_var)
  {
    sql_mode_str= sql_mode_var->value_ptr(thd, OPT_SESSION, 0);
1159
    sql_mode_len= strlen((char*) sql_mode_str);
1160 1161
  }

unknown's avatar
unknown committed
1162
  field_list.push_back(new Item_empty_string("Function",NAME_LEN));
1163 1164
  if (sql_mode_var)
    field_list.push_back(new Item_empty_string("sql_mode", sql_mode_len));
unknown's avatar
unknown committed
1165 1166
  field_list.push_back(new Item_empty_string("Create Function",
					     max(buffer.length(),1024)));
1167 1168
  if (protocol->send_fields(&field_list,
                            Protocol::SEND_NUM_ROWS | Protocol::SEND_EOF))
1169 1170 1171 1172
  {
    res= 1;
    goto done;
  }
unknown's avatar
unknown committed
1173 1174
  protocol->prepare_for_resend();
  protocol->store(m_name.str, m_name.length, system_charset_info);
1175
  if (sql_mode_var)
1176
    protocol->store((char*) sql_mode_str, sql_mode_len, system_charset_info);
1177 1178
  if (full_access)
    protocol->store(m_defstr.str, m_defstr.length, system_charset_info);
unknown's avatar
unknown committed
1179 1180
  res= protocol->write();
  send_eof(thd);
1181 1182 1183

 done:
  thd->variables.sql_mode= old_sql_mode;
unknown's avatar
unknown committed
1184 1185
  DBUG_RETURN(res);
}
1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 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

void
sp_head::optimize()
{
  List<sp_instr> bp;
  sp_instr *i;
  uint src, dst;

  opt_mark(0);

  bp.empty();
  src= dst= 0;
  while ((i= get_instr(src)))
  {
    if (! i->marked)
    {
      delete i;
      src+= 1;
    }
    else
    {
      if (src != dst)
      {
	sp_instr *ibp;
	List_iterator_fast<sp_instr> li(bp);

	set_dynamic(&m_instr, (gptr)&i, dst);
	while ((ibp= li++))
	{
	  sp_instr_jump *ji= static_cast<sp_instr_jump *>(ibp);
	  if (ji->m_dest == src)
	    ji->m_dest= dst;
	}
      }
      i->opt_move(dst, &bp);
      src+= 1;
      dst+= 1;
    }
  }
  m_instr.elements= dst;
  bp.empty();
}

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

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

1238
// ------------------------------------------------------------------
1239

1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280

/*
  Prepare LEX and thread for execution of instruction, if requested open
  and lock LEX's tables, execute instruction's core function, perform
  cleanup afterwards.

  SYNOPSIS
    reset_lex_and_exec_core()
      thd         - thread context
      nextp       - out - next instruction
      open_tables - if TRUE then check read access to tables in LEX's table
                    list and open and lock them (used in instructions which
                    need to calculate some expression and don't execute
                    complete statement).
      sp_instr    - instruction for which we prepare context, and which core
                    function execute by calling its exec_core() method.

  NOTE
    We are not saving/restoring some parts of THD which may need this because
    we do this once for whole routine execution in sp_head::execute().

  RETURN VALUE
    0/non-0 - Success/Failure
*/

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

  DBUG_ASSERT(!thd->derived_tables);
  DBUG_ASSERT(thd->change_list.is_empty());
  /*
    Use our own lex.
    We should not save old value since it is saved/restored in
    sp_head::execute() when we are entering/leaving routine.
  */
  thd->lex= m_lex;

  VOID(pthread_mutex_lock(&LOCK_thread_count));
1281
  thd->query_id= next_query_id();
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
  VOID(pthread_mutex_unlock(&LOCK_thread_count));

  /*
    FIXME. Resetting statement (and using it) is not reentrant, thus recursive
           functions which try to use the same LEX twice will crash server.
           We should prevent such situations by tracking if LEX is already
           in use and throwing error about unallowed recursion if needed.
           OTOH it is nice to allow recursion in cases when LEX is not really
           used (e.g. in mathematical functions), so such tracking should be
           implemented at the same time as ability not to store LEX for
           instruction if it is not really used.
  */
  reset_stmt_for_execute(thd, m_lex);

  /*
    If requested check whenever we have access to tables in LEX's table list
    and open and lock them before executing instructtions core function.
  */
  if (open_tables &&
      (check_table_access(thd, SELECT_ACL, m_lex->query_tables, 0) ||
       open_and_lock_tables(thd, m_lex->query_tables)))
      res= -1;

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

  m_lex->unit.cleanup();

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

  thd->rollback_item_tree_changes();

  /*
    Unlike for PS we should not call Item's destructors for newly created
    items after execution of each instruction in stored routine. This is
    because SP often create Item (like Item_int, Item_string etc...) when
    they want to store some value in local variable, pass return value and
    etc... So their life time should be longer than one instruction.

    Probably we can call destructors for most of them then we are leaving
    routine. But this won't help much as they are allocated in main query
    MEM_ROOT anyway. So they all go to global thd->free_list.

    May be we can use some other MEM_ROOT for this purprose ???

    What else should we do for cleanup ?
    cleanup_items() is called in sp_head::execute()
  */
  return res;
}


1335
//
1336
// sp_instr
1337
//
1338
int sp_instr::exec_core(THD *thd, uint *nextp)
1339
{
1340 1341
  DBUG_ASSERT(0);
  return 0;
1342 1343
}

1344 1345 1346 1347

//
// sp_instr_stmt
//
1348
int
1349
sp_instr_stmt::execute(THD *thd, uint *nextp)
1350
{
1351 1352
  char *query;
  uint32 query_length;
1353
  DBUG_ENTER("sp_instr_stmt::execute");
1354
  DBUG_PRINT("info", ("command: %d", m_lex_keeper.sql_command()));
1355 1356 1357 1358 1359 1360 1361 1362 1363
  int res;

  query= thd->query;
  query_length= thd->query_length;
  if (!(res= alloc_query(thd, m_query.str, m_query.length+1)))
  {
    if (query_cache_send_result_to_client(thd,
					  thd->query, thd->query_length) <= 0)
    {
1364
      res= m_lex_keeper.reset_lex_and_exec_core(thd, nextp, FALSE, this);
1365 1366
      query_cache_end_of_result(thd);
    }
1367 1368
    else
      *nextp= m_ip+1;
1369 1370 1371
    thd->query= query;
    thd->query_length= query_length;
  }
1372 1373 1374
  DBUG_RETURN(res);
}

1375 1376 1377 1378 1379
void
sp_instr_stmt::print(String *str)
{
  str->reserve(12);
  str->append("stmt ");
1380
  str->qs_append((uint)m_lex_keeper.sql_command());
1381 1382 1383
}


1384
int
1385
sp_instr_stmt::exec_core(THD *thd, uint *nextp)
1386
{
1387 1388
  int res= mysql_execute_command(thd);
  *nextp= m_ip+1;
1389
  return res;
1390 1391 1392 1393 1394 1395
}

//
// sp_instr_set
//
int
1396
sp_instr_set::execute(THD *thd, uint *nextp)
1397
{
1398 1399
  DBUG_ENTER("sp_instr_set::execute");
  DBUG_PRINT("info", ("offset: %u", m_offset));
1400 1401 1402 1403 1404 1405 1406

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

int
sp_instr_set::exec_core(THD *thd, uint *nextp)
{
1407 1408
  Item *it;
  int res;
1409

1410 1411 1412 1413 1414 1415 1416 1417
  it= sp_eval_func_item(thd, m_value, m_type);
  if (! it)
    res= -1;
  else
  {
    res= 0;
    thd->spcont->set_item(m_offset, it);
  }
1418
  *nextp = m_ip+1;
1419 1420

  return res;
1421 1422
}

1423 1424 1425 1426 1427 1428 1429 1430 1431 1432
void
sp_instr_set::print(String *str)
{
  str->reserve(12);
  str->append("set ");
  str->qs_append(m_offset);
  str->append(' ');
  m_value->print(str);
}

1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460

//
// sp_instr_set_trigger_field
//
int
sp_instr_set_trigger_field::execute(THD *thd, uint *nextp)
{
  int res= 0;

  DBUG_ENTER("sp_instr_set_trigger_field::execute");
  /* QQ: Still unsure what should we return in case of error 1 or -1 ? */
  if (!value->fixed && value->fix_fields(thd, 0, &value) ||
      trigger_field.fix_fields(thd, 0, 0) ||
      (value->save_in_field(trigger_field.field, 0) < 0))
    res= -1;
  *nextp= m_ip + 1;
  DBUG_RETURN(res);
}

void
sp_instr_set_trigger_field::print(String *str)
{
  str->append("set ", 4);
  trigger_field.print(str);
  str->append(":=", 2);
  value->print(str);
}

1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473
//
// sp_instr_jump
//
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);
}

1474 1475 1476 1477 1478 1479 1480 1481
void
sp_instr_jump::print(String *str)
{
  str->reserve(12);
  str->append("jump ");
  str->qs_append(m_dest);
}

1482 1483 1484
uint
sp_instr_jump::opt_mark(sp_head *sp)
{
1485
  m_dest= opt_shortcut_jump(sp, this);
1486 1487
  if (m_dest != m_ip+1)		/* Jumping to following instruction? */
    marked= 1;
1488 1489 1490 1491 1492
  m_optdest= sp->get_instr(m_dest);
  return m_dest;
}

uint
1493
sp_instr_jump::opt_shortcut_jump(sp_head *sp, sp_instr *start)
1494 1495 1496 1497 1498 1499
{
  uint dest= m_dest;
  sp_instr *i;

  while ((i= sp->get_instr(dest)))
  {
1500
    uint ndest;
1501

1502 1503 1504
    if (start == i)
      break;
    ndest= i->opt_shortcut_jump(sp, start);
1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521
    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;
}

1522 1523 1524
//
// sp_instr_jump_if
//
1525

1526 1527 1528
int
sp_instr_jump_if::execute(THD *thd, uint *nextp)
{
1529 1530
  DBUG_ENTER("sp_instr_jump_if::execute");
  DBUG_PRINT("info", ("destination: %u", m_dest));
1531 1532 1533 1534 1535 1536
  DBUG_RETURN(m_lex_keeper.reset_lex_and_exec_core(thd, nextp, TRUE, this));
}

int
sp_instr_jump_if::exec_core(THD *thd, uint *nextp)
{
1537 1538
  Item *it;
  int res;
1539

1540 1541 1542
  it= sp_eval_func_item(thd, m_expr, MYSQL_TYPE_TINY);
  if (!it)
    res= -1;
1543
  else
1544 1545 1546 1547 1548 1549 1550
  {
    res= 0;
    if (it->val_int())
      *nextp = m_dest;
    else
      *nextp = m_ip+1;
  }
1551 1552

  return res;
1553 1554
}

1555 1556 1557 1558 1559 1560 1561 1562 1563 1564
void
sp_instr_jump_if::print(String *str)
{
  str->reserve(12);
  str->append("jump_if ");
  str->qs_append(m_dest);
  str->append(' ');
  m_expr->print(str);
}

1565 1566 1567 1568 1569 1570 1571 1572
uint
sp_instr_jump_if::opt_mark(sp_head *sp)
{
  sp_instr *i;

  marked= 1;
  if ((i= sp->get_instr(m_dest)))
  {
1573
    m_dest= i->opt_shortcut_jump(sp, this);
1574 1575 1576 1577 1578 1579
    m_optdest= sp->get_instr(m_dest);
  }
  sp->opt_mark(m_dest);
  return m_ip+1;
}

1580 1581 1582 1583 1584 1585
//
// sp_instr_jump_if_not
//
int
sp_instr_jump_if_not::execute(THD *thd, uint *nextp)
{
1586 1587
  DBUG_ENTER("sp_instr_jump_if_not::execute");
  DBUG_PRINT("info", ("destination: %u", m_dest));
1588 1589 1590 1591 1592 1593 1594
  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)
{
1595 1596
  Item *it;
  int res;
1597

1598 1599 1600
  it= sp_eval_func_item(thd, m_expr, MYSQL_TYPE_TINY);
  if (! it)
    res= -1;
1601
  else
1602 1603 1604 1605 1606 1607 1608
  {
    res= 0;
    if (! it->val_int())
      *nextp = m_dest;
    else
      *nextp = m_ip+1;
  }
1609 1610

  return res;
1611
}
1612

1613 1614 1615 1616 1617 1618 1619 1620 1621 1622
void
sp_instr_jump_if_not::print(String *str)
{
  str->reserve(16);
  str->append("jump_if_not ");
  str->qs_append(m_dest);
  str->append(' ');
  m_expr->print(str);
}

1623 1624 1625 1626 1627 1628 1629 1630
uint
sp_instr_jump_if_not::opt_mark(sp_head *sp)
{
  sp_instr *i;

  marked= 1;
  if ((i= sp->get_instr(m_dest)))
  {
1631
    m_dest= i->opt_shortcut_jump(sp, this);
1632 1633 1634 1635 1636 1637
    m_optdest= sp->get_instr(m_dest);
  }
  sp->opt_mark(m_dest);
  return m_ip+1;
}

1638
//
1639
// sp_instr_freturn
1640
//
1641

1642
int
1643
sp_instr_freturn::execute(THD *thd, uint *nextp)
1644
{
1645
  DBUG_ENTER("sp_instr_freturn::execute");
1646 1647 1648 1649 1650 1651 1652
  DBUG_RETURN(m_lex_keeper.reset_lex_and_exec_core(thd, nextp, TRUE, this));
}


int
sp_instr_freturn::exec_core(THD *thd, uint *nextp)
{
1653 1654
  Item *it;
  int res;
1655

1656 1657 1658 1659 1660 1661 1662 1663
  it= sp_eval_func_item(thd, m_value, m_type);
  if (! it)
    res= -1;
  else
  {
    res= 0;
    thd->spcont->set_result(it);
  }
1664
  *nextp= UINT_MAX;
1665 1666

  return res;
1667
}
1668

1669 1670 1671 1672 1673
void
sp_instr_freturn::print(String *str)
{
  str->reserve(12);
  str->append("freturn ");
1674
  str->qs_append((uint)m_type);
1675 1676 1677 1678
  str->append(' ');
  m_value->print(str);
}

1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695
//
// sp_instr_hpush_jump
//
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++))
    thd->spcont->push_handler(p, m_handler, m_type, m_frame);

  *nextp= m_dest;
  DBUG_RETURN(0);
}

1696 1697 1698 1699 1700
void
sp_instr_hpush_jump::print(String *str)
{
  str->reserve(32);
  str->append("hpush_jump ");
1701 1702
  str->qs_append(m_dest);
  str->append(" t=");
1703
  str->qs_append(m_type);
1704
  str->append(" f=");
1705
  str->qs_append(m_frame);
1706
  str->append(" h=");
1707 1708 1709
  str->qs_append(m_handler);
}

1710 1711 1712 1713 1714 1715 1716 1717
uint
sp_instr_hpush_jump::opt_mark(sp_head *sp)
{
  sp_instr *i;

  marked= 1;
  if ((i= sp->get_instr(m_dest)))
  {
1718
    m_dest= i->opt_shortcut_jump(sp, this);
1719 1720 1721 1722 1723 1724
    m_optdest= sp->get_instr(m_dest);
  }
  sp->opt_mark(m_dest);
  return m_ip+1;
}

1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736
//
// sp_instr_hpop
//
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);
}

1737 1738 1739 1740 1741 1742 1743 1744
void
sp_instr_hpop::print(String *str)
{
  str->reserve(12);
  str->append("hpop ");
  str->qs_append(m_count);
}

1745 1746 1747 1748 1749 1750 1751
void
sp_instr_hpop::backpatch(uint dest, sp_pcontext *dst_ctx)
{
  m_count= m_ctx->diff_handlers(dst_ctx);
}


1752 1753 1754 1755 1756 1757 1758
//
// sp_instr_hreturn
//
int
sp_instr_hreturn::execute(THD *thd, uint *nextp)
{
  DBUG_ENTER("sp_instr_hreturn::execute");
1759 1760 1761 1762 1763 1764 1765 1766
  if (m_dest)
    *nextp= m_dest;
  else
  {
    thd->spcont->restore_variables(m_frame);
    *nextp= thd->spcont->pop_hstack();
  }
  thd->spcont->in_handler= FALSE;
1767 1768
  DBUG_RETURN(0);
}
1769

1770 1771 1772
void
sp_instr_hreturn::print(String *str)
{
1773
  str->reserve(16);
1774 1775
  str->append("hreturn ");
  str->qs_append(m_frame);
1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789
  if (m_dest)
    str->qs_append(m_dest);
}

uint
sp_instr_hreturn::opt_mark(sp_head *sp)
{
  if (m_dest)
    return sp_instr_jump::opt_mark(sp);
  else
  {
    marked= 1;
    return UINT_MAX;
  }
1790 1791
}

1792

1793 1794 1795 1796 1797 1798 1799
//
// sp_instr_cpush
//
int
sp_instr_cpush::execute(THD *thd, uint *nextp)
{
  DBUG_ENTER("sp_instr_cpush::execute");
1800
  thd->spcont->push_cursor(&m_lex_keeper);
1801 1802 1803 1804
  *nextp= m_ip+1;
  DBUG_RETURN(0);
}

1805 1806 1807 1808 1809 1810
void
sp_instr_cpush::print(String *str)
{
  str->append("cpush");
}

1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822
//
// sp_instr_cpop
//
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);
}

1823 1824 1825 1826 1827 1828 1829 1830
void
sp_instr_cpop::print(String *str)
{
  str->reserve(12);
  str->append("cpop ");
  str->qs_append(m_count);
}

1831 1832 1833 1834 1835 1836
void
sp_instr_cpop::backpatch(uint dest, sp_pcontext *dst_ctx)
{
  m_count= m_ctx->diff_cursors(dst_ctx);
}

1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850
//
// sp_instr_copen
//
int
sp_instr_copen::execute(THD *thd, uint *nextp)
{
  sp_cursor *c= thd->spcont->get_cursor(m_cursor);
  int res;
  DBUG_ENTER("sp_instr_copen::execute");

  if (! c)
    res= -1;
  else
  {
1851
    sp_lex_keeper *lex_keeper= c->pre_open(thd);
1852

1853 1854
    if (!lex_keeper)
    {
1855
      res= -1;
1856 1857
      *nextp= m_ip+1;
    }
1858
    else
1859 1860 1861
      res= lex_keeper->reset_lex_and_exec_core(thd, nextp, FALSE, this);

    c->post_open(thd, (lex_keeper ? TRUE : FALSE));
1862 1863 1864 1865 1866
  }

  DBUG_RETURN(res);
}

1867 1868 1869 1870 1871 1872 1873 1874
int
sp_instr_copen::exec_core(THD *thd, uint *nextp)
{
  int res= mysql_execute_command(thd);
  *nextp= m_ip+1;
  return res;
}

1875 1876 1877 1878 1879 1880 1881 1882
void
sp_instr_copen::print(String *str)
{
  str->reserve(12);
  str->append("copen ");
  str->qs_append(m_cursor);
}

1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900
//
// sp_instr_cclose
//
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);
}

1901 1902 1903 1904 1905 1906 1907 1908
void
sp_instr_cclose::print(String *str)
{
  str->reserve(12);
  str->append("cclose ");
  str->qs_append(m_cursor);
}

1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925
//
// sp_instr_cfetch
//
int
sp_instr_cfetch::execute(THD *thd, uint *nextp)
{
  sp_cursor *c= thd->spcont->get_cursor(m_cursor);
  int res;
  DBUG_ENTER("sp_instr_cfetch::execute");

  if (! c)
    res= -1;
  else
    res= c->fetch(thd, &m_varlist);
  *nextp= m_ip+1;
  DBUG_RETURN(res);
}
1926

1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951
void
sp_instr_cfetch::print(String *str)
{
  List_iterator_fast<struct sp_pvar> li(m_varlist);
  sp_pvar_t *pv;

  str->reserve(12);
  str->append("cfetch ");
  str->qs_append(m_cursor);
  while ((pv= li++))
  {
    str->reserve(8);
    str->append(' ');
    str->qs_append(pv->offset);
  }
}

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

unknown's avatar
unknown committed
1952
  my_message(m_errcode, ER(m_errcode), MYF(0));
1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964
  *nextp= m_ip+1;
  DBUG_RETURN(-1);
}

void
sp_instr_error::print(String *str)
{
  str->reserve(12);
  str->append("error ");
  str->qs_append(m_errcode);
}

1965 1966
/* ------------------------------------------------------------------ */

1967 1968 1969 1970

//
// Security context swapping
//
1971

1972
#ifndef NO_EMBEDDED_ACCESS_CHECKS
1973 1974 1975
void
sp_change_security_context(THD *thd, sp_head *sp, st_sp_security_context *ctxp)
{
1976
  ctxp->changed= (sp->m_chistics->suid != SP_IS_NOT_SUID &&
1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021
		   (strcmp(sp->m_definer_user.str, thd->priv_user) ||
		    strcmp(sp->m_definer_host.str, thd->priv_host)));

  if (ctxp->changed)
  {
    ctxp->master_access= thd->master_access;
    ctxp->db_access= thd->db_access;
    ctxp->priv_user= thd->priv_user;
    strncpy(ctxp->priv_host, thd->priv_host, sizeof(ctxp->priv_host));
    ctxp->user= thd->user;
    ctxp->host= thd->host;
    ctxp->ip= thd->ip;

    /* Change thise just to do the acl_getroot_no_password */
    thd->user= sp->m_definer_user.str;
    thd->host= thd->ip = sp->m_definer_host.str;

    if (acl_getroot_no_password(thd))
    {			// Failed, run as invoker for now
      ctxp->changed= FALSE;
      thd->master_access= ctxp->master_access;
      thd->db_access= ctxp->db_access;
      thd->priv_user= ctxp->priv_user;
      strncpy(thd->priv_host, ctxp->priv_host, sizeof(thd->priv_host));
    }

    /* Restore these immiediately */
    thd->user= ctxp->user;
    thd->host= ctxp->host;
    thd->ip= ctxp->ip;
  }
}

void
sp_restore_security_context(THD *thd, sp_head *sp, st_sp_security_context *ctxp)
{
  if (ctxp->changed)
  {
    ctxp->changed= FALSE;
    thd->master_access= ctxp->master_access;
    thd->db_access= ctxp->db_access;
    thd->priv_user= ctxp->priv_user;
    strncpy(thd->priv_host, ctxp->priv_host, sizeof(thd->priv_host));
  }
}
2022 2023

#endif /* NO_EMBEDDED_ACCESS_CHECKS */
2024 2025

/*
2026 2027 2028 2029
  Structure that represent all instances of one table
  in optimized multi-set of tables used by routine.
*/

2030 2031 2032 2033 2034
typedef struct st_sp_table
{
  LEX_STRING qname;
  bool temp;
  TABLE_LIST *table;
2035 2036
  uint lock_count;
  uint query_lock_count;
2037 2038 2039 2040 2041 2042 2043 2044 2045 2046
} 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;
}

2047

2048
/*
2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067
  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
*/

2068
bool
2069
sp_head::merge_table_list(THD *thd, TABLE_LIST *table, LEX *lex_for_tmp_check)
2070
{
2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082
  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;
  }

2083
  for (; table ; table= table->next_global)
2084
    if (!table->derived && !table->schema_table)
2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099
    {
      char tname[64+1+64+1+64+1];	// db.table.alias\0
      uint tlen, alen;

      tlen= table->db_length;
      memcpy(tname, table->db, tlen);
      tname[tlen++]= '.';
      memcpy(tname+tlen, table->table_name, table->table_name_length);
      tlen+= table->table_name_length;
      tname[tlen++]= '.';
      alen= strlen(table->alias);
      memcpy(tname+tlen, table->alias, alen);
      tlen+= alen;
      tname[tlen]= '\0';

2100 2101 2102 2103 2104
      /*
        It is safe to store pointer to table list elements in hash,
        since they are supposed to have the same lifetime.
      */
      if ((tab= (SP_TABLE *)hash_search(&m_sptabs, (byte *)tname, tlen)))
2105 2106 2107
      {
	if (tab->table->lock_type < table->lock_type)
	  tab->table= table;	// Use the table with the highest lock type
2108 2109 2110
        tab->query_lock_count++;
        if (tab->query_lock_count > tab->lock_count)
          tab->lock_count++;
2111 2112 2113 2114 2115 2116 2117 2118 2119
      }
      else
      {
	if (!(tab= (SP_TABLE *)thd->calloc(sizeof(SP_TABLE))))
	  return FALSE;
	tab->qname.length= tlen;
	tab->qname.str= (char *)thd->strmake(tname, tab->qname.length);
	if (!tab->qname.str)
	  return FALSE;
2120
	if (lex_for_tmp_check->sql_command == SQLCOM_CREATE_TABLE &&
2121 2122 2123 2124
	    lex_for_tmp_check->query_tables == table &&
	    lex_for_tmp_check->create_info.options & HA_LEX_CREATE_TMP_TABLE)
	  tab->temp= TRUE;
	tab->table= table;
2125 2126
        tab->lock_count= tab->query_lock_count= 1;
	my_hash_insert(&m_sptabs, (byte *)tab);
2127 2128 2129 2130 2131 2132
      }
    }
  return TRUE;
}


2133 2134
/*
  Add tables used by routine to the table list.
2135

2136 2137 2138 2139 2140 2141
  SYNOPSIS
    add_used_tables_to_table_list()
      thd                   - thread context
      query_tables_last_ptr - (in/out) pointer the next_global member of last
                              element of the list where tables will be added
                              (or to its root).
2142

2143 2144 2145
  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'.
2146

2147 2148
    Elements of list will be allocated in PS memroot, so this list will be
    persistent between PS executions.
2149

2150 2151 2152
  RETURN VALUE
    TRUE - if some elements were added, FALSE - otherwise.
*/
2153

2154 2155 2156
bool
sp_head::add_used_tables_to_table_list(THD *thd,
                                       TABLE_LIST ***query_tables_last_ptr)
2157 2158
{
  uint i;
2159 2160 2161 2162 2163 2164 2165 2166
  Item_arena *arena, backup;
  bool result= FALSE;
  DBUG_ENTER("sp_head::add_used_tables_to_table_list");

  /*
    Use persistent arena for table list allocation to be PS friendly.
  */
  arena= thd->change_arena_if_needed(&backup);
2167

2168
  for (i=0 ; i < m_sptabs.records ; i++)
2169
  {
2170 2171 2172
    char *tab_buff;
    TABLE_LIST *table, *otable;
    SP_TABLE *stab= (SP_TABLE *)hash_element(&m_sptabs, i);
2173 2174 2175
    if (stab->temp)
      continue;

2176
    otable= stab->table;
2177

2178 2179 2180
    if (!(tab_buff= (char *)thd->calloc(ALIGN_SIZE(sizeof(TABLE_LIST)) *
                                        stab->lock_count)))
      DBUG_RETURN(FALSE);
2181

2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209
    for (uint j= 0; j < stab->lock_count; j++)
    {
      table= (TABLE_LIST *)tab_buff;

      /*
        It's enough to just copy the pointers as the data will not change
        during the lifetime of the SP. If the SP is used by PS, we assume
        that the PS will be invalidated if the functions is deleted or
        changed.
      */
      table->db= otable->db;
      table->db_length= otable->db_length;
      table->alias= otable->alias;
      table->table_name= otable->table_name;
      table->table_name_length= otable->table_name_length;
      table->lock_type= otable->lock_type;
      table->cacheable_table= 1;
      table->prelocking_placeholder= 1;

      /* 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;
    }
2210
  }
2211 2212 2213 2214 2215

  if (arena)
    thd->restore_backup_item_arena(arena, &backup);

  DBUG_RETURN(result);
2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246
}

/*
 * Simple function for adding an explicetly named (systems) table to
 * the global table list, e.g. "mysql", "proc".
 *
 */
TABLE_LIST *
sp_add_to_query_tables(THD *thd, LEX *lex,
		       const char *db, const char *name,
		       thr_lock_type locktype)
{
  TABLE_LIST *table;

  if (!(table= (TABLE_LIST *)thd->calloc(sizeof(TABLE_LIST))))
  {
    my_error(ER_OUTOFMEMORY, MYF(0), sizeof(TABLE_LIST));
    return NULL;
  }
  table->db_length= strlen(db);
  table->db= thd->strmake(db, table->db_length);
  table->table_name_length= strlen(name);
  table->table_name= thd->strmake(name, table->table_name_length);
  table->alias= thd->strdup(name);
  table->lock_type= locktype;
  table->select_lex= lex->current_select; // QQ?
  table->cacheable_table= 1;
  
  lex->add_to_query_tables(table);
  return table;
}
2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 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 2314 2315 2316


/*
  Auxilary function for adding tables used by routines used in query
  to table lists.

  SYNOPSIS
    sp_add_sp_tables_to_table_list_aux()
      thd       - thread context
      lex       - LEX to which table list tables will be added
      func_hash - routines for which tables should be added
      func_cache- SP cache in which this routines should be looked up

  NOTE
    See sp_add_sp_tables_to_table_list() for more info.

  RETURN VALUE
    TRUE  - some tables were added
    FALSE - no tables were added.
*/

static bool
sp_add_sp_tables_to_table_list_aux(THD *thd, LEX *lex, HASH *func_hash,
                                   sp_cache **func_cache)
{
  uint i;
  bool result= FALSE;

  for (i= 0 ; i < func_hash->records ; i++)
  {
    sp_head *sp;
    LEX_STRING *ls= (LEX_STRING *)hash_element(func_hash, i);
    sp_name name(*ls);

    name.m_qname= *ls;
    if ((sp= sp_cache_lookup(func_cache, &name)))
      result|= sp->add_used_tables_to_table_list(thd, &lex->query_tables_last);
  }

  return result;
}


/*
  Add tables used by routines used in query to table list.

  SYNOPSIS
    sp_add_sp_tables_to_table_list()
      thd      - thread context
      lex      - LEX to which table list tables will be added
      func_lex - LEX for which functions we get tables
                 (useful for adding tables used by view routines)

  NOTE
    Elements of list will be allocated in PS memroot, so this
    list will be persistent between PS execetutions.

  RETURN VALUE
    TRUE  - some tables were added
    FALSE - no tables were added.
*/

bool
sp_add_sp_tables_to_table_list(THD *thd, LEX *lex, LEX *func_lex)
{
  return (sp_add_sp_tables_to_table_list_aux(thd, lex, &func_lex->spfuns,
                                             &thd->sp_func_cache) |
          sp_add_sp_tables_to_table_list_aux(thd, lex, &func_lex->spprocs,
                                             &thd->sp_proc_cache));
}