sql_lex.cc 52.2 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;

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

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

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

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

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

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

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

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

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

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

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


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

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

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

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

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

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

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

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

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

unknown's avatar
unknown committed
570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589
    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);

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

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

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

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

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

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

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

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

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

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

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

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

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

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

/*
  st_select_lex structures initialisations
*/

void st_select_lex_node::init_query()
{
1074 1075
  options= 0;
  linkage= UNSPECIFIED_TYPE;
1076 1077
  no_error= no_table_names_allowed= 0;
  uncacheable= 0;
unknown's avatar
unknown committed
1078 1079 1080 1081 1082 1083 1084 1085 1086
}

void st_select_lex_node::init_select()
{
}

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

void st_select_lex::init_query()
{
  st_select_lex_node::init_query();
1106
  table_list.empty();
1107 1108
  top_join_list.empty();
  join_list= &top_join_list;
1109
  embedding= leaf_tables= 0;
unknown's avatar
unknown committed
1110
  item_list.empty();
unknown's avatar
unknown committed
1111
  join= 0;
1112
  having= where= prep_where= 0;
1113
  olap= UNSPECIFIED_OLAP_TYPE;
1114
  having_fix_field= 0;
1115 1116
  context.select_lex= this;
  context.init();
unknown's avatar
unknown committed
1117
  cond_count= with_wild= 0;
1118
  conds_processed_with_permanent_arena= 0;
unknown's avatar
unknown committed
1119
  ref_pointer_array= 0;
unknown's avatar
unknown committed
1120
  select_n_having_items= 0;
1121
  subquery_in_having= explicit_limit= 0;
1122
  first_execution= 1;
unknown's avatar
unknown committed
1123
  first_cond_optimization= 1;
1124
  parsing_place= NO_MATTER;
1125
  exclude_from_table_unique_test= no_wrap_view_item= FALSE;
1126
  link_next= 0;
unknown's avatar
unknown committed
1127 1128 1129 1130 1131
}

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

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

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

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

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

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

1241 1242 1243 1244 1245 1246 1247 1248 1249 1250

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

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

1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301

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

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


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

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

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

1387

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

1393

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

1399

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

1405

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

1413

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

1419

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

1425

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

1431

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

1437

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

1444

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

1451

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

1457

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

1468

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

1474

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

1480

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

1486

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

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

1504

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

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

1569
  if (explicit_limit)
unknown's avatar
unknown committed
1570
  {
1571
    str->append(" limit ", 7);
unknown's avatar
unknown committed
1572 1573
    if (offset_limit)
    {
1574
      offset_limit->print(str);
unknown's avatar
unknown committed
1575 1576
      str->append(',');
    }
1577
    select_limit->print(str);
unknown's avatar
unknown committed
1578 1579 1580
  }
}

unknown's avatar
VIEW  
unknown committed
1581

1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603
/*
  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
1604
/*
1605
  Check whether the merging algorithm can be used on this VIEW
unknown's avatar
VIEW  
unknown committed
1606 1607 1608 1609

  SYNOPSIS
    st_lex::can_be_merged()

1610
  DESCRIPTION
1611 1612 1613
    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,
1614 1615 1616
    HAVING clause, aggregate functions, DISTINCT clause, LIMIT clause and
    several underlying tables.

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

1653

unknown's avatar
VIEW  
unknown committed
1654
/*
1655
  check if command can use VIEW with MERGE algorithm (for top VIEWs)
unknown's avatar
VIEW  
unknown committed
1656 1657 1658 1659

  SYNOPSIS
    st_lex::can_use_merged()

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

1691
/*
1692
  Check if command can't use merged views in any part of command
1693 1694 1695 1696

  SYNOPSIS
    st_lex::can_not_use_merged()

1697 1698 1699 1700
  DESCRIPTION
    Temporary table algorithm will be used on all SELECT levels for queries
    listed here (see also st_lex::can_use_merged()).

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

unknown's avatar
VIEW  
unknown committed
1724 1725 1726 1727 1728 1729 1730 1731 1732 1733
/*
  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
1734

unknown's avatar
VIEW  
unknown committed
1735 1736
bool st_lex::only_view_structure()
{
1737
  switch (sql_command) {
unknown's avatar
VIEW  
unknown committed
1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751
  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
1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776
/*
  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;
  }
}

1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801
/*
  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
1802

unknown's avatar
unknown committed
1803 1804 1805 1806 1807 1808 1809
/*
  initialize limit counters

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

1811
void st_select_lex_unit::set_limit(SELECT_LEX *sl)
1812
{
1813
  ha_rows select_limit_val;
1814

1815
  DBUG_ASSERT(! thd->current_arena->is_stmt_prepare());
1816 1817 1818 1819
  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));
1820 1821
  select_limit_cnt= select_limit_val + offset_limit_cnt;
  if (select_limit_cnt < select_limit_val)
1822 1823 1824
    select_limit_cnt= HA_POS_ERROR;		// no limit
}

unknown's avatar
unknown committed
1825

1826
/*
1827 1828
  Unlink the first table from the global table list and the first table from
  outer select (lex->select_lex) local list
1829 1830 1831

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

unknown's avatar
VIEW  
unknown committed
1834
  NOTES
1835 1836
    We assume that first tables in both lists is the same table or the local
    list is empty.
1837 1838

  RETURN
1839
    0	If 'query_tables' == 0
unknown's avatar
VIEW  
unknown committed
1840
    unlinked table
1841
      In this case link_to_local is set.
unknown's avatar
unknown committed
1842

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

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

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)
  {
1899
    TABLE_LIST *next;
unknown's avatar
VIEW  
unknown committed
1900 1901
    if (query_tables_last == &first_table->next_global)
      query_tables_last= first_table->prev_global;
1902

1903
    if ((next= *first_table->prev_global= first_table->next_global))
unknown's avatar
VIEW  
unknown committed
1904 1905 1906 1907
      next->prev_global= first_table->prev_global;
    /* include in new place */
    first_table->next_global= query_tables;
    /*
1908 1909 1910
       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
1911 1912 1913 1914 1915
    */
    query_tables->prev_global= &first_table->next_global;
    first_table->prev_global= &query_tables;
    query_tables= first_table;
  }
1916 1917
}

unknown's avatar
unknown committed
1918

1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943
/*
  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;
}

1944
/*
unknown's avatar
unknown committed
1945
  Link table back that was unlinked with unlink_first_table()
1946 1947 1948

  SYNOPSIS
    link_first_table_back()
unknown's avatar
VIEW  
unknown committed
1949
    link_to_local	do we need link this table to local
1950 1951 1952 1953

  RETURN
    global list
*/
unknown's avatar
VIEW  
unknown committed
1954 1955 1956

void st_lex::link_first_table_back(TABLE_LIST *first,
				   bool link_to_local)
1957
{
unknown's avatar
VIEW  
unknown committed
1958
  if (first)
1959
  {
unknown's avatar
VIEW  
unknown committed
1960 1961
    if ((first->next_global= query_tables))
      query_tables->prev_global= &first->next_global;
1962 1963
    else
      query_tables_last= &first->next_global;
unknown's avatar
VIEW  
unknown committed
1964 1965 1966 1967 1968
    query_tables= first;

    if (link_to_local)
    {
      first->next_local= (TABLE_LIST*) select_lex.table_list.first;
1969
      select_lex.table_list.first=
unknown's avatar
unknown committed
1970
        (byte*) (select_lex.context.table_list= first);
unknown's avatar
VIEW  
unknown committed
1971 1972 1973 1974 1975 1976
      select_lex.table_list.elements++;	//safety
    }
  }
}


1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008

/*
  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;
2009 2010
  if (sroutines.records)
    my_hash_reset(&sroutines);
2011 2012 2013
}


unknown's avatar
VIEW  
unknown committed
2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024
/*
  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
2025
  if (!thd->current_arena->is_conventional() && first_execution)
unknown's avatar
VIEW  
unknown committed
2026 2027
  {
    first_execution= 0;
2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042
    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);
      }
    }
2043 2044 2045
  }
}

unknown's avatar
unknown committed
2046
/*
unknown's avatar
VIEW  
unknown committed
2047
  There are st_select_lex::add_table_to_list &
unknown's avatar
unknown committed
2048
  st_select_lex::set_lock_for_tables are in sql_parse.cc
unknown's avatar
unknown committed
2049

unknown's avatar
VIEW  
unknown committed
2050
  st_select_lex::print is in sql_select.cc
unknown's avatar
unknown committed
2051 2052

  st_select_lex_unit::prepare, st_select_lex_unit::exec,
2053 2054
  st_select_lex_unit::cleanup, st_select_lex_unit::reinit_exec_mechanism,
  st_select_lex_unit::change_result
unknown's avatar
unknown committed
2055
  are in sql_union.cc
unknown's avatar
unknown committed
2056
*/
2057