21#include <drizzled/session.h>
22#include <drizzled/sql_select.h>
24#include <drizzled/optimizer/range.h>
25#include <drizzled/optimizer/quick_group_min_max_select.h>
26#include <drizzled/optimizer/quick_range.h>
27#include <drizzled/optimizer/quick_range_select.h>
28#include <drizzled/optimizer/sel_arg.h>
29#include <drizzled/internal/m_string.h>
30#include <drizzled/util/functors.h>
31#include <drizzled/key.h>
32#include <drizzled/table.h>
33#include <drizzled/system_variables.h>
34#include <drizzled/key_part_info.h>
43QuickGroupMinMaxSelect::QuickGroupMinMaxSelect(Table *table,
47 KeyPartInfo *min_max_arg_part_arg,
48 uint32_t group_prefix_len_arg,
49 uint32_t group_key_parts_arg,
50 uint32_t used_key_parts_arg,
51 KeyInfo *index_info_arg,
55 uint32_t key_infix_len_arg,
56 unsigned char *key_infix_arg,
57 memory::Root *parent_alloc)
60 index_info(index_info_arg),
61 group_prefix_len(group_prefix_len_arg),
62 group_key_parts(group_key_parts_arg),
63 have_min(have_min_arg),
64 have_max(have_max_arg),
65 seen_first_key(false),
66 min_max_arg_part(min_max_arg_part_arg),
67 key_infix(key_infix_arg),
68 key_infix_len(key_infix_len_arg),
69 min_functions_it(NULL),
70 max_functions_it(NULL)
75 record= head->record[0];
76 tmp_record= head->getUpdateRecord();
77 read_time= read_cost_arg;
79 used_key_parts= used_key_parts_arg;
80 real_key_parts= used_key_parts_arg;
81 real_prefix_len= group_prefix_len + key_infix_len;
83 min_max_arg_len= min_max_arg_part ? min_max_arg_part->store_length : 0;
89 assert(! parent_alloc);
92 alloc.init(join->session->variables.range_alloc_block_size);
93 join->session->mem_root= &alloc;
96 alloc= memory::Root();
112 if (key_infix_len > 0)
118 unsigned char *tmp_key_infix=
alloc.alloc(key_infix_len);
119 memcpy(tmp_key_infix, this->
key_infix, key_infix_len);
123 if (min_max_arg_part)
128 while (
Item_sum* min_max_item= *(func_ptr++))
130 if (
have_min && (min_max_item->sum_func() == Item_sum::MIN_FUNC))
131 min_functions->push_back(min_max_item);
132 else if (
have_max && (min_max_item->sum_func() == Item_sum::MAX_FUNC))
133 max_functions->push_back(min_max_item);
137 min_functions_it=
new List<Item_sum>::iterator(min_functions->begin());
139 max_functions_it=
new List<Item_sum>::iterator(max_functions->begin());
144QuickGroupMinMaxSelect::~QuickGroupMinMaxSelect()
146 if (cursor->inited != Cursor::NONE)
148 cursor->endIndexScan();
150 if (min_max_arg_part)
152 for_each(min_max_ranges.begin(),
153 min_max_ranges.end(),
156 min_max_ranges.clear();
157 alloc.free_root(MYF(0));
158 delete min_functions_it;
159 delete max_functions_it;
160 delete quick_prefix_select;
167 uint32_t range_flag= sel_range->min_flag | sel_range->max_flag;
170 if ((range_flag & NO_MIN_RANGE) && (range_flag & NO_MAX_RANGE))
173 if (! (sel_range->min_flag & NO_MIN_RANGE) &&
174 ! (sel_range->max_flag & NO_MAX_RANGE))
176 if (sel_range->maybe_null &&
177 sel_range->min_value[0] && sel_range->max_value[0])
178 range_flag|= NULL_RANGE;
179 else if (memcmp(sel_range->min_value, sel_range->max_value,
181 range_flag|= EQ_RANGE;
185 make_keypart_map(sel_range->part),
186 sel_range->max_value,
188 make_keypart_map(sel_range->part),
203 for (
size_t inx= 0; inx < arr.size(); inx++)
204 reinterpret_cast<QuickRange**
>(arr.buffer)[inx]->flag &= ~(NEAR_MIN | NEAR_MAX);
218 if (! (cur_range->flag & NO_MIN_RANGE))
228 if (! (cur_range->flag & NO_MAX_RANGE))
236 else if (
have_min && min_max_arg_part &&
237 min_max_arg_part->field->real_maybe_null())
257 cursor->extra(HA_EXTRA_KEYREAD);
263 if (result == HA_ERR_END_OF_FILE)
277 int is_last_prefix= 0;
294 assert(is_last_prefix <= 0);
298 if (result == HA_ERR_KEY_NOT_FOUND)
332 }
while ((result == HA_ERR_KEY_NOT_FOUND || result == HA_ERR_END_OF_FILE) &&
333 is_last_prefix != 0);
345 else if (result == HA_ERR_KEY_NOT_FOUND)
346 result= HA_ERR_END_OF_FILE;
365 if (key_infix_len > 0)
381 if (min_max_arg_part && min_max_arg_part->field->is_null())
404 else if (result == HA_ERR_KEY_NOT_FOUND || result == HA_ERR_END_OF_FILE)
463 if (key_infix_len > 0)
474 ha_rkey_function find_flag;
475 key_part_map keypart_map;
477 bool found_null=
false;
478 int result= HA_ERR_KEY_NOT_FOUND;
479 basic_string<unsigned char> max_key;
494 ! (cur_range->flag & NO_MAX_RANGE) &&
496 (
const unsigned char*) cur_range->max_key,
500 if (cur_range->flag & NO_MIN_RANGE)
503 find_flag= HA_READ_KEY_EXACT;
510 cur_range->min_length);
512 find_flag= (cur_range->flag & (EQ_RANGE | NULL_RANGE)) ?
513 HA_READ_KEY_EXACT : (cur_range->flag & NEAR_MIN) ?
514 HA_READ_AFTER_KEY : HA_READ_KEY_OR_NEXT;
520 if ((result == HA_ERR_KEY_NOT_FOUND || result == HA_ERR_END_OF_FILE) &&
521 (cur_range->flag & (EQ_RANGE | NULL_RANGE)))
533 if (cur_range->flag & EQ_RANGE)
536 if (cur_range->flag & NULL_RANGE)
550 result= HA_ERR_KEY_NOT_FOUND;
555 if (! (cur_range->flag & NO_MAX_RANGE) )
560 max_key.append(cur_range->max_key, cur_range->max_length);
565 if (! (((cur_range->flag & NEAR_MAX) && (cmp_res == -1)) ||
568 result= HA_ERR_KEY_NOT_FOUND;
581 if (found_null && result)
592 ha_rkey_function find_flag;
593 key_part_map keypart_map;
596 basic_string<unsigned char> min_key;
601 for (vector<QuickRange *>::reverse_iterator rit=
min_max_ranges.rbegin();
612 ! (cur_range->flag & NO_MIN_RANGE) &&
614 (
const unsigned char*) cur_range->min_key,
618 if (cur_range->flag & NO_MAX_RANGE)
621 find_flag= HA_READ_PREFIX_LAST;
628 cur_range->max_length);
630 find_flag= (cur_range->flag & EQ_RANGE) ?
631 HA_READ_KEY_EXACT : (cur_range->flag & NEAR_MAX) ?
632 HA_READ_BEFORE_KEY : HA_READ_PREFIX_LAST_OR_PREV;
639 if ((result == HA_ERR_KEY_NOT_FOUND || result == HA_ERR_END_OF_FILE) &&
640 (cur_range->flag & EQ_RANGE))
650 if (cur_range->flag & EQ_RANGE)
658 if (! (cur_range->flag & NO_MIN_RANGE) )
663 min_key.append(cur_range->min_key, cur_range->min_length);
669 if (! (((cur_range->flag & NEAR_MIN) && (cmp_res == 1)) ||
676 return HA_ERR_KEY_NOT_FOUND;
682 *min_functions_it= min_functions->begin();
683 for (
Item_sum *min_func; (min_func= (*min_functions_it)++); )
690 *max_functions_it= max_functions->begin();
691 for (
Item_sum *max_func; (max_func= (*max_functions_it)++); )
697 string *used_lengths)
702 used_lengths->append(buf, length);
void add_keys_and_lengths(std::string *key_names, std::string *used_lengths)
unsigned char * key_infix
void adjust_prefix_ranges()
unsigned char * last_prefix
unsigned char * tmp_record
bool add_range(SEL_ARG *sel_range)
unsigned char * group_prefix
QuickRangeSelect * quick_prefix_select
std::vector< QuickRange * > min_max_ranges
uint32_t group_prefix_len
uint32_t max_used_key_length
void copy_fields(Tmp_Table_Param *param)
TODO: Rename this file - func.h is stupid.
int key_cmp(KeyPartInfo *key_part, const unsigned char *key, uint32_t key_length)