sql_select.cc 267 KB
Newer Older
1
/* Copyright (C) 2000-2004 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);
73 74 75 76
static COND *optimize_cond(THD *thd, COND *conds,
			   Item::cond_result *cond_value);
static COND *remove_eq_conds(THD *thd, COND *cond, 
			     Item::cond_result *cond_value);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
77 78 79
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,
80
				    ulong options);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
81 82 83 84
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);
85
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
86 87 88 89 90 91 92 93 94
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);
95
static int join_read_const_table(JOIN_TAB *tab, POSITION *pos);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
96 97 98 99
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);
100
static int join_read_last_key(JOIN_TAB *tab);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
101 102 103 104 105
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);
106 107 108 109 110 111
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
112 113
static int join_ft_read_first(JOIN_TAB *tab);
static int join_ft_read_next(READ_RECORD *info);
114 115
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
116 117 118
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
119
static uint find_shortest_key(TABLE *table, const key_map *usable_keys);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
120
static bool test_if_skip_sort_order(JOIN_TAB *tab,ORDER *order,
121
				    ha_rows select_limit, bool no_changes);
122
static int create_sort_index(THD *thd, JOIN *join, ORDER *order,
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
123
			     ha_rows filesort_limit, ha_rows select_limit);
124 125
static int remove_duplicates(JOIN *join,TABLE *entry,List<Item> &fields,
			     Item *having);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
126
static int remove_dup_with_compare(THD *thd, TABLE *entry, Field **field,
127
				   ulong offset,Item *having);
128
static int remove_dup_with_hash_index(THD *thd,TABLE *table,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
129
				      uint field_count, Field **first_field,
130
				      ulong key_length,Item *having);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
131 132 133
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);
134 135
static void reset_cache_read(JOIN_CACHE *cache);
static void reset_cache_write(JOIN_CACHE *cache);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
136 137 138 139
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);
140 141 142
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
143 144 145
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);
146
static bool make_group_fields(JOIN *main_join, JOIN *curr_join);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
147
static bool alloc_group_fields(JOIN *join,ORDER *group);
148
// Create list for using with tempory table
149
static bool change_to_use_tmp_fields(THD *thd, Item **ref_pointer_array,
150 151 152 153 154 155 156 157
				     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
158 159 160 161
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);
162
static bool init_sum_functions(Item_sum **func, Item_sum **end);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
163
static bool update_sum_func(Item_sum **func);
164
static void select_describe(JOIN *join, bool need_tmp_table,bool need_order,
165
			    bool distinct, const char *message=NullS);
166
static Item *remove_additional_cond(Item* conds);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
167

168

169 170 171 172 173 174 175 176
/*
  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;
177 178
  DBUG_ENTER("handle_select");

bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
179
  if (select_lex->next_select())
180
    res=mysql_union(thd, lex, result, &lex->unit);
181
  else
182 183 184 185 186 187 188 189 190 191 192
    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,
193
		      result, &(lex->unit), &(lex->select_lex));
194

195 196 197 198
  /* 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
199
    res= 1;
200 201 202 203 204 205 206 207 208 209
  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
210
  }
211
  delete result;
212
  DBUG_RETURN(res);
213 214
}

215

216
/*
217
  Function to setup clauses without sum functions
218
*/
219 220
inline int setup_without_group(THD *thd, Item **ref_pointer_array,
			       TABLE_LIST *tables,
221 222 223 224 225 226
			       List<Item> &fields,
			       List<Item> &all_fields,
			       COND **conds,
			       ORDER *order,
			       ORDER *group, bool *hidden_group_fields)
{
monty@mysql.com's avatar
monty@mysql.com committed
227 228 229 230 231
  bool save_allow_sum_func;
  int res;
  DBUG_ENTER("setup_without_group");

  save_allow_sum_func= thd->allow_sum_func;
232
  thd->allow_sum_func= 0;
monty@mysql.com's avatar
monty@mysql.com committed
233 234 235 236 237
  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));
238
  thd->allow_sum_func= save_allow_sum_func;
monty@mysql.com's avatar
monty@mysql.com committed
239
  DBUG_RETURN(res);
240 241
}

bk@work.mysql.com's avatar
bk@work.mysql.com committed
242
/*****************************************************************************
243 244
  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
245 246
*****************************************************************************/

247
/*
monty@mysql.com's avatar
monty@mysql.com committed
248
  Prepare of whole select (including sub queries in future).
249 250 251
  return -1 on error
          0 on success
*/
bk@work.mysql.com's avatar
bk@work.mysql.com committed
252
int
253 254 255 256
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
257
	      Item *having_init,
258 259
	      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
260
{
261
  DBUG_ENTER("JOIN::prepare");
262

263 264 265 266
  // to prevent double initialization on EXPLAIN
  if (optimized)
    DBUG_RETURN(0);

267 268 269 270 271 272
  conds= conds_init;
  order= order_init;
  group_list= group_init;
  having= having_init;
  proc_param= proc_param_init;
  tables_list= tables_init;
273
  select_lex= select_lex_arg;
274
  select_lex->join= this;
275
  union_part= (unit_arg->first_select()->next_select() != 0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
276 277 278

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

279
  if (setup_tables(tables_list) ||
280
      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
281
      select_lex->setup_ref_array(thd, og_num) ||
282 283 284 285 286
      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
287 288
    DBUG_RETURN(-1);				/* purecov: inspected */

289
  ref_pointer_array= *rref_pointer_array;
290
  
bk@work.mysql.com's avatar
bk@work.mysql.com committed
291 292 293 294
  if (having)
  {
    thd->where="having clause";
    thd->allow_sum_func=1;
295
    select_lex->having_fix_field= 1;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
296 297 298
    bool having_fix_rc= (!having->fixed &&
			 (having->fix_fields(thd, tables_list, &having) ||
			  having->check_cols(1)));
299
    select_lex->having_fix_field= 0;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
300
    if (having_fix_rc || thd->net.report_error)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
301 302
      DBUG_RETURN(-1);				/* purecov: inspected */
    if (having->with_sum_func)
303
      having->split_sum_func(ref_pointer_array, all_fields);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
304
  }
305

306 307 308
  // Is it subselect
  {
    Item_subselect *subselect;
309
    if ((subselect= select_lex->master_unit()->item))
310 311
    {
      Item_subselect::trans_res res;
312
      if ((res= subselect->select_transformer(this)) !=
313 314
	  Item_subselect::RES_OK)
	DBUG_RETURN((res == Item_subselect::RES_ERROR));
315 316 317
    }
  }

318
  if (setup_ftfuncs(select_lex)) /* should be after having->fix_fields */
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
319
    DBUG_RETURN(-1);
320 321
  

bk@work.mysql.com's avatar
bk@work.mysql.com committed
322 323 324 325 326
  /*
    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;
327
  */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
328
  {
329
    if (!group_list)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
330 331
    {
      uint flag=0;
332
      List_iterator_fast<Item> it(fields_list);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
333 334 335 336 337
      Item *item;
      while ((item= it++))
      {
	if (item->with_sum_func)
	  flag|=1;
338
	else if (!(flag & 2) && !item->const_during_execution())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
339 340 341 342 343 344 345 346
	  flag|=2;
      }
      if (flag == 3)
      {
	my_error(ER_MIX_OF_GROUP_FUNC_AND_FIELDS,MYF(0));
	DBUG_RETURN(-1);
      }
    }
347 348
    TABLE_LIST *table_ptr;
    for (table_ptr= tables_list ; table_ptr ; table_ptr= table_ptr->next)
349
      tables++;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
350
  }
351 352 353
  {
    /* Caclulate the number of groups */
    send_group_parts= 0;
354
    for (ORDER *group_tmp= group_list ; group_tmp ; group_tmp= group_tmp->next)
355 356 357
      send_group_parts++;
  }
  
358
  procedure= setup_procedure(thd, proc_param, result, fields_list, &error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
359
  if (error)
360
    goto err;					/* purecov: inspected */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
361 362
  if (procedure)
  {
363 364
    if (setup_new_fields(thd, tables_list, fields_list, all_fields,
			 procedure->param_fields))
365
	goto err;				/* purecov: inspected */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
366 367
    if (procedure->group)
    {
368
      if (!test_if_subpart(procedure->group,group_list))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
369 370 371
      {						/* purecov: inspected */
	my_message(0,"Can't handle procedures with differents groups yet",
		   MYF(0));			/* purecov: inspected */
372
	goto err;				/* purecov: inspected */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
373 374 375
      }
    }
#ifdef NOT_NEEDED
376
    else if (!group_list && procedure->flags & PROC_GROUP)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
377 378
    {
      my_message(0,"Select must have a group with this procedure",MYF(0));
379
      goto err;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
380 381 382
    }
#endif
    if (order && (procedure->flags & PROC_NO_SORT))
383
    {						/* purecov: inspected */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
384
      my_message(0,"Can't use order with this procedure",MYF(0)); /* purecov: inspected */
385
      goto err;					/* purecov: inspected */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
386 387 388 389
    }
  }

  /* Init join struct */
390
  count_field_types(&tmp_table_param, all_fields, 0);
391
  ref_pointer_array_size= all_fields.elements*sizeof(Item*);
392 393
  this->group= group_list != 0;
  row_limit= ((select_distinct || order || group_list) ? HA_POS_ERROR :
394
	      unit_arg->select_limit_cnt);
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
395
  /* select_limit is used to decide if we are likely to scan the whole table */
396
  select_limit= unit_arg->select_limit_cnt;
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
397 398
  if (having || (select_options & OPTION_FOUND_ROWS))
    select_limit= HA_POS_ERROR;
399 400
  do_send_rows = (unit_arg->select_limit_cnt) ? 1 : 0;
  unit= unit_arg;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
401 402

#ifdef RESTRICTED_GROUP
403
  if (sum_func_count && !group_list && (func_count || field_count))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
404
  {
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
405
    my_message(ER_WRONG_SUM_SELECT,ER(ER_WRONG_SUM_SELECT),MYF(0));
406
    goto err;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
407 408
  }
#endif
409
  if (!procedure && result && result->prepare(fields_list, unit_arg))
410 411 412 413 414 415 416
    goto err;					/* purecov: inspected */

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

417
  DBUG_RETURN(0); // All OK
418 419 420 421 422

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

425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440
/*
  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 &&
441
      ((Item_func *)this->conds)->functype() == Item_func::EQ_FUNC &&
442 443 444 445 446 447 448 449 450 451 452
      ((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)
  {
453 454 455 456
    if ((*where= remove_additional_cond(conds)))
      join_tab->info= "Using index; Using where";
    else
      join_tab->info= "Using index";
457 458 459 460 461 462
    return 1;
  }
  return 0;
}


463 464 465
/*
  global select optimisation.
  return 0 - success
466
         1 - error
467 468 469 470 471 472
  error code saved in field 'error'
*/
int
JOIN::optimize()
{
  DBUG_ENTER("JOIN::optimize");
473
  // to prevent double initialization on EXPLAIN
474 475 476
  if (optimized)
    DBUG_RETURN(0);
  optimized= 1;
477

478
  // Ignore errors of execution if option IGNORE present
479 480
  if (thd->lex->duplicates == DUP_IGNORE)
    thd->lex->current_select->no_error= 1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
481 482
#ifdef HAVE_REF_TO_FIELDS			// Not done yet
  /* Add HAVING to WHERE if possible */
483
  if (having && !group_list && !sum_func_count)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
484 485 486
  {
    if (!conds)
    {
487 488
      conds= having;
      having= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
489 490 491
    }
    else if ((conds=new Item_cond_and(conds,having)))
    {
492
      conds->fix_fields(thd, tables_list, &conds);
493
      conds->change_ref_to_fields(thd, tables_list);
494
      conds->top_level_item();
495
      having= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
496 497 498 499
    }
  }
#endif

bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
500
  conds= optimize_cond(thd, conds, &cond_value);
501
  if (thd->net.report_error)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
502
  {
serg@serg.mylan's avatar
serg@serg.mylan committed
503
    error= 1;
504
    DBUG_PRINT("error",("Error from optimize_cond"));
505
    DBUG_RETURN(1);
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
506
  }
507

monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
508 509
  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
510
  {						/* Impossible cond */
511
    zero_result_cause= "Impossible WHERE";
512
    error= 0;
513
    DBUG_RETURN(0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
514 515 516
  }

  /* Optimize count(*), min() and max() */
517
  if (tables_list && tmp_table_param.sum_func_count && ! group_list)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
518 519
  {
    int res;
520
    /*
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
521 522
      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_...
523
    */
524
    if ((res=opt_sum_query(tables_list, all_fields, conds)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
525
    {
526 527
      if (res > 1)
      {
528
	DBUG_RETURN(1);
529
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
530 531
      if (res < 0)
      {
532
	zero_result_cause= "No matching min/max row";
serg@serg.mylan's avatar
serg@serg.mylan committed
533
	error=0;
534
	DBUG_RETURN(0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
535
      }
536
      zero_result_cause= "Select tables optimized away";
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
537
      tables_list= 0;				// All tables resolved
bk@work.mysql.com's avatar
bk@work.mysql.com committed
538 539
    }
  }
540
  if (!tables_list)
541 542
  {
    error= 0;
543
    DBUG_RETURN(0);
544
  }
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
545
  error= -1;					// Error is sent to client
546
  sort_by_table= get_sort_by_table(order, group_list, tables_list);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
547 548

  /* Calculate how to do the join */
549 550
  thd->proc_info= "statistics";
  if (make_join_statistics(this, tables_list, conds, &keyuse) ||
551
      thd->is_fatal_error)
552 553
  {
    DBUG_PRINT("error",("Error: make_join_statistics() failed"));
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
554
    DBUG_RETURN(1);
555
  }
556

monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
557 558
  /* Remove distinct if only const tables */
  select_distinct= select_distinct && (const_tables != tables);
559
  thd->proc_info= "preparing";
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
560
  if (result->initialize_tables(this))
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
561
  {
562 563
    DBUG_PRINT("error",("Error: initialize_tables() failed"));
    DBUG_RETURN(1);				// error == -1
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
564
  }
565
  if (const_table_map != found_const_table_map &&
566
      !(select_options & SELECT_DESCRIBE) &&
567 568 569
      (!conds ||
       !(conds->used_tables() & RAND_TABLE_BIT) ||
       select_lex->master_unit() == &thd->lex->unit)) // upper level SELECT
bk@work.mysql.com's avatar
bk@work.mysql.com committed
570
  {
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
571
    zero_result_cause= "no matching row in const table";
572 573
    DBUG_PRINT("error",("Error: %s", zero_result_cause));
    error= 0;
574
    DBUG_RETURN(0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
575 576
  }
  if (!(thd->options & OPTION_BIG_SELECTS) &&
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
577
      best_read > (double) thd->variables.max_join_size &&
bk@work.mysql.com's avatar
bk@work.mysql.com committed
578 579
      !(select_options & SELECT_DESCRIBE))
  {						/* purecov: inspected */
580
    my_message(ER_TOO_BIG_SELECT, ER(ER_TOO_BIG_SELECT), MYF(0));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
581
    error= 1;					/* purecov: inspected */
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
582
    DBUG_RETURN(1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
583
  }
584
  if (const_tables && !thd->locked_tables &&
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
585
      !(select_options & SELECT_NO_UNLOCK))
586
    mysql_unlock_some_tables(thd, table, const_tables);
587

588
  if (!conds && outer_join)
589 590 591 592
  {
    /* Handle the case where we have an OUTER JOIN without a WHERE */
    conds=new Item_int((longlong) 1,1);	// Always true
  }
593 594
  select=make_select(*table, const_table_map,
		     const_table_map, conds, &error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
595
  if (error)
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
596 597
  {						/* purecov: inspected */
    error= -1;					/* purecov: inspected */
598
    DBUG_PRINT("error",("Error: make_select() failed"));
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
599
    DBUG_RETURN(1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
600
  }
601
  if (make_join_select(this, select, conds))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
602
  {
603 604
    zero_result_cause=
      "Impossible WHERE noticed after reading const tables";
605
    DBUG_RETURN(0);				// error == 0
bk@work.mysql.com's avatar
bk@work.mysql.com committed
606 607 608 609 610
  }

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

  /* Optimize distinct away if possible */
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
611 612
  {
    ORDER *org_order= order;
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
613
    order=remove_const(this, order,conds,&simple_order);
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
614 615 616 617 618 619 620
    /*
      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;
  }
621
  if (group_list || tmp_table_param.sum_func_count)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
622 623 624 625
  {
    if (! hidden_group_fields)
      select_distinct=0;
  }
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
626
  else if (select_distinct && tables - const_tables == 1)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
627
  {
628 629 630 631 632 633 634 635 636 637 638 639 640 641 642
    /*
      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
643
    JOIN_TAB *tab= &join_tab[const_tables];
644 645 646
    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
647 648
    if ((group_list=create_distinct_group(thd, order, fields_list,
				          &all_order_fields_used)))
649 650
    {
      bool skip_group= (skip_sort_order &&
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
651
			test_if_skip_sort_order(tab, group_list, select_limit,
652 653 654 655 656 657 658 659 660
						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)
661 662 663 664 665 666
	{
	  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
667
	    */
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
668
	    tmp_table_param.quick_group=0;
669
	  }
670
	  order=0;
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
671
        }
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
672
	group=1;				// For end_write_group
673 674
      }
      else
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
675
	group_list= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
676
    }
677
    else if (thd->is_fatal_error)			// End of memory
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
678
      DBUG_RETURN(1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
679
  }
680 681 682
  simple_group= 0;
  if (rollup.state == ROLLUP::STATE_NONE)
    group_list= remove_const(this, group_list, conds, &simple_group);
683
  if (!group_list && group)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
684 685 686 687 688
  {
    order=0;					// The output has only one row
    simple_order=1;
  }

689 690
  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
691 692
  if (procedure && procedure->group)
  {
693 694 695
    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
696 697
  }

698 699
  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
700 701
    order=0;

monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
702
  // Can't use sort on head table if using row cache
703
  if (full_join)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
704
  {
705
    if (group_list)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
706 707 708 709 710
      simple_group=0;
    if (order)
      simple_order=0;
  }

711 712 713 714 715 716 717 718 719
  /*
    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.
  */
720
  need_tmp= (const_tables != tables &&
bk@work.mysql.com's avatar
bk@work.mysql.com committed
721
	     ((select_distinct || !simple_order || !simple_group) ||
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
722
	      (group_list && order) ||
723
	      test(select_options & OPTION_BUFFER_RESULT)));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
724

725
  // No cache for MATCH
726
  make_join_readinfo(this,
727
		     (select_options & (SELECT_DESCRIBE |
728
					SELECT_NO_JOIN_CACHE)) |
serg@serg.mylan's avatar
serg@serg.mylan committed
729
		     (select_lex->ftfunc_list->elements ?
730
		      SELECT_NO_JOIN_CACHE : 0));
monty@donna.mysql.com's avatar
monty@donna.mysql.com committed
731

732 733 734 735
  /* Perform FULLTEXT search before all regular searches */
  if (!(select_options & SELECT_DESCRIBE))
    init_ftfuncs(thd, select_lex, test(order));

736 737 738
  /*
    is this simple IN subquery?
  */
739
  if (!group_list && !order &&
740
      unit->item && unit->item->substype() == Item_subselect::IN_SUBS &&
741
      tables == 1 && conds &&
742 743
      !unit->first_select()->next_select())
  {
744
    if (!having)
745
    {
746
      Item *where= 0;
747 748
      if (join_tab[0].type == JT_EQ_REF &&
	  join_tab[0].ref.items[0]->name == in_left_expr_name)
749
      {
750 751
	if (test_in_subselect(&where))
	{
752
	  join_tab[0].type= JT_UNIQUE_SUBQUERY;
753 754
	  error= 0;
	  DBUG_RETURN(unit->item->
755 756 757 758 759
		      change_engine(new
				    subselect_uniquesubquery_engine(thd,
								    join_tab,
								    unit->item,
								    where)));
760
	}
761
      }
762 763
      else if (join_tab[0].type == JT_REF &&
	       join_tab[0].ref.items[0]->name == in_left_expr_name)
764
      {
765 766
	if (test_in_subselect(&where))
	{
767
	  join_tab[0].type= JT_INDEX_SUBQUERY;
768 769
	  error= 0;
	  DBUG_RETURN(unit->item->
770 771 772 773 774 775
		      change_engine(new
				    subselect_indexsubquery_engine(thd,
								   join_tab,
								   unit->item,
								   where,
								   0)));
776
	}
777
      }
778
    } else if (join_tab[0].type == JT_REF_OR_NULL &&
779
	       join_tab[0].ref.items[0]->name == in_left_expr_name &&
780 781 782 783
	       having->type() == Item::FUNC_ITEM &&
	       ((Item_func *) having)->functype() ==
	       Item_func::ISNOTNULLTEST_FUNC)
    {
784
      join_tab[0].type= JT_INDEX_SUBQUERY;
785
      error= 0;
786 787 788 789 790

      if ((conds= remove_additional_cond(conds)))
	join_tab->info= "Using index; Using where";
      else
	join_tab->info= "Using index";
791

792
      DBUG_RETURN(unit->item->
793 794 795 796 797
		  change_engine(new subselect_indexsubquery_engine(thd,
								   join_tab,
								   unit->item,
								   conds,
								   1)));
798
    }
799

800
  }
801 802 803 804 805 806 807
  /*
    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
808 809

#ifdef HAVE_INNOBASE_DB
810
  if (need_tmp || select_distinct || group_list || order)
monty@donna.mysql.com's avatar
monty@donna.mysql.com committed
811
  {
812
    for (uint i_h = const_tables; i_h < tables; i_h++)
monty@donna.mysql.com's avatar
monty@donna.mysql.com committed
813
    {
814
      TABLE* table_h = join_tab[i_h].table;
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
815
      table_h->file->extra(HA_EXTRA_RETRIEVE_PRIMARY_KEY);
monty@donna.mysql.com's avatar
monty@donna.mysql.com committed
816 817 818 819
    }
  }
#endif

820
  DBUG_EXECUTE("info",TEST_join(this););
bk@work.mysql.com's avatar
bk@work.mysql.com committed
821 822 823 824 825
  /*
    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.
826
  */
827
  if (const_tables != tables &&
828
      (order || group_list) &&
829
      join_tab[const_tables].type != JT_ALL &&
830
      join_tab[const_tables].type != JT_FT &&
831
      join_tab[const_tables].type != JT_REF_OR_NULL &&
832
      (order && simple_order || group_list && simple_group))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
833
  {
834
    if (add_ref_to_table_cond(thd,&join_tab[const_tables]))
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
835
      DBUG_RETURN(1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
836 837 838
  }

  if (!(select_options & SELECT_BIG_RESULT) &&
839
      ((group_list && const_tables != tables &&
840
	(!simple_group ||
841
	 !test_if_skip_sort_order(&join_tab[const_tables], group_list,
serg@serg.mylan's avatar
serg@serg.mylan committed
842
				  unit->select_limit_cnt, 0))) || select_distinct) &&
843
      tmp_table_param.quick_group && !procedure)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
844 845 846
  {
    need_tmp=1; simple_order=simple_group=0;	// Force tmp table without sort
  }
847

848
  tmp_having= having;
849
  if (select_options & SELECT_DESCRIBE)
850 851
  {
    error= 0;
852
    DBUG_RETURN(0);
853
  }
854 855 856 857 858 859 860 861 862
  having= 0;

  /* 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();
863

864 865 866 867 868 869 870 871 872 873 874
    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 :
875 876
			   HA_POS_ERROR,
			   (char *) "")))
877
      DBUG_RETURN(1);
878 879 880 881 882 883 884 885 886 887 888

    /*
      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.
    */    
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
889
    if (tmp_having && 
890 891 892 893 894 895 896 897
	(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";
898
      if (create_sort_index(thd, this, group_list,
899
			    HA_POS_ERROR, HA_POS_ERROR) ||
900 901
	  alloc_group_fields(this, group_list) ||
	  make_sum_func_list(all_fields, fields_list, 1))
902 903 904 905 906
	DBUG_RETURN(1);
      group_list=0;
    }
    else
    {
907
      if (make_sum_func_list(all_fields, fields_list, 0))
908 909 910 911 912
	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";
913
	if (create_sort_index(thd, this, order,
914 915 916 917 918 919 920 921 922 923 924 925 926 927 928
                              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;
929
      JOIN_TAB *last_join_tab= join_tab+tables-1;
930 931
      do
      {
932
	if (used_tables & last_join_tab->table->map)
933
	  break;
934 935
	last_join_tab->not_used_in_distinct=1;
      } while (last_join_tab-- != join_tab);
936 937 938 939
      /* Optimize "select distinct b from t1 order by key_part_1 limit #" */
      if (order && skip_sort_order)
      {
 	/* Should always succeed */
940
	if (test_if_skip_sort_order(&join_tab[const_tables],
941 942 943 944 945
				    order, unit->select_limit_cnt, 0))
	  order=0;
      }
    }
    
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
946
    if (select_lex->master_unit()->uncacheable)
947 948 949
    {
      if (!(tmp_join= (JOIN*)thd->alloc(sizeof(JOIN))))
	DBUG_RETURN(-1);
950
      error= 0;				// Ensure that tmp_join.error= 0
951 952 953 954
      restore_tmp();
    }
  }

955
  error= 0;
956 957 958
  DBUG_RETURN(0);
}

959

960
/*
961
  Restore values in temporary join
962
*/
963
void JOIN::restore_tmp()
964
{
965
  memcpy(tmp_join, this, (size_t) sizeof(JOIN));
966 967
}

968

969 970 971 972
int
JOIN::reinit()
{
  DBUG_ENTER("JOIN::reinit");
973
  /* TODO move to unit reinit */
974 975 976 977 978 979
  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
980
  
981
  if (setup_tables(tables_list))
982
    DBUG_RETURN(1);
983
  
984
  /* Reset of sum functions */
985
  first_record= 0;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
986

987 988 989 990 991
  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);
992
    filesort_free_buffers(exec_tmp_table1);
993 994 995 996 997 998
  }
  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);
999
    filesort_free_buffers(exec_tmp_table2);
1000 1001
  }
  if (items0)
1002
    set_items_ref_array(items0);
1003

1004 1005 1006
  if (join_tab_save)
    memcpy(join_tab, join_tab_save, sizeof(JOIN_TAB) * tables);

1007 1008 1009
  if (tmp_join)
    restore_tmp();

1010 1011 1012 1013 1014 1015 1016
  if (sum_funcs)
  {
    Item_sum *func, **func_ptr= sum_funcs;
    while ((func= *(func_ptr++)))
      func->clear();
  }

1017 1018 1019
  DBUG_RETURN(0);
}

1020 1021 1022 1023

bool
JOIN::save_join_tab()
{
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1024
  if (!join_tab_save && select_lex->master_unit()->uncacheable)
1025
  {
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1026 1027
    if (!(join_tab_save= (JOIN_TAB*)thd->memdup((gptr) join_tab,
						sizeof(JOIN_TAB) * tables)))
1028 1029 1030 1031 1032 1033
      return 1;
  }
  return 0;
}


1034
/*
1035
  Exec select
1036 1037 1038 1039 1040 1041
*/
void
JOIN::exec()
{
  int      tmp_error;
  DBUG_ENTER("JOIN::exec");
1042
  
1043
  error= 0;
1044 1045 1046 1047
  if (procedure)
  {
    if (procedure->change_columns(fields_list) ||
	result->prepare(fields_list, unit))
1048 1049
    {
      thd->limit_found_rows= thd->examined_row_count= 0;
1050
      DBUG_VOID_RETURN;
1051
    }
1052
  }
1053

monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1054
  if (!tables_list)
1055 1056
  {                                           // Only test of functions
    if (select_options & SELECT_DESCRIBE)
monty@mysql.com's avatar
monty@mysql.com committed
1057
      select_describe(this, FALSE, FALSE, FALSE,
1058
		      (zero_result_cause?zero_result_cause:"No tables used"));
1059 1060 1061 1062 1063
    else
    {
      result->send_fields(fields_list,1);
      if (!having || having->val_int())
      {
1064 1065 1066
	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
1067
	  error= 1;
1068
	else
1069
	{
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1070
	  error= (int) result->send_eof();
1071 1072
	  send_records=1;
	}
1073 1074
      }
      else
1075
	error=(int) result->send_eof();
1076
    }
1077
    thd->limit_found_rows= thd->examined_row_count= 0;
1078 1079
    DBUG_VOID_RETURN;
  }
1080
  thd->limit_found_rows= thd->examined_row_count= 0;
1081 1082 1083

  if (zero_result_cause)
  {
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
1084
    (void) return_zero_rows(this, result, tables_list, fields_list,
1085
			    send_row_on_empty_set(),
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
1086 1087
			    select_options,
			    zero_result_cause,
1088
			    having, procedure,
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
1089
			    unit);
1090 1091 1092
    DBUG_VOID_RETURN;
  }

bk@work.mysql.com's avatar
bk@work.mysql.com committed
1093 1094
  if (select_options & SELECT_DESCRIBE)
  {
monty@mysql.com's avatar
monty@mysql.com committed
1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109
    /*
      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
1110
    if (order &&
1111
	(const_tables == tables ||
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1112
 	 ((simple_order || skip_sort_order) &&
1113
	  test_if_skip_sort_order(&join_tab[const_tables], order,
1114
				  select_limit, 0))))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1115
      order=0;
1116
    having= tmp_having;
1117
    select_describe(this, need_tmp,
1118
		    order != 0 && !skip_sort_order,
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
1119
		    select_distinct);
1120
    DBUG_VOID_RETURN;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1121 1122
  }

1123 1124 1125 1126
  JOIN *curr_join= this;
  List<Item> *curr_all_fields= &all_fields;
  List<Item> *curr_fields_list= &fields_list;
  TABLE *curr_tmp_table= 0;
1127

bk@work.mysql.com's avatar
bk@work.mysql.com committed
1128 1129 1130
  /* Create a tmp table if distinct or if the sort is too complicated */
  if (need_tmp)
  {
1131 1132 1133
    if (tmp_join)
      curr_join= tmp_join;
    curr_tmp_table= exec_tmp_table1;
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
1134 1135

    /* Copy data to the temporary table */
1136
    thd->proc_info= "Copying to tmp table";
1137 1138
    
    if ((tmp_error= do_select(curr_join, (List<Item> *) 0, curr_tmp_table, 0)))
1139
    {
1140 1141
      error= tmp_error;
      DBUG_VOID_RETURN;
1142
    }
1143 1144 1145 1146 1147
    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
1148
    /* Change sum_fields reference to calculated fields in tmp_table */
1149 1150
    curr_join->all_fields= *curr_all_fields;
    if (!items1)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1151
    {
1152 1153 1154
      items1= items0 + all_fields.elements;
      if (sort_and_group || curr_tmp_table->group)
      {
1155
	if (change_to_use_tmp_fields(thd, items1,
1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172
				     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;
1173
    set_items_ref_array(items1);
1174 1175 1176 1177 1178 1179 1180 1181
    
    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
1182 1183 1184
    }
    else
    {
1185 1186 1187
      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
1188
    }
1189 1190
    
    // procedure can't be used inside subselect => we do nothing special for it
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1191 1192
    if (procedure)
      procedure->update_refs();
1193 1194
    
    if (curr_tmp_table->group)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1195
    {						// Already grouped
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1196
      if (!curr_join->order && !curr_join->no_order && !skip_sort_order)
1197 1198
	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
1199
    }
1200
    
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1201
    /*
1202 1203 1204 1205 1206
      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
1207 1208
    */

1209 1210 1211 1212 1213
    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
1214 1215
    {					/* Must copy to another table */
      DBUG_PRINT("info",("Creating group table"));
1216
      
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1217
      /* Free first data from old join */
1218
      curr_join->join_free(0);
1219
      if (make_simple_join(curr_join, curr_tmp_table))
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1220
	DBUG_VOID_RETURN;
1221
      calc_group_buffer(curr_join, group_list);
1222 1223
      count_field_types(&curr_join->tmp_table_param,
			curr_join->tmp_all_fields1,
1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242
			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,
1243 1244
						HA_POS_ERROR,
						(char *) "")))
1245 1246 1247
	  DBUG_VOID_RETURN;
	curr_join->exec_tmp_table2= exec_tmp_table2;
      }
1248
      if (curr_join->group_list)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1249
      {
1250
	thd->proc_info= "Creating sort index";
1251 1252 1253 1254
	if (curr_join->join_tab == join_tab && save_join_tab())
	{
	  DBUG_VOID_RETURN;
	}
1255
	if (create_sort_index(thd, curr_join, curr_join->group_list,
1256
			      HA_POS_ERROR, HA_POS_ERROR) ||
1257
	    make_group_fields(this, curr_join))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1258
	{
1259
	  DBUG_VOID_RETURN;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1260
	}
1261
	curr_join->group_list= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1262
      }
1263
      
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1264
      thd->proc_info="Copying to group table";
1265
      tmp_error= -1;
1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279
      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;
	}
      }
1280 1281
      if (curr_join->make_sum_func_list(*curr_all_fields, *curr_fields_list,
					1) ||
1282 1283
	  (tmp_error= do_select(curr_join, (List<Item> *) 0, curr_tmp_table,
				0)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1284
      {
1285
	error= tmp_error;
1286
	DBUG_VOID_RETURN;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1287
      }
1288 1289 1290 1291 1292 1293 1294 1295
      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;
1296
	if (change_to_use_tmp_fields(thd, items2,
1297 1298 1299 1300 1301 1302 1303 1304
				     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;
1305
      set_items_ref_array(items2);
1306 1307 1308 1309 1310 1311 1312
      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 */
    
1313
    curr_join->join_free(0);			/* Free quick selects */
1314
    if (select_distinct && ! group_list)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1315 1316
    {
      thd->proc_info="Removing duplicates";
1317 1318 1319 1320
      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))
1321
	DBUG_VOID_RETURN;
1322 1323
      curr_join->tmp_having=0;
      curr_join->select_distinct=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1324
    }
1325 1326
    curr_tmp_table->reginfo.lock_type= TL_UNLOCK;
    if (make_simple_join(curr_join, curr_tmp_table))
1327
      DBUG_VOID_RETURN;
1328 1329 1330
    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
1331 1332
  }
  if (procedure)
1333 1334 1335
    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
1336 1337
      (procedure && (procedure->flags & PROC_GROUP)))
  {
1338 1339 1340 1341
    if (make_group_fields(this, curr_join))
    {
      DBUG_VOID_RETURN;
    }
1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365
    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;
1366
    set_items_ref_array(items3);
1367

1368 1369
    if (curr_join->make_sum_func_list(*curr_all_fields, *curr_fields_list,
				      1) || thd->is_fatal_error)
1370
      DBUG_VOID_RETURN;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1371
  }
1372
  if (curr_join->group_list || curr_join->order)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1373 1374 1375 1376
  {
    DBUG_PRINT("info",("Sorting for send_fields"));
    thd->proc_info="Sorting result";
    /* If we have already done the group, add HAVING to sorted table */
1377 1378
    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
1379
    {
1380 1381
      // Some tables may have been const
      curr_join->tmp_having->update_used_tables();
1382 1383 1384
      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
1385

1386 1387
      Item* sort_table_cond= make_cond_for_table(curr_join->tmp_having,
						 used_tables,
1388
						 used_tables);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1389 1390
      if (sort_table_cond)
      {
1391 1392
	if (!curr_table->select)
	  if (!(curr_table->select= new SQL_SELECT))
1393
	    DBUG_VOID_RETURN;
1394 1395
	if (!curr_table->select->cond)
	  curr_table->select->cond= sort_table_cond;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1396
	else					// This should never happen
1397
	{
1398
	  if (!(curr_table->select->cond=
1399
		new Item_cond_and(curr_table->select->cond,
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1400
				  sort_table_cond)))
1401
	    DBUG_VOID_RETURN;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1402 1403 1404 1405 1406
	  /*
	    Item_cond_and do not need fix_fields for execution, its parameters
	    are fixed or do not need fix_fields, too
	  */
	  curr_table->select->cond->quick_fix_field();
1407
	}
1408
	curr_table->select_cond= curr_table->select->cond;
1409 1410
	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
1411
					 "select and having"););
1412 1413 1414
	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
1415 1416 1417
	DBUG_EXECUTE("where",print_where(conds,"having after sort"););
      }
    }
1418
    {
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1419
      if (group)
1420
	curr_join->select_limit= HA_POS_ERROR;
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
1421
      else
1422
      {
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
1423 1424 1425 1426
	/*
	  We can abort sorting after thd->select_limit rows if we there is no
	  WHERE clause for any tables after the sorted one.
	*/
1427
	JOIN_TAB *curr_table= &curr_join->join_tab[curr_join->const_tables+1];
1428
	JOIN_TAB *end_table= &curr_join->join_tab[tables];
1429
	for (; curr_table < end_table ; curr_table++)
1430
	{
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1431 1432 1433 1434 1435 1436
	  /*
	    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.
	  */
1437 1438
	  if (curr_table->select_cond ||
	      (curr_table->keyuse && !curr_table->on_expr))
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
1439 1440
	  {
	    /* We have to sort all rows */
1441
	    curr_join->select_limit= HA_POS_ERROR;
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
1442 1443
	    break;
	  }
1444 1445
	}
      }
1446 1447 1448 1449
      if (curr_join->join_tab == join_tab && save_join_tab())
      {
	DBUG_VOID_RETURN;
      }
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
1450 1451 1452 1453 1454 1455 1456 1457 1458
      /*
	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.
      */
1459
      if (create_sort_index(thd, curr_join,
1460 1461
			    curr_join->group_list ? 
			    curr_join->group_list : curr_join->order,
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
1462 1463 1464
			    curr_join->select_limit,
			    (select_options & OPTION_FOUND_ROWS ?
			     HA_POS_ERROR : unit->select_limit_cnt)))
1465
	DBUG_VOID_RETURN;
1466
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1467
  }
1468
  curr_join->having= curr_join->tmp_having;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1469
  thd->proc_info="Sending data";
1470
  error= thd->net.report_error ||
1471
    do_select(curr_join, curr_fields_list, NULL, procedure);
Sinisa@sinisa.nasamreza.org's avatar
Sinisa@sinisa.nasamreza.org committed
1472 1473
  thd->limit_found_rows= curr_join->send_records;
  thd->examined_row_count= curr_join->examined_rows;
1474 1475
  DBUG_VOID_RETURN;
}
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1476

1477

1478 1479 1480 1481 1482
/*
  Clean up join. Return error that hold JOIN.
*/

int
1483
JOIN::cleanup()
1484
{
1485
  DBUG_ENTER("JOIN::cleanup");
1486 1487 1488
  select_lex->join= 0;

  if (tmp_join)
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1489 1490 1491 1492 1493 1494
  {
    if (join_tab != tmp_join->join_tab)
    {
      JOIN_TAB *tab, *end;
      for (tab= join_tab, end= tab+tables ; tab != end ; tab++)
      {
1495
	tab->cleanup();
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1496 1497 1498
      }
    }
    tmp_join->tmp_join= 0;
1499
    tmp_table_param.copy_field=0;
1500
    DBUG_RETURN(tmp_join->cleanup());
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
1501
  }
1502

1503
  lock=0;                                     // It's faster to unlock later
1504
  join_free(1);
1505 1506 1507 1508
  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
1509 1510 1511
  delete select;
  delete_dynamic(&keyuse);
  delete procedure;
1512 1513 1514
  for (SELECT_LEX_UNIT *lex_unit= select_lex->first_inner_unit();
       lex_unit != 0;
       lex_unit= lex_unit->next_unit())
1515
  {
1516
    error|= lex_unit->cleanup();
1517 1518
  }
  DBUG_RETURN(error);
1519 1520
}

1521

1522
int
1523
mysql_select(THD *thd, Item ***rref_pointer_array,
serg@serg.mylan's avatar
serg@serg.mylan committed
1524
	     TABLE_LIST *tables, uint wild_num, List<Item> &fields,
1525 1526 1527
	     COND *conds, uint og_num,  ORDER *order, ORDER *group,
	     Item *having, ORDER *proc_param, ulong select_options,
	     select_result *result, SELECT_LEX_UNIT *unit,
1528
	     SELECT_LEX *select_lex)
1529
{
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1530 1531
  int err;
  bool free_join= 1;
1532 1533
  DBUG_ENTER("mysql_select");

1534
  JOIN *join;
1535
  if (select_lex->join != 0)
1536
  {
1537
    join= select_lex->join;
1538 1539 1540
    // is it single SELECT in derived table, called in derived table creation
    if (select_lex->linkage != DERIVED_TABLE_TYPE ||
	(select_options & SELECT_DESCRIBE))
1541
    {
1542
      if (select_lex->linkage != GLOBAL_OPTIONS_TYPE)
1543
      {
1544
	//here is EXPLAIN of subselect or derived table
1545
	if (join->change_result(result))
1546 1547 1548
	{
	  DBUG_RETURN(-1);
	}
1549
      }
1550
      else
1551
      {
1552 1553 1554 1555 1556 1557
	if (join->prepare(rref_pointer_array, tables, wild_num,
			  conds, og_num, order, group, having, proc_param,
			  select_lex, unit))
	{
	  goto err;
	}
1558
      }
1559
    }
1560
    free_join= 0;
1561
    join->select_options= select_options;
1562
  }
1563 1564
  else
  {
1565 1566
    if (!(join= new JOIN(thd, fields, select_options, result)))
	DBUG_RETURN(-1);
1567 1568
    thd->proc_info="init";
    thd->used_tables=0;                         // Updated by setup_fields
1569 1570
    if (join->prepare(rref_pointer_array, tables, wild_num,
		      conds, og_num, order, group, having, proc_param,
1571
		      select_lex, unit))
1572
    {
1573
      goto err;
1574 1575 1576
    }
  }

monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1577
  if ((err= join->optimize()))
1578
  {
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1579 1580
    goto err;					// 1
  }
1581

1582
  if (thd->lex->describe & DESCRIBE_EXTENDED)
1583 1584 1585 1586 1587
  {
    join->conds_history= join->conds;
    join->having_history= (join->having?join->having:join->tmp_having);
  }

1588
  if (thd->net.report_error)
1589 1590 1591 1592
    goto err;

  join->exec();

1593
  if (thd->lex->describe & DESCRIBE_EXTENDED)
1594 1595 1596 1597 1598
  {
    select_lex->where= join->conds_history;
    select_lex->having= join->having_history;
  }

1599
err:
1600 1601 1602
  if (free_join)
  {
    thd->proc_info="end";
1603
    err= join->cleanup();
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1604 1605
    if (thd->net.report_error)
      err= -1;
1606
    delete join;
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1607
    DBUG_RETURN(err);
1608
  }
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
1609
  DBUG_RETURN(join->error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1610 1611 1612
}

/*****************************************************************************
1613 1614
  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
1615 1616
*****************************************************************************/

1617 1618
static ha_rows get_quick_record_count(THD *thd, SQL_SELECT *select,
				      TABLE *table,
serg@serg.mylan's avatar
serg@serg.mylan committed
1619
				      const key_map *keys,ha_rows limit)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1620 1621 1622 1623 1624 1625 1626
{
  int error;
  DBUG_ENTER("get_quick_record_count");
  if (select)
  {
    select->head=table;
    table->reginfo.impossible_range=0;
1627 1628
    if ((error=select->test_quick_select(thd, *(key_map *)keys,(table_map) 0,
					 limit)) == 1)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640
      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 */
}


1641 1642 1643 1644 1645 1646 1647
/*
  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
1648

bk@work.mysql.com's avatar
bk@work.mysql.com committed
1649 1650
static bool
make_join_statistics(JOIN *join,TABLE_LIST *tables,COND *conds,
1651
		     DYNAMIC_ARRAY *keyuse_array)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1652 1653
{
  int error;
1654 1655 1656
  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
1657 1658 1659 1660 1661 1662 1663 1664
  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;
1665 1666
  stat=(JOIN_TAB*) join->thd->calloc(sizeof(JOIN_TAB)*table_count);
  stat_ref=(JOIN_TAB**) join->thd->alloc(sizeof(JOIN_TAB*)*MAX_TABLES);
1667
  table_vector=(TABLE**) join->thd->alloc(sizeof(TABLE*)*(table_count*2));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1668 1669 1670 1671 1672 1673
  if (!stat || !stat_ref || !table_vector)
    DBUG_RETURN(1);				// Eom /* purecov: inspected */

  join->best_ref=stat_vector;

  stat_end=stat+table_count;
1674
  found_const_table_map= all_table_map=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1675 1676 1677 1678 1679 1680
  const_count=0;

  for (s=stat,i=0 ; tables ; s++,tables=tables->next,i++)
  {
    TABLE *table;
    stat_vector[i]=s;
1681 1682 1683 1684
    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
1685 1686
    table_vector[i]=s->table=table=tables->table;
    table->file->info(HA_STATUS_VARIABLE | HA_STATUS_NO_LOCK);// record count
1687
    table->quick_keys.clear_all();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1688 1689 1690 1691
    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;
1692
    s->join=join;
1693
    s->info=0;					// For describe
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1694 1695
    if ((s->on_expr=tables->on_expr))
    {
1696
      /* Left join */
1697 1698
      if (!table->file->records)
      {						// Empty table
1699
	s->key_dependent=s->dependent=0;	// Ignore LEFT JOIN depend.
1700 1701 1702
	set_position(join,const_count++,s,(KEYUSE*) 0);
	continue;
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1703 1704
      s->key_dependent=s->dependent=
	s->on_expr->used_tables() & ~(table->map);
1705 1706 1707 1708
      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
1709 1710 1711 1712 1713 1714 1715 1716
      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;
1717
    if ((table->system || table->file->records <= 1) && ! s->dependent &&
1718
	!(table->file->table_flags() & HA_NOT_EXACT_COUNT) &&
1719
        !table->fulltext_searched)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1720 1721 1722 1723 1724
    {
      set_position(join,const_count++,s,(KEYUSE*) 0);
    }
  }
  stat_vector[i]=0;
1725
  join->outer_join=outer_join;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1726 1727

  /*
1728 1729 1730 1731
    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
1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763
  */
  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)
1764 1765
    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
1766 1767
      DBUG_RETURN(1);

1768
  /* Read tables with 0 or 1 rows (system tables) */
1769
  join->const_table_map= 0;
1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787

  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
1788
  /* loop until no more const tables are found */
1789
  int ref_changed;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1790 1791
  do
  {
1792
    ref_changed = 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1793
    found_ref=0;
1794 1795 1796 1797 1798 1799 1800

    /*
      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
1801
    {
1802
      TABLE *table=s->table;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1803 1804
      if (s->dependent)				// If dependent on some table
      {
1805
	// All dep. must be constants
1806
	if (s->dependent & ~(found_const_table_map))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1807
	  continue;
1808
	if (table->file->records <= 1L &&
1809
	    !(table->file->table_flags() & HA_NOT_EXACT_COUNT))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1810
	{					// system table
1811
	  int tmp= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1812
	  s->type=JT_SYSTEM;
1813
	  join->const_table_map|=table->map;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1814
	  set_position(join,const_count++,s,(KEYUSE*) 0);
1815
	  if ((tmp= join_read_const_table(s,join->positions+const_count-1)))
1816 1817 1818 1819 1820 1821
	  {
	    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
1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832
	  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;
1833
	  s->keys.set_bit(key);               // QQ: remove this ?
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1834

1835 1836 1837
	  refs=0;
          const_ref.clear_all();
	  eq_part.clear_all();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1838 1839
	  do
	  {
1840
	    if (keyuse->val->type() != Item::NULL_ITEM && !keyuse->optimize)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1841
	    {
1842
	      if (!((~found_const_table_map) & keyuse->used_tables))
1843
		const_ref.set_bit(keyuse->keypart);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1844 1845
	      else
		refs|=keyuse->used_tables;
1846
	      eq_part.set_bit(keyuse->keypart);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1847 1848 1849 1850
	    }
	    keyuse++;
	  } while (keyuse->table == table && keyuse->key == key);

1851
	  if (eq_part.is_prefix(table->key_info[key].key_parts) &&
1852 1853
	      ((table->key_info[key].flags & (HA_NOSAME | HA_END_SPACE_KEY)) ==
	       HA_NOSAME) &&
1854
              !table->fulltext_searched)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1855 1856 1857
	  {
	    if (const_ref == eq_part)
	    {					// Found everything for ref.
1858 1859
	      int tmp;
	      ref_changed = 1;
1860
	      s->type= JT_CONST;
1861
	      join->const_table_map|=table->map;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1862
	      set_position(join,const_count++,s,start_keyuse);
1863
	      if (create_ref_for_key(join, s, start_keyuse,
1864
				     found_const_table_map))
1865 1866 1867 1868 1869 1870 1871 1872 1873
		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
1874 1875 1876 1877 1878 1879 1880 1881
	      break;
	    }
	    else
	      found_ref|= refs;		// Table is const if all refs are const
	  }
	}
      }
    }
1882
  } while (join->const_table_map & found_ref && ref_changed);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895

  /* 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;
1896
    s->read_time=(ha_rows) s->table->file->scan_time();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1897

1898 1899
    /*
      Set a max range of how many seeks we can expect when using keys
1900 1901
      This is can't be to high as otherwise we are likely to use
      table scan.
1902
    */
1903 1904
    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
1905 1906 1907
    if (s->worst_seeks < 2.0)			// Fix for small tables
      s->worst_seeks=2.0;

1908
    if (! s->const_keys.is_clear_all())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1909 1910
    {
      ha_rows records;
1911 1912 1913 1914 1915
      SQL_SELECT *select;
      select= make_select(s->table, found_const_table_map,
			  found_const_table_map,
			  s->on_expr ? s->on_expr : conds,
			  &error);
1916
      records= get_quick_record_count(join->thd, select, s->table,
serg@serg.mylan's avatar
serg@serg.mylan committed
1917
				      &s->const_keys, join->row_limit);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1918 1919 1920
      s->quick=select->quick;
      s->needed_reg=select->needed_reg;
      select->quick=0;
1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940
      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
1941 1942
      if (records != HA_POS_ERROR)
      {
1943
	s->found_records=records;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1944 1945
	s->read_time= (ha_rows) (s->quick ? s->quick->read_time : 0.0);
      }
1946
      delete select;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1947 1948 1949 1950 1951 1952 1953 1954
    }
  }

  /* 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;
1955
  join->found_const_table_map=found_const_table_map;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1956 1957

  if (join->const_tables != join->tables)
1958 1959
  {
    optimize_keyuse(join, keyuse_array);
1960
    find_best_combination(join,all_table_map & ~join->const_table_map);
1961
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1962 1963 1964 1965 1966 1967
  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
1968
  DBUG_RETURN(join->thd->killed || get_best_combination(join));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1969 1970 1971 1972
}


/*****************************************************************************
1973 1974 1975 1976 1977
  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
1978 1979 1980 1981 1982
*****************************************************************************/

typedef struct key_field_t {		// Used when finding key fields
  Field		*field;
  Item		*val;			// May be empty if diff constant
1983 1984
  uint		level;
  uint		optimize;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
1985 1986 1987
  bool		eq_func;
} KEY_FIELD;

1988 1989 1990 1991 1992 1993 1994 1995
/* 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
1996

1997 1998 1999 2000 2001 2002
  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
2003 2004 2005 2006 2007 2008 2009 2010

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
2011
    return start;				// No new fields, skip all
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023

  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())
	{
2024 2025 2026 2027
	  /*
	    If the value matches, we can use the key reference.
	    If not, we keep it until we have examined all new values
	  */
2028
	  if (old->val->eq(new_fields->val, old->field->binary()))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2029
	  {
2030 2031 2032 2033 2034
	    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
2035 2036
	  }
	}
2037 2038
	else if (old->eq_func && new_fields->eq_func &&
		 old->val->eq(new_fields->val, old->field->binary()))
2039

2040 2041 2042 2043 2044 2045 2046 2047 2048
	{
	  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
2049
	{
2050 2051 2052 2053 2054 2055
	  /* 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
2056
	}
2057
	else
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2058
	{
2059 2060 2061 2062 2063
	  /*
	    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
2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074
	  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 ;)
  {
2075
    if (old->level != and_level)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087
    {						// Not used in all levels
      if (old == --first_free)
	break;
      *old= *first_free;			// Remove old value
      continue;
    }
    old++;
  }
  return first_free;
}


2088 2089 2090 2091 2092 2093 2094 2095 2096 2097
/*
  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
2098
                                Is NULL for BETWEEN and IN
2099 2100 2101 2102 2103 2104 2105 2106 2107 2108
    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
2109
static void
2110
add_key_field(KEY_FIELD **key_fields,uint and_level, COND *cond,
2111
	      Field *field,bool eq_func,Item **value, uint num_values,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2112 2113
	      table_map usable_tables)
{
2114
  uint exists_optimize= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2115 2116 2117
  if (!(field->flags & PART_KEY_FLAG))
  {
    // Don't remove column IS NULL on a LEFT JOIN table
2118 2119
    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
2120
      return;					// Not a key. Skip it
2121
    exists_optimize= KEY_OPTIMIZE_EXISTS;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2122 2123 2124 2125
  }
  else
  {
    table_map used_tables=0;
2126 2127 2128
    bool optimizable=0;
    for (uint i=0; i<num_values; i++)
    {
2129 2130
      used_tables|=(value[i])->used_tables();
      if (!((value[i])->used_tables() & (field->table->map | RAND_TABLE_BIT)))
2131 2132 2133
        optimizable=1;
    }
    if (!optimizable)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2134 2135 2136
      return;
    if (!(usable_tables & field->table->map))
    {
2137 2138
      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
2139
	return;					// Can't use left join optimize
2140
      exists_optimize= KEY_OPTIMIZE_EXISTS;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2141 2142 2143 2144
    }
    else
    {
      JOIN_TAB *stat=field->table->reginfo.join_tab;
serg@serg.mylan's avatar
serg@serg.mylan committed
2145
      key_map possible_keys=field->key_start;
2146 2147
      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
2148

2149 2150 2151 2152 2153 2154 2155 2156
      /*
	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
2157 2158
         Field BETWEEN ...
         Field IN ...
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2159 2160 2161
      */
      stat[0].key_dependent|=used_tables;

2162 2163 2164 2165
      bool is_const=1;
      for (uint i=0; i<num_values; i++)
        is_const&= (*value)->const_item();
      if (is_const)
2166
        stat[0].const_keys.merge(possible_keys);
2167 2168
      /*
	We can't always use indexes when comparing a string index to a
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
2169 2170
	number. cmp_type() is checked to allow compare of dates to numbers.
        eq_func is NEVER true when num_values > 1
2171
       */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2172 2173
      if (!eq_func ||
	  field->result_type() == STRING_RESULT &&
2174 2175
	  (*value)->result_type() != STRING_RESULT &&
	  field->cmp_type() != (*value)->result_type())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2176
	return;
2177

2178 2179 2180 2181 2182 2183 2184 2185 2186 2187
      /*
        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
2188 2189
    }
  }
2190
  DBUG_ASSERT(num_values == 1);
2191 2192 2193 2194 2195
  /*
    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
2196
  /* Store possible eq field */
2197 2198
  (*key_fields)->field=		field;
  (*key_fields)->eq_func=	eq_func;
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
2199
  (*key_fields)->val=		*value;
2200 2201
  (*key_fields)->level=		and_level;
  (*key_fields)->optimize=	exists_optimize;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2202 2203 2204 2205 2206 2207 2208 2209 2210 2211
  (*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
2212
    List_iterator_fast<Item> li(*((Item_cond*) cond)->argument_list());
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2213 2214 2215 2216 2217 2218 2219 2220
    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++)
2221
	org_key_fields->level= *and_level;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247
    }
    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:
serg@serg.mylan's avatar
serg@serg.mylan committed
2248
    // BETWEEN, IN, NOT
2249
    if (cond_func->key_item()->real_item()->type() == Item::FIELD_ITEM &&
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
2250
	!(cond_func->used_tables() & OUTER_REF_TABLE_BIT))
2251
      add_key_field(key_fields,*and_level,cond_func,
serg@serg.mylan's avatar
serg@serg.mylan committed
2252 2253 2254
		    ((Item_field*)(cond_func->key_item()->real_item()))->field,
                    cond_func->argument_count() == 2 &&
                    cond_func->functype() == Item_func::IN_FUNC,
2255 2256
                    cond_func->arguments()+1, cond_func->argument_count()-1,
                    usable_tables);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2257 2258 2259 2260 2261 2262
    break;
  case Item_func::OPTIMIZE_OP:
  {
    bool equal_func=(cond_func->functype() == Item_func::EQ_FUNC ||
		     cond_func->functype() == Item_func::EQUAL_FUNC);

2263
    if (cond_func->arguments()[0]->real_item()->type() == Item::FIELD_ITEM &&
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
2264
	!(cond_func->arguments()[0]->used_tables() & OUTER_REF_TABLE_BIT))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2265
    {
2266
      add_key_field(key_fields,*and_level,cond_func,
2267 2268
		    ((Item_field*) (cond_func->arguments()[0])->real_item())
		    ->field,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2269
		    equal_func,
2270
                    cond_func->arguments()+1, 1, usable_tables);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2271
    }
2272
    if (cond_func->arguments()[1]->real_item()->type() == Item::FIELD_ITEM &&
2273
	cond_func->functype() != Item_func::LIKE_FUNC &&
2274
	!(cond_func->arguments()[1]->used_tables() & OUTER_REF_TABLE_BIT))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2275
    {
2276
      add_key_field(key_fields,*and_level,cond_func,
2277 2278
		    ((Item_field*) (cond_func->arguments()[1])->real_item())
		    ->field,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2279
		    equal_func,
2280
		    cond_func->arguments(),1,usable_tables);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2281 2282 2283 2284 2285
    }
    break;
  }
  case Item_func::OPTIMIZE_NULL:
    /* column_name IS [NOT] NULL */
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->used_tables() & OUTER_REF_TABLE_BIT))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2288
    {
2289
      Item *tmp=new Item_null;
2290
      if (unlikely(!tmp))                       // Should never be true
2291
	return;
2292
      add_key_field(key_fields,*and_level,cond_func,
2293 2294
		    ((Item_field*) (cond_func->arguments()[0])->real_item())
		    ->field,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2295
		    cond_func->functype() == Item_func::ISNULL_FUNC,
2296
		    &tmp, 1, usable_tables);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2297 2298 2299 2300 2301 2302 2303
    }
    break;
  }
  return;
}

/*
2304 2305
  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
2306 2307 2308
*/

static uint
2309
max_part_bit(key_part_map bits)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322
{
  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;

2323
  if (key_field->eq_func && !(key_field->optimize & KEY_OPTIMIZE_EXISTS))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2324 2325 2326
  {
    for (uint key=0 ; key < form->keys ; key++)
    {
2327
      if (!(form->keys_in_use_for_query.is_set(key)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340
	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;
2341
	  keyuse.keypart_map= (key_part_map) 1 << part;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2342
	  keyuse.used_tables=key_field->val->used_tables();
2343
	  keyuse.optimize= key_field->optimize & KEY_OPTIMIZE_REF_OR_NULL;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2344 2345 2346 2347 2348 2349 2350
	  VOID(insert_dynamic(keyuse_array,(gptr) &keyuse));
	}
      }
    }
  }
}

monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
2351 2352 2353

#define FT_KEYPART   (MAX_REF_PARTS+10)

bk@work.mysql.com's avatar
bk@work.mysql.com committed
2354 2355 2356 2357
static void
add_ft_keys(DYNAMIC_ARRAY *keyuse_array,
            JOIN_TAB *stat,COND *cond,table_map usable_tables)
{
2358
  Item_func_match *cond_func=NULL;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2359

2360 2361 2362
  if (!cond)
    return;

2363 2364
  if (cond->type() == Item::FUNC_ITEM)
  {
2365 2366 2367
    Item_func *func=(Item_func *)cond;
    Item_func::Functype functype=  func->functype();
    if (functype == Item_func::FT_FUNC)
2368
      cond_func=(Item_func_match *)cond;
2369 2370 2371 2372
    else if (func->arg_count == 2)
    {
      Item_func *arg0=(Item_func *)(func->arguments()[0]),
                *arg1=(Item_func *)(func->arguments()[1]);
2373 2374 2375 2376 2377
      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)
2378
        cond_func=(Item_func_match *) arg0;
2379 2380 2381
      else if (arg0->const_item() &&
               ((functype == Item_func::LE_FUNC && arg0->val()> 0) ||
                (functype == Item_func::LT_FUNC && arg0->val()>=0)) &&
2382
                arg1->type() == Item::FUNC_ITEM          &&
2383
                arg1->functype() == Item_func::FT_FUNC)
2384 2385
        cond_func=(Item_func_match *) arg1;
    }
2386 2387 2388
  }
  else if (cond->type() == Item::COND_ITEM)
  {
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
2389
    List_iterator_fast<Item> li(*((Item_cond*) cond)->argument_list());
2390 2391 2392 2393 2394

    if (((Item_cond*) cond)->functype() == Item_func::COND_AND_FUNC)
    {
      Item *item;
      while ((item=li++))
2395
        add_ft_keys(keyuse_array,stat,item,usable_tables);
2396 2397 2398
    }
  }

2399 2400
  if (!cond_func || cond_func->key == NO_SUCH_KEY ||
      !(usable_tables & cond_func->table->map))
2401
    return;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2402 2403 2404

  KEYUSE keyuse;
  keyuse.table= cond_func->table;
2405
  keyuse.val =  cond_func;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2406
  keyuse.key =  cond_func->key;
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
2407
  keyuse.keypart= FT_KEYPART;
2408
  keyuse.used_tables=cond_func->key_item()->used_tables();
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
2409
  keyuse.optimize= 0;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
2410
  keyuse.keypart_map= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2411 2412 2413
  VOID(insert_dynamic(keyuse_array,(gptr) &keyuse));
}

2414

bk@work.mysql.com's avatar
bk@work.mysql.com committed
2415 2416 2417
static int
sort_keyuse(KEYUSE *a,KEYUSE *b)
{
2418
  int res;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2419 2420 2421 2422 2423 2424
  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);
2425
  // Place const values before other ones
2426 2427
  if ((res= test((a->used_tables & ~OUTER_REF_TABLE_BIT)) -
       test((b->used_tables & ~OUTER_REF_TABLE_BIT))))
2428 2429 2430 2431
    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
2432 2433 2434 2435
}


/*
2436 2437 2438
  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
2439 2440 2441
*/

static bool
2442
update_ref_and_keys(THD *thd, DYNAMIC_ARRAY *keyuse,JOIN_TAB *join_tab,
2443 2444
		    uint tables, COND *cond, table_map normal_tables,
		    SELECT_LEX *select_lex)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2445 2446
{
  uint	and_level,i,found_eq_constant;
monty@mysql.com's avatar
monty@mysql.com committed
2447
  KEY_FIELD *key_fields, *end, *field;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2448

2449
  if (!(key_fields=(KEY_FIELD*)
monty@mashka.mysql.fi's avatar
merge  
monty@mashka.mysql.fi committed
2450
	thd->alloc(sizeof(key_fields[0])*
2451
		   (thd->lex->current_select->cond_count+1)*2)))
2452
    return TRUE; /* purecov: inspected */
monty@mysql.com's avatar
monty@mysql.com committed
2453 2454 2455 2456
  and_level= 0;
  field= end= key_fields;
  if (my_init_dynamic_array(keyuse,sizeof(KEYUSE),20,64))
    return TRUE;
2457
  if (cond)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2458
  {
2459
    add_key_fields(join_tab,&end,&and_level,cond,normal_tables);
monty@mysql.com's avatar
monty@mysql.com committed
2460
    for (; field != end ; field++)
hf@deer.(none)'s avatar
hf@deer.(none) committed
2461
    {
monty@mysql.com's avatar
monty@mysql.com committed
2462 2463 2464 2465 2466
      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
2467
    }
monty@mysql.com's avatar
monty@mysql.com committed
2468
  }
2469
  for (i=0 ; i < tables ; i++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2470
  {
2471
    if (join_tab[i].on_expr)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2472
    {
2473 2474
      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
2475 2476
    }
  }
2477
  /* fill keyuse with found key parts */
monty@mysql.com's avatar
monty@mysql.com committed
2478
  for ( ; field != end ; field++)
2479
    add_key_part(keyuse,field);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2480

2481
  if (select_lex->ftfunc_list->elements)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2482 2483 2484 2485 2486
  {
    add_ft_keys(keyuse,join_tab,cond,normal_tables);
  }

  /*
2487
    Special treatment for ft-keys.
2488 2489 2490
    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
2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507
  */
  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)
2508
	use->table->const_key_parts[use->key]|= use->keypart_map;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2509 2510
      if (use->keypart != FT_KEYPART)
      {
2511 2512 2513 2514 2515 2516 2517 2518
	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
2519 2520 2521 2522 2523 2524 2525 2526
      }

      *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;
2527
      use->table->reginfo.join_tab->checked_keys.set_bit(use->key);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2528 2529 2530 2531 2532 2533 2534 2535 2536
      save_pos++;
    }
    i=(uint) (save_pos-(KEYUSE*) keyuse->buffer);
    VOID(set_dynamic(keyuse,(gptr) &end,i));
    keyuse->elements=i;
  }
  return FALSE;
}

2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555
/*
  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
2556
    keyuse->ref_table_rows= ~(ha_rows) 0;	// If no ref
2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568
    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);
      }
    }
2569 2570 2571 2572 2573 2574
    /*
      Outer reference (external field) is constant for single executing
      of subquery
    */
    if (keyuse->used_tables == OUTER_REF_TABLE_BIT)
      keyuse->ref_table_rows= 1;
2575 2576 2577
  }
}

bk@work.mysql.com's avatar
bk@work.mysql.com committed
2578 2579

/*****************************************************************************
2580 2581
  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
2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595
*****************************************************************************/

/* 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];
2596
  for (;next != table ; pos++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619
  {
    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)
{
2620
  ha_rows rec;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2621
  double tmp;
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
2622
  THD *thd= join->thd;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2623 2624 2625 2626 2627 2628 2629 2630

  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 &&
2631 2632
	join->sort_by_table !=
	join->positions[join->const_tables].table->table)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654
      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;
2655
      uint best_max_key_part=0;
2656
      my_bool found_constraint= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2657 2658 2659 2660 2661 2662

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

	/* Test how we can use keys */
2666
	rec= s->records/MATCHING_ROWS_IN_OTHER_TABLE;  // Assumed records/key
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2667 2668
	for (keyuse=s->keyuse ; keyuse->table == table ;)
	{
2669
	  key_part_map found_part=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2670 2671 2672 2673
	  table_map found_ref=0;
	  uint key=keyuse->key;
	  KEY *keyinfo=table->key_info+key;
          bool ft_key=(keyuse->keypart == FT_KEYPART);
2674
	  uint found_ref_or_null= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2675

2676
	  /* Calculate how many key segments of the current key we can use */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2677 2678 2679 2680
	  start_key=keyuse;
	  do
	  {
            uint keypart=keyuse->keypart;
monty@mysql.com's avatar
monty@mysql.com committed
2681 2682
            table_map best_part_found_ref= 0;
            double best_prev_record_reads= DBL_MAX;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2683 2684
	    do
	    {
2685 2686 2687 2688
	      if (!(rest_tables & keyuse->used_tables) &&
		  !(found_ref_or_null & keyuse->optimize))
	      {
		found_part|=keyuse->keypart_map;
monty@mysql.com's avatar
monty@mysql.com committed
2689 2690 2691 2692 2693 2694 2695 2696
                double tmp= prev_record_reads(join,
					      (found_ref |
					       keyuse->used_tables));
                if (tmp < best_prev_record_reads)
                {
                  best_part_found_ref= keyuse->used_tables;
                  best_prev_record_reads= tmp;
                }
2697 2698
		if (rec > keyuse->ref_table_rows)
		  rec= keyuse->ref_table_rows;
monty@mysql.com's avatar
monty@mysql.com committed
2699 2700
		/*
		  If there is one 'key_column IS NULL' expression, we can
2701
		  use this ref_or_null optimisation of this field
monty@mysql.com's avatar
monty@mysql.com committed
2702 2703 2704
		*/
		found_ref_or_null|= (keyuse->optimize &
				     KEY_OPTIMIZE_REF_OR_NULL);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2705 2706 2707 2708
              }
	      keyuse++;
	    } while (keyuse->table == table && keyuse->key == key &&
		     keyuse->keypart == keypart);
monty@mysql.com's avatar
monty@mysql.com committed
2709
	    found_ref|= best_part_found_ref;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2710 2711 2712
	  } while (keyuse->table == table && keyuse->key == key);

	  /*
2713
	    Assume that that each key matches a proportional part of table.
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2714 2715 2716
	  */
          if (!found_part && !ft_key)
	    continue;				// Nothing usable found
2717 2718
	  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
2719 2720

          /*
2721
	    ft-keys require special treatment
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2722 2723 2724 2725
          */
          if (ft_key)
          {
            /*
2726 2727
	      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
2728 2729 2730 2731 2732 2733
            */
            tmp=prev_record_reads(join,found_ref);
            records=1.0;
          }
          else
          {
2734
	  found_constraint= 1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2735
	  /*
2736
	    Check if we found full key
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2737
	  */
2738 2739
	  if (found_part == PREV_BITS(uint,keyinfo->key_parts) &&
	      !found_ref_or_null)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2740
	  {				/* use eq key */
2741
	    max_key_part= (uint) ~0;
2742 2743
	    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
2744 2745 2746 2747 2748 2749
	    {
	      tmp=prev_record_reads(join,found_ref);
	      records=1.0;
	    }
	    else
	    {
2750 2751
	      if (!found_ref)
	      {					// We found a const key
2752
		if (table->quick_keys.is_set(key))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2753 2754
		  records= (double) table->quick_rows[key];
		else
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
2755 2756 2757 2758
		{
		  /* quick_range couldn't use key! */
		  records= (double) s->records/rec;
		}
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772
	      }
	      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
		}
	      }
2773 2774 2775
	      /* Limit the number of matched rows */
	      tmp= records;
	      set_if_smaller(tmp, (double) thd->variables.max_seeks_for_key);
2776
	      if (table->used_keys.is_set(key))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2777 2778 2779
	      {
		/* we can use only index tree */
		uint keys_per_block= table->file->block_size/2/
2780
		  (keyinfo->key_length+table->file->ref_length)+1;
2781
		tmp=record_count*(tmp+keys_per_block-1)/keys_per_block;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2782 2783
	      }
	      else
2784
		tmp=record_count*min(tmp,s->worst_seeks);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2785 2786 2787 2788 2789
	    }
	  }
	  else
	  {
	    /*
2790 2791 2792
	      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
2793
	    */
2794
	    if ((found_part & 1) &&
2795
		(!(table->file->index_flags(key,0,0) & HA_ONLY_WHOLE_INDEX) ||
2796
		 found_part == PREV_BITS(uint,keyinfo->key_parts)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2797
	    {
2798
	      max_key_part=max_part_bit(found_part);
2799 2800 2801 2802
	      /*
		Check if quick_range could determinate how many rows we
		will match
	      */
2803
	      if (table->quick_keys.is_set(key) &&
2804
		  table->quick_key_parts[key] == max_key_part)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2805 2806 2807 2808 2809 2810 2811 2812 2813
		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
		{
		  /*
2814
		    Assume that the first key part matches 1% of the file
2815
		    and that the hole key matches 10 (duplicates) or 1
2816 2817 2818 2819 2820
		    (unique) records.
		    Assume also that more key matches proportionally more
		    records
		    This gives the formula:
		    records= (x * (b-a) + a*c-b)/(c-1)
2821

2822 2823 2824 2825
		    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
2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845
		  */
		  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;
		}
2846 2847 2848 2849
		/*
		  If quick_select was used on a part of this key, we know
		  the maximum number of rows that the key can match.
		*/
monty@mysql.com's avatar
monty@mysql.com committed
2850
		if (table->quick_keys.is_set(key) &&
2851 2852 2853
		    table->quick_key_parts[key] <= max_key_part &&
		    records > (double) table->quick_rows[key])
		  tmp= records= (double) table->quick_rows[key];
monty@mysql.com's avatar
monty@mysql.com committed
2854
		else if (found_ref_or_null)
2855 2856 2857 2858 2859
		{
		  /* 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
2860
	      }
2861 2862
	      /* Limit the number of matched rows */
	      set_if_smaller(tmp, (double) thd->variables.max_seeks_for_key);
2863
	      if (table->used_keys.is_set(key))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2864 2865 2866
	      {
		/* we can use only index tree */
		uint keys_per_block= table->file->block_size/2/
2867
		  (keyinfo->key_length+table->file->ref_length)+1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2868 2869 2870 2871 2872 2873 2874 2875
		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
	  }
2876
          } /* not ft_key */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2877 2878 2879 2880 2881 2882
	  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;
2883
	    best_max_key_part=max_key_part;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2884 2885 2886 2887
	  }
	}
	records=best_records;
      }
2888 2889 2890 2891

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

	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.
2897 2898 2899
      */
      if ((records >= s->found_records || best > s->read_time) &&
	  !(s->quick && best_key && s->quick->index == best_key->key &&
2900
	    best_max_key_part >= s->table->quick_key_parts[best_key->key]) &&
2901
	  !((s->table->file->table_flags() & HA_TABLE_SCAN_ON_INDEX) &&
2902
	    ! s->table->used_keys.is_clear_all() && best_key) &&
2903
	  !(s->table->force_index && best_key))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2904
      {						// Check full join
2905 2906 2907 2908 2909 2910 2911 2912 2913 2914
        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;

2915 2916 2917 2918 2919 2920
        /*
          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)
2921
        {
2922 2923 2924 2925 2926
          /*
            For each record we:
             - read record range through 'quick'
             - skip rows which does not satisfy WHERE constraints
           */
2927
          tmp= record_count *
2928 2929
               (s->quick->read_time +
               (s->found_records - rnd_records)/(double) TIME_FOR_COMPARE);
2930 2931 2932
        }
        else
        {
2933 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
          /* 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;
          }
2961
        }
2962

2963
        /*
2964
          We estimate the cost of evaluating WHERE clause for found records
2965
          as record_count * rnd_records / TIME_FOR_COMPARE. This cost plus
2966
          tmp give us total cost of using TABLE SCAN
2967
        */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2968
	if (best == DBL_MAX ||
2969
	    (tmp  + record_count/(double) TIME_FOR_COMPARE*rnd_records <
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2970 2971
	     best + record_count/(double) TIME_FOR_COMPARE*records))
	{
2972 2973 2974 2975
	  /*
	    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
2976
	  best=tmp;
2977
	  records= rows2double(rnd_records);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2978 2979 2980
	  best_key=0;
	}
      }
2981
      join->positions[idx].records_read= records;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2982 2983 2984
      join->positions[idx].key=best_key;
      join->positions[idx].table= s;
      if (!best_key && idx == join->const_tables &&
2985
	  s->table == join->sort_by_table &&
2986
	  join->unit->select_limit_cnt >= records)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
2987 2988 2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005
	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;
	}
3006
	swap_variables(JOIN_TAB*, join->best_ref[idx], *pos);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3007 3008
	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
3009 3010
        if (thd->killed)
          return;
3011
	swap_variables(JOIN_TAB*, join->best_ref[idx], *pos);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3012 3013 3014 3015 3016 3017 3018 3019 3020
      }
      if (join->select_options & SELECT_STRAIGHT_JOIN)
	break;				// Don't test all combinations
    }
  }
}


/*
3021
  Find how much space the prevous read not const tables takes in cache
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3022 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
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
3059 3060 3061
static uint
cache_record_length(JOIN *join,uint idx)
{
3062
  uint length=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3063
  JOIN_TAB **pos,**end;
3064
  THD *thd=join->thd;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3065 3066 3067 3068 3069 3070

  for (pos=join->best_ref+join->const_tables,end=join->best_ref+idx ;
       pos != end ;
       pos++)
  {
    JOIN_TAB *join_tab= *pos;
3071 3072
    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
3073 3074 3075 3076 3077 3078 3079 3080 3081 3082
    length+=join_tab->used_fieldlength;
  }
  return length;
}


static double
prev_record_reads(JOIN *join,table_map found_ref)
{
  double found=1.0;
3083
  found_ref&= ~OUTER_REF_TABLE_BIT;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096
  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;
}


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

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

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

  join->full_join=0;

3117
  used_tables= OUTER_REF_TABLE_BIT;		// Outer row is already read
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3118 3119 3120 3121 3122 3123 3124 3125 3126
  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
3127 3128 3129 3130 3131
    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
3132 3133 3134

    if (j->type == JT_SYSTEM)
      continue;
3135
    if (j->keys.is_clear_all() || !(keyuse= join->best_positions[tablenr].key))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3136 3137 3138 3139 3140
    {
      j->type=JT_ALL;
      if (tablenr != join->const_tables)
	join->full_join=1;
    }
3141 3142 3143
    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
3144

3145 3146 3147 3148 3149
  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;
}
3150

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

3152 3153 3154 3155 3156 3157 3158 3159 3160
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;
3161

3162
  /*  Use best key from find_best */
3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177
  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;
3178 3179 3180 3181 3182 3183
    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
    */
3184 3185
    do
    {
3186
      if (!(~used_tables & keyuse->used_tables))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3187
      {
3188 3189
	if (keyparts == keyuse->keypart &&
	    !(found_part_ref_or_null & keyuse->optimize))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3190
	{
3191
	  keyparts++;
3192 3193
	  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
3194 3195
	}
      }
3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214 3215
      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;

3216 3217
  store_key **ref_key= j->ref.key_copy;
  byte *key_buff=j->ref.key_buff, *null_ref_key= 0;
3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239
  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
3240 3241 3242 3243
	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);
3244
	if (thd->is_fatal_error)
3245
	  return TRUE;
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
3246
	tmp.copy();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3247 3248
      }
      else
3249 3250 3251 3252
	*ref_key++= get_store_key(thd,
				  keyuse,join->const_table_map,
				  &keyinfo->key_part[i],
				  (char*) key_buff,maybe_null);
3253
      /*
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
3254
	Remeber if we are going to use REF_OR_NULL
3255 3256 3257
	But only if field _really_ can be null i.e. we force JT_REF
	instead of JT_REF_OR_NULL in case if field can't be null
      */
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
3258
      if ((keyuse->optimize & KEY_OPTIMIZE_REF_OR_NULL) && maybe_null)
3259
	null_ref_key= key_buff;
3260
      key_buff+=keyinfo->key_part[i].store_length;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3261
    }
3262 3263
  } /* not ftkey */
  *ref_key=0;				// end_marker
3264 3265 3266 3267
  if (j->type == JT_FT)
    return 0;
  if (j->type == JT_CONST)
    j->table->const_table= 1;
3268
  else if (((keyinfo->flags & (HA_NOSAME | HA_NULL_PART_KEY |
monty@mysql.com's avatar
monty@mysql.com committed
3269
			       HA_END_SPACE_KEY)) != HA_NOSAME) ||
monty@mysql.com's avatar
monty@mysql.com committed
3270
	   keyparts != keyinfo->key_parts || null_ref_key)
3271 3272 3273
  {
    /* Must read with repeat */
    j->type= null_ref_key ? JT_REF_OR_NULL : JT_REF;
3274
    j->ref.null_ref_key= null_ref_key;
3275
  }
3276
  else if (ref_key == j->ref.key_copy)
3277
  {
3278 3279 3280 3281 3282 3283 3284 3285
    /*
      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
3286
  }
3287 3288
  else
    j->type=JT_EQ_REF;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3289 3290 3291 3292
  return 0;
}


3293

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

/*
3324 3325
  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
3326 3327 3328 3329 3330
*/

bool
store_val_in_field(Field *field,Item *item)
{
3331
  bool error;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3332
  THD *thd=current_thd;
3333
  ha_rows cuted_fields=thd->cuted_fields;
3334 3335 3336 3337 3338
  /*
    we should restore old value of count_cuted_fields because
    store_val_in_field can be called from mysql_insert 
    with select_insert, which make count_cuted_fields= 1
   */
monty@mysql.com's avatar
monty@mysql.com committed
3339
  enum_check_fields old_count_cuted_fields= thd->count_cuted_fields;
3340
  thd->count_cuted_fields= CHECK_FIELD_WARN;
3341
  error= item->save_in_field(field, 1);
3342
  thd->count_cuted_fields= old_count_cuted_fields;
3343
  return error || cuted_fields != thd->cuted_fields;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3344 3345 3346 3347 3348 3349 3350 3351 3352
}


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

3353 3354
  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
3355 3356 3357 3358 3359 3360
    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
3361 3362 3363
  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
3364
  join->first_record=join->sort_and_group=0;
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
3365
  join->send_records=(ha_rows) 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3366
  join->group=0;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
3367
  join->row_limit=join->unit->select_limit_cnt;
3368
  join->do_send_rows = (join->row_limit) ? 1 : 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3369

serg@serg.mylan's avatar
serg@serg.mylan committed
3370
  join_tab->cache.buff=0;			/* No caching */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3371 3372 3373 3374 3375
  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
3376
  join_tab->keys.init(~0);                      /* test everything in quick */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3377 3378 3379
  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
3380 3381
  join_tab->not_used_in_distinct=0;
  join_tab->read_first_record= join_init_read_record;
3382
  join_tab->join=join;
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
3383
  bzero((char*) &join_tab->read_record,sizeof(join_tab->read_record));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398
  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
3399 3400 3401
    if (join->const_tables == join->tables &&
	join->thd->lex->current_select->master_unit() ==
	&join->thd->lex->unit)		// not upper level SELECT
3402
      join->const_table_map|=RAND_TABLE_BIT;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3403 3404 3405 3406 3407
    {						// 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())
3408 3409
      {
	DBUG_PRINT("info",("Found impossible WHERE condition"));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3410
	DBUG_RETURN(1);				// Impossible const condition
3411
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3412
    }
3413 3414
    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
3415 3416 3417 3418
    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
3419 3420 3421 3422
      /*
	Following force including random expression in last table condition.
	It solve problem with select like SELECT * FROM t1 WHERE rand() > 0.5
      */
3423
      if (i == join->tables-1)
3424
	current_map|= OUTER_REF_TABLE_BIT | RAND_TABLE_BIT;
3425
      bool use_quick_range=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3426
      used_tables|=current_map;
3427 3428

      if (tab->type == JT_REF && tab->quick &&
3429
	  (uint) tab->ref.key == tab->quick->index &&
3430 3431 3432 3433 3434 3435
	  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;
3436
        tab->ref.key= -1;
3437
	tab->ref.key_parts=0;		// Don't use ref key.
3438
	join->best_positions[i].records_read= rows2double(tab->quick->records);
3439 3440
      }

bk@work.mysql.com's avatar
bk@work.mysql.com committed
3441
      COND *tmp=make_cond_for_table(cond,used_tables,current_map);
3442 3443 3444 3445 3446 3447 3448 3449
      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
3450 3451 3452 3453
      if (tmp)
      {
	DBUG_EXECUTE("where",print_where(tmp,tab->table->table_name););
	SQL_SELECT *sel=tab->select=(SQL_SELECT*)
3454
	  join->thd->memdup((gptr) select, sizeof(SQL_SELECT));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3455 3456 3457 3458 3459 3460
	if (!sel)
	  DBUG_RETURN(1);			// End of memory
	tab->select_cond=sel->cond=tmp;
	sel->head=tab->table;
	if (tab->quick)
	{
3461 3462
	  /* Use quick key read if it's a constant and it's not used
	     with key reading */
3463
	  if (tab->needed_reg.is_clear_all() && tab->type != JT_EQ_REF
3464
	      && tab->type != JT_FT && (tab->type != JT_REF ||
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3465 3466 3467
	       (uint) tab->ref.key == tab->quick->index))
	  {
	    sel->quick=tab->quick;		// Use value from get_quick_...
3468 3469
	    sel->quick_keys.clear_all();
	    sel->needed_reg.clear_all();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3470 3471 3472 3473 3474 3475 3476 3477 3478 3479
	  }
	  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)
	{
3480 3481
	  if (!tab->const_keys.is_clear_all() &&
              tab->table->reginfo.impossible_range)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3482 3483
	    DBUG_RETURN(1);
	}
3484
	else if (tab->type == JT_ALL && ! use_quick_range)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3485
	{
3486
	  if (!tab->const_keys.is_clear_all() &&
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3487 3488 3489 3490
	      tab->table->reginfo.impossible_range)
	    DBUG_RETURN(1);				// Impossible range
	  /*
	    We plan to scan all rows.
3491 3492 3493
	    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
3494 3495
	  */

3496 3497 3498
	  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 <
3499
	       join->best_positions[i].records_read &&
3500
	       !(join->select_options & OPTION_FOUND_ROWS)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3501
	  {
3502 3503
	    /* Join with outer join condition */
	    COND *orig_cond=sel->cond;
3504 3505 3506
	    sel->cond= and_conds(sel->cond, tab->on_expr);
	    if (sel->cond && !sel->cond->fixed)
	      sel->cond->fix_fields(join->thd, 0, &sel->cond);
3507
	    if (sel->test_quick_select(join->thd, tab->keys,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3508
				       used_tables & ~ current_map,
3509 3510 3511
				       (join->select_options &
					OPTION_FOUND_ROWS ?
					HA_POS_ERROR :
3512
					join->unit->select_limit_cnt)) < 0)
3513 3514 3515 3516 3517
            {
	      /*
		Before reporting "Impossible WHERE" for the whole query
		we have to check isn't it only "impossible ON" instead
	      */
3518 3519
              sel->cond=orig_cond;
              if (!tab->on_expr ||
3520
                  sel->test_quick_select(join->thd, tab->keys,
3521 3522 3523 3524
                                         used_tables & ~ current_map,
                                         (join->select_options &
                                          OPTION_FOUND_ROWS ?
                                          HA_POS_ERROR :
3525 3526
                                          join->unit->select_limit_cnt)) < 0)
		DBUG_RETURN(1);			// Impossible WHERE
3527 3528 3529 3530
            }
            else
	      sel->cond=orig_cond;

3531 3532 3533
	    /* 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
3534 3535 3536 3537
	  }
	  else
	  {
	    sel->needed_reg=tab->needed_reg;
3538
	    sel->quick_keys.clear_all();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3539
	  }
3540 3541
	  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
3542
	  {
3543 3544 3545 3546
	    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
3547 3548 3549
			      (select->quick &&
			       (select->quick->records >= 100L)))) ?
	      2 : 1;
hf@deer.(none)'s avatar
hf@deer.(none) committed
3550
	    sel->read_tables= used_tables & ~current_map;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3551 3552 3553 3554 3555 3556 3557 3558 3559
	  }
	  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"););
3560 3561
	      tab->cache.select=(SQL_SELECT*)
		join->thd->memdup((gptr) sel, sizeof(SQL_SELECT));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3562 3563 3564 3565 3566 3567 3568 3569 3570 3571 3572 3573 3574
	      tab->cache.select->cond=tmp;
	      tab->cache.select->read_tables=join->const_table_map;
	    }
	  }
	}
      }
    }
  }
  DBUG_RETURN(0);
}


static void
3575
make_join_readinfo(JOIN *join, uint options)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3576 3577
{
  uint i;
3578
  bool statistics= test(!(join->select_options & SELECT_DESCRIBE));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3579 3580 3581 3582 3583 3584 3585 3586 3587 3588 3589 3590 3591 3592 3593 3594 3595 3596 3597
  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;
3598
      if (table->used_keys.is_set(tab->ref.key) &&
3599 3600 3601 3602 3603
          !table->no_keyread)
      {
        table->key_read=1;
        table->file->extra(HA_EXTRA_KEYREAD);
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3604 3605 3606
      break;
    case JT_EQ_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 3615
      delete tab->quick;
      tab->quick=0;
      tab->read_first_record= join_read_key;
      tab->read_record.read_record= join_no_more_records;
3616
      if (table->used_keys.is_set(tab->ref.key) &&
3617
	  !table->no_keyread)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3618 3619 3620 3621 3622
      {
	table->key_read=1;
	table->file->extra(HA_EXTRA_KEYREAD);
      }
      break;
3623
    case JT_REF_OR_NULL:
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3624 3625
    case JT_REF:
      table->status=STATUS_NO_RECORD;
3626 3627 3628 3629 3630
      if (tab->select)
      {
	delete tab->select->quick;
	tab->select->quick=0;
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3631 3632
      delete tab->quick;
      tab->quick=0;
3633
      if (table->used_keys.is_set(tab->ref.key) &&
3634
	  !table->no_keyread)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3635 3636 3637 3638
      {
	table->key_read=1;
	table->file->extra(HA_EXTRA_KEYREAD);
      }
3639 3640 3641 3642 3643 3644 3645 3646 3647 3648
      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
3649 3650 3651 3652 3653 3654 3655 3656
      break;
    case JT_FT:
      table->status=STATUS_NO_RECORD;
      tab->read_first_record= join_ft_read_first;
      tab->read_record.read_record= join_ft_read_next;
      break;
    case JT_ALL:
      /*
3657
	If previous table use cache
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3658 3659
      */
      table->status=STATUS_NO_RECORD;
3660
      if (i != join->const_tables && !(options & SELECT_NO_JOIN_CACHE) &&
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3661 3662 3663 3664 3665 3666 3667 3668 3669 3670 3671
	  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)
3672
      {
3673
	join->thd->server_status|=SERVER_QUERY_NO_GOOD_INDEX_USED;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3674
	tab->read_first_record= join_init_quick_read_record;
3675 3676
	if (statistics)
	  statistic_increment(select_range_check_count, &LOCK_status);
3677
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3678 3679 3680
      else
      {
	tab->read_first_record= join_init_read_record;
3681 3682 3683 3684
	if (i == join->const_tables)
	{
	  if (tab->select && tab->select->quick)
	  {
3685 3686
	    if (statistics)
	      statistic_increment(select_range_count, &LOCK_status);
3687 3688 3689
	  }
	  else
	  {
3690
	    join->thd->server_status|=SERVER_QUERY_NO_INDEX_USED;
3691 3692
	    if (statistics)
	      statistic_increment(select_scan_count, &LOCK_status);
3693 3694 3695 3696 3697 3698
	  }
	}
	else
	{
	  if (tab->select && tab->select->quick)
	  {
3699 3700
	    if (statistics)
	      statistic_increment(select_full_range_join_count, &LOCK_status);
3701 3702 3703
	  }
	  else
	  {
3704
	    join->thd->server_status|=SERVER_QUERY_NO_INDEX_USED;
3705 3706
	    if (statistics)
	      statistic_increment(select_full_join_count, &LOCK_status);
3707 3708
	  }
	}
3709
	if (!table->no_keyread)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3710
	{
3711
	  if (tab->select && tab->select->quick &&
3712
	      table->used_keys.is_set(tab->select->quick->index))
3713 3714 3715 3716
	  {
	    table->key_read=1;
	    table->file->extra(HA_EXTRA_KEYREAD);
	  }
3717 3718
	  else if (!table->used_keys.is_clear_all() &&
		   !(tab->select && tab->select->quick))
3719
	  {					// Only read index tree
serg@serg.mylan's avatar
serg@serg.mylan committed
3720
	    tab->index=find_shortest_key(table, & table->used_keys);
3721
	    tab->read_first_record= join_read_first;
3722 3723
	    tab->type=JT_NEXT;		// Read with index_first / index_next
	  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3724 3725 3726 3727 3728 3729 3730 3731 3732 3733 3734 3735 3736 3737 3738 3739
	}
      }
      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;
}


3740 3741 3742 3743 3744 3745 3746 3747 3748 3749 3750 3751 3752 3753 3754 3755 3756 3757 3758 3759 3760 3761
/*
  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++)
  {
3762
    if (tab->type == JT_ALL && (!tab->select || !tab->select->quick))
3763 3764 3765 3766 3767 3768 3769 3770 3771
    {
      my_error(ER_UPDATE_WITHOUT_KEY_IN_SAFE_MODE,MYF(0));
      return(1);
    }
  }
  return(0);
}


3772 3773 3774 3775 3776 3777 3778 3779 3780 3781 3782 3783 3784 3785 3786 3787 3788 3789 3790 3791 3792 3793
/*
  cleanup JOIN_TAB

  SYNOPSIS
    JOIN_TAB::cleanup()
*/

void JOIN_TAB::cleanup()
{
  delete select;
  select= 0;
  delete quick;
  quick= 0;
  x_free(cache.buff);
  cache.buff= 0;
  if (table)
  {
    if (table->key_read)
    {
      table->key_read= 0;
      table->file->extra(HA_EXTRA_NO_KEYREAD);
    }
3794
    table->file->ha_index_or_rnd_end();
3795 3796 3797 3798 3799 3800 3801 3802 3803 3804
    /*
      We need to reset this for next select
      (Tested in part_of_refkey)
    */
    table->reginfo.join_tab= 0;
  }
  end_read_record(&read_record);
}


3805 3806 3807 3808 3809 3810 3811 3812 3813 3814 3815 3816 3817
/*
  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
3818 3819
{
  JOIN_TAB *tab,*end;
3820
  DBUG_ENTER("JOIN::join_free");
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3821

3822 3823
  full= full || !select_lex->uncacheable;

3824
  if (table)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3825
  {
3826 3827 3828 3829
    /*
      Only a sorted table may be cached.  This sorted table is always the
      first non const table in join->table
    */
3830
    if (tables > const_tables) // Test for not-const tables
3831
    {
3832 3833
      free_io_cache(table[const_tables]);
      filesort_free_buffers(table[const_tables]);
3834
    }
3835 3836 3837 3838 3839 3840 3841 3842 3843 3844 3845 3846

    for (SELECT_LEX_UNIT *unit= select_lex->first_inner_unit(); unit;
         unit= unit->next_unit())
    {
      JOIN *join;
      for (SELECT_LEX *sl= unit->first_select_in_union(); sl;
           sl= sl->next_select())
        if ((join= sl->join))
          join->join_free(full);
    }

    if (full)
3847 3848 3849 3850 3851 3852
    {
      for (tab= join_tab, end= tab+tables; tab != end; tab++)
	tab->cleanup();
      table= 0;
    }
    else
3853
    {
3854
      for (tab= join_tab, end= tab+tables; tab != end; tab++)
3855
      {
3856 3857
	if (tab->table)
	    tab->table->file->ha_index_or_rnd_end();
3858
      }
3859
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3860
  }
3861

3862 3863 3864 3865
  /*
    We are not using tables anymore
    Unlock all tables. We may be in an INSERT .... SELECT statement.
  */
serg@serg.mylan's avatar
serg@serg.mylan committed
3866
  if (full && lock && thd->lock && !(select_options & SELECT_NO_UNLOCK) &&
3867
      !select_lex->subquery_in_having)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3868
  {
3869 3870 3871 3872 3873 3874 3875
    // TODO: unlock tables even if the join isn't top level select in the tree
    if (select_lex == (thd->lex->unit.fake_select_lex ?
                       thd->lex->unit.fake_select_lex : &thd->lex->select_lex))
    {
      mysql_unlock_read_tables(thd, lock);        // Don't free join->lock
      lock=0;
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3876
  }
3877

3878 3879
  if (full)
  {
3880 3881 3882
    group_fields.delete_elements();
    tmp_table_param.copy_funcs.delete_elements();
    tmp_table_param.cleanup();
3883
  }
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
3884
  DBUG_VOID_RETURN;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3885 3886 3887 3888
}


/*****************************************************************************
3889 3890 3891 3892 3893 3894 3895 3896 3897 3898 3899 3900 3901
  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
3902 3903 3904 3905 3906 3907 3908 3909 3910 3911 3912 3913 3914 3915 3916 3917 3918 3919 3920 3921 3922 3923 3924 3925
*****************************************************************************/

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)
      {
3926
	if ((*ref_item)->eq(order->item[0],0))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3927 3928 3929 3930 3931
	  break;
      }
      if (order)
      {
	found++;
monty@bitch.mysql.fi's avatar
monty@bitch.mysql.fi committed
3932
	DBUG_ASSERT(!(order->used & map));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3933 3934 3935 3936 3937 3938 3939 3940
	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 */
3941
  for (; found && start_order ; start_order=start_order->next)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3942 3943 3944 3945 3946 3947 3948 3949 3950 3951 3952 3953 3954 3955 3956 3957 3958
  {
    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)
3959
    return 0;			// skip this optimize /* purecov: inspected */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3960 3961 3962 3963 3964 3965 3966 3967 3968 3969 3970 3971 3972 3973 3974
  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;

3975
  for (; join_tab != end ; join_tab++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3976 3977 3978 3979 3980 3981 3982
  {
    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();
3983
    ref->depend_map=depend_map & ~OUTER_REF_TABLE_BIT;
3984
    depend_map&= ~OUTER_REF_TABLE_BIT;
3985
    for (JOIN_TAB **tab=join->map2table;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3986
	 depend_map ;
3987
	 tab++,depend_map>>=1 )
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3988 3989
    {
      if (depend_map & 1)
3990
	ref->depend_map|=(*tab)->ref.depend_map;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
3991 3992 3993 3994 3995 3996 3997 3998 3999
    }
  }
}


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

static void update_depend_map(JOIN *join, ORDER *order)
{
4000
  for (; order ; order=order->next)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4001 4002 4003 4004
  {
    table_map depend_map;
    order->item[0]->update_used_tables();
    order->depend_map=depend_map=order->item[0]->used_tables();
4005 4006
    // 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
4007
    {
4008
      for (JOIN_TAB **tab=join->map2table;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4009
	   depend_map ;
4010
	   tab++, depend_map>>=1)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4011 4012
      {
	if (depend_map & 1)
4013
	  order->depend_map|=(*tab)->ref.depend_map;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4014 4015 4016 4017 4018 4019 4020
      }
    }
  }
}


/*
4021 4022
  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
4023 4024 4025 4026 4027 4028 4029 4030 4031 4032 4033 4034 4035 4036 4037 4038 4039 4040 4041 4042 4043 4044 4045 4046 4047 4048
*/

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
4049
      continue;					// skip const item
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4050 4051 4052
    }
    else
    {
4053
      if (order_tables & (RAND_TABLE_BIT | OUTER_REF_TABLE_BIT))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4054 4055 4056 4057 4058 4059 4060 4061 4062 4063 4064 4065 4066 4067 4068 4069 4070 4071 4072 4073 4074 4075 4076 4077 4078 4079 4080 4081 4082 4083
	*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);
}

4084

bk@work.mysql.com's avatar
bk@work.mysql.com committed
4085
static int
4086 4087
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
4088 4089
		 const char *info, Item *having, Procedure *procedure,
		 SELECT_LEX_UNIT *unit)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4090 4091 4092 4093
{
  DBUG_ENTER("return_zero_rows");

  if (select_options & SELECT_DESCRIBE)
4094
  {
monty@mysql.com's avatar
monty@mysql.com committed
4095
    select_describe(join, FALSE, FALSE, FALSE, info);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4096 4097
    DBUG_RETURN(0);
  }
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
4098

4099 4100
  join->join_free(0);

bk@work.mysql.com's avatar
bk@work.mysql.com committed
4101 4102 4103 4104
  if (send_row)
  {
    for (TABLE_LIST *table=tables; table ; table=table->next)
      mark_as_null_row(table->table);		// All fields are NULL
4105
    if (having && having->val_int() == 0)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4106 4107
      send_row=0;
  }
4108
  if (!(result->send_fields(fields,1)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4109 4110
  {
    if (send_row)
4111 4112 4113 4114 4115
    {
      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
4116
      result->send_data(fields);
4117
    }
4118
    result->send_eof();				// Should be safe
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4119
  }
4120 4121
  /* 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
4122 4123 4124 4125 4126 4127 4128 4129 4130 4131 4132
  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
}

/*****************************************************************************
4133 4134 4135 4136 4137 4138
  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
4139 4140 4141 4142
*****************************************************************************/

class COND_CMP :public ilink {
public:
monty@donna.mysql.com's avatar
monty@donna.mysql.com committed
4143
  static void *operator new(size_t size) {return (void*) sql_alloc((uint) size); }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4144 4145 4146 4147 4148 4149 4150 4151 4152 4153 4154 4155 4156 4157 4158 4159
  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

/*
4160 4161
  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
4162 4163 4164 4165 4166 4167 4168 4169 4170 4171 4172 4173 4174 4175 4176 4177 4178 4179 4180 4181 4182 4183 4184 4185 4186
*/

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();

4187
  if (right_item->eq(field,0) && left_item != value)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4188 4189 4190 4191 4192 4193 4194 4195 4196 4197 4198 4199 4200 4201
  {
    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);
      }
4202
      func->set_cmp_func();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4203 4204
    }
  }
4205
  else if (left_item->eq(field,0) && right_item != value)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4206 4207 4208 4209 4210 4211 4212 4213 4214 4215 4216 4217 4218 4219 4220 4221
  {
    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);
      }
4222
      func->set_cmp_func();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4223 4224 4225 4226
    }
  }
}

4227 4228 4229 4230 4231 4232 4233 4234 4235 4236 4237 4238 4239 4240 4241 4242 4243 4244 4245 4246 4247 4248 4249 4250 4251 4252 4253 4254 4255 4256 4257 4258 4259
/*
  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
4260 4261

static void
4262
propagate_cond_constants(I_List<COND_CMP> *save_list,COND *and_father,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4263 4264 4265 4266 4267 4268
			 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
4269
    List_iterator_fast<Item> li(*((Item_cond*) cond)->argument_list());
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4270 4271 4272 4273 4274 4275 4276 4277 4278 4279 4280 4281 4282 4283 4284 4285 4286 4287
    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]);
    }
  }
4288
  else if (and_father != cond && !cond->marker)		// In a AND group
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4289 4290 4291 4292 4293 4294 4295 4296
  {
    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();
4297 4298 4299
      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
4300 4301 4302 4303 4304 4305
      {
	if (right_const)
	{
	  func->arguments()[1]=resolve_const_item(func->arguments()[1],
						  func->arguments()[0]);
	  func->update_used_tables();
4306
	  change_cond_ref_to_const(save_list,and_father,and_father,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4307 4308 4309 4310 4311 4312 4313 4314
				   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();
4315
	  change_cond_ref_to_const(save_list,and_father,and_father,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4316 4317 4318 4319 4320 4321 4322 4323 4324
				   func->arguments()[1],
				   func->arguments()[0]);
	}
      }
    }
  }
}


4325 4326 4327 4328 4329
/*
  Eliminate NOT functions from the condition tree.

  SYNPOSIS
    eliminate_not_funcs()
4330
    thd		thread handler
4331 4332 4333 4334 4335 4336 4337 4338 4339 4340 4341 4342 4343 4344 4345 4346
    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
*/

4347
COND *eliminate_not_funcs(THD *thd, COND *cond)
4348 4349 4350 4351 4352 4353 4354 4355 4356
{
  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++))
    {
4357
      Item *new_item= eliminate_not_funcs(thd, item);
4358 4359 4360 4361 4362 4363 4364
      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)
  {
4365
    COND *new_cond= ((Item_func*) cond)->arguments()[0]->neg_transformer(thd);
4366 4367 4368 4369 4370 4371 4372 4373 4374 4375 4376 4377 4378
    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.
      */
      cond= new_cond;
    }
  }
  return cond;
}


bk@work.mysql.com's avatar
bk@work.mysql.com committed
4379
static COND *
4380
optimize_cond(THD *thd, COND *conds, Item::cond_result *cond_value)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4381
{
4382
  SELECT_LEX *select= thd->lex->current_select;
4383
  DBUG_ENTER("optimize_cond");
4384 4385 4386 4387 4388 4389 4390 4391 4392 4393 4394 4395 4396 4397 4398 4399 4400 4401 4402 4403 4404 4405 4406 4407 4408 4409 4410
  if (conds)
  {
    DBUG_EXECUTE("where", print_where(conds, "original"););
    /* Eliminate NOT operators; in case of PS/SP do it once */
    if (thd->current_arena->is_first_stmt_execute())
    {
      Item_arena *arena= thd->current_arena, backup;
      thd->set_n_backup_item_arena(arena, &backup);
      conds= eliminate_not_funcs(thd, conds);
      select->prep_where= conds->copy_andor_structure(thd);
      thd->restore_backup_item_arena(arena, &backup);
    }
    else
      conds= eliminate_not_funcs(thd, conds);
    DBUG_EXECUTE("where", print_where(conds, "after negation elimination"););

    /* change field = field to field = const for each found field = const */
    propagate_cond_constants((I_List<COND_CMP> *) 0, conds, conds);
    /*
      Remove all instances of item == item
      Remove all and-levels where CONST item != CONST item
    */
    DBUG_EXECUTE("where", print_where(conds, "after const change"););
    conds= remove_eq_conds(thd, conds, cond_value);
    DBUG_EXECUTE("info", print_where(conds, "after remove"););
  }
  else
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4411 4412
  {
    *cond_value= Item::COND_TRUE;
4413
    select->prep_where= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4414
  }
4415
  DBUG_RETURN(conds);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4416 4417 4418 4419
}


/*
4420 4421 4422 4423 4424
  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
4425 4426 4427
*/

static COND *
4428
remove_eq_conds(THD *thd, COND *cond, Item::cond_result *cond_value)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4429 4430 4431 4432 4433 4434 4435
{
  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;
4436
    bool should_fix_fields=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4437 4438 4439 4440 4441

    *cond_value=Item::COND_UNDEF;
    Item *item;
    while ((item=li++))
    {
4442
      Item *new_item=remove_eq_conds(thd, item, &tmp_cond_value);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4443 4444 4445 4446 4447
      if (!new_item)
	li.remove();
      else if (item != new_item)
      {
	VOID(li.replace(new_item));
4448
	should_fix_fields=1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4449 4450 4451 4452 4453 4454 4455 4456 4457 4458 4459 4460 4461 4462 4463 4464 4465 4466 4467 4468 4469 4470 4471 4472 4473 4474
      }
      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 */
      }
    }
4475
    if (should_fix_fields)
4476
      cond->update_used_tables();
4477

bk@work.mysql.com's avatar
bk@work.mysql.com committed
4478 4479 4480 4481 4482 4483 4484 4485 4486 4487 4488 4489 4490 4491
    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)
  {
    /*
4492 4493 4494 4495 4496 4497 4498
      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
4499 4500 4501 4502 4503 4504 4505 4506
    */

    Item_func_isnull *func=(Item_func_isnull*) cond;
    Item **args= func->arguments();
    if (args[0]->type() == Item::FIELD_ITEM)
    {
      Field *field=((Item_field*) args[0])->field;
      if (field->flags & AUTO_INCREMENT_FLAG && !field->table->maybe_null &&
4507 4508
	  (thd->options & OPTION_AUTO_IS_NULL) &&
	  thd->insert_id())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4509
      {
4510
#ifndef EMBEDDED_LIBRARY
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
4511
	query_cache_abort(&thd->net);
4512
#endif
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4513 4514 4515
	COND *new_cond;
	if ((new_cond= new Item_func_eq(args[0],
					new Item_int("last_insert_id()",
4516
						     thd->insert_id(),
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4517 4518 4519
						     21))))
	{
	  cond=new_cond;
4520
	  cond->fix_fields(thd, 0, &cond);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4521
	}
4522
	thd->insert_id(0);		// Clear for next request
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4523 4524 4525 4526
      }
      /* fix to replace 'NULL' dates with '0' (shreeve@uci.edu) */
      else if (((field->type() == FIELD_TYPE_DATE) ||
		(field->type() == FIELD_TYPE_DATETIME)) &&
4527 4528
		(field->flags & NOT_NULL_FLAG) &&
	       !field->table->maybe_null)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4529 4530 4531 4532 4533
      {
	COND *new_cond;
	if ((new_cond= new Item_func_eq(args[0],new Item_int("0", 0, 2))))
	{
	  cond=new_cond;
4534
	  cond->fix_fields(thd, 0, &cond);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4535 4536 4537 4538 4539 4540 4541 4542 4543 4544 4545 4546 4547
	}
      }
    }
  }
  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];
4548
    if (left_item->eq(right_item,1))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4549 4550 4551 4552 4553 4554 4555
    {
      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;
4556
  return cond;					// Point at next and level
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4557 4558 4559
}

/*
4560
  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
4561 4562 4563 4564 4565 4566 4567 4568 4569
*/

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
4570
    List_iterator_fast<Item> li(*((Item_cond*) cond)->argument_list());
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4571 4572 4573 4574 4575 4576 4577 4578 4579 4580 4581 4582 4583 4584 4585 4586 4587 4588 4589 4590 4591 4592
    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];
4593
    if (left_item->eq(comp_item,1))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4594 4595 4596 4597
    {
      if (right_item->const_item())
      {
	if (*const_item)
4598
	  return right_item->eq(*const_item, 1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4599 4600 4601 4602
	*const_item=right_item;
	return 1;
      }
    }
4603
    else if (right_item->eq(comp_item,1))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4604 4605 4606 4607
    {
      if (left_item->const_item())
      {
	if (*const_item)
4608
	  return left_item->eq(*const_item, 1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4609 4610 4611 4612 4613 4614 4615 4616 4617 4618
	*const_item=left_item;
	return 1;
      }
    }
  }
  return 0;
}


/****************************************************************************
4619
  Create internal temporary table
bk@work.mysql.com's avatar
bk@work.mysql.com committed
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 4694 4695 4696 4697 4698 4699 4700 4701 4702 4703 4704 4705 4706 4707 4708 4709 4710 4711 4712 4713 4714 4715 4716 4717 4718 4719 4720 4721 4722 4723 4724 4725 4726 4727 4728 4729 4730
/*
  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;
}

4731 4732 4733 4734 4735 4736 4737 4738 4739 4740 4741
/*
  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
4742 4743
    from_field          if field will be created using other field as example,
                        pointer example field will be written here 
4744 4745 4746 4747 4748 4749 4750 4751 4752 4753 4754 4755 4756 4757
    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
*/

4758
Field *create_tmp_field(THD *thd, TABLE *table,Item *item, Item::Type type,
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
4759
			Item ***copy_func, Field **from_field,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4760 4761 4762 4763 4764 4765 4766 4767 4768 4769 4770
			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
4771
				0, item->name,table,&my_charset_bin);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4772 4773 4774
      else
	return new Field_double(item_sum->max_length,maybe_null,
				item->name, table, item_sum->decimals);
4775
    case Item_sum::VARIANCE_FUNC:		/* Place for sum & count */
4776
    case Item_sum::STD_FUNC:	
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4777 4778
      if (group)
	return	new Field_string(sizeof(double)*2+sizeof(longlong),
igor@hundin.mysql.fi's avatar
igor@hundin.mysql.fi committed
4779
				 0, item->name,table,&my_charset_bin);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4780 4781
      else
	return new Field_double(item_sum->max_length, maybe_null,
4782
				item->name,table,item_sum->decimals);				
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4783 4784 4785 4786 4787 4788 4789 4790 4791
    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,
4792
				  item->name,table,item->unsigned_flag);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4793 4794 4795
      case STRING_RESULT:
	if (item_sum->max_length > 255)
	  return  new Field_blob(item_sum->max_length,maybe_null,
4796
				 item->name,table,item->collation.collation);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4797
	return	new Field_string(item_sum->max_length,maybe_null,
4798
				 item->name,table,item->collation.collation);
4799
      case ROW_RESULT:
4800
      default:
4801 4802
	// This case should never be choosen
	DBUG_ASSERT(0);
4803
	thd->fatal_error();
4804
	return 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4805 4806
      }
    }
4807
    /* We never come here */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4808 4809
  }
  case Item::FIELD_ITEM:
4810
  case Item::DEFAULT_VALUE_ITEM:
4811 4812 4813
  {
    Item_field *field= (Item_field*) item;
    return create_tmp_field_from_field(thd, (*from_field= field->field),
4814
				       item, table, modify_item);
4815
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4816 4817 4818 4819
  case Item::FUNC_ITEM:
  case Item::COND_ITEM:
  case Item::FIELD_AVG_ITEM:
  case Item::FIELD_STD_ITEM:
4820
  case Item::SUBSELECT_ITEM:
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4821
    /* The following can only happen with 'CREATE TABLE ... SELECT' */
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
4822
  case Item::PROC_ITEM:
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4823 4824 4825 4826
  case Item::INT_ITEM:
  case Item::REAL_ITEM:
  case Item::STRING_ITEM:
  case Item::REF_ITEM:
4827
  case Item::NULL_ITEM:
4828
  case Item::VARBIN_ITEM:
4829 4830 4831
    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
4832
  {
4833 4834 4835 4836
    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
4837 4838 4839 4840 4841 4842 4843
  }
  default:					// Dosen't have to be stored
    return 0;
  }
}


4844 4845 4846 4847 4848 4849 4850
/*
  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
4851 4852 4853
TABLE *
create_tmp_table(THD *thd,TMP_TABLE_PARAM *param,List<Item> &fields,
		 ORDER *group, bool distinct, bool save_sum_fields,
4854 4855
		 ulong select_options, ha_rows rows_limit,
		 char *table_alias)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4856 4857 4858
{
  TABLE *table;
  uint	i,field_count,reclength,null_count,null_pack_length,
4859
        hidden_null_count, hidden_null_pack_length, hidden_field_count,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4860 4861
	blob_count,group_null_items;
  bool	using_unique_constraint=0;
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
4862
  bool  not_all_columns= !(select_options & TMP_TABLE_ALL_COLUMNS);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4863 4864 4865
  char	*tmpname,path[FN_REFLEN];
  byte	*pos,*group_buff;
  uchar *null_flags;
4866
  Field **reg_field, **from_field, **blob_field;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4867 4868 4869
  Copy_field *copy=0;
  KEY *keyinfo;
  KEY_PART_INFO *key_part_info;
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
4870
  Item **copy_func;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4871
  MI_COLUMNDEF *recinfo;
4872
  uint temp_pool_slot=MY_BIT_NONE;
4873

bk@work.mysql.com's avatar
bk@work.mysql.com committed
4874
  DBUG_ENTER("create_tmp_table");
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
4875
  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
4876
		      (int) distinct, (int) save_sum_fields,
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
4877
		      (ulong) rows_limit,test(group)));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4878

4879
  statistic_increment(created_tmp_tables, &LOCK_status);
4880

4881
  if (use_temp_pool)
4882
    temp_pool_slot = bitmap_set_next(&temp_pool);
4883 4884

  if (temp_pool_slot != MY_BIT_NONE) // we got a slot
4885
    sprintf(path, "%s%s_%lx_%i", mysql_tmpdir, tmp_file_prefix,
4886 4887
	    current_pid, temp_pool_slot);
  else // if we run out of slots or we are not using tempool
4888 4889
    sprintf(path,"%s%s%lx_%lx_%x",mysql_tmpdir,tmp_file_prefix,current_pid,
            thd->thread_id, thd->tmp_table++);
4890 4891 4892
  
  if (lower_case_table_names)
    my_casedn_str(files_charset_info, path);
4893

bk@work.mysql.com's avatar
bk@work.mysql.com committed
4894 4895 4896 4897 4898
  if (group)
  {
    if (!param->quick_group)
      group=0;					// Can't use group key
    else for (ORDER *tmp=group ; tmp ; tmp=tmp->next)
4899
    {
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4900
      (*tmp->item)->marker=4;			// Store null in key
4901 4902 4903
      if ((*tmp->item)->max_length >= MAX_CHAR_WIDTH)
	using_unique_constraint=1;
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4904 4905
    if (param->group_length >= MAX_BLOB_WIDTH)
      using_unique_constraint=1;
4906 4907
    if (group)
      distinct=0;				// Can't use distinct
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4908 4909 4910
  }

  field_count=param->field_count+param->func_count+param->sum_func_count;
4911
  hidden_field_count=param->hidden_field_count;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4912 4913
  if (!my_multi_malloc(MYF(MY_WME),
		       &table,sizeof(*table),
4914 4915 4916
		       &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
4917 4918 4919 4920 4921 4922 4923 4924 4925 4926 4927
		       &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))
  {
4928
    bitmap_clear_bit(&temp_pool, temp_pool_slot);
4929
    DBUG_RETURN(NULL);				/* purecov: inspected */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4930 4931 4932
  }
  if (!(param->copy_field=copy=new Copy_field[field_count]))
  {
4933
    bitmap_clear_bit(&temp_pool, temp_pool_slot);
4934 4935
    my_free((gptr) table,MYF(0));		/* purecov: inspected */
    DBUG_RETURN(NULL);				/* purecov: inspected */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4936
  }
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
4937
  param->items_to_copy= copy_func;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4938 4939 4940 4941 4942 4943 4944
  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;
4945
  table->blob_field= (Field_blob**) blob_field;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4946
  table->real_name=table->path=tmpname;
4947
  table->table_name= table_alias;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4948 4949 4950 4951
  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;
4952
  table->tmp_table= TMP_TABLE;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4953
  table->db_low_byte_first=1;			// True for HEAP and MyISAM
4954
  table->temp_pool_slot = temp_pool_slot;
4955
  table->copy_blobs= 1;
4956
  table->in_use= thd;
4957 4958 4959 4960 4961 4962
  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
4963

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

4966 4967
  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
4968

monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
4969
  List_iterator_fast<Item> li(fields);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4970 4971
  Item *item;
  Field **tmp_from_field=from_field;
4972
  while ((item=li++))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4973 4974
  {
    Item::Type type=item->type();
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
4975
    if (not_all_columns)
4976
    {
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
4977 4978 4979 4980 4981 4982 4983 4984 4985 4986
      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;
      }
4987
      if (item->const_item() && (int) hidden_field_count <= 0)
4988
        continue; // We don't have to store this
4989
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
4990 4991 4992 4993 4994 4995 4996 4997 4998
    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=
4999 5000
	    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
5001 5002 5003 5004 5005 5006 5007 5008
	  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)
5009 5010
	  {
	    *blob_field++= new_field;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5011
	    blob_count++;
5012
	  }
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
5013
	  ((Item_sum*) item)->args[i]= new Item_field(new_field);
5014 5015
          if (((Item_sum*) item)->arg_count == 1)
            ((Item_sum*) item)->result_field= new_field;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5016 5017 5018 5019 5020
	}
      }
    }
    else
    {
5021 5022 5023 5024 5025 5026 5027 5028 5029 5030
      /*
	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.
      */
5031
      Field *new_field=create_tmp_field(thd, table, item,type, &copy_func,
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
5032
					tmp_from_field, group != 0,
5033
					not_all_columns || group !=0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5034 5035
      if (!new_field)
      {
5036
	if (thd->is_fatal_error)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5037 5038 5039 5040 5041 5042 5043 5044 5045 5046
	  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)
5047 5048
      {
	*blob_field++= new_field;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5049
	blob_count++;
5050
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5051 5052 5053 5054 5055 5056 5057
      if (item->marker == 4 && item->maybe_null)
      {
	group_null_items++;
	new_field->flags|= GROUP_FLAG;
      }
      *(reg_field++) =new_field;
    }
5058 5059
    if (!--hidden_field_count)
      hidden_null_count=null_count;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5060
  }
5061
  DBUG_ASSERT(field_count >= (uint) (reg_field - table->field));
monty@donna.mysql.com's avatar
monty@donna.mysql.com committed
5062
  field_count= (uint) (reg_field - table->field);
5063
  *blob_field= 0;				// End marker
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5064 5065

  /* If result table is small; use a heap */
5066
  if (blob_count || using_unique_constraint ||
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5067 5068 5069 5070 5071 5072 5073 5074 5075 5076 5077 5078 5079 5080 5081 5082 5083 5084 5085
      (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)
5086 5087
  {
    /* We need to ensure that first byte is not 0 for the delete link */
5088
    if (param->hidden_field_count)
5089 5090 5091 5092 5093 5094 5095
      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
5096 5097 5098 5099 5100 5101 5102 5103
  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;
5104
    if (!(table->record[0]= (byte *) my_malloc(alloc_length*3, MYF(MY_WME))))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5105
      goto err;
5106
    table->record[1]= table->record[0]+alloc_length;
5107
    table->default_values= table->record[1]+alloc_length;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5108 5109 5110 5111 5112 5113 5114 5115 5116 5117 5118 5119 5120
  }
  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
5121 5122 5123 5124

    table->null_flags= (uchar*) table->record[0];
    table->null_fields= null_count+ hidden_null_count;
    table->null_bytes= null_pack_length;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5125 5126
  }
  null_count= (blob_count == 0) ? 1 : 0;
5127
  hidden_field_count=param->hidden_field_count;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5128 5129 5130 5131 5132 5133 5134 5135 5136 5137
  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)
      {
5138 5139 5140 5141
	/*
	  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
5142 5143 5144 5145 5146 5147 5148 5149 5150 5151 5152 5153 5154 5155 5156 5157 5158 5159 5160 5161 5162 5163 5164 5165 5166 5167 5168 5169 5170 5171 5172 5173 5174 5175
	*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
5176
      recinfo->type=FIELD_SKIP_ENDSPACE;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5177 5178
    else
      recinfo->type=FIELD_NORMAL;
5179 5180
    if (!--hidden_field_count)
      null_count=(null_count+7) & ~7;		// move to next byte
5181 5182 5183

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

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

5190
  if (thd->variables.tmp_table_size == ~(ulong) 0)		// No limit
5191 5192 5193
    table->max_rows= ~(ha_rows) 0;
  else
    table->max_rows=(((table->db_type == DB_TYPE_HEAP) ?
5194 5195 5196
		      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
5197 5198 5199 5200 5201 5202 5203 5204 5205 5206 5207 5208 5209 5210 5211 5212
  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;
5213
    keyinfo->algorithm= HA_KEY_ALG_UNDEF;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5214 5215
    for (; group ; group=group->next,key_part_info++)
    {
5216
      Field *field=(*group->item)->get_tmp_table_field();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5217
      bool maybe_null=(*group->item)->maybe_null;
5218
      key_part_info->null_bit=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5219 5220 5221 5222 5223 5224 5225 5226 5227 5228 5229
      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;
5230
	if (!(group->field=field->new_field(&thd->mem_root,table)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5231 5232 5233 5234
	  goto err; /* purecov: inspected */
	if (maybe_null)
	{
	  /*
5235 5236 5237 5238
	    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
5239
	  */
5240 5241 5242 5243 5244
	  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);
5245
	  group_buff++;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5246 5247 5248 5249 5250 5251 5252 5253 5254
	}
	else
	  group->field->move_field((char*) group_buff);
	group_buff+= key_part_info->length;
      }
      keyinfo->key_length+=  key_part_info->length;
    }
  }

5255
  if (distinct)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5256
  {
5257 5258 5259 5260 5261 5262
    /*
      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.
    */
5263 5264
    DBUG_PRINT("info",("hidden_field_count: %d", param->hidden_field_count));

5265
    null_pack_length-=hidden_null_pack_length;
5266
    keyinfo->key_parts= ((field_count-param->hidden_field_count)+
5267
			 test(null_pack_length));
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
5268 5269
    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
5270 5271 5272 5273 5274 5275 5276 5277 5278 5279 5280 5281
    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;
5282
    keyinfo->flags=HA_NOSAME | HA_NULL_ARE_EQUAL;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5283 5284
    keyinfo->key_length=(uint16) reclength;
    keyinfo->name=(char*) "tmp";
5285
    keyinfo->algorithm= HA_KEY_ALG_UNDEF;
5286
    if (null_pack_length)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5287
    {
5288
      key_part_info->null_bit=0;
5289 5290
      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
5291 5292 5293 5294 5295
      key_part_info->field=new Field_string((char*) table->record[0],
					    (uint32) key_part_info->length,
					    (uchar*) 0,
					    (uint) 0,
					    Field::NONE,
5296
					    NullS, table, &my_charset_bin);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5297 5298 5299 5300
      key_part_info->key_type=FIELDFLAG_BINARY;
      key_part_info->type=    HA_KEYTYPE_BINARY;
      key_part_info++;
    }
5301
    /* Create a distinct key over the columns we are going to return */
5302 5303
    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
5304 5305
	 i++, reg_field++, key_part_info++)
    {
5306
      key_part_info->null_bit=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5307 5308 5309 5310 5311 5312 5313 5314 5315 5316
      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;
    }
  }
5317
  if (thd->is_fatal_error)				// If end of memory
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5318 5319 5320 5321 5322 5323 5324
    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;
  }
5325 5326
  /* Set table_name for easier debugging */
  table->table_name= base_name(tmpname);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5327 5328 5329 5330
  if (!open_tmp_table(table))
    DBUG_RETURN(table);

 err:
5331 5332 5333 5334 5335
  /*
    Hack to ensure that free_blobs() doesn't fail if blob_field is not yet
    complete
  */
  *table->blob_field= 0;
5336
  free_tmp_table(thd,table);                    /* purecov: inspected */
5337
  bitmap_clear_bit(&temp_pool, temp_pool_slot);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5338 5339 5340 5341 5342 5343 5344 5345 5346 5347 5348 5349 5350 5351 5352 5353 5354 5355 5356
  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,
5357
				    ulong options)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5358 5359 5360 5361 5362 5363 5364 5365 5366 5367
{
  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;
5368
    HA_KEYSEG *seg= (HA_KEYSEG*) sql_calloc(sizeof(*seg) *
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5369 5370 5371 5372 5373 5374 5375 5376 5377 5378 5379 5380 5381 5382 5383 5384 5385 5386 5387 5388 5389 5390 5391 5392 5393 5394 5395 5396 5397 5398 5399 5400 5401 5402 5403
					    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;
5404
      seg->flag=     0;
5405
      seg->language= field->charset()->number;
5406 5407
      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
5408 5409 5410 5411 5412 5413 5414 5415 5416 5417 5418 5419 5420 5421 5422 5423 5424 5425 5426 5427
      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;
      }
5428
      if (!(field->flags & NOT_NULL_FLAG))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5429 5430 5431
      {
	seg->null_bit= field->null_bit;
	seg->null_pos= (uint) (field->null_ptr - (uchar*) table->record[0]);
5432 5433 5434 5435 5436 5437 5438
	/*
	  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
5439 5440 5441 5442 5443
      }
    }
  }
  MI_CREATE_INFO create_info;
  bzero((char*) &create_info,sizeof(create_info));
5444

5445 5446
  if ((options & (OPTION_BIG_TABLES | SELECT_SMALL_RESULT)) ==
      OPTION_BIG_TABLES)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5447 5448 5449 5450 5451 5452 5453 5454 5455 5456 5457 5458 5459
    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;
  }
5460
  statistic_increment(created_tmp_disk_tables, &LOCK_status);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5461 5462 5463 5464 5465 5466 5467 5468 5469 5470 5471 5472 5473 5474 5475 5476
  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";
5477
  free_blobs(entry);
5478
  if (entry->file)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5479
  {
5480 5481 5482 5483 5484 5485 5486 5487 5488 5489 5490
    if (entry->db_stat)
    {
      (void) entry->file->close();
    }
    /*
      We can't call ha_delete_table here as the table may created in mixed case
      here and we have to ensure that delete_table gets the table name in
      the original case.
    */
    if (!(test_flags & TEST_KEEP_TMP_TABLES) || entry->db_type == DB_TYPE_HEAP)
      entry->file->delete_table(entry->real_name);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5491 5492
    delete entry->file;
  }
5493

bk@work.mysql.com's avatar
bk@work.mysql.com committed
5494 5495
  /* free blobs */
  for (Field **ptr=entry->field ; *ptr ; ptr++)
5496
    (*ptr)->free();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5497 5498
  my_free((gptr) entry->record[0],MYF(0));
  free_io_cache(entry);
5499

5500
  bitmap_clear_bit(&temp_pool, entry->temp_pool_slot);
5501

bk@work.mysql.com's avatar
bk@work.mysql.com committed
5502 5503 5504 5505 5506 5507 5508 5509 5510 5511
  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
5512 5513
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
5514 5515 5516 5517 5518 5519 5520 5521 5522 5523 5524 5525 5526 5527 5528 5529 5530 5531 5532 5533
{
  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,
5534
			      thd->lex->select_lex.options | thd->options))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5535 5536 5537
    goto err2;
  if (open_tmp_table(&new_table))
    goto err1;
5538 5539
  if (table->file->indexes_are_disabled())
    new_table.file->disable_indexes(HA_KEY_SWITCH_ALL);
5540
  table->file->ha_index_or_rnd_end();
5541
  table->file->ha_rnd_init(1);
5542 5543
  if (table->no_rows)
  {
5544 5545
    new_table.file->extra(HA_EXTRA_NO_ROWS);
    new_table.no_rows=1;
5546 5547
  }

5548 5549 5550 5551 5552 5553 5554 5555 5556 5557 5558 5559 5560 5561
#ifdef TO_BE_DONE_LATER_IN_4_1
  /*
    To use start_bulk_insert() (which is new in 4.1) we need to find
    all places where a corresponding end_bulk_insert() should be put.
  */
  table->file->info(HA_STATUS_VARIABLE); /* update table->file->records */
  new_table.file->start_bulk_insert(table->file->records);
#else
  /*
    HA_EXTRA_WRITE_CACHE can stay until close, no need to disable it explicitly.
  */
  new_table.file->extra(HA_EXTRA_WRITE_CACHE);
#endif

bk@work.mysql.com's avatar
bk@work.mysql.com committed
5562 5563 5564 5565 5566 5567 5568 5569 5570 5571 5572 5573 5574 5575 5576
  /* 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 */
5577
  (void) table->file->ha_rnd_end();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5578 5579 5580 5581 5582 5583
  (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);
5584 5585
  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
5586 5587 5588 5589 5590
  DBUG_RETURN(0);

 err:
  DBUG_PRINT("error",("Got error: %d",write_err));
  table->file->print_error(error,MYF(0));	// Give table is full error
5591
  (void) table->file->ha_rnd_end();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5592 5593 5594 5595 5596 5597 5598 5599 5600 5601
  (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);
}


5602 5603 5604 5605 5606 5607
/****************************************************************************
  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
5608 5609 5610 5611

static int
do_select(JOIN *join,List<Item> *fields,TABLE *table,Procedure *procedure)
{
5612
  int error= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5613 5614 5615 5616 5617 5618
  JOIN_TAB *join_tab;
  int (*end_select)(JOIN *, struct st_join_table *,bool);
  DBUG_ENTER("do_select");

  join->procedure=procedure;
  /*
5619
    Tell the client how many fields there are in a row
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5620 5621 5622 5623 5624 5625 5626 5627
  */
  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
5628
  join->tmp_table= table;			/* Save for easy recursion */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5629 5630 5631 5632 5633 5634 5635 5636 5637
  join->fields= fields;

  /* Set up select_end */
  if (table)
  {
    if (table->group && join->tmp_table_param.sum_func_count)
    {
      if (table->keys)
      {
5638
	DBUG_PRINT("info",("Using end_update"));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5639
	end_select=end_update;
5640 5641
        if (!table->file->inited)
          table->file->ha_index_init(0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5642 5643
      }
      else
5644 5645
      {
	DBUG_PRINT("info",("Using end_unique_update"));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5646
	end_select=end_unique_update;
5647
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5648 5649 5650 5651 5652 5653 5654 5655 5656 5657 5658 5659 5660 5661 5662 5663 5664 5665 5666 5667 5668 5669 5670 5671 5672 5673
    }
    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)
  {
5674 5675 5676 5677
    /*
      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
5678
    if (!join->conds || join->conds->val_int())
5679
    {
5680 5681
      if (!(error=(*end_select)(join,join_tab,0)) || error == -3)
	error=(*end_select)(join,join_tab,1);
5682
    }
5683
    else if (join->send_row_on_empty_set())
5684
      error= join->result->send_data(*join->fields);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5685 5686 5687
  }
  else
  {
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
5688
    error= sub_select(join,join_tab,0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5689
    if (error >= 0)
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
5690
      error= sub_select(join,join_tab,1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5691
    if (error == -3)
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
5692
      error= 0;					/* select_limit used */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5693
  }
5694

bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
5695
  if (error >= 0)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5696
  {
5697 5698
    error=0;
    if (!table)					// If sending data to client
5699
    {
5700
      /*
5701 5702
	The following will unlock all cursors if the command wasn't an
	update command
5703
      */
5704
      join->join_free(0);				// Unlock all cursors
5705
      if (join->result->send_eof())
5706
	error= 1;				// Don't send error
5707
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5708 5709 5710 5711
    DBUG_PRINT("info",("%ld records output",join->send_records));
  }
  if (table)
  {
5712
    int tmp;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5713 5714
    if ((tmp=table->file->extra(HA_EXTRA_NO_CACHE)))
    {
5715 5716
      DBUG_PRINT("error",("extra(HA_EXTRA_NO_CACHE) failed"));
      my_errno= tmp;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5717 5718
      error= -1;
    }
5719
    if ((tmp=table->file->ha_index_or_rnd_end()))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5720
    {
5721
      DBUG_PRINT("error",("ha_index_or_rnd_end() failed"));
5722
      my_errno= tmp;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5723 5724
      error= -1;
    }
5725
    if (error == -1)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5726 5727
      table->file->print_error(my_errno,MYF(0));
  }
5728 5729 5730 5731 5732 5733
#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
5734
  DBUG_RETURN(error || join->thd->net.report_error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5735 5736 5737 5738 5739 5740 5741 5742 5743 5744 5745 5746 5747 5748
}


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);
  }
5749 5750 5751 5752 5753
  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
5754 5755 5756 5757 5758 5759 5760 5761 5762 5763 5764 5765 5766 5767 5768 5769 5770 5771 5772 5773 5774 5775 5776 5777
  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;
5778
  my_bool *report_error= &(join->thd->net.report_error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5779 5780 5781

  if (!(error=(*join_tab->read_first_record)(join_tab)))
  {
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
5782 5783 5784
    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
5785 5786
    READ_RECORD *info= &join_tab->read_record;

5787
    join->thd->row_count= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5788 5789 5790 5791 5792 5793 5794
    do
    {
      if (join->thd->killed)			// Aborted by user
      {
	my_error(ER_SERVER_SHUTDOWN,MYF(0));	/* purecov: inspected */
	return -2;				/* purecov: inspected */
      }
5795
      join->examined_rows++;
5796
      join->thd->row_count++;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5797 5798 5799 5800 5801 5802 5803
      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())
	{
5804
	  if ((error=(*join_tab->next_select)(join,join_tab+1,0)) < 0)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5805
	    return error;
5806 5807 5808 5809 5810
	  /*
	    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
5811 5812
	  if (not_used_in_distinct && found_records != join->found_records)
	    return 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5813
	}
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
5814
	else
5815 5816 5817 5818 5819 5820 5821
        {
          /* 
            This row failed selection, release lock on it.
            XXX: There is no table handler in MySQL which makes use of this
            call. It's kept from Gemini times. A lot of new code was added
            recently (i. e. subselects) without having it in mind.
          */
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
5822
	  info->file->unlock_row();
5823
        }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5824
      }
5825
    } while (!(error=info->read_record(info)) && !(*report_error));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5826
  }
5827
  if (error > 0 || (*report_error))				// Fatal error
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5828 5829 5830 5831
    return -1;

  if (!found && on_expr)
  {						// OUTER JOIN
5832
    restore_record(join_tab->table,default_values);		// Make empty record
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5833 5834 5835
    mark_as_null_row(join_tab->table);		// For group by without error
    if (!select_cond || select_cond->val_int())
    {
5836
      if ((error=(*join_tab->next_select)(join,join_tab+1,0)) < 0)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5837 5838 5839 5840 5841 5842 5843 5844
	return error;				/* purecov: inspected */
    }
  }
  return 0;
}


static int
5845
flush_cached_records(JOIN *join,JOIN_TAB *join_tab,bool skip_last)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5846 5847 5848 5849 5850 5851
{
  int error;
  READ_RECORD *info;

  if (!join_tab->cache.records)
    return 0;				/* Nothing to do */
5852
  if (skip_last)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5853 5854 5855 5856 5857 5858 5859 5860 5861 5862 5863 5864
    (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)))
  {
5865
    reset_cache_write(&join_tab->cache);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5866 5867 5868 5869 5870 5871 5872 5873 5874 5875 5876 5877 5878 5879 5880 5881 5882 5883 5884
    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 ||
5885
		   !join_tab->cache.select->skip_record()))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5886 5887
    {
      uint i;
5888
      reset_cache_read(&join_tab->cache);
5889
      for (i=(join_tab->cache.records- (skip_last ? 1 : 0)) ; i-- > 0 ;)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5890 5891
      {
	read_cached_record(join_tab);
5892
	if (!select || !select->skip_record())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5893
	  if ((error=(join_tab->next_select)(join,join_tab+1,0)) < 0)
5894 5895
          {
            reset_cache_write(&join_tab->cache);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5896
	    return error; /* purecov: inspected */
5897
          }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5898 5899 5900 5901
      }
    }
  } while (!(error=info->read_record(info)));

5902
  if (skip_last)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5903
    read_cached_record(join_tab);		// Restore current record
5904
  reset_cache_write(&join_tab->cache);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5905 5906 5907 5908 5909 5910 5911 5912 5913
  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;
}


/*****************************************************************************
5914 5915
  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
5916
*****************************************************************************/
5917 5918 5919

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

5920
int report_error(TABLE *table, int error)
5921 5922 5923 5924 5925 5926 5927 5928 5929 5930 5931 5932 5933 5934 5935 5936 5937 5938
{
  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;
}


5939
int safe_index_read(JOIN_TAB *tab)
5940 5941 5942 5943 5944 5945 5946 5947 5948 5949 5950
{
  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
5951
static int
5952
join_read_const_table(JOIN_TAB *tab, POSITION *pos)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5953 5954
{
  int error;
5955 5956 5957 5958 5959 5960 5961
  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
5962
  {
5963 5964 5965 5966 5967 5968 5969
    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
5970
    }
5971 5972 5973
  }
  else
  {
5974
    if (!table->key_read && table->used_keys.is_set(tab->ref.key) &&
5975 5976
	!table->no_keyread &&
        (int) table->reginfo.lock_type <= (int) TL_READ_HIGH_PRIORITY)
5977 5978 5979 5980
    {
      table->key_read=1;
      table->file->extra(HA_EXTRA_KEYREAD);
    }
5981
    if ((error=join_read_const(tab)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5982
    {
5983 5984 5985 5986 5987
      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
5988
    }
5989 5990 5991 5992 5993
    if (table->key_read)
    {
      table->key_read=0;
      table->file->extra(HA_EXTRA_NO_KEYREAD);
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
5994
  }
5995 5996 5997
  if (tab->on_expr && !table->null_row)
  {
    if ((table->null_row= test(tab->on_expr->val_int() == 0)))
5998 5999
      mark_as_null_row(table);  
  }
6000 6001
  if (!table->null_row)
    table->maybe_null=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6002 6003 6004 6005 6006 6007 6008 6009 6010 6011 6012
  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
  {
6013 6014
    if ((error=table->file->read_first_row(table->record[0],
					   table->primary_key)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6015 6016
    {
      if (error != HA_ERR_END_OF_FILE)
6017
	return report_error(table, error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6018 6019 6020 6021
      table->null_row=1;			// This is ok.
      empty_record(table);			// Make empty record
      return -1;
    }
6022
    store_record(table,record[1]);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6023 6024
  }
  else if (!table->status)			// Only happens with left join
6025
    restore_record(table,record[1]);			// restore old record
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6026 6027 6028 6029 6030 6031 6032 6033 6034 6035 6036 6037 6038 6039 6040 6041 6042 6043 6044 6045 6046 6047 6048 6049 6050
  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)
6051
	return report_error(table, error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6052 6053
      return -1;
    }
6054
    store_record(table,record[1]);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6055
  }
6056 6057 6058
  else if (!(table->status & ~STATUS_NULL_ROW))	// Only happens with left join
  {
    table->status=0;
6059
    restore_record(table,record[1]);			// restore old record
6060
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6061 6062 6063 6064 6065 6066 6067 6068 6069 6070 6071
  table->null_row=0;
  return table->status ? -1 : 0;
}


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

6072 6073
  if (!table->file->inited)
    table->file->ha_index_init(tab->ref.key);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6074
  if (cmp_buffer_with_ref(tab) ||
6075
      (table->status & (STATUS_GARBAGE | STATUS_NO_PARENT | STATUS_NULL_ROW)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6076 6077 6078 6079 6080 6081 6082 6083 6084 6085
  {
    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)
6086
      return report_error(table, error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6087
  }
6088
  table->null_row=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6089 6090 6091 6092 6093 6094 6095 6096 6097 6098
  return table->status ? -1 : 0;
}


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

6099 6100
  if (!table->file->inited)
    table->file->ha_index_init(tab->ref.key);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6101 6102 6103 6104 6105 6106 6107
  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)
6108
      return report_error(table, error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6109 6110 6111 6112 6113
    return -1; /* purecov: inspected */
  }
  return 0;
}

6114

6115 6116 6117 6118 6119 6120 6121 6122 6123 6124 6125
/*
  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;

6126 6127
  if (!table->file->inited)
    table->file->ha_index_init(tab->ref.key);
6128 6129 6130 6131 6132 6133 6134
  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)
6135
      return report_error(table, error);
6136 6137 6138 6139 6140
    return -1; /* purecov: inspected */
  }
  return 0;
}

bk@work.mysql.com's avatar
bk@work.mysql.com committed
6141 6142 6143 6144 6145 6146 6147 6148 6149 6150

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


static int
6151
join_read_next_same(READ_RECORD *info)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6152 6153 6154 6155 6156 6157 6158 6159 6160 6161
{
  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)
6162
      return report_error(table, error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6163 6164 6165 6166 6167 6168
    table->status= STATUS_GARBAGE;
    return -1;
  }
  return 0;
}

6169

6170 6171 6172 6173 6174 6175 6176 6177
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])))
6178
    return report_error(table, error);
6179 6180
  if (key_cmp_if_same(table, tab->ref.key_buff, tab->ref.key,
                      tab->ref.key_length))
6181 6182
  {
    table->status=STATUS_NOT_FOUND;
6183
    error= -1;
6184 6185 6186 6187
  }
  return error;
}

bk@work.mysql.com's avatar
bk@work.mysql.com committed
6188 6189 6190 6191 6192 6193 6194 6195 6196 6197 6198 6199 6200 6201 6202

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;
6203 6204
  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
6205 6206 6207 6208 6209 6210 6211 6212
}


static int
join_init_read_record(JOIN_TAB *tab)
{
  if (tab->select && tab->select->quick)
    tab->select->quick->reset();
6213 6214
  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
6215 6216 6217
  return (*tab->read_record.read_record)(&tab->read_record);
}

6218

bk@work.mysql.com's avatar
bk@work.mysql.com committed
6219
static int
6220
join_read_first(JOIN_TAB *tab)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6221 6222 6223
{
  int error;
  TABLE *table=tab->table;
6224
  if (!table->key_read && table->used_keys.is_set(tab->index) &&
6225
      !table->no_keyread)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6226 6227 6228 6229 6230
  {
    table->key_read=1;
    table->file->extra(HA_EXTRA_KEYREAD);
  }
  tab->table->status=0;
6231
  tab->read_record.read_record=join_read_next;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6232 6233 6234 6235
  tab->read_record.table=table;
  tab->read_record.file=table->file;
  tab->read_record.index=tab->index;
  tab->read_record.record=table->record[0];
6236 6237
  if (!table->file->inited)
    table->file->ha_index_init(tab->index);
6238
  if ((error=tab->table->file->index_first(tab->table->record[0])))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6239 6240
  {
    if (error != HA_ERR_KEY_NOT_FOUND && error != HA_ERR_END_OF_FILE)
6241
      report_error(table, error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6242 6243 6244 6245 6246
    return -1;
  }
  return 0;
}

6247

bk@work.mysql.com's avatar
bk@work.mysql.com committed
6248
static int
6249
join_read_next(READ_RECORD *info)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6250
{
6251 6252 6253
  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
6254 6255 6256
  return 0;
}

6257

bk@work.mysql.com's avatar
bk@work.mysql.com committed
6258
static int
6259
join_read_last(JOIN_TAB *tab)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6260 6261 6262
{
  TABLE *table=tab->table;
  int error;
6263
  if (!table->key_read && table->used_keys.is_set(tab->index) &&
6264
      !table->no_keyread)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6265 6266 6267 6268 6269
  {
    table->key_read=1;
    table->file->extra(HA_EXTRA_KEYREAD);
  }
  tab->table->status=0;
6270
  tab->read_record.read_record=join_read_prev;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6271 6272 6273 6274
  tab->read_record.table=table;
  tab->read_record.file=table->file;
  tab->read_record.index=tab->index;
  tab->read_record.record=table->record[0];
6275 6276
  if (!table->file->inited)
    table->file->ha_index_init(tab->index);
6277 6278
  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
6279 6280 6281
  return 0;
}

6282

bk@work.mysql.com's avatar
bk@work.mysql.com committed
6283
static int
6284
join_read_prev(READ_RECORD *info)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6285
{
6286 6287 6288
  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
6289 6290 6291
  return 0;
}

6292

bk@work.mysql.com's avatar
bk@work.mysql.com committed
6293 6294 6295 6296 6297 6298
static int
join_ft_read_first(JOIN_TAB *tab)
{
  int error;
  TABLE *table= tab->table;

6299 6300
  if (!table->file->inited)
    table->file->ha_index_init(tab->ref.key);
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
6301
#if NOT_USED_YET
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6302
  if (cp_buffer_from_ref(&tab->ref))       // as ft-key doesn't use store_key's
6303
    return -1;                             // see also FT_SELECT::init()
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6304
#endif
6305
  table->file->ft_init();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6306

6307 6308
  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
6309 6310 6311 6312 6313 6314
  return 0;
}

static int
join_ft_read_next(READ_RECORD *info)
{
6315 6316 6317
  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
6318 6319 6320 6321
  return 0;
}


6322 6323 6324 6325 6326 6327 6328 6329 6330 6331
/*
  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 */
6332
  *tab->ref.null_ref_key= 0;			// Clear null byte
6333 6334 6335 6336
  if ((res= join_read_always_key(tab)) >= 0)
    return res;

  /* Then read key with null value */
6337
  *tab->ref.null_ref_key= 1;			// Set null byte
6338 6339 6340 6341 6342 6343 6344 6345 6346 6347 6348 6349 6350
  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 */
6351
  if (*tab->ref.null_ref_key)
6352
    return -1;					// All keys read
6353 6354
  *tab->ref.null_ref_key= 1;			// Set null byte
  return safe_index_read(tab);			// then read null keys
6355 6356 6357
}


bk@work.mysql.com's avatar
bk@work.mysql.com committed
6358
/*****************************************************************************
6359 6360 6361
  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
6362 6363
*****************************************************************************/

6364
/* ARGSUSED */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6365 6366 6367 6368 6369 6370 6371 6372
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;
6373
    if (join->having && join->having->val_int() == 0)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6374
      DBUG_RETURN(0);				// Didn't match having
6375
    error=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6376 6377
    if (join->procedure)
      error=join->procedure->send_row(*join->fields);
6378
    else if (join->do_send_rows)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6379 6380 6381
      error=join->result->send_data(*join->fields);
    if (error)
      DBUG_RETURN(-1); /* purecov: inspected */
6382
    if (++join->send_records >= join->unit->select_limit_cnt &&
6383
	join->do_send_rows)
6384 6385 6386
    {
      if (join->select_options & OPTION_FOUND_ROWS)
      {
6387
	JOIN_TAB *jt=join->join_tab;
6388
	if ((join->tables == 1) && !join->tmp_table && !join->sort_and_group
6389
	    && !join->send_group_parts && !join->having && !jt->select_cond &&
6390
	    !(jt->select && jt->select->quick) &&
ram@gw.mysql.r18.ru's avatar
ram@gw.mysql.r18.ru committed
6391 6392
	    !(jt->table->file->table_flags() & HA_NOT_EXACT_COUNT) &&
            (jt->ref.key < 0))
6393
	{
6394
	  /* Join over all rows in table;  Return number of found rows */
6395 6396
	  TABLE *table=jt->table;

6397
	  join->select_options ^= OPTION_FOUND_ROWS;
igor@hundin.mysql.fi's avatar
igor@hundin.mysql.fi committed
6398 6399
	  if (table->sort.record_pointers ||
	      (table->sort.io_cache && my_b_inited(table->sort.io_cache)))
6400 6401
	  {
	    /* Using filesort */
igor@hundin.mysql.fi's avatar
igor@hundin.mysql.fi committed
6402
	    join->send_records= table->sort.found_records;
6403 6404 6405 6406 6407 6408
	  }
	  else
	  {
	    table->file->info(HA_STATUS_VARIABLE);
	    join->send_records = table->file->records;
	  }
6409 6410 6411
	}
	else 
	{
6412
	  join->do_send_rows= 0;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
6413 6414
	  if (join->unit->fake_select_lex)
	    join->unit->fake_select_lex->select_limit= HA_POS_ERROR;
6415 6416
	  DBUG_RETURN(0);
	}
6417
      }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6418
      DBUG_RETURN(-3);				// Abort nicely
6419
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6420 6421 6422 6423 6424 6425 6426 6427 6428 6429 6430 6431 6432 6433 6434 6435 6436 6437 6438 6439 6440 6441 6442 6443 6444 6445 6446
  }
  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)
      {
6447
	int error=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6448 6449
	if (join->procedure)
	{
6450
	  if (join->having && join->having->val_int() == 0)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6451
	    error= -1;				// Didn't satisfy having
6452 6453 6454 6455 6456 6457
 	  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
6458 6459 6460 6461 6462 6463
	  if (end_of_records && join->procedure->end_of_records())
	    error= 1;				// Fatal error
	}
	else
	{
	  if (!join->first_record)
6464 6465
	  {
	    /* No matching rows for group function */
6466
	    join->clear();
6467
	  }
6468
	  if (join->having && join->having->val_int() == 0)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6469
	    error= -1;				// Didn't satisfy having
6470 6471 6472 6473 6474 6475 6476 6477 6478 6479 6480
	  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
6481 6482 6483
	}
	if (error > 0)
	  DBUG_RETURN(-1);			/* purecov: inspected */
6484 6485
	if (end_of_records)
	  DBUG_RETURN(0);
6486
	if (join->send_records >= join->unit->select_limit_cnt &&
6487 6488 6489 6490 6491
	    join->do_send_rows)
	{
	  if (!(join->select_options & OPTION_FOUND_ROWS))
	    DBUG_RETURN(-3);				// Abort nicely
	  join->do_send_rows=0;
6492
	  join->unit->select_limit_cnt = HA_POS_ERROR;
6493
        }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6494 6495 6496 6497 6498 6499 6500 6501 6502 6503 6504 6505
      }
    }
    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);
6506 6507
      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
6508 6509 6510 6511 6512 6513 6514 6515 6516 6517 6518 6519 6520 6521 6522 6523 6524 6525 6526 6527 6528 6529 6530 6531 6532 6533 6534 6535 6536 6537
      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
6538
    copy_funcs(join->tmp_table_param.items_to_copy);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6539

6540
#ifdef TO_BE_DELETED
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6541 6542 6543 6544 6545 6546 6547 6548 6549
    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)
	{
6550
	  Field *field=item->get_tmp_table_field();
6551
	  field->ptr[-1]= (byte) (field->is_null() ? 1 : 0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6552 6553 6554
	}
      }
    }
6555
#endif
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6556 6557
    if (!join->having || join->having->val_int())
    {
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
6558
      join->found_records++;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6559 6560
      if ((error=table->file->write_row(table->record[0])))
      {
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
6561 6562 6563
	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
6564 6565
	if (create_myisam_from_heap(join->thd, table, &join->tmp_table_param,
				    error,1))
6566
	  DBUG_RETURN(-1);			// Not a table_is_full error
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
6567
	table->uniques=0;			// To ensure rows are the same
6568
      }
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
6569
      if (++join->send_records >= join->tmp_table_param.end_write_records &&
6570 6571 6572 6573 6574
	  join->do_send_rows)
      {
	if (!(join->select_options & OPTION_FOUND_ROWS))
	  DBUG_RETURN(-3);
	join->do_send_rows=0;
6575
	join->unit->select_limit_cnt = HA_POS_ERROR;
6576
	DBUG_RETURN(0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6577 6578 6579
      }
    }
  }
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
6580
end:
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6581 6582 6583 6584 6585 6586 6587 6588 6589 6590 6591 6592 6593 6594 6595 6596 6597 6598 6599 6600 6601 6602 6603
  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
6604
  join->found_records++;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6605 6606 6607 6608 6609 6610
  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
6611 6612 6613
#ifdef EMBEDDED_LIBRARY
    join->thd->net.last_errno= 0;
#endif
6614
    /* Store in the used key if the field was 0 */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6615
    if (item->maybe_null)
6616
      group->buff[-1]=item->null_value ? 1 : 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6617 6618 6619 6620 6621
  }
  if (!table->file->index_read(table->record[1],
			       join->tmp_table_param.group_buff,0,
			       HA_READ_KEY_EXACT))
  {						/* Update old record */
6622
    restore_record(table,record[1]);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6623 6624 6625 6626 6627 6628 6629 6630 6631 6632 6633 6634 6635 6636 6637 6638 6639 6640
    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
6641
  copy_funcs(join->tmp_table_param.items_to_copy);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6642 6643
  if ((error=table->file->write_row(table->record[0])))
  {
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
6644 6645
    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
6646 6647
      DBUG_RETURN(-1);				// Not a table_is_full error
    /* Change method to update rows */
6648
    table->file->ha_index_init(0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6649 6650 6651 6652 6653 6654 6655 6656 6657 6658 6659 6660 6661 6662 6663 6664 6665 6666 6667 6668 6669 6670 6671 6672 6673 6674
    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
6675
  copy_funcs(join->tmp_table_param.items_to_copy);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6676 6677 6678 6679 6680 6681 6682 6683 6684 6685 6686 6687 6688 6689 6690

  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 */
    }
6691
    restore_record(table,record[1]);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6692 6693 6694 6695 6696 6697 6698 6699 6700 6701 6702 6703 6704 6705 6706 6707 6708 6709 6710 6711 6712 6713 6714 6715 6716 6717 6718 6719 6720 6721 6722 6723 6724 6725 6726 6727 6728
    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)
6729 6730
	{
	  /* No matching rows for group function */
6731
	  join->clear();
6732
	}
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6733 6734 6735 6736 6737
	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
6738
	    if (create_myisam_from_heap(join->thd, table,
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
6739
					&join->tmp_table_param,
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6740
					error, 0))
6741
	      DBUG_RETURN(-1);			// Not a table_is_full error
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6742 6743 6744 6745 6746 6747 6748 6749 6750 6751
	  }
	  else
	    join->send_records++;
	}
	if (end_of_records)
	  DBUG_RETURN(0);
      }
    }
    else
    {
6752 6753
      if (end_of_records)
	DBUG_RETURN(0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6754 6755 6756 6757 6758 6759
      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
6760
      copy_funcs(join->tmp_table_param.items_to_copy);
6761 6762
      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
6763 6764 6765 6766 6767 6768 6769 6770 6771 6772 6773 6774 6775 6776
      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);
}


/*****************************************************************************
6777 6778 6779 6780 6781
  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
6782 6783 6784 6785 6786 6787 6788
*****************************************************************************/

/* 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;
6789 6790
  // 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
6791 6792
  {
    Item *ref_item=part_of_refkey(field->table,field);
6793
    if (ref_item && ref_item->eq(right_item,1))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6794 6795
    {
      if (right_item->type() == Item::FIELD_ITEM)
6796 6797
	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
6798
      {
6799 6800 6801
	/*
	  We can remove binary fields and numerical fields except float,
	  as float comparison isn't 100 % secure
monty@mysql.com's avatar
monty@mysql.com committed
6802
	  We have to keep binary strings to be able to check for end spaces
6803
	*/
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6804
	if (field->binary() &&
monty@mysql.com's avatar
monty@mysql.com committed
6805 6806
	    field->real_type() != FIELD_TYPE_STRING &&
	    field->real_type() != FIELD_TYPE_VAR_STRING &&
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6807 6808 6809 6810 6811 6812 6813 6814 6815 6816 6817 6818
	    (field->type() != FIELD_TYPE_FLOAT || field->decimals() == 0))
	{
	  return !store_val_in_field(field,right_item);
	}
      }
    }
  }
  return 0;					// keep test
}


static COND *
6819
make_cond_for_table(COND *cond, table_map tables, table_map used_table)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6820 6821 6822 6823 6824 6825 6826
{
  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)
    {
6827
      /* Create new top level AND item */
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6828 6829 6830 6831 6832 6833 6834 6835 6836 6837 6838 6839 6840 6841 6842 6843 6844
      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:
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
6845 6846 6847 6848 6849 6850 6851 6852
	/*
	  Item_cond_and do not need fix_fields for execution, its parameters
	  are fixed or do not need fix_fields, too
	*/
	new_cond->quick_fix_field();
	new_cond->used_tables_cache=
	  ((Item_cond_and*) cond)->used_tables_cache &
	  tables;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6853 6854 6855 6856 6857 6858 6859 6860 6861 6862 6863 6864 6865 6866 6867 6868 6869
	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);
      }
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
6870 6871 6872 6873 6874 6875
      /*
	Item_cond_and do not need fix_fields for execution, its parameters
	are fixed or do not need fix_fields, too
      */
      new_cond->quick_fix_field();
      new_cond->used_tables_cache= ((Item_cond_or*) cond)->used_tables_cache;
6876
      new_cond->top_level_item();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6877 6878 6879 6880 6881
      return new_cond;
    }
  }

  /*
6882 6883 6884
    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
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 6914 6915
  */

  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)
{
6916 6917 6918
  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
6919 6920 6921 6922 6923 6924 6925 6926
  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) &&
6927
	  !(key_part->key_part_flag & HA_PART_KEY_SEG))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6928 6929 6930 6931 6932 6933 6934
	return table->reginfo.join_tab->ref.items[part];
  }
  return (Item*) 0;
}


/*****************************************************************************
6935 6936 6937 6938 6939
  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
6940 6941
*****************************************************************************/

6942 6943
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
6944 6945 6946 6947 6948 6949
{
  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;
6950
  DBUG_ENTER("test_if_order_by_key");
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6951 6952 6953 6954 6955 6956 6957 6958 6959 6960

  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()
    */
6961 6962 6963
    for (; const_key_parts & 1 ; const_key_parts>>= 1)
      key_part++; 

bk@work.mysql.com's avatar
bk@work.mysql.com committed
6964
    if (key_part == key_part_end || key_part->field != field)
6965
      DBUG_RETURN(0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6966 6967

    /* set flag to 1 if we can use read-next on key, else to -1 */
6968
    flag= ((order->asc == !(key_part->key_part_flag & HA_REVERSE_SORT)) ? 1 : -1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6969
    if (reverse && flag != reverse)
6970
      DBUG_RETURN(0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6971 6972 6973
    reverse=flag;				// Remember if reverse
    key_part++;
  }
6974
  *used_key_parts= (uint) (key_part - table->key_info[idx].key_part);
6975
  DBUG_RETURN(reverse);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6976 6977
}

6978

serg@serg.mylan's avatar
serg@serg.mylan committed
6979
static uint find_shortest_key(TABLE *table, const key_map *usable_keys)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6980 6981 6982
{
  uint min_length= (uint) ~0;
  uint best= MAX_KEY;
serg@serg.mylan's avatar
serg@serg.mylan committed
6983
  if (!usable_keys->is_clear_all())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6984
  {
serg@serg.mylan's avatar
serg@serg.mylan committed
6985
    for (uint nr=0; nr < table->keys ; nr++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6986
    {
serg@serg.mylan's avatar
serg@serg.mylan committed
6987
      if (usable_keys->is_set(nr))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
6988
      {
6989 6990 6991 6992 6993
        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
6994 6995 6996 6997 6998 6999
      }
    }
  }
  return best;
}

7000
/*
7001 7002
  Test if a second key is the subkey of the first one.

7003 7004
  SYNOPSIS
    is_subkey()
7005 7006 7007 7008
    key_part		First key parts
    ref_key_part	Second key parts
    ref_key_part_end	Last+1 part of the second key

7009 7010
  NOTE
    Second key MUST be shorter than the first one.
7011

7012
  RETURN
7013 7014
    1	is a subkey
    0	no sub key
7015 7016 7017 7018 7019 7020 7021 7022 7023 7024 7025 7026 7027
*/

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;
}

/*
7028 7029
  Test if we can use one of the 'usable_keys' instead of 'ref' key for sorting

7030 7031
  SYNOPSIS
    test_if_subkey()
7032 7033 7034
    ref			Number of key, used for WHERE clause
    usable_keys		Keys for testing

7035
  RETURN
7036 7037
    MAX_KEY			If we can't use other key
    the number of found key	Otherwise
7038 7039 7040
*/

static uint
7041
test_if_subkey(ORDER *order, TABLE *table, uint ref, uint ref_key_parts,
7042
	       const key_map *usable_keys)
7043 7044 7045 7046 7047 7048 7049
{
  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;
7050

serg@serg.mylan's avatar
serg@serg.mylan committed
7051
  for (nr= 0 ; nr < table->keys ; nr++)
7052
  {
7053
    if (usable_keys->is_set(nr) &&
7054 7055 7056 7057 7058 7059 7060 7061 7062 7063 7064 7065
	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
7066

7067 7068 7069 7070 7071 7072 7073 7074 7075 7076
/*
  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
7077 7078

static bool
7079 7080
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
7081 7082
{
  int ref_key;
7083
  uint ref_key_parts;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7084 7085 7086 7087
  TABLE *table=tab->table;
  SQL_SELECT *select=tab->select;
  key_map usable_keys;
  DBUG_ENTER("test_if_skip_sort_order");
7088
  LINT_INIT(ref_key_parts);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7089 7090

  /* Check which keys can be used to resolve ORDER BY */
7091
  usable_keys.set_all();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7092 7093 7094 7095
  for (ORDER *tmp_order=order; tmp_order ; tmp_order=tmp_order->next)
  {
    if ((*tmp_order->item)->type() != Item::FIELD_ITEM)
    {
7096
      usable_keys.clear_all();
7097
      DBUG_RETURN(0);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7098
    }
7099 7100
    usable_keys.intersect(((Item_field*) (*tmp_order->item))->
			  field->part_of_sortkey);
serg@serg.mylan's avatar
serg@serg.mylan committed
7101
    if (usable_keys.is_clear_all())
7102
      DBUG_RETURN(0);					// No usable keys
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7103 7104 7105
  }

  ref_key= -1;
7106
  /* Test if constant range in WHERE */
7107
  if (tab->ref.key >= 0 && tab->ref.key_parts)
7108 7109 7110
  {
    ref_key=	   tab->ref.key;
    ref_key_parts= tab->ref.key_parts;
7111 7112
    if (tab->type == JT_REF_OR_NULL)
      DBUG_RETURN(0);
7113
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7114
  else if (select && select->quick)		// Range found by opt_range
7115 7116 7117 7118
  {
    ref_key=	   select->quick->index;
    ref_key_parts= select->quick->used_key_parts;
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7119 7120 7121

  if (ref_key >= 0)
  {
7122 7123 7124
    /*
      We come here when there is a REF key.
    */
7125
    int order_direction;
7126
    uint used_key_parts;
7127
    if (!usable_keys.is_set(ref_key))
7128 7129 7130 7131
    {
      /*
	We come here when ref_key is not among usable_keys
      */
7132 7133 7134 7135 7136
      uint new_ref_key;
      /*
	If using index only read, only consider other possible index only
	keys
      */
7137
      if (table->used_keys.is_set(ref_key))
7138
	usable_keys.intersect(table->used_keys);
7139
      if ((new_ref_key= test_if_subkey(order, table, ref_key, ref_key_parts,
7140
				       &usable_keys)) < MAX_KEY)
7141
      {
7142
	/* Found key that can be used to retrieve data in sorted order */
7143 7144
	if (tab->ref.key >= 0)
	{
7145
	  tab->ref.key= new_ref_key;
7146 7147 7148
	}
	else
	{
7149
          select->quick->file->ha_index_end();
7150
	  select->quick->index= new_ref_key;
7151 7152
	  select->quick->init();
	}
7153
	ref_key= new_ref_key;
7154
      }
7155
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7156
    /* Check if we get the rows in requested sorted order by using the key */
7157
    if (usable_keys.is_set(ref_key) &&
7158 7159
	(order_direction = test_if_order_by_key(order,table,ref_key,
						&used_key_parts)))
7160
    {
7161
      if (order_direction == -1)		// If ORDER BY ... DESC
7162
      {
7163 7164
	if (select && select->quick)
	{
7165 7166 7167 7168 7169
	  /*
	    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())
7170
	  {
7171
            // here used_key_parts >0
7172
            if (!(table->file->index_flags(ref_key,used_key_parts-1, 1)
7173
                  & HA_READ_PREV))
7174
              DBUG_RETURN(0);			// Use filesort
7175 7176 7177 7178 7179 7180 7181 7182 7183
	    // 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;
7184 7185 7186 7187 7188 7189 7190
	  }
	  DBUG_RETURN(1);
	}
	if (tab->ref.key_parts < used_key_parts)
	{
	  /*
	    SELECT * FROM t1 WHERE a=1 ORDER BY a DESC,b DESC
7191 7192 7193

	    Use a traversal function that starts by reading the last row
	    with key part (A) and then traverse the index backwards.
7194
	  */
7195 7196 7197
          if (!(table->file->index_flags(ref_key,used_key_parts-1, 1)
                & HA_READ_PREV))
            DBUG_RETURN(0);			// Use filesort
7198 7199 7200
	  tab->read_first_record=       join_read_last_key;
	  tab->read_record.read_record= join_read_prev_same;
	  /* fall through */
7201
	}
7202
      }
7203 7204
      else if (select && select->quick)
	  select->quick->sorted= 1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7205
      DBUG_RETURN(1);			/* No need to sort */
7206
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7207 7208 7209 7210 7211 7212
  }
  else
  {
    /* check if we can use a key to resolve the group */
    /* Tables using JT_NEXT are handled here */
    uint nr;
monty@mysql.com's avatar
monty@mysql.com committed
7213
    key_map keys;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7214 7215 7216 7217 7218 7219 7220

    /*
      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)
monty@mysql.com's avatar
monty@mysql.com committed
7221 7222 7223
    {
      keys= *table->file->keys_to_use_for_scanning();
      keys.merge(table->used_keys);
7224

monty@mysql.com's avatar
monty@mysql.com committed
7225 7226 7227 7228 7229 7230 7231 7232
      /*
	We are adding here also the index speified in FORCE INDEX clause, 
	if any.
      This is to allow users to use index in ORDER BY.
      */
      if (table->force_index) 
	keys.merge(table->keys_in_use_for_query);
      keys.intersect(usable_keys);
7233 7234
    }
    else
7235
      keys= usable_keys;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7236

serg@serg.mylan's avatar
serg@serg.mylan committed
7237
    for (nr=0; nr < table->keys ; nr++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7238
    {
7239
      uint not_used;
7240
      if (keys.is_set(nr))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7241 7242
      {
	int flag;
7243
	if ((flag=test_if_order_by_key(order, table, nr, &not_used)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7244
	{
7245 7246 7247
	  if (!no_changes)
	  {
	    tab->index=nr;
7248 7249
	    tab->read_first_record=  (flag > 0 ? join_read_first:
				      join_read_last);
7250
	    tab->type=JT_NEXT;	// Read with index_first(), index_next()
7251
	    if (table->used_keys.is_set(nr))
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
7252 7253 7254 7255
	    {
	      table->key_read=1;
	      table->file->extra(HA_EXTRA_KEYREAD);
	    }
7256
	  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7257 7258 7259 7260 7261 7262 7263 7264
	  DBUG_RETURN(1);
	}
      }
    }
  }
  DBUG_RETURN(0);				// Can't use index.
}

7265

monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
7266
/*
7267
  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
7268 7269 7270 7271 7272 7273 7274 7275

  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
7276
		        Used to decide if we should use index or not
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
7277 7278 7279 7280 7281 7282 7283 7284 7285 7286 7287 7288 7289 7290 7291


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

bk@work.mysql.com's avatar
bk@work.mysql.com committed
7293
static int
7294
create_sort_index(THD *thd, JOIN *join, ORDER *order,
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
7295
		  ha_rows filesort_limit, ha_rows select_limit)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7296 7297 7298
{
  SORT_FIELD *sortorder;
  uint length;
7299
  ha_rows examined_rows;
7300 7301 7302
  TABLE *table;
  SQL_SELECT *select;
  JOIN_TAB *tab;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7303 7304
  DBUG_ENTER("create_sort_index");

7305 7306 7307 7308 7309 7310
  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;

7311
  if (test_if_skip_sort_order(tab,order,select_limit,0))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7312 7313 7314 7315
    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
7316 7317
  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
7318 7319 7320 7321 7322 7323 7324 7325 7326 7327 7328 7329 7330 7331 7332 7333 7334 7335 7336 7337 7338
  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.
7339 7340
	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
7341
      */
7342 7343 7344
      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
7345 7346 7347
	goto err;
    }
  }
7348 7349
  if (table->tmp_table)
    table->file->info(HA_STATUS_VARIABLE);	// Get record count
igor@hundin.mysql.fi's avatar
igor@hundin.mysql.fi committed
7350 7351
  table->sort.found_records=filesort(thd, table,sortorder, length,
                                     select, filesort_limit, &examined_rows);
monty@mysql.com's avatar
merge  
monty@mysql.com committed
7352
  tab->records= table->sort.found_records;	// For SQL_CALC_ROWS
7353 7354 7355 7356 7357
  if (select)
  {
    select->cleanup();				// filesort did select
    tab->select= 0;
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7358 7359 7360
  tab->select_cond=0;
  tab->type=JT_ALL;				// Read with normal read_record
  tab->read_first_record= join_init_read_record;
7361
  tab->join->examined_rows+=examined_rows;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7362 7363 7364 7365 7366
  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
7367
  DBUG_RETURN(table->sort.found_records == HA_POS_ERROR);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7368 7369 7370 7371
err:
  DBUG_RETURN(-1);
}

7372
/*
7373
  Add the HAVING criteria to table->select
7374 7375
*/

monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
7376
#ifdef NOT_YET
7377 7378 7379 7380 7381 7382
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
7383
  DBUG_EXECUTE("where",print_where(*having,"having"););
7384 7385 7386 7387 7388 7389 7390 7391 7392
  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
7393 7394
      if (!(table->select->cond= new Item_cond_and(table->select->cond,
						   sort_table_cond)) ||
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
7395
	  table->select->cond->fix_fields(join->thd, join->tables_list,
7396
					  &table->select->cond))
7397 7398
	return 1;
    table->select_cond=table->select->cond;
7399
    table->select_cond->top_level_item();
7400 7401 7402 7403 7404 7405 7406
    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
7407
#endif
7408 7409


bk@work.mysql.com's avatar
bk@work.mysql.com committed
7410
/*****************************************************************************
7411 7412 7413 7414 7415
  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
7416 7417 7418 7419 7420 7421 7422 7423 7424 7425 7426 7427 7428 7429 7430 7431 7432 7433 7434 7435 7436 7437 7438 7439 7440 7441 7442 7443 7444 7445 7446 7447 7448 7449
*****************************************************************************/

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
7450
remove_duplicates(JOIN *join, TABLE *entry,List<Item> &fields, Item *having)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7451 7452 7453 7454
{
  int error;
  ulong reclength,offset;
  uint field_count;
7455
  THD *thd= join->thd;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7456 7457 7458 7459 7460 7461 7462 7463 7464
  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++))
7465
  {
7466
    if (item->get_tmp_table_field() && ! item->const_item())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7467
      field_count++;
7468
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7469 7470 7471

  if (!field_count)
  {						// only const items
7472
    join->unit->select_limit_cnt= 1;		// Only send first row
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7473 7474 7475 7476 7477 7478 7479 7480 7481 7482
    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 &&
7483
       ((ALIGN_SIZE(reclength) + HASH_OVERHEAD) * entry->file->records <
7484
	thd->variables.sortbuff_size)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7485 7486
    error=remove_dup_with_hash_index(join->thd, entry,
				     field_count, first_field,
7487
				     reclength, having);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7488
  else
7489 7490
    error=remove_dup_with_compare(join->thd, entry, first_field, offset,
				  having);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7491 7492 7493 7494 7495 7496 7497

  free_blobs(first_field);
  DBUG_RETURN(error);
}


static int remove_dup_with_compare(THD *thd, TABLE *table, Field **first_field,
7498
				   ulong offset, Item *having)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7499 7500 7501
{
  handler *file=table->file;
  char *org_record,*new_record;
monty@donna.mysql.fi's avatar
monty@donna.mysql.fi committed
7502
  byte *record;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7503 7504 7505 7506
  int error;
  ulong reclength=table->reclength-offset;
  DBUG_ENTER("remove_dup_with_compare");

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

7510
  file->ha_rnd_init(1);
7511
  error=file->rnd_next(record);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7512 7513 7514 7515 7516 7517 7518 7519 7520 7521 7522 7523 7524 7525 7526 7527
  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;
    }
7528 7529 7530 7531
    if (having && !having->val_int())
    {
      if ((error=file->delete_row(record)))
	goto err;
7532
      error=file->rnd_next(record);
7533 7534
      continue;
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7535 7536
    if (copy_blobs(first_field))
    {
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
7537
      my_error(ER_OUTOFMEMORY,MYF(0));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7538 7539 7540 7541 7542 7543 7544 7545 7546
      error=0;
      goto err;
    }
    memcpy(new_record,org_record,reclength);

    /* Read through rest of file and mark duplicated rows deleted */
    bool found=0;
    for (;;)
    {
7547
      if ((error=file->rnd_next(record)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7548 7549 7550 7551 7552 7553 7554 7555 7556
      {
	if (error == HA_ERR_RECORD_DELETED)
	  continue;
	if (error == HA_ERR_END_OF_FILE)
	  break;
	goto err;
      }
      if (compare_record(table, first_field) == 0)
      {
7557
	if ((error=file->delete_row(record)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7558 7559 7560 7561 7562
	  goto err;
      }
      else if (!found)
      {
	found=1;
7563
	file->position(record);	// Remember position
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7564 7565 7566 7567 7568
      }
    }
    if (!found)
      break;					// End of file
    /* Restart search on next row */
7569
    error=file->restart_rnd_next(record,file->ref);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7570 7571 7572 7573 7574 7575 7576 7577 7578 7579 7580 7581 7582 7583 7584 7585 7586 7587 7588 7589
  }

  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,
7590 7591
				      ulong key_length,
				      Item *having)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7592 7593 7594 7595 7596 7597 7598 7599 7600 7601 7602 7603 7604 7605 7606 7607 7608
{
  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);
7609

bar@bar.mysql.r18.ru's avatar
bar@bar.mysql.r18.ru committed
7610
  if (hash_init(&hash, &my_charset_bin, (uint) file->records, 0, 
7611
		key_length,(hash_get_key) 0, 0, 0))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7612 7613 7614 7615 7616 7617 7618 7619 7620 7621
  {
    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();
  }

7622
  file->ha_rnd_init(1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7623 7624 7625 7626 7627 7628 7629 7630 7631 7632 7633 7634 7635 7636 7637 7638 7639
  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;
    }
7640 7641 7642 7643 7644
    if (having && !having->val_int())
    {
      if ((error=file->delete_row(record)))
	goto err;
      continue;
7645
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7646 7647 7648 7649 7650 7651 7652 7653 7654 7655 7656 7657 7658 7659 7660

    /* 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;
    }
7661
    else
hf@deer.(none)'s avatar
SCRUM  
hf@deer.(none) committed
7662
      (void) my_hash_insert(&hash, key_pos-key_length);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7663 7664 7665 7666 7667
    key_pos+=extra_length;
  }
  my_free((char*) key_buffer,MYF(0));
  hash_free(&hash);
  file->extra(HA_EXTRA_NO_CACHE);
7668
  (void) file->ha_rnd_end();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7669 7670 7671 7672 7673 7674
  DBUG_RETURN(0);

err:
  my_free((char*) key_buffer,MYF(0));
  hash_free(&hash);
  file->extra(HA_EXTRA_NO_CACHE);
7675
  (void) file->ha_rnd_end();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7676 7677 7678 7679 7680 7681
  if (error)
    file->print_error(error,MYF(0));
  DBUG_RETURN(1);
}


7682
SORT_FIELD *make_unireg_sortorder(ORDER *order, uint *length)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7683 7684 7685 7686 7687 7688 7689 7690 7691 7692 7693 7694 7695 7696 7697 7698 7699 7700 7701
{
  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())
7702
      pos->field= ((Item_sum*) order->item[0])->get_tmp_table_field();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7703 7704 7705 7706 7707 7708 7709 7710 7711 7712 7713 7714 7715 7716
    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);
}


/*****************************************************************************
7717 7718 7719 7720
  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
7721 7722 7723 7724 7725 7726 7727 7728 7729
******************************************************************************/

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;
7730
  JOIN_TAB *join_tab;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7731 7732 7733 7734 7735
  DBUG_ENTER("join_init_cache");

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

7736 7737
  join_tab=tables;
  for (i=0 ; i < table_count ; i++,join_tab++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7738
  {
7739 7740 7741 7742
    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
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 7777 7778 7779 7780 7781
  }
  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;
7782
      copy->length=tables[i].table->null_bytes;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7783 7784 7785 7786 7787 7788 7789 7790 7791 7792 7793 7794 7795 7796 7797 7798 7799 7800 7801 7802 7803 7804
      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->length=length+blobs*sizeof(char*);
  cache->blobs=blobs;
  *blob_ptr=0;					/* End sequentel */
7805
  size=max(thd->variables.join_buff_size, cache->length);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7806 7807 7808
  if (!(cache->buff=(uchar*) my_malloc(size,MYF(0))))
    DBUG_RETURN(1);				/* Don't use cache */ /* purecov: inspected */
  cache->end=cache->buff+size;
7809
  reset_cache_write(cache);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7810 7811 7812 7813 7814 7815 7816 7817 7818 7819 7820 7821 7822 7823 7824 7825 7826 7827 7828 7829 7830 7831 7832 7833 7834 7835 7836 7837 7838 7839 7840 7841 7842 7843 7844 7845
  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;

  /*
7846
    There is room in cache. Put record there
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7847 7848 7849 7850 7851 7852 7853 7854
  */
  cache->records++;
  for (copy=cache->field ; copy < end_field; copy++)
  {
    if (copy->blob_field)
    {
      if (last_record)
      {
7855 7856
	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
7857 7858 7859 7860
	pos+=copy->length+sizeof(char*);
      }
      else
      {
7861 7862
	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
7863 7864 7865 7866 7867 7868 7869 7870 7871 7872 7873 7874 7875 7876 7877 7878 7879 7880 7881 7882 7883 7884 7885 7886 7887 7888 7889 7890 7891 7892
	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
7893
reset_cache_read(JOIN_CACHE *cache)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7894 7895 7896
{
  cache->record_nr=0;
  cache->pos=cache->buff;
7897 7898 7899 7900 7901 7902 7903 7904
}


static void reset_cache_write(JOIN_CACHE *cache)
{
  reset_cache_read(cache);
  cache->records= 0;
  cache->ptr_record= (uint) ~0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7905 7906 7907 7908 7909 7910 7911 7912 7913 7914 7915 7916 7917 7918 7919 7920 7921 7922 7923 7924 7925 7926
}


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)
      {
7927 7928
	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
7929 7930 7931 7932 7933 7934 7935 7936 7937 7938 7939 7940 7941 7942 7943 7944 7945 7946 7947 7948 7949 7950 7951 7952 7953 7954 7955 7956 7957 7958 7959 7960 7961 7962 7963 7964 7965 7966 7967 7968 7969 7970 7971 7972 7973 7974 7975 7976 7977 7978 7979 7980 7981 7982
	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;
}


/*****************************************************************************
7983
  Group and order functions
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7984 7985 7986
*****************************************************************************/

/*
7987 7988 7989
  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
7990 7991 7992
*/

static int
7993 7994
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
7995 7996
		   List<Item> &all_fields)
{
7997 7998
  Item *itemptr=*order->item;
  if (itemptr->type() == Item::INT_ITEM)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
7999
  {						/* Order by position */
serg@serg.mylan's avatar
serg@serg.mylan committed
8000
    uint count= itemptr->val_int();
8001
    if (!count || count > fields.elements)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8002 8003
    {
      my_printf_error(ER_BAD_FIELD_ERROR,ER(ER_BAD_FIELD_ERROR),
8004
		      MYF(0),itemptr->full_name(),
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8005 8006 8007
	       thd->where);
      return 1;
    }
8008 8009
    order->item= ref_pointer_array + count-1;
    order->in_field_list= 1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8010 8011
    return 0;
  }
8012
  uint counter;
8013 8014 8015 8016 8017
  Item **item= find_item_in_list(itemptr, fields, &counter,
                                 REPORT_EXCEPT_NOT_FOUND);
  if (!item)
    return 1;

8018
  if (item != (Item **)not_found_item)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8019
  {
8020
    order->item= ref_pointer_array + counter;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8021 8022 8023
    order->in_field_list=1;
    return 0;
  }
8024

bk@work.mysql.com's avatar
bk@work.mysql.com committed
8025
  order->in_field_list=0;
8026
  Item *it= *order->item;
8027
  /*
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
8028 8029 8030 8031
    We check it->fixed because Item_func_group_concat can put
    arguments for which fix_fields already was called.

    'it' reassigned in if condition because fix_field can change it.
8032 8033 8034 8035 8036
  */
  if (!it->fixed &&
      (it->fix_fields(thd, tables, order->item) ||
       (it= *order->item)->check_cols(1) ||
       thd->is_fatal_error))
8037
    return 1;					// Wrong field 
8038 8039 8040 8041
  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
8042 8043 8044 8045
  return 0;
}

/*
8046 8047
  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
8048 8049
*/

8050 8051
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
8052 8053 8054 8055
{
  thd->where="order clause";
  for (; order; order=order->next)
  {
8056 8057
    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
8058 8059 8060 8061 8062 8063
      return 1;
  }
  return 0;
}


monty@mysql.com's avatar
monty@mysql.com committed
8064 8065 8066 8067 8068 8069 8070 8071 8072 8073 8074 8075 8076 8077 8078 8079 8080 8081 8082 8083 8084 8085 8086
/*
  Intitialize the GROUP BY list.

  SYNOPSIS
   setup_group()
   thd			Thread handler
   ref_pointer_array	We store references to all fields that was not in
			'fields' here.   
   fields		All fields in the select part. Any item in 'order'
			that is part of these list is replaced by a pointer
			to this fields.
   all_fields		Total list of all unique fields used by the select.
			All items in 'order' that was not part of fields will
			be added first to this list.
  order			The fields we should do GROUP BY on.
  hidden_group_fields	Pointer to flag that is set to 1 if we added any fields
			to all_fields.

  RETURN
   0  ok
   1  error (probably out of memory)
*/

8087
int
8088 8089 8090
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
8091 8092 8093 8094 8095
{
  *hidden_group_fields=0;
  if (!order)
    return 0;				/* Everything is ok */

8096
  if (thd->variables.sql_mode & MODE_ONLY_FULL_GROUP_BY)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8097 8098 8099 8100 8101 8102 8103 8104 8105
  {
    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";
8106
  for (; order; order=order->next)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8107
  {
8108 8109
    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
8110 8111 8112 8113 8114 8115 8116 8117 8118
      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;
    }
  }
8119
  if (thd->variables.sql_mode & MODE_ONLY_FULL_GROUP_BY)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8120 8121 8122 8123 8124 8125 8126
  {
    /* Don't allow one to use fields that is not used in GROUP BY */
    Item *item;
    List_iterator<Item> li(fields);

    while ((item=li++))
    {
8127 8128
      if (item->type() != Item::SUM_FUNC_ITEM && !item->marker &&
	  !item->const_item())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8129 8130 8131 8132 8133 8134 8135 8136 8137 8138 8139 8140 8141 8142
      {
	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;
}

/*
8143
  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
8144 8145 8146 8147 8148 8149 8150 8151 8152 8153
*/

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...
8154
  uint counter;
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
8155
  for (; new_field ; new_field= new_field->next)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8156
  {
8157 8158
    if ((item= find_item_in_list(*new_field->item, fields, &counter,
				 IGNORE_ERRORS)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8159 8160 8161 8162
      new_field->item=item;			/* Change to shared Item */
    else
    {
      thd->where="procedure list";
8163
      if ((*new_field->item)->fix_fields(thd, tables, new_field->item))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8164 8165 8166 8167 8168 8169 8170 8171 8172
	DBUG_RETURN(1); /* purecov: inspected */
      all_fields.push_front(*new_field->item);
      new_field->item=all_fields.head_ref();
    }
  }
  DBUG_RETURN(0);
}

/*
8173 8174 8175
  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
8176 8177 8178
*/

static ORDER *
8179 8180
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
8181 8182 8183 8184 8185
{
  List_iterator<Item> li(fields);
  Item *item;
  ORDER *order,*group,**prev;

8186
  *all_order_by_fields_used= 1;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8187 8188 8189 8190 8191 8192 8193 8194
  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)
    {
8195
      ORDER *ord=(ORDER*) thd->memdup((char*) order,sizeof(ORDER));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8196 8197 8198 8199 8200 8201
      if (!ord)
	return 0;
      *prev=ord;
      prev= &ord->next;
      (*ord->item)->marker=1;
    }
8202 8203
    else
      *all_order_by_fields_used= 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8204 8205 8206 8207 8208 8209 8210 8211 8212
  }

  li.rewind();
  while ((item=li++))
  {
    if (item->const_item() || item->with_sum_func)
      continue;
    if (!item->marker)
    {
8213
      ORDER *ord=(ORDER*) thd->calloc(sizeof(ORDER));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8214 8215 8216 8217 8218 8219 8220 8221 8222 8223 8224 8225 8226 8227
      if (!ord)
	return 0;
      ord->item=li.ref();
      ord->asc=1;
      *prev=ord;
      prev= &ord->next;
    }
  }
  *prev=0;
  return group;
}


/*****************************************************************************
8228
  Update join with count of the different type of fields
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8229 8230 8231
*****************************************************************************/

void
8232 8233
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
8234 8235 8236 8237
{
  List_iterator<Item> li(fields);
  Item *field;

8238
  param->field_count=param->sum_func_count=param->func_count=
8239
    param->hidden_field_count=0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8240 8241 8242 8243 8244 8245 8246 8247 8248 8249 8250 8251 8252 8253 8254 8255 8256 8257 8258 8259 8260 8261 8262 8263 8264
  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
8265
    {
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8266
      param->func_count++;
8267 8268 8269
      if (reset_with_sum_func)
	field->with_sum_func=0;
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8270 8271 8272 8273 8274 8275 8276 8277 8278 8279 8280 8281 8282 8283 8284
  }
}


/*
  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)
  {
8285
    if ((*a->item)->eq(*b->item,1))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8286 8287 8288 8289 8290 8291 8292 8293 8294 8295 8296 8297 8298 8299 8300 8301 8302 8303 8304 8305 8306 8307 8308 8309 8310 8311
      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)
  {
8312
    if (!(*a->item)->eq(*b->item,1))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8313 8314 8315
      DBUG_RETURN(0);
    map|=a->item[0]->used_tables();
  }
8316
  if (!map || (map & (RAND_TABLE_BIT | OUTER_REF_TABLE_BIT)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8317 8318
    DBUG_RETURN(0);

8319
  for (; !(map & tables->table->map) ; tables=tables->next) ;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8320 8321 8322 8323 8324 8325 8326 8327 8328 8329 8330 8331
  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)
{
8332 8333
  uint key_length=0, parts=0, null_parts=0;

bk@work.mysql.com's avatar
bk@work.mysql.com committed
8334 8335 8336 8337
  if (group)
    join->group= 1;
  for (; group ; group=group->next)
  {
8338
    Field *field=(*group->item)->get_tmp_table_field();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8339 8340 8341 8342 8343 8344 8345 8346 8347 8348 8349 8350 8351 8352 8353
    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)
8354
      null_parts++;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8355
  }
8356
  join->tmp_table_param.group_length=key_length+null_parts;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8357
  join->tmp_table_param.group_parts=parts;
8358
  join->tmp_table_param.group_null_parts=null_parts;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8359 8360
}

8361

8362
/*
8363
  allocate group fields or take prepared (cached)
8364

8365
  SYNOPSIS
8366 8367 8368 8369 8370 8371 8372 8373 8374 8375 8376 8377
    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)
{
8378 8379 8380 8381 8382 8383 8384 8385 8386 8387 8388 8389
  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);
8390
}
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8391

8392

bk@work.mysql.com's avatar
bk@work.mysql.com committed
8393
/*
8394 8395
  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
8396 8397 8398 8399 8400 8401 8402 8403 8404 8405 8406 8407 8408 8409 8410 8411 8412 8413 8414 8415 8416 8417
*/

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)
{
8418
  DBUG_ENTER("test_if_group_changed");
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8419 8420 8421 8422 8423 8424 8425 8426 8427
  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;
  }
8428 8429
  DBUG_PRINT("info", ("idx: %d", idx));
  DBUG_RETURN(idx);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8430 8431 8432 8433
}


/*
8434
  Setup copy_fields to save fields at start of new group
8435 8436 8437 8438 8439 8440 8441 8442 8443 8444 8445 8446 8447 8448 8449 8450 8451 8452 8453

  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
8454 8455 8456
*/

bool
8457 8458
setup_copy_fields(THD *thd, TMP_TABLE_PARAM *param,
		  Item **ref_pointer_array,
8459 8460
		  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
8461 8462
{
  Item *pos;
8463
  List_iterator_fast<Item> li(all_fields);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8464
  Copy_field *copy;
8465 8466 8467 8468
  res_selected_fields.empty();
  res_all_fields.empty();
  List_iterator_fast<Item> itr(res_all_fields);
  uint i, border= all_fields.elements - elements;
monty@mysql.com's avatar
monty@mysql.com committed
8469
  DBUG_ENTER("setup_copy_fields");
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8470 8471

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

  param->copy_funcs.empty();
8475
  for (i= 0; (pos= li++); i++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8476 8477 8478
  {
    if (pos->type() == Item::FIELD_ITEM)
    {
8479
      Item_field *item;
8480
      if (!(item= new Item_field(thd, ((Item_field*) pos))))
8481 8482
	goto err;
      pos= item;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8483 8484
      if (item->field->flags & BLOB_FLAG)
      {
8485
	if (!(pos= new Item_copy_string(pos)))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8486
	  goto err;
8487 8488 8489 8490 8491 8492 8493 8494 8495 8496
       /*
         Item_copy_string::copy for function can call 
         Item_copy_string::val_int for blob via Item_ref.
         But if Item_copy_string::copy for blob isn't called before,
         it's value will be wrong
         so let's insert Item_copy_string for blobs in the beginning of 
         copy_funcs
         (to see full test case look at having.test, BUG #4358) 
       */
	if (param->copy_funcs.push_front(pos))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8497 8498
	  goto err;
      }
8499 8500 8501 8502 8503 8504 8505 8506 8507 8508 8509 8510 8511 8512 8513
      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
8514 8515 8516 8517 8518 8519 8520 8521 8522 8523 8524 8525 8526 8527 8528 8529
    }
    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;
    }
8530 8531
    res_all_fields.push_back(pos);
    ref_pointer_array[((i < border)? all_fields.elements-i-1 : i-border)]=
8532
      pos;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8533
  }
monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
8534
  param->copy_field_end= copy;
8535 8536 8537

  for (i= 0; i < border; i++)
    itr++;
8538
  itr.sublist(res_selected_fields, elements);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8539 8540 8541
  DBUG_RETURN(0);

 err:
8542
  delete [] param->copy_field;			// This is never 0
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8543
  param->copy_field=0;
8544
err2:
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8545 8546 8547 8548 8549
  DBUG_RETURN(TRUE);
}


/*
8550 8551 8552 8553
  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
8554 8555 8556 8557 8558 8559
*/

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

8562
  for (; ptr != end; ptr++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8563 8564
    (*ptr->do_copy)(ptr);

monty@tik.mysql.fi's avatar
monty@tik.mysql.fi committed
8565 8566
  List_iterator_fast<Item> &it=param->copy_funcs_it;
  it.rewind();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8567 8568 8569 8570 8571 8572
  Item_copy_string *item;
  while ((item = (Item_copy_string*) it++))
    item->copy();
}


8573 8574
/*
  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
8575

8576 8577 8578 8579 8580 8581 8582 8583 8584
  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
8585
{
8586 8587 8588 8589 8590 8591 8592 8593 8594 8595 8596 8597 8598 8599 8600 8601 8602 8603 8604 8605 8606 8607 8608 8609 8610 8611 8612
  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);
}


8613 8614 8615 8616 8617 8618 8619 8620 8621 8622 8623 8624 8625 8626 8627 8628 8629
/*
  Initialize 'sum_funcs' array with all Item_sum objects

  SYNOPSIS
    make_sum_func_list()
    field_list		All items
    send_fields		Items in select list
    before_group_by	Set to 1 if this is called before GROUP BY handling

  NOTES
    Calls ::setup() for all item_sum objects in field_list

  RETURN
    0  ok
    1  error
*/

8630
bool JOIN::make_sum_func_list(List<Item> &field_list, List<Item> &send_fields,
8631
			      bool before_group_by)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8632
{
8633
  List_iterator_fast<Item> it(field_list);
8634 8635
  Item_sum **func;
  Item *item;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8636 8637
  DBUG_ENTER("make_sum_func_list");

8638 8639
  func= sum_funcs;
  while ((item=it++))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8640
  {
8641
    if (item->type() == Item::SUM_FUNC_ITEM && !item->const_item())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8642
    {
8643
      *func++= (Item_sum*) item;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8644
      /* let COUNT(DISTINCT) create the temporary table */
8645
      if (((Item_sum*) item)->setup(thd))
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8646 8647 8648
	DBUG_RETURN(TRUE);
    }
  }
8649 8650 8651
  if (before_group_by && rollup.state == ROLLUP::STATE_INITED)
  {
    rollup.state= ROLLUP::STATE_READY;
8652
    if (rollup_make_fields(field_list, send_fields, &func))
8653 8654 8655 8656 8657 8658 8659
      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
8660 8661 8662 8663 8664 8665
  *func=0;					// End marker
  DBUG_RETURN(FALSE);
}


/*
8666
  Change all funcs and sum_funcs to fields in tmp table, and create
8667 8668 8669 8670 8671 8672 8673 8674 8675 8676 8677 8678 8679
  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
8680 8681 8682
*/

static bool
8683
change_to_use_tmp_fields(THD *thd, Item **ref_pointer_array,
8684 8685 8686
			 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
8687
{
8688
  List_iterator_fast<Item> it(all_fields);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8689
  Item *item_field,*item;
8690 8691
  res_selected_fields.empty();
  res_all_fields.empty();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8692

8693
  uint i, border= all_fields.elements - elements;
8694
  for (i= 0; (item= it++); i++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8695 8696
  {
    Field *field;
8697
    
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8698
    if (item->with_sum_func && item->type() != Item::SUM_FUNC_ITEM)
8699 8700
      item_field= item;
    else
8701
    {
8702
      if (item->type() == Item::FIELD_ITEM)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8703
      {
8704
	item_field= item->get_tmp_table_item(thd);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8705
      }
8706
      else if ((field= item->get_tmp_table_field()))
8707 8708 8709 8710
      {
	if (item->type() == Item::SUM_FUNC_ITEM && field->table->group)
	  item_field= ((Item_sum*) item)->result_item(field);
	else
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
8711
	  item_field= (Item*) new Item_field(field);
8712 8713 8714 8715 8716 8717 8718
	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];
8719
	  String str(buff,sizeof(buff),&my_charset_bin);
8720 8721 8722 8723
	  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
8724
#endif
8725 8726 8727
      }
      else
	item_field= item;
8728 8729 8730
    }
    res_all_fields.push_back(item_field);
    ref_pointer_array[((i < border)? all_fields.elements-i-1 : i-border)]=
8731
      item_field;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8732
  }
8733

8734
  List_iterator_fast<Item> itr(res_all_fields);
8735 8736
  for (i= 0; i < border; i++)
    itr++;
8737
  itr.sublist(res_selected_fields, elements);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8738 8739 8740 8741 8742
  return FALSE;
}


/*
8743 8744
  Change all sum_func refs to fields to point at fields in tmp table
  Change all funcs to be fields in tmp table
8745 8746 8747 8748 8749 8750 8751 8752 8753 8754

  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
8755 8756
    0	ok
    1	error
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8757 8758 8759
*/

static bool
8760
change_refs_to_tmp_fields(THD *thd, Item **ref_pointer_array,
8761 8762 8763
			  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
8764
{
8765
  List_iterator_fast<Item> it(all_fields);
8766
  Item *item, *new_item;
8767 8768
  res_selected_fields.empty();
  res_all_fields.empty();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8769

8770
  uint i, border= all_fields.elements - elements;
8771
  for (i= 0; (item= it++); i++)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8772
  {
8773 8774
    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)]=
8775
      new_item;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8776
  }
8777

8778
  List_iterator_fast<Item> itr(res_all_fields);
8779 8780
  for (i= 0; i < border; i++)
    itr++;
8781
  itr.sublist(res_selected_fields, elements);
8782

8783
  return thd->is_fatal_error;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8784 8785 8786 8787 8788
}



/******************************************************************************
8789
  Code for calculating functions
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8790 8791 8792 8793 8794 8795 8796 8797 8798 8799 8800 8801 8802 8803 8804 8805 8806 8807 8808
******************************************************************************/

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++)))
8809
    func->update_field();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8810 8811 8812 8813 8814 8815 8816 8817 8818 8819
}


	/* 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
8820
    (void) func->save_in_result_field(1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8821 8822 8823 8824
  return;
}


8825 8826
static bool
init_sum_functions(Item_sum **func_ptr, Item_sum **end_ptr)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8827
{
8828 8829 8830 8831 8832 8833 8834 8835 8836 8837 8838 8839
  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
8840 8841 8842 8843 8844 8845 8846 8847 8848 8849 8850 8851 8852 8853 8854 8855
}


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
8856
copy_funcs(Item **func_ptr)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8857
{
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
8858
  Item *func;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8859
  for (; (func = *func_ptr) ; func_ptr++)
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
8860
    func->save_in_result_field(1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8861 8862 8863
}


8864
/*
8865 8866
  Create a condition for a const reference and add this to the
  currenct select for the table
8867
*/
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8868 8869 8870 8871 8872 8873 8874 8875 8876 8877 8878 8879 8880 8881 8882

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++)
  {
8883 8884
    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
8885
    Item *value=join_tab->ref.items[i];
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
8886
    cond->add(new Item_func_equal(new Item_field(field), value));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8887
  }
8888
  if (thd->is_fatal_error)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8889
    DBUG_RETURN(TRUE);
8890

bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
8891
  cond->fix_fields(thd,(TABLE_LIST *) 0, (Item**)&cond);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
8892 8893 8894 8895 8896 8897 8898 8899 8900 8901 8902
  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);
}

8903 8904 8905 8906 8907 8908 8909 8910 8911 8912 8913 8914 8915 8916 8917 8918 8919

/*
  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
8920
/****************************************************************************
8921 8922 8923 8924 8925 8926 8927 8928 8929 8930 8931 8932 8933 8934 8935 8936 8937 8938 8939 8940 8941 8942 8943 8944 8945 8946 8947 8948 8949 8950 8951 8952 8953 8954
  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++)
  {
8955 8956
    List<Item> *rollup_fields= &rollup.fields[i];
    rollup_fields->empty();
8957 8958 8959
    rollup.ref_pointer_arrays[i]= ref_array;
    ref_array+= all_fields.elements;
    for (j=0 ; j < fields_list.elements ; j++)
8960
      rollup_fields->push_back(rollup.item_null);
8961 8962 8963 8964 8965 8966 8967 8968 8969 8970
  }
  return 0;
}
  

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

  SYNOPSIS
    rollup_make_fields()
8971 8972
    fields_arg			List of all fields (hidden and real ones)
    sel_fields			Pointer to selected fields
8973 8974 8975 8976 8977 8978 8979 8980 8981 8982 8983
    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
*/

8984
bool JOIN::rollup_make_fields(List<Item> &fields_arg, List<Item> &sel_fields,
8985 8986
			      Item_sum ***func)
{
8987 8988
  List_iterator_fast<Item> it(fields_arg);
  Item *first_field= sel_fields.head();
8989 8990 8991 8992 8993 8994 8995 8996 8997 8998 8999 9000 9001 9002 9003 9004 9005 9006 9007 9008 9009 9010 9011
  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
    ...
  */

9012
  for (level=0 ; level < send_group_parts ; level++)
9013 9014 9015 9016 9017 9018 9019 9020 9021 9022
  {
    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 */
9023
    Item **ref_array= ref_array_start + fields_arg.elements-1;
9024 9025 9026 9027 9028 9029 9030 9031 9032 9033 9034 9035 9036 9037 9038 9039 9040 9041 9042 9043 9044 9045 9046 9047 9048 9049 9050 9051 9052 9053 9054 9055 9056 9057 9058 9059 9060 9061 9062

    /* 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 */
9063 9064
	ORDER *group_tmp;
	for (group_tmp= start_group ; group_tmp ; group_tmp= group_tmp->next)
9065
	{
9066
	  if (*group_tmp->item == item)
9067 9068 9069 9070 9071 9072 9073 9074 9075 9076 9077 9078 9079 9080 9081 9082 9083 9084 9085 9086 9087 9088 9089 9090 9091 9092 9093 9094 9095 9096 9097 9098 9099 9100 9101 9102 9103 9104 9105 9106 9107 9108 9109 9110 9111 9112 9113 9114 9115 9116 9117 9118 9119 9120 9121 9122 9123 9124 9125 9126 9127 9128 9129 9130 9131 9132
	  {
	    /*
	      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;
}

9133 9134 9135 9136 9137 9138 9139 9140 9141 9142 9143 9144 9145 9146 9147 9148 9149 9150 9151 9152
/*
  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();
  }
}
9153

bk@work.mysql.com's avatar
bk@work.mysql.com committed
9154
/****************************************************************************
9155 9156
  EXPLAIN handling

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

monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
9160
static void select_describe(JOIN *join, bool need_tmp_table, bool need_order,
9161
			    bool distinct,const char *message)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
9162 9163
{
  List<Item> field_list;
9164
  List<Item> item_list;
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
9165
  THD *thd=join->thd;
9166
  select_result *result=join->result;
9167
  Item *item_null= new Item_null();
9168
  CHARSET_INFO *cs= system_charset_info;
monty@tramp.mysql.fi's avatar
monty@tramp.mysql.fi committed
9169
  DBUG_ENTER("select_describe");
9170
  DBUG_PRINT("info", ("Select 0x%lx, type %s, message %s",
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9171
		      (ulong)join->select_lex, join->select_lex->type,
9172
		      message ? message : "NULL"));
9173
  /* Don't log this into the slow query log */
9174
  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
9175
  join->unit->offset_limit_cnt= 0;
9176

9177
  if (message)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
9178
  {
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9179
    item_list.push_back(new Item_int((int32)
9180
				     join->select_lex->select_number));
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9181
    item_list.push_back(new Item_string(join->select_lex->type,
9182
					strlen(join->select_lex->type), cs));
9183
    for (uint i=0 ; i < 7; i++)
9184
      item_list.push_back(item_null);
9185
    item_list.push_back(new Item_string(message,strlen(message),cs));
9186
    if (result->send_data(item_list))
9187
      join->error= 1;
9188
  }
9189 9190 9191
  else if (join->select_lex == join->unit->fake_select_lex)
  {
    /* 
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9192 9193 9194 9195 9196
      here we assume that the query will return at least two rows, so we
      show "filesort" in EXPLAIN. Of course, sometimes we'll be wrong
      and no filesort will be actually done, but executing all selects in
      the UNION to provide precise EXPLAIN information will hardly be
      appreciated :)
9197
    */
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9198
    char table_name_buffer[NAME_LEN];
9199 9200
    item_list.empty();
    /* id */
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9201
    item_list.push_back(new Item_null);
9202 9203 9204 9205 9206
    /* select_type */
    item_list.push_back(new Item_string(join->select_lex->type,
					strlen(join->select_lex->type),
					cs));
    /* table */
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9207 9208 9209 9210 9211 9212 9213 9214 9215 9216 9217 9218 9219 9220 9221 9222 9223 9224 9225 9226 9227 9228 9229
    {
      SELECT_LEX *sl= join->unit->first_select();
      uint len= 6, lastop= 0;
      memcpy(table_name_buffer, "<union", 6);
      for (; sl && len + lastop + 5 < NAME_LEN; sl= sl->next_select())
      {
        len+= lastop;
        lastop= my_snprintf(table_name_buffer + len, NAME_LEN - len,
                            "%u,", sl->select_number);
      }
      if (sl || len + lastop >= NAME_LEN)
      {
        memcpy(table_name_buffer + len, "...>", 5);
        len+= 4;
      }
      else
      {
        len+= lastop;
        table_name_buffer[len - 1]= '>';  // change ',' to '>'
      }
      item_list.push_back(new Item_string(table_name_buffer, len, cs));
    }
    /* type */
9230 9231 9232 9233 9234 9235 9236 9237 9238 9239 9240 9241 9242 9243 9244 9245 9246 9247 9248 9249 9250 9251 9252
    item_list.push_back(new Item_string(join_type_str[JT_ALL],
					  strlen(join_type_str[JT_ALL]),
					  cs));
    /* possible_keys */
    item_list.push_back(item_null);
    /* key*/
    item_list.push_back(item_null);
    /* key_len */
    item_list.push_back(item_null);
    /* ref */
    item_list.push_back(item_null);
    /* rows */
    item_list.push_back(item_null);
    /* extra */
    if (join->unit->global_parameters->order_list.first)
      item_list.push_back(new Item_string("Using filesort",
					  14, cs));
    else
      item_list.push_back(new Item_string("", 0, cs));

    if (result->send_data(item_list))
      join->error= 1;
  }
9253 9254 9255 9256
  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
9257
    {
9258 9259
      JOIN_TAB *tab=join->join_tab+i;
      TABLE *table=tab->table;
9260
      char buff[512],*buff_ptr=buff;
9261
      char buff1[512], buff2[512];
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9262
      char table_name_buffer[NAME_LEN];
9263 9264
      String tmp1(buff1,sizeof(buff1),cs);
      String tmp2(buff2,sizeof(buff2),cs);
9265 9266 9267
      tmp1.length(0);
      tmp2.length(0);

bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9268
      item_list.empty();
9269
      /* id */
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9270
      item_list.push_back(new Item_uint((uint32)
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9271
				       join->select_lex->select_number));
9272
      /* select_type */
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9273 9274
      item_list.push_back(new Item_string(join->select_lex->type,
					  strlen(join->select_lex->type),
9275
					  cs));
9276 9277
      if (tab->type == JT_ALL && tab->select && tab->select->quick)
	tab->type= JT_RANGE;
9278
      /* table */
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
9279
      if (table->derived_select_number)
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9280
      {
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
9281
	/* Derived table name generation */
9282
	int len= my_snprintf(table_name_buffer, sizeof(table_name_buffer)-1,
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
9283
			     "<derived%u>",
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9284
			     table->derived_select_number);
9285
	item_list.push_back(new Item_string(table_name_buffer, len, cs));
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9286 9287 9288 9289
      }
      else
	item_list.push_back(new Item_string(table->table_name,
					    strlen(table->table_name),
9290
					    cs));
9291
      /* type */
9292 9293
      item_list.push_back(new Item_string(join_type_str[tab->type],
					  strlen(join_type_str[tab->type]),
9294
					  cs));
9295
      uint j;
9296
      /* possible_keys */
9297
      if (!tab->keys.is_clear_all())
bk@work.mysql.com's avatar
bk@work.mysql.com committed
9298
      {
serg@serg.mylan's avatar
serg@serg.mylan committed
9299
        for (j=0 ; j < table->keys ; j++)
9300 9301 9302 9303 9304
        {
          if (tab->keys.is_set(j))
          {
            if (tmp1.length())
              tmp1.append(',');
9305 9306 9307
            tmp1.append(table->key_info[j].name, 
			strlen(table->key_info[j].name),
			system_charset_info);
9308 9309
          }
        }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
9310
      }
9311
      if (tmp1.length())
9312
	item_list.push_back(new Item_string(tmp1.ptr(),tmp1.length(),cs));
9313
      else
9314
	item_list.push_back(item_null);
9315
      /* key key_len ref */
9316
      if (tab->ref.key_parts)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
9317
      {
9318 9319
	KEY *key_info=table->key_info+ tab->ref.key;
	item_list.push_back(new Item_string(key_info->name,
9320 9321
					    strlen(key_info->name),
					    system_charset_info));
9322
	item_list.push_back(new Item_int((int32) tab->ref.key_length));
9323 9324
	for (store_key **ref=tab->ref.key_copy ; *ref ; ref++)
	{
9325 9326
	  if (tmp2.length())
	    tmp2.append(',');
9327 9328
	  tmp2.append((*ref)->name(), strlen((*ref)->name()),
		      system_charset_info);
9329
	}
9330
	item_list.push_back(new Item_string(tmp2.ptr(),tmp2.length(),cs));
9331 9332 9333
      }
      else if (tab->type == JT_NEXT)
      {
9334 9335
	KEY *key_info=table->key_info+ tab->index;
	item_list.push_back(new Item_string(key_info->name,
9336
					    strlen(key_info->name),cs));
9337 9338
	item_list.push_back(new Item_int((int32) key_info->key_length));
	item_list.push_back(item_null);
9339 9340 9341
      }
      else if (tab->select && tab->select->quick)
      {
9342 9343
	KEY *key_info=table->key_info+ tab->select->quick->index;
	item_list.push_back(new Item_string(key_info->name,
9344
					    strlen(key_info->name),cs));
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
9345 9346
	item_list.push_back(new Item_int((int32) tab->select->quick->
					 max_used_key_length));
9347
	item_list.push_back(item_null);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
9348 9349 9350
      }
      else
      {
9351 9352 9353
	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
9354
      }
9355
      /* rows */
9356 9357 9358
      item_list.push_back(new Item_int((longlong) (ulonglong)
				       join->best_positions[i]. records_read,
				       21));
9359
      /* extra */
9360
      my_bool key_read=table->key_read;
9361 9362
      if ((tab->type == JT_NEXT || tab->type == JT_CONST) &&
          table->used_keys.is_set(tab->index))
9363
	key_read=1;
9364

9365
      if (tab->info)
9366
	item_list.push_back(new Item_string(tab->info,strlen(tab->info),cs));
9367
      else
bk@work.mysql.com's avatar
bk@work.mysql.com committed
9368
      {
9369
	if (tab->select)
9370
	{
9371 9372
	  if (tab->use_quick == 2)
	  {
9373
            char buf[MAX_KEY/8+1];
serg@serg.mylan's avatar
serg@serg.mylan committed
9374
	    sprintf(buff_ptr,"; Range checked for each record (index map: 0x%s)",
9375
                tab->keys.print(buf));
9376 9377 9378 9379
	    buff_ptr=strend(buff_ptr);
	  }
	  else
	    buff_ptr=strmov(buff_ptr,"; Using where");
9380
	}
9381 9382 9383 9384 9385 9386 9387 9388 9389 9390 9391 9392 9393 9394
	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");
	}
9395
	if (distinct & test_all_bits(used_tables,thd->used_tables))
9396 9397
	  buff_ptr= strmov(buff_ptr,"; Distinct");
	if (buff_ptr == buff)
9398 9399
	  buff_ptr+= 2;				// Skip inital "; "
	item_list.push_back(new Item_string(buff+2,(uint) (buff_ptr - buff)-2,
9400
					    cs));
9401 9402 9403
      }
      // For next iteration
      used_tables|=table->map;
9404
      if (result->send_data(item_list))
9405
	join->error= 1;
9406
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
9407
  }
9408 9409 9410 9411 9412 9413 9414
  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
9415 9416 9417
  DBUG_VOID_RETURN;
}

9418

9419 9420
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
9421
  DBUG_ENTER("mysql_explain_union");
9422 9423
  int res= 0;
  SELECT_LEX *first= unit->first_select();
9424

9425 9426 9427 9428
  for (SELECT_LEX *sl= first;
       sl;
       sl= sl->next_select())
  {
9429 9430
    // drop UNCACHEABLE_EXPLAIN, because it is for internal usage only
    uint8 uncacheable= (sl->uncacheable & ~UNCACHEABLE_EXPLAIN);
9431 9432 9433 9434 9435 9436 9437 9438 9439 9440 9441 9442 9443 9444 9445 9446 9447 9448
    sl->type= (((&thd->lex->select_lex)==sl)?
	       ((thd->lex->all_selects_list != sl) ? 
		primary_key_name : "SIMPLE"):
	       ((sl == first)?
		((sl->linkage == DERIVED_TABLE_TYPE) ?
		 "DERIVED":
		 ((uncacheable & UNCACHEABLE_DEPENDENT) ?
		  "DEPENDENT SUBQUERY":
		  (uncacheable?"UNCACHEABLE SUBQUERY":
		   "SUBQUERY"))):
		((uncacheable & UNCACHEABLE_DEPENDENT) ?
		 "DEPENDENT UNION":
		 uncacheable?"UNCACHEABLE UNION":
		 "UNION")));
    sl->options|= SELECT_DESCRIBE;
  }
  if (first->next_select())
  {
bell@sanja.is.com.ua's avatar
bell@sanja.is.com.ua committed
9449
    unit->fake_select_lex->select_number= UINT_MAX; // jost for initialization
9450 9451 9452 9453 9454 9455 9456 9457 9458 9459 9460 9461 9462 9463 9464 9465 9466 9467 9468 9469 9470
    unit->fake_select_lex->type= "UNION RESULT";
    unit->fake_select_lex->options|= SELECT_DESCRIBE;
    if (!(res= unit->prepare(thd, result, SELECT_NO_UNLOCK | SELECT_DESCRIBE)))
      res= unit->exec();
    res|= unit->cleanup();
  }
  else
  {
    thd->lex->current_select= first;
    res= mysql_select(thd, &first->ref_pointer_array,
			(TABLE_LIST*) first->table_list.first,
			first->with_wild, first->item_list,
			first->where,
			first->order_list.elements +
			first->group_list.elements,
			(ORDER*) first->order_list.first,
			(ORDER*) first->group_list.first,
			first->having,
			(ORDER*) thd->lex->proc_list.first,
			first->options | thd->options | SELECT_DESCRIBE,
			result, unit, first);
9471
  }
9472 9473
  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
9474
  DBUG_RETURN(res);
9475 9476
}

9477

9478 9479 9480 9481 9482
void st_select_lex::print(THD *thd, String *str)
{
  if (!thd)
    thd= current_thd;

9483
  str->append("select ", 7);
9484 9485 9486
  
  //options
  if (options & SELECT_STRAIGHT_JOIN)
9487
    str->append("straight_join ", 14);
9488
  if ((thd->lex->lock_option == TL_READ_HIGH_PRIORITY) &&
9489
      (this == &thd->lex->select_lex))
9490
    str->append("high_priority ", 14);
9491
  if (options & SELECT_DISTINCT)
9492
    str->append("distinct ", 9);
9493
  if (options & SELECT_SMALL_RESULT)
9494
    str->append("sql_small_result ", 17);
9495
  if (options & SELECT_BIG_RESULT)
9496
    str->append("sql_big_result ", 15);
9497
  if (options & OPTION_BUFFER_RESULT)
9498
    str->append("sql_buffer_result ", 18);
9499
  if (options & OPTION_FOUND_ROWS)
9500
    str->append("sql_calc_found_rows ", 20);
9501
  if (!thd->lex->safe_to_cache_query)
9502
    str->append("sql_no_cache ", 13);
9503
  if (options & OPTION_TO_QUERY_CACHE)
9504
    str->append("sql_cache ", 10);
9505 9506 9507 9508 9509 9510 9511 9512 9513 9514 9515 9516 9517 9518 9519 9520 9521 9522 9523 9524

  //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)
  {
9525
    str->append(" from ", 6);
9526 9527 9528 9529 9530 9531 9532 9533 9534 9535 9536 9537 9538 9539 9540 9541 9542
    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);
9543
	if (my_strcasecmp(table_alias_charset, table->real_name, table->alias))
9544 9545 9546 9547 9548 9549 9550 9551 9552 9553 9554 9555
	{
	  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)
      {
9556
	str->append(" on(", 4);
9557 9558 9559 9560 9561
	next_on->print(str);
	str->append(')');
	next_on= 0;
      }

9562 9563
      TABLE_LIST *next_table;
      if ((next_table= table->next))
9564 9565 9566
      {
	if (table->outer_join & JOIN_TYPE_RIGHT)
	{
9567
	  str->append(" right join ", 12);
9568 9569 9570 9571
	  if (!(table->outer_join & JOIN_TYPE_LEFT) &&
	      table->on_expr)
	    next_on= table->on_expr;	    
	}
9572
	else if (next_table->straight)
9573
	  str->append(" straight_join ", 15);
9574
	else if (next_table->outer_join & JOIN_TYPE_LEFT)
9575
	  str->append(" left join ", 11);
9576
	else
9577
	  str->append(" join ", 6);
9578 9579 9580 9581
      }
    }
  }

9582 9583
  // Where
  Item *cur_where= where;
9584
  if (join)
9585 9586
    cur_where= join->conds;
  if (cur_where)
9587
  {
9588
    str->append(" where ", 7);
9589
    cur_where->print(str);
9590 9591
  }

9592
  // group by & olap
9593 9594
  if (group_list.elements)
  {
9595
    str->append(" group by ", 10);
9596 9597 9598 9599
    print_order(str, (ORDER *) group_list.first);
    switch (olap)
    {
      case CUBE_TYPE:
9600
	str->append(" with cube", 10);
9601 9602
	break;
      case ROLLUP_TYPE:
9603
	str->append(" with rollup", 12);
9604 9605 9606 9607 9608 9609
	break;
      default:
	;  //satisfy compiler
    }
  }

9610 9611
  // having
  Item *cur_having= having;
9612
  if (join)
9613
    cur_having= join->having;
9614

9615
  if (cur_having)
9616
  {
9617
    str->append(" having ", 8);
9618
    cur_having->print(str);
9619 9620 9621 9622
  }

  if (order_list.elements)
  {
9623
    str->append(" order by ", 10);
9624 9625 9626 9627 9628 9629 9630 9631
    print_order(str, (ORDER *) order_list.first);
  }

  // limit
  print_limit(thd, str);

  // PROCEDURE unsupported here
}
9632 9633 9634 9635 9636 9637 9638 9639 9640 9641 9642 9643 9644 9645 9646 9647 9648 9649 9650 9651 9652 9653 9654 9655


/*
  change select_result object of JOIN

  SYNOPSIS
    JOIN::change_result()
    res		new select_result object

  RETURN
    0 - OK
    -1 - error
*/

int JOIN::change_result(select_result *res)
{
  DBUG_ENTER("JOIN::change_result");
  result= res;
  if (!procedure && result->prepare(fields_list, select_lex->master_unit()))
  {
    DBUG_RETURN(-1);
  }
  DBUG_RETURN(0);
}