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

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

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

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


/* A lexical scanner on a temporary buffer with a yacc interface */

#include "mysql_priv.h"
#include "item_create.h"
#include <m_ctype.h>
#include <hash.h>
24 25
#include "sp.h"
#include "sp_head.h"
unknown's avatar
unknown committed
26

27 28 29 30 31
/*
  We are using pointer to this variable for distinguishing between assignment
  to NEW row field (when parsing trigger definition) and structured variable.
*/
sys_var_long_ptr trg_new_row_fake_var(0, 0);
32 33 34 35 36 37 38 39 40 41

/*
  Fake table list object, pointer to which is used as special value for
  st_lex::time_zone_tables_used indicating that we implicitly use time
  zone tables in this statement but real table list was not yet created.
  Pointer to it is also returned by my_tz_get_tables_list() as indication
  of transient error;
*/
TABLE_LIST fake_time_zone_tables_list;

unknown's avatar
unknown committed
42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57
/* Macros to look like lex */

#define yyGet()		*(lex->ptr++)
#define yyGetLast()	lex->ptr[-1]
#define yyPeek()	lex->ptr[0]
#define yyPeek2()	lex->ptr[1]
#define yyUnget()	lex->ptr--
#define yySkip()	lex->ptr++
#define yyLength()	((uint) (lex->ptr - lex->tok_start)-1)

#if MYSQL_VERSION_ID < 32300
#define FLOAT_NUM	REAL_NUM
#endif

pthread_key(LEX*,THR_LEX);

58
/* Longest standard keyword name */
unknown's avatar
unknown committed
59 60
#define TOCK_NAME_LENGTH 24

61 62
/*
  The following data is based on the latin1 character set, and is only
unknown's avatar
unknown committed
63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84
  used when comparing keywords
*/

uchar to_upper_lex[] = {
    0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15,
   16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31,
   32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,
   48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63,
   64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79,
   80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95,
   96, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79,
   80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90,123,124,125,126,127,
  128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,
  144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,
  160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,
  176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,
  192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,
  208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,
  192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,
  208,209,210,211,212,213,214,247,216,217,218,219,220,221,222,255
};

85

unknown's avatar
unknown committed
86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117
inline int lex_casecmp(const char *s, const char *t, uint len)
{
  while (len-- != 0 &&
	 to_upper_lex[(uchar) *s++] == to_upper_lex[(uchar) *t++]) ;
  return (int) len+1;
}

#include "lex_hash.h"


void lex_init(void)
{
  uint i;
  DBUG_ENTER("lex_init");
  for (i=0 ; i < array_elements(symbols) ; i++)
    symbols[i].length=(uchar) strlen(symbols[i].name);
  for (i=0 ; i < array_elements(sql_functions) ; i++)
    sql_functions[i].length=(uchar) strlen(sql_functions[i].name);

  VOID(pthread_key_create(&THR_LEX,NULL));

  DBUG_VOID_RETURN;
}


void lex_free(void)
{					// Call this when daemon ends
  DBUG_ENTER("lex_free");
  DBUG_VOID_RETURN;
}


118 119 120 121 122 123
/*
  This is called before every query that is to be parsed.
  Because of this, it's critical to not do too much things here.
  (We already do too much here)
*/

unknown's avatar
unknown committed
124
void lex_start(THD *thd, uchar *buf,uint length)
unknown's avatar
unknown committed
125
{
unknown's avatar
unknown committed
126
  LEX *lex= thd->lex;
127 128
  lex->unit.init_query();
  lex->unit.init_select();
unknown's avatar
unknown committed
129
  lex->thd= lex->unit.thd= thd;
130 131 132
  lex->select_lex.init_query();
  lex->value_list.empty();
  lex->param_list.empty();
unknown's avatar
unknown committed
133
  lex->view_list.empty();
134 135 136 137 138 139 140 141 142 143
  lex->unit.next= lex->unit.master=
    lex->unit.link_next= lex->unit.return_to= 0;
  lex->unit.prev= lex->unit.link_prev= 0;
  lex->unit.slave= lex->unit.global_parameters= lex->current_select=
    lex->all_selects_list= &lex->select_lex;
  lex->select_lex.master= &lex->unit;
  lex->select_lex.prev= &lex->unit.slave;
  lex->select_lex.link_next= lex->select_lex.slave= lex->select_lex.next= 0;
  lex->select_lex.link_prev= (st_select_lex_node**)&(lex->all_selects_list);
  lex->select_lex.options= 0;
unknown's avatar
unknown committed
144 145
  lex->select_lex.init_order();
  lex->select_lex.group_list.empty();
146 147
  lex->describe= 0;
  lex->derived_tables= FALSE;
unknown's avatar
unknown committed
148
  lex->view_prepare_mode= FALSE;
149 150 151 152
  lex->lock_option= TL_READ;
  lex->found_colon= 0;
  lex->safe_to_cache_query= 1;
  lex->time_zone_tables_used= 0;
unknown's avatar
unknown committed
153 154 155 156 157
  lex->proc_table= lex->query_tables= 0;
  lex->query_tables_last= &lex->query_tables;
  lex->variables_used= 0;
  lex->select_lex.parent_lex= lex;
  lex->empty_field_list_on_rset= 0;
158
  lex->select_lex.select_number= 1;
159
  lex->next_state=MY_LEX_START;
unknown's avatar
unknown committed
160 161
  lex->buf= lex->ptr= buf;
  lex->end_of_query=buf+length;
unknown's avatar
unknown committed
162
  lex->yylineno = 1;
unknown's avatar
unknown committed
163
  lex->in_comment=0;
unknown's avatar
unknown committed
164
  lex->length=0;
unknown's avatar
unknown committed
165 166
  lex->select_lex.in_sum_expr=0;
  lex->select_lex.expr_list.empty();
unknown's avatar
unknown committed
167
  lex->select_lex.ftfunc_list_alloc.empty();
168
  lex->select_lex.ftfunc_list= &lex->select_lex.ftfunc_list_alloc;
unknown's avatar
unknown committed
169 170
  lex->select_lex.group_list.empty();
  lex->select_lex.order_list.empty();
unknown's avatar
unknown committed
171
  lex->current_select= &lex->select_lex;
unknown's avatar
unknown committed
172
  lex->yacc_yyss=lex->yacc_yyvs=0;
173
  lex->ignore_space=test(thd->variables.sql_mode & MODE_IGNORE_SPACE);
174
  lex->sql_command=SQLCOM_END;
175
  lex->duplicates= DUP_ERROR;
176 177
  lex->sphead= NULL;
  lex->spcont= NULL;
178
  lex->trg_table= NULL;
unknown's avatar
unknown committed
179
  lex->proc_list.first= 0;
180 181 182 183 184 185

  extern byte *sp_lex_spfuns_key(const byte *ptr, uint *plen, my_bool first);
  hash_free(&lex->spfuns);
  hash_init(&lex->spfuns, system_charset_info, 0, 0, 0,
	    sp_lex_spfuns_key, 0, 0);

unknown's avatar
unknown committed
186 187 188 189
}

void lex_end(LEX *lex)
{
unknown's avatar
unknown committed
190
  lex->select_lex.expr_list.delete_elements();	// If error when parsing sql-varargs
unknown's avatar
unknown committed
191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210
  x_free(lex->yacc_yyss);
  x_free(lex->yacc_yyvs);
}


static int find_keyword(LEX *lex, uint len, bool function)
{
  uchar *tok=lex->tok_start;

  SYMBOL *symbol = get_hash_symbol((const char *)tok,len,function);
  if (symbol)
  {
    lex->yylval->symbol.symbol=symbol;
    lex->yylval->symbol.str= (char*) tok;
    lex->yylval->symbol.length=len;
    return symbol->tok;
  }
  return 0;
}

211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227
/*
  Check if name is a keyword

  SYNOPSIS
    is_keyword()
    name      checked name
    len       length of checked name

  RETURN VALUES
    0         name is a keyword
    1         name isn't a keyword
*/

bool is_keyword(const char *name, uint len)
{
  return get_hash_symbol(name,len,0)!=0;
}
unknown's avatar
unknown committed
228 229 230

/* make a copy of token before ptr and set yytoklen */

231
static LEX_STRING get_token(LEX *lex,uint length)
unknown's avatar
unknown committed
232 233 234 235
{
  LEX_STRING tmp;
  yyUnget();			// ptr points now after last token char
  tmp.length=lex->yytoklen=length;
236
  tmp.str=(char*) lex->thd->strmake((char*) lex->tok_start,tmp.length);
unknown's avatar
unknown committed
237 238 239
  return tmp;
}

240 241 242 243 244 245 246
/* 
 todo: 
   There are no dangerous charsets in mysql for function 
   get_quoted_token yet. But it should be fixed in the 
   future to operate multichar strings (like ucs2)
*/

247 248 249 250 251 252 253
static LEX_STRING get_quoted_token(LEX *lex,uint length, char quote)
{
  LEX_STRING tmp;
  byte *from, *to, *end;
  yyUnget();			// ptr points now after last token char
  tmp.length=lex->yytoklen=length;
  tmp.str=(char*) lex->thd->alloc(tmp.length+1);
unknown's avatar
unknown committed
254 255 256
  for (from= (byte*) lex->tok_start, to= (byte*) tmp.str, end= to+length ;
       to != end ;
       )
257 258 259 260 261 262 263 264 265 266 267 268 269
  {
    if ((*to++= *from++) == quote)
      from++;					// Skip double quotes
  }
  *to= 0;					// End null for safety
  return tmp;
}


/*
  Return an unescaped text literal without quotes
  Fix sometimes to do only one scan of the string
*/
unknown's avatar
unknown committed
270 271 272 273 274

static char *get_text(LEX *lex)
{
  reg1 uchar c,sep;
  uint found_escape=0;
275
  CHARSET_INFO *cs= lex->thd->charset();
unknown's avatar
unknown committed
276 277 278 279 280 281 282 283

  sep= yyGetLast();			// String should end with this
  //lex->tok_start=lex->ptr-1;		// Remember '
  while (lex->ptr != lex->end_of_query)
  {
    c = yyGet();
#ifdef USE_MB
    int l;
unknown's avatar
unknown committed
284 285
    if (use_mb(cs) &&
        (l = my_ismbchar(cs,
unknown's avatar
unknown committed
286 287 288 289 290 291
                         (const char *)lex->ptr-1,
                         (const char *)lex->end_of_query))) {
	lex->ptr += l-1;
	continue;
    }
#endif
292 293
    if (c == '\\' &&
	!(lex->thd->variables.sql_mode & MODE_NO_BACKSLASH_ESCAPES))
unknown's avatar
unknown committed
294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314
    {					// Escaped character
      found_escape=1;
      if (lex->ptr == lex->end_of_query)
	return 0;
      yySkip();
    }
    else if (c == sep)
    {
      if (c == yyGet())			// Check if two separators in a row
      {
	found_escape=1;			// dupplicate. Remember for delete
	continue;
      }
      else
	yyUnget();

      /* Found end. Unescape and return string */
      uchar *str,*end,*start;

      str=lex->tok_start+1;
      end=lex->ptr-1;
315
      if (!(start=(uchar*) lex->thd->alloc((uint) (end-str)+1)))
unknown's avatar
unknown committed
316
	return (char*) "";		// Sql_alloc has set error flag
unknown's avatar
unknown committed
317 318 319 320 321 322 323 324 325 326 327 328 329
      if (!found_escape)
      {
	lex->yytoklen=(uint) (end-str);
	memcpy(start,str,lex->yytoklen);
	start[lex->yytoklen]=0;
      }
      else
      {
	uchar *to;
	for (to=start ; str != end ; str++)
	{
#ifdef USE_MB
	  int l;
unknown's avatar
unknown committed
330 331
	  if (use_mb(cs) &&
              (l = my_ismbchar(cs,
unknown's avatar
unknown committed
332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399
                               (const char *)str, (const char *)end))) {
	      while (l--)
		  *to++ = *str++;
	      str--;
	      continue;
	  }
#endif
	  if (*str == '\\' && str+1 != end)
	  {
	    switch(*++str) {
	    case 'n':
	      *to++='\n';
	      break;
	    case 't':
	      *to++= '\t';
	      break;
	    case 'r':
	      *to++ = '\r';
	      break;
	    case 'b':
	      *to++ = '\b';
	      break;
	    case '0':
	      *to++= 0;			// Ascii null
	      break;
	    case 'Z':			// ^Z must be escaped on Win32
	      *to++='\032';
	      break;
	    case '_':
	    case '%':
	      *to++= '\\';		// remember prefix for wildcard
	      /* Fall through */
	    default:
	      *to++ = *str;
	      break;
	    }
	  }
	  else if (*str == sep)
	    *to++= *str++;		// Two ' or "
	  else
	    *to++ = *str;

	}
	*to=0;
	lex->yytoklen=(uint) (to-start);
      }
      return (char*) start;
    }
  }
  return 0;					// unexpected end of query
}


/*
** Calc type of integer; long integer, longlong integer or real.
** Returns smallest type that match the string.
** When using unsigned long long values the result is converted to a real
** because else they will be unexpected sign changes because all calculation
** is done with longlong or double.
*/

static const char *long_str="2147483647";
static const uint long_len=10;
static const char *signed_long_str="-2147483648";
static const char *longlong_str="9223372036854775807";
static const uint longlong_len=19;
static const char *signed_longlong_str="-9223372036854775808";
static const uint signed_longlong_len=19;
unknown's avatar
unknown committed
400 401
static const char *unsigned_longlong_str="18446744073709551615";
static const uint unsigned_longlong_len=20;
unknown's avatar
unknown committed
402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456

inline static uint int_token(const char *str,uint length)
{
  if (length < long_len)			// quick normal case
    return NUM;
  bool neg=0;

  if (*str == '+')				// Remove sign and pre-zeros
  {
    str++; length--;
  }
  else if (*str == '-')
  {
    str++; length--;
    neg=1;
  }
  while (*str == '0' && length)
  {
    str++; length --;
  }
  if (length < long_len)
    return NUM;

  uint smaller,bigger;
  const char *cmp;
  if (neg)
  {
    if (length == long_len)
    {
      cmp= signed_long_str+1;
      smaller=NUM;				// If <= signed_long_str
      bigger=LONG_NUM;				// If >= signed_long_str
    }
    else if (length < signed_longlong_len)
      return LONG_NUM;
    else if (length > signed_longlong_len)
      return REAL_NUM;
    else
    {
      cmp=signed_longlong_str+1;
      smaller=LONG_NUM;				// If <= signed_longlong_str
      bigger=REAL_NUM;
    }
  }
  else
  {
    if (length == long_len)
    {
      cmp= long_str;
      smaller=NUM;
      bigger=LONG_NUM;
    }
    else if (length < longlong_len)
      return LONG_NUM;
    else if (length > longlong_len)
unknown's avatar
unknown committed
457 458 459 460 461 462 463
    {
      if (length > unsigned_longlong_len)
	return REAL_NUM;
      cmp=unsigned_longlong_str;
      smaller=ULONGLONG_NUM;
      bigger=REAL_NUM;
    }
unknown's avatar
unknown committed
464 465 466 467
    else
    {
      cmp=longlong_str;
      smaller=LONG_NUM;
468
      bigger= ULONGLONG_NUM;
unknown's avatar
unknown committed
469 470 471 472 473 474
    }
  }
  while (*cmp && *cmp++ == *str++) ;
  return ((uchar) str[-1] <= (uchar) cmp[-1]) ? smaller : bigger;
}

475 476 477 478 479 480 481
/*
  yylex remember the following states from the following yylex()

  - MY_LEX_EOQ			Found end of query
  - MY_LEX_OPERATOR_OR_IDENT	Last state was an ident, text or number
				(which can't be followed by a signed number)
*/
unknown's avatar
unknown committed
482

483
int yylex(void *arg, void *yythd)
unknown's avatar
unknown committed
484 485
{
  reg1	uchar c;
486
  int	tokval, result_state;
unknown's avatar
unknown committed
487
  uint length;
unknown's avatar
unknown committed
488
  enum my_lex_states state;
489
  LEX	*lex= ((THD *)yythd)->lex;
unknown's avatar
unknown committed
490
  YYSTYPE *yylval=(YYSTYPE*) arg;
491
  CHARSET_INFO *cs= ((THD *) yythd)->charset();
492 493
  uchar *state_map= cs->state_map;
  uchar *ident_map= cs->ident_map;
unknown's avatar
unknown committed
494 495 496

  lex->yylval=yylval;			// The global state
  lex->tok_start=lex->tok_end=lex->ptr;
unknown's avatar
unknown committed
497
  state=lex->next_state;
498
  lex->next_state=MY_LEX_OPERATOR_OR_IDENT;
unknown's avatar
unknown committed
499 500 501
  LINT_INIT(c);
  for (;;)
  {
502
    switch (state) {
503 504
    case MY_LEX_OPERATOR_OR_IDENT:	// Next is operator or keyword
    case MY_LEX_START:			// Start of token
505
      // Skip startspace
506
      for (c=yyGet() ; (state_map[c] == MY_LEX_SKIP) ; c= yyGet())
unknown's avatar
unknown committed
507 508 509 510 511
      {
	if (c == '\n')
	  lex->yylineno++;
      }
      lex->tok_start=lex->ptr-1;	// Start of real token
512
      state= (enum my_lex_states) state_map[c];
unknown's avatar
unknown committed
513
      break;
514
    case MY_LEX_ESCAPE:
unknown's avatar
unknown committed
515 516 517 518 519 520
      if (yyGet() == 'N')
      {					// Allow \N as shortcut for NULL
	yylval->lex_str.str=(char*) "\\N";
	yylval->lex_str.length=2;
	return NULL_SYM;
      }
521 522
    case MY_LEX_CHAR:			// Unknown or single char token
    case MY_LEX_SKIP:			// This should not happen
523 524 525 526 527 528 529
      if (c == '-' && yyPeek() == '-' &&
          (my_isspace(cs,yyPeek2()) || 
           my_iscntrl(cs,yyPeek2())))
      {
        state=MY_LEX_COMMENT;
        break;
      }
unknown's avatar
unknown committed
530
      yylval->lex_str.str=(char*) (lex->ptr=lex->tok_start);// Set to first chr
unknown's avatar
unknown committed
531 532 533
      yylval->lex_str.length=1;
      c=yyGet();
      if (c != ')')
534
	lex->next_state= MY_LEX_START;	// Allow signed numbers
unknown's avatar
unknown committed
535 536 537 538
      if (c == ',')
	lex->tok_start=lex->ptr;	// Let tok_start point at next item
      return((int) c);

unknown's avatar
unknown committed
539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558
    case MY_LEX_IDENT_OR_NCHAR:
      if (yyPeek() != '\'')
      {					// Found x'hex-number'
	state= MY_LEX_IDENT;
	break;
      }
      yyGet();				// Skip '
      while ((c = yyGet()) && (c !='\'')) ;
      length=(lex->ptr - lex->tok_start);	// Length of hexnum+3
      if (c != '\'')
      {
	return(ABORT_SYM);		// Illegal hex constant
      }
      yyGet();				// get_token makes an unget
      yylval->lex_str=get_token(lex,length);
      yylval->lex_str.str+=2;		// Skip x'
      yylval->lex_str.length-=3;	// Don't count x' and last '
      lex->yytoklen-=3;
      return (NCHAR_STRING);

559
    case MY_LEX_IDENT_OR_HEX:
unknown's avatar
unknown committed
560
      if (yyPeek() == '\'')
561
      {					// Found x'hex-number'
562
	state= MY_LEX_HEX_NUMBER;
563 564
	break;
      }
unknown's avatar
unknown committed
565
      /* Fall through */
566 567
    case MY_LEX_IDENT_OR_BIN:		// TODO: Add binary string handling
    case MY_LEX_IDENT:
unknown's avatar
unknown committed
568
      uchar *start;
unknown's avatar
unknown committed
569
#if defined(USE_MB) && defined(USE_MB_IDENT)
570
      if (use_mb(cs))
unknown's avatar
unknown committed
571
      {
572
	result_state= IDENT_QUOTED;
573
        if (my_mbcharlen(cs, yyGetLast()) > 1)
unknown's avatar
unknown committed
574
        {
575
          int l = my_ismbchar(cs,
unknown's avatar
unknown committed
576 577 578
                              (const char *)lex->ptr-1,
                              (const char *)lex->end_of_query);
          if (l == 0) {
579
            state = MY_LEX_CHAR;
unknown's avatar
unknown committed
580 581 582 583
            continue;
          }
          lex->ptr += l - 1;
        }
unknown's avatar
unknown committed
584
        while (ident_map[c=yyGet()])
unknown's avatar
unknown committed
585
        {
586
          if (my_mbcharlen(cs, c) > 1)
unknown's avatar
unknown committed
587 588
          {
            int l;
589
            if ((l = my_ismbchar(cs,
unknown's avatar
unknown committed
590 591 592 593 594 595 596 597 598
                              (const char *)lex->ptr-1,
                              (const char *)lex->end_of_query)) == 0)
              break;
            lex->ptr += l-1;
          }
        }
      }
      else
#endif
599
      {
unknown's avatar
unknown committed
600 601 602
        for (result_state= c; ident_map[c= yyGet()]; result_state|= c);
        /* If there were non-ASCII characters, mark that we must convert */
        result_state= result_state & 0x80 ? IDENT_QUOTED : IDENT;
603
      }
unknown's avatar
unknown committed
604
      length= (uint) (lex->ptr - lex->tok_start)-1;
unknown's avatar
unknown committed
605
      start= lex->ptr;
unknown's avatar
unknown committed
606 607
      if (lex->ignore_space)
      {
unknown's avatar
unknown committed
608 609 610 611 612
        /*
          If we find a space then this can't be an identifier. We notice this
          below by checking start != lex->ptr.
        */
        for (; state_map[c] == MY_LEX_SKIP ; c= yyGet());
unknown's avatar
unknown committed
613
      }
unknown's avatar
unknown committed
614
      if (start == lex->ptr && c == '.' && ident_map[yyPeek()])
615
	lex->next_state=MY_LEX_IDENT_SEP;
unknown's avatar
unknown committed
616 617 618 619 620
      else
      {					// '(' must follow directly if function
	yyUnget();
	if ((tokval = find_keyword(lex,length,c == '(')))
	{
621
	  lex->next_state= MY_LEX_START;	// Allow signed numbers
unknown's avatar
unknown committed
622 623 624 625 626
	  return(tokval);		// Was keyword
	}
	yySkip();			// next state does a unget
      }
      yylval->lex_str=get_token(lex,length);
627 628 629 630

      /* 
         Note: "SELECT _bla AS 'alias'"
         _bla should be considered as a IDENT if charset haven't been found.
631
         So we don't use MYF(MY_WME) with get_charset_by_csname to avoid 
632 633 634 635
         producing an error.
      */

      if ((yylval->lex_str.str[0]=='_') && 
unknown's avatar
unknown committed
636 637
          (lex->charset=get_charset_by_csname(yylval->lex_str.str+1,
					      MY_CS_PRIMARY,MYF(0))))
638
        return(UNDERSCORE_CHARSET);
639
      return(result_state);			// IDENT or IDENT_QUOTED
unknown's avatar
unknown committed
640

641
    case MY_LEX_IDENT_SEP:		// Found ident and now '.'
unknown's avatar
unknown committed
642 643 644
      yylval->lex_str.str=(char*) lex->ptr;
      yylval->lex_str.length=1;
      c=yyGet();			// should be '.'
645 646 647
      lex->next_state= MY_LEX_IDENT_START;// Next is an ident (not a keyword)
      if (!ident_map[yyPeek()])		// Probably ` or "
	lex->next_state= MY_LEX_START;
unknown's avatar
unknown committed
648 649
      return((int) c);

650 651
    case MY_LEX_NUMBER_IDENT:		// number or ident which num-start
      while (my_isdigit(cs,(c = yyGet()))) ;
unknown's avatar
unknown committed
652
      if (!ident_map[c])
unknown's avatar
unknown committed
653
      {					// Can't be identifier
654
	state=MY_LEX_INT_OR_REAL;
unknown's avatar
unknown committed
655 656 657 658
	break;
      }
      if (c == 'e' || c == 'E')
      {
unknown's avatar
unknown committed
659
	// The following test is written this way to allow numbers of type 1e1
660
	if (my_isdigit(cs,yyPeek()) || 
661
            (c=(yyGet())) == '+' || c == '-')
unknown's avatar
unknown committed
662
	{				// Allow 1E+10
663
	  if (my_isdigit(cs,yyPeek()))	// Number must have digit after sign
unknown's avatar
unknown committed
664 665
	  {
	    yySkip();
666
	    while (my_isdigit(cs,yyGet())) ;
unknown's avatar
unknown committed
667 668 669 670 671 672 673 674 675
	    yylval->lex_str=get_token(lex,yyLength());
	    return(FLOAT_NUM);
	  }
	}
	yyUnget(); /* purecov: inspected */
      }
      else if (c == 'x' && (lex->ptr - lex->tok_start) == 2 &&
	  lex->tok_start[0] == '0' )
      {						// Varbinary
676
	while (my_isxdigit(cs,(c = yyGet()))) ;
unknown's avatar
unknown committed
677
	if ((lex->ptr - lex->tok_start) >= 4 && !ident_map[c])
unknown's avatar
unknown committed
678 679
	{
	  yylval->lex_str=get_token(lex,yyLength());
680
	  yylval->lex_str.str+=2;		// Skip 0x
unknown's avatar
unknown committed
681 682 683 684 685 686 687
	  yylval->lex_str.length-=2;
	  lex->yytoklen-=2;
	  return (HEX_NUM);
	}
	yyUnget();
      }
      // fall through
688
    case MY_LEX_IDENT_START:			// We come here after '.'
689
      result_state= IDENT;
unknown's avatar
unknown committed
690
#if defined(USE_MB) && defined(USE_MB_IDENT)
691
      if (use_mb(cs))
unknown's avatar
unknown committed
692
      {
693
	result_state= IDENT_QUOTED;
unknown's avatar
unknown committed
694
        while (ident_map[c=yyGet()])
unknown's avatar
unknown committed
695
        {
696
          if (my_mbcharlen(cs, c) > 1)
unknown's avatar
unknown committed
697 698
          {
            int l;
699
            if ((l = my_ismbchar(cs,
unknown's avatar
unknown committed
700 701 702 703 704 705 706 707 708
                                 (const char *)lex->ptr-1,
                                 (const char *)lex->end_of_query)) == 0)
              break;
            lex->ptr += l-1;
          }
        }
      }
      else
#endif
unknown's avatar
unknown committed
709 710 711 712 713
      {
        for (result_state=0; ident_map[c= yyGet()]; result_state|= c);
        /* If there were non-ASCII characters, mark that we must convert */
        result_state= result_state & 0x80 ? IDENT_QUOTED : IDENT;
      }
unknown's avatar
unknown committed
714
      if (c == '.' && ident_map[yyPeek()])
715
	lex->next_state=MY_LEX_IDENT_SEP;// Next is '.'
unknown's avatar
unknown committed
716

717 718
      yylval->lex_str= get_token(lex,yyLength());
      return(result_state);
unknown's avatar
unknown committed
719

720
    case MY_LEX_USER_VARIABLE_DELIMITER:	// Found quote char
721
    {
722 723
      uint double_quotes= 0;
      char quote_char= c;                       // Used char
unknown's avatar
unknown committed
724
      lex->tok_start=lex->ptr;			// Skip first `
725
      while ((c=yyGet()))
unknown's avatar
unknown committed
726
      {
727 728
	int length;
	if ((length= my_mbcharlen(cs, c)) == 1)
729
	{
730 731
	  if (c == (uchar) NAMES_SEP_CHAR)
	    break; /* Old .frm format can't handle this char */
732 733 734 735 736 737 738 739
	  if (c == quote_char)
	  {
	    if (yyPeek() != quote_char)
	      break;
	    c=yyGet();
	    double_quotes++;
	    continue;
	  }
740 741
	}
#ifdef USE_MB
742 743 744
	else if (length < 1)
	  break;				// Error
	lex->ptr+= length-1;
745
#endif
unknown's avatar
unknown committed
746
      }
747 748 749 750 751 752
      if (double_quotes)
	yylval->lex_str=get_quoted_token(lex,yyLength() - double_quotes,
					 quote_char);
      else
	yylval->lex_str=get_token(lex,yyLength());
      if (c == quote_char)
753
	yySkip();			// Skip end `
754
      lex->next_state= MY_LEX_START;
755
      return(IDENT_QUOTED);
756
    }
757
    case MY_LEX_INT_OR_REAL:		// Compleat int or incompleat real
unknown's avatar
unknown committed
758 759 760 761 762 763
      if (c != '.')
      {					// Found complete integer number.
	yylval->lex_str=get_token(lex,yyLength());
	return int_token(yylval->lex_str.str,yylval->lex_str.length);
      }
      // fall through
764 765
    case MY_LEX_REAL:			// Incomplete real number
      while (my_isdigit(cs,c = yyGet())) ;
unknown's avatar
unknown committed
766 767 768 769

      if (c == 'e' || c == 'E')
      {
	c = yyGet();
unknown's avatar
unknown committed
770
	if (c == '-' || c == '+')
771
	  c = yyGet();			// Skip sign
772
	if (!my_isdigit(cs,c))
unknown's avatar
unknown committed
773
	{				// No digit after sign
774
	  state= MY_LEX_CHAR;
unknown's avatar
unknown committed
775 776
	  break;
	}
777
	while (my_isdigit(cs,yyGet())) ;
unknown's avatar
unknown committed
778 779 780 781 782 783
	yylval->lex_str=get_token(lex,yyLength());
	return(FLOAT_NUM);
      }
      yylval->lex_str=get_token(lex,yyLength());
      return(REAL_NUM);

784
    case MY_LEX_HEX_NUMBER:		// Found x'hexstring'
785
      yyGet();				// Skip '
786
      while (my_isxdigit(cs,(c = yyGet()))) ;
787 788 789 790 791 792 793 794 795 796 797 798
      length=(lex->ptr - lex->tok_start);	// Length of hexnum+3
      if (!(length & 1) || c != '\'')
      {
	return(ABORT_SYM);		// Illegal hex constant
      }
      yyGet();				// get_token makes an unget
      yylval->lex_str=get_token(lex,length);
      yylval->lex_str.str+=2;		// Skip x'
      yylval->lex_str.length-=3;	// Don't count x' and last '
      lex->yytoklen-=3;
      return (HEX_NUM);

799 800 801
    case MY_LEX_CMP_OP:			// Incomplete comparison operator
      if (state_map[yyPeek()] == MY_LEX_CMP_OP ||
	  state_map[yyPeek()] == MY_LEX_LONG_CMP_OP)
unknown's avatar
unknown committed
802 803 804
	yySkip();
      if ((tokval = find_keyword(lex,(uint) (lex->ptr - lex->tok_start),0)))
      {
805
	lex->next_state= MY_LEX_START;	// Allow signed numbers
unknown's avatar
unknown committed
806 807
	return(tokval);
      }
808
      state = MY_LEX_CHAR;		// Something fishy found
unknown's avatar
unknown committed
809 810
      break;

811 812 813
    case MY_LEX_LONG_CMP_OP:		// Incomplete comparison operator
      if (state_map[yyPeek()] == MY_LEX_CMP_OP ||
	  state_map[yyPeek()] == MY_LEX_LONG_CMP_OP)
unknown's avatar
unknown committed
814 815
      {
	yySkip();
816
	if (state_map[yyPeek()] == MY_LEX_CMP_OP)
unknown's avatar
unknown committed
817 818 819 820
	  yySkip();
      }
      if ((tokval = find_keyword(lex,(uint) (lex->ptr - lex->tok_start),0)))
      {
821
	lex->next_state= MY_LEX_START;	// Found long op
unknown's avatar
unknown committed
822 823
	return(tokval);
      }
824
      state = MY_LEX_CHAR;		// Something fishy found
unknown's avatar
unknown committed
825 826
      break;

827
    case MY_LEX_BOOL:
unknown's avatar
unknown committed
828 829
      if (c != yyPeek())
      {
830
	state=MY_LEX_CHAR;
unknown's avatar
unknown committed
831 832 833 834
	break;
      }
      yySkip();
      tokval = find_keyword(lex,2,0);	// Is a bool operator
835
      lex->next_state= MY_LEX_START;	// Allow signed numbers
unknown's avatar
unknown committed
836 837
      return(tokval);

838
    case MY_LEX_STRING_OR_DELIMITER:
839 840
      if (((THD *) yythd)->variables.sql_mode & MODE_ANSI_QUOTES)
      {
841
	state= MY_LEX_USER_VARIABLE_DELIMITER;
842 843 844
	break;
      }
      /* " used for strings */
845
    case MY_LEX_STRING:			// Incomplete text string
unknown's avatar
unknown committed
846 847
      if (!(yylval->lex_str.str = get_text(lex)))
      {
848
	state= MY_LEX_CHAR;		// Read char by char
unknown's avatar
unknown committed
849 850 851 852 853
	break;
      }
      yylval->lex_str.length=lex->yytoklen;
      return(TEXT_STRING);

854
    case MY_LEX_COMMENT:			//  Comment
unknown's avatar
unknown committed
855
      lex->select_lex.options|= OPTION_FOUND_COMMENT;
unknown's avatar
unknown committed
856 857
      while ((c = yyGet()) != '\n' && c) ;
      yyUnget();			// Safety against eof
858
      state = MY_LEX_START;		// Try again
unknown's avatar
unknown committed
859
      break;
860
    case MY_LEX_LONG_COMMENT:		/* Long C comment? */
unknown's avatar
unknown committed
861 862
      if (yyPeek() != '*')
      {
863
	state=MY_LEX_CHAR;		// Probable division
unknown's avatar
unknown committed
864 865 866
	break;
      }
      yySkip();				// Skip '*'
unknown's avatar
unknown committed
867
      lex->select_lex.options|= OPTION_FOUND_COMMENT;
unknown's avatar
unknown committed
868 869 870 871
      if (yyPeek() == '!')		// MySQL command in comment
      {
	ulong version=MYSQL_VERSION_ID;
	yySkip();
872 873
	state=MY_LEX_START;
	if (my_isdigit(cs,yyPeek()))
unknown's avatar
unknown committed
874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890
	{				// Version number
	  version=strtol((char*) lex->ptr,(char**) &lex->ptr,10);
	}
	if (version <= MYSQL_VERSION_ID)
	{
	  lex->in_comment=1;
	  break;
	}
      }
      while (lex->ptr != lex->end_of_query &&
	     ((c=yyGet()) != '*' || yyPeek() != '/'))
      {
	if (c == '\n')
	  lex->yylineno++;
      }
      if (lex->ptr != lex->end_of_query)
	yySkip();			// remove last '/'
891
      state = MY_LEX_START;		// Try again
unknown's avatar
unknown committed
892
      break;
893
    case MY_LEX_END_LONG_COMMENT:
unknown's avatar
unknown committed
894 895 896 897
      if (lex->in_comment && yyPeek() == '/')
      {
	yySkip();
	lex->in_comment=0;
898
	state=MY_LEX_START;
unknown's avatar
unknown committed
899 900
      }
      else
901
	state=MY_LEX_CHAR;		// Return '*'
unknown's avatar
unknown committed
902
      break;
903
    case MY_LEX_SET_VAR:		// Check if ':='
unknown's avatar
unknown committed
904 905
      if (yyPeek() != '=')
      {
906
	state=MY_LEX_CHAR;		// Return ':'
unknown's avatar
unknown committed
907 908 909 910
	break;
      }
      yySkip();
      return (SET_VAR);
911
    case MY_LEX_SEMICOLON:			// optional line terminator
unknown's avatar
unknown committed
912 913
      if (yyPeek())
      {
914 915 916
        THD* thd= (THD*)yythd;
        if ((thd->client_capabilities & CLIENT_MULTI_STATEMENTS) && 
            (thd->command != COM_PREPARE))
917 918
        {
          lex->found_colon=(char*)lex->ptr;
919
          thd->server_status |= SERVER_MORE_RESULTS_EXISTS;
920
          lex->next_state=MY_LEX_END;
921 922 923
          return(END_OF_INPUT);
        }
        else
924
 	  state=MY_LEX_CHAR;		// Return ';'
unknown's avatar
unknown committed
925 926 927
	break;
      }
      /* fall true */
928
    case MY_LEX_EOL:
unknown's avatar
unknown committed
929 930 931 932 933 934 935
      if (lex->ptr >= lex->end_of_query)
      {
	lex->next_state=MY_LEX_END;	// Mark for next loop
	return(END_OF_INPUT);
      }
      state=MY_LEX_CHAR;
      break;
936 937
    case MY_LEX_END:
      lex->next_state=MY_LEX_END;
unknown's avatar
unknown committed
938
      return(0);			// We found end of input last time
939 940
      
      /* Actually real shouldn't start with . but allow them anyhow */
941 942 943
    case MY_LEX_REAL_OR_POINT:
      if (my_isdigit(cs,yyPeek()))
	state = MY_LEX_REAL;		// Real
unknown's avatar
unknown committed
944 945
      else
      {
946 947
	state= MY_LEX_IDENT_SEP;	// return '.'
	yyUnget();			// Put back '.'
unknown's avatar
unknown committed
948 949
      }
      break;
950
    case MY_LEX_USER_END:		// end '@' of user@hostname
unknown's avatar
unknown committed
951
      switch (state_map[yyPeek()]) {
952 953 954
      case MY_LEX_STRING:
      case MY_LEX_USER_VARIABLE_DELIMITER:
      case MY_LEX_STRING_OR_DELIMITER:
unknown's avatar
unknown committed
955
	break;
956 957
      case MY_LEX_USER_END:
	lex->next_state=MY_LEX_SYSTEM_VAR;
unknown's avatar
unknown committed
958 959
	break;
      default:
960
	lex->next_state=MY_LEX_HOSTNAME;
unknown's avatar
unknown committed
961 962
	break;
      }
unknown's avatar
unknown committed
963 964 965
      yylval->lex_str.str=(char*) lex->ptr;
      yylval->lex_str.length=1;
      return((int) '@');
966 967 968
    case MY_LEX_HOSTNAME:		// end '@' of user@hostname
      for (c=yyGet() ; 
	   my_isalnum(cs,c) || c == '.' || c == '_' ||  c == '$';
unknown's avatar
unknown committed
969 970 971
	   c= yyGet()) ;
      yylval->lex_str=get_token(lex,yyLength());
      return(LEX_HOSTNAME);
972
    case MY_LEX_SYSTEM_VAR:
unknown's avatar
unknown committed
973 974 975
      yylval->lex_str.str=(char*) lex->ptr;
      yylval->lex_str.length=1;
      yySkip();					// Skip '@'
976 977 978 979
      lex->next_state= (state_map[yyPeek()] ==
			MY_LEX_USER_VARIABLE_DELIMITER ?
			MY_LEX_OPERATOR_OR_IDENT :
			MY_LEX_IDENT_OR_KEYWORD);
unknown's avatar
unknown committed
980
      return((int) '@');
981
    case MY_LEX_IDENT_OR_KEYWORD:
unknown's avatar
unknown committed
982 983 984 985 986
      /*
	We come here when we have found two '@' in a row.
	We should now be able to handle:
	[(global | local | session) .]variable_name
      */
unknown's avatar
unknown committed
987 988 989 990 991
      
      for (result_state= 0; ident_map[c= yyGet()]; result_state|= c);
      /* If there were non-ASCII characters, mark that we must convert */
      result_state= result_state & 0x80 ? IDENT_QUOTED : IDENT;
      
unknown's avatar
unknown committed
992
      if (c == '.')
993
	lex->next_state=MY_LEX_IDENT_SEP;
unknown's avatar
unknown committed
994 995 996 997 998 999 1000
      length= (uint) (lex->ptr - lex->tok_start)-1;
      if ((tokval= find_keyword(lex,length,0)))
      {
	yyUnget();				// Put back 'c'
	return(tokval);				// Was keyword
      }
      yylval->lex_str=get_token(lex,length);
1001
      return(result_state);
unknown's avatar
unknown committed
1002 1003 1004
    }
  }
}
unknown's avatar
unknown committed
1005 1006 1007 1008 1009 1010 1011

/*
  st_select_lex structures initialisations
*/

void st_select_lex_node::init_query()
{
1012 1013
  options= 0;
  linkage= UNSPECIFIED_TYPE;
1014 1015
  no_error= no_table_names_allowed= 0;
  uncacheable= 0;
unknown's avatar
unknown committed
1016 1017 1018 1019 1020 1021 1022 1023 1024
}

void st_select_lex_node::init_select()
{
}

void st_select_lex_unit::init_query()
{
  st_select_lex_node::init_query();
1025
  linkage= GLOBAL_OPTIONS_TYPE;
unknown's avatar
unknown committed
1026
  global_parameters= first_select();
1027 1028
  select_limit_cnt= HA_POS_ERROR;
  offset_limit_cnt= 0;
1029
  union_distinct= 0;
unknown's avatar
unknown committed
1030
  prepared= optimized= executed= 0;
unknown's avatar
unknown committed
1031
  item= 0;
1032 1033
  union_result= 0;
  table= 0;
unknown's avatar
unknown committed
1034
  fake_select_lex= 0;
1035
  cleaned= 0;
1036
  item_list.empty();
1037
  describe= 0;
1038
  found_rows_for_union= 0;
unknown's avatar
unknown committed
1039 1040 1041 1042 1043
}

void st_select_lex::init_query()
{
  st_select_lex_node::init_query();
1044
  table_list.empty();
1045 1046 1047
  top_join_list.empty();
  join_list= &top_join_list;
  embedding= 0;
unknown's avatar
unknown committed
1048
  item_list.empty();
unknown's avatar
unknown committed
1049
  join= 0;
unknown's avatar
VIEW  
unknown committed
1050
  where= prep_where= 0;
1051
  olap= UNSPECIFIED_OLAP_TYPE;
1052 1053
  having_fix_field= 0;
  resolve_mode= NOMATTER_MODE;
unknown's avatar
unknown committed
1054
  cond_count= with_wild= 0;
1055
  conds_processed_with_permanent_arena= 0;
unknown's avatar
unknown committed
1056
  ref_pointer_array= 0;
unknown's avatar
unknown committed
1057
  select_n_having_items= 0;
1058
  subquery_in_having= explicit_limit= 0;
1059
  first_execution= 1;
unknown's avatar
unknown committed
1060
  first_cond_optimization= 1;
1061
  parsing_place= NO_MATTER;
unknown's avatar
unknown committed
1062
  no_wrap_view_item= 0;
unknown's avatar
unknown committed
1063 1064 1065 1066 1067
}

void st_select_lex::init_select()
{
  st_select_lex_node::init_select();
1068 1069 1070 1071 1072 1073
  group_list.empty();
  type= db= db1= table1= db2= table2= 0;
  having= 0;
  use_index_ptr= ignore_index_ptr= 0;
  table_join_options= 0;
  in_sum_expr= with_wild= 0;
unknown's avatar
unknown committed
1074
  options= 0;
1075
  braces= 0;
unknown's avatar
unknown committed
1076
  when_list.empty();
unknown's avatar
unknown committed
1077
  expr_list.empty();
unknown's avatar
unknown committed
1078
  interval_list.empty();
unknown's avatar
unknown committed
1079
  use_index.empty();
unknown's avatar
unknown committed
1080 1081
  ftfunc_list_alloc.empty();
  ftfunc_list= &ftfunc_list_alloc;
unknown's avatar
unknown committed
1082
  linkage= UNSPECIFIED_TYPE;
unknown's avatar
unknown committed
1083 1084 1085 1086 1087 1088
  order_list.elements= 0;
  order_list.first= 0;
  order_list.next= (byte**) &order_list.first;
  select_limit= HA_POS_ERROR;
  offset_limit= 0;
  with_sum_func= 0;
unknown's avatar
unknown committed
1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102
}

/*
  st_select_lex structures linking
*/

/* include on level down */
void st_select_lex_node::include_down(st_select_lex_node *upper)
{
  if ((next= upper->slave))
    next->prev= &next;
  prev= &upper->slave;
  upper->slave= this;
  master= upper;
unknown's avatar
unknown committed
1103
  slave= 0;
unknown's avatar
unknown committed
1104 1105
}

unknown's avatar
unknown committed
1106 1107
/*
  include on level down (but do not link)
unknown's avatar
unknown committed
1108

unknown's avatar
unknown committed
1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122
  SYNOPSYS
    st_select_lex_node::include_standalone()
    upper - reference on node underr which this node should be included
    ref - references on reference on this node
*/
void st_select_lex_node::include_standalone(st_select_lex_node *upper,
					    st_select_lex_node **ref)
{
  next= 0;
  prev= ref;
  master= upper;
  slave= 0;
}

unknown's avatar
unknown committed
1123 1124 1125 1126 1127 1128 1129 1130
/* include neighbour (on same level) */
void st_select_lex_node::include_neighbour(st_select_lex_node *before)
{
  if ((next= before->next))
    next->prev= &next;
  prev= &before->next;
  before->next= this;
  master= before->master;
unknown's avatar
unknown committed
1131
  slave= 0;
unknown's avatar
unknown committed
1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145
}

/* including in global SELECT_LEX list */
void st_select_lex_node::include_global(st_select_lex_node **plink)
{
  if ((link_next= *plink))
    link_next->link_prev= &link_next;
  link_prev= plink;
  *plink= this;
}

//excluding from global list (internal function)
void st_select_lex_node::fast_exclude()
{
unknown's avatar
unknown committed
1146
  if (link_prev)
unknown's avatar
unknown committed
1147 1148 1149 1150
  {
    if ((*link_prev= link_next))
      link_next->link_prev= link_prev;
  }
1151 1152 1153 1154
  // Remove slave structure
  for (; slave; slave= slave->next)
    slave->fast_exclude();
  
unknown's avatar
unknown committed
1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174
}

/*
  excluding select_lex structure (except first (first select can't be
  deleted, because it is most upper select))
*/
void st_select_lex_node::exclude()
{
  //exclude from global list
  fast_exclude();
  //exclude from other structures
  if ((*prev= next))
    next->prev= prev;
  /* 
     We do not need following statements, because prev pointer of first 
     list element point to master->slave
     if (master->slave == this)
       master->slave= next;
  */
}
1175

1176 1177 1178 1179 1180 1181 1182 1183 1184 1185

/*
  Exclude level of current unit from tree of SELECTs

  SYNOPSYS
    st_select_lex_unit::exclude_level()

  NOTE: units which belong to current will be brought up on level of
  currernt unit 
*/
unknown's avatar
unknown committed
1186 1187 1188
void st_select_lex_unit::exclude_level()
{
  SELECT_LEX_UNIT *units= 0, **units_last= &units;
unknown's avatar
unknown committed
1189
  for (SELECT_LEX *sl= first_select(); sl; sl= sl->next_select())
unknown's avatar
unknown committed
1190
  {
unknown's avatar
unknown committed
1191
    // unlink current level from global SELECTs list
unknown's avatar
unknown committed
1192 1193
    if (sl->link_prev && (*sl->link_prev= sl->link_next))
      sl->link_next->link_prev= sl->link_prev;
unknown's avatar
unknown committed
1194 1195

    // bring up underlay levels
unknown's avatar
unknown committed
1196 1197
    SELECT_LEX_UNIT **last= 0;
    for (SELECT_LEX_UNIT *u= sl->first_inner_unit(); u; u= u->next_unit())
unknown's avatar
unknown committed
1198 1199
    {
      u->master= master;
unknown's avatar
unknown committed
1200
      last= (SELECT_LEX_UNIT**)&(u->next);
unknown's avatar
unknown committed
1201
    }
unknown's avatar
unknown committed
1202 1203 1204 1205 1206 1207 1208 1209
    if (last)
    {
      (*units_last)= sl->first_inner_unit();
      units_last= last;
    }
  }
  if (units)
  {
unknown's avatar
unknown committed
1210
    // include brought up levels in place of current
unknown's avatar
unknown committed
1211 1212
    (*prev)= units;
    (*units_last)= (SELECT_LEX_UNIT*)next;
unknown's avatar
unknown committed
1213 1214 1215
    if (next)
      next->prev= (SELECT_LEX_NODE**)units_last;
    units->prev= prev;
unknown's avatar
unknown committed
1216 1217
  }
  else
unknown's avatar
unknown committed
1218 1219
  {
    // exclude currect unit from list of nodes
unknown's avatar
unknown committed
1220
    (*prev)= next;
unknown's avatar
unknown committed
1221 1222 1223
    if (next)
      next->prev= prev;
  }
unknown's avatar
unknown committed
1224 1225
}

1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236

/*
  Exclude subtree of current unit from tree of SELECTs

  SYNOPSYS
    st_select_lex_unit::exclude_tree()
*/
void st_select_lex_unit::exclude_tree()
{
  for (SELECT_LEX *sl= first_select(); sl; sl= sl->next_select())
  {
unknown's avatar
unknown committed
1237
    // unlink current level from global SELECTs list
1238 1239 1240
    if (sl->link_prev && (*sl->link_prev= sl->link_next))
      sl->link_next->link_prev= sl->link_prev;

unknown's avatar
unknown committed
1241
    // unlink underlay levels
1242 1243 1244 1245 1246
    for (SELECT_LEX_UNIT *u= sl->first_inner_unit(); u; u= u->next_unit())
    {
      u->exclude_level();
    }
  }
unknown's avatar
unknown committed
1247
  // exclude currect unit from list of nodes
1248
  (*prev)= next;
unknown's avatar
unknown committed
1249 1250
  if (next)
    next->prev= prev;
1251 1252 1253
}


unknown's avatar
unknown committed
1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265
/*
  st_select_lex_node::mark_as_dependent mark all st_select_lex struct from 
  this to 'last' as dependent

  SYNOPSIS
    last - pointer to last st_select_lex struct, before wich all 
           st_select_lex have to be marked as dependent

  NOTE
    'last' should be reachable from this st_select_lex_node
*/

unknown's avatar
unknown committed
1266
void st_select_lex::mark_as_dependent(SELECT_LEX *last)
unknown's avatar
unknown committed
1267 1268 1269 1270 1271
{
  /*
    Mark all selects from resolved to 1 before select where was
    found table as depended (of select where was found table)
  */
unknown's avatar
unknown committed
1272
  for (SELECT_LEX *s= this;
1273
       s && s != last;
unknown's avatar
unknown committed
1274
       s= s->outer_select())
1275
    if (!(s->uncacheable & UNCACHEABLE_DEPENDENT))
unknown's avatar
unknown committed
1276 1277
    {
      // Select is dependent of outer select
1278
      s->uncacheable|= UNCACHEABLE_DEPENDENT;
1279
      SELECT_LEX_UNIT *munit= s->master_unit();
1280
      munit->uncacheable|= UNCACHEABLE_DEPENDENT;
unknown's avatar
unknown committed
1281 1282 1283
    }
}

1284 1285 1286 1287 1288 1289 1290
bool st_select_lex_node::set_braces(bool value)      { return 1; }
bool st_select_lex_node::inc_in_sum_expr()           { return 1; }
uint st_select_lex_node::get_in_sum_expr()           { return 0; }
TABLE_LIST* st_select_lex_node::get_table_list()     { return 0; }
List<Item>* st_select_lex_node::get_item_list()      { return 0; }
List<String>* st_select_lex_node::get_use_index()    { return 0; }
List<String>* st_select_lex_node::get_ignore_index() { return 0; }
unknown's avatar
unknown committed
1291
TABLE_LIST *st_select_lex_node::add_table_to_list(THD *thd, Table_ident *table,
1292
						  LEX_STRING *alias,
unknown's avatar
unknown committed
1293
						  ulong table_join_options,
1294 1295
						  thr_lock_type flags,
						  List<String> *use_index,
unknown's avatar
unknown committed
1296 1297
						  List<String> *ignore_index,
                                                  LEX_STRING *option)
1298 1299 1300
{
  return 0;
}
unknown's avatar
unknown committed
1301 1302 1303 1304 1305 1306 1307 1308
ulong st_select_lex_node::get_table_join_options()
{
  return 0;
}

/*
  prohibit using LIMIT clause
*/
unknown's avatar
unknown committed
1309
bool st_select_lex::test_limit()
unknown's avatar
unknown committed
1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322
{
  if (select_limit != HA_POS_ERROR)
  {
    my_error(ER_NOT_SUPPORTED_YET, MYF(0),
         "LIMIT & IN/ALL/ANY/SOME subquery");
    return(1);
  }
  // We need only 1 row to determinate existence
  select_limit= 1;
  // no sense in ORDER BY without LIMIT
  order_list.empty();
  return(0);
}
1323

1324

1325 1326 1327 1328 1329
st_select_lex_unit* st_select_lex_unit::master_unit()
{
    return this;
}

1330

1331 1332 1333 1334 1335
st_select_lex* st_select_lex_unit::outer_select()
{
  return (st_select_lex*) master;
}

1336

unknown's avatar
unknown committed
1337
bool st_select_lex::add_order_to_list(THD *thd, Item *item, bool asc)
unknown's avatar
unknown committed
1338
{
unknown's avatar
unknown committed
1339
  return add_to_list(thd, order_list, item, asc);
unknown's avatar
unknown committed
1340
}
1341

1342

unknown's avatar
unknown committed
1343
bool st_select_lex::add_item_to_list(THD *thd, Item *item)
1344
{
1345 1346 1347
  DBUG_ENTER("st_select_lex::add_item_to_list");
  DBUG_PRINT("info", ("Item: %p", item));
  DBUG_RETURN(item_list.push_back(item));
1348 1349
}

1350

unknown's avatar
unknown committed
1351
bool st_select_lex::add_group_to_list(THD *thd, Item *item, bool asc)
1352
{
unknown's avatar
unknown committed
1353
  return add_to_list(thd, group_list, item, asc);
1354 1355
}

1356

1357 1358 1359 1360 1361
bool st_select_lex::add_ftfunc_to_list(Item_func_match *func)
{
  return !func || ftfunc_list->push_back(func); // end of memory?
}

1362

1363 1364 1365 1366 1367
st_select_lex_unit* st_select_lex::master_unit()
{
  return (st_select_lex_unit*) master;
}

1368

1369 1370 1371 1372 1373
st_select_lex* st_select_lex::outer_select()
{
  return (st_select_lex*) master->get_master();
}

1374

1375 1376 1377 1378 1379 1380
bool st_select_lex::set_braces(bool value)
{
  braces= value;
  return 0; 
}

1381

1382 1383 1384 1385 1386 1387
bool st_select_lex::inc_in_sum_expr()
{
  in_sum_expr++;
  return 0;
}

1388

1389 1390 1391 1392 1393
uint st_select_lex::get_in_sum_expr()
{
  return in_sum_expr;
}

1394

1395 1396 1397 1398 1399 1400 1401 1402 1403 1404
TABLE_LIST* st_select_lex::get_table_list()
{
  return (TABLE_LIST*) table_list.first;
}

List<Item>* st_select_lex::get_item_list()
{
  return &item_list;
}

1405

1406 1407 1408 1409 1410
List<String>* st_select_lex::get_use_index()
{
  return use_index_ptr;
}

1411

1412 1413 1414 1415 1416
List<String>* st_select_lex::get_ignore_index()
{
  return ignore_index_ptr;
}

1417

unknown's avatar
unknown committed
1418 1419 1420 1421 1422
ulong st_select_lex::get_table_join_options()
{
  return table_join_options;
}

1423

unknown's avatar
unknown committed
1424 1425 1426 1427
bool st_select_lex::setup_ref_array(THD *thd, uint order_group_num)
{
  if (ref_pointer_array)
    return 0;
1428 1429 1430 1431 1432

  /*
    We have to create array in prepared statement memory if it is
    prepared statement
  */
1433
  Item_arena *arena= thd->current_arena;
unknown's avatar
unknown committed
1434
  return (ref_pointer_array= 
1435 1436 1437 1438
          (Item **)arena->alloc(sizeof(Item*) *
                                (item_list.elements +
                                 select_n_having_items +
                                 order_group_num)* 5)) == 0;
unknown's avatar
unknown committed
1439 1440
}

1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453

/*
  Find db.table which will be updated in this unit

  SYNOPSIS
    st_select_lex_unit::check_updateable()
    db		- data base name
    table	- real table name

  RETURN
    1 - found
    0 - OK (table did not found)
*/
1454

1455 1456
bool st_select_lex_unit::check_updateable(char *db, char *table)
{
1457
  for (SELECT_LEX *sl= first_select(); sl; sl= sl->next_select())
1458 1459 1460 1461 1462 1463 1464
    if (sl->check_updateable(db, table))
      return 1;
  return 0;
}


/*
unknown's avatar
unknown committed
1465 1466
  Find db.table which will be updated in this select and
  underlying ones (except derived tables)
1467 1468 1469 1470 1471 1472 1473 1474 1475 1476

  SYNOPSIS
    st_select_lex::check_updateable()
    db		- data base name
    table	- real table name

  RETURN
    1 - found
    0 - OK (table did not found)
*/
1477

1478 1479
bool st_select_lex::check_updateable(char *db, char *table)
{
1480
  if (find_table_in_local_list(get_table_list(), db, table))
1481 1482
    return 1;

1483 1484 1485 1486
  return check_updateable_in_subqueries(db, table);
}

/*
unknown's avatar
unknown committed
1487
   Find db.table which will be updated in underlying subqueries
1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500

   SYNOPSIS
    st_select_lex::check_updateable_in_subqueries()
    db		- data base name
    table	- real table name

  RETURN
    1 - found
    0 - OK (table did not found)
*/

bool st_select_lex::check_updateable_in_subqueries(char *db, char *table)
{
1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512
  for (SELECT_LEX_UNIT *un= first_inner_unit();
       un;
       un= un->next_unit())
  {
    if (un->first_select()->linkage != DERIVED_TABLE_TYPE &&
	un->check_updateable(db, table))
      return 1;
  }
  return 0;
}


unknown's avatar
unknown committed
1513 1514 1515 1516 1517 1518
void st_select_lex_unit::print(String *str)
{
  for (SELECT_LEX *sl= first_select(); sl; sl= sl->next_select())
  {
    if (sl != first_select())
    {
1519
      str->append(" union ", 7);
1520
      if (!union_distinct)
1521
	str->append("all ", 4);
unknown's avatar
unknown committed
1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532
    }
    if (sl->braces)
      str->append('(');
    sl->print(thd, str);
    if (sl->braces)
      str->append(')');
  }
  if (fake_select_lex == global_parameters)
  {
    if (fake_select_lex->order_list.elements)
    {
1533
      str->append(" order by ", 10);
unknown's avatar
unknown committed
1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546
      fake_select_lex->print_order(str,
				   (ORDER *) fake_select_lex->
				   order_list.first);
    }
    fake_select_lex->print_limit(thd, str);
  }
}


void st_select_lex::print_order(String *str, ORDER *order)
{
  for (; order; order= order->next)
  {
1547 1548 1549 1550 1551 1552 1553 1554
    if (order->counter_used)
    {
      char buffer[20];
      my_snprintf(buffer, 20, "%u", order->counter);
      str->append(buffer);
    }
    else
      (*order->item)->print(str);
unknown's avatar
unknown committed
1555
    if (!order->asc)
1556
      str->append(" desc", 5);
unknown's avatar
unknown committed
1557 1558 1559 1560 1561
    if (order->next)
      str->append(',');
  }
}
 
1562

unknown's avatar
unknown committed
1563 1564
void st_select_lex::print_limit(THD *thd, String *str)
{
1565 1566 1567
  SELECT_LEX_UNIT *unit= master_unit();
  Item_subselect *item= unit->item;
  if (item && unit->global_parameters == this &&
unknown's avatar
VIEW  
unknown committed
1568 1569 1570 1571 1572 1573 1574 1575
      (item->substype() == Item_subselect::EXISTS_SUBS ||
       item->substype() == Item_subselect::IN_SUBS ||
       item->substype() == Item_subselect::ALL_SUBS))
  {
    DBUG_ASSERT(select_limit == 1L && offset_limit == 0L);
    return;
  }

unknown's avatar
unknown committed
1576 1577 1578
  if (!thd)
    thd= current_thd;

1579
  if (explicit_limit)
unknown's avatar
unknown committed
1580
  {
1581 1582 1583 1584 1585 1586
    str->append(" limit ", 7);
    char buff[20];
    // latin1 is good enough for numbers
    String st(buff, sizeof(buff),  &my_charset_latin1);
    st.set((ulonglong)select_limit, &my_charset_latin1);
    str->append(st);
unknown's avatar
unknown committed
1587 1588 1589
    if (offset_limit)
    {
      str->append(',');
1590 1591
      st.set((ulonglong)select_limit, &my_charset_latin1);
      str->append(st);
unknown's avatar
unknown committed
1592 1593 1594 1595
    }
  }
}

unknown's avatar
VIEW  
unknown committed
1596 1597

/*
1598
  Check whether the merging algorithm can be used on this VIEW
unknown's avatar
VIEW  
unknown committed
1599 1600 1601 1602

  SYNOPSIS
    st_lex::can_be_merged()

1603
  DESCRIPTION
1604 1605 1606
    We can apply merge algorithm if it is single SELECT view  with
    subqueries only in WHERE clause (we do not count SELECTs of underlying
    views, and second level subqueries) and we have not grpouping, ordering,
1607 1608 1609
    HAVING clause, aggregate functions, DISTINCT clause, LIMIT clause and
    several underlying tables.

unknown's avatar
VIEW  
unknown committed
1610 1611 1612 1613 1614 1615 1616 1617 1618 1619
  RETURN
    FALSE - only temporary table algorithm can be used
    TRUE  - merge algorithm can be used
*/

bool st_lex::can_be_merged()
{
  // TODO: do not forget implement case when select_lex.table_list.elements==0

  /* find non VIEW subqueries/unions */
1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636
  bool selects_allow_merge= select_lex.next_select() == 0;
  if (selects_allow_merge)
  {
    for (SELECT_LEX_UNIT *unit= select_lex.first_inner_unit();
         unit;
         unit= unit->next_unit())
    {
      if (unit->first_select()->parent_lex == this &&
          (unit->item == 0 || unit->item->place() != IN_WHERE))
      {
        selects_allow_merge= 0;
        break;
      }
    }
  }

  return (selects_allow_merge &&
unknown's avatar
VIEW  
unknown committed
1637 1638 1639
	  select_lex.order_list.elements == 0 &&
	  select_lex.group_list.elements == 0 &&
	  select_lex.having == 0 &&
1640
          select_lex.with_sum_func == 0 &&
unknown's avatar
VIEW  
unknown committed
1641 1642 1643 1644 1645
	  select_lex.table_list.elements == 1 &&
	  !(select_lex.options & SELECT_DISTINCT) &&
          select_lex.select_limit == HA_POS_ERROR);
}

1646

unknown's avatar
VIEW  
unknown committed
1647
/*
1648
  check if command can use VIEW with MERGE algorithm (for top VIEWs)
unknown's avatar
VIEW  
unknown committed
1649 1650 1651 1652

  SYNOPSIS
    st_lex::can_use_merged()

1653 1654 1655 1656 1657
  DESCRIPTION
    Only listed here commands can use merge algorithm in top level
    SELECT_LEX (for subqueries will be used merge algorithm if
    st_lex::can_not_use_merged() is not TRUE).

unknown's avatar
VIEW  
unknown committed
1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676
  RETURN
    FALSE - command can't use merged VIEWs
    TRUE  - VIEWs with MERGE algorithms can be used
*/

bool st_lex::can_use_merged()
{
  switch (sql_command)
  {
  case SQLCOM_SELECT:
  case SQLCOM_CREATE_TABLE:
  case SQLCOM_UPDATE:
  case SQLCOM_UPDATE_MULTI:
  case SQLCOM_DELETE:
  case SQLCOM_DELETE_MULTI:
  case SQLCOM_INSERT:
  case SQLCOM_INSERT_SELECT:
  case SQLCOM_REPLACE:
  case SQLCOM_REPLACE_SELECT:
1677
  case SQLCOM_LOAD:
unknown's avatar
VIEW  
unknown committed
1678 1679 1680 1681 1682 1683
    return TRUE;
  default:
    return FALSE;
  }
}

1684
/*
1685
  Check if command can't use merged views in any part of command
1686 1687 1688 1689

  SYNOPSIS
    st_lex::can_not_use_merged()

1690 1691 1692 1693
  DESCRIPTION
    Temporary table algorithm will be used on all SELECT levels for queries
    listed here (see also st_lex::can_use_merged()).

1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710
  RETURN
    FALSE - command can't use merged VIEWs
    TRUE  - VIEWs with MERGE algorithms can be used
*/

bool st_lex::can_not_use_merged()
{
  switch (sql_command)
  {
  case SQLCOM_CREATE_VIEW:
  case SQLCOM_SHOW_CREATE:
    return TRUE;
  default:
    return FALSE;
  }
}

unknown's avatar
VIEW  
unknown committed
1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738
/*
  Detect that we need only table structure of derived table/view

  SYNOPSIS
    only_view_structure()

  RETURN
    TRUE yes, we need only structure
    FALSE no, we need data
*/
bool st_lex::only_view_structure()
{
  switch(sql_command)
  {
  case SQLCOM_SHOW_CREATE:
  case SQLCOM_SHOW_TABLES:
  case SQLCOM_SHOW_FIELDS:
  case SQLCOM_REVOKE_ALL:
  case SQLCOM_REVOKE:
  case SQLCOM_GRANT:
  case SQLCOM_CREATE_VIEW:
    return TRUE;
  default:
    return FALSE;
  }
}


unknown's avatar
unknown committed
1739 1740 1741 1742 1743 1744 1745 1746
/*
  initialize limit counters

  SYNOPSIS
    st_select_lex_unit::set_limit()
    values	- SELECT_LEX with initial values for counters
    sl		- SELECT_LEX for options set
*/
unknown's avatar
VIEW  
unknown committed
1747

unknown's avatar
unknown committed
1748
void st_select_lex_unit::set_limit(SELECT_LEX *values,
1749 1750
				   SELECT_LEX *sl)
{
unknown's avatar
unknown committed
1751 1752 1753
  offset_limit_cnt= values->offset_limit;
  select_limit_cnt= values->select_limit+values->offset_limit;
  if (select_limit_cnt < values->select_limit)
1754 1755 1756 1757 1758
    select_limit_cnt= HA_POS_ERROR;		// no limit
  if (select_limit_cnt == HA_POS_ERROR)
    sl->options&= ~OPTION_FOUND_ROWS;
}

unknown's avatar
unknown committed
1759

1760
/*
1761 1762
  Unlink the first table from the global table list and the first table from
  outer select (lex->select_lex) local list
1763 1764 1765

  SYNOPSIS
    unlink_first_table()
1766
    link_to_local	Set to 1 if caller should link this table to local list
unknown's avatar
unknown committed
1767

unknown's avatar
VIEW  
unknown committed
1768
  NOTES
1769 1770
    We assume that first tables in both lists is the same table or the local
    list is empty.
1771 1772

  RETURN
1773
    0	If 'query_tables' == 0
unknown's avatar
VIEW  
unknown committed
1774
    unlinked table
1775
      In this case link_to_local is set.
unknown's avatar
unknown committed
1776

1777
*/
unknown's avatar
VIEW  
unknown committed
1778
TABLE_LIST *st_lex::unlink_first_table(bool *link_to_local)
1779
{
unknown's avatar
VIEW  
unknown committed
1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798
  TABLE_LIST *first;
  if ((first= query_tables))
  {
    /*
      Exclude from global table list
    */
    if ((query_tables= query_tables->next_global))
      query_tables->prev_global= &query_tables;
    first->next_global= 0;

    /*
      and from local list if it is not empty
    */
    if ((*link_to_local= test(select_lex.table_list.first)))
    {
      select_lex.table_list.first= (byte*) first->next_local;
      select_lex.table_list.elements--;	//safety
      first->next_local= 0;
      /*
1799 1800
        Ensure that the global list has the same first table as the local
        list.
unknown's avatar
VIEW  
unknown committed
1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816
      */
      first_lists_tables_same();
    }
  }
  return first;
}


/*
  Bring first local table of first most outer select to first place in global
  table list

  SYNOPSYS
     st_lex::first_lists_tables_same()

  NOTES
1817 1818 1819 1820 1821 1822
    In many cases (for example, usual INSERT/DELETE/...) the first table of
    main SELECT_LEX have special meaning => check that it is the first table
    in global list and re-link to be first in the global list if it is
    necessary.  We need such re-linking only for queries with sub-queries in
    the select list, as only in this case tables of sub-queries will go to
    the global list first.
unknown's avatar
VIEW  
unknown committed
1823 1824 1825 1826 1827 1828 1829
*/

void st_lex::first_lists_tables_same()
{
  TABLE_LIST *first_table= (TABLE_LIST*) select_lex.table_list.first;
  if (query_tables != first_table && first_table != 0)
  {
1830
    TABLE_LIST *next;
unknown's avatar
VIEW  
unknown committed
1831 1832
    if (query_tables_last == &first_table->next_global)
      query_tables_last= first_table->prev_global;
1833

1834
    if ((next= *first_table->prev_global= first_table->next_global))
unknown's avatar
VIEW  
unknown committed
1835 1836 1837 1838
      next->prev_global= first_table->prev_global;
    /* include in new place */
    first_table->next_global= query_tables;
    /*
1839 1840 1841
       We are sure that query_tables is not 0, because first_table was not
       first table in the global list => we can use
       query_tables->prev_global without check of query_tables
unknown's avatar
VIEW  
unknown committed
1842 1843 1844 1845 1846
    */
    query_tables->prev_global= &first_table->next_global;
    first_table->prev_global= &query_tables;
    query_tables= first_table;
  }
1847 1848
}

unknown's avatar
unknown committed
1849

1850
/*
unknown's avatar
unknown committed
1851
  Link table back that was unlinked with unlink_first_table()
1852 1853 1854

  SYNOPSIS
    link_first_table_back()
unknown's avatar
VIEW  
unknown committed
1855
    link_to_local	do we need link this table to local
1856 1857 1858 1859

  RETURN
    global list
*/
unknown's avatar
VIEW  
unknown committed
1860 1861 1862

void st_lex::link_first_table_back(TABLE_LIST *first,
				   bool link_to_local)
1863
{
unknown's avatar
VIEW  
unknown committed
1864
  if (first)
1865
  {
unknown's avatar
VIEW  
unknown committed
1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890
    if ((first->next_global= query_tables))
      query_tables->prev_global= &first->next_global;
    query_tables= first;

    if (link_to_local)
    {
      first->next_local= (TABLE_LIST*) select_lex.table_list.first;
      select_lex.table_list.first= (byte*) first;
      select_lex.table_list.elements++;	//safety
    }
  }
}


/*
  fix some structures at the end of preparation

  SYNOPSIS
    st_select_lex::fix_prepare_information
    thd   thread handler
    conds pointer on conditions which will be used for execution statement
*/

void st_select_lex::fix_prepare_information(THD *thd, Item **conds)
{
unknown's avatar
unknown committed
1891
  if (!thd->current_arena->is_conventional() && first_execution)
unknown's avatar
VIEW  
unknown committed
1892 1893
  {
    first_execution= 0;
1894
    prep_where= where;
1895 1896 1897
  }
}

unknown's avatar
unknown committed
1898
/*
unknown's avatar
VIEW  
unknown committed
1899
  There are st_select_lex::add_table_to_list &
unknown's avatar
unknown committed
1900
  st_select_lex::set_lock_for_tables are in sql_parse.cc
unknown's avatar
unknown committed
1901

unknown's avatar
VIEW  
unknown committed
1902
  st_select_lex::print is in sql_select.cc
unknown's avatar
unknown committed
1903 1904

  st_select_lex_unit::prepare, st_select_lex_unit::exec,
1905 1906
  st_select_lex_unit::cleanup, st_select_lex_unit::reinit_exec_mechanism,
  st_select_lex_unit::change_result
unknown's avatar
unknown committed
1907
  are in sql_union.cc
unknown's avatar
unknown committed
1908
*/