23#include <drizzled/sql_select.h>
24#include <drizzled/nested_join.h>
25#include <drizzled/item/cmpfunc.h>
26#include <drizzled/table.h>
27#include <drizzled/optimizer/key_field.h>
28#include <drizzled/optimizer/key_use.h>
29#include <drizzled/sql_lex.h>
30#include <drizzled/item/subselect.h>
31#include <drizzled/key_part_info.h>
43 Field *field= key_field->getField();
44 Table *form= field->getTable();
46 if (key_field->isEqualityCondition() &&
47 ! (key_field->getOptimizeFlags() & KEY_OPTIMIZE_EXISTS))
49 for (uint32_t key= 0; key < form->sizeKeys(); key++)
51 if (! (form->keys_in_use_for_query.test(key)))
54 uint32_t key_parts= (uint32_t) form->key_info[key].key_parts;
55 for (uint32_t part= 0; part < key_parts; part++)
57 if (field->eq(form->key_info[key].key_part[part].field))
60 key_field->getValue(),
61 key_field->getValue()->used_tables(),
64 key_field->getOptimizeFlags() & KEY_OPTIMIZE_REF_OR_NULL,
67 key_field->rejectNullValues(),
68 key_field->getConditionalGuard());
69 keyuse_array->push_back(&keyuse);
76void optimizer::add_key_fields_for_nj(
Join *join,
80 vector<optimizer::SargableParam> &sargables)
82 List<TableList>::iterator li(nested_join_table->getNestedJoin()->join_list.begin());
83 List<TableList>::iterator li2(nested_join_table->getNestedJoin()->join_list.begin());
84 bool have_another=
false;
87 assert(nested_join_table->getNestedJoin());
89 while ((table= li++) || (have_another && (li=li2, have_another=
false,
92 if (table->getNestedJoin())
99 li= List<TableList>::iterator(table->getNestedJoin()->join_list.begin());
102 add_key_fields_for_nj(join, table, end, and_level, sargables);
105 if (! table->on_expr)
106 tables|= table->table->map;
108 if (nested_join_table->on_expr)
113 nested_join_table->on_expr,
124 if (start == new_fields)
126 if (new_fields == end)
132 for (; new_fields != end; new_fields++)
136 if (old->getField() == new_fields->getField())
150 if (! new_fields->getValue()->const_item())
156 if (old->getValue()->eq(new_fields->getValue(), old->getField()->binary()))
158 old->setLevel(and_level);
159 old->setOptimizeFlags(((old->getOptimizeFlags() &
160 new_fields->getOptimizeFlags() &
161 KEY_OPTIMIZE_EXISTS) |
162 ((old->getOptimizeFlags() |
163 new_fields->getOptimizeFlags()) &
164 KEY_OPTIMIZE_REF_OR_NULL)));
165 old->setRejectNullValues(old->rejectNullValues() &&
166 new_fields->rejectNullValues());
169 else if (old->isEqualityCondition() &&
170 new_fields->isEqualityCondition() &&
171 old->getValue()->eq_by_collation(new_fields->getValue(),
172 old->getField()->binary(),
173 old->getField()->charset()))
176 old->setLevel(and_level);
177 old->setOptimizeFlags(((old->getOptimizeFlags() &
178 new_fields->getOptimizeFlags() &
179 KEY_OPTIMIZE_EXISTS) |
180 ((old->getOptimizeFlags() |
181 new_fields->getOptimizeFlags()) &
182 KEY_OPTIMIZE_REF_OR_NULL)));
183 old->setRejectNullValues(old->rejectNullValues() &&
184 new_fields->rejectNullValues());
186 else if (old->isEqualityCondition() &&
187 new_fields->isEqualityCondition() &&
188 ((old->getValue()->const_item() &&
189 old->getValue()->is_null()) ||
190 new_fields->getValue()->is_null()))
193 old->setLevel(and_level);
194 old->setOptimizeFlags(KEY_OPTIMIZE_REF_OR_NULL);
199 if (! old->getValue()->used_tables() &&
200 old->getValue()->is_null())
202 old->setValue(new_fields->getValue());
205 old->setRejectNullValues(
false);
214 if (old == --first_free)
225 if (old->getLevel() != and_level)
227 if (old == --first_free)
244 table_map usable_tables,
245 vector<optimizer::SargableParam> &sargables)
247 uint32_t exists_optimize= 0;
248 if (! (field->flags & PART_KEY_FLAG))
251 if (! eq_func || (*value)->type() != Item::NULL_ITEM ||
252 ! field->getTable()->maybe_null || field->null_ptr)
254 exists_optimize= KEY_OPTIMIZE_EXISTS;
255 assert(num_values == 1);
259 table_map used_tables= 0;
261 for (uint32_t i= 0; i < num_values; i++)
263 used_tables|= (value[i])->used_tables();
264 if (! ((value[i])->used_tables() & (field->getTable()->map | RAND_TABLE_BIT)))
269 if (! (usable_tables & field->getTable()->map))
271 if (! eq_func || (*value)->type() != Item::NULL_ITEM ||
272 ! field->getTable()->maybe_null || field->null_ptr)
274 exists_optimize= KEY_OPTIMIZE_EXISTS;
278 JoinTable *stat= field->getTable()->reginfo.join_tab;
279 key_map possible_keys= field->key_start;
280 possible_keys&= field->getTable()->keys_in_use_for_query;
281 stat[0].
keys|= possible_keys;
294 stat[0].key_dependent|= used_tables;
297 for (uint32_t i= 0; i < num_values; i++)
299 if (! (is_const&= value[i]->const_item()))
303 stat[0].const_keys|= possible_keys;
313 sargables.push_back(tmp);
334 if ((cond->functype() != Item_func::BETWEEN) ||
336 ! value[0]->eq(value[1], field->binary()))
341 if (field->result_type() == STRING_RESULT)
343 if ((*value)->result_type() != STRING_RESULT)
345 if (field->cmp_type() != (*value)->result_type())
354 if (field->cmp_type() == STRING_RESULT &&
355 ((
Field_str*)field)->charset() != cond->compare_collation())
367 (*key_fields)->setField(field);
368 (*key_fields)->setEqualityConditionUsed(eq_func);
369 (*key_fields)->setValue(*value);
370 (*key_fields)->setLevel(and_level);
371 (*key_fields)->setOptimizeFlags(exists_optimize);
379 (*key_fields)->setRejectNullValues((cond->functype() == Item_func::EQ_FUNC ||
380 cond->functype() == Item_func::MULT_EQUAL_FUNC) &&
381 ((*value)->type() == Item::FIELD_ITEM) &&
383 (*key_fields)->setConditionalGuard(NULL);
394 table_map usable_tables,
395 vector<optimizer::SargableParam> &sargables)
397 Field *field= field_item->field;
398 add_key_field(key_fields, and_level, cond, field,
399 eq_func, val, num_values, usable_tables, sargables);
400 Item_equal *item_equal= field_item->item_equal;
407 Item_equal_iterator it(item_equal->begin());
411 if (! field->eq(item->field))
413 add_key_field(key_fields, and_level, cond, item->field,
414 eq_func, val, num_values, usable_tables,
421void optimizer::add_key_fields(
Join *join,
425 table_map usable_tables,
426 vector<optimizer::SargableParam> &sargables)
428 if (cond->type() == Item_func::COND_ITEM)
430 List<Item>::iterator li(((
Item_cond*) cond)->argument_list()->begin());
433 if (((
Item_cond*) cond)->functype() == Item_func::COND_AND_FUNC)
445 for (; org_key_fields != *key_fields; org_key_fields++)
446 org_key_fields->setLevel(*and_level);
468 *key_fields= merge_key_fields(org_key_fields, start_key_fields,
469 *key_fields, ++(*and_level));
481 if (cond->type() == Item::FUNC_ITEM &&
482 ((
Item_func*)cond)->functype() == Item_func::TRIG_COND_FUNC)
485 if (! join->group_list &&
488 join->unit->item->substype() == Item_subselect::IN_SUBS &&
489 ! join->unit->is_union())
499 for (; save != *key_fields; save++)
507 if (cond->type() != Item::FUNC_ITEM)
510 switch (cond_func->select_optimize())
512 case Item_func::OPTIMIZE_NONE:
514 case Item_func::OPTIMIZE_KEY:
518 if (cond_func->key_item()->real_item()->type() == Item::FIELD_ITEM &&
519 ! (cond_func->used_tables() & OUTER_REF_TABLE_BIT))
521 values= cond_func->arguments() + 1;
522 if (cond_func->functype() == Item_func::NE_FUNC &&
523 cond_func->arguments()[1]->real_item()->type() == Item::FIELD_ITEM &&
524 ! (cond_func->arguments()[0]->used_tables() & OUTER_REF_TABLE_BIT))
526 assert(cond_func->functype() != Item_func::IN_FUNC ||
527 cond_func->argument_count() != 2);
528 add_key_equal_fields(key_fields, *and_level, cond_func,
529 (
Item_field*) (cond_func->key_item()->real_item()),
531 cond_func->argument_count()-1,
532 usable_tables, sargables);
534 if (cond_func->functype() == Item_func::BETWEEN)
536 values= cond_func->arguments();
537 for (uint32_t i= 1 ; i < cond_func->argument_count(); i++)
540 if (cond_func->arguments()[i]->real_item()->type() == Item::FIELD_ITEM
542 ! (cond_func->arguments()[i]->used_tables() & OUTER_REF_TABLE_BIT))
544 field_item= (
Item_field *) (cond_func->arguments()[i]->real_item());
545 add_key_equal_fields(key_fields, *and_level, cond_func,
546 field_item, 0, values, 1, usable_tables,
553 case Item_func::OPTIMIZE_OP:
555 bool equal_func= (cond_func->functype() == Item_func::EQ_FUNC ||
556 cond_func->functype() == Item_func::EQUAL_FUNC);
558 if (cond_func->arguments()[0]->real_item()->type() == Item::FIELD_ITEM &&
559 ! (cond_func->arguments()[0]->used_tables() & OUTER_REF_TABLE_BIT))
561 add_key_equal_fields(key_fields, *and_level, cond_func,
562 (
Item_field*) (cond_func->arguments()[0])->real_item(),
564 cond_func->arguments()+1, 1, usable_tables,
567 if (cond_func->arguments()[1]->real_item()->type() == Item::FIELD_ITEM &&
568 cond_func->functype() != Item_func::LIKE_FUNC &&
569 ! (cond_func->arguments()[1]->used_tables() & OUTER_REF_TABLE_BIT))
571 add_key_equal_fields(key_fields, *and_level, cond_func,
572 (
Item_field*) (cond_func->arguments()[1])->real_item(), equal_func,
573 cond_func->arguments(),1,usable_tables,
578 case Item_func::OPTIMIZE_NULL:
580 if (cond_func->arguments()[0]->real_item()->type() == Item::FIELD_ITEM &&
581 ! (cond_func->used_tables() & OUTER_REF_TABLE_BIT))
584 if (DRIZZLE_UNLIKELY(! tmp))
586 add_key_equal_fields(key_fields, *and_level, cond_func,
587 (
Item_field*) (cond_func->arguments()[0])->real_item(),
588 cond_func->functype() == Item_func::ISNULL_FUNC,
589 &tmp, 1, usable_tables, sargables);
592 case Item_func::OPTIMIZE_EQUAL:
594 Item *const_item= item_equal->get_const();
595 Item_equal_iterator it(item_equal->begin());
606 add_key_field(key_fields, *and_level, cond_func, item->field,
607 true, &const_item, 1, usable_tables, sargables);
618 Item_equal_iterator fi(item_equal->begin());
621 Field *field= item->field;
624 if (! field->eq(item->field))
626 add_key_field(key_fields, *and_level, cond_func, field,
627 true, (
Item **) &item, 1, usable_tables,
631 it= item_equal->begin();
TODO: Rename this file - func.h is stupid.