item_cmpfunc.cc 40.5 KB
Newer Older
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1
/* Copyright (C) 2000 MySQL AB & MySQL Finland AB & TCX DataKonsult AB
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
2

bk@work.mysql.com's avatar
bk@work.mysql.com committed
3 4 5 6
   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation; either version 2 of the License, or
   (at your option) any later version.
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
7

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

bk@work.mysql.com's avatar
bk@work.mysql.com committed
13 14 15 16 17 18 19 20 21 22 23 24 25 26 27
   You should have received a copy of the GNU General Public License
   along with this program; if not, write to the Free Software
   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA */


/* This file defines all compare functions */

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

#include "mysql_priv.h"
#include <m_ctype.h>

/*
28
  Test functions
29 30
  Most of these  returns 0LL if false and 1LL if true and
  NULL if some arg is NULL.
bk@work.mysql.com's avatar
bk@work.mysql.com committed
31 32 33 34 35 36 37 38 39
*/

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

40 41 42 43 44 45
/*
  Convert a constant expression or string to an integer.
  This is done when comparing DATE's of different formats and
  also when comparing bigint to strings (in which case the string
  is converted once to a bigint).
*/
bk@work.mysql.com's avatar
bk@work.mysql.com committed
46 47 48

static bool convert_constant_item(Field *field, Item **item)
{
49
  if ((*item)->const_item())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
50
  {
51
    if (!(*item)->save_in_field(field, 1) &&
52
	!((*item)->null_value))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
53
    {
54 55
      Item *tmp=new Item_int_with_ref(field->val_int(), *item);
      if (tmp)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
56
	*item=tmp;
57
      return 1;					// Item was replaced
bk@work.mysql.com's avatar
bk@work.mysql.com committed
58 59 60 61 62 63 64 65
    }
  }
  return 0;
}


void Item_bool_func2::fix_length_and_dec()
{
66
  max_length=1;					// Function returns 0 or 1
bk@work.mysql.com's avatar
bk@work.mysql.com committed
67

68 69 70 71
  /*
    As some compare functions are generated after sql_yacc,
    we have to check for out of memory conditons here
  */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
72 73 74 75 76 77
  if (!args[0] || !args[1])
    return;
  // Make a special case of compare with fields to get nicer DATE comparisons
  if (args[0]->type() == FIELD_ITEM)
  {
    Field *field=((Item_field*) args[0])->field;
78
    if (field->store_for_compare())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
79 80 81 82 83 84 85 86 87 88 89
    {
      if (convert_constant_item(field,&args[1]))
      {
	cmp_func= &Item_bool_func2::compare_int;  // Works for all types.
	return;
      }
    }
  }
  if (args[1]->type() == FIELD_ITEM)
  {
    Field *field=((Item_field*) args[1])->field;
90
    if (field->store_for_compare())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180
    {
      if (convert_constant_item(field,&args[0]))
      {
	cmp_func= &Item_bool_func2::compare_int;  // Works for all types.
	return;
      }
    }
  }
  set_cmp_func(item_cmp_type(args[0]->result_type(),args[1]->result_type()));
}


void Item_bool_func2::set_cmp_func(Item_result type)
{
  switch (type) {
  case STRING_RESULT:
    cmp_func=&Item_bool_func2::compare_string;
    break;
  case REAL_RESULT:
    cmp_func=&Item_bool_func2::compare_real;
    break;
  case INT_RESULT:
    cmp_func=&Item_bool_func2::compare_int;
    break;
  }
}


int Item_bool_func2::compare_string()
{
  String *res1,*res2;
  if ((res1=args[0]->val_str(&tmp_value1)))
  {
    if ((res2=args[1]->val_str(&tmp_value2)))
    {
      null_value=0;
      return binary ? stringcmp(res1,res2) : sortcmp(res1,res2);
    }
  }
  null_value=1;
  return -1;
}

int Item_bool_func2::compare_real()
{
  double val1=args[0]->val();
  if (!args[0]->null_value)
  {
    double val2=args[1]->val();
    if (!args[1]->null_value)
    {
      null_value=0;
      if (val1 < val2)	return -1;
      if (val1 == val2) return 0;
      return 1;
    }
  }
  null_value=1;
  return -1;
}


int Item_bool_func2::compare_int()
{
  longlong val1=args[0]->val_int();
  if (!args[0]->null_value)
  {
    longlong val2=args[1]->val_int();
    if (!args[1]->null_value)
    {
      null_value=0;
      if (val1 < val2)	return -1;
      if (val1 == val2)   return 0;
      return 1;
    }
  }
  null_value=1;
  return -1;
}



longlong Item_func_eq::val_int()
{
  int value=(this->*cmp_func)();
  return value == 0 ? 1 : 0;
}

/* Same as Item_func_eq, but NULL = NULL */

monty@donna.mysql.com's avatar
monty@donna.mysql.com committed
181 182 183
void Item_func_equal::fix_length_and_dec()
{
  Item_bool_func2::fix_length_and_dec();
184
  cmp_result_type=item_cmp_type(args[0]->result_type(),args[1]->result_type());
monty@donna.mysql.com's avatar
monty@donna.mysql.com committed
185 186 187
  maybe_null=null_value=0;
}

bk@work.mysql.com's avatar
bk@work.mysql.com committed
188 189
longlong Item_func_equal::val_int()
{
190
  switch (cmp_result_type) {
monty@donna.mysql.com's avatar
monty@donna.mysql.com committed
191 192 193 194 195 196 197 198 199 200 201
  case STRING_RESULT:
  {
    String *res1,*res2;
    res1=args[0]->val_str(&tmp_value1);
    res2=args[1]->val_str(&tmp_value2);
    if (!res1 || !res2)
      return test(res1 == res2);
    return (binary ? test(stringcmp(res1,res2) == 0) :
	    test(sortcmp(res1,res2) == 0));
  }
  case REAL_RESULT:
bk@work.mysql.com's avatar
bk@work.mysql.com committed
202
  {
monty@donna.mysql.com's avatar
monty@donna.mysql.com committed
203 204 205 206 207 208 209 210 211 212 213 214 215 216
    double val1=args[0]->val();
    double val2=args[1]->val();
    if (args[0]->null_value || args[1]->null_value)
      return test(args[0]->null_value && args[1]->null_value);
    return test(val1 == val2);
  }
  case INT_RESULT:
  {
    longlong val1=args[0]->val_int();
    longlong val2=args[1]->val_int();
    if (args[0]->null_value || args[1]->null_value)
      return test(args[0]->null_value && args[1]->null_value);
    return test(val1 == val2);
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
217
  }
monty@donna.mysql.com's avatar
monty@donna.mysql.com committed
218
  return 0;					// Impossible
bk@work.mysql.com's avatar
bk@work.mysql.com committed
219 220 221 222 223 224
}


longlong Item_func_ne::val_int()
{
  int value=(this->*cmp_func)();
225
  return value != 0 && !null_value ? 1 : 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264
}


longlong Item_func_ge::val_int()
{
  int value=(this->*cmp_func)();
  return value >= 0 ? 1 : 0;
}


longlong Item_func_gt::val_int()
{
  int value=(this->*cmp_func)();
  return value > 0 ? 1 : 0;
}

longlong Item_func_le::val_int()
{
  int value=(this->*cmp_func)();
  return value <= 0 && !null_value ? 1 : 0;
}


longlong Item_func_lt::val_int()
{
  int value=(this->*cmp_func)();
  return value < 0 && !null_value ? 1 : 0;
}


longlong Item_func_strcmp::val_int()
{
  String *a=args[0]->val_str(&tmp_value1);
  String *b=args[1]->val_str(&tmp_value2);
  if (!a || !b)
  {
    null_value=1;
    return 0;
  }
265
  int value= binary ? stringcmp(a,b) : sortcmp(a,b);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294
  null_value=0;
  return !value ? 0 : (value < 0 ? (longlong) -1 : (longlong) 1);
}


void Item_func_interval::fix_length_and_dec()
{
  bool nums=1;
  uint i;
  for (i=0 ; i < arg_count ; i++)
  {
    if (!args[i])
      return;					// End of memory
    if (args[i]->type() != Item::INT_ITEM &&
	args[i]->type() != Item::REAL_ITEM)
    {
      nums=0;
      break;
    }
  }
  if (nums && arg_count >= 8)
  {
    if ((intervals=(double*) sql_alloc(sizeof(double)*arg_count)))
    {
      for (i=0 ; i < arg_count ; i++)
	intervals[i]=args[i]->val();
    }
  }
  maybe_null=0; max_length=2;
295 296
  used_tables_cache|=     item->used_tables();
  not_null_tables_cache&= item->not_null_tables();
297
  with_sum_func= with_sum_func || item->with_sum_func;
298
  const_item_cache&=item->const_item();
299 300
}

301

302 303 304 305 306 307 308 309 310 311
void Item_func_interval::split_sum_func(List<Item> &fields)
{
  if (item->with_sum_func && item->type() != SUM_FUNC_ITEM)
    item->split_sum_func(fields);
  else if (item->used_tables() || item->type() == SUM_FUNC_ITEM)
  {
    fields.push_front(item);
    item= new Item_ref((Item**) fields.head_ref(), 0, item->name);
  }
  Item_int_func::split_sum_func(fields);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
312 313 314 315 316 317 318 319 320 321 322
}

/*
  return -1 if null value,
	  0 if lower than lowest
	  1 - arg_count if between args[n] and args[n+1]
	  arg_count+1 if higher than biggest argument
*/

longlong Item_func_interval::val_int()
{
ram@mysql.r18.ru's avatar
ram@mysql.r18.ru committed
323
  double value= item->val();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
324
  if (item->null_value)
325
    return -1;				// -1 if NULL
bk@work.mysql.com's avatar
bk@work.mysql.com committed
326 327
  if (intervals)
  {					// Use binary search to find interval
ram@mysql.r18.ru's avatar
ram@mysql.r18.ru committed
328
    uint start= 0, end= arg_count - 1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
329 330
    while (start != end)
    {
ram@mysql.r18.ru's avatar
ram@mysql.r18.ru committed
331
      uint mid= (start + end + 1) / 2;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
332
      if (intervals[mid] <= value)
ram@mysql.r18.ru's avatar
ram@mysql.r18.ru committed
333
	start= mid;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
334
      else
ram@mysql.r18.ru's avatar
ram@mysql.r18.ru committed
335
	end= mid - 1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
336
    }
ram@mysql.r18.ru's avatar
ram@mysql.r18.ru committed
337
    return (value < intervals[start]) ? 0 : start + 1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
338 339 340
  }
  if (args[0]->val() > value)
    return 0;
ram@mysql.r18.ru's avatar
ram@mysql.r18.ru committed
341
  for (uint i= 1; i < arg_count; i++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361
  {
    if (args[i]->val() > value)
      return i;
  }
  return (longlong) arg_count;
}


void Item_func_interval::update_used_tables()
{
  Item_func::update_used_tables();
  item->update_used_tables();
  used_tables_cache|=item->used_tables();
  const_item_cache&=item->const_item();
}

void Item_func_between::fix_length_and_dec()
{
   max_length=1;

362 363 364 365
  /*
    As some compare functions are generated after sql_yacc,
    we have to check for out of memory conditons here
  */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
366 367
  if (!args[0] || !args[1] || !args[2])
    return;
serg@sergbook.mysql.com's avatar
serg@sergbook.mysql.com committed
368 369 370 371
  cmp_type=item_cmp_type(args[0]->result_type(),
           item_cmp_type(args[1]->result_type(),
                         args[2]->result_type()));
  if (args[0]->binary | args[1]->binary | args[2]->binary)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
372 373 374 375
    string_compare=stringcmp;
  else
    string_compare=sortcmp;

serg@sergbook.mysql.com's avatar
serg@sergbook.mysql.com committed
376 377 378 379 380
  /*
    Make a special case of compare with date/time and longlong fields.
    They are compared as integers, so for const item this time-consuming
    conversion can be done only once, not for every single comparison
  */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422
  if (args[0]->type() == FIELD_ITEM)
  {
    Field *field=((Item_field*) args[0])->field;
    if (field->store_for_compare())
    {
      if (convert_constant_item(field,&args[1]))
	cmp_type=INT_RESULT;			// Works for all types.
      if (convert_constant_item(field,&args[2]))
	cmp_type=INT_RESULT;			// Works for all types.
    }
  }
}


longlong Item_func_between::val_int()
{						// ANSI BETWEEN
  if (cmp_type == STRING_RESULT)
  {
    String *value,*a,*b;
    value=args[0]->val_str(&value0);
    if ((null_value=args[0]->null_value))
      return 0;
    a=args[1]->val_str(&value1);
    b=args[2]->val_str(&value2);
    if (!args[1]->null_value && !args[2]->null_value)
      return (string_compare(value,a) >= 0 && string_compare(value,b) <= 0) ?
	1 : 0;
    if (args[1]->null_value && args[2]->null_value)
      null_value=1;
    else if (args[1]->null_value)
    {
      null_value= string_compare(value,b) <= 0; // not null if false range.
    }
    else
    {
      null_value= string_compare(value,a) >= 0; // not null if false range.
    }
  }
  else if (cmp_type == INT_RESULT)
  {
    longlong value=args[0]->val_int(),a,b;
    if ((null_value=args[0]->null_value))
423
      return 0;					/* purecov: inspected */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442
    a=args[1]->val_int();
    b=args[2]->val_int();
    if (!args[1]->null_value && !args[2]->null_value)
      return (value >= a && value <= b) ? 1 : 0;
    if (args[1]->null_value && args[2]->null_value)
      null_value=1;
    else if (args[1]->null_value)
    {
      null_value= value <= b;			// not null if false range.
    }
    else
    {
      null_value= value >= a;
    }
  }
  else
  {
    double value=args[0]->val(),a,b;
    if ((null_value=args[0]->null_value))
443
      return 0;					/* purecov: inspected */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461
    a=args[1]->val();
    b=args[2]->val();
    if (!args[1]->null_value && !args[2]->null_value)
      return (value >= a && value <= b) ? 1 : 0;
    if (args[1]->null_value && args[2]->null_value)
      null_value=1;
    else if (args[1]->null_value)
    {
      null_value= value <= b;			// not null if false range.
    }
    else
    {
      null_value= value >= a;
    }
  }
  return 0;
}

462 463 464 465
static Item_result item_store_type(Item_result a,Item_result b)
{
  if (a == STRING_RESULT || b == STRING_RESULT)
    return STRING_RESULT;
466
  if (a == REAL_RESULT || b == REAL_RESULT)
467
    return REAL_RESULT;
468
  return INT_RESULT;
469 470
}

bk@work.mysql.com's avatar
bk@work.mysql.com committed
471 472 473 474 475 476
void
Item_func_ifnull::fix_length_and_dec()
{
  maybe_null=args[1]->maybe_null;
  max_length=max(args[0]->max_length,args[1]->max_length);
  decimals=max(args[0]->decimals,args[1]->decimals);
477 478 479 480
  if ((cached_result_type=item_store_type(args[0]->result_type(),
					  args[1]->result_type())) !=
      REAL_RESULT)
    decimals= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
481 482
}

483

bk@work.mysql.com's avatar
bk@work.mysql.com committed
484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528
double
Item_func_ifnull::val()
{
  double value=args[0]->val();
  if (!args[0]->null_value)
  {
    null_value=0;
    return value;
  }
  value=args[1]->val();
  if ((null_value=args[1]->null_value))
    return 0.0;
  return value;
}

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

String *
Item_func_ifnull::val_str(String *str)
{
  String *res  =args[0]->val_str(str);
  if (!args[0]->null_value)
  {
    null_value=0;
    return res;
  }
  res=args[1]->val_str(str);
  if ((null_value=args[1]->null_value))
    return 0;
  return res;
}

529

bk@work.mysql.com's avatar
bk@work.mysql.com committed
530 531 532 533 534
void
Item_func_if::fix_length_and_dec()
{
  maybe_null=args[1]->maybe_null || args[2]->maybe_null;
  max_length=max(args[1]->max_length,args[2]->max_length);
535
  decimals=max(args[1]->decimals,args[2]->decimals);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
536 537
  enum Item_result arg1_type=args[1]->result_type();
  enum Item_result arg2_type=args[2]->result_type();
538 539
  bool null1=args[1]->const_item() && args[1]->null_value;
  bool null2=args[2]->const_item() && args[2]->null_value;
540 541 542 543

  if (null1)
  {
    cached_result_type= arg2_type;
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
544
    binary= args[2]->binary;
545 546 547
  }
  else if (null2)
  {
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
548 549
    cached_result_type= arg1_type;
    binary= args[1]->binary;
550 551
  }
  else if (arg1_type == STRING_RESULT || arg2_type == STRING_RESULT)
552
  {
bk@work.mysql.com's avatar
bk@work.mysql.com committed
553
    cached_result_type = STRING_RESULT;
554 555
    binary=args[1]->binary | args[2]->binary;
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
556
  else
557 558 559 560 561 562 563
  {
    binary=1;					// Number
    if (arg1_type == REAL_RESULT || arg2_type == REAL_RESULT)
      cached_result_type = REAL_RESULT;
    else
      cached_result_type=arg1_type;		// Should be INT_RESULT
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608
}


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

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

String *
Item_func_if::val_str(String *str)
{
  Item *arg= args[0]->val_int() ? args[1] : args[2];
  String *res=arg->val_str(str);
  null_value=arg->null_value;
  return res;
}


void
Item_func_nullif::fix_length_and_dec()
{
  Item_bool_func2::fix_length_and_dec();
  maybe_null=1;
  if (args[0])					// Only false if EOM
  {
    max_length=args[0]->max_length;
    decimals=args[0]->decimals;
    cached_result_type=args[0]->result_type();
  }
}

/*
609
  nullif () returns NULL if arguments are different, else it returns the
bk@work.mysql.com's avatar
bk@work.mysql.com committed
610 611 612 613 614 615 616 617 618
  first argument.
  Note that we have to evaluate the first argument twice as the compare
  may have been done with a different type than return value
*/

double
Item_func_nullif::val()
{
  double value;
619
  if (!(this->*cmp_func)())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
620 621 622 623 624 625 626 627 628 629 630 631 632
  {
    null_value=1;
    return 0.0;
  }
  value=args[0]->val();
  null_value=args[0]->null_value;
  return value;
}

longlong
Item_func_nullif::val_int()
{
  longlong value;
633
  if (!(this->*cmp_func)())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
634 635 636 637 638 639 640 641 642 643 644 645 646
  {
    null_value=1;
    return 0;
  }
  value=args[0]->val_int();
  null_value=args[0]->null_value;
  return value;
}

String *
Item_func_nullif::val_str(String *str)
{
  String *res;
647
  if (!(this->*cmp_func)())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
648 649 650 651 652 653 654 655 656 657
  {
    null_value=1;
    return 0;
  }
  res=args[0]->val_str(str);
  null_value=args[0]->null_value;
  return res;
}

/*
658 659
  CASE expression 
  Return the matching ITEM or NULL if all compares (including else) failed
bk@work.mysql.com's avatar
bk@work.mysql.com committed
660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 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
*/

Item *Item_func_case::find_item(String *str)
{
  String *first_expr_str,*tmp;
  longlong first_expr_int;
  double   first_expr_real;
  bool int_used, real_used,str_used;
  int_used=real_used=str_used=0;

  /* These will be initialized later */
  LINT_INIT(first_expr_str);
  LINT_INIT(first_expr_int);
  LINT_INIT(first_expr_real);

  // Compare every WHEN argument with it and return the first match
  for (uint i=0 ; i < arg_count ; i+=2)
  {
    if (!first_expr)
    {
      // No expression between CASE and first WHEN
      if (args[i]->val_int())
	return args[i+1];
      continue;
    }
    switch (args[i]->result_type()) {
    case STRING_RESULT:
      if (!str_used)
      {
	str_used=1;
	// We can't use 'str' here as this may be overwritten
	if (!(first_expr_str= first_expr->val_str(&str_value)))
	  return else_expr;			// Impossible
      }
      if ((tmp=args[i]->val_str(str)))		// If not null
      {
	if (first_expr->binary || args[i]->binary)
	{
	  if (stringcmp(tmp,first_expr_str)==0)
	    return args[i+1];
	}
	else if (sortcmp(tmp,first_expr_str)==0)
	  return args[i+1];
      }
      break;
    case INT_RESULT:
      if (!int_used)
      {
	int_used=1;
	first_expr_int= first_expr->val_int();
	if (first_expr->null_value)
	  return else_expr;
      }
      if (args[i]->val_int()==first_expr_int && !args[i]->null_value) 
        return args[i+1];
      break;
    case REAL_RESULT: 
      if (!real_used)
      {
	real_used=1;
	first_expr_real= first_expr->val();
	if (first_expr->null_value)
	  return else_expr;
      }
      if (args[i]->val()==first_expr_real && !args[i]->null_value) 
        return args[i+1];
    }
  }
  // No, WHEN clauses all missed, return ELSE expression
  return else_expr;
}



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

  if (!item)
  {
    null_value=1;
    return 0;
  }
744
  null_value= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
745
  if (!(res=item->val_str(str)))
746
    null_value= 1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793
  return res;
}


longlong Item_func_case::val_int()
{
  char buff[MAX_FIELD_WIDTH];
  String dummy_str(buff,sizeof(buff));
  Item *item=find_item(&dummy_str);
  longlong res;

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

double Item_func_case::val()
{
  char buff[MAX_FIELD_WIDTH];
  String dummy_str(buff,sizeof(buff));
  Item *item=find_item(&dummy_str);
  double res;

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


bool
Item_func_case::fix_fields(THD *thd,TABLE_LIST *tables)
{
  if (first_expr && first_expr->fix_fields(thd,tables) ||
      else_expr && else_expr->fix_fields(thd,tables))
    return 1;
  if (Item_func::fix_fields(thd,tables))
    return 1;
794 795 796 797
  if (first_expr)
  {
    used_tables_cache|=(first_expr)->used_tables();
    const_item_cache&= (first_expr)->const_item();
798
    with_sum_func= with_sum_func || (first_expr)->with_sum_func;
799 800 801 802 803
  }
  if (else_expr)
  {
    used_tables_cache|=(else_expr)->used_tables();
    const_item_cache&= (else_expr)->const_item();
804
    with_sum_func= with_sum_func || (else_expr)->with_sum_func;
805
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
806 807 808 809 810
  if (!else_expr || else_expr->maybe_null)
    maybe_null=1;				// The result may be NULL
  return 0;
}

811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836
void Item_func_case::split_sum_func(List<Item> &fields)
{
  if (first_expr)
  {
    if (first_expr->with_sum_func && first_expr->type() != SUM_FUNC_ITEM)
      first_expr->split_sum_func(fields);
    else if (first_expr->used_tables() || first_expr->type() == SUM_FUNC_ITEM)
    {
      fields.push_front(first_expr);
      first_expr= new Item_ref((Item**) fields.head_ref(), 0,
			       first_expr->name);
    }
  }
  if (else_expr)
  {
    if (else_expr->with_sum_func && else_expr->type() != SUM_FUNC_ITEM)
      else_expr->split_sum_func(fields);
    else if (else_expr->used_tables() || else_expr->type() == SUM_FUNC_ITEM)
    {
      fields.push_front(else_expr);
      else_expr= new Item_ref((Item**) fields.head_ref(), 0, else_expr->name);
    }
  }
  Item_func::split_sum_func(fields);
}

837 838 839 840 841 842 843 844 845 846 847 848 849 850 851
void Item_func_case::update_used_tables()
{
  Item_func::update_used_tables();
  if (first_expr)
  {
    used_tables_cache|=(first_expr)->used_tables();
    const_item_cache&= (first_expr)->const_item();
  }
  if (else_expr)
  {
    used_tables_cache|=(else_expr)->used_tables();
    const_item_cache&= (else_expr)->const_item();
  }
}

bk@work.mysql.com's avatar
bk@work.mysql.com committed
852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869

void Item_func_case::fix_length_and_dec()
{
  max_length=0;
  decimals=0;
  cached_result_type = args[1]->result_type();
  for (uint i=0 ; i < arg_count ; i+=2)
  {
    set_if_bigger(max_length,args[i+1]->max_length);
    set_if_bigger(decimals,args[i+1]->decimals);
  }
  if (else_expr != NULL) 
  {
    set_if_bigger(max_length,else_expr->max_length);
    set_if_bigger(decimals,else_expr->decimals);
  }
}

870
/* TODO:  Fix this so that it prints the whole CASE expression */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
871 872 873 874 875 876 877

void Item_func_case::print(String *str)
{
  str->append("case ");				// Not yet complete
}

/*
878
  Coalesce - return first not NULL argument.
bk@work.mysql.com's avatar
bk@work.mysql.com committed
879 880 881 882 883 884 885
*/

String *Item_func_coalesce::val_str(String *str)
{
  null_value=0;
  for (uint i=0 ; i < arg_count ; i++)
  {
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
886 887 888
    String *res;
    if ((res=args[i]->val_str(str)))
      return res;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933
  }
  null_value=1;
  return 0;
}

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

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


void Item_func_coalesce::fix_length_and_dec()
{
  max_length=0;
  decimals=0;
  cached_result_type = args[0]->result_type();
  for (uint i=0 ; i < arg_count ; i++)
  {
    set_if_bigger(max_length,args[i]->max_length);
    set_if_bigger(decimals,args[i]->decimals);
  }
}

/****************************************************************************
934
 Classes and function for the IN operator
bk@work.mysql.com's avatar
bk@work.mysql.com committed
935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006
****************************************************************************/

static int cmp_longlong(longlong *a,longlong *b)
{
  return *a < *b ? -1 : *a == *b ? 0 : 1;
}

static int cmp_double(double *a,double *b)
{
  return *a < *b ? -1 : *a == *b ? 0 : 1;
}

int in_vector::find(Item *item)
{
  byte *result=get_value(item);
  if (!result || !used_count)
    return 0;				// Null value

  uint start,end;
  start=0; end=used_count-1;
  while (start != end)
  {
    uint mid=(start+end+1)/2;
    int res;
    if ((res=(*compare)(base+mid*size,result)) == 0)
      return 1;
    if (res < 0)
      start=mid;
    else
      end=mid-1;
  }
  return (int) ((*compare)(base+start*size,result) == 0);
}


in_string::in_string(uint elements,qsort_cmp cmp_func)
  :in_vector(elements,sizeof(String),cmp_func),tmp(buff,sizeof(buff))
{}

in_string::~in_string()
{
  for (uint i=0 ; i < count ; i++)
    ((String*) base)[i].free();
}

void in_string::set(uint pos,Item *item)
{
  String *str=((String*) base)+pos;
  String *res=item->val_str(str);
  if (res && res != str)
    *str= *res;
}

byte *in_string::get_value(Item *item)
{
  return (byte*) item->val_str(&tmp);
}


in_longlong::in_longlong(uint elements)
  :in_vector(elements,sizeof(longlong),(qsort_cmp) cmp_longlong)
{}

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

byte *in_longlong::get_value(Item *item)
{
  tmp=item->val_int();
  if (item->null_value)
1007
    return 0;					/* purecov: inspected */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024
  return (byte*) &tmp;
}


in_double::in_double(uint elements)
  :in_vector(elements,sizeof(double),(qsort_cmp) cmp_double)
{}

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

byte *in_double::get_value(Item *item)
{
  tmp=item->val();
  if (item->null_value)
1025
    return 0;					/* purecov: inspected */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047
  return (byte*) &tmp;
}


void Item_func_in::fix_length_and_dec()
{
  if (const_item())
  {
    switch (item->result_type()) {
    case STRING_RESULT:
      if (item->binary)
	array=new in_string(arg_count,(qsort_cmp) stringcmp); /* purecov: inspected */
      else
	array=new in_string(arg_count,(qsort_cmp) sortcmp);
      break;
    case INT_RESULT:
      array= new in_longlong(arg_count);
      break;
    case REAL_RESULT:
      array= new in_double(arg_count);
      break;
    }
1048
    if (array && !(current_thd->fatal_error))		// If not EOM
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1049
    {
1050 1051 1052 1053 1054 1055 1056 1057 1058
      uint j=0;
      for (uint i=0 ; i < arg_count ; i++)
      {
	array->set(j,args[i]);
	if (!args[i]->null_value)			// Skip NULL values
	  j++;
      }
      if ((array->used_count=j))
	array->sort();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079
    }
  }
  else
  {
    switch (item->result_type()) {
    case STRING_RESULT:
      if (item->binary)
	in_item= new cmp_item_binary_string;
      else
	in_item= new cmp_item_sort_string;
      break;
    case INT_RESULT:
      in_item=	  new cmp_item_int;
      break;
    case REAL_RESULT:
      in_item=	  new cmp_item_real;
      break;
    }
  }
  maybe_null= item->maybe_null;
  max_length=2;
1080 1081 1082
  used_tables_cache|=     item->used_tables();
  not_null_tables_cache&= item->not_null_tables();
  const_item_cache&=      item->const_item();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122
}


void Item_func_in::print(String *str)
{
  str->append('(');
  item->print(str);
  Item_func::print(str);
  str->append(')');
}


longlong Item_func_in::val_int()
{
  if (array)
  {
    int tmp=array->find(item);
    null_value=item->null_value;
    return tmp;
  }
  in_item->store_value(item);
  if ((null_value=item->null_value))
    return 0;
  for (uint i=0 ; i < arg_count ; i++)
  {
    if (!in_item->cmp(args[i]) && !args[i]->null_value)
      return 1;					// Would maybe be nice with i ?
  }
  return 0;
}


void Item_func_in::update_used_tables()
{
  Item_func::update_used_tables();
  item->update_used_tables();
  used_tables_cache|=item->used_tables();
  const_item_cache&=item->const_item();
}

1123 1124
void Item_func_in::split_sum_func(List<Item> &fields)
{
1125 1126 1127
  if (item->with_sum_func && item->type() != SUM_FUNC_ITEM)
    item->split_sum_func(fields);
  else if (item->used_tables() || item->type() == SUM_FUNC_ITEM)
1128 1129
  {
    fields.push_front(item);
1130
    item= new Item_ref((Item**) fields.head_ref(), 0, item->name);
1131
  }  
1132
  Item_func::split_sum_func(fields);
1133
}
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178


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


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


bool
Item_cond::fix_fields(THD *thd,TABLE_LIST *tables)
{
  List_iterator<Item> li(list);
  Item *item;
1179
#ifndef EMBEDDED_LIBRARY			// Avoid compiler warning
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1180
  char buff[sizeof(char*)];			// Max local vars in function
1181 1182
#endif

1183 1184
  not_null_tables_cache= used_tables_cache= 0;
  const_item_cache= 0;
1185 1186 1187 1188 1189
  /*
    and_table_cache is the value that Item_cond_or() returns for
    not_null_tables()
  */
  and_tables_cache= ~(table_map) 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1190 1191

  if (thd && check_stack_overrun(thd,buff))
1192
    return 1;					// Fatal error flag is set!
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1193 1194
  while ((item=li++))
  {
1195
    table_map tmp_table_map;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1196 1197 1198
    while (item->type() == Item::COND_ITEM &&
	   ((Item_cond*) item)->functype() == functype())
    {						// Identical function
1199

bk@work.mysql.com's avatar
bk@work.mysql.com committed
1200 1201 1202 1203 1204 1205 1206
      li.replace(((Item_cond*) item)->list);
      ((Item_cond*) item)->list.empty();
#ifdef DELETE_ITEMS
      delete (Item_cond*) item;
#endif
      item= *li.ref();				// new current item
    }
1207 1208
    if (abort_on_null)
      item->top_level_item();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1209 1210
    if (item->fix_fields(thd,tables))
      return 1; /* purecov: inspected */
1211 1212 1213 1214 1215 1216
    used_tables_cache|=     item->used_tables();
    tmp_table_map=	    item->not_null_tables();
    not_null_tables_cache|= tmp_table_map;
    and_tables_cache&=      tmp_table_map;
    const_item_cache&=	    item->const_item();
    with_sum_func=	    with_sum_func || item->with_sum_func;
1217 1218
    if (item->maybe_null)
      maybe_null=1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254
  }
  if (thd)
    thd->cond_count+=list.elements;
  fix_length_and_dec();
  return 0;
}


void Item_cond::split_sum_func(List<Item> &fields)
{
  List_iterator<Item> li(list);
  Item *item;
  used_tables_cache=0;
  const_item_cache=0;
  while ((item=li++))
  {
    if (item->with_sum_func && item->type() != SUM_FUNC_ITEM)
      item->split_sum_func(fields);
    else if (item->used_tables() || item->type() == SUM_FUNC_ITEM)
    {
      fields.push_front(item);
      li.replace(new Item_ref((Item**) fields.head_ref(),0,item->name));
    }
    item->update_used_tables();
    used_tables_cache|=item->used_tables();
    const_item_cache&=item->const_item();
  }
}


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

1255

bk@work.mysql.com's avatar
bk@work.mysql.com committed
1256 1257
void Item_cond::update_used_tables()
{
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
1258
  List_iterator_fast<Item> li(list);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1259
  Item *item;
1260 1261 1262

  used_tables_cache=0;
  const_item_cache=1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1263 1264 1265
  while ((item=li++))
  {
    item->update_used_tables();
1266 1267
    used_tables_cache|= item->used_tables();
    const_item_cache&=  item->const_item();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1268 1269 1270 1271 1272 1273 1274
  }
}


void Item_cond::print(String *str)
{
  str->append('(');
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
1275
  List_iterator_fast<Item> li(list);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288
  Item *item;
  if ((item=li++))
    item->print(str);
  while ((item=li++))
  {
    str->append(' ');
    str->append(func_name());
    str->append(' ');
    item->print(str);
  }
  str->append(')');
}

1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305
/*
  Evalution of AND(expr, expr, expr ...)

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

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

bk@work.mysql.com's avatar
bk@work.mysql.com committed
1306 1307 1308

longlong Item_cond_and::val_int()
{
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
1309
  List_iterator_fast<Item> li(list);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1310
  Item *item;
1311
  null_value= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1312 1313 1314 1315
  while ((item=li++))
  {
    if (item->val_int() == 0)
    {
1316 1317
      if (abort_on_null || !(null_value= item->null_value))
	return 0;				// return FALSE
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1318 1319
    }
  }
1320
  return null_value ? 0 : 1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1321 1322
}

1323

bk@work.mysql.com's avatar
bk@work.mysql.com committed
1324 1325
longlong Item_cond_or::val_int()
{
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
1326
  List_iterator_fast<Item> li(list);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341
  Item *item;
  null_value=0;
  while ((item=li++))
  {
    if (item->val_int() != 0)
    {
      null_value=0;
      return 1;
    }
    if (item->null_value)
      null_value=1;
  }
  return 0;
}

1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365
/*
  Create an AND expression from two expressions

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

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

  RETURN
    NULL	Error
    Item
*/

Item *and_expressions(Item *a, Item *b, Item **org_item)
{
  if (!a)
1366
    return (*org_item= (Item*) b);
1367 1368 1369
  if (a == *org_item)
  {
    Item_cond *res;
1370
    if ((res= new Item_cond_and(a, (Item*) b)))
1371
    {
1372
      res->used_tables_cache= a->used_tables() | b->used_tables();
1373 1374
      res->not_null_tables_cache= a->not_null_tables() | b->not_null_tables();
    }
1375 1376
    return res;
  }
1377
  if (((Item_cond_and*) a)->add((Item*) b))
1378 1379
    return 0;
  ((Item_cond_and*) a)->used_tables_cache|= b->used_tables();
1380
  ((Item_cond_and*) a)->not_null_tables_cache|= b->not_null_tables();
1381 1382 1383 1384
  return a;
}


bk@work.mysql.com's avatar
bk@work.mysql.com committed
1385 1386
longlong Item_func_isnull::val_int()
{
1387 1388 1389 1390 1391
  /*
    Handle optimization if the argument can't be null
    This has to be here because of the test in update_used_tables().
  */
  if (!used_tables_cache)
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
1392
    return cached_value;
1393
  return args[0]->is_null() ? 1: 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1394 1395 1396 1397
}

longlong Item_func_isnotnull::val_int()
{
1398
  return args[0]->is_null() ? 0 : 1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409
}


void Item_func_like::fix_length_and_dec()
{
  decimals=0; max_length=1;
  //  cmp_type=STRING_RESULT;			// For quick select
}

longlong Item_func_like::val_int()
{
1410
  String* res = args[0]->val_str(&tmp_value1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1411 1412 1413 1414 1415
  if (args[0]->null_value)
  {
    null_value=1;
    return 0;
  }
1416
  String* res2 = args[1]->val_str(&tmp_value2);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1417 1418 1419 1420 1421 1422
  if (args[1]->null_value)
  {
    null_value=1;
    return 0;
  }
  null_value=0;
1423 1424
  if (canDoTurboBM)
    return turboBM_matches(res->ptr(), res->length()) ? 1 : 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435
  if (binary)
    return wild_compare(*res,*res2,escape) ? 0 : 1;
  else
    return wild_case_compare(*res,*res2,escape) ? 0 : 1;
}


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

Item_func::optimize_type Item_func_like::select_optimize() const
{
1436
  if (args[1]->const_item())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1437
  {
1438 1439 1440 1441 1442 1443
    String* res2= args[1]->val_str((String *)&tmp_value2);

    if (!res2)
      return OPTIMIZE_NONE;

    if (*res2->ptr() != wild_many)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1444
    {
1445
      if (args[0]->result_type() != STRING_RESULT || *res2->ptr() != wild_one)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1446 1447 1448 1449 1450 1451
	return OPTIMIZE_OP;
    }
  }
  return OPTIMIZE_NONE;
}

1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463
bool Item_func_like::fix_fields(THD *thd,struct st_table_list *tlist)
{
  if (Item_bool_func2::fix_fields(thd, tlist))
    return 1;

  /*
    TODO--we could do it for non-const, but we'd have to
    recompute the tables for each row--probably not worth it.
  */
  if (args[1]->const_item() && !(specialflag & SPECIAL_NO_NEW_FUNC))
  {
    String* res2 = args[1]->val_str(&tmp_value2);
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
1464 1465 1466
    if (!res2)
      return 0;					// Null argument

1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479
    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;
1480
      for (; *tmp != wild_many && *tmp != wild_one && *tmp != escape; tmp++) ;
bar@bar.mysql.r18.ru's avatar
bar@bar.mysql.r18.ru committed
1481 1482 1483
#ifdef USE_MB
      canDoTurboBM = (tmp == last) && !use_mb(default_charset_info);
#else
1484
      canDoTurboBM = tmp == last;
bar@bar.mysql.r18.ru's avatar
bar@bar.mysql.r18.ru committed
1485
#endif
1486 1487 1488 1489 1490 1491
    }

    if (canDoTurboBM)
    {
      pattern     = first + 1;
      pattern_len = len - 2;
1492 1493 1494 1495 1496
      DBUG_PRINT("info", ("Initializing pattern: '%s'", first));
      int *suff = (int*) thd->alloc(sizeof(int)*((pattern_len + 1)*2+
						 alphabet_size));
      bmGs      = suff + pattern_len + 1;
      bmBc      = bmGs + pattern_len + 1;
1497 1498
      turboBM_compute_good_suffix_shifts(suff);
      turboBM_compute_bad_character_shifts();
1499
      DBUG_PRINT("info",("done"));
1500 1501 1502 1503 1504
    }
  }
  return 0;
}

bk@work.mysql.com's avatar
bk@work.mysql.com committed
1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515
#ifdef USE_REGEX

bool
Item_func_regex::fix_fields(THD *thd,TABLE_LIST *tables)
{
  if (args[0]->fix_fields(thd,tables) || args[1]->fix_fields(thd,tables))
    return 1;					/* purecov: inspected */
  with_sum_func=args[0]->with_sum_func || args[1]->with_sum_func;
  max_length=1; decimals=0;
  binary=args[0]->binary || args[1]->binary;
  used_tables_cache=args[0]->used_tables() | args[1]->used_tables();
1516 1517
  not_null_tables_cache= (args[0]->not_null_tables() |
			  args[1]->not_null_tables());
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 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 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601
  const_item_cache=args[0]->const_item() && args[1]->const_item();
  if (!regex_compiled && args[1]->const_item())
  {
    char buff[MAX_FIELD_WIDTH];
    String tmp(buff,sizeof(buff));
    String *res=args[1]->val_str(&tmp);
    if (args[1]->null_value)
    {						// Will always return NULL
      maybe_null=1;
      return 0;
    }
    int error;
    if ((error=regcomp(&preg,res->c_ptr(),
		       binary ? REG_EXTENDED | REG_NOSUB :
		       REG_EXTENDED | REG_NOSUB | REG_ICASE)))
    {
      (void) regerror(error,&preg,buff,sizeof(buff));
      my_printf_error(ER_REGEXP_ERROR,ER(ER_REGEXP_ERROR),MYF(0),buff);
      return 1;
    }
    regex_compiled=regex_is_const=1;
    maybe_null=args[0]->maybe_null;
  }
  else
    maybe_null=1;
  return 0;
}

longlong Item_func_regex::val_int()
{
  char buff[MAX_FIELD_WIDTH];
  String *res, tmp(buff,sizeof(buff));

  res=args[0]->val_str(&tmp);
  if (args[0]->null_value)
  {
    null_value=1;
    return 0;
  }
  if (!regex_is_const)
  {
    char buff2[MAX_FIELD_WIDTH];
    String *res2, tmp2(buff2,sizeof(buff2));

    res2= args[1]->val_str(&tmp2);
    if (args[1]->null_value)
    {
      null_value=1;
      return 0;
    }
    if (!regex_compiled || stringcmp(res2,&prev_regexp))
    {
      prev_regexp.copy(*res2);
      if (regex_compiled)
      {
	regfree(&preg);
	regex_compiled=0;
      }
      if (regcomp(&preg,res2->c_ptr(),
		  binary ? REG_EXTENDED | REG_NOSUB :
		  REG_EXTENDED | REG_NOSUB | REG_ICASE))

      {
	null_value=1;
	return 0;
      }
      regex_compiled=1;
    }
  }
  null_value=0;
  return regexec(&preg,res->c_ptr(),0,(regmatch_t*) 0,0) ? 0 : 1;
}


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

#endif /* USE_REGEX */
1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615


#ifdef LIKE_CMP_TOUPPER
#define likeconv(A) (uchar) toupper(A)
#else
#define likeconv(A) (uchar) my_sort_order[(uchar) (A)]
#endif


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

1616
void Item_func_like::turboBM_compute_suffixes(int *suff)
1617 1618 1619 1620
{
  const int   plm1 = pattern_len - 1;
  int            f = 0;
  int            g = plm1;
1621
  int *const splm1 = suff + plm1;
1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656

  *splm1 = pattern_len;

  if (binary)
  {
    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;
1657 1658
	while (g >= 0 &&
	       likeconv(pattern[g]) == likeconv(pattern[g + plm1 - f]))
1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671
	  g--;
	suff[i] = f - g;
      }
    }
  }
}


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

1672
void Item_func_like::turboBM_compute_good_suffix_shifts(int *suff)
1673 1674 1675
{
  turboBM_compute_suffixes(suff);

1676 1677
  int *end = bmGs + pattern_len;
  int *k;
1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690
  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++)
      {
1691
	int *tmp2 = bmGs + j;
1692 1693 1694 1695 1696 1697
	if (*tmp2 == pattern_len)
	  *tmp2 = tmp;
      }
    }
  }

1698
  int *tmp2;
1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718
  for (tmp = plm1 - i; j < tmp; j++)
  {
    tmp2 = bmGs + j;
    if (*tmp2 == pattern_len)
      *tmp2 = tmp;
  }

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


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

void Item_func_like::turboBM_compute_bad_character_shifts()
{
1719 1720
  int *i;
  int *end = bmBc + alphabet_size;
1721 1722 1723 1724 1725 1726
  for (i = bmBc; i < end; i++)
    *i = pattern_len;

  int j;
  const int plm1 = pattern_len - 1;
  if (binary)
1727
  {
1728
    for (j = 0; j < plm1; j++)
1729 1730
      bmBc[(uint) (uchar) pattern[j]] = plm1 - j;
  }
1731
  else
1732
  {
1733
    for (j = 0; j < plm1; j++)
1734 1735
      bmBc[(uint) likeconv(pattern[j])] = plm1 - j;
  }
1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751
}


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

bool Item_func_like::turboBM_matches(const char* text, int text_len) const
{
  register int bcShift;
  register int turboShift;
  int shift = pattern_len;
  int j     = 0;
  int u     = 0;

1752 1753
  const int plm1=  pattern_len - 1;
  const int tlmpl= text_len - pattern_len;
1754 1755 1756 1757 1758 1759

  /* Searching */
  if (binary)
  {
    while (j <= tlmpl)
    {
1760
      register int i= plm1;
1761 1762 1763 1764
      while (i >= 0 && pattern[i] == text[i + j])
      {
	i--;
	if (i == plm1 - shift)
1765
	  i-= u;
1766 1767
      }
      if (i < 0)
1768
	return 1;
1769 1770 1771

      register const int v = plm1 - i;
      turboShift = u - v;
1772
      bcShift    = bmBc[(uint) (uchar) text[i + j]] - plm1 + i;
1773 1774 1775 1776 1777 1778 1779 1780 1781 1782
      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;
      }
1783
      j+= shift;
1784
    }
1785
    return 0;
1786 1787 1788 1789 1790 1791 1792 1793 1794 1795
  }
  else
  {
    while (j <= tlmpl)
    {
      register int i = plm1;
      while (i >= 0 && likeconv(pattern[i]) == likeconv(text[i + j]))
      {
	i--;
	if (i == plm1 - shift)
1796
	  i-= u;
1797 1798
      }
      if (i < 0)
1799
	return 1;
1800 1801 1802

      register const int v = plm1 - i;
      turboShift = u - v;
1803
      bcShift    = bmBc[(uint) likeconv(text[i + j])] - plm1 + i;
1804 1805 1806 1807 1808 1809 1810 1811 1812 1813
      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;
      }
1814
      j+= shift;
1815
    }
1816
    return 0;
1817 1818
  }
}
1819

1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840

/*
  Make a logical XOR of the arguments.

  SYNOPSIS
    val_int()

  DESCRIPTION
  If either operator is NULL, return NULL.

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

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

1841 1842 1843 1844 1845
longlong Item_cond_xor::val_int()
{
  List_iterator<Item> li(list);
  Item *item;
  int result=0;	
1846
  null_value=0;
1847 1848
  while ((item=li++))
  {
1849 1850 1851 1852 1853 1854
    result^= (item->val_int() != 0);
    if (item->null_value)
    {
      null_value=1;
      return 0;
    }
1855
  }
1856
  return (longlong) result;
1857
}