item_cmpfunc.cc 88.9 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
   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 */

20
#ifdef USE_PRAGMA_IMPLEMENTATION
unknown's avatar
unknown committed
21 22 23 24 25
#pragma implementation				// gcc: Class implementation
#endif

#include "mysql_priv.h"
#include <m_ctype.h>
26
#include "sql_select.h"
27

28 29
static bool convert_constant_item(THD *thd, Field *field, Item **item);

30 31 32 33 34 35
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;
unknown's avatar
unknown committed
36 37
  else if (a == DECIMAL_RESULT || b == DECIMAL_RESULT)
    return DECIMAL_RESULT;
38 39 40 41 42 43 44 45 46 47 48 49
  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());
}

50 51

static void agg_cmp_type(THD *thd, Item_result *type, Item **items, uint nitems)
52 53
{
  uint i;
54 55 56 57 58 59 60 61 62 63
  Field *field= NULL;
  bool all_constant= TRUE;

  /* If the first argument is a FIELD_ITEM, pull out the field. */
  if (items[0]->type() == Item::FIELD_ITEM)
    field=((Item_field *)items[0])->field;
  /* But if it can't be compared as a longlong, we don't really care. */
  if (field && !field->can_be_compared_as_longlong())
    field= NULL;

64
  type[0]= items[0]->result_type();
65 66
  for (i= 1; i < nitems; i++)
  {
67
    type[0]= item_cmp_type(type[0], items[i]->result_type());
68 69 70 71 72 73 74 75 76 77
    if (field && !convert_constant_item(thd, field, &items[i]))
      all_constant= FALSE;
  }

  /*
    If we had a field that can be compared as a longlong, and all constant
    items, then the aggregate result will be an INT_RESULT.
  */
  if (field && all_constant)
    type[0]= INT_RESULT;
78 79
}

80

unknown's avatar
unknown committed
81 82
static void my_coll_agg_error(DTCollation &c1, DTCollation &c2,
                              const char *fname)
83
{
84 85 86 87
  my_error(ER_CANT_AGGREGATE_2COLLATIONS, MYF(0),
           c1.collation->name,c1.derivation_name(),
           c2.collation->name,c2.derivation_name(),
           fname);
88 89
}

unknown's avatar
unknown committed
90 91

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


Item_bool_func2* Ne_creator::create(Item *a, Item *b) const
unknown's avatar
unknown committed
98 99 100
{
  return new Item_func_ne(a, b);
}
unknown's avatar
unknown committed
101 102 103


Item_bool_func2* Gt_creator::create(Item *a, Item *b) const
unknown's avatar
unknown committed
104 105 106
{
  return new Item_func_gt(a, b);
}
unknown's avatar
unknown committed
107 108 109


Item_bool_func2* Lt_creator::create(Item *a, Item *b) const
unknown's avatar
unknown committed
110 111 112
{
  return new Item_func_lt(a, b);
}
unknown's avatar
unknown committed
113 114 115


Item_bool_func2* Ge_creator::create(Item *a, Item *b) const
unknown's avatar
unknown committed
116 117 118
{
  return new Item_func_ge(a, b);
}
unknown's avatar
unknown committed
119 120 121


Item_bool_func2* Le_creator::create(Item *a, Item *b) const
unknown's avatar
unknown committed
122 123 124
{
  return new Item_func_le(a, b);
}
unknown's avatar
unknown committed
125

unknown's avatar
unknown committed
126
/*
127
  Test functions
128 129
  Most of these  returns 0LL if false and 1LL if true and
  NULL if some arg is NULL.
unknown's avatar
unknown committed
130 131 132 133
*/

longlong Item_func_not::val_int()
{
134
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
135
  bool value= args[0]->val_bool();
unknown's avatar
unknown committed
136
  null_value=args[0]->null_value;
137
  return ((!null_value && value == 0) ? 1 : 0);
unknown's avatar
unknown committed
138 139
}

140 141 142 143 144
/*
  special NOT for ALL subquery
*/

longlong Item_func_not_all::val_int()
145 146
{
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
147
  bool value= args[0]->val_bool();
148 149

  /*
unknown's avatar
unknown committed
150 151
    return TRUE if there was records in underlying select in max/min
    optimization (ALL subquery)
152 153 154 155
  */
  if (empty_underlying_subquery())
    return 1;

156
  null_value= args[0]->null_value;
157 158 159 160 161 162 163 164
  return ((!null_value && value == 0) ? 1 : 0);
}


bool Item_func_not_all::empty_underlying_subquery()
{
  return ((test_sum_item && !test_sum_item->any_value()) ||
          (test_sub_item && !test_sub_item->any_value()));
165 166
}

unknown's avatar
unknown committed
167 168 169 170 171 172 173 174
void Item_func_not_all::print(String *str)
{
  if (show)
    Item_func::print(str);
  else
    args[0]->print(str);
}

175 176

/*
unknown's avatar
unknown committed
177
  Special NOP (No OPeration) for ALL subquery it is like  Item_func_not_all
unknown's avatar
unknown committed
178
  (return TRUE if underlying subquery do not return rows) but if subquery
unknown's avatar
unknown committed
179
  returns some rows it return same value as argument (TRUE/FALSE).
180 181 182 183 184
*/

longlong Item_func_nop_all::val_int()
{
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
185
  longlong value= args[0]->val_int();
186 187

  /*
unknown's avatar
unknown committed
188 189
    return FALSE if there was records in underlying select in max/min
    optimization (SAME/ANY subquery)
190 191
  */
  if (empty_underlying_subquery())
unknown's avatar
unknown committed
192
    return 0;
193 194 195 196 197 198

  null_value= args[0]->null_value;
  return (null_value || value == 0) ? 0 : 1;
}


unknown's avatar
unknown committed
199 200 201 202 203
/*
  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
204 205 206 207

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

210
static bool convert_constant_item(THD *thd, Field *field, Item **item)
unknown's avatar
unknown committed
211
{
212
  if ((*item)->const_item())
unknown's avatar
unknown committed
213
  {
214 215 216
    /* For comparison purposes allow invalid dates like 2000-01-32 */
    ulong orig_sql_mode= field->table->in_use->variables.sql_mode;
    field->table->in_use->variables.sql_mode|= MODE_INVALID_DATES;
unknown's avatar
unknown committed
217
    if (!(*item)->save_in_field(field, 1) && !((*item)->null_value))
unknown's avatar
unknown committed
218
    {
219
      Item *tmp=new Item_int_with_ref(field->val_int(), *item);
220
      field->table->in_use->variables.sql_mode= orig_sql_mode;
221
      if (tmp)
222
        thd->change_item_tree(item, tmp);
223
      return 1;					// Item was replaced
unknown's avatar
unknown committed
224
    }
225
    field->table->in_use->variables.sql_mode= orig_sql_mode;
unknown's avatar
unknown committed
226 227 228 229
  }
  return 0;
}

unknown's avatar
unknown committed
230

231 232 233
void Item_bool_func2::fix_length_and_dec()
{
  max_length= 1;				     // Function returns 0 or 1
234
  THD *thd= current_thd;
235 236 237 238 239 240 241

  /*
    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;
242 243 244 245 246 247 248 249 250 251 252 253 254

  /* 
    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.
  */

255
  
256 257 258
  DTCollation coll;
  if (args[0]->result_type() == STRING_RESULT &&
      args[1]->result_type() == STRING_RESULT &&
unknown's avatar
unknown committed
259 260
      agg_arg_charsets(coll, args, 2, MY_COLL_CMP_CONV))
    return;
261 262
    
 
unknown's avatar
unknown committed
263
  // Make a special case of compare with fields to get nicer DATE comparisons
unknown's avatar
unknown committed
264 265 266 267 268 269

  if (functype() == LIKE_FUNC)  // Disable conversion in case of LIKE function.
  {
    set_cmp_func();
    return;
  }
270 271

  if (!thd->is_context_analysis_only())
unknown's avatar
unknown committed
272
  {
273 274
    Item *real_item= args[0]->real_item();
    if (real_item->type() == FIELD_ITEM)
unknown's avatar
unknown committed
275
    {
276
      Field *field=((Item_field*) real_item)->field;
277
      if (field->can_be_compared_as_longlong())
unknown's avatar
unknown committed
278
      {
279 280 281 282 283 284
        if (convert_constant_item(thd, field,&args[1]))
        {
          cmp.set_cmp_func(this, tmp_arg, tmp_arg+1,
                           INT_RESULT);		// Works for all types.
          return;
        }
unknown's avatar
unknown committed
285 286
      }
    }
287 288
    real_item= args[1]->real_item();
    if (real_item->type() == FIELD_ITEM /* && !real_item->const_item() */)
unknown's avatar
unknown committed
289
    {
290
      Field *field=((Item_field*) real_item)->field;
291
      if (field->can_be_compared_as_longlong())
unknown's avatar
unknown committed
292
      {
293 294 295 296 297 298
        if (convert_constant_item(thd, field,&args[0]))
        {
          cmp.set_cmp_func(this, tmp_arg, tmp_arg+1,
                           INT_RESULT); // Works for all types.
          return;
        }
unknown's avatar
unknown committed
299 300 301
      }
    }
  }
302
  set_cmp_func();
unknown's avatar
unknown committed
303 304
}

305

306
int Arg_comparator::set_compare_func(Item_bool_func2 *item, Item_result type)
unknown's avatar
unknown committed
307
{
308
  owner= item;
unknown's avatar
unknown committed
309 310
  func= comparator_matrix[type]
                         [test(owner->functype() == Item_func::EQUAL_FUNC)];
unknown's avatar
unknown committed
311
  switch (type) {
unknown's avatar
unknown committed
312
  case ROW_RESULT:
unknown's avatar
unknown committed
313
  {
314 315
    uint n= (*a)->cols();
    if (n != (*b)->cols())
316
    {
unknown's avatar
unknown committed
317
      my_error(ER_OPERAND_COLUMNS, MYF(0), n);
318 319 320
      comparators= 0;
      return 1;
    }
321
    if (!(comparators= new Arg_comparator[n]))
unknown's avatar
unknown committed
322 323 324 325
      return 1;
    for (uint i=0; i < n; i++)
    {
      if ((*a)->el(i)->cols() != (*b)->el(i)->cols())
unknown's avatar
unknown committed
326
      {
unknown's avatar
unknown committed
327
	my_error(ER_OPERAND_COLUMNS, MYF(0), (*a)->el(i)->cols());
unknown's avatar
unknown committed
328
	return 1;
unknown's avatar
unknown committed
329
      }
unknown's avatar
unknown committed
330 331
      comparators[i].set_cmp_func(owner, (*a)->addr(i), (*b)->addr(i));
    }
unknown's avatar
unknown committed
332
    break;
333
  }
unknown's avatar
unknown committed
334
  case STRING_RESULT:
335 336 337 338 339
  {
    /*
      We must set cmp_charset here as we may be called from for an automatic
      generated item, like in natural join
    */
340 341
    if (cmp_collation.set((*a)->collation, (*b)->collation) || 
	cmp_collation.derivation == DERIVATION_NONE)
342 343 344 345
    {
      my_coll_agg_error((*a)->collation, (*b)->collation, owner->func_name());
      return 1;
    }
346
    if (cmp_collation.collation == &my_charset_bin)
unknown's avatar
unknown committed
347 348
    {
      /*
349
	We are using BLOB/BINARY/VARBINARY, change to compare byte by byte,
unknown's avatar
unknown committed
350 351 352 353 354 355
	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;
unknown's avatar
unknown committed
356 357

      /*
unknown's avatar
unknown committed
358
        As this is binary compassion, mark all fields that they can't be
unknown's avatar
unknown committed
359 360 361 362 363 364 365 366
        transformed. Otherwise we would get into trouble with comparisons
        like:
        WHERE col= 'j' AND col LIKE BINARY 'j'
        which would be transformed to:
        WHERE col= 'j'
      */
      (*a)->transform(&Item::set_no_const_sub, (byte*) 0);
      (*b)->transform(&Item::set_no_const_sub, (byte*) 0);
unknown's avatar
unknown committed
367
    }
unknown's avatar
unknown committed
368
    break;
369
  }
unknown's avatar
unknown committed
370
  case INT_RESULT:
371
  {
372
    if (func == &Arg_comparator::compare_int_signed)
373 374
    {
      if ((*a)->unsigned_flag)
unknown's avatar
unknown committed
375 376 377
        func= (((*b)->unsigned_flag)?
               &Arg_comparator::compare_int_unsigned :
               &Arg_comparator::compare_int_unsigned_signed);
378 379 380
      else if ((*b)->unsigned_flag)
        func= &Arg_comparator::compare_int_signed_unsigned;
    }
381 382 383 384 385
    else if (func== &Arg_comparator::compare_e_int)
    {
      if ((*a)->unsigned_flag ^ (*b)->unsigned_flag)
        func= &Arg_comparator::compare_e_int_diff_signedness;
    }
unknown's avatar
unknown committed
386 387 388 389 390 391 392
    break;
  }
  case DECIMAL_RESULT:
  case REAL_RESULT:
    break;
  default:
    DBUG_ASSERT(0);
393
  }
394
  return 0;
unknown's avatar
unknown committed
395
}
unknown's avatar
unknown committed
396

unknown's avatar
unknown committed
397

398
int Arg_comparator::compare_string()
unknown's avatar
unknown committed
399 400
{
  String *res1,*res2;
401
  if ((res1= (*a)->val_str(&owner->tmp_value1)))
unknown's avatar
unknown committed
402
  {
403
    if ((res2= (*b)->val_str(&owner->tmp_value2)))
unknown's avatar
unknown committed
404
    {
unknown's avatar
unknown committed
405
      owner->null_value= 0;
406
      return sortcmp(res1,res2,cmp_collation.collation);
unknown's avatar
unknown committed
407 408
    }
  }
unknown's avatar
unknown committed
409
  owner->null_value= 1;
unknown's avatar
unknown committed
410 411 412
  return -1;
}

unknown's avatar
unknown committed
413 414 415 416 417 418 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 444 445

/*
  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
446 447 448
int Arg_comparator::compare_e_string()
{
  String *res1,*res2;
449 450
  res1= (*a)->val_str(&owner->tmp_value1);
  res2= (*b)->val_str(&owner->tmp_value2);
unknown's avatar
unknown committed
451 452
  if (!res1 || !res2)
    return test(res1 == res2);
453
  return test(sortcmp(res1, res2, cmp_collation.collation) == 0);
unknown's avatar
unknown committed
454 455 456
}


unknown's avatar
unknown committed
457 458 459 460 461 462 463 464 465 466 467
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);
}


468
int Arg_comparator::compare_real()
unknown's avatar
unknown committed
469
{
470 471 472 473 474 475
  /*
    Fix yet another manifestation of Bug#2338. 'Volatile' will instruct
    gcc to flush double values out of 80-bit Intel FPU registers before
    performing the comparison.
  */
  volatile double val1, val2;
unknown's avatar
Merge  
unknown committed
476
  val1= (*a)->val_real();
477
  if (!(*a)->null_value)
unknown's avatar
unknown committed
478
  {
unknown's avatar
Merge  
unknown committed
479
    val2= (*b)->val_real();
480
    if (!(*b)->null_value)
unknown's avatar
unknown committed
481
    {
unknown's avatar
unknown committed
482
      owner->null_value= 0;
unknown's avatar
unknown committed
483 484 485 486 487
      if (val1 < val2)	return -1;
      if (val1 == val2) return 0;
      return 1;
    }
  }
unknown's avatar
unknown committed
488
  owner->null_value= 1;
unknown's avatar
unknown committed
489 490 491
  return -1;
}

unknown's avatar
unknown committed
492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509
int Arg_comparator::compare_decimal()
{
  my_decimal value1;
  my_decimal *val1= (*a)->val_decimal(&value1);
  if (!(*a)->null_value)
  {
    my_decimal value2;
    my_decimal *val2= (*b)->val_decimal(&value2);
    if (!(*b)->null_value)
    {
      owner->null_value= 0;
      return my_decimal_cmp(val1, val2);
    }
  }
  owner->null_value= 1;
  return -1;
}

unknown's avatar
unknown committed
510 511
int Arg_comparator::compare_e_real()
{
512 513
  double val1= (*a)->val_real();
  double val2= (*b)->val_real();
514 515
  if ((*a)->null_value || (*b)->null_value)
    return test((*a)->null_value && (*b)->null_value);
unknown's avatar
unknown committed
516 517
  return test(val1 == val2);
}
unknown's avatar
unknown committed
518

unknown's avatar
unknown committed
519 520 521 522 523 524 525 526 527 528
int Arg_comparator::compare_e_decimal()
{
  my_decimal value1, value2;
  my_decimal *val1= (*a)->val_decimal(&value1);
  my_decimal *val2= (*b)->val_decimal(&value2);
  if ((*a)->null_value || (*b)->null_value)
    return test((*a)->null_value && (*b)->null_value);
  return test(my_decimal_cmp(val1, val2) == 0);
}

529
int Arg_comparator::compare_int_signed()
unknown's avatar
unknown committed
530
{
531 532
  longlong val1= (*a)->val_int();
  if (!(*a)->null_value)
unknown's avatar
unknown committed
533
  {
534 535
    longlong val2= (*b)->val_int();
    if (!(*b)->null_value)
unknown's avatar
unknown committed
536
    {
unknown's avatar
unknown committed
537
      owner->null_value= 0;
unknown's avatar
unknown committed
538 539 540 541 542
      if (val1 < val2)	return -1;
      if (val1 == val2)   return 0;
      return 1;
    }
  }
unknown's avatar
unknown committed
543
  owner->null_value= 1;
unknown's avatar
unknown committed
544 545 546
  return -1;
}

547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622

/*
  Compare values as BIGINT UNSIGNED.
*/

int Arg_comparator::compare_int_unsigned()
{
  ulonglong val1= (*a)->val_int();
  if (!(*a)->null_value)
  {
    ulonglong val2= (*b)->val_int();
    if (!(*b)->null_value)
    {
      owner->null_value= 0;
      if (val1 < val2)	return -1;
      if (val1 == val2)   return 0;
      return 1;
    }
  }
  owner->null_value= 1;
  return -1;
}


/*
  Compare signed (*a) with unsigned (*B)
*/

int Arg_comparator::compare_int_signed_unsigned()
{
  longlong sval1= (*a)->val_int();
  if (!(*a)->null_value)
  {
    ulonglong uval2= (ulonglong)(*b)->val_int();
    if (!(*b)->null_value)
    {
      owner->null_value= 0;
      if (sval1 < 0 || (ulonglong)sval1 < uval2)
        return -1;
      if ((ulonglong)sval1 == uval2)
        return 0;
      return 1;
    }
  }
  owner->null_value= 1;
  return -1;
}


/*
  Compare unsigned (*a) with signed (*B)
*/

int Arg_comparator::compare_int_unsigned_signed()
{
  ulonglong uval1= (ulonglong)(*a)->val_int();
  if (!(*a)->null_value)
  {
    longlong sval2= (*b)->val_int();
    if (!(*b)->null_value)
    {
      owner->null_value= 0;
      if (sval2 < 0)
        return 1;
      if (uval1 < (ulonglong)sval2)
        return -1;
      if (uval1 == (ulonglong)sval2)
        return 0;
      return 1;
    }
  }
  owner->null_value= 1;
  return -1;
}


unknown's avatar
unknown committed
623 624
int Arg_comparator::compare_e_int()
{
625 626 627 628
  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
629 630 631
  return test(val1 == val2);
}

632 633 634 635 636 637 638 639 640 641 642
/*
  Compare unsigned *a with signed *b or signed *a with unsigned *b.
*/
int Arg_comparator::compare_e_int_diff_signedness()
{
  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);
  return (val1 >= 0) && test(val1 == val2);
}
unknown's avatar
unknown committed
643

644
int Arg_comparator::compare_row()
unknown's avatar
unknown committed
645 646
{
  int res= 0;
647
  bool was_null= 0;
648 649
  (*a)->bring_value();
  (*b)->bring_value();
650
  uint n= (*a)->cols();
unknown's avatar
unknown committed
651
  for (uint i= 0; i<n; i++)
unknown's avatar
unknown committed
652
  {
653
    res= comparators[i].compare();
unknown's avatar
unknown committed
654
    if (owner->null_value)
655 656 657 658 659 660 661 662
    {
      // NULL was compared
      if (owner->abort_on_null)
        return -1; // We do not need correct NULL returning
      was_null= 1;
      owner->null_value= 0;
      res= 0;  // continue comparison (maybe we will meet explicit difference)
    }
663
    else if (res)
664
      return res;
unknown's avatar
unknown committed
665
  }
666 667 668 669 670 671 672 673 674 675
  if (was_null)
  {
    /*
      There was NULL(s) in comparison in some parts, but there was not
      explicit difference in other parts, so we have to return NULL
    */
    owner->null_value= 1;
    return -1;
  }
  return 0;
unknown's avatar
unknown committed
676
}
unknown's avatar
unknown committed
677

678

unknown's avatar
unknown committed
679 680
int Arg_comparator::compare_e_row()
{
681 682
  (*a)->bring_value();
  (*b)->bring_value();
683
  uint n= (*a)->cols();
unknown's avatar
unknown committed
684 685
  for (uint i= 0; i<n; i++)
  {
unknown's avatar
unknown committed
686
    if (!comparators[i].compare())
687
      return 0;
unknown's avatar
unknown committed
688 689 690 691
  }
  return 1;
}

692

693
bool Item_in_optimizer::fix_left(THD *thd, Item **ref)
unknown's avatar
unknown committed
694
{
695
  if (!args[0]->fixed && args[0]->fix_fields(thd, args) ||
unknown's avatar
unknown committed
696
      !cache && !(cache= Item_cache::get_cache(args[0]->result_type())))
697
    return 1;
698

699
  cache->setup(args[0]);
700 701 702 703
  /*
    If it is preparation PS only then we do not know values of parameters =>
    cant't get there values and do not need that values.
  */
unknown's avatar
unknown committed
704
  if (!thd->stmt_arena->is_stmt_prepare())
705
    cache->store(args[0]);
706
  if (cache->cols() == 1)
707
  {
unknown's avatar
unknown committed
708
    if ((used_tables_cache= args[0]->used_tables()))
unknown's avatar
unknown committed
709
      cache->set_used_tables(OUTER_REF_TABLE_BIT);
710 711 712
    else
      cache->set_used_tables(0);
  }
713 714 715 716
  else
  {
    uint n= cache->cols();
    for (uint i= 0; i < n; i++)
717 718
    {
      if (args[0]->el(i)->used_tables())
unknown's avatar
unknown committed
719
	((Item_cache *)cache->el(i))->set_used_tables(OUTER_REF_TABLE_BIT);
720 721 722
      else
	((Item_cache *)cache->el(i))->set_used_tables(0);
    }
unknown's avatar
unknown committed
723
    used_tables_cache= args[0]->used_tables();
724
  }
unknown's avatar
unknown committed
725 726 727
  not_null_tables_cache= args[0]->not_null_tables();
  with_sum_func= args[0]->with_sum_func;
  const_item_cache= args[0]->const_item();
728 729 730 731
  return 0;
}


732
bool Item_in_optimizer::fix_fields(THD *thd, Item **ref)
733
{
734
  DBUG_ASSERT(fixed == 0);
735
  if (fix_left(thd, ref))
unknown's avatar
unknown committed
736
    return TRUE;
737 738 739
  if (args[0]->maybe_null)
    maybe_null=1;

740
  if (!args[1]->fixed && args[1]->fix_fields(thd, args+1))
unknown's avatar
unknown committed
741
    return TRUE;
unknown's avatar
unknown committed
742 743 744
  Item_in_subselect * sub= (Item_in_subselect *)args[1];
  if (args[0]->cols() != sub->engine->cols())
  {
unknown's avatar
unknown committed
745
    my_error(ER_OPERAND_COLUMNS, MYF(0), args[0]->cols());
unknown's avatar
unknown committed
746
    return TRUE;
unknown's avatar
unknown committed
747
  }
748 749 750 751
  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
752
  not_null_tables_cache|= args[1]->not_null_tables();
753
  const_item_cache&= args[1]->const_item();
754
  fixed= 1;
unknown's avatar
unknown committed
755
  return FALSE;
756 757
}

758

759 760
longlong Item_in_optimizer::val_int()
{
761
  DBUG_ASSERT(fixed == 1);
762 763
  cache->store(args[0]);
  if (cache->null_value)
764
  {
765
    null_value= 1;
766 767
    return 0;
  }
unknown's avatar
unknown committed
768
  bool tmp= args[1]->val_bool_result();
unknown's avatar
unknown committed
769
  null_value= args[1]->null_value;
770 771 772
  return tmp;
}

773 774 775 776 777 778 779 780

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


unknown's avatar
unknown committed
781 782 783 784
void Item_in_optimizer::cleanup()
{
  DBUG_ENTER("Item_in_optimizer::cleanup");
  Item_bool_func::cleanup();
785 786
  if (!save_cache)
    cache= 0;
unknown's avatar
unknown committed
787 788 789
  DBUG_VOID_RETURN;
}

790

791
bool Item_in_optimizer::is_null()
792
{
793 794
  cache->store(args[0]);
  return (null_value= (cache->null_value || args[1]->is_null()));
795
}
unknown's avatar
unknown committed
796

797

unknown's avatar
unknown committed
798 799
longlong Item_func_eq::val_int()
{
800
  DBUG_ASSERT(fixed == 1);
801
  int value= cmp.compare();
unknown's avatar
unknown committed
802 803 804
  return value == 0 ? 1 : 0;
}

805

unknown's avatar
unknown committed
806 807
/* Same as Item_func_eq, but NULL = NULL */

unknown's avatar
unknown committed
808 809 810 811 812 813
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
814 815
longlong Item_func_equal::val_int()
{
816
  DBUG_ASSERT(fixed == 1);
817
  return cmp.compare();
unknown's avatar
unknown committed
818 819 820 821
}

longlong Item_func_ne::val_int()
{
822
  DBUG_ASSERT(fixed == 1);
823
  int value= cmp.compare();
824
  return value != 0 && !null_value ? 1 : 0;
unknown's avatar
unknown committed
825 826 827 828 829
}


longlong Item_func_ge::val_int()
{
830
  DBUG_ASSERT(fixed == 1);
831
  int value= cmp.compare();
unknown's avatar
unknown committed
832 833 834 835 836 837
  return value >= 0 ? 1 : 0;
}


longlong Item_func_gt::val_int()
{
838
  DBUG_ASSERT(fixed == 1);
839
  int value= cmp.compare();
unknown's avatar
unknown committed
840 841 842 843 844
  return value > 0 ? 1 : 0;
}

longlong Item_func_le::val_int()
{
845
  DBUG_ASSERT(fixed == 1);
846
  int value= cmp.compare();
unknown's avatar
unknown committed
847 848 849 850 851 852
  return value <= 0 && !null_value ? 1 : 0;
}


longlong Item_func_lt::val_int()
{
853
  DBUG_ASSERT(fixed == 1);
854
  int value= cmp.compare();
unknown's avatar
unknown committed
855 856 857 858 859 860
  return value < 0 && !null_value ? 1 : 0;
}


longlong Item_func_strcmp::val_int()
{
861
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
862 863 864 865 866 867 868
  String *a=args[0]->val_str(&tmp_value1);
  String *b=args[1]->val_str(&tmp_value2);
  if (!a || !b)
  {
    null_value=1;
    return 0;
  }
869
  int value= sortcmp(a,b,cmp.cmp_collation.collation);
unknown's avatar
unknown committed
870 871 872 873 874 875 876
  null_value=0;
  return !value ? 0 : (value < 0 ? (longlong) -1 : (longlong) 1);
}


void Item_func_interval::fix_length_and_dec()
{
unknown's avatar
unknown committed
877 878
  use_decimal_comparison= (row->el(0)->result_type() == DECIMAL_RESULT) ||
    (row->el(0)->result_type() == INT_RESULT);
879
  if (row->cols() > 8)
unknown's avatar
unknown committed
880
  {
881 882 883
    bool consts=1;

    for (uint i=1 ; consts && i < row->cols() ; i++)
unknown's avatar
unknown committed
884
    {
885
      consts&= row->el(i)->const_item();
unknown's avatar
unknown committed
886
    }
887 888

    if (consts &&
unknown's avatar
unknown committed
889 890
        (intervals=
          (interval_range*) sql_alloc(sizeof(interval_range)*(row->cols()-1))))
unknown's avatar
unknown committed
891
    {
unknown's avatar
unknown committed
892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923
      if (use_decimal_comparison)
      {
        for (uint i=1 ; i < row->cols(); i++)
        {
          Item *el= row->el(i);
          interval_range *range= intervals + (i-1);
          if ((el->result_type() == DECIMAL_RESULT) ||
              (el->result_type() == INT_RESULT))
          {
            range->type= DECIMAL_RESULT;
            range->dec.init();
            my_decimal *dec= el->val_decimal(&range->dec);
            if (dec != &range->dec)
            {
              range->dec= *dec;
              range->dec.fix_buffer_pointer();
            }
          }
          else
          {
            range->type= REAL_RESULT;
            range->dbl= el->val_real();
          }
        }
      }
      else
      {
        for (uint i=1 ; i < row->cols(); i++)
        {
          intervals[i-1].dbl= row->el(i)->val_real();
        }
      }
unknown's avatar
unknown committed
924 925
    }
  }
unknown's avatar
unknown committed
926 927
  maybe_null= 0;
  max_length= 2;
928
  used_tables_cache|= row->used_tables();
unknown's avatar
unknown committed
929
  not_null_tables_cache= row->not_null_tables();
930
  with_sum_func= with_sum_func || row->with_sum_func;
unknown's avatar
unknown committed
931
  const_item_cache&= row->const_item();
unknown's avatar
unknown committed
932 933
}

unknown's avatar
unknown committed
934

unknown's avatar
unknown committed
935
/*
unknown's avatar
unknown committed
936 937 938 939 940 941 942 943 944 945 946 947 948 949
  Execute Item_func_interval()

  SYNOPSIS
    Item_func_interval::val_int()

  NOTES
    If we are doing a decimal comparison, we are
    evaluating the first item twice.

  RETURN
    -1 if null value,
    0 if lower than lowest
    1 - arg_count-1 if between args[n] and args[n+1]
    arg_count if higher than biggest argument
unknown's avatar
unknown committed
950 951 952 953
*/

longlong Item_func_interval::val_int()
{
954
  DBUG_ASSERT(fixed == 1);
955
  double value;
unknown's avatar
unknown committed
956
  my_decimal dec_buf, *dec= NULL;
unknown's avatar
unknown committed
957 958
  uint i;

unknown's avatar
unknown committed
959 960 961
  if (use_decimal_comparison)
  {
    dec= row->el(0)->val_decimal(&dec_buf);
962 963 964 965 966 967 968 969 970
    if (row->el(0)->null_value)
      return -1;
    my_decimal2double(E_DEC_FATAL_ERROR, dec, &value);
  }
  else
  {
    value= row->el(0)->val_real();
    if (row->el(0)->null_value)
      return -1;
unknown's avatar
unknown committed
971
  }
unknown's avatar
unknown committed
972

unknown's avatar
unknown committed
973 974 975
  if (intervals)
  {					// Use binary search to find interval
    uint start,end;
976
    start= 0;
unknown's avatar
unknown committed
977
    end=   row->cols()-2;
unknown's avatar
unknown committed
978 979
    while (start != end)
    {
unknown's avatar
unknown committed
980
      uint mid= (start + end + 1) / 2;
unknown's avatar
unknown committed
981 982
      interval_range *range= intervals + mid;
      my_bool cmp_result;
unknown's avatar
unknown committed
983 984 985 986 987
      /*
        The values in the range intervall may have different types,
        Only do a decimal comparision of the first argument is a decimal
        and we are comparing against a decimal
      */
unknown's avatar
unknown committed
988 989 990 991 992
      if (dec && range->type == DECIMAL_RESULT)
        cmp_result= my_decimal_cmp(&range->dec, dec) <= 0;
      else
        cmp_result= (range->dbl <= value);
      if (cmp_result)
unknown's avatar
unknown committed
993
	start= mid;
unknown's avatar
unknown committed
994
      else
unknown's avatar
unknown committed
995
	end= mid - 1;
unknown's avatar
unknown committed
996
    }
unknown's avatar
unknown committed
997 998
    interval_range *range= intervals+start;
    return ((dec && range->type == DECIMAL_RESULT) ?
unknown's avatar
unknown committed
999
            my_decimal_cmp(dec, &range->dec) < 0 :
unknown's avatar
unknown committed
1000
            value < range->dbl) ? 0 : start + 1;
unknown's avatar
unknown committed
1001
  }
1002 1003

  for (i=1 ; i < row->cols() ; i++)
unknown's avatar
unknown committed
1004
  {
unknown's avatar
unknown committed
1005 1006 1007 1008 1009 1010 1011 1012 1013
    Item *el= row->el(i);
    if (use_decimal_comparison &&
        ((el->result_type() == DECIMAL_RESULT) ||
         (el->result_type() == INT_RESULT)))
    {
      my_decimal e_dec_buf, *e_dec= row->el(i)->val_decimal(&e_dec_buf);
      if (my_decimal_cmp(e_dec, dec) > 0)
        return i-1;
    }
unknown's avatar
unknown committed
1014 1015
    else if (row->el(i)->val_real() > value)
      return i-1;
unknown's avatar
unknown committed
1016
  }
1017
  return i-1;
unknown's avatar
unknown committed
1018 1019
}

unknown's avatar
unknown committed
1020

unknown's avatar
unknown committed
1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049
/*
  Perform context analysis of a BETWEEN item tree

  SYNOPSIS:
    fix_fields()
    thd     reference to the global context of the query thread
    tables  list of all open tables involved in the query
    ref     pointer to Item* variable where pointer to resulting "fixed"
            item is to be assigned

  DESCRIPTION
    This function performs context analysis (name resolution) and calculates
    various attributes of the item tree with Item_func_between as its root.
    The function saves in ref the pointer to the item or to a newly created
    item that is considered as a replacement for the original one.

  NOTES
    Let T0(e)/T1(e) be the value of not_null_tables(e) when e is used on
    a predicate/function level. Then it's easy to show that:
      T0(e BETWEEN e1 AND e2)     = union(T1(e),T1(e1),T1(e2))
      T1(e BETWEEN e1 AND e2)     = union(T1(e),intersection(T1(e1),T1(e2)))
      T0(e NOT BETWEEN e1 AND e2) = union(T1(e),intersection(T1(e1),T1(e2)))
      T1(e NOT BETWEEN e1 AND e2) = union(T1(e),intersection(T1(e1),T1(e2)))

  RETURN
    0   ok
    1   got error
*/

unknown's avatar
unknown committed
1050
bool Item_func_between::fix_fields(THD *thd, Item **ref)
unknown's avatar
unknown committed
1051
{
1052
  if (Item_func_opt_neg::fix_fields(thd, ref))
unknown's avatar
unknown committed
1053 1054 1055 1056 1057 1058 1059
    return 1;

  /* not_null_tables_cache == union(T1(e),T1(e1),T1(e2)) */
  if (pred_level && !negated)
    return 0;

  /* not_null_tables_cache == union(T1(e), intersection(T1(e1),T1(e2))) */
unknown's avatar
unknown committed
1060 1061 1062
  not_null_tables_cache= (args[0]->not_null_tables() |
                          (args[1]->not_null_tables() &
                           args[2]->not_null_tables()));
unknown's avatar
unknown committed
1063 1064 1065 1066 1067

  return 0;
}


unknown's avatar
unknown committed
1068 1069
void Item_func_between::fix_length_and_dec()
{
unknown's avatar
unknown committed
1070
   max_length= 1;
1071
   THD *thd= current_thd;
unknown's avatar
unknown committed
1072

1073 1074
  /*
    As some compare functions are generated after sql_yacc,
unknown's avatar
unknown committed
1075
    we have to check for out of memory conditions here
1076
  */
unknown's avatar
unknown committed
1077 1078
  if (!args[0] || !args[1] || !args[2])
    return;
1079 1080
  agg_cmp_type(thd, &cmp_type, args, 3);

unknown's avatar
unknown committed
1081
  if (cmp_type == STRING_RESULT &&
unknown's avatar
unknown committed
1082
      agg_arg_charsets(cmp_collation, args, 3, MY_COLL_CMP_CONV))
unknown's avatar
unknown committed
1083
    return;
unknown's avatar
unknown committed
1084 1085 1086 1087 1088
}


longlong Item_func_between::val_int()
{						// ANSI BETWEEN
1089
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
1090 1091 1092 1093 1094 1095 1096 1097 1098
  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)
unknown's avatar
unknown committed
1099 1100 1101
      return (longlong) ((sortcmp(value,a,cmp_collation.collation) >= 0 &&
                          sortcmp(value,b,cmp_collation.collation) <= 0) !=
                         negated);
unknown's avatar
unknown committed
1102 1103 1104 1105
    if (args[1]->null_value && args[2]->null_value)
      null_value=1;
    else if (args[1]->null_value)
    {
unknown's avatar
unknown committed
1106 1107
      // Set to not null if false range.
      null_value= sortcmp(value,b,cmp_collation.collation) <= 0;
unknown's avatar
unknown committed
1108 1109 1110
    }
    else
    {
unknown's avatar
unknown committed
1111 1112
      // Set to not null if false range.
      null_value= sortcmp(value,a,cmp_collation.collation) >= 0;
unknown's avatar
unknown committed
1113 1114 1115 1116
    }
  }
  else if (cmp_type == INT_RESULT)
  {
1117
    longlong value=args[0]->val_int(), a, b;
unknown's avatar
unknown committed
1118
    if ((null_value=args[0]->null_value))
1119
      return 0;					/* purecov: inspected */
unknown's avatar
unknown committed
1120 1121 1122
    a=args[1]->val_int();
    b=args[2]->val_int();
    if (!args[1]->null_value && !args[2]->null_value)
unknown's avatar
unknown committed
1123
      return (longlong) ((value >= a && value <= b) != negated);
unknown's avatar
unknown committed
1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134
    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;
    }
  }
unknown's avatar
unknown committed
1135 1136 1137 1138 1139 1140 1141 1142 1143
  else if (cmp_type == DECIMAL_RESULT)
  {
    my_decimal dec_buf, *dec= args[0]->val_decimal(&dec_buf),
               a_buf, *a_dec, b_buf, *b_dec;
    if ((null_value=args[0]->null_value))
      return 0;					/* purecov: inspected */
    a_dec= args[1]->val_decimal(&a_buf);
    b_dec= args[2]->val_decimal(&b_buf);
    if (!args[1]->null_value && !args[2]->null_value)
1144 1145
      return (longlong) ((my_decimal_cmp(dec, a_dec) >= 0 &&
                          my_decimal_cmp(dec, b_dec) <= 0) != negated);
unknown's avatar
unknown committed
1146 1147 1148 1149 1150 1151 1152
    if (args[1]->null_value && args[2]->null_value)
      null_value=1;
    else if (args[1]->null_value)
      null_value= (my_decimal_cmp(dec, b_dec) <= 0);
    else
      null_value= (my_decimal_cmp(dec, a_dec) >= 0);
  }
unknown's avatar
unknown committed
1153 1154
  else
  {
1155
    double value= args[0]->val_real(),a,b;
unknown's avatar
unknown committed
1156
    if ((null_value=args[0]->null_value))
1157
      return 0;					/* purecov: inspected */
1158 1159
    a= args[1]->val_real();
    b= args[2]->val_real();
unknown's avatar
unknown committed
1160
    if (!args[1]->null_value && !args[2]->null_value)
unknown's avatar
unknown committed
1161
      return (longlong) ((value >= a && value <= b) != negated);
unknown's avatar
unknown committed
1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172
    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;
    }
  }
unknown's avatar
unknown committed
1173
  return (longlong) (!null_value && negated);
unknown's avatar
unknown committed
1174 1175
}

1176 1177 1178 1179 1180

void Item_func_between::print(String *str)
{
  str->append('(');
  args[0]->print(str);
unknown's avatar
unknown committed
1181
  if (negated)
1182 1183
    str->append(STRING_WITH_LEN(" not"));
  str->append(STRING_WITH_LEN(" between "));
1184
  args[1]->print(str);
1185
  str->append(STRING_WITH_LEN(" and "));
1186 1187 1188 1189
  args[2]->print(str);
  str->append(')');
}

unknown's avatar
unknown committed
1190 1191 1192
void
Item_func_ifnull::fix_length_and_dec()
{
1193
  agg_result_type(&hybrid_type, args, 2);
unknown's avatar
unknown committed
1194
  maybe_null=args[1]->maybe_null;
unknown's avatar
unknown committed
1195
  decimals= max(args[0]->decimals, args[1]->decimals);
1196 1197 1198 1199 1200
  max_length= (hybrid_type == DECIMAL_RESULT || hybrid_type == INT_RESULT) ?
    (max(args[0]->max_length - args[0]->decimals,
         args[1]->max_length - args[1]->decimals) + decimals) :
    max(args[0]->max_length, args[1]->max_length);

unknown's avatar
unknown committed
1201
  switch (hybrid_type) {
unknown's avatar
unknown committed
1202
  case STRING_RESULT:
unknown's avatar
unknown committed
1203
    agg_arg_charsets(collation, args, arg_count, MY_COLL_CMP_CONV);
unknown's avatar
unknown committed
1204 1205 1206 1207 1208
    break;
  case DECIMAL_RESULT:
  case REAL_RESULT:
    break;
  case INT_RESULT:
1209
    decimals= 0;
unknown's avatar
unknown committed
1210 1211 1212 1213 1214
    break;
  case ROW_RESULT:
  default:
    DBUG_ASSERT(0);
  }
1215 1216 1217
  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
1218 1219
}

unknown's avatar
unknown committed
1220 1221 1222 1223 1224 1225 1226 1227

uint Item_func_ifnull::decimal_precision() const
{
  int max_int_part=max(args[0]->decimal_int_part(),args[1]->decimal_int_part());
  return min(max_int_part + decimals, DECIMAL_MAX_PRECISION);
}


1228 1229 1230
enum_field_types Item_func_ifnull::field_type() const 
{
  return cached_field_type;
unknown's avatar
unknown committed
1231 1232
}

1233 1234 1235 1236
Field *Item_func_ifnull::tmp_table_field(TABLE *table)
{
  return tmp_table_field_from_field_type(table);
}
1237

unknown's avatar
unknown committed
1238
double
unknown's avatar
unknown committed
1239
Item_func_ifnull::real_op()
unknown's avatar
unknown committed
1240
{
1241
  DBUG_ASSERT(fixed == 1);
1242
  double value= args[0]->val_real();
unknown's avatar
unknown committed
1243 1244 1245 1246 1247
  if (!args[0]->null_value)
  {
    null_value=0;
    return value;
  }
1248
  value= args[1]->val_real();
unknown's avatar
unknown committed
1249 1250 1251 1252 1253 1254
  if ((null_value=args[1]->null_value))
    return 0.0;
  return value;
}

longlong
unknown's avatar
unknown committed
1255
Item_func_ifnull::int_op()
unknown's avatar
unknown committed
1256
{
1257
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269
  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;
}

unknown's avatar
unknown committed
1270

unknown's avatar
unknown committed
1271
my_decimal *Item_func_ifnull::decimal_op(my_decimal *decimal_value)
unknown's avatar
unknown committed
1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286
{
  DBUG_ASSERT(fixed == 1);
  my_decimal *value= args[0]->val_decimal(decimal_value);
  if (!args[0]->null_value)
  {
    null_value= 0;
    return value;
  }
  value= args[1]->val_decimal(decimal_value);
  if ((null_value= args[1]->null_value))
    return 0;
  return value;
}


unknown's avatar
unknown committed
1287
String *
unknown's avatar
unknown committed
1288
Item_func_ifnull::str_op(String *str)
unknown's avatar
unknown committed
1289
{
1290
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
1291 1292 1293 1294
  String *res  =args[0]->val_str(str);
  if (!args[0]->null_value)
  {
    null_value=0;
1295
    res->set_charset(collation.collation);
unknown's avatar
unknown committed
1296 1297 1298 1299 1300
    return res;
  }
  res=args[1]->val_str(str);
  if ((null_value=args[1]->null_value))
    return 0;
1301
  res->set_charset(collation.collation);
unknown's avatar
unknown committed
1302 1303 1304
  return res;
}

1305

unknown's avatar
unknown committed
1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333
/*
  Perform context analysis of an IF item tree

  SYNOPSIS:
    fix_fields()
    thd     reference to the global context of the query thread
    tables  list of all open tables involved in the query
    ref     pointer to Item* variable where pointer to resulting "fixed"
            item is to be assigned

  DESCRIPTION
    This function performs context analysis (name resolution) and calculates
    various attributes of the item tree with Item_func_if as its root.
    The function saves in ref the pointer to the item or to a newly created
    item that is considered as a replacement for the original one.

  NOTES
    Let T0(e)/T1(e) be the value of not_null_tables(e) when e is used on
    a predicate/function level. Then it's easy to show that:
      T0(IF(e,e1,e2)  = T1(IF(e,e1,e2))
      T1(IF(e,e1,e2)) = intersection(T1(e1),T1(e2))

  RETURN
    0   ok
    1   got error
*/

bool
1334
Item_func_if::fix_fields(THD *thd, Item **ref)
unknown's avatar
unknown committed
1335 1336 1337 1338
{
  DBUG_ASSERT(fixed == 0);
  args[0]->top_level_item();

1339
  if (Item_func::fix_fields(thd, ref))
unknown's avatar
unknown committed
1340 1341
    return 1;

unknown's avatar
unknown committed
1342 1343
  not_null_tables_cache= (args[1]->not_null_tables() &
                          args[2]->not_null_tables());
unknown's avatar
unknown committed
1344 1345 1346 1347 1348

  return 0;
}


unknown's avatar
unknown committed
1349 1350 1351 1352
void
Item_func_if::fix_length_and_dec()
{
  maybe_null=args[1]->maybe_null || args[2]->maybe_null;
unknown's avatar
unknown committed
1353
  decimals= max(args[1]->decimals, args[2]->decimals);
1354

unknown's avatar
unknown committed
1355 1356
  enum Item_result arg1_type=args[1]->result_type();
  enum Item_result arg2_type=args[2]->result_type();
unknown's avatar
unknown committed
1357 1358
  bool null1=args[1]->const_item() && args[1]->null_value;
  bool null2=args[2]->const_item() && args[2]->null_value;
1359 1360 1361 1362

  if (null1)
  {
    cached_result_type= arg2_type;
1363
    collation.set(args[2]->collation.collation);
1364 1365 1366
  }
  else if (null2)
  {
unknown's avatar
unknown committed
1367
    cached_result_type= arg1_type;
1368
    collation.set(args[1]->collation.collation);
1369
  }
unknown's avatar
unknown committed
1370
  else
1371
  {
1372 1373 1374
    agg_result_type(&cached_result_type, args+1, 2);
    if (cached_result_type == STRING_RESULT)
    {
unknown's avatar
unknown committed
1375
      if (agg_arg_charsets(collation, args+1, 2, MY_COLL_ALLOW_CONV))
1376
        return;
1377
    }
1378
    else
1379
    {
1380
      collation.set(&my_charset_bin);	// Number
1381
    }
1382
  }
1383 1384 1385
  max_length=
    (cached_result_type == DECIMAL_RESULT || cached_result_type == INT_RESULT) ?
    (max(args[1]->max_length - args[1]->decimals,
1386 1387
         args[2]->max_length - args[2]->decimals) + decimals +
         (unsigned_flag ? 0 : 1) ) :
1388
    max(args[1]->max_length, args[2]->max_length);
unknown's avatar
unknown committed
1389 1390 1391
}


unknown's avatar
unknown committed
1392 1393 1394 1395 1396 1397 1398 1399
uint Item_func_if::decimal_precision() const
{
  int precision=(max(args[1]->decimal_int_part(),args[2]->decimal_int_part())+
                 decimals);
  return min(precision, DECIMAL_MAX_PRECISION);
}


unknown's avatar
unknown committed
1400
double
1401
Item_func_if::val_real()
unknown's avatar
unknown committed
1402
{
1403
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
1404
  Item *arg= args[0]->val_bool() ? args[1] : args[2];
1405
  double value= arg->val_real();
unknown's avatar
unknown committed
1406 1407 1408 1409 1410 1411 1412
  null_value=arg->null_value;
  return value;
}

longlong
Item_func_if::val_int()
{
1413
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
1414
  Item *arg= args[0]->val_bool() ? args[1] : args[2];
unknown's avatar
unknown committed
1415 1416 1417 1418 1419 1420 1421 1422
  longlong value=arg->val_int();
  null_value=arg->null_value;
  return value;
}

String *
Item_func_if::val_str(String *str)
{
1423
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
1424
  Item *arg= args[0]->val_bool() ? args[1] : args[2];
unknown's avatar
unknown committed
1425
  String *res=arg->val_str(str);
1426
  if (res)
1427
    res->set_charset(collation.collation);
unknown's avatar
unknown committed
1428 1429 1430 1431 1432
  null_value=arg->null_value;
  return res;
}


unknown's avatar
unknown committed
1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443
my_decimal *
Item_func_if::val_decimal(my_decimal *decimal_value)
{
  DBUG_ASSERT(fixed == 1);
  Item *arg= args[0]->val_bool() ? args[1] : args[2];
  my_decimal *value= arg->val_decimal(decimal_value);
  null_value= arg->null_value;
  return value;
}


unknown's avatar
unknown committed
1444 1445 1446 1447 1448 1449 1450 1451 1452
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;
unknown's avatar
unknown committed
1453 1454
    unsigned_flag= args[0]->unsigned_flag;
    cached_result_type= args[0]->result_type();
1455 1456 1457
    if (cached_result_type == STRING_RESULT &&
        agg_arg_charsets(collation, args, arg_count, MY_COLL_CMP_CONV))
      return;
unknown's avatar
unknown committed
1458 1459 1460
  }
}

unknown's avatar
unknown committed
1461

unknown's avatar
unknown committed
1462
/*
1463
  nullif () returns NULL if arguments are equal, else it returns the
unknown's avatar
unknown committed
1464 1465 1466 1467 1468 1469
  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
1470
Item_func_nullif::val_real()
unknown's avatar
unknown committed
1471
{
1472
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
1473
  double value;
unknown's avatar
unknown committed
1474
  if (!cmp.compare())
unknown's avatar
unknown committed
1475 1476 1477 1478
  {
    null_value=1;
    return 0.0;
  }
1479
  value= args[0]->val_real();
unknown's avatar
unknown committed
1480 1481 1482 1483 1484 1485 1486
  null_value=args[0]->null_value;
  return value;
}

longlong
Item_func_nullif::val_int()
{
1487
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
1488
  longlong value;
unknown's avatar
unknown committed
1489
  if (!cmp.compare())
unknown's avatar
unknown committed
1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501
  {
    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)
{
1502
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
1503
  String *res;
unknown's avatar
unknown committed
1504
  if (!cmp.compare())
unknown's avatar
unknown committed
1505 1506 1507 1508 1509 1510 1511 1512 1513
  {
    null_value=1;
    return 0;
  }
  res=args[0]->val_str(str);
  null_value=args[0]->null_value;
  return res;
}

1514

unknown's avatar
unknown committed
1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530
my_decimal *
Item_func_nullif::val_decimal(my_decimal * decimal_value)
{
  DBUG_ASSERT(fixed == 1);
  my_decimal *res;
  if (!cmp.compare())
  {
    null_value=1;
    return 0;
  }
  res= args[0]->val_decimal(decimal_value);
  null_value= args[0]->null_value;
  return res;
}


1531 1532 1533
bool
Item_func_nullif::is_null()
{
unknown's avatar
unknown committed
1534
  return (null_value= (!cmp.compare() ? 1 : args[0]->null_value)); 
1535 1536
}

unknown's avatar
unknown committed
1537
/*
1538 1539
  CASE expression 
  Return the matching ITEM or NULL if all compares (including else) failed
unknown's avatar
unknown committed
1540 1541 1542 1543
*/

Item *Item_func_case::find_item(String *str)
{
unknown's avatar
unknown committed
1544 1545
  String *first_expr_str, *tmp;
  my_decimal *first_expr_dec, first_expr_dec_val;
unknown's avatar
unknown committed
1546 1547
  longlong first_expr_int;
  double   first_expr_real;
1548 1549
  char buff[MAX_FIELD_WIDTH];
  String buff_str(buff,sizeof(buff),default_charset());
unknown's avatar
unknown committed
1550

unknown's avatar
unknown committed
1551 1552 1553 1554
  /* 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
1555
  LINT_INIT(first_expr_dec);
unknown's avatar
unknown committed
1556

unknown's avatar
unknown committed
1557 1558 1559 1560 1561 1562
  if (first_expr_num != -1)
  {
    switch (cmp_type)
    {
      case STRING_RESULT:
      	// We can't use 'str' here as this may be overwritten
1563
	if (!(first_expr_str= args[first_expr_num]->val_str(&buff_str)))
unknown's avatar
unknown committed
1564 1565 1566 1567 1568 1569 1570 1571
	  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:
1572
	first_expr_real= args[first_expr_num]->val_real();
unknown's avatar
unknown committed
1573 1574 1575
	if (args[first_expr_num]->null_value)
	  return else_expr_num != -1 ? args[else_expr_num] : 0;
	break;
unknown's avatar
unknown committed
1576 1577 1578 1579 1580
      case DECIMAL_RESULT:
        first_expr_dec= args[first_expr_num]->val_decimal(&first_expr_dec_val);
        if (args[first_expr_num]->null_value)
          return else_expr_num != -1 ? args[else_expr_num] : 0;
        break;
unknown's avatar
unknown committed
1581 1582
      case ROW_RESULT:
      default:
unknown's avatar
unknown committed
1583
        // This case should never be chosen
unknown's avatar
unknown committed
1584 1585 1586 1587 1588
	DBUG_ASSERT(0);
	break;
    }
  }

unknown's avatar
unknown committed
1589
  // Compare every WHEN argument with it and return the first match
1590
  for (uint i=0 ; i < ncases ; i+=2)
unknown's avatar
unknown committed
1591
  {
1592
    if (first_expr_num == -1)
unknown's avatar
unknown committed
1593
    {
unknown's avatar
unknown committed
1594
      // No expression between CASE and the first WHEN
unknown's avatar
unknown committed
1595
      if (args[i]->val_bool())
unknown's avatar
unknown committed
1596 1597 1598
	return args[i+1];
      continue;
    }
unknown's avatar
unknown committed
1599
    switch (cmp_type) {
unknown's avatar
unknown committed
1600 1601
    case STRING_RESULT:
      if ((tmp=args[i]->val_str(str)))		// If not null
unknown's avatar
unknown committed
1602
	if (sortcmp(tmp,first_expr_str,cmp_collation.collation)==0)
unknown's avatar
unknown committed
1603 1604 1605 1606 1607 1608 1609
	  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: 
1610
      if (args[i]->val_real() == first_expr_real && !args[i]->null_value)
unknown's avatar
unknown committed
1611
        return args[i+1];
unknown's avatar
unknown committed
1612
      break;
unknown's avatar
unknown committed
1613 1614 1615 1616 1617 1618 1619
    case DECIMAL_RESULT:
    {
      my_decimal value;
      if (my_decimal_cmp(args[i]->val_decimal(&value), first_expr_dec) == 0)
        return args[i+1];
      break;
    }
1620
    case ROW_RESULT:
unknown's avatar
unknown committed
1621
    default:
unknown's avatar
unknown committed
1622
      // This case should never be chosen
unknown's avatar
unknown committed
1623 1624
      DBUG_ASSERT(0);
      break;
unknown's avatar
unknown committed
1625 1626 1627
    }
  }
  // No, WHEN clauses all missed, return ELSE expression
1628
  return else_expr_num != -1 ? args[else_expr_num] : 0;
unknown's avatar
unknown committed
1629 1630 1631 1632 1633
}


String *Item_func_case::val_str(String *str)
{
1634
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
1635 1636 1637 1638 1639 1640 1641 1642
  String *res;
  Item *item=find_item(str);

  if (!item)
  {
    null_value=1;
    return 0;
  }
unknown's avatar
unknown committed
1643
  null_value= 0;
unknown's avatar
unknown committed
1644
  if (!(res=item->val_str(str)))
unknown's avatar
unknown committed
1645
    null_value= 1;
unknown's avatar
unknown committed
1646 1647 1648 1649 1650 1651
  return res;
}


longlong Item_func_case::val_int()
{
1652
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
1653
  char buff[MAX_FIELD_WIDTH];
1654
  String dummy_str(buff,sizeof(buff),default_charset());
unknown's avatar
unknown committed
1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667
  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;
}

1668
double Item_func_case::val_real()
unknown's avatar
unknown committed
1669
{
1670
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
1671
  char buff[MAX_FIELD_WIDTH];
1672
  String dummy_str(buff,sizeof(buff),default_charset());
unknown's avatar
unknown committed
1673 1674 1675 1676 1677 1678 1679 1680
  Item *item=find_item(&dummy_str);
  double res;

  if (!item)
  {
    null_value=1;
    return 0;
  }
1681
  res= item->val_real();
unknown's avatar
unknown committed
1682 1683 1684 1685
  null_value=item->null_value;
  return res;
}

unknown's avatar
unknown committed
1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706

my_decimal *Item_func_case::val_decimal(my_decimal *decimal_value)
{
  DBUG_ASSERT(fixed == 1);
  char buff[MAX_FIELD_WIDTH];
  String dummy_str(buff, sizeof(buff), default_charset());
  Item *item= find_item(&dummy_str);
  my_decimal *res;

  if (!item)
  {
    null_value=1;
    return 0;
  }

  res= item->val_decimal(decimal_value);
  null_value= item->null_value;
  return res;
}


unknown's avatar
unknown committed
1707
bool Item_func_case::fix_fields(THD *thd, Item **ref)
unknown's avatar
unknown committed
1708 1709 1710 1711 1712 1713
{
  /*
    buff should match stack usage from
    Item_func_case::val_int() -> Item_func_case::find_item()
  */
  char buff[MAX_FIELD_WIDTH*2+sizeof(String)*2+sizeof(String*)*2+sizeof(double)*2+sizeof(longlong)*2];
unknown's avatar
unknown committed
1714 1715 1716 1717 1718
  bool res= Item_func::fix_fields(thd, ref);
  /*
    Call check_stack_overrun after fix_fields to be sure that stack variable
    is not optimized away
  */
unknown's avatar
unknown committed
1719 1720
  if (check_stack_overrun(thd, STACK_MIN_SIZE, buff))
    return TRUE;				// Fatal error flag is set!
unknown's avatar
unknown committed
1721
  return res;
unknown's avatar
unknown committed
1722 1723 1724 1725
}



unknown's avatar
unknown committed
1726
void Item_func_case::fix_length_and_dec()
1727
{
1728 1729
  Item **agg;
  uint nagg;
1730
  THD *thd= current_thd;
1731 1732 1733 1734
  
  if (!(agg= (Item**) sql_alloc(sizeof(Item*)*(ncases+1))))
    return;
  
1735 1736 1737 1738
  /*
    Aggregate all THEN and ELSE expression types
    and collations when string result
  */
1739 1740 1741 1742 1743 1744 1745 1746 1747
  
  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) &&
unknown's avatar
unknown committed
1748
      agg_arg_charsets(collation, agg, nagg, MY_COLL_ALLOW_CONV))
1749 1750 1751
    return;
  
  
unknown's avatar
unknown committed
1752 1753 1754 1755
  /*
    Aggregate first expression and all THEN expression types
    and collations when string comparison
  */
1756
  if (first_expr_num != -1)
1757
  {
1758 1759
    agg[0]= args[first_expr_num];
    for (nagg= 0; nagg < ncases/2 ; nagg++)
unknown's avatar
unknown committed
1760
      agg[nagg+1]= args[nagg*2];
1761
    nagg++;
1762
    agg_cmp_type(thd, &cmp_type, agg, nagg);
1763
    if ((cmp_type == STRING_RESULT) &&
unknown's avatar
unknown committed
1764
        agg_arg_charsets(cmp_collation, agg, nagg, MY_COLL_CMP_CONV))
unknown's avatar
unknown committed
1765
      return;
1766
  }
1767
  
unknown's avatar
unknown committed
1768
  if (else_expr_num == -1 || args[else_expr_num]->maybe_null)
1769
    maybe_null=1;
1770
  
unknown's avatar
unknown committed
1771 1772
  max_length=0;
  decimals=0;
1773
  for (uint i=0 ; i < ncases ; i+=2)
unknown's avatar
unknown committed
1774 1775 1776 1777
  {
    set_if_bigger(max_length,args[i+1]->max_length);
    set_if_bigger(decimals,args[i+1]->decimals);
  }
1778
  if (else_expr_num != -1) 
unknown's avatar
unknown committed
1779
  {
1780 1781
    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
1782 1783 1784
  }
}

unknown's avatar
unknown committed
1785

unknown's avatar
unknown committed
1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797
uint Item_func_case::decimal_precision() const
{
  int max_int_part=0;
  for (uint i=0 ; i < ncases ; i+=2)
    set_if_bigger(max_int_part, args[i+1]->decimal_int_part());

  if (else_expr_num != -1) 
    set_if_bigger(max_int_part, args[else_expr_num]->decimal_int_part());
  return min(max_int_part + decimals, DECIMAL_MAX_PRECISION);
}


1798
/* TODO:  Fix this so that it prints the whole CASE expression */
unknown's avatar
unknown committed
1799 1800 1801

void Item_func_case::print(String *str)
{
1802
  str->append(STRING_WITH_LEN("(case "));
1803 1804 1805 1806 1807 1808 1809
  if (first_expr_num != -1)
  {
    args[first_expr_num]->print(str);
    str->append(' ');
  }
  for (uint i=0 ; i < ncases ; i+=2)
  {
1810
    str->append(STRING_WITH_LEN("when "));
1811
    args[i]->print(str);
1812
    str->append(STRING_WITH_LEN(" then "));
1813 1814 1815 1816 1817
    args[i+1]->print(str);
    str->append(' ');
  }
  if (else_expr_num != -1)
  {
1818
    str->append(STRING_WITH_LEN("else "));
1819 1820 1821
    args[else_expr_num]->print(str);
    str->append(' ');
  }
1822
  str->append(STRING_WITH_LEN("end)"));
unknown's avatar
unknown committed
1823 1824 1825
}

/*
1826
  Coalesce - return first not NULL argument.
unknown's avatar
unknown committed
1827 1828
*/

unknown's avatar
unknown committed
1829
String *Item_func_coalesce::str_op(String *str)
unknown's avatar
unknown committed
1830
{
1831
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
1832 1833 1834
  null_value=0;
  for (uint i=0 ; i < arg_count ; i++)
  {
unknown's avatar
unknown committed
1835 1836 1837
    String *res;
    if ((res=args[i]->val_str(str)))
      return res;
unknown's avatar
unknown committed
1838 1839 1840 1841 1842
  }
  null_value=1;
  return 0;
}

unknown's avatar
unknown committed
1843
longlong Item_func_coalesce::int_op()
unknown's avatar
unknown committed
1844
{
1845
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856
  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;
}

unknown's avatar
unknown committed
1857
double Item_func_coalesce::real_op()
unknown's avatar
unknown committed
1858
{
1859
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
1860 1861 1862
  null_value=0;
  for (uint i=0 ; i < arg_count ; i++)
  {
1863
    double res= args[i]->val_real();
unknown's avatar
unknown committed
1864 1865 1866 1867 1868 1869 1870 1871
    if (!args[i]->null_value)
      return res;
  }
  null_value=1;
  return 0;
}


unknown's avatar
unknown committed
1872
my_decimal *Item_func_coalesce::decimal_op(my_decimal *decimal_value)
unknown's avatar
unknown committed
1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886
{
  DBUG_ASSERT(fixed == 1);
  null_value= 0;
  for (uint i= 0; i < arg_count; i++)
  {
    my_decimal *res= args[i]->val_decimal(decimal_value);
    if (!args[i]->null_value)
      return res;
  }
  null_value=1;
  return 0;
}


unknown's avatar
unknown committed
1887 1888
void Item_func_coalesce::fix_length_and_dec()
{
unknown's avatar
unknown committed
1889 1890
  agg_result_type(&hybrid_type, args, arg_count);
  switch (hybrid_type) {
unknown's avatar
unknown committed
1891 1892 1893
  case STRING_RESULT:
    count_only_length();
    decimals= NOT_FIXED_DEC;
unknown's avatar
unknown committed
1894
    agg_arg_charsets(collation, args, arg_count, MY_COLL_ALLOW_CONV);
unknown's avatar
unknown committed
1895 1896 1897 1898 1899 1900 1901 1902 1903
    break;
  case DECIMAL_RESULT:
    count_decimal_length();
    break;
  case REAL_RESULT:
    count_real_length();
    break;
  case INT_RESULT:
    count_only_length();
1904
    decimals= 0;
unknown's avatar
unknown committed
1905 1906
    break;
  case ROW_RESULT:
1907
  default:
unknown's avatar
unknown committed
1908 1909
    DBUG_ASSERT(0);
  }
unknown's avatar
unknown committed
1910 1911 1912
}

/****************************************************************************
1913
 Classes and function for the IN operator
unknown's avatar
unknown committed
1914 1915
****************************************************************************/

1916
static int cmp_longlong(void *cmp_arg, longlong *a,longlong *b)
unknown's avatar
unknown committed
1917 1918 1919 1920
{
  return *a < *b ? -1 : *a == *b ? 0 : 1;
}

1921
static int cmp_double(void *cmp_arg, double *a,double *b)
unknown's avatar
unknown committed
1922 1923 1924 1925
{
  return *a < *b ? -1 : *a == *b ? 0 : 1;
}

unknown's avatar
unknown committed
1926
static int cmp_row(void *cmp_arg, cmp_item_row *a, cmp_item_row *b)
unknown's avatar
unknown committed
1927 1928 1929 1930
{
  return a->compare(b);
}

unknown's avatar
unknown committed
1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943

static int cmp_decimal(void *cmp_arg, my_decimal *a, my_decimal *b)
{
  /*
    We need call of fixing buffer pointer, because fast sort just copy
    decimal buffers in memory and pointers left pointing on old buffer place
  */
  a->fix_buffer_pointer();
  b->fix_buffer_pointer();
  return my_decimal_cmp(a, b);
}


unknown's avatar
unknown committed
1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955
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;
1956
    if ((res=(*compare)(collation, base+mid*size, result)) == 0)
unknown's avatar
unknown committed
1957 1958 1959 1960 1961 1962
      return 1;
    if (res < 0)
      start=mid;
    else
      end=mid-1;
  }
1963
  return (int) ((*compare)(collation, base+start*size, result) == 0);
unknown's avatar
unknown committed
1964 1965
}

1966 1967
in_string::in_string(uint elements,qsort2_cmp cmp_func, CHARSET_INFO *cs)
  :in_vector(elements, sizeof(String), cmp_func, cs),
1968
   tmp(buff, sizeof(buff), &my_charset_bin)
unknown's avatar
unknown committed
1969 1970 1971 1972
{}

in_string::~in_string()
{
1973
  if (base)
1974
  {
unknown's avatar
unknown committed
1975
    // base was allocated with help of sql_alloc => following is OK
1976 1977
    for (uint i=0 ; i < count ; i++)
      ((String*) base)[i].free();
1978
  }
unknown's avatar
unknown committed
1979 1980 1981 1982 1983 1984 1985
}

void in_string::set(uint pos,Item *item)
{
  String *str=((String*) base)+pos;
  String *res=item->val_str(str);
  if (res && res != str)
1986 1987 1988
  {
    if (res->uses_buffer_owned_by(str))
      res->copy();
unknown's avatar
unknown committed
1989
    *str= *res;
1990
  }
1991
  if (!str->charset())
1992 1993
  {
    CHARSET_INFO *cs;
1994
    if (!(cs= item->collation.collation))
1995
      cs= &my_charset_bin;		// Should never happen for STR items
1996 1997
    str->set_charset(cs);
  }
unknown's avatar
unknown committed
1998 1999
}

2000

unknown's avatar
unknown committed
2001 2002 2003 2004 2005
byte *in_string::get_value(Item *item)
{
  return (byte*) item->val_str(&tmp);
}

unknown's avatar
unknown committed
2006 2007
in_row::in_row(uint elements, Item * item)
{
2008
  base= (char*) new cmp_item_row[count= elements];
unknown's avatar
unknown committed
2009
  size= sizeof(cmp_item_row);
2010
  compare= (qsort2_cmp) cmp_row;
unknown's avatar
unknown committed
2011
  tmp.store_value(item);
2012 2013 2014 2015 2016 2017
  /*
    We need to reset these as otherwise we will call sort() with
    uninitialized (even if not used) elements
  */
  used_count= elements;
  collation= 0;
2018 2019 2020 2021 2022
}

in_row::~in_row()
{
  if (base)
2023
    delete [] (cmp_item_row*) base;
unknown's avatar
unknown committed
2024 2025 2026 2027 2028
}

byte *in_row::get_value(Item *item)
{
  tmp.store_value(item);
unknown's avatar
unknown committed
2029 2030
  if (item->is_null())
    return 0;
unknown's avatar
unknown committed
2031 2032 2033 2034 2035 2036 2037 2038 2039 2040
  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
2041 2042

in_longlong::in_longlong(uint elements)
2043
  :in_vector(elements,sizeof(longlong),(qsort2_cmp) cmp_longlong, 0)
unknown's avatar
unknown committed
2044 2045 2046 2047 2048 2049 2050 2051 2052
{}

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
2053
  tmp= item->val_int();
unknown's avatar
unknown committed
2054
  if (item->null_value)
unknown's avatar
unknown committed
2055
    return 0;
unknown's avatar
unknown committed
2056 2057 2058 2059
  return (byte*) &tmp;
}

in_double::in_double(uint elements)
2060
  :in_vector(elements,sizeof(double),(qsort2_cmp) cmp_double, 0)
unknown's avatar
unknown committed
2061 2062 2063 2064
{}

void in_double::set(uint pos,Item *item)
{
2065
  ((double*) base)[pos]= item->val_real();
unknown's avatar
unknown committed
2066 2067 2068 2069
}

byte *in_double::get_value(Item *item)
{
2070
  tmp= item->val_real();
unknown's avatar
unknown committed
2071
  if (item->null_value)
2072
    return 0;					/* purecov: inspected */
unknown's avatar
unknown committed
2073 2074 2075
  return (byte*) &tmp;
}

unknown's avatar
unknown committed
2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104

in_decimal::in_decimal(uint elements)
  :in_vector(elements, sizeof(my_decimal),(qsort2_cmp) cmp_decimal, 0)
{}


void in_decimal::set(uint pos, Item *item)
{
  /* as far as 'item' is constant, we can store reference on my_decimal */
  my_decimal *dec= ((my_decimal *)base) + pos;
  dec->len= DECIMAL_BUFF_LENGTH;
  dec->fix_buffer_pointer();
  my_decimal *res= item->val_decimal(dec);
  if (res != dec)
    my_decimal2decimal(res, dec);
}


byte *in_decimal::get_value(Item *item)
{
  my_decimal *result= item->val_decimal(&val);
  if (item->null_value)
    return 0;
  return (byte *)result;
}


cmp_item* cmp_item::get_comparator(Item_result type,
                                   CHARSET_INFO *cs)
2105
{
unknown's avatar
unknown committed
2106
  switch (type) {
2107
  case STRING_RESULT:
unknown's avatar
unknown committed
2108
    return new cmp_item_sort_string(cs);
2109 2110 2111 2112 2113 2114
  case INT_RESULT:
    return new cmp_item_int;
  case REAL_RESULT:
    return new cmp_item_real;
  case ROW_RESULT:
    return new cmp_item_row;
unknown's avatar
unknown committed
2115 2116
  case DECIMAL_RESULT:
    return new cmp_item_decimal;
unknown's avatar
unknown committed
2117 2118 2119
  default:
    DBUG_ASSERT(0);
    break;
2120 2121 2122 2123
  }
  return 0; // to satisfy compiler :)
}

2124

unknown's avatar
unknown committed
2125 2126
cmp_item* cmp_item_sort_string::make_same()
{
2127
  return new cmp_item_sort_string_in_static(cmp_charset);
unknown's avatar
unknown committed
2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144
}

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

2145 2146 2147 2148

cmp_item_row::~cmp_item_row()
{
  DBUG_ENTER("~cmp_item_row");
2149
  DBUG_PRINT("enter",("this: 0x%lx", this));
2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161
  if (comparators)
  {
    for (uint i= 0; i < n; i++)
    {
      if (comparators[i])
	delete comparators[i];
    }
  }
  DBUG_VOID_RETURN;
}


2162 2163
void cmp_item_row::store_value(Item *item)
{
2164
  DBUG_ENTER("cmp_item_row::store_value");
2165
  n= item->cols();
2166
  if (!comparators)
unknown's avatar
unknown committed
2167
    comparators= (cmp_item **) current_thd->calloc(sizeof(cmp_item *)*n);
2168
  if (comparators)
2169
  {
2170
    item->bring_value();
unknown's avatar
unknown committed
2171
    item->null_value= 0;
2172
    for (uint i=0; i < n; i++)
2173
    {
unknown's avatar
unknown committed
2174
      if (!comparators[i])
unknown's avatar
unknown committed
2175 2176 2177
        if (!(comparators[i]=
              cmp_item::get_comparator(item->el(i)->result_type(),
                                       item->el(i)->collation.collation)))
unknown's avatar
unknown committed
2178
	  break;					// new failed
2179 2180 2181
      comparators[i]->store_value(item->el(i));
      item->null_value|= item->el(i)->null_value;
    }
2182
  }
2183
  DBUG_VOID_RETURN;
2184 2185
}

2186

unknown's avatar
unknown committed
2187 2188 2189 2190 2191
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
2192
    my_error(ER_OPERAND_COLUMNS, MYF(0), tmpl->n);
unknown's avatar
unknown committed
2193 2194 2195 2196 2197
    return;
  }
  n= tmpl->n;
  if ((comparators= (cmp_item **) sql_alloc(sizeof(cmp_item *)*n)))
  {
2198
    item->bring_value();
unknown's avatar
unknown committed
2199 2200
    item->null_value= 0;
    for (uint i=0; i < n; i++)
2201 2202 2203 2204 2205 2206 2207
    {
      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
2208 2209 2210
  }
}

2211

2212 2213
int cmp_item_row::cmp(Item *arg)
{
unknown's avatar
unknown committed
2214 2215 2216
  arg->null_value= 0;
  if (arg->cols() != n)
  {
unknown's avatar
unknown committed
2217
    my_error(ER_OPERAND_COLUMNS, MYF(0), n);
unknown's avatar
unknown committed
2218 2219
    return 1;
  }
unknown's avatar
unknown committed
2220
  bool was_null= 0;
2221
  arg->bring_value();
unknown's avatar
unknown committed
2222
  for (uint i=0; i < n; i++)
2223
  {
unknown's avatar
unknown committed
2224
    if (comparators[i]->cmp(arg->el(i)))
unknown's avatar
unknown committed
2225
    {
unknown's avatar
unknown committed
2226 2227 2228
      if (!arg->el(i)->null_value)
	return 1;
      was_null= 1;
unknown's avatar
unknown committed
2229
    }
2230
  }
unknown's avatar
unknown committed
2231
  return (arg->null_value= was_null);
unknown's avatar
unknown committed
2232 2233
}

2234

unknown's avatar
unknown committed
2235 2236 2237
int cmp_item_row::compare(cmp_item *c)
{
  cmp_item_row *cmp= (cmp_item_row *) c;
unknown's avatar
unknown committed
2238
  for (uint i=0; i < n; i++)
2239 2240
  {
    int res;
unknown's avatar
unknown committed
2241
    if ((res= comparators[i]->compare(cmp->comparators[i])))
unknown's avatar
unknown committed
2242
      return res;
2243
  }
2244 2245
  return 0;
}
unknown's avatar
unknown committed
2246

2247

unknown's avatar
unknown committed
2248 2249 2250
void cmp_item_decimal::store_value(Item *item)
{
  my_decimal *val= item->val_decimal(&value);
unknown's avatar
unknown committed
2251 2252
  /* val may be zero if item is nnull */
  if (val && val != &value)
unknown's avatar
unknown committed
2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265
    my_decimal2decimal(val, &value);
}


int cmp_item_decimal::cmp(Item *arg)
{
  my_decimal tmp_buf, *tmp= arg->val_decimal(&tmp_buf);
  if (arg->null_value)
    return 1;
  return my_decimal_cmp(&value, tmp);
}


unknown's avatar
unknown committed
2266
int cmp_item_decimal::compare(cmp_item *arg)
unknown's avatar
unknown committed
2267
{
unknown's avatar
unknown committed
2268
  cmp_item_decimal *cmp= (cmp_item_decimal*) arg;
unknown's avatar
unknown committed
2269 2270 2271 2272 2273 2274 2275 2276 2277 2278
  return my_decimal_cmp(&value, &cmp->value);
}


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


unknown's avatar
unknown committed
2279 2280 2281
bool Item_func_in::nulls_in_row()
{
  Item **arg,**arg_end;
2282
  for (arg= args+1, arg_end= args+arg_count; arg != arg_end ; arg++)
unknown's avatar
unknown committed
2283 2284 2285 2286 2287 2288 2289
  {
    if ((*arg)->null_inside())
      return 1;
  }
  return 0;
}

2290

unknown's avatar
unknown committed
2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320
/*
  Perform context analysis of an IN item tree

  SYNOPSIS:
    fix_fields()
    thd     reference to the global context of the query thread
    tables  list of all open tables involved in the query
    ref     pointer to Item* variable where pointer to resulting "fixed"
            item is to be assigned

  DESCRIPTION
    This function performs context analysis (name resolution) and calculates
    various attributes of the item tree with Item_func_in as its root.
    The function saves in ref the pointer to the item or to a newly created
    item that is considered as a replacement for the original one.

  NOTES
    Let T0(e)/T1(e) be the value of not_null_tables(e) when e is used on
    a predicate/function level. Then it's easy to show that:
      T0(e IN(e1,...,en))     = union(T1(e),intersection(T1(ei)))
      T1(e IN(e1,...,en))     = union(T1(e),intersection(T1(ei)))
      T0(e NOT IN(e1,...,en)) = union(T1(e),union(T1(ei)))
      T1(e NOT IN(e1,...,en)) = union(T1(e),intersection(T1(ei)))

  RETURN
    0   ok
    1   got error
*/

bool
2321
Item_func_in::fix_fields(THD *thd, Item **ref)
unknown's avatar
unknown committed
2322 2323 2324
{
  Item **arg, **arg_end;

2325
  if (Item_func_opt_neg::fix_fields(thd, ref))
unknown's avatar
unknown committed
2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340
    return 1;

  /* not_null_tables_cache == union(T1(e),union(T1(ei))) */
  if (pred_level && negated)
    return 0;

  /* not_null_tables_cache = union(T1(e),intersection(T1(ei))) */
  not_null_tables_cache= ~(table_map) 0;
  for (arg= args + 1, arg_end= args + arg_count; arg != arg_end; arg++)
    not_null_tables_cache&= (*arg)->not_null_tables();
  not_null_tables_cache|= (*args)->not_null_tables();
  return 0;
}


2341
static int srtcmp_in(CHARSET_INFO *cs, const String *x,const String *y)
2342
{
2343
  return cs->coll->strnncollsp(cs,
unknown's avatar
unknown committed
2344
                               (uchar *) x->ptr(),x->length(),
2345
                               (uchar *) y->ptr(),y->length(), 0);
2346 2347
}

2348

unknown's avatar
unknown committed
2349 2350
void Item_func_in::fix_length_and_dec()
{
2351 2352
  Item **arg, **arg_end;
  uint const_itm= 1;
2353
  THD *thd= current_thd;
2354
  
2355
  agg_cmp_type(thd, &cmp_type, args, arg_count);
2356

unknown's avatar
unknown committed
2357 2358 2359 2360
  if (cmp_type == STRING_RESULT &&
      agg_arg_charsets(cmp_collation, args, arg_count, MY_COLL_CMP_CONV))
    return;

2361
  for (arg=args+1, arg_end=args+arg_count; arg != arg_end ; arg++)
unknown's avatar
unknown committed
2362 2363 2364 2365 2366 2367 2368
  {
    if (!arg[0]->const_item())
    {
      const_itm= 0;
      break;
    }
  }
2369

unknown's avatar
unknown committed
2370 2371 2372 2373
  /*
    Row item with NULLs inside can return NULL or FALSE => 
    they can't be processed as static
  */
2374
  if (const_itm && !nulls_in_row())
unknown's avatar
unknown committed
2375
  {
2376
    switch (cmp_type) {
unknown's avatar
unknown committed
2377
    case STRING_RESULT:
2378
      array=new in_string(arg_count-1,(qsort2_cmp) srtcmp_in, 
2379
			  cmp_collation.collation);
unknown's avatar
unknown committed
2380 2381
      break;
    case INT_RESULT:
2382
      array= new in_longlong(arg_count-1);
unknown's avatar
unknown committed
2383 2384
      break;
    case REAL_RESULT:
2385
      array= new in_double(arg_count-1);
unknown's avatar
unknown committed
2386
      break;
unknown's avatar
unknown committed
2387
    case ROW_RESULT:
2388
      array= new in_row(arg_count-1, args[0]);
unknown's avatar
unknown committed
2389
      break;
unknown's avatar
unknown committed
2390 2391 2392
    case DECIMAL_RESULT:
      array= new in_decimal(arg_count - 1);
      break;
unknown's avatar
unknown committed
2393 2394 2395
    default:
      DBUG_ASSERT(0);
      return;
unknown's avatar
unknown committed
2396
    }
2397
    if (array && !(thd->is_fatal_error))		// If not EOM
unknown's avatar
unknown committed
2398
    {
unknown's avatar
unknown committed
2399
      uint j=0;
unknown's avatar
unknown committed
2400
      for (uint i=1 ; i < arg_count ; i++)
unknown's avatar
unknown committed
2401 2402 2403 2404
      {
	array->set(j,args[i]);
	if (!args[i]->null_value)			// Skip NULL values
	  j++;
unknown's avatar
unknown committed
2405 2406
	else
	  have_null= 1;
unknown's avatar
unknown committed
2407 2408 2409
      }
      if ((array->used_count=j))
	array->sort();
unknown's avatar
unknown committed
2410 2411 2412 2413
    }
  }
  else
  {
unknown's avatar
unknown committed
2414
    in_item= cmp_item::get_comparator(cmp_type, cmp_collation.collation);
2415
    if (cmp_type  == STRING_RESULT)
2416
      in_item->cmp_charset= cmp_collation.collation;
unknown's avatar
unknown committed
2417
  }
2418
  maybe_null= args[0]->maybe_null;
unknown's avatar
unknown committed
2419
  max_length= 1;
unknown's avatar
unknown committed
2420 2421 2422 2423 2424 2425
}


void Item_func_in::print(String *str)
{
  str->append('(');
2426
  args[0]->print(str);
unknown's avatar
unknown committed
2427
  if (negated)
2428 2429
    str->append(STRING_WITH_LEN(" not"));
  str->append(STRING_WITH_LEN(" in ("));
unknown's avatar
unknown committed
2430
  print_args(str, 1);
2431
  str->append(STRING_WITH_LEN("))"));
unknown's avatar
unknown committed
2432 2433 2434 2435 2436
}


longlong Item_func_in::val_int()
{
2437
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
2438 2439
  if (array)
  {
2440 2441
    int tmp=array->find(args[0]);
    null_value=args[0]->null_value || (!tmp && have_null);
unknown's avatar
unknown committed
2442
    return (longlong) (!null_value && tmp != negated);
unknown's avatar
unknown committed
2443
  }
2444 2445
  in_item->store_value(args[0]);
  if ((null_value=args[0]->null_value))
unknown's avatar
unknown committed
2446
    return 0;
2447
  have_null= 0;
2448
  for (uint i=1 ; i < arg_count ; i++)
unknown's avatar
unknown committed
2449 2450
  {
    if (!in_item->cmp(args[i]) && !args[i]->null_value)
unknown's avatar
unknown committed
2451
      return (longlong) (!negated);
2452
    have_null|= args[i]->null_value;
unknown's avatar
unknown committed
2453
  }
2454
  null_value= have_null;
unknown's avatar
unknown committed
2455
  return (longlong) (!null_value && negated);
unknown's avatar
unknown committed
2456 2457 2458 2459 2460
}


longlong Item_func_bit_or::val_int()
{
2461
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480
  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()
{
2481
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497
  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);
}

2498
Item_cond::Item_cond(THD *thd, Item_cond *item)
2499
  :Item_bool_func(thd, item),
2500 2501
   abort_on_null(item->abort_on_null),
   and_tables_cache(item->and_tables_cache)
2502 2503
{
  /*
unknown's avatar
unknown committed
2504
    item->list will be copied by copy_andor_arguments() call
2505 2506 2507
  */
}

unknown's avatar
unknown committed
2508

2509 2510 2511
void Item_cond::copy_andor_arguments(THD *thd, Item_cond *item)
{
  List_iterator_fast<Item> li(item->list);
unknown's avatar
unknown committed
2512
  while (Item *it= li++)
2513 2514
    list.push_back(it->copy_andor_structure(thd));
}
unknown's avatar
unknown committed
2515

unknown's avatar
unknown committed
2516

unknown's avatar
unknown committed
2517
bool
2518
Item_cond::fix_fields(THD *thd, Item **ref)
unknown's avatar
unknown committed
2519
{
2520
  DBUG_ASSERT(fixed == 0);
unknown's avatar
unknown committed
2521 2522
  List_iterator<Item> li(list);
  Item *item;
2523
#ifndef EMBEDDED_LIBRARY
unknown's avatar
unknown committed
2524
  char buff[sizeof(char*)];			// Max local vars in function
2525
#endif
2526
  not_null_tables_cache= used_tables_cache= 0;
unknown's avatar
unknown committed
2527
  const_item_cache= 1;
2528 2529 2530 2531 2532
  /*
    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
2533

2534
  if (check_stack_overrun(thd, STACK_MIN_SIZE, buff))
unknown's avatar
unknown committed
2535
    return TRUE;				// Fatal error flag is set!
2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550
  /*
    The following optimization reduces the depth of an AND-OR tree.
    E.g. a WHERE clause like
      F1 AND (F2 AND (F2 AND F4))
    is parsed into a tree with the same nested structure as defined
    by braces. This optimization will transform such tree into
      AND (F1, F2, F3, F4).
    Trees of OR items are flattened as well:
      ((F1 OR F2) OR (F3 OR F4))   =>   OR (F1, F2, F3, F4)
    Items for removed AND/OR levels will dangle until the death of the
    entire statement.
    The optimization is currently prepared statements and stored procedures
    friendly as it doesn't allocate any memory and its effects are durable
    (i.e. do not depend on PS/SP arguments).
  */
unknown's avatar
unknown committed
2551 2552
  while ((item=li++))
  {
2553
    table_map tmp_table_map;
unknown's avatar
unknown committed
2554 2555 2556 2557 2558 2559 2560
    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
    }
2561 2562
    if (abort_on_null)
      item->top_level_item();
2563 2564

    // item can be substituted in fix_fields
2565
    if ((!item->fixed &&
2566
	 item->fix_fields(thd, li.ref())) ||
2567
	(item= *li.ref())->check_cols(1))
unknown's avatar
unknown committed
2568
      return TRUE; /* purecov: inspected */
2569 2570 2571 2572
    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;
unknown's avatar
unknown committed
2573
    const_item_cache&=      item->const_item();
2574
    with_sum_func=	    with_sum_func || item->with_sum_func;
unknown's avatar
unknown committed
2575 2576
    if (item->maybe_null)
      maybe_null=1;
unknown's avatar
unknown committed
2577
  }
2578
  thd->lex->current_select->cond_count+= list.elements;
unknown's avatar
unknown committed
2579
  fix_length_and_dec();
2580
  fixed= 1;
unknown's avatar
unknown committed
2581
  return FALSE;
unknown's avatar
unknown committed
2582 2583
}

unknown's avatar
unknown committed
2584 2585 2586 2587 2588 2589 2590 2591 2592 2593
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);
}

unknown's avatar
unknown committed
2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605

/*
  Transform an Item_cond object with a transformer callback function
   
  SYNOPSIS
    transform()
    transformer   the transformer callback function to be applied to the nodes
                  of the tree of the object
    arg           parameter to be passed to the transformer
  
  DESCRIPTION
    The function recursively applies the transform method with the
unknown's avatar
unknown committed
2606
    same transformer to each member item of the condition list.
unknown's avatar
unknown committed
2607 2608 2609 2610 2611 2612 2613 2614 2615 2616
    If the call of the method for a member item returns a new item
    the old item is substituted for a new one.
    After this the transform method is applied to the root node
    of the Item_cond object. 
     
  RETURN VALUES
    Item returned as the result of transformation of the root node 
*/

Item *Item_cond::transform(Item_transformer transformer, byte *arg)
2617 2618 2619 2620 2621
{
  List_iterator<Item> li(list);
  Item *item;
  while ((item= li++))
  {
unknown's avatar
unknown committed
2622
    Item *new_item= item->transform(transformer, arg);
2623 2624 2625 2626 2627
    if (!new_item)
      return 0;
    if (new_item != item)
      li.replace(new_item);
  }
unknown's avatar
unknown committed
2628
  return Item_func::transform(transformer, arg);
2629 2630
}

2631 2632
void Item_cond::traverse_cond(Cond_traverser traverser,
                              void *arg, traverse_order order)
2633 2634 2635 2636
{
  List_iterator<Item> li(list);
  Item *item;

2637 2638 2639 2640 2641 2642 2643
  switch(order) {
  case(PREFIX):
    (*traverser)(this, arg);
    while ((item= li++))
    {
      item->traverse_cond(traverser, arg, order);
    }
2644
    (*traverser)(NULL, arg);
2645 2646 2647 2648 2649 2650 2651
    break;
  case(POSTFIX):
    while ((item= li++))
    {
      item->traverse_cond(traverser, arg, order);
    }
    (*traverser)(this, arg);
2652 2653
  }
}
unknown's avatar
unknown committed
2654

2655 2656 2657 2658
/*
  Move SUM items out from item tree and replace with reference

  SYNOPSIS
2659 2660 2661 2662
    split_sum_func()
    thd			Thread handler
    ref_pointer_array	Pointer to array of reference fields
    fields		All fields in select
2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673

  NOTES
   This function is run on all expression (SELECT list, WHERE, HAVING etc)
   that have or refer (HAVING) to a SUM expression.

   The split is done to get an unique item for each SUM function
   so that we can easily find and calculate them.
   (Calculation done by update_sum_func() and copy_sum_funcs() in
   sql_select.cc)
*/

2674 2675
void Item_cond::split_sum_func(THD *thd, Item **ref_pointer_array,
                               List<Item> &fields)
unknown's avatar
unknown committed
2676 2677 2678
{
  List_iterator<Item> li(list);
  Item *item;
2679
  while ((item= li++))
unknown's avatar
unknown committed
2680
    item->split_sum_func2(thd, ref_pointer_array, fields, li.ref(), TRUE);
unknown's avatar
unknown committed
2681 2682 2683 2684 2685 2686 2687 2688 2689
}


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

2690

unknown's avatar
unknown committed
2691 2692
void Item_cond::update_used_tables()
{
unknown's avatar
unknown committed
2693
  List_iterator_fast<Item> li(list);
unknown's avatar
unknown committed
2694
  Item *item;
2695 2696 2697

  used_tables_cache=0;
  const_item_cache=1;
unknown's avatar
unknown committed
2698 2699 2700
  while ((item=li++))
  {
    item->update_used_tables();
2701
    used_tables_cache|= item->used_tables();
unknown's avatar
unknown committed
2702
    const_item_cache&= item->const_item();
unknown's avatar
unknown committed
2703 2704 2705 2706 2707 2708 2709
  }
}


void Item_cond::print(String *str)
{
  str->append('(');
unknown's avatar
unknown committed
2710
  List_iterator_fast<Item> li(list);
unknown's avatar
unknown committed
2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723
  Item *item;
  if ((item=li++))
    item->print(str);
  while ((item=li++))
  {
    str->append(' ');
    str->append(func_name());
    str->append(' ');
    item->print(str);
  }
  str->append(')');
}

2724

2725
void Item_cond::neg_arguments(THD *thd)
2726 2727 2728 2729 2730
{
  List_iterator<Item> li(list);
  Item *item;
  while ((item= li++))		/* Apply not transformation to the arguments */
  {
2731 2732 2733
    Item *new_item= item->neg_transformer(thd);
    if (!new_item)
    {
unknown's avatar
unknown committed
2734 2735
      if (!(new_item= new Item_func_not(item)))
	return;					// Fatal OEM error
2736 2737
    }
    VOID(li.replace(new_item));
2738 2739 2740 2741
  }
}


2742
/*
unknown's avatar
unknown committed
2743
  Evaluation of AND(expr, expr, expr ...)
2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758

  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
2759 2760 2761

longlong Item_cond_and::val_int()
{
2762
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
2763
  List_iterator_fast<Item> li(list);
unknown's avatar
unknown committed
2764
  Item *item;
2765
  null_value= 0;
unknown's avatar
unknown committed
2766 2767
  while ((item=li++))
  {
unknown's avatar
unknown committed
2768
    if (!item->val_bool())
unknown's avatar
unknown committed
2769
    {
2770 2771
      if (abort_on_null || !(null_value= item->null_value))
	return 0;				// return FALSE
unknown's avatar
unknown committed
2772 2773
    }
  }
2774
  return null_value ? 0 : 1;
unknown's avatar
unknown committed
2775 2776
}

2777

unknown's avatar
unknown committed
2778 2779
longlong Item_cond_or::val_int()
{
2780
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
2781
  List_iterator_fast<Item> li(list);
unknown's avatar
unknown committed
2782 2783 2784 2785
  Item *item;
  null_value=0;
  while ((item=li++))
  {
unknown's avatar
unknown committed
2786
    if (item->val_bool())
unknown's avatar
unknown committed
2787 2788 2789 2790 2791 2792 2793 2794 2795 2796
    {
      null_value=0;
      return 1;
    }
    if (item->null_value)
      null_value=1;
  }
  return 0;
}

2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820
/*
  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)
2821
    return (*org_item= (Item*) b);
2822 2823 2824
  if (a == *org_item)
  {
    Item_cond *res;
2825
    if ((res= new Item_cond_and(a, (Item*) b)))
2826
    {
2827
      res->used_tables_cache= a->used_tables() | b->used_tables();
2828 2829
      res->not_null_tables_cache= a->not_null_tables() | b->not_null_tables();
    }
2830 2831
    return res;
  }
2832
  if (((Item_cond_and*) a)->add((Item*) b))
2833 2834
    return 0;
  ((Item_cond_and*) a)->used_tables_cache|= b->used_tables();
2835
  ((Item_cond_and*) a)->not_null_tables_cache|= b->not_null_tables();
2836 2837 2838 2839
  return a;
}


unknown's avatar
unknown committed
2840 2841
longlong Item_func_isnull::val_int()
{
2842
  DBUG_ASSERT(fixed == 1);
2843 2844 2845 2846 2847
  /*
    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
2848
    return cached_value;
unknown's avatar
unknown committed
2849
  return args[0]->is_null() ? 1: 0;
unknown's avatar
unknown committed
2850 2851
}

2852 2853
longlong Item_is_not_null_test::val_int()
{
2854
  DBUG_ASSERT(fixed == 1);
2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889
  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();
    }
  }
}
2890

2891

unknown's avatar
unknown committed
2892 2893
longlong Item_func_isnotnull::val_int()
{
2894
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
2895
  return args[0]->is_null() ? 0 : 1;
unknown's avatar
unknown committed
2896 2897 2898
}


2899 2900 2901 2902
void Item_func_isnotnull::print(String *str)
{
  str->append('(');
  args[0]->print(str);
2903
  str->append(STRING_WITH_LEN(" is not null)"));
2904 2905 2906
}


unknown's avatar
unknown committed
2907 2908
longlong Item_func_like::val_int()
{
2909
  DBUG_ASSERT(fixed == 1);
2910
  String* res = args[0]->val_str(&tmp_value1);
unknown's avatar
unknown committed
2911 2912 2913 2914 2915
  if (args[0]->null_value)
  {
    null_value=1;
    return 0;
  }
2916
  String* res2 = args[1]->val_str(&tmp_value2);
unknown's avatar
unknown committed
2917 2918 2919 2920 2921 2922
  if (args[1]->null_value)
  {
    null_value=1;
    return 0;
  }
  null_value=0;
2923 2924
  if (canDoTurboBM)
    return turboBM_matches(res->ptr(), res->length()) ? 1 : 0;
2925
  return my_wildcmp(cmp.cmp_collation.collation,
2926 2927 2928
		    res->ptr(),res->ptr()+res->length(),
		    res2->ptr(),res2->ptr()+res2->length(),
		    escape,wild_one,wild_many) ? 0 : 1;
unknown's avatar
unknown committed
2929 2930 2931 2932 2933 2934 2935
}


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

Item_func::optimize_type Item_func_like::select_optimize() const
{
2936
  if (args[1]->const_item())
unknown's avatar
unknown committed
2937
  {
2938 2939 2940 2941 2942 2943
    String* res2= args[1]->val_str((String *)&tmp_value2);

    if (!res2)
      return OPTIMIZE_NONE;

    if (*res2->ptr() != wild_many)
unknown's avatar
unknown committed
2944
    {
2945
      if (args[0]->result_type() != STRING_RESULT || *res2->ptr() != wild_one)
unknown's avatar
unknown committed
2946 2947 2948 2949 2950 2951
	return OPTIMIZE_OP;
    }
  }
  return OPTIMIZE_NONE;
}

2952

2953
bool Item_func_like::fix_fields(THD *thd, Item **ref)
2954
{
2955
  DBUG_ASSERT(fixed == 0);
2956 2957
  if (Item_bool_func2::fix_fields(thd, ref) ||
      escape_item->fix_fields(thd, &escape_item))
unknown's avatar
unknown committed
2958
    return TRUE;
2959

2960
  if (!escape_item->const_during_execution())
2961
  {
2962
    my_error(ER_WRONG_ARGUMENTS,MYF(0),"ESCAPE");
unknown's avatar
unknown committed
2963
    return TRUE;
2964 2965 2966 2967 2968 2969
  }
  
  if (escape_item->const_item())
  {
    /* If we are on execution stage */
    String *escape_str= escape_item->val_str(&tmp_value1);
2970 2971
    if (escape_str)
    {
2972 2973 2974 2975 2976 2977 2978 2979 2980
      if (escape_used_in_parsing && (
             (((thd->variables.sql_mode & MODE_NO_BACKSLASH_ESCAPES) &&
                escape_str->numchars() != 1) ||
               escape_str->numchars() > 1)))
      {
        my_error(ER_WRONG_ARGUMENTS,MYF(0),"ESCAPE");
        return TRUE;
      }

unknown's avatar
unknown committed
2981
      if (use_mb(cmp.cmp_collation.collation))
2982
      {
2983
        CHARSET_INFO *cs= escape_str->charset();
2984 2985 2986 2987 2988 2989 2990 2991 2992
        my_wc_t wc;
        int rc= cs->cset->mb_wc(cs, &wc,
                                (const uchar*) escape_str->ptr(),
                                (const uchar*) escape_str->ptr() +
                                               escape_str->length());
        escape= (int) (rc > 0 ? wc : '\\');
      }
      else
      {
unknown's avatar
unknown committed
2993 2994 2995 2996 2997
        /*
          In the case of 8bit character set, we pass native
          code instead of Unicode code as "escape" argument.
          Convert to "cs" if charset of escape differs.
        */
unknown's avatar
unknown committed
2998
        CHARSET_INFO *cs= cmp.cmp_collation.collation;
unknown's avatar
unknown committed
2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009 3010 3011
        uint32 unused;
        if (escape_str->needs_conversion(escape_str->length(),
                                         escape_str->charset(), cs, &unused))
        {
          char ch;
          uint errors;
          uint32 cnvlen= copy_and_convert(&ch, 1, cs, escape_str->ptr(),
                                          escape_str->length(),
                                          escape_str->charset(), &errors);
          escape= cnvlen ? ch : '\\';
        }
        else
          escape= *(escape_str->ptr());
3012 3013 3014 3015
      }
    }
    else
      escape= '\\';
unknown's avatar
unknown committed
3016

3017
    /*
3018 3019
      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.
3020
    */
3021 3022
    if (args[1]->const_item() && !use_strnxfrm(collation.collation) &&
       !(specialflag & SPECIAL_NO_NEW_FUNC))
3023
    {
3024 3025
      String* res2 = args[1]->val_str(&tmp_value2);
      if (!res2)
unknown's avatar
unknown committed
3026
        return FALSE;				// Null argument
3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046
      
      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;
        for (; *tmp != wild_many && *tmp != wild_one && *tmp != escape; tmp++) ;
        canDoTurboBM = (tmp == last) && !use_mb(args[0]->collation.collation);
      }
      if (canDoTurboBM)
      {
        pattern     = first + 1;
3047
        pattern_len = (int) len - 2;
3048
        DBUG_PRINT("info", ("Initializing pattern: '%s'", first));
3049 3050 3051
        int *suff = (int*) thd->alloc((int) (sizeof(int)*
                                      ((pattern_len + 1)*2+
                                      alphabet_size)));
3052 3053 3054 3055 3056 3057
        bmGs      = suff + pattern_len + 1;
        bmBc      = bmGs + pattern_len + 1;
        turboBM_compute_good_suffix_shifts(suff);
        turboBM_compute_bad_character_shifts();
        DBUG_PRINT("info",("done"));
      }
3058 3059
    }
  }
unknown's avatar
unknown committed
3060
  return FALSE;
3061 3062
}

3063 3064 3065 3066 3067 3068
void Item_func_like::cleanup()
{
  canDoTurboBM= FALSE;
  Item_bool_func2::cleanup();
}

unknown's avatar
unknown committed
3069 3070 3071
#ifdef USE_REGEX

bool
3072
Item_func_regex::fix_fields(THD *thd, Item **ref)
unknown's avatar
unknown committed
3073
{
3074
  DBUG_ASSERT(fixed == 0);
unknown's avatar
unknown committed
3075
  if ((!args[0]->fixed &&
3076
       args[0]->fix_fields(thd, args)) || args[0]->check_cols(1) ||
unknown's avatar
unknown committed
3077
      (!args[1]->fixed &&
3078
       args[1]->fix_fields(thd, args + 1)) || args[1]->check_cols(1))
unknown's avatar
unknown committed
3079
    return TRUE;				/* purecov: inspected */
unknown's avatar
unknown committed
3080
  with_sum_func=args[0]->with_sum_func || args[1]->with_sum_func;
unknown's avatar
unknown committed
3081 3082
  max_length= 1;
  decimals= 0;
3083

unknown's avatar
unknown committed
3084
  if (agg_arg_charsets(cmp_collation, args, 2, MY_COLL_CMP_CONV))
unknown's avatar
unknown committed
3085
    return TRUE;
3086

unknown's avatar
unknown committed
3087
  used_tables_cache=args[0]->used_tables() | args[1]->used_tables();
3088 3089
  not_null_tables_cache= (args[0]->not_null_tables() |
			  args[1]->not_null_tables());
unknown's avatar
unknown committed
3090 3091 3092 3093
  const_item_cache=args[0]->const_item() && args[1]->const_item();
  if (!regex_compiled && args[1]->const_item())
  {
    char buff[MAX_FIELD_WIDTH];
3094
    String tmp(buff,sizeof(buff),&my_charset_bin);
unknown's avatar
unknown committed
3095 3096 3097 3098
    String *res=args[1]->val_str(&tmp);
    if (args[1]->null_value)
    {						// Will always return NULL
      maybe_null=1;
unknown's avatar
unknown committed
3099
      return FALSE;
unknown's avatar
unknown committed
3100 3101
    }
    int error;
unknown's avatar
unknown committed
3102 3103 3104 3105 3106 3107
    if ((error= my_regcomp(&preg,res->c_ptr(),
                           ((cmp_collation.collation->state &
                             (MY_CS_BINSORT | MY_CS_CSSORT)) ?
                            REG_EXTENDED | REG_NOSUB :
                            REG_EXTENDED | REG_NOSUB | REG_ICASE),
                           cmp_collation.collation)))
unknown's avatar
unknown committed
3108
    {
unknown's avatar
unknown committed
3109
      (void) my_regerror(error,&preg,buff,sizeof(buff));
3110
      my_error(ER_REGEXP_ERROR, MYF(0), buff);
unknown's avatar
unknown committed
3111
      return TRUE;
unknown's avatar
unknown committed
3112 3113 3114 3115 3116 3117
    }
    regex_compiled=regex_is_const=1;
    maybe_null=args[0]->maybe_null;
  }
  else
    maybe_null=1;
3118
  fixed= 1;
unknown's avatar
unknown committed
3119
  return FALSE;
unknown's avatar
unknown committed
3120 3121
}

3122

unknown's avatar
unknown committed
3123 3124
longlong Item_func_regex::val_int()
{
3125
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
3126
  char buff[MAX_FIELD_WIDTH];
3127
  String *res, tmp(buff,sizeof(buff),&my_charset_bin);
unknown's avatar
unknown committed
3128 3129 3130 3131 3132 3133 3134 3135 3136 3137

  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];
3138
    String *res2, tmp2(buff2,sizeof(buff2),&my_charset_bin);
unknown's avatar
unknown committed
3139 3140 3141 3142 3143 3144 3145

    res2= args[1]->val_str(&tmp2);
    if (args[1]->null_value)
    {
      null_value=1;
      return 0;
    }
unknown's avatar
unknown committed
3146
    if (!regex_compiled || stringcmp(res2,&prev_regexp))
unknown's avatar
unknown committed
3147 3148 3149 3150
    {
      prev_regexp.copy(*res2);
      if (regex_compiled)
      {
unknown's avatar
unknown committed
3151
	my_regfree(&preg);
unknown's avatar
unknown committed
3152 3153
	regex_compiled=0;
      }
unknown's avatar
Merge  
unknown committed
3154
      if (my_regcomp(&preg,res2->c_ptr_safe(),
unknown's avatar
unknown committed
3155 3156 3157 3158 3159
                     ((cmp_collation.collation->state &
                       (MY_CS_BINSORT | MY_CS_CSSORT)) ?
                      REG_EXTENDED | REG_NOSUB :
                      REG_EXTENDED | REG_NOSUB | REG_ICASE),
                     cmp_collation.collation))
unknown's avatar
unknown committed
3160 3161 3162 3163 3164 3165 3166 3167
      {
	null_value=1;
	return 0;
      }
      regex_compiled=1;
    }
  }
  null_value=0;
unknown's avatar
unknown committed
3168
  return my_regexec(&preg,res->c_ptr(),0,(my_regmatch_t*) 0,0) ? 0 : 1;
unknown's avatar
unknown committed
3169 3170 3171
}


3172
void Item_func_regex::cleanup()
unknown's avatar
unknown committed
3173
{
3174 3175
  DBUG_ENTER("Item_func_regex::cleanup");
  Item_bool_func::cleanup();
unknown's avatar
unknown committed
3176 3177
  if (regex_compiled)
  {
unknown's avatar
unknown committed
3178
    my_regfree(&preg);
unknown's avatar
unknown committed
3179 3180
    regex_compiled=0;
  }
3181
  DBUG_VOID_RETURN;
unknown's avatar
unknown committed
3182 3183
}

3184

unknown's avatar
unknown committed
3185
#endif /* USE_REGEX */
3186 3187 3188


#ifdef LIKE_CMP_TOUPPER
unknown's avatar
unknown committed
3189
#define likeconv(cs,A) (uchar) (cs)->toupper(A)
3190
#else
unknown's avatar
unknown committed
3191
#define likeconv(cs,A) (uchar) (cs)->sort_order[(uchar) (A)]
3192 3193 3194 3195 3196 3197 3198 3199
#endif


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

3200
void Item_func_like::turboBM_compute_suffixes(int *suff)
3201 3202 3203 3204
{
  const int   plm1 = pattern_len - 1;
  int            f = 0;
  int            g = plm1;
unknown's avatar
unknown committed
3205
  int *const splm1 = suff + plm1;
3206
  CHARSET_INFO	*cs= cmp.cmp_collation.collation;
3207 3208 3209

  *splm1 = pattern_len;

unknown's avatar
unknown committed
3210
  if (!cs->sort_order)
3211 3212 3213 3214 3215 3216 3217 3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241
  {
    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;
3242
	while (g >= 0 &&
unknown's avatar
unknown committed
3243
	       likeconv(cs, pattern[g]) == likeconv(cs, pattern[g + plm1 - f]))
3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256
	  g--;
	suff[i] = f - g;
      }
    }
  }
}


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

3257
void Item_func_like::turboBM_compute_good_suffix_shifts(int *suff)
3258 3259 3260
{
  turboBM_compute_suffixes(suff);

3261 3262
  int *end = bmGs + pattern_len;
  int *k;
3263 3264 3265 3266 3267 3268 3269 3270 3271 3272 3273 3274 3275
  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++)
      {
3276
	int *tmp2 = bmGs + j;
3277 3278 3279 3280 3281 3282
	if (*tmp2 == pattern_len)
	  *tmp2 = tmp;
      }
    }
  }

3283
  int *tmp2;
3284 3285 3286 3287 3288 3289 3290 3291 3292 3293 3294 3295 3296 3297 3298 3299 3300 3301 3302 3303
  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
3304 3305 3306 3307
  int *i;
  int *end = bmBc + alphabet_size;
  int j;
  const int plm1 = pattern_len - 1;
3308
  CHARSET_INFO	*cs= cmp.cmp_collation.collation;
unknown's avatar
unknown committed
3309

3310 3311 3312
  for (i = bmBc; i < end; i++)
    *i = pattern_len;

unknown's avatar
unknown committed
3313
  if (!cs->sort_order)
unknown's avatar
unknown committed
3314
  {
3315
    for (j = 0; j < plm1; j++)
3316
      bmBc[(uint) (uchar) pattern[j]] = plm1 - j;
unknown's avatar
unknown committed
3317
  }
3318
  else
unknown's avatar
unknown committed
3319
  {
3320
    for (j = 0; j < plm1; j++)
unknown's avatar
unknown committed
3321
      bmBc[(uint) likeconv(cs,pattern[j])] = plm1 - j;
unknown's avatar
unknown committed
3322
  }
3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333 3334 3335 3336 3337
}


/**********************************************************************
  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;
3338
  CHARSET_INFO	*cs= cmp.cmp_collation.collation;
3339

3340 3341
  const int plm1=  pattern_len - 1;
  const int tlmpl= text_len - pattern_len;
3342 3343

  /* Searching */
unknown's avatar
unknown committed
3344
  if (!cs->sort_order)
3345 3346 3347
  {
    while (j <= tlmpl)
    {
3348
      register int i= plm1;
3349 3350 3351 3352
      while (i >= 0 && pattern[i] == text[i + j])
      {
	i--;
	if (i == plm1 - shift)
3353
	  i-= u;
3354 3355
      }
      if (i < 0)
unknown's avatar
unknown committed
3356
	return 1;
3357 3358 3359

      register const int v = plm1 - i;
      turboShift = u - v;
3360
      bcShift    = bmBc[(uint) (uchar) text[i + j]] - plm1 + i;
3361 3362 3363 3364 3365 3366 3367 3368 3369 3370
      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;
      }
3371
      j+= shift;
3372
    }
unknown's avatar
unknown committed
3373
    return 0;
3374 3375 3376 3377 3378 3379
  }
  else
  {
    while (j <= tlmpl)
    {
      register int i = plm1;
unknown's avatar
unknown committed
3380
      while (i >= 0 && likeconv(cs,pattern[i]) == likeconv(cs,text[i + j]))
3381 3382 3383
      {
	i--;
	if (i == plm1 - shift)
3384
	  i-= u;
3385 3386
      }
      if (i < 0)
unknown's avatar
unknown committed
3387
	return 1;
3388 3389 3390

      register const int v = plm1 - i;
      turboShift = u - v;
unknown's avatar
unknown committed
3391
      bcShift    = bmBc[(uint) likeconv(cs, text[i + j])] - plm1 + i;
3392 3393 3394 3395 3396 3397 3398 3399 3400 3401
      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;
      }
3402
      j+= shift;
3403
    }
unknown's avatar
unknown committed
3404
    return 0;
3405 3406
  }
}
unknown's avatar
unknown committed
3407

3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428

/*
  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
3429 3430
longlong Item_cond_xor::val_int()
{
3431
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
3432 3433 3434
  List_iterator<Item> li(list);
  Item *item;
  int result=0;	
3435
  null_value=0;
unknown's avatar
unknown committed
3436 3437
  while ((item=li++))
  {
3438 3439 3440 3441 3442 3443
    result^= (item->val_int() != 0);
    if (item->null_value)
    {
      null_value=1;
      return 0;
    }
unknown's avatar
unknown committed
3444
  }
3445
  return (longlong) result;
unknown's avatar
unknown committed
3446
}
3447 3448 3449 3450

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

unknown's avatar
unknown committed
3451
  SYNOPSIS
3452
    neg_transformer()
3453
    thd		thread handler
3454 3455 3456 3457 3458 3459 3460 3461 3462 3463 3464 3465 3466 3467 3468 3469 3470 3471 3472 3473

  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)

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

3474
Item *Item_func_not::neg_transformer(THD *thd)	/* NOT(x)  ->  x */
3475
{
unknown's avatar
unknown committed
3476
  return args[0];
3477 3478
}

3479 3480

Item *Item_bool_rowready_func2::neg_transformer(THD *thd)
3481
{
3482 3483
  Item *item= negated_item();
  return item;
3484 3485
}

3486 3487 3488

/* a IS NULL  ->  a IS NOT NULL */
Item *Item_func_isnull::neg_transformer(THD *thd)
3489
{
3490 3491
  Item *item= new Item_func_isnotnull(args[0]);
  return item;
3492 3493
}

3494 3495 3496

/* a IS NOT NULL  ->  a IS NULL */
Item *Item_func_isnotnull::neg_transformer(THD *thd)
3497
{
3498 3499
  Item *item= new Item_func_isnull(args[0]);
  return item;
3500 3501
}

3502 3503 3504

Item *Item_cond_and::neg_transformer(THD *thd)	/* NOT(a AND b AND ...)  -> */
					/* NOT a OR NOT b OR ... */
3505
{
3506 3507 3508
  neg_arguments(thd);
  Item *item= new Item_cond_or(list);
  return item;
3509 3510
}

3511 3512 3513

Item *Item_cond_or::neg_transformer(THD *thd)	/* NOT(a OR b OR ...)  -> */
					/* NOT a AND NOT b AND ... */
3514
{
3515 3516 3517
  neg_arguments(thd);
  Item *item= new Item_cond_and(list);
  return item;
3518 3519
}

3520 3521

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

3526 3527

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

3532 3533

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

3538 3539

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

3544 3545

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

3550 3551

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

3556 3557
// just fake method, should never be called
Item *Item_bool_rowready_func2::negated_item()
3558
{
3559 3560
  DBUG_ASSERT(0);
  return 0;
3561
}
3562 3563 3564 3565 3566 3567 3568 3569 3570 3571 3572 3573 3574 3575 3576 3577 3578

Item_equal::Item_equal(Item_field *f1, Item_field *f2)
  : Item_bool_func(), const_item(0), eval_item(0), cond_false(0)
{
  const_item_cache= 0;
  fields.push_back(f1);
  fields.push_back(f2);
}

Item_equal::Item_equal(Item *c, Item_field *f)
  : Item_bool_func(), eval_item(0), cond_false(0)
{
  const_item_cache= 0;
  fields.push_back(f);
  const_item= c;
}

3579

3580 3581 3582 3583 3584 3585 3586 3587 3588 3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599 3600 3601 3602 3603 3604
Item_equal::Item_equal(Item_equal *item_equal)
  : Item_bool_func(), eval_item(0), cond_false(0)
{
  const_item_cache= 0;
  List_iterator_fast<Item_field> li(item_equal->fields);
  Item_field *item;
  while ((item= li++))
  {
    fields.push_back(item);
  }
  const_item= item_equal->const_item;
  cond_false= item_equal->cond_false;
}

void Item_equal::add(Item *c)
{
  if (cond_false)
    return;
  if (!const_item)
  {
    const_item= c;
    return;
  }
  Item_func_eq *func= new Item_func_eq(c, const_item);
  func->set_cmp_func();
unknown's avatar
unknown committed
3605
  func->quick_fix_field();
3606 3607 3608 3609 3610 3611 3612 3613
  cond_false =  !(func->val_int());
}

void Item_equal::add(Item_field *f)
{
  fields.push_back(f);
}

unknown's avatar
unknown committed
3614 3615
uint Item_equal::members()
{
3616
  return fields.elements;
unknown's avatar
unknown committed
3617 3618 3619 3620 3621 3622 3623 3624
}


/*
  Check whether a field is referred in the multiple equality 

  SYNOPSIS
    contains()
unknown's avatar
unknown committed
3625
    field   field whose occurrence is to be checked
unknown's avatar
unknown committed
3626 3627
  
  DESCRIPTION
unknown's avatar
unknown committed
3628
    The function checks whether field is occurred in the Item_equal object 
unknown's avatar
unknown committed
3629 3630 3631 3632 3633 3634
    
  RETURN VALUES
    1       if nultiple equality contains a reference to field
    0       otherwise    
*/

3635 3636 3637 3638 3639 3640 3641 3642 3643 3644 3645 3646
bool Item_equal::contains(Field *field)
{
  List_iterator_fast<Item_field> it(fields);
  Item_field *item;
  while ((item= it++))
  {
    if (field->eq(item->field))
        return 1;
  }
  return 0;
}

unknown's avatar
unknown committed
3647 3648 3649 3650 3651 3652 3653 3654 3655

/*
  Join members of another Item_equal object  

  SYNOPSIS
    merge()
    item    multiple equality whose members are to be joined
  
  DESCRIPTION
unknown's avatar
unknown committed
3656
    The function actually merges two multiple equalities.
unknown's avatar
unknown committed
3657 3658 3659 3660 3661 3662 3663 3664 3665
    After this operation the Item_equal object additionally contains
    the field items of another item of the type Item_equal.
    If the optional constant items are not equal the cond_false flag is
    set to 1.  
       
  RETURN VALUES
    none    
*/

3666 3667 3668 3669 3670 3671 3672 3673 3674 3675 3676
void Item_equal::merge(Item_equal *item)
{
  fields.concat(&item->fields);
  Item *c= item->const_item;
  if (c)
  {
    /* 
      The flag cond_false will be set to 1 after this, if 
      the multiple equality already contains a constant and its 
      value is  not equal to the value of c.
    */
unknown's avatar
unknown committed
3677
    add(c);
3678 3679 3680 3681
  }
  cond_false|= item->cond_false;
} 

unknown's avatar
unknown committed
3682 3683 3684 3685 3686 3687 3688 3689 3690 3691 3692 3693 3694 3695 3696 3697 3698 3699 3700 3701 3702 3703 3704 3705 3706 3707

/*
  Order field items in multiple equality according to a sorting criteria 

  SYNOPSIS
    sort()
    cmp          function to compare field item 
    arg          context extra parameter for the cmp function
  
  DESCRIPTION
    The function perform ordering of the field items in the Item_equal
    object according to the criteria determined by the cmp callback parameter.
    If cmp(item_field1,item_field2,arg)<0 than item_field1 must be
    placed after item_fiel2.

  IMPLEMENTATION
    The function sorts field items by the exchange sort algorithm.
    The list of field items is looked through and whenever two neighboring
    members follow in a wrong order they are swapped. This is performed
    again and again until we get all members in a right order.
         
  RETURN VALUES
    None    
*/

void Item_equal::sort(Item_field_cmpfunc cmp, void *arg)
3708 3709 3710 3711 3712 3713 3714 3715 3716 3717 3718 3719
{
  bool swap;
  List_iterator<Item_field> it(fields);
  do
  {
    Item_field *item1= it++;
    Item_field **ref1= it.ref();
    Item_field *item2;

    swap= FALSE;
    while ((item2= it++))
    {
unknown's avatar
unknown committed
3720 3721
      Item_field **ref2= it.ref();
      if (cmp(item1, item2, arg) < 0)
3722 3723 3724 3725 3726 3727 3728 3729 3730 3731 3732 3733 3734 3735 3736 3737
      {
        Item_field *item= *ref1;
        *ref1= *ref2;
        *ref2= item;
        swap= TRUE;
      }
      else
      {
        item1= item2;
        ref1= ref2;
      }
    }
    it.rewind();
  } while (swap);
}

3738
bool Item_equal::fix_fields(THD *thd, Item **ref)
3739 3740 3741 3742 3743 3744 3745 3746 3747 3748 3749 3750 3751 3752 3753 3754 3755 3756 3757 3758 3759 3760 3761 3762
{
  List_iterator_fast<Item_field> li(fields);
  Item *item;
  not_null_tables_cache= used_tables_cache= 0;
  const_item_cache= 0;
  while ((item=li++))
  {
    table_map tmp_table_map;
    used_tables_cache|= item->used_tables();
    tmp_table_map= item->not_null_tables();
    not_null_tables_cache|= tmp_table_map;
    if (item->maybe_null)
      maybe_null=1;
  }
  fix_length_and_dec();
  fixed= 1;
  return 0;
}

void Item_equal::update_used_tables()
{
  List_iterator_fast<Item_field> li(fields);
  Item *item;
  not_null_tables_cache= used_tables_cache= 0;
unknown's avatar
unknown committed
3763 3764
  if ((const_item_cache= cond_false))
    return;
3765 3766 3767 3768 3769 3770 3771 3772 3773 3774
  while ((item=li++))
  {
    item->update_used_tables();
    used_tables_cache|= item->used_tables();
    const_item_cache&= item->const_item();
  }
}

longlong Item_equal::val_int()
{
3775
  Item_field *item_field;
3776 3777 3778 3779 3780 3781 3782
  if (cond_false)
    return 0;
  List_iterator_fast<Item_field> it(fields);
  Item *item= const_item ? const_item : it++;
  if ((null_value= item->null_value))
    return 0;
  eval_item->store_value(item);
3783
  while ((item_field= it++))
3784
  {
3785 3786 3787 3788 3789 3790
    /* Skip fields of non-const tables. They haven't been read yet */
    if (item_field->field->table->const_table)
    {
      if ((null_value= item_field->null_value) || eval_item->cmp(item_field))
        return 0;
    }
3791 3792 3793 3794 3795 3796 3797
  }
  return 1;
}

void Item_equal::fix_length_and_dec()
{
  Item *item= const_item ? const_item : get_first();
unknown's avatar
unknown committed
3798 3799
  eval_item= cmp_item::get_comparator(item->result_type(),
                                      item->collation.collation);
3800 3801 3802 3803 3804 3805 3806 3807 3808 3809 3810 3811 3812 3813
  if (item->result_type() == STRING_RESULT)
    eval_item->cmp_charset= cmp_collation.collation;
}

bool Item_equal::walk(Item_processor processor, byte *arg)
{
  List_iterator_fast<Item_field> it(fields);
  Item *item;
  while ((item= it++))
    if (item->walk(processor, arg))
      return 1;
  return Item_func::walk(processor, arg);
}

unknown's avatar
unknown committed
3814
Item *Item_equal::transform(Item_transformer transformer, byte *arg)
3815 3816 3817 3818 3819
{
  List_iterator<Item_field> it(fields);
  Item *item;
  while ((item= it++))
  {
unknown's avatar
unknown committed
3820
    Item *new_item= item->transform(transformer, arg);
3821 3822 3823 3824 3825
    if (!new_item)
      return 0;
    if (new_item != item)
      it.replace((Item_field *) new_item);
  }
unknown's avatar
unknown committed
3826
  return Item_func::transform(transformer, arg);
3827 3828 3829 3830 3831 3832 3833 3834
}

void Item_equal::print(String *str)
{
  str->append(func_name());
  str->append('(');
  List_iterator_fast<Item_field> it(fields);
  Item *item;
unknown's avatar
unknown committed
3835 3836 3837 3838 3839
  if (const_item)
    const_item->print(str);
  else
  {
    item= it++;
3840
    item->print(str);
unknown's avatar
unknown committed
3841
  }
3842 3843 3844 3845 3846 3847 3848 3849 3850
  while ((item= it++))
  {
    str->append(',');
    str->append(' ');
    item->print(str);
  }
  str->append(')');
}