2002-11-15 19:32:09 +01:00
|
|
|
/* Copyright (C) 2000 MySQL AB
|
|
|
|
|
|
|
|
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.
|
|
|
|
|
|
|
|
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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
|
|
|
|
|
|
|
|
#include "mysql_priv.h"
|
|
|
|
|
2003-01-30 21:15:44 +01:00
|
|
|
/*
|
|
|
|
Row items used for comparing rows and IN operations on rows:
|
|
|
|
|
|
|
|
(a, b, c) > (10, 10, 30)
|
|
|
|
(a, b, c) = (select c, d, e, from t1 where x=12)
|
|
|
|
(a, b, c) IN ((1,2,2), (3,4,5), (6,7,8)
|
|
|
|
(a, b, c) IN (select c, d, e, from t1)
|
|
|
|
*/
|
|
|
|
|
2002-11-15 19:32:09 +01:00
|
|
|
Item_row::Item_row(List<Item> &arg):
|
2003-02-10 16:59:16 +01:00
|
|
|
Item(), used_tables_cache(0), array_holder(1), const_item_cache(1), with_null(0)
|
2002-11-15 19:32:09 +01:00
|
|
|
{
|
2002-12-07 15:00:39 +01:00
|
|
|
|
|
|
|
//TODO: think placing 2-3 component items in item (as it done for function)
|
2002-11-15 19:32:09 +01:00
|
|
|
if ((arg_count= arg.elements))
|
|
|
|
items= (Item**) sql_alloc(sizeof(Item*)*arg_count);
|
|
|
|
else
|
|
|
|
items= 0;
|
|
|
|
List_iterator<Item> li(arg);
|
|
|
|
uint i= 0;
|
|
|
|
Item *item;
|
|
|
|
while ((item= li++))
|
|
|
|
{
|
|
|
|
items[i]= item;
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void Item_row::illegal_method_call(const char *method)
|
|
|
|
{
|
|
|
|
DBUG_ENTER("Item_row::illegal_method_call");
|
|
|
|
DBUG_PRINT("error", ("!!! %s method was called for row item", method));
|
|
|
|
DBUG_ASSERT(0);
|
2003-10-06 21:35:05 +02:00
|
|
|
my_error(ER_OPERAND_COLUMNS, MYF(0), 1);
|
2002-11-15 19:32:09 +01:00
|
|
|
DBUG_VOID_RETURN;
|
|
|
|
}
|
|
|
|
|
2005-07-01 06:05:42 +02:00
|
|
|
bool Item_row::fix_fields(THD *thd, Item **ref)
|
2002-11-15 19:32:09 +01:00
|
|
|
{
|
2004-03-17 13:26:26 +01:00
|
|
|
DBUG_ASSERT(fixed == 0);
|
2002-12-07 15:00:39 +01:00
|
|
|
null_value= 0;
|
|
|
|
maybe_null= 0;
|
2003-01-29 19:44:47 +01:00
|
|
|
Item **arg, **arg_end;
|
|
|
|
for (arg= items, arg_end= items+arg_count; arg != arg_end ; arg++)
|
2002-11-15 19:32:09 +01:00
|
|
|
{
|
2005-07-01 06:05:42 +02:00
|
|
|
if ((*arg)->fix_fields(thd, arg))
|
2004-10-20 03:04:37 +02:00
|
|
|
return TRUE;
|
2004-02-18 00:08:52 +01:00
|
|
|
// we can't assign 'item' before, because fix_fields() can change arg
|
|
|
|
Item *item= *arg;
|
|
|
|
used_tables_cache |= item->used_tables();
|
2004-08-26 18:22:22 +02:00
|
|
|
const_item_cache&= item->const_item() && !with_null;
|
|
|
|
if (const_item_cache)
|
2003-01-02 11:24:33 +01:00
|
|
|
{
|
2004-02-18 00:08:52 +01:00
|
|
|
if (item->cols() > 1)
|
|
|
|
with_null|= item->null_inside();
|
2002-12-31 17:39:16 +01:00
|
|
|
else
|
|
|
|
{
|
2005-04-01 14:04:50 +02:00
|
|
|
if (item->is_null())
|
|
|
|
with_null|= 1;
|
2002-12-31 17:39:16 +01:00
|
|
|
}
|
2003-01-02 11:24:33 +01:00
|
|
|
}
|
2004-02-18 00:08:52 +01:00
|
|
|
maybe_null|= item->maybe_null;
|
|
|
|
with_sum_func= with_sum_func || item->with_sum_func;
|
2002-11-15 19:32:09 +01:00
|
|
|
}
|
2004-03-17 13:26:26 +01:00
|
|
|
fixed= 1;
|
2004-10-20 03:04:37 +02:00
|
|
|
return FALSE;
|
2002-11-15 19:32:09 +01:00
|
|
|
}
|
|
|
|
|
2005-02-07 17:13:57 +01:00
|
|
|
|
2004-10-08 17:13:09 +02:00
|
|
|
void Item_row::split_sum_func(THD *thd, Item **ref_pointer_array,
|
|
|
|
List<Item> &fields)
|
2003-01-29 19:44:47 +01:00
|
|
|
{
|
|
|
|
Item **arg, **arg_end;
|
|
|
|
for (arg= items, arg_end= items+arg_count; arg != arg_end ; arg++)
|
2005-02-08 13:41:09 +01:00
|
|
|
(*arg)->split_sum_func2(thd, ref_pointer_array, fields, arg);
|
2003-01-29 19:44:47 +01:00
|
|
|
}
|
|
|
|
|
2005-02-08 13:41:09 +01:00
|
|
|
|
2002-12-07 15:00:39 +01:00
|
|
|
void Item_row::update_used_tables()
|
|
|
|
{
|
|
|
|
used_tables_cache= 0;
|
|
|
|
const_item_cache= 1;
|
|
|
|
for (uint i= 0; i < arg_count; i++)
|
|
|
|
{
|
|
|
|
items[i]->update_used_tables();
|
|
|
|
used_tables_cache|= items[i]->used_tables();
|
|
|
|
const_item_cache&= items[i]->const_item();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-11-15 19:32:09 +01:00
|
|
|
bool Item_row::check_cols(uint c)
|
|
|
|
{
|
|
|
|
if (c != arg_count)
|
|
|
|
{
|
2003-10-06 21:35:05 +02:00
|
|
|
my_error(ER_OPERAND_COLUMNS, MYF(0), c);
|
2002-11-15 19:32:09 +01:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
2002-12-10 17:10:00 +01:00
|
|
|
|
2003-10-12 16:56:05 +02:00
|
|
|
void Item_row::print(String *str)
|
|
|
|
{
|
|
|
|
str->append('(');
|
|
|
|
for (uint i= 0; i < arg_count; i++)
|
|
|
|
{
|
|
|
|
if (i)
|
|
|
|
str->append(',');
|
|
|
|
items[i]->print(str);
|
|
|
|
}
|
|
|
|
str->append(')');
|
|
|
|
}
|
|
|
|
|
2003-07-02 12:12:18 +02:00
|
|
|
bool Item_row::walk(Item_processor processor, byte *arg)
|
|
|
|
{
|
|
|
|
for (uint i= 0; i < arg_count; i++)
|
|
|
|
{
|
|
|
|
if (items[i]->walk(processor, arg))
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return (this->*processor)(arg);
|
|
|
|
}
|
|
|
|
|
2004-02-19 07:21:37 +01:00
|
|
|
Item *Item_row::transform(Item_transformer transformer, byte *arg)
|
2003-11-27 02:23:52 +01:00
|
|
|
{
|
|
|
|
for (uint i= 0; i < arg_count; i++)
|
|
|
|
{
|
2004-02-19 07:21:37 +01:00
|
|
|
Item *new_item= items[i]->transform(transformer, arg);
|
2003-11-27 02:23:52 +01:00
|
|
|
if (!new_item)
|
|
|
|
return 0;
|
|
|
|
items[i]= new_item;
|
|
|
|
}
|
2004-02-19 07:21:37 +01:00
|
|
|
return (this->*transformer)(arg);
|
2003-11-27 02:23:52 +01:00
|
|
|
}
|
|
|
|
|
2002-12-19 20:15:09 +01:00
|
|
|
void Item_row::bring_value()
|
|
|
|
{
|
|
|
|
for (uint i= 0; i < arg_count; i++)
|
|
|
|
items[i]->bring_value();
|
2002-12-26 00:28:59 +01:00
|
|
|
}
|