sql_select.cc 258 KB
Newer Older
1
/* Copyright (C) 2000-2003 MySQL AB & MySQL Finland AB & TCX DataKonsult AB
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

   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 */


/* mysql_select and join optimization */

#ifdef __GNUC__
#pragma implementation				// gcc: Class implementation
#endif

#include "mysql_priv.h"
#include "sql_select.h"
sasha@mysql.sashanet.com's avatar
sasha@mysql.sashanet.com committed
26

bk@work.mysql.com's avatar
bk@work.mysql.com committed
27 28 29 30 31
#include <m_ctype.h>
#include <hash.h>
#include <ft_global.h>

const char *join_type_str[]={ "UNKNOWN","system","const","eq_ref","ref",
32
			      "MAYBE_REF","ALL","range","index","fulltext",
33
			      "ref_or_null","unique_subquery","index_subquery"
34
};
bk@work.mysql.com's avatar
bk@work.mysql.com committed
35

36 37 38
const key_map key_map_empty(0);
const key_map key_map_full(~0);

39
static void optimize_keyuse(JOIN *join, DYNAMIC_ARRAY *keyuse_array);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
40
static bool make_join_statistics(JOIN *join,TABLE_LIST *tables,COND *conds,
41
				 DYNAMIC_ARRAY *keyuse);
42 43
static bool update_ref_and_keys(THD *thd, DYNAMIC_ARRAY *keyuse,
				JOIN_TAB *join_tab,
44 45
                                uint tables, COND *conds,
				table_map table_map, SELECT_LEX *select_lex);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
46 47
static int sort_keyuse(KEYUSE *a,KEYUSE *b);
static void set_position(JOIN *join,uint index,JOIN_TAB *table,KEYUSE *key);
48 49
static bool create_ref_for_key(JOIN *join, JOIN_TAB *j, KEYUSE *org_keyuse,
			       table_map used_tables);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
50 51 52 53 54 55
static void find_best_combination(JOIN *join,table_map rest_tables);
static void find_best(JOIN *join,table_map rest_tables,uint index,
		      double record_count,double read_time);
static uint cache_record_length(JOIN *join,uint index);
static double prev_record_reads(JOIN *join,table_map found_ref);
static bool get_best_combination(JOIN *join);
56 57
static store_key *get_store_key(THD *thd,
				KEYUSE *keyuse, table_map used_tables,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
58 59 60 61 62
				KEY_PART_INFO *key_part, char *key_buff,
				uint maybe_null);
static bool make_simple_join(JOIN *join,TABLE *tmp_table);
static bool make_join_select(JOIN *join,SQL_SELECT *select,COND *item);
static void make_join_readinfo(JOIN *join,uint options);
63
static bool only_eq_ref_tables(JOIN *join, ORDER *order, table_map tables);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
64 65 66 67
static void update_depend_map(JOIN *join);
static void update_depend_map(JOIN *join, ORDER *order);
static ORDER *remove_const(JOIN *join,ORDER *first_order,COND *cond,
			   bool *simple_order);
68
static int return_zero_rows(JOIN *join, select_result *res,TABLE_LIST *tables,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
69 70
			    List<Item> &fields, bool send_row,
			    uint select_options, const char *info,
71 72
			    Item *having, Procedure *proc,
			    SELECT_LEX_UNIT *unit);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
73 74 75 76 77
static COND *optimize_cond(COND *conds,Item::cond_result *cond_value);
static COND *remove_eq_conds(COND *cond,Item::cond_result *cond_value);
static bool const_expression_in_where(COND *conds,Item *item, Item **comp_item);
static bool open_tmp_table(TABLE *table);
static bool create_myisam_tmp_table(TABLE *table,TMP_TABLE_PARAM *param,
78
				    ulong options);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
79 80 81 82
static int do_select(JOIN *join,List<Item> *fields,TABLE *tmp_table,
		     Procedure *proc);
static int sub_select_cache(JOIN *join,JOIN_TAB *join_tab,bool end_of_records);
static int sub_select(JOIN *join,JOIN_TAB *join_tab,bool end_of_records);
83
static int flush_cached_records(JOIN *join,JOIN_TAB *join_tab,bool skip_last);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
84 85 86 87 88 89 90 91 92
static int end_send(JOIN *join, JOIN_TAB *join_tab, bool end_of_records);
static int end_send_group(JOIN *join, JOIN_TAB *join_tab,bool end_of_records);
static int end_write(JOIN *join, JOIN_TAB *join_tab, bool end_of_records);
static int end_update(JOIN *join, JOIN_TAB *join_tab, bool end_of_records);
static int end_unique_update(JOIN *join,JOIN_TAB *join_tab,
			     bool end_of_records);
static int end_write_group(JOIN *join, JOIN_TAB *join_tab,
			   bool end_of_records);
static int test_if_group_changed(List<Item_buff> &list);
93
static int join_read_const_table(JOIN_TAB *tab, POSITION *pos);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
94 95 96 97
static int join_read_system(JOIN_TAB *tab);
static int join_read_const(JOIN_TAB *tab);
static int join_read_key(JOIN_TAB *tab);
static int join_read_always_key(JOIN_TAB *tab);
98
static int join_read_last_key(JOIN_TAB *tab);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
99 100 101 102 103
static int join_no_more_records(READ_RECORD *info);
static int join_read_next(READ_RECORD *info);
static int join_init_quick_read_record(JOIN_TAB *tab);
static int test_if_quick_select(JOIN_TAB *tab);
static int join_init_read_record(JOIN_TAB *tab);
104 105 106 107 108 109
static int join_read_first(JOIN_TAB *tab);
static int join_read_next(READ_RECORD *info);
static int join_read_next_same(READ_RECORD *info);
static int join_read_last(JOIN_TAB *tab);
static int join_read_prev_same(READ_RECORD *info);
static int join_read_prev(READ_RECORD *info);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
110 111
static int join_ft_read_first(JOIN_TAB *tab);
static int join_ft_read_next(READ_RECORD *info);
112 113
static int join_read_always_key_or_null(JOIN_TAB *tab);
static int join_read_next_same_or_null(READ_RECORD *info);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
114 115 116
static COND *make_cond_for_table(COND *cond,table_map table,
				 table_map used_table);
static Item* part_of_refkey(TABLE *form,Field *field);
serg@serg.mylan's avatar
serg@serg.mylan committed
117
static uint find_shortest_key(TABLE *table, const key_map *usable_keys);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
118
static bool test_if_skip_sort_order(JOIN_TAB *tab,ORDER *order,
119
				    ha_rows select_limit, bool no_changes);
120
static int create_sort_index(THD *thd, JOIN *join, ORDER *order,
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
121
			     ha_rows filesort_limit, ha_rows select_limit);
122 123
static int remove_duplicates(JOIN *join,TABLE *entry,List<Item> &fields,
			     Item *having);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
124
static int remove_dup_with_compare(THD *thd, TABLE *entry, Field **field,
125
				   ulong offset,Item *having);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
126 127
static int remove_dup_with_hash_index(THD *thd, TABLE *table,
				      uint field_count, Field **first_field,
128
				      ulong key_length,Item *having);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
129 130 131 132 133 134 135 136
static int join_init_cache(THD *thd,JOIN_TAB *tables,uint table_count);
static ulong used_blob_length(CACHE_FIELD **ptr);
static bool store_record_in_cache(JOIN_CACHE *cache);
static void reset_cache(JOIN_CACHE *cache);
static void read_cached_record(JOIN_TAB *tab);
static bool cmp_buffer_with_ref(JOIN_TAB *tab);
static bool setup_new_fields(THD *thd,TABLE_LIST *tables,List<Item> &fields,
			     List<Item> &all_fields,ORDER *new_order);
137 138 139
static ORDER *create_distinct_group(THD *thd, ORDER *order,
				    List<Item> &fields,
				    bool *all_order_by_fields_used);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
140 141 142
static bool test_if_subpart(ORDER *a,ORDER *b);
static TABLE *get_sort_by_table(ORDER *a,ORDER *b,TABLE_LIST *tables);
static void calc_group_buffer(JOIN *join,ORDER *group);
143
static bool make_group_fields(JOIN *main_join, JOIN *curr_join);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
144
static bool alloc_group_fields(JOIN *join,ORDER *group);
145
// Create list for using with tempory table
146
static bool change_to_use_tmp_fields(THD *thd, Item **ref_pointer_array,
147 148 149 150 151 152 153 154
				     List<Item> &new_list1,
				     List<Item> &new_list2,
				     uint elements, List<Item> &items);
// Create list for using with tempory table
static bool change_refs_to_tmp_fields(THD *thd, Item **ref_pointer_array,
				      List<Item> &new_list1,
				      List<Item> &new_list2,
				      uint elements, List<Item> &items);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
155 156 157 158
static void init_tmptable_sum_functions(Item_sum **func);
static void update_tmptable_sum_func(Item_sum **func,TABLE *tmp_table);
static void copy_sum_funcs(Item_sum **func_ptr);
static bool add_ref_to_table_cond(THD *thd, JOIN_TAB *join_tab);
159
static bool init_sum_functions(Item_sum **func, Item_sum **end);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
160
static bool update_sum_func(Item_sum **func);
161
static void select_describe(JOIN *join, bool need_tmp_table,bool need_order,
162
			    bool distinct, const char *message=NullS);
163
static Item *remove_additional_cond(Item* conds);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
164

165

166 167 168 169 170 171 172 173
/*
  This handles SELECT with and without UNION
*/

int handle_select(THD *thd, LEX *lex, select_result *result)
{
  int res;
  register SELECT_LEX *select_lex = &lex->select_lex;
174 175
  DBUG_ENTER("handle_select");

176
  fix_tables_pointers(lex->all_selects_list);
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
177
  if (select_lex->next_select())
178
    res=mysql_union(thd, lex, result, &lex->unit);
179
  else
180 181 182 183 184 185 186 187 188 189 190
    res= mysql_select(thd, &select_lex->ref_pointer_array,
		      (TABLE_LIST*) select_lex->table_list.first,
		      select_lex->with_wild, select_lex->item_list,
		      select_lex->where,
		      select_lex->order_list.elements +
		      select_lex->group_list.elements,
		      (ORDER*) select_lex->order_list.first,
		      (ORDER*) select_lex->group_list.first,
		      select_lex->having,
		      (ORDER*) lex->proc_list.first,
		      select_lex->options | thd->options,
191
		      result, &(lex->unit), &(lex->select_lex));
192

193 194 195 196
  /* Don't set res if it's -1 as we may want this later */
  DBUG_PRINT("info",("res: %d  report_error: %d", res,
		     thd->net.report_error));
  if (thd->net.report_error)
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
197
    res= 1;
198 199 200 201 202 203 204 205 206 207
  if (res)
  {
    if (result)
    {
      result->send_error(0, NullS);
      result->abort();
    }
    else
      send_error(thd, 0, NullS);
    res= 1;					// Error sent to client
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
208
  }
209
  delete result;
210
  DBUG_RETURN(res);
211 212
}

213 214 215 216 217 218

void relink_tables(SELECT_LEX *select_lex)
{
  for (TABLE_LIST *cursor= (TABLE_LIST *) select_lex->table_list.first;
       cursor;
       cursor=cursor->next)
219 220
    if (cursor->table_list)
      cursor->table= cursor->table_list->table;
221 222 223
}


bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
224 225 226 227 228 229 230 231
void fix_tables_pointers(SELECT_LEX *select_lex)
{
  if (select_lex->next_select_in_list())
  {
    /* Fix tables 'to-be-unioned-from' list to point at opened tables */
    for (SELECT_LEX *sl= select_lex;
	 sl;
	 sl= sl->next_select_in_list())
232
      relink_tables(sl);
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
233 234
  }
}
235

236 237 238 239 240
void fix_tables_pointers(SELECT_LEX_UNIT *unit)
{
  for (SELECT_LEX *sl= unit->first_select(); sl; sl= sl->next_select())
  {
    relink_tables(sl);
241
    for (SELECT_LEX_UNIT *un= sl->first_inner_unit(); un; un= un->next_unit())
242 243 244 245
      fix_tables_pointers(un);
  }
}

246

247
/*
248
  Function to setup clauses without sum functions
249
*/
250 251
inline int setup_without_group(THD *thd, Item **ref_pointer_array,
			       TABLE_LIST *tables,
252 253 254 255 256 257 258 259
			       List<Item> &fields,
			       List<Item> &all_fields,
			       COND **conds,
			       ORDER *order,
			       ORDER *group, bool *hidden_group_fields)
{
  bool save_allow_sum_func= thd->allow_sum_func;
  thd->allow_sum_func= 0;
260 261 262 263 264
  int res= (setup_conds(thd, tables, conds) ||
	    setup_order(thd, ref_pointer_array, tables, fields, all_fields,
			order) ||
	    setup_group(thd, ref_pointer_array, tables, fields, all_fields,
			group, hidden_group_fields));
265 266 267 268
  thd->allow_sum_func= save_allow_sum_func;
  return res;
}

bk@work.mysql.com's avatar
bk@work.mysql.com committed
269
/*****************************************************************************
270 271
  Check fields, find best join, do the select and output fields.
  mysql_select assumes that all tables are already opened
bk@work.mysql.com's avatar
bk@work.mysql.com committed
272 273
*****************************************************************************/

274 275 276 277 278
/*
  Prepare of whole select (including subselect in future).
  return -1 on error
          0 on success
*/
bk@work.mysql.com's avatar
bk@work.mysql.com committed
279
int
280 281 282 283
JOIN::prepare(Item ***rref_pointer_array,
	      TABLE_LIST *tables_init,
	      uint wild_num, COND *conds_init, uint og_num,
	      ORDER *order_init, ORDER *group_init,
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
284
	      Item *having_init,
285 286
	      ORDER *proc_param_init, SELECT_LEX *select_lex_arg,
	      SELECT_LEX_UNIT *unit_arg)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
287
{
288
  DBUG_ENTER("JOIN::prepare");
289

290 291 292 293 294 295
  conds= conds_init;
  order= order_init;
  group_list= group_init;
  having= having_init;
  proc_param= proc_param_init;
  tables_list= tables_init;
296
  select_lex= select_lex_arg;
297
  select_lex->join= this;
298
  union_part= (unit_arg->first_select()->next_select() != 0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
299 300 301

  /* Check that all tables, fields, conds and order are ok */

302
  if (setup_tables(tables_list, 0) ||
303
      setup_wild(thd, tables_list, fields_list, &all_fields, wild_num) ||
bell@laptop.sanja.is.com.ua's avatar
bell@laptop.sanja.is.com.ua committed
304
      select_lex->setup_ref_array(thd, og_num) ||
305 306 307 308 309
      setup_fields(thd, (*rref_pointer_array), tables_list, fields_list, 1,
		   &all_fields, 1) ||
      setup_without_group(thd, (*rref_pointer_array), tables_list, fields_list,
			  all_fields, &conds, order, group_list, 
			  &hidden_group_fields))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
310 311
    DBUG_RETURN(-1);				/* purecov: inspected */

312
  ref_pointer_array= *rref_pointer_array;
313
  
bk@work.mysql.com's avatar
bk@work.mysql.com committed
314 315 316 317
  if (having)
  {
    thd->where="having clause";
    thd->allow_sum_func=1;
318
    select_lex->having_fix_field= 1;
319 320
    bool having_fix_rc= (having->fix_fields(thd, tables_list, &having) ||
			 having->check_cols(1));
321
    select_lex->having_fix_field= 0;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
322
    if (having_fix_rc || thd->net.report_error)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
323 324
      DBUG_RETURN(-1);				/* purecov: inspected */
    if (having->with_sum_func)
325
      having->split_sum_func(ref_pointer_array, all_fields);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
326
  }
327

328 329 330 331
  // Is it subselect
  {
    Item_subselect *subselect;
    if ((subselect= select_lex->master_unit()->item) &&
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
332
	select_lex->linkage != GLOBAL_OPTIONS_TYPE)
333 334
    {
      Item_subselect::trans_res res;
335
      if ((res= subselect->select_transformer(this)) !=
336 337
	  Item_subselect::RES_OK)
	DBUG_RETURN((res == Item_subselect::RES_ERROR));
338 339 340
    }
  }

341
  if (setup_ftfuncs(select_lex)) /* should be after having->fix_fields */
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
342
    DBUG_RETURN(-1);
343 344
  

bk@work.mysql.com's avatar
bk@work.mysql.com committed
345 346 347 348 349
  /*
    Check if one one uses a not constant column with group functions
    and no GROUP BY.
    TODO:  Add check of calculation of GROUP functions and fields:
	   SELECT COUNT(*)+table.col1 from table1;
350
  */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
351
  {
352
    if (!group_list)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
353 354
    {
      uint flag=0;
355
      List_iterator_fast<Item> it(fields_list);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
356 357 358 359 360
      Item *item;
      while ((item= it++))
      {
	if (item->with_sum_func)
	  flag|=1;
monty@donna.mysql.fi's avatar
monty@donna.mysql.fi committed
361
	else if (!(flag & 2) && !item->const_item())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
362 363 364 365 366 367 368 369
	  flag|=2;
      }
      if (flag == 3)
      {
	my_error(ER_MIX_OF_GROUP_FUNC_AND_FIELDS,MYF(0));
	DBUG_RETURN(-1);
      }
    }
370 371
    TABLE_LIST *table_ptr;
    for (table_ptr= tables_list ; table_ptr ; table_ptr= table_ptr->next)
372
      tables++;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
373
  }
374 375 376
  {
    /* Caclulate the number of groups */
    send_group_parts= 0;
377
    for (ORDER *group_tmp= group_list ; group_tmp ; group_tmp= group_tmp->next)
378 379 380
      send_group_parts++;
  }
  
381
  procedure= setup_procedure(thd, proc_param, result, fields_list, &error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
382
  if (error)
383
    goto err;					/* purecov: inspected */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
384 385
  if (procedure)
  {
386 387
    if (setup_new_fields(thd, tables_list, fields_list, all_fields,
			 procedure->param_fields))
388
	goto err;				/* purecov: inspected */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
389 390
    if (procedure->group)
    {
391
      if (!test_if_subpart(procedure->group,group_list))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
392 393 394
      {						/* purecov: inspected */
	my_message(0,"Can't handle procedures with differents groups yet",
		   MYF(0));			/* purecov: inspected */
395
	goto err;				/* purecov: inspected */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
396 397 398
      }
    }
#ifdef NOT_NEEDED
399
    else if (!group_list && procedure->flags & PROC_GROUP)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
400 401
    {
      my_message(0,"Select must have a group with this procedure",MYF(0));
402
      goto err;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
403 404 405
    }
#endif
    if (order && (procedure->flags & PROC_NO_SORT))
406
    {						/* purecov: inspected */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
407
      my_message(0,"Can't use order with this procedure",MYF(0)); /* purecov: inspected */
408
      goto err;					/* purecov: inspected */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
409 410 411 412
    }
  }

  /* Init join struct */
413
  count_field_types(&tmp_table_param, all_fields, 0);
414
  ref_pointer_array_size= all_fields.elements*sizeof(Item*);
415 416
  this->group= group_list != 0;
  row_limit= ((select_distinct || order || group_list) ? HA_POS_ERROR :
417
	      unit_arg->select_limit_cnt);
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
418
  /* select_limit is used to decide if we are likely to scan the whole table */
419
  select_limit= unit_arg->select_limit_cnt;
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
420 421
  if (having || (select_options & OPTION_FOUND_ROWS))
    select_limit= HA_POS_ERROR;
422 423
  do_send_rows = (unit_arg->select_limit_cnt) ? 1 : 0;
  unit= unit_arg;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
424 425

#ifdef RESTRICTED_GROUP
426
  if (sum_func_count && !group_list && (func_count || field_count))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
427
  {
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
428
    my_message(ER_WRONG_SUM_SELECT,ER(ER_WRONG_SUM_SELECT),MYF(0));
429
    goto err;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
430 431
  }
#endif
432
  if (!procedure && result->prepare(fields_list, unit_arg))
433 434 435 436 437 438 439
    goto err;					/* purecov: inspected */

  if (select_lex->olap == ROLLUP_TYPE && rollup_init())
    goto err;
  if (alloc_func_list())
    goto err;

440
  DBUG_RETURN(0); // All OK
441 442 443 444 445

err:
  delete procedure;				/* purecov: inspected */
  procedure= 0;
  DBUG_RETURN(-1);				/* purecov: inspected */
446
}
bk@work.mysql.com's avatar
bk@work.mysql.com committed
447

448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463
/*
  test if it is known for optimisation IN subquery

  SYNOPSYS
    JOIN::test_in_subselect
    where - pointer for variable in which conditions should be
            stored if subquery is known

  RETURN
    1 - known
    0 - unknown
*/

bool JOIN::test_in_subselect(Item **where)
{
  if (conds->type() == Item::FUNC_ITEM &&
464
      ((Item_func *)this->conds)->functype() == Item_func::EQ_FUNC &&
465 466 467 468 469 470 471 472 473 474 475
      ((Item_func *)conds)->arguments()[0]->type() == Item::REF_ITEM &&
      ((Item_func *)conds)->arguments()[1]->type() == Item::FIELD_ITEM)
  {
    join_tab->info= "Using index";
    *where= 0;
    return 1;
  }
  if (conds->type() == Item::COND_ITEM &&
      ((class Item_func *)this->conds)->functype() ==
      Item_func::COND_AND_FUNC)
  {
476 477 478 479
    if ((*where= remove_additional_cond(conds)))
      join_tab->info= "Using index; Using where";
    else
      join_tab->info= "Using index";
480 481 482 483 484 485
    return 1;
  }
  return 0;
}


486 487 488
/*
  global select optimisation.
  return 0 - success
489
         1 - error
490 491 492 493 494 495
  error code saved in field 'error'
*/
int
JOIN::optimize()
{
  DBUG_ENTER("JOIN::optimize");
496
  // to prevent double initialization on EXPLAIN
497 498 499
  if (optimized)
    DBUG_RETURN(0);
  optimized= 1;
500

501
  // Ignore errors of execution if option IGNORE present
502 503
  if (thd->lex->duplicates == DUP_IGNORE)
    thd->lex->current_select->no_error= 1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
504 505
#ifdef HAVE_REF_TO_FIELDS			// Not done yet
  /* Add HAVING to WHERE if possible */
506
  if (having && !group_list && !sum_func_count)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
507 508 509
  {
    if (!conds)
    {
510 511
      conds= having;
      having= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
512 513 514
    }
    else if ((conds=new Item_cond_and(conds,having)))
    {
515
      conds->fix_fields(thd, tables_list, &conds);
516
      conds->change_ref_to_fields(thd, tables_list);
517
      conds->top_level_item();
518
      having= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
519 520 521 522
    }
  }
#endif

523
  conds= optimize_cond(conds,&cond_value);
524
  if (thd->net.report_error)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
525
  {
serg@serg.mylan's avatar
serg@serg.mylan committed
526
    error= 1;
527
    DBUG_PRINT("error",("Error from optimize_cond"));
528
    DBUG_RETURN(1);
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
529
  }
530

monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
531 532
  if (cond_value == Item::COND_FALSE ||
      (!unit->select_limit_cnt && !(select_options & OPTION_FOUND_ROWS)))
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
533
  {						/* Impossible cond */
534
    zero_result_cause= "Impossible WHERE";
535
    error= 0;
536
    DBUG_RETURN(0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
537 538 539
  }

  /* Optimize count(*), min() and max() */
540
  if (tables_list && tmp_table_param.sum_func_count && ! group_list)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
541 542
  {
    int res;
543
    /*
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
544 545
      opt_sum_query() returns -1 if no rows match to the WHERE conditions,
      or 1 if all items were resolved, or 0, or an error number HA_ERR_...
546
    */
547
    if ((res=opt_sum_query(tables_list, all_fields, conds)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
548
    {
549 550
      if (res > 1)
      {
551
	DBUG_RETURN(1);
552
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
553 554
      if (res < 0)
      {
555
	zero_result_cause= "No matching min/max row";
serg@serg.mylan's avatar
serg@serg.mylan committed
556
	error=0;
557
	DBUG_RETURN(0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
558
      }
559
      zero_result_cause= "Select tables optimized away";
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
560
      tables_list= 0;				// All tables resolved
bk@work.mysql.com's avatar
bk@work.mysql.com committed
561 562
    }
  }
563
  if (!tables_list)
564 565
  {
    error= 0;
566
    DBUG_RETURN(0);
567
  }
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
568
  error= -1;					// Error is sent to client
569
  sort_by_table= get_sort_by_table(order, group_list, tables_list);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
570 571

  /* Calculate how to do the join */
572 573
  thd->proc_info= "statistics";
  if (make_join_statistics(this, tables_list, conds, &keyuse) ||
574
      thd->is_fatal_error)
575 576
  {
    DBUG_PRINT("error",("Error: make_join_statistics() failed"));
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
577
    DBUG_RETURN(1);
578
  }
579

monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
580 581
  /* Remove distinct if only const tables */
  select_distinct= select_distinct && (const_tables != tables);
582
  thd->proc_info= "preparing";
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
583
  if (result->initialize_tables(this))
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
584
  {
585 586
    DBUG_PRINT("error",("Error: initialize_tables() failed"));
    DBUG_RETURN(1);				// error == -1
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
587
  }
588
  if (const_table_map != found_const_table_map &&
589
      !(select_options & SELECT_DESCRIBE))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
590
  {
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
591
    zero_result_cause= "no matching row in const table";
592
    DBUG_PRINT("error",("Error: %s", zero_result_cause));
593
    select_options= 0; //TODO why option in return_zero_rows was droped
594
    error= 0;
595
    DBUG_RETURN(0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
596 597
  }
  if (!(thd->options & OPTION_BIG_SELECTS) &&
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
598
      best_read > (double) thd->variables.max_join_size &&
bk@work.mysql.com's avatar
bk@work.mysql.com committed
599 600
      !(select_options & SELECT_DESCRIBE))
  {						/* purecov: inspected */
601
    my_message(ER_TOO_BIG_SELECT, ER(ER_TOO_BIG_SELECT), MYF(0));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
602
    error= 1;					/* purecov: inspected */
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
603
    DBUG_RETURN(1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
604
  }
605
  if (const_tables && !thd->locked_tables &&
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
606
      !(select_options & SELECT_NO_UNLOCK))
607
  {
608
    TABLE **curr_table, **end;
609
    for (curr_table= table, end=curr_table + const_tables ;
610 611
	 curr_table != end;
	 curr_table++)
612 613
    {
      /* BDB tables require that we call index_end() before doing an unlock */
614
      if ((*curr_table)->key_read)
615
      {
616 617
	(*curr_table)->key_read=0;
	(*curr_table)->file->extra(HA_EXTRA_NO_KEYREAD);
618
      }
619
      (*curr_table)->file->index_end();
620
    }
621
    mysql_unlock_some_tables(thd, table, const_tables);
622
  }
623
  if (!conds && outer_join)
624 625 626 627
  {
    /* Handle the case where we have an OUTER JOIN without a WHERE */
    conds=new Item_int((longlong) 1,1);	// Always true
  }
628 629
  select=make_select(*table, const_table_map,
		     const_table_map, conds, &error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
630
  if (error)
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
631 632
  {						/* purecov: inspected */
    error= -1;					/* purecov: inspected */
633
    DBUG_PRINT("error",("Error: make_select() failed"));
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
634
    DBUG_RETURN(1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
635
  }
636
  if (make_join_select(this, select, conds))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
637
  {
638 639
    zero_result_cause=
      "Impossible WHERE noticed after reading const tables";
640
    DBUG_RETURN(0);				// error == 0
bk@work.mysql.com's avatar
bk@work.mysql.com committed
641 642 643 644 645
  }

  error= -1;					/* if goto err */

  /* Optimize distinct away if possible */
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
646 647
  {
    ORDER *org_order= order;
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
648
    order=remove_const(this, order,conds,&simple_order);
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
649 650 651 652 653 654 655
    /*
      If we are using ORDER BY NULL or ORDER BY const_expression,
      return result in any order (even if we are using a GROUP BY)
    */
    if (!order && org_order)
      skip_sort_order= 1;
  }
656 657
  order= remove_const(this, order, conds, &simple_order);
  if (group_list || tmp_table_param.sum_func_count)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
658 659 660 661
  {
    if (! hidden_group_fields)
      select_distinct=0;
  }
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
662
  else if (select_distinct && tables - const_tables == 1)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
663
  {
664 665 666 667 668 669 670 671 672 673 674 675 676 677 678
    /*
      We are only using one table. In this case we change DISTINCT to a
      GROUP BY query if:
      - The GROUP BY can be done through indexes (no sort) and the ORDER
        BY only uses selected fields.
	(In this case we can later optimize away GROUP BY and ORDER BY)
      - We are scanning the whole table without LIMIT
        This can happen if:
        - We are using CALC_FOUND_ROWS
        - We are using an ORDER BY that can't be optimized away.

      We don't want to use this optimization when we are using LIMIT
      because in this case we can just create a temporary table that
      holds LIMIT rows and stop when this table is full.
    */
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
679
    JOIN_TAB *tab= &join_tab[const_tables];
680 681 682
    bool all_order_fields_used;
    if (order)
      skip_sort_order= test_if_skip_sort_order(tab, order, select_limit, 1);
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
683 684
    if ((group_list=create_distinct_group(thd, order, fields_list,
				          &all_order_fields_used)))
685 686
    {
      bool skip_group= (skip_sort_order &&
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
687
			test_if_skip_sort_order(tab, group_list, select_limit,
688 689 690 691 692 693 694 695 696
						1) != 0);
      if ((skip_group && all_order_fields_used) ||
	  select_limit == HA_POS_ERROR ||
	  (order && !skip_sort_order))
      {
	/*  Change DISTINCT to GROUP BY */
	select_distinct= 0;
	no_order= !order;
	if (all_order_fields_used)
697 698 699 700 701 702
	{
	  if (order && skip_sort_order)
	  {
	    /*
	      Force MySQL to read the table in sorted order to get result in
	      ORDER BY order.
serg@serg.mylan's avatar
serg@serg.mylan committed
703
	    */
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
704
	    tmp_table_param.quick_group=0;
705
	  }
706
	  order=0;
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
707
        }
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
708
	group=1;				// For end_write_group
709 710
      }
      else
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
711
	group_list= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
712
    }
713
    else if (thd->is_fatal_error)			// End of memory
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
714
      DBUG_RETURN(1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
715
  }
716 717 718
  simple_group= 0;
  if (rollup.state == ROLLUP::STATE_NONE)
    group_list= remove_const(this, group_list, conds, &simple_group);
719
  if (!group_list && group)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
720 721 722 723 724
  {
    order=0;					// The output has only one row
    simple_order=1;
  }

725 726
  calc_group_buffer(this, group_list);
  send_group_parts= tmp_table_param.group_parts; /* Save org parts */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
727 728
  if (procedure && procedure->group)
  {
729 730 731
    group_list= procedure->group= remove_const(this, procedure->group, conds,
					       &simple_group);
    calc_group_buffer(this, group_list);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
732 733
  }

734 735
  if (test_if_subpart(group_list, order) ||
      (!group_list && tmp_table_param.sum_func_count))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
736 737
    order=0;

monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
738
  // Can't use sort on head table if using row cache
739
  if (full_join)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
740
  {
741
    if (group_list)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
742 743 744 745 746
      simple_group=0;
    if (order)
      simple_order=0;
  }

747 748 749 750 751 752 753 754 755
  /*
    Check if we need to create a temporary table.
    This has to be done if all tables are not already read (const tables)
    and one of the following conditions holds:
    - We are using DISTINCT (simple distinct's are already optimized away)
    - We are using an ORDER BY or GROUP BY on fields not in the first table
    - We are using different ORDER BY and GROUP BY orders
    - The user wants us to buffer the result.
  */
756
  need_tmp= (const_tables != tables &&
bk@work.mysql.com's avatar
bk@work.mysql.com committed
757
	     ((select_distinct || !simple_order || !simple_group) ||
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
758
	      (group_list && order) ||
759
	      test(select_options & OPTION_BUFFER_RESULT)));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
760

761
  // No cache for MATCH
762
  make_join_readinfo(this,
763
		     (select_options & (SELECT_DESCRIBE |
764
					SELECT_NO_JOIN_CACHE)) |
serg@serg.mylan's avatar
serg@serg.mylan committed
765
		     (select_lex->ftfunc_list->elements ?
766
		      SELECT_NO_JOIN_CACHE : 0));
monty@donna.mysql.com's avatar
monty@donna.mysql.com committed
767

768 769 770
  /*
    is this simple IN subquery?
  */
771
  if (!group_list && !order &&
772
      unit->item && unit->item->substype() == Item_subselect::IN_SUBS &&
773
      tables == 1 && conds &&
774 775
      !unit->first_select()->next_select())
  {
776
    if (!having)
777
    {
778
      Item *where= 0;
779 780
      if (join_tab[0].type == JT_EQ_REF &&
	  join_tab[0].ref.items[0]->name == in_left_expr_name)
781
      {
782 783
	if (test_in_subselect(&where))
	{
784
	  join_tab[0].type= JT_UNIQUE_SUBQUERY;
785 786
	  error= 0;
	  DBUG_RETURN(unit->item->
787 788 789 790 791
		      change_engine(new
				    subselect_uniquesubquery_engine(thd,
								    join_tab,
								    unit->item,
								    where)));
792
	}
793
      }
794 795
      else if (join_tab[0].type == JT_REF &&
	       join_tab[0].ref.items[0]->name == in_left_expr_name)
796
      {
797 798
	if (test_in_subselect(&where))
	{
799
	  join_tab[0].type= JT_INDEX_SUBQUERY;
800 801
	  error= 0;
	  DBUG_RETURN(unit->item->
802 803 804 805 806 807
		      change_engine(new
				    subselect_indexsubquery_engine(thd,
								   join_tab,
								   unit->item,
								   where,
								   0)));
808
	}
809
      }
810
    } else if (join_tab[0].type == JT_REF_OR_NULL &&
811
	       join_tab[0].ref.items[0]->name == in_left_expr_name &&
812 813 814 815
	       having->type() == Item::FUNC_ITEM &&
	       ((Item_func *) having)->functype() ==
	       Item_func::ISNOTNULLTEST_FUNC)
    {
816
      join_tab[0].type= JT_INDEX_SUBQUERY;
817
      error= 0;
818 819 820 821 822 823

      if ((conds= remove_additional_cond(conds)))
	join_tab->info= "Using index; Using where";
      else
	join_tab->info= "Using index";
 
824
      DBUG_RETURN(unit->item->
825 826 827 828 829
		  change_engine(new subselect_indexsubquery_engine(thd,
								   join_tab,
								   unit->item,
								   conds,
								   1)));
830
    }
831

832
  }
833 834 835 836 837 838 839
  /*
    Need to tell Innobase that to play it safe, it should fetch all
    columns of the tables: this is because MySQL may build row
    pointers for the rows, and for all columns of the primary key the
    field->query_id has not necessarily been set to thd->query_id by
    MySQL.
  */
monty@donna.mysql.com's avatar
monty@donna.mysql.com committed
840 841

#ifdef HAVE_INNOBASE_DB
842
  if (need_tmp || select_distinct || group_list || order)
monty@donna.mysql.com's avatar
monty@donna.mysql.com committed
843
  {
844
    for (uint i_h = const_tables; i_h < tables; i_h++)
monty@donna.mysql.com's avatar
monty@donna.mysql.com committed
845
    {
846
      TABLE* table_h = join_tab[i_h].table;
847
      if (table_h->db_type == DB_TYPE_INNODB)
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
848
	table_h->file->extra(HA_EXTRA_RETRIEVE_ALL_COLS);
monty@donna.mysql.com's avatar
monty@donna.mysql.com committed
849 850 851 852
    }
  }
#endif

853
  DBUG_EXECUTE("info",TEST_join(this););
bk@work.mysql.com's avatar
bk@work.mysql.com committed
854 855 856 857 858
  /*
    Because filesort always does a full table scan or a quick range scan
    we must add the removed reference to the select for the table.
    We only need to do this when we have a simple_order or simple_group
    as in other cases the join is done before the sort.
859
  */
860
  if (const_tables != tables &&
861 862
      (order || group_list) && 
      join_tab[const_tables].type != JT_ALL &&
863
      join_tab[const_tables].type != JT_FT &&
864
      join_tab[const_tables].type != JT_REF_OR_NULL &&
865
      (order && simple_order || group_list && simple_group))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
866
  {
867
    if (add_ref_to_table_cond(thd,&join_tab[const_tables]))
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
868
      DBUG_RETURN(1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
869 870 871
  }

  if (!(select_options & SELECT_BIG_RESULT) &&
872
      ((group_list && const_tables != tables &&
873
	(!simple_group ||
874 875 876
	 !test_if_skip_sort_order(&join_tab[const_tables], group_list,
				  unit->select_limit_cnt,
				  0))) ||
bk@work.mysql.com's avatar
bk@work.mysql.com committed
877
       select_distinct) &&
878
      tmp_table_param.quick_group && !procedure)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
879 880 881
  {
    need_tmp=1; simple_order=simple_group=0;	// Force tmp table without sort
  }
882

883
  tmp_having= having;
884
  if (select_options & SELECT_DESCRIBE)
885 886
  {
    error= 0;
887
    DBUG_RETURN(0);
888
  }
889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911
  having= 0;

  /* Perform FULLTEXT search before all regular searches */
  init_ftfuncs(thd, select_lex, test(order));
  /* Create a tmp table if distinct or if the sort is too complicated */
  if (need_tmp)
  {
    DBUG_PRINT("info",("Creating tmp table"));
    thd->proc_info="Creating tmp table";

    init_items_ref_array();
    
    tmp_table_param.hidden_field_count= (all_fields.elements -
					 fields_list.elements);
    if (!(exec_tmp_table1 =
	  create_tmp_table(thd, &tmp_table_param, all_fields,
			   ((!simple_group && !procedure &&
			     !(test_flags & TEST_NO_KEY_GROUP)) ?
			    group_list : (ORDER*) 0),
			   group_list ? 0 : select_distinct,
			   group_list && simple_group,
			   select_options,
			   (order == 0 || skip_sort_order) ? select_limit :
912 913
			   HA_POS_ERROR,
			   (char *) "")))
914
      DBUG_RETURN(1);
915 916 917 918 919 920 921 922 923 924 925

    /*
      We don't have to store rows in temp table that doesn't match HAVING if:
      - we are sorting the table and writing complete group rows to the
        temp table.
      - We are using DISTINCT without resolving the distinct as a GROUP BY
        on all columns.
      
      If having is not handled here, it will be checked before the row
      is sent to the client.
    */    
926 927 928 929 930 931 932 933 934
    if (having && 
	(sort_and_group || (exec_tmp_table1->distinct && !group_list)))
      having= tmp_having;

    /* if group or order on first table, sort first */
    if (group_list && simple_group)
    {
      DBUG_PRINT("info",("Sorting for group"));
      thd->proc_info="Sorting for group";
935
      if (create_sort_index(thd, this, group_list,
936
			    HA_POS_ERROR, HA_POS_ERROR) ||
937 938
	  alloc_group_fields(this, group_list) ||
	  make_sum_func_list(all_fields, fields_list, 1))
939 940 941 942 943
	DBUG_RETURN(1);
      group_list=0;
    }
    else
    {
944
      if (make_sum_func_list(all_fields, fields_list, 0))
945 946 947 948 949
	DBUG_RETURN(1);
      if (!group_list && ! exec_tmp_table1->distinct && order && simple_order)
      {
	DBUG_PRINT("info",("Sorting for order"));
	thd->proc_info="Sorting for order";
950
	if (create_sort_index(thd, this, order,
951 952 953 954 955 956 957 958 959 960 961 962 963 964 965
                              HA_POS_ERROR, HA_POS_ERROR))
	  DBUG_RETURN(1);
	order=0;
      }
    }
    
    /*
      Optimize distinct when used on some of the tables
      SELECT DISTINCT t1.a FROM t1,t2 WHERE t1.b=t2.b
      In this case we can stop scanning t2 when we have found one t1.a
    */

    if (exec_tmp_table1->distinct)
    {
      table_map used_tables= thd->used_tables;
966
      JOIN_TAB *last_join_tab= join_tab+tables-1;
967 968
      do
      {
969
	if (used_tables & last_join_tab->table->map)
970
	  break;
971 972
	last_join_tab->not_used_in_distinct=1;
      } while (last_join_tab-- != join_tab);
973 974 975 976
      /* Optimize "select distinct b from t1 order by key_part_1 limit #" */
      if (order && skip_sort_order)
      {
 	/* Should always succeed */
977
	if (test_if_skip_sort_order(&join_tab[const_tables],
978 979 980 981 982
				    order, unit->select_limit_cnt, 0))
	  order=0;
      }
    }
    
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
983
    if (select_lex->master_unit()->uncacheable)
984 985 986
    {
      if (!(tmp_join= (JOIN*)thd->alloc(sizeof(JOIN))))
	DBUG_RETURN(-1);
987
      error= 0;				// Ensure that tmp_join.error= 0
988 989 990 991
      restore_tmp();
    }
  }

992
  error= 0;
993 994 995
  DBUG_RETURN(0);
}

996

997
/*
998
  Restore values in temporary join
999
*/
1000
void JOIN::restore_tmp()
1001
{
1002
  memcpy(tmp_join, this, (size_t) sizeof(JOIN));
1003 1004
}

1005

1006 1007 1008 1009
int
JOIN::reinit()
{
  DBUG_ENTER("JOIN::reinit");
1010
  /* TODO move to unit reinit */
1011 1012 1013 1014 1015 1016
  unit->offset_limit_cnt =select_lex->offset_limit;
  unit->select_limit_cnt =select_lex->select_limit+select_lex->offset_limit;
  if (unit->select_limit_cnt < select_lex->select_limit)
    unit->select_limit_cnt= HA_POS_ERROR;		// no limit
  if (unit->select_limit_cnt == HA_POS_ERROR)
    select_lex->options&= ~OPTION_FOUND_ROWS;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1017
  
1018
  if (setup_tables(tables_list, 1))
1019
    DBUG_RETURN(1);
1020
  
1021
  /* Reset of sum functions */
1022
  first_record= 0;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1023

1024 1025 1026 1027 1028
  if (exec_tmp_table1)
  {
    exec_tmp_table1->file->extra(HA_EXTRA_RESET_STATE);
    exec_tmp_table1->file->delete_all_rows();
    free_io_cache(exec_tmp_table1);
1029
    filesort_free_buffers(exec_tmp_table1);
1030 1031 1032 1033 1034 1035
  }
  if (exec_tmp_table2)
  {
    exec_tmp_table2->file->extra(HA_EXTRA_RESET_STATE);
    exec_tmp_table2->file->delete_all_rows();
    free_io_cache(exec_tmp_table2);
1036
    filesort_free_buffers(exec_tmp_table2);
1037 1038
  }
  if (items0)
1039
    set_items_ref_array(items0);
1040

1041 1042 1043
  if (join_tab_save)
    memcpy(join_tab, join_tab_save, sizeof(JOIN_TAB) * tables);

1044 1045 1046
  if (tmp_join)
    restore_tmp();

1047 1048 1049
  DBUG_RETURN(0);
}

1050 1051 1052 1053

bool
JOIN::save_join_tab()
{
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1054
  if (!join_tab_save && select_lex->master_unit()->uncacheable)
1055
  {
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1056 1057
    if (!(join_tab_save= (JOIN_TAB*)thd->memdup((gptr) join_tab,
						sizeof(JOIN_TAB) * tables)))
1058 1059 1060 1061 1062 1063
      return 1;
  }
  return 0;
}


1064
/*
1065
  Exec select
1066 1067 1068 1069 1070 1071
*/
void
JOIN::exec()
{
  int      tmp_error;
  DBUG_ENTER("JOIN::exec");
1072
  
1073
  error= 0;
Sinisa@sinisa.nasamreza.org's avatar
Sinisa@sinisa.nasamreza.org committed
1074
  thd->limit_found_rows= thd->examined_row_count= 0;
1075 1076 1077 1078 1079 1080
  if (procedure)
  {
    if (procedure->change_columns(fields_list) ||
	result->prepare(fields_list, unit))
      DBUG_VOID_RETURN;
  }
1081

monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1082
  if (!tables_list)
1083 1084
  {                                           // Only test of functions
    if (select_options & SELECT_DESCRIBE)
1085 1086
      select_describe(this, false, false, false,
		      (zero_result_cause?zero_result_cause:"No tables used"));
1087 1088 1089 1090 1091
    else
    {
      result->send_fields(fields_list,1);
      if (!having || having->val_int())
      {
1092 1093 1094
	if (do_send_rows && (procedure ? (procedure->send_row(fields_list) ||
                                          procedure->end_of_records())
                                       : result->send_data(fields_list)))
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1095
	  error= 1;
1096
	else
1097
	{
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1098
	  error= (int) result->send_eof();
1099 1100
	  send_records=1;
	}
1101 1102
      }
      else
1103
	error=(int) result->send_eof();
1104 1105 1106 1107 1108 1109
    }
    DBUG_VOID_RETURN;
  }

  if (zero_result_cause)
  {
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
1110 1111 1112 1113 1114
    (void) return_zero_rows(this, result, tables_list, fields_list,
			    tmp_table_param.sum_func_count != 0 &&
			    !group_list,
			    select_options,
			    zero_result_cause,
1115
			    having, procedure,
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
1116
			    unit);
1117 1118 1119
    DBUG_VOID_RETURN;
  }

bk@work.mysql.com's avatar
bk@work.mysql.com committed
1120 1121
  if (select_options & SELECT_DESCRIBE)
  {
monty@mysql.com's avatar
monty@mysql.com committed
1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136
    /*
      Check if we managed to optimize ORDER BY away and don't use temporary
      table to resolve ORDER BY: in that case, we only may need to do
      filesort for GROUP BY.
    */
    if (!order && !no_order && (!skip_sort_order || !need_tmp))
    {
      /*
	Reset 'order' to 'group_list' and reinit variables describing
	'order'
      */
      order= group_list;
      simple_order= simple_group;
      skip_sort_order= 0;
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1137
    if (order &&
1138
	(const_tables == tables ||
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1139
 	 ((simple_order || skip_sort_order) &&
1140
	  test_if_skip_sort_order(&join_tab[const_tables], order,
1141
				  select_limit, 0))))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1142
      order=0;
1143
    having= tmp_having;
1144
    select_describe(this, need_tmp,
1145
		    order != 0 && !skip_sort_order,
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
1146
		    select_distinct);
1147
    DBUG_VOID_RETURN;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1148 1149
  }

1150 1151 1152 1153
  JOIN *curr_join= this;
  List<Item> *curr_all_fields= &all_fields;
  List<Item> *curr_fields_list= &fields_list;
  TABLE *curr_tmp_table= 0;
1154

bk@work.mysql.com's avatar
bk@work.mysql.com committed
1155 1156 1157
  /* Create a tmp table if distinct or if the sort is too complicated */
  if (need_tmp)
  {
1158 1159 1160
    if (tmp_join)
      curr_join= tmp_join;
    curr_tmp_table= exec_tmp_table1;
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
1161 1162

    /* Copy data to the temporary table */
1163
    thd->proc_info= "Copying to tmp table";
1164 1165
    
    if ((tmp_error= do_select(curr_join, (List<Item> *) 0, curr_tmp_table, 0)))
1166
    {
1167 1168
      error= tmp_error;
      DBUG_VOID_RETURN;
1169
    }
1170 1171 1172 1173 1174
    curr_tmp_table->file->info(HA_STATUS_VARIABLE);
    
    if (curr_join->having)
      curr_join->having= curr_join->tmp_having= 0; // Allready done
    
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1175
    /* Change sum_fields reference to calculated fields in tmp_table */
1176 1177
    curr_join->all_fields= *curr_all_fields;
    if (!items1)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1178
    {
1179 1180 1181
      items1= items0 + all_fields.elements;
      if (sort_and_group || curr_tmp_table->group)
      {
1182
	if (change_to_use_tmp_fields(thd, items1,
1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199
				     tmp_fields_list1, tmp_all_fields1,
				     fields_list.elements, all_fields))
	  DBUG_VOID_RETURN;
      }
      else
      {
	if (change_refs_to_tmp_fields(thd, items1,
				      tmp_fields_list1, tmp_all_fields1,
				      fields_list.elements, all_fields))
	  DBUG_VOID_RETURN;
      }
      curr_join->tmp_all_fields1= tmp_all_fields1;
      curr_join->tmp_fields_list1= tmp_fields_list1;
      curr_join->items1= items1;
    }
    curr_all_fields= &tmp_all_fields1;
    curr_fields_list= &tmp_fields_list1;
1200
    set_items_ref_array(items1);
1201 1202 1203 1204 1205 1206 1207 1208
    
    if (sort_and_group || curr_tmp_table->group)
    {
      curr_join->tmp_table_param.field_count+= 
	curr_join->tmp_table_param.sum_func_count+
	curr_join->tmp_table_param.func_count;
      curr_join->tmp_table_param.sum_func_count= 
	curr_join->tmp_table_param.func_count= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1209 1210 1211
    }
    else
    {
1212 1213 1214
      curr_join->tmp_table_param.field_count+= 
	curr_join->tmp_table_param.func_count;
      curr_join->tmp_table_param.func_count= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1215
    }
1216 1217
    
    // procedure can't be used inside subselect => we do nothing special for it
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1218 1219
    if (procedure)
      procedure->update_refs();
1220 1221
    
    if (curr_tmp_table->group)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1222
    {						// Already grouped
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1223
      if (!curr_join->order && !curr_join->no_order && !skip_sort_order)
1224 1225
	curr_join->order= curr_join->group_list;  /* order by group */
      curr_join->group_list= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1226
    }
1227
    
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1228
    /*
1229 1230 1231 1232 1233
      If we have different sort & group then we must sort the data by group
      and copy it to another tmp table
      This code is also used if we are using distinct something
      we haven't been able to store in the temporary table yet
      like SEC_TO_TIME(SUM(...)).
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1234 1235
    */

1236 1237 1238 1239 1240
    if (curr_join->group_list && (!test_if_subpart(curr_join->group_list,
						   curr_join->order) || 
				  curr_join->select_distinct) ||
	(curr_join->select_distinct &&
	 curr_join->tmp_table_param.using_indirect_summary_function))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1241 1242
    {					/* Must copy to another table */
      DBUG_PRINT("info",("Creating group table"));
1243
      
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1244
      /* Free first data from old join */
1245
      curr_join->join_free(0);
1246
      if (make_simple_join(curr_join, curr_tmp_table))
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1247
	DBUG_VOID_RETURN;
1248
      calc_group_buffer(curr_join, group_list);
1249 1250
      count_field_types(&curr_join->tmp_table_param,
			curr_join->tmp_all_fields1,
1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269
			curr_join->select_distinct && !curr_join->group_list);
      curr_join->tmp_table_param.hidden_field_count= 
	(curr_join->tmp_all_fields1.elements-
	 curr_join->tmp_fields_list1.elements);
      
      
      if (exec_tmp_table2)
	curr_tmp_table= exec_tmp_table2;
      else
      {
	/* group data to new table */
	if (!(curr_tmp_table=
	      exec_tmp_table2= create_tmp_table(thd,
						&curr_join->tmp_table_param,
						*curr_all_fields,
						(ORDER*) 0,
						curr_join->select_distinct && 
						!curr_join->group_list,
						1, curr_join->select_options,
1270 1271
						HA_POS_ERROR,
						(char *) "")))
1272 1273 1274
	  DBUG_VOID_RETURN;
	curr_join->exec_tmp_table2= exec_tmp_table2;
      }
1275
      if (curr_join->group_list)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1276
      {
1277
	thd->proc_info= "Creating sort index";
1278 1279 1280 1281
	if (curr_join->join_tab == join_tab && save_join_tab())
	{
	  DBUG_VOID_RETURN;
	}
1282
	if (create_sort_index(thd, curr_join, curr_join->group_list,
1283
			      HA_POS_ERROR, HA_POS_ERROR) ||
1284
	    make_group_fields(this, curr_join))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1285
	{
1286
	  DBUG_VOID_RETURN;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1287
	}
1288
	curr_join->group_list= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1289
      }
1290
      
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1291
      thd->proc_info="Copying to group table";
1292
      tmp_error= -1;
1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306
      if (curr_join != this)
      {
	if (sum_funcs2)
	{
	  curr_join->sum_funcs= sum_funcs2;
	  curr_join->sum_funcs_end= sum_funcs_end2; 
	}
	else
	{
	  curr_join->alloc_func_list();
	  sum_funcs2= curr_join->sum_funcs;
	  sum_funcs_end2= curr_join->sum_funcs_end;
	}
      }
1307 1308
      if (curr_join->make_sum_func_list(*curr_all_fields, *curr_fields_list,
					1) ||
1309 1310
	  (tmp_error= do_select(curr_join, (List<Item> *) 0, curr_tmp_table,
				0)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1311
      {
1312
	error= tmp_error;
1313
	DBUG_VOID_RETURN;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1314
      }
1315 1316 1317 1318 1319 1320 1321 1322
      end_read_record(&curr_join->join_tab->read_record);
      curr_join->const_tables= curr_join->tables; // Mark free for join_free()
      curr_join->join_tab[0].table= 0;           // Table is freed
      
      // No sum funcs anymore
      if (!items2)
      {
	items2= items1 + all_fields.elements;
1323
	if (change_to_use_tmp_fields(thd, items2,
1324 1325 1326 1327 1328 1329 1330 1331
				     tmp_fields_list2, tmp_all_fields2, 
				     fields_list.elements, tmp_all_fields1))
	  DBUG_VOID_RETURN;
	curr_join->tmp_fields_list2= tmp_fields_list2;
	curr_join->tmp_all_fields2= tmp_all_fields2;
      }
      curr_fields_list= &curr_join->tmp_fields_list2;
      curr_all_fields= &curr_join->tmp_all_fields2;
1332
      set_items_ref_array(items2);
1333 1334 1335 1336 1337 1338 1339
      curr_join->tmp_table_param.field_count+= 
	curr_join->tmp_table_param.sum_func_count;
      curr_join->tmp_table_param.sum_func_count= 0;
    }
    if (curr_tmp_table->distinct)
      curr_join->select_distinct=0;		/* Each row is unique */
    
1340
    curr_join->join_free(0);			/* Free quick selects */
1341
    if (select_distinct && ! group_list)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1342 1343
    {
      thd->proc_info="Removing duplicates";
1344 1345 1346 1347
      if (curr_join->tmp_having)
	curr_join->tmp_having->update_used_tables();
      if (remove_duplicates(curr_join, curr_tmp_table,
			    curr_join->fields_list, curr_join->tmp_having))
1348
	DBUG_VOID_RETURN;
1349 1350
      curr_join->tmp_having=0;
      curr_join->select_distinct=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1351
    }
1352 1353
    curr_tmp_table->reginfo.lock_type= TL_UNLOCK;
    if (make_simple_join(curr_join, curr_tmp_table))
1354
      DBUG_VOID_RETURN;
1355 1356 1357
    calc_group_buffer(curr_join, curr_join->group_list);
    count_field_types(&curr_join->tmp_table_param, *curr_all_fields, 0);
    
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1358 1359
  }
  if (procedure)
1360 1361 1362
    count_field_types(&curr_join->tmp_table_param, *curr_all_fields, 0);
  
  if (curr_join->group || curr_join->tmp_table_param.sum_func_count ||
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1363 1364
      (procedure && (procedure->flags & PROC_GROUP)))
  {
1365 1366 1367 1368
    if (make_group_fields(this, curr_join))
    {
      DBUG_VOID_RETURN;
    }
1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392
    if (!items3)
    {
      if (!items0)
	init_items_ref_array();
      items3= ref_pointer_array + (all_fields.elements*4);
      setup_copy_fields(thd, &curr_join->tmp_table_param,
			items3, tmp_fields_list3, tmp_all_fields3,
			curr_fields_list->elements, *curr_all_fields);
      tmp_table_param.save_copy_funcs= curr_join->tmp_table_param.copy_funcs;
      tmp_table_param.save_copy_field= curr_join->tmp_table_param.copy_field;
      tmp_table_param.save_copy_field_end=
	curr_join->tmp_table_param.copy_field_end;
      curr_join->tmp_all_fields3= tmp_all_fields3;
      curr_join->tmp_fields_list3= tmp_fields_list3;
    }
    else
    {
      curr_join->tmp_table_param.copy_funcs= tmp_table_param.save_copy_funcs;
      curr_join->tmp_table_param.copy_field= tmp_table_param.save_copy_field;
      curr_join->tmp_table_param.copy_field_end=
	tmp_table_param.save_copy_field_end;
    }
    curr_fields_list= &tmp_fields_list3;
    curr_all_fields= &tmp_all_fields3;
1393
    set_items_ref_array(items3);
1394

1395 1396
    if (curr_join->make_sum_func_list(*curr_all_fields, *curr_fields_list,
				      1) || thd->is_fatal_error)
1397
      DBUG_VOID_RETURN;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1398
  }
1399
  if (curr_join->group_list || curr_join->order)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1400 1401 1402 1403
  {
    DBUG_PRINT("info",("Sorting for send_fields"));
    thd->proc_info="Sorting result";
    /* If we have already done the group, add HAVING to sorted table */
1404 1405
    if (curr_join->tmp_having && ! curr_join->group_list && 
	! curr_join->sort_and_group)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1406
    {
1407 1408
      // Some tables may have been const
      curr_join->tmp_having->update_used_tables();
1409 1410 1411
      JOIN_TAB *curr_table= &curr_join->join_tab[curr_join->const_tables];
      table_map used_tables= (curr_join->const_table_map |
			      curr_table->table->map);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1412

1413 1414
      Item* sort_table_cond= make_cond_for_table(curr_join->tmp_having,
						 used_tables,
1415
						 used_tables);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1416 1417
      if (sort_table_cond)
      {
1418 1419
	if (!curr_table->select)
	  if (!(curr_table->select= new SQL_SELECT))
1420
	    DBUG_VOID_RETURN;
1421 1422
	if (!curr_table->select->cond)
	  curr_table->select->cond= sort_table_cond;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1423
	else					// This should never happen
1424 1425
	  if (!(curr_table->select->cond=
		new Item_cond_and(curr_table->select->cond, sort_table_cond)))
1426
	    DBUG_VOID_RETURN;
1427
	curr_table->select_cond= curr_table->select->cond;
1428 1429
	curr_table->select_cond->top_level_item();
	DBUG_EXECUTE("where",print_where(curr_table->select->cond,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1430
					 "select and having"););
1431 1432 1433
	curr_join->tmp_having= make_cond_for_table(curr_join->tmp_having,
						   ~ (table_map) 0,
						   ~used_tables);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1434 1435 1436
	DBUG_EXECUTE("where",print_where(conds,"having after sort"););
      }
    }
1437
    {
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1438
      if (group)
1439
	curr_join->select_limit= HA_POS_ERROR;
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
1440
      else
1441
      {
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
1442 1443 1444 1445
	/*
	  We can abort sorting after thd->select_limit rows if we there is no
	  WHERE clause for any tables after the sorted one.
	*/
1446
	JOIN_TAB *curr_table= &curr_join->join_tab[curr_join->const_tables+1];
1447
	JOIN_TAB *end_table= &curr_join->join_tab[tables];
1448
	for (; curr_table < end_table ; curr_table++)
1449
	{
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1450 1451 1452 1453 1454 1455
	  /*
	    table->keyuse is set in the case there was an original WHERE clause
	    on the table that was optimized away.
	    table->on_expr tells us that it was a LEFT JOIN and there will be
	    at least one row generated from the table.
	  */
1456 1457
	  if (curr_table->select_cond ||
	      (curr_table->keyuse && !curr_table->on_expr))
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
1458 1459
	  {
	    /* We have to sort all rows */
1460
	    curr_join->select_limit= HA_POS_ERROR;
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
1461 1462
	    break;
	  }
1463 1464
	}
      }
1465 1466 1467 1468
      if (curr_join->join_tab == join_tab && save_join_tab())
      {
	DBUG_VOID_RETURN;
      }
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
1469 1470 1471 1472 1473 1474 1475 1476 1477
      /*
	Here we sort rows for ORDER BY/GROUP BY clause, if the optimiser
	chose FILESORT to be faster than INDEX SCAN or there is no 
	suitable index present.
	Note, that create_sort_index calls test_if_skip_sort_order and may
	finally replace sorting with index scan if there is a LIMIT clause in
	the query. XXX: it's never shown in EXPLAIN!
	OPTION_FOUND_ROWS supersedes LIMIT and is taken into account.
      */
1478
      if (create_sort_index(thd, curr_join,
1479 1480
			    curr_join->group_list ? 
			    curr_join->group_list : curr_join->order,
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
1481 1482 1483
			    curr_join->select_limit,
			    (select_options & OPTION_FOUND_ROWS ?
			     HA_POS_ERROR : unit->select_limit_cnt)))
1484
	DBUG_VOID_RETURN;
1485
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1486
  }
1487
  curr_join->having= curr_join->tmp_having;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1488
  thd->proc_info="Sending data";
1489
  error= thd->net.report_error ||
1490
    do_select(curr_join, curr_fields_list, NULL, procedure);
Sinisa@sinisa.nasamreza.org's avatar
Sinisa@sinisa.nasamreza.org committed
1491 1492
  thd->limit_found_rows= curr_join->send_records;
  thd->examined_row_count= curr_join->examined_rows;
1493 1494
  DBUG_VOID_RETURN;
}
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1495

1496

1497 1498 1499 1500 1501
/*
  Clean up join. Return error that hold JOIN.
*/

int
1502
JOIN::cleanup()
1503
{
1504
  DBUG_ENTER("JOIN::cleanup");
1505 1506 1507
  select_lex->join= 0;

  if (tmp_join)
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1508 1509 1510 1511 1512 1513
  {
    if (join_tab != tmp_join->join_tab)
    {
      JOIN_TAB *tab, *end;
      for (tab= join_tab, end= tab+tables ; tab != end ; tab++)
      {
1514 1515 1516 1517
	delete tab->select;
	delete tab->quick;
	tab->select=0;
	tab->quick=0;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1518
	x_free(tab->cache.buff);
1519
	tab->cache.buff= 0;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1520 1521 1522
      }
    }
    tmp_join->tmp_join= 0;
1523
    DBUG_RETURN(tmp_join->cleanup());
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1524
  }
1525

1526
  lock=0;                                     // It's faster to unlock later
1527
  join_free(1);
1528 1529 1530 1531
   if (exec_tmp_table1)
     free_tmp_table(thd, exec_tmp_table1);
   if (exec_tmp_table2)
     free_tmp_table(thd, exec_tmp_table2);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1532 1533 1534
  delete select;
  delete_dynamic(&keyuse);
  delete procedure;
1535 1536 1537
  for (SELECT_LEX_UNIT *lex_unit= select_lex->first_inner_unit();
       lex_unit != 0;
       lex_unit= lex_unit->next_unit())
1538
  {
1539
    error|= lex_unit->cleanup();
1540 1541
  }
  DBUG_RETURN(error);
1542 1543
}

1544

1545
int
1546
mysql_select(THD *thd, Item ***rref_pointer_array,
serg@serg.mylan's avatar
serg@serg.mylan committed
1547
	     TABLE_LIST *tables, uint wild_num, List<Item> &fields,
1548 1549 1550
	     COND *conds, uint og_num,  ORDER *order, ORDER *group,
	     Item *having, ORDER *proc_param, ulong select_options,
	     select_result *result, SELECT_LEX_UNIT *unit,
1551
	     SELECT_LEX *select_lex)
1552
{
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1553 1554
  int err;
  bool free_join= 1;
1555 1556
  DBUG_ENTER("mysql_select");

1557
  JOIN *join;
1558
  if (select_lex->join != 0)
1559
  {
1560
    join= select_lex->join;
1561 1562 1563
    // is it single SELECT in derived table, called in derived table creation
    if (select_lex->linkage != DERIVED_TABLE_TYPE ||
	(select_options & SELECT_DESCRIBE))
1564
    {
1565
      if (select_lex->linkage != GLOBAL_OPTIONS_TYPE)
1566
      {
1567 1568 1569 1570 1571 1572
	//here is EXPLAIN of subselect or derived table
	join->result= result;
	if (!join->procedure && result->prepare(join->fields_list, unit))
	{
	  DBUG_RETURN(-1);
	}
1573
      }
1574
      else
1575
      {
1576 1577 1578 1579 1580 1581
	if (join->prepare(rref_pointer_array, tables, wild_num,
			  conds, og_num, order, group, having, proc_param,
			  select_lex, unit))
	{
	  goto err;
	}
1582
      }
1583
      free_join= 0;
1584 1585
    }
    join->select_options= select_options;
1586
  }
1587 1588
  else
  {
1589 1590
    if (!(join= new JOIN(thd, fields, select_options, result)))
	DBUG_RETURN(-1);
1591 1592
    thd->proc_info="init";
    thd->used_tables=0;                         // Updated by setup_fields
1593 1594
    if (join->prepare(rref_pointer_array, tables, wild_num,
		      conds, og_num, order, group, having, proc_param,
1595
		      select_lex, unit))
1596
    {
1597
      goto err;
1598 1599 1600
    }
  }

monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1601
  if ((err= join->optimize()))
1602
  {
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1603 1604
    goto err;					// 1
  }
1605

1606
  if (thd->lex->describe & DESCRIBE_EXTENDED)
1607 1608 1609 1610 1611
  {
    join->conds_history= join->conds;
    join->having_history= (join->having?join->having:join->tmp_having);
  }

1612
  if (thd->net.report_error)
1613 1614 1615 1616
    goto err;

  join->exec();

1617
  if (thd->lex->describe & DESCRIBE_EXTENDED)
1618 1619 1620 1621 1622
  {
    select_lex->where= join->conds_history;
    select_lex->having= join->having_history;
  }

1623
err:
1624 1625 1626
  if (free_join)
  {
    thd->proc_info="end";
1627
    err= join->cleanup();
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1628 1629
    if (thd->net.report_error)
      err= -1;
1630
    delete join;
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1631
    DBUG_RETURN(err);
1632
  }
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1633
  DBUG_RETURN(join->error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1634 1635 1636
}

/*****************************************************************************
1637 1638
  Create JOIN_TABS, make a guess about the table types,
  Approximate how many records will be used in each table
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1639 1640
*****************************************************************************/

1641 1642
static ha_rows get_quick_record_count(THD *thd, SQL_SELECT *select,
				      TABLE *table,
serg@serg.mylan's avatar
serg@serg.mylan committed
1643
				      const key_map *keys,ha_rows limit)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1644 1645 1646 1647 1648 1649 1650
{
  int error;
  DBUG_ENTER("get_quick_record_count");
  if (select)
  {
    select->head=table;
    table->reginfo.impossible_range=0;
serg@serg.mylan's avatar
serg@serg.mylan committed
1651
    if ((error=select->test_quick_select(thd, *(key_map *)keys,(table_map) 0,limit))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664
	== 1)
      DBUG_RETURN(select->quick->records);
    if (error == -1)
    {
      table->reginfo.impossible_range=1;
      DBUG_RETURN(0);
    }
    DBUG_PRINT("warning",("Couldn't use record count on const keypart"));
  }
  DBUG_RETURN(HA_POS_ERROR);			/* This shouldn't happend */
}


1665 1666 1667 1668 1669 1670 1671
/*
  Calculate the best possible join and initialize the join structure

  RETURN VALUES
  0	ok
  1	Fatal error
*/
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
1672

bk@work.mysql.com's avatar
bk@work.mysql.com committed
1673 1674
static bool
make_join_statistics(JOIN *join,TABLE_LIST *tables,COND *conds,
1675
		     DYNAMIC_ARRAY *keyuse_array)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1676 1677
{
  int error;
1678 1679 1680
  uint i,table_count,const_count,key;
  table_map found_const_table_map, all_table_map, found_ref, refs;
  key_map const_ref, eq_part;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1681 1682 1683 1684 1685 1686 1687 1688
  TABLE **table_vector;
  JOIN_TAB *stat,*stat_end,*s,**stat_ref;
  KEYUSE *keyuse,*start_keyuse;
  table_map outer_join=0;
  JOIN_TAB *stat_vector[MAX_TABLES+1];
  DBUG_ENTER("make_join_statistics");

  table_count=join->tables;
1689 1690
  stat=(JOIN_TAB*) join->thd->calloc(sizeof(JOIN_TAB)*table_count);
  stat_ref=(JOIN_TAB**) join->thd->alloc(sizeof(JOIN_TAB*)*MAX_TABLES);
1691
  table_vector=(TABLE**) join->thd->alloc(sizeof(TABLE*)*(table_count*2));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1692 1693 1694 1695 1696 1697
  if (!stat || !stat_ref || !table_vector)
    DBUG_RETURN(1);				// Eom /* purecov: inspected */

  join->best_ref=stat_vector;

  stat_end=stat+table_count;
1698
  found_const_table_map= all_table_map=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1699 1700 1701 1702 1703 1704
  const_count=0;

  for (s=stat,i=0 ; tables ; s++,tables=tables->next,i++)
  {
    TABLE *table;
    stat_vector[i]=s;
1705 1706 1707 1708
    s->keys.init();
    s->const_keys.init();
    s->checked_keys.init();
    s->needed_reg.init();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1709 1710
    table_vector[i]=s->table=table=tables->table;
    table->file->info(HA_STATUS_VARIABLE | HA_STATUS_NO_LOCK);// record count
1711
    table->quick_keys.clear_all();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1712 1713 1714 1715
    table->reginfo.join_tab=s;
    table->reginfo.not_exists_optimize=0;
    bzero((char*) table->const_key_parts, sizeof(key_part_map)*table->keys);
    all_table_map|= table->map;
1716
    s->join=join;
1717
    s->info=0;					// For describe
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1718 1719
    if ((s->on_expr=tables->on_expr))
    {
1720
      /* Left join */
1721 1722
      if (!table->file->records)
      {						// Empty table
1723
	s->key_dependent=s->dependent=0;	// Ignore LEFT JOIN depend.
1724 1725 1726
	set_position(join,const_count++,s,(KEYUSE*) 0);
	continue;
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1727 1728
      s->key_dependent=s->dependent=
	s->on_expr->used_tables() & ~(table->map);
1729 1730 1731 1732
      if (table->outer_join & JOIN_TYPE_LEFT)
	s->dependent|=stat_vector[i-1]->dependent | table_vector[i-1]->map;
      if (tables->outer_join & JOIN_TYPE_RIGHT)
	s->dependent|=tables->next->table->map;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1733 1734 1735 1736 1737 1738 1739 1740
      outer_join|=table->map;
      continue;
    }
    if (tables->straight)			// We don't have to move this
      s->dependent= table_vector[i-1]->map | stat_vector[i-1]->dependent;
    else
      s->dependent=(table_map) 0;
    s->key_dependent=(table_map) 0;
1741
    if ((table->system || table->file->records <= 1) && ! s->dependent &&
1742
	!(table->file->table_flags() & HA_NOT_EXACT_COUNT) &&
1743
        !table->fulltext_searched)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1744 1745 1746 1747 1748
    {
      set_position(join,const_count++,s,(KEYUSE*) 0);
    }
  }
  stat_vector[i]=0;
1749
  join->outer_join=outer_join;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1750 1751

  /*
1752 1753 1754 1755
    If outer join: Re-arrange tables in stat_vector so that outer join
    tables are after all tables it is dependent of.
    For example: SELECT * from A LEFT JOIN B ON B.c=C.c, C WHERE A.C=C.C
    Will shift table B after table C.
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787
  */
  if (outer_join)
  {
    table_map used_tables=0L;
    for (i=0 ; i < join->tables-1 ; i++)
    {
      if (stat_vector[i]->dependent & ~used_tables)
      {
	JOIN_TAB *save= stat_vector[i];
	uint j;
	for (j=i+1;
	     j < join->tables && stat_vector[j]->dependent & ~used_tables;
	     j++)
	{
	  JOIN_TAB *tmp=stat_vector[j];		// Move element up
	  stat_vector[j]=save;
	  save=tmp;
	}
	if (j == join->tables)
	{
	  join->tables=0;			// Don't use join->table
	  my_error(ER_WRONG_OUTER_JOIN,MYF(0));
	  DBUG_RETURN(1);
	}
	stat_vector[i]=stat_vector[j];
	stat_vector[j]=save;
      }
      used_tables|= stat_vector[i]->table->map;
    }
  }

  if (conds || outer_join)
1788 1789
    if (update_ref_and_keys(join->thd, keyuse_array, stat, join->tables,
                            conds, ~outer_join, join->select_lex))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1790 1791
      DBUG_RETURN(1);

1792
  /* Read tables with 0 or 1 rows (system tables) */
1793
  join->const_table_map= 0;
1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811

  for (POSITION *p_pos=join->positions, *p_end=p_pos+const_count;
       p_pos < p_end ;
       p_pos++)
  {
    int tmp;
    s= p_pos->table;
    s->type=JT_SYSTEM;
    join->const_table_map|=s->table->map;
    if ((tmp=join_read_const_table(s, p_pos)))
    {
      if (tmp > 0)
	DBUG_RETURN(1);			// Fatal error
    }
    else
      found_const_table_map|= s->table->map;
  }

bk@work.mysql.com's avatar
bk@work.mysql.com committed
1812
  /* loop until no more const tables are found */
1813
  int ref_changed;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1814 1815
  do
  {
1816
    ref_changed = 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1817
    found_ref=0;
1818 1819 1820 1821 1822 1823 1824

    /*
      We only have to loop from stat_vector + const_count as
      set_position() will move all const_tables first in stat_vector
    */

    for (JOIN_TAB **pos=stat_vector+const_count ; (s= *pos) ; pos++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1825
    {
1826
      TABLE *table=s->table;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1827 1828
      if (s->dependent)				// If dependent on some table
      {
1829
	// All dep. must be constants
1830
	if (s->dependent & ~(found_const_table_map))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1831
	  continue;
1832
	if (table->file->records <= 1L &&
1833
	    !(table->file->table_flags() & HA_NOT_EXACT_COUNT))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1834
	{					// system table
1835
	  int tmp= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1836
	  s->type=JT_SYSTEM;
1837
	  join->const_table_map|=table->map;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1838
	  set_position(join,const_count++,s,(KEYUSE*) 0);
1839
	  if ((tmp= join_read_const_table(s,join->positions+const_count-1)))
1840 1841 1842 1843 1844 1845
	  {
	    if (tmp > 0)
	      DBUG_RETURN(1);			// Fatal error
	  }
	  else
	    found_const_table_map|= table->map;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856
	  continue;
	}
      }
      /* check if table can be read by key or table only uses const refs */
      if ((keyuse=s->keyuse))
      {
	s->type= JT_REF;
	while (keyuse->table == table)
	{
	  start_keyuse=keyuse;
	  key=keyuse->key;
1857
	  s->keys.set_bit(key);               // QQ: remove this ?
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1858

1859 1860 1861
	  refs=0;
          const_ref.clear_all();
	  eq_part.clear_all();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1862 1863
	  do
	  {
1864
	    if (keyuse->val->type() != Item::NULL_ITEM && !keyuse->optimize)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1865
	    {
1866
	      if (!((~found_const_table_map) & keyuse->used_tables))
1867
		const_ref.set_bit(keyuse->keypart);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1868 1869
	      else
		refs|=keyuse->used_tables;
1870
	      eq_part.set_bit(keyuse->keypart);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1871 1872 1873 1874
	    }
	    keyuse++;
	  } while (keyuse->table == table && keyuse->key == key);

1875
	  if (eq_part.is_prefix(table->key_info[key].key_parts) &&
1876 1877
	      ((table->key_info[key].flags & (HA_NOSAME | HA_END_SPACE_KEY)) ==
	       HA_NOSAME) &&
1878
              !table->fulltext_searched)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1879 1880 1881
	  {
	    if (const_ref == eq_part)
	    {					// Found everything for ref.
1882 1883
	      int tmp;
	      ref_changed = 1;
1884
	      s->type= JT_CONST;
1885
	      join->const_table_map|=table->map;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1886
	      set_position(join,const_count++,s,start_keyuse);
1887
	      if (create_ref_for_key(join, s, start_keyuse,
1888
				     found_const_table_map))
1889 1890 1891 1892 1893 1894 1895 1896 1897
		DBUG_RETURN(1);
	      if ((tmp=join_read_const_table(s,
					     join->positions+const_count-1)))
	      {
		if (tmp > 0)
		  DBUG_RETURN(1);			// Fatal error
	      }
	      else
		found_const_table_map|= table->map;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1898 1899 1900 1901 1902 1903 1904 1905
	      break;
	    }
	    else
	      found_ref|= refs;		// Table is const if all refs are const
	  }
	}
      }
    }
1906
  } while (join->const_table_map & found_ref && ref_changed);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919

  /* Calc how many (possible) matched records in each table */

  for (s=stat ; s < stat_end ; s++)
  {
    if (s->type == JT_SYSTEM || s->type == JT_CONST)
    {
      /* Only one matching row */
      s->found_records=s->records=s->read_time=1; s->worst_seeks=1.0;
      continue;
    }
    /* Approximate found rows and time to read them */
    s->found_records=s->records=s->table->file->records;
1920
    s->read_time=(ha_rows) s->table->file->scan_time();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1921

1922 1923
    /*
      Set a max range of how many seeks we can expect when using keys
1924 1925
      This is can't be to high as otherwise we are likely to use
      table scan.
1926
    */
1927 1928
    s->worst_seeks= min((double) s->found_records / 10,
			(double) s->read_time*3);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1929 1930 1931
    if (s->worst_seeks < 2.0)			// Fix for small tables
      s->worst_seeks=2.0;

1932
    if (! s->const_keys.is_clear_all())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1933 1934
    {
      ha_rows records;
1935 1936 1937 1938 1939
      SQL_SELECT *select;
      select= make_select(s->table, found_const_table_map,
			  found_const_table_map,
			  s->on_expr ? s->on_expr : conds,
			  &error);
1940
      records= get_quick_record_count(join->thd, select, s->table,
serg@serg.mylan's avatar
serg@serg.mylan committed
1941
				      &s->const_keys, join->row_limit);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1942 1943 1944
      s->quick=select->quick;
      s->needed_reg=select->needed_reg;
      select->quick=0;
1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964
      if (records == 0 && s->table->reginfo.impossible_range)
      {
	/*
	  Impossible WHERE or ON expression
	  In case of ON, we mark that the we match one empty NULL row.
	  In case of WHERE, don't set found_const_table_map to get the
	  caller to abort with a zero row result.
	*/
	join->const_table_map|= s->table->map;
	set_position(join,const_count++,s,(KEYUSE*) 0);
	s->type= JT_CONST;
	if (s->on_expr)
	{
	  /* Generate empty row */
	  s->info= "Impossible ON condition";
	  found_const_table_map|= s->table->map;
	  s->type= JT_CONST;
	  mark_as_null_row(s->table);		// All fields are NULL
	}
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1965 1966
      if (records != HA_POS_ERROR)
      {
1967
	s->found_records=records;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1968 1969
	s->read_time= (ha_rows) (s->quick ? s->quick->read_time : 0.0);
      }
1970
      delete select;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1971 1972 1973 1974 1975 1976 1977 1978
    }
  }

  /* Find best combination and return it */
  join->join_tab=stat;
  join->map2table=stat_ref;
  join->table= join->all_tables=table_vector;
  join->const_tables=const_count;
1979
  join->found_const_table_map=found_const_table_map;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1980 1981

  if (join->const_tables != join->tables)
1982 1983
  {
    optimize_keyuse(join, keyuse_array);
1984
    find_best_combination(join,all_table_map & ~join->const_table_map);
1985
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1986 1987 1988 1989 1990 1991
  else
  {
    memcpy((gptr) join->best_positions,(gptr) join->positions,
	   sizeof(POSITION)*join->const_tables);
    join->best_read=1.0;
  }
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
1992
  DBUG_RETURN(join->thd->killed || get_best_combination(join));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1993 1994 1995 1996
}


/*****************************************************************************
1997 1998 1999 2000 2001
  Check with keys are used and with tables references with tables
  Updates in stat:
	  keys	     Bitmap of all used keys
	  const_keys Bitmap of all keys with may be used with quick_select
	  keyuse     Pointer to possible keys
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2002 2003 2004 2005 2006
*****************************************************************************/

typedef struct key_field_t {		// Used when finding key fields
  Field		*field;
  Item		*val;			// May be empty if diff constant
2007 2008
  uint		level;
  uint		optimize;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2009 2010 2011
  bool		eq_func;
} KEY_FIELD;

2012 2013 2014 2015 2016 2017 2018 2019
/* Values in optimize */
#define KEY_OPTIMIZE_EXISTS		1
#define KEY_OPTIMIZE_REF_OR_NULL	2

/*
  Merge new key definitions to old ones, remove those not used in both

  This is called for OR between different levels
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2020

2021 2022 2023 2024 2025 2026
  To be able to do 'ref_or_null' we merge a comparison of a column
  and 'column IS NULL' to one test.  This is useful for sub select queries
  that are internally transformed to something like:

  SELECT * FROM t1 WHERE t1.key=outer_ref_field or t1.key IS NULL 
*/
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2027 2028 2029 2030 2031 2032 2033 2034

static KEY_FIELD *
merge_key_fields(KEY_FIELD *start,KEY_FIELD *new_fields,KEY_FIELD *end,
		 uint and_level)
{
  if (start == new_fields)
    return start;				// Impossible or
  if (new_fields == end)
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
2035
    return start;				// No new fields, skip all
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047

  KEY_FIELD *first_free=new_fields;

  /* Mark all found fields in old array */
  for (; new_fields != end ; new_fields++)
  {
    for (KEY_FIELD *old=start ; old != first_free ; old++)
    {
      if (old->field == new_fields->field)
      {
	if (new_fields->val->used_tables())
	{
2048 2049 2050 2051
	  /*
	    If the value matches, we can use the key reference.
	    If not, we keep it until we have examined all new values
	  */
2052
	  if (old->val->eq(new_fields->val, old->field->binary()))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2053
	  {
2054 2055 2056 2057 2058
	    old->level= and_level;
	    old->optimize= ((old->optimize & new_fields->optimize &
			     KEY_OPTIMIZE_EXISTS) |
			    ((old->optimize | new_fields->optimize) &
			     KEY_OPTIMIZE_REF_OR_NULL));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2059 2060
	  }
	}
2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072
	else if (old->eq_func && new_fields->eq_func &&
		 old->val->eq(new_fields->val, old->field->binary()))
		 
	{
	  old->level= and_level;
	  old->optimize= ((old->optimize & new_fields->optimize &
			   KEY_OPTIMIZE_EXISTS) |
			  ((old->optimize | new_fields->optimize) &
			   KEY_OPTIMIZE_REF_OR_NULL));
	}
	else if (old->eq_func && new_fields->eq_func &&
		 (old->val->is_null() || new_fields->val->is_null()))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2073
	{
2074 2075 2076 2077 2078 2079
	  /* field = expression OR field IS NULL */
	  old->level= and_level;
	  old->optimize= KEY_OPTIMIZE_REF_OR_NULL;
	  /* Remember the NOT NULL value */
	  if (old->val->is_null())
	    old->val= new_fields->val;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2080
	}
2081
	else
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2082
	{
2083 2084 2085 2086 2087
	  /*
	    We are comparing two different const.  In this case we can't
	    use a key-lookup on this so it's better to remove the value
	    and let the range optimzier handle it
	  */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098
	  if (old == --first_free)		// If last item
	    break;
	  *old= *first_free;			// Remove old value
	  old--;				// Retry this value
	}
      }
    }
  }
  /* Remove all not used items */
  for (KEY_FIELD *old=start ; old != first_free ;)
  {
2099
    if (old->level != and_level)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111
    {						// Not used in all levels
      if (old == --first_free)
	break;
      *old= *first_free;			// Remove old value
      continue;
    }
    old++;
  }
  return first_free;
}


2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132
/*
  Add a possible key to array of possible keys if it's usable as a key

  SYNPOSIS
    add_key_field()
    key_fields			Pointer to add key, if usable
    and_level			And level, to be stored in KEY_FIELD
    field			Field used in comparision
    eq_func			True if we used =, <=> or IS NULL
    value			Value used for comparison with field
				Is NULL for BETWEEN and IN    
    usable_tables		Tables which can be used for key optimization

  NOTES
    If we are doing a NOT NULL comparison on a NOT NULL field in a outer join
    table, we store this to be able to do not exists optimization later.

  RETURN
    *key_fields is incremented if we stored a key in the array
*/

bk@work.mysql.com's avatar
bk@work.mysql.com committed
2133
static void
2134
add_key_field(KEY_FIELD **key_fields,uint and_level, COND *cond,
2135
	      Field *field,bool eq_func,Item **value, uint num_values,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2136 2137
	      table_map usable_tables)
{
2138
  uint exists_optimize= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2139 2140 2141
  if (!(field->flags & PART_KEY_FLAG))
  {
    // Don't remove column IS NULL on a LEFT JOIN table
2142 2143
    if (!eq_func || (*value)->type() != Item::NULL_ITEM ||
        !field->table->maybe_null || field->null_ptr)
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
2144
      return;					// Not a key. Skip it
2145
    exists_optimize= KEY_OPTIMIZE_EXISTS;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2146 2147 2148 2149
  }
  else
  {
    table_map used_tables=0;
2150 2151 2152 2153 2154 2155 2156 2157
    bool optimizable=0;
    for (uint i=0; i<num_values; i++)
    {
      used_tables|=(*value)->used_tables();
      if (!((*value)->used_tables() & (field->table->map | RAND_TABLE_BIT)))
        optimizable=1;
    }
    if (!optimizable)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2158 2159 2160
      return;
    if (!(usable_tables & field->table->map))
    {
2161 2162
      if (!eq_func || (*value)->type() != Item::NULL_ITEM ||
          !field->table->maybe_null || field->null_ptr)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2163
	return;					// Can't use left join optimize
2164
      exists_optimize= KEY_OPTIMIZE_EXISTS;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2165 2166 2167 2168
    }
    else
    {
      JOIN_TAB *stat=field->table->reginfo.join_tab;
serg@serg.mylan's avatar
serg@serg.mylan committed
2169
      key_map possible_keys=field->key_start;
2170 2171
      possible_keys.intersect(field->table->keys_in_use_for_query);
      stat[0].keys.merge(possible_keys);             // Add possible keys
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2172

2173 2174 2175 2176 2177 2178 2179 2180
      /*
	Save the following cases:
	Field op constant
	Field LIKE constant where constant doesn't start with a wildcard
	Field = field2 where field2 is in a different table
	Field op formula
	Field IS NULL
	Field IS NOT NULL
2181 2182
         Field BETWEEN ...
         Field IN ...
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2183 2184 2185
      */
      stat[0].key_dependent|=used_tables;

2186 2187 2188 2189
      bool is_const=1;
      for (uint i=0; i<num_values; i++)
        is_const&= (*value)->const_item();
      if (is_const)
2190
        stat[0].const_keys.merge(possible_keys);
2191 2192
      /*
	We can't always use indexes when comparing a string index to a
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
2193 2194
	number. cmp_type() is checked to allow compare of dates to numbers.
        eq_func is NEVER true when num_values > 1
2195
       */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2196 2197
      if (!eq_func ||
	  field->result_type() == STRING_RESULT &&
2198 2199
	  (*value)->result_type() != STRING_RESULT &&
	  field->cmp_type() != (*value)->result_type())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2200
	return;
2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211
      
      /*
        We can't use indexes if the effective collation
        of the operation differ from the field collation.
      */
      if (field->result_type() == STRING_RESULT &&
	  (*value)->result_type() == STRING_RESULT &&
	  field->cmp_type() == STRING_RESULT &&
	  ((Field_str*)field)->charset() != cond->compare_collation())
	return;

bk@work.mysql.com's avatar
bk@work.mysql.com committed
2212 2213
    }
  }
2214
  DBUG_ASSERT(num_values == 1);
2215 2216 2217 2218 2219
  /*
    For the moment eq_func is always true. This slot is reserved for future
    extensions where we want to remembers other things than just eq comparisons
  */
  DBUG_ASSERT(eq_func);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2220
  /* Store possible eq field */
2221 2222
  (*key_fields)->field=		field;
  (*key_fields)->eq_func=	eq_func;
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
2223
  (*key_fields)->val=		*value;
2224 2225
  (*key_fields)->level=		and_level;
  (*key_fields)->optimize=	exists_optimize;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2226 2227 2228 2229 2230 2231 2232 2233 2234 2235
  (*key_fields)++;
}


static void
add_key_fields(JOIN_TAB *stat,KEY_FIELD **key_fields,uint *and_level,
	       COND *cond, table_map usable_tables)
{
  if (cond->type() == Item_func::COND_ITEM)
  {
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
2236
    List_iterator_fast<Item> li(*((Item_cond*) cond)->argument_list());
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2237 2238 2239 2240 2241 2242 2243 2244
    KEY_FIELD *org_key_fields= *key_fields;

    if (((Item_cond*) cond)->functype() == Item_func::COND_AND_FUNC)
    {
      Item *item;
      while ((item=li++))
	add_key_fields(stat,key_fields,and_level,item,usable_tables);
      for (; org_key_fields != *key_fields ; org_key_fields++)
2245
	org_key_fields->level= *and_level;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271
    }
    else
    {
      (*and_level)++;
      add_key_fields(stat,key_fields,and_level,li++,usable_tables);
      Item *item;
      while ((item=li++))
      {
	KEY_FIELD *start_key_fields= *key_fields;
	(*and_level)++;
	add_key_fields(stat,key_fields,and_level,item,usable_tables);
	*key_fields=merge_key_fields(org_key_fields,start_key_fields,
				     *key_fields,++(*and_level));
      }
    }
    return;
  }
  /* If item is of type 'field op field/constant' add it to key_fields */

  if (cond->type() != Item::FUNC_ITEM)
    return;
  Item_func *cond_func= (Item_func*) cond;
  switch (cond_func->select_optimize()) {
  case Item_func::OPTIMIZE_NONE:
    break;
  case Item_func::OPTIMIZE_KEY:
2272
    // BETWEEN or IN
2273
    if (cond_func->key_item()->real_item()->type() == Item::FIELD_ITEM &&
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
2274
	!(cond_func->used_tables() & OUTER_REF_TABLE_BIT))
2275
      add_key_field(key_fields,*and_level,cond_func,
2276 2277
		    ((Item_field*) (cond_func->key_item()->real_item()))->
		    field, 0,
2278 2279
                    cond_func->arguments()+1, cond_func->argument_count()-1,
                    usable_tables);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2280 2281 2282 2283 2284 2285
    break;
  case Item_func::OPTIMIZE_OP:
  {
    bool equal_func=(cond_func->functype() == Item_func::EQ_FUNC ||
		     cond_func->functype() == Item_func::EQUAL_FUNC);

2286
    if (cond_func->arguments()[0]->real_item()->type() == Item::FIELD_ITEM &&
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
2287
	!(cond_func->arguments()[0]->used_tables() & OUTER_REF_TABLE_BIT))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2288
    {
2289
      add_key_field(key_fields,*and_level,cond_func,
2290 2291
		    ((Item_field*) (cond_func->arguments()[0])->real_item())
		    ->field,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2292
		    equal_func,
2293
                    cond_func->arguments()+1, 1, usable_tables);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2294
    }
2295
    if (cond_func->arguments()[1]->real_item()->type() == Item::FIELD_ITEM &&
2296
	cond_func->functype() != Item_func::LIKE_FUNC &&
2297
	!(cond_func->arguments()[1]->used_tables() & OUTER_REF_TABLE_BIT))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2298
    {
2299
      add_key_field(key_fields,*and_level,cond_func,
2300 2301
		    ((Item_field*) (cond_func->arguments()[1])->real_item())
		    ->field,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2302
		    equal_func,
2303
		    cond_func->arguments(),1,usable_tables);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2304 2305 2306 2307 2308
    }
    break;
  }
  case Item_func::OPTIMIZE_NULL:
    /* column_name IS [NOT] NULL */
2309
    if (cond_func->arguments()[0]->real_item()->type() == Item::FIELD_ITEM &&
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
2310
	!(cond_func->used_tables() & OUTER_REF_TABLE_BIT))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2311
    {
2312
      Item *tmp=new Item_null;
2313 2314
      if (!tmp)					// Should never be true
	return;
2315
      add_key_field(key_fields,*and_level,cond_func,
2316 2317
		    ((Item_field*) (cond_func->arguments()[0])->real_item())
		    ->field,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2318
		    cond_func->functype() == Item_func::ISNULL_FUNC,
2319
		    &tmp, 1, usable_tables);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2320 2321 2322 2323 2324 2325 2326
    }
    break;
  }
  return;
}

/*
2327 2328
  Add all keys with uses 'field' for some keypart
  If field->and_level != and_level then only mark key_part as const_part
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2329 2330 2331
*/

static uint
2332
max_part_bit(key_part_map bits)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345
{
  uint found;
  for (found=0; bits & 1 ; found++,bits>>=1) ;
  return found;
}

static void
add_key_part(DYNAMIC_ARRAY *keyuse_array,KEY_FIELD *key_field)
{
  Field *field=key_field->field;
  TABLE *form= field->table;
  KEYUSE keyuse;

2346
  if (key_field->eq_func && !(key_field->optimize & KEY_OPTIMIZE_EXISTS))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2347 2348 2349
  {
    for (uint key=0 ; key < form->keys ; key++)
    {
2350
      if (!(form->keys_in_use_for_query.is_set(key)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363
	continue;
      if (form->key_info[key].flags & HA_FULLTEXT)
	continue;    // ToDo: ft-keys in non-ft queries.   SerG

      uint key_parts= (uint) form->key_info[key].key_parts;
      for (uint part=0 ; part <  key_parts ; part++)
      {
	if (field->eq(form->key_info[key].key_part[part].field))
	{
	  keyuse.table= field->table;
	  keyuse.val =  key_field->val;
	  keyuse.key =  key;
	  keyuse.keypart=part;
2364
	  keyuse.keypart_map= (key_part_map) 1 << part;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2365
	  keyuse.used_tables=key_field->val->used_tables();
2366
	  keyuse.optimize= key_field->optimize & KEY_OPTIMIZE_REF_OR_NULL;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2367 2368 2369 2370 2371 2372 2373
	  VOID(insert_dynamic(keyuse_array,(gptr) &keyuse));
	}
      }
    }
  }
}

monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
2374 2375 2376

#define FT_KEYPART   (MAX_REF_PARTS+10)

bk@work.mysql.com's avatar
bk@work.mysql.com committed
2377 2378 2379 2380
static void
add_ft_keys(DYNAMIC_ARRAY *keyuse_array,
            JOIN_TAB *stat,COND *cond,table_map usable_tables)
{
2381
  Item_func_match *cond_func=NULL;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2382

2383 2384 2385
  if (!cond)
    return;

2386 2387
  if (cond->type() == Item::FUNC_ITEM)
  {
2388 2389 2390
    Item_func *func=(Item_func *)cond;
    Item_func::Functype functype=  func->functype();
    if (functype == Item_func::FT_FUNC)
2391
      cond_func=(Item_func_match *)cond;
2392 2393 2394 2395
    else if (func->arg_count == 2)
    {
      Item_func *arg0=(Item_func *)(func->arguments()[0]),
                *arg1=(Item_func *)(func->arguments()[1]);
2396 2397 2398 2399 2400
      if (arg1->const_item()  &&
          ((functype == Item_func::GE_FUNC && arg1->val()> 0) ||
           (functype == Item_func::GT_FUNC && arg1->val()>=0))  &&
           arg0->type() == Item::FUNC_ITEM            &&
           arg0->functype() == Item_func::FT_FUNC)
2401
        cond_func=(Item_func_match *) arg0;
2402 2403 2404
      else if (arg0->const_item() &&
               ((functype == Item_func::LE_FUNC && arg0->val()> 0) ||
                (functype == Item_func::LT_FUNC && arg0->val()>=0)) &&
2405
                arg1->type() == Item::FUNC_ITEM          &&
2406
                arg1->functype() == Item_func::FT_FUNC)
2407 2408
        cond_func=(Item_func_match *) arg1;
    }
2409 2410 2411
  }
  else if (cond->type() == Item::COND_ITEM)
  {
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
2412
    List_iterator_fast<Item> li(*((Item_cond*) cond)->argument_list());
2413 2414 2415 2416 2417

    if (((Item_cond*) cond)->functype() == Item_func::COND_AND_FUNC)
    {
      Item *item;
      while ((item=li++))
2418
        add_ft_keys(keyuse_array,stat,item,usable_tables);
2419 2420 2421
    }
  }

2422 2423
  if (!cond_func || cond_func->key == NO_SUCH_KEY ||
      !(usable_tables & cond_func->table->map))
2424
    return;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2425 2426 2427

  KEYUSE keyuse;
  keyuse.table= cond_func->table;
2428
  keyuse.val =  cond_func;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2429
  keyuse.key =  cond_func->key;
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
2430
  keyuse.keypart= FT_KEYPART;
2431
  keyuse.used_tables=cond_func->key_item()->used_tables();
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
2432
  keyuse.optimize= 0;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
2433
  keyuse.keypart_map= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2434 2435 2436
  VOID(insert_dynamic(keyuse_array,(gptr) &keyuse));
}

2437

bk@work.mysql.com's avatar
bk@work.mysql.com committed
2438 2439 2440
static int
sort_keyuse(KEYUSE *a,KEYUSE *b)
{
2441
  int res;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2442 2443 2444 2445 2446 2447
  if (a->table->tablenr != b->table->tablenr)
    return (int) (a->table->tablenr - b->table->tablenr);
  if (a->key != b->key)
    return (int) (a->key - b->key);
  if (a->keypart != b->keypart)
    return (int) (a->keypart - b->keypart);
2448
  // Place const values before other ones
2449 2450
  if ((res= test((a->used_tables & ~OUTER_REF_TABLE_BIT)) -
       test((b->used_tables & ~OUTER_REF_TABLE_BIT))))
2451 2452 2453 2454
    return res;
  /* Place rows that are not 'OPTIMIZE_REF_OR_NULL' first */
  return (int) ((a->optimize & KEY_OPTIMIZE_REF_OR_NULL) -
		(b->optimize & KEY_OPTIMIZE_REF_OR_NULL));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2455 2456 2457 2458
}


/*
2459 2460 2461
  Update keyuse array with all possible keys we can use to fetch rows
  join_tab is a array in tablenr_order
  stat is a reference array in 'prefered' order.
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2462 2463 2464
*/

static bool
2465
update_ref_and_keys(THD *thd, DYNAMIC_ARRAY *keyuse,JOIN_TAB *join_tab,
2466 2467
		    uint tables, COND *cond, table_map normal_tables,
		    SELECT_LEX *select_lex)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2468 2469
{
  uint	and_level,i,found_eq_constant;
monty@mysql.com's avatar
monty@mysql.com committed
2470
  KEY_FIELD *key_fields, *end, *field;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2471

2472
  if (!(key_fields=(KEY_FIELD*)
monty@mashka.mysql.fi's avatar
merge  
monty@mashka.mysql.fi committed
2473
	thd->alloc(sizeof(key_fields[0])*
2474
		   (thd->lex->current_select->cond_count+1)*2)))
2475
    return TRUE; /* purecov: inspected */
monty@mysql.com's avatar
monty@mysql.com committed
2476 2477 2478 2479
  and_level= 0;
  field= end= key_fields;
  if (my_init_dynamic_array(keyuse,sizeof(KEYUSE),20,64))
    return TRUE;
2480
  if (cond)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2481
  {
2482
    add_key_fields(join_tab,&end,&and_level,cond,normal_tables);
monty@mysql.com's avatar
monty@mysql.com committed
2483
    for (; field != end ; field++)
hf@deer.(none)'s avatar
hf@deer.(none) committed
2484
    {
monty@mysql.com's avatar
monty@mysql.com committed
2485 2486 2487 2488 2489
      add_key_part(keyuse,field);
      /* Mark that we can optimize LEFT JOIN */
      if (field->val->type() == Item::NULL_ITEM &&
	  !field->field->real_maybe_null())
	field->field->table->reginfo.not_exists_optimize=1;
hf@deer.(none)'s avatar
hf@deer.(none) committed
2490
    }
monty@mysql.com's avatar
monty@mysql.com committed
2491
  }
2492
  for (i=0 ; i < tables ; i++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2493
  {
2494
    if (join_tab[i].on_expr)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2495
    {
2496 2497
      add_key_fields(join_tab,&end,&and_level,join_tab[i].on_expr,
		     join_tab[i].table->map);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2498 2499
    }
  }
2500
  /* fill keyuse with found key parts */
monty@mysql.com's avatar
monty@mysql.com committed
2501
  for ( ; field != end ; field++)
2502
    add_key_part(keyuse,field);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2503

2504
  if (select_lex->ftfunc_list->elements)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2505 2506 2507 2508 2509
  {
    add_ft_keys(keyuse,join_tab,cond,normal_tables);
  }

  /*
2510
    Special treatment for ft-keys.
2511 2512 2513
    Remove the following things from KEYUSE:
    - ref if there is a keypart which is a ref and a const.
    - keyparts without previous keyparts.
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530
  */
  if (keyuse->elements)
  {
    KEYUSE end,*prev,*save_pos,*use;

    qsort(keyuse->buffer,keyuse->elements,sizeof(KEYUSE),
	  (qsort_cmp) sort_keyuse);

    bzero((char*) &end,sizeof(end));		/* Add for easy testing */
    VOID(insert_dynamic(keyuse,(gptr) &end));

    use=save_pos=dynamic_element(keyuse,0,KEYUSE*);
    prev=&end;
    found_eq_constant=0;
    for (i=0 ; i < keyuse->elements-1 ; i++,use++)
    {
      if (!use->used_tables)
2531
	use->table->const_key_parts[use->key]|= use->keypart_map;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2532 2533
      if (use->keypart != FT_KEYPART)
      {
2534 2535 2536 2537 2538 2539 2540 2541
	if (use->key == prev->key && use->table == prev->table)
	{
	  if (prev->keypart+1 < use->keypart ||
	      prev->keypart == use->keypart && found_eq_constant)
	    continue;				/* remove */
	}
	else if (use->keypart != 0)		// First found must be 0
	  continue;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2542 2543 2544 2545 2546 2547 2548 2549
      }

      *save_pos= *use;
      prev=use;
      found_eq_constant= !use->used_tables;
      /* Save ptr to first use */
      if (!use->table->reginfo.join_tab->keyuse)
	use->table->reginfo.join_tab->keyuse=save_pos;
2550
      use->table->reginfo.join_tab->checked_keys.set_bit(use->key);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2551 2552 2553 2554 2555 2556 2557 2558 2559
      save_pos++;
    }
    i=(uint) (save_pos-(KEYUSE*) keyuse->buffer);
    VOID(set_dynamic(keyuse,(gptr) &end,i));
    keyuse->elements=i;
  }
  return FALSE;
}

2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578
/*
  Update some values in keyuse for faster find_best_combination() loop
*/

static void optimize_keyuse(JOIN *join, DYNAMIC_ARRAY *keyuse_array)
{
  KEYUSE *end,*keyuse= dynamic_element(keyuse_array, 0, KEYUSE*);

  for (end= keyuse+ keyuse_array->elements ; keyuse < end ; keyuse++)
  {
    table_map map;
    /*
      If we find a ref, assume this table matches a proportional
      part of this table.
      For example 100 records matching a table with 5000 records
      gives 5000/100 = 50 records per key
      Constant tables are ignored.
      To avoid bad matches, we don't make ref_table_rows less than 100.
    */
serg@serg.mylan's avatar
serg@serg.mylan committed
2579
    keyuse->ref_table_rows= ~(ha_rows) 0;	// If no ref
2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591
    if (keyuse->used_tables &
	(map= (keyuse->used_tables & ~join->const_table_map &
	       ~OUTER_REF_TABLE_BIT)))
    {
      uint tablenr;
      for (tablenr=0 ; ! (map & 1) ; map>>=1, tablenr++) ;
      if (map == 1)			// Only one table
      {
	TABLE *tmp_table=join->all_tables[tablenr];
	keyuse->ref_table_rows= max(tmp_table->file->records, 100);
      }
    }
2592 2593 2594 2595 2596 2597
    /*
      Outer reference (external field) is constant for single executing
      of subquery
    */
    if (keyuse->used_tables == OUTER_REF_TABLE_BIT)
      keyuse->ref_table_rows= 1;
2598 2599 2600
  }
}

bk@work.mysql.com's avatar
bk@work.mysql.com committed
2601 2602

/*****************************************************************************
2603 2604
  Go through all combinations of not marked tables and find the one
  which uses least records
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618
*****************************************************************************/

/* Save const tables first as used tables */

static void
set_position(JOIN *join,uint idx,JOIN_TAB *table,KEYUSE *key)
{
  join->positions[idx].table= table;
  join->positions[idx].key=key;
  join->positions[idx].records_read=1.0;	/* This is a const table */

  /* Move the const table as down as possible in best_ref */
  JOIN_TAB **pos=join->best_ref+idx+1;
  JOIN_TAB *next=join->best_ref[idx];
2619
  for (;next != table ; pos++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642
  {
    JOIN_TAB *tmp=pos[0];
    pos[0]=next;
    next=tmp;
  }
  join->best_ref[idx]=table;
}


static void
find_best_combination(JOIN *join, table_map rest_tables)
{
  DBUG_ENTER("find_best_combination");
  join->best_read=DBL_MAX;
  find_best(join,rest_tables, join->const_tables,1.0,0.0);
  DBUG_VOID_RETURN;
}


static void
find_best(JOIN *join,table_map rest_tables,uint idx,double record_count,
	  double read_time)
{
2643
  ha_rows rec;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2644
  double tmp;
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
2645
  THD *thd= join->thd;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676

  if (!rest_tables)
  {
    DBUG_PRINT("best",("read_time: %g  record_count: %g",read_time,
		       record_count));

    read_time+=record_count/(double) TIME_FOR_COMPARE;
    if (join->sort_by_table &&
	join->sort_by_table != join->positions[join->const_tables].table->table)
      read_time+=record_count;			// We have to make a temp table
    if (read_time < join->best_read)
    {
      memcpy((gptr) join->best_positions,(gptr) join->positions,
	     sizeof(POSITION)*idx);
      join->best_read=read_time;
    }
    return;
  }
  if (read_time+record_count/(double) TIME_FOR_COMPARE >= join->best_read)
    return;					/* Found better before */

  JOIN_TAB *s;
  double best_record_count=DBL_MAX,best_read_time=DBL_MAX;
  for (JOIN_TAB **pos=join->best_ref+idx ; (s=*pos) ; pos++)
  {
    table_map real_table_bit=s->table->map;
    if ((rest_tables & real_table_bit) && !(rest_tables & s->dependent))
    {
      double best,best_time,records;
      best=best_time=records=DBL_MAX;
      KEYUSE *best_key=0;
2677
      uint best_max_key_part=0;
2678
      my_bool found_constraint= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2679 2680 2681 2682 2683 2684

      if (s->keyuse)
      {						/* Use key if possible */
	TABLE *table=s->table;
	KEYUSE *keyuse,*start_key=0;
	double best_records=DBL_MAX;
2685
	uint max_key_part=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2686 2687

	/* Test how we can use keys */
2688
	rec= s->records/MATCHING_ROWS_IN_OTHER_TABLE;  // Assumed records/key
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2689 2690
	for (keyuse=s->keyuse ; keyuse->table == table ;)
	{
2691
	  key_part_map found_part=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2692 2693 2694 2695
	  table_map found_ref=0;
	  uint key=keyuse->key;
	  KEY *keyinfo=table->key_info+key;
          bool ft_key=(keyuse->keypart == FT_KEYPART);
2696
	  uint found_ref_or_null= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2697

2698
	  /* Calculate how many key segments of the current key we can use */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2699 2700 2701 2702
	  start_key=keyuse;
	  do
	  {
            uint keypart=keyuse->keypart;
2703
	    uint found_part_ref_or_null= KEY_OPTIMIZE_REF_OR_NULL;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2704 2705
	    do
	    {
2706 2707 2708 2709 2710 2711 2712 2713
	      if (!(rest_tables & keyuse->used_tables) &&
		  !(found_ref_or_null & keyuse->optimize))
	      {
		found_part|=keyuse->keypart_map;
		found_ref|= keyuse->used_tables;
		if (rec > keyuse->ref_table_rows)
		  rec= keyuse->ref_table_rows;
		found_part_ref_or_null&= keyuse->optimize;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2714 2715
              }
	      keyuse++;
2716
	      found_ref_or_null|= found_part_ref_or_null;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2717 2718 2719 2720 2721
	    } while (keyuse->table == table && keyuse->key == key &&
		     keyuse->keypart == keypart);
	  } while (keyuse->table == table && keyuse->key == key);

	  /*
2722
	    Assume that that each key matches a proportional part of table.
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2723 2724 2725
	  */
          if (!found_part && !ft_key)
	    continue;				// Nothing usable found
2726 2727
	  if (rec < MATCHING_ROWS_IN_OTHER_TABLE)
	    rec= MATCHING_ROWS_IN_OTHER_TABLE;	// Fix for small tables
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2728 2729

          /*
2730
	    ft-keys require special treatment
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2731 2732 2733 2734
          */
          if (ft_key)
          {
            /*
2735 2736
	      Really, there should be records=0.0 (yes!)
	      but 1.0 would be probably safer
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2737 2738 2739 2740 2741 2742
            */
            tmp=prev_record_reads(join,found_ref);
            records=1.0;
          }
          else
          {
2743
	  found_constraint= 1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2744
	  /*
2745
	    Check if we found full key
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2746
	  */
2747 2748
	  if (found_part == PREV_BITS(uint,keyinfo->key_parts) &&
	      !found_ref_or_null)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2749
	  {				/* use eq key */
2750
	    max_key_part= (uint) ~0;
2751 2752
	    if ((keyinfo->flags & (HA_NOSAME | HA_NULL_PART_KEY |
				   HA_END_SPACE_KEY)) == HA_NOSAME)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2753 2754 2755 2756 2757 2758
	    {
	      tmp=prev_record_reads(join,found_ref);
	      records=1.0;
	    }
	    else
	    {
2759 2760
	      if (!found_ref)
	      {					// We found a const key
2761
		if (table->quick_keys.is_set(key))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2762 2763
		  records= (double) table->quick_rows[key];
		else
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
2764 2765 2766 2767
		{
		  /* quick_range couldn't use key! */
		  records= (double) s->records/rec;
		}
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781
	      }
	      else
	      {
		if (!(records=keyinfo->rec_per_key[keyinfo->key_parts-1]))
		{				// Prefere longer keys
		  records=
		    ((double) s->records / (double) rec *
		     (1.0 +
		      ((double) (table->max_key_length-keyinfo->key_length) /
		       (double) table->max_key_length)));
		  if (records < 2.0)
		    records=2.0;		// Can't be as good as a unique
		}
	      }
2782 2783 2784
	      /* Limit the number of matched rows */
	      tmp= records;
	      set_if_smaller(tmp, (double) thd->variables.max_seeks_for_key);
2785
	      if (table->used_keys.is_set(key))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2786 2787 2788
	      {
		/* we can use only index tree */
		uint keys_per_block= table->file->block_size/2/
2789
		  (keyinfo->key_length+table->file->ref_length)+1;
2790
		tmp=record_count*(tmp+keys_per_block-1)/keys_per_block;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2791 2792
	      }
	      else
2793
		tmp=record_count*min(tmp,s->worst_seeks);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2794 2795 2796 2797 2798
	    }
	  }
	  else
	  {
	    /*
2799 2800 2801
	      Use as much key-parts as possible and a uniq key is better
	      than a not unique key
	      Set tmp to (previous record count) * (records / combination)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2802
	    */
2803
	    if ((found_part & 1) &&
2804 2805
		(!(table->file->index_flags(key) & HA_ONLY_WHOLE_INDEX) ||
		 found_part == PREV_BITS(uint,keyinfo->key_parts)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2806
	    {
2807
	      max_key_part=max_part_bit(found_part);
2808 2809 2810 2811
	      /*
		Check if quick_range could determinate how many rows we
		will match
	      */
2812
	      if (table->quick_keys.is_set(key) &&
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2813 2814 2815 2816 2817 2818 2819 2820 2821 2822
		  table->quick_key_parts[key] <= max_key_part)
		tmp=records= (double) table->quick_rows[key];
	      else
	      {
		/* Check if we have statistic about the distribution */
		if ((records=keyinfo->rec_per_key[max_key_part-1]))
		  tmp=records;
		else
		{
		  /*
2823
		    Assume that the first key part matches 1% of the file
2824
		    and that the hole key matches 10 (duplicates) or 1
2825 2826 2827 2828 2829
		    (unique) records.
		    Assume also that more key matches proportionally more
		    records
		    This gives the formula:
		    records= (x * (b-a) + a*c-b)/(c-1)
2830

2831 2832 2833 2834
		    b = records matched by whole key
		    a = records matched by first key part (10% of all records?)
		    c = number of key parts in key
		    x = used key parts (1 <= x <= c)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854
		  */
		  double rec_per_key;
		  if (!(rec_per_key=(double)
			keyinfo->rec_per_key[keyinfo->key_parts-1]))
		    rec_per_key=(double) s->records/rec+1;

		  if (!s->records)
		    tmp=0;
		  else if (rec_per_key/(double) s->records >= 0.01)
		    tmp=rec_per_key;
		  else
		  {
		    double a=s->records*0.01;
		    tmp=(max_key_part * (rec_per_key - a) +
			 a*keyinfo->key_parts - rec_per_key)/
		      (keyinfo->key_parts-1);
		    set_if_bigger(tmp,1.0);
		  }
		  records=(ulong) tmp;
		}
2855 2856 2857 2858 2859 2860
		if (found_ref_or_null)
		{
		  /* We need to do two key searches to find key */
		  tmp*= 2.0;
		  records*= 2.0;
		}
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2861
	      }
2862 2863
	      /* Limit the number of matched rows */
	      set_if_smaller(tmp, (double) thd->variables.max_seeks_for_key);
2864
	      if (table->used_keys.is_set(key))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2865 2866 2867
	      {
		/* we can use only index tree */
		uint keys_per_block= table->file->block_size/2/
2868
		  (keyinfo->key_length+table->file->ref_length)+1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2869 2870 2871 2872 2873 2874 2875 2876
		tmp=record_count*(tmp+keys_per_block-1)/keys_per_block;
	      }
	      else
		tmp=record_count*min(tmp,s->worst_seeks);
	    }
	    else
	      tmp=best_time;			// Do nothing
	  }
2877
          } /* not ft_key */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2878 2879 2880 2881 2882 2883
	  if (tmp < best_time - records/(double) TIME_FOR_COMPARE)
	  {
	    best_time=tmp + records/(double) TIME_FOR_COMPARE;
	    best=tmp;
	    best_records=records;
	    best_key=start_key;
2884
	    best_max_key_part=max_key_part;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2885 2886 2887 2888
	  }
	}
	records=best_records;
      }
2889 2890 2891 2892

      /*
	Don't test table scan if it can't be better.
	Prefer key lookup if we would use the same key for scanning.
2893 2894 2895 2896 2897

	Don't do a table scan on InnoDB tables, if we can read the used
	parts of the row from any of the used index.
	This is because table scans uses index and we would not win
	anything by using a table scan.
2898 2899 2900
      */
      if ((records >= s->found_records || best > s->read_time) &&
	  !(s->quick && best_key && s->quick->index == best_key->key &&
2901
	    best_max_key_part >= s->table->quick_key_parts[best_key->key]) &&
2902
	  !((s->table->file->table_flags() & HA_TABLE_SCAN_ON_INDEX) &&
2903
	    ! s->table->used_keys.is_clear_all() && best_key) &&
2904
	  !(s->table->force_index && best_key))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2905
      {						// Check full join
2906 2907 2908 2909 2910 2911 2912 2913 2914 2915
        ha_rows rnd_records= s->found_records;
        /*
          If there is a restriction on the table, assume that 25% of the
          rows can be skipped on next part.
          This is to force tables that this table depends on before this
          table
        */
        if (found_constraint)
          rnd_records-= rnd_records/4;

2916 2917 2918 2919 2920 2921
        /*
          Range optimizer never proposes a RANGE if it isn't better
          than FULL: so if RANGE is present, it's always preferred to FULL.
          Here we estimate its cost.
        */
        if (s->quick)
2922
        {
2923 2924 2925 2926 2927
          /*
            For each record we:
             - read record range through 'quick'
             - skip rows which does not satisfy WHERE constraints
           */
2928
          tmp= record_count *
2929 2930
               (s->quick->read_time +
               (s->found_records - rnd_records)/(double) TIME_FOR_COMPARE);
2931 2932 2933
        }
        else
        {
2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961
          /* Estimate cost of reading table. */
          tmp= s->table->file->scan_time();
          if (s->on_expr)                         // Can't use join cache
          {
            /*
              For each record we have to:
              - read the whole table record 
              - skip rows which does not satisfy join condition
            */
            tmp= record_count *
                 (tmp +     
                 (s->records - rnd_records)/(double) TIME_FOR_COMPARE);
          }
          else
          {
            /* We read the table as many times as join buffer becomes full. */
            tmp*= (1.0 + floor((double) cache_record_length(join,idx) *
                               record_count /
                               (double) thd->variables.join_buff_size));
            /* 
              We don't make full cartesian product between rows in the scanned
              table and existing records because we skip all rows from the
              scanned table, which does not satisfy join condition when 
              we read the table (see flush_cached_records for details). Here we
              take into account cost to read and skip these records.
            */
            tmp+= (s->records - rnd_records)/(double) TIME_FOR_COMPARE;
          }
2962
        }
2963

2964
        /*
2965
          We estimate the cost of evaluating WHERE clause for found records
2966
          as record_count * rnd_records / TIME_FOR_COMPARE. This cost plus
2967
          tmp give us total cost of using TABLE SCAN
2968
        */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2969
	if (best == DBL_MAX ||
2970
	    (tmp  + record_count/(double) TIME_FOR_COMPARE*rnd_records <
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2971 2972
	     best + record_count/(double) TIME_FOR_COMPARE*records))
	{
2973 2974 2975 2976
	  /*
	    If the table has a range (s->quick is set) make_join_select()
	    will ensure that this will be used
	  */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2977
	  best=tmp;
2978
	  records= rows2double(rnd_records);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2979 2980 2981
	  best_key=0;
	}
      }
2982
      join->positions[idx].records_read= records;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2983 2984 2985
      join->positions[idx].key=best_key;
      join->positions[idx].table= s;
      if (!best_key && idx == join->const_tables &&
2986
	  s->table == join->sort_by_table &&
2987
	  join->unit->select_limit_cnt >= records)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2988 2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009
	join->sort_by_table= (TABLE*) 1;	// Must use temporary table

     /*
	Go to the next level only if there hasn't been a better key on
	this level! This will cut down the search for a lot simple cases!
       */
      double current_record_count=record_count*records;
      double current_read_time=read_time+best;
      if (best_record_count > current_record_count ||
	  best_read_time > current_read_time ||
	  idx == join->const_tables && s->table == join->sort_by_table)
      {
	if (best_record_count >= current_record_count &&
	    best_read_time >= current_read_time &&
	    (!(s->key_dependent & rest_tables) || records < 2.0))
	{
	  best_record_count=current_record_count;
	  best_read_time=current_read_time;
	}
	swap(JOIN_TAB*,join->best_ref[idx],*pos);
	find_best(join,rest_tables & ~real_table_bit,idx+1,
		  current_record_count,current_read_time);
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
3010 3011
        if (thd->killed)
          return;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3012 3013 3014 3015 3016 3017 3018 3019 3020 3021
	swap(JOIN_TAB*,join->best_ref[idx],*pos);
      }
      if (join->select_options & SELECT_STRAIGHT_JOIN)
	break;				// Don't test all combinations
    }
  }
}


/*
3022
  Find how much space the prevous read not const tables takes in cache
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3023 3024
*/

3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059
static void calc_used_field_length(THD *thd, JOIN_TAB *join_tab)
{
  uint null_fields,blobs,fields,rec_length;
  null_fields=blobs=fields=rec_length=0;

  Field **f_ptr,*field;
  for (f_ptr=join_tab->table->field ; (field= *f_ptr) ; f_ptr++)
  {
    if (field->query_id == thd->query_id)
    {
      uint flags=field->flags;
      fields++;
      rec_length+=field->pack_length();
      if (flags & BLOB_FLAG)
	blobs++;
      if (!(flags & NOT_NULL_FLAG))
	null_fields++;
    }
  }
  if (null_fields)
    rec_length+=(join_tab->table->null_fields+7)/8;
  if (join_tab->table->maybe_null)
    rec_length+=sizeof(my_bool);
  if (blobs)
  {
    uint blob_length=(uint) (join_tab->table->file->mean_rec_length-
			     (join_tab->table->reclength- rec_length));
    rec_length+=(uint) max(4,blob_length);
  }
  join_tab->used_fields=fields;
  join_tab->used_fieldlength=rec_length;
  join_tab->used_blobs=blobs;
}


bk@work.mysql.com's avatar
bk@work.mysql.com committed
3060 3061 3062
static uint
cache_record_length(JOIN *join,uint idx)
{
3063
  uint length=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3064
  JOIN_TAB **pos,**end;
3065
  THD *thd=join->thd;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3066 3067 3068 3069 3070 3071

  for (pos=join->best_ref+join->const_tables,end=join->best_ref+idx ;
       pos != end ;
       pos++)
  {
    JOIN_TAB *join_tab= *pos;
3072 3073
    if (!join_tab->used_fieldlength)		/* Not calced yet */
      calc_used_field_length(thd, join_tab);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3074 3075 3076 3077 3078 3079 3080 3081 3082 3083
    length+=join_tab->used_fieldlength;
  }
  return length;
}


static double
prev_record_reads(JOIN *join,table_map found_ref)
{
  double found=1.0;
3084
  found_ref&= ~OUTER_REF_TABLE_BIT;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096 3097
  for (POSITION *pos=join->positions ; found_ref ; pos++)
  {
    if (pos->table->table->map & found_ref)
    {
      found_ref&= ~pos->table->table->map;
      found*=pos->records_read;
    }
  }
  return found;
}


/*****************************************************************************
3098
  Set up join struct according to best position.
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3099 3100 3101 3102 3103
*****************************************************************************/

static bool
get_best_combination(JOIN *join)
{
3104
  uint i,tablenr;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3105 3106 3107 3108
  table_map used_tables;
  JOIN_TAB *join_tab,*j;
  KEYUSE *keyuse;
  uint table_count;
3109
  THD *thd=join->thd;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3110 3111 3112

  table_count=join->tables;
  if (!(join->join_tab=join_tab=
3113
	(JOIN_TAB*) thd->alloc(sizeof(JOIN_TAB)*table_count)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3114 3115 3116 3117
    return TRUE;

  join->full_join=0;

3118
  used_tables= OUTER_REF_TABLE_BIT;		// Outer row is already read
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3119 3120 3121 3122 3123 3124 3125 3126 3127
  for (j=join_tab, tablenr=0 ; tablenr < table_count ; tablenr++,j++)
  {
    TABLE *form;
    *j= *join->best_positions[tablenr].table;
    form=join->table[tablenr]=j->table;
    used_tables|= form->map;
    form->reginfo.join_tab=j;
    if (!j->on_expr)
      form->reginfo.not_exists_optimize=0;	// Only with LEFT JOIN
3128 3129 3130 3131 3132
    if (j->type == JT_CONST)
      continue;					// Handled in make_join_stat..

    j->ref.key = -1;
    j->ref.key_parts=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3133 3134 3135

    if (j->type == JT_SYSTEM)
      continue;
3136
    if (j->keys.is_clear_all() || !(keyuse= join->best_positions[tablenr].key))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3137 3138 3139 3140 3141
    {
      j->type=JT_ALL;
      if (tablenr != join->const_tables)
	join->full_join=1;
    }
3142 3143 3144
    else if (create_ref_for_key(join, j, keyuse, used_tables))
      return TRUE;				// Something went wrong
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3145

3146 3147 3148 3149 3150
  for (i=0 ; i < table_count ; i++)
    join->map2table[join->join_tab[i].table->tablenr]=join->join_tab+i;
  update_depend_map(join);
  return 0;
}
3151

bk@work.mysql.com's avatar
bk@work.mysql.com committed
3152

3153 3154 3155 3156 3157 3158 3159 3160 3161
static bool create_ref_for_key(JOIN *join, JOIN_TAB *j, KEYUSE *org_keyuse,
			       table_map used_tables)
{
  KEYUSE *keyuse=org_keyuse;
  bool ftkey=(keyuse->keypart == FT_KEYPART);
  THD  *thd= join->thd;
  uint keyparts,length,key;
  TABLE *table;
  KEY *keyinfo;
3162

3163
  /*  Use best key from find_best */
3164 3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177 3178
  table=j->table;
  key=keyuse->key;
  keyinfo=table->key_info+key;

  if (ftkey)
  {
    Item_func_match *ifm=(Item_func_match *)keyuse->val;

    length=0;
    keyparts=1;
    ifm->join_key=1;
  }
  else
  {
    keyparts=length=0;
3179 3180 3181 3182 3183 3184
    uint found_part_ref_or_null= 0;
    /*
      Calculate length for the used key
      Stop if there is a missing key part or when we find second key_part
      with KEY_OPTIMIZE_REF_OR_NULL
    */
3185 3186
    do
    {
3187
      if (!(~used_tables & keyuse->used_tables))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3188
      {
3189 3190
	if (keyparts == keyuse->keypart &&
	    !(found_part_ref_or_null & keyuse->optimize))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3191
	{
3192
	  keyparts++;
3193 3194
	  length+= keyinfo->key_part[keyuse->keypart].store_length;
	  found_part_ref_or_null|= keyuse->optimize;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3195 3196
	}
      }
3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214 3215 3216
      keyuse++;
    } while (keyuse->table == table && keyuse->key == key);
  } /* not ftkey */

  /* set up fieldref */
  keyinfo=table->key_info+key;
  j->ref.key_parts=keyparts;
  j->ref.key_length=length;
  j->ref.key=(int) key;
  if (!(j->ref.key_buff= (byte*) thd->calloc(ALIGN_SIZE(length)*2)) ||
      !(j->ref.key_copy= (store_key**) thd->alloc((sizeof(store_key*) *
						   (keyparts+1)))) ||
      !(j->ref.items=    (Item**) thd->alloc(sizeof(Item*)*keyparts)))
  {
    return TRUE;
  }
  j->ref.key_buff2=j->ref.key_buff+ALIGN_SIZE(length);
  j->ref.key_err=1;
  keyuse=org_keyuse;

3217 3218
  store_key **ref_key= j->ref.key_copy;
  byte *key_buff=j->ref.key_buff, *null_ref_key= 0;
3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240
  if (ftkey)
  {
    j->ref.items[0]=((Item_func*)(keyuse->val))->key_item();
    if (keyuse->used_tables)
      return TRUE; // not supported yet. SerG

    j->type=JT_FT;
  }
  else
  {
    uint i;
    for (i=0 ; i < keyparts ; keyuse++,i++)
    {
      while (keyuse->keypart != i ||
	     ((~used_tables) & keyuse->used_tables))
	keyuse++;				/* Skip other parts */

      uint maybe_null= test(keyinfo->key_part[i].null_bit);
      j->ref.items[i]=keyuse->val;		// Save for cond removal
      if (!keyuse->used_tables &&
	  !(join->select_options & SELECT_DESCRIBE))
      {					// Compare against constant
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
3241 3242 3243 3244
	store_key_item tmp(thd, keyinfo->key_part[i].field,
                           (char*)key_buff + maybe_null,
                           maybe_null ?  (char*) key_buff : 0,
                           keyinfo->key_part[i].length, keyuse->val);
3245
	if (thd->is_fatal_error)
3246
	  return TRUE;
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
3247
	tmp.copy();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3248 3249
      }
      else
3250 3251 3252 3253
	*ref_key++= get_store_key(thd,
				  keyuse,join->const_table_map,
				  &keyinfo->key_part[i],
				  (char*) key_buff,maybe_null);
3254 3255 3256
      /* Remmeber if we are going to use REF_OR_NULL */
      if (keyuse->optimize & KEY_OPTIMIZE_REF_OR_NULL)
	null_ref_key= key_buff;
3257
      key_buff+=keyinfo->key_part[i].store_length;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3258
    }
3259 3260
  } /* not ftkey */
  *ref_key=0;				// end_marker
3261 3262 3263 3264
  if (j->type == JT_FT)
    return 0;
  if (j->type == JT_CONST)
    j->table->const_table= 1;
3265
  else if (((keyinfo->flags & (HA_NOSAME | HA_NULL_PART_KEY |
monty@mysql.com's avatar
monty@mysql.com committed
3266
			       HA_END_SPACE_KEY)) != HA_NOSAME) ||
monty@mysql.com's avatar
monty@mysql.com committed
3267
	   keyparts != keyinfo->key_parts || null_ref_key)
3268 3269 3270
  {
    /* Must read with repeat */
    j->type= null_ref_key ? JT_REF_OR_NULL : JT_REF;
3271
    j->ref.null_ref_key= null_ref_key;
3272
  }
3273
  else if (ref_key == j->ref.key_copy)
3274
  {
3275 3276 3277 3278 3279 3280 3281 3282
    /*
      This happen if we are using a constant expression in the ON part
      of an LEFT JOIN.
      SELECT * FROM a LEFT JOIN b ON b.key=30
      Here we should not mark the table as a 'const' as a field may
      have a 'normal' value or a NULL value.
    */
    j->type=JT_CONST;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3283
  }
3284 3285
  else
    j->type=JT_EQ_REF;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3286 3287 3288 3289
  return 0;
}


3290

bk@work.mysql.com's avatar
bk@work.mysql.com committed
3291
static store_key *
3292 3293
get_store_key(THD *thd, KEYUSE *keyuse, table_map used_tables,
	      KEY_PART_INFO *key_part, char *key_buff, uint maybe_null)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3294 3295 3296
{
  if (!((~used_tables) & keyuse->used_tables))		// if const item
  {
3297 3298
    return new store_key_const_item(thd,
				    key_part->field,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3299 3300 3301 3302 3303 3304
				    key_buff + maybe_null,
				    maybe_null ? key_buff : 0,
				    key_part->length,
				    keyuse->val);
  }
  else if (keyuse->val->type() == Item::FIELD_ITEM)
3305 3306
    return new store_key_field(thd,
			       key_part->field,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3307 3308 3309 3310 3311
			       key_buff + maybe_null,
			       maybe_null ? key_buff : 0,
			       key_part->length,
			       ((Item_field*) keyuse->val)->field,
			       keyuse->val->full_name());
3312 3313
  return new store_key_item(thd,
			    key_part->field,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3314 3315 3316 3317 3318 3319 3320
			    key_buff + maybe_null,
			    maybe_null ? key_buff : 0,
			    key_part->length,
			    keyuse->val);
}

/*
3321 3322
  This function is only called for const items on fields which are keys
  returns 1 if there was some conversion made when the field was stored.
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3323 3324 3325 3326 3327
*/

bool
store_val_in_field(Field *field,Item *item)
{
3328
  bool error;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3329
  THD *thd=current_thd;
3330
  ha_rows cuted_fields=thd->cuted_fields;
3331
  thd->count_cuted_fields= CHECK_FIELD_WARN;
3332
  error= item->save_in_field(field, 1);
3333
  thd->count_cuted_fields= CHECK_FIELD_IGNORE;
3334
  return error || cuted_fields != thd->cuted_fields;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3335 3336 3337 3338 3339 3340 3341 3342 3343
}


static bool
make_simple_join(JOIN *join,TABLE *tmp_table)
{
  TABLE **tableptr;
  JOIN_TAB *join_tab;

3344 3345
  if (!(tableptr=(TABLE**) join->thd->alloc(sizeof(TABLE*))) ||
      !(join_tab=(JOIN_TAB*) join->thd->alloc(sizeof(JOIN_TAB))))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3346 3347 3348 3349 3350 3351
    return TRUE;
  join->join_tab=join_tab;
  join->table=tableptr; tableptr[0]=tmp_table;
  join->tables=1;
  join->const_tables=0;
  join->const_table_map=0;
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
3352 3353 3354
  join->tmp_table_param.field_count= join->tmp_table_param.sum_func_count=
    join->tmp_table_param.func_count=0;
  join->tmp_table_param.copy_field=join->tmp_table_param.copy_field_end=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3355
  join->first_record=join->sort_and_group=0;
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
3356
  join->send_records=(ha_rows) 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3357
  join->group=0;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
3358
  join->row_limit=join->unit->select_limit_cnt;
3359
  join->do_send_rows = (join->row_limit) ? 1 : 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3360

serg@serg.mylan's avatar
serg@serg.mylan committed
3361
  join_tab->cache.buff=0;			/* No caching */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3362 3363 3364 3365 3366
  join_tab->table=tmp_table;
  join_tab->select=0;
  join_tab->select_cond=0;
  join_tab->quick=0;
  join_tab->type= JT_ALL;			/* Map through all records */
serg@serg.mylan's avatar
serg@serg.mylan committed
3367
  join_tab->keys.init(~0);                      /* test everything in quick */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3368 3369 3370
  join_tab->info=0;
  join_tab->on_expr=0;
  join_tab->ref.key = -1;
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
3371 3372
  join_tab->not_used_in_distinct=0;
  join_tab->read_first_record= join_init_read_record;
3373
  join_tab->join=join;
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
3374
  bzero((char*) &join_tab->read_record,sizeof(join_tab->read_record));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389
  tmp_table->status=0;
  tmp_table->null_row=0;
  return FALSE;
}


static bool
make_join_select(JOIN *join,SQL_SELECT *select,COND *cond)
{
  DBUG_ENTER("make_join_select");
  if (select)
  {
    table_map used_tables;
    if (join->tables > 1)
      cond->update_used_tables();		// Tablenr may have changed
3390 3391
    if (join->const_tables == join->tables)
      join->const_table_map|=RAND_TABLE_BIT;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3392 3393 3394 3395 3396
    {						// Check const tables
      COND *const_cond=
	make_cond_for_table(cond,join->const_table_map,(table_map) 0);
      DBUG_EXECUTE("where",print_where(const_cond,"constants"););
      if (const_cond && !const_cond->val_int())
3397 3398
      {
	DBUG_PRINT("info",("Found impossible WHERE condition"));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3399
	DBUG_RETURN(1);				// Impossible const condition
3400
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3401
    }
3402 3403
    used_tables=((select->const_tables=join->const_table_map) |
		 OUTER_REF_TABLE_BIT | RAND_TABLE_BIT);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3404 3405 3406 3407
    for (uint i=join->const_tables ; i < join->tables ; i++)
    {
      JOIN_TAB *tab=join->join_tab+i;
      table_map current_map= tab->table->map;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
3408 3409 3410 3411
      /*
	Following force including random expression in last table condition.
	It solve problem with select like SELECT * FROM t1 WHERE rand() > 0.5
      */
3412
      if (i == join->tables-1)
3413
	current_map|= OUTER_REF_TABLE_BIT | RAND_TABLE_BIT;
3414
      bool use_quick_range=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3415
      used_tables|=current_map;
3416 3417

      if (tab->type == JT_REF && tab->quick &&
3418
	  (uint) tab->ref.key == tab->quick->index &&
3419 3420 3421 3422 3423 3424 3425
	  tab->ref.key_length < tab->quick->max_used_key_length)
      {
	/* Range uses longer key;  Use this instead of ref on key */
	tab->type=JT_ALL;
	use_quick_range=1;
	tab->use_quick=1;
	tab->ref.key_parts=0;		// Don't use ref key.
3426
	join->best_positions[i].records_read= rows2double(tab->quick->records);
3427 3428
      }

bk@work.mysql.com's avatar
bk@work.mysql.com committed
3429
      COND *tmp=make_cond_for_table(cond,used_tables,current_map);
3430 3431 3432 3433 3434 3435 3436 3437
      if (!tmp && tab->quick)
      {						// Outer join
	/*
	  Hack to handle the case where we only refer to a table
	  in the ON part of an OUTER JOIN.
	*/
	tmp=new Item_int((longlong) 1,1);	// Always true
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3438 3439 3440 3441
      if (tmp)
      {
	DBUG_EXECUTE("where",print_where(tmp,tab->table->table_name););
	SQL_SELECT *sel=tab->select=(SQL_SELECT*)
3442
	  join->thd->memdup((gptr) select, sizeof(SQL_SELECT));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3443 3444 3445 3446 3447 3448
	if (!sel)
	  DBUG_RETURN(1);			// End of memory
	tab->select_cond=sel->cond=tmp;
	sel->head=tab->table;
	if (tab->quick)
	{
3449 3450
	  /* Use quick key read if it's a constant and it's not used
	     with key reading */
3451
	  if (tab->needed_reg.is_clear_all() && tab->type != JT_EQ_REF
3452
	      && tab->type != JT_FT && (tab->type != JT_REF ||
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3453 3454 3455
	       (uint) tab->ref.key == tab->quick->index))
	  {
	    sel->quick=tab->quick;		// Use value from get_quick_...
3456 3457
	    sel->quick_keys.clear_all();
	    sel->needed_reg.clear_all();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3458 3459 3460 3461 3462 3463 3464 3465 3466 3467
	  }
	  else
	  {
	    delete tab->quick;
	  }
	  tab->quick=0;
	}
	uint ref_key=(uint) sel->head->reginfo.join_tab->ref.key+1;
	if (i == join->const_tables && ref_key)
	{
3468 3469
	  if (!tab->const_keys.is_clear_all() &&
              tab->table->reginfo.impossible_range)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3470 3471
	    DBUG_RETURN(1);
	}
3472
	else if (tab->type == JT_ALL && ! use_quick_range)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3473
	{
3474
	  if (!tab->const_keys.is_clear_all() &&
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3475 3476 3477 3478
	      tab->table->reginfo.impossible_range)
	    DBUG_RETURN(1);				// Impossible range
	  /*
	    We plan to scan all rows.
3479 3480 3481
	    Check again if we should use an index.
	    We could have used an column from a previous table in
	    the index if we are using limit and this is the first table
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3482 3483
	  */

3484 3485 3486
	  if ((!tab->keys.is_subset(tab->const_keys) && i > 0) ||
	      (!tab->const_keys.is_clear_all() && i == join->const_tables &&
	       join->unit->select_limit_cnt <
3487
	       join->best_positions[i].records_read &&
3488
	       !(join->select_options & OPTION_FOUND_ROWS)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3489
	  {
3490 3491 3492
	    /* Join with outer join condition */
	    COND *orig_cond=sel->cond;
	    sel->cond=and_conds(sel->cond,tab->on_expr);
3493
	    if (sel->test_quick_select(join->thd, tab->keys,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3494
				       used_tables & ~ current_map,
3495 3496 3497
				       (join->select_options &
					OPTION_FOUND_ROWS ?
					HA_POS_ERROR :
3498
					join->unit->select_limit_cnt)) < 0)
3499 3500 3501 3502 3503
            {
	      /*
		Before reporting "Impossible WHERE" for the whole query
		we have to check isn't it only "impossible ON" instead
	      */
3504 3505
              sel->cond=orig_cond;
              if (!tab->on_expr ||
3506
                  sel->test_quick_select(join->thd, tab->keys,
3507 3508 3509 3510
                                         used_tables & ~ current_map,
                                         (join->select_options &
                                          OPTION_FOUND_ROWS ?
                                          HA_POS_ERROR :
3511 3512
                                          join->unit->select_limit_cnt)) < 0)
		DBUG_RETURN(1);			// Impossible WHERE
3513 3514 3515 3516
            }
            else
	      sel->cond=orig_cond;

3517 3518 3519
	    /* Fix for EXPLAIN */
	    if (sel->quick)
	      join->best_positions[i].records_read= sel->quick->records;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3520 3521 3522 3523
	  }
	  else
	  {
	    sel->needed_reg=tab->needed_reg;
3524
	    sel->quick_keys.clear_all();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3525
	  }
3526 3527
	  if (!sel->quick_keys.is_subset(tab->checked_keys) ||
              !sel->needed_reg.is_subset(tab->checked_keys))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3528
	  {
3529 3530 3531 3532
	    tab->keys=sel->quick_keys;
            tab->keys.merge(sel->needed_reg);
	    tab->use_quick= (!sel->needed_reg.is_clear_all() &&
			     (select->quick_keys.is_clear_all() ||
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3533 3534 3535
			      (select->quick &&
			       (select->quick->records >= 100L)))) ?
	      2 : 1;
hf@deer.(none)'s avatar
hf@deer.(none) committed
3536
	    sel->read_tables= used_tables & ~current_map;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3537 3538 3539 3540 3541 3542 3543 3544 3545
	  }
	  if (i != join->const_tables && tab->use_quick != 2)
	  {					/* Read with cache */
	    if ((tmp=make_cond_for_table(cond,
					 join->const_table_map |
					 current_map,
					 current_map)))
	    {
	      DBUG_EXECUTE("where",print_where(tmp,"cache"););
3546 3547
	      tab->cache.select=(SQL_SELECT*)
		join->thd->memdup((gptr) sel, sizeof(SQL_SELECT));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3548 3549 3550 3551 3552 3553 3554 3555 3556 3557 3558 3559 3560
	      tab->cache.select->cond=tmp;
	      tab->cache.select->read_tables=join->const_table_map;
	    }
	  }
	}
      }
    }
  }
  DBUG_RETURN(0);
}


static void
3561
make_join_readinfo(JOIN *join, uint options)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3562 3563
{
  uint i;
3564
  SELECT_LEX *select_lex= &join->thd->lex->select_lex;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3565 3566 3567 3568 3569 3570 3571 3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 3584 3585 3586
  DBUG_ENTER("make_join_readinfo");

  for (i=join->const_tables ; i < join->tables ; i++)
  {
    JOIN_TAB *tab=join->join_tab+i;
    TABLE *table=tab->table;
    tab->read_record.table= table;
    tab->read_record.file=table->file;
    tab->next_select=sub_select;		/* normal select */
    switch (tab->type) {
    case JT_SYSTEM:				// Only happens with left join
      table->status=STATUS_NO_RECORD;
      tab->read_first_record= join_read_system;
      tab->read_record.read_record= join_no_more_records;
      break;
    case JT_CONST:				// Only happens with left join
      table->status=STATUS_NO_RECORD;
      tab->read_first_record= join_read_const;
      tab->read_record.read_record= join_no_more_records;
      break;
    case JT_EQ_REF:
      table->status=STATUS_NO_RECORD;
3587 3588 3589 3590 3591
      if (tab->select)
      {
	delete tab->select->quick;
	tab->select->quick=0;
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3592 3593 3594 3595 3596
      delete tab->quick;
      tab->quick=0;
      table->file->index_init(tab->ref.key);
      tab->read_first_record= join_read_key;
      tab->read_record.read_record= join_no_more_records;
3597
      if (table->used_keys.is_set(tab->ref.key) &&
3598
	  !table->no_keyread)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3599 3600 3601 3602 3603
      {
	table->key_read=1;
	table->file->extra(HA_EXTRA_KEYREAD);
      }
      break;
3604
    case JT_REF_OR_NULL:
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3605 3606
    case JT_REF:
      table->status=STATUS_NO_RECORD;
3607 3608 3609 3610 3611
      if (tab->select)
      {
	delete tab->select->quick;
	tab->select->quick=0;
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3612 3613 3614
      delete tab->quick;
      tab->quick=0;
      table->file->index_init(tab->ref.key);
3615
      if (table->used_keys.is_set(tab->ref.key) &&
3616
	  !table->no_keyread)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3617 3618 3619 3620
      {
	table->key_read=1;
	table->file->extra(HA_EXTRA_KEYREAD);
      }
3621 3622 3623 3624 3625 3626 3627 3628 3629 3630
      if (tab->type == JT_REF)
      {
	tab->read_first_record= join_read_always_key;
	tab->read_record.read_record= join_read_next_same;
      }
      else
      {
	tab->read_first_record= join_read_always_key_or_null;
	tab->read_record.read_record= join_read_next_same_or_null;
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3631 3632 3633 3634 3635 3636 3637 3638 3639
      break;
    case JT_FT:
      table->status=STATUS_NO_RECORD;
      table->file->index_init(tab->ref.key);
      tab->read_first_record= join_ft_read_first;
      tab->read_record.read_record= join_ft_read_next;
      break;
    case JT_ALL:
      /*
3640
	If previous table use cache
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3641 3642
      */
      table->status=STATUS_NO_RECORD;
3643
      if (i != join->const_tables && !(options & SELECT_NO_JOIN_CACHE) &&
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3644 3645 3646 3647 3648 3649 3650 3651 3652 3653 3654
	  tab->use_quick != 2 && !tab->on_expr)
      {
	if ((options & SELECT_DESCRIBE) ||
	    !join_init_cache(join->thd,join->join_tab+join->const_tables,
			     i-join->const_tables))
	{
	  tab[-1].next_select=sub_select_cache; /* Patch previous */
	}
      }
      /* These init changes read_record */
      if (tab->use_quick == 2)
3655
      {
3656
	join->thd->server_status|=SERVER_QUERY_NO_GOOD_INDEX_USED;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3657
	tab->read_first_record= join_init_quick_read_record;
3658 3659
	statistic_increment(select_range_check_count, &LOCK_status);
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3660 3661 3662
      else
      {
	tab->read_first_record= join_init_read_record;
3663 3664 3665 3666 3667 3668 3669 3670
	if (i == join->const_tables)
	{
	  if (tab->select && tab->select->quick)
	  {
	    statistic_increment(select_range_count, &LOCK_status);
	  }
	  else
	  {
3671
	    join->thd->server_status|=SERVER_QUERY_NO_INDEX_USED;
3672 3673 3674 3675 3676 3677 3678 3679 3680 3681 3682
	    statistic_increment(select_scan_count, &LOCK_status);
	  }
	}
	else
	{
	  if (tab->select && tab->select->quick)
	  {
	    statistic_increment(select_full_range_join_count, &LOCK_status);
	  }
	  else
	  {
3683
	    join->thd->server_status|=SERVER_QUERY_NO_INDEX_USED;
3684 3685 3686
	    statistic_increment(select_full_join_count, &LOCK_status);
	  }
	}
3687
	if (!table->no_keyread)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3688
	{
3689
	  if (tab->select && tab->select->quick &&
3690
	      table->used_keys.is_set(tab->select->quick->index))
3691 3692 3693 3694
	  {
	    table->key_read=1;
	    table->file->extra(HA_EXTRA_KEYREAD);
	  }
3695
	  else if (!table->used_keys.is_clear_all() && ! (tab->select && tab->select->quick))
3696
	  {					// Only read index tree
serg@serg.mylan's avatar
serg@serg.mylan committed
3697
	    tab->index=find_shortest_key(table, & table->used_keys);
3698
	    tab->table->file->index_init(tab->index);
3699
	    tab->read_first_record= join_read_first;
3700 3701
	    tab->type=JT_NEXT;		// Read with index_first / index_next
	  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3702 3703 3704 3705 3706 3707 3708 3709 3710 3711 3712 3713 3714 3715 3716 3717
	}
      }
      break;
    default:
      DBUG_PRINT("error",("Table type %d found",tab->type)); /* purecov: deadcode */
      break;					/* purecov: deadcode */
    case JT_UNKNOWN:
    case JT_MAYBE_REF:
      abort();					/* purecov: deadcode */
    }
  }
  join->join_tab[join->tables-1].next_select=0; /* Set by do_select */
  DBUG_VOID_RETURN;
}


3718 3719 3720 3721 3722 3723 3724 3725 3726 3727 3728 3729 3730 3731 3732 3733 3734 3735 3736 3737 3738 3739
/*
  Give error if we some tables are done with a full join

  SYNOPSIS
    error_if_full_join()
    join		Join condition

  USAGE
   This is used by multi_table_update and multi_table_delete when running
   in safe mode

 RETURN VALUES
   0	ok
   1	Error (full join used)
*/

bool error_if_full_join(JOIN *join)
{
  for (JOIN_TAB *tab=join->join_tab, *end=join->join_tab+join->tables;
       tab < end;
       tab++)
  {
3740
    if (tab->type == JT_ALL && (!tab->select || !tab->select->quick))
3741 3742 3743 3744 3745 3746 3747 3748 3749
    {
      my_error(ER_UPDATE_WITHOUT_KEY_IN_SAFE_MODE,MYF(0));
      return(1);
    }
  }
  return(0);
}


3750 3751 3752 3753 3754 3755 3756 3757 3758 3759 3760 3761 3762
/*
  Free resources of given join

  SYNOPSIS
    JOIN::join_free()
    fill - true if we should free all resources, call with full==1 should be
           last, before it this function can be called with full==0

  NOTE: with subquery this function definitely will be called several times,
    but even for simple query it can be called several times.
*/
void
JOIN::join_free(bool full)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3763 3764
{
  JOIN_TAB *tab,*end;
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
3765
  DBUG_ENTER("join_free");
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3766

3767
  if (table)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3768
  {
3769 3770 3771 3772
    /*
      Only a sorted table may be cached.  This sorted table is always the
      first non const table in join->table
    */
3773
    if (tables > const_tables) // Test for not-const tables
3774
    {
3775 3776
      free_io_cache(table[const_tables]);
      filesort_free_buffers(table[const_tables]);
3777
    }
3778
    if (!full && select_lex->uncacheable)
3779
    {
3780
      for (tab= join_tab, end= tab+tables; tab != end; tab++)
3781 3782 3783 3784 3785 3786 3787 3788 3789 3790 3791 3792 3793
      {
	if (tab->table)
	{
	  if (tab->table->key_read)
	  {
	    tab->table->key_read= 0;
	    tab->table->file->extra(HA_EXTRA_NO_KEYREAD);
	  }
	  /* Don't free index if we are using read_record */
	  if (!tab->read_record.table)
	    tab->table->file->index_end();
	}
      }
3794
    }
3795
    else
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3796
    {
3797
      for (tab= join_tab, end= tab+tables; tab != end; tab++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3798
      {
3799 3800 3801 3802
	delete tab->select;
	delete tab->quick;
	tab->select=0;
	tab->quick=0;
3803
	x_free(tab->cache.buff);
3804
	tab->cache.buff= 0;
3805
	if (tab->table)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3806
	{
3807 3808 3809 3810 3811 3812 3813 3814
	  if (tab->table->key_read)
	  {
	    tab->table->key_read= 0;
	    tab->table->file->extra(HA_EXTRA_NO_KEYREAD);
	  }
	  /* Don't free index if we are using read_record */
	  if (!tab->read_record.table)
	    tab->table->file->index_end();
3815 3816 3817 3818 3819
	  /*
	    We need to reset this for next select
	    (Tested in part_of_refkey)
	  */
	  tab->table->reginfo.join_tab= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3820
	}
3821
	end_read_record(&tab->read_record);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3822
      }
3823
      table= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3824 3825
    }
  }
3826 3827 3828 3829
  /*
    We are not using tables anymore
    Unlock all tables. We may be in an INSERT .... SELECT statement.
  */
3830 3831 3832
  if ((full || !select_lex->uncacheable) &&
      lock && thd->lock &&
      !(select_options & SELECT_NO_UNLOCK))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3833
  {
3834 3835
    mysql_unlock_read_tables(thd, lock);// Don't free join->lock
    lock=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3836
  }
3837 3838
  if (full)
  {
3839 3840 3841
    group_fields.delete_elements();
    tmp_table_param.copy_funcs.delete_elements();
    tmp_table_param.cleanup();
3842
  }
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
3843
  DBUG_VOID_RETURN;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3844 3845 3846 3847
}


/*****************************************************************************
3848 3849 3850 3851 3852 3853 3854 3855 3856 3857 3858 3859 3860
  Remove the following expressions from ORDER BY and GROUP BY:
  Constant expressions
  Expression that only uses tables that are of type EQ_REF and the reference
  is in the ORDER list or if all refereed tables are of the above type.

  In the following, the X field can be removed:
  SELECT * FROM t1,t2 WHERE t1.a=t2.a ORDER BY t1.a,t2.X
  SELECT * FROM t1,t2,t3 WHERE t1.a=t2.a AND t2.b=t3.b ORDER BY t1.a,t3.X

  These can't be optimized:
  SELECT * FROM t1,t2 WHERE t1.a=t2.a ORDER BY t2.X,t1.a
  SELECT * FROM t1,t2 WHERE t1.a=t2.a AND t1.b=t2.b ORDER BY t1.a,t2.c
  SELECT * FROM t1,t2 WHERE t1.a=t2.a ORDER BY t2.b,t1.a
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3861 3862 3863 3864 3865 3866 3867 3868 3869 3870 3871 3872 3873 3874 3875 3876 3877 3878 3879 3880 3881 3882 3883 3884
*****************************************************************************/

static bool
eq_ref_table(JOIN *join, ORDER *start_order, JOIN_TAB *tab)
{
  if (tab->cached_eq_ref_table)			// If cached
    return tab->eq_ref_table;
  tab->cached_eq_ref_table=1;
  if (tab->type == JT_CONST)			// We can skip const tables
    return (tab->eq_ref_table=1);		/* purecov: inspected */
  if (tab->type != JT_EQ_REF)
    return (tab->eq_ref_table=0);		// We must use this
  Item **ref_item=tab->ref.items;
  Item **end=ref_item+tab->ref.key_parts;
  uint found=0;
  table_map map=tab->table->map;

  for (; ref_item != end ; ref_item++)
  {
    if (! (*ref_item)->const_item())
    {						// Not a const ref
      ORDER *order;
      for (order=start_order ; order ; order=order->next)
      {
3885
	if ((*ref_item)->eq(order->item[0],0))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3886 3887 3888 3889 3890
	  break;
      }
      if (order)
      {
	found++;
monty@bitch.mysql.fi's avatar
monty@bitch.mysql.fi committed
3891
	DBUG_ASSERT(!(order->used & map));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3892 3893 3894 3895 3896 3897 3898 3899
	order->used|=map;
	continue;				// Used in ORDER BY
      }
      if (!only_eq_ref_tables(join,start_order, (*ref_item)->used_tables()))
	return (tab->eq_ref_table=0);
    }
  }
  /* Check that there was no reference to table before sort order */
3900
  for (; found && start_order ; start_order=start_order->next)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3901 3902 3903 3904 3905 3906 3907 3908 3909 3910 3911 3912 3913 3914 3915 3916 3917
  {
    if (start_order->used & map)
    {
      found--;
      continue;
    }
    if (start_order->depend_map & map)
      return (tab->eq_ref_table=0);
  }
  return tab->eq_ref_table=1;
}


static bool
only_eq_ref_tables(JOIN *join,ORDER *order,table_map tables)
{
  if (specialflag &  SPECIAL_SAFE_MODE)
3918
    return 0;			// skip this optimize /* purecov: inspected */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3919 3920 3921 3922 3923 3924 3925 3926 3927 3928 3929 3930 3931 3932 3933
  for (JOIN_TAB **tab=join->map2table ; tables ; tab++, tables>>=1)
  {
    if (tables & 1 && !eq_ref_table(join, order, *tab))
      return 0;
  }
  return 1;
}


/* Update the dependency map for the tables */

static void update_depend_map(JOIN *join)
{
  JOIN_TAB *join_tab=join->join_tab, *end=join_tab+join->tables;

3934
  for (; join_tab != end ; join_tab++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3935 3936 3937 3938 3939 3940 3941
  {
    TABLE_REF *ref= &join_tab->ref;
    table_map depend_map=0;
    Item **item=ref->items;
    uint i;
    for (i=0 ; i < ref->key_parts ; i++,item++)
      depend_map|=(*item)->used_tables();
3942
    ref->depend_map=depend_map & ~OUTER_REF_TABLE_BIT;
3943
    depend_map&= ~OUTER_REF_TABLE_BIT;
3944
    for (JOIN_TAB **tab=join->map2table;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3945
	 depend_map ;
3946
	 tab++,depend_map>>=1 )
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3947 3948
    {
      if (depend_map & 1)
3949
	ref->depend_map|=(*tab)->ref.depend_map;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3950 3951 3952 3953 3954 3955 3956 3957 3958
    }
  }
}


/* Update the dependency map for the sort order */

static void update_depend_map(JOIN *join, ORDER *order)
{
3959
  for (; order ; order=order->next)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3960 3961 3962 3963
  {
    table_map depend_map;
    order->item[0]->update_used_tables();
    order->depend_map=depend_map=order->item[0]->used_tables();
3964 3965
    // Not item_sum(), RAND() and no reference to table outside of sub select
    if (!(order->depend_map & (OUTER_REF_TABLE_BIT | RAND_TABLE_BIT)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3966
    {
3967
      for (JOIN_TAB **tab=join->map2table;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3968
	   depend_map ;
3969
	   tab++, depend_map>>=1)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3970 3971
      {
	if (depend_map & 1)
3972
	  order->depend_map|=(*tab)->ref.depend_map;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3973 3974 3975 3976 3977 3978 3979
      }
    }
  }
}


/*
3980 3981
  simple_order is set to 1 if sort_order only uses fields from head table
  and the head table is not a LEFT JOIN table
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3982 3983 3984 3985 3986 3987 3988 3989 3990 3991 3992 3993 3994 3995 3996 3997 3998 3999 4000 4001 4002 4003 4004 4005 4006 4007
*/

static ORDER *
remove_const(JOIN *join,ORDER *first_order, COND *cond, bool *simple_order)
{
  if (join->tables == join->const_tables)
    return 0;					// No need to sort
  DBUG_ENTER("remove_const");
  ORDER *order,**prev_ptr;
  table_map first_table= join->join_tab[join->const_tables].table->map;
  table_map not_const_tables= ~join->const_table_map;
  table_map ref;
  prev_ptr= &first_order;
  *simple_order= join->join_tab[join->const_tables].on_expr ? 0 : 1;

  /* NOTE: A variable of not_const_tables ^ first_table; breaks gcc 2.7 */

  update_depend_map(join, first_order);
  for (order=first_order; order ; order=order->next)
  {
    table_map order_tables=order->item[0]->used_tables();
    if (order->item[0]->with_sum_func)
      *simple_order=0;				// Must do a temp table to sort
    else if (!(order_tables & not_const_tables))
    {
      DBUG_PRINT("info",("removing: %s", order->item[0]->full_name()));
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
4008
      continue;					// skip const item
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4009 4010 4011
    }
    else
    {
4012
      if (order_tables & (RAND_TABLE_BIT | OUTER_REF_TABLE_BIT))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4013 4014 4015 4016 4017 4018 4019 4020 4021 4022 4023 4024 4025 4026 4027 4028 4029 4030 4031 4032 4033 4034 4035 4036 4037 4038 4039 4040 4041 4042
	*simple_order=0;
      else
      {
	Item *comp_item=0;
	if (cond && const_expression_in_where(cond,order->item[0], &comp_item))
	{
	  DBUG_PRINT("info",("removing: %s", order->item[0]->full_name()));
	  continue;
	}
	if ((ref=order_tables & (not_const_tables ^ first_table)))
	{
	  if (only_eq_ref_tables(join,first_order,ref))
	  {
	    DBUG_PRINT("info",("removing: %s", order->item[0]->full_name()));
	    continue;
	  }
	  *simple_order=0;			// Must do a temp table to sort
	}
      }
    }
    *prev_ptr= order;				// use this entry
    prev_ptr= &order->next;
  }
  *prev_ptr=0;
  if (!first_order)				// Nothing to sort/group
    *simple_order=1;
  DBUG_PRINT("exit",("simple_order: %d",(int) *simple_order));
  DBUG_RETURN(first_order);
}

4043

bk@work.mysql.com's avatar
bk@work.mysql.com committed
4044
static int
4045 4046
return_zero_rows(JOIN *join, select_result *result,TABLE_LIST *tables,
		 List<Item> &fields, bool send_row, uint select_options,
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
4047 4048
		 const char *info, Item *having, Procedure *procedure,
		 SELECT_LEX_UNIT *unit)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4049 4050 4051 4052
{
  DBUG_ENTER("return_zero_rows");

  if (select_options & SELECT_DESCRIBE)
4053
  {
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
4054
    select_describe(join, false, false, false, info);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4055 4056
    DBUG_RETURN(0);
  }
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
4057

bk@work.mysql.com's avatar
bk@work.mysql.com committed
4058 4059
  if (procedure)
  {
4060
    if (result->prepare(fields, unit))		// This hasn't been done yet
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4061 4062 4063 4064 4065 4066
      DBUG_RETURN(-1);
  }
  if (send_row)
  {
    for (TABLE_LIST *table=tables; table ; table=table->next)
      mark_as_null_row(table->table);		// All fields are NULL
4067
    if (having && having->val_int() == 0)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4068 4069
      send_row=0;
  }
4070
  if (!(result->send_fields(fields,1)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4071 4072
  {
    if (send_row)
4073 4074 4075 4076 4077
    {
      List_iterator_fast<Item> it(fields);
      Item *item;
      while ((item= it++))
	item->no_rows_in_result();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4078
      result->send_data(fields);
4079
    }
4080
    if (tables)				// Not from do_select()
4081 4082 4083 4084 4085
    {
      /* Close open cursors */
      for (TABLE_LIST *table=tables; table ; table=table->next)
	table->table->file->index_end();
    }
4086
    result->send_eof();				// Should be safe
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4087
  }
4088 4089
  /* Update results for FOUND_ROWS */
  join->thd->limit_found_rows= join->thd->examined_row_count= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4090 4091 4092 4093 4094 4095 4096 4097 4098 4099 4100
  DBUG_RETURN(0);
}


static void clear_tables(JOIN *join)
{
  for (uint i=0 ; i < join->tables ; i++)
    mark_as_null_row(join->table[i]);		// All fields are NULL
}

/*****************************************************************************
4101 4102 4103 4104 4105 4106
  Make som simple condition optimization:
  If there is a test 'field = const' change all refs to 'field' to 'const'
  Remove all dummy tests 'item = item', 'const op const'.
  Remove all 'item is NULL', when item can never be null!
  item->marker should be 0 for all items on entry
  Return in cond_value FALSE if condition is impossible (1 = 2)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4107 4108 4109 4110
*****************************************************************************/

class COND_CMP :public ilink {
public:
monty@donna.mysql.com's avatar
monty@donna.mysql.com committed
4111
  static void *operator new(size_t size) {return (void*) sql_alloc((uint) size); }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4112 4113 4114 4115 4116 4117 4118 4119 4120 4121 4122 4123 4124 4125 4126 4127
  static void operator delete(void *ptr __attribute__((unused)),
			      size_t size __attribute__((unused))) {} /*lint -e715 */

  Item *and_level;
  Item_func *cmp_func;
  COND_CMP(Item *a,Item_func *b) :and_level(a),cmp_func(b) {}
};

#ifdef __GNUC__
template class I_List<COND_CMP>;
template class I_List_iterator<COND_CMP>;
template class List<Item_func_match>;
template class List_iterator<Item_func_match>;
#endif

/*
4128 4129
  change field = field to field = const for each found field = const in the
  and_level
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4130 4131 4132 4133 4134 4135 4136 4137 4138 4139 4140 4141 4142 4143 4144 4145 4146 4147 4148 4149 4150 4151 4152 4153 4154
*/

static void
change_cond_ref_to_const(I_List<COND_CMP> *save_list,Item *and_father,
			 Item *cond, Item *field, Item *value)
{
  if (cond->type() == Item::COND_ITEM)
  {
    bool and_level= ((Item_cond*) cond)->functype() ==
      Item_func::COND_AND_FUNC;
    List_iterator<Item> li(*((Item_cond*) cond)->argument_list());
    Item *item;
    while ((item=li++))
      change_cond_ref_to_const(save_list,and_level ? cond : item, item,
			       field, value);
    return;
  }
  if (cond->eq_cmp_result() == Item::COND_OK)
    return;					// Not a boolean function

  Item_bool_func2 *func=  (Item_bool_func2*) cond;
  Item *left_item=  func->arguments()[0];
  Item *right_item= func->arguments()[1];
  Item_func::Functype functype=  func->functype();

4155
  if (right_item->eq(field,0) && left_item != value)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4156 4157 4158 4159 4160 4161 4162 4163 4164 4165 4166 4167 4168 4169
  {
    Item *tmp=value->new_item();
    if (tmp)
    {
      func->arguments()[1] = tmp;
      func->update_used_tables();
      if ((functype == Item_func::EQ_FUNC || functype == Item_func::EQUAL_FUNC)
	  && and_father != cond && !left_item->const_item())
      {
	cond->marker=1;
	COND_CMP *tmp2;
	if ((tmp2=new COND_CMP(and_father,func)))
	  save_list->push_back(tmp2);
      }
4170
      func->set_cmp_func();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4171 4172
    }
  }
4173
  else if (left_item->eq(field,0) && right_item != value)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4174 4175 4176 4177 4178 4179 4180 4181 4182 4183 4184 4185 4186 4187 4188 4189
  {
    Item *tmp=value->new_item();
    if (tmp)
    {
      func->arguments()[0] = value = tmp;
      func->update_used_tables();
      if ((functype == Item_func::EQ_FUNC || functype == Item_func::EQUAL_FUNC)
	  && and_father != cond && !right_item->const_item())
      {
	func->arguments()[0] = func->arguments()[1]; // For easy check
	func->arguments()[1] = value;
	cond->marker=1;
	COND_CMP *tmp2;
	if ((tmp2=new COND_CMP(and_father,func)))
	  save_list->push_back(tmp2);
      }
4190
      func->set_cmp_func();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4191 4192 4193 4194
    }
  }
}

4195 4196 4197 4198 4199 4200 4201 4202 4203 4204 4205 4206 4207 4208 4209 4210 4211 4212 4213 4214 4215 4216 4217 4218 4219 4220 4221 4222 4223 4224 4225 4226 4227
/*
  Remove additional condition inserted by IN/ALL/ANY transformation

  SYNOPSIS
    remove_additional_cond()
    conds - condition for processing

  RETURN VALUES
    new conditions
*/

static Item *remove_additional_cond(Item* conds)
{
  if (conds->name == in_additional_cond)
    return 0;
  if (conds->type() == Item::COND_ITEM)
  {
    Item_cond *cnd= (Item_cond*) conds;
    List_iterator<Item> li(*(cnd->argument_list()));
    Item *item;
    while ((item= li++))
    {
      if (item->name == in_additional_cond)
      {
	li.remove();
	if (cnd->argument_list()->elements == 1)
	  return cnd->argument_list()->head();
	return conds;
      }
    }
  }
  return conds;
}
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4228 4229

static void
4230
propagate_cond_constants(I_List<COND_CMP> *save_list,COND *and_father,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4231 4232 4233 4234 4235 4236
			 COND *cond)
{
  if (cond->type() == Item::COND_ITEM)
  {
    bool and_level= ((Item_cond*) cond)->functype() ==
      Item_func::COND_AND_FUNC;
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
4237
    List_iterator_fast<Item> li(*((Item_cond*) cond)->argument_list());
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4238 4239 4240 4241 4242 4243 4244 4245 4246 4247 4248 4249 4250 4251 4252 4253 4254 4255
    Item *item;
    I_List<COND_CMP> save;
    while ((item=li++))
    {
      propagate_cond_constants(&save,and_level ? cond : item, item);
    }
    if (and_level)
    {						// Handle other found items
      I_List_iterator<COND_CMP> cond_itr(save);
      COND_CMP *cond_cmp;
      while ((cond_cmp=cond_itr++))
	if (!cond_cmp->cmp_func->arguments()[0]->const_item())
	  change_cond_ref_to_const(&save,cond_cmp->and_level,
				   cond_cmp->and_level,
				   cond_cmp->cmp_func->arguments()[0],
				   cond_cmp->cmp_func->arguments()[1]);
    }
  }
4256
  else if (and_father != cond && !cond->marker)		// In a AND group
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4257 4258 4259 4260 4261 4262 4263 4264
  {
    if (cond->type() == Item::FUNC_ITEM &&
	(((Item_func*) cond)->functype() == Item_func::EQ_FUNC ||
	 ((Item_func*) cond)->functype() == Item_func::EQUAL_FUNC))
    {
      Item_func_eq *func=(Item_func_eq*) cond;
      bool left_const= func->arguments()[0]->const_item();
      bool right_const=func->arguments()[1]->const_item();
4265 4266 4267
      if (!(left_const && right_const) &&
	  (func->arguments()[0]->result_type() ==
	   (func->arguments()[1]->result_type())))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4268 4269 4270 4271 4272 4273
      {
	if (right_const)
	{
	  func->arguments()[1]=resolve_const_item(func->arguments()[1],
						  func->arguments()[0]);
	  func->update_used_tables();
4274
	  change_cond_ref_to_const(save_list,and_father,and_father,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4275 4276 4277 4278 4279 4280 4281 4282
				   func->arguments()[0],
				   func->arguments()[1]);
	}
	else if (left_const)
	{
	  func->arguments()[0]=resolve_const_item(func->arguments()[0],
						  func->arguments()[1]);
	  func->update_used_tables();
4283
	  change_cond_ref_to_const(save_list,and_father,and_father,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4284 4285 4286 4287 4288 4289 4290 4291 4292
				   func->arguments()[1],
				   func->arguments()[0]);
	}
      }
    }
  }
}


4293 4294 4295 4296 4297 4298 4299 4300 4301 4302 4303 4304 4305 4306 4307 4308 4309 4310 4311 4312 4313 4314 4315 4316 4317 4318 4319 4320 4321 4322 4323 4324 4325 4326 4327 4328 4329 4330 4331 4332 4333 4334 4335 4336 4337 4338 4339 4340 4341 4342 4343 4344 4345 4346
/*
  Eliminate NOT functions from the condition tree.

  SYNPOSIS
    eliminate_not_funcs()
    cond	condition tree

  DESCRIPTION
    Eliminate NOT functions from the condition tree where it's possible.
    Recursively traverse condition tree to find all NOT functions.
    Call neg_transformer() method for negated arguments.

  NOTE
    If neg_transformer() returned a new condition we call fix_fields().
    We don't delete any items as it's not needed. They will be deleted 
    later at once.

  RETURN
    New condition tree
*/

COND *eliminate_not_funcs(COND *cond)
{
  if (!cond)
    return cond;
  if (cond->type() == Item::COND_ITEM)		/* OR or AND */
  {
    List_iterator<Item> li(*((Item_cond*) cond)->argument_list());
    Item *item;
    while ((item= li++))
    {
      Item *new_item= eliminate_not_funcs(item);
      if (item != new_item)
	VOID(li.replace(new_item));	/* replace item with a new condition */
    }
  }
  else if (cond->type() == Item::FUNC_ITEM &&	/* 'NOT' operation? */
	   ((Item_func*) cond)->functype() == Item_func::NOT_FUNC)
  {
    COND *new_cond= ((Item_func*) cond)->arguments()[0]->neg_transformer();
    if (new_cond)
    {
      /*
        Here we can delete the NOT function. Something like: delete cond;
        But we don't need to do it. All items will be deleted later at once.
      */
      new_cond->fix_fields(current_thd, 0, &new_cond);
      cond= new_cond;
    }
  }
  return cond;
}


bk@work.mysql.com's avatar
bk@work.mysql.com committed
4347 4348 4349
static COND *
optimize_cond(COND *conds,Item::cond_result *cond_value)
{
4350
  DBUG_ENTER("optimize_cond");
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4351 4352 4353
  if (!conds)
  {
    *cond_value= Item::COND_TRUE;
4354
    DBUG_RETURN(conds);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4355 4356
  }
  DBUG_EXECUTE("where",print_where(conds,"original"););
4357 4358 4359 4360
  /* eliminate NOT operators */
  conds= eliminate_not_funcs(conds);
  DBUG_EXECUTE("where", print_where(conds, "after negation elimination"););
  /* change field = field to field = const for each found field = const */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4361 4362
  propagate_cond_constants((I_List<COND_CMP> *) 0,conds,conds);
  /*
4363 4364
    Remove all instances of item == item
    Remove all and-levels where CONST item != CONST item
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4365 4366 4367 4368
  */
  DBUG_EXECUTE("where",print_where(conds,"after const change"););
  conds=remove_eq_conds(conds,cond_value) ;
  DBUG_EXECUTE("info",print_where(conds,"after remove"););
4369
  DBUG_RETURN(conds);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4370 4371 4372 4373
}


/*
4374 4375 4376 4377 4378
  Remove const and eq items. Return new item, or NULL if no condition
  cond_value is set to according:
  COND_OK    query is possible (field = constant)
  COND_TRUE  always true	( 1 = 1 )
  COND_FALSE always false	( 1 = 2 )
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4379 4380 4381 4382 4383 4384 4385 4386 4387 4388 4389
*/

static COND *
remove_eq_conds(COND *cond,Item::cond_result *cond_value)
{
  if (cond->type() == Item::COND_ITEM)
  {
    bool and_level= ((Item_cond*) cond)->functype()
      == Item_func::COND_AND_FUNC;
    List_iterator<Item> li(*((Item_cond*) cond)->argument_list());
    Item::cond_result tmp_cond_value;
4390
    bool should_fix_fields=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4391 4392 4393 4394 4395 4396 4397 4398 4399 4400 4401 4402 4403 4404 4405 4406 4407 4408 4409

    *cond_value=Item::COND_UNDEF;
    Item *item;
    while ((item=li++))
    {
      Item *new_item=remove_eq_conds(item,&tmp_cond_value);
      if (!new_item)
      {
#ifdef DELETE_ITEMS
	delete item;				// This may be shared
#endif
	li.remove();
      }
      else if (item != new_item)
      {
#ifdef DELETE_ITEMS
	delete item;				// This may be shared
#endif
	VOID(li.replace(new_item));
4410
	should_fix_fields=1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4411 4412 4413 4414 4415 4416 4417 4418 4419 4420 4421 4422 4423 4424 4425 4426 4427 4428 4429 4430 4431 4432 4433 4434 4435 4436
      }
      if (*cond_value == Item::COND_UNDEF)
	*cond_value=tmp_cond_value;
      switch (tmp_cond_value) {
      case Item::COND_OK:			// Not TRUE or FALSE
	if (and_level || *cond_value == Item::COND_FALSE)
	  *cond_value=tmp_cond_value;
	break;
      case Item::COND_FALSE:
	if (and_level)
	{
	  *cond_value=tmp_cond_value;
	  return (COND*) 0;			// Always false
	}
	break;
      case Item::COND_TRUE:
	if (!and_level)
	{
	  *cond_value= tmp_cond_value;
	  return (COND*) 0;			// Always true
	}
	break;
      case Item::COND_UNDEF:			// Impossible
	break; /* purecov: deadcode */
      }
    }
4437
    if (should_fix_fields)
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
4438
      cond->fix_fields(current_thd,0, &cond);
4439

bk@work.mysql.com's avatar
bk@work.mysql.com committed
4440 4441 4442 4443 4444 4445 4446 4447 4448 4449 4450 4451 4452 4453
    if (!((Item_cond*) cond)->argument_list()->elements ||
	*cond_value != Item::COND_OK)
      return (COND*) 0;
    if (((Item_cond*) cond)->argument_list()->elements == 1)
    {						// Remove list
      item= ((Item_cond*) cond)->argument_list()->head();
      ((Item_cond*) cond)->argument_list()->empty();
      return item;
    }
  }
  else if (cond->type() == Item::FUNC_ITEM &&
	   ((Item_func*) cond)->functype() == Item_func::ISNULL_FUNC)
  {
    /*
4454 4455 4456 4457 4458 4459 4460
      Handles this special case for some ODBC applications:
      The are requesting the row that was just updated with a auto_increment
      value with this construct:

      SELECT * from table_name where auto_increment_column IS NULL
      This will be changed to:
      SELECT * from table_name where auto_increment_column = LAST_INSERT_ID
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4461 4462 4463 4464
    */

    Item_func_isnull *func=(Item_func_isnull*) cond;
    Item **args= func->arguments();
4465
    THD *thd=current_thd;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4466 4467 4468 4469
    if (args[0]->type() == Item::FIELD_ITEM)
    {
      Field *field=((Item_field*) args[0])->field;
      if (field->flags & AUTO_INCREMENT_FLAG && !field->table->maybe_null &&
4470 4471
	  (thd->options & OPTION_AUTO_IS_NULL) &&
	  thd->insert_id())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4472
      {
4473
#ifndef EMBEDDED_LIBRARY
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
4474
	query_cache_abort(&thd->net);
4475
#endif
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4476 4477 4478
	COND *new_cond;
	if ((new_cond= new Item_func_eq(args[0],
					new Item_int("last_insert_id()",
4479
						     thd->insert_id(),
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4480 4481 4482
						     21))))
	{
	  cond=new_cond;
4483
	  cond->fix_fields(thd, 0, &cond);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4484
	}
4485
	thd->insert_id(0);		// Clear for next request
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4486 4487 4488 4489
      }
      /* fix to replace 'NULL' dates with '0' (shreeve@uci.edu) */
      else if (((field->type() == FIELD_TYPE_DATE) ||
		(field->type() == FIELD_TYPE_DATETIME)) &&
4490 4491
		(field->flags & NOT_NULL_FLAG) &&
	       !field->table->maybe_null)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4492 4493 4494 4495 4496
      {
	COND *new_cond;
	if ((new_cond= new Item_func_eq(args[0],new Item_int("0", 0, 2))))
	{
	  cond=new_cond;
4497
	  cond->fix_fields(thd, 0, &cond);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4498 4499 4500 4501 4502 4503 4504 4505 4506 4507 4508 4509 4510
	}
      }
    }
  }
  else if (cond->const_item())
  {
    *cond_value= eval_const_cond(cond) ? Item::COND_TRUE : Item::COND_FALSE;
    return (COND*) 0;
  }
  else if ((*cond_value= cond->eq_cmp_result()) != Item::COND_OK)
  {						// boolan compare function
    Item *left_item=	((Item_func*) cond)->arguments()[0];
    Item *right_item= ((Item_func*) cond)->arguments()[1];
4511
    if (left_item->eq(right_item,1))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4512 4513 4514 4515 4516 4517 4518
    {
      if (!left_item->maybe_null ||
	  ((Item_func*) cond)->functype() == Item_func::EQUAL_FUNC)
	return (COND*) 0;			// Compare of identical items
    }
  }
  *cond_value=Item::COND_OK;
4519
  return cond;					// Point at next and level
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4520 4521 4522
}

/*
4523
  Return 1 if the item is a const value in all the WHERE clause
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4524 4525 4526 4527 4528 4529 4530 4531 4532
*/

static bool
const_expression_in_where(COND *cond, Item *comp_item, Item **const_item)
{
  if (cond->type() == Item::COND_ITEM)
  {
    bool and_level= (((Item_cond*) cond)->functype()
		     == Item_func::COND_AND_FUNC);
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
4533
    List_iterator_fast<Item> li(*((Item_cond*) cond)->argument_list());
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4534 4535 4536 4537 4538 4539 4540 4541 4542 4543 4544 4545 4546 4547 4548 4549 4550 4551 4552 4553 4554 4555
    Item *item;
    while ((item=li++))
    {
      bool res=const_expression_in_where(item, comp_item, const_item);
      if (res)					// Is a const value
      {
	if (and_level)
	  return 1;
      }
      else if (!and_level)
	return 0;
    }
    return and_level ? 0 : 1;
  }
  else if (cond->eq_cmp_result() != Item::COND_OK)
  {						// boolan compare function
    Item_func* func= (Item_func*) cond;
    if (func->functype() != Item_func::EQUAL_FUNC &&
	func->functype() != Item_func::EQ_FUNC)
      return 0;
    Item *left_item=	((Item_func*) cond)->arguments()[0];
    Item *right_item= ((Item_func*) cond)->arguments()[1];
4556
    if (left_item->eq(comp_item,1))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4557 4558 4559 4560
    {
      if (right_item->const_item())
      {
	if (*const_item)
4561
	  return right_item->eq(*const_item, 1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4562 4563 4564 4565
	*const_item=right_item;
	return 1;
      }
    }
4566
    else if (right_item->eq(comp_item,1))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4567 4568 4569 4570
    {
      if (left_item->const_item())
      {
	if (*const_item)
4571
	  return left_item->eq(*const_item, 1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4572 4573 4574 4575 4576 4577 4578 4579 4580 4581
	*const_item=left_item;
	return 1;
      }
    }
  }
  return 0;
}


/****************************************************************************
4582
  Create internal temporary table
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4583 4584
****************************************************************************/

4585 4586 4587 4588 4589 4590 4591 4592 4593 4594 4595 4596 4597 4598 4599 4600 4601 4602 4603 4604 4605 4606 4607 4608 4609 4610 4611 4612 4613 4614 4615 4616 4617 4618 4619 4620 4621 4622 4623 4624 4625 4626 4627 4628 4629 4630 4631 4632 4633 4634 4635 4636 4637 4638 4639 4640 4641 4642 4643 4644 4645 4646 4647 4648 4649 4650 4651 4652 4653 4654 4655 4656 4657 4658 4659 4660 4661 4662 4663 4664 4665 4666 4667 4668 4669 4670 4671 4672 4673 4674 4675 4676 4677 4678 4679 4680 4681 4682 4683 4684 4685 4686 4687 4688 4689 4690 4691 4692 4693
/*
  Create field for temporary table from given field
  
  SYNOPSIS
    create_tmp_field_from_field()
    thd			Thread handler
    org_field           field from which new field will be created
    item		Item to create a field for
    table		Temporary table
    modify_item	        1 if item->result_field should point to new item.
			This is relevent for how fill_record() is going to
			work:
			If modify_item is 1 then fill_record() will update
			the record in the original table.
			If modify_item is 0 then fill_record() will update
			the temporary table

  RETURN
    0			on error
    new_created field
*/
static Field* create_tmp_field_from_field(THD *thd,
					  Field* org_field,
					  Item *item,
					  TABLE *table,
					  bool modify_item)
{
  Field *new_field;

  // The following should always be true
  if ((new_field= org_field->new_field(&thd->mem_root,table)))
  {
    if (modify_item)
      ((Item_field *)item)->result_field= new_field;
    else
      new_field->field_name= item->name;
    if (org_field->maybe_null())
      new_field->flags&= ~NOT_NULL_FLAG;	// Because of outer join
    if (org_field->type() == FIELD_TYPE_VAR_STRING)
      table->db_create_options|= HA_OPTION_PACK_RECORD;
  }
  return new_field;
}

/*
  Create field for temporary table using type of given item
  
  SYNOPSIS
    create_tmp_field_from_item()
    thd			Thread handler
    item		Item to create a field for
    table		Temporary table
    copy_func		If set and item is a function, store copy of item
			in this array
    modify_item		1 if item->result_field should point to new item.
			This is relevent for how fill_record() is going to
			work:
			If modify_item is 1 then fill_record() will update
			the record in the original table.
			If modify_item is 0 then fill_record() will update
			the temporary table

  RETURN
    0			on error
    new_created field
*/
static Field* create_tmp_field_from_item(THD *thd,
					 Item *item,
					 TABLE *table,
					 Item ***copy_func,
					 bool modify_item)
{
  bool maybe_null=item->maybe_null;
  Field *new_field;
  LINT_INIT(new_field);

  switch (item->result_type()) {
  case REAL_RESULT:
    new_field=new Field_double(item->max_length, maybe_null,
			       item->name, table, item->decimals);
    break;
  case INT_RESULT:
    new_field=new Field_longlong(item->max_length, maybe_null,
				   item->name, table, item->unsigned_flag);
    break;
  case STRING_RESULT:
    if (item->max_length > 255)
      new_field=  new Field_blob(item->max_length, maybe_null,
				 item->name, table,
				 item->collation.collation);
    else
      new_field= new Field_string(item->max_length, maybe_null,
				  item->name, table,
				  item->collation.collation);
    break;
  case ROW_RESULT: 
  default: 
    // This case should never be choosen
    DBUG_ASSERT(0);
    new_field= 0; // to satisfy compiler (uninitialized variable)
    break;
  }
  if (copy_func && item->is_result_field())
    *((*copy_func)++) = item;			// Save for copy_funcs
  if (modify_item)
    item->set_result_field(new_field);
  return new_field;
}

4694 4695 4696 4697 4698 4699 4700 4701 4702 4703 4704
/*
  Create field for temporary table

  SYNOPSIS
    create_tmp_field()
    thd			Thread handler
    table		Temporary table
    item		Item to create a field for
    type		Type of item (normally item->type)
    copy_func		If set and item is a function, store copy of item
			in this array
4705 4706
    from_field          if field will be created using other field as example,
                        pointer example field will be written here 
4707 4708 4709 4710 4711 4712 4713 4714 4715 4716 4717 4718 4719 4720
    group		1 if we are going to do a relative group by on result
    modify_item		1 if item->result_field should point to new item.
			This is relevent for how fill_record() is going to
			work:
			If modify_item is 1 then fill_record() will update
			the record in the original table.
			If modify_item is 0 then fill_record() will update
			the temporary table
		       
  RETURN
    0			on error
    new_created field
*/

4721
Field *create_tmp_field(THD *thd, TABLE *table,Item *item, Item::Type type,
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
4722
			Item ***copy_func, Field **from_field,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4723 4724 4725 4726 4727 4728 4729 4730 4731 4732 4733
			bool group, bool modify_item)
{
  switch (type) {
  case Item::SUM_FUNC_ITEM:
  {
    Item_sum *item_sum=(Item_sum*) item;
    bool maybe_null=item_sum->maybe_null;
    switch (item_sum->sum_func()) {
    case Item_sum::AVG_FUNC:			/* Place for sum & count */
      if (group)
	return new Field_string(sizeof(double)+sizeof(longlong),
igor@hundin.mysql.fi's avatar
igor@hundin.mysql.fi committed
4734
				0, item->name,table,&my_charset_bin);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4735 4736 4737
      else
	return new Field_double(item_sum->max_length,maybe_null,
				item->name, table, item_sum->decimals);
4738 4739
    case Item_sum::VARIANCE_FUNC:			/* Place for sum & count */
    case Item_sum::STD_FUNC:	
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4740 4741
      if (group)
	return	new Field_string(sizeof(double)*2+sizeof(longlong),
igor@hundin.mysql.fi's avatar
igor@hundin.mysql.fi committed
4742
				 0, item->name,table,&my_charset_bin);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4743 4744
      else
	return new Field_double(item_sum->max_length, maybe_null,
4745
				item->name,table,item_sum->decimals);				
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4746 4747 4748 4749 4750 4751 4752 4753 4754
    case Item_sum::UNIQUE_USERS_FUNC:
      return new Field_long(9,maybe_null,item->name,table,1);
    default:
      switch (item_sum->result_type()) {
      case REAL_RESULT:
	return new Field_double(item_sum->max_length,maybe_null,
				item->name,table,item_sum->decimals);
      case INT_RESULT:
	return new Field_longlong(item_sum->max_length,maybe_null,
4755
				  item->name,table,item->unsigned_flag);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4756 4757 4758
      case STRING_RESULT:
	if (item_sum->max_length > 255)
	  return  new Field_blob(item_sum->max_length,maybe_null,
4759
				 item->name,table,item->collation.collation);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4760
	return	new Field_string(item_sum->max_length,maybe_null,
4761
				 item->name,table,item->collation.collation);
4762
      case ROW_RESULT:
4763
      default:
4764 4765 4766
	// This case should never be choosen
	DBUG_ASSERT(0);
	return 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4767 4768
      }
    }
4769
    thd->fatal_error();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4770 4771 4772
    return 0;					// Error
  }
  case Item::FIELD_ITEM:
4773
  case Item::DEFAULT_VALUE_ITEM:
4774 4775 4776
    return create_tmp_field_from_field(thd, (*from_field=
					     ((Item_field*) item)->field),
				       item, table, modify_item);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4777 4778 4779 4780
  case Item::FUNC_ITEM:
  case Item::COND_ITEM:
  case Item::FIELD_AVG_ITEM:
  case Item::FIELD_STD_ITEM:
4781
  case Item::SUBSELECT_ITEM:
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4782
    /* The following can only happen with 'CREATE TABLE ... SELECT' */
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
4783
  case Item::PROC_ITEM:
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4784 4785 4786 4787
  case Item::INT_ITEM:
  case Item::REAL_ITEM:
  case Item::STRING_ITEM:
  case Item::REF_ITEM:
4788
  case Item::NULL_ITEM:
4789
  case Item::VARBIN_ITEM:
4790 4791 4792
    return create_tmp_field_from_item(thd, item, table,
				      copy_func, modify_item);
  case Item::TYPE_HOLDER:
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4793
  {
4794 4795 4796 4797
    Field *example= ((Item_type_holder *)item)->example();
    if (example)
      return create_tmp_field_from_field(thd, example, item, table, 0);
    return create_tmp_field_from_item(thd, item, table, copy_func, 0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4798 4799 4800 4801 4802 4803 4804
  }
  default:					// Dosen't have to be stored
    return 0;
  }
}


4805 4806 4807 4808 4809 4810 4811
/*
  Create a temp table according to a field list.
  Set distinct if duplicates could be removed
  Given fields field pointers are changed to point at tmp_table
  for send_fields
*/

bk@work.mysql.com's avatar
bk@work.mysql.com committed
4812 4813 4814
TABLE *
create_tmp_table(THD *thd,TMP_TABLE_PARAM *param,List<Item> &fields,
		 ORDER *group, bool distinct, bool save_sum_fields,
4815 4816
		 ulong select_options, ha_rows rows_limit,
		 char *table_alias)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4817 4818 4819
{
  TABLE *table;
  uint	i,field_count,reclength,null_count,null_pack_length,
4820
        hidden_null_count, hidden_null_pack_length, hidden_field_count,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4821 4822
	blob_count,group_null_items;
  bool	using_unique_constraint=0;
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
4823
  bool  not_all_columns= !(select_options & TMP_TABLE_ALL_COLUMNS);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4824 4825 4826
  char	*tmpname,path[FN_REFLEN];
  byte	*pos,*group_buff;
  uchar *null_flags;
4827
  Field **reg_field, **from_field, **blob_field;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4828 4829 4830
  Copy_field *copy=0;
  KEY *keyinfo;
  KEY_PART_INFO *key_part_info;
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
4831
  Item **copy_func;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4832
  MI_COLUMNDEF *recinfo;
4833
  uint temp_pool_slot=MY_BIT_NONE;
4834

bk@work.mysql.com's avatar
bk@work.mysql.com committed
4835
  DBUG_ENTER("create_tmp_table");
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
4836
  DBUG_PRINT("enter",("distinct: %d  save_sum_fields: %d  rows_limit: %lu  group: %d",
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4837
		      (int) distinct, (int) save_sum_fields,
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
4838
		      (ulong) rows_limit,test(group)));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4839

4840
  statistic_increment(created_tmp_tables, &LOCK_status);
4841

4842
  if (use_temp_pool)
4843
    temp_pool_slot = bitmap_set_next(&temp_pool);
4844 4845

  if (temp_pool_slot != MY_BIT_NONE) // we got a slot
4846
    sprintf(path, "%s%s_%lx_%i", mysql_tmpdir, tmp_file_prefix,
4847 4848
	    current_pid, temp_pool_slot);
  else // if we run out of slots or we are not using tempool
4849 4850 4851
    sprintf(path,"%s%s%lx_%lx_%x",mysql_tmpdir,tmp_file_prefix,current_pid,
            thd->thread_id, thd->tmp_table++);

bk@work.mysql.com's avatar
bk@work.mysql.com committed
4852 4853 4854 4855 4856
  if (group)
  {
    if (!param->quick_group)
      group=0;					// Can't use group key
    else for (ORDER *tmp=group ; tmp ; tmp=tmp->next)
4857
    {
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4858
      (*tmp->item)->marker=4;			// Store null in key
4859 4860 4861
      if ((*tmp->item)->max_length >= MAX_CHAR_WIDTH)
	using_unique_constraint=1;
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4862 4863
    if (param->group_length >= MAX_BLOB_WIDTH)
      using_unique_constraint=1;
4864 4865
    if (group)
      distinct=0;				// Can't use distinct
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4866 4867 4868
  }

  field_count=param->field_count+param->func_count+param->sum_func_count;
4869
  hidden_field_count=param->hidden_field_count;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4870 4871
  if (!my_multi_malloc(MYF(MY_WME),
		       &table,sizeof(*table),
4872 4873 4874
		       &reg_field,  sizeof(Field*)*(field_count+1),
		       &blob_field, sizeof(Field*)*(field_count+1),
		       &from_field, sizeof(Field*)*field_count,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4875 4876 4877 4878 4879 4880 4881 4882 4883 4884 4885
		       &copy_func,sizeof(*copy_func)*(param->func_count+1),
		       &param->keyinfo,sizeof(*param->keyinfo),
		       &key_part_info,
		       sizeof(*key_part_info)*(param->group_parts+1),
		       &param->start_recinfo,
		       sizeof(*param->recinfo)*(field_count*2+4),
		       &tmpname,(uint) strlen(path)+1,
		       &group_buff,group && ! using_unique_constraint ?
		       param->group_length : 0,
		       NullS))
  {
4886
    bitmap_clear_bit(&temp_pool, temp_pool_slot);
4887
    DBUG_RETURN(NULL);				/* purecov: inspected */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4888 4889 4890
  }
  if (!(param->copy_field=copy=new Copy_field[field_count]))
  {
4891
    bitmap_clear_bit(&temp_pool, temp_pool_slot);
4892 4893
    my_free((gptr) table,MYF(0));		/* purecov: inspected */
    DBUG_RETURN(NULL);				/* purecov: inspected */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4894
  }
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
4895
  param->items_to_copy= copy_func;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4896 4897 4898 4899 4900 4901 4902
  strmov(tmpname,path);
  /* make table according to fields */

  bzero((char*) table,sizeof(*table));
  bzero((char*) reg_field,sizeof(Field*)*(field_count+1));
  bzero((char*) from_field,sizeof(Field*)*field_count);
  table->field=reg_field;
4903
  table->blob_field= (Field_blob**) blob_field;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4904
  table->real_name=table->path=tmpname;
4905
  table->table_name= table_alias;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4906 4907 4908 4909
  table->reginfo.lock_type=TL_WRITE;	/* Will be updated */
  table->db_stat=HA_OPEN_KEYFILE+HA_OPEN_RNDFILE;
  table->blob_ptr_size=mi_portable_sizeof_char_ptr;
  table->map=1;
4910
  table->tmp_table= TMP_TABLE;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4911
  table->db_low_byte_first=1;			// True for HEAP and MyISAM
4912
  table->temp_pool_slot = temp_pool_slot;
4913
  table->copy_blobs= 1;
4914 4915 4916 4917 4918 4919
  table->keys_for_keyread.init();
  table->keys_in_use.init();
  table->read_only_keys.init();
  table->quick_keys.init();
  table->used_keys.init();
  table->keys_in_use_for_query.init();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4920

4921
  /* Calculate which type of fields we will store in the temporary table */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4922

4923 4924
  reclength=blob_count=null_count=hidden_null_count=group_null_items=0;
  param->using_indirect_summary_function=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4925

monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
4926
  List_iterator_fast<Item> li(fields);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4927 4928
  Item *item;
  Field **tmp_from_field=from_field;
4929
  while ((item=li++))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4930 4931
  {
    Item::Type type=item->type();
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
4932
    if (not_all_columns)
4933
    {
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
4934 4935 4936 4937 4938 4939 4940 4941 4942 4943
      if (item->with_sum_func && type != Item::SUM_FUNC_ITEM)
      {
	/*
	  Mark that the we have ignored an item that refers to a summary
	  function. We need to know this if someone is going to use
	  DISTINCT on the result.
	*/
	param->using_indirect_summary_function=1;
	continue;
      }
4944
      if (item->const_item() && (int) hidden_field_count <= 0)
4945
        continue; // We don't have to store this
4946
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4947 4948 4949 4950 4951 4952 4953 4954 4955
    if (type == Item::SUM_FUNC_ITEM && !group && !save_sum_fields)
    {						/* Can't calc group yet */
      ((Item_sum*) item)->result_field=0;
      for (i=0 ; i < ((Item_sum*) item)->arg_count ; i++)
      {
	Item *arg= ((Item_sum*) item)->args[i];
	if (!arg->const_item())
	{
	  Field *new_field=
4956 4957
	    create_tmp_field(thd, table,arg,arg->type(),&copy_func,
			     tmp_from_field, group != 0,not_all_columns);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4958 4959 4960 4961 4962 4963 4964 4965
	  if (!new_field)
	    goto err;					// Should be OOM
	  tmp_from_field++;
	  *(reg_field++)= new_field;
	  reclength+=new_field->pack_length();
	  if (!(new_field->flags & NOT_NULL_FLAG))
	    null_count++;
	  if (new_field->flags & BLOB_FLAG)
4966 4967
	  {
	    *blob_field++= new_field;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4968
	    blob_count++;
4969
	  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4970 4971 4972 4973 4974 4975
	  ((Item_sum*) item)->args[i]= new Item_field(new_field);
	}
      }
    }
    else
    {
4976 4977 4978 4979 4980 4981 4982 4983 4984 4985
      /*
	The last parameter to create_tmp_field() is a bit tricky:

	We need to set it to 0 in union, to get fill_record() to modify the
	temporary table.
	We need to set it to 1 on multi-table-update and in select to
	write rows to the temporary table.
	We here distinguish between UNION and multi-table-updates by the fact
	that in the later case group is set to the row pointer.
      */
4986
      Field *new_field=create_tmp_field(thd, table, item,type, &copy_func,
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
4987
					tmp_from_field, group != 0,
4988
					not_all_columns || group !=0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4989 4990
      if (!new_field)
      {
4991
	if (thd->is_fatal_error)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4992 4993 4994 4995 4996 4997 4998 4999 5000 5001
	  goto err;				// Got OOM
	continue;				// Some kindf of const item
      }
      if (type == Item::SUM_FUNC_ITEM)
	((Item_sum *) item)->result_field= new_field;
      tmp_from_field++;
      reclength+=new_field->pack_length();
      if (!(new_field->flags & NOT_NULL_FLAG))
	null_count++;
      if (new_field->flags & BLOB_FLAG)
5002 5003
      {
	*blob_field++= new_field;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5004
	blob_count++;
5005
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5006 5007 5008 5009 5010 5011 5012
      if (item->marker == 4 && item->maybe_null)
      {
	group_null_items++;
	new_field->flags|= GROUP_FLAG;
      }
      *(reg_field++) =new_field;
    }
5013 5014
    if (!--hidden_field_count)
      hidden_null_count=null_count;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5015
  }
5016
  DBUG_ASSERT(field_count >= (uint) (reg_field - table->field));
monty@donna.mysql.com's avatar
monty@donna.mysql.com committed
5017
  field_count= (uint) (reg_field - table->field);
5018
  *blob_field= 0;				// End marker
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5019 5020

  /* If result table is small; use a heap */
5021
  if (blob_count || using_unique_constraint ||
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5022 5023 5024 5025 5026 5027 5028 5029 5030 5031 5032 5033 5034 5035 5036 5037 5038 5039 5040
      (select_options & (OPTION_BIG_TABLES | SELECT_SMALL_RESULT)) ==
      OPTION_BIG_TABLES)
  {
    table->file=get_new_handler(table,table->db_type=DB_TYPE_MYISAM);
    if (group &&
	(param->group_parts > table->file->max_key_parts() ||
	 param->group_length > table->file->max_key_length()))
      using_unique_constraint=1;
  }
  else
  {
    table->file=get_new_handler(table,table->db_type=DB_TYPE_HEAP);
  }

  if (!using_unique_constraint)
    reclength+= group_null_items;	// null flag is stored separately

  table->blob_fields=blob_count;
  if (blob_count == 0)
5041 5042
  {
    /* We need to ensure that first byte is not 0 for the delete link */
5043
    if (param->hidden_field_count)
5044 5045 5046 5047 5048 5049 5050
      hidden_null_count++;
    else
      null_count++;
  }
  hidden_null_pack_length=(hidden_null_count+7)/8;
  null_pack_length=hidden_null_count+(null_count+7)/8;
  reclength+=null_pack_length;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5051 5052 5053 5054 5055 5056 5057 5058
  if (!reclength)
    reclength=1;				// Dummy select

  table->fields=field_count;
  table->reclength=reclength;
  {
    uint alloc_length=ALIGN_SIZE(reclength+MI_UNIQUE_HASH_LENGTH+1);
    table->rec_buff_length=alloc_length;
5059
    if (!(table->record[0]= (byte *) my_malloc(alloc_length*3, MYF(MY_WME))))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5060
      goto err;
5061
    table->record[1]= table->record[0]+alloc_length;
5062
    table->default_values= table->record[1]+alloc_length;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5063 5064 5065 5066 5067 5068 5069 5070 5071 5072 5073 5074 5075 5076 5077
  }
  copy_func[0]=0;				// End marker

  recinfo=param->start_recinfo;
  null_flags=(uchar*) table->record[0];
  pos=table->record[0]+ null_pack_length;
  if (null_pack_length)
  {
    bzero((byte*) recinfo,sizeof(*recinfo));
    recinfo->type=FIELD_NORMAL;
    recinfo->length=null_pack_length;
    recinfo++;
    bfill(null_flags,null_pack_length,255);	// Set null fields
  }
  null_count= (blob_count == 0) ? 1 : 0;
5078
  hidden_field_count=param->hidden_field_count;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5079 5080 5081 5082 5083 5084 5085 5086 5087 5088
  for (i=0,reg_field=table->field; i < field_count; i++,reg_field++,recinfo++)
  {
    Field *field= *reg_field;
    uint length;
    bzero((byte*) recinfo,sizeof(*recinfo));

    if (!(field->flags & NOT_NULL_FLAG))
    {
      if (field->flags & GROUP_FLAG && !using_unique_constraint)
      {
5089 5090 5091 5092
	/*
	  We have to reserve one byte here for NULL bits,
	  as this is updated by 'end_update()'
	*/
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5093 5094 5095 5096 5097 5098 5099 5100 5101 5102 5103 5104 5105 5106 5107 5108 5109 5110 5111 5112 5113 5114 5115 5116 5117 5118 5119 5120 5121 5122 5123 5124 5125 5126
	*pos++=0;				// Null is stored here
	recinfo->length=1;
	recinfo->type=FIELD_NORMAL;
	recinfo++;
	bzero((byte*) recinfo,sizeof(*recinfo));
      }
      else
      {
	recinfo->null_bit= 1 << (null_count & 7);
	recinfo->null_pos= null_count/8;
      }
      field->move_field((char*) pos,null_flags+null_count/8,
			1 << (null_count & 7));
      null_count++;
    }
    else
      field->move_field((char*) pos,(uchar*) 0,0);
    field->reset();
    if (from_field[i])
    {						/* Not a table Item */
      copy->set(field,from_field[i],save_sum_fields);
      copy++;
    }
    length=field->pack_length();
    pos+= length;

    /* Make entry for create table */
    recinfo->length=length;
    if (field->flags & BLOB_FLAG)
      recinfo->type= (int) FIELD_BLOB;
    else if (!field->zero_pack() &&
	     (field->type() == FIELD_TYPE_STRING ||
	      field->type() == FIELD_TYPE_VAR_STRING) &&
	     length >= 10 && blob_count)
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
5127
      recinfo->type=FIELD_SKIP_ENDSPACE;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5128 5129
    else
      recinfo->type=FIELD_NORMAL;
5130 5131
    if (!--hidden_field_count)
      null_count=(null_count+7) & ~7;		// move to next byte
5132 5133 5134

    // fix table name in field entry
    field->table_name= table->table_name;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5135 5136
  }

monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
5137
  param->copy_field_end=copy;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5138
  param->recinfo=recinfo;
5139
  store_record(table,default_values);			// Make empty default record
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5140

5141
  if (thd->variables.tmp_table_size == ~(ulong) 0)		// No limit
5142 5143 5144
    table->max_rows= ~(ha_rows) 0;
  else
    table->max_rows=(((table->db_type == DB_TYPE_HEAP) ?
5145 5146 5147
		      min(thd->variables.tmp_table_size,
			  thd->variables.max_heap_table_size) :
		      thd->variables.tmp_table_size)/ table->reclength);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5148 5149 5150 5151 5152 5153 5154 5155 5156 5157 5158 5159 5160 5161 5162 5163
  set_if_bigger(table->max_rows,1);		// For dummy start options
  keyinfo=param->keyinfo;

  if (group)
  {
    DBUG_PRINT("info",("Creating group key in temporary table"));
    table->group=group;				/* Table is grouped by key */
    param->group_buff=group_buff;
    table->keys=1;
    table->uniques= test(using_unique_constraint);
    table->key_info=keyinfo;
    keyinfo->key_part=key_part_info;
    keyinfo->flags=HA_NOSAME;
    keyinfo->usable_key_parts=keyinfo->key_parts= param->group_parts;
    keyinfo->key_length=0;
    keyinfo->rec_per_key=0;
5164
    keyinfo->algorithm= HA_KEY_ALG_UNDEF;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5165 5166
    for (; group ; group=group->next,key_part_info++)
    {
5167
      Field *field=(*group->item)->get_tmp_table_field();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5168
      bool maybe_null=(*group->item)->maybe_null;
5169
      key_part_info->null_bit=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5170 5171 5172 5173 5174 5175 5176 5177 5178 5179 5180
      key_part_info->field=  field;
      key_part_info->offset= field->offset();
      key_part_info->length= (uint16) field->pack_length();
      key_part_info->type=   (uint8) field->key_type();
      key_part_info->key_type =
	((ha_base_keytype) key_part_info->type == HA_KEYTYPE_TEXT ||
	 (ha_base_keytype) key_part_info->type == HA_KEYTYPE_VARTEXT) ?
	0 : FIELDFLAG_BINARY;
      if (!using_unique_constraint)
      {
	group->buff=(char*) group_buff;
5181
	if (!(group->field=field->new_field(&thd->mem_root,table)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5182 5183 5184 5185
	  goto err; /* purecov: inspected */
	if (maybe_null)
	{
	  /*
5186 5187 5188 5189
	    To be able to group on NULL, we reserve place in group_buff
	    for the NULL flag just before the column.
	    The field data is after this flag.
	    The NULL flag is updated by 'end_update()' and 'end_write()'
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5190
	  */
5191 5192 5193 5194 5195
	  keyinfo->flags|= HA_NULL_ARE_EQUAL;	// def. that NULL == NULL
	  key_part_info->null_bit=field->null_bit;
	  key_part_info->null_offset= (uint) (field->null_ptr -
					      (uchar*) table->record[0]);
	  group->field->move_field((char*) ++group->buff);
5196
	  group_buff++;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5197 5198 5199 5200 5201 5202 5203 5204 5205
	}
	else
	  group->field->move_field((char*) group_buff);
	group_buff+= key_part_info->length;
      }
      keyinfo->key_length+=  key_part_info->length;
    }
  }

5206
  if (distinct)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5207
  {
5208 5209 5210 5211 5212 5213
    /*
      Create an unique key or an unique constraint over all columns
      that should be in the result.  In the temporary table, there are
      'param->hidden_field_count' extra columns, whose null bits are stored
      in the first 'hidden_null_pack_length' bytes of the row.
    */
5214 5215
    DBUG_PRINT("info",("hidden_field_count: %d", param->hidden_field_count));

5216
    null_pack_length-=hidden_null_pack_length;
5217
    keyinfo->key_parts= ((field_count-param->hidden_field_count)+
5218
			 test(null_pack_length));
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
5219 5220
    set_if_smaller(table->max_rows, rows_limit);
    param->end_write_records= rows_limit;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5221 5222 5223 5224 5225 5226 5227 5228 5229 5230 5231 5232
    table->distinct=1;
    table->keys=1;
    if (blob_count)
    {
      using_unique_constraint=1;
      table->uniques=1;
    }
    if (!(key_part_info= (KEY_PART_INFO*)
	  sql_calloc((keyinfo->key_parts)*sizeof(KEY_PART_INFO))))
      goto err;
    table->key_info=keyinfo;
    keyinfo->key_part=key_part_info;
5233
    keyinfo->flags=HA_NOSAME | HA_NULL_ARE_EQUAL;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5234 5235
    keyinfo->key_length=(uint16) reclength;
    keyinfo->name=(char*) "tmp";
5236
    keyinfo->algorithm= HA_KEY_ALG_UNDEF;
5237
    if (null_pack_length)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5238
    {
5239
      key_part_info->null_bit=0;
5240 5241
      key_part_info->offset=hidden_null_pack_length;
      key_part_info->length=null_pack_length;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5242 5243 5244 5245 5246
      key_part_info->field=new Field_string((char*) table->record[0],
					    (uint32) key_part_info->length,
					    (uchar*) 0,
					    (uint) 0,
					    Field::NONE,
5247
					    NullS, table, &my_charset_bin);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5248 5249 5250 5251
      key_part_info->key_type=FIELDFLAG_BINARY;
      key_part_info->type=    HA_KEYTYPE_BINARY;
      key_part_info++;
    }
5252
    /* Create a distinct key over the columns we are going to return */
5253 5254
    for (i=param->hidden_field_count, reg_field=table->field + i ;
	 i < field_count;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5255 5256
	 i++, reg_field++, key_part_info++)
    {
5257
      key_part_info->null_bit=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5258 5259 5260 5261 5262 5263 5264 5265 5266 5267
      key_part_info->field=    *reg_field;
      key_part_info->offset=   (*reg_field)->offset();
      key_part_info->length=   (uint16) (*reg_field)->pack_length();
      key_part_info->type=     (uint8) (*reg_field)->key_type();
      key_part_info->key_type =
	((ha_base_keytype) key_part_info->type == HA_KEYTYPE_TEXT ||
	 (ha_base_keytype) key_part_info->type == HA_KEYTYPE_VARTEXT) ?
	0 : FIELDFLAG_BINARY;
    }
  }
5268
  if (thd->is_fatal_error)				// If end of memory
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5269 5270 5271 5272 5273 5274 5275
    goto err;					 /* purecov: inspected */
  table->db_record_offset=1;
  if (table->db_type == DB_TYPE_MYISAM)
  {
    if (create_myisam_tmp_table(table,param,select_options))
      goto err;
  }
5276 5277
  /* Set table_name for easier debugging */
  table->table_name= base_name(tmpname);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5278 5279 5280 5281
  if (!open_tmp_table(table))
    DBUG_RETURN(table);

 err:
5282 5283 5284 5285 5286
  /*
    Hack to ensure that free_blobs() doesn't fail if blob_field is not yet
    complete
  */
  *table->blob_field= 0;
5287
  free_tmp_table(thd,table);                    /* purecov: inspected */
5288
  bitmap_clear_bit(&temp_pool, temp_pool_slot);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5289 5290 5291 5292 5293 5294 5295 5296 5297 5298 5299 5300 5301 5302 5303 5304 5305 5306 5307
  DBUG_RETURN(NULL);				/* purecov: inspected */
}


static bool open_tmp_table(TABLE *table)
{
  int error;
  if ((error=table->file->ha_open(table->real_name,O_RDWR,HA_OPEN_TMP_TABLE)))
  {
    table->file->print_error(error,MYF(0)); /* purecov: inspected */
    table->db_stat=0;
    return(1);
  }
  (void) table->file->extra(HA_EXTRA_QUICK);		/* Faster */
  return(0);
}


static bool create_myisam_tmp_table(TABLE *table,TMP_TABLE_PARAM *param,
5308
				    ulong options)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5309 5310 5311 5312 5313 5314 5315 5316 5317 5318
{
  int error;
  MI_KEYDEF keydef;
  MI_UNIQUEDEF uniquedef;
  KEY *keyinfo=param->keyinfo;

  DBUG_ENTER("create_myisam_tmp_table");
  if (table->keys)
  {						// Get keys for ni_create
    bool using_unique_constraint=0;
5319
    HA_KEYSEG *seg= (HA_KEYSEG*) sql_calloc(sizeof(*seg) *
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5320 5321 5322 5323 5324 5325 5326 5327 5328 5329 5330 5331 5332 5333 5334 5335 5336 5337 5338 5339 5340 5341 5342 5343 5344 5345 5346 5347 5348 5349 5350 5351 5352 5353 5354
					    keyinfo->key_parts);
    if (!seg)
      goto err;

    if (keyinfo->key_length >= table->file->max_key_length() ||
	keyinfo->key_parts > table->file->max_key_parts() ||
	table->uniques)
    {
      /* Can't create a key; Make a unique constraint instead of a key */
      table->keys=0;
      table->uniques=1;
      using_unique_constraint=1;
      bzero((char*) &uniquedef,sizeof(uniquedef));
      uniquedef.keysegs=keyinfo->key_parts;
      uniquedef.seg=seg;
      uniquedef.null_are_equal=1;

      /* Create extra column for hash value */
      bzero((byte*) param->recinfo,sizeof(*param->recinfo));
      param->recinfo->type= FIELD_CHECK;
      param->recinfo->length=MI_UNIQUE_HASH_LENGTH;
      param->recinfo++;
      table->reclength+=MI_UNIQUE_HASH_LENGTH;
    }
    else
    {
      /* Create an unique key */
      bzero((char*) &keydef,sizeof(keydef));
      keydef.flag=HA_NOSAME | HA_BINARY_PACK_KEY | HA_PACK_KEY;
      keydef.keysegs=  keyinfo->key_parts;
      keydef.seg= seg;
    }
    for (uint i=0; i < keyinfo->key_parts ; i++,seg++)
    {
      Field *field=keyinfo->key_part[i].field;
5355
      seg->flag=     0;
5356
      seg->language= field->charset()->number;
5357 5358
      seg->length=   keyinfo->key_part[i].length;
      seg->start=    keyinfo->key_part[i].offset;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5359 5360 5361 5362 5363 5364 5365 5366 5367 5368 5369 5370 5371 5372 5373 5374 5375 5376 5377 5378
      if (field->flags & BLOB_FLAG)
      {
	seg->type=
	((keyinfo->key_part[i].key_type & FIELDFLAG_BINARY) ?
	 HA_KEYTYPE_VARBINARY : HA_KEYTYPE_VARTEXT);
	seg->bit_start=seg->length - table->blob_ptr_size;
	seg->flag= HA_BLOB_PART;
	seg->length=0;			// Whole blob in unique constraint
      }
      else
      {
	seg->type=
	  ((keyinfo->key_part[i].key_type & FIELDFLAG_BINARY) ?
	   HA_KEYTYPE_BINARY : HA_KEYTYPE_TEXT);
	if (!(field->flags & ZEROFILL_FLAG) &&
	    (field->type() == FIELD_TYPE_STRING ||
	     field->type() == FIELD_TYPE_VAR_STRING) &&
	    keyinfo->key_part[i].length > 4)
	  seg->flag|=HA_SPACE_PACK;
      }
5379
      if (!(field->flags & NOT_NULL_FLAG))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5380 5381 5382
      {
	seg->null_bit= field->null_bit;
	seg->null_pos= (uint) (field->null_ptr - (uchar*) table->record[0]);
5383 5384 5385 5386 5387 5388 5389
	/*
	  We are using a GROUP BY on something that contains NULL
	  In this case we have to tell MyISAM that two NULL should
	  on INSERT be compared as equal
	*/
	if (!using_unique_constraint)
	  keydef.flag|= HA_NULL_ARE_EQUAL;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5390 5391 5392 5393 5394
      }
    }
  }
  MI_CREATE_INFO create_info;
  bzero((char*) &create_info,sizeof(create_info));
5395

5396 5397
  if ((options & (OPTION_BIG_TABLES | SELECT_SMALL_RESULT)) ==
      OPTION_BIG_TABLES)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5398 5399 5400 5401 5402 5403 5404 5405 5406 5407 5408 5409 5410
    create_info.data_file_length= ~(ulonglong) 0;

  if ((error=mi_create(table->real_name,table->keys,&keydef,
		       (uint) (param->recinfo-param->start_recinfo),
		       param->start_recinfo,
		       table->uniques, &uniquedef,
		       &create_info,
		       HA_CREATE_TMP_TABLE)))
  {
    table->file->print_error(error,MYF(0));	/* purecov: inspected */
    table->db_stat=0;
    goto err;
  }
5411
  statistic_increment(created_tmp_disk_tables, &LOCK_status);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5412 5413 5414 5415 5416 5417 5418 5419 5420 5421 5422 5423 5424 5425 5426 5427
  table->db_record_offset=1;
  DBUG_RETURN(0);
 err:
  DBUG_RETURN(1);
}


void
free_tmp_table(THD *thd, TABLE *entry)
{
  const char *save_proc_info;
  DBUG_ENTER("free_tmp_table");
  DBUG_PRINT("enter",("table: %s",entry->table_name));

  save_proc_info=thd->proc_info;
  thd->proc_info="removing tmp table";
5428
  free_blobs(entry);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5429 5430 5431 5432 5433 5434 5435 5436 5437
  if (entry->db_stat && entry->file)
  {
    (void) entry->file->close();
    delete entry->file;
  }
  if (!(test_flags & TEST_KEEP_TMP_TABLES) || entry->db_type == DB_TYPE_HEAP)
    (void) ha_delete_table(entry->db_type,entry->real_name);
  /* free blobs */
  for (Field **ptr=entry->field ; *ptr ; ptr++)
5438
    (*ptr)->free();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5439 5440
  my_free((gptr) entry->record[0],MYF(0));
  free_io_cache(entry);
5441

5442
  bitmap_clear_bit(&temp_pool, entry->temp_pool_slot);
5443

bk@work.mysql.com's avatar
bk@work.mysql.com committed
5444 5445 5446 5447 5448 5449 5450 5451 5452 5453
  my_free((gptr) entry,MYF(0));
  thd->proc_info=save_proc_info;

  DBUG_VOID_RETURN;
}

/*
* If a HEAP table gets full, create a MyISAM table and copy all rows to this
*/

monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
5454 5455
bool create_myisam_from_heap(THD *thd, TABLE *table, TMP_TABLE_PARAM *param,
			     int error, bool ignore_last_dupp_key_error)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5456 5457 5458 5459 5460 5461 5462 5463 5464 5465 5466 5467 5468 5469 5470 5471 5472 5473 5474 5475
{
  TABLE new_table;
  const char *save_proc_info;
  int write_err;
  DBUG_ENTER("create_myisam_from_heap");

  if (table->db_type != DB_TYPE_HEAP || error != HA_ERR_RECORD_FILE_FULL)
  {
    table->file->print_error(error,MYF(0));
    DBUG_RETURN(1);
  }
  new_table= *table;
  new_table.db_type=DB_TYPE_MYISAM;
  if (!(new_table.file=get_new_handler(&new_table,DB_TYPE_MYISAM)))
    DBUG_RETURN(1);				// End of memory

  save_proc_info=thd->proc_info;
  thd->proc_info="converting HEAP to MyISAM";

  if (create_myisam_tmp_table(&new_table,param,
5476
			      thd->lex->select_lex.options | thd->options))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5477 5478 5479 5480 5481
    goto err2;
  if (open_tmp_table(&new_table))
    goto err1;
  table->file->index_end();
  table->file->rnd_init();
5482 5483
  if (table->no_rows)
  {
5484 5485
    new_table.file->extra(HA_EXTRA_NO_ROWS);
    new_table.no_rows=1;
5486 5487
  }

bk@work.mysql.com's avatar
bk@work.mysql.com committed
5488 5489 5490 5491 5492 5493 5494 5495 5496 5497 5498 5499 5500 5501 5502 5503 5504 5505 5506 5507 5508 5509
  /* copy all old rows */
  while (!table->file->rnd_next(new_table.record[1]))
  {
    if ((write_err=new_table.file->write_row(new_table.record[1])))
      goto err;
  }
  /* copy row that filled HEAP table */
  if ((write_err=new_table.file->write_row(table->record[0])))
  {
    if (write_err != HA_ERR_FOUND_DUPP_KEY &&
	write_err != HA_ERR_FOUND_DUPP_UNIQUE || !ignore_last_dupp_key_error)
    goto err;
  }

  /* remove heap table and change to use myisam table */
  (void) table->file->rnd_end();
  (void) table->file->close();
  (void) table->file->delete_table(table->real_name);
  delete table->file;
  table->file=0;
  *table =new_table;
  table->file->change_table_ptr(table);
5510 5511
  thd->proc_info= (!strcmp(save_proc_info,"Copying to tmp table") ?
		   "Copying to tmp table on disk" : save_proc_info);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5512 5513 5514 5515 5516 5517 5518 5519 5520 5521 5522 5523 5524 5525 5526 5527
  DBUG_RETURN(0);

 err:
  DBUG_PRINT("error",("Got error: %d",write_err));
  table->file->print_error(error,MYF(0));	// Give table is full error
  (void) table->file->rnd_end();
  (void) new_table.file->close();
 err1:
  new_table.file->delete_table(new_table.real_name);
  delete new_table.file;
 err2:
  thd->proc_info=save_proc_info;
  DBUG_RETURN(1);
}


5528 5529 5530 5531 5532 5533
/****************************************************************************
  Make a join of all tables and write it on socket or to table
  Return:  0 if ok
           1 if error is sent
          -1 if error should be sent
****************************************************************************/
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5534 5535 5536 5537

static int
do_select(JOIN *join,List<Item> *fields,TABLE *table,Procedure *procedure)
{
5538
  int error= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5539 5540 5541 5542 5543 5544
  JOIN_TAB *join_tab;
  int (*end_select)(JOIN *, struct st_join_table *,bool);
  DBUG_ENTER("do_select");

  join->procedure=procedure;
  /*
5545
    Tell the client how many fields there are in a row
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5546 5547 5548 5549 5550 5551 5552 5553
  */
  if (!table)
    join->result->send_fields(*fields,1);
  else
  {
    VOID(table->file->extra(HA_EXTRA_WRITE_CACHE));
    empty_record(table);
  }
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
5554
  join->tmp_table= table;			/* Save for easy recursion */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5555 5556 5557 5558 5559 5560 5561 5562 5563
  join->fields= fields;

  /* Set up select_end */
  if (table)
  {
    if (table->group && join->tmp_table_param.sum_func_count)
    {
      if (table->keys)
      {
5564
	DBUG_PRINT("info",("Using end_update"));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5565 5566 5567 5568
	end_select=end_update;
	table->file->index_init(0);
      }
      else
5569 5570
      {
	DBUG_PRINT("info",("Using end_unique_update"));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5571
	end_select=end_unique_update;
5572
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5573 5574 5575 5576 5577 5578 5579 5580 5581 5582 5583 5584 5585 5586 5587 5588 5589 5590 5591 5592 5593 5594 5595 5596 5597 5598
    }
    else if (join->sort_and_group)
    {
      DBUG_PRINT("info",("Using end_write_group"));
      end_select=end_write_group;
    }
    else
    {
      DBUG_PRINT("info",("Using end_write"));
      end_select=end_write;
    }
  }
  else
  {
    if (join->sort_and_group || (join->procedure &&
				 join->procedure->flags & PROC_GROUP))
      end_select=end_send_group;
    else
      end_select=end_send;
  }
  join->join_tab[join->tables-1].next_select=end_select;

  join_tab=join->join_tab+join->const_tables;
  join->send_records=0;
  if (join->tables == join->const_tables)
  {
5599 5600 5601 5602
    /*
      HAVING will be chcked after processing aggregate functions,
      But WHERE should checkd here (we alredy have read tables)
    */
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
5603
    if (!join->conds || join->conds->val_int())
5604
    {
5605 5606
      if (!(error=(*end_select)(join,join_tab,0)) || error == -3)
	error=(*end_select)(join,join_tab,1);
5607
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5608 5609 5610
  }
  else
  {
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
5611
    error= sub_select(join,join_tab,0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5612
    if (error >= 0)
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
5613
      error= sub_select(join,join_tab,1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5614
    if (error == -3)
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
5615
      error= 0;					/* select_limit used */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5616
  }
5617

bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
5618
  if (error >= 0)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5619
  {
5620 5621
    error=0;
    if (!table)					// If sending data to client
5622
    {
5623
      /*
5624 5625
	The following will unlock all cursors if the command wasn't an
	update command
5626
      */
5627
      join->join_free(0);				// Unlock all cursors
5628
      if (join->result->send_eof())
5629
	error= 1;				// Don't send error
5630
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5631 5632 5633 5634
    DBUG_PRINT("info",("%ld records output",join->send_records));
  }
  if (table)
  {
5635
    int tmp;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5636 5637
    if ((tmp=table->file->extra(HA_EXTRA_NO_CACHE)))
    {
5638 5639
      DBUG_PRINT("error",("extra(HA_EXTRA_NO_CACHE) failed"));
      my_errno= tmp;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5640 5641
      error= -1;
    }
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
5642
    if ((tmp=table->file->index_end()))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5643
    {
5644 5645
      DBUG_PRINT("error",("index_end() failed"));
      my_errno= tmp;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5646 5647
      error= -1;
    }
5648
    if (error == -1)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5649 5650
      table->file->print_error(my_errno,MYF(0));
  }
5651 5652 5653 5654 5655 5656
#ifndef DBUG_OFF
  if (error)
  {
    DBUG_PRINT("error",("Error: do_select() failed"));
  }
#endif
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
5657
  DBUG_RETURN(error || join->thd->net.report_error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5658 5659 5660 5661 5662 5663 5664 5665 5666 5667 5668 5669 5670 5671
}


static int
sub_select_cache(JOIN *join,JOIN_TAB *join_tab,bool end_of_records)
{
  int error;

  if (end_of_records)
  {
    if ((error=flush_cached_records(join,join_tab,FALSE)) < 0)
      return error; /* purecov: inspected */
    return sub_select(join,join_tab,end_of_records);
  }
5672 5673 5674 5675 5676
  if (join->thd->killed)		// If aborted by user
  {
    my_error(ER_SERVER_SHUTDOWN,MYF(0)); /* purecov: inspected */
    return -2;				 /* purecov: inspected */
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5677 5678 5679 5680 5681 5682 5683 5684 5685 5686 5687 5688 5689 5690 5691 5692 5693 5694 5695 5696 5697 5698 5699 5700
  if (join_tab->use_quick != 2 || test_if_quick_select(join_tab) <= 0)
  {
    if (!store_record_in_cache(&join_tab->cache))
      return 0;					// There is more room in cache
    return flush_cached_records(join,join_tab,FALSE);
  }
  if ((error=flush_cached_records(join,join_tab,TRUE)) < 0)
    return error; /* purecov: inspected */
  return sub_select(join,join_tab,end_of_records); /* Use ordinary select */
}


static int
sub_select(JOIN *join,JOIN_TAB *join_tab,bool end_of_records)
{

  join_tab->table->null_row=0;
  if (end_of_records)
    return (*join_tab->next_select)(join,join_tab+1,end_of_records);

  /* Cache variables for faster loop */
  int error;
  bool found=0;
  COND *on_expr=join_tab->on_expr, *select_cond=join_tab->select_cond;
5701
  my_bool *report_error= &(join->thd->net.report_error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5702 5703 5704

  if (!(error=(*join_tab->read_first_record)(join_tab)))
  {
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
5705 5706 5707
    bool not_exists_optimize= join_tab->table->reginfo.not_exists_optimize;
    bool not_used_in_distinct=join_tab->not_used_in_distinct;
    ha_rows found_records=join->found_records;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5708 5709
    READ_RECORD *info= &join_tab->read_record;

5710
    join->thd->row_count= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5711 5712 5713 5714 5715 5716 5717
    do
    {
      if (join->thd->killed)			// Aborted by user
      {
	my_error(ER_SERVER_SHUTDOWN,MYF(0));	/* purecov: inspected */
	return -2;				/* purecov: inspected */
      }
5718
      join->examined_rows++;
5719
      join->thd->row_count++;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5720 5721 5722 5723 5724 5725 5726
      if (!on_expr || on_expr->val_int())
      {
	found=1;
	if (not_exists_optimize)
	  break;			// Searching after not null columns
	if (!select_cond || select_cond->val_int())
	{
5727
	  if ((error=(*join_tab->next_select)(join,join_tab+1,0)) < 0)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5728
	    return error;
5729 5730 5731 5732 5733
	  /*
	    Test if this was a SELECT DISTINCT query on a table that
	    was not in the field list;  In this case we can abort if
	    we found a row, as no new rows can be added to the result.
	  */
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
5734 5735
	  if (not_used_in_distinct && found_records != join->found_records)
	    return 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5736
	}
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
5737 5738
	else
	  info->file->unlock_row();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5739
      }
5740
    } while (!(error=info->read_record(info)) && !(*report_error));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5741
  }
5742
  if (error > 0 || (*report_error))				// Fatal error
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5743 5744 5745 5746
    return -1;

  if (!found && on_expr)
  {						// OUTER JOIN
5747
    restore_record(join_tab->table,default_values);		// Make empty record
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5748 5749 5750
    mark_as_null_row(join_tab->table);		// For group by without error
    if (!select_cond || select_cond->val_int())
    {
5751
      if ((error=(*join_tab->next_select)(join,join_tab+1,0)) < 0)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5752 5753 5754 5755 5756 5757 5758 5759
	return error;				/* purecov: inspected */
    }
  }
  return 0;
}


static int
5760
flush_cached_records(JOIN *join,JOIN_TAB *join_tab,bool skip_last)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5761 5762 5763 5764 5765 5766
{
  int error;
  READ_RECORD *info;

  if (!join_tab->cache.records)
    return 0;				/* Nothing to do */
5767
  if (skip_last)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5768 5769 5770 5771 5772 5773 5774 5775 5776 5777 5778 5779 5780 5781 5782 5783 5784 5785 5786 5787 5788 5789 5790 5791 5792 5793 5794 5795 5796 5797 5798 5799 5800
    (void) store_record_in_cache(&join_tab->cache); // Must save this for later
  if (join_tab->use_quick == 2)
  {
    if (join_tab->select->quick)
    {					/* Used quick select last. reset it */
      delete join_tab->select->quick;
      join_tab->select->quick=0;
    }
  }
 /* read through all records */
  if ((error=join_init_read_record(join_tab)))
  {
    reset_cache(&join_tab->cache);
    join_tab->cache.records=0; join_tab->cache.ptr_record= (uint) ~0;
    return -error;			/* No records or error */
  }

  for (JOIN_TAB *tmp=join->join_tab; tmp != join_tab ; tmp++)
  {
    tmp->status=tmp->table->status;
    tmp->table->status=0;
  }

  info= &join_tab->read_record;
  do
  {
    if (join->thd->killed)
    {
      my_error(ER_SERVER_SHUTDOWN,MYF(0)); /* purecov: inspected */
      return -2;				// Aborted by user /* purecov: inspected */
    }
    SQL_SELECT *select=join_tab->select;
    if (!error && (!join_tab->cache.select ||
5801
		   !join_tab->cache.select->skip_record()))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5802 5803 5804
    {
      uint i;
      reset_cache(&join_tab->cache);
5805
      for (i=(join_tab->cache.records- (skip_last ? 1 : 0)) ; i-- > 0 ;)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5806 5807
      {
	read_cached_record(join_tab);
5808
	if (!select || !select->skip_record())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5809 5810 5811 5812 5813 5814
	  if ((error=(join_tab->next_select)(join,join_tab+1,0)) < 0)
	    return error; /* purecov: inspected */
      }
    }
  } while (!(error=info->read_record(info)));

5815
  if (skip_last)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5816 5817 5818 5819 5820 5821 5822 5823 5824 5825 5826 5827
    read_cached_record(join_tab);		// Restore current record
  reset_cache(&join_tab->cache);
  join_tab->cache.records=0; join_tab->cache.ptr_record= (uint) ~0;
  if (error > 0)				// Fatal error
    return -1;					/* purecov: inspected */
  for (JOIN_TAB *tmp2=join->join_tab; tmp2 != join_tab ; tmp2++)
    tmp2->table->status=tmp2->status;
  return 0;
}


/*****************************************************************************
5828 5829
  The different ways to read a record
  Returns -1 if row was not found, 0 if row was found and 1 on errors
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5830
*****************************************************************************/
5831 5832 5833

/* Help function when we get some an error from the table handler */

5834
int report_error(TABLE *table, int error)
5835 5836 5837 5838 5839 5840 5841 5842 5843 5844 5845 5846 5847 5848 5849 5850 5851 5852
{
  if (error == HA_ERR_END_OF_FILE || error == HA_ERR_KEY_NOT_FOUND)
  {
    table->status= STATUS_GARBAGE;
    return -1;					// key not found; ok
  }
  /*
    Locking reads can legally return also these errors, do not
    print them to the .err log
  */
  if (error != HA_ERR_LOCK_DEADLOCK && error != HA_ERR_LOCK_WAIT_TIMEOUT)
    sql_print_error("Got error %d when reading table '%s'",
		    error, table->path);
  table->file->print_error(error,MYF(0));
  return 1;
}


5853
int safe_index_read(JOIN_TAB *tab)
5854 5855 5856 5857 5858 5859 5860 5861 5862 5863 5864
{
  int error;
  TABLE *table= tab->table;
  if ((error=table->file->index_read(table->record[0],
				     tab->ref.key_buff,
				     tab->ref.key_length, HA_READ_KEY_EXACT)))
    return report_error(table, error);
  return 0;
}


bk@work.mysql.com's avatar
bk@work.mysql.com committed
5865
static int
5866
join_read_const_table(JOIN_TAB *tab, POSITION *pos)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5867 5868
{
  int error;
5869 5870 5871 5872 5873 5874 5875
  DBUG_ENTER("join_read_const_table");
  TABLE *table=tab->table;
  table->const_table=1;
  table->null_row=0;
  table->status=STATUS_NO_RECORD;
  
  if (tab->type == JT_SYSTEM)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5876
  {
5877 5878 5879 5880 5881 5882 5883
    if ((error=join_read_system(tab)))
    {						// Info for DESCRIBE
      tab->info="const row not found";
      /* Mark for EXPLAIN that the row was not found */
      pos->records_read=0.0;
      if (!table->outer_join || error > 0)
	DBUG_RETURN(error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5884
    }
5885 5886 5887 5888
  }
  else
  {
    if ((error=join_read_const(tab)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5889
    {
5890 5891 5892 5893 5894
      tab->info="unique row not found";
      /* Mark for EXPLAIN that the row was not found */
      pos->records_read=0.0;
      if (!table->outer_join || error > 0)
	DBUG_RETURN(error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5895 5896
    }
  }
5897 5898 5899 5900 5901 5902 5903
  if (tab->on_expr && !table->null_row)
  {
    if ((table->null_row= test(tab->on_expr->val_int() == 0)))
      empty_record(table);
    }
  if (!table->null_row)
    table->maybe_null=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5904 5905 5906 5907 5908 5909 5910 5911 5912 5913 5914
  DBUG_RETURN(0);
}


static int
join_read_system(JOIN_TAB *tab)
{
  TABLE *table= tab->table;
  int error;
  if (table->status & STATUS_GARBAGE)		// If first read
  {
5915 5916
    if ((error=table->file->read_first_row(table->record[0],
					   table->primary_key)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5917 5918
    {
      if (error != HA_ERR_END_OF_FILE)
5919
	return report_error(table, error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5920 5921 5922 5923
      table->null_row=1;			// This is ok.
      empty_record(table);			// Make empty record
      return -1;
    }
5924
    store_record(table,record[1]);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5925 5926
  }
  else if (!table->status)			// Only happens with left join
5927
    restore_record(table,record[1]);			// restore old record
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5928 5929 5930 5931 5932 5933 5934 5935 5936 5937 5938 5939 5940 5941 5942 5943 5944 5945 5946 5947 5948 5949 5950 5951 5952
  table->null_row=0;
  return table->status ? -1 : 0;
}


static int
join_read_const(JOIN_TAB *tab)
{
  int error;
  TABLE *table= tab->table;
  if (table->status & STATUS_GARBAGE)		// If first read
  {
    if (cp_buffer_from_ref(&tab->ref))
      error=HA_ERR_KEY_NOT_FOUND;
    else
    {
      error=table->file->index_read_idx(table->record[0],tab->ref.key,
					(byte*) tab->ref.key_buff,
					tab->ref.key_length,HA_READ_KEY_EXACT);
    }
    if (error)
    {
      table->null_row=1;
      empty_record(table);
      if (error != HA_ERR_KEY_NOT_FOUND)
5953
	return report_error(table, error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5954 5955
      return -1;
    }
5956
    store_record(table,record[1]);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5957
  }
5958 5959 5960
  else if (!(table->status & ~STATUS_NULL_ROW))	// Only happens with left join
  {
    table->status=0;
5961
    restore_record(table,record[1]);			// restore old record
5962
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5963 5964 5965 5966 5967 5968 5969 5970 5971 5972 5973 5974
  table->null_row=0;
  return table->status ? -1 : 0;
}


static int
join_read_key(JOIN_TAB *tab)
{
  int error;
  TABLE *table= tab->table;

  if (cmp_buffer_with_ref(tab) ||
5975
      (table->status & (STATUS_GARBAGE | STATUS_NO_PARENT | STATUS_NULL_ROW)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5976 5977 5978 5979 5980 5981 5982 5983 5984 5985
  {
    if (tab->ref.key_err)
    {
      table->status=STATUS_NOT_FOUND;
      return -1;
    }
    error=table->file->index_read(table->record[0],
				  tab->ref.key_buff,
				  tab->ref.key_length,HA_READ_KEY_EXACT);
    if (error && error != HA_ERR_KEY_NOT_FOUND)
5986
      return report_error(table, error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5987
  }
5988
  table->null_row=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5989 5990 5991 5992 5993 5994 5995 5996 5997 5998 5999 6000 6001 6002 6003 6004 6005
  return table->status ? -1 : 0;
}


static int
join_read_always_key(JOIN_TAB *tab)
{
  int error;
  TABLE *table= tab->table;

  if (cp_buffer_from_ref(&tab->ref))
    return -1;
  if ((error=table->file->index_read(table->record[0],
				     tab->ref.key_buff,
				     tab->ref.key_length,HA_READ_KEY_EXACT)))
  {
    if (error != HA_ERR_KEY_NOT_FOUND)
6006
      return report_error(table, error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6007 6008 6009 6010 6011
    return -1; /* purecov: inspected */
  }
  return 0;
}

6012

6013 6014 6015 6016 6017 6018 6019 6020 6021 6022 6023 6024 6025 6026 6027 6028 6029 6030
/*
  This function is used when optimizing away ORDER BY in 
  SELECT * FROM t1 WHERE a=1 ORDER BY a DESC,b DESC
*/
  
static int
join_read_last_key(JOIN_TAB *tab)
{
  int error;
  TABLE *table= tab->table;

  if (cp_buffer_from_ref(&tab->ref))
    return -1;
  if ((error=table->file->index_read_last(table->record[0],
					  tab->ref.key_buff,
					  tab->ref.key_length)))
  {
    if (error != HA_ERR_KEY_NOT_FOUND)
6031
      return report_error(table, error);
6032 6033 6034 6035 6036
    return -1; /* purecov: inspected */
  }
  return 0;
}

bk@work.mysql.com's avatar
bk@work.mysql.com committed
6037 6038 6039 6040 6041 6042 6043 6044 6045 6046

	/* ARGSUSED */
static int
join_no_more_records(READ_RECORD *info __attribute__((unused)))
{
  return -1;
}


static int
6047
join_read_next_same(READ_RECORD *info)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6048 6049 6050 6051 6052 6053 6054 6055 6056 6057
{
  int error;
  TABLE *table= info->table;
  JOIN_TAB *tab=table->reginfo.join_tab;

  if ((error=table->file->index_next_same(table->record[0],
					  tab->ref.key_buff,
					  tab->ref.key_length)))
  {
    if (error != HA_ERR_END_OF_FILE)
6058
      return report_error(table, error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6059 6060 6061 6062 6063 6064
    table->status= STATUS_GARBAGE;
    return -1;
  }
  return 0;
}

6065

6066 6067 6068 6069 6070 6071 6072 6073
static int
join_read_prev_same(READ_RECORD *info)
{
  int error;
  TABLE *table= info->table;
  JOIN_TAB *tab=table->reginfo.join_tab;

  if ((error=table->file->index_prev(table->record[0])))
6074 6075 6076
    return report_error(table, error);
  if (key_cmp(table, tab->ref.key_buff, tab->ref.key,
	      tab->ref.key_length))
6077 6078
  {
    table->status=STATUS_NOT_FOUND;
6079
    error= -1;
6080 6081 6082 6083
  }
  return error;
}

bk@work.mysql.com's avatar
bk@work.mysql.com committed
6084 6085 6086 6087 6088 6089 6090 6091 6092 6093 6094 6095 6096 6097 6098

static int
join_init_quick_read_record(JOIN_TAB *tab)
{
  if (test_if_quick_select(tab) == -1)
    return -1;					/* No possible records */
  return join_init_read_record(tab);
}


static int
test_if_quick_select(JOIN_TAB *tab)
{
  delete tab->select->quick;
  tab->select->quick=0;
6099 6100
  return tab->select->test_quick_select(tab->join->thd, tab->keys,
					(table_map) 0, HA_POS_ERROR);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6101 6102 6103 6104 6105 6106 6107 6108
}


static int
join_init_read_record(JOIN_TAB *tab)
{
  if (tab->select && tab->select->quick)
    tab->select->quick->reset();
6109 6110
  init_read_record(&tab->read_record, tab->join->thd, tab->table,
		   tab->select,1,1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6111 6112 6113
  return (*tab->read_record.read_record)(&tab->read_record);
}

6114

bk@work.mysql.com's avatar
bk@work.mysql.com committed
6115
static int
6116
join_read_first(JOIN_TAB *tab)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6117 6118 6119
{
  int error;
  TABLE *table=tab->table;
6120
  if (!table->key_read && table->used_keys.is_set(tab->index) &&
6121
      !table->no_keyread)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6122 6123 6124 6125 6126
  {
    table->key_read=1;
    table->file->extra(HA_EXTRA_KEYREAD);
  }
  tab->table->status=0;
6127
  tab->read_record.read_record=join_read_next;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6128 6129 6130 6131
  tab->read_record.table=table;
  tab->read_record.file=table->file;
  tab->read_record.index=tab->index;
  tab->read_record.record=table->record[0];
6132
  if ((error=tab->table->file->index_first(tab->table->record[0])))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6133 6134
  {
    if (error != HA_ERR_KEY_NOT_FOUND && error != HA_ERR_END_OF_FILE)
6135
      report_error(table, error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6136 6137 6138 6139 6140
    return -1;
  }
  return 0;
}

6141

bk@work.mysql.com's avatar
bk@work.mysql.com committed
6142
static int
6143
join_read_next(READ_RECORD *info)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6144
{
6145 6146 6147
  int error;
  if ((error=info->file->index_next(info->record)))
    return report_error(info->table, error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6148 6149 6150
  return 0;
}

6151

bk@work.mysql.com's avatar
bk@work.mysql.com committed
6152
static int
6153
join_read_last(JOIN_TAB *tab)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6154 6155 6156
{
  TABLE *table=tab->table;
  int error;
6157
  if (!table->key_read && table->used_keys.is_set(tab->index) &&
6158
      !table->no_keyread)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6159 6160 6161 6162 6163
  {
    table->key_read=1;
    table->file->extra(HA_EXTRA_KEYREAD);
  }
  tab->table->status=0;
6164
  tab->read_record.read_record=join_read_prev;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6165 6166 6167 6168
  tab->read_record.table=table;
  tab->read_record.file=table->file;
  tab->read_record.index=tab->index;
  tab->read_record.record=table->record[0];
6169 6170
  if ((error= tab->table->file->index_last(tab->table->record[0])))
    return report_error(table, error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6171 6172 6173
  return 0;
}

6174

bk@work.mysql.com's avatar
bk@work.mysql.com committed
6175
static int
6176
join_read_prev(READ_RECORD *info)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6177
{
6178 6179 6180
  int error;
  if ((error= info->file->index_prev(info->record)))
    return report_error(info->table, error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6181 6182 6183
  return 0;
}

6184

bk@work.mysql.com's avatar
bk@work.mysql.com committed
6185 6186 6187 6188 6189 6190
static int
join_ft_read_first(JOIN_TAB *tab)
{
  int error;
  TABLE *table= tab->table;

monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
6191
#if NOT_USED_YET
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6192
  if (cp_buffer_from_ref(&tab->ref))       // as ft-key doesn't use store_key's
6193
    return -1;                             // see also FT_SELECT::init()
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6194
#endif
6195
  table->file->ft_init();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6196

6197 6198
  if ((error= table->file->ft_read(table->record[0])))
    return report_error(table, error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6199 6200 6201 6202 6203 6204
  return 0;
}

static int
join_ft_read_next(READ_RECORD *info)
{
6205 6206 6207
  int error;
  if ((error= info->file->ft_read(info->table->record[0])))
    return report_error(info->table, error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6208 6209 6210 6211
  return 0;
}


6212 6213 6214 6215 6216 6217 6218 6219 6220 6221
/*
  Reading of key with key reference and one part that may be NULL
*/

static int
join_read_always_key_or_null(JOIN_TAB *tab)
{
  int res;

  /* First read according to key which is NOT NULL */
6222
  *tab->ref.null_ref_key= 0;			// Clear null byte
6223 6224 6225 6226
  if ((res= join_read_always_key(tab)) >= 0)
    return res;

  /* Then read key with null value */
6227
  *tab->ref.null_ref_key= 1;			// Set null byte
6228 6229 6230 6231 6232 6233 6234 6235 6236 6237 6238 6239 6240
  return safe_index_read(tab);
}


static int
join_read_next_same_or_null(READ_RECORD *info)
{
  int error;
  if ((error= join_read_next_same(info)) >= 0)
    return error;
  JOIN_TAB *tab= info->table->reginfo.join_tab;

  /* Test if we have already done a read after null key */
6241
  if (*tab->ref.null_ref_key)
6242
    return -1;					// All keys read
6243 6244
  *tab->ref.null_ref_key= 1;			// Set null byte
  return safe_index_read(tab);			// then read null keys
6245 6246 6247
}


bk@work.mysql.com's avatar
bk@work.mysql.com committed
6248
/*****************************************************************************
6249 6250 6251
  The different end of select functions
  These functions returns < 0 when end is reached, 0 on ok and > 0 if a
  fatal error (like table corruption) was detected
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6252 6253
*****************************************************************************/

6254
/* ARGSUSED */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6255 6256 6257 6258 6259 6260 6261 6262
static int
end_send(JOIN *join, JOIN_TAB *join_tab __attribute__((unused)),
	 bool end_of_records)
{
  DBUG_ENTER("end_send");
  if (!end_of_records)
  {
    int error;
6263
    if (join->having && join->having->val_int() == 0)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6264
      DBUG_RETURN(0);				// Didn't match having
6265
    error=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6266 6267
    if (join->procedure)
      error=join->procedure->send_row(*join->fields);
6268
    else if (join->do_send_rows)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6269 6270 6271
      error=join->result->send_data(*join->fields);
    if (error)
      DBUG_RETURN(-1); /* purecov: inspected */
6272
    if (++join->send_records >= join->unit->select_limit_cnt &&
6273
	join->do_send_rows)
6274 6275 6276
    {
      if (join->select_options & OPTION_FOUND_ROWS)
      {
6277
	JOIN_TAB *jt=join->join_tab;
6278
	if ((join->tables == 1) && !join->tmp_table && !join->sort_and_group
6279
	    && !join->send_group_parts && !join->having && !jt->select_cond &&
6280
	    !(jt->select && jt->select->quick) &&
6281
	    !(jt->table->file->table_flags() & HA_NOT_EXACT_COUNT))
6282
	{
6283
	  /* Join over all rows in table;  Return number of found rows */
6284 6285
	  TABLE *table=jt->table;

6286
	  join->select_options ^= OPTION_FOUND_ROWS;
igor@hundin.mysql.fi's avatar
igor@hundin.mysql.fi committed
6287 6288
	  if (table->sort.record_pointers ||
	      (table->sort.io_cache && my_b_inited(table->sort.io_cache)))
6289 6290
	  {
	    /* Using filesort */
igor@hundin.mysql.fi's avatar
igor@hundin.mysql.fi committed
6291
	    join->send_records= table->sort.found_records;
6292 6293 6294 6295 6296 6297
	  }
	  else
	  {
	    table->file->info(HA_STATUS_VARIABLE);
	    join->send_records = table->file->records;
	  }
6298 6299 6300
	}
	else 
	{
6301
	  join->do_send_rows= 0;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
6302 6303
	  if (join->unit->fake_select_lex)
	    join->unit->fake_select_lex->select_limit= HA_POS_ERROR;
6304 6305
	  DBUG_RETURN(0);
	}
6306
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6307
      DBUG_RETURN(-3);				// Abort nicely
6308
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6309 6310 6311 6312 6313 6314 6315 6316 6317 6318 6319 6320 6321 6322 6323 6324 6325 6326 6327 6328 6329 6330 6331 6332 6333 6334 6335
  }
  else
  {
    if (join->procedure && join->procedure->end_of_records())
      DBUG_RETURN(-1);
  }
  DBUG_RETURN(0);
}


	/* ARGSUSED */
static int
end_send_group(JOIN *join, JOIN_TAB *join_tab __attribute__((unused)),
	       bool end_of_records)
{
  int idx= -1;
  DBUG_ENTER("end_send_group");

  if (!join->first_record || end_of_records ||
      (idx=test_if_group_changed(join->group_fields)) >= 0)
  {
    if (join->first_record || (end_of_records && !join->group))
    {
      if (join->procedure)
	join->procedure->end_group();
      if (idx < (int) join->send_group_parts)
      {
6336
	int error=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6337 6338
	if (join->procedure)
	{
6339
	  if (join->having && join->having->val_int() == 0)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6340
	    error= -1;				// Didn't satisfy having
6341 6342 6343 6344 6345 6346
 	  else
	  {
	    if (join->do_send_rows)
	      error=join->procedure->send_row(*join->fields) ? 1 : 0;
	    join->send_records++;
	  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6347 6348 6349 6350 6351 6352
	  if (end_of_records && join->procedure->end_of_records())
	    error= 1;				// Fatal error
	}
	else
	{
	  if (!join->first_record)
6353 6354
	  {
	    /* No matching rows for group function */
6355
	    join->clear();
6356
	  }
6357
	  if (join->having && join->having->val_int() == 0)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6358
	    error= -1;				// Didn't satisfy having
6359 6360 6361 6362 6363 6364 6365 6366 6367 6368 6369
	  else
	  {
	    if (join->do_send_rows)
	      error=join->result->send_data(*join->fields) ? 1 : 0;
	    join->send_records++;
	  }
	  if (join->rollup.state != ROLLUP::STATE_NONE && error <= 0)
	  {
	    if (join->rollup_send_data((uint) (idx+1)))
	      error= 1;
	  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6370 6371 6372
	}
	if (error > 0)
	  DBUG_RETURN(-1);			/* purecov: inspected */
6373 6374
	if (end_of_records)
	  DBUG_RETURN(0);
6375
	if (join->send_records >= join->unit->select_limit_cnt &&
6376 6377 6378 6379 6380
	    join->do_send_rows)
	{
	  if (!(join->select_options & OPTION_FOUND_ROWS))
	    DBUG_RETURN(-3);				// Abort nicely
	  join->do_send_rows=0;
6381
	  join->unit->select_limit_cnt = HA_POS_ERROR;
6382
        }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6383 6384 6385 6386 6387 6388 6389 6390 6391 6392 6393 6394
      }
    }
    else
    {
      if (end_of_records)
	DBUG_RETURN(0);
      join->first_record=1;
      VOID(test_if_group_changed(join->group_fields));
    }
    if (idx < (int) join->send_group_parts)
    {
      copy_fields(&join->tmp_table_param);
6395 6396
      if (init_sum_functions(join->sum_funcs, join->sum_funcs_end[idx+1]))
	DBUG_RETURN(-1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6397 6398 6399 6400 6401 6402 6403 6404 6405 6406 6407 6408 6409 6410 6411 6412 6413 6414 6415 6416 6417 6418 6419 6420 6421 6422 6423 6424 6425 6426
      if (join->procedure)
	join->procedure->add();
      DBUG_RETURN(0);
    }
  }
  if (update_sum_func(join->sum_funcs))
    DBUG_RETURN(-1);
  if (join->procedure)
    join->procedure->add();
  DBUG_RETURN(0);
}


	/* ARGSUSED */
static int
end_write(JOIN *join, JOIN_TAB *join_tab __attribute__((unused)),
	  bool end_of_records)
{
  TABLE *table=join->tmp_table;
  int error;
  DBUG_ENTER("end_write");

  if (join->thd->killed)			// Aborted by user
  {
    my_error(ER_SERVER_SHUTDOWN,MYF(0));	/* purecov: inspected */
    DBUG_RETURN(-2);				/* purecov: inspected */
  }
  if (!end_of_records)
  {
    copy_fields(&join->tmp_table_param);
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
6427
    copy_funcs(join->tmp_table_param.items_to_copy);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6428

6429
#ifdef TO_BE_DELETED
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6430 6431 6432 6433 6434 6435 6436 6437 6438
    if (!table->uniques)			// If not unique handling
    {
      /* Copy null values from group to row */
      ORDER   *group;
      for (group=table->group ; group ; group=group->next)
      {
	Item *item= *group->item;
	if (item->maybe_null)
	{
6439
	  Field *field=item->get_tmp_table_field();
6440
	  field->ptr[-1]= (byte) (field->is_null() ? 1 : 0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6441 6442 6443
	}
      }
    }
6444
#endif
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6445 6446
    if (!join->having || join->having->val_int())
    {
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
6447
      join->found_records++;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6448 6449
      if ((error=table->file->write_row(table->record[0])))
      {
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
6450 6451 6452
	if (error == HA_ERR_FOUND_DUPP_KEY ||
	    error == HA_ERR_FOUND_DUPP_UNIQUE)
	  goto end;
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
6453 6454
	if (create_myisam_from_heap(join->thd, table, &join->tmp_table_param,
				    error,1))
6455
	  DBUG_RETURN(-1);			// Not a table_is_full error
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
6456
	table->uniques=0;			// To ensure rows are the same
6457
      }
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
6458
      if (++join->send_records >= join->tmp_table_param.end_write_records &&
6459 6460 6461 6462 6463
	  join->do_send_rows)
      {
	if (!(join->select_options & OPTION_FOUND_ROWS))
	  DBUG_RETURN(-3);
	join->do_send_rows=0;
6464
	join->unit->select_limit_cnt = HA_POS_ERROR;
6465
	DBUG_RETURN(0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6466 6467 6468
      }
    }
  }
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
6469
end:
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6470 6471 6472 6473 6474 6475 6476 6477 6478 6479 6480 6481 6482 6483 6484 6485 6486 6487 6488 6489 6490 6491 6492
  DBUG_RETURN(0);
}

/* Group by searching after group record and updating it if possible */
/* ARGSUSED */

static int
end_update(JOIN *join, JOIN_TAB *join_tab __attribute__((unused)),
	   bool end_of_records)
{
  TABLE *table=join->tmp_table;
  ORDER   *group;
  int	  error;
  DBUG_ENTER("end_update");

  if (end_of_records)
    DBUG_RETURN(0);
  if (join->thd->killed)			// Aborted by user
  {
    my_error(ER_SERVER_SHUTDOWN,MYF(0));	/* purecov: inspected */
    DBUG_RETURN(-2);				/* purecov: inspected */
  }

monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
6493
  join->found_records++;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6494 6495 6496 6497 6498 6499
  copy_fields(&join->tmp_table_param);		// Groups are copied twice.
  /* Make a key of group index */
  for (group=table->group ; group ; group=group->next)
  {
    Item *item= *group->item;
    item->save_org_in_field(group->field);
hf@bisonxp.(none)'s avatar
hf@bisonxp.(none) committed
6500 6501 6502
#ifdef EMBEDDED_LIBRARY
    join->thd->net.last_errno= 0;
#endif
6503
    /* Store in the used key if the field was 0 */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6504
    if (item->maybe_null)
6505
      group->buff[-1]=item->null_value ? 1 : 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6506 6507 6508 6509 6510 6511
  }
  // table->file->index_init(0);
  if (!table->file->index_read(table->record[1],
			       join->tmp_table_param.group_buff,0,
			       HA_READ_KEY_EXACT))
  {						/* Update old record */
6512
    restore_record(table,record[1]);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6513 6514 6515 6516 6517 6518 6519 6520 6521 6522 6523 6524 6525 6526 6527 6528 6529 6530
    update_tmptable_sum_func(join->sum_funcs,table);
    if ((error=table->file->update_row(table->record[1],
				       table->record[0])))
    {
      table->file->print_error(error,MYF(0));	/* purecov: inspected */
      DBUG_RETURN(-1);				/* purecov: inspected */
    }
    DBUG_RETURN(0);
  }

  /* The null bits are already set */
  KEY_PART_INFO *key_part;
  for (group=table->group,key_part=table->key_info[0].key_part;
       group ;
       group=group->next,key_part++)
    memcpy(table->record[0]+key_part->offset, group->buff, key_part->length);

  init_tmptable_sum_functions(join->sum_funcs);
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
6531
  copy_funcs(join->tmp_table_param.items_to_copy);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6532 6533
  if ((error=table->file->write_row(table->record[0])))
  {
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
6534 6535
    if (create_myisam_from_heap(join->thd, table, &join->tmp_table_param,
				error, 0))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6536 6537 6538 6539 6540 6541 6542 6543 6544 6545 6546 6547 6548 6549 6550 6551 6552 6553 6554 6555 6556 6557 6558 6559 6560 6561 6562 6563 6564
      DBUG_RETURN(-1);				// Not a table_is_full error
    /* Change method to update rows */
    table->file->index_init(0);
    join->join_tab[join->tables-1].next_select=end_unique_update;
  }
  join->send_records++;
  DBUG_RETURN(0);
}

/* Like end_update, but this is done with unique constraints instead of keys */

static int
end_unique_update(JOIN *join, JOIN_TAB *join_tab __attribute__((unused)),
		  bool end_of_records)
{
  TABLE *table=join->tmp_table;
  int	  error;
  DBUG_ENTER("end_unique_update");

  if (end_of_records)
    DBUG_RETURN(0);
  if (join->thd->killed)			// Aborted by user
  {
    my_error(ER_SERVER_SHUTDOWN,MYF(0));	/* purecov: inspected */
    DBUG_RETURN(-2);				/* purecov: inspected */
  }

  init_tmptable_sum_functions(join->sum_funcs);
  copy_fields(&join->tmp_table_param);		// Groups are copied twice.
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
6565
  copy_funcs(join->tmp_table_param.items_to_copy);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6566 6567 6568 6569 6570 6571 6572 6573 6574 6575 6576 6577 6578 6579 6580

  if (!(error=table->file->write_row(table->record[0])))
    join->send_records++;			// New group
  else
  {
    if ((int) table->file->get_dup_key(error) < 0)
    {
      table->file->print_error(error,MYF(0));	/* purecov: inspected */
      DBUG_RETURN(-1);				/* purecov: inspected */
    }
    if (table->file->rnd_pos(table->record[1],table->file->dupp_ref))
    {
      table->file->print_error(error,MYF(0));	/* purecov: inspected */
      DBUG_RETURN(-1);				/* purecov: inspected */
    }
6581
    restore_record(table,record[1]);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6582 6583 6584 6585 6586 6587 6588 6589 6590 6591 6592 6593 6594 6595 6596 6597 6598 6599 6600 6601 6602 6603 6604 6605 6606 6607 6608 6609 6610 6611 6612 6613 6614 6615 6616 6617 6618
    update_tmptable_sum_func(join->sum_funcs,table);
    if ((error=table->file->update_row(table->record[1],
				       table->record[0])))
    {
      table->file->print_error(error,MYF(0));	/* purecov: inspected */
      DBUG_RETURN(-1);				/* purecov: inspected */
    }
  }
  DBUG_RETURN(0);
}


	/* ARGSUSED */
static int
end_write_group(JOIN *join, JOIN_TAB *join_tab __attribute__((unused)),
		bool end_of_records)
{
  TABLE *table=join->tmp_table;
  int	  error;
  int	  idx= -1;
  DBUG_ENTER("end_write_group");

  if (join->thd->killed)
  {						// Aborted by user
    my_error(ER_SERVER_SHUTDOWN,MYF(0));	/* purecov: inspected */
    DBUG_RETURN(-2);				/* purecov: inspected */
  }
  if (!join->first_record || end_of_records ||
      (idx=test_if_group_changed(join->group_fields)) >= 0)
  {
    if (join->first_record || (end_of_records && !join->group))
    {
      if (join->procedure)
	join->procedure->end_group();
      if (idx < (int) join->send_group_parts)
      {
	if (!join->first_record)
6619 6620
	{
	  /* No matching rows for group function */
6621
	  join->clear();
6622
	}
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6623 6624 6625 6626 6627
	copy_sum_funcs(join->sum_funcs);
	if (!join->having || join->having->val_int())
	{
	  if ((error=table->file->write_row(table->record[0])))
	  {
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
6628
	    if (create_myisam_from_heap(join->thd, table,
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
6629
					&join->tmp_table_param,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6630
					error, 0))
6631
	      DBUG_RETURN(-1);			// Not a table_is_full error
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6632 6633 6634 6635 6636 6637 6638 6639 6640 6641
	  }
	  else
	    join->send_records++;
	}
	if (end_of_records)
	  DBUG_RETURN(0);
      }
    }
    else
    {
6642 6643
      if (end_of_records)
	DBUG_RETURN(0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6644 6645 6646 6647 6648 6649
      join->first_record=1;
      VOID(test_if_group_changed(join->group_fields));
    }
    if (idx < (int) join->send_group_parts)
    {
      copy_fields(&join->tmp_table_param);
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
6650
      copy_funcs(join->tmp_table_param.items_to_copy);
6651 6652
      if (init_sum_functions(join->sum_funcs, join->sum_funcs_end[idx+1]))
	DBUG_RETURN(-1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6653 6654 6655 6656 6657 6658 6659 6660 6661 6662 6663 6664 6665 6666
      if (join->procedure)
	join->procedure->add();
      DBUG_RETURN(0);
    }
  }
  if (update_sum_func(join->sum_funcs))
    DBUG_RETURN(-1);
  if (join->procedure)
    join->procedure->add();
  DBUG_RETURN(0);
}


/*****************************************************************************
6667 6668 6669 6670 6671
  Remove calculation with tables that aren't yet read. Remove also tests
  against fields that are read through key where the table is not a
  outer join table.
  We can't remove tests that are made against columns which are stored
  in sorted order.
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6672 6673 6674 6675 6676 6677 6678
*****************************************************************************/

/* Return 1 if right_item is used removable reference key on left_item */

static bool test_if_ref(Item_field *left_item,Item *right_item)
{
  Field *field=left_item->field;
6679 6680
  // No need to change const test. We also have to keep tests on LEFT JOIN
  if (!field->table->const_table && !field->table->maybe_null)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6681 6682
  {
    Item *ref_item=part_of_refkey(field->table,field);
6683
    if (ref_item && ref_item->eq(right_item,1))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6684 6685
    {
      if (right_item->type() == Item::FIELD_ITEM)
6686 6687
	return (field->eq_def(((Item_field *) right_item)->field));
      if (right_item->const_item() && !(right_item->is_null()))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6688
      {
6689 6690 6691 6692
	/*
	  We can remove binary fields and numerical fields except float,
	  as float comparison isn't 100 % secure
	*/
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6693 6694 6695 6696 6697 6698 6699 6700 6701 6702 6703 6704 6705 6706 6707 6708 6709 6710 6711 6712 6713
	if (field->binary() &&
	    (field->type() != FIELD_TYPE_FLOAT || field->decimals() == 0))
	{
	  return !store_val_in_field(field,right_item);
	}
      }
    }
  }
  return 0;					// keep test
}


static COND *
make_cond_for_table(COND *cond,table_map tables,table_map used_table)
{
  if (used_table && !(cond->used_tables() & used_table))
    return (COND*) 0;				// Already checked
  if (cond->type() == Item::COND_ITEM)
  {
    if (((Item_cond*) cond)->functype() == Item_func::COND_AND_FUNC)
    {
6714
      /* Create new top level AND item */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6715 6716 6717 6718 6719 6720 6721 6722 6723 6724 6725 6726 6727 6728 6729 6730 6731 6732 6733 6734 6735 6736 6737 6738 6739 6740 6741 6742 6743 6744 6745 6746 6747 6748 6749 6750 6751
      Item_cond_and *new_cond=new Item_cond_and;
      if (!new_cond)
	return (COND*) 0;			// OOM /* purecov: inspected */
      List_iterator<Item> li(*((Item_cond*) cond)->argument_list());
      Item *item;
      while ((item=li++))
      {
	Item *fix=make_cond_for_table(item,tables,used_table);
	if (fix)
	  new_cond->argument_list()->push_back(fix);
      }
      switch (new_cond->argument_list()->elements) {
      case 0:
	return (COND*) 0;			// Always true
      case 1:
	return new_cond->argument_list()->head();
      default:
	new_cond->used_tables_cache=((Item_cond*) cond)->used_tables_cache &
	  tables;
	return new_cond;
      }
    }
    else
    {						// Or list
      Item_cond_or *new_cond=new Item_cond_or;
      if (!new_cond)
	return (COND*) 0;			// OOM /* purecov: inspected */
      List_iterator<Item> li(*((Item_cond*) cond)->argument_list());
      Item *item;
      while ((item=li++))
      {
	Item *fix=make_cond_for_table(item,tables,0L);
	if (!fix)
	  return (COND*) 0;			// Always true
	new_cond->argument_list()->push_back(fix);
      }
      new_cond->used_tables_cache=((Item_cond_or*) cond)->used_tables_cache;
6752
      new_cond->top_level_item();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6753 6754 6755 6756 6757
      return new_cond;
    }
  }

  /*
6758 6759 6760
    Because the following test takes a while and it can be done
    table_count times, we mark each item that we have examined with the result
    of the test
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6761 6762 6763 6764 6765 6766 6767 6768 6769 6770 6771 6772 6773 6774 6775 6776 6777 6778 6779 6780 6781 6782 6783 6784 6785 6786 6787 6788 6789 6790 6791
  */

  if (cond->marker == 3 || (cond->used_tables() & ~tables))
    return (COND*) 0;				// Can't check this yet
  if (cond->marker == 2 || cond->eq_cmp_result() == Item::COND_OK)
    return cond;				// Not boolean op

  if (((Item_func*) cond)->functype() == Item_func::EQ_FUNC)
  {
    Item *left_item=	((Item_func*) cond)->arguments()[0];
    Item *right_item= ((Item_func*) cond)->arguments()[1];
    if (left_item->type() == Item::FIELD_ITEM &&
	test_if_ref((Item_field*) left_item,right_item))
    {
      cond->marker=3;			// Checked when read
      return (COND*) 0;
    }
    if (right_item->type() == Item::FIELD_ITEM &&
	test_if_ref((Item_field*) right_item,left_item))
    {
      cond->marker=3;			// Checked when read
      return (COND*) 0;
    }
  }
  cond->marker=2;
  return cond;
}

static Item *
part_of_refkey(TABLE *table,Field *field)
{
6792 6793 6794
  if (!table->reginfo.join_tab)
    return (Item*) 0;             // field from outer non-select (UPDATE,...)

bk@work.mysql.com's avatar
bk@work.mysql.com committed
6795 6796 6797 6798 6799 6800 6801 6802
  uint ref_parts=table->reginfo.join_tab->ref.key_parts;
  if (ref_parts)
  {
    KEY_PART_INFO *key_part=
      table->key_info[table->reginfo.join_tab->ref.key].key_part;

    for (uint part=0 ; part < ref_parts ; part++,key_part++)
      if (field->eq(key_part->field) &&
6803
	  !(key_part->key_part_flag & HA_PART_KEY_SEG))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6804 6805 6806 6807 6808 6809 6810
	return table->reginfo.join_tab->ref.items[part];
  }
  return (Item*) 0;
}


/*****************************************************************************
6811 6812 6813 6814 6815
  Test if one can use the key to resolve ORDER BY
  Returns: 1 if key is ok.
	   0 if key can't be used
	  -1 if reverse key can be used
          used_key_parts is set to key parts used if length != 0
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6816 6817
*****************************************************************************/

6818 6819
static int test_if_order_by_key(ORDER *order, TABLE *table, uint idx,
				uint *used_key_parts)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6820 6821 6822 6823 6824 6825 6826 6827 6828 6829 6830 6831 6832 6833 6834 6835 6836 6837 6838 6839 6840 6841 6842 6843 6844 6845 6846 6847 6848 6849 6850
{
  KEY_PART_INFO *key_part,*key_part_end;
  key_part=table->key_info[idx].key_part;
  key_part_end=key_part+table->key_info[idx].key_parts;
  key_part_map const_key_parts=table->const_key_parts[idx];
  int reverse=0;

  for (; order ; order=order->next, const_key_parts>>=1)
  {
    Field *field=((Item_field*) (*order->item))->field;
    int flag;

    /*
      Skip key parts that are constants in the WHERE clause.
      These are already skipped in the ORDER BY by const_expression_in_where()
    */
    while (const_key_parts & 1)
    {
      key_part++; const_key_parts>>=1;
    }
    if (key_part == key_part_end || key_part->field != field)
      return 0;

    /* set flag to 1 if we can use read-next on key, else to -1 */
    flag=(order->asc == !(key_part->key_part_flag & HA_REVERSE_SORT))
      ? 1 : -1;
    if (reverse && flag != reverse)
      return 0;
    reverse=flag;				// Remember if reverse
    key_part++;
  }
6851
  *used_key_parts= (uint) (key_part - table->key_info[idx].key_part);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6852 6853 6854
  return reverse;
}

serg@serg.mylan's avatar
serg@serg.mylan committed
6855
static uint find_shortest_key(TABLE *table, const key_map *usable_keys)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6856 6857 6858
{
  uint min_length= (uint) ~0;
  uint best= MAX_KEY;
serg@serg.mylan's avatar
serg@serg.mylan committed
6859
  if (!usable_keys->is_clear_all())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6860
  {
serg@serg.mylan's avatar
serg@serg.mylan committed
6861
    for (uint nr=0; nr < table->keys ; nr++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6862
    {
serg@serg.mylan's avatar
serg@serg.mylan committed
6863
      if (usable_keys->is_set(nr))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6864
      {
6865 6866 6867 6868 6869
        if (table->key_info[nr].key_length < min_length)
        {
          min_length=table->key_info[nr].key_length;
          best=nr;
        }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6870 6871 6872 6873 6874 6875
      }
    }
  }
  return best;
}

6876 6877 6878 6879 6880 6881 6882 6883 6884 6885 6886 6887 6888 6889 6890 6891 6892 6893 6894 6895 6896 6897 6898 6899 6900 6901 6902 6903 6904 6905 6906 6907 6908 6909 6910 6911 6912 6913
/*
  SYNOPSIS
    is_subkey()
    key_part		- first key parts
    ref_key_part	- second key parts
    ref_key_part_end	- last+1 part of the second key
  DESCRIPTION
    Test if a second key is the subkey of the first one.
  NOTE
    Second key MUST be shorter than the first one.
  RETURN
    1	- is the subkey
    0	- otherwise
*/

inline bool 
is_subkey(KEY_PART_INFO *key_part, KEY_PART_INFO *ref_key_part,
	  KEY_PART_INFO *ref_key_part_end)
{
  for (; ref_key_part < ref_key_part_end; key_part++, ref_key_part++)
    if (!key_part->field->eq(ref_key_part->field))
      return 0;
  return 1;
}

/*
  SYNOPSIS
    test_if_subkey()
    ref		- number of key, used for WHERE clause
    usable_keys - keys for testing
  DESCRIPTION
    Test if we can use one of the 'usable_keys' instead of 'ref' key.
  RETURN
    MAX_KEY			- if we can't use other key
    the number of found key	- otherwise
*/

static uint
6914
test_if_subkey(ORDER *order, TABLE *table, uint ref, uint ref_key_parts,
6915
	       const key_map& usable_keys)
6916 6917 6918 6919 6920 6921 6922
{
  uint nr;
  uint min_length= (uint) ~0;
  uint best= MAX_KEY;
  uint not_used;
  KEY_PART_INFO *ref_key_part= table->key_info[ref].key_part;
  KEY_PART_INFO *ref_key_part_end= ref_key_part + ref_key_parts;
6923

serg@serg.mylan's avatar
serg@serg.mylan committed
6924
  for (nr= 0 ; nr < table->keys ; nr++)
6925
  {
6926
    if (usable_keys.is_set(nr) &&
6927 6928 6929 6930 6931 6932 6933 6934 6935 6936 6937 6938
	table->key_info[nr].key_length < min_length &&
	table->key_info[nr].key_parts >= ref_key_parts &&
	is_subkey(table->key_info[nr].key_part, ref_key_part,
		  ref_key_part_end) &&
	test_if_order_by_key(order, table, nr, &not_used))
    {
      min_length= table->key_info[nr].key_length;
      best= nr;
    }
  }
  return best;
}
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6939

6940 6941 6942 6943 6944 6945 6946 6947 6948 6949
/*
  Test if we can skip the ORDER BY by using an index.

  If we can use an index, the JOIN_TAB / tab->select struct
  is changed to use the index.

  Return:
     0 We have to use filesort to do the sorting
     1 We can use an index.
*/
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6950 6951

static bool
6952 6953
test_if_skip_sort_order(JOIN_TAB *tab,ORDER *order,ha_rows select_limit,
			bool no_changes)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6954 6955
{
  int ref_key;
6956
  uint ref_key_parts;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6957 6958 6959 6960
  TABLE *table=tab->table;
  SQL_SELECT *select=tab->select;
  key_map usable_keys;
  DBUG_ENTER("test_if_skip_sort_order");
6961
  LINT_INIT(ref_key_parts);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6962 6963

  /* Check which keys can be used to resolve ORDER BY */
6964
  usable_keys.set_all();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6965 6966 6967 6968
  for (ORDER *tmp_order=order; tmp_order ; tmp_order=tmp_order->next)
  {
    if ((*tmp_order->item)->type() != Item::FIELD_ITEM)
    {
6969
      usable_keys.clear_all();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6970 6971
      break;
    }
6972 6973
    usable_keys.intersect(
        ((Item_field*) (*tmp_order->item))->field->part_of_sortkey);
serg@serg.mylan's avatar
serg@serg.mylan committed
6974
    if (usable_keys.is_clear_all())
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
6975
      break;					// No usable keys
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6976 6977 6978
  }

  ref_key= -1;
6979 6980
  /* Test if constant range in WHERE */
  if (tab->ref.key >= 0)
6981 6982 6983
  {
    ref_key=	   tab->ref.key;
    ref_key_parts= tab->ref.key_parts;
6984 6985
    if (tab->type == JT_REF_OR_NULL)
      DBUG_RETURN(0);
6986
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6987
  else if (select && select->quick)		// Range found by opt_range
6988 6989 6990 6991
  {
    ref_key=	   select->quick->index;
    ref_key_parts= select->quick->used_key_parts;
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6992 6993 6994

  if (ref_key >= 0)
  {
6995 6996 6997
    /*
      We come here when there is a REF key.
    */
6998
    int order_direction;
6999
    uint used_key_parts;
7000
    if (!usable_keys.is_set(ref_key))
7001 7002 7003 7004
    {
      /*
	We come here when ref_key is not among usable_keys
      */
7005 7006 7007 7008 7009
      uint new_ref_key;
      /*
	If using index only read, only consider other possible index only
	keys
      */
7010 7011
      if (table->used_keys.is_set(ref_key))
	usable_keys.merge(table->used_keys);
7012 7013
      if ((new_ref_key= test_if_subkey(order, table, ref_key, ref_key_parts,
				       usable_keys)) < MAX_KEY)
7014
      {
7015
	/* Found key that can be used to retrieve data in sorted order */
7016 7017
	if (tab->ref.key >= 0)
	{
7018 7019
	  tab->ref.key= new_ref_key;
	  table->file->index_init(new_ref_key);
7020 7021 7022
	}
	else
	{
7023
	  select->quick->index= new_ref_key;
7024 7025
	  select->quick->init();
	}
7026
	ref_key= new_ref_key;
7027
      }
7028
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7029
    /* Check if we get the rows in requested sorted order by using the key */
7030
    if (usable_keys.is_set(ref_key) &&
7031 7032
	(order_direction = test_if_order_by_key(order,table,ref_key,
						&used_key_parts)))
7033
    {
7034
      if (order_direction == -1)		// If ORDER BY ... DESC
7035
      {
7036 7037
	if (select && select->quick)
	{
7038 7039 7040 7041 7042
	  /*
	    Don't reverse the sort order, if it's already done.
	    (In some cases test_if_order_by_key() can be called multiple times
	  */
	  if (!select->quick->reverse_sorted())
7043
	  {
7044 7045
            if (table->file->index_flags(ref_key) & HA_NOT_READ_PREFIX_LAST)
              DBUG_RETURN(0);			// Use filesort
7046 7047 7048 7049 7050 7051 7052 7053 7054
	    // ORDER BY range_key DESC
	    QUICK_SELECT_DESC *tmp=new QUICK_SELECT_DESC(select->quick,
							 used_key_parts);
	    if (!tmp || tmp->error)
	    {
	      delete tmp;
	      DBUG_RETURN(0);		// Reverse sort not supported
	    }
	    select->quick=tmp;
7055 7056 7057 7058 7059 7060 7061
	  }
	  DBUG_RETURN(1);
	}
	if (tab->ref.key_parts < used_key_parts)
	{
	  /*
	    SELECT * FROM t1 WHERE a=1 ORDER BY a DESC,b DESC
7062 7063 7064

	    Use a traversal function that starts by reading the last row
	    with key part (A) and then traverse the index backwards.
7065
	  */
7066
	  if (table->file->index_flags(ref_key) & HA_NOT_READ_PREFIX_LAST)
7067
	    DBUG_RETURN(0);			// Use filesort
7068 7069 7070
	  tab->read_first_record=       join_read_last_key;
	  tab->read_record.read_record= join_read_prev_same;
	  /* fall through */
7071
	}
7072
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7073
      DBUG_RETURN(1);			/* No need to sort */
7074
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7075 7076 7077 7078 7079 7080
  }
  else
  {
    /* check if we can use a key to resolve the group */
    /* Tables using JT_NEXT are handled here */
    uint nr;
7081
    key_map keys;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7082 7083 7084 7085 7086 7087 7088

    /*
      If not used with LIMIT, only use keys if the whole query can be
      resolved with a key;  This is because filesort() is usually faster than
      retrieving all rows through an index.
    */
    if (select_limit >= table->file->records)
7089
    {
serg@serg.mylan's avatar
serg@serg.mylan committed
7090
      keys=*table->file->keys_to_use_for_scanning();
7091 7092 7093 7094 7095 7096
      keys.merge(table->used_keys);
    }
    else
      keys.set_all();

    keys.intersect(usable_keys);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7097

serg@serg.mylan's avatar
serg@serg.mylan committed
7098
    for (nr=0; nr < table->keys ; nr++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7099
    {
7100
      uint not_used;
7101
      if (keys.is_set(nr))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7102 7103
      {
	int flag;
7104
	if ((flag=test_if_order_by_key(order, table, nr, &not_used)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7105
	{
7106 7107 7108
	  if (!no_changes)
	  {
	    tab->index=nr;
7109 7110
	    tab->read_first_record=  (flag > 0 ? join_read_first:
				      join_read_last);
7111 7112
	    table->file->index_init(nr);
	    tab->type=JT_NEXT;	// Read with index_first(), index_next()
7113
	    if (table->used_keys.is_set(nr))
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
7114 7115 7116 7117
	    {
	      table->key_read=1;
	      table->file->extra(HA_EXTRA_KEYREAD);
	    }
7118
	  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7119 7120 7121 7122 7123 7124 7125 7126
	  DBUG_RETURN(1);
	}
      }
    }
  }
  DBUG_RETURN(0);				// Can't use index.
}

7127

monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
7128
/*
7129
  If not selecting by given key, create an index how records should be read
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
7130 7131 7132 7133 7134 7135 7136 7137

  SYNOPSIS
   create_sort_index()
     thd		Thread handler
     tab		Table to sort (in join structure)
     order		How table should be sorted
     filesort_limit	Max number of rows that needs to be sorted
     select_limit	Max number of rows in final output
7138
		        Used to decide if we should use index or not
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
7139 7140 7141 7142 7143 7144 7145 7146 7147 7148 7149 7150 7151 7152 7153


  IMPLEMENTATION
   - If there is an index that can be used, 'tab' is modified to use
     this index.
   - If no index, create with filesort() an index file that can be used to
     retrieve rows in order (should be done with 'read_record').
     The sorted data is stored in tab->table and will be freed when calling
     free_io_cache(tab->table).

  RETURN VALUES
    0		ok
    -1		Some fatal error
    1		No records
*/
7154

bk@work.mysql.com's avatar
bk@work.mysql.com committed
7155
static int
7156
create_sort_index(THD *thd, JOIN *join, ORDER *order,
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
7157
		  ha_rows filesort_limit, ha_rows select_limit)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7158 7159 7160
{
  SORT_FIELD *sortorder;
  uint length;
7161
  ha_rows examined_rows;
7162 7163 7164
  TABLE *table;
  SQL_SELECT *select;
  JOIN_TAB *tab;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7165 7166
  DBUG_ENTER("create_sort_index");

7167 7168 7169 7170 7171 7172
  if (join->tables == join->const_tables)
    DBUG_RETURN(0);				// One row, no need to sort
  tab=    join->join_tab + join->const_tables;
  table=  tab->table;
  select= tab->select;

7173
  if (test_if_skip_sort_order(tab,order,select_limit,0))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7174 7175 7176 7177
    DBUG_RETURN(0);
  if (!(sortorder=make_unireg_sortorder(order,&length)))
    goto err;				/* purecov: inspected */
  /* It's not fatal if the following alloc fails */
igor@hundin.mysql.fi's avatar
igor@hundin.mysql.fi committed
7178 7179
  table->sort.io_cache=(IO_CACHE*) my_malloc(sizeof(IO_CACHE),
                                             MYF(MY_WME | MY_ZEROFILL));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7180 7181 7182 7183 7184 7185 7186 7187 7188 7189 7190 7191 7192 7193 7194 7195 7196 7197 7198 7199 7200
  table->status=0;				// May be wrong if quick_select

  // If table has a range, move it to select
  if (select && !select->quick && tab->ref.key >= 0)
  {
    if (tab->quick)
    {
      select->quick=tab->quick;
      tab->quick=0;
      /* We can only use 'Only index' if quick key is same as ref_key */
      if (table->key_read && (uint) tab->ref.key != select->quick->index)
      {
	table->key_read=0;
	table->file->extra(HA_EXTRA_NO_KEYREAD);
      }
    }
    else
    {
      /*
	We have a ref on a const;  Change this to a range that filesort
	can use.
7201 7202
	For impossible ranges (like when doing a lookup on NULL on a NOT NULL
	field, quick will contain an empty record set.
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7203
      */
ram@gw.mysql.r18.ru's avatar
ram@gw.mysql.r18.ru committed
7204 7205 7206
      if (!(select->quick= tab->type == JT_FT ?
			   new FT_SELECT(thd, table, tab->ref.key) :
			   get_quick_select_for_ref(thd, table, &tab->ref)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7207 7208 7209
	goto err;
    }
  }
7210 7211
  if (table->tmp_table)
    table->file->info(HA_STATUS_VARIABLE);	// Get record count
igor@hundin.mysql.fi's avatar
igor@hundin.mysql.fi committed
7212 7213 7214
  table->sort.found_records=filesort(thd, table,sortorder, length,
                                     select, filesort_limit, &examined_rows);
  tab->records=table->sort.found_records;		// For SQL_CALC_ROWS
7215
  delete select;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7216 7217 7218 7219
  tab->select=0;
  tab->select_cond=0;
  tab->type=JT_ALL;				// Read with normal read_record
  tab->read_first_record= join_init_read_record;
7220
  tab->join->examined_rows+=examined_rows;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7221 7222 7223 7224 7225
  if (table->key_read)				// Restore if we used indexes
  {
    table->key_read=0;
    table->file->extra(HA_EXTRA_NO_KEYREAD);
  }
igor@hundin.mysql.fi's avatar
igor@hundin.mysql.fi committed
7226
  DBUG_RETURN(table->sort.found_records == HA_POS_ERROR);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7227 7228 7229 7230
err:
  DBUG_RETURN(-1);
}

7231
/*
7232
  Add the HAVING criteria to table->select
7233 7234
*/

monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
7235
#ifdef NOT_YET
7236 7237 7238 7239 7240 7241
static bool fix_having(JOIN *join, Item **having)
{
  (*having)->update_used_tables();	// Some tables may have been const
  JOIN_TAB *table=&join->join_tab[join->const_tables];
  table_map used_tables= join->const_table_map | table->table->map;

monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
7242
  DBUG_EXECUTE("where",print_where(*having,"having"););
7243 7244 7245 7246 7247 7248 7249 7250 7251 7252 7253 7254 7255
  Item* sort_table_cond=make_cond_for_table(*having,used_tables,used_tables);
  if (sort_table_cond)
  {
    if (!table->select)
      if (!(table->select=new SQL_SELECT))
	return 1;
    if (!table->select->cond)
      table->select->cond=sort_table_cond;
    else					// This should never happen
      if (!(table->select->cond=new Item_cond_and(table->select->cond,
						  sort_table_cond)))
	return 1;
    table->select_cond=table->select->cond;
7256
    table->select_cond->top_level_item();
7257 7258 7259 7260 7261 7262 7263
    DBUG_EXECUTE("where",print_where(table->select_cond,
				     "select and having"););
    *having=make_cond_for_table(*having,~ (table_map) 0,~used_tables);
    DBUG_EXECUTE("where",print_where(*having,"having after make_cond"););
  }
  return 0;
}
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
7264
#endif
7265 7266


bk@work.mysql.com's avatar
bk@work.mysql.com committed
7267
/*****************************************************************************
7268 7269 7270 7271 7272
  Remove duplicates from tmp table
  This should be recoded to add a unique index to the table and remove
  duplicates
  Table is a locked single thread table
  fields is the number of fields to check (from the end)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7273 7274 7275 7276 7277 7278 7279 7280 7281 7282 7283 7284 7285 7286 7287 7288 7289 7290 7291 7292 7293 7294 7295 7296 7297 7298 7299 7300 7301 7302 7303 7304 7305 7306
*****************************************************************************/

static bool compare_record(TABLE *table, Field **ptr)
{
  for (; *ptr ; ptr++)
  {
    if ((*ptr)->cmp_offset(table->rec_buff_length))
      return 1;
  }
  return 0;
}

static bool copy_blobs(Field **ptr)
{
  for (; *ptr ; ptr++)
  {
    if ((*ptr)->flags & BLOB_FLAG)
      if (((Field_blob *) (*ptr))->copy())
	return 1;				// Error
  }
  return 0;
}

static void free_blobs(Field **ptr)
{
  for (; *ptr ; ptr++)
  {
    if ((*ptr)->flags & BLOB_FLAG)
      ((Field_blob *) (*ptr))->free();
  }
}


static int
7307
remove_duplicates(JOIN *join, TABLE *entry,List<Item> &fields, Item *having)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7308 7309 7310 7311
{
  int error;
  ulong reclength,offset;
  uint field_count;
7312
  THD *thd= join->thd;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7313 7314 7315 7316 7317 7318 7319 7320 7321
  DBUG_ENTER("remove_duplicates");

  entry->reginfo.lock_type=TL_WRITE;

  /* Calculate how many saved fields there is in list */
  field_count=0;
  List_iterator<Item> it(fields);
  Item *item;
  while ((item=it++))
7322
  {
7323
    if (item->get_tmp_table_field() && ! item->const_item())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7324
      field_count++;
7325
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7326 7327 7328

  if (!field_count)
  {						// only const items
7329
    join->unit->select_limit_cnt= 1;		// Only send first row
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7330 7331 7332 7333 7334 7335 7336 7337 7338 7339
    DBUG_RETURN(0);
  }
  Field **first_field=entry->field+entry->fields - field_count;
  offset=entry->field[entry->fields - field_count]->offset();
  reclength=entry->reclength-offset;

  free_io_cache(entry);				// Safety
  entry->file->info(HA_STATUS_VARIABLE);
  if (entry->db_type == DB_TYPE_HEAP ||
      (!entry->blob_fields &&
7340
       ((ALIGN_SIZE(reclength) + HASH_OVERHEAD) * entry->file->records <
7341
	thd->variables.sortbuff_size)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7342 7343
    error=remove_dup_with_hash_index(join->thd, entry,
				     field_count, first_field,
7344
				     reclength, having);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7345
  else
7346 7347
    error=remove_dup_with_compare(join->thd, entry, first_field, offset,
				  having);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7348 7349 7350 7351 7352 7353 7354

  free_blobs(first_field);
  DBUG_RETURN(error);
}


static int remove_dup_with_compare(THD *thd, TABLE *table, Field **first_field,
7355
				   ulong offset, Item *having)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7356 7357 7358
{
  handler *file=table->file;
  char *org_record,*new_record;
monty@donna.mysql.fi's avatar
monty@donna.mysql.fi committed
7359
  byte *record;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7360 7361 7362 7363
  int error;
  ulong reclength=table->reclength-offset;
  DBUG_ENTER("remove_dup_with_compare");

7364
  org_record=(char*) (record=table->record[0])+offset;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7365 7366 7367
  new_record=(char*) table->record[1]+offset;

  file->rnd_init();
7368
  error=file->rnd_next(record);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7369 7370 7371 7372 7373 7374 7375 7376 7377 7378 7379 7380 7381 7382 7383 7384
  for (;;)
  {
    if (thd->killed)
    {
      my_error(ER_SERVER_SHUTDOWN,MYF(0));
      error=0;
      goto err;
    }
    if (error)
    {
      if (error == HA_ERR_RECORD_DELETED)
	continue;
      if (error == HA_ERR_END_OF_FILE)
	break;
      goto err;
    }
7385 7386 7387 7388
    if (having && !having->val_int())
    {
      if ((error=file->delete_row(record)))
	goto err;
7389
      error=file->rnd_next(record);
7390 7391
      continue;
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7392 7393
    if (copy_blobs(first_field))
    {
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
7394
      my_error(ER_OUTOFMEMORY,MYF(0));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7395 7396 7397 7398 7399 7400 7401 7402 7403
      error=0;
      goto err;
    }
    memcpy(new_record,org_record,reclength);

    /* Read through rest of file and mark duplicated rows deleted */
    bool found=0;
    for (;;)
    {
7404
      if ((error=file->rnd_next(record)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7405 7406 7407 7408 7409 7410 7411 7412 7413
      {
	if (error == HA_ERR_RECORD_DELETED)
	  continue;
	if (error == HA_ERR_END_OF_FILE)
	  break;
	goto err;
      }
      if (compare_record(table, first_field) == 0)
      {
7414
	if ((error=file->delete_row(record)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7415 7416 7417 7418 7419
	  goto err;
      }
      else if (!found)
      {
	found=1;
7420
	file->position(record);	// Remember position
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7421 7422 7423 7424 7425
      }
    }
    if (!found)
      break;					// End of file
    /* Restart search on next row */
7426
    error=file->restart_rnd_next(record,file->ref);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7427 7428 7429 7430 7431 7432 7433 7434 7435 7436 7437 7438 7439 7440 7441 7442 7443 7444 7445 7446
  }

  file->extra(HA_EXTRA_NO_CACHE);
  DBUG_RETURN(0);
err:
  file->extra(HA_EXTRA_NO_CACHE);
  if (error)
    file->print_error(error,MYF(0));
  DBUG_RETURN(1);
}


/*
  Generate a hash index for each row to quickly find duplicate rows
  Note that this will not work on tables with blobs!
*/

static int remove_dup_with_hash_index(THD *thd, TABLE *table,
				      uint field_count,
				      Field **first_field,
7447 7448
				      ulong key_length,
				      Item *having)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7449 7450 7451 7452 7453 7454 7455 7456 7457 7458 7459 7460 7461 7462 7463 7464 7465
{
  byte *key_buffer, *key_pos, *record=table->record[0];
  int error;
  handler *file=table->file;
  ulong extra_length=ALIGN_SIZE(key_length)-key_length;
  uint *field_lengths,*field_length;
  HASH hash;
  DBUG_ENTER("remove_dup_with_hash_index");

  if (!my_multi_malloc(MYF(MY_WME),
		       &key_buffer,
		       (uint) ((key_length + extra_length) *
			       (long) file->records),
		       &field_lengths,
		       (uint) (field_count*sizeof(*field_lengths)),
		       NullS))
    DBUG_RETURN(1);
7466

bar@bar.mysql.r18.ru's avatar
bar@bar.mysql.r18.ru committed
7467
  if (hash_init(&hash, &my_charset_bin, (uint) file->records, 0, 
7468
		key_length,(hash_get_key) 0, 0, 0))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7469 7470 7471 7472 7473 7474 7475 7476 7477 7478 7479 7480 7481 7482 7483 7484 7485 7486 7487 7488 7489 7490 7491 7492 7493 7494 7495 7496
  {
    my_free((char*) key_buffer,MYF(0));
    DBUG_RETURN(1);
  }
  {
    Field **ptr;
    for (ptr= first_field, field_length=field_lengths ; *ptr ; ptr++)
      (*field_length++)= (*ptr)->pack_length();
  }

  file->rnd_init();
  key_pos=key_buffer;
  for (;;)
  {
    if (thd->killed)
    {
      my_error(ER_SERVER_SHUTDOWN,MYF(0));
      error=0;
      goto err;
    }
    if ((error=file->rnd_next(record)))
    {
      if (error == HA_ERR_RECORD_DELETED)
	continue;
      if (error == HA_ERR_END_OF_FILE)
	break;
      goto err;
    }
7497 7498 7499 7500 7501
    if (having && !having->val_int())
    {
      if ((error=file->delete_row(record)))
	goto err;
      continue;
7502
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7503 7504 7505 7506 7507 7508 7509 7510 7511 7512 7513 7514 7515 7516 7517

    /* copy fields to key buffer */
    field_length=field_lengths;
    for (Field **ptr= first_field ; *ptr ; ptr++)
    {
      (*ptr)->sort_string((char*) key_pos,*field_length);
      key_pos+= *field_length++;
    }
    /* Check if it exists before */
    if (hash_search(&hash,key_pos-key_length,key_length))
    {
      /* Duplicated found ; Remove the row */
      if ((error=file->delete_row(record)))
	goto err;
    }
7518
    else
hf@deer.(none)'s avatar
SCRUM  
hf@deer.(none) committed
7519
      (void) my_hash_insert(&hash, key_pos-key_length);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7520 7521 7522 7523 7524 7525 7526 7527 7528 7529 7530 7531 7532 7533 7534 7535 7536 7537 7538
    key_pos+=extra_length;
  }
  my_free((char*) key_buffer,MYF(0));
  hash_free(&hash);
  file->extra(HA_EXTRA_NO_CACHE);
  (void) file->rnd_end();
  DBUG_RETURN(0);

err:
  my_free((char*) key_buffer,MYF(0));
  hash_free(&hash);
  file->extra(HA_EXTRA_NO_CACHE);
  (void) file->rnd_end();
  if (error)
    file->print_error(error,MYF(0));
  DBUG_RETURN(1);
}


7539
SORT_FIELD *make_unireg_sortorder(ORDER *order, uint *length)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7540 7541 7542 7543 7544 7545 7546 7547 7548 7549 7550 7551 7552 7553 7554 7555 7556 7557 7558
{
  uint count;
  SORT_FIELD *sort,*pos;
  DBUG_ENTER("make_unireg_sortorder");

  count=0;
  for (ORDER *tmp = order; tmp; tmp=tmp->next)
    count++;
  pos=sort=(SORT_FIELD*) sql_alloc(sizeof(SORT_FIELD)*(count+1));
  if (!pos)
    return 0;

  for (;order;order=order->next,pos++)
  {
    pos->field=0; pos->item=0;
    if (order->item[0]->type() == Item::FIELD_ITEM)
      pos->field= ((Item_field*) (*order->item))->field;
    else if (order->item[0]->type() == Item::SUM_FUNC_ITEM &&
	     !order->item[0]->const_item())
7559
      pos->field= ((Item_sum*) order->item[0])->get_tmp_table_field();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7560 7561 7562 7563 7564 7565 7566 7567 7568 7569 7570 7571 7572 7573
    else if (order->item[0]->type() == Item::COPY_STR_ITEM)
    {						// Blob patch
      pos->item= ((Item_copy_string*) (*order->item))->item;
    }
    else
      pos->item= *order->item;
    pos->reverse=! order->asc;
  }
  *length=count;
  DBUG_RETURN(sort);
}


/*****************************************************************************
7574 7575 7576 7577
  Fill join cache with packed records
  Records are stored in tab->cache.buffer and last record in
  last record is stored with pointers to blobs to support very big
  records
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7578 7579 7580 7581 7582 7583 7584 7585 7586
******************************************************************************/

static int
join_init_cache(THD *thd,JOIN_TAB *tables,uint table_count)
{
  reg1 uint i;
  uint length,blobs,size;
  CACHE_FIELD *copy,**blob_ptr;
  JOIN_CACHE  *cache;
7587
  JOIN_TAB *join_tab;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7588 7589 7590 7591 7592
  DBUG_ENTER("join_init_cache");

  cache= &tables[table_count].cache;
  cache->fields=blobs=0;

7593 7594
  join_tab=tables;
  for (i=0 ; i < table_count ; i++,join_tab++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7595
  {
7596 7597 7598 7599
    if (!join_tab->used_fieldlength)		/* Not calced yet */
      calc_used_field_length(thd, join_tab);
    cache->fields+=join_tab->used_fields;
    blobs+=join_tab->used_blobs;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7600 7601 7602 7603 7604 7605 7606 7607 7608 7609 7610 7611 7612 7613 7614 7615 7616 7617 7618 7619 7620 7621 7622 7623 7624 7625 7626 7627 7628 7629 7630 7631 7632 7633 7634 7635 7636 7637 7638
  }
  if (!(cache->field=(CACHE_FIELD*)
	sql_alloc(sizeof(CACHE_FIELD)*(cache->fields+table_count*2)+(blobs+1)*
		  sizeof(CACHE_FIELD*))))
  {
    my_free((gptr) cache->buff,MYF(0));		/* purecov: inspected */
    cache->buff=0;				/* purecov: inspected */
    DBUG_RETURN(1);				/* purecov: inspected */
  }
  copy=cache->field;
  blob_ptr=cache->blob_ptr=(CACHE_FIELD**)
    (cache->field+cache->fields+table_count*2);

  length=0;
  for (i=0 ; i < table_count ; i++)
  {
    uint null_fields=0,used_fields;

    Field **f_ptr,*field;
    for (f_ptr=tables[i].table->field,used_fields=tables[i].used_fields ;
	 used_fields ;
	 f_ptr++)
    {
      field= *f_ptr;
      if (field->query_id == thd->query_id)
      {
	used_fields--;
	length+=field->fill_cache_field(copy);
	if (copy->blob_field)
	  (*blob_ptr++)=copy;
	if (field->maybe_null())
	  null_fields++;
	copy++;
      }
    }
    /* Copy null bits from table */
    if (null_fields && tables[i].table->null_fields)
    {						/* must copy null bits */
      copy->str=(char*) tables[i].table->null_flags;
7639
      copy->length=tables[i].table->null_bytes;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7640 7641 7642 7643 7644 7645 7646 7647 7648 7649 7650 7651 7652 7653 7654 7655 7656 7657 7658 7659 7660 7661 7662
      copy->strip=0;
      copy->blob_field=0;
      length+=copy->length;
      copy++;
      cache->fields++;
    }
    /* If outer join table, copy null_row flag */
    if (tables[i].table->maybe_null)
    {
      copy->str= (char*) &tables[i].table->null_row;
      copy->length=sizeof(tables[i].table->null_row);
      copy->strip=0;
      copy->blob_field=0;
      length+=copy->length;
      copy++;
      cache->fields++;
    }
  }

  cache->records=0; cache->ptr_record= (uint) ~0;
  cache->length=length+blobs*sizeof(char*);
  cache->blobs=blobs;
  *blob_ptr=0;					/* End sequentel */
7663
  size=max(thd->variables.join_buff_size, cache->length);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7664 7665 7666 7667 7668 7669 7670 7671 7672 7673 7674 7675 7676 7677 7678 7679 7680 7681 7682 7683 7684 7685 7686 7687 7688 7689 7690 7691 7692 7693 7694 7695 7696 7697 7698 7699 7700 7701 7702 7703
  if (!(cache->buff=(uchar*) my_malloc(size,MYF(0))))
    DBUG_RETURN(1);				/* Don't use cache */ /* purecov: inspected */
  cache->end=cache->buff+size;
  reset_cache(cache);
  DBUG_RETURN(0);
}


static ulong
used_blob_length(CACHE_FIELD **ptr)
{
  uint length,blob_length;
  for (length=0 ; *ptr ; ptr++)
  {
    (*ptr)->blob_length=blob_length=(*ptr)->blob_field->get_length();
    length+=blob_length;
    (*ptr)->blob_field->get_ptr(&(*ptr)->str);
  }
  return length;
}


static bool
store_record_in_cache(JOIN_CACHE *cache)
{
  ulong length;
  uchar *pos;
  CACHE_FIELD *copy,*end_field;
  bool last_record;

  pos=cache->pos;
  end_field=cache->field+cache->fields;

  length=cache->length;
  if (cache->blobs)
    length+=used_blob_length(cache->blob_ptr);
  if ((last_record=(length+cache->length > (uint) (cache->end - pos))))
    cache->ptr_record=cache->records;

  /*
7704
    There is room in cache. Put record there
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7705 7706 7707 7708 7709 7710 7711 7712
  */
  cache->records++;
  for (copy=cache->field ; copy < end_field; copy++)
  {
    if (copy->blob_field)
    {
      if (last_record)
      {
7713 7714
	copy->blob_field->get_image((char*) pos,copy->length+sizeof(char*), 
				    copy->blob_field->charset());
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7715 7716 7717 7718
	pos+=copy->length+sizeof(char*);
      }
      else
      {
7719 7720
	copy->blob_field->get_image((char*) pos,copy->length, // blob length
				    copy->blob_field->charset());
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7721 7722 7723 7724 7725 7726 7727 7728 7729 7730 7731 7732 7733 7734 7735 7736 7737 7738 7739 7740 7741 7742 7743 7744 7745 7746 7747 7748 7749 7750 7751 7752 7753 7754 7755 7756 7757 7758 7759 7760 7761 7762 7763 7764 7765 7766 7767 7768 7769 7770 7771 7772 7773 7774 7775 7776
	memcpy(pos+copy->length,copy->str,copy->blob_length);  // Blob data
	pos+=copy->length+copy->blob_length;
      }
    }
    else
    {
      if (copy->strip)
      {
	char *str,*end;
	for (str=copy->str,end= str+copy->length;
	     end > str && end[-1] == ' ' ;
	     end--) ;
	length=(uint) (end-str);
	memcpy(pos+1,str,length);
	*pos=(uchar) length;
	pos+=length+1;
      }
      else
      {
	memcpy(pos,copy->str,copy->length);
	pos+=copy->length;
      }
    }
  }
  cache->pos=pos;
  return last_record || (uint) (cache->end -pos) < cache->length;
}


static void
reset_cache(JOIN_CACHE *cache)
{
  cache->record_nr=0;
  cache->pos=cache->buff;
}


static void
read_cached_record(JOIN_TAB *tab)
{
  uchar *pos;
  uint length;
  bool last_record;
  CACHE_FIELD *copy,*end_field;

  last_record=tab->cache.record_nr++ == tab->cache.ptr_record;
  pos=tab->cache.pos;

  for (copy=tab->cache.field,end_field=copy+tab->cache.fields ;
       copy < end_field;
       copy++)
  {
    if (copy->blob_field)
    {
      if (last_record)
      {
7777 7778
	copy->blob_field->set_image((char*) pos,copy->length+sizeof(char*),
				    copy->blob_field->charset());
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7779 7780 7781 7782 7783 7784 7785 7786 7787 7788 7789 7790 7791 7792 7793 7794 7795 7796 7797 7798 7799 7800 7801 7802 7803 7804 7805 7806 7807 7808 7809 7810 7811 7812 7813 7814 7815 7816 7817 7818 7819 7820 7821 7822 7823 7824 7825 7826 7827 7828 7829 7830 7831 7832
	pos+=copy->length+sizeof(char*);
      }
      else
      {
	copy->blob_field->set_ptr((char*) pos,(char*) pos+copy->length);
	pos+=copy->length+copy->blob_field->get_length();
      }
    }
    else
    {
      if (copy->strip)
      {
	memcpy(copy->str,pos+1,length=(uint) *pos);
	memset(copy->str+length,' ',copy->length-length);
	pos+=1+length;
      }
      else
      {
	memcpy(copy->str,pos,copy->length);
	pos+=copy->length;
      }
    }
  }
  tab->cache.pos=pos;
  return;
}


static bool
cmp_buffer_with_ref(JOIN_TAB *tab)
{
  bool diff;
  if (!(diff=tab->ref.key_err))
  {
    memcpy(tab->ref.key_buff2, tab->ref.key_buff, tab->ref.key_length);
  }
  if ((tab->ref.key_err=cp_buffer_from_ref(&tab->ref)) || diff)
    return 1;
  return memcmp(tab->ref.key_buff2, tab->ref.key_buff, tab->ref.key_length)
    != 0;
}


bool
cp_buffer_from_ref(TABLE_REF *ref)
{
  for (store_key **copy=ref->key_copy ; *copy ; copy++)
    if ((*copy)->copy())
      return 1;					// Something went wrong
  return 0;
}


/*****************************************************************************
7833
  Group and order functions
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7834 7835 7836
*****************************************************************************/

/*
7837 7838 7839
  Find order/group item in requested columns and change the item to point at
  it. If item doesn't exists, add it first in the field list
  Return 0 if ok.
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7840 7841 7842
*/

static int
7843 7844
find_order_in_list(THD *thd, Item **ref_pointer_array,
		   TABLE_LIST *tables,ORDER *order, List<Item> &fields,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7845 7846
		   List<Item> &all_fields)
{
7847 7848
  Item *itemptr=*order->item;
  if (itemptr->type() == Item::INT_ITEM)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7849
  {						/* Order by position */
7850
    uint count= (uint) ((Item_int*)itemptr)->value;
7851
    if (!count || count > fields.elements)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7852 7853
    {
      my_printf_error(ER_BAD_FIELD_ERROR,ER(ER_BAD_FIELD_ERROR),
7854
		      MYF(0),itemptr->full_name(),
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7855 7856 7857
	       thd->where);
      return 1;
    }
7858 7859
    order->item= ref_pointer_array + count-1;
    order->in_field_list= 1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7860 7861
    return 0;
  }
7862
  uint counter;
7863
  Item **item= find_item_in_list(itemptr, fields, &counter, IGNORE_ERRORS);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7864 7865
  if (item)
  {
7866
    order->item= ref_pointer_array + counter;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7867 7868 7869 7870
    order->in_field_list=1;
    return 0;
  }
  order->in_field_list=0;
7871
  Item *it= *order->item;
7872 7873
  if (it->fix_fields(thd, tables, order->item) ||
      //'it' ressigned because fix_field can change it
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
7874
      (it= *order->item)->check_cols(1) ||
7875
      thd->is_fatal_error)
7876
    return 1;					// Wrong field 
7877 7878 7879 7880
  uint el= all_fields.elements;
  all_fields.push_front(it);		        // Add new field to field list
  ref_pointer_array[el]= it;
  order->item= ref_pointer_array + el;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7881 7882 7883 7884
  return 0;
}

/*
7885 7886
  Change order to point at item in select list. If item isn't a number
  and doesn't exits in the select list, add it the the field list.
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7887 7888
*/

7889 7890
int setup_order(THD *thd, Item **ref_pointer_array, TABLE_LIST *tables,
		List<Item> &fields, List<Item> &all_fields, ORDER *order)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7891 7892 7893 7894
{
  thd->where="order clause";
  for (; order; order=order->next)
  {
7895 7896
    if (find_order_in_list(thd, ref_pointer_array, tables, order, fields,
			   all_fields))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7897 7898 7899 7900 7901 7902
      return 1;
  }
  return 0;
}


7903
int
7904 7905 7906
setup_group(THD *thd, Item **ref_pointer_array, TABLE_LIST *tables,
	    List<Item> &fields, List<Item> &all_fields, ORDER *order,
	    bool *hidden_group_fields)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7907 7908 7909 7910 7911
{
  *hidden_group_fields=0;
  if (!order)
    return 0;				/* Everything is ok */

7912
  if (thd->variables.sql_mode & MODE_ONLY_FULL_GROUP_BY)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7913 7914 7915 7916 7917 7918 7919 7920 7921
  {
    Item *item;
    List_iterator<Item> li(fields);
    while ((item=li++))
      item->marker=0;			/* Marker that field is not used */
  }
  uint org_fields=all_fields.elements;

  thd->where="group statement";
7922
  for (; order; order=order->next)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7923
  {
7924 7925
    if (find_order_in_list(thd, ref_pointer_array, tables, order, fields,
			   all_fields))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7926 7927 7928 7929 7930 7931 7932 7933 7934
      return 1;
    (*order->item)->marker=1;		/* Mark found */
    if ((*order->item)->with_sum_func)
    {
      my_printf_error(ER_WRONG_GROUP_FIELD, ER(ER_WRONG_GROUP_FIELD),MYF(0),
		      (*order->item)->full_name());
      return 1;
    }
  }
7935
  if (thd->variables.sql_mode & MODE_ONLY_FULL_GROUP_BY)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7936 7937 7938 7939 7940 7941 7942
  {
    /* Don't allow one to use fields that is not used in GROUP BY */
    Item *item;
    List_iterator<Item> li(fields);

    while ((item=li++))
    {
7943 7944
      if (item->type() != Item::SUM_FUNC_ITEM && !item->marker &&
	  !item->const_item())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7945 7946 7947 7948 7949 7950 7951 7952 7953 7954 7955 7956 7957 7958
      {
	my_printf_error(ER_WRONG_FIELD_WITH_GROUP,
			ER(ER_WRONG_FIELD_WITH_GROUP),
			MYF(0),item->full_name());
	return 1;
      }
    }
  }
  if (org_fields != all_fields.elements)
    *hidden_group_fields=1;			// group fields is not used
  return 0;
}

/*
7959
  Add fields with aren't used at start of field list. Return FALSE if ok
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7960 7961 7962 7963 7964 7965 7966 7967 7968 7969
*/

static bool
setup_new_fields(THD *thd,TABLE_LIST *tables,List<Item> &fields,
		 List<Item> &all_fields, ORDER *new_field)
{
  Item	  **item;
  DBUG_ENTER("setup_new_fields");

  thd->set_query_id=1;				// Not really needed, but...
7970
  uint counter;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
7971
  for (; new_field ; new_field= new_field->next)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7972
  {
7973 7974
    if ((item= find_item_in_list(*new_field->item, fields, &counter,
				 IGNORE_ERRORS)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7975 7976 7977 7978
      new_field->item=item;			/* Change to shared Item */
    else
    {
      thd->where="procedure list";
7979
      if ((*new_field->item)->fix_fields(thd, tables, new_field->item))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7980 7981 7982 7983 7984 7985 7986 7987 7988
	DBUG_RETURN(1); /* purecov: inspected */
      all_fields.push_front(*new_field->item);
      new_field->item=all_fields.head_ref();
    }
  }
  DBUG_RETURN(0);
}

/*
7989 7990 7991
  Create a group by that consist of all non const fields. Try to use
  the fields in the order given by 'order' to allow one to optimize
  away 'order by'.
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7992 7993 7994
*/

static ORDER *
7995 7996
create_distinct_group(THD *thd, ORDER *order_list, List<Item> &fields, 
		      bool *all_order_by_fields_used)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7997 7998 7999 8000 8001
{
  List_iterator<Item> li(fields);
  Item *item;
  ORDER *order,*group,**prev;

8002
  *all_order_by_fields_used= 1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8003 8004 8005 8006 8007 8008 8009 8010
  while ((item=li++))
    item->marker=0;			/* Marker that field is not used */

  prev= &group;  group=0;
  for (order=order_list ; order; order=order->next)
  {
    if (order->in_field_list)
    {
8011
      ORDER *ord=(ORDER*) thd->memdup((char*) order,sizeof(ORDER));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8012 8013 8014 8015 8016 8017
      if (!ord)
	return 0;
      *prev=ord;
      prev= &ord->next;
      (*ord->item)->marker=1;
    }
8018 8019
    else
      *all_order_by_fields_used= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8020 8021 8022 8023 8024 8025 8026 8027 8028
  }

  li.rewind();
  while ((item=li++))
  {
    if (item->const_item() || item->with_sum_func)
      continue;
    if (!item->marker)
    {
8029
      ORDER *ord=(ORDER*) thd->calloc(sizeof(ORDER));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8030 8031 8032 8033 8034 8035 8036 8037 8038 8039 8040 8041 8042 8043
      if (!ord)
	return 0;
      ord->item=li.ref();
      ord->asc=1;
      *prev=ord;
      prev= &ord->next;
    }
  }
  *prev=0;
  return group;
}


/*****************************************************************************
8044
  Update join with count of the different type of fields
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8045 8046 8047
*****************************************************************************/

void
8048 8049
count_field_types(TMP_TABLE_PARAM *param, List<Item> &fields,
		  bool reset_with_sum_func)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8050 8051 8052 8053
{
  List_iterator<Item> li(fields);
  Item *field;

8054
  param->field_count=param->sum_func_count=param->func_count=
8055
    param->hidden_field_count=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8056 8057 8058 8059 8060 8061 8062 8063 8064 8065 8066 8067 8068 8069 8070 8071 8072 8073 8074 8075 8076 8077 8078 8079 8080
  param->quick_group=1;
  while ((field=li++))
  {
    Item::Type type=field->type();
    if (type == Item::FIELD_ITEM)
      param->field_count++;
    else if (type == Item::SUM_FUNC_ITEM)
    {
      if (! field->const_item())
      {
	Item_sum *sum_item=(Item_sum*) field;
	if (!sum_item->quick_group)
	  param->quick_group=0;			// UDF SUM function
	param->sum_func_count++;

	for (uint i=0 ; i < sum_item->arg_count ; i++)
	{
	  if (sum_item->args[0]->type() == Item::FIELD_ITEM)
	    param->field_count++;
	  else
	    param->func_count++;
	}
      }
    }
    else
8081
    {
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8082
      param->func_count++;
8083 8084 8085
      if (reset_with_sum_func)
	field->with_sum_func=0;
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8086 8087 8088 8089 8090 8091 8092 8093 8094 8095 8096 8097 8098 8099 8100
  }
}


/*
  Return 1 if second is a subpart of first argument
  If first parts has different direction, change it to second part
  (group is sorted like order)
*/

static bool
test_if_subpart(ORDER *a,ORDER *b)
{
  for (; a && b; a=a->next,b=b->next)
  {
8101
    if ((*a->item)->eq(*b->item,1))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8102 8103 8104 8105 8106 8107 8108 8109 8110 8111 8112 8113 8114 8115 8116 8117 8118 8119 8120 8121 8122 8123 8124 8125 8126 8127
      a->asc=b->asc;
    else
      return 0;
  }
  return test(!b);
}

/*
  Return table number if there is only one table in sort order
  and group and order is compatible
  else return 0;
*/

static TABLE *
get_sort_by_table(ORDER *a,ORDER *b,TABLE_LIST *tables)
{
  table_map map= (table_map) 0;
  DBUG_ENTER("get_sort_by_table");

  if (!a)
    a=b;					// Only one need to be given
  else if (!b)
    b=a;

  for (; a && b; a=a->next,b=b->next)
  {
8128
    if (!(*a->item)->eq(*b->item,1))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8129 8130 8131
      DBUG_RETURN(0);
    map|=a->item[0]->used_tables();
  }
8132
  if (!map || (map & (RAND_TABLE_BIT | OUTER_REF_TABLE_BIT)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8133 8134
    DBUG_RETURN(0);

8135
  for (; !(map & tables->table->map) ; tables=tables->next) ;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8136 8137 8138 8139 8140 8141 8142 8143 8144 8145 8146 8147
  if (map != tables->table->map)
    DBUG_RETURN(0);				// More than one table
  DBUG_PRINT("exit",("sort by table: %d",tables->table->tablenr));
  DBUG_RETURN(tables->table);
}


	/* calc how big buffer we need for comparing group entries */

static void
calc_group_buffer(JOIN *join,ORDER *group)
{
8148 8149
  uint key_length=0, parts=0, null_parts=0;

bk@work.mysql.com's avatar
bk@work.mysql.com committed
8150 8151 8152 8153
  if (group)
    join->group= 1;
  for (; group ; group=group->next)
  {
8154
    Field *field=(*group->item)->get_tmp_table_field();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8155 8156 8157 8158 8159 8160 8161 8162 8163 8164 8165 8166 8167 8168 8169
    if (field)
    {
      if (field->type() == FIELD_TYPE_BLOB)
	key_length+=MAX_BLOB_WIDTH;		// Can't be used as a key
      else
	key_length+=field->pack_length();
    }
    else if ((*group->item)->result_type() == REAL_RESULT)
      key_length+=sizeof(double);
    else if ((*group->item)->result_type() == INT_RESULT)
      key_length+=sizeof(longlong);
    else
      key_length+=(*group->item)->max_length;
    parts++;
    if ((*group->item)->maybe_null)
8170
      null_parts++;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8171
  }
8172
  join->tmp_table_param.group_length=key_length+null_parts;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8173
  join->tmp_table_param.group_parts=parts;
8174
  join->tmp_table_param.group_null_parts=null_parts;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8175 8176
}

8177 8178 8179 8180 8181 8182 8183 8184 8185 8186 8187 8188 8189 8190 8191 8192 8193 8194 8195 8196 8197 8198 8199 8200 8201 8202 8203 8204 8205 8206 8207
/*
  alloc group fields or take prepared (chached)

  SYNOPSYS
    make_group_fields()
    main_join - join of current select
    curr_join - current join (join of current select or temporary copy of it)

  RETURN
    0 - ok
    1 - failed
*/

static bool
make_group_fields(JOIN *main_join, JOIN *curr_join)
{
    if (main_join->group_fields_cache.elements)
    {
      curr_join->group_fields= main_join->group_fields_cache;
      curr_join->sort_and_group= 1;
    }
    else
    {
      if (alloc_group_fields(curr_join, curr_join->group_list))
      {
	return (1);
      }
      main_join->group_fields_cache= curr_join->group_fields;
    }
    return (0);
}
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8208 8209

/*
8210 8211
  Get a list of buffers for saveing last group
  Groups are saved in reverse order for easyer check loop
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8212 8213 8214 8215 8216 8217 8218 8219 8220 8221 8222 8223 8224 8225 8226 8227 8228 8229 8230 8231 8232 8233
*/

static bool
alloc_group_fields(JOIN *join,ORDER *group)
{
  if (group)
  {
    for (; group ; group=group->next)
    {
      Item_buff *tmp=new_Item_buff(*group->item);
      if (!tmp || join->group_fields.push_front(tmp))
	return TRUE;
    }
  }
  join->sort_and_group=1;			/* Mark for do_select */
  return FALSE;
}


static int
test_if_group_changed(List<Item_buff> &list)
{
8234
  DBUG_ENTER("test_if_group_changed");
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8235 8236 8237 8238 8239 8240 8241 8242 8243
  List_iterator<Item_buff> li(list);
  int idx= -1,i;
  Item_buff *buff;

  for (i=(int) list.elements-1 ; (buff=li++) ; i--)
  {
    if (buff->cmp())
      idx=i;
  }
8244 8245
  DBUG_PRINT("info", ("idx: %d", idx));
  DBUG_RETURN(idx);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8246 8247 8248 8249 8250
}



/*
8251
  Setup copy_fields to save fields at start of new group
8252 8253 8254 8255 8256 8257 8258 8259 8260 8261 8262 8263 8264 8265 8266 8267 8268 8269 8270

  setup_copy_fields()
    thd - THD pointer
    param - temporary table parameters
    ref_pointer_array - array of pointers to top elements of filed list
    res_selected_fields - new list of items of select item list
    res_all_fields - new list of all items
    elements - number of elements in select item list
    all_fields - all fields list

  DESCRIPTION
    Setup copy_fields to save fields at start of new group
    Only FIELD_ITEM:s and FUNC_ITEM:s needs to be saved between groups.
    Change old item_field to use a new field with points at saved fieldvalue
    This function is only called before use of send_fields
  
  RETURN
    0 - ok
    !=0 - error
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8271 8272 8273
*/

bool
8274 8275
setup_copy_fields(THD *thd, TMP_TABLE_PARAM *param,
		  Item **ref_pointer_array,
8276 8277
		  List<Item> &res_selected_fields, List<Item> &res_all_fields,
		  uint elements, List<Item> &all_fields)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8278 8279
{
  Item *pos;
8280
  List_iterator_fast<Item> li(all_fields);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8281 8282
  Copy_field *copy;
  DBUG_ENTER("setup_copy_fields");
8283 8284 8285
  res_selected_fields.empty();
  res_all_fields.empty();
  List_iterator_fast<Item> itr(res_all_fields);
8286

8287
  uint i, border= all_fields.elements - elements;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8288 8289

  if (!(copy=param->copy_field= new Copy_field[param->field_count]))
8290
    goto err2;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8291 8292

  param->copy_funcs.empty();
8293
  for (i= 0; (pos= li++); i++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8294 8295 8296
  {
    if (pos->type() == Item::FIELD_ITEM)
    {
8297
      Item_field *item;
8298
      if (!(item= new Item_field(thd, ((Item_field*) pos))))
8299 8300
	goto err;
      pos= item;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8301 8302
      if (item->field->flags & BLOB_FLAG)
      {
8303
	if (!(pos= new Item_copy_string(pos)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8304 8305 8306 8307
	  goto err;
	if (param->copy_funcs.push_back(pos))
	  goto err;
      }
8308 8309 8310 8311 8312 8313 8314 8315 8316 8317 8318 8319 8320 8321 8322
      else
      {
	/* 
	   set up save buffer and change result_field to point at 
	   saved value
	*/
	Field *field= item->field;
	item->result_field=field->new_field(&thd->mem_root,field->table);
	char *tmp=(char*) sql_alloc(field->pack_length()+1);
	if (!tmp)
	  goto err;
	copy->set(tmp, item->result_field);
	item->result_field->move_field(copy->to_ptr,copy->to_null_ptr,1);
	copy++;
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8323 8324 8325 8326 8327 8328 8329 8330 8331 8332 8333 8334 8335 8336 8337 8338
    }
    else if ((pos->type() == Item::FUNC_ITEM ||
	      pos->type() == Item::COND_ITEM) &&
	     !pos->with_sum_func)
    {						// Save for send fields
      /* TODO:
	 In most cases this result will be sent to the user.
	 This should be changed to use copy_int or copy_real depending
	 on how the value is to be used: In some cases this may be an
	 argument in a group function, like: IF(ISNULL(col),0,COUNT(*))
      */
      if (!(pos=new Item_copy_string(pos)))
	goto err;
      if (param->copy_funcs.push_back(pos))
	goto err;
    }
8339 8340
    res_all_fields.push_back(pos);
    ref_pointer_array[((i < border)? all_fields.elements-i-1 : i-border)]=
8341
      pos;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8342
  }
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
8343
  param->copy_field_end= copy;
8344 8345 8346

  for (i= 0; i < border; i++)
    itr++;
8347
  itr.sublist(res_selected_fields, elements);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8348 8349 8350
  DBUG_RETURN(0);

 err:
8351
  delete [] param->copy_field;			// This is never 0
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8352
  param->copy_field=0;
8353
err2:
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8354 8355 8356 8357 8358
  DBUG_RETURN(TRUE);
}


/*
8359 8360 8361 8362
  Make a copy of all simple SELECT'ed items

  This is done at the start of a new group so that we can retrieve
  these later when the group changes.
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8363 8364 8365 8366 8367 8368
*/

void
copy_fields(TMP_TABLE_PARAM *param)
{
  Copy_field *ptr=param->copy_field;
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
8369
  Copy_field *end=param->copy_field_end;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8370

8371
  for (; ptr != end; ptr++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8372 8373
    (*ptr->do_copy)(ptr);

monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
8374 8375
  List_iterator_fast<Item> &it=param->copy_funcs_it;
  it.rewind();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8376 8377 8378 8379 8380 8381
  Item_copy_string *item;
  while ((item = (Item_copy_string*) it++))
    item->copy();
}


8382 8383
/*
  Make an array of pointers to sum_functions to speed up sum_func calculation
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8384

8385 8386 8387 8388 8389 8390 8391 8392 8393
  SYNOPSIS
    alloc_func_list()

  RETURN
    0	ok
    1	Error
*/

bool JOIN::alloc_func_list()
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8394
{
8395 8396 8397 8398 8399 8400 8401 8402 8403 8404 8405 8406 8407 8408 8409 8410 8411 8412 8413 8414 8415 8416 8417 8418 8419 8420 8421
  uint func_count, group_parts;
  DBUG_ENTER("alloc_func_list");

  func_count= tmp_table_param.sum_func_count;
  /*
    If we are using rollup, we need a copy of the summary functions for
    each level
  */
  if (rollup.state != ROLLUP::STATE_NONE)
    func_count*= (send_group_parts+1);

  group_parts= send_group_parts;
  /*
    If distinct, reserve memory for possible
    disctinct->group_by optimization
  */
  if (select_distinct)
    group_parts+= fields_list.elements;

  /* This must use calloc() as rollup_make_fields depends on this */
  sum_funcs= (Item_sum**) thd->calloc(sizeof(Item_sum**) * (func_count+1) +
				      sizeof(Item_sum***) * (group_parts+1));
  sum_funcs_end= (Item_sum***) (sum_funcs+func_count+1);
  DBUG_RETURN(sum_funcs == 0);
}


8422
bool JOIN::make_sum_func_list(List<Item> &field_list, List<Item> &send_fields,
8423
			      bool before_group_by)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8424
{
8425
  List_iterator_fast<Item> it(field_list);
8426 8427
  Item_sum **func;
  Item *item;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8428 8429
  DBUG_ENTER("make_sum_func_list");

8430 8431
  func= sum_funcs;
  while ((item=it++))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8432
  {
8433
    if (item->type() == Item::SUM_FUNC_ITEM && !item->const_item())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8434
    {
8435
      *func++= (Item_sum*) item;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8436
      /* let COUNT(DISTINCT) create the temporary table */
8437
      if (((Item_sum*) item)->setup(thd))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8438 8439 8440
	DBUG_RETURN(TRUE);
    }
  }
8441 8442 8443
  if (before_group_by && rollup.state == ROLLUP::STATE_INITED)
  {
    rollup.state= ROLLUP::STATE_READY;
8444
    if (rollup_make_fields(field_list, send_fields, &func))
8445 8446 8447 8448 8449 8450 8451
      DBUG_RETURN(TRUE);			// Should never happen
  }
  else if (rollup.state == ROLLUP::STATE_NONE)
  {
    for (uint i=0 ; i <= send_group_parts ;i++)
      sum_funcs_end[i]= func;
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8452 8453 8454 8455 8456 8457
  *func=0;					// End marker
  DBUG_RETURN(FALSE);
}


/*
8458
  Change all funcs and sum_funcs to fields in tmp table,  and create
8459 8460 8461 8462 8463 8464 8465 8466 8467 8468 8469 8470 8471
  new list of all items.

  change_to_use_tmp_fields()
    thd - THD pointer
    ref_pointer_array - array of pointers to top elements of filed list
    res_selected_fields - new list of items of select item list
    res_all_fields - new list of all items
    elements - number of elements in select item list
    all_fields - all fields list

   RETURN
    0 - ok
    !=0 - error
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8472 8473 8474
*/

static bool
8475
change_to_use_tmp_fields(THD *thd, Item **ref_pointer_array,
8476 8477 8478
			 List<Item> &res_selected_fields,
			 List<Item> &res_all_fields,
			 uint elements, List<Item> &all_fields)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8479
{
8480
  List_iterator_fast<Item> it(all_fields);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8481
  Item *item_field,*item;
8482 8483
  res_selected_fields.empty();
  res_all_fields.empty();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8484

8485
  uint i, border= all_fields.elements - elements;
8486
  for (i= 0; (item= it++); i++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8487 8488
  {
    Field *field;
8489
    
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8490
    if (item->with_sum_func && item->type() != Item::SUM_FUNC_ITEM)
8491 8492
      item_field= item;
    else
8493
    {
8494
      if (item->type() == Item::FIELD_ITEM)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8495
      {
8496
	item_field= item->get_tmp_table_item(thd);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8497
      }
8498
      else if ((field= item->get_tmp_table_field()))
8499 8500 8501 8502 8503 8504 8505 8506 8507 8508 8509 8510
      {
	if (item->type() == Item::SUM_FUNC_ITEM && field->table->group)
	  item_field= ((Item_sum*) item)->result_item(field);
	else
	  item_field= (Item*) new Item_field(field);
	if (!item_field)
	  return TRUE;				// Fatal error
	item_field->name= item->name;		/*lint -e613 */
#ifndef DBUG_OFF
	if (_db_on_ && !item_field->name)
	{
	  char buff[256];
8511
	  String str(buff,sizeof(buff),&my_charset_bin);
8512 8513 8514 8515
	  str.length(0);
	  item->print(&str);
	  item_field->name= sql_strmake(str.ptr(),str.length());
	}
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8516
#endif
8517 8518 8519
      }
      else
	item_field= item;
8520 8521 8522
    }
    res_all_fields.push_back(item_field);
    ref_pointer_array[((i < border)? all_fields.elements-i-1 : i-border)]=
8523
      item_field;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8524
  }
8525

8526
  List_iterator_fast<Item> itr(res_all_fields);
8527 8528
  for (i= 0; i < border; i++)
    itr++;
8529
  itr.sublist(res_selected_fields, elements);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8530 8531 8532 8533 8534
  return FALSE;
}


/*
8535 8536
  Change all sum_func refs to fields to point at fields in tmp table
  Change all funcs to be fields in tmp table
8537 8538 8539 8540 8541 8542 8543 8544 8545 8546

  change_refs_to_tmp_fields()
    thd - THD pointer
    ref_pointer_array - array of pointers to top elements of filed list
    res_selected_fields - new list of items of select item list
    res_all_fields - new list of all items
    elements - number of elements in select item list
    all_fields - all fields list

   RETURN
8547 8548
    0	ok
    1	error
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8549 8550 8551
*/

static bool
8552
change_refs_to_tmp_fields(THD *thd, Item **ref_pointer_array,
8553 8554 8555
			  List<Item> &res_selected_fields,
			  List<Item> &res_all_fields, uint elements,
			  List<Item> &all_fields)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8556
{
8557
  List_iterator_fast<Item> it(all_fields);
8558
  Item *item, *new_item;
8559 8560
  res_selected_fields.empty();
  res_all_fields.empty();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8561

8562
  uint i, border= all_fields.elements - elements;
8563
  for (i= 0; (item= it++); i++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8564
  {
8565 8566
    res_all_fields.push_back(new_item= item->get_tmp_table_item(thd));
    ref_pointer_array[((i < border)? all_fields.elements-i-1 : i-border)]=
8567
      new_item;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8568
  }
8569

8570
  List_iterator_fast<Item> itr(res_all_fields);
8571 8572
  for (i= 0; i < border; i++)
    itr++;
8573
  itr.sublist(res_selected_fields, elements);
8574

8575
  return thd->is_fatal_error;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8576 8577 8578 8579 8580
}



/******************************************************************************
8581
  Code for calculating functions
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8582 8583 8584 8585 8586 8587 8588 8589 8590 8591 8592 8593 8594 8595 8596 8597 8598 8599 8600
******************************************************************************/

static void
init_tmptable_sum_functions(Item_sum **func_ptr)
{
  Item_sum *func;
  while ((func= *(func_ptr++)))
    func->reset_field();
}


	/* Update record 0 in tmp_table from record 1 */

static void
update_tmptable_sum_func(Item_sum **func_ptr,
			 TABLE *tmp_table __attribute__((unused)))
{
  Item_sum *func;
  while ((func= *(func_ptr++)))
8601
    func->update_field();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8602 8603 8604 8605 8606 8607 8608 8609 8610 8611
}


	/* Copy result of sum functions to record in tmp_table */

static void
copy_sum_funcs(Item_sum **func_ptr)
{
  Item_sum *func;
  for (; (func = *func_ptr) ; func_ptr++)
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
8612
    (void) func->save_in_result_field(1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8613 8614 8615 8616
  return;
}


8617 8618
static bool
init_sum_functions(Item_sum **func_ptr, Item_sum **end_ptr)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8619
{
8620 8621 8622 8623 8624 8625 8626 8627 8628 8629 8630 8631
  for (; func_ptr != end_ptr ;func_ptr++)
  {
    if ((*func_ptr)->reset())
      return 1;
  }
  /* If rollup, calculate the upper sum levels */
  for ( ; *func_ptr ; func_ptr++)
  {
    if ((*func_ptr)->add())
      return 1;
  }
  return 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8632 8633 8634 8635 8636 8637 8638 8639 8640 8641 8642 8643 8644 8645 8646 8647
}


static bool
update_sum_func(Item_sum **func_ptr)
{
  Item_sum *func;
  for (; (func= (Item_sum*) *func_ptr) ; func_ptr++)
    if (func->add())
      return 1;
  return 0;
}

	/* Copy result of functions to record in tmp_table */

void
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
8648
copy_funcs(Item **func_ptr)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8649
{
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
8650
  Item *func;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8651
  for (; (func = *func_ptr) ; func_ptr++)
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
8652
    func->save_in_result_field(1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8653 8654 8655
}


8656
/*
8657 8658
  Create a condition for a const reference and add this to the
  currenct select for the table
8659
*/
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8660 8661 8662 8663 8664 8665 8666 8667 8668 8669 8670 8671 8672 8673 8674

static bool add_ref_to_table_cond(THD *thd, JOIN_TAB *join_tab)
{
  DBUG_ENTER("add_ref_to_table_cond");
  if (!join_tab->ref.key_parts)
    DBUG_RETURN(FALSE);

  Item_cond_and *cond=new Item_cond_and();
  TABLE *table=join_tab->table;
  int error;
  if (!cond)
    DBUG_RETURN(TRUE);

  for (uint i=0 ; i < join_tab->ref.key_parts ; i++)
  {
8675 8676
    Field *field=table->field[table->key_info[join_tab->ref.key].key_part[i].
			      fieldnr-1];
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8677 8678 8679
    Item *value=join_tab->ref.items[i];
    cond->add(new Item_func_equal(new Item_field(field),value));
  }
8680
  if (thd->is_fatal_error)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8681
    DBUG_RETURN(TRUE);
8682

bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
8683
  cond->fix_fields(thd,(TABLE_LIST *) 0, (Item**)&cond);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8684 8685 8686 8687 8688 8689 8690 8691 8692 8693 8694
  if (join_tab->select)
  {
    error=(int) cond->add(join_tab->select->cond);
    join_tab->select_cond=join_tab->select->cond=cond;
  }
  else if ((join_tab->select=make_select(join_tab->table, 0, 0, cond,&error)))
    join_tab->select_cond=cond;

  DBUG_RETURN(error ? TRUE : FALSE);
}

8695 8696 8697 8698 8699 8700 8701 8702 8703 8704 8705 8706 8707 8708 8709 8710 8711

/*
  Free joins of subselect of this select.

  free_underlaid_joins()
    thd - THD pointer
    select - pointer to st_select_lex which subselects joins we will free
*/

void free_underlaid_joins(THD *thd, SELECT_LEX *select)
{
  for (SELECT_LEX_UNIT *unit= select->first_inner_unit();
       unit;
       unit= unit->next_unit())
    unit->cleanup();
}

bk@work.mysql.com's avatar
bk@work.mysql.com committed
8712
/****************************************************************************
8713 8714 8715 8716 8717 8718 8719 8720 8721 8722 8723 8724 8725 8726 8727 8728 8729 8730 8731 8732 8733 8734 8735 8736 8737 8738 8739 8740 8741 8742 8743 8744 8745 8746
  ROLLUP handling
****************************************************************************/

/* Allocate memory needed for other rollup functions */

bool JOIN::rollup_init()
{
  uint i,j;
  Item **ref_array;

  tmp_table_param.quick_group= 0;	// Can't create groups in tmp table
  rollup.state= ROLLUP::STATE_INITED;

  /*
    Create pointers to the different sum function groups
    These are updated by rollup_make_fields()
  */
  tmp_table_param.group_parts= send_group_parts;

  if (!(rollup.fields= (List<Item>*) thd->alloc((sizeof(Item*) +
						 sizeof(List<Item>) +
						 ref_pointer_array_size)
						* send_group_parts)))
    return 1;
  rollup.ref_pointer_arrays= (Item***) (rollup.fields + send_group_parts);
  ref_array= (Item**) (rollup.ref_pointer_arrays+send_group_parts);
  rollup.item_null= new (&thd->mem_root) Item_null();

  /*
    Prepare space for field list for the different levels
    These will be filled up in rollup_make_fields()
  */
  for (i= 0 ; i < send_group_parts ; i++)
  {
8747 8748
    List<Item> *rollup_fields= &rollup.fields[i];
    rollup_fields->empty();
8749 8750 8751
    rollup.ref_pointer_arrays[i]= ref_array;
    ref_array+= all_fields.elements;
    for (j=0 ; j < fields_list.elements ; j++)
8752
      rollup_fields->push_back(rollup.item_null);
8753 8754 8755 8756 8757 8758 8759 8760 8761 8762
  }
  return 0;
}
  

/*
  Fill up rollup structures with pointers to fields to use

  SYNOPSIS
    rollup_make_fields()
8763 8764
    fields_arg			List of all fields (hidden and real ones)
    sel_fields			Pointer to selected fields
8765 8766 8767 8768 8769 8770 8771 8772 8773 8774 8775
    func			Store here a pointer to all fields

  IMPLEMENTATION:
    Creates copies of item_sum items for each sum level

  RETURN
    0	if ok
	In this case func is pointing to next not used element.
    1   on error
*/

8776
bool JOIN::rollup_make_fields(List<Item> &fields_arg, List<Item> &sel_fields,
8777 8778
			      Item_sum ***func)
{
8779 8780
  List_iterator_fast<Item> it(fields_arg);
  Item *first_field= sel_fields.head();
8781 8782 8783 8784 8785 8786 8787 8788 8789 8790 8791 8792 8793 8794 8795 8796 8797 8798 8799 8800 8801 8802 8803
  uint level;

  /*
    Create field lists for the different levels

    The idea here is to have a separate field list for each rollup level to
    avoid all runtime checks of which columns should be NULL.

    The list is stored in reverse order to get sum function in such an order
    in func that it makes it easy to reset them with init_sum_functions()

    Assuming:  SELECT a, b, c SUM(b) FROM t1 GROUP BY a,b WITH ROLLUP

    rollup.fields[0] will contain list where a,b,c is NULL
    rollup.fields[1] will contain list where b,c is NULL
    ...
    rollup.ref_pointer_array[#] points to fields for rollup.fields[#]
    ...
    sum_funcs_end[0] points to all sum functions
    sum_funcs_end[1] points to all sum functions, except grand totals
    ...
  */

8804
  for (level=0 ; level < send_group_parts ; level++)
8805 8806 8807 8808 8809 8810 8811 8812 8813 8814
  {
    uint i;
    uint pos= send_group_parts - level -1;
    bool real_fields= 0;
    Item *item;
    List_iterator<Item> new_it(rollup.fields[pos]);
    Item **ref_array_start= rollup.ref_pointer_arrays[pos];
    ORDER *start_group;

    /* Point to first hidden field */
8815
    Item **ref_array= ref_array_start + fields_arg.elements-1;
8816 8817 8818 8819 8820 8821 8822 8823 8824 8825 8826 8827 8828 8829 8830 8831 8832 8833 8834 8835 8836 8837 8838 8839 8840 8841 8842 8843 8844 8845 8846 8847 8848 8849 8850 8851 8852 8853 8854

    /* Remember where the sum functions ends for the previous level */
    sum_funcs_end[pos+1]= *func;

    /* Find the start of the group for this level */
    for (i= 0, start_group= group_list ;
	 i++ < pos ;
	 start_group= start_group->next)
      ;

    it.rewind();
    while ((item= it++))
    {
      if (item == first_field)
      {
	real_fields= 1;				// End of hidden fields
	ref_array= ref_array_start;
      }

      if (item->type() == Item::SUM_FUNC_ITEM && !item->const_item())
      {
	/*
	  This is a top level summary function that must be replaced with
	  a sum function that is reset for this level.

	  NOTE: This code creates an object which is not that nice in a
	  sub select.  Fortunately it's not common to have rollup in
	  sub selects.
	*/
	item= item->copy_or_same(thd);
	((Item_sum*) item)->make_unique();
	if (((Item_sum*) item)->setup(thd))
	  return 1;
	*(*func)= (Item_sum*) item;
	(*func)++;
      }
      else if (real_fields)
      {
	/* Check if this is something that is part of this group by */
8855 8856
	ORDER *group_tmp;
	for (group_tmp= start_group ; group_tmp ; group_tmp= group_tmp->next)
8857
	{
8858
	  if (*group_tmp->item == item)
8859 8860 8861 8862 8863 8864 8865 8866 8867 8868 8869 8870 8871 8872 8873 8874 8875 8876 8877 8878 8879 8880 8881 8882 8883 8884 8885 8886 8887 8888 8889 8890 8891 8892 8893 8894 8895 8896 8897 8898 8899 8900 8901 8902 8903 8904 8905 8906 8907 8908 8909 8910 8911 8912 8913 8914 8915 8916 8917 8918 8919 8920 8921 8922 8923 8924
	  {
	    /*
	      This is an element that is used by the GROUP BY and should be
	      set to NULL in this level
	    */
	    item->maybe_null= 1;		// Value will be null sometimes
	    item= rollup.item_null;
	    break;
	  }
	}
      }
      *ref_array= item;
      if (real_fields)
      {
	(void) new_it++;			// Point to next item
	new_it.replace(item);			// Replace previous
	ref_array++;
      }
      else
	ref_array--;
    }
  }
  sum_funcs_end[0]= *func;			// Point to last function
  return 0;
}

/*
  Send all rollup levels higher than the current one to the client

  SYNOPSIS:
    rollup_send_data()
    idx			Level we are on:
			0 = Total sum level
			1 = First group changed  (a)
			2 = Second group changed (a,b)

  SAMPLE
    SELECT a, b, c SUM(b) FROM t1 GROUP BY a,b WITH ROLLUP

  RETURN
    0	ok
    1   If send_data_failed()
*/

int JOIN::rollup_send_data(uint idx)
{
  uint i;
  for (i= send_group_parts ; i-- > idx ; )
  {
    /* Get reference pointers to sum functions in place */
    memcpy((char*) ref_pointer_array,
	   (char*) rollup.ref_pointer_arrays[i],
	   ref_pointer_array_size);
    if ((!having || having->val_int()))
    {
      if (send_records < unit->select_limit_cnt &&
	  result->send_data(rollup.fields[i]))
	return 1;
      send_records++;
    }
  }
  /* Restore ref_pointer_array */
  set_items_ref_array(current_ref_pointer_array);
  return 0;
}

8925 8926 8927 8928 8929 8930 8931 8932 8933 8934 8935 8936 8937 8938 8939 8940 8941 8942 8943 8944
/*
  clear results if there are not rows found for group
  (end_send_group/end_write_group)

  SYNOPSYS
     JOIN::clear()
*/

void JOIN::clear()
{
  clear_tables(this);
  copy_fields(&tmp_table_param);

  if (sum_funcs)
  {
    Item_sum *func, **func_ptr= sum_funcs;
    while ((func= *(func_ptr++)))
      func->clear();
  }
}
8945

bk@work.mysql.com's avatar
bk@work.mysql.com committed
8946
/****************************************************************************
8947 8948
  EXPLAIN handling

8949
  Send a description about what how the select will be done to stdout
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8950 8951
****************************************************************************/

monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
8952
static void select_describe(JOIN *join, bool need_tmp_table, bool need_order,
8953
			    bool distinct,const char *message)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8954 8955
{
  List<Item> field_list;
8956
  List<Item> item_list;
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
8957
  THD *thd=join->thd;
8958
  SELECT_LEX *select_lex= &join->thd->lex->select_lex;
8959
  select_result *result=join->result;
8960
  Item *item_null= new Item_null();
8961
  CHARSET_INFO *cs= &my_charset_latin1;
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
8962
  DBUG_ENTER("select_describe");
8963
  DBUG_PRINT("info", ("Select 0x%lx, type %s, message %s",
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
8964
		      (ulong)join->select_lex, join->select_lex->type,
8965
		      message ? message : "NULL"));
8966
  /* Don't log this into the slow query log */
8967
  thd->server_status&= ~(SERVER_QUERY_NO_INDEX_USED | SERVER_QUERY_NO_GOOD_INDEX_USED);
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
8968
  join->unit->offset_limit_cnt= 0;
8969

8970
  if (message)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8971
  {
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
8972 8973
    item_list.push_back(new Item_int((int32) join->select_lex->select_number));
    item_list.push_back(new Item_string(join->select_lex->type,
8974
					strlen(join->select_lex->type), cs));
8975
    for (uint i=0 ; i < 7; i++)
8976
      item_list.push_back(item_null);
8977
    item_list.push_back(new Item_string(message,strlen(message),cs));
8978
    if (result->send_data(item_list))
8979
      join->error= 1;
8980 8981 8982 8983 8984
  }
  else
  {
    table_map used_tables=0;
    for (uint i=0 ; i < join->tables ; i++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8985
    {
8986 8987
      JOIN_TAB *tab=join->join_tab+i;
      TABLE *table=tab->table;
8988
      char buff[512],*buff_ptr=buff;
8989
      char buff1[512], buff2[512];
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
8990
      char derived_name[64];
8991 8992
      String tmp1(buff1,sizeof(buff1),cs);
      String tmp2(buff2,sizeof(buff2),cs);
8993 8994 8995
      tmp1.length(0);
      tmp2.length(0);

bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
8996
      item_list.empty();
8997
      item_list.push_back(new Item_int((int32)
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
8998 8999 9000
				       join->select_lex->select_number));
      item_list.push_back(new Item_string(join->select_lex->type,
					  strlen(join->select_lex->type),
9001
					  cs));
9002 9003
      if (tab->type == JT_ALL && tab->select && tab->select->quick)
	tab->type= JT_RANGE;
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
9004
      if (table->derived_select_number)
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9005
      {
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
9006 9007 9008
	/* Derived table name generation */
	int len= my_snprintf(derived_name, sizeof(derived_name)-1,
			     "<derived%u>",
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9009
			     table->derived_select_number);
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
9010
	item_list.push_back(new Item_string(derived_name, len, cs));
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9011 9012 9013 9014
      }
      else
	item_list.push_back(new Item_string(table->table_name,
					    strlen(table->table_name),
9015
					    cs));
9016 9017
      item_list.push_back(new Item_string(join_type_str[tab->type],
					  strlen(join_type_str[tab->type]),
9018
					  cs));
9019
      uint j;
9020
      if (!tab->keys.is_clear_all())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
9021
      {
serg@serg.mylan's avatar
serg@serg.mylan committed
9022
        for (j=0 ; j < table->keys ; j++)
9023 9024 9025 9026 9027 9028 9029 9030
        {
          if (tab->keys.is_set(j))
          {
            if (tmp1.length())
              tmp1.append(',');
            tmp1.append(table->key_info[j].name);
          }
        }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
9031
      }
9032
      if (tmp1.length())
9033
	item_list.push_back(new Item_string(tmp1.ptr(),tmp1.length(),cs));
9034
      else
9035
	item_list.push_back(item_null);
9036
      if (tab->ref.key_parts)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
9037
      {
9038 9039
	KEY *key_info=table->key_info+ tab->ref.key;
	item_list.push_back(new Item_string(key_info->name,
9040 9041
					    strlen(key_info->name),
					    system_charset_info));
9042
	item_list.push_back(new Item_int((int32) tab->ref.key_length));
9043 9044
	for (store_key **ref=tab->ref.key_copy ; *ref ; ref++)
	{
9045 9046 9047
	  if (tmp2.length())
	    tmp2.append(',');
	  tmp2.append((*ref)->name());
9048
	}
9049
	item_list.push_back(new Item_string(tmp2.ptr(),tmp2.length(),cs));
9050 9051 9052
      }
      else if (tab->type == JT_NEXT)
      {
9053 9054
	KEY *key_info=table->key_info+ tab->index;
	item_list.push_back(new Item_string(key_info->name,
9055
					    strlen(key_info->name),cs));
9056 9057
	item_list.push_back(new Item_int((int32) key_info->key_length));
	item_list.push_back(item_null);
9058 9059 9060
      }
      else if (tab->select && tab->select->quick)
      {
9061 9062
	KEY *key_info=table->key_info+ tab->select->quick->index;
	item_list.push_back(new Item_string(key_info->name,
9063
					    strlen(key_info->name),cs));
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
9064 9065
	item_list.push_back(new Item_int((int32) tab->select->quick->
					 max_used_key_length));
9066
	item_list.push_back(item_null);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
9067 9068 9069
      }
      else
      {
9070 9071 9072
	item_list.push_back(item_null);
	item_list.push_back(item_null);
	item_list.push_back(item_null);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
9073
      }
9074 9075 9076
      item_list.push_back(new Item_int((longlong) (ulonglong)
				       join->best_positions[i]. records_read,
				       21));
9077
      my_bool key_read=table->key_read;
9078
      if (tab->type == JT_NEXT && table->used_keys.is_set(tab->index))
9079
	key_read=1;
9080

9081
      if (tab->info)
9082
	item_list.push_back(new Item_string(tab->info,strlen(tab->info),cs));
9083
      else
bk@work.mysql.com's avatar
bk@work.mysql.com committed
9084
      {
9085
	if (tab->select)
9086
	{
9087 9088
	  if (tab->use_quick == 2)
	  {
9089
            char buf[MAX_KEY/8+1];
serg@serg.mylan's avatar
serg@serg.mylan committed
9090
	    sprintf(buff_ptr,"; Range checked for each record (index map: 0x%s)",
9091
                tab->keys.print(buf));
9092 9093 9094 9095
	    buff_ptr=strend(buff_ptr);
	  }
	  else
	    buff_ptr=strmov(buff_ptr,"; Using where");
9096
	}
9097 9098 9099 9100 9101 9102 9103 9104 9105 9106 9107 9108 9109 9110
	if (key_read)
	  buff_ptr= strmov(buff_ptr,"; Using index");
	if (table->reginfo.not_exists_optimize)
	  buff_ptr= strmov(buff_ptr,"; Not exists");
	if (need_tmp_table)
	{
	  need_tmp_table=0;
	  buff_ptr= strmov(buff_ptr,"; Using temporary");
	}
	if (need_order)
	{
	  need_order=0;
	  buff_ptr= strmov(buff_ptr,"; Using filesort");
	}
9111
	if (distinct & test_all_bits(used_tables,thd->used_tables))
9112 9113
	  buff_ptr= strmov(buff_ptr,"; Distinct");
	if (buff_ptr == buff)
9114 9115
	  buff_ptr+= 2;				// Skip inital "; "
	item_list.push_back(new Item_string(buff+2,(uint) (buff_ptr - buff)-2,
9116
					    cs));
9117 9118 9119
      }
      // For next iteration
      used_tables|=table->map;
9120
      if (result->send_data(item_list))
9121
	join->error= 1;
9122
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
9123
  }
9124 9125 9126 9127 9128 9129 9130
  for (SELECT_LEX_UNIT *unit= join->select_lex->first_inner_unit();
       unit;
       unit= unit->next_unit())
  {
    if (mysql_explain_union(thd, unit, result))
      DBUG_VOID_RETURN;
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
9131 9132 9133
  DBUG_VOID_RETURN;
}

9134

9135 9136
int mysql_explain_union(THD *thd, SELECT_LEX_UNIT *unit, select_result *result)
{
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9137
  DBUG_ENTER("mysql_explain_union");
9138 9139 9140 9141 9142 9143 9144
  int res= 0;
  SELECT_LEX *first= unit->first_select();
  for (SELECT_LEX *sl= first;
       sl;
       sl= sl->next_select())
  {
    res= mysql_explain_select(thd, sl,
9145
			      (((&thd->lex->select_lex)==sl)?
9146 9147
			       ((thd->lex->all_selects_list != sl) ? 
				primary_key_name : "SIMPLE"):
9148
			       ((sl == first)?
9149 9150
				((sl->linkage == DERIVED_TABLE_TYPE) ?
				 "DERIVED":
9151
				((sl->uncacheable & UNCACHEABLE_DEPENDENT) ?
9152
				 "DEPENDENT SUBQUERY":
9153 9154
				 (sl->uncacheable?"UNCACHEABLE SUBQUERY":
				   "SUBQUERY"))):
9155
				((sl->uncacheable & UNCACHEABLE_DEPENDENT) ?
9156
				 "DEPENDENT UNION":
9157 9158
				 sl->uncacheable?"UNCACHEABLE UNION":
				  "UNION"))),
9159 9160 9161 9162 9163
			      result);
    if (res)
      break;

  }
9164 9165
  if (res > 0 || thd->net.report_error)
    res= -1; // mysql_explain_select do not report error
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9166
  DBUG_RETURN(res);
9167 9168
}

9169

bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9170 9171
int mysql_explain_select(THD *thd, SELECT_LEX *select_lex, char const *type, 
			 select_result *result)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
9172
{
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9173 9174
  DBUG_ENTER("mysql_explain_select");
  DBUG_PRINT("info", ("Select 0x%lx, type %s", (ulong)select_lex, type))
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9175
  select_lex->type= type;
9176
  thd->lex->current_select= select_lex;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9177
  SELECT_LEX_UNIT *unit=  select_lex->master_unit();
9178 9179 9180
  int res= mysql_select(thd, &select_lex->ref_pointer_array,
			(TABLE_LIST*) select_lex->table_list.first,
			select_lex->with_wild, select_lex->item_list,
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9181
			select_lex->where,
9182 9183
			select_lex->order_list.elements +
			select_lex->group_list.elements,
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9184 9185 9186
			(ORDER*) select_lex->order_list.first,
			(ORDER*) select_lex->group_list.first,
			select_lex->having,
9187
			(ORDER*) thd->lex->proc_list.first,
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9188
			select_lex->options | thd->options | SELECT_DESCRIBE,
9189
			result, unit, select_lex);
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9190
  DBUG_RETURN(res);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
9191
}
9192 9193 9194 9195 9196 9197 9198


void st_select_lex::print(THD *thd, String *str)
{
  if (!thd)
    thd= current_thd;

9199
  str->append("select ", 7);
9200 9201 9202
  
  //options
  if (options & SELECT_STRAIGHT_JOIN)
9203
    str->append("straight_join ", 14);
9204 9205
  if ((thd->lex->lock_option & TL_READ_HIGH_PRIORITY) &&
      (this == &thd->lex->select_lex))
9206
    str->append("high_priority ", 14);
9207
  if (options & SELECT_DISTINCT)
9208
    str->append("distinct ", 9);
9209
  if (options & SELECT_SMALL_RESULT)
9210
    str->append("small_result ", 13);
9211
  if (options & SELECT_BIG_RESULT)
9212
    str->append("big_result ", 11);
9213
  if (options & OPTION_BUFFER_RESULT)
9214
    str->append("buffer_result ", 14);
9215
  if (options & OPTION_FOUND_ROWS)
9216
    str->append("calc_found_rows ", 16);
9217
  if (!thd->lex->safe_to_cache_query)
9218
    str->append("no_cache ", 9);
9219
  if (options & OPTION_TO_QUERY_CACHE)
9220
    str->append("cache ", 6);
9221 9222 9223 9224 9225 9226 9227 9228 9229 9230 9231 9232 9233 9234 9235 9236 9237 9238 9239 9240

  //Item List
  bool first= 1;
  List_iterator_fast<Item> it(item_list);
  Item *item;
  while ((item= it++))
  {
    if (first)
      first= 0;
    else
      str->append(',');
    item->print_item_w_name(str);
  }

  /*
    from clause
    TODO: support USING/FORCE/IGNORE index
  */
  if (table_list.elements)
  {
9241
    str->append(" from ", 6);
9242 9243 9244 9245 9246 9247 9248 9249 9250 9251 9252 9253 9254 9255 9256 9257 9258 9259 9260 9261 9262 9263 9264 9265 9266 9267 9268 9269 9270 9271
    Item *next_on= 0;
    for (TABLE_LIST *table= (TABLE_LIST *) table_list.first;
	 table;
	 table= table->next)
    {
      if (table->derived)
      {
	str->append('(');
	table->derived->print(str);
	str->append(") ");
	str->append(table->alias);
      }
      else
      {
	str->append(table->db);
	str->append('.');
	str->append(table->real_name);
	if (strcmp(table->real_name, table->alias))
	{
	  str->append(' ');
	  str->append(table->alias);
	}
      }

      if (table->on_expr && ((table->outer_join & JOIN_TYPE_LEFT) ||
			     !(table->outer_join & JOIN_TYPE_RIGHT)))
	next_on= table->on_expr;

      if (next_on)
      {
9272
	str->append(" on(", 4);
9273 9274 9275 9276 9277
	next_on->print(str);
	str->append(')');
	next_on= 0;
      }

9278 9279
      TABLE_LIST *next_table;
      if ((next_table= table->next))
9280 9281 9282
      {
	if (table->outer_join & JOIN_TYPE_RIGHT)
	{
9283
	  str->append(" right join ", 12);
9284 9285 9286 9287
	  if (!(table->outer_join & JOIN_TYPE_LEFT) &&
	      table->on_expr)
	    next_on= table->on_expr;	    
	}
9288
	else if (next_table->straight)
9289
	  str->append(" straight_join ", 15);
9290
	else if (next_table->outer_join & JOIN_TYPE_LEFT)
9291
	  str->append(" left join ", 11);
9292
	else
9293
	  str->append(" join ", 6);
9294 9295 9296 9297
      }
    }
  }

9298 9299
  // Where
  Item *cur_where= where;
9300
  if (join)
9301 9302
    cur_where= join->conds;
  if (cur_where)
9303
  {
9304
    str->append(" where ", 7);
9305
    cur_where->print(str);
9306 9307
  }

9308
  // group by & olap
9309 9310
  if (group_list.elements)
  {
9311
    str->append(" group by ", 10);
9312 9313 9314 9315
    print_order(str, (ORDER *) group_list.first);
    switch (olap)
    {
      case CUBE_TYPE:
9316
	str->append(" with cube", 10);
9317 9318
	break;
      case ROLLUP_TYPE:
9319
	str->append(" with rollup", 12);
9320 9321 9322 9323 9324 9325
	break;
      default:
	;  //satisfy compiler
    }
  }

9326 9327
  // having
  Item *cur_having= having;
9328
  if (join)
9329
    cur_having= join->having;
9330

9331
  if (cur_having)
9332
  {
9333
    str->append(" having ", 8);
9334
    cur_having->print(str);
9335 9336 9337 9338
  }

  if (order_list.elements)
  {
9339
    str->append(" order by ", 10);
9340 9341 9342 9343 9344 9345 9346 9347
    print_order(str, (ORDER *) order_list.first);
  }

  // limit
  print_limit(thd, str);

  // PROCEDURE unsupported here
}