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

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

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

unknown's avatar
unknown committed
13 14 15 16 17 18 19 20 21 22 23
   You should have received a copy of the GNU General Public License
   along with this program; if not, write to the Free Software
   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA */


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

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

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

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 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;
unknown's avatar
unknown committed
141 142
  lex->select_lex.init_order();
  lex->select_lex.group_list.empty();
143
  lex->describe= 0;
unknown's avatar
unknown committed
144
  lex->subqueries= FALSE;
unknown's avatar
unknown committed
145
  lex->view_prepare_mode= FALSE;
unknown's avatar
unknown committed
146
  lex->derived_tables= 0;
147
  lex->lock_option= TL_READ;
148
  lex->found_semicolon= 0;
149 150
  lex->safe_to_cache_query= 1;
  lex->time_zone_tables_used= 0;
151
  lex->leaf_tables_insert= lex->query_tables= 0;
unknown's avatar
unknown committed
152 153 154
  lex->query_tables_last= &lex->query_tables;
  lex->variables_used= 0;
  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;
unknown's avatar
unknown committed
160 161
  lex->select_lex.in_sum_expr=0;
  lex->select_lex.expr_list.empty();
unknown's avatar
unknown committed
162
  lex->select_lex.ftfunc_list_alloc.empty();
163
  lex->select_lex.ftfunc_list= &lex->select_lex.ftfunc_list_alloc;
unknown's avatar
unknown committed
164 165
  lex->select_lex.group_list.empty();
  lex->select_lex.order_list.empty();
unknown's avatar
unknown committed
166
  lex->current_select= &lex->select_lex;
unknown's avatar
unknown committed
167
  lex->yacc_yyss=lex->yacc_yyvs=0;
168
  lex->ignore_space=test(thd->variables.sql_mode & MODE_IGNORE_SPACE);
169
  lex->sql_command= lex->orig_sql_command= SQLCOM_END;
170
  lex->duplicates= DUP_ERROR;
171
  lex->ignore= 0;
172 173
  lex->sphead= NULL;
  lex->spcont= NULL;
unknown's avatar
unknown committed
174
  lex->proc_list.first= 0;
175
  lex->query_tables_own_last= 0;
176

177 178 179
  if (lex->sroutines.records)
    my_hash_reset(&lex->sroutines);
  lex->sroutines_list.empty();
unknown's avatar
unknown committed
180
  DBUG_VOID_RETURN;
unknown's avatar
unknown committed
181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199
}

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;
200 201
    
    if ((symbol->tok == NOT_SYM) &&
202
        (lex->thd->variables.sql_mode & MODE_HIGH_NOT_PRECEDENCE))
203 204 205 206 207
      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
208 209 210 211 212
    return symbol->tok;
  }
  return 0;
}

213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229
/*
  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
230 231 232

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

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

242 243 244 245 246 247 248
/* 
 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)
*/

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

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

  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
286 287
    if (use_mb(cs) &&
        (l = my_ismbchar(cs,
unknown's avatar
unknown committed
288 289 290 291 292 293
                         (const char *)lex->ptr-1,
                         (const char *)lex->end_of_query))) {
	lex->ptr += l-1;
	continue;
    }
#endif
294 295
    if (c == '\\' &&
	!(lex->thd->variables.sql_mode & MODE_NO_BACKSLASH_ESCAPES))
unknown's avatar
unknown committed
296 297 298 299
    {					// Escaped character
      found_escape=1;
      if (lex->ptr == lex->end_of_query)
	return 0;
300 301 302 303 304 305 306 307 308 309 310 311
#ifdef USE_MB
      int l;
      if (use_mb(cs) &&
          (l = my_ismbchar(cs,
                           (const char *)lex->ptr,
                           (const char *)lex->end_of_query))) {
          lex->ptr += l;
          continue;
      }
      else
#endif
        yySkip();
unknown's avatar
unknown committed
312 313 314 315 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 */
      uchar *str,*end,*start;

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

        /* Re-use found_escape for tracking state of escapes */
        found_escape= 0;

unknown's avatar
unknown committed
343 344 345 346
	for (to=start ; str != end ; str++)
	{
#ifdef USE_MB
	  int l;
unknown's avatar
unknown committed
347 348
	  if (use_mb(cs) &&
              (l = my_ismbchar(cs,
unknown's avatar
unknown committed
349 350 351 352 353 354 355
                               (const char *)str, (const char *)end))) {
	      while (l--)
		  *to++ = *str++;
	      str--;
	      continue;
	  }
#endif
unknown's avatar
Merge  
unknown committed
356 357
	  if (!found_escape &&
              !(lex->thd->variables.sql_mode & MODE_NO_BACKSLASH_ESCAPES) &&
358
              *str == '\\' && str+1 != end)
unknown's avatar
unknown committed
359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383
	  {
	    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:
384 385
              found_escape= 1;
              str--;
unknown's avatar
unknown committed
386 387 388
	      break;
	    }
	  }
389 390 391 392
	  else if (!found_escape && *str == sep)
          {
            found_escape= 1;
          }
unknown's avatar
unknown committed
393
	  else
394
          {
unknown's avatar
unknown committed
395
	    *to++ = *str;
396 397
            found_escape= 0;
          }
unknown's avatar
unknown committed
398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423
	}
	*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
424 425
static const char *unsigned_longlong_str="18446744073709551615";
static const uint unsigned_longlong_len=20;
unknown's avatar
unknown committed
426

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

499 500 501 502 503 504 505
/*
  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
506

507
int yylex(void *arg, void *yythd)
unknown's avatar
unknown committed
508 509
{
  reg1	uchar c;
510
  int	tokval, result_state;
unknown's avatar
unknown committed
511
  uint length;
unknown's avatar
unknown committed
512
  enum my_lex_states state;
513
  LEX	*lex= ((THD *)yythd)->lex;
unknown's avatar
unknown committed
514
  YYSTYPE *yylval=(YYSTYPE*) arg;
515
  CHARSET_INFO *cs= ((THD *) yythd)->charset();
516 517
  uchar *state_map= cs->state_map;
  uchar *ident_map= cs->ident_map;
unknown's avatar
unknown committed
518 519

  lex->yylval=yylval;			// The global state
520 521 522 523

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

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

unknown's avatar
unknown committed
576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595
    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);

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

      /* 
         Note: "SELECT _bla AS 'alias'"
         _bla should be considered as a IDENT if charset haven't been found.
672
         So we don't use MYF(MY_WME) with get_charset_by_csname to avoid 
673 674 675 676
         producing an error.
      */

      if ((yylval->lex_str.str[0]=='_') && 
unknown's avatar
unknown committed
677 678
          (lex->charset=get_charset_by_csname(yylval->lex_str.str+1,
					      MY_CS_PRIMARY,MYF(0))))
679
        return(UNDERSCORE_CHARSET);
680
      return(result_state);			// IDENT or IDENT_QUOTED
unknown's avatar
unknown committed
681

682
    case MY_LEX_IDENT_SEP:		// Found ident and now '.'
unknown's avatar
unknown committed
683 684 685
      yylval->lex_str.str=(char*) lex->ptr;
      yylval->lex_str.length=1;
      c=yyGet();			// should be '.'
686 687 688
      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
689 690
      return((int) c);

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

772 773
      yylval->lex_str= get_token(lex,yyLength());
      return(result_state);
unknown's avatar
unknown committed
774

775
    case MY_LEX_USER_VARIABLE_DELIMITER:	// Found quote char
776
    {
777 778
      uint double_quotes= 0;
      char quote_char= c;                       // Used char
unknown's avatar
unknown committed
779
      lex->tok_start=lex->ptr;			// Skip first `
780
      while ((c=yyGet()))
unknown's avatar
unknown committed
781
      {
782 783
	int length;
	if ((length= my_mbcharlen(cs, c)) == 1)
784
	{
785 786
	  if (c == (uchar) NAMES_SEP_CHAR)
	    break; /* Old .frm format can't handle this char */
787 788 789 790 791 792 793 794
	  if (c == quote_char)
	  {
	    if (yyPeek() != quote_char)
	      break;
	    c=yyGet();
	    double_quotes++;
	    continue;
	  }
795 796
	}
#ifdef USE_MB
797 798 799
	else if (length < 1)
	  break;				// Error
	lex->ptr+= length-1;
800
#endif
unknown's avatar
unknown committed
801
      }
802 803 804 805 806 807
      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)
808
	yySkip();			// Skip end `
809
      lex->next_state= MY_LEX_START;
810
      return(IDENT_QUOTED);
811
    }
812
    case MY_LEX_INT_OR_REAL:		// Compleat int or incompleat real
unknown's avatar
unknown committed
813 814 815 816 817 818
      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
819 820
    case MY_LEX_REAL:			// Incomplete real number
      while (my_isdigit(cs,c = yyGet())) ;
unknown's avatar
unknown committed
821 822 823 824

      if (c == 'e' || c == 'E')
      {
	c = yyGet();
unknown's avatar
unknown committed
825
	if (c == '-' || c == '+')
826
	  c = yyGet();			// Skip sign
827
	if (!my_isdigit(cs,c))
unknown's avatar
unknown committed
828
	{				// No digit after sign
829
	  state= MY_LEX_CHAR;
unknown's avatar
unknown committed
830 831
	  break;
	}
832
	while (my_isdigit(cs,yyGet())) ;
unknown's avatar
unknown committed
833 834 835 836
	yylval->lex_str=get_token(lex,yyLength());
	return(FLOAT_NUM);
      }
      yylval->lex_str=get_token(lex,yyLength());
unknown's avatar
unknown committed
837
      return(DECIMAL_NUM);
unknown's avatar
unknown committed
838

839
    case MY_LEX_HEX_NUMBER:		// Found x'hexstring'
840
      yyGet();				// Skip '
841
      while (my_isxdigit(cs,(c = yyGet()))) ;
842 843 844 845 846 847 848 849 850 851 852 853
      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
854 855 856 857 858 859 860 861 862 863 864 865 866
    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); 

867 868 869
    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
870 871 872
	yySkip();
      if ((tokval = find_keyword(lex,(uint) (lex->ptr - lex->tok_start),0)))
      {
873
	lex->next_state= MY_LEX_START;	// Allow signed numbers
unknown's avatar
unknown committed
874 875
	return(tokval);
      }
876
      state = MY_LEX_CHAR;		// Something fishy found
unknown's avatar
unknown committed
877 878
      break;

879 880 881
    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
882 883
      {
	yySkip();
884
	if (state_map[yyPeek()] == MY_LEX_CMP_OP)
unknown's avatar
unknown committed
885 886 887 888
	  yySkip();
      }
      if ((tokval = find_keyword(lex,(uint) (lex->ptr - lex->tok_start),0)))
      {
889
	lex->next_state= MY_LEX_START;	// Found long op
unknown's avatar
unknown committed
890 891
	return(tokval);
      }
892
      state = MY_LEX_CHAR;		// Something fishy found
unknown's avatar
unknown committed
893 894
      break;

895
    case MY_LEX_BOOL:
unknown's avatar
unknown committed
896 897
      if (c != yyPeek())
      {
898
	state=MY_LEX_CHAR;
unknown's avatar
unknown committed
899 900 901 902
	break;
      }
      yySkip();
      tokval = find_keyword(lex,2,0);	// Is a bool operator
903
      lex->next_state= MY_LEX_START;	// Allow signed numbers
unknown's avatar
unknown committed
904 905
      return(tokval);

906
    case MY_LEX_STRING_OR_DELIMITER:
907 908
      if (((THD *) yythd)->variables.sql_mode & MODE_ANSI_QUOTES)
      {
909
	state= MY_LEX_USER_VARIABLE_DELIMITER;
910 911 912
	break;
      }
      /* " used for strings */
913
    case MY_LEX_STRING:			// Incomplete text string
unknown's avatar
unknown committed
914 915
      if (!(yylval->lex_str.str = get_text(lex)))
      {
916
	state= MY_LEX_CHAR;		// Read char by char
unknown's avatar
unknown committed
917 918 919 920 921
	break;
      }
      yylval->lex_str.length=lex->yytoklen;
      return(TEXT_STRING);

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

/*
  st_select_lex structures initialisations
*/

void st_select_lex_node::init_query()
{
1080 1081
  options= 0;
  linkage= UNSPECIFIED_TYPE;
1082 1083
  no_error= no_table_names_allowed= 0;
  uncacheable= 0;
unknown's avatar
unknown committed
1084 1085 1086 1087 1088 1089 1090 1091 1092
}

void st_select_lex_node::init_select()
{
}

void st_select_lex_unit::init_query()
{
  st_select_lex_node::init_query();
1093
  linkage= GLOBAL_OPTIONS_TYPE;
unknown's avatar
unknown committed
1094
  global_parameters= first_select();
1095 1096
  select_limit_cnt= HA_POS_ERROR;
  offset_limit_cnt= 0;
1097
  union_distinct= 0;
unknown's avatar
unknown committed
1098
  prepared= optimized= executed= 0;
unknown's avatar
unknown committed
1099
  item= 0;
1100 1101
  union_result= 0;
  table= 0;
unknown's avatar
unknown committed
1102
  fake_select_lex= 0;
1103
  cleaned= 0;
1104
  item_list.empty();
1105
  describe= 0;
1106
  found_rows_for_union= 0;
unknown's avatar
unknown committed
1107 1108 1109 1110 1111
}

void st_select_lex::init_query()
{
  st_select_lex_node::init_query();
1112
  table_list.empty();
1113 1114
  top_join_list.empty();
  join_list= &top_join_list;
1115
  embedding= leaf_tables= 0;
unknown's avatar
unknown committed
1116
  item_list.empty();
unknown's avatar
unknown committed
1117
  join= 0;
1118
  having= where= prep_where= 0;
1119
  olap= UNSPECIFIED_OLAP_TYPE;
1120
  having_fix_field= 0;
1121 1122
  context.select_lex= this;
  context.init();
unknown's avatar
unknown committed
1123 1124 1125 1126 1127
  /*
    Add the name resolution context of the current (sub)query to the
    stack of contexts for the whole query.
  */
  parent_lex->push_context(&context);
unknown's avatar
unknown committed
1128
  cond_count= with_wild= 0;
1129
  conds_processed_with_permanent_arena= 0;
unknown's avatar
unknown committed
1130
  ref_pointer_array= 0;
unknown's avatar
unknown committed
1131
  select_n_having_items= 0;
1132
  subquery_in_having= explicit_limit= 0;
1133
  first_execution= 1;
unknown's avatar
unknown committed
1134
  first_cond_optimization= 1;
1135
  parsing_place= NO_MATTER;
1136
  exclude_from_table_unique_test= no_wrap_view_item= FALSE;
1137
  link_next= 0;
unknown's avatar
unknown committed
1138 1139 1140 1141 1142
}

void st_select_lex::init_select()
{
  st_select_lex_node::init_select();
1143
  group_list.empty();
unknown's avatar
unknown committed
1144
  type= db= 0;
1145 1146 1147 1148
  having= 0;
  use_index_ptr= ignore_index_ptr= 0;
  table_join_options= 0;
  in_sum_expr= with_wild= 0;
unknown's avatar
unknown committed
1149
  options= 0;
1150
  braces= 0;
unknown's avatar
unknown committed
1151
  when_list.empty();
unknown's avatar
unknown committed
1152
  expr_list.empty();
unknown's avatar
unknown committed
1153
  interval_list.empty();
unknown's avatar
unknown committed
1154
  use_index.empty();
unknown's avatar
unknown committed
1155 1156
  ftfunc_list_alloc.empty();
  ftfunc_list= &ftfunc_list_alloc;
unknown's avatar
unknown committed
1157
  linkage= UNSPECIFIED_TYPE;
unknown's avatar
unknown committed
1158 1159 1160
  order_list.elements= 0;
  order_list.first= 0;
  order_list.next= (byte**) &order_list.first;
1161 1162 1163
  /* 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
1164
  with_sum_func= 0;
unknown's avatar
unknown committed
1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178
}

/*
  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
1179
  slave= 0;
unknown's avatar
unknown committed
1180 1181
}

unknown's avatar
unknown committed
1182 1183
/*
  include on level down (but do not link)
unknown's avatar
unknown committed
1184

unknown's avatar
unknown committed
1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198
  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
1199 1200 1201 1202 1203 1204 1205 1206
/* 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
1207
  slave= 0;
unknown's avatar
unknown committed
1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221
}

/* 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
1222
  if (link_prev)
unknown's avatar
unknown committed
1223 1224 1225 1226
  {
    if ((*link_prev= link_next))
      link_next->link_prev= link_prev;
  }
1227 1228 1229 1230
  // Remove slave structure
  for (; slave; slave= slave->next)
    slave->fast_exclude();
  
unknown's avatar
unknown committed
1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250
}

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

1252 1253 1254 1255 1256 1257 1258 1259 1260 1261

/*
  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
1262 1263 1264
void st_select_lex_unit::exclude_level()
{
  SELECT_LEX_UNIT *units= 0, **units_last= &units;
unknown's avatar
unknown committed
1265
  for (SELECT_LEX *sl= first_select(); sl; sl= sl->next_select())
unknown's avatar
unknown committed
1266
  {
unknown's avatar
unknown committed
1267
    // unlink current level from global SELECTs list
unknown's avatar
unknown committed
1268 1269
    if (sl->link_prev && (*sl->link_prev= sl->link_next))
      sl->link_next->link_prev= sl->link_prev;
unknown's avatar
unknown committed
1270 1271

    // bring up underlay levels
unknown's avatar
unknown committed
1272 1273
    SELECT_LEX_UNIT **last= 0;
    for (SELECT_LEX_UNIT *u= sl->first_inner_unit(); u; u= u->next_unit())
unknown's avatar
unknown committed
1274 1275
    {
      u->master= master;
unknown's avatar
unknown committed
1276
      last= (SELECT_LEX_UNIT**)&(u->next);
unknown's avatar
unknown committed
1277
    }
unknown's avatar
unknown committed
1278 1279 1280 1281 1282 1283 1284 1285
    if (last)
    {
      (*units_last)= sl->first_inner_unit();
      units_last= last;
    }
  }
  if (units)
  {
unknown's avatar
unknown committed
1286
    // include brought up levels in place of current
unknown's avatar
unknown committed
1287 1288
    (*prev)= units;
    (*units_last)= (SELECT_LEX_UNIT*)next;
unknown's avatar
unknown committed
1289 1290 1291
    if (next)
      next->prev= (SELECT_LEX_NODE**)units_last;
    units->prev= prev;
unknown's avatar
unknown committed
1292 1293
  }
  else
unknown's avatar
unknown committed
1294 1295
  {
    // exclude currect unit from list of nodes
unknown's avatar
unknown committed
1296
    (*prev)= next;
unknown's avatar
unknown committed
1297 1298 1299
    if (next)
      next->prev= prev;
  }
unknown's avatar
unknown committed
1300 1301
}

1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312

/*
  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
1313
    // unlink current level from global SELECTs list
1314 1315 1316
    if (sl->link_prev && (*sl->link_prev= sl->link_next))
      sl->link_next->link_prev= sl->link_prev;

unknown's avatar
unknown committed
1317
    // unlink underlay levels
1318 1319 1320 1321 1322
    for (SELECT_LEX_UNIT *u= sl->first_inner_unit(); u; u= u->next_unit())
    {
      u->exclude_level();
    }
  }
unknown's avatar
unknown committed
1323
  // exclude currect unit from list of nodes
1324
  (*prev)= next;
unknown's avatar
unknown committed
1325 1326
  if (next)
    next->prev= prev;
1327 1328 1329
}


unknown's avatar
unknown committed
1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341
/*
  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
1342
void st_select_lex::mark_as_dependent(SELECT_LEX *last)
unknown's avatar
unknown committed
1343 1344 1345 1346 1347
{
  /*
    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
1348
  for (SELECT_LEX *s= this;
1349
       s && s != last;
unknown's avatar
unknown committed
1350
       s= s->outer_select())
1351
    if (!(s->uncacheable & UNCACHEABLE_DEPENDENT))
unknown's avatar
unknown committed
1352 1353
    {
      // Select is dependent of outer select
1354
      s->uncacheable|= UNCACHEABLE_DEPENDENT;
1355
      SELECT_LEX_UNIT *munit= s->master_unit();
1356
      munit->uncacheable|= UNCACHEABLE_DEPENDENT;
unknown's avatar
unknown committed
1357 1358 1359
    }
}

1360 1361 1362 1363 1364 1365 1366
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
1367
TABLE_LIST *st_select_lex_node::add_table_to_list(THD *thd, Table_ident *table,
1368
						  LEX_STRING *alias,
unknown's avatar
unknown committed
1369
						  ulong table_join_options,
1370 1371
						  thr_lock_type flags,
						  List<String> *use_index,
unknown's avatar
unknown committed
1372 1373
						  List<String> *ignore_index,
                                                  LEX_STRING *option)
1374 1375 1376
{
  return 0;
}
unknown's avatar
unknown committed
1377 1378 1379 1380 1381 1382 1383 1384
ulong st_select_lex_node::get_table_join_options()
{
  return 0;
}

/*
  prohibit using LIMIT clause
*/
unknown's avatar
unknown committed
1385
bool st_select_lex::test_limit()
unknown's avatar
unknown committed
1386
{
1387
  if (select_limit != 0)
unknown's avatar
unknown committed
1388 1389
  {
    my_error(ER_NOT_SUPPORTED_YET, MYF(0),
unknown's avatar
unknown committed
1390
             "LIMIT & IN/ALL/ANY/SOME subquery");
unknown's avatar
unknown committed
1391 1392 1393 1394 1395 1396
    return(1);
  }
  // no sense in ORDER BY without LIMIT
  order_list.empty();
  return(0);
}
1397

1398

1399 1400 1401 1402 1403
st_select_lex_unit* st_select_lex_unit::master_unit()
{
    return this;
}

1404

1405 1406 1407 1408 1409
st_select_lex* st_select_lex_unit::outer_select()
{
  return (st_select_lex*) master;
}

1410

unknown's avatar
unknown committed
1411
bool st_select_lex::add_order_to_list(THD *thd, Item *item, bool asc)
unknown's avatar
unknown committed
1412
{
unknown's avatar
unknown committed
1413
  return add_to_list(thd, order_list, item, asc);
unknown's avatar
unknown committed
1414
}
1415

1416

unknown's avatar
unknown committed
1417
bool st_select_lex::add_item_to_list(THD *thd, Item *item)
1418
{
1419 1420 1421
  DBUG_ENTER("st_select_lex::add_item_to_list");
  DBUG_PRINT("info", ("Item: %p", item));
  DBUG_RETURN(item_list.push_back(item));
1422 1423
}

1424

unknown's avatar
unknown committed
1425
bool st_select_lex::add_group_to_list(THD *thd, Item *item, bool asc)
1426
{
unknown's avatar
unknown committed
1427
  return add_to_list(thd, group_list, item, asc);
1428 1429
}

1430

1431 1432 1433 1434 1435
bool st_select_lex::add_ftfunc_to_list(Item_func_match *func)
{
  return !func || ftfunc_list->push_back(func); // end of memory?
}

1436

1437 1438 1439 1440 1441
st_select_lex_unit* st_select_lex::master_unit()
{
  return (st_select_lex_unit*) master;
}

1442

1443 1444 1445 1446 1447
st_select_lex* st_select_lex::outer_select()
{
  return (st_select_lex*) master->get_master();
}

1448

1449 1450 1451 1452 1453 1454
bool st_select_lex::set_braces(bool value)
{
  braces= value;
  return 0; 
}

1455

1456 1457 1458 1459 1460 1461
bool st_select_lex::inc_in_sum_expr()
{
  in_sum_expr++;
  return 0;
}

1462

1463 1464 1465 1466 1467
uint st_select_lex::get_in_sum_expr()
{
  return in_sum_expr;
}

1468

1469 1470 1471 1472 1473 1474 1475 1476 1477 1478
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;
}

1479

1480 1481 1482 1483 1484
List<String>* st_select_lex::get_use_index()
{
  return use_index_ptr;
}

1485

1486 1487 1488 1489 1490
List<String>* st_select_lex::get_ignore_index()
{
  return ignore_index_ptr;
}

1491

unknown's avatar
unknown committed
1492 1493 1494 1495 1496
ulong st_select_lex::get_table_join_options()
{
  return table_join_options;
}

1497

unknown's avatar
unknown committed
1498 1499 1500 1501
bool st_select_lex::setup_ref_array(THD *thd, uint order_group_num)
{
  if (ref_pointer_array)
    return 0;
1502 1503 1504 1505 1506

  /*
    We have to create array in prepared statement memory if it is
    prepared statement
  */
unknown's avatar
unknown committed
1507 1508
  Query_arena *arena= thd->current_arena;
  return (ref_pointer_array=
1509 1510 1511 1512
          (Item **)arena->alloc(sizeof(Item*) *
                                (item_list.elements +
                                 select_n_having_items +
                                 order_group_num)* 5)) == 0;
unknown's avatar
unknown committed
1513 1514
}

1515

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

unknown's avatar
unknown committed
1569 1570
void st_select_lex::print_limit(THD *thd, String *str)
{
1571 1572 1573
  SELECT_LEX_UNIT *unit= master_unit();
  Item_subselect *item= unit->item;
  if (item && unit->global_parameters == this &&
unknown's avatar
VIEW  
unknown committed
1574 1575 1576 1577
      (item->substype() == Item_subselect::EXISTS_SUBS ||
       item->substype() == Item_subselect::IN_SUBS ||
       item->substype() == Item_subselect::ALL_SUBS))
  {
1578 1579
    DBUG_ASSERT(!item->fixed ||
                select_limit->val_int() == LL(1) && offset_limit == 0);
unknown's avatar
VIEW  
unknown committed
1580 1581 1582
    return;
  }

1583
  if (explicit_limit)
unknown's avatar
unknown committed
1584
  {
1585
    str->append(" limit ", 7);
unknown's avatar
unknown committed
1586 1587
    if (offset_limit)
    {
1588
      offset_limit->print(str);
unknown's avatar
unknown committed
1589 1590
      str->append(',');
    }
1591
    select_limit->print(str);
unknown's avatar
unknown committed
1592 1593 1594
  }
}

unknown's avatar
VIEW  
unknown committed
1595

1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617
/*
  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();
}


unknown's avatar
VIEW  
unknown committed
1618
/*
1619
  Check whether the merging algorithm can be used on this VIEW
unknown's avatar
VIEW  
unknown committed
1620 1621 1622 1623

  SYNOPSIS
    st_lex::can_be_merged()

1624
  DESCRIPTION
1625 1626 1627
    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,
1628 1629 1630
    HAVING clause, aggregate functions, DISTINCT clause, LIMIT clause and
    several underlying tables.

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

1667

unknown's avatar
VIEW  
unknown committed
1668
/*
1669
  check if command can use VIEW with MERGE algorithm (for top VIEWs)
unknown's avatar
VIEW  
unknown committed
1670 1671 1672 1673

  SYNOPSIS
    st_lex::can_use_merged()

1674 1675 1676 1677 1678
  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
1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697
  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:
1698
  case SQLCOM_LOAD:
unknown's avatar
VIEW  
unknown committed
1699 1700 1701 1702 1703 1704
    return TRUE;
  default:
    return FALSE;
  }
}

1705
/*
1706
  Check if command can't use merged views in any part of command
1707 1708 1709 1710

  SYNOPSIS
    st_lex::can_not_use_merged()

1711 1712 1713 1714
  DESCRIPTION
    Temporary table algorithm will be used on all SELECT levels for queries
    listed here (see also st_lex::can_use_merged()).

1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725
  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:
1726 1727 1728 1729 1730 1731
  /*
    SQLCOM_SHOW_FIELDS is necessary to make 
    information schema tables working correctly with views.
    see get_schema_tables_result function
  */
  case SQLCOM_SHOW_FIELDS:
1732 1733 1734 1735 1736 1737
    return TRUE;
  default:
    return FALSE;
  }
}

unknown's avatar
VIEW  
unknown committed
1738 1739 1740 1741 1742 1743 1744 1745 1746 1747
/*
  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
1748

unknown's avatar
VIEW  
unknown committed
1749 1750
bool st_lex::only_view_structure()
{
1751
  switch (sql_command) {
unknown's avatar
VIEW  
unknown committed
1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765
  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
1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790
/*
  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;
  }
}

1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815
/*
  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
1816

unknown's avatar
unknown committed
1817 1818 1819 1820 1821 1822 1823
/*
  initialize limit counters

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

1825
void st_select_lex_unit::set_limit(SELECT_LEX *sl)
1826
{
1827
  ha_rows select_limit_val;
1828

1829
  DBUG_ASSERT(! thd->current_arena->is_stmt_prepare());
1830 1831 1832 1833
  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));
1834 1835
  select_limit_cnt= select_limit_val + offset_limit_cnt;
  if (select_limit_cnt < select_limit_val)
1836 1837 1838
    select_limit_cnt= HA_POS_ERROR;		// no limit
}

unknown's avatar
unknown committed
1839

1840
/*
1841 1842
  Unlink the first table from the global table list and the first table from
  outer select (lex->select_lex) local list
1843 1844 1845

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

unknown's avatar
VIEW  
unknown committed
1848
  NOTES
1849 1850
    We assume that first tables in both lists is the same table or the local
    list is empty.
1851 1852

  RETURN
1853
    0	If 'query_tables' == 0
unknown's avatar
VIEW  
unknown committed
1854
    unlinked table
1855
      In this case link_to_local is set.
unknown's avatar
unknown committed
1856

1857
*/
unknown's avatar
VIEW  
unknown committed
1858
TABLE_LIST *st_lex::unlink_first_table(bool *link_to_local)
1859
{
unknown's avatar
VIEW  
unknown committed
1860 1861 1862 1863 1864 1865 1866 1867
  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;
1868 1869
    else
      query_tables_last= &query_tables;
unknown's avatar
VIEW  
unknown committed
1870 1871 1872 1873 1874 1875 1876
    first->next_global= 0;

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

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)
  {
1914
    TABLE_LIST *next;
unknown's avatar
VIEW  
unknown committed
1915 1916
    if (query_tables_last == &first_table->next_global)
      query_tables_last= first_table->prev_global;
1917

1918
    if ((next= *first_table->prev_global= first_table->next_global))
unknown's avatar
VIEW  
unknown committed
1919 1920 1921 1922
      next->prev_global= first_table->prev_global;
    /* include in new place */
    first_table->next_global= query_tables;
    /*
1923 1924 1925
       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
1926 1927 1928 1929 1930
    */
    query_tables->prev_global= &first_table->next_global;
    first_table->prev_global= &query_tables;
    query_tables= first_table;
  }
1931 1932
}

unknown's avatar
unknown committed
1933

1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958
/*
  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;
}

1959
/*
unknown's avatar
unknown committed
1960
  Link table back that was unlinked with unlink_first_table()
1961 1962 1963

  SYNOPSIS
    link_first_table_back()
unknown's avatar
VIEW  
unknown committed
1964
    link_to_local	do we need link this table to local
1965 1966 1967 1968

  RETURN
    global list
*/
unknown's avatar
VIEW  
unknown committed
1969 1970 1971

void st_lex::link_first_table_back(TABLE_LIST *first,
				   bool link_to_local)
1972
{
unknown's avatar
VIEW  
unknown committed
1973
  if (first)
1974
  {
unknown's avatar
VIEW  
unknown committed
1975 1976
    if ((first->next_global= query_tables))
      query_tables->prev_global= &first->next_global;
1977 1978
    else
      query_tables_last= &first->next_global;
unknown's avatar
VIEW  
unknown committed
1979 1980 1981 1982 1983
    query_tables= first;

    if (link_to_local)
    {
      first->next_local= (TABLE_LIST*) select_lex.table_list.first;
unknown's avatar
unknown committed
1984 1985
      select_lex.context.table_list= first;
      select_lex.table_list.first= (byte*) first;
unknown's avatar
VIEW  
unknown committed
1986 1987 1988 1989 1990 1991
      select_lex.table_list.elements++;	//safety
    }
  }
}


1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023

/*
  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;
2024 2025
  if (sroutines.records)
    my_hash_reset(&sroutines);
2026
  sroutines_list.empty();
2027 2028 2029
}


unknown's avatar
VIEW  
unknown committed
2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040
/*
  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
2041
  if (!thd->current_arena->is_conventional() && first_execution)
unknown's avatar
VIEW  
unknown committed
2042 2043
  {
    first_execution= 0;
2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058
    if (*conds)
    {
      prep_where= *conds;
      *conds= where= prep_where->copy_andor_structure(thd);
    }
    for (TABLE_LIST *tbl= (TABLE_LIST *)table_list.first;
         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);
      }
    }
2059 2060 2061
  }
}

unknown's avatar
unknown committed
2062
/*
unknown's avatar
VIEW  
unknown committed
2063
  There are st_select_lex::add_table_to_list &
unknown's avatar
unknown committed
2064
  st_select_lex::set_lock_for_tables are in sql_parse.cc
unknown's avatar
unknown committed
2065

unknown's avatar
VIEW  
unknown committed
2066
  st_select_lex::print is in sql_select.cc
unknown's avatar
unknown committed
2067 2068

  st_select_lex_unit::prepare, st_select_lex_unit::exec,
2069 2070
  st_select_lex_unit::cleanup, st_select_lex_unit::reinit_exec_mechanism,
  st_select_lex_unit::change_result
unknown's avatar
unknown committed
2071
  are in sql_union.cc
unknown's avatar
unknown committed
2072
*/
2073