~drizzle-trunk/drizzle/development

/* Copyright (C) 2000-2006 MySQL AB

   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; version 2 of the License.

   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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA */

/**

  @file

  @brief

  Sorts a database

*/

#include <config.h>

#include <float.h>

#include <limits.h>

#include <queue>

#include <algorithm>

#include <iostream>

#include <drizzled/drizzled.h>

#include <drizzled/sql_sort.h>

#include <drizzled/filesort.h>

#include <drizzled/error.h>

#include <drizzled/probes.h>

#include <drizzled/session.h>

#include <drizzled/table.h>

#include <drizzled/table_list.h>

#include <drizzled/optimizer/range.h>

#include <drizzled/records.h>

#include <drizzled/internal/iocache.h>

#include <drizzled/internal/my_sys.h>

#include <plugin/myisam/myisam.h>

#include <drizzled/plugin/transactional_storage_engine.h>

#include <drizzled/atomics.h>

#include <drizzled/global_buffer.h>

#include <drizzled/sort_field.h>

#include <drizzled/item/subselect.h>

#include <drizzled/statistics_variables.h>

#include <drizzled/system_variables.h>

using namespace std;

namespace drizzled {

/* Defines used by filesort and uniques */

#define MERGEBUFF		7

#define MERGEBUFF2		15

class BufferCompareContext

{

public:

  qsort_cmp2 key_compare;

  void *key_compare_arg;

  BufferCompareContext() :

    key_compare(0),

    key_compare_arg(0)

  { }

};

class SortParam {

public:

  uint32_t rec_length;          /* Length of sorted records */

  uint32_t sort_length;			/* Length of sorted columns */

  uint32_t ref_length;			/* Length of record ref. */

  uint32_t addon_length;        /* Length of added packed fields */

  uint32_t res_length;          /* Length of records in final sorted file/buffer */

  uint32_t keys;				/* Max keys / buffer */

  ha_rows max_rows,examined_rows;

  Table *sort_form;			/* For quicker make_sortkey */

  SortField *local_sortorder;

  SortField *end;

  sort_addon_field *addon_field; /* Descriptors for companion fields */

  unsigned char *unique_buff;

  bool not_killable;

  char *tmp_buffer;

  /* The fields below are used only by Unique class */

  qsort2_cmp compare;

  BufferCompareContext cmp_context;

  SortParam() :

    rec_length(0),

    sort_length(0),

    ref_length(0),

    addon_length(0),

    res_length(0),

    keys(0),

    max_rows(0),

    examined_rows(0),

    sort_form(0),

    local_sortorder(0),

    end(0),

    addon_field(0),

    unique_buff(0),

    not_killable(0),

    tmp_buffer(0),

    compare(0)

  {

  }

  ~SortParam()

  {

    free(tmp_buffer);

  }

  int write_keys(unsigned char * *sort_keys,

                 uint32_t count,

                 internal::io_cache_st *buffer_file,

                 internal::io_cache_st *tempfile);

  void make_sortkey(unsigned char *to,

                    unsigned char *ref_pos);

  void register_used_fields();

  void save_index(unsigned char **sort_keys,

                  uint32_t count,

                  filesort_info *table_sort);

};

/* functions defined in this file */

static char **make_char_array(char **old_pos, uint32_t fields,

                              uint32_t length);

static unsigned char *read_buffpek_from_file(internal::io_cache_st *buffer_file,

                                             uint32_t count,

                                             unsigned char *buf);

static uint32_t suffix_length(uint32_t string_length);

static void unpack_addon_fields(sort_addon_field *addon_field,

                                unsigned char *buff);

FileSort::FileSort(Session &arg) :

  _session(arg)

{ 

}

/**

  Sort a table.

  Creates a set of pointers that can be used to read the rows

  in sorted order. This should be done with the functions

  in records.cc.

  Before calling filesort, one must have done

  table->file->info(HA_STATUS_VARIABLE)

  The result set is stored in table->io_cache or

  table->record_pointers.

  @param table		Table to sort

  @param sortorder	How to sort the table

  @param s_length	Number of elements in sortorder

  @param select		condition to apply to the rows

  @param max_rows	Return only this many rows

  @param sort_positions	Set to 1 if we want to force sorting by position

			(Needed by UPDATE/INSERT or ALTER Table)

  @param examined_rows	Store number of examined rows here

  @todo

    check why we do this (param.keys--)

  @note

    If we sort by position (like if sort_positions is 1) filesort() will

    call table->prepare_for_position().

  @retval

    HA_POS_ERROR	Error

  @retval

    \#			Number of rows

  @retval

    examined_rows	will be set to number of examined rows

*/

ha_rows FileSort::run(Table *table, SortField *sortorder, uint32_t s_length,

                      optimizer::SqlSelect *select, ha_rows max_rows,

                      bool sort_positions, ha_rows &examined_rows)

{

  int error= 1;

  uint32_t memavl= 0, min_sort_memory;

  uint32_t maxbuffer;

  size_t allocated_sort_memory= 0;

  buffpek *buffpek_inst= 0;

  ha_rows records= HA_POS_ERROR;

  unsigned char **sort_keys= 0;

  internal::io_cache_st tempfile;

  internal::io_cache_st buffpek_pointers;

  internal::io_cache_st *selected_records_file;

  internal::io_cache_st *outfile;

  SortParam param;

  bool multi_byte_charset;

  /*

    Don't use table->sort in filesort as it is also used by

    QuickIndexMergeSelect. Work with a copy and put it back at the end

    when index_merge select has finished with it.

  */

  filesort_info table_sort(table->sort);

  table->sort.io_cache= NULL;

  TableList *tab= table->pos_in_table_list;

  Item_subselect *subselect= tab ? tab->containing_subselect() : 0;

  DRIZZLE_FILESORT_START(table->getShare()->getSchemaName(), table->getShare()->getTableName());

  /*

   Release InnoDB's adaptive hash index latch (if holding) before

   running a sort.

  */

  plugin::TransactionalStorageEngine::releaseTemporaryLatches(&getSession());

  outfile= table_sort.io_cache;

  assert(tempfile.buffer == 0);

  assert(buffpek_pointers.buffer == 0);

  param.sort_length= sortlength(sortorder, s_length, &multi_byte_charset);

  param.ref_length= table->cursor->ref_length;

  if (!(table->cursor->getEngine()->check_flag(HTON_BIT_FAST_KEY_READ)) && !sort_positions)

  {

    /*

      Get the descriptors of all fields whose values are appended

      to sorted fields and get its total length in param.spack_length.

    */

    param.addon_field= get_addon_fields(table->getFields(),

                                        param.sort_length,

                                        &param.addon_length);

  }

  table_sort.addon_buf= 0;

  table_sort.addon_length= param.addon_length;

  table_sort.addon_field= param.addon_field;

  table_sort.unpack= unpack_addon_fields;

  if (param.addon_field)

  {

    param.res_length= param.addon_length;

    table_sort.addon_buf= (unsigned char *) malloc(param.addon_length);

  }

  else

  {

    param.res_length= param.ref_length;

    /*

      The reference to the record is considered

      as an additional sorted field

    */

    param.sort_length+= param.ref_length;

  }

  param.rec_length= param.sort_length+param.addon_length;

  param.max_rows= max_rows;

  if (select && select->quick)

  {

    getSession().status_var.filesort_range_count++;

  }

  else

  {

    getSession().status_var.filesort_scan_count++;

  }

#ifdef CAN_TRUST_RANGE

  if (select && select->quick && select->quick->records > 0L)

  {

    records= min((ha_rows) (select->quick->records*2+EXTRA_RECORDS*2),

                 table->cursor->stats.records)+EXTRA_RECORDS;

    selected_records_file=0;

  }

  else

#endif

  {

    records= table->cursor->estimate_rows_upper_bound();

    /*

      If number of records is not known, use as much of sort buffer

      as possible.

    */

    if (records == HA_POS_ERROR)

      records--;  // we use 'records+1' below.

    selected_records_file= 0;

  }

  if (multi_byte_charset)

    param.tmp_buffer= (char*) malloc(param.sort_length);

  memavl= getSession().variables.sortbuff_size;

  min_sort_memory= max((uint32_t)MIN_SORT_MEMORY, param.sort_length*MERGEBUFF2);

  while (memavl >= min_sort_memory)

  {

    uint32_t old_memavl;

    uint32_t keys= memavl/(param.rec_length+sizeof(char*));

    param.keys= (uint32_t) min(records+1, (ha_rows)keys);

    allocated_sort_memory= param.keys * param.rec_length;

    if (not global_sort_buffer.add(allocated_sort_memory))

    {

      my_error(ER_OUT_OF_GLOBAL_SORTMEMORY, MYF(ME_ERROR+ME_WAITTANG));

      goto err;

    }

    if ((table_sort.sort_keys=

	 (unsigned char **) make_char_array((char **) table_sort.sort_keys,

                                            param.keys, param.rec_length)))

      break;

    global_sort_buffer.sub(allocated_sort_memory);

    old_memavl= memavl;

    if ((memavl= memavl/4*3) < min_sort_memory && old_memavl > min_sort_memory)

      memavl= min_sort_memory;

  }

  sort_keys= table_sort.sort_keys;

  if (memavl < min_sort_memory)

  {

    my_error(ER_OUT_OF_SORTMEMORY,MYF(ME_ERROR+ME_WAITTANG));

    goto err;

  }

  if (buffpek_pointers.open_cached_file(drizzle_tmpdir.c_str(),TEMP_PREFIX, DISK_BUFFER_SIZE, MYF(MY_WME)))

  {

    goto err;

  }

  param.keys--;  			/* TODO: check why we do this */

  param.sort_form= table;

  param.end=(param.local_sortorder=sortorder)+s_length;

  if ((records= find_all_keys(&param,select,sort_keys, &buffpek_pointers,

                              &tempfile, selected_records_file)) == HA_POS_ERROR)

  {

    goto err;

  }

  maxbuffer= (uint32_t)(buffpek_pointers.tell() / sizeof(*buffpek_inst));

  if (maxbuffer == 0)			// The whole set is in memory

  {

    param.save_index(sort_keys,(uint32_t) records, &table_sort);

  }

  else

  {

    if (table_sort.buffpek && table_sort.buffpek_len < maxbuffer)

    {

      free(table_sort.buffpek);

      table_sort.buffpek = 0;

    }

    if (!(table_sort.buffpek=

          (unsigned char *) read_buffpek_from_file(&buffpek_pointers, maxbuffer, table_sort.buffpek)))

    {

      goto err;

    }

    buffpek_inst= (buffpek *) table_sort.buffpek;

    table_sort.buffpek_len= maxbuffer;

    buffpek_pointers.close_cached_file();

	/* Open cached file if it isn't open */

    if (not outfile->inited() && outfile->open_cached_file(drizzle_tmpdir.c_str(),TEMP_PREFIX,READ_RECORD_BUFFER, MYF(MY_WME)))

    {

      goto err;

    }

    if (outfile->reinit_io_cache(internal::WRITE_CACHE,0L,0,0))

    {

      goto err;

    }

    /*

      Use also the space previously used by string pointers in sort_buffer

      for temporary key storage.

    */

    param.keys=((param.keys*(param.rec_length+sizeof(char*))) / param.rec_length-1);

    maxbuffer--;				// Offset from 0

    if (merge_many_buff(&param,(unsigned char*) sort_keys,buffpek_inst,&maxbuffer, &tempfile))

    {

      goto err;

    }

    if (tempfile.flush() || tempfile.reinit_io_cache(internal::READ_CACHE,0L,0,0))

    {

      goto err;

    }

    if (merge_index(&param,(unsigned char*) sort_keys,buffpek_inst,maxbuffer,&tempfile, outfile))

    {

      goto err;

    }

  }

  if (records > param.max_rows)

  {

    records= param.max_rows;

  }

  error =0;

 err:

  if (not subselect || not subselect->is_uncacheable())

  {

    free(sort_keys);

    table_sort.sort_keys= 0;

    free(buffpek_inst);

    table_sort.buffpek= 0;

    table_sort.buffpek_len= 0;

  }

  tempfile.close_cached_file();

  buffpek_pointers.close_cached_file();

  if (outfile->inited())

  {

    if (outfile->flush())

    {

      error= 1;

    }

    {

      internal::my_off_t save_pos= outfile->pos_in_file;

      /* For following reads */

      if (outfile->reinit_io_cache(internal::READ_CACHE,0L,0,0))

      {

        error=1;

      }

      outfile->end_of_file=save_pos;

    }

  }

  if (error)

  {

    my_message(ER_FILSORT_ABORT, ER(ER_FILSORT_ABORT),

               MYF(ME_ERROR+ME_WAITTANG));

  }

  else

  {

    getSession().status_var.filesort_rows+= (uint32_t) records;

  }

  examined_rows= param.examined_rows;

  global_sort_buffer.sub(allocated_sort_memory);

  table->sort= table_sort;

  DRIZZLE_FILESORT_DONE(error, records);

  return (error ? HA_POS_ERROR : records);

} /* filesort */

/** Make a array of string pointers. */

static char **make_char_array(char **old_pos, uint32_t fields,

                              uint32_t length)

{

  if (not old_pos)

    old_pos= (char**) malloc((uint32_t) fields * (length + sizeof(char*)));

  char** pos= old_pos; 

  char* char_pos= ((char*) (pos+fields)) - length;

  while (fields--) 

    *(pos++) = (char_pos+= length);

  return old_pos;

} /* make_char_array */

/** Read 'count' number of buffer pointers into memory. */

static unsigned char *read_buffpek_from_file(internal::io_cache_st *buffpek_pointers, uint32_t count, unsigned char *buf)

{

  uint32_t length= sizeof(buffpek)*count;

  unsigned char *tmp= buf;

  if (count > UINT_MAX/sizeof(buffpek))

    return 0; /* sizeof(buffpek)*count will overflow */

  if (!tmp)

    tmp= (unsigned char *)malloc(length);

  {

    if (buffpek_pointers->reinit_io_cache(internal::READ_CACHE,0L,0,0) ||

      buffpek_pointers->read(tmp, length))

    {

      free(tmp);

      tmp= 0;

    }

  }

  return tmp;

}

/**

  Search after sort_keys and write them into tempfile.

  All produced sequences are guaranteed to be non-empty.

  @param param             Sorting parameter

  @param select            Use this to get source data

  @param sort_keys         Array of pointers to sort key + addon buffers.

  @param buffpek_pointers  File to write buffpeks describing sorted segments

                           in tempfile.

  @param tempfile          File to write sorted sequences of sortkeys to.

  @param indexfile         If !NULL, use it for source data (contains rowids)

  @note

    Basic idea:

    @verbatim

     while (get_next_sortkey())

     {

       if (no free space in sort_keys buffers)

       {

         sort sort_keys buffer;

         dump sorted sequence to 'tempfile';

         dump buffpek describing sequence location into 'buffpek_pointers';

       }

       put sort key into 'sort_keys';

     }

     if (sort_keys has some elements && dumped at least once)

       sort-dump-dump as above;

     else

       don't sort, leave sort_keys array to be sorted by caller.

  @endverbatim

  @retval

    Number of records written on success.

  @retval

    HA_POS_ERROR on error.

*/

ha_rows FileSort::find_all_keys(SortParam *param, 

                                optimizer::SqlSelect *select,

                                unsigned char **sort_keys,

                                internal::io_cache_st *buffpek_pointers,

                                internal::io_cache_st *tempfile, internal::io_cache_st *indexfile)

{

  int error,flag,quick_select;

  uint32_t idx,indexpos,ref_length;

  unsigned char *ref_pos,*next_pos,ref_buff[MAX_REFLENGTH];

  internal::my_off_t record;

  Table *sort_form;

  volatile Session::killed_state_t *killed= getSession().getKilledPtr();

  Cursor *file;

  boost::dynamic_bitset<> *save_read_set= NULL;

  boost::dynamic_bitset<> *save_write_set= NULL;

  idx=indexpos=0;

  error=quick_select=0;

  sort_form=param->sort_form;

  file= sort_form->cursor;

  ref_length=param->ref_length;

  ref_pos= ref_buff;

  quick_select=select && select->quick;

  record=0;

  flag= ((!indexfile && ! file->isOrdered())

	 || quick_select);

  if (indexfile || flag)

    ref_pos= &file->ref[0];

  next_pos=ref_pos;

  if (! indexfile && ! quick_select)

  {

    next_pos=(unsigned char*) 0;			/* Find records in sequence */

    if (file->startTableScan(1))

      return(HA_POS_ERROR);

    file->extra_opt(HA_EXTRA_CACHE, getSession().variables.read_buff_size);

  }

  ReadRecord read_record_info;

  if (quick_select)

  {

    if (select->quick->reset())

      return(HA_POS_ERROR);

    if (read_record_info.init_read_record(&getSession(), select->quick->head, select, 1, 1))

      return(HA_POS_ERROR);

  }

  /* Remember original bitmaps */

  save_read_set=  sort_form->read_set;

  save_write_set= sort_form->write_set;

  /* Set up temporary column read map for columns used by sort */

  sort_form->tmp_set.reset();

  /* Temporary set for register_used_fields and register_field_in_read_map */

  sort_form->read_set= &sort_form->tmp_set;

  param->register_used_fields();

  if (select && select->cond)

    select->cond->walk(&Item::register_field_in_read_map, 1,

                       (unsigned char*) sort_form);

  sort_form->column_bitmaps_set(sort_form->tmp_set, sort_form->tmp_set);

  for (;;)

  {

    if (quick_select)

    {

      if ((error= read_record_info.read_record(&read_record_info)))

      {

        error= HA_ERR_END_OF_FILE;

        break;

      }

      file->position(sort_form->getInsertRecord());

    }

    else					/* Not quick-select */

    {

      if (indexfile)

      {

	if (indexfile->read(ref_pos, ref_length))

	{

	  error= errno ? errno : -1;		/* Abort */

	  break;

	}

	error=file->rnd_pos(sort_form->getInsertRecord(),next_pos);

      }

      else

      {

	error=file->rnd_next(sort_form->getInsertRecord());

	if (!flag)

	{

	  internal::my_store_ptr(ref_pos,ref_length,record); // Position to row

	  record+= sort_form->getShare()->db_record_offset;

	}

	else if (!error)

	  file->position(sort_form->getInsertRecord());

      }

      if (error && error != HA_ERR_RECORD_DELETED)

	break;

    }

    if (*killed)

    {

      if (!indexfile && !quick_select)

      {

        (void) file->extra(HA_EXTRA_NO_CACHE);

        file->endTableScan();

      }

      return(HA_POS_ERROR);

    }

    if (error == 0)

      param->examined_rows++;

    if (error == 0 && (!select || select->skip_record() == 0))

    {

      if (idx == param->keys)

      {

	if (param->write_keys(sort_keys, idx, buffpek_pointers, tempfile))

	  return(HA_POS_ERROR);

	idx=0;

	indexpos++;

      }

      param->make_sortkey(sort_keys[idx++], ref_pos);

    }

    else

    {

      file->unlock_row();

    }

    /* It does not make sense to read more keys in case of a fatal error */

    if (getSession().is_error())

      break;

  }

  if (quick_select)

  {

    /*

      index_merge quick select uses table->sort when retrieving rows, so free

      resoures it has allocated.

    */

    read_record_info.end_read_record();

  }

  else

  {

    (void) file->extra(HA_EXTRA_NO_CACHE);	/* End cacheing of records */

    if (!next_pos)

      file->endTableScan();

  }

  if (getSession().is_error())