sql_select.h 12.5 KB
Newer Older
unknown's avatar
unknown committed
1
/* Copyright (C) 2000 MySQL AB & MySQL Finland AB & TCX DataKonsult AB
unknown's avatar
unknown committed
2

unknown's avatar
unknown committed
3 4 5 6
   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.
unknown's avatar
unknown committed
7

unknown's avatar
unknown committed
8 9 10 11
   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.
unknown's avatar
unknown committed
12

unknown's avatar
unknown committed
13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
   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 */


/* classes to use when handling where clause */

#ifdef __GNUC__
#pragma interface			/* gcc class implementation */
#endif

#include "procedure.h"
#include <myisam.h>

typedef struct keyuse_t {
  TABLE *table;
  Item	*val;				/* or value if no field */
  table_map used_tables;
31
  uint	key, keypart, optimize;
32 33
  key_part_map keypart_map;
  ha_rows      ref_table_rows;
unknown's avatar
unknown committed
34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77
} KEYUSE;

class store_key;

typedef struct st_table_ref
{
  bool		key_err;
  uint          key_parts;                // num of ...
  uint          key_length;               // length of key_buff
  int           key;                      // key no
  byte          *key_buff;                // value to look for with key
  byte          *key_buff2;               // key_buff+key_length
  store_key     **key_copy;               //
  Item          **items;                  // val()'s for each keypart
  table_map	depend_map;		  // Table depends on these tables.
} TABLE_REF;

/*
** CACHE_FIELD and JOIN_CACHE is used on full join to cache records in outer
** table
*/


typedef struct st_cache_field {
  char *str;
  uint length,blob_length;
  Field_blob *blob_field;
  bool strip;
} CACHE_FIELD;


typedef struct st_join_cache {
  uchar *buff,*pos,*end;
  uint records,record_nr,ptr_record,fields,length,blobs;
  CACHE_FIELD *field,**blob_ptr;
  SQL_SELECT *select;
} JOIN_CACHE;


/*
** The structs which holds the join connections and join states
*/

enum join_type { JT_UNKNOWN,JT_SYSTEM,JT_CONST,JT_EQ_REF,JT_REF,JT_MAYBE_REF,
78
		 JT_ALL, JT_RANGE, JT_NEXT, JT_FT, JT_REF_OR_NULL,
79
		 JT_UNIQUE_SUBQUERY, JT_INDEX_SUBQUERY};
unknown's avatar
unknown committed
80 81 82 83 84

class JOIN;

typedef struct st_join_table {
  TABLE		*table;
unknown's avatar
unknown committed
85 86 87 88 89 90
  KEYUSE	*keyuse;			/* pointer to first used key */
  SQL_SELECT	*select;
  COND		*select_cond;
  QUICK_SELECT	*quick;
  Item		*on_expr;
  const char	*info;
91
  byte		*null_ref_key;
unknown's avatar
unknown committed
92 93 94
  int		(*read_first_record)(struct st_join_table *tab);
  int		(*next_select)(JOIN *,struct st_join_table *,bool);
  READ_RECORD	read_record;
unknown's avatar
unknown committed
95
  double	worst_seeks;
unknown's avatar
unknown committed
96 97 98
  key_map	const_keys;			/* Keys with constant part */
  key_map	checked_keys;			/* Keys checked in find_best */
  key_map	needed_reg;
99
  key_map       keys;                           /* all keys with can be used */
unknown's avatar
unknown committed
100 101 102 103 104
  ha_rows	records,found_records,read_time;
  table_map	dependent,key_dependent;
  uint		use_quick,index;
  uint		status;				// Save status for cache
  uint		used_fields,used_fieldlength,used_blobs;
unknown's avatar
unknown committed
105 106
  enum join_type type;
  bool		cached_eq_ref_table,eq_ref_table,not_used_in_distinct;
unknown's avatar
unknown committed
107
  TABLE_REF	ref;
unknown's avatar
unknown committed
108
  JOIN_CACHE	cache;
109
  JOIN		*join;
unknown's avatar
unknown committed
110 111 112
} JOIN_TAB;


113 114
typedef struct st_position			/* Used in find_best */
{
unknown's avatar
unknown committed
115
  double records_read;
unknown's avatar
unknown committed
116 117 118 119
  JOIN_TAB *table;
  KEYUSE *key;
} POSITION;

120 121 122 123 124 125 126 127 128
typedef struct st_rollup
{
  enum State { STATE_NONE, STATE_INITED, STATE_READY };
  State state;
  Item *item_null;
  Item ***ref_pointer_arrays;
  List<Item> *fields;
} ROLLUP;

unknown's avatar
unknown committed
129

130 131
class JOIN :public Sql_alloc
{
unknown's avatar
unknown committed
132 133
 public:
  JOIN_TAB *join_tab,**best_ref,**map2table;
134
  JOIN_TAB *join_tab_save; //saved join_tab for subquery reexecution
unknown's avatar
unknown committed
135 136 137 138
  TABLE    **table,**all_tables,*sort_by_table;
  uint	   tables,const_tables;
  uint	   send_group_parts;
  bool	   sort_and_group,first_record,full_join,group, no_field_update;
139
  bool	   do_send_rows;
140
  table_map const_table_map,found_const_table_map,outer_join;
unknown's avatar
unknown committed
141
  ha_rows  send_records,found_records,examined_rows,row_limit, select_limit;
unknown's avatar
unknown committed
142 143 144
  POSITION positions[MAX_TABLES+1],best_positions[MAX_TABLES+1];
  double   best_read;
  List<Item> *fields;
145
  List<Item_buff> group_fields, group_fields_cache;
unknown's avatar
unknown committed
146
  TABLE    *tmp_table;
147 148
  // used to store 2 possible tmp table of SELECT
  TABLE    *exec_tmp_table1, *exec_tmp_table2;
unknown's avatar
unknown committed
149
  THD	   *thd;
150
  Item_sum  **sum_funcs, ***sum_funcs_end;
151 152
  /* second copy of sumfuncs (for queries with 2 temporary tables */
  Item_sum  **sum_funcs2, ***sum_funcs_end2;
unknown's avatar
unknown committed
153 154
  Procedure *procedure;
  Item	    *having;
unknown's avatar
unknown committed
155
  Item      *tmp_having; // To store Having when processed temporary table
unknown's avatar
unknown committed
156 157 158 159
  uint	    select_options;
  select_result *result;
  TMP_TABLE_PARAM tmp_table_param;
  MYSQL_LOCK *lock;
160 161
  // unit structure (with global parameters) for this select
  SELECT_LEX_UNIT *unit;
162 163
  // select that processed
  SELECT_LEX *select_lex;
164 165
  
  JOIN *tmp_join; // copy of this JOIN to be used with temporary tables
166
  ROLLUP rollup;				// Used with rollup
167 168 169 170 171 172 173 174

  bool select_distinct, //Is select distinct?
    no_order, simple_order, simple_group,
    skip_sort_order, need_tmp,
    hidden_group_fields,
    buffer_result;
  DYNAMIC_ARRAY keyuse;
  Item::cond_result cond_value;
175 176 177 178 179
  List<Item> all_fields; // to store all fields that used in query
  //Above list changed to use temporary table
  List<Item> tmp_all_fields1, tmp_all_fields2, tmp_all_fields3;
  //Part, shared with list above, emulate following list
  List<Item> tmp_fields_list1, tmp_fields_list2, tmp_fields_list3;
180
  List<Item> &fields_list; // hold field list passed to mysql_select
181 182 183 184 185 186
  int error;

  ORDER *order, *group_list, *proc_param; //hold parameters of mysql_select
  COND *conds;                            // ---"---
  TABLE_LIST *tables_list;           //hold 'tables' parameter of mysql_selec
  SQL_SELECT *select;                //created in optimisation phase
187 188
  Item **ref_pointer_array; //used pointer reference for this select
  // Copy of above to be used with different lists
189
  Item **items0, **items1, **items2, **items3, **current_ref_pointer_array;
190
  uint ref_pointer_array_size; // size of above in bytes
191
  const char *zero_result_cause; // not 0 if exec must return zero result
192
  
193 194
  bool union_part; // this subselect is part of union 
  bool optimized; // flag to avoid double optimization in EXPLAIN
195

196
  JOIN(THD *thd_arg, List<Item> &fields, ulong select_options_arg,
197 198
       select_result *result_arg)
    :fields_list(fields)
199
  {
200 201 202 203 204 205
    init(thd_arg, fields, select_options_arg, result_arg);
  }
  
  void init(THD *thd_arg, List<Item> &fields, ulong select_options_arg,
       select_result *result_arg)
  {
206
    join_tab= join_tab_save= 0;
207 208 209 210 211 212 213 214 215 216 217 218
    table= 0;
    tables= 0;
    const_tables= 0;
    sort_and_group= 0;
    first_record= 0;
    do_send_rows= 1;
    send_records= 0;
    found_records= 0;
    examined_rows= 0;
    exec_tmp_table1= 0;
    exec_tmp_table2= 0;
    thd= thd_arg;
unknown's avatar
merge  
unknown committed
219
    sum_funcs= sum_funcs2= 0;
220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245
    procedure= 0;
    having= 0;
    tmp_having= 0;
    select_options= select_options_arg;
    result= result_arg;
    lock= thd_arg->lock;
    select_lex= 0; //for safety
    tmp_join= 0;
    select_distinct= test(select_options & SELECT_DISTINCT);
    no_order= 0;
    simple_order= 0;
    simple_group= 0;
    skip_sort_order= 0;
    need_tmp= 0;
    hidden_group_fields= 0; /*safety*/
    buffer_result= test(select_options & OPTION_BUFFER_RESULT) &&
      !test(select_options & OPTION_FOUND_ROWS);
    all_fields= fields;
    fields_list= fields;
    error= 0;
    select= 0;
    ref_pointer_array= items0= items1= items2= items3= 0;
    ref_pointer_array_size= 0;
    zero_result_cause= 0;
    optimized= 0;

246
    fields_list= fields;
247 248 249
    bzero((char*) &keyuse,sizeof(keyuse));
    tmp_table_param.copy_field=0;
    tmp_table_param.end_write_records= HA_POS_ERROR;
250
    rollup.state= ROLLUP::STATE_NONE;
251
  }
252

253 254 255
  int prepare(Item ***rref_pointer_array, TABLE_LIST *tables, uint wind_num,
	      COND *conds, uint og_num, ORDER *order, ORDER *group,
	      Item *having, ORDER *proc_param, SELECT_LEX *select,
256
	      SELECT_LEX_UNIT *unit, bool tables_and_fields_initied);
257
  int optimize();
258
  int reinit();
259
  void exec();
260
  int cleanup();
261
  void restore_tmp();
262 263 264
  bool alloc_func_list();
  bool make_sum_func_list(List<Item> &all_fields, List<Item> &send_fields,
			  bool before_group_by);
265

266 267 268 269 270
  inline void set_items_ref_array(Item **ptr)
  {
    memcpy((char*) ref_pointer_array, (char*) ptr, ref_pointer_array_size);
    current_ref_pointer_array= ptr;
  }
271 272 273 274
  inline void init_items_ref_array()
  {
    items0= ref_pointer_array + all_fields.elements;
    memcpy(items0, ref_pointer_array, ref_pointer_array_size);
275
    current_ref_pointer_array= items0;
276
  }
277 278 279 280

  bool rollup_init();
  bool rollup_make_fields(List<Item> &all_fields, List<Item> &fields,
			  Item_sum ***func);
281 282
  int rollup_send_data(uint idx);
  bool test_in_subselect(Item **where);
283
  void join_free(bool full);
284
  void clear();
285
  bool save_join_tab();
unknown's avatar
unknown committed
286 287 288 289 290 291 292 293 294 295 296 297 298 299
};


typedef struct st_select_check {
  uint const_ref,reg_ref;
} SELECT_CHECK;

extern const char *join_type_str[];
void TEST_join(JOIN *join);

/* Extern functions in sql_select.cc */
bool store_val_in_field(Field *field,Item *val);
TABLE *create_tmp_table(THD *thd,TMP_TABLE_PARAM *param,List<Item> &fields,
			ORDER *group, bool distinct, bool save_sum_fields,
300 301
			ulong select_options, ha_rows rows_limit,
			char* alias);
unknown's avatar
unknown committed
302
void free_tmp_table(THD *thd, TABLE *entry);
unknown's avatar
unknown committed
303 304
void count_field_types(TMP_TABLE_PARAM *param, List<Item> &fields,
		       bool reset_with_sum_func);
305 306 307 308
bool setup_copy_fields(THD *thd, TMP_TABLE_PARAM *param,
		       Item **ref_pointer_array,
		       List<Item> &new_list1, List<Item> &new_list2,
		       uint elements, List<Item> &fields);
unknown's avatar
unknown committed
309
void copy_fields(TMP_TABLE_PARAM *param);
unknown's avatar
unknown committed
310
void copy_funcs(Item **func_ptr);
unknown's avatar
unknown committed
311 312
bool create_myisam_from_heap(THD *thd, TABLE *table, TMP_TABLE_PARAM *param,
			     int error, bool ignore_last_dupp_error);
unknown's avatar
unknown committed
313 314 315 316 317 318 319 320 321 322 323 324 325

/* functions from opt_sum.cc */
int opt_sum_query(TABLE_LIST *tables, List<Item> &all_fields,COND *conds);

/* class to copying an field/item to a key struct */

class store_key :public Sql_alloc
{
 protected:
  Field *to_field;				// Store data here
  char *null_ptr;
  char err;
 public:
unknown's avatar
unknown committed
326
  store_key(THD *thd, Field *field_arg, char *ptr, char *null, uint length)
unknown's avatar
unknown committed
327 328 329 330 331
    :null_ptr(null),err(0)
  {
    if (field_arg->type() == FIELD_TYPE_BLOB)
      to_field=new Field_varstring(ptr, length, (uchar*) null, 1, 
				   Field::NONE, field_arg->field_name,
332
				   field_arg->table, field_arg->charset());
unknown's avatar
unknown committed
333 334
    else
    {
unknown's avatar
unknown committed
335
      to_field=field_arg->new_field(&thd->mem_root,field_arg->table);
unknown's avatar
unknown committed
336 337 338 339 340 341 342 343 344 345 346 347 348 349 350
      if (to_field)
	to_field->move_field(ptr, (uchar*) null, 1);
    }
  }
  virtual ~store_key() {}			/* Not actually needed */
  virtual bool copy()=0;
  virtual const char *name() const=0;
};


class store_key_field: public store_key
{
  Copy_field copy_field;
  const char *field_name;
 public:
unknown's avatar
unknown committed
351
  store_key_field(THD *thd, Field *to_field_arg, char *ptr, char *null_ptr_arg,
unknown's avatar
unknown committed
352
		  uint length, Field *from_field, const char *name_arg)
unknown's avatar
unknown committed
353
    :store_key(thd, to_field_arg,ptr,
unknown's avatar
unknown committed
354 355 356 357 358 359 360 361
	       null_ptr_arg ? null_ptr_arg : from_field->maybe_null() ? &err
	       : NullS,length), field_name(name_arg)
  {
    if (to_field)
    {
      copy_field.set(to_field,from_field,0);
    }
  }
362 363 364 365 366 367
  bool copy()
  {
    copy_field.do_copy(&copy_field);
    return err != 0;
  }
  const char *name() const { return field_name; }
unknown's avatar
unknown committed
368 369 370 371 372 373 374 375
};


class store_key_item :public store_key
{
 protected:
  Item *item;
public:
unknown's avatar
unknown committed
376
  store_key_item(THD *thd, Field *to_field_arg, char *ptr, char *null_ptr_arg,
unknown's avatar
unknown committed
377
		 uint length, Item *item_arg)
unknown's avatar
unknown committed
378
    :store_key(thd, to_field_arg,ptr,
unknown's avatar
unknown committed
379 380 381 382 383
	       null_ptr_arg ? null_ptr_arg : item_arg->maybe_null ?
	       &err : NullS, length), item(item_arg)
  {}
  bool copy()
  {
384
    return item->save_in_field(to_field, 1) || err != 0;
unknown's avatar
unknown committed
385 386 387 388 389 390 391 392 393
  }
  const char *name() const { return "func"; }
};


class store_key_const_item :public store_key_item
{
  bool inited;
public:
unknown's avatar
unknown committed
394
  store_key_const_item(THD *thd, Field *to_field_arg, char *ptr,
unknown's avatar
unknown committed
395 396
		       char *null_ptr_arg, uint length,
		       Item *item_arg)
unknown's avatar
unknown committed
397
    :store_key_item(thd, to_field_arg,ptr,
unknown's avatar
unknown committed
398 399 400 401 402 403 404 405 406
		    null_ptr_arg ? null_ptr_arg : item_arg->maybe_null ?
		    &err : NullS, length, item_arg), inited(0)
  {
  }
  bool copy()
  {
    if (!inited)
    {
      inited=1;
407 408
      if (item->save_in_field(to_field, 1))
	err= 1;
unknown's avatar
unknown committed
409 410 411 412 413 414 415
    }
    return err != 0;
  }
  const char *name() const { return "const"; }
};

bool cp_buffer_from_ref(TABLE_REF *ref);
unknown's avatar
unknown committed
416
bool error_if_full_join(JOIN *join);
417
void relink_tables(SELECT_LEX *select_lex);
418
int report_error(TABLE *table, int error);
419
int safe_index_read(JOIN_TAB *tab);
420
COND *eliminate_not_funcs(COND *cond);