1
/* Copyright (C) 2000 MySQL AB
3
This program is free software; you can redistribute it and/or modify
4
it under the terms of the GNU General Public License as published by
5
the Free Software Foundation; version 2 of the License.
7
This program is distributed in the hope that it will be useful,
8
but WITHOUT ANY WARRANTY; without even the implied warranty of
9
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
10
GNU General Public License for more details.
12
You should have received a copy of the GNU General Public License
13
along with this program; if not, write to the Free Software
14
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
17
#include <drizzled/error.h>
18
#include <drizzled/session.h>
20
#include <drizzled/item/row.h>
26
Row items used for comparing rows and IN operations on rows:
29
(a, b, c) > (10, 10, 30)
30
(a, b, c) = (select c, d, e, from t1 where x=12)
31
(a, b, c) IN ((1,2,2), (3,4,5), (6,7,8)
32
(a, b, c) IN (select c, d, e, from t1)
36
think placing 2-3 component items in item (as it done for function
39
Item_row::Item_row(List<Item> &arg):
40
Item(), used_tables_cache(0), const_item_cache(1), with_null(0)
43
//TODO: think placing 2-3 component items in item (as it done for function)
44
if ((arg_count= arg.elements))
45
items= (Item**) memory::sql_alloc(sizeof(Item*)*arg_count);
48
List_iterator<Item> li(arg);
58
void Item_row::illegal_method_call(const char *)
61
my_error(ER_OPERAND_COLUMNS, MYF(0), 1);
65
bool Item_row::fix_fields(Session *session, Item **)
70
Item **arg, **arg_end;
71
for (arg= items, arg_end= items+arg_count; arg != arg_end ; arg++)
73
if ((*arg)->fix_fields(session, arg))
75
// we can't assign 'item' before, because fix_fields() can change arg
77
used_tables_cache |= item->used_tables();
78
const_item_cache&= item->const_item() && !with_null;
82
with_null|= item->null_inside();
89
maybe_null|= item->maybe_null;
90
with_sum_func= with_sum_func || item->with_sum_func;
97
void Item_row::cleanup()
100
/* Reset to the original values */
101
used_tables_cache= 0;
109
void Item_row::split_sum_func(Session *session, Item **ref_pointer_array,
112
Item **arg, **arg_end;
113
for (arg= items, arg_end= items+arg_count; arg != arg_end ; arg++)
114
(*arg)->split_sum_func(session, ref_pointer_array, fields, arg, true);
118
void Item_row::update_used_tables()
120
used_tables_cache= 0;
122
for (uint32_t i= 0; i < arg_count; i++)
124
items[i]->update_used_tables();
125
used_tables_cache|= items[i]->used_tables();
126
const_item_cache&= items[i]->const_item();
130
void Item_row::fix_after_pullout(Select_Lex *new_parent, Item **)
132
used_tables_cache= 0;
134
for (uint32_t i= 0; i < arg_count; i++)
136
items[i]->fix_after_pullout(new_parent, &items[i]);
137
used_tables_cache|= items[i]->used_tables();
138
const_item_cache&= items[i]->const_item();
142
bool Item_row::check_cols(uint32_t c)
146
my_error(ER_OPERAND_COLUMNS, MYF(0), c);
152
void Item_row::print(String *str, enum_query_type query_type)
155
for (uint32_t i= 0; i < arg_count; i++)
159
items[i]->print(str, query_type);
165
bool Item_row::walk(Item_processor processor, bool walk_subquery, unsigned char *arg)
167
for (uint32_t i= 0; i < arg_count; i++)
169
if (items[i]->walk(processor, walk_subquery, arg))
172
return (this->*processor)(arg);
176
Item *Item_row::transform(Item_transformer transformer, unsigned char *arg)
178
for (uint32_t i= 0; i < arg_count; i++)
180
Item *new_item= items[i]->transform(transformer, arg);
185
Session::change_item_tree() should be called only if the tree was
186
really transformed, i.e. when a new item has been created.
187
Otherwise we'll be allocating a lot of unnecessary memory for
188
change records at each execution.
190
if (items[i] != new_item)
191
current_session->change_item_tree(&items[i], new_item);
193
return (this->*transformer)(arg);
196
void Item_row::bring_value()
198
for (uint32_t i= 0; i < arg_count; i++)
199
items[i]->bring_value();
202
} /* namespace drizzled */