#ifndef ITEM_CMPFUNC_INCLUDED
#define ITEM_CMPFUNC_INCLUDED

/* Copyright (c) 2000, 2013, Oracle and/or its affiliates. All rights reserved.

 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; version 2 of the License.

 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.

 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., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */


/* compare and test functions */

#include "thr_malloc.h" /* sql_calloc */
#include "item_func.h" /* Item_int_func, Item_bool_func */
#include "my_regex.h"

extern Item_result item_cmp_type(Item_result a,Item_result b);
class Item_bool_func2;
class Arg_comparator;

typedef int (Arg_comparator::*arg_cmp_func)();

typedef int (*Item_field_cmpfunc)(Item_field *f1, Item_field *f2, void *arg); 

class Arg_comparator: public Sql_alloc
{
 Item **a, **b;
 arg_cmp_func func;
 Item_result_field *owner;
 Arg_comparator *comparators; // used only for compare_row()
 double precision;
 /* Fields used in DATE/DATETIME comparison. */
 THD *thd;
 enum_field_types a_type, b_type; // Types of a and b items
 Item *a_cache, *b_cache; // Cached values of a and b items
 bool is_nulls_eq; // TRUE <=> compare for the EQUAL_FUNC
 bool set_null; // TRUE <=> set owner->null_value
 // when one of arguments is NULL.
 longlong (*get_value_a_func)(THD *thd, Item ***item_arg, Item **cache_arg,
 Item *warn_item, bool *is_null);
 longlong (*get_value_b_func)(THD *thd, Item ***item_arg, Item **cache_arg,
 Item *warn_item, bool *is_null);
 bool try_year_cmp_func(Item_result type);
 static bool get_date_from_const(Item *date_arg, Item *str_arg,
 ulonglong *value);
public:
 DTCollation cmp_collation;
 /* Allow owner function to use string buffers. */
 String value1, value2;

 Arg_comparator(): comparators(0), thd(0), a_cache(0), b_cache(0), set_null(TRUE),
 get_value_a_func(0), get_value_b_func(0) {};
 Arg_comparator(Item **a1, Item **a2): a(a1), b(a2), comparators(0), thd(0),
 a_cache(0), b_cache(0), set_null(TRUE),
 get_value_a_func(0), get_value_b_func(0) {};

 int set_compare_func(Item_result_field *owner, Item_result type);
 inline int set_compare_func(Item_result_field *owner_arg)
 {
 return set_compare_func(owner_arg, item_cmp_type((*a)->result_type(),
 (*b)->result_type()));
 }
 inline int compare() { return (this->*func)(); }

 int compare_string();		 // compare args[0] & args[1]
 int compare_binary_string();	 // compare args[0] & args[1]
 int compare_real(); // compare args[0] & args[1]
 int compare_decimal(); // compare args[0] & args[1]
 int compare_int_signed(); // compare args[0] & args[1]
 int compare_int_signed_unsigned();
 int compare_int_unsigned_signed();
 int compare_int_unsigned();
 int compare_row(); // compare args[0] & args[1]
 int compare_e_string();	 // compare args[0] & args[1]
 int compare_e_binary_string(); // compare args[0] & args[1]
 int compare_e_real(); // compare args[0] & args[1]
 int compare_e_decimal(); // compare args[0] & args[1]
 int compare_e_int(); // compare args[0] & args[1]
 int compare_e_int_diff_signedness();
 int compare_e_row(); // compare args[0] & args[1]
 int compare_real_fixed();
 int compare_e_real_fixed();
 int compare_datetime(); // compare args[0] & args[1] as DATETIMEs

 static bool can_compare_as_dates(Item *a, Item *b, ulonglong *const_val_arg);

 Item** cache_converted_constant(THD *thd, Item **value, Item **cache,
 Item_result type);
 void set_datetime_cmp_func(Item_result_field *owner_arg, Item **a1, Item **b1);
 static arg_cmp_func comparator_matrix [5][2];
 inline bool is_owner_equal_func()
 {
 return (owner->type() == Item::FUNC_ITEM &&
 ((Item_func*)owner)->functype() == Item_func::EQUAL_FUNC);
 }
 friend class Item_func;
};

class Item_bool_func :public Item_int_func
{
public:
 Item_bool_func() : Item_int_func(), m_created_by_in2exists(false) {}
 Item_bool_func(Item *a) : Item_int_func(a),
 m_created_by_in2exists(false) {}
 Item_bool_func(Item *a,Item *b) : Item_int_func(a,b),
 m_created_by_in2exists(false) {}
 Item_bool_func(THD *thd, Item_bool_func *item) : Item_int_func(thd, item),
 m_created_by_in2exists(item->m_created_by_in2exists) {}
 bool is_bool_func() { return 1; }
 uint decimal_precision() const { return 1; }
 virtual bool created_by_in2exists() const { return m_created_by_in2exists; }
 void set_created_by_in2exists() { m_created_by_in2exists= true; }
private:
 /**
 True <=> this item was added by IN->EXISTS subquery transformation, and
 should thus be deleted if we switch to materialization.
 */
 bool m_created_by_in2exists;
};


/**
 Abstract Item class, to represent <code>X IS [NOT] (TRUE | FALSE)</code>
 boolean predicates.
*/

class Item_func_truth : public Item_bool_func
{
public:
 virtual bool val_bool() {return false;}
 virtual longlong val_int() {return 0;}
 virtual void print(String *str, enum_query_type query_type);

protected:
 Item_func_truth(Item *a, bool a_value, bool a_affirmative)
 : Item_bool_func(a), value(a_value), affirmative(a_affirmative)
 {}

 ~Item_func_truth()
 {}
private:
 /**
 True for <code>X IS [NOT] TRUE</code>,
 false for <code>X IS [NOT] FALSE</code> predicates.
 */
 const bool value;
 /**
 True for <code>X IS Y</code>, false for <code>X IS NOT Y</code> predicates.
 */
 const bool affirmative;
};


/**
 This Item represents a <code>X IS TRUE</code> boolean predicate.
*/

class Item_func_istrue : public Item_func_truth
{
public:
 Item_func_istrue(Item *a) : Item_func_truth(a, true, true) {}
 ~Item_func_istrue() {}
 virtual const char* func_name() const { return "istrue"; }
};


/**
 This Item represents a <code>X IS NOT TRUE</code> boolean predicate.
*/

class Item_func_isnottrue : public Item_func_truth
{
public:
 Item_func_isnottrue(Item *a) : Item_func_truth(a, true, false) {}
 ~Item_func_isnottrue() {}
 virtual const char* func_name() const { return "isnottrue"; }
};


/**
 This Item represents a <code>X IS FALSE</code> boolean predicate.
*/

class Item_func_isfalse : public Item_func_truth
{
public:
 Item_func_isfalse(Item *a) : Item_func_truth(a, false, true) {}
 ~Item_func_isfalse() {}
 virtual const char* func_name() const { return "isfalse"; }
};


/**
 This Item represents a <code>X IS NOT FALSE</code> boolean predicate.
*/

class Item_func_isnotfalse : public Item_func_truth
{
public:
 Item_func_isnotfalse(Item *a) : Item_func_truth(a, false, false) {}
 ~Item_func_isnotfalse() {}
 virtual const char* func_name() const { return "isnotfalse"; }
};

/* Functions used by HAVING for rewriting IN subquery */

class Item_in_subselect;

#define UNKNOWN ((my_bool)-1)


/*
 Item_in_optimizer(left_expr, Item_in_subselect(...))

 Item_in_optimizer is used to wrap an instance of Item_in_subselect. This
 class does the following:
 - Evaluate the left expression and store it in Item_cache_* object (to
 avoid re-evaluating it many times during subquery execution)
 - Shortcut the evaluation of "NULL IN (...)" to NULL in the cases where we
 don't care if the result is NULL or FALSE.

 args[1] keeps a reference to the Item_in_subselect object.

 args[0] is a copy of Item_in_subselect's left expression and should be
 kept equal also after resolving.

 NOTE
 It is not quite clear why the above listed functionality should be
 placed into a separate class called 'Item_in_optimizer'.
*/

class Item_in_optimizer: public Item_bool_func
{
private:
 /* 
 Stores the value of "NULL IN (SELECT ...)" for uncorrelated subqueries:
 UNKNOWN - "NULL in (SELECT ...)" has not yet been evaluated
 FALSE - result is FALSE
 TRUE - result is NULL
 */
 my_bool result_for_null_param;
public:
 Item_in_optimizer(Item *a, Item_in_subselect *b):
 Item_bool_func(a, reinterpret_cast<Item *>(b)), result_for_null_param(UNKNOWN)
 { with_subselect= TRUE; }
 bool is_null();
 longlong val_int();
 const char *func_name() const { return "<in_optimizer>"; }
 void keep_top_level_cache();
};

class Comp_creator
{
public:
 Comp_creator() {} /* Remove gcc warning */
 virtual ~Comp_creator() {} /* Remove gcc warning */
 virtual Item_bool_func2* create(Item *a, Item *b) const = 0;
 virtual const char* symbol(bool invert) const = 0;
 virtual bool eqne_op() const = 0;
 virtual bool l_op() const = 0;
};

class Eq_creator :public Comp_creator
{
public:
 Eq_creator() {} /* Remove gcc warning */
 virtual ~Eq_creator() {} /* Remove gcc warning */
 virtual Item_bool_func2* create(Item *a, Item *b) const;
 virtual const char* symbol(bool invert) const { return invert? "<>" : "="; }
 virtual bool eqne_op() const { return 1; }
 virtual bool l_op() const { return 0; }
};

class Ne_creator :public Comp_creator
{
public:
 Ne_creator() {} /* Remove gcc warning */
 virtual ~Ne_creator() {} /* Remove gcc warning */
 virtual Item_bool_func2* create(Item *a, Item *b) const;
 virtual const char* symbol(bool invert) const { return invert? "=" : "<>"; }
 virtual bool eqne_op() const { return 1; }
 virtual bool l_op() const { return 0; }
};

class Gt_creator :public Comp_creator
{
public:
 Gt_creator() {} /* Remove gcc warning */
 virtual ~Gt_creator() {} /* Remove gcc warning */
 virtual Item_bool_func2* create(Item *a, Item *b) const;
 virtual const char* symbol(bool invert) const { return invert? "<=" : ">"; }
 virtual bool eqne_op() const { return 0; }
 virtual bool l_op() const { return 0; }
};

class Lt_creator :public Comp_creator
{
public:
 Lt_creator() {} /* Remove gcc warning */
 virtual ~Lt_creator() {} /* Remove gcc warning */
 virtual Item_bool_func2* create(Item *a, Item *b) const;
 virtual const char* symbol(bool invert) const { return invert? ">=" : "<"; }
 virtual bool eqne_op() const { return 0; }
 virtual bool l_op() const { return 1; }
};

class Ge_creator :public Comp_creator
{
public:
 Ge_creator() {} /* Remove gcc warning */
 virtual ~Ge_creator() {} /* Remove gcc warning */
 virtual Item_bool_func2* create(Item *a, Item *b) const;
 virtual const char* symbol(bool invert) const { return invert? "<" : ">="; }
 virtual bool eqne_op() const { return 0; }
 virtual bool l_op() const { return 0; }
};

class Le_creator :public Comp_creator
{
public:
 Le_creator() {} /* Remove gcc warning */
 virtual ~Le_creator() {} /* Remove gcc warning */
 virtual Item_bool_func2* create(Item *a, Item *b) const;
 virtual const char* symbol(bool invert) const { return invert? ">" : "<="; }
 virtual bool eqne_op() const { return 0; }
 virtual bool l_op() const { return 1; }
};

class Item_bool_func2 :public Item_bool_func
{						/* Bool with 2 string args */
private:
 bool convert_constant_arg(THD *thd, Item *field, Item **item);
protected:
 Arg_comparator cmp;
 bool abort_on_null;

public:
 Item_bool_func2(Item *a,Item *b)
 :Item_bool_func(a,b), cmp(tmp_arg, tmp_arg+1), abort_on_null(FALSE) {}

 optimize_type select_optimize() const { return OPTIMIZE_OP; }
 virtual enum Functype rev_functype() const { return UNKNOWN_FUNC; }
 bool have_rev_func() const { return rev_functype() != UNKNOWN_FUNC; }

 virtual inline void print(String *str, enum_query_type query_type)
 {
 Item_func::print_op(str, query_type);
 }
 const CHARSET_INFO *compare_collation()
 { return cmp.cmp_collation.collation; }
 void top_level_item() { abort_on_null= TRUE; }

 friend class Arg_comparator;
};

class Item_bool_rowready_func2 :public Item_bool_func2
{
public:
 Item_bool_rowready_func2(Item *a, Item *b) :Item_bool_func2(a, b)
 {
 allowed_arg_cols= 0; // Fetch this value from first argument
 }
 Item *neg_transformer(THD *thd);
 virtual Item *negated_item();
 virtual longlong val_int() {return 0;}
 bool subst_argument_checker(uchar **arg) { return TRUE; }
};

/**
 XOR inherits from Item_bool_func2 because it is not optimized yet.
 Later, when XOR is optimized, it needs to inherit from
 Item_cond instead. See WL#5800. 
*/
class Item_func_xor :public Item_bool_func2
{
public:
 Item_func_xor(Item *i1, Item *i2) :Item_bool_func2(i1, i2) {}
 enum Functype functype() const { return XOR_FUNC; }
 const char *func_name() const { return "xor"; }
 longlong val_int() {return 0;}
 Item *neg_transformer(THD *thd);
};

class Item_func_not :public Item_bool_func
{
public:
 Item_func_not(Item *a) :Item_bool_func(a) {}
 longlong val_int() {return 0;}
 enum Functype functype() const { return NOT_FUNC; }
 const char *func_name() const { return "not"; }
 Item *neg_transformer(THD *thd);
 virtual void print(String *str, enum_query_type query_type);
};

class Item_maxmin_subselect;
struct st_join_table;
/*
 trigcond<param>(arg) ::= param? arg : TRUE

 The class Item_func_trig_cond is used for guarded predicates 
 which are employed only for internal purposes.
 A guarded predicate is an object consisting of an a regular or
 a guarded predicate P and a pointer to a boolean guard variable g. 
 A guarded predicate P/g is evaluated to true if the value of the
 guard g is false, otherwise it is evaluated to the same value that
 the predicate P: val(P/g)= g ? val(P):true.
 Guarded predicates allow us to include predicates into a conjunction
 conditionally. Currently they are utilized for pushed down predicates
 in queries with outer join operations.

 In the future, probably, it makes sense to extend this class to
 the objects consisting of three elements: a predicate P, a pointer
 to a variable g and a firing value s with following evaluation
 rule: val(P/g,s)= g==s? val(P) : true. It will allow us to build only
 one item for the objects of the form P/g1/g2... 

 Objects of this class are built only for query execution after
 the execution plan has been already selected. That's why this
 class needs only val_int out of generic methods. 

 Current uses of Item_func_trig_cond objects:
 - To wrap selection conditions when executing outer joins
 - To wrap condition that is pushed down into subquery
*/

class Item_func_trig_cond: public Item_bool_func
{
public:
 enum enum_trig_type
 {
 /**
 In t1 LEFT JOIN t2, ON can be tested on t2's row only if that row is
 not NULL-complemented
 */
 IS_NOT_NULL_COMPL,
 /**
 In t1 LEFT JOIN t2, the WHERE pushed to t2 can be tested only after at
 least one t2's row has been found
 */
 FOUND_MATCH,
 /**
 In IN->EXISTS subquery transformation, new predicates are added:
 WHERE inner_field=outer_field OR inner_field IS NULL,
 as well as
 HAVING inner_field IS NOT NULL,
 are disabled if outer_field is a NULL value
 */
 OUTER_FIELD_IS_NOT_NULL
 };
private:
 /** Pointer to trigger variable */
 bool *trig_var;
 /** Optional table(s) which are the source of trig_var; for printing */
 const struct st_join_table *trig_tab;
 /** Type of trig_var; for printing */
 enum_trig_type trig_type;
public:
 /**
 @param a the item for <condition>
 @param f pointer to trigger variable
 @param tab optional table which is source of 'f',
 NULL if not applicable
 @param trig_type_arg type of 'f'
 */
 Item_func_trig_cond(Item *a, bool *f, struct st_join_table *tab,
 enum_trig_type trig_type_arg)
 : Item_bool_func(a), trig_var(f), trig_tab(tab), trig_type(trig_type_arg)
 {}
 longlong val_int() { return *trig_var ? args[0]->val_int() : 1; }
 enum Functype functype() const { return TRIG_COND_FUNC; };
 /// '<if>', to distinguish from the if() SQL function
 const char *func_name() const { return "<if>"; };
 bool const_item() const { return FALSE; }
 bool *get_trig_var() { return trig_var; }
 /* The following is needed for ICP: */
 table_map used_tables() const { return args[0]->used_tables(); }
 void print(String *str, enum_query_type query_type);
};


class Item_func_not_all :public Item_func_not
{
 /* allow to check presence of values in max/min optimization */
 Item_sum_hybrid *test_sum_item;
 Item_maxmin_subselect *test_sub_item;
 Item_subselect *subselect;

 bool abort_on_null;
public:
 bool show;

 Item_func_not_all(Item *a)
 :Item_func_not(a), test_sum_item(0), test_sub_item(0), subselect(0),
 abort_on_null(0), show(0)
 {}
 virtual void top_level_item() { abort_on_null= 1; }
 bool top_level() { return abort_on_null; }
 longlong val_int() {return 0;}
 enum Functype functype() const { return NOT_ALL_FUNC; }
 const char *func_name() const { return "<not>"; }
 virtual void print(String *str, enum_query_type query_type);
};


class Item_func_nop_all :public Item_func_not_all
{
public:

 Item_func_nop_all(Item *a) :Item_func_not_all(a) {}
 const char *func_name() const { return "<nop>"; }
};


class Item_func_eq :public Item_bool_rowready_func2
{
public:
 Item_func_eq(Item *a,Item *b) :
 Item_bool_rowready_func2(a,b)
 {}
 enum Functype functype() const { return EQ_FUNC; }
 enum Functype rev_functype() const { return EQ_FUNC; }
 cond_result eq_cmp_result() const { return COND_TRUE; }
 const char *func_name() const { return "="; }
 Item *negated_item();
 virtual bool equality_substitution_analyzer(uchar **arg) { return true; }
};

class Item_func_equal :public Item_bool_rowready_func2
{
public:
 Item_func_equal(Item *a,Item *b) :Item_bool_rowready_func2(a,b) {};
 table_map not_null_tables() const { return 0; }
 enum Functype functype() const { return EQUAL_FUNC; }
 enum Functype rev_functype() const { return EQUAL_FUNC; }
 cond_result eq_cmp_result() const { return COND_TRUE; }
 const char *func_name() const { return "<=>"; }
 Item *neg_transformer(THD *thd) { return 0; }
};


class Item_func_ge :public Item_bool_rowready_func2
{
public:
 Item_func_ge(Item *a,Item *b) :Item_bool_rowready_func2(a,b) {};

 enum Functype functype() const { return GE_FUNC; }
 enum Functype rev_functype() const { return LE_FUNC; }
 cond_result eq_cmp_result() const { return COND_TRUE; }
 const char *func_name() const { return ">="; }
 Item *negated_item();
};


class Item_func_gt :public Item_bool_rowready_func2
{
public:
 Item_func_gt(Item *a,Item *b) :Item_bool_rowready_func2(a,b) {};
 enum Functype functype() const { return GT_FUNC; }
 enum Functype rev_functype() const { return LT_FUNC; }
 cond_result eq_cmp_result() const { return COND_FALSE; }
 const char *func_name() const { return ">"; }
 Item *negated_item();
};


class Item_func_le :public Item_bool_rowready_func2
{
public:
 Item_func_le(Item *a,Item *b) :Item_bool_rowready_func2(a,b) {};
 enum Functype functype() const { return LE_FUNC; }
 enum Functype rev_functype() const { return GE_FUNC; }
 cond_result eq_cmp_result() const { return COND_TRUE; }
 const char *func_name() const { return "<="; }
 Item *negated_item();
};


class Item_func_lt :public Item_bool_rowready_func2
{
public:
 Item_func_lt(Item *a,Item *b) :Item_bool_rowready_func2(a,b) {}
 enum Functype functype() const { return LT_FUNC; }
 enum Functype rev_functype() const { return GT_FUNC; }
 cond_result eq_cmp_result() const { return COND_FALSE; }
 const char *func_name() const { return "<"; }
 Item *negated_item();
};


class Item_func_ne :public Item_bool_rowready_func2
{
public:
 Item_func_ne(Item *a,Item *b) :Item_bool_rowready_func2(a,b) {}
 enum Functype functype() const { return NE_FUNC; }
 cond_result eq_cmp_result() const { return COND_FALSE; }
 optimize_type select_optimize() const { return OPTIMIZE_KEY; } 
 const char *func_name() const { return "<>"; }
 Item *negated_item();
};


/*
 The class Item_func_opt_neg is defined to factor out the functionality
 common for the classes Item_func_between and Item_func_in. The objects
 of these classes can express predicates or there negations.
 The alternative approach would be to create pairs Item_func_between,
 Item_func_notbetween and Item_func_in, Item_func_notin.

*/

class Item_func_opt_neg :public Item_int_func
{
public:
 bool negated; /* <=> the item represents NOT <func> */
 bool pred_level; /* <=> [NOT] <func> is used on a predicate level */
public:
 Item_func_opt_neg(Item *a, Item *b, Item *c)
 :Item_int_func(a, b, c), negated(0), pred_level(0) {}
 Item_func_opt_neg(List<Item> &list)
 :Item_int_func(list), negated(0), pred_level(0) {}
public:
 inline void negate() { negated= !negated; }
 inline void top_level_item() { pred_level= 1; }
 Item *neg_transformer(THD *thd)
 {
 negated= !negated;
 return this;
 }
 bool subst_argument_checker(uchar **arg) { return TRUE; }
};


class Item_func_between :public Item_func_opt_neg
{
 DTCollation cmp_collation;
public:
 Item_result cmp_type;
 String value0,value1,value2;
 /* TRUE <=> arguments will be compared as dates. */
 bool compare_as_dates_with_strings;
 bool compare_as_temporal_dates;
 bool compare_as_temporal_times;
 
 /* Comparators used for DATE/DATETIME comparison. */
 Arg_comparator ge_cmp, le_cmp;
 Item_func_between(Item *a, Item *b, Item *c)
 :Item_func_opt_neg(a, b, c), compare_as_dates_with_strings(FALSE),
 compare_as_temporal_dates(FALSE),
 compare_as_temporal_times(FALSE) {}
 longlong val_int() {return 0;}
 optimize_type select_optimize() const { return OPTIMIZE_KEY; }
 enum Functype functype() const { return BETWEEN; }
 const char *func_name() const { return "between"; }
 virtual void print(String *str, enum_query_type query_type);
 bool is_bool_func() { return 1; }
 const CHARSET_INFO *compare_collation() { return cmp_collation.collation; }
 uint decimal_precision() const { return 1; }
};


class Item_func_strcmp :public Item_bool_func2
{
public:
 Item_func_strcmp(Item *a,Item *b) :Item_bool_func2(a,b) {}
 longlong val_int() {return 0;}
 optimize_type select_optimize() const { return OPTIMIZE_NONE; }
 const char *func_name() const { return "strcmp"; }

 virtual inline void print(String *str, enum_query_type query_type)
 {
 Item_func::print(str, query_type);
 }
};


struct interval_range
{
 Item_result type;
 double dbl;
 my_decimal dec;
};

class Item_func_interval :public Item_int_func
{
 Item_row *row;
 my_bool use_decimal_comparison;
 interval_range *intervals;
public:
 Item_func_interval(Item_row *a)
 :Item_int_func(a),row(a),intervals(0)
 {
 allowed_arg_cols= 0; // Fetch this value from first argument
 }
 longlong val_int() {return 0;}
 const char *func_name() const { return "interval"; }
 uint decimal_precision() const { return 2; }
};


class Item_func_coalesce :public Item_func_numhybrid
{
protected:
 enum_field_types cached_field_type;
 Item_func_coalesce(Item *a, Item *b) :Item_func_numhybrid(a, b) {}
public:
 Item_func_coalesce(List<Item> &list) :Item_func_numhybrid(list) {}
 void find_num_type() {}
 enum Item_result result_type () const { return hybrid_type; }
 const char *func_name() const { return "coalesce"; }
 table_map not_null_tables() const { return 0; }
 enum_field_types field_type() const { return cached_field_type; }
};


class Item_func_ifnull :public Item_func_coalesce
{
protected:
 bool field_type_defined;
public:
 Item_func_ifnull(Item *a, Item *b) :Item_func_coalesce(a,b) {}
 const char *func_name() const { return "ifnull"; }
 uint decimal_precision() const {return 0.0;}
};


class Item_func_if :public Item_func
{
 enum Item_result cached_result_type;
 enum_field_types cached_field_type;
public:
 Item_func_if(Item *a,Item *b,Item *c)
 :Item_func(a,b,c), cached_result_type(INT_RESULT)
 {}
 double val_real() {return 0.0;}
 longlong val_int() {return 0;}
 String *val_str(String *str) {return NULL;}
 my_decimal *val_decimal(my_decimal *) {return NULL;}
 enum Item_result result_type () const { return cached_result_type; }
 enum_field_types field_type() const { return cached_field_type; }
 uint decimal_precision() const;
 const char *func_name() const { return "if"; }
};


class Item_func_nullif :public Item_bool_func2
{
 enum Item_result cached_result_type;
public:
 Item_func_nullif(Item *a,Item *b)
 :Item_bool_func2(a,b), cached_result_type(INT_RESULT)
 {}
 double val_real() {return 0.0;}
 longlong val_int() {return 0;}
 String *val_str(String *str) {return NULL;}
 my_decimal *val_decimal(my_decimal *) {return NULL;}
 enum Item_result result_type () const { return cached_result_type; }
 uint decimal_precision() const { return args[0]->decimal_precision(); }
 const char *func_name() const { return "nullif"; }

 virtual inline void print(String *str, enum_query_type query_type)
 {
 Item_func::print(str, query_type);
 }

 table_map not_null_tables() const { return 0; }
 bool is_null();
};


/* Functions to handle the optimized IN */


/* A vector of values of some type */

class in_vector :public Sql_alloc
{
public:
 char *base;
 uint size;
 qsort2_cmp compare;
 const CHARSET_INFO *collation;
 uint count;
 uint used_count;
 in_vector() {}
 in_vector(uint elements,uint element_length,qsort2_cmp cmp_func, 
 	 const CHARSET_INFO *cmp_coll)
 :base((char*) sql_calloc(elements*element_length)),
 size(element_length), compare(cmp_func), collation(cmp_coll),
 count(elements), used_count(elements) {}
 virtual ~in_vector() {}
 virtual void set(uint pos,Item *item)=0;
 virtual uchar *get_value(Item *item)=0;
 void sort()
 {
 my_qsort2(base,used_count,size,compare,collation);
 }
 int find(Item *item);
 
 /* 
 Create an instance of Item_{type} (e.g. Item_decimal) constant object
 which type allows it to hold an element of this vector without any
 conversions.
 The purpose of this function is to be able to get elements of this
 vector in form of Item_xxx constants without creating Item_xxx object
 for every array element you get (i.e. this implements "FlyWeight" pattern)
 */
 virtual Item* create_item() { return NULL; }
 
 /*
 Store the value at position #pos into provided item object
 SYNOPSIS
 value_to_item()
 pos Index of value to store
 item Constant item to store value into. The item must be of the same
 type that create_item() returns.
 */
 virtual void value_to_item(uint pos, Item *item) { }
 
 /* Compare values number pos1 and pos2 for equality */
 bool compare_elems(uint pos1, uint pos2)
 {
 return MY_TEST(compare(collation, base + pos1*size, base + pos2*size));
 }
 virtual Item_result result_type()= 0;
};

class in_string :public in_vector
{
 char buff[STRING_BUFFER_USUAL_SIZE];
 String tmp;
public:
 in_string(uint elements,qsort2_cmp cmp_func, const CHARSET_INFO *cs);
 ~in_string();
 Item* create_item()
 { 
 return new Item_string(collation);
 }
 void value_to_item(uint pos, Item *item)
 { 
 String *str=((String*) base)+pos;
 Item_string *to= (Item_string*)item;
 to->str_value= *str;
 }
 Item_result result_type() { return STRING_RESULT; }
};

class in_longlong :public in_vector
{
protected:
 /*
 Here we declare a temporary variable (tmp) of the same type as the
 elements of this vector. tmp is used in finding if a given value is in 
 the list. 
 */
 struct packed_longlong 
 {
 longlong val;
 longlong unsigned_flag; // Use longlong, not bool, to preserve alignment
 } tmp;
public:
 in_longlong(uint elements);
 void set(uint pos,Item *item);
 uchar *get_value(Item *item);
 
 Item* create_item()
 { 
 /* 
 We're created a signed INT, this may not be correct in 
 general case (see BUG#19342).
 */
 return new Item_int((longlong)0);
 }
 void value_to_item(uint pos, Item *item)
 {
 ((Item_int*) item)->value= ((packed_longlong*) base)[pos].val;
 ((Item_int*) item)->unsigned_flag= (my_bool)
 ((packed_longlong*) base)[pos].unsigned_flag;
 }
 Item_result result_type() { return INT_RESULT; }

 friend int cmp_longlong(void *cmp_arg, packed_longlong *a,packed_longlong *b);
};


class in_datetime_as_longlong :public in_longlong
{
public:
 in_datetime_as_longlong(uint elements)
 :in_longlong(elements) {};
 void set(uint pos, Item *item);
 uchar *get_value(Item *item);
};


class in_time_as_longlong :public in_longlong
{
public:
 in_time_as_longlong(uint elements)
 :in_longlong(elements) {};
 void set(uint pos, Item *item);
 uchar *get_value(Item *item);
};


/*
 Class to represent a vector of constant DATE/DATETIME values.
 Values are obtained with help of the get_datetime_value() function.
 If the left item is a constant one then its value is cached in the
 lval_cache variable.
*/
class in_datetime :public in_longlong
{
public:
 THD *thd;
 /* An item used to issue warnings. */
 Item *warn_item;
 /* Cache for the left item. */
 Item *lval_cache;

 in_datetime(Item *warn_item_arg, uint elements)
 :in_longlong(elements), thd(current_thd), warn_item(warn_item_arg),
 lval_cache(0) {};
 void set(uint pos,Item *item);
 uchar *get_value(Item *item);
 friend int cmp_longlong(void *cmp_arg, packed_longlong *a,packed_longlong *b);
};


class in_double :public in_vector
{
 double tmp;
public:
 in_double(uint elements);
 void set(uint pos,Item *item);
 uchar *get_value(Item *item);
 Item *create_item()
 { 
 return new Item_float(0.0, 0);
 }
 void value_to_item(uint pos, Item *item)
 {
 ((Item_float*)item)->value= ((double*) base)[pos];
 }
 Item_result result_type() { return REAL_RESULT; }
};


class in_decimal :public in_vector
{
 my_decimal val;
public:
 in_decimal(uint elements);
 void set(uint pos, Item *item);
 uchar *get_value(Item *item);
 Item *create_item()
 { 
 return new Item_decimal(0, FALSE);
 }
 void value_to_item(uint pos, Item *item)
 {
 my_decimal *dec= ((my_decimal *)base) + pos;
 Item_decimal *item_dec= (Item_decimal*)item;
 item_dec->set_decimal_value(dec);
 }
 Item_result result_type() { return DECIMAL_RESULT; }

};


/*
** Classes for easy comparing of non const items
*/

class cmp_item :public Sql_alloc
{
public:
 const CHARSET_INFO *cmp_charset;
 cmp_item() { cmp_charset= &my_charset_bin; }
 virtual ~cmp_item() {}
 virtual int cmp(Item *item)= 0;
 // for optimized IN with row
 virtual int compare(cmp_item *item)= 0;
};

class cmp_item_string :public cmp_item 
{
protected:
 String *value_res;
public:
 cmp_item_string () {}
 cmp_item_string (const CHARSET_INFO *cs) { cmp_charset= cs; }
 void set_charset(const CHARSET_INFO *cs) { cmp_charset= cs; }
 friend class cmp_item_sort_string;
 friend class cmp_item_sort_string_in_static;
};

class cmp_item_sort_string :public cmp_item_string
{
protected:
 char value_buff[STRING_BUFFER_USUAL_SIZE];
 String value;
public:
 cmp_item_sort_string():
 cmp_item_string() {}
 cmp_item_sort_string(const CHARSET_INFO *cs):
 cmp_item_string(cs),
 value(value_buff, sizeof(value_buff), cs) {}
 void set_charset(const CHARSET_INFO *cs)
 {
 cmp_charset= cs;
 value.set_quick(value_buff, sizeof(value_buff), cs);
 }
};

class cmp_item_int :public cmp_item
{
 longlong value;
public:
 cmp_item_int() {} /* Remove gcc warning */
 int compare(cmp_item *ci)
 {
 cmp_item_int *l_cmp= (cmp_item_int *)ci;
 return (value < l_cmp->value) ? -1 : ((value == l_cmp->value) ? 0 : 1);
 }
};

/*
 Compare items in the DATETIME context.
 Values are obtained with help of the get_datetime_value() function.
 If the left item is a constant one then its value is cached in the
 lval_cache variable.
*/
class cmp_item_datetime :public cmp_item
{
 longlong value;
public:
 THD *thd;
 /* Item used for issuing warnings. */
 Item *warn_item;
 /* Cache for the left item. */
 Item *lval_cache;

 cmp_item_datetime(Item *warn_item_arg)
 :thd(current_thd), warn_item(warn_item_arg), lval_cache(0) {}
 int cmp(Item *arg);
 int compare(cmp_item *ci);
};

class cmp_item_real :public cmp_item
{
 double value;
public:
 cmp_item_real() {} /* Remove gcc warning */
 int compare(cmp_item *ci)
 {
 cmp_item_real *l_cmp= (cmp_item_real *) ci;
 return (value < l_cmp->value)? -1 : ((value == l_cmp->value) ? 0 : 1);
 }
};


/*
 The class Item_func_case is the CASE ... WHEN ... THEN ... END function
 implementation.

 When there is no expression between CASE and the first WHEN 
 (the CASE expression) then this function simple checks all WHEN expressions
 one after another. When some WHEN expression evaluated to TRUE then the
 value of the corresponding THEN expression is returned.

 When the CASE expression is specified then it is compared to each WHEN
 expression individually. When an equal WHEN expression is found
 corresponding THEN expression is returned.
 In order to do correct comparisons several comparators are used. One for
 each result type. Different result types that are used in particular
 CASE ... END expression are collected in the fix_length_and_dec() member
 function and only comparators for there result types are used.
*/

class Item_func_case :public Item_func
{
 int first_expr_num, else_expr_num;
 enum Item_result cached_result_type, left_result_type;
 String tmp_value;
 uint ncases;
 Item_result cmp_type;
 DTCollation cmp_collation;
 enum_field_types cached_field_type;
 cmp_item *cmp_items[5]; /* For all result types */
 cmp_item *case_item;
public:
 Item_func_case(List<Item> &list, Item *first_expr_arg, Item *else_expr_arg)
 :Item_func(), first_expr_num(-1), else_expr_num(-1),
 cached_result_type(INT_RESULT), left_result_type(INT_RESULT), case_item(0)
 {
 ncases= list.elements;
 if (first_expr_arg)
 {
 first_expr_num= list.elements;
 list.push_back(first_expr_arg);
 }
 if (else_expr_arg)
 {
 else_expr_num= list.elements;
 list.push_back(else_expr_arg);
 }
 set_arguments(list);
 memset(&cmp_items, 0, sizeof(cmp_items));
 }
 double val_real() {return 0.0;}
 longlong val_int() {return 0;}
 String *val_str(String *) {return NULL;}
 my_decimal *val_decimal(my_decimal *) {return NULL;}
 uint decimal_precision() const;
 table_map not_null_tables() const { return 0; }
 enum Item_result result_type () const { return cached_result_type; }
 enum_field_types field_type() const { return cached_field_type; }
 const char *func_name() const { return "case"; }
 virtual void print(String *str, enum_query_type query_type);
 const CHARSET_INFO *compare_collation() { return cmp_collation.collation; }
};

/*
 The Item_func_in class implements the in_expr IN(values_list) function.

 The current implementation distinguishes 2 cases:
 1) all items in the value_list are constants and have the same
 result type. This case is handled by in_vector class.
 2) items in the value_list have different result types or there is some
 non-constant items.
 In this case Item_func_in employs several cmp_item objects to performs
 comparisons of in_expr and an item from the values_list. One cmp_item
 object for each result type. Different result types are collected in the
 fix_length_and_dec() member function by means of collect_cmp_types()
 function.
*/
class Item_func_in :public Item_func_opt_neg
{
public:
 /* 
 an array of values when the right hand arguments of IN
 are all SQL constant and there are no nulls 
 */
 in_vector *array;
 bool have_null;
 /* 
 true when all arguments of the IN clause are of compatible types
 and can be used safely as comparisons for key conditions
 */
 bool arg_types_compatible;
 Item_result left_result_type;
 cmp_item *cmp_items[6]; /* One cmp_item for each result type */
 DTCollation cmp_collation;

 Item_func_in(List<Item> &list)
 :Item_func_opt_neg(list), array(0), have_null(0),
 arg_types_compatible(FALSE)
 {
 memset(&cmp_items, 0, sizeof(cmp_items));
 allowed_arg_cols= 0; // Fetch this value from first argument
 }
 longlong val_int() {return 0.0;}
 uint decimal_precision() const { return 1; }
 optimize_type select_optimize() const
 { return OPTIMIZE_KEY; }
 virtual void print(String *str, enum_query_type query_type);
 enum Functype functype() const { return IN_FUNC; }
 const char *func_name() const { return " IN "; }
 bool is_bool_func() { return 1; }
 const CHARSET_INFO *compare_collation() { return cmp_collation.collation; }
};

class cmp_item_row :public cmp_item
{
 cmp_item **comparators;
 uint n;
public:
 cmp_item_row(): comparators(0), n(0) {}
 ~cmp_item_row();
 inline void alloc_comparators();
 int cmp(Item *arg);
 int compare(cmp_item *arg);
};


class in_row :public in_vector
{
 cmp_item_row tmp;
public:
 in_row(uint elements, Item *);
 ~in_row();
 void set(uint pos,Item *item);
 uchar *get_value(Item *item);
 Item_result result_type() { return ROW_RESULT; }
};

/* Functions used by where clause */

class Item_func_isnull :public Item_bool_func
{
protected:
 longlong cached_value;
public:
 Item_func_isnull(Item *a) :Item_bool_func(a) {}
 longlong val_int() {return 0;}
 enum Functype functype() const { return ISNULL_FUNC; }
 const char *func_name() const { return "isnull"; }
 table_map not_null_tables() const { return 0; }
 optimize_type select_optimize() const { return OPTIMIZE_NULL; }
 Item *neg_transformer(THD *thd);
 const CHARSET_INFO *compare_collation()
 { return args[0]->collation.collation; }
};

/* Functions used by HAVING for rewriting IN subquery */

class Item_in_subselect;

/* 
 This is like IS NOT NULL but it also remembers if it ever has
 encountered a NULL; it remembers this in the "was_null" property of the
 "owner" item.
*/
class Item_is_not_null_test :public Item_func_isnull
{
 Item_in_subselect* owner;
public:
 Item_is_not_null_test(Item_in_subselect* ow, Item *a)
 :Item_func_isnull(a), owner(ow)
 {}
 enum Functype functype() const { return ISNOTNULLTEST_FUNC; }
 longlong val_int();
 const char *func_name() const { return "<is_not_null_test>"; }
 /**
 We add RAND_TABLE_BIT to prevent moving this item from HAVING to WHERE.

 @retval Always RAND_TABLE_BIT
 */
 table_map get_initial_pseudo_tables() const { return RAND_TABLE_BIT; }
};


class Item_func_isnotnull :public Item_bool_func
{
 bool abort_on_null;
public:
 Item_func_isnotnull(Item *a) :Item_bool_func(a), abort_on_null(0) {}
 longlong val_int() {return 0;}
 enum Functype functype() const { return ISNOTNULL_FUNC; }
 const char *func_name() const { return "isnotnull"; }
 optimize_type select_optimize() const { return OPTIMIZE_NULL; }
 table_map not_null_tables() const
 { return abort_on_null ? not_null_tables_cache : 0; }
 Item *neg_transformer(THD *thd);
 virtual void print(String *str, enum_query_type query_type);
 const CHARSET_INFO *compare_collation()
 { return args[0]->collation.collation; }
 void top_level_item() { abort_on_null=1; }
};


class Item_func_like :public Item_bool_func2
{
 // Turbo Boyer-Moore data
 bool canDoTurboBM;	// pattern is '%abcd%' case
 const char* pattern;
 int pattern_len;

 // TurboBM buffers, *this is owner
 int* bmGs; // good suffix shift table, size is pattern_len + 1
 int* bmBc; // bad character shift table, size is alphabet_size

 void turboBM_compute_suffixes(int* suff);
 void turboBM_compute_good_suffix_shifts(int* suff);
 void turboBM_compute_bad_character_shifts();
 bool turboBM_matches(const char* text, int text_len) const;
 enum { alphabet_size = 256 };

 Item *escape_item;
 
 bool escape_used_in_parsing;

public:
 int escape;

 Item_func_like(Item *a,Item *b, Item *escape_arg, bool escape_used)
 :Item_bool_func2(a,b), canDoTurboBM(FALSE), pattern(0), pattern_len(0), 
 bmGs(0), bmBc(0), escape_item(escape_arg),
 escape_used_in_parsing(escape_used) {}
 longlong val_int() {return 0;}
 enum Functype functype() const { return LIKE_FUNC; }
 cond_result eq_cmp_result() const { return COND_TRUE; }
 const char *func_name() const { return "like"; }
};


class Item_func_regex :public Item_bool_func
{
 my_regex_t preg;
 bool regex_compiled;
 bool regex_is_const;
 String prev_regexp;
 DTCollation cmp_collation;
 const CHARSET_INFO *regex_lib_charset;
 int regex_lib_flags;
 String conv;
public:
 Item_func_regex(Item *a,Item *b) :Item_bool_func(a,b),
 regex_compiled(0),regex_is_const(0) {}
 longlong val_int() {return 0;}
 const char *func_name() const { return "regexp"; }

 virtual inline void print(String *str, enum_query_type query_type)
 {
 print_op(str, query_type);
 }

 const CHARSET_INFO *compare_collation() { return cmp_collation.collation; }
};


class Item_cond :public Item_bool_func
{
protected:
 List<Item> list;
 bool abort_on_null;

public:
 /* Item_cond() is only used to create top level items */
 Item_cond(): Item_bool_func(), abort_on_null(1)
 { const_item_cache=0; }
 Item_cond(Item *i1,Item *i2)
 :Item_bool_func(), abort_on_null(0)
 {
 list.push_back(i1);
 list.push_back(i2);
 }
 Item_cond(THD *thd, Item_cond *item);
 Item_cond(List<Item> &nlist)
 :Item_bool_func(), list(nlist), abort_on_null(0) {}
 bool add(Item *item)
 {
 DBUG_ASSERT(item);
 return list.push_back(item);
 }
 bool add_at_head(Item *item)
 {
 DBUG_ASSERT(item);
 return list.push_front(item);
 }
 void add_at_head(List<Item> *nlist)
 {
 DBUG_ASSERT(nlist->elements);
 list.prepand(nlist);
 }

 enum Type type() const { return COND_ITEM; }
 List<Item>* argument_list() { return &list; }
 table_map used_tables() const { return used_tables_cache; }
 virtual void print(String *str, enum_query_type query_type);
 void top_level_item() { abort_on_null=1; }
 bool walk(Item_processor processor, bool walk_subquery, uchar *arg);
 void traverse_cond(Cond_traverser, void *arg, traverse_order order);
 void neg_arguments(THD *thd);
 enum_field_types field_type() const { return MYSQL_TYPE_LONGLONG; }
 bool subst_argument_checker(uchar **arg) { return TRUE; }

 virtual longlong val_int() {return 0;}

 virtual bool equality_substitution_analyzer(uchar **arg) { return true; }
};


/*
 The class Item_equal is used to represent conjunctions of equality
 predicates of the form field1 = field2, and field=const in where
 conditions and on expressions.

 All equality predicates of the form field1=field2 contained in a
 conjunction are substituted for a sequence of items of this class.
 An item of this class Item_equal(f1,f2,...fk) represents a
 multiple equality f1=f2=...=fk.

 If a conjunction contains predicates f1=f2 and f2=f3, a new item of
 this class is created Item_equal(f1,f2,f3) representing the multiple
 equality f1=f2=f3 that substitutes the above equality predicates in
 the conjunction.
 A conjunction of the predicates f2=f1 and f3=f1 and f3=f2 will be
 substituted for the item representing the same multiple equality
 f1=f2=f3.
 An item Item_equal(f1,f2) can appear instead of a conjunction of 
 f2=f1 and f1=f2, or instead of just the predicate f1=f2.

 An item of the class Item_equal inherits equalities from outer 
 conjunctive levels.

 Suppose we have a where condition of the following form:
 WHERE f1=f2 AND f3=f4 AND f3=f5 AND ... AND (...OR (f1=f3 AND ...)).
 In this case:
 f1=f2 will be substituted for Item_equal(f1,f2);
 f3=f4 and f3=f5 will be substituted for Item_equal(f3,f4,f5);
 f1=f3 will be substituted for Item_equal(f1,f2,f3,f4,f5);

 An object of the class Item_equal can contain an optional constant
 item c. Then it represents a multiple equality of the form 
 c=f1=...=fk.

 Objects of the class Item_equal are used for the following:

 1. An object Item_equal(t1.f1,...,tk.fk) allows us to consider any
 pair of tables ti and tj as joined by an equi-condition.
 Thus it provide us with additional access paths from table to table.

 2. An object Item_equal(t1.f1,...,tk.fk) is applied to deduce new
 SARGable predicates:
 f1=...=fk AND P(fi) => f1=...=fk AND P(fi) AND P(fj).
 It also can give us additional index scans and can allow us to
 improve selectivity estimates.

 3. An object Item_equal(t1.f1,...,tk.fk) is used to optimize the 
 selected execution plan for the query: if table ti is accessed 
 before the table tj then in any predicate P in the where condition
 the occurrence of tj.fj is substituted for ti.fi. This can allow
 an evaluation of the predicate at an earlier step.

 When feature 1 is supported they say that join transitive closure 
 is employed.
 When feature 2 is supported they say that search argument transitive
 closure is employed.
 Both features are usually supported by preprocessing original query and
 adding additional predicates.
 We do not just add predicates, we rather dynamically replace some
 predicates that can not be used to access tables in the investigated
 plan for those, obtained by substitution of some fields for equal fields,
 that can be used. 

 Prepared Statements/Stored Procedures note: instances of class
 Item_equal are created only at the time a PS/SP is executed and
 are deleted in the end of execution. All changes made to these
 objects need not be registered in the list of changes of the parse
 tree and do not harm PS/SP re-execution.

 Item equal objects are employed only at the optimize phase. Usually they are
 not supposed to be evaluated. Yet in some cases we call the method val_int()
 for them. We have to take care of restricting the predicate such an
 object represents f1=f2= ...=fn to the projection of known fields fi1=...=fik.
*/
struct st_join_table;

class Item_equal: public Item_bool_func
{
 List<Item_field> fields; /* list of equal field items */
 Item *const_item; /* optional constant item equal to fields items */
 cmp_item *eval_item;
 Arg_comparator cmp;
 bool cond_false;
 bool compare_as_dates;
public:
 inline Item_equal()
 : Item_bool_func(), const_item(0), eval_item(0), cond_false(0)
 { const_item_cache=0 ;}
 Item_equal(Item_field *f1, Item_field *f2);
 Item_equal(Item *c, Item_field *f);
 Item_equal(Item_equal *item_equal);
 virtual ~Item_equal()
 {
 delete eval_item;
 }

 inline Item* get_const() { return const_item; }
 enum Functype functype() const { return MULT_EQUAL_FUNC; }
 longlong val_int(); 
 const char *func_name() const { return "multiple equal"; }
 optimize_type select_optimize() const { return OPTIMIZE_EQUAL; }
 void sort(Item_field_cmpfunc compare, void *arg);
 friend class Item_equal_iterator;
 bool walk(Item_processor processor, bool walk_subquery, uchar *arg);
 virtual void print(String *str, enum_query_type query_type);
 const CHARSET_INFO *compare_collation() 
 { return fields.head()->collation.collation; }
}; 

class COND_EQUAL: public Sql_alloc
{
public:
 uint max_members; /* max number of members the current level
 list and all lower level lists */ 
 COND_EQUAL *upper_levels; /* multiple equalities of upper and levels */
 List<Item_equal> current_level; /* list of multiple equalities of 
 the current and level */
 COND_EQUAL()
 { 
 upper_levels= 0;
 }
};


class Item_equal_iterator : public List_iterator_fast<Item_field>
{
public:
 inline Item_equal_iterator(Item_equal &item_equal) 
 :List_iterator_fast<Item_field> (item_equal.fields)
 {}
 inline Item_field* operator++(int)
 { 
 Item_field *item= (*(List_iterator_fast<Item_field> *) this)++;
 return item;
 }
 inline void rewind(void) 
 { 
 List_iterator_fast<Item_field>::rewind();
 }
};

class Item_cond_and :public Item_cond
{
public:
 COND_EQUAL cond_equal; /* contains list of Item_equal objects for 
 the current and level and reference
 to multiple equalities of upper and levels */ 
 Item_cond_and() :Item_cond() {}
 Item_cond_and(Item *i1,Item *i2) :Item_cond(i1,i2) {}
 Item_cond_and(THD *thd, Item_cond_and *item) :Item_cond(thd, item) {}
 Item_cond_and(List<Item> &list_arg): Item_cond(list_arg) {}
 enum Functype functype() const { return COND_AND_FUNC; }

 const char *func_name() const { return "and"; }
 Item *neg_transformer(THD *thd);
};

inline bool is_cond_and(Item *item)
{
 if (item->type() != Item::COND_ITEM)
 return FALSE;

 Item_cond *cond_item= (Item_cond*) item;
 return (cond_item->functype() == Item_func::COND_AND_FUNC);
}

class Item_cond_or :public Item_cond
{
public:
 Item_cond_or() :Item_cond() {}
 Item_cond_or(Item *i1,Item *i2) :Item_cond(i1,i2) {}
 Item_cond_or(THD *thd, Item_cond_or *item) :Item_cond(thd, item) {}
 Item_cond_or(List<Item> &list_arg): Item_cond(list_arg) {}
 enum Functype functype() const { return COND_OR_FUNC; }
 const char *func_name() const { return "or"; }
 Item *neg_transformer(THD *thd);
};

inline bool is_cond_or(Item *item)
{
 if (item->type() != Item::COND_ITEM)
 return FALSE;

 Item_cond *cond_item= (Item_cond*) item;
 return (cond_item->functype() == Item_func::COND_OR_FUNC);
}

/* Some useful inline functions */

inline Item *and_conds(Item *a, Item *b)
{
 if (!b) return a;
 if (!a) return b;
 return new Item_cond_and(a, b);
}


Item *and_expressions(Item *a, Item *b, Item **org_item);

longlong get_datetime_value(THD *thd, Item ***item_arg, Item **cache_arg,
 Item *warn_item, bool *is_null);


bool get_mysql_time_from_str(THD *thd, String *str, timestamp_type warn_type,
 const char *warn_name, MYSQL_TIME *l_time);

/*
 These need definitions from this file but the variables are defined
 in mysqld.h. The variables really belong in this component, but for
 the time being we leave them in mysqld.cc to avoid merge problems.
*/
extern Eq_creator eq_creator;
extern Ne_creator ne_creator;
extern Gt_creator gt_creator;
extern Lt_creator lt_creator;
extern Ge_creator ge_creator;
extern Le_creator le_creator;

#endif /* ITEM_CMPFUNC_INCLUDED */