sql_lex.cc 57.5 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
   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 */

20
#define MYSQL_LEX 1
unknown's avatar
unknown committed
21 22 23 24
#include "mysql_priv.h"
#include "item_create.h"
#include <m_ctype.h>
#include <hash.h>
25 26
#include "sp.h"
#include "sp_head.h"
unknown's avatar
unknown committed
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.
*/
32 33

sys_var *trg_new_row_fake_var= (sys_var*) 0x01;
34

unknown's avatar
unknown committed
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)

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
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;
}

unknown's avatar
unknown committed
81
#include <lex_hash.h>
unknown's avatar
unknown committed
82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103


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);

  DBUG_VOID_RETURN;
}


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


104 105 106 107 108 109
/*
  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
110
void lex_start(THD *thd, const uchar *buf, uint length)
unknown's avatar
unknown committed
111
{
unknown's avatar
unknown committed
112
  LEX *lex= thd->lex;
unknown's avatar
unknown committed
113 114 115 116 117 118
  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
119
  lex->context_stack.empty();
120 121
  lex->unit.init_query();
  lex->unit.init_select();
unknown's avatar
unknown committed
122 123
  /* 'parent_lex' is used in init_query() so it must be before it. */
  lex->select_lex.parent_lex= lex;
124 125
  lex->select_lex.init_query();
  lex->value_list.empty();
unknown's avatar
unknown committed
126
  lex->update_list.empty();
127
  lex->param_list.empty();
unknown's avatar
unknown committed
128
  lex->view_list.empty();
129
  lex->prepared_stmt_params.empty();
130
  lex->auxiliary_table_list.empty();
131 132 133 134 135 136 137 138 139 140
  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;
141
  lex->select_lex.sql_cache= SELECT_LEX::SQL_CACHE_UNSPECIFIED;
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= 0;
unknown's avatar
unknown committed
154
  lex->empty_field_list_on_rset= 0;
155
  lex->select_lex.select_number= 1;
156
  lex->next_state=MY_LEX_START;
unknown's avatar
unknown committed
157
  lex->yylineno = 1;
unknown's avatar
unknown committed
158
  lex->in_comment=0;
unknown's avatar
unknown committed
159
  lex->length=0;
160
  lex->part_info= 0;
unknown's avatar
unknown committed
161 162
  lex->select_lex.in_sum_expr=0;
  lex->select_lex.expr_list.empty();
unknown's avatar
unknown committed
163
  lex->select_lex.ftfunc_list_alloc.empty();
164
  lex->select_lex.ftfunc_list= &lex->select_lex.ftfunc_list_alloc;
unknown's avatar
unknown committed
165 166
  lex->select_lex.group_list.empty();
  lex->select_lex.order_list.empty();
167
  lex->ignore_space=test(thd->variables.sql_mode & MODE_IGNORE_SPACE);
168
  lex->sql_command= SQLCOM_END;
169
  lex->duplicates= DUP_ERROR;
170
  lex->ignore= 0;
unknown's avatar
unknown committed
171
  lex->spname= NULL;
172 173
  lex->sphead= NULL;
  lex->spcont= NULL;
unknown's avatar
unknown committed
174
  lex->proc_list.first= 0;
unknown's avatar
unknown committed
175
  lex->escape_used= FALSE;
176
  lex->reset_query_tables_list(FALSE);
177
  lex->expr_allows_subselect= TRUE;
178

179 180
  lex->name.str= 0;
  lex->name.length= 0;
unknown's avatar
unknown committed
181
  lex->event_parse_data= NULL;
182

unknown's avatar
unknown committed
183 184 185
  lex->nest_level=0 ;
  lex->allow_sum_func= 0;
  lex->in_sum_func= NULL;
unknown's avatar
unknown committed
186
  DBUG_VOID_RETURN;
unknown's avatar
unknown committed
187 188 189 190
}

void lex_end(LEX *lex)
{
unknown's avatar
unknown committed
191
  DBUG_ENTER("lex_end");
unknown's avatar
unknown committed
192
  DBUG_PRINT("enter", ("lex: 0x%lx", (long) lex));
unknown's avatar
unknown committed
193 194 195 196 197 198 199 200
  if (lex->yacc_yyss)
  {
    my_free(lex->yacc_yyss, MYF(0));
    my_free(lex->yacc_yyvs, MYF(0));
    lex->yacc_yyss= 0;
    lex->yacc_yyvs= 0;
  }
  DBUG_VOID_RETURN;
unknown's avatar
unknown committed
201 202 203 204 205
}


static int find_keyword(LEX *lex, uint len, bool function)
{
unknown's avatar
unknown committed
206
  const uchar *tok=lex->tok_start;
unknown's avatar
unknown committed
207

unknown's avatar
unknown committed
208
  SYMBOL *symbol= get_hash_symbol((const char *)tok,len,function);
unknown's avatar
unknown committed
209 210 211 212 213
  if (symbol)
  {
    lex->yylval->symbol.symbol=symbol;
    lex->yylval->symbol.str= (char*) tok;
    lex->yylval->symbol.length=len;
214 215
    
    if ((symbol->tok == NOT_SYM) &&
216
        (lex->thd->variables.sql_mode & MODE_HIGH_NOT_PRECEDENCE))
217 218 219 220 221
      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
222 223 224 225 226
    return symbol->tok;
  }
  return 0;
}

227 228 229 230 231
/*
  Check if name is a keyword

  SYNOPSIS
    is_keyword()
232
    name      checked name (must not be empty)
233 234 235 236 237 238 239 240 241
    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)
{
242
  DBUG_ASSERT(len != 0);
243 244
  return get_hash_symbol(name,len,0)!=0;
}
unknown's avatar
unknown committed
245 246 247

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

248
static LEX_STRING get_token(LEX *lex,uint length)
unknown's avatar
unknown committed
249 250 251 252
{
  LEX_STRING tmp;
  yyUnget();			// ptr points now after last token char
  tmp.length=lex->yytoklen=length;
253
  tmp.str=(char*) lex->thd->strmake((char*) lex->tok_start,tmp.length);
unknown's avatar
unknown committed
254 255 256
  return tmp;
}

257 258 259 260 261 262 263
/* 
 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)
*/

264 265 266
static LEX_STRING get_quoted_token(LEX *lex,uint length, char quote)
{
  LEX_STRING tmp;
unknown's avatar
unknown committed
267 268
  const uchar *from, *end;
  uchar *to;
269 270 271
  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
272
  for (from= lex->tok_start, to= (uchar*) tmp.str, end= to+length ;
unknown's avatar
unknown committed
273 274
       to != end ;
       )
275
  {
unknown's avatar
unknown committed
276
    if ((*to++= *from++) == (uchar) quote)
277 278 279 280 281 282 283 284 285 286 287
      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
288 289 290 291 292

static char *get_text(LEX *lex)
{
  reg1 uchar c,sep;
  uint found_escape=0;
293
  CHARSET_INFO *cs= lex->thd->charset();
unknown's avatar
unknown committed
294 295 296 297 298 299 300

  sep= yyGetLast();			// String should end with this
  while (lex->ptr != lex->end_of_query)
  {
    c = yyGet();
#ifdef USE_MB
    int l;
unknown's avatar
unknown committed
301 302
    if (use_mb(cs) &&
        (l = my_ismbchar(cs,
unknown's avatar
unknown committed
303 304 305 306 307 308
                         (const char *)lex->ptr-1,
                         (const char *)lex->end_of_query))) {
	lex->ptr += l-1;
	continue;
    }
#endif
309 310
    if (c == '\\' &&
	!(lex->thd->variables.sql_mode & MODE_NO_BACKSLASH_ESCAPES))
unknown's avatar
unknown committed
311 312 313 314
    {					// Escaped character
      found_escape=1;
      if (lex->ptr == lex->end_of_query)
	return 0;
315
      yySkip();
unknown's avatar
unknown committed
316 317 318 319 320 321 322 323 324 325 326 327
    }
    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 */
unknown's avatar
unknown committed
328 329
      const uchar *str, *end;
      uchar *start;
unknown's avatar
unknown committed
330 331 332

      str=lex->tok_start+1;
      end=lex->ptr-1;
333
      if (!(start=(uchar*) lex->thd->alloc((uint) (end-str)+1)))
unknown's avatar
unknown committed
334
	return (char*) "";		// Sql_alloc has set error flag
unknown's avatar
unknown committed
335 336 337 338 339 340 341 342 343
      if (!found_escape)
      {
	lex->yytoklen=(uint) (end-str);
	memcpy(start,str,lex->yytoklen);
	start[lex->yytoklen]=0;
      }
      else
      {
	uchar *to;
344

unknown's avatar
unknown committed
345 346 347 348
	for (to=start ; str != end ; str++)
	{
#ifdef USE_MB
	  int l;
unknown's avatar
unknown committed
349 350
	  if (use_mb(cs) &&
              (l = my_ismbchar(cs,
unknown's avatar
unknown committed
351 352 353 354 355 356 357
                               (const char *)str, (const char *)end))) {
	      while (l--)
		  *to++ = *str++;
	      str--;
	      continue;
	  }
#endif
358
	  if (!(lex->thd->variables.sql_mode & MODE_NO_BACKSLASH_ESCAPES) &&
359
              *str == '\\' && str+1 != end)
unknown's avatar
unknown committed
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
	  {
	    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:
385
              *to++= *str;
unknown's avatar
unknown committed
386 387 388
	      break;
	    }
	  }
389 390
	  else if (*str == sep)
	    *to++= *str++;		// Two ' or "
unknown's avatar
unknown committed
391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418
	  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
419 420
static const char *unsigned_longlong_str="18446744073709551615";
static const uint unsigned_longlong_len=20;
unknown's avatar
unknown committed
421

unknown's avatar
unknown committed
422
static inline uint int_token(const char *str,uint length)
unknown's avatar
unknown committed
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
{
  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
457
      return DECIMAL_NUM;
unknown's avatar
unknown committed
458 459 460 461
    else
    {
      cmp=signed_longlong_str+1;
      smaller=LONG_NUM;				// If <= signed_longlong_str
unknown's avatar
unknown committed
462
      bigger=DECIMAL_NUM;
unknown's avatar
unknown committed
463 464 465 466 467 468 469 470 471 472 473 474 475
    }
  }
  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
476 477
    {
      if (length > unsigned_longlong_len)
unknown's avatar
unknown committed
478
        return DECIMAL_NUM;
unknown's avatar
unknown committed
479 480
      cmp=unsigned_longlong_str;
      smaller=ULONGLONG_NUM;
unknown's avatar
unknown committed
481
      bigger=DECIMAL_NUM;
unknown's avatar
unknown committed
482
    }
unknown's avatar
unknown committed
483 484 485 486
    else
    {
      cmp=longlong_str;
      smaller=LONG_NUM;
487
      bigger= ULONGLONG_NUM;
unknown's avatar
unknown committed
488 489 490 491 492 493
    }
  }
  while (*cmp && *cmp++ == *str++) ;
  return ((uchar) str[-1] <= (uchar) cmp[-1]) ? smaller : bigger;
}

494
/*
495
  MYSQLlex remember the following states from the following MYSQLlex()
496 497 498 499 500

  - 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
501

502
int MYSQLlex(void *arg, void *yythd)
unknown's avatar
unknown committed
503 504
{
  reg1	uchar c;
505
  int	tokval, result_state;
unknown's avatar
unknown committed
506
  uint length;
unknown's avatar
unknown committed
507
  enum my_lex_states state;
508
  LEX	*lex= ((THD *)yythd)->lex;
unknown's avatar
unknown committed
509
  YYSTYPE *yylval=(YYSTYPE*) arg;
510
  CHARSET_INFO *cs= ((THD *) yythd)->charset();
511 512
  uchar *state_map= cs->state_map;
  uchar *ident_map= cs->ident_map;
unknown's avatar
unknown committed
513 514

  lex->yylval=yylval;			// The global state
515 516 517 518

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

unknown's avatar
unknown committed
519
  lex->tok_start=lex->tok_end=lex->ptr;
unknown's avatar
unknown committed
520
  state=lex->next_state;
521
  lex->next_state=MY_LEX_OPERATOR_OR_IDENT;
unknown's avatar
unknown committed
522 523 524
  LINT_INIT(c);
  for (;;)
  {
525
    switch (state) {
526 527
    case MY_LEX_OPERATOR_OR_IDENT:	// Next is operator or keyword
    case MY_LEX_START:			// Start of token
528
      // Skip startspace
529
      for (c=yyGet() ; (state_map[c] == MY_LEX_SKIP) ; c= yyGet())
unknown's avatar
unknown committed
530 531 532 533 534
      {
	if (c == '\n')
	  lex->yylineno++;
      }
      lex->tok_start=lex->ptr-1;	// Start of real token
535
      state= (enum my_lex_states) state_map[c];
unknown's avatar
unknown committed
536
      break;
537
    case MY_LEX_ESCAPE:
unknown's avatar
unknown committed
538 539 540 541 542 543
      if (yyGet() == 'N')
      {					// Allow \N as shortcut for NULL
	yylval->lex_str.str=(char*) "\\N";
	yylval->lex_str.length=2;
	return NULL_SYM;
      }
544 545
    case MY_LEX_CHAR:			// Unknown or single char token
    case MY_LEX_SKIP:			// This should not happen
546 547 548 549 550 551 552
      if (c == '-' && yyPeek() == '-' &&
          (my_isspace(cs,yyPeek2()) || 
           my_iscntrl(cs,yyPeek2())))
      {
        state=MY_LEX_COMMENT;
        break;
      }
unknown's avatar
unknown committed
553
      yylval->lex_str.str=(char*) (lex->ptr=lex->tok_start);// Set to first chr
unknown's avatar
unknown committed
554 555 556
      yylval->lex_str.length=1;
      c=yyGet();
      if (c != ')')
557
	lex->next_state= MY_LEX_START;	// Allow signed numbers
unknown's avatar
unknown committed
558 559
      if (c == ',')
	lex->tok_start=lex->ptr;	// Let tok_start point at next item
560 561 562 563 564 565
      /*
        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.
      */
566
      else if (c == '?' && lex->stmt_prepare_mode && !ident_map[yyPeek()])
567
        return(PARAM_MARKER);
unknown's avatar
unknown committed
568 569
      return((int) c);

unknown's avatar
unknown committed
570 571
    case MY_LEX_IDENT_OR_NCHAR:
      if (yyPeek() != '\'')
572
      {					
unknown's avatar
unknown committed
573 574 575
	state= MY_LEX_IDENT;
	break;
      }
576 577 578 579
      /* Found N'string' */
      lex->tok_start++;                 // Skip N
      yySkip();                         // Skip '
      if (!(yylval->lex_str.str = get_text(lex)))
unknown's avatar
unknown committed
580
      {
581 582
	state= MY_LEX_CHAR;             // Read char by char
	break;
unknown's avatar
unknown committed
583
      }
584 585
      yylval->lex_str.length= lex->yytoklen;
      return(NCHAR_STRING);
unknown's avatar
unknown committed
586

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

      /* 
         Note: "SELECT _bla AS 'alias'"
         _bla should be considered as a IDENT if charset haven't been found.
663
         So we don't use MYF(MY_WME) with get_charset_by_csname to avoid 
664 665 666 667
         producing an error.
      */

      if ((yylval->lex_str.str[0]=='_') && 
668 669 670
          (lex->underscore_charset=
             get_charset_by_csname(yylval->lex_str.str + 1,
                                   MY_CS_PRIMARY,MYF(0))))
671
        return(UNDERSCORE_CHARSET);
672
      return(result_state);			// IDENT or IDENT_QUOTED
unknown's avatar
unknown committed
673

674
    case MY_LEX_IDENT_SEP:		// Found ident and now '.'
unknown's avatar
unknown committed
675 676 677
      yylval->lex_str.str=(char*) lex->ptr;
      yylval->lex_str.length=1;
      c=yyGet();			// should be '.'
678 679 680
      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
681 682
      return((int) c);

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

764 765
      yylval->lex_str= get_token(lex,yyLength());
      return(result_state);
unknown's avatar
unknown committed
766

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

      if (c == 'e' || c == 'E')
      {
	c = yyGet();
unknown's avatar
unknown committed
815
	if (c == '-' || c == '+')
816
	  c = yyGet();			// Skip sign
817
	if (!my_isdigit(cs,c))
unknown's avatar
unknown committed
818
	{				// No digit after sign
819
	  state= MY_LEX_CHAR;
unknown's avatar
unknown committed
820 821
	  break;
	}
822
	while (my_isdigit(cs,yyGet())) ;
unknown's avatar
unknown committed
823 824 825 826
	yylval->lex_str=get_token(lex,yyLength());
	return(FLOAT_NUM);
      }
      yylval->lex_str=get_token(lex,yyLength());
unknown's avatar
unknown committed
827
      return(DECIMAL_NUM);
unknown's avatar
unknown committed
828

829
    case MY_LEX_HEX_NUMBER:		// Found x'hexstring'
830
      yyGet();				// Skip '
831
      while (my_isxdigit(cs,(c = yyGet()))) ;
832 833 834 835 836 837 838 839 840 841 842 843
      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
844 845 846 847 848 849 850 851 852 853 854 855 856
    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); 

857 858 859
    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
860 861 862
	yySkip();
      if ((tokval = find_keyword(lex,(uint) (lex->ptr - lex->tok_start),0)))
      {
863
	lex->next_state= MY_LEX_START;	// Allow signed numbers
unknown's avatar
unknown committed
864 865
	return(tokval);
      }
866
      state = MY_LEX_CHAR;		// Something fishy found
unknown's avatar
unknown committed
867 868
      break;

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

885
    case MY_LEX_BOOL:
unknown's avatar
unknown committed
886 887
      if (c != yyPeek())
      {
888
	state=MY_LEX_CHAR;
unknown's avatar
unknown committed
889 890 891 892
	break;
      }
      yySkip();
      tokval = find_keyword(lex,2,0);	// Is a bool operator
893
      lex->next_state= MY_LEX_START;	// Allow signed numbers
unknown's avatar
unknown committed
894 895
      return(tokval);

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

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

1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081

/*
  Skip comment in the end of statement.

  SYNOPSIS
    skip_rear_comments()
      begin   pointer to the beginning of statement
      end     pointer to the end of statement

  DESCRIPTION
    The function is intended to trim comments at the end of the statement.

  RETURN
    Pointer to the last non-comment symbol of the statement.
*/

1082
const uchar *skip_rear_comments(const uchar *begin, const uchar *end)
1083 1084 1085 1086 1087 1088 1089
{
  while (begin < end && (end[-1] <= ' ' || end[-1] == '*' ||
                         end[-1] == '/' || end[-1] == ';'))
    end-= 1;
  return end;
}

unknown's avatar
unknown committed
1090 1091 1092 1093 1094 1095
/*
  st_select_lex structures initialisations
*/

void st_select_lex_node::init_query()
{
1096
  options= 0;
1097
  sql_cache= SQL_CACHE_UNSPECIFIED;
1098
  linkage= UNSPECIFIED_TYPE;
1099 1100
  no_error= no_table_names_allowed= 0;
  uncacheable= 0;
unknown's avatar
unknown committed
1101 1102 1103 1104 1105 1106 1107 1108 1109
}

void st_select_lex_node::init_select()
{
}

void st_select_lex_unit::init_query()
{
  st_select_lex_node::init_query();
1110
  linkage= GLOBAL_OPTIONS_TYPE;
unknown's avatar
unknown committed
1111
  global_parameters= first_select();
1112 1113
  select_limit_cnt= HA_POS_ERROR;
  offset_limit_cnt= 0;
1114
  union_distinct= 0;
unknown's avatar
unknown committed
1115
  prepared= optimized= executed= 0;
unknown's avatar
unknown committed
1116
  item= 0;
1117 1118
  union_result= 0;
  table= 0;
unknown's avatar
unknown committed
1119
  fake_select_lex= 0;
1120
  cleaned= 0;
1121
  item_list.empty();
1122
  describe= 0;
1123
  found_rows_for_union= 0;
unknown's avatar
unknown committed
1124 1125 1126 1127 1128
}

void st_select_lex::init_query()
{
  st_select_lex_node::init_query();
1129
  table_list.empty();
1130 1131
  top_join_list.empty();
  join_list= &top_join_list;
1132
  embedding= leaf_tables= 0;
unknown's avatar
unknown committed
1133
  item_list.empty();
unknown's avatar
unknown committed
1134
  join= 0;
1135
  having= prep_having= where= prep_where= 0;
1136
  olap= UNSPECIFIED_OLAP_TYPE;
1137
  having_fix_field= 0;
1138 1139
  context.select_lex= this;
  context.init();
unknown's avatar
unknown committed
1140 1141 1142
  /*
    Add the name resolution context of the current (sub)query to the
    stack of contexts for the whole query.
1143 1144 1145 1146 1147
    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
1148 1149
  */
  parent_lex->push_context(&context);
1150
  cond_count= between_count= with_wild= 0;
1151
  conds_processed_with_permanent_arena= 0;
unknown's avatar
unknown committed
1152
  ref_pointer_array= 0;
unknown's avatar
unknown committed
1153
  select_n_having_items= 0;
1154
  subquery_in_having= explicit_limit= 0;
1155
  is_item_list_lookup= 0;
1156
  first_execution= 1;
unknown's avatar
unknown committed
1157
  first_cond_optimization= 1;
1158
  parsing_place= NO_MATTER;
1159
  exclude_from_table_unique_test= no_wrap_view_item= FALSE;
unknown's avatar
unknown committed
1160
  nest_level= 0;
1161
  link_next= 0;
unknown's avatar
unknown committed
1162 1163 1164 1165 1166
}

void st_select_lex::init_select()
{
  st_select_lex_node::init_select();
1167
  group_list.empty();
unknown's avatar
unknown committed
1168
  type= db= 0;
1169 1170 1171 1172
  having= 0;
  use_index_ptr= ignore_index_ptr= 0;
  table_join_options= 0;
  in_sum_expr= with_wild= 0;
unknown's avatar
unknown committed
1173
  options= 0;
1174
  sql_cache= SQL_CACHE_UNSPECIFIED;
1175
  braces= 0;
unknown's avatar
unknown committed
1176
  when_list.empty();
unknown's avatar
unknown committed
1177
  expr_list.empty();
unknown's avatar
unknown committed
1178
  interval_list.empty();
unknown's avatar
unknown committed
1179
  use_index.empty();
unknown's avatar
unknown committed
1180
  ftfunc_list_alloc.empty();
unknown's avatar
unknown committed
1181
  inner_sum_func_list= 0;
unknown's avatar
unknown committed
1182
  ftfunc_list= &ftfunc_list_alloc;
unknown's avatar
unknown committed
1183
  linkage= UNSPECIFIED_TYPE;
unknown's avatar
unknown committed
1184 1185 1186
  order_list.elements= 0;
  order_list.first= 0;
  order_list.next= (byte**) &order_list.first;
1187 1188 1189
  /* 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
1190
  with_sum_func= 0;
1191
  is_correlated= 0;
unknown's avatar
unknown committed
1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205
}

/*
  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
1206
  slave= 0;
unknown's avatar
unknown committed
1207 1208
}

unknown's avatar
unknown committed
1209 1210
/*
  include on level down (but do not link)
unknown's avatar
unknown committed
1211

unknown's avatar
unknown committed
1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225
  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
1226 1227 1228 1229 1230 1231 1232 1233
/* 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
1234
  slave= 0;
unknown's avatar
unknown committed
1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248
}

/* 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
1249
  if (link_prev)
unknown's avatar
unknown committed
1250 1251 1252 1253
  {
    if ((*link_prev= link_next))
      link_next->link_prev= link_prev;
  }
1254 1255 1256 1257
  // Remove slave structure
  for (; slave; slave= slave->next)
    slave->fast_exclude();
  
unknown's avatar
unknown committed
1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277
}

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

1279 1280 1281 1282 1283 1284 1285 1286 1287 1288

/*
  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
1289 1290 1291
void st_select_lex_unit::exclude_level()
{
  SELECT_LEX_UNIT *units= 0, **units_last= &units;
unknown's avatar
unknown committed
1292
  for (SELECT_LEX *sl= first_select(); sl; sl= sl->next_select())
unknown's avatar
unknown committed
1293
  {
unknown's avatar
unknown committed
1294
    // unlink current level from global SELECTs list
unknown's avatar
unknown committed
1295 1296
    if (sl->link_prev && (*sl->link_prev= sl->link_next))
      sl->link_next->link_prev= sl->link_prev;
unknown's avatar
unknown committed
1297 1298

    // bring up underlay levels
unknown's avatar
unknown committed
1299 1300
    SELECT_LEX_UNIT **last= 0;
    for (SELECT_LEX_UNIT *u= sl->first_inner_unit(); u; u= u->next_unit())
unknown's avatar
unknown committed
1301 1302
    {
      u->master= master;
unknown's avatar
unknown committed
1303
      last= (SELECT_LEX_UNIT**)&(u->next);
unknown's avatar
unknown committed
1304
    }
unknown's avatar
unknown committed
1305 1306 1307 1308 1309 1310 1311 1312
    if (last)
    {
      (*units_last)= sl->first_inner_unit();
      units_last= last;
    }
  }
  if (units)
  {
unknown's avatar
unknown committed
1313
    // include brought up levels in place of current
unknown's avatar
unknown committed
1314 1315
    (*prev)= units;
    (*units_last)= (SELECT_LEX_UNIT*)next;
unknown's avatar
unknown committed
1316 1317 1318
    if (next)
      next->prev= (SELECT_LEX_NODE**)units_last;
    units->prev= prev;
unknown's avatar
unknown committed
1319 1320
  }
  else
unknown's avatar
unknown committed
1321 1322
  {
    // exclude currect unit from list of nodes
unknown's avatar
unknown committed
1323
    (*prev)= next;
unknown's avatar
unknown committed
1324 1325 1326
    if (next)
      next->prev= prev;
  }
unknown's avatar
unknown committed
1327 1328
}

1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339

/*
  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
1340
    // unlink current level from global SELECTs list
1341 1342 1343
    if (sl->link_prev && (*sl->link_prev= sl->link_next))
      sl->link_next->link_prev= sl->link_prev;

unknown's avatar
unknown committed
1344
    // unlink underlay levels
1345 1346 1347 1348 1349
    for (SELECT_LEX_UNIT *u= sl->first_inner_unit(); u; u= u->next_unit())
    {
      u->exclude_level();
    }
  }
unknown's avatar
unknown committed
1350
  // exclude currect unit from list of nodes
1351
  (*prev)= next;
unknown's avatar
unknown committed
1352 1353
  if (next)
    next->prev= prev;
1354 1355 1356
}


unknown's avatar
unknown committed
1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368
/*
  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
1369
void st_select_lex::mark_as_dependent(SELECT_LEX *last)
unknown's avatar
unknown committed
1370 1371 1372 1373 1374
{
  /*
    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
1375
  for (SELECT_LEX *s= this;
1376
       s && s != last;
unknown's avatar
unknown committed
1377
       s= s->outer_select())
1378
    if (!(s->uncacheable & UNCACHEABLE_DEPENDENT))
unknown's avatar
unknown committed
1379 1380
    {
      // Select is dependent of outer select
1381
      s->uncacheable|= UNCACHEABLE_DEPENDENT;
1382
      SELECT_LEX_UNIT *munit= s->master_unit();
1383
      munit->uncacheable|= UNCACHEABLE_DEPENDENT;
unknown's avatar
unknown committed
1384
    }
1385 1386
  is_correlated= TRUE;
  this->master_unit()->item->is_correlated= TRUE;
unknown's avatar
unknown committed
1387 1388
}

1389 1390 1391 1392 1393 1394 1395
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
1396
TABLE_LIST *st_select_lex_node::add_table_to_list(THD *thd, Table_ident *table,
1397
						  LEX_STRING *alias,
unknown's avatar
unknown committed
1398
						  ulong table_join_options,
1399 1400
						  thr_lock_type flags,
						  List<String> *use_index,
unknown's avatar
unknown committed
1401 1402
						  List<String> *ignore_index,
                                                  LEX_STRING *option)
1403 1404 1405
{
  return 0;
}
unknown's avatar
unknown committed
1406 1407 1408 1409 1410 1411 1412 1413
ulong st_select_lex_node::get_table_join_options()
{
  return 0;
}

/*
  prohibit using LIMIT clause
*/
unknown's avatar
unknown committed
1414
bool st_select_lex::test_limit()
unknown's avatar
unknown committed
1415
{
1416
  if (select_limit != 0)
unknown's avatar
unknown committed
1417 1418
  {
    my_error(ER_NOT_SUPPORTED_YET, MYF(0),
unknown's avatar
unknown committed
1419
             "LIMIT & IN/ALL/ANY/SOME subquery");
unknown's avatar
unknown committed
1420 1421 1422 1423 1424 1425
    return(1);
  }
  // no sense in ORDER BY without LIMIT
  order_list.empty();
  return(0);
}
1426

1427

1428 1429 1430 1431 1432
st_select_lex_unit* st_select_lex_unit::master_unit()
{
    return this;
}

1433

1434 1435 1436 1437 1438
st_select_lex* st_select_lex_unit::outer_select()
{
  return (st_select_lex*) master;
}

1439

unknown's avatar
unknown committed
1440
bool st_select_lex::add_order_to_list(THD *thd, Item *item, bool asc)
unknown's avatar
unknown committed
1441
{
unknown's avatar
unknown committed
1442
  return add_to_list(thd, order_list, item, asc);
unknown's avatar
unknown committed
1443
}
1444

1445

unknown's avatar
unknown committed
1446
bool st_select_lex::add_item_to_list(THD *thd, Item *item)
1447
{
1448
  DBUG_ENTER("st_select_lex::add_item_to_list");
unknown's avatar
unknown committed
1449
  DBUG_PRINT("info", ("Item: 0x%lx", (long) item));
1450
  DBUG_RETURN(item_list.push_back(item));
1451 1452
}

1453

unknown's avatar
unknown committed
1454
bool st_select_lex::add_group_to_list(THD *thd, Item *item, bool asc)
1455
{
unknown's avatar
unknown committed
1456
  return add_to_list(thd, group_list, item, asc);
1457 1458
}

1459

1460 1461 1462 1463 1464
bool st_select_lex::add_ftfunc_to_list(Item_func_match *func)
{
  return !func || ftfunc_list->push_back(func); // end of memory?
}

1465

1466 1467 1468 1469 1470
st_select_lex_unit* st_select_lex::master_unit()
{
  return (st_select_lex_unit*) master;
}

1471

1472 1473 1474 1475 1476
st_select_lex* st_select_lex::outer_select()
{
  return (st_select_lex*) master->get_master();
}

1477

1478 1479 1480 1481 1482 1483
bool st_select_lex::set_braces(bool value)
{
  braces= value;
  return 0; 
}

1484

1485 1486 1487 1488 1489 1490
bool st_select_lex::inc_in_sum_expr()
{
  in_sum_expr++;
  return 0;
}

1491

1492 1493 1494 1495 1496
uint st_select_lex::get_in_sum_expr()
{
  return in_sum_expr;
}

1497

1498 1499 1500 1501 1502 1503 1504 1505 1506 1507
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;
}

1508

1509 1510 1511 1512 1513
List<String>* st_select_lex::get_use_index()
{
  return use_index_ptr;
}

1514

1515 1516 1517 1518 1519
List<String>* st_select_lex::get_ignore_index()
{
  return ignore_index_ptr;
}

1520

unknown's avatar
unknown committed
1521 1522 1523 1524 1525
ulong st_select_lex::get_table_join_options()
{
  return table_join_options;
}

1526

unknown's avatar
unknown committed
1527 1528 1529 1530
bool st_select_lex::setup_ref_array(THD *thd, uint order_group_num)
{
  if (ref_pointer_array)
    return 0;
1531 1532 1533 1534 1535

  /*
    We have to create array in prepared statement memory if it is
    prepared statement
  */
unknown's avatar
unknown committed
1536
  Query_arena *arena= thd->stmt_arena;
unknown's avatar
unknown committed
1537
  return (ref_pointer_array=
1538 1539 1540 1541
          (Item **)arena->alloc(sizeof(Item*) * (n_child_sum_items +
                                                 item_list.elements +
                                                 select_n_having_items +
                                                 order_group_num)*5)) == 0;
unknown's avatar
unknown committed
1542 1543
}

1544

unknown's avatar
unknown committed
1545 1546
void st_select_lex_unit::print(String *str)
{
1547
  bool union_all= !union_distinct;
unknown's avatar
unknown committed
1548 1549 1550 1551
  for (SELECT_LEX *sl= first_select(); sl; sl= sl->next_select())
  {
    if (sl != first_select())
    {
1552
      str->append(STRING_WITH_LEN(" union "));
1553
      if (union_all)
1554
	str->append(STRING_WITH_LEN("all "));
1555
      else if (union_distinct == sl)
1556
        union_all= TRUE;
unknown's avatar
unknown committed
1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567
    }
    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)
    {
1568
      str->append(STRING_WITH_LEN(" order by "));
unknown's avatar
unknown committed
1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581
      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)
  {
1582 1583 1584
    if (order->counter_used)
    {
      char buffer[20];
unknown's avatar
unknown committed
1585 1586
      uint length= my_snprintf(buffer, 20, "%d", order->counter);
      str->append(buffer, length);
1587 1588 1589
    }
    else
      (*order->item)->print(str);
unknown's avatar
unknown committed
1590
    if (!order->asc)
1591
      str->append(STRING_WITH_LEN(" desc"));
unknown's avatar
unknown committed
1592 1593 1594 1595 1596
    if (order->next)
      str->append(',');
  }
}
 
1597

unknown's avatar
unknown committed
1598 1599
void st_select_lex::print_limit(THD *thd, String *str)
{
1600 1601 1602
  SELECT_LEX_UNIT *unit= master_unit();
  Item_subselect *item= unit->item;
  if (item && unit->global_parameters == this &&
unknown's avatar
VIEW  
unknown committed
1603 1604 1605 1606
      (item->substype() == Item_subselect::EXISTS_SUBS ||
       item->substype() == Item_subselect::IN_SUBS ||
       item->substype() == Item_subselect::ALL_SUBS))
  {
1607 1608
    DBUG_ASSERT(!item->fixed ||
                select_limit->val_int() == LL(1) && offset_limit == 0);
unknown's avatar
VIEW  
unknown committed
1609 1610 1611
    return;
  }

1612
  if (explicit_limit)
unknown's avatar
unknown committed
1613
  {
1614
    str->append(STRING_WITH_LEN(" limit "));
unknown's avatar
unknown committed
1615 1616
    if (offset_limit)
    {
1617
      offset_limit->print(str);
unknown's avatar
unknown committed
1618 1619
      str->append(',');
    }
1620
    select_limit->print(str);
unknown's avatar
unknown committed
1621 1622 1623
  }
}

unknown's avatar
VIEW  
unknown committed
1624

1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648
/*
  Initialize (or reset) Query_tables_list object.

  SYNOPSIS
    reset_query_tables_list()
      init  TRUE  - we should perform full initialization of object with
                    allocating needed memory
            FALSE - object is already initialized so we should only reset
                    its state so it can be used for parsing/processing
                    of new statement

  DESCRIPTION
    This method initializes Query_tables_list so it can be used as part
    of LEX object for parsing/processing of statement. One can also use
    this method to reset state of already initialized Query_tables_list
    so it can be used for processing of new statement.
*/

void Query_tables_list::reset_query_tables_list(bool init)
{
  query_tables= 0;
  query_tables_last= &query_tables;
  query_tables_own_last= 0;
  if (init)
1649 1650 1651 1652 1653 1654 1655
  {
    /*
      We delay real initialization of hash (and therefore related
      memory allocation) until first insertion into this hash.
    */
    hash_clear(&sroutines);
  }
1656
  else if (sroutines.records)
1657 1658
  {
    /* Non-zero sroutines.records means that hash was initialized. */
1659
    my_hash_reset(&sroutines);
1660
  }
1661 1662 1663
  sroutines_list.empty();
  sroutines_list_own_last= sroutines_list.next;
  sroutines_list_own_elements= 0;
unknown's avatar
unknown committed
1664 1665 1666
#ifdef HAVE_ROW_BASED_REPLICATION
  binlog_row_based_if_mixed= FALSE;
#endif
1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682
}


/*
  Destroy Query_tables_list object with freeing all resources used by it.

  SYNOPSIS
    destroy_query_tables_list()
*/

void Query_tables_list::destroy_query_tables_list()
{
  hash_free(&sroutines);
}


1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697
/*
  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()
unknown's avatar
unknown committed
1698
  :result(0), yacc_yyss(0), yacc_yyvs(0),
1699
   sql_command(SQLCOM_END)
1700
{
1701
  reset_query_tables_list(TRUE);
1702 1703 1704
}


unknown's avatar
VIEW  
unknown committed
1705
/*
1706
  Check whether the merging algorithm can be used on this VIEW
unknown's avatar
VIEW  
unknown committed
1707 1708 1709 1710

  SYNOPSIS
    st_lex::can_be_merged()

1711
  DESCRIPTION
1712 1713 1714
    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,
1715 1716 1717
    HAVING clause, aggregate functions, DISTINCT clause, LIMIT clause and
    several underlying tables.

unknown's avatar
VIEW  
unknown committed
1718 1719 1720 1721 1722 1723 1724 1725 1726 1727
  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 */
1728 1729 1730 1731 1732 1733 1734 1735
  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 &&
unknown's avatar
unknown committed
1736 1737
          (unit->item == 0 ||
           (unit->item->place() != IN_WHERE && unit->item->place() != IN_ON)))
1738 1739 1740 1741 1742 1743 1744 1745
      {
        selects_allow_merge= 0;
        break;
      }
    }
  }

  return (selects_allow_merge &&
unknown's avatar
VIEW  
unknown committed
1746 1747 1748
	  select_lex.order_list.elements == 0 &&
	  select_lex.group_list.elements == 0 &&
	  select_lex.having == 0 &&
1749
          select_lex.with_sum_func == 0 &&
1750
	  select_lex.table_list.elements >= 1 &&
unknown's avatar
VIEW  
unknown committed
1751
	  !(select_lex.options & SELECT_DISTINCT) &&
1752
          select_lex.select_limit == 0);
unknown's avatar
VIEW  
unknown committed
1753 1754
}

1755

unknown's avatar
VIEW  
unknown committed
1756
/*
1757
  check if command can use VIEW with MERGE algorithm (for top VIEWs)
unknown's avatar
VIEW  
unknown committed
1758 1759 1760 1761

  SYNOPSIS
    st_lex::can_use_merged()

1762 1763 1764 1765 1766
  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
1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785
  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:
1786
  case SQLCOM_LOAD:
unknown's avatar
VIEW  
unknown committed
1787 1788 1789 1790 1791 1792
    return TRUE;
  default:
    return FALSE;
  }
}

1793
/*
1794
  Check if command can't use merged views in any part of command
1795 1796 1797 1798

  SYNOPSIS
    st_lex::can_not_use_merged()

1799 1800 1801 1802
  DESCRIPTION
    Temporary table algorithm will be used on all SELECT levels for queries
    listed here (see also st_lex::can_use_merged()).

1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813
  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:
1814 1815 1816 1817 1818 1819
  /*
    SQLCOM_SHOW_FIELDS is necessary to make 
    information schema tables working correctly with views.
    see get_schema_tables_result function
  */
  case SQLCOM_SHOW_FIELDS:
1820 1821 1822 1823 1824 1825
    return TRUE;
  default:
    return FALSE;
  }
}

unknown's avatar
VIEW  
unknown committed
1826 1827 1828 1829 1830 1831 1832 1833 1834 1835
/*
  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
1836

unknown's avatar
VIEW  
unknown committed
1837 1838
bool st_lex::only_view_structure()
{
1839
  switch (sql_command) {
unknown's avatar
VIEW  
unknown committed
1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853
  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
1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878
/*
  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;
  }
}

1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903
/*
  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
1904

unknown's avatar
unknown committed
1905 1906 1907 1908 1909 1910 1911
/*
  initialize limit counters

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

1913
void st_select_lex_unit::set_limit(SELECT_LEX *sl)
1914
{
1915
  ha_rows select_limit_val;
1916

unknown's avatar
unknown committed
1917
  DBUG_ASSERT(! thd->stmt_arena->is_stmt_prepare());
1918 1919 1920 1921
  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));
1922 1923
  select_limit_cnt= select_limit_val + offset_limit_cnt;
  if (select_limit_cnt < select_limit_val)
1924 1925 1926
    select_limit_cnt= HA_POS_ERROR;		// no limit
}

unknown's avatar
unknown committed
1927

1928
/*
1929 1930
  Unlink the first table from the global table list and the first table from
  outer select (lex->select_lex) local list
1931 1932 1933

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

unknown's avatar
VIEW  
unknown committed
1936
  NOTES
1937 1938
    We assume that first tables in both lists is the same table or the local
    list is empty.
1939 1940

  RETURN
1941
    0	If 'query_tables' == 0
unknown's avatar
VIEW  
unknown committed
1942
    unlinked table
1943
      In this case link_to_local is set.
unknown's avatar
unknown committed
1944

1945
*/
unknown's avatar
VIEW  
unknown committed
1946
TABLE_LIST *st_lex::unlink_first_table(bool *link_to_local)
1947
{
unknown's avatar
VIEW  
unknown committed
1948 1949 1950 1951 1952 1953 1954 1955
  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;
1956 1957
    else
      query_tables_last= &query_tables;
unknown's avatar
VIEW  
unknown committed
1958 1959 1960 1961 1962 1963 1964
    first->next_global= 0;

    /*
      and from local list if it is not empty
    */
    if ((*link_to_local= test(select_lex.table_list.first)))
    {
1965 1966
      select_lex.context.table_list= 
        select_lex.context.first_name_resolution_table= first->next_local;
unknown's avatar
unknown committed
1967
      select_lex.table_list.first= (byte*) (first->next_local);
unknown's avatar
VIEW  
unknown committed
1968 1969 1970
      select_lex.table_list.elements--;	//safety
      first->next_local= 0;
      /*
1971 1972
        Ensure that the global list has the same first table as the local
        list.
unknown's avatar
VIEW  
unknown committed
1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988
      */
      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
1989 1990 1991 1992 1993 1994
    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
1995 1996 1997 1998 1999 2000 2001
*/

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)
  {
2002
    TABLE_LIST *next;
unknown's avatar
VIEW  
unknown committed
2003 2004
    if (query_tables_last == &first_table->next_global)
      query_tables_last= first_table->prev_global;
2005

2006
    if ((next= *first_table->prev_global= first_table->next_global))
unknown's avatar
VIEW  
unknown committed
2007 2008 2009 2010
      next->prev_global= first_table->prev_global;
    /* include in new place */
    first_table->next_global= query_tables;
    /*
2011 2012 2013
       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
2014 2015 2016 2017 2018
    */
    query_tables->prev_global= &first_table->next_global;
    first_table->prev_global= &query_tables;
    query_tables= first_table;
  }
2019 2020
}

unknown's avatar
unknown committed
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
/*
  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;
}

2047
/*
unknown's avatar
unknown committed
2048
  Link table back that was unlinked with unlink_first_table()
2049 2050 2051

  SYNOPSIS
    link_first_table_back()
unknown's avatar
VIEW  
unknown committed
2052
    link_to_local	do we need link this table to local
2053 2054 2055 2056

  RETURN
    global list
*/
unknown's avatar
VIEW  
unknown committed
2057 2058 2059

void st_lex::link_first_table_back(TABLE_LIST *first,
				   bool link_to_local)
2060
{
unknown's avatar
VIEW  
unknown committed
2061
  if (first)
2062
  {
unknown's avatar
VIEW  
unknown committed
2063 2064
    if ((first->next_global= query_tables))
      query_tables->prev_global= &first->next_global;
2065 2066
    else
      query_tables_last= &first->next_global;
unknown's avatar
VIEW  
unknown committed
2067 2068 2069 2070 2071
    query_tables= first;

    if (link_to_local)
    {
      first->next_local= (TABLE_LIST*) select_lex.table_list.first;
unknown's avatar
unknown committed
2072 2073
      select_lex.context.table_list= first;
      select_lex.table_list.first= (byte*) first;
unknown's avatar
VIEW  
unknown committed
2074 2075 2076 2077 2078 2079
      select_lex.table_list.elements++;	//safety
    }
  }
}


2080 2081 2082 2083 2084 2085

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

  SYNOPSIS
    st_lex::cleanup_after_one_table_open()
2086 2087 2088 2089 2090

  NOTE
    This method is mostly responsible for cleaning up of selects lists and
    derived tables state. To rollback changes in Query_tables_list one has
    to call Query_tables_list::reset_query_tables_list(FALSE).
2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116
*/

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;
2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151
}


/*
  Save current state of Query_tables_list for this LEX, and prepare it
  for processing of new statemnt.

  SYNOPSIS
    reset_n_backup_query_tables_list()
      backup  Pointer to Query_tables_list instance to be used for backup
*/

void st_lex::reset_n_backup_query_tables_list(Query_tables_list *backup)
{
  backup->set_query_tables_list(this);
  /*
    We have to perform full initialization here since otherwise we
    will damage backed up state.
  */
  this->reset_query_tables_list(TRUE);
}


/*
  Restore state of Query_tables_list for this LEX from backup.

  SYNOPSIS
    restore_backup_query_tables_list()
      backup  Pointer to Query_tables_list instance used for backup
*/

void st_lex::restore_backup_query_tables_list(Query_tables_list *backup)
{
  this->destroy_query_tables_list();
  this->set_query_tables_list(backup);
2152 2153 2154
}


unknown's avatar
unknown committed
2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176
/*
  Checks for usage of routines and/or tables in a parsed statement

  SYNOPSIS
    st_lex:table_or_sp_used()

  RETURN
    FALSE  No routines and tables used
    TRUE   Either or both routines and tables are used.
*/

bool st_lex::table_or_sp_used()
{
  DBUG_ENTER("table_or_sp_used");

  if (sroutines.records || query_tables)
    DBUG_RETURN(TRUE);

  DBUG_RETURN(FALSE);
}


2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205
/*
  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
2206
/*
2207
  Save WHERE/HAVING/ON clauses and replace them with disposable copies
unknown's avatar
VIEW  
unknown committed
2208 2209 2210

  SYNOPSIS
    st_select_lex::fix_prepare_information
2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221
      thd          thread handler
      conds        in/out pointer to WHERE condition to be met at execution
      having_conds in/out pointer to HAVING condition to be met at execution
  
  DESCRIPTION
    The passed WHERE and HAVING are to be saved for the future executions.
    This function saves it, and returns a copy which can be thrashed during
    this execution of the statement. By saving/thrashing here we mean only
    AND/OR trees.
    The function also calls fix_prepare_info_in_table_list that saves all
    ON expressions.    
unknown's avatar
VIEW  
unknown committed
2222 2223
*/

2224 2225
void st_select_lex::fix_prepare_information(THD *thd, Item **conds, 
                                            Item **having_conds)
unknown's avatar
VIEW  
unknown committed
2226
{
unknown's avatar
unknown committed
2227
  if (!thd->stmt_arena->is_conventional() && first_execution)
unknown's avatar
VIEW  
unknown committed
2228 2229
  {
    first_execution= 0;
2230 2231 2232 2233 2234
    if (*conds)
    {
      prep_where= *conds;
      *conds= where= prep_where->copy_andor_structure(thd);
    }
2235 2236 2237 2238 2239
    if (*having_conds)
    {
      prep_having= *having_conds;
      *having_conds= having= prep_having->copy_andor_structure(thd);
    }
2240
    fix_prepare_info_in_table_list(thd, (TABLE_LIST *)table_list.first);
2241 2242 2243
  }
}

unknown's avatar
unknown committed
2244

unknown's avatar
unknown committed
2245
/*
unknown's avatar
VIEW  
unknown committed
2246
  There are st_select_lex::add_table_to_list &
unknown's avatar
unknown committed
2247
  st_select_lex::set_lock_for_tables are in sql_parse.cc
unknown's avatar
unknown committed
2248

unknown's avatar
VIEW  
unknown committed
2249
  st_select_lex::print is in sql_select.cc
unknown's avatar
unknown committed
2250 2251

  st_select_lex_unit::prepare, st_select_lex_unit::exec,
2252 2253
  st_select_lex_unit::cleanup, st_select_lex_unit::reinit_exec_mechanism,
  st_select_lex_unit::change_result
unknown's avatar
unknown committed
2254
  are in sql_union.cc
unknown's avatar
unknown committed
2255
*/
2256