sql_lex.cc 60.6 KB
Newer Older
unknown's avatar
unknown committed
1
/* Copyright (C) 2000-2006 MySQL AB
unknown's avatar
unknown committed
2

unknown's avatar
unknown committed
3 4
   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
unknown's avatar
unknown committed
5
   the Free Software Foundation; version 2 of the License.
unknown's avatar
unknown committed
6

unknown's avatar
unknown committed
7 8 9 10
   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
11

unknown's avatar
unknown committed
12 13 14 15 16 17 18
   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 */

19
#define MYSQL_LEX 1
unknown's avatar
unknown committed
20 21 22 23
#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
/*
  We are using pointer to this variable for distinguishing between assignment
  to NEW row field (when parsing trigger definition) and structured variable.
*/
31 32

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

unknown's avatar
unknown committed
34 35
/* Macros to look like lex */

36 37 38 39 40 41 42
#define yyGet()         ((uchar) *(lip->ptr++))
#define yyGetLast()     ((uchar) lip->ptr[-1])
#define yyPeek()        ((uchar) lip->ptr[0])
#define yyPeek2()       ((uchar) lip->ptr[1])
#define yyUnget()	lip->ptr--
#define yySkip()	lip->ptr++
#define yyLength()	((uint) (lip->ptr - lip->tok_start)-1)
unknown's avatar
unknown committed
43

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

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

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

72 73 74 75 76 77 78 79 80 81 82
/* 
  Names of the index hints (for error messages). Keep in sync with 
  index_hint_type 
*/

const char * index_hint_type_name[] =
{
  "IGNORE INDEX", 
  "USE INDEX", 
  "FORCE INDEX"
};
83

unknown's avatar
unknown committed
84 85 86 87 88 89 90
inline int lex_casecmp(const char *s, const char *t, uint len)
{
  while (len-- != 0 &&
	 to_upper_lex[(uchar) *s++] == to_upper_lex[(uchar) *t++]) ;
  return (int) len+1;
}

unknown's avatar
unknown committed
91
#include <lex_hash.h>
unknown's avatar
unknown committed
92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113


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

  DBUG_VOID_RETURN;
}


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


114 115 116 117 118 119 120 121 122
void
st_parsing_options::reset()
{
  allows_variable= TRUE;
  allows_select_into= TRUE;
  allows_select_procedure= TRUE;
  allows_derived= TRUE;
}

123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144
Lex_input_stream::Lex_input_stream(THD *thd,
                                   const char* buffer,
                                   unsigned int length)
: m_thd(thd),
  yylineno(1),
  yytoklen(0),
  yylval(NULL),
  ptr(buffer),
  tok_start(NULL),
  tok_end(NULL),
  end_of_query(buffer + length),
  tok_start_prev(NULL),
  buf(buffer),
  next_state(MY_LEX_START),
  found_semicolon(NULL),
  ignore_space(test(thd->variables.sql_mode & MODE_IGNORE_SPACE))
{
}

Lex_input_stream::~Lex_input_stream()
{}

145

146 147 148 149 150 151
/*
  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)
*/

152
void lex_start(THD *thd)
unknown's avatar
unknown committed
153
{
unknown's avatar
unknown committed
154
  LEX *lex= thd->lex;
unknown's avatar
unknown committed
155 156 157 158
  DBUG_ENTER("lex_start");

  lex->thd= lex->unit.thd= thd;

unknown's avatar
unknown committed
159
  lex->context_stack.empty();
160 161
  lex->unit.init_query();
  lex->unit.init_select();
unknown's avatar
unknown committed
162 163
  /* 'parent_lex' is used in init_query() so it must be before it. */
  lex->select_lex.parent_lex= lex;
164 165
  lex->select_lex.init_query();
  lex->value_list.empty();
unknown's avatar
unknown committed
166
  lex->update_list.empty();
167
  lex->param_list.empty();
unknown's avatar
unknown committed
168
  lex->view_list.empty();
169
  lex->prepared_stmt_params.empty();
170
  lex->auxiliary_table_list.empty();
171 172 173 174 175 176 177 178 179 180
  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;
181
  lex->select_lex.sql_cache= SELECT_LEX::SQL_CACHE_UNSPECIFIED;
unknown's avatar
unknown committed
182 183
  lex->select_lex.init_order();
  lex->select_lex.group_list.empty();
184
  lex->describe= 0;
unknown's avatar
unknown committed
185
  lex->subqueries= FALSE;
unknown's avatar
unknown committed
186
  lex->view_prepare_mode= FALSE;
187
  lex->stmt_prepare_mode= FALSE;
unknown's avatar
unknown committed
188
  lex->derived_tables= 0;
189 190
  lex->lock_option= TL_READ;
  lex->safe_to_cache_query= 1;
191
  lex->leaf_tables_insert= 0;
192
  lex->parsing_options.reset();
unknown's avatar
unknown committed
193
  lex->empty_field_list_on_rset= 0;
194
  lex->select_lex.select_number= 1;
unknown's avatar
unknown committed
195
  lex->in_comment=0;
unknown's avatar
unknown committed
196
  lex->length=0;
197
  lex->part_info= 0;
unknown's avatar
unknown committed
198 199
  lex->select_lex.in_sum_expr=0;
  lex->select_lex.expr_list.empty();
unknown's avatar
unknown committed
200
  lex->select_lex.ftfunc_list_alloc.empty();
201
  lex->select_lex.ftfunc_list= &lex->select_lex.ftfunc_list_alloc;
unknown's avatar
unknown committed
202 203
  lex->select_lex.group_list.empty();
  lex->select_lex.order_list.empty();
204
  lex->sql_command= SQLCOM_END;
205
  lex->duplicates= DUP_ERROR;
206
  lex->ignore= 0;
unknown's avatar
unknown committed
207
  lex->spname= NULL;
208 209
  lex->sphead= NULL;
  lex->spcont= NULL;
unknown's avatar
unknown committed
210
  lex->proc_list.first= 0;
unknown's avatar
unknown committed
211
  lex->escape_used= FALSE;
212
  lex->reset_query_tables_list(FALSE);
213
  lex->expr_allows_subselect= TRUE;
214

215 216
  lex->name.str= 0;
  lex->name.length= 0;
unknown's avatar
unknown committed
217
  lex->event_parse_data= NULL;
218

unknown's avatar
unknown committed
219 220 221
  lex->nest_level=0 ;
  lex->allow_sum_func= 0;
  lex->in_sum_func= NULL;
unknown's avatar
unknown committed
222 223 224 225 226 227 228 229 230 231 232 233 234 235 236
  /*
    ok, there must be a better solution for this, long-term
    I tried "bzero" in the sql_yacc.yy code, but that for
    some reason made the values zero, even if they were set
  */
  lex->server_options.server_name= 0;
  lex->server_options.server_name_length= 0;
  lex->server_options.host= 0;
  lex->server_options.db= 0;
  lex->server_options.username= 0;
  lex->server_options.password= 0;
  lex->server_options.scheme= 0;
  lex->server_options.socket= 0;
  lex->server_options.owner= 0;
  lex->server_options.port= -1;
unknown's avatar
unknown committed
237
  DBUG_VOID_RETURN;
unknown's avatar
unknown committed
238 239 240 241
}

void lex_end(LEX *lex)
{
unknown's avatar
unknown committed
242
  DBUG_ENTER("lex_end");
unknown's avatar
unknown committed
243
  DBUG_PRINT("enter", ("lex: 0x%lx", (long) lex));
unknown's avatar
unknown committed
244 245 246 247 248 249 250 251
  if (lex->yacc_yyss)
  {
    my_free(lex->yacc_yyss, MYF(0));
    my_free(lex->yacc_yyvs, MYF(0));
    lex->yacc_yyss= 0;
    lex->yacc_yyvs= 0;
  }
  DBUG_VOID_RETURN;
unknown's avatar
unknown committed
252 253 254
}


255
static int find_keyword(Lex_input_stream *lip, uint len, bool function)
unknown's avatar
unknown committed
256
{
257
  const char *tok= lip->tok_start;
unknown's avatar
unknown committed
258

259
  SYMBOL *symbol= get_hash_symbol(tok, len, function);
unknown's avatar
unknown committed
260 261
  if (symbol)
  {
262 263 264 265
    lip->yylval->symbol.symbol=symbol;
    lip->yylval->symbol.str= (char*) tok;
    lip->yylval->symbol.length=len;

266
    if ((symbol->tok == NOT_SYM) &&
267
        (lip->m_thd->variables.sql_mode & MODE_HIGH_NOT_PRECEDENCE))
268 269
      return NOT2_SYM;
    if ((symbol->tok == OR_OR_SYM) &&
270
	!(lip->m_thd->variables.sql_mode & MODE_PIPES_AS_CONCAT))
271
      return OR2_SYM;
272

unknown's avatar
unknown committed
273 274 275 276 277
    return symbol->tok;
  }
  return 0;
}

278 279 280 281 282
/*
  Check if name is a keyword

  SYNOPSIS
    is_keyword()
283
    name      checked name (must not be empty)
284 285 286 287 288 289 290 291 292
    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)
{
293
  DBUG_ASSERT(len != 0);
294 295
  return get_hash_symbol(name,len,0)!=0;
}
unknown's avatar
unknown committed
296

297 298 299 300 301 302
bool is_lex_native_function(const LEX_STRING *name)
{
  DBUG_ASSERT(name != NULL);
  return (get_hash_symbol(name->str, name->length, 1) != 0);
}

unknown's avatar
unknown committed
303 304
/* make a copy of token before ptr and set yytoklen */

305
static LEX_STRING get_token(Lex_input_stream *lip, uint skip, uint length)
unknown's avatar
unknown committed
306 307 308
{
  LEX_STRING tmp;
  yyUnget();			// ptr points now after last token char
309
  tmp.length=lip->yytoklen=length;
310
  tmp.str= lip->m_thd->strmake(lip->tok_start + skip, tmp.length);
unknown's avatar
unknown committed
311 312 313
  return tmp;
}

314 315 316 317 318 319 320
/* 
 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)
*/

321
static LEX_STRING get_quoted_token(Lex_input_stream *lip,
322
                                   uint skip,
323
                                   uint length, char quote)
324 325
{
  LEX_STRING tmp;
326 327
  const char *from, *end;
  char *to;
328
  yyUnget();			// ptr points now after last token char
329 330
  tmp.length= lip->yytoklen=length;
  tmp.str=(char*) lip->m_thd->alloc(tmp.length+1);
331 332
  from= lip->tok_start + skip
  to= tmp.str;
333 334
  end= to+length;
  for ( ; to != end; )
335
  {
336
    if ((*to++= *from++) == quote)
337 338 339 340 341 342 343 344 345 346 347
      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
348

349
static char *get_text(Lex_input_stream *lip)
unknown's avatar
unknown committed
350 351 352
{
  reg1 uchar c,sep;
  uint found_escape=0;
353
  CHARSET_INFO *cs= lip->m_thd->charset();
unknown's avatar
unknown committed
354 355

  sep= yyGetLast();			// String should end with this
356
  while (lip->ptr != lip->end_of_query)
unknown's avatar
unknown committed
357 358 359
  {
    c = yyGet();
#ifdef USE_MB
360 361 362
    {
      int l;
      if (use_mb(cs) &&
363 364
          (l = my_ismbchar(cs, lip->ptr-1, lip->end_of_query))) {
	lip->ptr += l-1;
unknown's avatar
unknown committed
365
	continue;
366
      }
unknown's avatar
unknown committed
367 368
    }
#endif
369
    if (c == '\\' &&
370
        !(lip->m_thd->variables.sql_mode & MODE_NO_BACKSLASH_ESCAPES))
unknown's avatar
unknown committed
371 372
    {					// Escaped character
      found_escape=1;
373
      if (lip->ptr == lip->end_of_query)
unknown's avatar
unknown committed
374
	return 0;
375
      yySkip();
unknown's avatar
unknown committed
376 377 378 379 380 381 382 383 384 385 386 387
    }
    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 */
388 389
      const char *str, *end;
      char *start;
unknown's avatar
unknown committed
390

391 392 393
      str=lip->tok_start+1;
      end=lip->ptr-1;
      if (!(start= (char*) lip->m_thd->alloc((uint) (end-str)+1)))
unknown's avatar
unknown committed
394
	return (char*) "";		// Sql_alloc has set error flag
unknown's avatar
unknown committed
395 396
      if (!found_escape)
      {
397 398 399
	lip->yytoklen=(uint) (end-str);
	memcpy(start,str,lip->yytoklen);
	start[lip->yytoklen]=0;
unknown's avatar
unknown committed
400 401 402
      }
      else
      {
403
        char *to;
404

unknown's avatar
unknown committed
405 406 407 408
	for (to=start ; str != end ; str++)
	{
#ifdef USE_MB
	  int l;
unknown's avatar
unknown committed
409
	  if (use_mb(cs) &&
410
              (l = my_ismbchar(cs, str, end))) {
unknown's avatar
unknown committed
411 412 413 414 415 416
	      while (l--)
		  *to++ = *str++;
	      str--;
	      continue;
	  }
#endif
417
	  if (!(lip->m_thd->variables.sql_mode & MODE_NO_BACKSLASH_ESCAPES) &&
418
              *str == '\\' && str+1 != end)
unknown's avatar
unknown committed
419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443
	  {
	    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:
444
              *to++= *str;
unknown's avatar
unknown committed
445 446 447
	      break;
	    }
	  }
448 449
	  else if (*str == sep)
	    *to++= *str++;		// Two ' or "
unknown's avatar
unknown committed
450 451 452 453
	  else
	    *to++ = *str;
	}
	*to=0;
454
	lip->yytoklen=(uint) (to-start);
unknown's avatar
unknown committed
455
      }
456
      return start;
unknown's avatar
unknown committed
457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477
    }
  }
  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
478 479
static const char *unsigned_longlong_str="18446744073709551615";
static const uint unsigned_longlong_len=20;
unknown's avatar
unknown committed
480

unknown's avatar
unknown committed
481
static inline uint int_token(const char *str,uint length)
unknown's avatar
unknown committed
482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515
{
  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
516
      return DECIMAL_NUM;
unknown's avatar
unknown committed
517 518 519 520
    else
    {
      cmp=signed_longlong_str+1;
      smaller=LONG_NUM;				// If <= signed_longlong_str
unknown's avatar
unknown committed
521
      bigger=DECIMAL_NUM;
unknown's avatar
unknown committed
522 523 524 525 526 527 528 529 530 531 532 533 534
    }
  }
  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
535 536
    {
      if (length > unsigned_longlong_len)
unknown's avatar
unknown committed
537
        return DECIMAL_NUM;
unknown's avatar
unknown committed
538 539
      cmp=unsigned_longlong_str;
      smaller=ULONGLONG_NUM;
unknown's avatar
unknown committed
540
      bigger=DECIMAL_NUM;
unknown's avatar
unknown committed
541
    }
unknown's avatar
unknown committed
542 543 544 545
    else
    {
      cmp=longlong_str;
      smaller=LONG_NUM;
546
      bigger= ULONGLONG_NUM;
unknown's avatar
unknown committed
547 548 549 550 551 552
    }
  }
  while (*cmp && *cmp++ == *str++) ;
  return ((uchar) str[-1] <= (uchar) cmp[-1]) ? smaller : bigger;
}

553
/*
554
  MYSQLlex remember the following states from the following MYSQLlex()
555 556 557 558 559

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

561
int MYSQLlex(void *arg, void *yythd)
unknown's avatar
unknown committed
562 563
{
  reg1	uchar c;
564
  int	tokval, result_state;
unknown's avatar
unknown committed
565
  uint length;
unknown's avatar
unknown committed
566
  enum my_lex_states state;
567 568 569
  THD *thd= (THD *)yythd;
  Lex_input_stream *lip= thd->m_lip;
  LEX *lex= thd->lex;
unknown's avatar
unknown committed
570
  YYSTYPE *yylval=(YYSTYPE*) arg;
571
  CHARSET_INFO *cs= thd->charset();
572 573
  uchar *state_map= cs->state_map;
  uchar *ident_map= cs->ident_map;
unknown's avatar
unknown committed
574

575
  lip->yylval=yylval;			// The global state
576

577
  lip->tok_start_prev= lip->tok_start;
578

579 580 581
  lip->tok_start=lip->tok_end=lip->ptr;
  state=lip->next_state;
  lip->next_state=MY_LEX_OPERATOR_OR_IDENT;
unknown's avatar
unknown committed
582 583 584
  LINT_INIT(c);
  for (;;)
  {
585
    switch (state) {
586 587
    case MY_LEX_OPERATOR_OR_IDENT:	// Next is operator or keyword
    case MY_LEX_START:			// Start of token
588
      // Skip startspace
589
      for (c=yyGet() ; (state_map[c] == MY_LEX_SKIP) ; c= yyGet())
unknown's avatar
unknown committed
590 591
      {
	if (c == '\n')
592
	  lip->yylineno++;
unknown's avatar
unknown committed
593
      }
594
      lip->tok_start=lip->ptr-1;	// Start of real token
595
      state= (enum my_lex_states) state_map[c];
unknown's avatar
unknown committed
596
      break;
597
    case MY_LEX_ESCAPE:
unknown's avatar
unknown committed
598 599 600 601 602 603
      if (yyGet() == 'N')
      {					// Allow \N as shortcut for NULL
	yylval->lex_str.str=(char*) "\\N";
	yylval->lex_str.length=2;
	return NULL_SYM;
      }
604 605
    case MY_LEX_CHAR:			// Unknown or single char token
    case MY_LEX_SKIP:			// This should not happen
606 607 608 609 610 611 612
      if (c == '-' && yyPeek() == '-' &&
          (my_isspace(cs,yyPeek2()) || 
           my_iscntrl(cs,yyPeek2())))
      {
        state=MY_LEX_COMMENT;
        break;
      }
613
      yylval->lex_str.str=(char*) (lip->ptr=lip->tok_start);// Set to first chr
unknown's avatar
unknown committed
614 615 616
      yylval->lex_str.length=1;
      c=yyGet();
      if (c != ')')
617
	lip->next_state= MY_LEX_START;	// Allow signed numbers
unknown's avatar
unknown committed
618
      if (c == ',')
619
	lip->tok_start=lip->ptr;	// Let tok_start point at next item
620 621 622 623 624 625
      /*
        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.
      */
626
      else if (c == '?' && lex->stmt_prepare_mode && !ident_map[yyPeek()])
627
        return(PARAM_MARKER);
unknown's avatar
unknown committed
628 629
      return((int) c);

unknown's avatar
unknown committed
630 631
    case MY_LEX_IDENT_OR_NCHAR:
      if (yyPeek() != '\'')
632
      {					
unknown's avatar
unknown committed
633 634 635
	state= MY_LEX_IDENT;
	break;
      }
636
      /* Found N'string' */
637
      lip->tok_start++;                 // Skip N
638
      yySkip();                         // Skip '
639
      if (!(yylval->lex_str.str = get_text(lip)))
unknown's avatar
unknown committed
640
      {
641 642
	state= MY_LEX_CHAR;             // Read char by char
	break;
unknown's avatar
unknown committed
643
      }
644
      yylval->lex_str.length= lip->yytoklen;
645
      return(NCHAR_STRING);
unknown's avatar
unknown committed
646

647
    case MY_LEX_IDENT_OR_HEX:
unknown's avatar
unknown committed
648
      if (yyPeek() == '\'')
649
      {					// Found x'hex-number'
650
	state= MY_LEX_HEX_NUMBER;
651 652
	break;
      }
unknown's avatar
unknown committed
653 654 655 656 657 658
    case MY_LEX_IDENT_OR_BIN:
      if (yyPeek() == '\'')
      {                                 // Found b'bin-number'
        state= MY_LEX_BIN_NUMBER;
        break;
      }
659
    case MY_LEX_IDENT:
660
      const char *start;
unknown's avatar
unknown committed
661
#if defined(USE_MB) && defined(USE_MB_IDENT)
662
      if (use_mb(cs))
unknown's avatar
unknown committed
663
      {
664
	result_state= IDENT_QUOTED;
665
        if (my_mbcharlen(cs, yyGetLast()) > 1)
unknown's avatar
unknown committed
666
        {
667
          int l = my_ismbchar(cs, lip->ptr-1, lip->end_of_query);
unknown's avatar
unknown committed
668
          if (l == 0) {
669
            state = MY_LEX_CHAR;
unknown's avatar
unknown committed
670 671
            continue;
          }
672
          lip->ptr += l - 1;
unknown's avatar
unknown committed
673
        }
unknown's avatar
unknown committed
674
        while (ident_map[c=yyGet()])
unknown's avatar
unknown committed
675
        {
676
          if (my_mbcharlen(cs, c) > 1)
unknown's avatar
unknown committed
677 678
          {
            int l;
679
            if ((l = my_ismbchar(cs, lip->ptr-1, lip->end_of_query)) == 0)
unknown's avatar
unknown committed
680
              break;
681
            lip->ptr += l-1;
unknown's avatar
unknown committed
682 683 684 685 686
          }
        }
      }
      else
#endif
687
      {
unknown's avatar
unknown committed
688 689 690
        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;
691
      }
692 693 694
      length= (uint) (lip->ptr - lip->tok_start)-1;
      start= lip->ptr;
      if (lip->ignore_space)
unknown's avatar
unknown committed
695
      {
unknown's avatar
unknown committed
696 697 698 699 700
        /*
          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
701
      }
702 703
      if (start == lip->ptr && c == '.' && ident_map[yyPeek()])
	lip->next_state=MY_LEX_IDENT_SEP;
unknown's avatar
unknown committed
704 705 706
      else
      {					// '(' must follow directly if function
	yyUnget();
707
	if ((tokval = find_keyword(lip, length,c == '(')))
unknown's avatar
unknown committed
708
	{
709
	  lip->next_state= MY_LEX_START;	// Allow signed numbers
unknown's avatar
unknown committed
710 711 712 713
	  return(tokval);		// Was keyword
	}
	yySkip();			// next state does a unget
      }
714
      yylval->lex_str=get_token(lip, 0, length);
715 716 717 718

      /* 
         Note: "SELECT _bla AS 'alias'"
         _bla should be considered as a IDENT if charset haven't been found.
719
         So we don't use MYF(MY_WME) with get_charset_by_csname to avoid 
720 721 722 723
         producing an error.
      */

      if ((yylval->lex_str.str[0]=='_') && 
724 725 726
          (lex->underscore_charset=
             get_charset_by_csname(yylval->lex_str.str + 1,
                                   MY_CS_PRIMARY,MYF(0))))
727
        return(UNDERSCORE_CHARSET);
728
      return(result_state);			// IDENT or IDENT_QUOTED
unknown's avatar
unknown committed
729

730
    case MY_LEX_IDENT_SEP:		// Found ident and now '.'
731
      yylval->lex_str.str=(char*) lip->ptr;
unknown's avatar
unknown committed
732 733
      yylval->lex_str.length=1;
      c=yyGet();			// should be '.'
734
      lip->next_state= MY_LEX_IDENT_START;// Next is an ident (not a keyword)
735
      if (!ident_map[yyPeek()])		// Probably ` or "
736
	lip->next_state= MY_LEX_START;
unknown's avatar
unknown committed
737 738
      return((int) c);

739 740
    case MY_LEX_NUMBER_IDENT:		// number or ident which num-start
      while (my_isdigit(cs,(c = yyGet()))) ;
unknown's avatar
unknown committed
741
      if (!ident_map[c])
unknown's avatar
unknown committed
742
      {					// Can't be identifier
743
	state=MY_LEX_INT_OR_REAL;
unknown's avatar
unknown committed
744 745 746 747
	break;
      }
      if (c == 'e' || c == 'E')
      {
unknown's avatar
unknown committed
748
	// The following test is written this way to allow numbers of type 1e1
749
	if (my_isdigit(cs,yyPeek()) || 
750
            (c=(yyGet())) == '+' || c == '-')
unknown's avatar
unknown committed
751
	{				// Allow 1E+10
752
	  if (my_isdigit(cs,yyPeek()))	// Number must have digit after sign
unknown's avatar
unknown committed
753 754
	  {
	    yySkip();
755
	    while (my_isdigit(cs,yyGet())) ;
756
	    yylval->lex_str=get_token(lip, 0, yyLength());
unknown's avatar
unknown committed
757 758 759 760 761
	    return(FLOAT_NUM);
	  }
	}
	yyUnget(); /* purecov: inspected */
      }
762 763
      else if (c == 'x' && (lip->ptr - lip->tok_start) == 2 &&
	  lip->tok_start[0] == '0' )
unknown's avatar
unknown committed
764
      {						// Varbinary
765
	while (my_isxdigit(cs,(c = yyGet()))) ;
766
	if ((lip->ptr - lip->tok_start) >= 4 && !ident_map[c])
unknown's avatar
unknown committed
767
	{
768 769
          /* skip '0x' */
	  yylval->lex_str=get_token(lip, 2, yyLength()-2);
unknown's avatar
unknown committed
770 771 772 773
	  return (HEX_NUM);
	}
	yyUnget();
      }
774 775
      else if (c == 'b' && (lip->ptr - lip->tok_start) == 2 &&
               lip->tok_start[0] == '0' )
unknown's avatar
unknown committed
776 777
      {						// b'bin-number'
	while (my_isxdigit(cs,(c = yyGet()))) ;
778
	if ((lip->ptr - lip->tok_start) >= 4 && !ident_map[c])
unknown's avatar
unknown committed
779
	{
780 781
          /* Skip '0b' */
	  yylval->lex_str= get_token(lip, 2, yyLength()-2);
unknown's avatar
unknown committed
782 783 784 785
	  return (BIN_NUM);
	}
	yyUnget();
      }
unknown's avatar
unknown committed
786
      // fall through
787
    case MY_LEX_IDENT_START:			// We come here after '.'
788
      result_state= IDENT;
unknown's avatar
unknown committed
789
#if defined(USE_MB) && defined(USE_MB_IDENT)
790
      if (use_mb(cs))
unknown's avatar
unknown committed
791
      {
792
	result_state= IDENT_QUOTED;
unknown's avatar
unknown committed
793
        while (ident_map[c=yyGet()])
unknown's avatar
unknown committed
794
        {
795
          if (my_mbcharlen(cs, c) > 1)
unknown's avatar
unknown committed
796 797
          {
            int l;
798
            if ((l = my_ismbchar(cs, lip->ptr-1, lip->end_of_query)) == 0)
unknown's avatar
unknown committed
799
              break;
800
            lip->ptr += l-1;
unknown's avatar
unknown committed
801 802 803 804 805
          }
        }
      }
      else
#endif
unknown's avatar
unknown committed
806 807 808 809 810
      {
        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
811
      if (c == '.' && ident_map[yyPeek()])
812
	lip->next_state=MY_LEX_IDENT_SEP;// Next is '.'
unknown's avatar
unknown committed
813

814
      yylval->lex_str= get_token(lip, 0, yyLength());
815
      return(result_state);
unknown's avatar
unknown committed
816

817
    case MY_LEX_USER_VARIABLE_DELIMITER:	// Found quote char
818
    {
819 820
      uint double_quotes= 0;
      char quote_char= c;                       // Used char
821
      while ((c=yyGet()))
unknown's avatar
unknown committed
822
      {
823 824
	int var_length;
	if ((var_length= my_mbcharlen(cs, c)) == 1)
825 826 827 828 829 830 831 832 833
	{
	  if (c == quote_char)
	  {
	    if (yyPeek() != quote_char)
	      break;
	    c=yyGet();
	    double_quotes++;
	    continue;
	  }
834 835
	}
#ifdef USE_MB
836
	else if (var_length < 1)
837
	  break;				// Error
838
	lip->ptr+= var_length-1;
839
#endif
unknown's avatar
unknown committed
840
      }
841
      if (double_quotes)
842 843
	yylval->lex_str=get_quoted_token(lip, 1,
                                         yyLength() - double_quotes -1,
844 845
					 quote_char);
      else
846
	yylval->lex_str=get_token(lip, 1, yyLength() -1);
847
      if (c == quote_char)
848
	yySkip();			// Skip end `
849
      lip->next_state= MY_LEX_START;
850
      return(IDENT_QUOTED);
851
    }
852
    case MY_LEX_INT_OR_REAL:		// Complete int or incomplete real
unknown's avatar
unknown committed
853 854
      if (c != '.')
      {					// Found complete integer number.
855
	yylval->lex_str=get_token(lip, 0, yyLength());
unknown's avatar
unknown committed
856 857 858
	return int_token(yylval->lex_str.str,yylval->lex_str.length);
      }
      // fall through
859 860
    case MY_LEX_REAL:			// Incomplete real number
      while (my_isdigit(cs,c = yyGet())) ;
unknown's avatar
unknown committed
861 862 863 864

      if (c == 'e' || c == 'E')
      {
	c = yyGet();
unknown's avatar
unknown committed
865
	if (c == '-' || c == '+')
866
	  c = yyGet();			// Skip sign
867
	if (!my_isdigit(cs,c))
unknown's avatar
unknown committed
868
	{				// No digit after sign
869
	  state= MY_LEX_CHAR;
unknown's avatar
unknown committed
870 871
	  break;
	}
872
	while (my_isdigit(cs,yyGet())) ;
873
	yylval->lex_str=get_token(lip, 0, yyLength());
unknown's avatar
unknown committed
874 875
	return(FLOAT_NUM);
      }
876
      yylval->lex_str=get_token(lip, 0, yyLength());
unknown's avatar
unknown committed
877
      return(DECIMAL_NUM);
unknown's avatar
unknown committed
878

879
    case MY_LEX_HEX_NUMBER:		// Found x'hexstring'
880
      yyGet();				// Skip '
881
      while (my_isxdigit(cs,(c = yyGet()))) ;
882
      length=(lip->ptr - lip->tok_start);	// Length of hexnum+3
883 884 885 886 887
      if (!(length & 1) || c != '\'')
      {
	return(ABORT_SYM);		// Illegal hex constant
      }
      yyGet();				// get_token makes an unget
888 889 890
      yylval->lex_str=get_token(lip,
                                2,          // skip x'
                                length-3);  // don't count x' and last '
891 892
      return (HEX_NUM);

unknown's avatar
unknown committed
893 894 895
    case MY_LEX_BIN_NUMBER:           // Found b'bin-string'
      yyGet();                                // Skip '
      while ((c= yyGet()) == '0' || c == '1');
896
      length= (lip->ptr - lip->tok_start);    // Length of bin-num + 3
unknown's avatar
unknown committed
897 898 899
      if (c != '\'')
      return(ABORT_SYM);              // Illegal hex constant
      yyGet();                        // get_token makes an unget
900 901 902 903
      yylval->lex_str= get_token(lip,
                                 2,         // skip b'
                                 length-3); // don't count b' and last '
      return (BIN_NUM);
unknown's avatar
unknown committed
904

905 906 907
    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
908
	yySkip();
909
      if ((tokval = find_keyword(lip, (uint) (lip->ptr - lip->tok_start),0)))
unknown's avatar
unknown committed
910
      {
911
	lip->next_state= MY_LEX_START;	// Allow signed numbers
unknown's avatar
unknown committed
912 913
	return(tokval);
      }
914
      state = MY_LEX_CHAR;		// Something fishy found
unknown's avatar
unknown committed
915 916
      break;

917 918 919
    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
920 921
      {
	yySkip();
922
	if (state_map[yyPeek()] == MY_LEX_CMP_OP)
unknown's avatar
unknown committed
923 924
	  yySkip();
      }
925
      if ((tokval = find_keyword(lip, (uint) (lip->ptr - lip->tok_start),0)))
unknown's avatar
unknown committed
926
      {
927
	lip->next_state= MY_LEX_START;	// Found long op
unknown's avatar
unknown committed
928 929
	return(tokval);
      }
930
      state = MY_LEX_CHAR;		// Something fishy found
unknown's avatar
unknown committed
931 932
      break;

933
    case MY_LEX_BOOL:
unknown's avatar
unknown committed
934 935
      if (c != yyPeek())
      {
936
	state=MY_LEX_CHAR;
unknown's avatar
unknown committed
937 938 939
	break;
      }
      yySkip();
940 941
      tokval = find_keyword(lip,2,0);	// Is a bool operator
      lip->next_state= MY_LEX_START;	// Allow signed numbers
unknown's avatar
unknown committed
942 943
      return(tokval);

944
    case MY_LEX_STRING_OR_DELIMITER:
945
      if (thd->variables.sql_mode & MODE_ANSI_QUOTES)
946
      {
947
	state= MY_LEX_USER_VARIABLE_DELIMITER;
948 949 950
	break;
      }
      /* " used for strings */
951
    case MY_LEX_STRING:			// Incomplete text string
952
      if (!(yylval->lex_str.str = get_text(lip)))
unknown's avatar
unknown committed
953
      {
954
	state= MY_LEX_CHAR;		// Read char by char
unknown's avatar
unknown committed
955 956
	break;
      }
957
      yylval->lex_str.length=lip->yytoklen;
unknown's avatar
unknown committed
958 959
      return(TEXT_STRING);

960
    case MY_LEX_COMMENT:			//  Comment
unknown's avatar
unknown committed
961
      lex->select_lex.options|= OPTION_FOUND_COMMENT;
unknown's avatar
unknown committed
962 963
      while ((c = yyGet()) != '\n' && c) ;
      yyUnget();			// Safety against eof
964
      state = MY_LEX_START;		// Try again
unknown's avatar
unknown committed
965
      break;
966
    case MY_LEX_LONG_COMMENT:		/* Long C comment? */
unknown's avatar
unknown committed
967 968
      if (yyPeek() != '*')
      {
969
	state=MY_LEX_CHAR;		// Probable division
unknown's avatar
unknown committed
970 971 972
	break;
      }
      yySkip();				// Skip '*'
unknown's avatar
unknown committed
973
      lex->select_lex.options|= OPTION_FOUND_COMMENT;
unknown's avatar
unknown committed
974 975 976 977
      if (yyPeek() == '!')		// MySQL command in comment
      {
	ulong version=MYSQL_VERSION_ID;
	yySkip();
978 979
	state=MY_LEX_START;
	if (my_isdigit(cs,yyPeek()))
unknown's avatar
unknown committed
980
	{				// Version number
981
	  version=strtol((char*) lip->ptr,(char**) &lip->ptr,10);
unknown's avatar
unknown committed
982 983 984 985 986 987 988
	}
	if (version <= MYSQL_VERSION_ID)
	{
	  lex->in_comment=1;
	  break;
	}
      }
989
      while (lip->ptr != lip->end_of_query &&
unknown's avatar
unknown committed
990 991 992
	     ((c=yyGet()) != '*' || yyPeek() != '/'))
      {
	if (c == '\n')
993
	  lip->yylineno++;
unknown's avatar
unknown committed
994
      }
995
      if (lip->ptr != lip->end_of_query)
unknown's avatar
unknown committed
996
	yySkip();			// remove last '/'
997
      state = MY_LEX_START;		// Try again
unknown's avatar
unknown committed
998
      break;
999
    case MY_LEX_END_LONG_COMMENT:
unknown's avatar
unknown committed
1000 1001 1002 1003
      if (lex->in_comment && yyPeek() == '/')
      {
	yySkip();
	lex->in_comment=0;
1004
	state=MY_LEX_START;
unknown's avatar
unknown committed
1005 1006
      }
      else
1007
	state=MY_LEX_CHAR;		// Return '*'
unknown's avatar
unknown committed
1008
      break;
1009
    case MY_LEX_SET_VAR:		// Check if ':='
unknown's avatar
unknown committed
1010 1011
      if (yyPeek() != '=')
      {
1012
	state=MY_LEX_CHAR;		// Return ':'
unknown's avatar
unknown committed
1013 1014 1015 1016
	break;
      }
      yySkip();
      return (SET_VAR);
1017
    case MY_LEX_SEMICOLON:			// optional line terminator
unknown's avatar
unknown committed
1018 1019
      if (yyPeek())
      {
1020
        if ((thd->client_capabilities & CLIENT_MULTI_STATEMENTS) && 
1021
            !lex->stmt_prepare_mode)
1022
        {
unknown's avatar
unknown committed
1023
	  lex->safe_to_cache_query= 0;
1024
          lip->found_semicolon= lip->ptr;
unknown's avatar
unknown committed
1025
          thd->server_status|= SERVER_MORE_RESULTS_EXISTS;
1026
          lip->next_state= MY_LEX_END;
unknown's avatar
unknown committed
1027
          return (END_OF_INPUT);
1028
        }
unknown's avatar
unknown committed
1029
        state= MY_LEX_CHAR;		// Return ';'
unknown's avatar
unknown committed
1030 1031 1032
	break;
      }
      /* fall true */
1033
    case MY_LEX_EOL:
1034
      if (lip->ptr >= lip->end_of_query)
unknown's avatar
unknown committed
1035
      {
1036
	lip->next_state=MY_LEX_END;	// Mark for next loop
unknown's avatar
unknown committed
1037 1038 1039 1040
	return(END_OF_INPUT);
      }
      state=MY_LEX_CHAR;
      break;
1041
    case MY_LEX_END:
1042
      lip->next_state=MY_LEX_END;
unknown's avatar
unknown committed
1043
      return(0);			// We found end of input last time
1044 1045
      
      /* Actually real shouldn't start with . but allow them anyhow */
1046 1047 1048
    case MY_LEX_REAL_OR_POINT:
      if (my_isdigit(cs,yyPeek()))
	state = MY_LEX_REAL;		// Real
unknown's avatar
unknown committed
1049 1050
      else
      {
1051 1052
	state= MY_LEX_IDENT_SEP;	// return '.'
	yyUnget();			// Put back '.'
unknown's avatar
unknown committed
1053 1054
      }
      break;
1055
    case MY_LEX_USER_END:		// end '@' of user@hostname
unknown's avatar
unknown committed
1056
      switch (state_map[yyPeek()]) {
1057 1058 1059
      case MY_LEX_STRING:
      case MY_LEX_USER_VARIABLE_DELIMITER:
      case MY_LEX_STRING_OR_DELIMITER:
unknown's avatar
unknown committed
1060
	break;
1061
      case MY_LEX_USER_END:
1062
	lip->next_state=MY_LEX_SYSTEM_VAR;
unknown's avatar
unknown committed
1063 1064
	break;
      default:
1065
	lip->next_state=MY_LEX_HOSTNAME;
unknown's avatar
unknown committed
1066 1067
	break;
      }
1068
      yylval->lex_str.str=(char*) lip->ptr;
unknown's avatar
unknown committed
1069 1070
      yylval->lex_str.length=1;
      return((int) '@');
1071 1072 1073
    case MY_LEX_HOSTNAME:		// end '@' of user@hostname
      for (c=yyGet() ; 
	   my_isalnum(cs,c) || c == '.' || c == '_' ||  c == '$';
unknown's avatar
unknown committed
1074
	   c= yyGet()) ;
1075
      yylval->lex_str=get_token(lip, 0, yyLength());
unknown's avatar
unknown committed
1076
      return(LEX_HOSTNAME);
1077
    case MY_LEX_SYSTEM_VAR:
1078
      yylval->lex_str.str=(char*) lip->ptr;
unknown's avatar
unknown committed
1079 1080
      yylval->lex_str.length=1;
      yySkip();					// Skip '@'
1081
      lip->next_state= (state_map[yyPeek()] ==
1082 1083 1084
			MY_LEX_USER_VARIABLE_DELIMITER ?
			MY_LEX_OPERATOR_OR_IDENT :
			MY_LEX_IDENT_OR_KEYWORD);
unknown's avatar
unknown committed
1085
      return((int) '@');
1086
    case MY_LEX_IDENT_OR_KEYWORD:
unknown's avatar
unknown committed
1087 1088 1089 1090 1091
      /*
	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
1092 1093 1094 1095 1096
      
      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
1097
      if (c == '.')
1098 1099
	lip->next_state=MY_LEX_IDENT_SEP;
      length= (uint) (lip->ptr - lip->tok_start)-1;
unknown's avatar
unknown committed
1100 1101
      if (length == 0) 
        return(ABORT_SYM);              // Names must be nonempty.
1102
      if ((tokval= find_keyword(lip, length,0)))
unknown's avatar
unknown committed
1103 1104 1105 1106
      {
	yyUnget();				// Put back 'c'
	return(tokval);				// Was keyword
      }
1107
      yylval->lex_str=get_token(lip, 0, length);
1108
      return(result_state);
unknown's avatar
unknown committed
1109 1110 1111
    }
  }
}
unknown's avatar
unknown committed
1112

1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128

/*
  Skip comment in the end of statement.

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

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

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

1129
const char *skip_rear_comments(const char *begin, const char *end)
1130 1131 1132 1133 1134 1135 1136
{
  while (begin < end && (end[-1] <= ' ' || end[-1] == '*' ||
                         end[-1] == '/' || end[-1] == ';'))
    end-= 1;
  return end;
}

unknown's avatar
unknown committed
1137 1138 1139 1140 1141 1142
/*
  st_select_lex structures initialisations
*/

void st_select_lex_node::init_query()
{
1143
  options= 0;
1144
  sql_cache= SQL_CACHE_UNSPECIFIED;
1145
  linkage= UNSPECIFIED_TYPE;
1146 1147
  no_error= no_table_names_allowed= 0;
  uncacheable= 0;
unknown's avatar
unknown committed
1148 1149 1150 1151 1152 1153 1154 1155 1156
}

void st_select_lex_node::init_select()
{
}

void st_select_lex_unit::init_query()
{
  st_select_lex_node::init_query();
1157
  linkage= GLOBAL_OPTIONS_TYPE;
unknown's avatar
unknown committed
1158
  global_parameters= first_select();
1159 1160
  select_limit_cnt= HA_POS_ERROR;
  offset_limit_cnt= 0;
1161
  union_distinct= 0;
unknown's avatar
unknown committed
1162
  prepared= optimized= executed= 0;
unknown's avatar
unknown committed
1163
  item= 0;
1164 1165
  union_result= 0;
  table= 0;
unknown's avatar
unknown committed
1166
  fake_select_lex= 0;
1167
  cleaned= 0;
1168
  item_list.empty();
1169
  describe= 0;
1170
  found_rows_for_union= 0;
unknown's avatar
unknown committed
1171 1172 1173 1174 1175
}

void st_select_lex::init_query()
{
  st_select_lex_node::init_query();
1176
  table_list.empty();
1177 1178
  top_join_list.empty();
  join_list= &top_join_list;
1179
  embedding= leaf_tables= 0;
unknown's avatar
unknown committed
1180
  item_list.empty();
unknown's avatar
unknown committed
1181
  join= 0;
1182
  having= prep_having= where= prep_where= 0;
1183
  olap= UNSPECIFIED_OLAP_TYPE;
1184
  having_fix_field= 0;
1185 1186
  context.select_lex= this;
  context.init();
unknown's avatar
unknown committed
1187 1188 1189
  /*
    Add the name resolution context of the current (sub)query to the
    stack of contexts for the whole query.
1190 1191 1192 1193 1194
    TODO:
    push_context may return an error if there is no memory for a new
    element in the stack, however this method has no return value,
    thus push_context should be moved to a place where query
    initialization is checked for failure.
unknown's avatar
unknown committed
1195 1196
  */
  parent_lex->push_context(&context);
1197
  cond_count= between_count= with_wild= 0;
1198
  conds_processed_with_permanent_arena= 0;
unknown's avatar
unknown committed
1199
  ref_pointer_array= 0;
unknown's avatar
unknown committed
1200
  select_n_where_fields= 0;
unknown's avatar
unknown committed
1201
  select_n_having_items= 0;
1202
  subquery_in_having= explicit_limit= 0;
1203
  is_item_list_lookup= 0;
1204
  first_execution= 1;
unknown's avatar
unknown committed
1205
  first_cond_optimization= 1;
1206
  parsing_place= NO_MATTER;
1207
  exclude_from_table_unique_test= no_wrap_view_item= FALSE;
unknown's avatar
unknown committed
1208
  nest_level= 0;
1209
  link_next= 0;
unknown's avatar
unknown committed
1210 1211 1212 1213 1214
}

void st_select_lex::init_select()
{
  st_select_lex_node::init_select();
1215
  group_list.empty();
unknown's avatar
unknown committed
1216
  type= db= 0;
1217 1218 1219
  having= 0;
  table_join_options= 0;
  in_sum_expr= with_wild= 0;
unknown's avatar
unknown committed
1220
  options= 0;
1221
  sql_cache= SQL_CACHE_UNSPECIFIED;
1222
  braces= 0;
unknown's avatar
unknown committed
1223
  expr_list.empty();
unknown's avatar
unknown committed
1224
  interval_list.empty();
unknown's avatar
unknown committed
1225
  ftfunc_list_alloc.empty();
unknown's avatar
unknown committed
1226
  inner_sum_func_list= 0;
unknown's avatar
unknown committed
1227
  ftfunc_list= &ftfunc_list_alloc;
unknown's avatar
unknown committed
1228
  linkage= UNSPECIFIED_TYPE;
unknown's avatar
unknown committed
1229 1230 1231
  order_list.elements= 0;
  order_list.first= 0;
  order_list.next= (byte**) &order_list.first;
1232 1233 1234
  /* 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
1235
  with_sum_func= 0;
1236
  is_correlated= 0;
1237 1238
  cur_pos_in_select_list= UNDEF_POS;
  non_agg_fields.empty();
1239
  cond_value= having_value= Item::COND_UNDEF;
1240
  inner_refs_list.empty();
unknown's avatar
unknown committed
1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254
}

/*
  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
1255
  slave= 0;
unknown's avatar
unknown committed
1256 1257
}

unknown's avatar
unknown committed
1258 1259
/*
  include on level down (but do not link)
unknown's avatar
unknown committed
1260

unknown's avatar
unknown committed
1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274
  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
1275 1276 1277 1278 1279 1280 1281 1282
/* 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
1283
  slave= 0;
unknown's avatar
unknown committed
1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297
}

/* 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
1298
  if (link_prev)
unknown's avatar
unknown committed
1299 1300 1301 1302
  {
    if ((*link_prev= link_next))
      link_next->link_prev= link_prev;
  }
1303 1304 1305 1306
  // Remove slave structure
  for (; slave; slave= slave->next)
    slave->fast_exclude();
  
unknown's avatar
unknown committed
1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326
}

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

1328 1329 1330 1331 1332 1333 1334 1335 1336 1337

/*
  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
1338 1339 1340
void st_select_lex_unit::exclude_level()
{
  SELECT_LEX_UNIT *units= 0, **units_last= &units;
unknown's avatar
unknown committed
1341
  for (SELECT_LEX *sl= first_select(); sl; sl= sl->next_select())
unknown's avatar
unknown committed
1342
  {
unknown's avatar
unknown committed
1343
    // unlink current level from global SELECTs list
unknown's avatar
unknown committed
1344 1345
    if (sl->link_prev && (*sl->link_prev= sl->link_next))
      sl->link_next->link_prev= sl->link_prev;
unknown's avatar
unknown committed
1346 1347

    // bring up underlay levels
unknown's avatar
unknown committed
1348 1349
    SELECT_LEX_UNIT **last= 0;
    for (SELECT_LEX_UNIT *u= sl->first_inner_unit(); u; u= u->next_unit())
unknown's avatar
unknown committed
1350 1351
    {
      u->master= master;
unknown's avatar
unknown committed
1352
      last= (SELECT_LEX_UNIT**)&(u->next);
unknown's avatar
unknown committed
1353
    }
unknown's avatar
unknown committed
1354 1355 1356 1357 1358 1359 1360 1361
    if (last)
    {
      (*units_last)= sl->first_inner_unit();
      units_last= last;
    }
  }
  if (units)
  {
unknown's avatar
unknown committed
1362
    // include brought up levels in place of current
unknown's avatar
unknown committed
1363 1364
    (*prev)= units;
    (*units_last)= (SELECT_LEX_UNIT*)next;
unknown's avatar
unknown committed
1365 1366 1367
    if (next)
      next->prev= (SELECT_LEX_NODE**)units_last;
    units->prev= prev;
unknown's avatar
unknown committed
1368 1369
  }
  else
unknown's avatar
unknown committed
1370 1371
  {
    // exclude currect unit from list of nodes
unknown's avatar
unknown committed
1372
    (*prev)= next;
unknown's avatar
unknown committed
1373 1374 1375
    if (next)
      next->prev= prev;
  }
unknown's avatar
unknown committed
1376 1377
}

1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388

/*
  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
1389
    // unlink current level from global SELECTs list
1390 1391 1392
    if (sl->link_prev && (*sl->link_prev= sl->link_next))
      sl->link_next->link_prev= sl->link_prev;

unknown's avatar
unknown committed
1393
    // unlink underlay levels
1394 1395 1396 1397 1398
    for (SELECT_LEX_UNIT *u= sl->first_inner_unit(); u; u= u->next_unit())
    {
      u->exclude_level();
    }
  }
unknown's avatar
unknown committed
1399
  // exclude currect unit from list of nodes
1400
  (*prev)= next;
unknown's avatar
unknown committed
1401 1402
  if (next)
    next->prev= prev;
1403 1404 1405
}


unknown's avatar
unknown committed
1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417
/*
  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
1418
void st_select_lex::mark_as_dependent(SELECT_LEX *last)
unknown's avatar
unknown committed
1419 1420 1421 1422 1423
{
  /*
    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
1424
  for (SELECT_LEX *s= this;
1425
       s && s != last;
unknown's avatar
unknown committed
1426
       s= s->outer_select())
1427
    if (!(s->uncacheable & UNCACHEABLE_DEPENDENT))
unknown's avatar
unknown committed
1428 1429
    {
      // Select is dependent of outer select
1430 1431
      s->uncacheable= (s->uncacheable & ~UNCACHEABLE_UNITED) |
                       UNCACHEABLE_DEPENDENT;
1432
      SELECT_LEX_UNIT *munit= s->master_unit();
1433 1434 1435 1436 1437 1438 1439 1440
      munit->uncacheable= (munit->uncacheable & ~UNCACHEABLE_UNITED) |
                       UNCACHEABLE_DEPENDENT;
      for (SELECT_LEX *sl= munit->first_select(); sl ; sl= sl->next_select())
      {
        if (sl != s &&
            !(sl->uncacheable & (UNCACHEABLE_DEPENDENT | UNCACHEABLE_UNITED)))
          sl->uncacheable|= UNCACHEABLE_UNITED;
      }
unknown's avatar
unknown committed
1441
    }
1442 1443
  is_correlated= TRUE;
  this->master_unit()->item->is_correlated= TRUE;
unknown's avatar
unknown committed
1444 1445
}

1446 1447 1448 1449 1450
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; }
1451
TABLE_LIST *st_select_lex_node::add_table_to_list (THD *thd, Table_ident *table,
1452
						  LEX_STRING *alias,
unknown's avatar
unknown committed
1453
						  ulong table_join_options,
1454
						  thr_lock_type flags,
1455
						  List<index_hint> *hints,
unknown's avatar
unknown committed
1456
                                                  LEX_STRING *option)
1457 1458 1459
{
  return 0;
}
unknown's avatar
unknown committed
1460 1461 1462 1463 1464 1465 1466 1467
ulong st_select_lex_node::get_table_join_options()
{
  return 0;
}

/*
  prohibit using LIMIT clause
*/
unknown's avatar
unknown committed
1468
bool st_select_lex::test_limit()
unknown's avatar
unknown committed
1469
{
1470
  if (select_limit != 0)
unknown's avatar
unknown committed
1471 1472
  {
    my_error(ER_NOT_SUPPORTED_YET, MYF(0),
unknown's avatar
unknown committed
1473
             "LIMIT & IN/ALL/ANY/SOME subquery");
unknown's avatar
unknown committed
1474 1475 1476 1477 1478 1479
    return(1);
  }
  // no sense in ORDER BY without LIMIT
  order_list.empty();
  return(0);
}
1480

1481

1482 1483 1484 1485 1486
st_select_lex_unit* st_select_lex_unit::master_unit()
{
    return this;
}

1487

1488 1489 1490 1491 1492
st_select_lex* st_select_lex_unit::outer_select()
{
  return (st_select_lex*) master;
}

1493

unknown's avatar
unknown committed
1494
bool st_select_lex::add_order_to_list(THD *thd, Item *item, bool asc)
unknown's avatar
unknown committed
1495
{
unknown's avatar
unknown committed
1496
  return add_to_list(thd, order_list, item, asc);
unknown's avatar
unknown committed
1497
}
1498

1499

unknown's avatar
unknown committed
1500
bool st_select_lex::add_item_to_list(THD *thd, Item *item)
1501
{
1502
  DBUG_ENTER("st_select_lex::add_item_to_list");
unknown's avatar
unknown committed
1503
  DBUG_PRINT("info", ("Item: 0x%lx", (long) item));
1504
  DBUG_RETURN(item_list.push_back(item));
1505 1506
}

1507

unknown's avatar
unknown committed
1508
bool st_select_lex::add_group_to_list(THD *thd, Item *item, bool asc)
1509
{
unknown's avatar
unknown committed
1510
  return add_to_list(thd, group_list, item, asc);
1511 1512
}

1513

1514 1515 1516 1517 1518
bool st_select_lex::add_ftfunc_to_list(Item_func_match *func)
{
  return !func || ftfunc_list->push_back(func); // end of memory?
}

1519

1520 1521 1522 1523 1524
st_select_lex_unit* st_select_lex::master_unit()
{
  return (st_select_lex_unit*) master;
}

1525

1526 1527 1528 1529 1530
st_select_lex* st_select_lex::outer_select()
{
  return (st_select_lex*) master->get_master();
}

1531

1532 1533 1534 1535 1536 1537
bool st_select_lex::set_braces(bool value)
{
  braces= value;
  return 0; 
}

1538

1539 1540 1541 1542 1543 1544
bool st_select_lex::inc_in_sum_expr()
{
  in_sum_expr++;
  return 0;
}

1545

1546 1547 1548 1549 1550
uint st_select_lex::get_in_sum_expr()
{
  return in_sum_expr;
}

1551

1552 1553 1554 1555 1556 1557 1558 1559 1560 1561
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;
}

unknown's avatar
unknown committed
1562 1563 1564 1565 1566
ulong st_select_lex::get_table_join_options()
{
  return table_join_options;
}

1567

unknown's avatar
unknown committed
1568 1569 1570 1571
bool st_select_lex::setup_ref_array(THD *thd, uint order_group_num)
{
  if (ref_pointer_array)
    return 0;
1572 1573 1574 1575 1576

  /*
    We have to create array in prepared statement memory if it is
    prepared statement
  */
unknown's avatar
unknown committed
1577
  Query_arena *arena= thd->stmt_arena;
unknown's avatar
unknown committed
1578
  return (ref_pointer_array=
1579 1580 1581
          (Item **)arena->alloc(sizeof(Item*) * (n_child_sum_items +
                                                 item_list.elements +
                                                 select_n_having_items +
unknown's avatar
unknown committed
1582
                                                 select_n_where_fields +
1583
                                                 order_group_num)*5)) == 0;
unknown's avatar
unknown committed
1584 1585
}

1586

unknown's avatar
unknown committed
1587 1588
void st_select_lex_unit::print(String *str)
{
1589
  bool union_all= !union_distinct;
unknown's avatar
unknown committed
1590 1591 1592 1593
  for (SELECT_LEX *sl= first_select(); sl; sl= sl->next_select())
  {
    if (sl != first_select())
    {
1594
      str->append(STRING_WITH_LEN(" union "));
1595
      if (union_all)
1596
	str->append(STRING_WITH_LEN("all "));
1597
      else if (union_distinct == sl)
1598
        union_all= TRUE;
unknown's avatar
unknown committed
1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609
    }
    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)
    {
1610
      str->append(STRING_WITH_LEN(" order by "));
unknown's avatar
unknown committed
1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623
      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)
  {
1624 1625 1626
    if (order->counter_used)
    {
      char buffer[20];
unknown's avatar
unknown committed
1627 1628
      uint length= my_snprintf(buffer, 20, "%d", order->counter);
      str->append(buffer, length);
1629 1630 1631
    }
    else
      (*order->item)->print(str);
unknown's avatar
unknown committed
1632
    if (!order->asc)
1633
      str->append(STRING_WITH_LEN(" desc"));
unknown's avatar
unknown committed
1634 1635 1636 1637 1638
    if (order->next)
      str->append(',');
  }
}
 
1639

unknown's avatar
unknown committed
1640 1641
void st_select_lex::print_limit(THD *thd, String *str)
{
1642 1643 1644
  SELECT_LEX_UNIT *unit= master_unit();
  Item_subselect *item= unit->item;
  if (item && unit->global_parameters == this &&
unknown's avatar
VIEW  
unknown committed
1645 1646 1647 1648
      (item->substype() == Item_subselect::EXISTS_SUBS ||
       item->substype() == Item_subselect::IN_SUBS ||
       item->substype() == Item_subselect::ALL_SUBS))
  {
1649 1650
    DBUG_ASSERT(!item->fixed ||
                select_limit->val_int() == LL(1) && offset_limit == 0);
unknown's avatar
VIEW  
unknown committed
1651 1652 1653
    return;
  }

1654
  if (explicit_limit)
unknown's avatar
unknown committed
1655
  {
1656
    str->append(STRING_WITH_LEN(" limit "));
unknown's avatar
unknown committed
1657 1658
    if (offset_limit)
    {
1659
      offset_limit->print(str);
unknown's avatar
unknown committed
1660 1661
      str->append(',');
    }
1662
    select_limit->print(str);
unknown's avatar
unknown committed
1663 1664 1665
  }
}

1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689
/**
  @brief Restore the LEX and THD in case of a parse error.

  This is a clean up call that is invoked by the Bison generated
  parser before returning an error from MYSQLparse. If your
  semantic actions manipulate with the global thread state (which
  is a very bad practice and should not normally be employed) and
  need a clean-up in case of error, and you can not use %destructor
  rule in the grammar file itself, this function should be used
  to implement the clean up.
*/

void st_lex::cleanup_lex_after_parse_error(THD *thd)
{
  /*
    Delete sphead for the side effect of restoring of the original
    LEX state, thd->lex, thd->mem_root and thd->free_list if they
    were replaced when parsing stored procedure statements.  We
    will never use sphead object after a parse error, so it's okay
    to delete it only for the sake of the side effect.
    TODO: make this functionality explicit in sp_head class.
    Sic: we must nullify the member of the main lex, not the
    current one that will be thrown away
  */
1690
  if (thd->lex->sphead)
1691 1692 1693 1694 1695
  {
    delete thd->lex->sphead;
    thd->lex->sphead= NULL;
  }
}
unknown's avatar
VIEW  
unknown committed
1696

1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720
/*
  Initialize (or reset) Query_tables_list object.

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

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

void Query_tables_list::reset_query_tables_list(bool init)
{
  query_tables= 0;
  query_tables_last= &query_tables;
  query_tables_own_last= 0;
  if (init)
1721 1722 1723 1724 1725 1726 1727
  {
    /*
      We delay real initialization of hash (and therefore related
      memory allocation) until first insertion into this hash.
    */
    hash_clear(&sroutines);
  }
1728
  else if (sroutines.records)
1729 1730
  {
    /* Non-zero sroutines.records means that hash was initialized. */
1731
    my_hash_reset(&sroutines);
1732
  }
1733 1734 1735
  sroutines_list.empty();
  sroutines_list_own_last= sroutines_list.next;
  sroutines_list_own_elements= 0;
unknown's avatar
unknown committed
1736
  binlog_row_based_if_mixed= FALSE;
1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752
}


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

  SYNOPSIS
    destroy_query_tables_list()
*/

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


1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767
/*
  Initialize LEX object.

  SYNOPSIS
    st_lex::st_lex()

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

st_lex::st_lex()
unknown's avatar
unknown committed
1768
  :result(0), yacc_yyss(0), yacc_yyvs(0),
1769
   sql_command(SQLCOM_END)
1770
{
1771
  reset_query_tables_list(TRUE);
1772 1773 1774
}


unknown's avatar
VIEW  
unknown committed
1775
/*
1776
  Check whether the merging algorithm can be used on this VIEW
unknown's avatar
VIEW  
unknown committed
1777 1778 1779 1780

  SYNOPSIS
    st_lex::can_be_merged()

1781
  DESCRIPTION
1782 1783 1784
    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,
1785 1786 1787
    HAVING clause, aggregate functions, DISTINCT clause, LIMIT clause and
    several underlying tables.

unknown's avatar
VIEW  
unknown committed
1788 1789 1790 1791 1792 1793 1794 1795 1796 1797
  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 */
1798 1799 1800
  bool selects_allow_merge= select_lex.next_select() == 0;
  if (selects_allow_merge)
  {
1801 1802 1803
    for (SELECT_LEX_UNIT *tmp_unit= select_lex.first_inner_unit();
         tmp_unit;
         tmp_unit= tmp_unit->next_unit())
1804
    {
1805 1806 1807 1808
      if (tmp_unit->first_select()->parent_lex == this &&
          (tmp_unit->item == 0 ||
           (tmp_unit->item->place() != IN_WHERE &&
            tmp_unit->item->place() != IN_ON)))
1809 1810 1811 1812 1813 1814 1815 1816
      {
        selects_allow_merge= 0;
        break;
      }
    }
  }

  return (selects_allow_merge &&
unknown's avatar
VIEW  
unknown committed
1817 1818
	  select_lex.group_list.elements == 0 &&
	  select_lex.having == 0 &&
1819
          select_lex.with_sum_func == 0 &&
1820
	  select_lex.table_list.elements >= 1 &&
unknown's avatar
VIEW  
unknown committed
1821
	  !(select_lex.options & SELECT_DISTINCT) &&
1822
          select_lex.select_limit == 0);
unknown's avatar
VIEW  
unknown committed
1823 1824
}

1825

unknown's avatar
VIEW  
unknown committed
1826
/*
1827
  check if command can use VIEW with MERGE algorithm (for top VIEWs)
unknown's avatar
VIEW  
unknown committed
1828 1829 1830 1831

  SYNOPSIS
    st_lex::can_use_merged()

1832 1833 1834 1835 1836
  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
1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851
  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:
1852
  case SQLCOM_TRUNCATE:
unknown's avatar
VIEW  
unknown committed
1853 1854 1855 1856
  case SQLCOM_INSERT:
  case SQLCOM_INSERT_SELECT:
  case SQLCOM_REPLACE:
  case SQLCOM_REPLACE_SELECT:
1857
  case SQLCOM_LOAD:
unknown's avatar
VIEW  
unknown committed
1858 1859 1860 1861 1862 1863
    return TRUE;
  default:
    return FALSE;
  }
}

1864
/*
1865
  Check if command can't use merged views in any part of command
1866 1867 1868 1869

  SYNOPSIS
    st_lex::can_not_use_merged()

1870 1871 1872 1873
  DESCRIPTION
    Temporary table algorithm will be used on all SELECT levels for queries
    listed here (see also st_lex::can_use_merged()).

1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884
  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:
1885 1886 1887 1888 1889 1890
  /*
    SQLCOM_SHOW_FIELDS is necessary to make 
    information schema tables working correctly with views.
    see get_schema_tables_result function
  */
  case SQLCOM_SHOW_FIELDS:
1891 1892 1893 1894 1895 1896
    return TRUE;
  default:
    return FALSE;
  }
}

unknown's avatar
VIEW  
unknown committed
1897 1898 1899 1900 1901 1902 1903 1904 1905 1906
/*
  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
1907

unknown's avatar
VIEW  
unknown committed
1908 1909
bool st_lex::only_view_structure()
{
1910
  switch (sql_command) {
unknown's avatar
VIEW  
unknown committed
1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924
  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
1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949
/*
  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;
  }
}

1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974
/*
  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
1975

unknown's avatar
unknown committed
1976 1977 1978 1979 1980 1981 1982
/*
  initialize limit counters

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

1984
void st_select_lex_unit::set_limit(SELECT_LEX *sl)
1985
{
1986
  ha_rows select_limit_val;
1987

unknown's avatar
unknown committed
1988
  DBUG_ASSERT(! thd->stmt_arena->is_stmt_prepare());
1989 1990 1991 1992
  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));
1993 1994
  select_limit_cnt= select_limit_val + offset_limit_cnt;
  if (select_limit_cnt < select_limit_val)
1995 1996 1997
    select_limit_cnt= HA_POS_ERROR;		// no limit
}

unknown's avatar
unknown committed
1998

1999
/*
2000 2001
  Unlink the first table from the global table list and the first table from
  outer select (lex->select_lex) local list
2002 2003 2004

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

unknown's avatar
VIEW  
unknown committed
2007
  NOTES
2008 2009
    We assume that first tables in both lists is the same table or the local
    list is empty.
2010 2011

  RETURN
2012
    0	If 'query_tables' == 0
unknown's avatar
VIEW  
unknown committed
2013
    unlinked table
2014
      In this case link_to_local is set.
unknown's avatar
unknown committed
2015

2016
*/
unknown's avatar
VIEW  
unknown committed
2017
TABLE_LIST *st_lex::unlink_first_table(bool *link_to_local)
2018
{
unknown's avatar
VIEW  
unknown committed
2019 2020 2021 2022 2023 2024 2025 2026
  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;
2027 2028
    else
      query_tables_last= &query_tables;
unknown's avatar
VIEW  
unknown committed
2029 2030 2031 2032 2033 2034 2035
    first->next_global= 0;

    /*
      and from local list if it is not empty
    */
    if ((*link_to_local= test(select_lex.table_list.first)))
    {
2036 2037
      select_lex.context.table_list= 
        select_lex.context.first_name_resolution_table= first->next_local;
unknown's avatar
unknown committed
2038
      select_lex.table_list.first= (byte*) (first->next_local);
unknown's avatar
VIEW  
unknown committed
2039 2040 2041
      select_lex.table_list.elements--;	//safety
      first->next_local= 0;
      /*
2042 2043
        Ensure that the global list has the same first table as the local
        list.
unknown's avatar
VIEW  
unknown committed
2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059
      */
      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
2060 2061 2062 2063 2064 2065
    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
2066 2067 2068 2069 2070 2071 2072
*/

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)
  {
2073
    TABLE_LIST *next;
unknown's avatar
VIEW  
unknown committed
2074 2075
    if (query_tables_last == &first_table->next_global)
      query_tables_last= first_table->prev_global;
2076

2077
    if ((next= *first_table->prev_global= first_table->next_global))
unknown's avatar
VIEW  
unknown committed
2078 2079 2080 2081
      next->prev_global= first_table->prev_global;
    /* include in new place */
    first_table->next_global= query_tables;
    /*
2082 2083 2084
       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
2085 2086 2087 2088 2089
    */
    query_tables->prev_global= &first_table->next_global;
    first_table->prev_global= &query_tables;
    query_tables= first_table;
  }
2090 2091
}

unknown's avatar
unknown committed
2092

2093
/*
unknown's avatar
unknown committed
2094
  Link table back that was unlinked with unlink_first_table()
2095 2096 2097

  SYNOPSIS
    link_first_table_back()
unknown's avatar
VIEW  
unknown committed
2098
    link_to_local	do we need link this table to local
2099 2100 2101 2102

  RETURN
    global list
*/
unknown's avatar
VIEW  
unknown committed
2103 2104 2105

void st_lex::link_first_table_back(TABLE_LIST *first,
				   bool link_to_local)
2106
{
unknown's avatar
VIEW  
unknown committed
2107
  if (first)
2108
  {
unknown's avatar
VIEW  
unknown committed
2109 2110
    if ((first->next_global= query_tables))
      query_tables->prev_global= &first->next_global;
2111 2112
    else
      query_tables_last= &first->next_global;
unknown's avatar
VIEW  
unknown committed
2113 2114 2115 2116 2117
    query_tables= first;

    if (link_to_local)
    {
      first->next_local= (TABLE_LIST*) select_lex.table_list.first;
unknown's avatar
unknown committed
2118 2119
      select_lex.context.table_list= first;
      select_lex.table_list.first= (byte*) first;
unknown's avatar
VIEW  
unknown committed
2120 2121 2122 2123 2124 2125
      select_lex.table_list.elements++;	//safety
    }
  }
}


2126 2127 2128 2129 2130 2131

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

  SYNOPSIS
    st_lex::cleanup_after_one_table_open()
2132 2133 2134 2135 2136

  NOTE
    This method is mostly responsible for cleaning up of selects lists and
    derived tables state. To rollback changes in Query_tables_list one has
    to call Query_tables_list::reset_query_tables_list(FALSE).
2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161
*/

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();
  }
2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196
}


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

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

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


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

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

void st_lex::restore_backup_query_tables_list(Query_tables_list *backup)
{
  this->destroy_query_tables_list();
  this->set_query_tables_list(backup);
2197 2198 2199
}


unknown's avatar
unknown committed
2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221
/*
  Checks for usage of routines and/or tables in a parsed statement

  SYNOPSIS
    st_lex:table_or_sp_used()

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

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

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

  DBUG_RETURN(FALSE);
}


2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250
/*
  Do end-of-prepare fixup for list of tables and their merge-VIEWed tables

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

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

*/

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


unknown's avatar
VIEW  
unknown committed
2251
/*
2252
  Save WHERE/HAVING/ON clauses and replace them with disposable copies
unknown's avatar
VIEW  
unknown committed
2253 2254 2255

  SYNOPSIS
    st_select_lex::fix_prepare_information
2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266
      thd          thread handler
      conds        in/out pointer to WHERE condition to be met at execution
      having_conds in/out pointer to HAVING condition to be met at execution
  
  DESCRIPTION
    The passed WHERE and HAVING are to be saved for the future executions.
    This function saves it, and returns a copy which can be thrashed during
    this execution of the statement. By saving/thrashing here we mean only
    AND/OR trees.
    The function also calls fix_prepare_info_in_table_list that saves all
    ON expressions.    
unknown's avatar
VIEW  
unknown committed
2267 2268
*/

2269 2270
void st_select_lex::fix_prepare_information(THD *thd, Item **conds, 
                                            Item **having_conds)
unknown's avatar
VIEW  
unknown committed
2271
{
unknown's avatar
unknown committed
2272
  if (!thd->stmt_arena->is_conventional() && first_execution)
unknown's avatar
VIEW  
unknown committed
2273 2274
  {
    first_execution= 0;
2275 2276 2277 2278 2279
    if (*conds)
    {
      prep_where= *conds;
      *conds= where= prep_where->copy_andor_structure(thd);
    }
2280 2281 2282 2283 2284
    if (*having_conds)
    {
      prep_having= *having_conds;
      *having_conds= having= prep_having->copy_andor_structure(thd);
    }
2285
    fix_prepare_info_in_table_list(thd, (TABLE_LIST *)table_list.first);
2286 2287 2288
  }
}

unknown's avatar
unknown committed
2289

unknown's avatar
unknown committed
2290
/*
unknown's avatar
VIEW  
unknown committed
2291
  There are st_select_lex::add_table_to_list &
unknown's avatar
unknown committed
2292
  st_select_lex::set_lock_for_tables are in sql_parse.cc
unknown's avatar
unknown committed
2293

unknown's avatar
VIEW  
unknown committed
2294
  st_select_lex::print is in sql_select.cc
unknown's avatar
unknown committed
2295 2296

  st_select_lex_unit::prepare, st_select_lex_unit::exec,
2297 2298
  st_select_lex_unit::cleanup, st_select_lex_unit::reinit_exec_mechanism,
  st_select_lex_unit::change_result
unknown's avatar
unknown committed
2299
  are in sql_union.cc
unknown's avatar
unknown committed
2300
*/
2301

2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359
/*
  Sets the kind of hints to be added by the calls to add_index_hint().

  SYNOPSIS
    set_index_hint_type()
      type         the kind of hints to be added from now on.
      clause       the clause to use for hints to be added from now on.

  DESCRIPTION
    Used in filling up the tagged hints list.
    This list is filled by first setting the kind of the hint as a 
    context variable and then adding hints of the current kind.
    Then the context variable index_hint_type can be reset to the
    next hint type.
*/
void st_select_lex::set_index_hint_type(enum index_hint_type type, 
                                        index_clause_map clause)
{ 
  current_index_hint_type= type;
  current_index_hint_clause= clause;
}


/*
  Makes an array to store index usage hints (ADD/FORCE/IGNORE INDEX).

  SYNOPSIS
    alloc_index_hints()
      thd         current thread.
*/

void st_select_lex::alloc_index_hints (THD *thd)
{ 
  index_hints= new (thd->mem_root) List<index_hint>(); 
}



/*
  adds an element to the array storing index usage hints 
  (ADD/FORCE/IGNORE INDEX).

  SYNOPSIS
    add_index_hint()
      thd         current thread.
      str         name of the index.
      length      number of characters in str.

  RETURN VALUE
    0 on success, non-zero otherwise
*/
bool st_select_lex::add_index_hint (THD *thd, char *str, uint length)
{
  return index_hints->push_front (new (thd->mem_root) 
                                 index_hint(current_index_hint_type,
                                            current_index_hint_clause,
                                            str, length));
}