item_cmpfunc.cc 57.3 KB
Newer Older
1
/* Copyright (C) 2000-2003 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 24 25
   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 */


/* This file defines all compare functions */

#ifdef __GNUC__
#pragma implementation				// gcc: Class implementation
#endif

#include "mysql_priv.h"
#include <m_ctype.h>
26
#include "sql_select.h"
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
static Item_result item_store_type(Item_result a,Item_result b)
{
  if (a == STRING_RESULT || b == STRING_RESULT)
    return STRING_RESULT;
  else if (a == REAL_RESULT || b == REAL_RESULT)
    return REAL_RESULT;
  else
    return INT_RESULT;
}

static void agg_result_type(Item_result *type, Item **items, uint nitems)
{
  uint i;
  type[0]= items[0]->result_type();
  for (i=1 ; i < nitems ; i++)
    type[0]= item_store_type(type[0], items[i]->result_type());
}

static void agg_cmp_type(Item_result *type, Item **items, uint nitems)
{
  uint i;
  type[0]= items[0]->result_type();
  for (i=1 ; i < nitems ; i++)
    type[0]= item_cmp_type(type[0], items[i]->result_type());
}

54 55
static void my_coll_agg_error(DTCollation &c1, DTCollation &c2, const char *fname)
{
56
  my_error(ER_CANT_AGGREGATE_2COLLATIONS,MYF(0),
57 58 59 60 61
  	   c1.collation->name,c1.derivation_name(),
	   c2.collation->name,c2.derivation_name(),
	   fname);
}

unknown's avatar
unknown committed
62 63

Item_bool_func2* Eq_creator::create(Item *a, Item *b) const
unknown's avatar
unknown committed
64 65 66
{
  return new Item_func_eq(a, b);
}
unknown's avatar
unknown committed
67 68 69


Item_bool_func2* Ne_creator::create(Item *a, Item *b) const
unknown's avatar
unknown committed
70 71 72
{
  return new Item_func_ne(a, b);
}
unknown's avatar
unknown committed
73 74 75


Item_bool_func2* Gt_creator::create(Item *a, Item *b) const
unknown's avatar
unknown committed
76 77 78
{
  return new Item_func_gt(a, b);
}
unknown's avatar
unknown committed
79 80 81


Item_bool_func2* Lt_creator::create(Item *a, Item *b) const
unknown's avatar
unknown committed
82 83 84
{
  return new Item_func_lt(a, b);
}
unknown's avatar
unknown committed
85 86 87


Item_bool_func2* Ge_creator::create(Item *a, Item *b) const
unknown's avatar
unknown committed
88 89 90
{
  return new Item_func_ge(a, b);
}
unknown's avatar
unknown committed
91 92 93


Item_bool_func2* Le_creator::create(Item *a, Item *b) const
unknown's avatar
unknown committed
94 95 96
{
  return new Item_func_le(a, b);
}
unknown's avatar
unknown committed
97

unknown's avatar
unknown committed
98
/*
99
  Test functions
100 101
  Most of these  returns 0LL if false and 1LL if true and
  NULL if some arg is NULL.
unknown's avatar
unknown committed
102 103 104 105 106 107 108 109 110
*/

longlong Item_func_not::val_int()
{
  double value=args[0]->val();
  null_value=args[0]->null_value;
  return !null_value && value == 0 ? 1 : 0;
}

111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126
/*
  special NOT for ALL subquery
*/

longlong Item_func_not_all::val_int()
{  
  double value= args[0]->val();
  if (abort_on_null)
  {
    null_value= 0;
    return (args[0]->null_value || value == 0) ? 1 : 0;
  }
  null_value= args[0]->null_value;
  return (!null_value && value == 0) ? 1 : 0;
}

unknown's avatar
unknown committed
127 128 129 130 131 132 133 134
void Item_func_not_all::print(String *str)
{
  if (show)
    Item_func::print(str);
  else
    args[0]->print(str);
}

unknown's avatar
unknown committed
135 136 137 138 139
/*
  Convert a constant expression or string to an integer.
  This is done when comparing DATE's of different formats and
  also when comparing bigint to strings (in which case the string
  is converted once to a bigint).
unknown's avatar
unknown committed
140 141 142 143

  RESULT VALUES
  0	Can't convert item
  1	Item was replaced with an integer version of the item
unknown's avatar
unknown committed
144
*/
unknown's avatar
unknown committed
145 146 147

static bool convert_constant_item(Field *field, Item **item)
{
148
  if ((*item)->const_item())
unknown's avatar
unknown committed
149
  {
unknown's avatar
unknown committed
150
    if (!(*item)->save_in_field(field, 1) && !((*item)->null_value))
unknown's avatar
unknown committed
151
    {
152 153
      Item *tmp=new Item_int_with_ref(field->val_int(), *item);
      if (tmp)
unknown's avatar
unknown committed
154
	*item=tmp;
155
      return 1;					// Item was replaced
unknown's avatar
unknown committed
156 157 158 159 160
    }
  }
  return 0;
}

unknown's avatar
unknown committed
161

162 163 164 165 166 167 168 169 170 171
void Item_bool_func2::fix_length_and_dec()
{
  max_length= 1;				     // Function returns 0 or 1

  /*
    As some compare functions are generated after sql_yacc,
    we have to check for out of memory conditions here
  */
  if (!args[0] || !args[1])
    return;
172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189

  /* 
    We allow to convert to Unicode character sets in some cases.
    The conditions when conversion is possible are:
    - arguments A and B have different charsets
    - A wins according to coercibility rules
    - character set of A is superset for character set of B
   
    If all of the above is true, then it's possible to convert
    B into the character set of A, and then compare according
    to the collation of A.
  */

  if (args[0] && args[1])
  {
    uint strong= 0;
    uint weak= 0;

190 191 192 193
    if ((args[0]->collation.derivation < args[1]->collation.derivation) && 
	!my_charset_same(args[0]->collation.collation, 
			 args[1]->collation.collation) &&
        (args[0]->collation.collation->state & MY_CS_UNICODE))
194 195 196
    {
      weak= 1;
    }
197 198 199 200
    else if ((args[1]->collation.derivation < args[0]->collation.derivation) && 
	     !my_charset_same(args[0]->collation.collation,
			      args[1]->collation.collation) &&
             (args[1]->collation.collation->state & MY_CS_UNICODE))
201 202 203 204 205 206 207 208 209 210 211 212
    {
      strong= 1;
    }
    
    if (strong || weak)
    {
      Item* conv= 0;
      if (args[weak]->type() == STRING_ITEM)
      {
        String tmp, cstr;
        String *ostr= args[weak]->val_str(&tmp);
        cstr.copy(ostr->ptr(), ostr->length(), ostr->charset(), 
213
		  args[strong]->collation.collation);
214
        conv= new Item_string(cstr.ptr(),cstr.length(),cstr.charset(),
215
			      args[weak]->collation.derivation);
216 217 218 219
	((Item_string*)conv)->str_value.copy();
      }
      else
      {
220 221
	conv= new Item_func_conv_charset(args[weak],args[strong]->collation.collation);
        conv->collation.set(args[weak]->collation.derivation);
222 223 224 225
      }
      args[weak]= conv ? conv : args[weak];
    }
  }
226
  
unknown's avatar
unknown committed
227
  // Make a special case of compare with fields to get nicer DATE comparisons
unknown's avatar
unknown committed
228 229 230 231 232 233 234

  if (functype() == LIKE_FUNC)  // Disable conversion in case of LIKE function.
  {
    set_cmp_func();
    return;
  }
    
unknown's avatar
unknown committed
235 236 237
  if (args[0]->type() == FIELD_ITEM)
  {
    Field *field=((Item_field*) args[0])->field;
238
    if (field->store_for_compare())
unknown's avatar
unknown committed
239 240 241
    {
      if (convert_constant_item(field,&args[1]))
      {
242
	cmp.set_cmp_func(this, tmp_arg, tmp_arg+1,
unknown's avatar
unknown committed
243
			 INT_RESULT);		// Works for all types.
unknown's avatar
unknown committed
244 245 246 247 248 249 250
	return;
      }
    }
  }
  if (args[1]->type() == FIELD_ITEM)
  {
    Field *field=((Item_field*) args[1])->field;
251
    if (field->store_for_compare())
unknown's avatar
unknown committed
252 253 254
    {
      if (convert_constant_item(field,&args[0]))
      {
255 256
	cmp.set_cmp_func(this, tmp_arg, tmp_arg+1,
			 INT_RESULT); // Works for all types.
unknown's avatar
unknown committed
257 258 259 260
	return;
      }
    }
  }
261
  set_cmp_func();
unknown's avatar
unknown committed
262 263
}

264

265
int Arg_comparator::set_compare_func(Item_bool_func2 *item, Item_result type)
unknown's avatar
unknown committed
266
{
267
  owner= item;
unknown's avatar
unknown committed
268 269
  func= comparator_matrix[type][(owner->functype() == Item_func::EQUAL_FUNC)?
				1:0];
unknown's avatar
unknown committed
270
  if (type == ROW_RESULT)
unknown's avatar
unknown committed
271
  {
272 273
    uint n= (*a)->cols();
    if (n != (*b)->cols())
274
    {
unknown's avatar
unknown committed
275
      my_error(ER_OPERAND_COLUMNS, MYF(0), n);
276 277 278
      comparators= 0;
      return 1;
    }
unknown's avatar
unknown committed
279 280 281 282 283
    if (!(comparators= (Arg_comparator *) sql_alloc(sizeof(Arg_comparator)*n)))
      return 1;
    for (uint i=0; i < n; i++)
    {
      if ((*a)->el(i)->cols() != (*b)->el(i)->cols())
unknown's avatar
unknown committed
284
      {
unknown's avatar
unknown committed
285
	my_error(ER_OPERAND_COLUMNS, MYF(0), (*a)->el(i)->cols());
unknown's avatar
unknown committed
286
	return 1;
unknown's avatar
unknown committed
287
      }
unknown's avatar
unknown committed
288 289
      comparators[i].set_cmp_func(owner, (*a)->addr(i), (*b)->addr(i));
    }
290
  }
291 292 293 294 295 296
  else if (type == STRING_RESULT)
  {
    /*
      We must set cmp_charset here as we may be called from for an automatic
      generated item, like in natural join
    */
297 298
    if (cmp_collation.set((*a)->collation, (*b)->collation) || 
	cmp_collation.derivation == DERIVATION_NONE)
299 300 301 302
    {
      my_coll_agg_error((*a)->collation, (*b)->collation, owner->func_name());
      return 1;
    }
unknown's avatar
unknown committed
303 304 305 306 307 308 309 310 311 312 313
    if (my_binary_compare(cmp_collation.collation))
    {
      /*
	We are using binary collation, change to compare byte by byte,
	without removing end space
      */
      if (func == &Arg_comparator::compare_string)
	func= &Arg_comparator::compare_binary_string;
      else if (func == &Arg_comparator::compare_e_string)
	func= &Arg_comparator::compare_e_binary_string;
    }
314
  }
315
  return 0;
unknown's avatar
unknown committed
316
}
unknown's avatar
unknown committed
317

unknown's avatar
unknown committed
318

319
int Arg_comparator::compare_string()
unknown's avatar
unknown committed
320 321
{
  String *res1,*res2;
322
  if ((res1= (*a)->val_str(&owner->tmp_value1)))
unknown's avatar
unknown committed
323
  {
324
    if ((res2= (*b)->val_str(&owner->tmp_value2)))
unknown's avatar
unknown committed
325
    {
unknown's avatar
unknown committed
326
      owner->null_value= 0;
327
      return sortcmp(res1,res2,cmp_collation.collation);
unknown's avatar
unknown committed
328 329
    }
  }
unknown's avatar
unknown committed
330
  owner->null_value= 1;
unknown's avatar
unknown committed
331 332 333
  return -1;
}

unknown's avatar
unknown committed
334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366

/*
  Compare strings byte by byte. End spaces are also compared.

  RETURN
   < 0	*a < *b
   0	*b == *b
   > 0	*a > *b
*/

int Arg_comparator::compare_binary_string()
{
  String *res1,*res2;
  if ((res1= (*a)->val_str(&owner->tmp_value1)))
  {
    if ((res2= (*b)->val_str(&owner->tmp_value2)))
    {
      owner->null_value= 0;
      uint res1_length= res1->length();
      uint res2_length= res2->length();
      int cmp= memcmp(res1->ptr(), res2->ptr(), min(res1_length,res2_length));
      return cmp ? cmp : (int) (res1_length - res2_length);
    }
  }
  owner->null_value= 1;
  return -1;
}


/*
  Compare strings, but take into account that NULL == NULL
*/

unknown's avatar
unknown committed
367 368 369
int Arg_comparator::compare_e_string()
{
  String *res1,*res2;
370 371
  res1= (*a)->val_str(&owner->tmp_value1);
  res2= (*b)->val_str(&owner->tmp_value2);
unknown's avatar
unknown committed
372 373
  if (!res1 || !res2)
    return test(res1 == res2);
374
  return test(sortcmp(res1, res2, cmp_collation.collation) == 0);
unknown's avatar
unknown committed
375 376 377
}


unknown's avatar
unknown committed
378 379 380 381 382 383 384 385 386 387 388
int Arg_comparator::compare_e_binary_string()
{
  String *res1,*res2;
  res1= (*a)->val_str(&owner->tmp_value1);
  res2= (*b)->val_str(&owner->tmp_value2);
  if (!res1 || !res2)
    return test(res1 == res2);
  return test(stringcmp(res1, res2) == 0);
}


389
int Arg_comparator::compare_real()
unknown's avatar
unknown committed
390
{
391 392
  double val1= (*a)->val();
  if (!(*a)->null_value)
unknown's avatar
unknown committed
393
  {
394 395
    double val2= (*b)->val();
    if (!(*b)->null_value)
unknown's avatar
unknown committed
396
    {
unknown's avatar
unknown committed
397
      owner->null_value= 0;
unknown's avatar
unknown committed
398 399 400 401 402
      if (val1 < val2)	return -1;
      if (val1 == val2) return 0;
      return 1;
    }
  }
unknown's avatar
unknown committed
403
  owner->null_value= 1;
unknown's avatar
unknown committed
404 405 406
  return -1;
}

unknown's avatar
unknown committed
407 408
int Arg_comparator::compare_e_real()
{
409 410 411 412
  double val1= (*a)->val();
  double val2= (*b)->val();
  if ((*a)->null_value || (*b)->null_value)
    return test((*a)->null_value && (*b)->null_value);
unknown's avatar
unknown committed
413 414
  return test(val1 == val2);
}
unknown's avatar
unknown committed
415

416
int Arg_comparator::compare_int()
unknown's avatar
unknown committed
417
{
418 419
  longlong val1= (*a)->val_int();
  if (!(*a)->null_value)
unknown's avatar
unknown committed
420
  {
421 422
    longlong val2= (*b)->val_int();
    if (!(*b)->null_value)
unknown's avatar
unknown committed
423
    {
unknown's avatar
unknown committed
424
      owner->null_value= 0;
unknown's avatar
unknown committed
425 426 427 428 429
      if (val1 < val2)	return -1;
      if (val1 == val2)   return 0;
      return 1;
    }
  }
unknown's avatar
unknown committed
430
  owner->null_value= 1;
unknown's avatar
unknown committed
431 432 433
  return -1;
}

unknown's avatar
unknown committed
434 435
int Arg_comparator::compare_e_int()
{
436 437 438 439
  longlong val1= (*a)->val_int();
  longlong val2= (*b)->val_int();
  if ((*a)->null_value || (*b)->null_value)
    return test((*a)->null_value && (*b)->null_value);
unknown's avatar
unknown committed
440 441 442 443
  return test(val1 == val2);
}


444
int Arg_comparator::compare_row()
unknown's avatar
unknown committed
445 446
{
  int res= 0;
447 448
  (*a)->bring_value();
  (*b)->bring_value();
449
  uint n= (*a)->cols();
unknown's avatar
unknown committed
450
  for (uint i= 0; i<n; i++)
unknown's avatar
unknown committed
451
  {
452
    if ((res= comparators[i].compare()))
unknown's avatar
unknown committed
453 454 455 456 457 458
      return res;
    if (owner->null_value)
      return -1;
  }
  return res;
}
unknown's avatar
unknown committed
459

unknown's avatar
unknown committed
460 461
int Arg_comparator::compare_e_row()
{
462 463
  (*a)->bring_value();
  (*b)->bring_value();
464
  uint n= (*a)->cols();
unknown's avatar
unknown committed
465 466
  for (uint i= 0; i<n; i++)
  {
unknown's avatar
unknown committed
467
    if (!comparators[i].compare())
468
      return 0;
unknown's avatar
unknown committed
469 470 471 472
  }
  return 1;
}

473 474 475 476

bool Item_in_optimizer::fix_left(THD *thd,
				 struct st_table_list *tables,
				 Item **ref)
unknown's avatar
unknown committed
477
{
478 479 480 481
  if (args[0]->fix_fields(thd, tables, ref) ||
      (!cache && !(cache= Item_cache::get_cache(args[0]->result_type()))))
    return 1;
  cache->setup(args[0]);
482
  cache->store(args[0]);
483
  if (cache->cols() == 1)
484
  {
unknown's avatar
unknown committed
485
    if ((used_tables_cache= args[0]->used_tables()))
unknown's avatar
unknown committed
486
      cache->set_used_tables(OUTER_REF_TABLE_BIT);
487 488 489
    else
      cache->set_used_tables(0);
  }
490 491 492 493
  else
  {
    uint n= cache->cols();
    for (uint i= 0; i < n; i++)
494 495
    {
      if (args[0]->el(i)->used_tables())
unknown's avatar
unknown committed
496
	((Item_cache *)cache->el(i))->set_used_tables(OUTER_REF_TABLE_BIT);
497 498 499
      else
	((Item_cache *)cache->el(i))->set_used_tables(0);
    }
unknown's avatar
unknown committed
500
    used_tables_cache= args[0]->used_tables();
501
  }
unknown's avatar
unknown committed
502 503 504
  not_null_tables_cache= args[0]->not_null_tables();
  with_sum_func= args[0]->with_sum_func;
  const_item_cache= args[0]->const_item();
505
  fixed= 1;
506 507 508 509 510 511 512 513 514 515 516 517
  return 0;
}


bool Item_in_optimizer::fix_fields(THD *thd, struct st_table_list *tables,
				   Item ** ref)
{
  if (fix_left(thd, tables, ref))
    return 1;
  if (args[0]->maybe_null)
    maybe_null=1;

518
  if (!args[1]->fixed && args[1]->fix_fields(thd, tables, args))
unknown's avatar
unknown committed
519 520 521 522
    return 1;
  Item_in_subselect * sub= (Item_in_subselect *)args[1];
  if (args[0]->cols() != sub->engine->cols())
  {
unknown's avatar
unknown committed
523
    my_error(ER_OPERAND_COLUMNS, MYF(0), args[0]->cols());
524
    return 1;
unknown's avatar
unknown committed
525
  }
526 527 528 529
  if (args[1]->maybe_null)
    maybe_null=1;
  with_sum_func= with_sum_func || args[1]->with_sum_func;
  used_tables_cache|= args[1]->used_tables();
unknown's avatar
unknown committed
530
  not_null_tables_cache|= args[1]->not_null_tables();
531 532 533 534
  const_item_cache&= args[1]->const_item();
  return 0;
}

535

536 537
longlong Item_in_optimizer::val_int()
{
538 539
  cache->store(args[0]);
  if (cache->null_value)
540 541 542 543 544
  {
    null_value= 1;
    return 0;
  }
  longlong tmp= args[1]->val_int_result();
unknown's avatar
unknown committed
545
  null_value= args[1]->null_value;
546 547 548
  return tmp;
}

549 550 551 552 553 554 555 556

void Item_in_optimizer::keep_top_level_cache()
{
  cache->keep_array();
  save_cache= 1;
}


unknown's avatar
unknown committed
557 558 559 560
void Item_in_optimizer::cleanup()
{
  DBUG_ENTER("Item_in_optimizer::cleanup");
  Item_bool_func::cleanup();
561 562
  if (!save_cache)
    cache= 0;
unknown's avatar
unknown committed
563 564 565
  DBUG_VOID_RETURN;
}

566

567
bool Item_in_optimizer::is_null()
568
{
569 570
  cache->store(args[0]);
  return (null_value= (cache->null_value || args[1]->is_null()));
571
}
unknown's avatar
unknown committed
572

573

unknown's avatar
unknown committed
574 575
longlong Item_func_eq::val_int()
{
576
  int value= cmp.compare();
unknown's avatar
unknown committed
577 578 579
  return value == 0 ? 1 : 0;
}

580

unknown's avatar
unknown committed
581 582
/* Same as Item_func_eq, but NULL = NULL */

unknown's avatar
unknown committed
583 584 585 586 587 588
void Item_func_equal::fix_length_and_dec()
{
  Item_bool_func2::fix_length_and_dec();
  maybe_null=null_value=0;
}

unknown's avatar
unknown committed
589 590
longlong Item_func_equal::val_int()
{
591
  return cmp.compare();
unknown's avatar
unknown committed
592 593 594 595
}

longlong Item_func_ne::val_int()
{
596
  int value= cmp.compare();
597
  return value != 0 && !null_value ? 1 : 0;
unknown's avatar
unknown committed
598 599 600 601 602
}


longlong Item_func_ge::val_int()
{
603
  int value= cmp.compare();
unknown's avatar
unknown committed
604 605 606 607 608 609
  return value >= 0 ? 1 : 0;
}


longlong Item_func_gt::val_int()
{
610
  int value= cmp.compare();
unknown's avatar
unknown committed
611 612 613 614 615
  return value > 0 ? 1 : 0;
}

longlong Item_func_le::val_int()
{
616
  int value= cmp.compare();
unknown's avatar
unknown committed
617 618 619 620 621 622
  return value <= 0 && !null_value ? 1 : 0;
}


longlong Item_func_lt::val_int()
{
623
  int value= cmp.compare();
unknown's avatar
unknown committed
624 625 626 627 628 629 630 631 632 633 634 635 636
  return value < 0 && !null_value ? 1 : 0;
}


longlong Item_func_strcmp::val_int()
{
  String *a=args[0]->val_str(&tmp_value1);
  String *b=args[1]->val_str(&tmp_value2);
  if (!a || !b)
  {
    null_value=1;
    return 0;
  }
637
  int value= sortcmp(a,b,cmp.cmp_collation.collation);
unknown's avatar
unknown committed
638 639 640 641 642 643 644
  null_value=0;
  return !value ? 0 : (value < 0 ? (longlong) -1 : (longlong) 1);
}


void Item_func_interval::fix_length_and_dec()
{
645
  if (row->cols() > 8)
unknown's avatar
unknown committed
646
  {
647 648 649
    bool consts=1;

    for (uint i=1 ; consts && i < row->cols() ; i++)
unknown's avatar
unknown committed
650
    {
651
      consts&= row->el(i)->const_item();
unknown's avatar
unknown committed
652
    }
653 654 655

    if (consts &&
        (intervals=(double*) sql_alloc(sizeof(double)*(row->cols()-1))))
unknown's avatar
unknown committed
656
    {
657 658
      for (uint i=1 ; i < row->cols(); i++)
        intervals[i-1]=row->el(i)->val();
unknown's avatar
unknown committed
659 660
    }
  }
unknown's avatar
unknown committed
661 662
  maybe_null= 0;
  max_length= 2;
663
  used_tables_cache|= row->used_tables();
unknown's avatar
unknown committed
664
  not_null_tables_cache&= row->not_null_tables();
665
  with_sum_func= with_sum_func || row->with_sum_func;
unknown's avatar
unknown committed
666
  const_item_cache&= row->const_item();
unknown's avatar
unknown committed
667 668
}

unknown's avatar
unknown committed
669

unknown's avatar
unknown committed
670 671 672
/*
  return -1 if null value,
	  0 if lower than lowest
673 674
	  1 - arg_count-1 if between args[n] and args[n+1]
	  arg_count if higher than biggest argument
unknown's avatar
unknown committed
675 676 677 678
*/

longlong Item_func_interval::val_int()
{
unknown's avatar
unknown committed
679 680 681
  double value= row->el(0)->val();
  uint i;

682 683
  if (row->el(0)->null_value)
    return -1;				// -1 if null
unknown's avatar
unknown committed
684 685 686
  if (intervals)
  {					// Use binary search to find interval
    uint start,end;
687
    start= 0;
unknown's avatar
unknown committed
688
    end=   row->cols()-2;
unknown's avatar
unknown committed
689 690
    while (start != end)
    {
unknown's avatar
unknown committed
691
      uint mid= (start + end + 1) / 2;
unknown's avatar
unknown committed
692
      if (intervals[mid] <= value)
unknown's avatar
unknown committed
693
	start= mid;
unknown's avatar
unknown committed
694
      else
unknown's avatar
unknown committed
695
	end= mid - 1;
unknown's avatar
unknown committed
696
    }
unknown's avatar
unknown committed
697
    return (value < intervals[start]) ? 0 : start + 1;
unknown's avatar
unknown committed
698
  }
699 700

  for (i=1 ; i < row->cols() ; i++)
unknown's avatar
unknown committed
701
  {
702 703
    if (row->el(i)->val() > value)
      return i-1;
unknown's avatar
unknown committed
704
  }
705
  return i-1;
unknown's avatar
unknown committed
706 707
}

unknown's avatar
unknown committed
708 709
void Item_func_between::fix_length_and_dec()
{
unknown's avatar
unknown committed
710
   max_length= 1;
unknown's avatar
unknown committed
711

712 713 714 715
  /*
    As some compare functions are generated after sql_yacc,
    we have to check for out of memory conditons here
  */
unknown's avatar
unknown committed
716 717
  if (!args[0] || !args[1] || !args[2])
    return;
718
  agg_cmp_type(&cmp_type, args, 3);
unknown's avatar
unknown committed
719 720 721
  if (cmp_type == STRING_RESULT &&
      agg_arg_collations_for_comparison(cmp_collation, args, 3))
    return;
unknown's avatar
unknown committed
722

unknown's avatar
unknown committed
723 724 725 726 727
  /*
    Make a special case of compare with date/time and longlong fields.
    They are compared as integers, so for const item this time-consuming
    conversion can be done only once, not for every single comparison
  */
unknown's avatar
unknown committed
728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752
  if (args[0]->type() == FIELD_ITEM)
  {
    Field *field=((Item_field*) args[0])->field;
    if (field->store_for_compare())
    {
      if (convert_constant_item(field,&args[1]))
	cmp_type=INT_RESULT;			// Works for all types.
      if (convert_constant_item(field,&args[2]))
	cmp_type=INT_RESULT;			// Works for all types.
    }
  }
}


longlong Item_func_between::val_int()
{						// ANSI BETWEEN
  if (cmp_type == STRING_RESULT)
  {
    String *value,*a,*b;
    value=args[0]->val_str(&value0);
    if ((null_value=args[0]->null_value))
      return 0;
    a=args[1]->val_str(&value1);
    b=args[2]->val_str(&value2);
    if (!args[1]->null_value && !args[2]->null_value)
753 754
      return (sortcmp(value,a,cmp_collation.collation) >= 0 && 
	      sortcmp(value,b,cmp_collation.collation) <= 0) ? 1 : 0;
unknown's avatar
unknown committed
755 756 757 758
    if (args[1]->null_value && args[2]->null_value)
      null_value=1;
    else if (args[1]->null_value)
    {
759
      null_value= sortcmp(value,b,cmp_collation.collation) <= 0; // not null if false range.
unknown's avatar
unknown committed
760 761 762
    }
    else
    {
763
      null_value= sortcmp(value,a,cmp_collation.collation) >= 0; // not null if false range.
unknown's avatar
unknown committed
764 765 766 767 768 769
    }
  }
  else if (cmp_type == INT_RESULT)
  {
    longlong value=args[0]->val_int(),a,b;
    if ((null_value=args[0]->null_value))
770
      return 0;					/* purecov: inspected */
unknown's avatar
unknown committed
771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789
    a=args[1]->val_int();
    b=args[2]->val_int();
    if (!args[1]->null_value && !args[2]->null_value)
      return (value >= a && value <= b) ? 1 : 0;
    if (args[1]->null_value && args[2]->null_value)
      null_value=1;
    else if (args[1]->null_value)
    {
      null_value= value <= b;			// not null if false range.
    }
    else
    {
      null_value= value >= a;
    }
  }
  else
  {
    double value=args[0]->val(),a,b;
    if ((null_value=args[0]->null_value))
790
      return 0;					/* purecov: inspected */
unknown's avatar
unknown committed
791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808
    a=args[1]->val();
    b=args[2]->val();
    if (!args[1]->null_value && !args[2]->null_value)
      return (value >= a && value <= b) ? 1 : 0;
    if (args[1]->null_value && args[2]->null_value)
      null_value=1;
    else if (args[1]->null_value)
    {
      null_value= value <= b;			// not null if false range.
    }
    else
    {
      null_value= value >= a;
    }
  }
  return 0;
}

809 810 811 812 813

void Item_func_between::print(String *str)
{
  str->append('(');
  args[0]->print(str);
814
  str->append(" between ", 9);
815
  args[1]->print(str);
816
  str->append(" and ", 5);
817 818 819 820
  args[2]->print(str);
  str->append(')');
}

unknown's avatar
unknown committed
821 822 823 824 825 826
void
Item_func_ifnull::fix_length_and_dec()
{
  maybe_null=args[1]->maybe_null;
  max_length=max(args[0]->max_length,args[1]->max_length);
  decimals=max(args[0]->decimals,args[1]->decimals);
827
  agg_result_type(&cached_result_type, args, 2);
unknown's avatar
unknown committed
828 829
  if (cached_result_type == STRING_RESULT)
    agg_arg_collations(collation, args, arg_count);
830 831
  else if (cached_result_type != REAL_RESULT)
    decimals= 0;
832 833 834 835
  
  cached_field_type= args[0]->field_type();
  if (cached_field_type != args[1]->field_type())
    cached_field_type= Item_func::field_type();
unknown's avatar
unknown committed
836 837
}

838 839 840
enum_field_types Item_func_ifnull::field_type() const 
{
  return cached_field_type;
unknown's avatar
unknown committed
841 842
}

843 844 845 846
Field *Item_func_ifnull::tmp_table_field(TABLE *table)
{
  return tmp_table_field_from_field_type(table);
}
847

unknown's avatar
unknown committed
848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884
double
Item_func_ifnull::val()
{
  double value=args[0]->val();
  if (!args[0]->null_value)
  {
    null_value=0;
    return value;
  }
  value=args[1]->val();
  if ((null_value=args[1]->null_value))
    return 0.0;
  return value;
}

longlong
Item_func_ifnull::val_int()
{
  longlong value=args[0]->val_int();
  if (!args[0]->null_value)
  {
    null_value=0;
    return value;
  }
  value=args[1]->val_int();
  if ((null_value=args[1]->null_value))
    return 0;
  return value;
}

String *
Item_func_ifnull::val_str(String *str)
{
  String *res  =args[0]->val_str(str);
  if (!args[0]->null_value)
  {
    null_value=0;
885
    res->set_charset(collation.collation);
unknown's avatar
unknown committed
886 887 888 889 890
    return res;
  }
  res=args[1]->val_str(str);
  if ((null_value=args[1]->null_value))
    return 0;
891
  res->set_charset(collation.collation);
unknown's avatar
unknown committed
892 893 894
  return res;
}

895

unknown's avatar
unknown committed
896 897 898 899 900
void
Item_func_if::fix_length_and_dec()
{
  maybe_null=args[1]->maybe_null || args[2]->maybe_null;
  max_length=max(args[1]->max_length,args[2]->max_length);
901
  decimals=max(args[1]->decimals,args[2]->decimals);
unknown's avatar
unknown committed
902 903
  enum Item_result arg1_type=args[1]->result_type();
  enum Item_result arg2_type=args[2]->result_type();
904 905 906 907 908 909
  bool null1=args[1]->null_value;
  bool null2=args[2]->null_value;

  if (null1)
  {
    cached_result_type= arg2_type;
910
    collation.set(args[2]->collation.collation);
911 912 913
  }
  else if (null2)
  {
unknown's avatar
unknown committed
914
    cached_result_type= arg1_type;
915
    collation.set(args[1]->collation.collation);
916
  }
unknown's avatar
unknown committed
917
  else
918
  {
919 920 921 922 923 924
    agg_result_type(&cached_result_type, args+1, 2);
    if (cached_result_type == STRING_RESULT)
    {
      if (agg_arg_collations(collation, args+1, 2))
      return;
    }
925
    else
926
    {
927
      collation.set(&my_charset_bin);	// Number
928
    }
929
  }
unknown's avatar
unknown committed
930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955
}


double
Item_func_if::val()
{
  Item *arg= args[0]->val_int() ? args[1] : args[2];
  double value=arg->val();
  null_value=arg->null_value;
  return value;
}

longlong
Item_func_if::val_int()
{
  Item *arg= args[0]->val_int() ? args[1] : args[2];
  longlong value=arg->val_int();
  null_value=arg->null_value;
  return value;
}

String *
Item_func_if::val_str(String *str)
{
  Item *arg= args[0]->val_int() ? args[1] : args[2];
  String *res=arg->val_str(str);
956
  if (res)
957
    res->set_charset(collation.collation);
unknown's avatar
unknown committed
958 959 960 961 962 963 964 965 966 967 968 969 970 971
  null_value=arg->null_value;
  return res;
}


void
Item_func_nullif::fix_length_and_dec()
{
  Item_bool_func2::fix_length_and_dec();
  maybe_null=1;
  if (args[0])					// Only false if EOM
  {
    max_length=args[0]->max_length;
    decimals=args[0]->decimals;
972
    agg_result_type(&cached_result_type, args, 2);
unknown's avatar
unknown committed
973 974 975 976
  }
}

/*
977
  nullif () returns NULL if arguments are equal, else it returns the
unknown's avatar
unknown committed
978 979 980 981 982 983 984 985 986
  first argument.
  Note that we have to evaluate the first argument twice as the compare
  may have been done with a different type than return value
*/

double
Item_func_nullif::val()
{
  double value;
987
  if (!cmp.compare() || null_value)
unknown's avatar
unknown committed
988 989 990 991 992 993 994 995 996 997 998 999 1000
  {
    null_value=1;
    return 0.0;
  }
  value=args[0]->val();
  null_value=args[0]->null_value;
  return value;
}

longlong
Item_func_nullif::val_int()
{
  longlong value;
1001
  if (!cmp.compare() || null_value)
unknown's avatar
unknown committed
1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014
  {
    null_value=1;
    return 0;
  }
  value=args[0]->val_int();
  null_value=args[0]->null_value;
  return value;
}

String *
Item_func_nullif::val_str(String *str)
{
  String *res;
1015
  if (!cmp.compare() || null_value)
unknown's avatar
unknown committed
1016 1017 1018 1019 1020 1021 1022 1023 1024 1025
  {
    null_value=1;
    return 0;
  }
  res=args[0]->val_str(str);
  null_value=args[0]->null_value;
  return res;
}

/*
1026 1027
  CASE expression 
  Return the matching ITEM or NULL if all compares (including else) failed
unknown's avatar
unknown committed
1028 1029 1030 1031 1032 1033 1034
*/

Item *Item_func_case::find_item(String *str)
{
  String *first_expr_str,*tmp;
  longlong first_expr_int;
  double   first_expr_real;
unknown's avatar
unknown committed
1035
  
unknown's avatar
unknown committed
1036 1037 1038 1039 1040
  /* These will be initialized later */
  LINT_INIT(first_expr_str);
  LINT_INIT(first_expr_int);
  LINT_INIT(first_expr_real);

unknown's avatar
unknown committed
1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067
  if (first_expr_num != -1)
  {
    switch (cmp_type)
    {
      case STRING_RESULT:
      	// We can't use 'str' here as this may be overwritten
	if (!(first_expr_str= args[first_expr_num]->val_str(&str_value)))
	  return else_expr_num != -1 ? args[else_expr_num] : 0;	// Impossible
        break;
      case INT_RESULT:
	first_expr_int= args[first_expr_num]->val_int();
	if (args[first_expr_num]->null_value)
	  return else_expr_num != -1 ? args[else_expr_num] : 0;
	break;
      case REAL_RESULT:
	first_expr_real= args[first_expr_num]->val();
	if (args[first_expr_num]->null_value)
	  return else_expr_num != -1 ? args[else_expr_num] : 0;
	break;
      case ROW_RESULT:
      default:
	// This case should never be choosen
	DBUG_ASSERT(0);
	break;
    }
  }

unknown's avatar
unknown committed
1068
  // Compare every WHEN argument with it and return the first match
1069
  for (uint i=0 ; i < ncases ; i+=2)
unknown's avatar
unknown committed
1070
  {
1071
    if (first_expr_num == -1)
unknown's avatar
unknown committed
1072
    {
unknown's avatar
unknown committed
1073
      // No expression between CASE and the first WHEN
unknown's avatar
unknown committed
1074 1075 1076 1077
      if (args[i]->val_int())
	return args[i+1];
      continue;
    }
unknown's avatar
unknown committed
1078
    switch (cmp_type) {
unknown's avatar
unknown committed
1079 1080
    case STRING_RESULT:
      if ((tmp=args[i]->val_str(str)))		// If not null
unknown's avatar
unknown committed
1081
	if (sortcmp(tmp,first_expr_str,cmp_collation.collation)==0)
unknown's avatar
unknown committed
1082 1083 1084 1085 1086 1087 1088 1089 1090
	  return args[i+1];
      break;
    case INT_RESULT:
      if (args[i]->val_int()==first_expr_int && !args[i]->null_value) 
        return args[i+1];
      break;
    case REAL_RESULT: 
      if (args[i]->val()==first_expr_real && !args[i]->null_value) 
        return args[i+1];
unknown's avatar
unknown committed
1091
      break;
1092
    case ROW_RESULT:
unknown's avatar
unknown committed
1093
    default:
unknown's avatar
unknown committed
1094 1095 1096
      // This case should never be choosen
      DBUG_ASSERT(0);
      break;
unknown's avatar
unknown committed
1097 1098 1099
    }
  }
  // No, WHEN clauses all missed, return ELSE expression
1100
  return else_expr_num != -1 ? args[else_expr_num] : 0;
unknown's avatar
unknown committed
1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114
}



String *Item_func_case::val_str(String *str)
{
  String *res;
  Item *item=find_item(str);

  if (!item)
  {
    null_value=1;
    return 0;
  }
unknown's avatar
unknown committed
1115
  null_value= 0;
unknown's avatar
unknown committed
1116
  if (!(res=item->val_str(str)))
unknown's avatar
unknown committed
1117
    null_value= 1;
unknown's avatar
unknown committed
1118 1119 1120 1121 1122 1123 1124
  return res;
}


longlong Item_func_case::val_int()
{
  char buff[MAX_FIELD_WIDTH];
1125
  String dummy_str(buff,sizeof(buff),default_charset());
unknown's avatar
unknown committed
1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141
  Item *item=find_item(&dummy_str);
  longlong res;

  if (!item)
  {
    null_value=1;
    return 0;
  }
  res=item->val_int();
  null_value=item->null_value;
  return res;
}

double Item_func_case::val()
{
  char buff[MAX_FIELD_WIDTH];
1142
  String dummy_str(buff,sizeof(buff),default_charset());
unknown's avatar
unknown committed
1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156
  Item *item=find_item(&dummy_str);
  double res;

  if (!item)
  {
    null_value=1;
    return 0;
  }
  res=item->val();
  null_value=item->null_value;
  return res;
}

void Item_func_case::fix_length_and_dec()
1157
{
1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178
  Item **agg;
  uint nagg;
  
  if (!(agg= (Item**) sql_alloc(sizeof(Item*)*(ncases+1))))
    return;
  
  // Aggregate all THEN and ELSE expression types
  // and collations when string result
  
  for (nagg= 0 ; nagg < ncases/2 ; nagg++)
    agg[nagg]= args[nagg*2+1];
  
  if (else_expr_num != -1)
    agg[nagg++]= args[else_expr_num];
  
  agg_result_type(&cached_result_type, agg, nagg);
  if ((cached_result_type == STRING_RESULT) &&
      agg_arg_collations(collation, agg, nagg))
    return;
  
  
unknown's avatar
unknown committed
1179 1180 1181 1182
  /*
    Aggregate first expression and all THEN expression types
    and collations when string comparison
  */
1183
  if (first_expr_num != -1)
1184
  {
1185 1186
    agg[0]= args[first_expr_num];
    for (nagg= 0; nagg < ncases/2 ; nagg++)
unknown's avatar
unknown committed
1187
      agg[nagg+1]= args[nagg*2];
1188 1189 1190 1191 1192
    nagg++;
    agg_cmp_type(&cmp_type, agg, nagg);
    if ((cmp_type == STRING_RESULT) &&
        agg_arg_collations_for_comparison(cmp_collation, agg, nagg))
    return;
1193
  }
1194
  
unknown's avatar
unknown committed
1195
  if (else_expr_num == -1 || args[else_expr_num]->maybe_null)
1196
    maybe_null=1;
1197
  
unknown's avatar
unknown committed
1198 1199
  max_length=0;
  decimals=0;
1200
  for (uint i=0 ; i < ncases ; i+=2)
unknown's avatar
unknown committed
1201 1202 1203 1204
  {
    set_if_bigger(max_length,args[i+1]->max_length);
    set_if_bigger(decimals,args[i+1]->decimals);
  }
1205
  if (else_expr_num != -1) 
unknown's avatar
unknown committed
1206
  {
1207 1208
    set_if_bigger(max_length,args[else_expr_num]->max_length);
    set_if_bigger(decimals,args[else_expr_num]->decimals);
unknown's avatar
unknown committed
1209 1210 1211
  }
}

unknown's avatar
unknown committed
1212

1213
/* TODO:  Fix this so that it prints the whole CASE expression */
unknown's avatar
unknown committed
1214 1215 1216

void Item_func_case::print(String *str)
{
1217
  str->append("(case ", 6);
1218 1219 1220 1221 1222 1223 1224
  if (first_expr_num != -1)
  {
    args[first_expr_num]->print(str);
    str->append(' ');
  }
  for (uint i=0 ; i < ncases ; i+=2)
  {
1225
    str->append("when ", 5);
1226
    args[i]->print(str);
1227
    str->append(" then ", 6);
1228 1229 1230 1231 1232
    args[i+1]->print(str);
    str->append(' ');
  }
  if (else_expr_num != -1)
  {
1233
    str->append("else ", 5);
1234 1235 1236
    args[else_expr_num]->print(str);
    str->append(' ');
  }
1237
  str->append("end)", 4);
unknown's avatar
unknown committed
1238 1239 1240
}

/*
1241
  Coalesce - return first not NULL argument.
unknown's avatar
unknown committed
1242 1243 1244 1245 1246 1247 1248
*/

String *Item_func_coalesce::val_str(String *str)
{
  null_value=0;
  for (uint i=0 ; i < arg_count ; i++)
  {
unknown's avatar
unknown committed
1249 1250 1251
    String *res;
    if ((res=args[i]->val_str(str)))
      return res;
unknown's avatar
unknown committed
1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285
  }
  null_value=1;
  return 0;
}

longlong Item_func_coalesce::val_int()
{
  null_value=0;
  for (uint i=0 ; i < arg_count ; i++)
  {
    longlong res=args[i]->val_int();
    if (!args[i]->null_value)
      return res;
  }
  null_value=1;
  return 0;
}

double Item_func_coalesce::val()
{
  null_value=0;
  for (uint i=0 ; i < arg_count ; i++)
  {
    double res=args[i]->val();
    if (!args[i]->null_value)
      return res;
  }
  null_value=1;
  return 0;
}


void Item_func_coalesce::fix_length_and_dec()
{
unknown's avatar
unknown committed
1286 1287
  max_length= 0;
  decimals= 0;
1288
  agg_result_type(&cached_result_type, args, arg_count);
unknown's avatar
unknown committed
1289 1290 1291 1292 1293
  for (uint i=0 ; i < arg_count ; i++)
  {
    set_if_bigger(max_length,args[i]->max_length);
    set_if_bigger(decimals,args[i]->decimals);
  }
1294 1295 1296 1297
  if (cached_result_type == STRING_RESULT)
    agg_arg_collations(collation, args, arg_count);
  else if (cached_result_type != REAL_RESULT)
    decimals= 0;
unknown's avatar
unknown committed
1298 1299 1300
}

/****************************************************************************
1301
 Classes and function for the IN operator
unknown's avatar
unknown committed
1302 1303
****************************************************************************/

1304
static int cmp_longlong(void *cmp_arg, longlong *a,longlong *b)
unknown's avatar
unknown committed
1305 1306 1307 1308
{
  return *a < *b ? -1 : *a == *b ? 0 : 1;
}

1309
static int cmp_double(void *cmp_arg, double *a,double *b)
unknown's avatar
unknown committed
1310 1311 1312 1313
{
  return *a < *b ? -1 : *a == *b ? 0 : 1;
}

1314
static int cmp_row(void *cmp_arg, cmp_item_row* a, cmp_item_row* b)
unknown's avatar
unknown committed
1315 1316 1317 1318
{
  return a->compare(b);
}

unknown's avatar
unknown committed
1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330
int in_vector::find(Item *item)
{
  byte *result=get_value(item);
  if (!result || !used_count)
    return 0;				// Null value

  uint start,end;
  start=0; end=used_count-1;
  while (start != end)
  {
    uint mid=(start+end+1)/2;
    int res;
1331
    if ((res=(*compare)(collation, base+mid*size, result)) == 0)
unknown's avatar
unknown committed
1332 1333 1334 1335 1336 1337
      return 1;
    if (res < 0)
      start=mid;
    else
      end=mid-1;
  }
1338
  return (int) ((*compare)(collation, base+start*size, result) == 0);
unknown's avatar
unknown committed
1339 1340
}

1341 1342
in_string::in_string(uint elements,qsort2_cmp cmp_func, CHARSET_INFO *cs)
  :in_vector(elements, sizeof(String), cmp_func, cs),
1343
   tmp(buff, sizeof(buff), &my_charset_bin)
unknown's avatar
unknown committed
1344 1345 1346 1347
{}

in_string::~in_string()
{
1348
  if (base)
1349
  {
unknown's avatar
unknown committed
1350
    // base was allocated with help of sql_alloc => following is OK
1351 1352
    for (uint i=0 ; i < count ; i++)
      ((String*) base)[i].free();
1353
  }
unknown's avatar
unknown committed
1354 1355 1356 1357 1358 1359 1360 1361
}

void in_string::set(uint pos,Item *item)
{
  String *str=((String*) base)+pos;
  String *res=item->val_str(str);
  if (res && res != str)
    *str= *res;
1362
  if (!str->charset())
1363 1364
  {
    CHARSET_INFO *cs;
1365
    if (!(cs= item->collation.collation))
1366
      cs= &my_charset_bin;		// Should never happen for STR items
1367 1368
    str->set_charset(cs);
  }
unknown's avatar
unknown committed
1369 1370
}

1371

unknown's avatar
unknown committed
1372 1373 1374 1375 1376
byte *in_string::get_value(Item *item)
{
  return (byte*) item->val_str(&tmp);
}

unknown's avatar
unknown committed
1377 1378
in_row::in_row(uint elements, Item * item)
{
1379
  base= (char*) new cmp_item_row[count= elements];
unknown's avatar
unknown committed
1380
  size= sizeof(cmp_item_row);
1381
  compare= (qsort2_cmp) cmp_row;
unknown's avatar
unknown committed
1382
  tmp.store_value(item);
1383 1384 1385 1386 1387
}

in_row::~in_row()
{
  if (base)
1388
    delete [] (cmp_item_row*) base;
unknown's avatar
unknown committed
1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403
}

byte *in_row::get_value(Item *item)
{
  tmp.store_value(item);
  return (byte *)&tmp;
}

void in_row::set(uint pos, Item *item)
{
  DBUG_ENTER("in_row::set");
  DBUG_PRINT("enter", ("pos %u item 0x%lx", pos, (ulong) item));
  ((cmp_item_row*) base)[pos].store_value_by_template(&tmp, item);
  DBUG_VOID_RETURN;
}
unknown's avatar
unknown committed
1404 1405

in_longlong::in_longlong(uint elements)
1406
  :in_vector(elements,sizeof(longlong),(qsort2_cmp) cmp_longlong, 0)
unknown's avatar
unknown committed
1407 1408 1409 1410 1411 1412 1413 1414 1415
{}

void in_longlong::set(uint pos,Item *item)
{
  ((longlong*) base)[pos]=item->val_int();
}

byte *in_longlong::get_value(Item *item)
{
unknown's avatar
unknown committed
1416
  tmp= item->val_int();
unknown's avatar
unknown committed
1417
  if (item->null_value)
unknown's avatar
unknown committed
1418
    return 0;
unknown's avatar
unknown committed
1419 1420 1421 1422
  return (byte*) &tmp;
}

in_double::in_double(uint elements)
1423
  :in_vector(elements,sizeof(double),(qsort2_cmp) cmp_double, 0)
unknown's avatar
unknown committed
1424 1425 1426 1427 1428 1429 1430 1431 1432
{}

void in_double::set(uint pos,Item *item)
{
  ((double*) base)[pos]=item->val();
}

byte *in_double::get_value(Item *item)
{
unknown's avatar
unknown committed
1433
  tmp= item->val();
unknown's avatar
unknown committed
1434
  if (item->null_value)
1435
    return 0;					/* purecov: inspected */
unknown's avatar
unknown committed
1436 1437 1438
  return (byte*) &tmp;
}

1439
cmp_item* cmp_item::get_comparator(Item *item)
1440 1441 1442
{
  switch (item->result_type()) {
  case STRING_RESULT:
1443
    return new cmp_item_sort_string(item->collation.collation);
1444 1445 1446 1447 1448 1449 1450 1451 1452 1453
    break;
  case INT_RESULT:
    return new cmp_item_int;
    break;
  case REAL_RESULT:
    return new cmp_item_real;
    break;
  case ROW_RESULT:
    return new cmp_item_row;
    break;
unknown's avatar
unknown committed
1454 1455 1456
  default:
    DBUG_ASSERT(0);
    break;
1457 1458 1459 1460
  }
  return 0; // to satisfy compiler :)
}

1461

unknown's avatar
unknown committed
1462 1463
cmp_item* cmp_item_sort_string::make_same()
{
1464
  return new cmp_item_sort_string_in_static(cmp_charset);
unknown's avatar
unknown committed
1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481
}

cmp_item* cmp_item_int::make_same()
{
  return new cmp_item_int();
}

cmp_item* cmp_item_real::make_same()
{
  return new cmp_item_real();
}

cmp_item* cmp_item_row::make_same()
{
  return new cmp_item_row();
}

1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498

cmp_item_row::~cmp_item_row()
{
  DBUG_ENTER("~cmp_item_row");
  DBUG_PRINT("enter",("this: %lx", this));
  if (comparators)
  {
    for (uint i= 0; i < n; i++)
    {
      if (comparators[i])
	delete comparators[i];
    }
  }
  DBUG_VOID_RETURN;
}


1499 1500
void cmp_item_row::store_value(Item *item)
{
1501
  DBUG_ENTER("cmp_item_row::store_value");
1502
  n= item->cols();
1503
  if (!comparators)
unknown's avatar
unknown committed
1504
    comparators= (cmp_item **) current_thd->calloc(sizeof(cmp_item *)*n);
1505
  if (comparators)
1506
  {
1507
    item->bring_value();
unknown's avatar
unknown committed
1508
    item->null_value= 0;
1509
    for (uint i=0; i < n; i++)
1510
    {
unknown's avatar
unknown committed
1511 1512 1513
      if (!comparators[i])
	if (!(comparators[i]= cmp_item::get_comparator(item->el(i))))
	  break;					// new failed
1514 1515 1516
      comparators[i]->store_value(item->el(i));
      item->null_value|= item->el(i)->null_value;
    }
1517
  }
1518
  DBUG_VOID_RETURN;
1519 1520
}

1521

unknown's avatar
unknown committed
1522 1523 1524 1525 1526
void cmp_item_row::store_value_by_template(cmp_item *t, Item *item)
{
  cmp_item_row *tmpl= (cmp_item_row*) t;
  if (tmpl->n != item->cols())
  {
unknown's avatar
unknown committed
1527
    my_error(ER_OPERAND_COLUMNS, MYF(0), tmpl->n);
unknown's avatar
unknown committed
1528 1529 1530 1531 1532
    return;
  }
  n= tmpl->n;
  if ((comparators= (cmp_item **) sql_alloc(sizeof(cmp_item *)*n)))
  {
1533
    item->bring_value();
unknown's avatar
unknown committed
1534 1535
    item->null_value= 0;
    for (uint i=0; i < n; i++)
1536 1537 1538 1539 1540 1541 1542
    {
      if (!(comparators[i]= tmpl->comparators[i]->make_same()))
	break;					// new failed
      comparators[i]->store_value_by_template(tmpl->comparators[i],
					      item->el(i));
      item->null_value|= item->el(i)->null_value;
    }
unknown's avatar
unknown committed
1543 1544 1545
  }
}

1546

1547 1548
int cmp_item_row::cmp(Item *arg)
{
unknown's avatar
unknown committed
1549 1550 1551
  arg->null_value= 0;
  if (arg->cols() != n)
  {
unknown's avatar
unknown committed
1552
    my_error(ER_OPERAND_COLUMNS, MYF(0), n);
unknown's avatar
unknown committed
1553 1554
    return 1;
  }
unknown's avatar
unknown committed
1555
  bool was_null= 0;
1556
  arg->bring_value();
unknown's avatar
unknown committed
1557
  for (uint i=0; i < n; i++)
1558
  {
unknown's avatar
unknown committed
1559
    if (comparators[i]->cmp(arg->el(i)))
unknown's avatar
unknown committed
1560
    {
unknown's avatar
unknown committed
1561 1562 1563
      if (!arg->el(i)->null_value)
	return 1;
      was_null= 1;
unknown's avatar
unknown committed
1564
    }
1565
  }
unknown's avatar
unknown committed
1566
  return (arg->null_value= was_null);
unknown's avatar
unknown committed
1567 1568
}

1569

unknown's avatar
unknown committed
1570 1571 1572
int cmp_item_row::compare(cmp_item *c)
{
  cmp_item_row *cmp= (cmp_item_row *) c;
unknown's avatar
unknown committed
1573
  for (uint i=0; i < n; i++)
1574 1575
  {
    int res;
unknown's avatar
unknown committed
1576
    if ((res= comparators[i]->compare(cmp->comparators[i])))
unknown's avatar
unknown committed
1577
      return res;
1578
  }
1579 1580
  return 0;
}
unknown's avatar
unknown committed
1581

1582

unknown's avatar
unknown committed
1583 1584 1585
bool Item_func_in::nulls_in_row()
{
  Item **arg,**arg_end;
1586
  for (arg= args+1, arg_end= args+arg_count; arg != arg_end ; arg++)
unknown's avatar
unknown committed
1587 1588 1589 1590 1591 1592 1593
  {
    if ((*arg)->null_inside())
      return 1;
  }
  return 0;
}

1594

1595
static int srtcmp_in(CHARSET_INFO *cs, const String *x,const String *y)
1596
{
1597
  return cs->coll->strnncollsp(cs,
1598 1599 1600 1601
                        (unsigned char *) x->ptr(),x->length(),
			(unsigned char *) y->ptr(),y->length());
}

1602

unknown's avatar
unknown committed
1603 1604
void Item_func_in::fix_length_and_dec()
{
1605 1606 1607
  Item **arg, **arg_end;
  uint const_itm= 1;
  
1608 1609
  agg_cmp_type(&cmp_type, args, arg_count);
  if ((cmp_type == STRING_RESULT) &&
1610 1611 1612 1613 1614 1615
      (agg_arg_collations_for_comparison(cmp_collation, args, arg_count)))
    return;
  
  for (arg=args+1, arg_end=args+arg_count; arg != arg_end ; arg++)
    const_itm&= arg[0]->const_item();
  
unknown's avatar
unknown committed
1616 1617 1618 1619
  /*
    Row item with NULLs inside can return NULL or FALSE => 
    they can't be processed as static
  */
1620
  if (const_itm && !nulls_in_row())
unknown's avatar
unknown committed
1621
  {
1622
    switch (cmp_type) {
unknown's avatar
unknown committed
1623
    case STRING_RESULT:
1624
      array=new in_string(arg_count-1,(qsort2_cmp) srtcmp_in, 
1625
			  cmp_collation.collation);
unknown's avatar
unknown committed
1626 1627
      break;
    case INT_RESULT:
1628
      array= new in_longlong(arg_count-1);
unknown's avatar
unknown committed
1629 1630
      break;
    case REAL_RESULT:
1631
      array= new in_double(arg_count-1);
unknown's avatar
unknown committed
1632
      break;
unknown's avatar
unknown committed
1633
    case ROW_RESULT:
1634
      array= new in_row(arg_count-1, args[0]);
unknown's avatar
unknown committed
1635
      break;
unknown's avatar
unknown committed
1636 1637 1638
    default:
      DBUG_ASSERT(0);
      return;
unknown's avatar
unknown committed
1639
    }
unknown's avatar
unknown committed
1640
    if (array && !(current_thd->is_fatal_error))	// If not EOM
unknown's avatar
unknown committed
1641
    {
unknown's avatar
unknown committed
1642
      uint j=0;
unknown's avatar
unknown committed
1643
      for (uint i=1 ; i < arg_count ; i++)
unknown's avatar
unknown committed
1644 1645 1646 1647
      {
	array->set(j,args[i]);
	if (!args[i]->null_value)			// Skip NULL values
	  j++;
unknown's avatar
unknown committed
1648 1649
	else
	  have_null= 1;
unknown's avatar
unknown committed
1650 1651 1652
      }
      if ((array->used_count=j))
	array->sort();
unknown's avatar
unknown committed
1653 1654 1655 1656
    }
  }
  else
  {
1657
    in_item= cmp_item::get_comparator(args[0]);
1658
    if (cmp_type  == STRING_RESULT)
1659
      in_item->cmp_charset= cmp_collation.collation;
unknown's avatar
unknown committed
1660
  }
1661
  maybe_null= args[0]->maybe_null;
unknown's avatar
unknown committed
1662
  max_length= 1;
unknown's avatar
unknown committed
1663 1664 1665 1666 1667 1668
}


void Item_func_in::print(String *str)
{
  str->append('(');
1669
  args[0]->print(str);
1670
  str->append(" in (", 5);
unknown's avatar
unknown committed
1671
  print_args(str, 1);
1672
  str->append("))", 2);
unknown's avatar
unknown committed
1673 1674 1675 1676 1677 1678 1679
}


longlong Item_func_in::val_int()
{
  if (array)
  {
1680 1681
    int tmp=array->find(args[0]);
    null_value=args[0]->null_value || (!tmp && have_null);
unknown's avatar
unknown committed
1682 1683
    return tmp;
  }
1684 1685
  in_item->store_value(args[0]);
  if ((null_value=args[0]->null_value))
unknown's avatar
unknown committed
1686
    return 0;
1687
  have_null= 0;
1688
  for (uint i=1 ; i < arg_count ; i++)
unknown's avatar
unknown committed
1689 1690 1691
  {
    if (!in_item->cmp(args[i]) && !args[i]->null_value)
      return 1;					// Would maybe be nice with i ?
1692
    have_null|= args[i]->null_value;
unknown's avatar
unknown committed
1693
  }
1694
  null_value= have_null;
unknown's avatar
unknown committed
1695 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 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735
  return 0;
}


longlong Item_func_bit_or::val_int()
{
  ulonglong arg1= (ulonglong) args[0]->val_int();
  if (args[0]->null_value)
  {
    null_value=1; /* purecov: inspected */
    return 0; /* purecov: inspected */
  }
  ulonglong arg2= (ulonglong) args[1]->val_int();
  if (args[1]->null_value)
  {
    null_value=1;
    return 0;
  }
  null_value=0;
  return (longlong) (arg1 | arg2);
}


longlong Item_func_bit_and::val_int()
{
  ulonglong arg1= (ulonglong) args[0]->val_int();
  if (args[0]->null_value)
  {
    null_value=1; /* purecov: inspected */
    return 0; /* purecov: inspected */
  }
  ulonglong arg2= (ulonglong) args[1]->val_int();
  if (args[1]->null_value)
  {
    null_value=1; /* purecov: inspected */
    return 0; /* purecov: inspected */
  }
  null_value=0;
  return (longlong) (arg1 & arg2);
}

1736
Item_cond::Item_cond(THD *thd, Item_cond *item)
1737
  :Item_bool_func(thd, item),
1738 1739
   abort_on_null(item->abort_on_null),
   and_tables_cache(item->and_tables_cache)
1740 1741
{
  /*
unknown's avatar
unknown committed
1742
    item->list will be copied by copy_andor_arguments() call
1743 1744 1745
  */
}

unknown's avatar
unknown committed
1746

1747 1748 1749
void Item_cond::copy_andor_arguments(THD *thd, Item_cond *item)
{
  List_iterator_fast<Item> li(item->list);
unknown's avatar
unknown committed
1750
  while (Item *it= li++)
1751 1752
    list.push_back(it->copy_andor_structure(thd));
}
unknown's avatar
unknown committed
1753

unknown's avatar
unknown committed
1754

unknown's avatar
unknown committed
1755
bool
unknown's avatar
unknown committed
1756
Item_cond::fix_fields(THD *thd, TABLE_LIST *tables, Item **ref)
unknown's avatar
unknown committed
1757 1758 1759
{
  List_iterator<Item> li(list);
  Item *item;
1760
#ifndef EMBEDDED_LIBRARY
unknown's avatar
unknown committed
1761
  char buff[sizeof(char*)];			// Max local vars in function
1762
#endif
1763 1764
  not_null_tables_cache= used_tables_cache= 0;
  const_item_cache= 0;
1765 1766 1767 1768 1769
  /*
    and_table_cache is the value that Item_cond_or() returns for
    not_null_tables()
  */
  and_tables_cache= ~(table_map) 0;
unknown's avatar
unknown committed
1770

unknown's avatar
unknown committed
1771
  if (check_stack_overrun(thd, buff))
1772
    return 1;					// Fatal error flag is set!
unknown's avatar
unknown committed
1773 1774
  while ((item=li++))
  {
1775
    table_map tmp_table_map;
unknown's avatar
unknown committed
1776 1777 1778 1779 1780 1781 1782
    while (item->type() == Item::COND_ITEM &&
	   ((Item_cond*) item)->functype() == functype())
    {						// Identical function
      li.replace(((Item_cond*) item)->list);
      ((Item_cond*) item)->list.empty();
      item= *li.ref();				// new current item
    }
1783 1784
    if (abort_on_null)
      item->top_level_item();
1785 1786

    // item can be substituted in fix_fields
1787
    if ((!item->fixed &&
1788 1789
	 item->fix_fields(thd, tables, li.ref())) ||
	(item= *li.ref())->check_cols(1))
unknown's avatar
unknown committed
1790
      return 1; /* purecov: inspected */
1791 1792 1793 1794 1795 1796
    used_tables_cache|=     item->used_tables();
    tmp_table_map=	    item->not_null_tables();
    not_null_tables_cache|= tmp_table_map;
    and_tables_cache&=      tmp_table_map;
    const_item_cache&=	    item->const_item();
    with_sum_func=	    with_sum_func || item->with_sum_func;
unknown's avatar
unknown committed
1797 1798
    if (item->maybe_null)
      maybe_null=1;
unknown's avatar
unknown committed
1799
  }
1800
  thd->lex->current_select->cond_count+= list.elements;
unknown's avatar
unknown committed
1801
  fix_length_and_dec();
1802
  fixed= 1;
unknown's avatar
unknown committed
1803 1804 1805
  return 0;
}

unknown's avatar
unknown committed
1806 1807 1808 1809 1810 1811 1812 1813 1814 1815
bool Item_cond::walk(Item_processor processor, byte *arg)
{
  List_iterator_fast<Item> li(list);
  Item *item;
  while ((item= li++))
    if (item->walk(processor, arg))
      return 1;
  return Item_func::walk(processor, arg);
}

1816
void Item_cond::split_sum_func(Item **ref_pointer_array, List<Item> &fields)
unknown's avatar
unknown committed
1817 1818 1819 1820 1821 1822 1823 1824
{
  List_iterator<Item> li(list);
  Item *item;
  used_tables_cache=0;
  const_item_cache=0;
  while ((item=li++))
  {
    if (item->with_sum_func && item->type() != SUM_FUNC_ITEM)
1825
      item->split_sum_func(ref_pointer_array, fields);
unknown's avatar
unknown committed
1826 1827
    else if (item->used_tables() || item->type() == SUM_FUNC_ITEM)
    {
1828
      uint el= fields.elements;
unknown's avatar
unknown committed
1829
      fields.push_front(item);
1830
      ref_pointer_array[el]= item;
unknown's avatar
unknown committed
1831
      li.replace(new Item_ref(ref_pointer_array + el, li.ref(), 0, item->name));
unknown's avatar
unknown committed
1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845
    }
    item->update_used_tables();
    used_tables_cache|=item->used_tables();
    const_item_cache&=item->const_item();
  }
}


table_map
Item_cond::used_tables() const
{						// This caches used_tables
  return used_tables_cache;
}

1846

unknown's avatar
unknown committed
1847 1848
void Item_cond::update_used_tables()
{
unknown's avatar
unknown committed
1849
  List_iterator_fast<Item> li(list);
unknown's avatar
unknown committed
1850
  Item *item;
1851 1852 1853

  used_tables_cache=0;
  const_item_cache=1;
unknown's avatar
unknown committed
1854 1855 1856
  while ((item=li++))
  {
    item->update_used_tables();
1857 1858
    used_tables_cache|= item->used_tables();
    const_item_cache&=  item->const_item();
unknown's avatar
unknown committed
1859 1860 1861 1862 1863 1864 1865
  }
}


void Item_cond::print(String *str)
{
  str->append('(');
unknown's avatar
unknown committed
1866
  List_iterator_fast<Item> li(list);
unknown's avatar
unknown committed
1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879
  Item *item;
  if ((item=li++))
    item->print(str);
  while ((item=li++))
  {
    str->append(' ');
    str->append(func_name());
    str->append(' ');
    item->print(str);
  }
  str->append(')');
}

1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892

void Item_cond::neg_arguments()
{
  List_iterator<Item> li(list);
  Item *item;
  while ((item= li++))		/* Apply not transformation to the arguments */
  {
    Item *new_item= item->neg_transformer();
    VOID(li.replace(new_item ? new_item : new Item_func_not(item)));
  }
}


1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909
/*
  Evalution of AND(expr, expr, expr ...)

  NOTES:
    abort_if_null is set for AND expressions for which we don't care if the
    result is NULL or 0. This is set for:
    - WHERE clause
    - HAVING clause
    - IF(expression)

  RETURN VALUES
    1  If all expressions are true
    0  If all expressions are false or if we find a NULL expression and
       'abort_on_null' is set.
    NULL if all expression are either 1 or NULL
*/

unknown's avatar
unknown committed
1910 1911 1912

longlong Item_cond_and::val_int()
{
unknown's avatar
unknown committed
1913
  List_iterator_fast<Item> li(list);
unknown's avatar
unknown committed
1914
  Item *item;
1915
  null_value= 0;
unknown's avatar
unknown committed
1916 1917 1918 1919
  while ((item=li++))
  {
    if (item->val_int() == 0)
    {
1920 1921
      if (abort_on_null || !(null_value= item->null_value))
	return 0;				// return FALSE
unknown's avatar
unknown committed
1922 1923
    }
  }
1924
  return null_value ? 0 : 1;
unknown's avatar
unknown committed
1925 1926
}

1927

unknown's avatar
unknown committed
1928 1929
longlong Item_cond_or::val_int()
{
unknown's avatar
unknown committed
1930
  List_iterator_fast<Item> li(list);
unknown's avatar
unknown committed
1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945
  Item *item;
  null_value=0;
  while ((item=li++))
  {
    if (item->val_int() != 0)
    {
      null_value=0;
      return 1;
    }
    if (item->null_value)
      null_value=1;
  }
  return 0;
}

1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969
/*
  Create an AND expression from two expressions

  SYNOPSIS
   and_expressions()
   a		expression or NULL
   b    	expression.
   org_item	Don't modify a if a == *org_item
		If a == NULL, org_item is set to point at b,
		to ensure that future calls will not modify b.

  NOTES
    This will not modify item pointed to by org_item or b
    The idea is that one can call this in a loop and create and
    'and' over all items without modifying any of the original items.

  RETURN
    NULL	Error
    Item
*/

Item *and_expressions(Item *a, Item *b, Item **org_item)
{
  if (!a)
1970
    return (*org_item= (Item*) b);
1971 1972 1973
  if (a == *org_item)
  {
    Item_cond *res;
1974
    if ((res= new Item_cond_and(a, (Item*) b)))
1975
    {
1976
      res->used_tables_cache= a->used_tables() | b->used_tables();
1977 1978
      res->not_null_tables_cache= a->not_null_tables() | b->not_null_tables();
    }
1979 1980
    return res;
  }
1981
  if (((Item_cond_and*) a)->add((Item*) b))
1982 1983
    return 0;
  ((Item_cond_and*) a)->used_tables_cache|= b->used_tables();
1984
  ((Item_cond_and*) a)->not_null_tables_cache|= b->not_null_tables();
1985 1986 1987 1988
  return a;
}


unknown's avatar
unknown committed
1989 1990
longlong Item_func_isnull::val_int()
{
1991 1992 1993 1994 1995
  /*
    Handle optimization if the argument can't be null
    This has to be here because of the test in update_used_tables().
  */
  if (!used_tables_cache)
unknown's avatar
unknown committed
1996
    return cached_value;
unknown's avatar
unknown committed
1997
  return args[0]->is_null() ? 1: 0;
unknown's avatar
unknown committed
1998 1999
}

2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036
longlong Item_is_not_null_test::val_int()
{
  DBUG_ENTER("Item_is_not_null_test::val_int");
  if (!used_tables_cache)
  {
    owner->was_null|= (!cached_value);
    DBUG_PRINT("info", ("cached :%d", cached_value));
    DBUG_RETURN(cached_value);
  }
  if (args[0]->is_null())
  {
    DBUG_PRINT("info", ("null"))
    owner->was_null|= 1;
    DBUG_RETURN(0);
  }
  else
    DBUG_RETURN(1);
}

/* Optimize case of not_null_column IS NULL */
void Item_is_not_null_test::update_used_tables()
{
  if (!args[0]->maybe_null)
  {
    used_tables_cache= 0;			/* is always true */
    cached_value= (longlong) 1;
  }
  else
  {
    args[0]->update_used_tables();
    if (!(used_tables_cache=args[0]->used_tables()))
    {
      /* Remember if the value is always NULL or never NULL */
      cached_value= (longlong) !args[0]->is_null();
    }
  }
}
2037

2038

unknown's avatar
unknown committed
2039 2040
longlong Item_func_isnotnull::val_int()
{
unknown's avatar
unknown committed
2041
  return args[0]->is_null() ? 0 : 1;
unknown's avatar
unknown committed
2042 2043 2044
}


2045 2046 2047 2048
void Item_func_isnotnull::print(String *str)
{
  str->append('(');
  args[0]->print(str);
2049
  str->append(" is not null)", 13);
2050 2051 2052
}


unknown's avatar
unknown committed
2053 2054
longlong Item_func_like::val_int()
{
2055
  String* res = args[0]->val_str(&tmp_value1);
unknown's avatar
unknown committed
2056 2057 2058 2059 2060
  if (args[0]->null_value)
  {
    null_value=1;
    return 0;
  }
2061
  String* res2 = args[1]->val_str(&tmp_value2);
unknown's avatar
unknown committed
2062 2063 2064 2065 2066 2067
  if (args[1]->null_value)
  {
    null_value=1;
    return 0;
  }
  null_value=0;
2068 2069
  if (canDoTurboBM)
    return turboBM_matches(res->ptr(), res->length()) ? 1 : 0;
2070
  return my_wildcmp(cmp.cmp_collation.collation,
2071 2072 2073
		    res->ptr(),res->ptr()+res->length(),
		    res2->ptr(),res2->ptr()+res2->length(),
		    escape,wild_one,wild_many) ? 0 : 1;
unknown's avatar
unknown committed
2074 2075 2076 2077 2078 2079 2080
}


/* We can optimize a where if first character isn't a wildcard */

Item_func::optimize_type Item_func_like::select_optimize() const
{
2081
  if (args[1]->const_item())
unknown's avatar
unknown committed
2082
  {
2083 2084 2085 2086 2087 2088
    String* res2= args[1]->val_str((String *)&tmp_value2);

    if (!res2)
      return OPTIMIZE_NONE;

    if (*res2->ptr() != wild_many)
unknown's avatar
unknown committed
2089
    {
2090
      if (args[0]->result_type() != STRING_RESULT || *res2->ptr() != wild_one)
unknown's avatar
unknown committed
2091 2092 2093 2094 2095 2096
	return OPTIMIZE_OP;
    }
  }
  return OPTIMIZE_NONE;
}

2097

unknown's avatar
unknown committed
2098
bool Item_func_like::fix_fields(THD *thd, TABLE_LIST *tlist, Item ** ref)
2099
{
unknown's avatar
unknown committed
2100
  if (Item_bool_func2::fix_fields(thd, tlist, ref))
2101 2102
    return 1;

2103 2104 2105
  /*
    We could also do boyer-more for non-const items, but as we would have to
    recompute the tables for each row it's not worth it.
2106
  */
2107
  if (args[1]->const_item() && !use_strnxfrm(collation.collation) &&
2108
      !(specialflag & SPECIAL_NO_NEW_FUNC))
2109 2110
  {
    String* res2 = args[1]->val_str(&tmp_value2);
unknown's avatar
unknown committed
2111 2112 2113
    if (!res2)
      return 0;					// Null argument

2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126
    const size_t len   = res2->length();
    const char*  first = res2->ptr();
    const char*  last  = first + len - 1;
    /*
      len must be > 2 ('%pattern%')
      heuristic: only do TurboBM for pattern_len > 2
    */

    if (len > MIN_TURBOBM_PATTERN_LEN + 2 &&
	*first == wild_many &&
	*last  == wild_many)
    {
      const char* tmp = first + 1;
2127
      for (; *tmp != wild_many && *tmp != wild_one && *tmp != escape; tmp++) ;
2128
      canDoTurboBM = (tmp == last) && !use_mb(args[0]->collation.collation);
2129 2130 2131 2132 2133 2134
    }

    if (canDoTurboBM)
    {
      pattern     = first + 1;
      pattern_len = len - 2;
2135 2136 2137 2138 2139
      DBUG_PRINT("info", ("Initializing pattern: '%s'", first));
      int *suff = (int*) thd->alloc(sizeof(int)*((pattern_len + 1)*2+
						 alphabet_size));
      bmGs      = suff + pattern_len + 1;
      bmBc      = bmGs + pattern_len + 1;
2140 2141
      turboBM_compute_good_suffix_shifts(suff);
      turboBM_compute_bad_character_shifts();
2142
      DBUG_PRINT("info",("done"));
2143 2144 2145 2146 2147
    }
  }
  return 0;
}

unknown's avatar
unknown committed
2148 2149 2150
#ifdef USE_REGEX

bool
unknown's avatar
unknown committed
2151
Item_func_regex::fix_fields(THD *thd, TABLE_LIST *tables, Item **ref)
unknown's avatar
unknown committed
2152
{
unknown's avatar
unknown committed
2153 2154
  if (args[0]->fix_fields(thd, tables, args) || args[0]->check_cols(1) ||
      args[1]->fix_fields(thd,tables, args + 1) || args[1]->check_cols(1))
unknown's avatar
unknown committed
2155 2156
    return 1;					/* purecov: inspected */
  with_sum_func=args[0]->with_sum_func || args[1]->with_sum_func;
unknown's avatar
unknown committed
2157 2158
  max_length= 1;
  decimals= 0;
2159

unknown's avatar
unknown committed
2160
  if (agg_arg_collations(cmp_collation, args, 2))
2161
    return 1;
2162

unknown's avatar
unknown committed
2163
  used_tables_cache=args[0]->used_tables() | args[1]->used_tables();
2164 2165
  not_null_tables_cache= (args[0]->not_null_tables() |
			  args[1]->not_null_tables());
unknown's avatar
unknown committed
2166 2167 2168 2169
  const_item_cache=args[0]->const_item() && args[1]->const_item();
  if (!regex_compiled && args[1]->const_item())
  {
    char buff[MAX_FIELD_WIDTH];
2170
    String tmp(buff,sizeof(buff),&my_charset_bin);
unknown's avatar
unknown committed
2171 2172 2173 2174 2175 2176 2177 2178
    String *res=args[1]->val_str(&tmp);
    if (args[1]->null_value)
    {						// Will always return NULL
      maybe_null=1;
      return 0;
    }
    int error;
    if ((error=regcomp(&preg,res->c_ptr(),
2179 2180
		       (cmp_collation.collation->state & MY_CS_BINSORT) ?
		       REG_EXTENDED | REG_NOSUB :
2181
		       REG_EXTENDED | REG_NOSUB | REG_ICASE,
2182
		       cmp_collation.collation)))
unknown's avatar
unknown committed
2183 2184 2185 2186 2187 2188 2189 2190 2191 2192
    {
      (void) regerror(error,&preg,buff,sizeof(buff));
      my_printf_error(ER_REGEXP_ERROR,ER(ER_REGEXP_ERROR),MYF(0),buff);
      return 1;
    }
    regex_compiled=regex_is_const=1;
    maybe_null=args[0]->maybe_null;
  }
  else
    maybe_null=1;
2193
  fixed= 1;
unknown's avatar
unknown committed
2194 2195 2196
  return 0;
}

2197

unknown's avatar
unknown committed
2198 2199 2200
longlong Item_func_regex::val_int()
{
  char buff[MAX_FIELD_WIDTH];
2201
  String *res, tmp(buff,sizeof(buff),&my_charset_bin);
unknown's avatar
unknown committed
2202 2203 2204 2205 2206 2207 2208 2209 2210 2211

  res=args[0]->val_str(&tmp);
  if (args[0]->null_value)
  {
    null_value=1;
    return 0;
  }
  if (!regex_is_const)
  {
    char buff2[MAX_FIELD_WIDTH];
2212
    String *res2, tmp2(buff2,sizeof(buff2),&my_charset_bin);
unknown's avatar
unknown committed
2213 2214 2215 2216 2217 2218 2219

    res2= args[1]->val_str(&tmp2);
    if (args[1]->null_value)
    {
      null_value=1;
      return 0;
    }
unknown's avatar
unknown committed
2220
    if (!regex_compiled || stringcmp(res2,&prev_regexp))
unknown's avatar
unknown committed
2221 2222 2223 2224 2225 2226 2227 2228
    {
      prev_regexp.copy(*res2);
      if (regex_compiled)
      {
	regfree(&preg);
	regex_compiled=0;
      }
      if (regcomp(&preg,res2->c_ptr(),
2229 2230
		  (cmp_collation.collation->state & MY_CS_BINSORT) ?
		  REG_EXTENDED | REG_NOSUB :
2231
		  REG_EXTENDED | REG_NOSUB | REG_ICASE,
2232
		  cmp_collation.collation))
unknown's avatar
unknown committed
2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254
      {
	null_value=1;
	return 0;
      }
      regex_compiled=1;
    }
  }
  null_value=0;
  return regexec(&preg,res->c_ptr(),0,(regmatch_t*) 0,0) ? 0 : 1;
}


Item_func_regex::~Item_func_regex()
{
  if (regex_compiled)
  {
    regfree(&preg);
    regex_compiled=0;
  }
}

#endif /* USE_REGEX */
2255 2256 2257


#ifdef LIKE_CMP_TOUPPER
unknown's avatar
unknown committed
2258
#define likeconv(cs,A) (uchar) (cs)->toupper(A)
2259
#else
unknown's avatar
unknown committed
2260
#define likeconv(cs,A) (uchar) (cs)->sort_order[(uchar) (A)]
2261 2262 2263 2264 2265 2266 2267 2268
#endif


/**********************************************************************
  turboBM_compute_suffixes()
  Precomputation dependent only on pattern_len.
**********************************************************************/

2269
void Item_func_like::turboBM_compute_suffixes(int *suff)
2270 2271 2272 2273
{
  const int   plm1 = pattern_len - 1;
  int            f = 0;
  int            g = plm1;
unknown's avatar
unknown committed
2274
  int *const splm1 = suff + plm1;
2275
  CHARSET_INFO	*cs= cmp.cmp_collation.collation;
2276 2277 2278

  *splm1 = pattern_len;

2279
  if (cs == &my_charset_bin)
2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310
  {
    int i;
    for (i = pattern_len - 2; i >= 0; i--)
    {
      int tmp = *(splm1 + i - f);
      if (g < i && tmp < i - g)
	suff[i] = tmp;
      else
      {
	if (i < g)
	  g = i; // g = min(i, g)
	f = i;
	while (g >= 0 && pattern[g] == pattern[g + plm1 - f])
	  g--;
	suff[i] = f - g;
      }
    }
  }
  else
  {
    int i;
    for (i = pattern_len - 2; 0 <= i; --i)
    {
      int tmp = *(splm1 + i - f);
      if (g < i && tmp < i - g)
	suff[i] = tmp;
      else
      {
	if (i < g)
	  g = i; // g = min(i, g)
	f = i;
2311
	while (g >= 0 &&
unknown's avatar
unknown committed
2312
	       likeconv(cs, pattern[g]) == likeconv(cs, pattern[g + plm1 - f]))
2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325
	  g--;
	suff[i] = f - g;
      }
    }
  }
}


/**********************************************************************
   turboBM_compute_good_suffix_shifts()
   Precomputation dependent only on pattern_len.
**********************************************************************/

2326
void Item_func_like::turboBM_compute_good_suffix_shifts(int *suff)
2327 2328 2329
{
  turboBM_compute_suffixes(suff);

2330 2331
  int *end = bmGs + pattern_len;
  int *k;
2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344
  for (k = bmGs; k < end; k++)
    *k = pattern_len;

  int tmp;
  int i;
  int j          = 0;
  const int plm1 = pattern_len - 1;
  for (i = plm1; i > -1; i--)
  {
    if (suff[i] == i + 1)
    {
      for (tmp = plm1 - i; j < tmp; j++)
      {
2345
	int *tmp2 = bmGs + j;
2346 2347 2348 2349 2350 2351
	if (*tmp2 == pattern_len)
	  *tmp2 = tmp;
      }
    }
  }

2352
  int *tmp2;
2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372
  for (tmp = plm1 - i; j < tmp; j++)
  {
    tmp2 = bmGs + j;
    if (*tmp2 == pattern_len)
      *tmp2 = tmp;
  }

  tmp2 = bmGs + plm1;
  for (i = 0; i <= pattern_len - 2; i++)
    *(tmp2 - suff[i]) = plm1 - i;
}


/**********************************************************************
   turboBM_compute_bad_character_shifts()
   Precomputation dependent on pattern_len.
**********************************************************************/

void Item_func_like::turboBM_compute_bad_character_shifts()
{
unknown's avatar
unknown committed
2373 2374 2375 2376
  int *i;
  int *end = bmBc + alphabet_size;
  int j;
  const int plm1 = pattern_len - 1;
2377
  CHARSET_INFO	*cs= cmp.cmp_collation.collation;
unknown's avatar
unknown committed
2378

2379 2380 2381
  for (i = bmBc; i < end; i++)
    *i = pattern_len;

2382
  if (cs == &my_charset_bin)
unknown's avatar
unknown committed
2383
  {
2384
    for (j = 0; j < plm1; j++)
2385
      bmBc[(uint) (uchar) pattern[j]] = plm1 - j;
unknown's avatar
unknown committed
2386
  }
2387
  else
unknown's avatar
unknown committed
2388
  {
2389
    for (j = 0; j < plm1; j++)
unknown's avatar
unknown committed
2390
      bmBc[(uint) likeconv(cs,pattern[j])] = plm1 - j;
unknown's avatar
unknown committed
2391
  }
2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406
}


/**********************************************************************
  turboBM_matches()
  Search for pattern in text, returns true/false for match/no match
**********************************************************************/

bool Item_func_like::turboBM_matches(const char* text, int text_len) const
{
  register int bcShift;
  register int turboShift;
  int shift = pattern_len;
  int j     = 0;
  int u     = 0;
2407
  CHARSET_INFO	*cs= cmp.cmp_collation.collation;
2408

2409 2410
  const int plm1=  pattern_len - 1;
  const int tlmpl= text_len - pattern_len;
2411 2412

  /* Searching */
2413
  if (cs == &my_charset_bin)
2414 2415 2416
  {
    while (j <= tlmpl)
    {
2417
      register int i= plm1;
2418 2419 2420 2421
      while (i >= 0 && pattern[i] == text[i + j])
      {
	i--;
	if (i == plm1 - shift)
2422
	  i-= u;
2423 2424
      }
      if (i < 0)
unknown's avatar
unknown committed
2425
	return 1;
2426 2427 2428

      register const int v = plm1 - i;
      turboShift = u - v;
2429
      bcShift    = bmBc[(uint) (uchar) text[i + j]] - plm1 + i;
2430 2431 2432 2433 2434 2435 2436 2437 2438 2439
      shift      = max(turboShift, bcShift);
      shift      = max(shift, bmGs[i]);
      if (shift == bmGs[i])
	u = min(pattern_len - shift, v);
      else
      {
	if (turboShift < bcShift)
	  shift = max(shift, u + 1);
	u = 0;
      }
2440
      j+= shift;
2441
    }
unknown's avatar
unknown committed
2442
    return 0;
2443 2444 2445 2446 2447 2448
  }
  else
  {
    while (j <= tlmpl)
    {
      register int i = plm1;
unknown's avatar
unknown committed
2449
      while (i >= 0 && likeconv(cs,pattern[i]) == likeconv(cs,text[i + j]))
2450 2451 2452
      {
	i--;
	if (i == plm1 - shift)
2453
	  i-= u;
2454 2455
      }
      if (i < 0)
unknown's avatar
unknown committed
2456
	return 1;
2457 2458 2459

      register const int v = plm1 - i;
      turboShift = u - v;
unknown's avatar
unknown committed
2460
      bcShift    = bmBc[(uint) likeconv(cs, text[i + j])] - plm1 + i;
2461 2462 2463 2464 2465 2466 2467 2468 2469 2470
      shift      = max(turboShift, bcShift);
      shift      = max(shift, bmGs[i]);
      if (shift == bmGs[i])
	u = min(pattern_len - shift, v);
      else
      {
	if (turboShift < bcShift)
	  shift = max(shift, u + 1);
	u = 0;
      }
2471
      j+= shift;
2472
    }
unknown's avatar
unknown committed
2473
    return 0;
2474 2475
  }
}
unknown's avatar
unknown committed
2476

2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497

/*
  Make a logical XOR of the arguments.

  SYNOPSIS
    val_int()

  DESCRIPTION
  If either operator is NULL, return NULL.

  NOTE
    As we don't do any index optimization on XOR this is not going to be
    very fast to use.

  TODO (low priority)
    Change this to be optimized as:
      A XOR B   ->  (A) == 1 AND (B) <> 1) OR (A <> 1 AND (B) == 1)
    To be able to do this, we would however first have to extend the MySQL
    range optimizer to handle OR better.
*/

unknown's avatar
unknown committed
2498 2499 2500 2501 2502
longlong Item_cond_xor::val_int()
{
  List_iterator<Item> li(list);
  Item *item;
  int result=0;	
2503
  null_value=0;
unknown's avatar
unknown committed
2504 2505
  while ((item=li++))
  {
2506 2507 2508 2509 2510 2511
    result^= (item->val_int() != 0);
    if (item->null_value)
    {
      null_value=1;
      return 0;
    }
unknown's avatar
unknown committed
2512
  }
2513
  return (longlong) result;
unknown's avatar
unknown committed
2514
}
2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602

/*
  Apply NOT transformation to the item and return a new one.

  SYNPOSIS
    neg_transformer()

  DESCRIPTION
    Transform the item using next rules:
       a AND b AND ...    -> NOT(a) OR NOT(b) OR ...
       a OR b OR ...      -> NOT(a) AND NOT(b) AND ...
       NOT(a)             -> a
       a = b              -> a != b
       a != b             -> a = b
       a < b              -> a >= b
       a >= b             -> a < b
       a > b              -> a <= b
       a <= b             -> a > b
       IS NULL(a)         -> IS NOT NULL(a)
       IS NOT NULL(a)     -> IS NULL(a)

  NOTE
    This method is used in the eliminate_not_funcs() function.

  RETURN
    New item or
    NULL if we cannot apply NOT transformation (see Item::neg_transformer()).
*/

Item *Item_func_not::neg_transformer()		/* NOT(x)  ->  x */
{
  /* We should apply negation elimination to the argument of the NOT function */
  return eliminate_not_funcs(args[0]);
}

Item *Item_func_eq::neg_transformer()		/* a = b  ->  a != b */
{
  return new Item_func_ne(args[0], args[1]);	
}

Item *Item_func_ne::neg_transformer()		/* a != b  ->  a = b */
{
  return new Item_func_eq(args[0], args[1]);
}

Item *Item_func_lt::neg_transformer()		/* a < b  ->  a >= b */
{
  return new Item_func_ge(args[0], args[1]);
}

Item *Item_func_ge::neg_transformer()		/* a >= b  ->  a < b */
{
  return new Item_func_lt(args[0], args[1]);
}

Item *Item_func_gt::neg_transformer()		/* a > b  ->  a <= b */
{
  return new Item_func_le(args[0], args[1]);
}

Item *Item_func_le::neg_transformer()		/* a <= b  ->  a > b */
{
  return new Item_func_gt(args[0], args[1]);
}

Item *Item_func_isnull::neg_transformer()	/* a IS NULL  ->  a IS NOT NULL */
{
  return new Item_func_isnotnull(args[0]);
}

Item *Item_func_isnotnull::neg_transformer()	/* a IS NOT NULL  ->  a IS NULL */
{
  return new Item_func_isnull(args[0]);
}

Item *Item_cond_and::neg_transformer()		/* NOT(a AND b AND ...)  -> */
					/* NOT a OR NOT b OR ... */
{
  neg_arguments();
  return new Item_cond_or(list);
}

Item *Item_cond_or::neg_transformer()		/* NOT(a OR b OR ...)  -> */
					/* NOT a AND NOT b AND ... */
{
  neg_arguments();
  return new Item_cond_and(list);
}