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

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

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

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


unknown's avatar
unknown committed
17 18 19 20 21 22
/**
  @file

  @brief
  This file defines all compare functions
*/
unknown's avatar
unknown committed
23

24
#ifdef USE_PRAGMA_IMPLEMENTATION
unknown's avatar
unknown committed
25 26 27 28 29
#pragma implementation				// gcc: Class implementation
#endif

#include "mysql_priv.h"
#include <m_ctype.h>
30
#include "sql_select.h"
31

32
static bool convert_constant_item(THD *, Item_field *, Item **);
33

34 35
static Item_result item_store_type(Item_result a, Item *item,
                                   my_bool unsigned_flag)
36
{
37 38
  Item_result b= item->result_type();

39 40 41 42
  if (a == STRING_RESULT || b == STRING_RESULT)
    return STRING_RESULT;
  else if (a == REAL_RESULT || b == REAL_RESULT)
    return REAL_RESULT;
43 44
  else if (a == DECIMAL_RESULT || b == DECIMAL_RESULT ||
           unsigned_flag != item->unsigned_flag)
unknown's avatar
unknown committed
45
    return DECIMAL_RESULT;
46 47 48 49 50 51
  else
    return INT_RESULT;
}

static void agg_result_type(Item_result *type, Item **items, uint nitems)
{
52
  Item **item, **item_end;
53
  my_bool unsigned_flag= 0;
54 55 56 57

  *type= STRING_RESULT;
  /* Skip beginning NULL items */
  for (item= items, item_end= item + nitems; item < item_end; item++)
58
  {
59 60 61
    if ((*item)->type() != Item::NULL_ITEM)
    {
      *type= (*item)->result_type();
62
      unsigned_flag= (*item)->unsigned_flag;
63 64 65
      item++;
      break;
    }
66 67
  }
  /* Combine result types. Note: NULL items don't affect the result */
68
  for (; item < item_end; item++)
69
  {
70
    if ((*item)->type() != Item::NULL_ITEM)
71
      *type= item_store_type(*type, *item, unsigned_flag);
72
  }
73 74
}

75

76
/*
77
  Compare row signature of two expressions
78

79 80 81 82
  SYNOPSIS:
    cmp_row_type()
    item1          the first expression
    item2         the second expression
83 84

  DESCRIPTION
85 86 87 88 89 90 91 92 93
    The function checks that two expressions have compatible row signatures
    i.e. that the number of columns they return are the same and that if they
    are both row expressions then each component from the first expression has 
    a row signature compatible with the signature of the corresponding component
    of the second expression.

  RETURN VALUES
    1  type incompatibility has been detected
    0  otherwise
94 95
*/

96
static int cmp_row_type(Item* item1, Item* item2)
97
{
98 99 100 101 102
  uint n= item1->cols();
  if (item2->check_cols(n))
    return 1;
  for (uint i=0; i<n; i++)
  {
unknown's avatar
unknown committed
103 104 105
    if (item2->element_index(i)->check_cols(item1->element_index(i)->cols()) ||
        (item1->element_index(i)->result_type() == ROW_RESULT &&
         cmp_row_type(item1->element_index(i), item2->element_index(i))))
106 107 108
      return 1;
  }
  return 0;
109 110 111
}


unknown's avatar
unknown committed
112
/**
113
  Aggregates result types from the array of items.
114

115 116 117 118 119
  SYNOPSIS:
    agg_cmp_type()
    type   [out] the aggregated type
    items        array of items to aggregate the type from
    nitems       number of items in the array
120 121

  DESCRIPTION
122 123 124
    This function aggregates result types from the array of items. Found type
    supposed to be used later for comparison of values of these items.
    Aggregation itself is performed by the item_cmp_type() function.
unknown's avatar
unknown committed
125 126 127
  @param[out] type    the aggregated type
  @param      items        array of items to aggregate the type from
  @param      nitems       number of items in the array
128

unknown's avatar
unknown committed
129
  @retval
130
    1  type incompatibility has been detected
unknown's avatar
unknown committed
131
  @retval
132
    0  otherwise
133 134
*/

unknown's avatar
unknown committed
135
static int agg_cmp_type(Item_result *type, Item **items, uint nitems)
136 137
{
  uint i;
138 139
  type[0]= items[0]->result_type();
  for (i= 1 ; i < nitems ; i++)
140
  {
141
    type[0]= item_cmp_type(type[0], items[i]->result_type());
142 143 144 145 146 147 148 149 150 151 152
    /*
      When aggregating types of two row expressions we have to check
      that they have the same cardinality and that each component
      of the first row expression has a compatible row signature with
      the signature of the corresponding component of the second row
      expression.
    */ 
    if (type[0] == ROW_RESULT && cmp_row_type(items[0], items[i]))
      return 1;     // error found: invalid usage of rows
  }
  return 0;
153 154
}

155

156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184
/**
  @brief Aggregates field types from the array of items.

  @param[in] items  array of items to aggregate the type from
  @paran[in] nitems number of items in the array

  @details This function aggregates field types from the array of items.
    Found type is supposed to be used later as the result field type
    of a multi-argument function.
    Aggregation itself is performed by the Field::field_type_merge()
    function.

  @note The term "aggregation" is used here in the sense of inferring the
    result type of a function from its argument types.

  @return aggregated field type.
*/

enum_field_types agg_field_type(Item **items, uint nitems)
{
  uint i;
  if (!nitems || items[0]->result_type() == ROW_RESULT )
    return (enum_field_types)-1;
  enum_field_types res= items[0]->field_type();
  for (i= 1 ; i < nitems ; i++)
    res= Field::field_type_merge(res, items[i]->field_type());
  return res;
}

unknown's avatar
unknown committed
185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220
/*
  Collects different types for comparison of first item with each other items

  SYNOPSIS
    collect_cmp_types()
      items             Array of items to collect types from
      nitems            Number of items in the array

  DESCRIPTION
    This function collects different result types for comparison of the first
    item in the list with each of the remaining items in the 'items' array.

  RETURN
    0 - if row type incompatibility has been detected (see cmp_row_type)
    Bitmap of collected types - otherwise
*/

static uint collect_cmp_types(Item **items, uint nitems)
{
  uint i;
  uint found_types;
  Item_result left_result= items[0]->result_type();
  DBUG_ASSERT(nitems > 1);
  found_types= 0;
  for (i= 1; i < nitems ; i++)
  {
    if ((left_result == ROW_RESULT || 
         items[i]->result_type() == ROW_RESULT) &&
        cmp_row_type(items[0], items[i]))
      return 0;
    found_types|= 1<< (uint)item_cmp_type(left_result,
                                           items[i]->result_type());
  }
  return found_types;
}

unknown's avatar
unknown committed
221 222
static void my_coll_agg_error(DTCollation &c1, DTCollation &c2,
                              const char *fname)
223
{
224 225 226 227
  my_error(ER_CANT_AGGREGATE_2COLLATIONS, MYF(0),
           c1.collation->name,c1.derivation_name(),
           c2.collation->name,c2.derivation_name(),
           fname);
228 229
}

unknown's avatar
unknown committed
230 231

Item_bool_func2* Eq_creator::create(Item *a, Item *b) const
unknown's avatar
unknown committed
232 233 234
{
  return new Item_func_eq(a, b);
}
unknown's avatar
unknown committed
235 236 237


Item_bool_func2* Ne_creator::create(Item *a, Item *b) const
unknown's avatar
unknown committed
238 239 240
{
  return new Item_func_ne(a, b);
}
unknown's avatar
unknown committed
241 242 243


Item_bool_func2* Gt_creator::create(Item *a, Item *b) const
unknown's avatar
unknown committed
244 245 246
{
  return new Item_func_gt(a, b);
}
unknown's avatar
unknown committed
247 248 249


Item_bool_func2* Lt_creator::create(Item *a, Item *b) const
unknown's avatar
unknown committed
250 251 252
{
  return new Item_func_lt(a, b);
}
unknown's avatar
unknown committed
253 254 255


Item_bool_func2* Ge_creator::create(Item *a, Item *b) const
unknown's avatar
unknown committed
256 257 258
{
  return new Item_func_ge(a, b);
}
unknown's avatar
unknown committed
259 260 261


Item_bool_func2* Le_creator::create(Item *a, Item *b) const
unknown's avatar
unknown committed
262 263 264
{
  return new Item_func_le(a, b);
}
unknown's avatar
unknown committed
265

unknown's avatar
unknown committed
266
/*
267
  Test functions
268 269
  Most of these  returns 0LL if false and 1LL if true and
  NULL if some arg is NULL.
unknown's avatar
unknown committed
270 271 272 273
*/

longlong Item_func_not::val_int()
{
274
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
275
  bool value= args[0]->val_bool();
unknown's avatar
unknown committed
276
  null_value=args[0]->null_value;
277
  return ((!null_value && value == 0) ? 1 : 0);
unknown's avatar
unknown committed
278 279
}

280 281 282 283 284 285 286 287 288
/*
  We put any NOT expression into parenthesis to avoid
  possible problems with internal view representations where
  any '!' is converted to NOT. It may cause a problem if
  '!' is used in an expression together with other operators
  whose precedence is lower than the precedence of '!' yet
  higher than the precedence of NOT.
*/

289
void Item_func_not::print(String *str, enum_query_type query_type)
290 291
{
  str->append('(');
292
  Item_func::print(str, query_type);
293 294 295
  str->append(')');
}

unknown's avatar
unknown committed
296 297
/**
  special NOT for ALL subquery.
298 299
*/

unknown's avatar
unknown committed
300

301
longlong Item_func_not_all::val_int()
302 303
{
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
304
  bool value= args[0]->val_bool();
305 306

  /*
unknown's avatar
unknown committed
307 308
    return TRUE if there was records in underlying select in max/min
    optimization (ALL subquery)
309 310 311 312
  */
  if (empty_underlying_subquery())
    return 1;

313
  null_value= args[0]->null_value;
314 315 316 317 318 319 320 321
  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()));
322 323
}

324
void Item_func_not_all::print(String *str, enum_query_type query_type)
unknown's avatar
unknown committed
325 326
{
  if (show)
327
    Item_func::print(str, query_type);
unknown's avatar
unknown committed
328
  else
329
    args[0]->print(str, query_type);
unknown's avatar
unknown committed
330 331
}

332

unknown's avatar
unknown committed
333 334 335 336 337 338 339
/**
  Special NOP (No OPeration) for ALL subquery. It is like
  Item_func_not_all.

  @return
    (return TRUE if underlying subquery do not return rows) but if subquery
    returns some rows it return same value as argument (TRUE/FALSE).
340 341 342 343 344
*/

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

  /*
unknown's avatar
unknown committed
348 349
    return FALSE if there was records in underlying select in max/min
    optimization (SAME/ANY subquery)
350 351
  */
  if (empty_underlying_subquery())
unknown's avatar
unknown committed
352
    return 0;
353 354 355 356 357 358

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


unknown's avatar
unknown committed
359 360
/**
  Convert a constant item to an int and replace the original item.
361 362 363 364 365 366 367 368

    The function converts a constant expression or string to an integer.
    On successful conversion the original item is substituted for the
    result of the item evaluation.
    This is done when comparing DATE/TIME of different formats and
    also when comparing bigint to strings (in which case strings
    are converted to bigints).

unknown's avatar
unknown committed
369 370 371 372 373
  @param  thd             thread handle
  @param  field           item will be converted using the type of this field
  @param[in,out] item     reference to the item to convert

  @note
374 375 376 377 378
    This function is called only at prepare stage.
    As all derived tables are filled only after all derived tables
    are prepared we do not evaluate items with subselects here because
    they can contain derived tables and thus we may attempt to use a
    table that has not been populated yet.
unknown's avatar
unknown committed
379

unknown's avatar
unknown committed
380
  @retval
381
    0  Can't convert item
unknown's avatar
unknown committed
382
  @retval
383
    1  Item was replaced with an integer version of the item
unknown's avatar
unknown committed
384
*/
unknown's avatar
unknown committed
385

386 387
static bool convert_constant_item(THD *thd, Item_field *field_item,
                                  Item **item)
unknown's avatar
unknown committed
388
{
389
  Field *field= field_item->field;
390
  int result= 0;
unknown's avatar
unknown committed
391

392
  if (!(*item)->with_subselect && (*item)->const_item())
unknown's avatar
unknown committed
393
  {
unknown's avatar
unknown committed
394 395
    TABLE *table= field->table;
    ulong orig_sql_mode= thd->variables.sql_mode;
396
    enum_check_fields orig_count_cuted_fields= thd->count_cuted_fields;
unknown's avatar
unknown committed
397 398
    my_bitmap_map *old_write_map;
    my_bitmap_map *old_read_map;
399
    ulonglong orig_field_val; /* original field value if valid */
unknown's avatar
unknown committed
400

401 402
    LINT_INIT(old_write_map);
    LINT_INIT(old_read_map);
403
    LINT_INIT(orig_field_val);
404

unknown's avatar
unknown committed
405 406 407 408 409
    if (table)
    {
      old_write_map= dbug_tmp_use_all_columns(table, table->write_set);
      old_read_map= dbug_tmp_use_all_columns(table, table->read_set);
    }
410
    /* For comparison purposes allow invalid dates like 2000-01-32 */
411 412
    thd->variables.sql_mode= (orig_sql_mode & ~MODE_NO_ZERO_DATE) | 
                             MODE_INVALID_DATES;
413
    thd->count_cuted_fields= CHECK_FIELD_IGNORE;
414

415 416 417 418 419 420
    /*
      Store the value of the field if it references an outer field because
      the call to save_in_field below overrides that value.
    */
    if (field_item->depended_from)
      orig_field_val= field->val_int();
unknown's avatar
unknown committed
421
    if (!(*item)->is_null() && !(*item)->save_in_field(field, 1))
unknown's avatar
unknown committed
422
    {
423 424
      Item *tmp= new Item_int_with_ref(field->val_int(), *item,
                                       test(field->flags & UNSIGNED_FLAG));
425
      if (tmp)
426
        thd->change_item_tree(item, tmp);
427
      result= 1;					// Item was replaced
unknown's avatar
unknown committed
428
    }
429 430 431 432 433 434
    /* Restore the original field value. */
    if (field_item->depended_from)
    {
      result= field->store(orig_field_val, TRUE);
      /* orig_field_val must be a valid value that can be restored back. */
      DBUG_ASSERT(!result);
unknown's avatar
unknown committed
435
    }
unknown's avatar
unknown committed
436
    thd->variables.sql_mode= orig_sql_mode;
437
    thd->count_cuted_fields= orig_count_cuted_fields;
unknown's avatar
unknown committed
438 439 440 441 442
    if (table)
    {
      dbug_tmp_restore_column_map(table->write_set, old_write_map);
      dbug_tmp_restore_column_map(table->read_set, old_read_map);
    }
unknown's avatar
unknown committed
443
  }
444
  return result;
unknown's avatar
unknown committed
445 446
}

unknown's avatar
unknown committed
447

448 449 450
void Item_bool_func2::fix_length_and_dec()
{
  max_length= 1;				     // Function returns 0 or 1
451
  THD *thd;
452 453 454 455 456 457 458

  /*
    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;
459 460 461 462 463 464 465 466 467 468 469 470 471

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

472
  
473 474 475
  DTCollation coll;
  if (args[0]->result_type() == STRING_RESULT &&
      args[1]->result_type() == STRING_RESULT &&
476
      agg_arg_charsets(coll, args, 2, MY_COLL_CMP_CONV, 1))
unknown's avatar
unknown committed
477
    return;
478
    
479 480
  args[0]->cmp_context= args[1]->cmp_context=
    item_cmp_type(args[0]->result_type(), args[1]->result_type());
unknown's avatar
unknown committed
481
  // Make a special case of compare with fields to get nicer DATE comparisons
unknown's avatar
unknown committed
482 483 484 485 486 487

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

489
  thd= current_thd;
490
  if (!thd->is_context_analysis_only())
unknown's avatar
unknown committed
491
  {
492
    if (args[0]->real_item()->type() == FIELD_ITEM)
unknown's avatar
unknown committed
493
    {
494 495 496
      Item_field *field_item= (Item_field*) (args[0]->real_item());
      if (field_item->field->can_be_compared_as_longlong() &&
          !(field_item->is_datetime() &&
497
            args[1]->result_type() == STRING_RESULT))
unknown's avatar
unknown committed
498
      {
499
        if (convert_constant_item(thd, field_item, &args[1]))
500 501 502
        {
          cmp.set_cmp_func(this, tmp_arg, tmp_arg+1,
                           INT_RESULT);		// Works for all types.
503
          args[0]->cmp_context= args[1]->cmp_context= INT_RESULT;
504 505
          return;
        }
unknown's avatar
unknown committed
506 507
      }
    }
508
    if (args[1]->real_item()->type() == FIELD_ITEM)
unknown's avatar
unknown committed
509
    {
510 511 512
      Item_field *field_item= (Item_field*) (args[1]->real_item());
      if (field_item->field->can_be_compared_as_longlong() &&
          !(field_item->is_datetime() &&
513
            args[0]->result_type() == STRING_RESULT))
unknown's avatar
unknown committed
514
      {
515
        if (convert_constant_item(thd, field_item, &args[0]))
516 517 518
        {
          cmp.set_cmp_func(this, tmp_arg, tmp_arg+1,
                           INT_RESULT); // Works for all types.
519
          args[0]->cmp_context= args[1]->cmp_context= INT_RESULT;
520 521
          return;
        }
unknown's avatar
unknown committed
522 523 524
      }
    }
  }
525
  set_cmp_func();
unknown's avatar
unknown committed
526 527
}

528

529
int Arg_comparator::set_compare_func(Item_bool_func2 *item, Item_result type)
unknown's avatar
unknown committed
530
{
531
  owner= item;
unknown's avatar
unknown committed
532 533
  func= comparator_matrix[type]
                         [test(owner->functype() == Item_func::EQUAL_FUNC)];
unknown's avatar
unknown committed
534
  switch (type) {
unknown's avatar
unknown committed
535
  case ROW_RESULT:
unknown's avatar
unknown committed
536
  {
537 538
    uint n= (*a)->cols();
    if (n != (*b)->cols())
539
    {
unknown's avatar
unknown committed
540
      my_error(ER_OPERAND_COLUMNS, MYF(0), n);
541 542 543
      comparators= 0;
      return 1;
    }
544
    if (!(comparators= new Arg_comparator[n]))
unknown's avatar
unknown committed
545 546 547
      return 1;
    for (uint i=0; i < n; i++)
    {
548
      if ((*a)->element_index(i)->cols() != (*b)->element_index(i)->cols())
unknown's avatar
unknown committed
549
      {
550
	my_error(ER_OPERAND_COLUMNS, MYF(0), (*a)->element_index(i)->cols());
unknown's avatar
unknown committed
551
	return 1;
unknown's avatar
unknown committed
552
      }
unknown's avatar
unknown committed
553 554
      comparators[i].set_cmp_func(owner, (*a)->addr(i), (*b)->addr(i));
    }
unknown's avatar
unknown committed
555
    break;
556
  }
unknown's avatar
unknown committed
557
  case STRING_RESULT:
558 559 560 561 562
  {
    /*
      We must set cmp_charset here as we may be called from for an automatic
      generated item, like in natural join
    */
563 564
    if (cmp_collation.set((*a)->collation, (*b)->collation) || 
	cmp_collation.derivation == DERIVATION_NONE)
565 566 567 568
    {
      my_coll_agg_error((*a)->collation, (*b)->collation, owner->func_name());
      return 1;
    }
569
    if (cmp_collation.collation == &my_charset_bin)
unknown's avatar
unknown committed
570 571
    {
      /*
572
	We are using BLOB/BINARY/VARBINARY, change to compare byte by byte,
unknown's avatar
unknown committed
573 574 575 576 577 578
	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
579 580

      /*
unknown's avatar
unknown committed
581
        As this is binary compassion, mark all fields that they can't be
unknown's avatar
unknown committed
582 583 584 585 586 587
        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'
      */
588 589
      (*a)->walk(&Item::set_no_const_sub, FALSE, (uchar*) 0);
      (*b)->walk(&Item::set_no_const_sub, FALSE, (uchar*) 0);
unknown's avatar
unknown committed
590
    }
unknown's avatar
unknown committed
591
    break;
592
  }
unknown's avatar
unknown committed
593
  case INT_RESULT:
594
  {
595
    if (func == &Arg_comparator::compare_int_signed)
596 597
    {
      if ((*a)->unsigned_flag)
unknown's avatar
unknown committed
598 599 600
        func= (((*b)->unsigned_flag)?
               &Arg_comparator::compare_int_unsigned :
               &Arg_comparator::compare_int_unsigned_signed);
601 602 603
      else if ((*b)->unsigned_flag)
        func= &Arg_comparator::compare_int_signed_unsigned;
    }
604 605 606 607 608
    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
609 610 611 612 613
    break;
  }
  case DECIMAL_RESULT:
    break;
  case REAL_RESULT:
614 615 616
  {
    if ((*a)->decimals < NOT_FIXED_DEC && (*b)->decimals < NOT_FIXED_DEC)
    {
617
      precision= 5 / log_10[max((*a)->decimals, (*b)->decimals) + 1];
618 619 620 621 622
      if (func == &Arg_comparator::compare_real)
        func= &Arg_comparator::compare_real_fixed;
      else if (func == &Arg_comparator::compare_e_real)
        func= &Arg_comparator::compare_e_real_fixed;
    }
unknown's avatar
unknown committed
623
    break;
unknown's avatar
unknown committed
624
  }
unknown's avatar
unknown committed
625 626
  default:
    DBUG_ASSERT(0);
627
  }
628
  return 0;
unknown's avatar
unknown committed
629
}
unknown's avatar
unknown committed
630

unknown's avatar
unknown committed
631

632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651
/**
  @brief Convert date provided in a string to the int representation.

  @param[in]   thd        thread handle
  @param[in]   str        a string to convert
  @param[in]   warn_type  type of the timestamp for issuing the warning
  @param[in]   warn_name  field name for issuing the warning
  @param[out]  error_arg  could not extract a DATE or DATETIME

  @details Convert date provided in the string str to the int
    representation.  If the string contains wrong date or doesn't
    contain it at all then a warning is issued.  The warn_type and
    the warn_name arguments are used as the name and the type of the
    field when issuing the warning.  If any input was discarded
    (trailing or non-timestampy characters), was_cut will be non-zero.
    was_type will return the type str_to_datetime() could correctly
    extract.

  @return
    converted value. 0 on error and on zero-dates -- check 'failure'
652 653 654 655 656 657
*/

static ulonglong
get_date_from_str(THD *thd, String *str, timestamp_type warn_type,
                  char *warn_name, bool *error_arg)
{
unknown's avatar
unknown committed
658
  ulonglong value= 0;
659 660 661 662 663 664 665 666 667
  int error;
  MYSQL_TIME l_time;
  enum_mysql_timestamp_type ret;

  ret= str_to_datetime(str->ptr(), str->length(), &l_time,
                       (TIME_FUZZY_DATE | MODE_INVALID_DATES |
                        (thd->variables.sql_mode &
                         (MODE_NO_ZERO_IN_DATE | MODE_NO_ZERO_DATE))),
                       &error);
668 669

  if (ret == MYSQL_TIMESTAMP_DATETIME || ret == MYSQL_TIMESTAMP_DATE)
670
  {
671 672 673 674
    /*
      Do not return yet, we may still want to throw a "trailing garbage"
      warning.
    */
675
    *error_arg= FALSE;
676
    value= TIME_to_ulonglong_datetime(&l_time);
677
  }
678
  else
679
  {
680 681 682 683 684
    *error_arg= TRUE;
    error= 1;                                   /* force warning */
  }

  if (error > 0)
unknown's avatar
unknown committed
685 686 687
    make_truncated_value_warning(thd, MYSQL_ERROR::WARN_LEVEL_WARN,
                                 str->ptr(), str->length(),
                                 warn_type, warn_name);
688

689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753
  return value;
}


/*
  Check whether compare_datetime() can be used to compare items.

  SYNOPSIS
    Arg_comparator::can_compare_as_dates()
    a, b          [in]  items to be compared
    const_value   [out] converted value of the string constant, if any

  DESCRIPTION
    Check several cases when the DATE/DATETIME comparator should be used.
    The following cases are checked:
      1. Both a and b is a DATE/DATETIME field/function returning string or
         int result.
      2. Only a or b is a DATE/DATETIME field/function returning string or
         int result and the other item (b or a) is an item with string result.
         If the second item is a constant one then it's checked to be
         convertible to the DATE/DATETIME type. If the constant can't be
         converted to a DATE/DATETIME then the compare_datetime() comparator
         isn't used and the warning about wrong DATE/DATETIME value is issued.
      In all other cases (date-[int|real|decimal]/[int|real|decimal]-date)
      the comparison is handled by other comparators.
    If the datetime comparator can be used and one the operands of the
    comparison is a string constant that was successfully converted to a
    DATE/DATETIME type then the result of the conversion is returned in the
    const_value if it is provided.  If there is no constant or
    compare_datetime() isn't applicable then the *const_value remains
    unchanged.

  RETURN
    the found type of date comparison
*/

enum Arg_comparator::enum_date_cmp_type
Arg_comparator::can_compare_as_dates(Item *a, Item *b, ulonglong *const_value)
{
  enum enum_date_cmp_type cmp_type= CMP_DATE_DFLT;
  Item *str_arg= 0, *date_arg= 0;

  if (a->type() == Item::ROW_ITEM || b->type() == Item::ROW_ITEM)
    return CMP_DATE_DFLT;

  if (a->is_datetime())
  {
    if (b->is_datetime())
      cmp_type= CMP_DATE_WITH_DATE;
    else if (b->result_type() == STRING_RESULT)
    {
      cmp_type= CMP_DATE_WITH_STR;
      date_arg= a;
      str_arg= b;
    }
  }
  else if (b->is_datetime() && a->result_type() == STRING_RESULT)
  {
    cmp_type= CMP_STR_WITH_DATE;
    date_arg= b;
    str_arg= a;
  }

  if (cmp_type != CMP_DATE_DFLT)
  {
754 755 756 757 758 759 760
    /*
      Do not cache GET_USER_VAR() function as its const_item() may return TRUE
      for the current thread but it still may change during the execution.
    */
    if (cmp_type != CMP_DATE_WITH_DATE && str_arg->const_item() &&
        (str_arg->type() != Item::FUNC_ITEM ||
        ((Item_func*)str_arg)->functype() != Item_func::GUSERVAR_FUNC))
761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782
    {
      THD *thd= current_thd;
      ulonglong value;
      bool error;
      String tmp, *str_val= 0;
      timestamp_type t_type= (date_arg->field_type() == MYSQL_TYPE_DATE ?
                              MYSQL_TIMESTAMP_DATE : MYSQL_TIMESTAMP_DATETIME);

      str_val= str_arg->val_str(&tmp);
      if (str_arg->null_value)
        return CMP_DATE_DFLT;
      value= get_date_from_str(thd, str_val, t_type, date_arg->name, &error);
      if (error)
        return CMP_DATE_DFLT;
      if (const_value)
        *const_value= value;
    }
  }
  return cmp_type;
}


unknown's avatar
unknown committed
783 784 785 786 787 788 789
/*
  Retrieves correct TIME value from the given item.

  SYNOPSIS
    get_time_value()
    thd                 thread handle
    item_arg   [in/out] item to retrieve TIME value from
unknown's avatar
unknown committed
790
    cache_arg  [in/out] pointer to place to store the cache item to
unknown's avatar
unknown committed
791 792 793 794 795 796 797 798 799
    warn_item  [in]     unused
    is_null    [out]    TRUE <=> the item_arg is null

  DESCRIPTION
    Retrieves the correct TIME value from given item for comparison by the
    compare_datetime() function.
    If item's result can be compared as longlong then its int value is used
    and a value returned by get_time function is used otherwise.
    If an item is a constant one then its value is cached and it isn't
unknown's avatar
unknown committed
800 801
    get parsed again. An Item_cache_int object is used for for cached values.
    It seamlessly substitutes the original item.  The cache item is marked as
unknown's avatar
unknown committed
802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823
    non-constant to prevent re-caching it again.

  RETURN
    obtained value
*/

ulonglong
get_time_value(THD *thd, Item ***item_arg, Item **cache_arg,
               Item *warn_item, bool *is_null)
{
  ulonglong value;
  Item *item= **item_arg;
  MYSQL_TIME ltime;

  if (item->result_as_longlong())
  {
    value= item->val_int();
    *is_null= item->null_value;
  }
  else
  {
    *is_null= item->get_time(&ltime);
unknown's avatar
unknown committed
824
    value= !*is_null ? TIME_to_ulonglong_datetime(&ltime) : 0;
unknown's avatar
unknown committed
825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843
  }
  /*
    Do not cache GET_USER_VAR() function as its const_item() may return TRUE
    for the current thread but it still may change during the execution.
  */
  if (item->const_item() && cache_arg && (item->type() != Item::FUNC_ITEM ||
      ((Item_func*)item)->functype() != Item_func::GUSERVAR_FUNC))
  {
    Item_cache_int *cache= new Item_cache_int();
    /* Mark the cache as non-const to prevent re-caching. */
    cache->set_used_tables(1);
    cache->store(item, value);
    *cache_arg= cache;
    *item_arg= cache_arg;
  }
  return value;
}


844 845 846 847 848
int Arg_comparator::set_cmp_func(Item_bool_func2 *owner_arg,
                                        Item **a1, Item **a2,
                                        Item_result type)
{
  enum enum_date_cmp_type cmp_type;
849
  ulonglong const_value= (ulonglong)-1;
850 851 852 853 854 855 856 857 858 859 860 861
  a= a1;
  b= a2;

  if ((cmp_type= can_compare_as_dates(*a, *b, &const_value)))
  {
    thd= current_thd;
    owner= owner_arg;
    a_type= (*a)->field_type();
    b_type= (*b)->field_type();
    a_cache= 0;
    b_cache= 0;

862
    if (const_value != (ulonglong)-1)
863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879
    {
      Item_cache_int *cache= new Item_cache_int();
      /* Mark the cache as non-const to prevent re-caching. */
      cache->set_used_tables(1);
      if (!(*a)->is_datetime())
      {
        cache->store((*a), const_value);
        a_cache= cache;
        a= (Item **)&a_cache;
      }
      else
      {
        cache->store((*b), const_value);
        b_cache= cache;
        b= (Item **)&b_cache;
      }
    }
880
    is_nulls_eq= test(owner && owner->functype() == Item_func::EQUAL_FUNC);
881
    func= &Arg_comparator::compare_datetime;
unknown's avatar
unknown committed
882
    get_value_func= &get_datetime_value;
883 884
    return 0;
  }
885 886 887 888 889 890
  else if (type == STRING_RESULT && (*a)->field_type() == MYSQL_TYPE_TIME &&
           (*b)->field_type() == MYSQL_TYPE_TIME)
  {
    /* Compare TIME values as integers. */
    thd= current_thd;
    owner= owner_arg;
unknown's avatar
unknown committed
891 892 893 894 895
    a_cache= 0;
    b_cache= 0;
    is_nulls_eq= test(owner && owner->functype() == Item_func::EQUAL_FUNC);
    func= &Arg_comparator::compare_datetime;
    get_value_func= &get_time_value;
896 897 898
    return 0;
  }

899 900 901 902
  return set_compare_func(owner_arg, type);
}


903 904 905 906 907 908 909 910 911 912 913 914 915
void Arg_comparator::set_datetime_cmp_func(Item **a1, Item **b1)
{
  thd= current_thd;
  /* A caller will handle null values by itself. */
  owner= NULL;
  a= a1;
  b= b1;
  a_type= (*a)->field_type();
  b_type= (*b)->field_type();
  a_cache= 0;
  b_cache= 0;
  is_nulls_eq= FALSE;
  func= &Arg_comparator::compare_datetime;
unknown's avatar
unknown committed
916
  get_value_func= &get_datetime_value;
917 918
}

unknown's avatar
unknown committed
919

920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948
/*
  Retrieves correct DATETIME value from given item.

  SYNOPSIS
    get_datetime_value()
    thd                 thread handle
    item_arg   [in/out] item to retrieve DATETIME value from
    cache_arg  [in/out] pointer to place to store the caching item to
    warn_item  [in]     item for issuing the conversion warning
    is_null    [out]    TRUE <=> the item_arg is null

  DESCRIPTION
    Retrieves the correct DATETIME value from given item for comparison by the
    compare_datetime() function.
    If item's result can be compared as longlong then its int value is used
    and its string value is used otherwise. Strings are always parsed and
    converted to int values by the get_date_from_str() function.
    This allows us to compare correctly string dates with missed insignificant
    zeros. If an item is a constant one then its value is cached and it isn't
    get parsed again. An Item_cache_int object is used for caching values. It
    seamlessly substitutes the original item.  The cache item is marked as
    non-constant to prevent re-caching it again.  In order to compare
    correctly DATE and DATETIME items the result of the former are treated as
    a DATETIME with zero time (00:00:00).

  RETURN
    obtained value
*/

949
ulonglong
950 951 952
get_datetime_value(THD *thd, Item ***item_arg, Item **cache_arg,
                   Item *warn_item, bool *is_null)
{
unknown's avatar
unknown committed
953
  ulonglong value= 0;
954 955 956 957 958 959 960
  String buf, *str= 0;
  Item *item= **item_arg;

  if (item->result_as_longlong())
  {
    value= item->val_int();
    *is_null= item->null_value;
961
    enum_field_types f_type= item->field_type();
962 963 964
    /*
      Item_date_add_interval may return MYSQL_TYPE_STRING as the result
      field type. To detect that the DATE value has been returned we
965 966
      compare it with 100000000L - any DATE value should be less than it.
      Don't shift cached DATETIME values up for the second time.
967
    */
968 969
    if (f_type == MYSQL_TYPE_DATE ||
        (f_type != MYSQL_TYPE_DATETIME && value < 100000000L))
970 971 972 973 974 975 976 977
      value*= 1000000L;
  }
  else
  {
    str= item->val_str(&buf);
    *is_null= item->null_value;
  }
  if (*is_null)
unknown's avatar
unknown committed
978
    return ~(ulonglong) 0;
979 980 981 982 983 984 985 986 987 988 989 990 991
  /*
    Convert strings to the integer DATE/DATETIME representation.
    Even if both dates provided in strings we can't compare them directly as
    strings as there is no warranty that they are correct and do not miss
    some insignificant zeros.
  */
  if (str)
  {
    bool error;
    enum_field_types f_type= warn_item->field_type();
    timestamp_type t_type= f_type ==
      MYSQL_TYPE_DATE ? MYSQL_TIMESTAMP_DATE : MYSQL_TIMESTAMP_DATETIME;
    value= get_date_from_str(thd, str, t_type, warn_item->name, &error);
992 993 994 995 996 997
    /*
      If str did not contain a valid date according to the current
      SQL_MODE, get_date_from_str() has already thrown a warning,
      and we don't want to throw NULL on invalid date (see 5.2.6
      "SQL modes" in the manual), so we're done here.
    */
998
  }
999 1000 1001 1002 1003 1004
  /*
    Do not cache GET_USER_VAR() function as its const_item() may return TRUE
    for the current thread but it still may change during the execution.
  */
  if (item->const_item() && cache_arg && (item->type() != Item::FUNC_ITEM ||
      ((Item_func*)item)->functype() != Item_func::GUSERVAR_FUNC))
1005
  {
1006
    Item_cache_int *cache= new Item_cache_int(MYSQL_TYPE_DATETIME);
1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041
    /* Mark the cache as non-const to prevent re-caching. */
    cache->set_used_tables(1);
    cache->store(item, value);
    *cache_arg= cache;
    *item_arg= cache_arg;
  }
  return value;
}

/*
  Compare items values as dates.

  SYNOPSIS
    Arg_comparator::compare_datetime()

  DESCRIPTION
    Compare items values as DATE/DATETIME for both EQUAL_FUNC and from other
    comparison functions. The correct DATETIME values are obtained
    with help of the get_datetime_value() function.

  RETURN
    If is_nulls_eq is TRUE:
       1    if items are equal or both are null
       0    otherwise
    If is_nulls_eq is FALSE:
      -1   a < b or one of items is null
       0   a == b
       1   a > b
*/

int Arg_comparator::compare_datetime()
{
  bool is_null= FALSE;
  ulonglong a_value, b_value;

unknown's avatar
unknown committed
1042 1043
  /* Get DATE/DATETIME/TIME value of the 'a' item. */
  a_value= (*get_value_func)(thd, &a, &a_cache, *b, &is_null);
1044 1045
  if (!is_nulls_eq && is_null)
  {
1046 1047
    if (owner)
      owner->null_value= 1;
1048 1049 1050
    return -1;
  }

unknown's avatar
unknown committed
1051 1052
  /* Get DATE/DATETIME/TIME value of the 'b' item. */
  b_value= (*get_value_func)(thd, &b, &b_cache, *a, &is_null);
1053 1054
  if (is_null)
  {
1055 1056
    if (owner)
      owner->null_value= is_nulls_eq ? 0 : 1;
1057 1058 1059
    return is_nulls_eq ? 1 : -1;
  }

1060 1061
  if (owner)
    owner->null_value= 0;
1062 1063 1064 1065 1066 1067 1068 1069

  /* Compare values. */
  if (is_nulls_eq)
    return (a_value == b_value);
  return a_value < b_value ? -1 : (a_value > b_value ? 1 : 0);
}


1070
int Arg_comparator::compare_string()
unknown's avatar
unknown committed
1071 1072
{
  String *res1,*res2;
1073
  if ((res1= (*a)->val_str(&owner->tmp_value1)))
unknown's avatar
unknown committed
1074
  {
1075
    if ((res2= (*b)->val_str(&owner->tmp_value2)))
unknown's avatar
unknown committed
1076
    {
unknown's avatar
unknown committed
1077
      owner->null_value= 0;
1078
      return sortcmp(res1,res2,cmp_collation.collation);
unknown's avatar
unknown committed
1079 1080
    }
  }
unknown's avatar
unknown committed
1081
  owner->null_value= 1;
unknown's avatar
unknown committed
1082 1083 1084
  return -1;
}

unknown's avatar
unknown committed
1085

unknown's avatar
unknown committed
1086
/**
unknown's avatar
unknown committed
1087 1088
  Compare strings byte by byte. End spaces are also compared.

unknown's avatar
unknown committed
1089
  @retval
1090
    <0  *a < *b
unknown's avatar
unknown committed
1091
  @retval
1092
     0  *b == *b
unknown's avatar
unknown committed
1093
  @retval
1094
    >0  *a > *b
unknown's avatar
unknown committed
1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115
*/

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


unknown's avatar
unknown committed
1116 1117
/**
  Compare strings, but take into account that NULL == NULL.
unknown's avatar
unknown committed
1118 1119
*/

unknown's avatar
unknown committed
1120

unknown's avatar
unknown committed
1121 1122 1123
int Arg_comparator::compare_e_string()
{
  String *res1,*res2;
1124 1125
  res1= (*a)->val_str(&owner->tmp_value1);
  res2= (*b)->val_str(&owner->tmp_value2);
unknown's avatar
unknown committed
1126 1127
  if (!res1 || !res2)
    return test(res1 == res2);
1128
  return test(sortcmp(res1, res2, cmp_collation.collation) == 0);
unknown's avatar
unknown committed
1129 1130 1131
}


unknown's avatar
unknown committed
1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142
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);
}


1143
int Arg_comparator::compare_real()
unknown's avatar
unknown committed
1144
{
1145 1146 1147 1148 1149 1150
  /*
    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
1151
  val1= (*a)->val_real();
1152
  if (!(*a)->null_value)
unknown's avatar
unknown committed
1153
  {
unknown's avatar
Merge  
unknown committed
1154
    val2= (*b)->val_real();
1155
    if (!(*b)->null_value)
unknown's avatar
unknown committed
1156
    {
unknown's avatar
unknown committed
1157
      owner->null_value= 0;
unknown's avatar
unknown committed
1158 1159 1160 1161 1162
      if (val1 < val2)	return -1;
      if (val1 == val2) return 0;
      return 1;
    }
  }
unknown's avatar
unknown committed
1163
  owner->null_value= 1;
unknown's avatar
unknown committed
1164 1165 1166
  return -1;
}

unknown's avatar
unknown committed
1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184
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
1185 1186
int Arg_comparator::compare_e_real()
{
1187 1188
  double val1= (*a)->val_real();
  double val2= (*b)->val_real();
1189 1190
  if ((*a)->null_value || (*b)->null_value)
    return test((*a)->null_value && (*b)->null_value);
unknown's avatar
unknown committed
1191 1192
  return test(val1 == val2);
}
unknown's avatar
unknown committed
1193

unknown's avatar
unknown committed
1194 1195 1196 1197 1198 1199 1200 1201 1202 1203
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);
}

1204 1205 1206 1207 1208 1209 1210 1211 1212

int Arg_comparator::compare_real_fixed()
{
  /*
    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
unknown committed
1213
  val1= (*a)->val_real();
1214 1215
  if (!(*a)->null_value)
  {
unknown's avatar
unknown committed
1216
    val2= (*b)->val_real();
1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233
    if (!(*b)->null_value)
    {
      owner->null_value= 0;
      if (val1 == val2 || fabs(val1 - val2) < precision)
        return 0;
      if (val1 < val2)
        return -1;
      return 1;
    }
  }
  owner->null_value= 1;
  return -1;
}


int Arg_comparator::compare_e_real_fixed()
{
unknown's avatar
unknown committed
1234 1235
  double val1= (*a)->val_real();
  double val2= (*b)->val_real();
1236 1237 1238 1239 1240 1241
  if ((*a)->null_value || (*b)->null_value)
    return test((*a)->null_value && (*b)->null_value);
  return test(val1 == val2 || fabs(val1 - val2) < precision);
}


1242
int Arg_comparator::compare_int_signed()
unknown's avatar
unknown committed
1243
{
1244 1245
  longlong val1= (*a)->val_int();
  if (!(*a)->null_value)
unknown's avatar
unknown committed
1246
  {
1247 1248
    longlong val2= (*b)->val_int();
    if (!(*b)->null_value)
unknown's avatar
unknown committed
1249
    {
unknown's avatar
unknown committed
1250
      owner->null_value= 0;
unknown's avatar
unknown committed
1251 1252 1253 1254 1255
      if (val1 < val2)	return -1;
      if (val1 == val2)   return 0;
      return 1;
    }
  }
unknown's avatar
unknown committed
1256
  owner->null_value= 1;
unknown's avatar
unknown committed
1257 1258 1259
  return -1;
}

1260

unknown's avatar
unknown committed
1261
/**
1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283
  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;
}


unknown's avatar
unknown committed
1284
/**
1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296
  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;
1297 1298 1299 1300 1301
      if (sval1 < 0 || (ulonglong)sval1 < uval2)
        return -1;
      if ((ulonglong)sval1 == uval2)
        return 0;
      return 1;
1302 1303 1304 1305 1306 1307 1308
    }
  }
  owner->null_value= 1;
  return -1;
}


unknown's avatar
unknown committed
1309
/**
1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321
  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;
1322 1323 1324 1325 1326 1327 1328
      if (sval2 < 0)
        return 1;
      if (uval1 < (ulonglong)sval2)
        return -1;
      if (uval1 == (ulonglong)sval2)
        return 0;
      return 1;
1329 1330 1331 1332 1333 1334 1335
    }
  }
  owner->null_value= 1;
  return -1;
}


unknown's avatar
unknown committed
1336 1337
int Arg_comparator::compare_e_int()
{
1338 1339 1340 1341
  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
1342 1343 1344
  return test(val1 == val2);
}

unknown's avatar
unknown committed
1345
/**
1346 1347 1348 1349 1350 1351 1352 1353 1354 1355
  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
1356

1357
int Arg_comparator::compare_row()
unknown's avatar
unknown committed
1358 1359
{
  int res= 0;
1360
  bool was_null= 0;
1361 1362
  (*a)->bring_value();
  (*b)->bring_value();
1363
  uint n= (*a)->cols();
unknown's avatar
unknown committed
1364
  for (uint i= 0; i<n; i++)
unknown's avatar
unknown committed
1365
  {
1366
    res= comparators[i].compare();
unknown's avatar
unknown committed
1367
    if (owner->null_value)
1368 1369
    {
      // NULL was compared
1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381
      switch (owner->functype()) {
      case Item_func::NE_FUNC:
        break; // NE never aborts on NULL even if abort_on_null is set
      case Item_func::LT_FUNC:
      case Item_func::LE_FUNC:
      case Item_func::GT_FUNC:
      case Item_func::GE_FUNC:
        return -1; // <, <=, > and >= always fail on NULL
      default: // EQ_FUNC
        if (owner->abort_on_null)
          return -1; // We do not need correct NULL returning
      }
1382 1383 1384 1385
      was_null= 1;
      owner->null_value= 0;
      res= 0;  // continue comparison (maybe we will meet explicit difference)
    }
1386
    else if (res)
1387
      return res;
unknown's avatar
unknown committed
1388
  }
1389 1390 1391
  if (was_null)
  {
    /*
1392 1393
      There was NULL(s) in comparison in some parts, but there was no
      explicit difference in other parts, so we have to return NULL.
1394 1395 1396 1397 1398
    */
    owner->null_value= 1;
    return -1;
  }
  return 0;
unknown's avatar
unknown committed
1399
}
unknown's avatar
unknown committed
1400

1401

unknown's avatar
unknown committed
1402 1403
int Arg_comparator::compare_e_row()
{
1404 1405
  (*a)->bring_value();
  (*b)->bring_value();
1406
  uint n= (*a)->cols();
unknown's avatar
unknown committed
1407 1408
  for (uint i= 0; i<n; i++)
  {
unknown's avatar
unknown committed
1409
    if (!comparators[i].compare())
1410
      return 0;
unknown's avatar
unknown committed
1411 1412 1413 1414
  }
  return 1;
}

1415

1416 1417 1418 1419 1420 1421 1422 1423 1424
void Item_func_truth::fix_length_and_dec()
{
  maybe_null= 0;
  null_value= 0;
  decimals= 0;
  max_length= 1;
}


1425
void Item_func_truth::print(String *str, enum_query_type query_type)
1426 1427
{
  str->append('(');
1428
  args[0]->print(str, query_type);
1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468
  str->append(STRING_WITH_LEN(" is "));
  if (! affirmative)
    str->append(STRING_WITH_LEN("not "));
  if (value)
    str->append(STRING_WITH_LEN("true"));
  else
    str->append(STRING_WITH_LEN("false"));
  str->append(')');
}


bool Item_func_truth::val_bool()
{
  bool val= args[0]->val_bool();
  if (args[0]->null_value)
  {
    /*
      NULL val IS {TRUE, FALSE} --> FALSE
      NULL val IS NOT {TRUE, FALSE} --> TRUE
    */
    return (! affirmative);
  }

  if (affirmative)
  {
    /* {TRUE, FALSE} val IS {TRUE, FALSE} value */
    return (val == value);
  }

  /* {TRUE, FALSE} val IS NOT {TRUE, FALSE} value */
  return (val != value);
}


longlong Item_func_truth::val_int()
{
  return (val_bool() ? 1 : 0);
}


1469
bool Item_in_optimizer::fix_left(THD *thd, Item **ref)
unknown's avatar
unknown committed
1470
{
1471
  if (!args[0]->fixed && args[0]->fix_fields(thd, args) ||
1472
      !cache && !(cache= Item_cache::get_cache(args[0])))
1473
    return 1;
1474

1475
  cache->setup(args[0]);
1476
  if (cache->cols() == 1)
1477
  {
unknown's avatar
unknown committed
1478
    if ((used_tables_cache= args[0]->used_tables()))
unknown's avatar
unknown committed
1479
      cache->set_used_tables(OUTER_REF_TABLE_BIT);
1480 1481 1482
    else
      cache->set_used_tables(0);
  }
1483 1484 1485 1486
  else
  {
    uint n= cache->cols();
    for (uint i= 0; i < n; i++)
1487
    {
1488 1489
      if (args[0]->element_index(i)->used_tables())
	((Item_cache *)cache->element_index(i))->set_used_tables(OUTER_REF_TABLE_BIT);
1490
      else
1491
	((Item_cache *)cache->element_index(i))->set_used_tables(0);
1492
    }
unknown's avatar
unknown committed
1493
    used_tables_cache= args[0]->used_tables();
1494
  }
unknown's avatar
unknown committed
1495 1496
  not_null_tables_cache= args[0]->not_null_tables();
  with_sum_func= args[0]->with_sum_func;
1497 1498
  if ((const_item_cache= args[0]->const_item()))
    cache->store(args[0]);
1499 1500 1501 1502
  return 0;
}


1503
bool Item_in_optimizer::fix_fields(THD *thd, Item **ref)
1504
{
1505
  DBUG_ASSERT(fixed == 0);
1506
  if (fix_left(thd, ref))
unknown's avatar
unknown committed
1507
    return TRUE;
1508 1509 1510
  if (args[0]->maybe_null)
    maybe_null=1;

1511
  if (!args[1]->fixed && args[1]->fix_fields(thd, args+1))
unknown's avatar
unknown committed
1512
    return TRUE;
unknown's avatar
unknown committed
1513 1514 1515
  Item_in_subselect * sub= (Item_in_subselect *)args[1];
  if (args[0]->cols() != sub->engine->cols())
  {
unknown's avatar
unknown committed
1516
    my_error(ER_OPERAND_COLUMNS, MYF(0), args[0]->cols());
unknown's avatar
unknown committed
1517
    return TRUE;
unknown's avatar
unknown committed
1518
  }
1519 1520 1521 1522
  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
1523
  not_null_tables_cache|= args[1]->not_null_tables();
1524
  const_item_cache&= args[1]->const_item();
1525
  fixed= 1;
unknown's avatar
unknown committed
1526
  return FALSE;
1527 1528
}

1529

1530 1531
longlong Item_in_optimizer::val_int()
{
unknown's avatar
unknown committed
1532
  bool tmp;
1533
  DBUG_ASSERT(fixed == 1);
1534
  cache->store(args[0]);
1535
  
1536
  if (cache->null_value)
1537
  {
1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562
    if (((Item_in_subselect*)args[1])->is_top_level_item())
    {
      /*
        We're evaluating "NULL IN (SELECT ...)". The result can be NULL or
        FALSE, and we can return one instead of another. Just return NULL.
      */
      null_value= 1;
    }
    else
    {
      if (!((Item_in_subselect*)args[1])->is_correlated &&
          result_for_null_param != UNKNOWN)
      {
        /* Use cached value from previous execution */
        null_value= result_for_null_param;
      }
      else
      {
        /*
          We're evaluating "NULL IN (SELECT ...)". The result is:
             FALSE if SELECT produces an empty set, or
             NULL  otherwise.
          We disable the predicates we've pushed down into subselect, run the
          subselect and see if it has produced any rows.
        */
1563 1564 1565 1566
        Item_in_subselect *item_subs=(Item_in_subselect*)args[1]; 
        if (cache->cols() == 1)
        {
          item_subs->set_cond_guard_var(0, FALSE);
1567
          (void) args[1]->val_bool_result();
1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580
          result_for_null_param= null_value= !item_subs->engine->no_rows();
          item_subs->set_cond_guard_var(0, TRUE);
        }
        else
        {
          uint i;
          uint ncols= cache->cols();
          /*
            Turn off the predicates that are based on column compares for
            which the left part is currently NULL
          */
          for (i= 0; i < ncols; i++)
          {
unknown's avatar
unknown committed
1581
            if (cache->element_index(i)->null_value)
1582 1583 1584
              item_subs->set_cond_guard_var(i, FALSE);
          }
          
1585
          (void) args[1]->val_bool_result();
1586 1587 1588 1589 1590 1591
          result_for_null_param= null_value= !item_subs->engine->no_rows();
          
          /* Turn all predicates back on */
          for (i= 0; i < ncols; i++)
            item_subs->set_cond_guard_var(i, TRUE);
        }
1592 1593
      }
    }
1594 1595
    return 0;
  }
unknown's avatar
unknown committed
1596
  tmp= args[1]->val_bool_result();
unknown's avatar
unknown committed
1597
  null_value= args[1]->null_value;
1598 1599 1600
  return tmp;
}

1601 1602 1603 1604 1605 1606 1607 1608

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


unknown's avatar
unknown committed
1609 1610 1611 1612
void Item_in_optimizer::cleanup()
{
  DBUG_ENTER("Item_in_optimizer::cleanup");
  Item_bool_func::cleanup();
1613 1614
  if (!save_cache)
    cache= 0;
unknown's avatar
unknown committed
1615 1616 1617
  DBUG_VOID_RETURN;
}

1618

1619
bool Item_in_optimizer::is_null()
1620
{
1621 1622
  cache->store(args[0]);
  return (null_value= (cache->null_value || args[1]->is_null()));
1623
}
unknown's avatar
unknown committed
1624

1625

unknown's avatar
unknown committed
1626 1627
longlong Item_func_eq::val_int()
{
1628
  DBUG_ASSERT(fixed == 1);
1629
  int value= cmp.compare();
unknown's avatar
unknown committed
1630 1631 1632
  return value == 0 ? 1 : 0;
}

1633

unknown's avatar
unknown committed
1634
/** Same as Item_func_eq, but NULL = NULL. */
unknown's avatar
unknown committed
1635

unknown's avatar
unknown committed
1636 1637 1638 1639 1640 1641
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
1642 1643
longlong Item_func_equal::val_int()
{
1644
  DBUG_ASSERT(fixed == 1);
1645
  return cmp.compare();
unknown's avatar
unknown committed
1646 1647 1648 1649
}

longlong Item_func_ne::val_int()
{
1650
  DBUG_ASSERT(fixed == 1);
1651
  int value= cmp.compare();
1652
  return value != 0 && !null_value ? 1 : 0;
unknown's avatar
unknown committed
1653 1654 1655 1656 1657
}


longlong Item_func_ge::val_int()
{
1658
  DBUG_ASSERT(fixed == 1);
1659
  int value= cmp.compare();
unknown's avatar
unknown committed
1660 1661 1662 1663 1664 1665
  return value >= 0 ? 1 : 0;
}


longlong Item_func_gt::val_int()
{
1666
  DBUG_ASSERT(fixed == 1);
1667
  int value= cmp.compare();
unknown's avatar
unknown committed
1668 1669 1670 1671 1672
  return value > 0 ? 1 : 0;
}

longlong Item_func_le::val_int()
{
1673
  DBUG_ASSERT(fixed == 1);
1674
  int value= cmp.compare();
unknown's avatar
unknown committed
1675 1676 1677 1678 1679 1680
  return value <= 0 && !null_value ? 1 : 0;
}


longlong Item_func_lt::val_int()
{
1681
  DBUG_ASSERT(fixed == 1);
1682
  int value= cmp.compare();
unknown's avatar
unknown committed
1683 1684 1685 1686 1687 1688
  return value < 0 && !null_value ? 1 : 0;
}


longlong Item_func_strcmp::val_int()
{
1689
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
1690 1691 1692 1693 1694 1695 1696
  String *a=args[0]->val_str(&tmp_value1);
  String *b=args[1]->val_str(&tmp_value2);
  if (!a || !b)
  {
    null_value=1;
    return 0;
  }
1697
  int value= sortcmp(a,b,cmp.cmp_collation.collation);
unknown's avatar
unknown committed
1698 1699 1700 1701 1702
  null_value=0;
  return !value ? 0 : (value < 0 ? (longlong) -1 : (longlong) 1);
}


1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722
bool Item_func_opt_neg::eq(const Item *item, bool binary_cmp) const
{
  /* Assume we don't have rtti */
  if (this == item)
    return 1;
  if (item->type() != FUNC_ITEM)
    return 0;
  Item_func *item_func=(Item_func*) item;
  if (arg_count != item_func->arg_count ||
      functype() != item_func->functype())
    return 0;
  if (negated != ((Item_func_opt_neg *) item_func)->negated)
    return 0;
  for (uint i=0; i < arg_count ; i++)
    if (!args[i]->eq(item_func->arguments()[i], binary_cmp))
      return 0;
  return 1;
}


unknown's avatar
unknown committed
1723 1724
void Item_func_interval::fix_length_and_dec()
{
1725 1726
  uint rows= row->cols();
  
unknown's avatar
unknown committed
1727 1728 1729 1730
  use_decimal_comparison= ((row->element_index(0)->result_type() ==
                            DECIMAL_RESULT) ||
                           (row->element_index(0)->result_type() ==
                            INT_RESULT));
1731
  if (rows > 8)
unknown's avatar
unknown committed
1732
  {
1733
    bool not_null_consts= TRUE;
1734

1735
    for (uint i= 1; not_null_consts && i < rows; i++)
unknown's avatar
unknown committed
1736
    {
1737 1738
      Item *el= row->element_index(i);
      not_null_consts&= el->const_item() & !el->is_null();
unknown's avatar
unknown committed
1739
    }
1740

1741
    if (not_null_consts &&
unknown's avatar
unknown committed
1742
        (intervals=
1743
          (interval_range*) sql_alloc(sizeof(interval_range) * (rows - 1))))
unknown's avatar
unknown committed
1744
    {
unknown's avatar
unknown committed
1745 1746
      if (use_decimal_comparison)
      {
1747
        for (uint i= 1; i < rows; i++)
unknown's avatar
unknown committed
1748
        {
1749
          Item *el= row->element_index(i);
unknown's avatar
unknown committed
1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771
          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
      {
1772
        for (uint i= 1; i < rows; i++)
unknown's avatar
unknown committed
1773
        {
1774
          intervals[i-1].dbl= row->element_index(i)->val_real();
unknown's avatar
unknown committed
1775 1776
        }
      }
unknown's avatar
unknown committed
1777 1778
    }
  }
unknown's avatar
unknown committed
1779 1780
  maybe_null= 0;
  max_length= 2;
1781
  used_tables_cache|= row->used_tables();
unknown's avatar
unknown committed
1782
  not_null_tables_cache= row->not_null_tables();
1783
  with_sum_func= with_sum_func || row->with_sum_func;
unknown's avatar
unknown committed
1784
  const_item_cache&= row->const_item();
unknown's avatar
unknown committed
1785 1786
}

unknown's avatar
unknown committed
1787

unknown's avatar
unknown committed
1788 1789
/**
  Execute Item_func_interval().
unknown's avatar
unknown committed
1790

unknown's avatar
unknown committed
1791 1792 1793
  @note
    If we are doing a decimal comparison, we are evaluating the first
    item twice.
unknown's avatar
unknown committed
1794

unknown's avatar
unknown committed
1795 1796 1797 1798 1799
  @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
1800 1801 1802 1803
*/

longlong Item_func_interval::val_int()
{
1804
  DBUG_ASSERT(fixed == 1);
1805
  double value;
unknown's avatar
unknown committed
1806
  my_decimal dec_buf, *dec= NULL;
unknown's avatar
unknown committed
1807 1808
  uint i;

unknown's avatar
unknown committed
1809 1810
  if (use_decimal_comparison)
  {
1811 1812
    dec= row->element_index(0)->val_decimal(&dec_buf);
    if (row->element_index(0)->null_value)
1813 1814 1815 1816 1817
      return -1;
    my_decimal2double(E_DEC_FATAL_ERROR, dec, &value);
  }
  else
  {
1818 1819
    value= row->element_index(0)->val_real();
    if (row->element_index(0)->null_value)
1820
      return -1;
unknown's avatar
unknown committed
1821
  }
unknown's avatar
unknown committed
1822

unknown's avatar
unknown committed
1823 1824 1825
  if (intervals)
  {					// Use binary search to find interval
    uint start,end;
1826
    start= 0;
unknown's avatar
unknown committed
1827
    end=   row->cols()-2;
unknown's avatar
unknown committed
1828 1829
    while (start != end)
    {
unknown's avatar
unknown committed
1830
      uint mid= (start + end + 1) / 2;
unknown's avatar
unknown committed
1831 1832
      interval_range *range= intervals + mid;
      my_bool cmp_result;
unknown's avatar
unknown committed
1833 1834 1835 1836 1837
      /*
        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
1838 1839 1840 1841 1842
      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
1843
	start= mid;
unknown's avatar
unknown committed
1844
      else
unknown's avatar
unknown committed
1845
	end= mid - 1;
unknown's avatar
unknown committed
1846
    }
unknown's avatar
unknown committed
1847 1848
    interval_range *range= intervals+start;
    return ((dec && range->type == DECIMAL_RESULT) ?
unknown's avatar
unknown committed
1849
            my_decimal_cmp(dec, &range->dec) < 0 :
unknown's avatar
unknown committed
1850
            value < range->dbl) ? 0 : start + 1;
unknown's avatar
unknown committed
1851
  }
1852 1853

  for (i=1 ; i < row->cols() ; i++)
unknown's avatar
unknown committed
1854
  {
1855
    Item *el= row->element_index(i);
unknown's avatar
unknown committed
1856 1857 1858 1859
    if (use_decimal_comparison &&
        ((el->result_type() == DECIMAL_RESULT) ||
         (el->result_type() == INT_RESULT)))
    {
1860 1861 1862 1863
      my_decimal e_dec_buf, *e_dec= el->val_decimal(&e_dec_buf);
      /* Skip NULL ranges. */
      if (el->null_value)
        continue;
unknown's avatar
unknown committed
1864
      if (my_decimal_cmp(e_dec, dec) > 0)
1865 1866 1867 1868 1869 1870 1871 1872 1873 1874
        return i - 1;
    }
    else 
    {
      double val= el->val_real();
      /* Skip NULL ranges. */
      if (el->null_value)
        continue;
      if (val > value)
        return i - 1;
unknown's avatar
unknown committed
1875
    }
unknown's avatar
unknown committed
1876
  }
1877
  return i-1;
unknown's avatar
unknown committed
1878 1879
}

unknown's avatar
unknown committed
1880

unknown's avatar
unknown committed
1881 1882
/**
  Perform context analysis of a BETWEEN item tree.
unknown's avatar
unknown committed
1883 1884 1885 1886 1887 1888

    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.

unknown's avatar
unknown committed
1889 1890 1891 1892 1893
  @param thd     reference to the global context of the query thread
  @param ref     pointer to Item* variable where pointer to resulting "fixed"
                 item is to be assigned

  @note
unknown's avatar
unknown committed
1894 1895
    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:
unknown's avatar
unknown committed
1896
    @verbatim
unknown's avatar
unknown committed
1897 1898 1899 1900
      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)))
unknown's avatar
unknown committed
1901
    @endverbatim
unknown's avatar
unknown committed
1902

unknown's avatar
unknown committed
1903
  @retval
unknown's avatar
unknown committed
1904
    0   ok
unknown's avatar
unknown committed
1905
  @retval
unknown's avatar
unknown committed
1906 1907 1908
    1   got error
*/

unknown's avatar
unknown committed
1909
bool Item_func_between::fix_fields(THD *thd, Item **ref)
unknown's avatar
unknown committed
1910
{
1911
  if (Item_func_opt_neg::fix_fields(thd, ref))
unknown's avatar
unknown committed
1912 1913
    return 1;

1914 1915
  thd->lex->current_select->between_count++;

unknown's avatar
unknown committed
1916 1917 1918 1919 1920
  /* 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
1921 1922 1923
  not_null_tables_cache= (args[0]->not_null_tables() |
                          (args[1]->not_null_tables() &
                           args[2]->not_null_tables()));
unknown's avatar
unknown committed
1924 1925 1926 1927 1928

  return 0;
}


unknown's avatar
unknown committed
1929 1930
void Item_func_between::fix_length_and_dec()
{
1931 1932 1933
  max_length= 1;
  int i;
  bool datetime_found= FALSE;
1934
  int time_items_found= 0;
1935
  compare_as_dates= TRUE;
1936
  THD *thd= current_thd;
unknown's avatar
unknown committed
1937

1938 1939
  /*
    As some compare functions are generated after sql_yacc,
unknown's avatar
unknown committed
1940
    we have to check for out of memory conditions here
1941
  */
unknown's avatar
unknown committed
1942 1943
  if (!args[0] || !args[1] || !args[2])
    return;
1944
  if ( agg_cmp_type(&cmp_type, args, 3))
1945
    return;
unknown's avatar
unknown committed
1946
  if (cmp_type == STRING_RESULT &&
1947
      agg_arg_charsets(cmp_collation, args, 3, MY_COLL_CMP_CONV, 1))
unknown's avatar
unknown committed
1948
   return;
1949

unknown's avatar
unknown committed
1950
  /*
1951 1952 1953
    Detect the comparison of DATE/DATETIME items.
    At least one of items should be a DATE/DATETIME item and other items
    should return the STRING result.
unknown's avatar
unknown committed
1954
  */
1955
  if (cmp_type == STRING_RESULT)
unknown's avatar
unknown committed
1956
  {
1957
    for (i= 0; i < 3; i++)
unknown's avatar
unknown committed
1958
    {
1959 1960 1961 1962 1963 1964 1965 1966
      if (args[i]->is_datetime())
      {
        datetime_found= TRUE;
        continue;
      }
      if (args[i]->field_type() == MYSQL_TYPE_TIME &&
          args[i]->result_as_longlong())
        time_items_found++;
unknown's avatar
unknown committed
1967
    }
1968 1969 1970 1971 1972 1973 1974 1975
  }
  if (!datetime_found)
    compare_as_dates= FALSE;

  if (compare_as_dates)
  {
    ge_cmp.set_datetime_cmp_func(args, args + 1);
    le_cmp.set_datetime_cmp_func(args, args + 2);
unknown's avatar
unknown committed
1976
  }
1977 1978 1979 1980 1981
  else if (time_items_found == 3)
  {
    /* Compare TIME items as integers. */
    cmp_type= INT_RESULT;
  }
1982 1983 1984 1985
  else if (args[0]->real_item()->type() == FIELD_ITEM &&
           thd->lex->sql_command != SQLCOM_CREATE_VIEW &&
           thd->lex->sql_command != SQLCOM_SHOW_CREATE)
  {
1986 1987
    Item_field *field_item= (Item_field*) (args[0]->real_item());
    if (field_item->field->can_be_compared_as_longlong())
1988 1989 1990 1991 1992
    {
      /*
        The following can't be recoded with || as convert_constant_item
        changes the argument
      */
1993
      if (convert_constant_item(thd, field_item, &args[1]))
1994
        cmp_type=INT_RESULT;			// Works for all types.
1995
      if (convert_constant_item(thd, field_item, &args[2]))
1996 1997 1998
        cmp_type=INT_RESULT;			// Works for all types.
    }
  }
unknown's avatar
unknown committed
1999 2000 2001 2002 2003
}


longlong Item_func_between::val_int()
{						// ANSI BETWEEN
2004
  DBUG_ASSERT(fixed == 1);
2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025
  if (compare_as_dates)
  {
    int ge_res, le_res;

    ge_res= ge_cmp.compare();
    if ((null_value= args[0]->null_value))
      return 0;
    le_res= le_cmp.compare();

    if (!args[1]->null_value && !args[2]->null_value)
      return (longlong) ((ge_res >= 0 && le_res <=0) != negated);
    else if (args[1]->null_value)
    {
      null_value= le_res > 0;			// not null if false range.
    }
    else
    {
      null_value= ge_res < 0;
    }
  }
  else if (cmp_type == STRING_RESULT)
unknown's avatar
unknown committed
2026 2027 2028 2029 2030 2031 2032 2033
  {
    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
2034 2035 2036
      return (longlong) ((sortcmp(value,a,cmp_collation.collation) >= 0 &&
                          sortcmp(value,b,cmp_collation.collation) <= 0) !=
                         negated);
unknown's avatar
unknown committed
2037 2038 2039 2040
    if (args[1]->null_value && args[2]->null_value)
      null_value=1;
    else if (args[1]->null_value)
    {
unknown's avatar
unknown committed
2041 2042
      // Set to not null if false range.
      null_value= sortcmp(value,b,cmp_collation.collation) <= 0;
unknown's avatar
unknown committed
2043 2044 2045
    }
    else
    {
unknown's avatar
unknown committed
2046 2047
      // Set to not null if false range.
      null_value= sortcmp(value,a,cmp_collation.collation) >= 0;
unknown's avatar
unknown committed
2048 2049 2050 2051
    }
  }
  else if (cmp_type == INT_RESULT)
  {
2052
    longlong value=args[0]->val_int(), a, b;
unknown's avatar
unknown committed
2053
    if ((null_value=args[0]->null_value))
2054
      return 0;					/* purecov: inspected */
unknown's avatar
unknown committed
2055 2056 2057
    a=args[1]->val_int();
    b=args[2]->val_int();
    if (!args[1]->null_value && !args[2]->null_value)
unknown's avatar
unknown committed
2058
      return (longlong) ((value >= a && value <= b) != negated);
unknown's avatar
unknown committed
2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069
    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
2070 2071 2072 2073 2074 2075 2076 2077 2078
  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)
2079 2080
      return (longlong) ((my_decimal_cmp(dec, a_dec) >= 0 &&
                          my_decimal_cmp(dec, b_dec) <= 0) != negated);
unknown's avatar
unknown committed
2081 2082 2083 2084 2085 2086 2087
    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
2088 2089
  else
  {
2090
    double value= args[0]->val_real(),a,b;
unknown's avatar
unknown committed
2091
    if ((null_value=args[0]->null_value))
2092
      return 0;					/* purecov: inspected */
2093 2094
    a= args[1]->val_real();
    b= args[2]->val_real();
unknown's avatar
unknown committed
2095
    if (!args[1]->null_value && !args[2]->null_value)
unknown's avatar
unknown committed
2096
      return (longlong) ((value >= a && value <= b) != negated);
unknown's avatar
unknown committed
2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107
    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
2108
  return (longlong) (!null_value && negated);
unknown's avatar
unknown committed
2109 2110
}

2111

2112
void Item_func_between::print(String *str, enum_query_type query_type)
2113 2114
{
  str->append('(');
2115
  args[0]->print(str, query_type);
unknown's avatar
unknown committed
2116
  if (negated)
2117 2118
    str->append(STRING_WITH_LEN(" not"));
  str->append(STRING_WITH_LEN(" between "));
2119
  args[1]->print(str, query_type);
2120
  str->append(STRING_WITH_LEN(" and "));
2121
  args[2]->print(str, query_type);
2122 2123 2124
  str->append(')');
}

unknown's avatar
unknown committed
2125 2126 2127
void
Item_func_ifnull::fix_length_and_dec()
{
2128
  agg_result_type(&hybrid_type, args, 2);
unknown's avatar
unknown committed
2129
  maybe_null=args[1]->maybe_null;
unknown's avatar
unknown committed
2130
  decimals= max(args[0]->decimals, args[1]->decimals);
2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144
  unsigned_flag= args[0]->unsigned_flag && args[1]->unsigned_flag;

  if (hybrid_type == DECIMAL_RESULT || hybrid_type == INT_RESULT) 
  {
    int len0= args[0]->max_length - args[0]->decimals
      - (args[0]->unsigned_flag ? 0 : 1);

    int len1= args[1]->max_length - args[1]->decimals
      - (args[1]->unsigned_flag ? 0 : 1);

    max_length= max(len0, len1) + decimals + (unsigned_flag ? 0 : 1);
  }
  else
    max_length= max(args[0]->max_length, args[1]->max_length);
2145

unknown's avatar
unknown committed
2146
  switch (hybrid_type) {
unknown's avatar
unknown committed
2147
  case STRING_RESULT:
2148
    agg_arg_charsets(collation, args, arg_count, MY_COLL_CMP_CONV, 1);
unknown's avatar
unknown committed
2149 2150 2151 2152 2153
    break;
  case DECIMAL_RESULT:
  case REAL_RESULT:
    break;
  case INT_RESULT:
2154
    decimals= 0;
unknown's avatar
unknown committed
2155 2156 2157 2158 2159
    break;
  case ROW_RESULT:
  default:
    DBUG_ASSERT(0);
  }
2160
  cached_field_type= agg_field_type(args, 2);
unknown's avatar
unknown committed
2161 2162
}

unknown's avatar
unknown committed
2163 2164 2165

uint Item_func_ifnull::decimal_precision() const
{
2166 2167 2168 2169 2170
  int arg0_int_part= args[0]->decimal_int_part();
  int arg1_int_part= args[1]->decimal_int_part();
  int max_int_part= max(arg0_int_part, arg1_int_part);
  int precision= max_int_part + decimals;
  return min(precision, DECIMAL_MAX_PRECISION);
unknown's avatar
unknown committed
2171 2172 2173
}


2174 2175 2176
enum_field_types Item_func_ifnull::field_type() const 
{
  return cached_field_type;
unknown's avatar
unknown committed
2177 2178
}

2179 2180
Field *Item_func_ifnull::tmp_table_field(TABLE *table)
{
unknown's avatar
unknown committed
2181
  return tmp_table_field_from_field_type(table, 0);
2182
}
2183

unknown's avatar
unknown committed
2184
double
unknown's avatar
unknown committed
2185
Item_func_ifnull::real_op()
unknown's avatar
unknown committed
2186
{
2187
  DBUG_ASSERT(fixed == 1);
2188
  double value= args[0]->val_real();
unknown's avatar
unknown committed
2189 2190 2191 2192 2193
  if (!args[0]->null_value)
  {
    null_value=0;
    return value;
  }
2194
  value= args[1]->val_real();
unknown's avatar
unknown committed
2195 2196 2197 2198 2199 2200
  if ((null_value=args[1]->null_value))
    return 0.0;
  return value;
}

longlong
unknown's avatar
unknown committed
2201
Item_func_ifnull::int_op()
unknown's avatar
unknown committed
2202
{
2203
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215
  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
2216

unknown's avatar
unknown committed
2217
my_decimal *Item_func_ifnull::decimal_op(my_decimal *decimal_value)
unknown's avatar
unknown committed
2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232
{
  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
2233
String *
unknown's avatar
unknown committed
2234
Item_func_ifnull::str_op(String *str)
unknown's avatar
unknown committed
2235
{
2236
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
2237 2238 2239 2240
  String *res  =args[0]->val_str(str);
  if (!args[0]->null_value)
  {
    null_value=0;
2241
    res->set_charset(collation.collation);
unknown's avatar
unknown committed
2242 2243 2244 2245 2246
    return res;
  }
  res=args[1]->val_str(str);
  if ((null_value=args[1]->null_value))
    return 0;
2247
  res->set_charset(collation.collation);
unknown's avatar
unknown committed
2248 2249 2250
  return res;
}

2251

unknown's avatar
unknown committed
2252 2253
/**
  Perform context analysis of an IF item tree.
unknown's avatar
unknown committed
2254 2255 2256 2257 2258 2259

    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.

unknown's avatar
unknown committed
2260 2261 2262 2263 2264
  @param thd     reference to the global context of the query thread
  @param ref     pointer to Item* variable where pointer to resulting "fixed"
                 item is to be assigned

  @note
unknown's avatar
unknown committed
2265 2266
    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:
unknown's avatar
unknown committed
2267
    @verbatim
unknown's avatar
unknown committed
2268 2269
      T0(IF(e,e1,e2)  = T1(IF(e,e1,e2))
      T1(IF(e,e1,e2)) = intersection(T1(e1),T1(e2))
unknown's avatar
unknown committed
2270
    @endverbatim
unknown's avatar
unknown committed
2271

unknown's avatar
unknown committed
2272
  @retval
unknown's avatar
unknown committed
2273
    0   ok
unknown's avatar
unknown committed
2274
  @retval
unknown's avatar
unknown committed
2275 2276 2277 2278
    1   got error
*/

bool
2279
Item_func_if::fix_fields(THD *thd, Item **ref)
unknown's avatar
unknown committed
2280 2281 2282 2283
{
  DBUG_ASSERT(fixed == 0);
  args[0]->top_level_item();

2284
  if (Item_func::fix_fields(thd, ref))
unknown's avatar
unknown committed
2285 2286
    return 1;

unknown's avatar
unknown committed
2287 2288
  not_null_tables_cache= (args[1]->not_null_tables() &
                          args[2]->not_null_tables());
unknown's avatar
unknown committed
2289 2290 2291 2292 2293

  return 0;
}


unknown's avatar
unknown committed
2294 2295 2296 2297
void
Item_func_if::fix_length_and_dec()
{
  maybe_null=args[1]->maybe_null || args[2]->maybe_null;
unknown's avatar
unknown committed
2298
  decimals= max(args[1]->decimals, args[2]->decimals);
2299
  unsigned_flag=args[1]->unsigned_flag && args[2]->unsigned_flag;
2300

unknown's avatar
unknown committed
2301 2302
  enum Item_result arg1_type=args[1]->result_type();
  enum Item_result arg2_type=args[2]->result_type();
unknown's avatar
unknown committed
2303 2304
  bool null1=args[1]->const_item() && args[1]->null_value;
  bool null2=args[2]->const_item() && args[2]->null_value;
2305 2306 2307 2308

  if (null1)
  {
    cached_result_type= arg2_type;
2309
    collation.set(args[2]->collation.collation);
2310
    cached_field_type= args[2]->field_type();
2311 2312 2313
  }
  else if (null2)
  {
unknown's avatar
unknown committed
2314
    cached_result_type= arg1_type;
2315
    collation.set(args[1]->collation.collation);
2316
    cached_field_type= args[1]->field_type();
2317
  }
unknown's avatar
unknown committed
2318
  else
2319
  {
2320 2321 2322
    agg_result_type(&cached_result_type, args+1, 2);
    if (cached_result_type == STRING_RESULT)
    {
2323
      if (agg_arg_charsets(collation, args+1, 2, MY_COLL_ALLOW_CONV, 1))
2324
        return;
2325
    }
2326
    else
2327
    {
2328
      collation.set(&my_charset_bin);	// Number
2329
    }
2330
    cached_field_type= agg_field_type(args + 1, 2);
2331
  }
2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345

  if ((cached_result_type == DECIMAL_RESULT )
      || (cached_result_type == INT_RESULT))
  {
    int len1= args[1]->max_length - args[1]->decimals
      - (args[1]->unsigned_flag ? 0 : 1);

    int len2= args[2]->max_length - args[2]->decimals
      - (args[2]->unsigned_flag ? 0 : 1);

    max_length=max(len1, len2) + decimals + (unsigned_flag ? 0 : 1);
  }
  else
    max_length= max(args[1]->max_length, args[2]->max_length);
unknown's avatar
unknown committed
2346 2347 2348
}


unknown's avatar
unknown committed
2349 2350
uint Item_func_if::decimal_precision() const
{
2351 2352 2353
  int arg1_prec= args[1]->decimal_int_part();
  int arg2_prec= args[2]->decimal_int_part();
  int precision=max(arg1_prec,arg2_prec) + decimals;
unknown's avatar
unknown committed
2354 2355 2356 2357
  return min(precision, DECIMAL_MAX_PRECISION);
}


unknown's avatar
unknown committed
2358
double
2359
Item_func_if::val_real()
unknown's avatar
unknown committed
2360
{
2361
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
2362
  Item *arg= args[0]->val_bool() ? args[1] : args[2];
2363
  double value= arg->val_real();
unknown's avatar
unknown committed
2364 2365 2366 2367 2368 2369 2370
  null_value=arg->null_value;
  return value;
}

longlong
Item_func_if::val_int()
{
2371
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
2372
  Item *arg= args[0]->val_bool() ? args[1] : args[2];
unknown's avatar
unknown committed
2373 2374 2375 2376 2377 2378 2379 2380
  longlong value=arg->val_int();
  null_value=arg->null_value;
  return value;
}

String *
Item_func_if::val_str(String *str)
{
2381
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
2382
  Item *arg= args[0]->val_bool() ? args[1] : args[2];
unknown's avatar
unknown committed
2383
  String *res=arg->val_str(str);
2384
  if (res)
2385
    res->set_charset(collation.collation);
unknown's avatar
unknown committed
2386 2387 2388 2389 2390
  null_value=arg->null_value;
  return res;
}


unknown's avatar
unknown committed
2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401
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
2402 2403 2404 2405 2406 2407 2408 2409 2410
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
2411 2412
    unsigned_flag= args[0]->unsigned_flag;
    cached_result_type= args[0]->result_type();
2413
    if (cached_result_type == STRING_RESULT &&
2414
        agg_arg_charsets(collation, args, arg_count, MY_COLL_CMP_CONV, 1))
2415
      return;
unknown's avatar
unknown committed
2416 2417 2418
  }
}

unknown's avatar
unknown committed
2419

unknown's avatar
unknown committed
2420 2421
/**
  @note
unknown's avatar
unknown committed
2422 2423
  Note that we have to evaluate the first argument twice as the compare
  may have been done with a different type than return value
unknown's avatar
unknown committed
2424 2425 2426 2427
  @return
    NULL  if arguments are equal
  @return
    the first argument if not equal
unknown's avatar
unknown committed
2428 2429 2430
*/

double
2431
Item_func_nullif::val_real()
unknown's avatar
unknown committed
2432
{
2433
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
2434
  double value;
unknown's avatar
unknown committed
2435
  if (!cmp.compare())
unknown's avatar
unknown committed
2436 2437 2438 2439
  {
    null_value=1;
    return 0.0;
  }
2440
  value= args[0]->val_real();
unknown's avatar
unknown committed
2441 2442 2443 2444 2445 2446 2447
  null_value=args[0]->null_value;
  return value;
}

longlong
Item_func_nullif::val_int()
{
2448
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
2449
  longlong value;
unknown's avatar
unknown committed
2450
  if (!cmp.compare())
unknown's avatar
unknown committed
2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462
  {
    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)
{
2463
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
2464
  String *res;
unknown's avatar
unknown committed
2465
  if (!cmp.compare())
unknown's avatar
unknown committed
2466 2467 2468 2469 2470 2471 2472 2473 2474
  {
    null_value=1;
    return 0;
  }
  res=args[0]->val_str(str);
  null_value=args[0]->null_value;
  return res;
}

2475

unknown's avatar
unknown committed
2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491
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;
}


2492 2493 2494
bool
Item_func_nullif::is_null()
{
unknown's avatar
unknown committed
2495
  return (null_value= (!cmp.compare() ? 1 : args[0]->null_value)); 
2496 2497
}

2498

unknown's avatar
unknown committed
2499
/**
2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512
    Find and return matching items for CASE or ELSE item if all compares
    are failed or NULL if ELSE item isn't defined.

  IMPLEMENTATION
    In order to do correct comparisons of the CASE expression (the expression
    between CASE and the first WHEN) with each WHEN expression several
    comparators are used. One for each result type. CASE expression can be
    evaluated up to # of different result types are used. To check whether
    the CASE expression already was evaluated for a particular result type
    a bit mapped variable value_added_map is used. Result types are mapped
    to it according to their int values i.e. STRING_RESULT is mapped to bit
    0, REAL_RESULT to bit 1, so on.

unknown's avatar
unknown committed
2513 2514 2515 2516
  @retval
    NULL  Nothing found and there is no ELSE expression defined
  @retval
    item  Found item or ELSE item if defined and all comparisons are
2517
           failed
unknown's avatar
unknown committed
2518 2519 2520 2521
*/

Item *Item_func_case::find_item(String *str)
{
2522
  uint value_added_map= 0;
unknown's avatar
unknown committed
2523

2524
  if (first_expr_num == -1)
unknown's avatar
unknown committed
2525
  {
2526
    for (uint i=0 ; i < ncases ; i+=2)
unknown's avatar
unknown committed
2527
    {
unknown's avatar
unknown committed
2528
      // No expression between CASE and the first WHEN
unknown's avatar
unknown committed
2529
      if (args[i]->val_bool())
unknown's avatar
unknown committed
2530 2531 2532
	return args[i+1];
      continue;
    }
2533 2534 2535 2536 2537
  }
  else
  {
    /* Compare every WHEN argument with it and return the first match */
    for (uint i=0 ; i < ncases ; i+=2)
unknown's avatar
unknown committed
2538
    {
2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550
      cmp_type= item_cmp_type(left_result_type, args[i]->result_type());
      DBUG_ASSERT(cmp_type != ROW_RESULT);
      DBUG_ASSERT(cmp_items[(uint)cmp_type]);
      if (!(value_added_map & (1<<(uint)cmp_type)))
      {
        cmp_items[(uint)cmp_type]->store_value(args[first_expr_num]);
        if ((null_value=args[first_expr_num]->null_value))
          return else_expr_num != -1 ? args[else_expr_num] : 0;
        value_added_map|= 1<<(uint)cmp_type;
      }
      if (!cmp_items[(uint)cmp_type]->cmp(args[i]) && !args[i]->null_value)
        return args[i + 1];
unknown's avatar
unknown committed
2551 2552 2553
    }
  }
  // No, WHEN clauses all missed, return ELSE expression
2554
  return else_expr_num != -1 ? args[else_expr_num] : 0;
unknown's avatar
unknown committed
2555 2556 2557 2558 2559
}


String *Item_func_case::val_str(String *str)
{
2560
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
2561 2562 2563 2564 2565 2566 2567 2568
  String *res;
  Item *item=find_item(str);

  if (!item)
  {
    null_value=1;
    return 0;
  }
unknown's avatar
unknown committed
2569
  null_value= 0;
unknown's avatar
unknown committed
2570
  if (!(res=item->val_str(str)))
unknown's avatar
unknown committed
2571
    null_value= 1;
unknown's avatar
unknown committed
2572 2573 2574 2575 2576 2577
  return res;
}


longlong Item_func_case::val_int()
{
2578
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
2579
  char buff[MAX_FIELD_WIDTH];
2580
  String dummy_str(buff,sizeof(buff),default_charset());
unknown's avatar
unknown committed
2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593
  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;
}

2594
double Item_func_case::val_real()
unknown's avatar
unknown committed
2595
{
2596
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
2597
  char buff[MAX_FIELD_WIDTH];
2598
  String dummy_str(buff,sizeof(buff),default_charset());
unknown's avatar
unknown committed
2599 2600 2601 2602 2603 2604 2605 2606
  Item *item=find_item(&dummy_str);
  double res;

  if (!item)
  {
    null_value=1;
    return 0;
  }
2607
  res= item->val_real();
unknown's avatar
unknown committed
2608 2609 2610 2611
  null_value=item->null_value;
  return res;
}

unknown's avatar
unknown committed
2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632

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
2633
bool Item_func_case::fix_fields(THD *thd, Item **ref)
unknown's avatar
unknown committed
2634 2635 2636 2637 2638
{
  /*
    buff should match stack usage from
    Item_func_case::val_int() -> Item_func_case::find_item()
  */
2639
#ifndef EMBEDDED_LIBRARY
2640
  uchar buff[MAX_FIELD_WIDTH*2+sizeof(String)*2+sizeof(String*)*2+sizeof(double)*2+sizeof(longlong)*2];
2641
#endif
unknown's avatar
unknown committed
2642 2643 2644 2645 2646
  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
2647 2648
  if (check_stack_overrun(thd, STACK_MIN_SIZE, buff))
    return TRUE;				// Fatal error flag is set!
unknown's avatar
unknown committed
2649
  return res;
unknown's avatar
unknown committed
2650 2651 2652
}


2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669
void Item_func_case::agg_str_lengths(Item* arg)
{
  set_if_bigger(max_length, arg->max_length);
  set_if_bigger(decimals, arg->decimals);
  unsigned_flag= unsigned_flag && arg->unsigned_flag;
}


void Item_func_case::agg_num_lengths(Item *arg)
{
  uint len= my_decimal_length_to_precision(arg->max_length, arg->decimals,
                                           arg->unsigned_flag) - arg->decimals;
  set_if_bigger(max_length, len); 
  set_if_bigger(decimals, arg->decimals);
  unsigned_flag= unsigned_flag && arg->unsigned_flag; 
}

unknown's avatar
unknown committed
2670

unknown's avatar
unknown committed
2671
void Item_func_case::fix_length_and_dec()
2672
{
2673 2674
  Item **agg;
  uint nagg;
2675
  uint found_types= 0;
2676 2677 2678
  if (!(agg= (Item**) sql_alloc(sizeof(Item*)*(ncases+1))))
    return;
  
2679 2680 2681 2682
  /*
    Aggregate all THEN and ELSE expression types
    and collations when string result
  */
2683 2684 2685 2686 2687 2688 2689 2690 2691
  
  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) &&
2692
      agg_arg_charsets(collation, agg, nagg, MY_COLL_ALLOW_CONV, 1))
2693 2694
    return;
  
2695
  cached_field_type= agg_field_type(agg, nagg);
unknown's avatar
unknown committed
2696 2697 2698 2699
  /*
    Aggregate first expression and all THEN expression types
    and collations when string comparison
  */
2700
  if (first_expr_num != -1)
2701
  {
2702
    uint i;
2703
    agg[0]= args[first_expr_num];
2704 2705
    left_result_type= agg[0]->result_type();

2706
    for (nagg= 0; nagg < ncases/2 ; nagg++)
unknown's avatar
unknown committed
2707
      agg[nagg+1]= args[nagg*2];
2708
    nagg++;
unknown's avatar
unknown committed
2709 2710
    if (!(found_types= collect_cmp_types(agg, nagg)))
      return;
2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725

    for (i= 0; i <= (uint)DECIMAL_RESULT; i++)
    {
      if (found_types & (1 << i) && !cmp_items[i])
      {
        DBUG_ASSERT((Item_result)i != ROW_RESULT);
        if ((Item_result)i == STRING_RESULT &&
            agg_arg_charsets(cmp_collation, agg, nagg, MY_COLL_CMP_CONV, 1))
          return;
        if (!(cmp_items[i]=
            cmp_item::get_comparator((Item_result)i,
                                     cmp_collation.collation)))
          return;
      }
    }
2726
  }
2727

unknown's avatar
unknown committed
2728
  if (else_expr_num == -1 || args[else_expr_num]->maybe_null)
2729
    maybe_null=1;
2730
  
unknown's avatar
unknown committed
2731 2732
  max_length=0;
  decimals=0;
2733 2734
  unsigned_flag= TRUE;
  if (cached_result_type == STRING_RESULT)
unknown's avatar
unknown committed
2735
  {
2736 2737 2738 2739
    for (uint i= 0; i < ncases; i+= 2)
      agg_str_lengths(args[i + 1]);
    if (else_expr_num != -1)
      agg_str_lengths(args[else_expr_num]);
unknown's avatar
unknown committed
2740
  }
2741
  else
unknown's avatar
unknown committed
2742
  {
2743 2744 2745 2746 2747 2748
    for (uint i= 0; i < ncases; i+= 2)
      agg_num_lengths(args[i + 1]);
    if (else_expr_num != -1) 
      agg_num_lengths(args[else_expr_num]);
    max_length= my_decimal_precision_to_length(max_length + decimals, decimals,
                                               unsigned_flag);
unknown's avatar
unknown committed
2749 2750 2751
  }
}

unknown's avatar
unknown committed
2752

unknown's avatar
unknown committed
2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764
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);
}


unknown's avatar
unknown committed
2765 2766 2767 2768
/**
  @todo
    Fix this so that it prints the whole CASE expression
*/
unknown's avatar
unknown committed
2769

2770
void Item_func_case::print(String *str, enum_query_type query_type)
unknown's avatar
unknown committed
2771
{
2772
  str->append(STRING_WITH_LEN("(case "));
2773 2774
  if (first_expr_num != -1)
  {
2775
    args[first_expr_num]->print(str, query_type);
2776 2777 2778 2779
    str->append(' ');
  }
  for (uint i=0 ; i < ncases ; i+=2)
  {
2780
    str->append(STRING_WITH_LEN("when "));
2781
    args[i]->print(str, query_type);
2782
    str->append(STRING_WITH_LEN(" then "));
2783
    args[i+1]->print(str, query_type);
2784 2785 2786 2787
    str->append(' ');
  }
  if (else_expr_num != -1)
  {
2788
    str->append(STRING_WITH_LEN("else "));
2789
    args[else_expr_num]->print(str, query_type);
2790 2791
    str->append(' ');
  }
2792
  str->append(STRING_WITH_LEN("end)"));
unknown's avatar
unknown committed
2793 2794
}

2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809

void Item_func_case::cleanup()
{
  uint i;
  DBUG_ENTER("Item_func_case::cleanup");
  Item_func::cleanup();
  for (i= 0; i <= (uint)DECIMAL_RESULT; i++)
  {
    delete cmp_items[i];
    cmp_items[i]= 0;
  }
  DBUG_VOID_RETURN;
}


unknown's avatar
unknown committed
2810
/**
2811
  Coalesce - return first not NULL argument.
unknown's avatar
unknown committed
2812 2813
*/

unknown's avatar
unknown committed
2814
String *Item_func_coalesce::str_op(String *str)
unknown's avatar
unknown committed
2815
{
2816
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
2817 2818 2819
  null_value=0;
  for (uint i=0 ; i < arg_count ; i++)
  {
unknown's avatar
unknown committed
2820 2821 2822
    String *res;
    if ((res=args[i]->val_str(str)))
      return res;
unknown's avatar
unknown committed
2823 2824 2825 2826 2827
  }
  null_value=1;
  return 0;
}

unknown's avatar
unknown committed
2828
longlong Item_func_coalesce::int_op()
unknown's avatar
unknown committed
2829
{
2830
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841
  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
2842
double Item_func_coalesce::real_op()
unknown's avatar
unknown committed
2843
{
2844
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
2845 2846 2847
  null_value=0;
  for (uint i=0 ; i < arg_count ; i++)
  {
2848
    double res= args[i]->val_real();
unknown's avatar
unknown committed
2849 2850 2851 2852 2853 2854 2855 2856
    if (!args[i]->null_value)
      return res;
  }
  null_value=1;
  return 0;
}


unknown's avatar
unknown committed
2857
my_decimal *Item_func_coalesce::decimal_op(my_decimal *decimal_value)
unknown's avatar
unknown committed
2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871
{
  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
2872 2873
void Item_func_coalesce::fix_length_and_dec()
{
2874
  cached_field_type= agg_field_type(args, arg_count);
unknown's avatar
unknown committed
2875 2876
  agg_result_type(&hybrid_type, args, arg_count);
  switch (hybrid_type) {
unknown's avatar
unknown committed
2877 2878 2879
  case STRING_RESULT:
    count_only_length();
    decimals= NOT_FIXED_DEC;
2880
    agg_arg_charsets(collation, args, arg_count, MY_COLL_ALLOW_CONV, 1);
unknown's avatar
unknown committed
2881 2882 2883 2884 2885 2886 2887 2888 2889
    break;
  case DECIMAL_RESULT:
    count_decimal_length();
    break;
  case REAL_RESULT:
    count_real_length();
    break;
  case INT_RESULT:
    count_only_length();
2890
    decimals= 0;
unknown's avatar
unknown committed
2891 2892
    break;
  case ROW_RESULT:
2893
  default:
unknown's avatar
unknown committed
2894 2895
    DBUG_ASSERT(0);
  }
unknown's avatar
unknown committed
2896 2897 2898
}

/****************************************************************************
2899
 Classes and function for the IN operator
unknown's avatar
unknown committed
2900 2901
****************************************************************************/

unknown's avatar
unknown committed
2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920
/*
  Determine which of the signed longlong arguments is bigger

  SYNOPSIS
    cmp_longs()
      a_val     left argument
      b_val     right argument

  DESCRIPTION
    This function will compare two signed longlong arguments
    and will return -1, 0, or 1 if left argument is smaller than,
    equal to or greater than the right argument.

  RETURN VALUE
    -1          left argument is smaller than the right argument.
    0           left argument is equal to the right argument.
    1           left argument is greater than the right argument.
*/
static inline int cmp_longs (longlong a_val, longlong b_val)
unknown's avatar
unknown committed
2921
{
unknown's avatar
unknown committed
2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954
  return a_val < b_val ? -1 : a_val == b_val ? 0 : 1;
}


/*
  Determine which of the unsigned longlong arguments is bigger

  SYNOPSIS
    cmp_ulongs()
      a_val     left argument
      b_val     right argument

  DESCRIPTION
    This function will compare two unsigned longlong arguments
    and will return -1, 0, or 1 if left argument is smaller than,
    equal to or greater than the right argument.

  RETURN VALUE
    -1          left argument is smaller than the right argument.
    0           left argument is equal to the right argument.
    1           left argument is greater than the right argument.
*/
static inline int cmp_ulongs (ulonglong a_val, ulonglong b_val)
{
  return a_val < b_val ? -1 : a_val == b_val ? 0 : 1;
}


/*
  Compare two integers in IN value list format (packed_longlong) 

  SYNOPSIS
    cmp_longlong()
2955
      cmp_arg   an argument passed to the calling function (my_qsort2)
unknown's avatar
unknown committed
2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982
      a         left argument
      b         right argument

  DESCRIPTION
    This function will compare two integer arguments in the IN value list
    format and will return -1, 0, or 1 if left argument is smaller than,
    equal to or greater than the right argument.
    It's used in sorting the IN values list and finding an element in it.
    Depending on the signedness of the arguments cmp_longlong() will
    compare them as either signed (using cmp_longs()) or unsigned (using
    cmp_ulongs()).

  RETURN VALUE
    -1          left argument is smaller than the right argument.
    0           left argument is equal to the right argument.
    1           left argument is greater than the right argument.
*/
int cmp_longlong(void *cmp_arg, 
                 in_longlong::packed_longlong *a,
                 in_longlong::packed_longlong *b)
{
  if (a->unsigned_flag != b->unsigned_flag)
  { 
    /* 
      One of the args is unsigned and is too big to fit into the 
      positive signed range. Report no match.
    */  
2983 2984
    if (a->unsigned_flag && ((ulonglong) a->val) > (ulonglong) LONGLONG_MAX ||
        b->unsigned_flag && ((ulonglong) b->val) > (ulonglong) LONGLONG_MAX)
unknown's avatar
unknown committed
2985 2986 2987 2988 2989 2990 2991 2992 2993 2994 2995
      return a->unsigned_flag ? 1 : -1;
    /*
      Although the signedness differs both args can fit into the signed 
      positive range. Make them signed and compare as usual.
    */  
    return cmp_longs (a->val, b->val);
  }
  if (a->unsigned_flag)
    return cmp_ulongs ((ulonglong) a->val, (ulonglong) b->val);
  else
    return cmp_longs (a->val, b->val);
unknown's avatar
unknown committed
2996 2997
}

2998
static int cmp_double(void *cmp_arg, double *a,double *b)
unknown's avatar
unknown committed
2999 3000 3001 3002
{
  return *a < *b ? -1 : *a == *b ? 0 : 1;
}

unknown's avatar
unknown committed
3003
static int cmp_row(void *cmp_arg, cmp_item_row *a, cmp_item_row *b)
unknown's avatar
unknown committed
3004 3005 3006 3007
{
  return a->compare(b);
}

unknown's avatar
unknown committed
3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020

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
3021 3022
int in_vector::find(Item *item)
{
3023
  uchar *result=get_value(item);
unknown's avatar
unknown committed
3024 3025 3026 3027 3028 3029 3030 3031 3032
  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;
3033
    if ((res=(*compare)(collation, base+mid*size, result)) == 0)
unknown's avatar
unknown committed
3034 3035 3036 3037 3038 3039
      return 1;
    if (res < 0)
      start=mid;
    else
      end=mid-1;
  }
3040
  return (int) ((*compare)(collation, base+start*size, result) == 0);
unknown's avatar
unknown committed
3041 3042
}

3043 3044
in_string::in_string(uint elements,qsort2_cmp cmp_func, CHARSET_INFO *cs)
  :in_vector(elements, sizeof(String), cmp_func, cs),
3045
   tmp(buff, sizeof(buff), &my_charset_bin)
unknown's avatar
unknown committed
3046 3047 3048 3049
{}

in_string::~in_string()
{
3050
  if (base)
3051
  {
unknown's avatar
unknown committed
3052
    // base was allocated with help of sql_alloc => following is OK
3053 3054
    for (uint i=0 ; i < count ; i++)
      ((String*) base)[i].free();
3055
  }
unknown's avatar
unknown committed
3056 3057 3058 3059 3060 3061 3062
}

void in_string::set(uint pos,Item *item)
{
  String *str=((String*) base)+pos;
  String *res=item->val_str(str);
  if (res && res != str)
3063 3064 3065
  {
    if (res->uses_buffer_owned_by(str))
      res->copy();
3066 3067 3068 3069
    if (item->type() == Item::FUNC_ITEM)
      str->copy(*res);
    else
      *str= *res;
3070
  }
3071
  if (!str->charset())
3072 3073
  {
    CHARSET_INFO *cs;
3074
    if (!(cs= item->collation.collation))
3075
      cs= &my_charset_bin;		// Should never happen for STR items
3076 3077
    str->set_charset(cs);
  }
unknown's avatar
unknown committed
3078 3079
}

3080

3081
uchar *in_string::get_value(Item *item)
unknown's avatar
unknown committed
3082
{
3083
  return (uchar*) item->val_str(&tmp);
unknown's avatar
unknown committed
3084 3085
}

unknown's avatar
unknown committed
3086 3087
in_row::in_row(uint elements, Item * item)
{
3088
  base= (char*) new cmp_item_row[count= elements];
unknown's avatar
unknown committed
3089
  size= sizeof(cmp_item_row);
3090
  compare= (qsort2_cmp) cmp_row;
3091 3092 3093 3094 3095 3096
  /*
    We need to reset these as otherwise we will call sort() with
    uninitialized (even if not used) elements
  */
  used_count= elements;
  collation= 0;
3097 3098 3099 3100 3101
}

in_row::~in_row()
{
  if (base)
3102
    delete [] (cmp_item_row*) base;
unknown's avatar
unknown committed
3103 3104
}

3105
uchar *in_row::get_value(Item *item)
unknown's avatar
unknown committed
3106 3107
{
  tmp.store_value(item);
unknown's avatar
unknown committed
3108 3109
  if (item->is_null())
    return 0;
3110
  return (uchar *)&tmp;
unknown's avatar
unknown committed
3111 3112 3113 3114 3115
}

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

in_longlong::in_longlong(uint elements)
unknown's avatar
unknown committed
3122
  :in_vector(elements,sizeof(packed_longlong),(qsort2_cmp) cmp_longlong, 0)
unknown's avatar
unknown committed
3123 3124 3125 3126
{}

void in_longlong::set(uint pos,Item *item)
{
unknown's avatar
unknown committed
3127 3128 3129 3130
  struct packed_longlong *buff= &((packed_longlong*) base)[pos];
  
  buff->val= item->val_int();
  buff->unsigned_flag= item->unsigned_flag;
unknown's avatar
unknown committed
3131 3132
}

3133
uchar *in_longlong::get_value(Item *item)
unknown's avatar
unknown committed
3134
{
unknown's avatar
unknown committed
3135
  tmp.val= item->val_int();
unknown's avatar
unknown committed
3136
  if (item->null_value)
unknown's avatar
unknown committed
3137
    return 0;
unknown's avatar
unknown committed
3138
  tmp.unsigned_flag= item->unsigned_flag;
3139
  return (uchar*) &tmp;
unknown's avatar
unknown committed
3140 3141
}

3142 3143
void in_datetime::set(uint pos,Item *item)
{
3144
  Item **tmp_item= &item;
3145 3146 3147
  bool is_null;
  struct packed_longlong *buff= &((packed_longlong*) base)[pos];

3148
  buff->val= get_datetime_value(thd, &tmp_item, 0, warn_item, &is_null);
3149 3150 3151
  buff->unsigned_flag= 1L;
}

unknown's avatar
unknown committed
3152
uchar *in_datetime::get_value(Item *item)
3153 3154 3155 3156 3157 3158 3159
{
  bool is_null;
  Item **tmp_item= lval_cache ? &lval_cache : &item;
  tmp.val= get_datetime_value(thd, &tmp_item, &lval_cache, warn_item, &is_null);
  if (item->null_value)
    return 0;
  tmp.unsigned_flag= 1L;
unknown's avatar
unknown committed
3160
  return (uchar*) &tmp;
3161 3162
}

unknown's avatar
unknown committed
3163
in_double::in_double(uint elements)
3164
  :in_vector(elements,sizeof(double),(qsort2_cmp) cmp_double, 0)
unknown's avatar
unknown committed
3165 3166 3167 3168
{}

void in_double::set(uint pos,Item *item)
{
3169
  ((double*) base)[pos]= item->val_real();
unknown's avatar
unknown committed
3170 3171
}

3172
uchar *in_double::get_value(Item *item)
unknown's avatar
unknown committed
3173
{
3174
  tmp= item->val_real();
unknown's avatar
unknown committed
3175
  if (item->null_value)
3176
    return 0;					/* purecov: inspected */
3177
  return (uchar*) &tmp;
unknown's avatar
unknown committed
3178 3179
}

unknown's avatar
unknown committed
3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190 3191 3192

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);
3193 3194
  /* if item->val_decimal() is evaluated to NULL then res == 0 */ 
  if (!item->null_value && res != dec)
unknown's avatar
unknown committed
3195 3196 3197 3198
    my_decimal2decimal(res, dec);
}


3199
uchar *in_decimal::get_value(Item *item)
unknown's avatar
unknown committed
3200 3201 3202 3203
{
  my_decimal *result= item->val_decimal(&val);
  if (item->null_value)
    return 0;
3204
  return (uchar *)result;
unknown's avatar
unknown committed
3205 3206 3207 3208 3209
}


cmp_item* cmp_item::get_comparator(Item_result type,
                                   CHARSET_INFO *cs)
3210
{
unknown's avatar
unknown committed
3211
  switch (type) {
3212
  case STRING_RESULT:
unknown's avatar
unknown committed
3213
    return new cmp_item_sort_string(cs);
3214 3215 3216 3217 3218 3219
  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
3220 3221
  case DECIMAL_RESULT:
    return new cmp_item_decimal;
unknown's avatar
unknown committed
3222 3223 3224
  default:
    DBUG_ASSERT(0);
    break;
3225 3226 3227 3228
  }
  return 0; // to satisfy compiler :)
}

3229

unknown's avatar
unknown committed
3230 3231
cmp_item* cmp_item_sort_string::make_same()
{
3232
  return new cmp_item_sort_string_in_static(cmp_charset);
unknown's avatar
unknown committed
3233 3234 3235 3236 3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249
}

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

3250 3251 3252 3253

cmp_item_row::~cmp_item_row()
{
  DBUG_ENTER("~cmp_item_row");
unknown's avatar
unknown committed
3254
  DBUG_PRINT("enter",("this: 0x%lx", (long) this));
3255 3256 3257 3258 3259 3260 3261 3262 3263 3264 3265 3266
  if (comparators)
  {
    for (uint i= 0; i < n; i++)
    {
      if (comparators[i])
	delete comparators[i];
    }
  }
  DBUG_VOID_RETURN;
}


3267 3268 3269 3270 3271 3272 3273
void cmp_item_row::alloc_comparators()
{
  if (!comparators)
    comparators= (cmp_item **) current_thd->calloc(sizeof(cmp_item *)*n);
}


3274 3275
void cmp_item_row::store_value(Item *item)
{
3276
  DBUG_ENTER("cmp_item_row::store_value");
3277
  n= item->cols();
3278
  alloc_comparators();
3279
  if (comparators)
3280
  {
3281
    item->bring_value();
unknown's avatar
unknown committed
3282
    item->null_value= 0;
3283
    for (uint i=0; i < n; i++)
3284
    {
unknown's avatar
unknown committed
3285
      if (!comparators[i])
unknown's avatar
unknown committed
3286
        if (!(comparators[i]=
3287 3288
              cmp_item::get_comparator(item->element_index(i)->result_type(),
                                       item->element_index(i)->collation.collation)))
unknown's avatar
unknown committed
3289
	  break;					// new failed
3290 3291
      comparators[i]->store_value(item->element_index(i));
      item->null_value|= item->element_index(i)->null_value;
3292
    }
3293
  }
3294
  DBUG_VOID_RETURN;
3295 3296
}

3297

unknown's avatar
unknown committed
3298 3299 3300 3301 3302
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
3303
    my_error(ER_OPERAND_COLUMNS, MYF(0), tmpl->n);
unknown's avatar
unknown committed
3304 3305 3306 3307 3308
    return;
  }
  n= tmpl->n;
  if ((comparators= (cmp_item **) sql_alloc(sizeof(cmp_item *)*n)))
  {
3309
    item->bring_value();
unknown's avatar
unknown committed
3310 3311
    item->null_value= 0;
    for (uint i=0; i < n; i++)
3312 3313 3314 3315
    {
      if (!(comparators[i]= tmpl->comparators[i]->make_same()))
	break;					// new failed
      comparators[i]->store_value_by_template(tmpl->comparators[i],
3316 3317
					      item->element_index(i));
      item->null_value|= item->element_index(i)->null_value;
3318
    }
unknown's avatar
unknown committed
3319 3320 3321
  }
}

3322

3323 3324
int cmp_item_row::cmp(Item *arg)
{
unknown's avatar
unknown committed
3325 3326 3327
  arg->null_value= 0;
  if (arg->cols() != n)
  {
unknown's avatar
unknown committed
3328
    my_error(ER_OPERAND_COLUMNS, MYF(0), n);
unknown's avatar
unknown committed
3329 3330
    return 1;
  }
unknown's avatar
unknown committed
3331
  bool was_null= 0;
3332
  arg->bring_value();
unknown's avatar
unknown committed
3333
  for (uint i=0; i < n; i++)
3334
  {
3335
    if (comparators[i]->cmp(arg->element_index(i)))
unknown's avatar
unknown committed
3336
    {
3337
      if (!arg->element_index(i)->null_value)
unknown's avatar
unknown committed
3338 3339
	return 1;
      was_null= 1;
unknown's avatar
unknown committed
3340
    }
3341
  }
unknown's avatar
unknown committed
3342
  return (arg->null_value= was_null);
unknown's avatar
unknown committed
3343 3344
}

3345

unknown's avatar
unknown committed
3346 3347
int cmp_item_row::compare(cmp_item *c)
{
3348
  cmp_item_row *l_cmp= (cmp_item_row *) c;
unknown's avatar
unknown committed
3349
  for (uint i=0; i < n; i++)
3350 3351
  {
    int res;
3352
    if ((res= comparators[i]->compare(l_cmp->comparators[i])))
unknown's avatar
unknown committed
3353
      return res;
3354
  }
3355 3356
  return 0;
}
unknown's avatar
unknown committed
3357

3358

unknown's avatar
unknown committed
3359 3360 3361
void cmp_item_decimal::store_value(Item *item)
{
  my_decimal *val= item->val_decimal(&value);
unknown's avatar
unknown committed
3362 3363
  /* val may be zero if item is nnull */
  if (val && val != &value)
unknown's avatar
unknown committed
3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376
    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
3377
int cmp_item_decimal::compare(cmp_item *arg)
unknown's avatar
unknown committed
3378
{
3379 3380
  cmp_item_decimal *l_cmp= (cmp_item_decimal*) arg;
  return my_decimal_cmp(&value, &l_cmp->value);
unknown's avatar
unknown committed
3381 3382 3383 3384 3385 3386 3387 3388 3389
}


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


3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419
void cmp_item_datetime::store_value(Item *item)
{
  bool is_null;
  Item **tmp_item= lval_cache ? &lval_cache : &item;
  value= get_datetime_value(thd, &tmp_item, &lval_cache, warn_item, &is_null);
}


int cmp_item_datetime::cmp(Item *arg)
{
  bool is_null;
  Item **tmp_item= &arg;
  return value !=
    get_datetime_value(thd, &tmp_item, 0, warn_item, &is_null);
}


int cmp_item_datetime::compare(cmp_item *ci)
{
  cmp_item_datetime *l_cmp= (cmp_item_datetime *)ci;
  return (value < l_cmp->value) ? -1 : ((value == l_cmp->value) ? 0 : 1);
}


cmp_item *cmp_item_datetime::make_same()
{
  return new cmp_item_datetime(warn_item);
}


unknown's avatar
unknown committed
3420 3421 3422
bool Item_func_in::nulls_in_row()
{
  Item **arg,**arg_end;
3423
  for (arg= args+1, arg_end= args+arg_count; arg != arg_end ; arg++)
unknown's avatar
unknown committed
3424 3425 3426 3427 3428 3429 3430
  {
    if ((*arg)->null_inside())
      return 1;
  }
  return 0;
}

3431

unknown's avatar
unknown committed
3432 3433
/**
  Perform context analysis of an IN item tree.
unknown's avatar
unknown committed
3434 3435 3436 3437 3438 3439

    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.

unknown's avatar
unknown committed
3440 3441 3442 3443 3444
  @param thd     reference to the global context of the query thread
  @param ref     pointer to Item* variable where pointer to resulting "fixed"
                 item is to be assigned

  @note
unknown's avatar
unknown committed
3445 3446
    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:
unknown's avatar
unknown committed
3447
    @verbatim
unknown's avatar
unknown committed
3448 3449 3450 3451
      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)))
unknown's avatar
unknown committed
3452
    @endverbatim
unknown's avatar
unknown committed
3453

unknown's avatar
unknown committed
3454
  @retval
unknown's avatar
unknown committed
3455
    0   ok
unknown's avatar
unknown committed
3456
  @retval
unknown's avatar
unknown committed
3457 3458 3459 3460
    1   got error
*/

bool
3461
Item_func_in::fix_fields(THD *thd, Item **ref)
unknown's avatar
unknown committed
3462 3463 3464
{
  Item **arg, **arg_end;

3465
  if (Item_func_opt_neg::fix_fields(thd, ref))
unknown's avatar
unknown committed
3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480
    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;
}


3481
static int srtcmp_in(CHARSET_INFO *cs, const String *x,const String *y)
3482
{
3483
  return cs->coll->strnncollsp(cs,
unknown's avatar
unknown committed
3484
                               (uchar *) x->ptr(),x->length(),
3485
                               (uchar *) y->ptr(),y->length(), 0);
3486 3487
}

3488

unknown's avatar
unknown committed
3489 3490
void Item_func_in::fix_length_and_dec()
{
3491
  Item **arg, **arg_end;
3492
  bool const_itm= 1;
3493
  THD *thd= current_thd;
3494 3495 3496 3497
  bool datetime_found= FALSE;
  /* TRUE <=> arguments values will be compared as DATETIMEs. */
  bool compare_as_datetime= FALSE;
  Item *date_arg= 0;
3498 3499 3500 3501 3502 3503 3504
  uint found_types= 0;
  uint type_cnt= 0, i;
  Item_result cmp_type= STRING_RESULT;
  left_result_type= args[0]->result_type();
  if (!(found_types= collect_cmp_types(args, arg_count)))
    return;
  
3505
  for (arg= args + 1, arg_end= args + arg_count; arg != arg_end ; arg++)
unknown's avatar
unknown committed
3506 3507 3508 3509 3510 3511 3512
  {
    if (!arg[0]->const_item())
    {
      const_itm= 0;
      break;
    }
  }
3513 3514 3515
  for (i= 0; i <= (uint)DECIMAL_RESULT; i++)
  {
    if (found_types & 1 << i)
3516
    {
3517
      (type_cnt)++;
3518 3519
      cmp_type= (Item_result) i;
    }
3520
  }
3521 3522 3523 3524 3525 3526 3527 3528

  if (type_cnt == 1)
  {
    if (cmp_type == STRING_RESULT && 
        agg_arg_charsets(cmp_collation, args, arg_count, MY_COLL_CMP_CONV, 1))
      return;
    arg_types_compatible= TRUE;
  }
3529 3530 3531 3532 3533 3534 3535 3536 3537 3538 3539 3540 3541 3542 3543 3544 3545 3546 3547 3548 3549 3550 3551 3552 3553 3554 3555
  if (type_cnt == 1)
  {
    /*
      When comparing rows create the row comparator object beforehand to ease
      the DATETIME comparison detection procedure.
    */
    if (cmp_type == ROW_RESULT)
    {
      cmp_item_row *cmp= 0;
      if (const_itm && !nulls_in_row())
      {
        array= new in_row(arg_count-1, 0);
        cmp= &((in_row*)array)->tmp;
      }
      else
      {
        if (!(cmp= new cmp_item_row))
          return;
        cmp_items[ROW_RESULT]= cmp;
      }
      cmp->n= args[0]->cols();
      cmp->alloc_comparators();
    }
    /* All DATE/DATETIME fields/functions has the STRING result type. */
    if (cmp_type == STRING_RESULT || cmp_type == ROW_RESULT)
    {
      uint col, cols= args[0]->cols();
3556

3557 3558 3559 3560 3561 3562 3563 3564 3565 3566 3567 3568 3569 3570 3571 3572 3573 3574 3575 3576 3577 3578 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 3605 3606 3607 3608 3609 3610 3611 3612
      for (col= 0; col < cols; col++)
      {
        bool skip_column= FALSE;
        /*
          Check that all items to be compared has the STRING result type and at
          least one of them is a DATE/DATETIME item.
        */
        for (arg= args, arg_end= args + arg_count; arg != arg_end ; arg++)
        {
          Item *itm= ((cmp_type == STRING_RESULT) ? arg[0] :
                      arg[0]->element_index(col));
          if (itm->result_type() != STRING_RESULT)
          {
            skip_column= TRUE;
            break;
          }
          else if (itm->is_datetime())
          {
            datetime_found= TRUE;
            /*
              Internally all DATE/DATETIME values are converted to the DATETIME
              type. So try to find a DATETIME item to issue correct warnings.
            */
            if (!date_arg)
              date_arg= itm;
            else if (itm->field_type() == MYSQL_TYPE_DATETIME)
            {
              date_arg= itm;
              /* All arguments are already checked to have the STRING result. */
              if (cmp_type == STRING_RESULT)
                break;
            }
          }
        }
        if (skip_column)
          continue;
        if (datetime_found)
        {
          if (cmp_type == ROW_RESULT)
          {
            cmp_item **cmp= 0;
            if (array)
              cmp= ((in_row*)array)->tmp.comparators + col;
            else
              cmp= ((cmp_item_row*)cmp_items[ROW_RESULT])->comparators + col;
            *cmp= new cmp_item_datetime(date_arg);
            /* Reset variables for the next column. */
            date_arg= 0;
            datetime_found= FALSE;
          }
          else
            compare_as_datetime= TRUE;
        }
      }
    }
  }
unknown's avatar
unknown committed
3613
  /*
3614
    Row item with NULLs inside can return NULL or FALSE =>
unknown's avatar
unknown committed
3615 3616
    they can't be processed as static
  */
3617
  if (type_cnt == 1 && const_itm && !nulls_in_row())
unknown's avatar
unknown committed
3618
  {
3619 3620 3621
    if (compare_as_datetime)
      array= new in_datetime(date_arg, arg_count - 1);
    else
unknown's avatar
unknown committed
3622
    {
3623 3624 3625 3626 3627 3628 3629 3630 3631 3632 3633
      /*
        IN must compare INT columns and constants as int values (the same
        way as equality does).
        So we must check here if the column on the left and all the constant 
        values on the right can be compared as integers and adjust the 
        comparison type accordingly.
      */  
      if (args[0]->real_item()->type() == FIELD_ITEM &&
          thd->lex->sql_command != SQLCOM_CREATE_VIEW &&
          thd->lex->sql_command != SQLCOM_SHOW_CREATE &&
          cmp_type != INT_RESULT)
unknown's avatar
unknown committed
3634
      {
3635 3636
        Item_field *field_item= (Item_field*) (args[0]->real_item());
        if (field_item->field->can_be_compared_as_longlong())
unknown's avatar
unknown committed
3637
        {
3638 3639 3640
          bool all_converted= TRUE;
          for (arg=args+1, arg_end=args+arg_count; arg != arg_end ; arg++)
          {
3641
            if (!convert_constant_item (thd, field_item, &arg[0]))
3642 3643 3644 3645
              all_converted= FALSE;
          }
          if (all_converted)
            cmp_type= INT_RESULT;
unknown's avatar
unknown committed
3646 3647
        }
      }
3648 3649 3650 3651 3652 3653 3654 3655 3656 3657 3658 3659 3660 3661 3662 3663 3664 3665 3666 3667 3668 3669 3670 3671 3672 3673
      switch (cmp_type) {
      case STRING_RESULT:
        array=new in_string(arg_count-1,(qsort2_cmp) srtcmp_in, 
                            cmp_collation.collation);
        break;
      case INT_RESULT:
        array= new in_longlong(arg_count-1);
        break;
      case REAL_RESULT:
        array= new in_double(arg_count-1);
        break;
      case ROW_RESULT:
        /*
          The row comparator was created at the beginning but only DATETIME
          items comparators were initialized. Call store_value() to setup
          others.
        */
        ((in_row*)array)->tmp.store_value(args[0]);
        break;
      case DECIMAL_RESULT:
        array= new in_decimal(arg_count - 1);
        break;
      default:
        DBUG_ASSERT(0);
        return;
      }
unknown's avatar
unknown committed
3674
    }
3675
    if (array && !(thd->is_fatal_error))		// If not EOM
unknown's avatar
unknown committed
3676
    {
unknown's avatar
unknown committed
3677
      uint j=0;
unknown's avatar
unknown committed
3678
      for (uint i=1 ; i < arg_count ; i++)
unknown's avatar
unknown committed
3679 3680 3681 3682
      {
	array->set(j,args[i]);
	if (!args[i]->null_value)			// Skip NULL values
	  j++;
unknown's avatar
unknown committed
3683 3684
	else
	  have_null= 1;
unknown's avatar
unknown committed
3685
      }
3686
      if ((array->used_count= j))
unknown's avatar
unknown committed
3687
	array->sort();
unknown's avatar
unknown committed
3688 3689 3690 3691
    }
  }
  else
  {
3692 3693
    if (compare_as_datetime)
      cmp_items[STRING_RESULT]= new cmp_item_datetime(date_arg);
3694
    else
3695
    {
3696
      for (i= 0; i <= (uint) DECIMAL_RESULT; i++)
3697
      {
3698 3699 3700 3701 3702 3703 3704 3705 3706 3707 3708
        if (found_types & (1 << i) && !cmp_items[i])
        {
          if ((Item_result)i == STRING_RESULT &&
              agg_arg_charsets(cmp_collation, args, arg_count,
                               MY_COLL_CMP_CONV, 1))
            return;
          if (!cmp_items[i] && !(cmp_items[i]=
              cmp_item::get_comparator((Item_result)i,
                                       cmp_collation.collation)))
            return;
        }
3709 3710
      }
    }
unknown's avatar
unknown committed
3711
  }
unknown's avatar
unknown committed
3712
  max_length= 1;
unknown's avatar
unknown committed
3713 3714 3715
}


3716
void Item_func_in::print(String *str, enum_query_type query_type)
unknown's avatar
unknown committed
3717 3718
{
  str->append('(');
3719
  args[0]->print(str, query_type);
unknown's avatar
unknown committed
3720
  if (negated)
3721 3722
    str->append(STRING_WITH_LEN(" not"));
  str->append(STRING_WITH_LEN(" in ("));
3723
  print_args(str, 1, query_type);
3724
  str->append(STRING_WITH_LEN("))"));
unknown's avatar
unknown committed
3725 3726 3727
}


3728 3729 3730 3731 3732 3733 3734 3735 3736 3737 3738 3739 3740 3741 3742 3743 3744 3745 3746 3747 3748 3749 3750 3751 3752
/*
  Evaluate the function and return its value.

  SYNOPSIS
    val_int()

  DESCRIPTION
    Evaluate the function and return its value.

  IMPLEMENTATION
    If the array object is defined then the value of the function is
    calculated by means of this array.
    Otherwise several cmp_item objects are used in order to do correct
    comparison of left expression and an expression from the values list.
    One cmp_item object correspond to one used comparison type. Left
    expression can be evaluated up to number of different used comparison
    types. A bit mapped variable value_added_map is used to check whether
    the left expression already was evaluated for a particular result type.
    Result types are mapped to it according to their integer values i.e.
    STRING_RESULT is mapped to bit 0, REAL_RESULT to bit 1, so on.

  RETURN
    Value of the function
*/

unknown's avatar
unknown committed
3753 3754
longlong Item_func_in::val_int()
{
3755
  cmp_item *in_item;
3756
  DBUG_ASSERT(fixed == 1);
3757
  uint value_added_map= 0;
unknown's avatar
unknown committed
3758 3759
  if (array)
  {
3760 3761
    int tmp=array->find(args[0]);
    null_value=args[0]->null_value || (!tmp && have_null);
unknown's avatar
unknown committed
3762
    return (longlong) (!null_value && tmp != negated);
unknown's avatar
unknown committed
3763
  }
3764

3765
  have_null= 0;
3766
  for (uint i= 1 ; i < arg_count ; i++)
unknown's avatar
unknown committed
3767
  {
3768 3769 3770 3771 3772 3773
    Item_result cmp_type= item_cmp_type(left_result_type, args[i]->result_type());
    in_item= cmp_items[(uint)cmp_type];
    DBUG_ASSERT(in_item);
    if (!(value_added_map & (1 << (uint)cmp_type)))
    {
      in_item->store_value(args[0]);
3774 3775
      if ((null_value= args[0]->null_value))
        return 0;
3776 3777
      value_added_map|= 1 << (uint)cmp_type;
    }
unknown's avatar
unknown committed
3778
    if (!in_item->cmp(args[i]) && !args[i]->null_value)
unknown's avatar
unknown committed
3779
      return (longlong) (!negated);
3780
    have_null|= args[i]->null_value;
unknown's avatar
unknown committed
3781
  }
3782

3783
  null_value= have_null;
unknown's avatar
unknown committed
3784
  return (longlong) (!null_value && negated);
unknown's avatar
unknown committed
3785 3786 3787 3788 3789
}


longlong Item_func_bit_or::val_int()
{
3790
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
3791 3792 3793 3794 3795 3796 3797 3798 3799 3800 3801 3802 3803 3804 3805 3806 3807 3808 3809
  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()
{
3810
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
3811 3812 3813 3814 3815 3816 3817 3818 3819 3820 3821 3822 3823 3824 3825 3826
  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);
}

3827
Item_cond::Item_cond(THD *thd, Item_cond *item)
3828
  :Item_bool_func(thd, item),
3829 3830
   abort_on_null(item->abort_on_null),
   and_tables_cache(item->and_tables_cache)
3831 3832
{
  /*
unknown's avatar
unknown committed
3833
    item->list will be copied by copy_andor_arguments() call
3834 3835 3836
  */
}

unknown's avatar
unknown committed
3837

3838 3839 3840
void Item_cond::copy_andor_arguments(THD *thd, Item_cond *item)
{
  List_iterator_fast<Item> li(item->list);
unknown's avatar
unknown committed
3841
  while (Item *it= li++)
3842 3843
    list.push_back(it->copy_andor_structure(thd));
}
unknown's avatar
unknown committed
3844

unknown's avatar
unknown committed
3845

unknown's avatar
unknown committed
3846
bool
3847
Item_cond::fix_fields(THD *thd, Item **ref)
unknown's avatar
unknown committed
3848
{
3849
  DBUG_ASSERT(fixed == 0);
unknown's avatar
unknown committed
3850 3851
  List_iterator<Item> li(list);
  Item *item;
3852
#ifndef EMBEDDED_LIBRARY
3853
  uchar buff[sizeof(char*)];			// Max local vars in function
3854
#endif
3855
  not_null_tables_cache= used_tables_cache= 0;
unknown's avatar
unknown committed
3856
  const_item_cache= 1;
3857 3858 3859 3860 3861
  /*
    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
3862

3863
  if (check_stack_overrun(thd, STACK_MIN_SIZE, buff))
unknown's avatar
unknown committed
3864
    return TRUE;				// Fatal error flag is set!
3865 3866 3867 3868 3869 3870 3871 3872 3873 3874 3875 3876 3877 3878 3879
  /*
    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
3880 3881
  while ((item=li++))
  {
3882
    table_map tmp_table_map;
unknown's avatar
unknown committed
3883
    while (item->type() == Item::COND_ITEM &&
3884 3885
	   ((Item_cond*) item)->functype() == functype() &&
           !((Item_cond*) item)->list.is_empty())
unknown's avatar
unknown committed
3886 3887 3888 3889 3890
    {						// Identical function
      li.replace(((Item_cond*) item)->list);
      ((Item_cond*) item)->list.empty();
      item= *li.ref();				// new current item
    }
3891 3892
    if (abort_on_null)
      item->top_level_item();
3893 3894

    // item can be substituted in fix_fields
3895
    if ((!item->fixed &&
3896
	 item->fix_fields(thd, li.ref())) ||
3897
	(item= *li.ref())->check_cols(1))
unknown's avatar
unknown committed
3898
      return TRUE; /* purecov: inspected */
3899
    used_tables_cache|=     item->used_tables();
unknown's avatar
unknown committed
3900 3901 3902
    if (item->const_item())
      and_tables_cache= (table_map) 0;
    else
unknown's avatar
unknown committed
3903 3904 3905 3906 3907 3908
    {
      tmp_table_map= item->not_null_tables();
      not_null_tables_cache|= tmp_table_map;
      and_tables_cache&= tmp_table_map;
      const_item_cache= FALSE;
    }  
3909
    with_sum_func=	    with_sum_func || item->with_sum_func;
3910
    with_subselect|=        item->with_subselect;
unknown's avatar
unknown committed
3911 3912
    if (item->maybe_null)
      maybe_null=1;
unknown's avatar
unknown committed
3913
  }
3914
  thd->lex->current_select->cond_count+= list.elements;
unknown's avatar
unknown committed
3915
  fix_length_and_dec();
3916
  fixed= 1;
unknown's avatar
unknown committed
3917
  return FALSE;
unknown's avatar
unknown committed
3918 3919
}

3920
bool Item_cond::walk(Item_processor processor, bool walk_subquery, uchar *arg)
unknown's avatar
unknown committed
3921 3922 3923 3924
{
  List_iterator_fast<Item> li(list);
  Item *item;
  while ((item= li++))
3925
    if (item->walk(processor, walk_subquery, arg))
unknown's avatar
unknown committed
3926
      return 1;
3927
  return Item_func::walk(processor, walk_subquery, arg);
unknown's avatar
unknown committed
3928 3929
}

unknown's avatar
unknown committed
3930

unknown's avatar
unknown committed
3931 3932
/**
  Transform an Item_cond object with a transformer callback function.
unknown's avatar
unknown committed
3933
  
3934 3935
    The function recursively applies the transform method to each
     member item of the condition list.
unknown's avatar
unknown committed
3936 3937
    If the call of the method for a member item returns a new item
    the old item is substituted for a new one.
3938
    After this the transformer is applied to the root node
unknown's avatar
unknown committed
3939 3940
    of the Item_cond object. 
     
unknown's avatar
unknown committed
3941 3942 3943 3944 3945
  @param transformer   the transformer callback function to be applied to
                       the nodes of the tree of the object
  @param arg           parameter to be passed to the transformer

  @return
unknown's avatar
unknown committed
3946 3947 3948
    Item returned as the result of transformation of the root node 
*/

3949
Item *Item_cond::transform(Item_transformer transformer, uchar *arg)
3950
{
3951 3952
  DBUG_ASSERT(!current_thd->is_stmt_prepare());

3953 3954 3955 3956
  List_iterator<Item> li(list);
  Item *item;
  while ((item= li++))
  {
unknown's avatar
unknown committed
3957
    Item *new_item= item->transform(transformer, arg);
3958 3959
    if (!new_item)
      return 0;
3960 3961 3962 3963 3964 3965 3966

    /*
      THD::change_item_tree() should be called only if the tree was
      really transformed, i.e. when a new item has been created.
      Otherwise we'll be allocating a lot of unnecessary memory for
      change records at each execution.
    */
3967
    if (new_item != item)
3968
      current_thd->change_item_tree(li.ref(), new_item);
3969
  }
unknown's avatar
unknown committed
3970
  return Item_func::transform(transformer, arg);
3971 3972
}

3973

unknown's avatar
unknown committed
3974 3975 3976
/**
  Compile Item_cond object with a processor and a transformer
  callback functions.
3977 3978 3979 3980 3981 3982 3983 3984 3985 3986
  
    First the function applies the analyzer to the root node of
    the Item_func object. Then if the analyzer succeeeds (returns TRUE)
    the function recursively applies the compile method to member
    item of the condition list.
    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 transformer is applied to the root node
    of the Item_cond object. 
     
unknown's avatar
unknown committed
3987 3988 3989 3990 3991 3992 3993 3994
  @param analyzer      the analyzer callback function to be applied to the
                       nodes of the tree of the object
  @param[in,out] arg_p parameter to be passed to the analyzer
  @param transformer   the transformer callback function to be applied to the
                       nodes of the tree of the object
  @param arg_t         parameter to be passed to the transformer

  @return
3995 3996 3997
    Item returned as the result of transformation of the root node 
*/

3998 3999
Item *Item_cond::compile(Item_analyzer analyzer, uchar **arg_p,
                         Item_transformer transformer, uchar *arg_t)
4000 4001 4002 4003 4004 4005 4006 4007 4008 4009 4010 4011
{
  if (!(this->*analyzer)(arg_p))
    return 0;
  
  List_iterator<Item> li(list);
  Item *item;
  while ((item= li++))
  {
    /* 
      The same parameter value of arg_p must be passed
      to analyze any argument of the condition formula.
    */   
4012
    uchar *arg_v= *arg_p;
4013 4014 4015 4016 4017 4018 4019
    Item *new_item= item->compile(analyzer, &arg_v, transformer, arg_t);
    if (new_item && new_item != item)
      li.replace(new_item);
  }
  return Item_func::transform(transformer, arg_t);
}

4020 4021
void Item_cond::traverse_cond(Cond_traverser traverser,
                              void *arg, traverse_order order)
4022 4023 4024 4025
{
  List_iterator<Item> li(list);
  Item *item;

4026 4027 4028 4029 4030 4031 4032
  switch(order) {
  case(PREFIX):
    (*traverser)(this, arg);
    while ((item= li++))
    {
      item->traverse_cond(traverser, arg, order);
    }
4033
    (*traverser)(NULL, arg);
4034 4035 4036 4037 4038 4039 4040
    break;
  case(POSTFIX):
    while ((item= li++))
    {
      item->traverse_cond(traverser, arg, order);
    }
    (*traverser)(this, arg);
4041 4042
  }
}
unknown's avatar
unknown committed
4043

unknown's avatar
unknown committed
4044 4045
/**
  Move SUM items out from item tree and replace with reference.
4046

unknown's avatar
unknown committed
4047 4048 4049 4050 4051 4052 4053 4054 4055 4056 4057 4058
  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)

  @param thd			Thread handler
  @param ref_pointer_array	Pointer to array of reference fields
  @param fields		All fields in select

  @note
    This function is run on all expression (SELECT list, WHERE, HAVING etc)
    that have or refer (HAVING) to a SUM expression.
4059 4060
*/

4061 4062
void Item_cond::split_sum_func(THD *thd, Item **ref_pointer_array,
                               List<Item> &fields)
unknown's avatar
unknown committed
4063 4064 4065
{
  List_iterator<Item> li(list);
  Item *item;
4066
  while ((item= li++))
unknown's avatar
unknown committed
4067
    item->split_sum_func2(thd, ref_pointer_array, fields, li.ref(), TRUE);
unknown's avatar
unknown committed
4068 4069 4070 4071 4072 4073 4074 4075 4076
}


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

4077

unknown's avatar
unknown committed
4078 4079
void Item_cond::update_used_tables()
{
unknown's avatar
unknown committed
4080
  List_iterator_fast<Item> li(list);
unknown's avatar
unknown committed
4081
  Item *item;
4082 4083 4084

  used_tables_cache=0;
  const_item_cache=1;
unknown's avatar
unknown committed
4085 4086 4087
  while ((item=li++))
  {
    item->update_used_tables();
4088
    used_tables_cache|= item->used_tables();
unknown's avatar
unknown committed
4089
    const_item_cache&= item->const_item();
unknown's avatar
unknown committed
4090 4091 4092 4093
  }
}


4094
void Item_cond::print(String *str, enum_query_type query_type)
unknown's avatar
unknown committed
4095 4096
{
  str->append('(');
unknown's avatar
unknown committed
4097
  List_iterator_fast<Item> li(list);
unknown's avatar
unknown committed
4098 4099
  Item *item;
  if ((item=li++))
4100
    item->print(str, query_type);
unknown's avatar
unknown committed
4101 4102 4103 4104 4105
  while ((item=li++))
  {
    str->append(' ');
    str->append(func_name());
    str->append(' ');
4106
    item->print(str, query_type);
unknown's avatar
unknown committed
4107 4108 4109 4110
  }
  str->append(')');
}

4111

4112
void Item_cond::neg_arguments(THD *thd)
4113 4114 4115 4116 4117
{
  List_iterator<Item> li(list);
  Item *item;
  while ((item= li++))		/* Apply not transformation to the arguments */
  {
4118 4119 4120
    Item *new_item= item->neg_transformer(thd);
    if (!new_item)
    {
unknown's avatar
unknown committed
4121 4122
      if (!(new_item= new Item_func_not(item)))
	return;					// Fatal OEM error
4123 4124
    }
    VOID(li.replace(new_item));
4125 4126 4127 4128
  }
}


unknown's avatar
unknown committed
4129 4130
/**
  Evaluation of AND(expr, expr, expr ...).
4131

unknown's avatar
unknown committed
4132
  @note
4133 4134 4135 4136 4137 4138
    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)

unknown's avatar
unknown committed
4139
  @retval
4140
    1  If all expressions are true
unknown's avatar
unknown committed
4141
  @retval
4142 4143
    0  If all expressions are false or if we find a NULL expression and
       'abort_on_null' is set.
unknown's avatar
unknown committed
4144
  @retval
4145 4146 4147
    NULL if all expression are either 1 or NULL
*/

unknown's avatar
unknown committed
4148 4149 4150

longlong Item_cond_and::val_int()
{
4151
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
4152
  List_iterator_fast<Item> li(list);
unknown's avatar
unknown committed
4153
  Item *item;
4154
  null_value= 0;
unknown's avatar
unknown committed
4155 4156
  while ((item=li++))
  {
unknown's avatar
unknown committed
4157
    if (!item->val_bool())
unknown's avatar
unknown committed
4158
    {
4159 4160
      if (abort_on_null || !(null_value= item->null_value))
	return 0;				// return FALSE
unknown's avatar
unknown committed
4161 4162
    }
  }
4163
  return null_value ? 0 : 1;
unknown's avatar
unknown committed
4164 4165
}

4166

unknown's avatar
unknown committed
4167 4168
longlong Item_cond_or::val_int()
{
4169
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
4170
  List_iterator_fast<Item> li(list);
unknown's avatar
unknown committed
4171 4172 4173 4174
  Item *item;
  null_value=0;
  while ((item=li++))
  {
unknown's avatar
unknown committed
4175
    if (item->val_bool())
unknown's avatar
unknown committed
4176 4177 4178 4179 4180 4181 4182 4183 4184 4185
    {
      null_value=0;
      return 1;
    }
    if (item->null_value)
      null_value=1;
  }
  return 0;
}

unknown's avatar
unknown committed
4186 4187
/**
  Create an AND expression from two expressions.
4188

unknown's avatar
unknown committed
4189 4190 4191
  @param a	expression or NULL
  @param b    	expression.
  @param org_item	Don't modify a if a == *org_item.
4192 4193
                        If a == NULL, org_item is set to point at b,
                        to ensure that future calls will not modify b.
unknown's avatar
unknown committed
4194 4195

  @note
4196 4197 4198 4199
    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.

unknown's avatar
unknown committed
4200
  @retval
4201
    NULL	Error
unknown's avatar
unknown committed
4202
  @retval
4203 4204 4205 4206 4207 4208
    Item
*/

Item *and_expressions(Item *a, Item *b, Item **org_item)
{
  if (!a)
4209
    return (*org_item= (Item*) b);
4210 4211 4212
  if (a == *org_item)
  {
    Item_cond *res;
4213
    if ((res= new Item_cond_and(a, (Item*) b)))
4214
    {
4215
      res->used_tables_cache= a->used_tables() | b->used_tables();
4216 4217
      res->not_null_tables_cache= a->not_null_tables() | b->not_null_tables();
    }
4218 4219
    return res;
  }
4220
  if (((Item_cond_and*) a)->add((Item*) b))
4221 4222
    return 0;
  ((Item_cond_and*) a)->used_tables_cache|= b->used_tables();
4223
  ((Item_cond_and*) a)->not_null_tables_cache|= b->not_null_tables();
4224 4225 4226 4227
  return a;
}


unknown's avatar
unknown committed
4228 4229
longlong Item_func_isnull::val_int()
{
4230
  DBUG_ASSERT(fixed == 1);
4231 4232 4233 4234
  /*
    Handle optimization if the argument can't be null
    This has to be here because of the test in update_used_tables().
  */
unknown's avatar
unknown committed
4235
  if (!used_tables_cache && !with_subselect)
unknown's avatar
unknown committed
4236
    return cached_value;
unknown's avatar
unknown committed
4237
  return args[0]->is_null() ? 1: 0;
unknown's avatar
unknown committed
4238 4239
}

4240 4241
longlong Item_is_not_null_test::val_int()
{
4242
  DBUG_ASSERT(fixed == 1);
4243
  DBUG_ENTER("Item_is_not_null_test::val_int");
unknown's avatar
unknown committed
4244
  if (!used_tables_cache && !with_subselect)
4245 4246
  {
    owner->was_null|= (!cached_value);
unknown's avatar
unknown committed
4247
    DBUG_PRINT("info", ("cached: %ld", (long) cached_value));
4248 4249 4250 4251
    DBUG_RETURN(cached_value);
  }
  if (args[0]->is_null())
  {
unknown's avatar
unknown committed
4252
    DBUG_PRINT("info", ("null"));
4253 4254 4255 4256 4257 4258 4259
    owner->was_null|= 1;
    DBUG_RETURN(0);
  }
  else
    DBUG_RETURN(1);
}

unknown's avatar
unknown committed
4260 4261 4262
/**
  Optimize case of not_null_column IS NULL.
*/
4263 4264 4265 4266 4267 4268 4269 4270 4271 4272
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();
unknown's avatar
unknown committed
4273
    if (!(used_tables_cache=args[0]->used_tables()) && !with_subselect)
4274 4275 4276 4277 4278 4279
    {
      /* Remember if the value is always NULL or never NULL */
      cached_value= (longlong) !args[0]->is_null();
    }
  }
}
4280

4281

unknown's avatar
unknown committed
4282 4283
longlong Item_func_isnotnull::val_int()
{
4284
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
4285
  return args[0]->is_null() ? 0 : 1;
unknown's avatar
unknown committed
4286 4287 4288
}


4289
void Item_func_isnotnull::print(String *str, enum_query_type query_type)
4290 4291
{
  str->append('(');
4292
  args[0]->print(str, query_type);
4293
  str->append(STRING_WITH_LEN(" is not null)"));
4294 4295 4296
}


unknown's avatar
unknown committed
4297 4298
longlong Item_func_like::val_int()
{
4299
  DBUG_ASSERT(fixed == 1);
4300
  String* res = args[0]->val_str(&tmp_value1);
unknown's avatar
unknown committed
4301 4302 4303 4304 4305
  if (args[0]->null_value)
  {
    null_value=1;
    return 0;
  }
4306
  String* res2 = args[1]->val_str(&tmp_value2);
unknown's avatar
unknown committed
4307 4308 4309 4310 4311 4312
  if (args[1]->null_value)
  {
    null_value=1;
    return 0;
  }
  null_value=0;
4313 4314
  if (canDoTurboBM)
    return turboBM_matches(res->ptr(), res->length()) ? 1 : 0;
4315
  return my_wildcmp(cmp.cmp_collation.collation,
4316 4317 4318
		    res->ptr(),res->ptr()+res->length(),
		    res2->ptr(),res2->ptr()+res2->length(),
		    escape,wild_one,wild_many) ? 0 : 1;
unknown's avatar
unknown committed
4319 4320 4321
}


unknown's avatar
unknown committed
4322 4323 4324
/**
  We can optimize a where if first character isn't a wildcard
*/
unknown's avatar
unknown committed
4325 4326 4327

Item_func::optimize_type Item_func_like::select_optimize() const
{
4328
  if (args[1]->const_item())
unknown's avatar
unknown committed
4329
  {
4330 4331 4332 4333 4334 4335
    String* res2= args[1]->val_str((String *)&tmp_value2);

    if (!res2)
      return OPTIMIZE_NONE;

    if (*res2->ptr() != wild_many)
unknown's avatar
unknown committed
4336
    {
4337
      if (args[0]->result_type() != STRING_RESULT || *res2->ptr() != wild_one)
unknown's avatar
unknown committed
4338 4339 4340 4341 4342 4343
	return OPTIMIZE_OP;
    }
  }
  return OPTIMIZE_NONE;
}

4344

4345
bool Item_func_like::fix_fields(THD *thd, Item **ref)
4346
{
4347
  DBUG_ASSERT(fixed == 0);
4348 4349
  if (Item_bool_func2::fix_fields(thd, ref) ||
      escape_item->fix_fields(thd, &escape_item))
unknown's avatar
unknown committed
4350
    return TRUE;
4351

4352
  if (!escape_item->const_during_execution())
4353
  {
4354
    my_error(ER_WRONG_ARGUMENTS,MYF(0),"ESCAPE");
unknown's avatar
unknown committed
4355
    return TRUE;
4356 4357 4358 4359 4360 4361
  }
  
  if (escape_item->const_item())
  {
    /* If we are on execution stage */
    String *escape_str= escape_item->val_str(&tmp_value1);
4362 4363
    if (escape_str)
    {
4364 4365 4366 4367 4368 4369 4370 4371 4372
      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
4373
      if (use_mb(cmp.cmp_collation.collation))
4374
      {
4375
        CHARSET_INFO *cs= escape_str->charset();
4376 4377 4378 4379 4380 4381 4382 4383 4384
        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
4385 4386 4387 4388 4389
        /*
          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
4390
        CHARSET_INFO *cs= cmp.cmp_collation.collation;
unknown's avatar
unknown committed
4391 4392 4393 4394 4395 4396 4397 4398 4399 4400 4401 4402 4403
        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());
4404 4405 4406 4407
      }
    }
    else
      escape= '\\';
unknown's avatar
unknown committed
4408

4409
    /*
4410 4411
      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.
4412
    */
4413 4414
    if (args[1]->const_item() && !use_strnxfrm(collation.collation) &&
       !(specialflag & SPECIAL_NO_NEW_FUNC))
4415
    {
4416 4417
      String* res2 = args[1]->val_str(&tmp_value2);
      if (!res2)
unknown's avatar
unknown committed
4418
        return FALSE;				// Null argument
4419 4420 4421 4422 4423 4424 4425 4426 4427 4428 4429 4430 4431 4432 4433 4434 4435 4436 4437 4438
      
      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;
4439
        pattern_len = (int) len - 2;
4440
        DBUG_PRINT("info", ("Initializing pattern: '%s'", first));
4441 4442 4443
        int *suff = (int*) thd->alloc((int) (sizeof(int)*
                                      ((pattern_len + 1)*2+
                                      alphabet_size)));
4444 4445 4446 4447 4448 4449
        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"));
      }
4450 4451
    }
  }
unknown's avatar
unknown committed
4452
  return FALSE;
4453 4454
}

4455 4456 4457 4458 4459 4460
void Item_func_like::cleanup()
{
  canDoTurboBM= FALSE;
  Item_bool_func2::cleanup();
}

unknown's avatar
unknown committed
4461 4462
#ifdef USE_REGEX

4463 4464 4465 4466 4467 4468 4469 4470 4471 4472 4473 4474 4475 4476 4477 4478 4479 4480 4481 4482 4483 4484 4485 4486 4487 4488 4489 4490 4491 4492
bool
Item_func_regex::regcomp(bool send_error)
{
  char buff[MAX_FIELD_WIDTH];
  String tmp(buff,sizeof(buff),&my_charset_bin);
  String *res= args[1]->val_str(&tmp);
  int error;

  if (args[1]->null_value)
    return TRUE;

  if (regex_compiled)
  {
    if (!stringcmp(res, &prev_regexp))
      return FALSE;
    prev_regexp.copy(*res);
    my_regfree(&preg);
    regex_compiled= 0;
  }

  if (cmp_collation.collation != regex_lib_charset)
  {
    /* Convert UCS2 strings to UTF8 */
    uint dummy_errors;
    if (conv.copy(res->ptr(), res->length(), res->charset(),
                  regex_lib_charset, &dummy_errors))
      return TRUE;
    res= &conv;
  }

4493
  if ((error= my_regcomp(&preg, res->c_ptr_safe(),
4494 4495 4496 4497 4498 4499 4500 4501 4502 4503 4504 4505 4506 4507
                         regex_lib_flags, regex_lib_charset)))
  {
    if (send_error)
    {
      (void) my_regerror(error, &preg, buff, sizeof(buff));
      my_error(ER_REGEXP_ERROR, MYF(0), buff);
    }
    return TRUE;
  }
  regex_compiled= 1;
  return FALSE;
}


unknown's avatar
unknown committed
4508
bool
4509
Item_func_regex::fix_fields(THD *thd, Item **ref)
unknown's avatar
unknown committed
4510
{
4511
  DBUG_ASSERT(fixed == 0);
unknown's avatar
unknown committed
4512
  if ((!args[0]->fixed &&
4513
       args[0]->fix_fields(thd, args)) || args[0]->check_cols(1) ||
unknown's avatar
unknown committed
4514
      (!args[1]->fixed &&
4515
       args[1]->fix_fields(thd, args + 1)) || args[1]->check_cols(1))
unknown's avatar
unknown committed
4516
    return TRUE;				/* purecov: inspected */
unknown's avatar
unknown committed
4517
  with_sum_func=args[0]->with_sum_func || args[1]->with_sum_func;
unknown's avatar
unknown committed
4518 4519
  max_length= 1;
  decimals= 0;
4520

4521
  if (agg_arg_charsets(cmp_collation, args, 2, MY_COLL_CMP_CONV, 1))
unknown's avatar
unknown committed
4522
    return TRUE;
4523

4524 4525 4526 4527 4528 4529 4530 4531 4532 4533 4534 4535
  regex_lib_flags= (cmp_collation.collation->state &
                    (MY_CS_BINSORT | MY_CS_CSSORT)) ?
                   REG_EXTENDED | REG_NOSUB :
                   REG_EXTENDED | REG_NOSUB | REG_ICASE;
  /*
    If the case of UCS2 and other non-ASCII character sets,
    we will convert patterns and strings to UTF8.
  */
  regex_lib_charset= (cmp_collation.collation->mbminlen > 1) ?
                     &my_charset_utf8_general_ci :
                     cmp_collation.collation;

unknown's avatar
unknown committed
4536
  used_tables_cache=args[0]->used_tables() | args[1]->used_tables();
4537 4538
  not_null_tables_cache= (args[0]->not_null_tables() |
			  args[1]->not_null_tables());
unknown's avatar
unknown committed
4539 4540 4541 4542 4543 4544
  const_item_cache=args[0]->const_item() && args[1]->const_item();
  if (!regex_compiled && args[1]->const_item())
  {
    if (args[1]->null_value)
    {						// Will always return NULL
      maybe_null=1;
4545
      fixed= 1;
unknown's avatar
unknown committed
4546
      return FALSE;
unknown's avatar
unknown committed
4547
    }
4548
    if (regcomp(TRUE))
unknown's avatar
unknown committed
4549
      return TRUE;
4550 4551
    regex_is_const= 1;
    maybe_null= args[0]->maybe_null;
unknown's avatar
unknown committed
4552 4553 4554
  }
  else
    maybe_null=1;
4555
  fixed= 1;
unknown's avatar
unknown committed
4556
  return FALSE;
unknown's avatar
unknown committed
4557 4558
}

4559

unknown's avatar
unknown committed
4560 4561
longlong Item_func_regex::val_int()
{
4562
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
4563
  char buff[MAX_FIELD_WIDTH];
4564 4565
  String tmp(buff,sizeof(buff),&my_charset_bin);
  String *res= args[0]->val_str(&tmp);
unknown's avatar
unknown committed
4566

4567 4568
  if ((null_value= (args[0]->null_value ||
                    (!regex_is_const && regcomp(FALSE)))))
unknown's avatar
unknown committed
4569 4570
    return 0;

4571 4572 4573 4574 4575 4576
  if (cmp_collation.collation != regex_lib_charset)
  {
    /* Convert UCS2 strings to UTF8 */
    uint dummy_errors;
    if (conv.copy(res->ptr(), res->length(), res->charset(),
                  regex_lib_charset, &dummy_errors))
unknown's avatar
unknown committed
4577
    {
4578
      null_value= 1;
unknown's avatar
unknown committed
4579 4580
      return 0;
    }
4581
    res= &conv;
unknown's avatar
unknown committed
4582
  }
4583
  return my_regexec(&preg,res->c_ptr_safe(),0,(my_regmatch_t*) 0,0) ? 0 : 1;
unknown's avatar
unknown committed
4584 4585 4586
}


4587
void Item_func_regex::cleanup()
unknown's avatar
unknown committed
4588
{
4589 4590
  DBUG_ENTER("Item_func_regex::cleanup");
  Item_bool_func::cleanup();
unknown's avatar
unknown committed
4591 4592
  if (regex_compiled)
  {
unknown's avatar
unknown committed
4593
    my_regfree(&preg);
unknown's avatar
unknown committed
4594
    regex_compiled=0;
4595
    prev_regexp.length(0);
unknown's avatar
unknown committed
4596
  }
4597
  DBUG_VOID_RETURN;
unknown's avatar
unknown committed
4598 4599
}

4600

unknown's avatar
unknown committed
4601
#endif /* USE_REGEX */
4602 4603 4604


#ifdef LIKE_CMP_TOUPPER
unknown's avatar
unknown committed
4605
#define likeconv(cs,A) (uchar) (cs)->toupper(A)
4606
#else
unknown's avatar
unknown committed
4607
#define likeconv(cs,A) (uchar) (cs)->sort_order[(uchar) (A)]
4608 4609 4610
#endif


unknown's avatar
unknown committed
4611
/**
4612
  Precomputation dependent only on pattern_len.
unknown's avatar
unknown committed
4613
*/
4614

4615
void Item_func_like::turboBM_compute_suffixes(int *suff)
4616 4617 4618 4619
{
  const int   plm1 = pattern_len - 1;
  int            f = 0;
  int            g = plm1;
unknown's avatar
unknown committed
4620
  int *const splm1 = suff + plm1;
4621
  CHARSET_INFO	*cs= cmp.cmp_collation.collation;
4622 4623 4624

  *splm1 = pattern_len;

unknown's avatar
unknown committed
4625
  if (!cs->sort_order)
4626 4627 4628 4629 4630 4631 4632 4633 4634 4635 4636 4637 4638 4639 4640 4641 4642 4643 4644 4645 4646 4647 4648 4649 4650 4651 4652 4653 4654 4655 4656
  {
    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;
4657
	while (g >= 0 &&
unknown's avatar
unknown committed
4658
	       likeconv(cs, pattern[g]) == likeconv(cs, pattern[g + plm1 - f]))
4659 4660 4661 4662 4663 4664 4665 4666
	  g--;
	suff[i] = f - g;
      }
    }
  }
}


unknown's avatar
unknown committed
4667 4668 4669
/**
  Precomputation dependent only on pattern_len.
*/
4670

4671
void Item_func_like::turboBM_compute_good_suffix_shifts(int *suff)
4672 4673 4674
{
  turboBM_compute_suffixes(suff);

4675 4676
  int *end = bmGs + pattern_len;
  int *k;
4677 4678 4679 4680 4681 4682 4683 4684 4685 4686 4687 4688 4689
  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++)
      {
4690
	int *tmp2 = bmGs + j;
4691 4692 4693 4694 4695 4696
	if (*tmp2 == pattern_len)
	  *tmp2 = tmp;
      }
    }
  }

4697
  int *tmp2;
4698 4699 4700 4701 4702 4703 4704 4705 4706 4707 4708 4709 4710
  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;
}


unknown's avatar
unknown committed
4711
/**
4712
   Precomputation dependent on pattern_len.
unknown's avatar
unknown committed
4713
*/
4714 4715 4716

void Item_func_like::turboBM_compute_bad_character_shifts()
{
unknown's avatar
unknown committed
4717 4718 4719 4720
  int *i;
  int *end = bmBc + alphabet_size;
  int j;
  const int plm1 = pattern_len - 1;
4721
  CHARSET_INFO	*cs= cmp.cmp_collation.collation;
unknown's avatar
unknown committed
4722

4723 4724 4725
  for (i = bmBc; i < end; i++)
    *i = pattern_len;

unknown's avatar
unknown committed
4726
  if (!cs->sort_order)
unknown's avatar
unknown committed
4727
  {
4728
    for (j = 0; j < plm1; j++)
4729
      bmBc[(uint) (uchar) pattern[j]] = plm1 - j;
unknown's avatar
unknown committed
4730
  }
4731
  else
unknown's avatar
unknown committed
4732
  {
4733
    for (j = 0; j < plm1; j++)
unknown's avatar
unknown committed
4734
      bmBc[(uint) likeconv(cs,pattern[j])] = plm1 - j;
unknown's avatar
unknown committed
4735
  }
4736 4737 4738
}


unknown's avatar
unknown committed
4739 4740 4741 4742 4743 4744
/**
  Search for pattern in text.

  @return
    returns true/false for match/no match
*/
4745 4746 4747 4748 4749 4750 4751 4752

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;
4753
  CHARSET_INFO	*cs= cmp.cmp_collation.collation;
4754

4755 4756
  const int plm1=  pattern_len - 1;
  const int tlmpl= text_len - pattern_len;
4757 4758

  /* Searching */
unknown's avatar
unknown committed
4759
  if (!cs->sort_order)
4760 4761 4762
  {
    while (j <= tlmpl)
    {
4763
      register int i= plm1;
4764 4765 4766 4767
      while (i >= 0 && pattern[i] == text[i + j])
      {
	i--;
	if (i == plm1 - shift)
4768
	  i-= u;
4769 4770
      }
      if (i < 0)
unknown's avatar
unknown committed
4771
	return 1;
4772 4773 4774

      register const int v = plm1 - i;
      turboShift = u - v;
4775
      bcShift    = bmBc[(uint) (uchar) text[i + j]] - plm1 + i;
4776 4777 4778 4779 4780 4781 4782 4783 4784 4785
      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;
      }
4786
      j+= shift;
4787
    }
unknown's avatar
unknown committed
4788
    return 0;
4789 4790 4791 4792 4793 4794
  }
  else
  {
    while (j <= tlmpl)
    {
      register int i = plm1;
unknown's avatar
unknown committed
4795
      while (i >= 0 && likeconv(cs,pattern[i]) == likeconv(cs,text[i + j]))
4796 4797 4798
      {
	i--;
	if (i == plm1 - shift)
4799
	  i-= u;
4800 4801
      }
      if (i < 0)
unknown's avatar
unknown committed
4802
	return 1;
4803 4804 4805

      register const int v = plm1 - i;
      turboShift = u - v;
unknown's avatar
unknown committed
4806
      bcShift    = bmBc[(uint) likeconv(cs, text[i + j])] - plm1 + i;
4807 4808 4809 4810 4811 4812 4813 4814 4815 4816
      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;
      }
4817
      j+= shift;
4818
    }
unknown's avatar
unknown committed
4819
    return 0;
4820 4821
  }
}
unknown's avatar
unknown committed
4822

4823

unknown's avatar
unknown committed
4824
/**
4825 4826 4827 4828
  Make a logical XOR of the arguments.

  If either operator is NULL, return NULL.

unknown's avatar
unknown committed
4829 4830 4831
  @todo
    (low priority) Change this to be optimized as: @n
    A XOR B   ->  (A) == 1 AND (B) <> 1) OR (A <> 1 AND (B) == 1) @n
4832 4833
    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
4834 4835 4836 4837

  @note
    As we don't do any index optimization on XOR this is not going to be
    very fast to use.
4838 4839
*/

unknown's avatar
unknown committed
4840 4841
longlong Item_cond_xor::val_int()
{
4842
  DBUG_ASSERT(fixed == 1);
unknown's avatar
unknown committed
4843 4844 4845
  List_iterator<Item> li(list);
  Item *item;
  int result=0;	
4846
  null_value=0;
unknown's avatar
unknown committed
4847 4848
  while ((item=li++))
  {
4849 4850 4851 4852 4853 4854
    result^= (item->val_int() != 0);
    if (item->null_value)
    {
      null_value=1;
      return 0;
    }
unknown's avatar
unknown committed
4855
  }
4856
  return (longlong) result;
unknown's avatar
unknown committed
4857
}
4858

unknown's avatar
unknown committed
4859
/**
4860 4861 4862 4863
  Apply NOT transformation to the item and return a new one.


    Transform the item using next rules:
unknown's avatar
unknown committed
4864
    @verbatim
4865 4866 4867 4868 4869 4870 4871 4872 4873 4874 4875
       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)
unknown's avatar
unknown committed
4876
    @endverbatim
4877

unknown's avatar
unknown committed
4878 4879 4880
  @param thd		thread handler

  @return
4881 4882 4883 4884
    New item or
    NULL if we cannot apply NOT transformation (see Item::neg_transformer()).
*/

4885
Item *Item_func_not::neg_transformer(THD *thd)	/* NOT(x)  ->  x */
4886
{
unknown's avatar
unknown committed
4887
  return args[0];
4888 4889
}

4890 4891

Item *Item_bool_rowready_func2::neg_transformer(THD *thd)
4892
{
4893 4894
  Item *item= negated_item();
  return item;
4895 4896
}

4897

unknown's avatar
unknown committed
4898 4899 4900
/**
  a IS NULL  ->  a IS NOT NULL.
*/
4901
Item *Item_func_isnull::neg_transformer(THD *thd)
4902
{
4903 4904
  Item *item= new Item_func_isnotnull(args[0]);
  return item;
4905 4906
}

4907

unknown's avatar
unknown committed
4908 4909 4910
/**
  a IS NOT NULL  ->  a IS NULL.
*/
4911
Item *Item_func_isnotnull::neg_transformer(THD *thd)
4912
{
4913 4914
  Item *item= new Item_func_isnull(args[0]);
  return item;
4915 4916
}

4917 4918 4919

Item *Item_cond_and::neg_transformer(THD *thd)	/* NOT(a AND b AND ...)  -> */
					/* NOT a OR NOT b OR ... */
4920
{
4921 4922 4923
  neg_arguments(thd);
  Item *item= new Item_cond_or(list);
  return item;
4924 4925
}

4926 4927 4928

Item *Item_cond_or::neg_transformer(THD *thd)	/* NOT(a OR b OR ...)  -> */
					/* NOT a AND NOT b AND ... */
4929
{
4930 4931 4932
  neg_arguments(thd);
  Item *item= new Item_cond_and(list);
  return item;
4933 4934
}

4935

4936 4937 4938 4939 4940 4941 4942 4943 4944 4945 4946 4947 4948 4949 4950 4951 4952 4953 4954 4955 4956 4957
Item *Item_func_nop_all::neg_transformer(THD *thd)
{
  /* "NOT (e $cmp$ ANY (SELECT ...)) -> e $rev_cmp$" ALL (SELECT ...) */
  Item_func_not_all *new_item= new Item_func_not_all(args[0]);
  Item_allany_subselect *allany= (Item_allany_subselect*)args[0];
  allany->func= allany->func_creator(FALSE);
  allany->all= !allany->all;
  allany->upper_item= new_item;
  return new_item;
}

Item *Item_func_not_all::neg_transformer(THD *thd)
{
  /* "NOT (e $cmp$ ALL (SELECT ...)) -> e $rev_cmp$" ANY (SELECT ...) */
  Item_func_nop_all *new_item= new Item_func_nop_all(args[0]);
  Item_allany_subselect *allany= (Item_allany_subselect*)args[0];
  allany->all= !allany->all;
  allany->func= allany->func_creator(TRUE);
  allany->upper_item= new_item;
  return new_item;
}

4958
Item *Item_func_eq::negated_item()		/* a = b  ->  a != b */
4959
{
4960
  return new Item_func_ne(args[0], args[1]);
4961 4962
}

4963 4964

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

4969 4970

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

4975 4976

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

4981 4982

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

4987 4988

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

unknown's avatar
unknown committed
4993 4994 4995
/**
  just fake method, should never be called.
*/
4996
Item *Item_bool_rowready_func2::negated_item()
4997
{
4998 4999
  DBUG_ASSERT(0);
  return 0;
5000
}
5001 5002 5003 5004 5005 5006 5007 5008 5009 5010 5011 5012 5013 5014 5015 5016 5017

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

5018

5019 5020 5021 5022 5023 5024 5025 5026 5027 5028 5029 5030 5031 5032 5033 5034 5035 5036 5037 5038 5039 5040 5041 5042 5043
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
5044
  func->quick_fix_field();
unknown's avatar
unknown committed
5045 5046
  if ((cond_false= !func->val_int()))
    const_item_cache= 1;
5047 5048 5049 5050 5051 5052 5053
}

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

unknown's avatar
unknown committed
5054 5055
uint Item_equal::members()
{
5056
  return fields.elements;
unknown's avatar
unknown committed
5057 5058 5059
}


unknown's avatar
unknown committed
5060 5061
/**
  Check whether a field is referred in the multiple equality.
unknown's avatar
unknown committed
5062

unknown's avatar
unknown committed
5063 5064 5065 5066 5067
  The function checks whether field is occurred in the Item_equal object .

  @param field   field whose occurrence is to be checked

  @retval
unknown's avatar
unknown committed
5068
    1       if nultiple equality contains a reference to field
unknown's avatar
unknown committed
5069
  @retval
unknown's avatar
unknown committed
5070 5071 5072
    0       otherwise    
*/

5073 5074 5075 5076 5077 5078 5079 5080 5081 5082 5083 5084
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
5085

unknown's avatar
unknown committed
5086 5087
/**
  Join members of another Item_equal object.
unknown's avatar
unknown committed
5088
  
unknown's avatar
unknown committed
5089
    The function actually merges two multiple equalities.
unknown's avatar
unknown committed
5090 5091 5092 5093
    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.  
unknown's avatar
unknown committed
5094
  @param item    multiple equality whose members are to be joined
unknown's avatar
unknown committed
5095 5096
*/

5097 5098 5099 5100 5101 5102 5103 5104 5105 5106 5107
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
5108
    add(c);
5109 5110 5111 5112
  }
  cond_false|= item->cond_false;
} 

unknown's avatar
unknown committed
5113

unknown's avatar
unknown committed
5114 5115
/**
  Order field items in multiple equality according to a sorting criteria.
unknown's avatar
unknown committed
5116

5117 5118 5119 5120
  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.
unknown's avatar
unknown committed
5121

5122 5123 5124 5125
  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.
unknown's avatar
unknown committed
5126 5127 5128

  @param cmp          function to compare field item
  @param arg          context extra parameter for the cmp function
unknown's avatar
unknown committed
5129 5130 5131
*/

void Item_equal::sort(Item_field_cmpfunc cmp, void *arg)
5132 5133 5134 5135 5136 5137 5138 5139 5140 5141 5142 5143
{
  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
5144 5145
      Item_field **ref2= it.ref();
      if (cmp(item1, item2, arg) < 0)
5146 5147 5148 5149 5150 5151 5152 5153 5154 5155 5156 5157 5158 5159 5160 5161
      {
        Item_field *item= *ref1;
        *ref1= *ref2;
        *ref2= item;
        swap= TRUE;
      }
      else
      {
        item1= item2;
        ref1= ref2;
      }
    }
    it.rewind();
  } while (swap);
}

unknown's avatar
unknown committed
5162

unknown's avatar
unknown committed
5163 5164
/**
  Check appearance of new constant items in the multiple equality object.
unknown's avatar
unknown committed
5165

5166 5167 5168 5169 5170
  The function checks appearance of new constant items among
  the members of multiple equalities. Each new constant item is
  compared with the designated constant item if there is any in the
  multiple equality. If there is none the first new constant item
  becomes designated.
unknown's avatar
unknown committed
5171 5172
*/

5173
void Item_equal::update_const()
unknown's avatar
unknown committed
5174 5175 5176 5177 5178 5179 5180 5181 5182 5183 5184 5185 5186
{
  List_iterator<Item_field> it(fields);
  Item *item;
  while ((item= it++))
  {
    if (item->const_item())
    {
      it.remove();
      add(item);
    }
  }
}

5187
bool Item_equal::fix_fields(THD *thd, Item **ref)
5188 5189 5190 5191 5192
{
  List_iterator_fast<Item_field> li(fields);
  Item *item;
  not_null_tables_cache= used_tables_cache= 0;
  const_item_cache= 0;
unknown's avatar
unknown committed
5193
  while ((item= li++))
5194 5195 5196 5197 5198 5199 5200 5201 5202 5203 5204 5205 5206 5207 5208 5209 5210 5211
  {
    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
5212 5213
  if ((const_item_cache= cond_false))
    return;
5214 5215 5216 5217 5218 5219 5220 5221 5222 5223
  while ((item=li++))
  {
    item->update_used_tables();
    used_tables_cache|= item->used_tables();
    const_item_cache&= item->const_item();
  }
}

longlong Item_equal::val_int()
{
5224
  Item_field *item_field;
5225 5226 5227 5228 5229 5230 5231
  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);
5232
  while ((item_field= it++))
5233
  {
5234 5235 5236 5237 5238 5239
    /* 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;
    }
5240 5241 5242 5243 5244 5245
  }
  return 1;
}

void Item_equal::fix_length_and_dec()
{
unknown's avatar
unknown committed
5246
  Item *item= get_first();
unknown's avatar
unknown committed
5247 5248
  eval_item= cmp_item::get_comparator(item->result_type(),
                                      item->collation.collation);
5249 5250
}

5251
bool Item_equal::walk(Item_processor processor, bool walk_subquery, uchar *arg)
5252 5253 5254 5255
{
  List_iterator_fast<Item_field> it(fields);
  Item *item;
  while ((item= it++))
5256 5257
  {
    if (item->walk(processor, walk_subquery, arg))
5258
      return 1;
5259 5260
  }
  return Item_func::walk(processor, walk_subquery, arg);
5261 5262
}

5263
Item *Item_equal::transform(Item_transformer transformer, uchar *arg)
5264
{
5265 5266
  DBUG_ASSERT(!current_thd->is_stmt_prepare());

5267 5268 5269 5270
  List_iterator<Item_field> it(fields);
  Item *item;
  while ((item= it++))
  {
unknown's avatar
unknown committed
5271
    Item *new_item= item->transform(transformer, arg);
5272 5273
    if (!new_item)
      return 0;
5274 5275 5276 5277 5278 5279 5280

    /*
      THD::change_item_tree() should be called only if the tree was
      really transformed, i.e. when a new item has been created.
      Otherwise we'll be allocating a lot of unnecessary memory for
      change records at each execution.
    */
5281
    if (new_item != item)
5282
      current_thd->change_item_tree((Item **) it.ref(), new_item);
5283
  }
unknown's avatar
unknown committed
5284
  return Item_func::transform(transformer, arg);
5285 5286
}

5287
void Item_equal::print(String *str, enum_query_type query_type)
5288 5289 5290 5291 5292
{
  str->append(func_name());
  str->append('(');
  List_iterator_fast<Item_field> it(fields);
  Item *item;
unknown's avatar
unknown committed
5293
  if (const_item)
5294
    const_item->print(str, query_type);
unknown's avatar
unknown committed
5295 5296 5297
  else
  {
    item= it++;
5298
    item->print(str, query_type);
unknown's avatar
unknown committed
5299
  }
5300 5301 5302 5303
  while ((item= it++))
  {
    str->append(',');
    str->append(' ');
5304
    item->print(str, query_type);
5305 5306 5307 5308
  }
  str->append(')');
}