sql_lex.cc 53.3 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

unknown's avatar
unknown committed
33 34 35 36 37 38 39 40 41 42 43 44
/* 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)

pthread_key(LEX*,THR_LEX);

45
/* Longest standard keyword name */
unknown's avatar
unknown committed
46 47
#define TOCK_NAME_LENGTH 24

48 49
/*
  The following data is based on the latin1 character set, and is only
unknown's avatar
unknown committed
50 51 52
  used when comparing keywords
*/

unknown's avatar
unknown committed
53 54
static uchar to_upper_lex[]=
{
unknown's avatar
unknown committed
55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72
    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
};

73

unknown's avatar
unknown committed
74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105
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;
}


106 107 108 109 110 111
/*
  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
112
void lex_start(THD *thd, uchar *buf,uint length)
unknown's avatar
unknown committed
113
{
unknown's avatar
unknown committed
114
  LEX *lex= thd->lex;
unknown's avatar
unknown committed
115 116 117 118 119 120
  DBUG_ENTER("lex_start");

  lex->thd= lex->unit.thd= thd;
  lex->buf= lex->ptr= buf;
  lex->end_of_query= buf+length;

unknown's avatar
unknown committed
121
  lex->context_stack.empty();
122 123
  lex->unit.init_query();
  lex->unit.init_select();
unknown's avatar
unknown committed
124 125
  /* 'parent_lex' is used in init_query() so it must be before it. */
  lex->select_lex.parent_lex= lex;
126 127
  lex->select_lex.init_query();
  lex->value_list.empty();
unknown's avatar
unknown committed
128
  lex->update_list.empty();
129
  lex->param_list.empty();
unknown's avatar
unknown committed
130
  lex->view_list.empty();
131
  lex->prepared_stmt_params.empty();
132 133 134 135 136 137 138 139 140 141
  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
142 143
  lex->select_lex.init_order();
  lex->select_lex.group_list.empty();
144
  lex->describe= 0;
unknown's avatar
unknown committed
145
  lex->subqueries= FALSE;
unknown's avatar
unknown committed
146
  lex->view_prepare_mode= FALSE;
147
  lex->stmt_prepare_mode= FALSE;
unknown's avatar
unknown committed
148
  lex->derived_tables= 0;
149
  lex->lock_option= TL_READ;
150
  lex->found_semicolon= 0;
151 152
  lex->safe_to_cache_query= 1;
  lex->time_zone_tables_used= 0;
153
  lex->leaf_tables_insert= lex->query_tables= 0;
unknown's avatar
unknown committed
154 155 156
  lex->query_tables_last= &lex->query_tables;
  lex->variables_used= 0;
  lex->empty_field_list_on_rset= 0;
157
  lex->select_lex.select_number= 1;
158
  lex->next_state=MY_LEX_START;
unknown's avatar
unknown committed
159
  lex->yylineno = 1;
unknown's avatar
unknown committed
160
  lex->in_comment=0;
unknown's avatar
unknown committed
161
  lex->length=0;
unknown's avatar
unknown committed
162 163
  lex->select_lex.in_sum_expr=0;
  lex->select_lex.expr_list.empty();
unknown's avatar
unknown committed
164
  lex->select_lex.ftfunc_list_alloc.empty();
165
  lex->select_lex.ftfunc_list= &lex->select_lex.ftfunc_list_alloc;
unknown's avatar
unknown committed
166 167
  lex->select_lex.group_list.empty();
  lex->select_lex.order_list.empty();
unknown's avatar
unknown committed
168
  lex->current_select= &lex->select_lex;
unknown's avatar
unknown committed
169
  lex->yacc_yyss=lex->yacc_yyvs=0;
170
  lex->ignore_space=test(thd->variables.sql_mode & MODE_IGNORE_SPACE);
171
  lex->sql_command= lex->orig_sql_command= SQLCOM_END;
172
  lex->duplicates= DUP_ERROR;
173
  lex->ignore= 0;
174 175
  lex->sphead= NULL;
  lex->spcont= NULL;
unknown's avatar
unknown committed
176
  lex->proc_list.first= 0;
177
  lex->query_tables_own_last= 0;
178
  lex->escape_used= FALSE;
179

180 181 182
  if (lex->sroutines.records)
    my_hash_reset(&lex->sroutines);
  lex->sroutines_list.empty();
183 184
  lex->sroutines_list_own_last= lex->sroutines_list.next;
  lex->sroutines_list_own_elements= 0;
unknown's avatar
unknown committed
185
  DBUG_VOID_RETURN;
unknown's avatar
unknown committed
186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204
}

void lex_end(LEX *lex)
{
  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;
205 206
    
    if ((symbol->tok == NOT_SYM) &&
207
        (lex->thd->variables.sql_mode & MODE_HIGH_NOT_PRECEDENCE))
208 209 210 211 212
      return NOT2_SYM;
    if ((symbol->tok == OR_OR_SYM) &&
	!(lex->thd->variables.sql_mode & MODE_PIPES_AS_CONCAT))
      return OR2_SYM;
    
unknown's avatar
unknown committed
213 214 215 216 217
    return symbol->tok;
  }
  return 0;
}

218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234
/*
  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
235 236 237

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

238
static LEX_STRING get_token(LEX *lex,uint length)
unknown's avatar
unknown committed
239 240 241 242
{
  LEX_STRING tmp;
  yyUnget();			// ptr points now after last token char
  tmp.length=lex->yytoklen=length;
243
  tmp.str=(char*) lex->thd->strmake((char*) lex->tok_start,tmp.length);
unknown's avatar
unknown committed
244 245 246
  return tmp;
}

247 248 249 250 251 252 253
/* 
 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)
*/

254 255 256 257 258 259 260
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
261 262 263
  for (from= (byte*) lex->tok_start, to= (byte*) tmp.str, end= to+length ;
       to != end ;
       )
264 265 266 267 268 269 270 271 272 273 274 275 276
  {
    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
277 278 279 280 281

static char *get_text(LEX *lex)
{
  reg1 uchar c,sep;
  uint found_escape=0;
282
  CHARSET_INFO *cs= lex->thd->charset();
unknown's avatar
unknown committed
283 284 285 286 287 288 289 290

  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
291 292
    if (use_mb(cs) &&
        (l = my_ismbchar(cs,
unknown's avatar
unknown committed
293 294 295 296 297 298
                         (const char *)lex->ptr-1,
                         (const char *)lex->end_of_query))) {
	lex->ptr += l-1;
	continue;
    }
#endif
299 300
    if (c == '\\' &&
	!(lex->thd->variables.sql_mode & MODE_NO_BACKSLASH_ESCAPES))
unknown's avatar
unknown committed
301 302 303 304
    {					// Escaped character
      found_escape=1;
      if (lex->ptr == lex->end_of_query)
	return 0;
305
      yySkip();
unknown's avatar
unknown committed
306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321
    }
    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;
322
      if (!(start=(uchar*) lex->thd->alloc((uint) (end-str)+1)))
unknown's avatar
unknown committed
323
	return (char*) "";		// Sql_alloc has set error flag
unknown's avatar
unknown committed
324 325 326 327 328 329 330 331 332
      if (!found_escape)
      {
	lex->yytoklen=(uint) (end-str);
	memcpy(start,str,lex->yytoklen);
	start[lex->yytoklen]=0;
      }
      else
      {
	uchar *to;
333

unknown's avatar
unknown committed
334 335 336 337
	for (to=start ; str != end ; str++)
	{
#ifdef USE_MB
	  int l;
unknown's avatar
unknown committed
338 339
	  if (use_mb(cs) &&
              (l = my_ismbchar(cs,
unknown's avatar
unknown committed
340 341 342 343 344 345 346
                               (const char *)str, (const char *)end))) {
	      while (l--)
		  *to++ = *str++;
	      str--;
	      continue;
	  }
#endif
347
	  if (!(lex->thd->variables.sql_mode & MODE_NO_BACKSLASH_ESCAPES) &&
348
              *str == '\\' && str+1 != end)
unknown's avatar
unknown committed
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
	  {
	    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:
374
              *to++= *str;
unknown's avatar
unknown committed
375 376 377
	      break;
	    }
	  }
378 379
	  else if (*str == sep)
	    *to++= *str++;		// Two ' or "
unknown's avatar
unknown committed
380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407
	  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
408 409
static const char *unsigned_longlong_str="18446744073709551615";
static const uint unsigned_longlong_len=20;
unknown's avatar
unknown committed
410

unknown's avatar
unknown committed
411
static inline uint int_token(const char *str,uint length)
unknown's avatar
unknown committed
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
{
  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)
unknown's avatar
unknown committed
446
      return DECIMAL_NUM;
unknown's avatar
unknown committed
447 448 449 450
    else
    {
      cmp=signed_longlong_str+1;
      smaller=LONG_NUM;				// If <= signed_longlong_str
unknown's avatar
unknown committed
451
      bigger=DECIMAL_NUM;
unknown's avatar
unknown committed
452 453 454 455 456 457 458 459 460 461 462 463 464
    }
  }
  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
465 466
    {
      if (length > unsigned_longlong_len)
unknown's avatar
unknown committed
467
        return DECIMAL_NUM;
unknown's avatar
unknown committed
468 469
      cmp=unsigned_longlong_str;
      smaller=ULONGLONG_NUM;
unknown's avatar
unknown committed
470
      bigger=DECIMAL_NUM;
unknown's avatar
unknown committed
471
    }
unknown's avatar
unknown committed
472 473 474 475
    else
    {
      cmp=longlong_str;
      smaller=LONG_NUM;
476
      bigger= ULONGLONG_NUM;
unknown's avatar
unknown committed
477 478 479 480 481 482
    }
  }
  while (*cmp && *cmp++ == *str++) ;
  return ((uchar) str[-1] <= (uchar) cmp[-1]) ? smaller : bigger;
}

483 484 485 486 487 488 489
/*
  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
490

491
int yylex(void *arg, void *yythd)
unknown's avatar
unknown committed
492 493
{
  reg1	uchar c;
494
  int	tokval, result_state;
unknown's avatar
unknown committed
495
  uint length;
unknown's avatar
unknown committed
496
  enum my_lex_states state;
497
  LEX	*lex= ((THD *)yythd)->lex;
unknown's avatar
unknown committed
498
  YYSTYPE *yylval=(YYSTYPE*) arg;
499
  CHARSET_INFO *cs= ((THD *) yythd)->charset();
500 501
  uchar *state_map= cs->state_map;
  uchar *ident_map= cs->ident_map;
unknown's avatar
unknown committed
502 503

  lex->yylval=yylval;			// The global state
504 505 506 507

  lex->tok_end_prev= lex->tok_end;
  lex->tok_start_prev= lex->tok_start;

unknown's avatar
unknown committed
508
  lex->tok_start=lex->tok_end=lex->ptr;
unknown's avatar
unknown committed
509
  state=lex->next_state;
510
  lex->next_state=MY_LEX_OPERATOR_OR_IDENT;
unknown's avatar
unknown committed
511 512 513
  LINT_INIT(c);
  for (;;)
  {
514
    switch (state) {
515 516
    case MY_LEX_OPERATOR_OR_IDENT:	// Next is operator or keyword
    case MY_LEX_START:			// Start of token
517
      // Skip startspace
518
      for (c=yyGet() ; (state_map[c] == MY_LEX_SKIP) ; c= yyGet())
unknown's avatar
unknown committed
519 520 521 522 523
      {
	if (c == '\n')
	  lex->yylineno++;
      }
      lex->tok_start=lex->ptr-1;	// Start of real token
524
      state= (enum my_lex_states) state_map[c];
unknown's avatar
unknown committed
525
      break;
526
    case MY_LEX_ESCAPE:
unknown's avatar
unknown committed
527 528 529 530 531 532
      if (yyGet() == 'N')
      {					// Allow \N as shortcut for NULL
	yylval->lex_str.str=(char*) "\\N";
	yylval->lex_str.length=2;
	return NULL_SYM;
      }
533 534
    case MY_LEX_CHAR:			// Unknown or single char token
    case MY_LEX_SKIP:			// This should not happen
535 536 537 538 539 540 541
      if (c == '-' && yyPeek() == '-' &&
          (my_isspace(cs,yyPeek2()) || 
           my_iscntrl(cs,yyPeek2())))
      {
        state=MY_LEX_COMMENT;
        break;
      }
unknown's avatar
unknown committed
542
      yylval->lex_str.str=(char*) (lex->ptr=lex->tok_start);// Set to first chr
unknown's avatar
unknown committed
543 544 545
      yylval->lex_str.length=1;
      c=yyGet();
      if (c != ')')
546
	lex->next_state= MY_LEX_START;	// Allow signed numbers
unknown's avatar
unknown committed
547 548
      if (c == ',')
	lex->tok_start=lex->ptr;	// Let tok_start point at next item
549 550 551 552 553 554
      /*
        Check for a placeholder: it should not precede a possible identifier
        because of binlogging: when a placeholder is replaced with
        its value in a query for the binlog, the query must stay
        grammatically correct.
      */
555
      else if (c == '?' && lex->stmt_prepare_mode && !ident_map[yyPeek()])
556
        return(PARAM_MARKER);
unknown's avatar
unknown committed
557 558
      return((int) c);

unknown's avatar
unknown committed
559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578
    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);

579
    case MY_LEX_IDENT_OR_HEX:
unknown's avatar
unknown committed
580
      if (yyPeek() == '\'')
581
      {					// Found x'hex-number'
582
	state= MY_LEX_HEX_NUMBER;
583 584
	break;
      }
unknown's avatar
unknown committed
585 586 587 588 589 590
    case MY_LEX_IDENT_OR_BIN:
      if (yyPeek() == '\'')
      {                                 // Found b'bin-number'
        state= MY_LEX_BIN_NUMBER;
        break;
      }
591
    case MY_LEX_IDENT:
unknown's avatar
unknown committed
592
      uchar *start;
unknown's avatar
unknown committed
593
#if defined(USE_MB) && defined(USE_MB_IDENT)
594
      if (use_mb(cs))
unknown's avatar
unknown committed
595
      {
596
	result_state= IDENT_QUOTED;
597
        if (my_mbcharlen(cs, yyGetLast()) > 1)
unknown's avatar
unknown committed
598
        {
599
          int l = my_ismbchar(cs,
unknown's avatar
unknown committed
600 601 602
                              (const char *)lex->ptr-1,
                              (const char *)lex->end_of_query);
          if (l == 0) {
603
            state = MY_LEX_CHAR;
unknown's avatar
unknown committed
604 605 606 607
            continue;
          }
          lex->ptr += l - 1;
        }
unknown's avatar
unknown committed
608
        while (ident_map[c=yyGet()])
unknown's avatar
unknown committed
609
        {
610
          if (my_mbcharlen(cs, c) > 1)
unknown's avatar
unknown committed
611 612
          {
            int l;
613
            if ((l = my_ismbchar(cs,
unknown's avatar
unknown committed
614 615 616 617 618 619 620 621 622
                              (const char *)lex->ptr-1,
                              (const char *)lex->end_of_query)) == 0)
              break;
            lex->ptr += l-1;
          }
        }
      }
      else
#endif
623
      {
unknown's avatar
unknown committed
624 625 626
        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;
627
      }
unknown's avatar
unknown committed
628
      length= (uint) (lex->ptr - lex->tok_start)-1;
unknown's avatar
unknown committed
629
      start= lex->ptr;
unknown's avatar
unknown committed
630 631
      if (lex->ignore_space)
      {
unknown's avatar
unknown committed
632 633 634 635 636
        /*
          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
637
      }
unknown's avatar
unknown committed
638
      if (start == lex->ptr && c == '.' && ident_map[yyPeek()])
639
	lex->next_state=MY_LEX_IDENT_SEP;
unknown's avatar
unknown committed
640 641 642 643 644
      else
      {					// '(' must follow directly if function
	yyUnget();
	if ((tokval = find_keyword(lex,length,c == '(')))
	{
645
	  lex->next_state= MY_LEX_START;	// Allow signed numbers
unknown's avatar
unknown committed
646 647 648 649 650
	  return(tokval);		// Was keyword
	}
	yySkip();			// next state does a unget
      }
      yylval->lex_str=get_token(lex,length);
651 652 653 654

      /* 
         Note: "SELECT _bla AS 'alias'"
         _bla should be considered as a IDENT if charset haven't been found.
655
         So we don't use MYF(MY_WME) with get_charset_by_csname to avoid 
656 657 658 659
         producing an error.
      */

      if ((yylval->lex_str.str[0]=='_') && 
unknown's avatar
unknown committed
660 661
          (lex->charset=get_charset_by_csname(yylval->lex_str.str+1,
					      MY_CS_PRIMARY,MYF(0))))
662
        return(UNDERSCORE_CHARSET);
663
      return(result_state);			// IDENT or IDENT_QUOTED
unknown's avatar
unknown committed
664

665
    case MY_LEX_IDENT_SEP:		// Found ident and now '.'
unknown's avatar
unknown committed
666 667 668
      yylval->lex_str.str=(char*) lex->ptr;
      yylval->lex_str.length=1;
      c=yyGet();			// should be '.'
669 670 671
      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
672 673
      return((int) c);

674 675
    case MY_LEX_NUMBER_IDENT:		// number or ident which num-start
      while (my_isdigit(cs,(c = yyGet()))) ;
unknown's avatar
unknown committed
676
      if (!ident_map[c])
unknown's avatar
unknown committed
677
      {					// Can't be identifier
678
	state=MY_LEX_INT_OR_REAL;
unknown's avatar
unknown committed
679 680 681 682
	break;
      }
      if (c == 'e' || c == 'E')
      {
unknown's avatar
unknown committed
683
	// The following test is written this way to allow numbers of type 1e1
684
	if (my_isdigit(cs,yyPeek()) || 
685
            (c=(yyGet())) == '+' || c == '-')
unknown's avatar
unknown committed
686
	{				// Allow 1E+10
687
	  if (my_isdigit(cs,yyPeek()))	// Number must have digit after sign
unknown's avatar
unknown committed
688 689
	  {
	    yySkip();
690
	    while (my_isdigit(cs,yyGet())) ;
unknown's avatar
unknown committed
691 692 693 694 695 696 697 698 699
	    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
700
	while (my_isxdigit(cs,(c = yyGet()))) ;
unknown's avatar
unknown committed
701
	if ((lex->ptr - lex->tok_start) >= 4 && !ident_map[c])
unknown's avatar
unknown committed
702 703
	{
	  yylval->lex_str=get_token(lex,yyLength());
704
	  yylval->lex_str.str+=2;		// Skip 0x
unknown's avatar
unknown committed
705 706 707 708 709 710
	  yylval->lex_str.length-=2;
	  lex->yytoklen-=2;
	  return (HEX_NUM);
	}
	yyUnget();
      }
unknown's avatar
unknown committed
711 712 713 714 715 716 717 718 719 720 721 722 723 724
      else if (c == 'b' && (lex->ptr - lex->tok_start) == 2 &&
               lex->tok_start[0] == '0' )
      {						// b'bin-number'
	while (my_isxdigit(cs,(c = yyGet()))) ;
	if ((lex->ptr - lex->tok_start) >= 4 && !ident_map[c])
	{
	  yylval->lex_str= get_token(lex, yyLength());
	  yylval->lex_str.str+= 2;		// Skip 0x
	  yylval->lex_str.length-= 2;
	  lex->yytoklen-= 2;
	  return (BIN_NUM);
	}
	yyUnget();
      }
unknown's avatar
unknown committed
725
      // fall through
726
    case MY_LEX_IDENT_START:			// We come here after '.'
727
      result_state= IDENT;
unknown's avatar
unknown committed
728
#if defined(USE_MB) && defined(USE_MB_IDENT)
729
      if (use_mb(cs))
unknown's avatar
unknown committed
730
      {
731
	result_state= IDENT_QUOTED;
unknown's avatar
unknown committed
732
        while (ident_map[c=yyGet()])
unknown's avatar
unknown committed
733
        {
734
          if (my_mbcharlen(cs, c) > 1)
unknown's avatar
unknown committed
735 736
          {
            int l;
737
            if ((l = my_ismbchar(cs,
unknown's avatar
unknown committed
738 739 740 741 742 743 744 745 746
                                 (const char *)lex->ptr-1,
                                 (const char *)lex->end_of_query)) == 0)
              break;
            lex->ptr += l-1;
          }
        }
      }
      else
#endif
unknown's avatar
unknown committed
747 748 749 750 751
      {
        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
752
      if (c == '.' && ident_map[yyPeek()])
753
	lex->next_state=MY_LEX_IDENT_SEP;// Next is '.'
unknown's avatar
unknown committed
754

755 756
      yylval->lex_str= get_token(lex,yyLength());
      return(result_state);
unknown's avatar
unknown committed
757

758
    case MY_LEX_USER_VARIABLE_DELIMITER:	// Found quote char
759
    {
760 761
      uint double_quotes= 0;
      char quote_char= c;                       // Used char
unknown's avatar
unknown committed
762
      lex->tok_start=lex->ptr;			// Skip first `
763
      while ((c=yyGet()))
unknown's avatar
unknown committed
764
      {
765 766
	int length;
	if ((length= my_mbcharlen(cs, c)) == 1)
767
	{
768 769
	  if (c == (uchar) NAMES_SEP_CHAR)
	    break; /* Old .frm format can't handle this char */
770 771 772 773 774 775 776 777
	  if (c == quote_char)
	  {
	    if (yyPeek() != quote_char)
	      break;
	    c=yyGet();
	    double_quotes++;
	    continue;
	  }
778 779
	}
#ifdef USE_MB
780 781 782
	else if (length < 1)
	  break;				// Error
	lex->ptr+= length-1;
783
#endif
unknown's avatar
unknown committed
784
      }
785 786 787 788 789 790
      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)
791
	yySkip();			// Skip end `
792
      lex->next_state= MY_LEX_START;
793
      return(IDENT_QUOTED);
794
    }
795
    case MY_LEX_INT_OR_REAL:		// Compleat int or incompleat real
unknown's avatar
unknown committed
796 797 798 799 800 801
      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
802 803
    case MY_LEX_REAL:			// Incomplete real number
      while (my_isdigit(cs,c = yyGet())) ;
unknown's avatar
unknown committed
804 805 806 807

      if (c == 'e' || c == 'E')
      {
	c = yyGet();
unknown's avatar
unknown committed
808
	if (c == '-' || c == '+')
809
	  c = yyGet();			// Skip sign
810
	if (!my_isdigit(cs,c))
unknown's avatar
unknown committed
811
	{				// No digit after sign
812
	  state= MY_LEX_CHAR;
unknown's avatar
unknown committed
813 814
	  break;
	}
815
	while (my_isdigit(cs,yyGet())) ;
unknown's avatar
unknown committed
816 817 818 819
	yylval->lex_str=get_token(lex,yyLength());
	return(FLOAT_NUM);
      }
      yylval->lex_str=get_token(lex,yyLength());
unknown's avatar
unknown committed
820
      return(DECIMAL_NUM);
unknown's avatar
unknown committed
821

822
    case MY_LEX_HEX_NUMBER:		// Found x'hexstring'
823
      yyGet();				// Skip '
824
      while (my_isxdigit(cs,(c = yyGet()))) ;
825 826 827 828 829 830 831 832 833 834 835 836
      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);

unknown's avatar
unknown committed
837 838 839 840 841 842 843 844 845 846 847 848 849
    case MY_LEX_BIN_NUMBER:           // Found b'bin-string'
      yyGet();                                // Skip '
      while ((c= yyGet()) == '0' || c == '1');
      length= (lex->ptr - lex->tok_start);    // Length of bin-num + 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 b'
      yylval->lex_str.length-= 3;     // Don't count b' and last '
      lex->yytoklen-= 3;
      return (BIN_NUM); 

850 851 852
    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
853 854 855
	yySkip();
      if ((tokval = find_keyword(lex,(uint) (lex->ptr - lex->tok_start),0)))
      {
856
	lex->next_state= MY_LEX_START;	// Allow signed numbers
unknown's avatar
unknown committed
857 858
	return(tokval);
      }
859
      state = MY_LEX_CHAR;		// Something fishy found
unknown's avatar
unknown committed
860 861
      break;

862 863 864
    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
865 866
      {
	yySkip();
867
	if (state_map[yyPeek()] == MY_LEX_CMP_OP)
unknown's avatar
unknown committed
868 869 870 871
	  yySkip();
      }
      if ((tokval = find_keyword(lex,(uint) (lex->ptr - lex->tok_start),0)))
      {
872
	lex->next_state= MY_LEX_START;	// Found long op
unknown's avatar
unknown committed
873 874
	return(tokval);
      }
875
      state = MY_LEX_CHAR;		// Something fishy found
unknown's avatar
unknown committed
876 877
      break;

878
    case MY_LEX_BOOL:
unknown's avatar
unknown committed
879 880
      if (c != yyPeek())
      {
881
	state=MY_LEX_CHAR;
unknown's avatar
unknown committed
882 883 884 885
	break;
      }
      yySkip();
      tokval = find_keyword(lex,2,0);	// Is a bool operator
886
      lex->next_state= MY_LEX_START;	// Allow signed numbers
unknown's avatar
unknown committed
887 888
      return(tokval);

889
    case MY_LEX_STRING_OR_DELIMITER:
890 891
      if (((THD *) yythd)->variables.sql_mode & MODE_ANSI_QUOTES)
      {
892
	state= MY_LEX_USER_VARIABLE_DELIMITER;
893 894 895
	break;
      }
      /* " used for strings */
896
    case MY_LEX_STRING:			// Incomplete text string
unknown's avatar
unknown committed
897 898
      if (!(yylval->lex_str.str = get_text(lex)))
      {
899
	state= MY_LEX_CHAR;		// Read char by char
unknown's avatar
unknown committed
900 901 902 903 904
	break;
      }
      yylval->lex_str.length=lex->yytoklen;
      return(TEXT_STRING);

905
    case MY_LEX_COMMENT:			//  Comment
unknown's avatar
unknown committed
906
      lex->select_lex.options|= OPTION_FOUND_COMMENT;
unknown's avatar
unknown committed
907 908
      while ((c = yyGet()) != '\n' && c) ;
      yyUnget();			// Safety against eof
909
      state = MY_LEX_START;		// Try again
unknown's avatar
unknown committed
910
      break;
911
    case MY_LEX_LONG_COMMENT:		/* Long C comment? */
unknown's avatar
unknown committed
912 913
      if (yyPeek() != '*')
      {
914
	state=MY_LEX_CHAR;		// Probable division
unknown's avatar
unknown committed
915 916 917
	break;
      }
      yySkip();				// Skip '*'
unknown's avatar
unknown committed
918
      lex->select_lex.options|= OPTION_FOUND_COMMENT;
unknown's avatar
unknown committed
919 920 921 922
      if (yyPeek() == '!')		// MySQL command in comment
      {
	ulong version=MYSQL_VERSION_ID;
	yySkip();
923 924
	state=MY_LEX_START;
	if (my_isdigit(cs,yyPeek()))
unknown's avatar
unknown committed
925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941
	{				// 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 '/'
942
      state = MY_LEX_START;		// Try again
unknown's avatar
unknown committed
943
      break;
944
    case MY_LEX_END_LONG_COMMENT:
unknown's avatar
unknown committed
945 946 947 948
      if (lex->in_comment && yyPeek() == '/')
      {
	yySkip();
	lex->in_comment=0;
949
	state=MY_LEX_START;
unknown's avatar
unknown committed
950 951
      }
      else
952
	state=MY_LEX_CHAR;		// Return '*'
unknown's avatar
unknown committed
953
      break;
954
    case MY_LEX_SET_VAR:		// Check if ':='
unknown's avatar
unknown committed
955 956
      if (yyPeek() != '=')
      {
957
	state=MY_LEX_CHAR;		// Return ':'
unknown's avatar
unknown committed
958 959 960 961
	break;
      }
      yySkip();
      return (SET_VAR);
962
    case MY_LEX_SEMICOLON:			// optional line terminator
unknown's avatar
unknown committed
963 964
      if (yyPeek())
      {
965 966
        THD* thd= (THD*)yythd;
        if ((thd->client_capabilities & CLIENT_MULTI_STATEMENTS) && 
967
            !lex->stmt_prepare_mode)
968
        {
unknown's avatar
unknown committed
969
	  lex->safe_to_cache_query= 0;
unknown's avatar
unknown committed
970
          lex->found_semicolon=(char*) lex->ptr;
unknown's avatar
unknown committed
971 972 973
          thd->server_status|= SERVER_MORE_RESULTS_EXISTS;
          lex->next_state=     MY_LEX_END;
          return (END_OF_INPUT);
974
        }
unknown's avatar
unknown committed
975
        state= MY_LEX_CHAR;		// Return ';'
unknown's avatar
unknown committed
976 977 978
	break;
      }
      /* fall true */
979
    case MY_LEX_EOL:
unknown's avatar
unknown committed
980 981 982 983 984 985 986
      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;
987 988
    case MY_LEX_END:
      lex->next_state=MY_LEX_END;
unknown's avatar
unknown committed
989
      return(0);			// We found end of input last time
990 991
      
      /* Actually real shouldn't start with . but allow them anyhow */
992 993 994
    case MY_LEX_REAL_OR_POINT:
      if (my_isdigit(cs,yyPeek()))
	state = MY_LEX_REAL;		// Real
unknown's avatar
unknown committed
995 996
      else
      {
997 998
	state= MY_LEX_IDENT_SEP;	// return '.'
	yyUnget();			// Put back '.'
unknown's avatar
unknown committed
999 1000
      }
      break;
1001
    case MY_LEX_USER_END:		// end '@' of user@hostname
unknown's avatar
unknown committed
1002
      switch (state_map[yyPeek()]) {
1003 1004 1005
      case MY_LEX_STRING:
      case MY_LEX_USER_VARIABLE_DELIMITER:
      case MY_LEX_STRING_OR_DELIMITER:
unknown's avatar
unknown committed
1006
	break;
1007 1008
      case MY_LEX_USER_END:
	lex->next_state=MY_LEX_SYSTEM_VAR;
unknown's avatar
unknown committed
1009 1010
	break;
      default:
1011
	lex->next_state=MY_LEX_HOSTNAME;
unknown's avatar
unknown committed
1012 1013
	break;
      }
unknown's avatar
unknown committed
1014 1015 1016
      yylval->lex_str.str=(char*) lex->ptr;
      yylval->lex_str.length=1;
      return((int) '@');
1017 1018 1019
    case MY_LEX_HOSTNAME:		// end '@' of user@hostname
      for (c=yyGet() ; 
	   my_isalnum(cs,c) || c == '.' || c == '_' ||  c == '$';
unknown's avatar
unknown committed
1020 1021 1022
	   c= yyGet()) ;
      yylval->lex_str=get_token(lex,yyLength());
      return(LEX_HOSTNAME);
1023
    case MY_LEX_SYSTEM_VAR:
unknown's avatar
unknown committed
1024 1025 1026
      yylval->lex_str.str=(char*) lex->ptr;
      yylval->lex_str.length=1;
      yySkip();					// Skip '@'
1027 1028 1029 1030
      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
1031
      return((int) '@');
1032
    case MY_LEX_IDENT_OR_KEYWORD:
unknown's avatar
unknown committed
1033 1034 1035 1036 1037
      /*
	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
1038 1039 1040 1041 1042
      
      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
1043
      if (c == '.')
1044
	lex->next_state=MY_LEX_IDENT_SEP;
unknown's avatar
unknown committed
1045 1046 1047 1048 1049 1050 1051
      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);
1052
      return(result_state);
unknown's avatar
unknown committed
1053 1054 1055
    }
  }
}
unknown's avatar
unknown committed
1056 1057 1058 1059 1060 1061 1062

/*
  st_select_lex structures initialisations
*/

void st_select_lex_node::init_query()
{
1063 1064
  options= 0;
  linkage= UNSPECIFIED_TYPE;
1065 1066
  no_error= no_table_names_allowed= 0;
  uncacheable= 0;
unknown's avatar
unknown committed
1067 1068 1069 1070 1071 1072 1073 1074 1075
}

void st_select_lex_node::init_select()
{
}

void st_select_lex_unit::init_query()
{
  st_select_lex_node::init_query();
1076
  linkage= GLOBAL_OPTIONS_TYPE;
unknown's avatar
unknown committed
1077
  global_parameters= first_select();
1078 1079
  select_limit_cnt= HA_POS_ERROR;
  offset_limit_cnt= 0;
1080
  union_distinct= 0;
unknown's avatar
unknown committed
1081
  prepared= optimized= executed= 0;
unknown's avatar
unknown committed
1082
  item= 0;
1083 1084
  union_result= 0;
  table= 0;
unknown's avatar
unknown committed
1085
  fake_select_lex= 0;
1086
  cleaned= 0;
1087
  item_list.empty();
1088
  describe= 0;
1089
  found_rows_for_union= 0;
unknown's avatar
unknown committed
1090 1091 1092 1093 1094
}

void st_select_lex::init_query()
{
  st_select_lex_node::init_query();
1095
  table_list.empty();
1096 1097
  top_join_list.empty();
  join_list= &top_join_list;
1098
  embedding= leaf_tables= 0;
unknown's avatar
unknown committed
1099
  item_list.empty();
unknown's avatar
unknown committed
1100
  join= 0;
1101
  having= where= prep_where= 0;
1102
  olap= UNSPECIFIED_OLAP_TYPE;
1103
  having_fix_field= 0;
1104 1105
  context.select_lex= this;
  context.init();
unknown's avatar
unknown committed
1106 1107 1108
  /*
    Add the name resolution context of the current (sub)query to the
    stack of contexts for the whole query.
1109 1110 1111 1112 1113
    TODO:
    push_context may return an error if there is no memory for a new
    element in the stack, however this method has no return value,
    thus push_context should be moved to a place where query
    initialization is checked for failure.
unknown's avatar
unknown committed
1114 1115
  */
  parent_lex->push_context(&context);
unknown's avatar
unknown committed
1116
  cond_count= with_wild= 0;
1117
  conds_processed_with_permanent_arena= 0;
unknown's avatar
unknown committed
1118
  ref_pointer_array= 0;
unknown's avatar
unknown committed
1119
  select_n_having_items= 0;
1120
  subquery_in_having= explicit_limit= 0;
1121
  is_item_list_lookup= 0;
1122
  first_execution= 1;
unknown's avatar
unknown committed
1123
  first_cond_optimization= 1;
1124
  parsing_place= NO_MATTER;
1125
  exclude_from_table_unique_test= no_wrap_view_item= FALSE;
1126
  link_next= 0;
unknown's avatar
unknown committed
1127 1128 1129 1130 1131
}

void st_select_lex::init_select()
{
  st_select_lex_node::init_select();
1132
  group_list.empty();
unknown's avatar
unknown committed
1133
  type= db= 0;
1134 1135 1136 1137
  having= 0;
  use_index_ptr= ignore_index_ptr= 0;
  table_join_options= 0;
  in_sum_expr= with_wild= 0;
unknown's avatar
unknown committed
1138
  options= 0;
1139
  braces= 0;
unknown's avatar
unknown committed
1140
  when_list.empty();
unknown's avatar
unknown committed
1141
  expr_list.empty();
unknown's avatar
unknown committed
1142
  interval_list.empty();
unknown's avatar
unknown committed
1143
  use_index.empty();
unknown's avatar
unknown committed
1144 1145
  ftfunc_list_alloc.empty();
  ftfunc_list= &ftfunc_list_alloc;
unknown's avatar
unknown committed
1146
  linkage= UNSPECIFIED_TYPE;
unknown's avatar
unknown committed
1147 1148 1149
  order_list.elements= 0;
  order_list.first= 0;
  order_list.next= (byte**) &order_list.first;
1150 1151 1152
  /* Set limit and offset to default values */
  select_limit= 0;      /* denotes the default limit = HA_POS_ERROR */
  offset_limit= 0;      /* denotes the default offset = 0 */
unknown's avatar
unknown committed
1153
  with_sum_func= 0;
1154

unknown's avatar
unknown committed
1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168
}

/*
  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
1169
  slave= 0;
unknown's avatar
unknown committed
1170 1171
}

unknown's avatar
unknown committed
1172 1173
/*
  include on level down (but do not link)
unknown's avatar
unknown committed
1174

unknown's avatar
unknown committed
1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188
  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
1189 1190 1191 1192 1193 1194 1195 1196
/* 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
1197
  slave= 0;
unknown's avatar
unknown committed
1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211
}

/* 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
1212
  if (link_prev)
unknown's avatar
unknown committed
1213 1214 1215 1216
  {
    if ((*link_prev= link_next))
      link_next->link_prev= link_prev;
  }
1217 1218 1219 1220
  // Remove slave structure
  for (; slave; slave= slave->next)
    slave->fast_exclude();
  
unknown's avatar
unknown committed
1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240
}

/*
  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;
  */
}
1241

1242 1243 1244 1245 1246 1247 1248 1249 1250 1251

/*
  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
1252 1253 1254
void st_select_lex_unit::exclude_level()
{
  SELECT_LEX_UNIT *units= 0, **units_last= &units;
unknown's avatar
unknown committed
1255
  for (SELECT_LEX *sl= first_select(); sl; sl= sl->next_select())
unknown's avatar
unknown committed
1256
  {
unknown's avatar
unknown committed
1257
    // unlink current level from global SELECTs list
unknown's avatar
unknown committed
1258 1259
    if (sl->link_prev && (*sl->link_prev= sl->link_next))
      sl->link_next->link_prev= sl->link_prev;
unknown's avatar
unknown committed
1260 1261

    // bring up underlay levels
unknown's avatar
unknown committed
1262 1263
    SELECT_LEX_UNIT **last= 0;
    for (SELECT_LEX_UNIT *u= sl->first_inner_unit(); u; u= u->next_unit())
unknown's avatar
unknown committed
1264 1265
    {
      u->master= master;
unknown's avatar
unknown committed
1266
      last= (SELECT_LEX_UNIT**)&(u->next);
unknown's avatar
unknown committed
1267
    }
unknown's avatar
unknown committed
1268 1269 1270 1271 1272 1273 1274 1275
    if (last)
    {
      (*units_last)= sl->first_inner_unit();
      units_last= last;
    }
  }
  if (units)
  {
unknown's avatar
unknown committed
1276
    // include brought up levels in place of current
unknown's avatar
unknown committed
1277 1278
    (*prev)= units;
    (*units_last)= (SELECT_LEX_UNIT*)next;
unknown's avatar
unknown committed
1279 1280 1281
    if (next)
      next->prev= (SELECT_LEX_NODE**)units_last;
    units->prev= prev;
unknown's avatar
unknown committed
1282 1283
  }
  else
unknown's avatar
unknown committed
1284 1285
  {
    // exclude currect unit from list of nodes
unknown's avatar
unknown committed
1286
    (*prev)= next;
unknown's avatar
unknown committed
1287 1288 1289
    if (next)
      next->prev= prev;
  }
unknown's avatar
unknown committed
1290 1291
}

1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302

/*
  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
1303
    // unlink current level from global SELECTs list
1304 1305 1306
    if (sl->link_prev && (*sl->link_prev= sl->link_next))
      sl->link_next->link_prev= sl->link_prev;

unknown's avatar
unknown committed
1307
    // unlink underlay levels
1308 1309 1310 1311 1312
    for (SELECT_LEX_UNIT *u= sl->first_inner_unit(); u; u= u->next_unit())
    {
      u->exclude_level();
    }
  }
unknown's avatar
unknown committed
1313
  // exclude currect unit from list of nodes
1314
  (*prev)= next;
unknown's avatar
unknown committed
1315 1316
  if (next)
    next->prev= prev;
1317 1318 1319
}


unknown's avatar
unknown committed
1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331
/*
  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
1332
void st_select_lex::mark_as_dependent(SELECT_LEX *last)
unknown's avatar
unknown committed
1333 1334 1335 1336 1337
{
  /*
    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
1338
  for (SELECT_LEX *s= this;
1339
       s && s != last;
unknown's avatar
unknown committed
1340
       s= s->outer_select())
1341
    if (!(s->uncacheable & UNCACHEABLE_DEPENDENT))
unknown's avatar
unknown committed
1342 1343
    {
      // Select is dependent of outer select
1344
      s->uncacheable|= UNCACHEABLE_DEPENDENT;
1345
      SELECT_LEX_UNIT *munit= s->master_unit();
1346
      munit->uncacheable|= UNCACHEABLE_DEPENDENT;
unknown's avatar
unknown committed
1347 1348 1349
    }
}

1350 1351 1352 1353 1354 1355 1356
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
1357
TABLE_LIST *st_select_lex_node::add_table_to_list(THD *thd, Table_ident *table,
1358
						  LEX_STRING *alias,
unknown's avatar
unknown committed
1359
						  ulong table_join_options,
1360 1361
						  thr_lock_type flags,
						  List<String> *use_index,
unknown's avatar
unknown committed
1362 1363
						  List<String> *ignore_index,
                                                  LEX_STRING *option)
1364 1365 1366
{
  return 0;
}
unknown's avatar
unknown committed
1367 1368 1369 1370 1371 1372 1373 1374
ulong st_select_lex_node::get_table_join_options()
{
  return 0;
}

/*
  prohibit using LIMIT clause
*/
unknown's avatar
unknown committed
1375
bool st_select_lex::test_limit()
unknown's avatar
unknown committed
1376
{
1377
  if (select_limit != 0)
unknown's avatar
unknown committed
1378 1379
  {
    my_error(ER_NOT_SUPPORTED_YET, MYF(0),
unknown's avatar
unknown committed
1380
             "LIMIT & IN/ALL/ANY/SOME subquery");
unknown's avatar
unknown committed
1381 1382 1383 1384 1385 1386
    return(1);
  }
  // no sense in ORDER BY without LIMIT
  order_list.empty();
  return(0);
}
1387

1388

1389 1390 1391 1392 1393
st_select_lex_unit* st_select_lex_unit::master_unit()
{
    return this;
}

1394

1395 1396 1397 1398 1399
st_select_lex* st_select_lex_unit::outer_select()
{
  return (st_select_lex*) master;
}

1400

unknown's avatar
unknown committed
1401
bool st_select_lex::add_order_to_list(THD *thd, Item *item, bool asc)
unknown's avatar
unknown committed
1402
{
unknown's avatar
unknown committed
1403
  return add_to_list(thd, order_list, item, asc);
unknown's avatar
unknown committed
1404
}
1405

1406

unknown's avatar
unknown committed
1407
bool st_select_lex::add_item_to_list(THD *thd, Item *item)
1408
{
1409 1410 1411
  DBUG_ENTER("st_select_lex::add_item_to_list");
  DBUG_PRINT("info", ("Item: %p", item));
  DBUG_RETURN(item_list.push_back(item));
1412 1413
}

1414

unknown's avatar
unknown committed
1415
bool st_select_lex::add_group_to_list(THD *thd, Item *item, bool asc)
1416
{
unknown's avatar
unknown committed
1417
  return add_to_list(thd, group_list, item, asc);
1418 1419
}

1420

1421 1422 1423 1424 1425
bool st_select_lex::add_ftfunc_to_list(Item_func_match *func)
{
  return !func || ftfunc_list->push_back(func); // end of memory?
}

1426

1427 1428 1429 1430 1431
st_select_lex_unit* st_select_lex::master_unit()
{
  return (st_select_lex_unit*) master;
}

1432

1433 1434 1435 1436 1437
st_select_lex* st_select_lex::outer_select()
{
  return (st_select_lex*) master->get_master();
}

1438

1439 1440 1441 1442 1443 1444
bool st_select_lex::set_braces(bool value)
{
  braces= value;
  return 0; 
}

1445

1446 1447 1448 1449 1450 1451
bool st_select_lex::inc_in_sum_expr()
{
  in_sum_expr++;
  return 0;
}

1452

1453 1454 1455 1456 1457
uint st_select_lex::get_in_sum_expr()
{
  return in_sum_expr;
}

1458

1459 1460 1461 1462 1463 1464 1465 1466 1467 1468
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;
}

1469

1470 1471 1472 1473 1474
List<String>* st_select_lex::get_use_index()
{
  return use_index_ptr;
}

1475

1476 1477 1478 1479 1480
List<String>* st_select_lex::get_ignore_index()
{
  return ignore_index_ptr;
}

1481

unknown's avatar
unknown committed
1482 1483 1484 1485 1486
ulong st_select_lex::get_table_join_options()
{
  return table_join_options;
}

1487

unknown's avatar
unknown committed
1488 1489 1490 1491
bool st_select_lex::setup_ref_array(THD *thd, uint order_group_num)
{
  if (ref_pointer_array)
    return 0;
1492 1493 1494 1495 1496

  /*
    We have to create array in prepared statement memory if it is
    prepared statement
  */
unknown's avatar
unknown committed
1497
  Query_arena *arena= thd->stmt_arena;
unknown's avatar
unknown committed
1498
  return (ref_pointer_array=
1499 1500 1501 1502
          (Item **)arena->alloc(sizeof(Item*) *
                                (item_list.elements +
                                 select_n_having_items +
                                 order_group_num)* 5)) == 0;
unknown's avatar
unknown committed
1503 1504
}

1505

unknown's avatar
unknown committed
1506 1507
void st_select_lex_unit::print(String *str)
{
1508
  bool union_all= !union_distinct;
unknown's avatar
unknown committed
1509 1510 1511 1512
  for (SELECT_LEX *sl= first_select(); sl; sl= sl->next_select())
  {
    if (sl != first_select())
    {
1513
      str->append(STRING_WITH_LEN(" union "));
1514
      if (union_all)
1515
	str->append(STRING_WITH_LEN("all "));
1516
      else if (union_distinct == sl)
1517
        union_all= TRUE;
unknown's avatar
unknown committed
1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528
    }
    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)
    {
1529
      str->append(STRING_WITH_LEN(" order by "));
unknown's avatar
unknown committed
1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542
      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)
  {
1543 1544 1545
    if (order->counter_used)
    {
      char buffer[20];
unknown's avatar
unknown committed
1546 1547
      uint length= my_snprintf(buffer, 20, "%d", order->counter);
      str->append(buffer, length);
1548 1549 1550
    }
    else
      (*order->item)->print(str);
unknown's avatar
unknown committed
1551
    if (!order->asc)
1552
      str->append(STRING_WITH_LEN(" desc"));
unknown's avatar
unknown committed
1553 1554 1555 1556 1557
    if (order->next)
      str->append(',');
  }
}
 
1558

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

1573
  if (explicit_limit)
unknown's avatar
unknown committed
1574
  {
1575
    str->append(STRING_WITH_LEN(" limit "));
unknown's avatar
unknown committed
1576 1577
    if (offset_limit)
    {
1578
      offset_limit->print(str);
unknown's avatar
unknown committed
1579 1580
      str->append(',');
    }
1581
    select_limit->print(str);
unknown's avatar
unknown committed
1582 1583 1584
  }
}

unknown's avatar
VIEW  
unknown committed
1585

1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604
/*
  Initialize LEX object.

  SYNOPSIS
    st_lex::st_lex()

  NOTE
    LEX object initialized with this constructor can be used as part of
    THD object for which one can safely call open_tables(), lock_tables()
    and close_thread_tables() functions. But it is not yet ready for
    statement parsing. On should use lex_start() function to prepare LEX
    for this.
*/

st_lex::st_lex()
  :result(0), sql_command(SQLCOM_END), query_tables_own_last(0)
{
  hash_init(&sroutines, system_charset_info, 0, 0, 0, sp_sroutine_key, 0, 0);
  sroutines_list.empty();
1605 1606
  sroutines_list_own_last= sroutines_list.next;
  sroutines_list_own_elements= 0;
1607 1608 1609
}


unknown's avatar
VIEW  
unknown committed
1610
/*
1611
  Check whether the merging algorithm can be used on this VIEW
unknown's avatar
VIEW  
unknown committed
1612 1613 1614 1615

  SYNOPSIS
    st_lex::can_be_merged()

1616
  DESCRIPTION
1617 1618 1619
    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,
1620 1621 1622
    HAVING clause, aggregate functions, DISTINCT clause, LIMIT clause and
    several underlying tables.

unknown's avatar
VIEW  
unknown committed
1623 1624 1625 1626 1627 1628 1629 1630 1631 1632
  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 */
1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649
  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
1650 1651 1652
	  select_lex.order_list.elements == 0 &&
	  select_lex.group_list.elements == 0 &&
	  select_lex.having == 0 &&
1653
          select_lex.with_sum_func == 0 &&
1654
	  select_lex.table_list.elements >= 1 &&
unknown's avatar
VIEW  
unknown committed
1655
	  !(select_lex.options & SELECT_DISTINCT) &&
1656
          select_lex.select_limit == 0);
unknown's avatar
VIEW  
unknown committed
1657 1658
}

1659

unknown's avatar
VIEW  
unknown committed
1660
/*
1661
  check if command can use VIEW with MERGE algorithm (for top VIEWs)
unknown's avatar
VIEW  
unknown committed
1662 1663 1664 1665

  SYNOPSIS
    st_lex::can_use_merged()

1666 1667 1668 1669 1670
  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
1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689
  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:
1690
  case SQLCOM_LOAD:
unknown's avatar
VIEW  
unknown committed
1691 1692 1693 1694 1695 1696
    return TRUE;
  default:
    return FALSE;
  }
}

1697
/*
1698
  Check if command can't use merged views in any part of command
1699 1700 1701 1702

  SYNOPSIS
    st_lex::can_not_use_merged()

1703 1704 1705 1706
  DESCRIPTION
    Temporary table algorithm will be used on all SELECT levels for queries
    listed here (see also st_lex::can_use_merged()).

1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717
  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:
1718 1719 1720 1721 1722 1723
  /*
    SQLCOM_SHOW_FIELDS is necessary to make 
    information schema tables working correctly with views.
    see get_schema_tables_result function
  */
  case SQLCOM_SHOW_FIELDS:
1724 1725 1726 1727 1728 1729
    return TRUE;
  default:
    return FALSE;
  }
}

unknown's avatar
VIEW  
unknown committed
1730 1731 1732 1733 1734 1735 1736 1737 1738 1739
/*
  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
*/
unknown's avatar
unknown committed
1740

unknown's avatar
VIEW  
unknown committed
1741 1742
bool st_lex::only_view_structure()
{
1743
  switch (sql_command) {
unknown's avatar
VIEW  
unknown committed
1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757
  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
1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782
/*
  Should Items_ident be printed correctly

  SYNOPSIS
    need_correct_ident()

  RETURN
    TRUE yes, we need only structure
    FALSE no, we need data
*/


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

1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807
/*
  Get effective type of CHECK OPTION for given view

  SYNOPSIS
    get_effective_with_check()
    view    given view

  NOTE
    It have not sense to set CHECK OPTION for SELECT satement or subqueries,
    so we do not.

  RETURN
    VIEW_CHECK_NONE      no need CHECK OPTION
    VIEW_CHECK_LOCAL     CHECK OPTION LOCAL
    VIEW_CHECK_CASCADED  CHECK OPTION CASCADED
*/

uint8 st_lex::get_effective_with_check(st_table_list *view)
{
  if (view->select_lex->master_unit() == &unit &&
      which_check_option_applicable())
    return (uint8)view->with_check;
  return VIEW_CHECK_NONE;
}

unknown's avatar
unknown committed
1808

unknown's avatar
unknown committed
1809 1810 1811 1812 1813 1814 1815
/*
  initialize limit counters

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

1817
void st_select_lex_unit::set_limit(SELECT_LEX *sl)
1818
{
1819
  ha_rows select_limit_val;
1820

unknown's avatar
unknown committed
1821
  DBUG_ASSERT(! thd->stmt_arena->is_stmt_prepare());
1822 1823 1824 1825
  select_limit_val= (ha_rows)(sl->select_limit ? sl->select_limit->val_uint() :
                                                 HA_POS_ERROR);
  offset_limit_cnt= (ha_rows)(sl->offset_limit ? sl->offset_limit->val_uint() :
                                                 ULL(0));
1826 1827
  select_limit_cnt= select_limit_val + offset_limit_cnt;
  if (select_limit_cnt < select_limit_val)
1828 1829 1830
    select_limit_cnt= HA_POS_ERROR;		// no limit
}

unknown's avatar
unknown committed
1831

1832
/*
1833 1834
  Unlink the first table from the global table list and the first table from
  outer select (lex->select_lex) local list
1835 1836 1837

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

unknown's avatar
VIEW  
unknown committed
1840
  NOTES
1841 1842
    We assume that first tables in both lists is the same table or the local
    list is empty.
1843 1844

  RETURN
1845
    0	If 'query_tables' == 0
unknown's avatar
VIEW  
unknown committed
1846
    unlinked table
1847
      In this case link_to_local is set.
unknown's avatar
unknown committed
1848

1849
*/
unknown's avatar
VIEW  
unknown committed
1850
TABLE_LIST *st_lex::unlink_first_table(bool *link_to_local)
1851
{
unknown's avatar
VIEW  
unknown committed
1852 1853 1854 1855 1856 1857 1858 1859
  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;
1860 1861
    else
      query_tables_last= &query_tables;
unknown's avatar
VIEW  
unknown committed
1862 1863 1864 1865 1866 1867 1868
    first->next_global= 0;

    /*
      and from local list if it is not empty
    */
    if ((*link_to_local= test(select_lex.table_list.first)))
    {
1869 1870
      select_lex.context.table_list= 
        select_lex.context.first_name_resolution_table= first->next_local;
unknown's avatar
unknown committed
1871
      select_lex.table_list.first= (byte*) (first->next_local);
unknown's avatar
VIEW  
unknown committed
1872 1873 1874
      select_lex.table_list.elements--;	//safety
      first->next_local= 0;
      /*
1875 1876
        Ensure that the global list has the same first table as the local
        list.
unknown's avatar
VIEW  
unknown committed
1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892
      */
      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
1893 1894 1895 1896 1897 1898
    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
1899 1900 1901 1902 1903 1904 1905
*/

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)
  {
1906
    TABLE_LIST *next;
unknown's avatar
VIEW  
unknown committed
1907 1908
    if (query_tables_last == &first_table->next_global)
      query_tables_last= first_table->prev_global;
1909

1910
    if ((next= *first_table->prev_global= first_table->next_global))
unknown's avatar
VIEW  
unknown committed
1911 1912 1913 1914
      next->prev_global= first_table->prev_global;
    /* include in new place */
    first_table->next_global= query_tables;
    /*
1915 1916 1917
       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
1918 1919 1920 1921 1922
    */
    query_tables->prev_global= &first_table->next_global;
    first_table->prev_global= &query_tables;
    query_tables= first_table;
  }
1923 1924
}

unknown's avatar
unknown committed
1925

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
/*
  Add implicitly used time zone description tables to global table list
  (if needed).

  SYNOPSYS
    st_lex::add_time_zone_tables_to_query_tables()
      thd - pointer to current thread context

  RETURN VALUE
   TRUE  - error
   FALSE - success
*/

bool st_lex::add_time_zone_tables_to_query_tables(THD *thd)
{
  /* We should not add these tables twice */
  if (!time_zone_tables_used)
  {
    time_zone_tables_used= my_tz_get_table_list(thd, &query_tables_last);
    if (time_zone_tables_used == &fake_time_zone_tables_list)
      return TRUE;
  }
  return FALSE;
}

1951
/*
unknown's avatar
unknown committed
1952
  Link table back that was unlinked with unlink_first_table()
1953 1954 1955

  SYNOPSIS
    link_first_table_back()
unknown's avatar
VIEW  
unknown committed
1956
    link_to_local	do we need link this table to local
1957 1958 1959 1960

  RETURN
    global list
*/
unknown's avatar
VIEW  
unknown committed
1961 1962 1963

void st_lex::link_first_table_back(TABLE_LIST *first,
				   bool link_to_local)
1964
{
unknown's avatar
VIEW  
unknown committed
1965
  if (first)
1966
  {
unknown's avatar
VIEW  
unknown committed
1967 1968
    if ((first->next_global= query_tables))
      query_tables->prev_global= &first->next_global;
1969 1970
    else
      query_tables_last= &first->next_global;
unknown's avatar
VIEW  
unknown committed
1971 1972 1973 1974 1975
    query_tables= first;

    if (link_to_local)
    {
      first->next_local= (TABLE_LIST*) select_lex.table_list.first;
unknown's avatar
unknown committed
1976 1977
      select_lex.context.table_list= first;
      select_lex.table_list.first= (byte*) first;
unknown's avatar
VIEW  
unknown committed
1978 1979 1980 1981 1982 1983
      select_lex.table_list.elements++;	//safety
    }
  }
}


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

/*
  cleanup lex for case when we open table by table for processing

  SYNOPSIS
    st_lex::cleanup_after_one_table_open()
*/

void st_lex::cleanup_after_one_table_open()
{
  /*
    thd->lex->derived_tables & additional units may be set if we open
    a view. It is necessary to clear thd->lex->derived_tables flag
    to prevent processing of derived tables during next open_and_lock_tables
    if next table is a real table and cleanup & remove underlying units
    NOTE: all units will be connected to thd->lex->select_lex, because we
    have not UNION on most upper level.
    */
  if (all_selects_list != &select_lex)
  {
    derived_tables= 0;
    /* cleunup underlying units (units of VIEW) */
    for (SELECT_LEX_UNIT *un= select_lex.first_inner_unit();
         un;
         un= un->next_unit())
      un->cleanup();
    /* reduce all selects list to default state */
    all_selects_list= &select_lex;
    /* remove underlying units (units of VIEW) subtree */
    select_lex.cut_subtree();
  }
  time_zone_tables_used= 0;
2016 2017
  if (sroutines.records)
    my_hash_reset(&sroutines);
2018
  sroutines_list.empty();
2019 2020
  sroutines_list_own_last= sroutines_list.next;
  sroutines_list_own_elements= 0;
2021 2022 2023
}


2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052
/*
  Do end-of-prepare fixup for list of tables and their merge-VIEWed tables

  SYNOPSIS
    fix_prepare_info_in_table_list()
      thd  Thread handle
      tbl  List of tables to process

  DESCRIPTION
    Perform end-end-of prepare fixup for list of tables, if any of the tables
    is a merge-algorithm VIEW, recursively fix up its underlying tables as
    well.

*/

static void fix_prepare_info_in_table_list(THD *thd, TABLE_LIST *tbl)
{
  for (; tbl; tbl= tbl->next_local)
  {
    if (tbl->on_expr)
    {
      tbl->prep_on_expr= tbl->on_expr;
      tbl->on_expr= tbl->on_expr->copy_andor_structure(thd);
    }
    fix_prepare_info_in_table_list(thd, tbl->merge_underlying_list);
  }
}


unknown's avatar
VIEW  
unknown committed
2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063
/*
  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
2064
  if (!thd->stmt_arena->is_conventional() && first_execution)
unknown's avatar
VIEW  
unknown committed
2065 2066
  {
    first_execution= 0;
2067 2068 2069 2070 2071
    if (*conds)
    {
      prep_where= *conds;
      *conds= where= prep_where->copy_andor_structure(thd);
    }
2072
    fix_prepare_info_in_table_list(thd, (TABLE_LIST *)table_list.first);
2073 2074 2075
  }
}

unknown's avatar
unknown committed
2076
/*
unknown's avatar
VIEW  
unknown committed
2077
  There are st_select_lex::add_table_to_list &
unknown's avatar
unknown committed
2078
  st_select_lex::set_lock_for_tables are in sql_parse.cc
unknown's avatar
unknown committed
2079

unknown's avatar
VIEW  
unknown committed
2080
  st_select_lex::print is in sql_select.cc
unknown's avatar
unknown committed
2081 2082

  st_select_lex_unit::prepare, st_select_lex_unit::exec,
2083 2084
  st_select_lex_unit::cleanup, st_select_lex_unit::reinit_exec_mechanism,
  st_select_lex_unit::change_result
unknown's avatar
unknown committed
2085
  are in sql_union.cc
unknown's avatar
unknown committed
2086
*/
2087