~drizzle-trunk/drizzle/development

/* -*- mode: c++; c-basic-offset: 2; indent-tabs-mode: nil; -*-

 *  vim:expandtab:shiftwidth=2:tabstop=2:smarttab:

 *

 *  Copyright (C) 2008 Sun Microsystems

 *

 *  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

 */

#ifndef _DRIZZLED_SQL_SORT_H

#define _DRIZZLED_SQL_SORT_H

typedef struct st_sort_field SORT_FIELD;

/* Defines used by filesort and uniques */

#define MERGEBUFF		7

#define MERGEBUFF2		15

/*

   The structure SORT_ADDON_FIELD describes a fixed layout

   for field values appended to sorted values in records to be sorted

   in the sort buffer.

   Only fixed layout is supported now.

   Null bit maps for the appended values is placed before the values 

   themselves. Offsets are from the last sorted field, that is from the

   record referefence, which is still last component of sorted records.

   It is preserved for backward compatiblility.

   The structure is used tp store values of the additional fields 

   in the sort buffer. It is used also when these values are read

   from a temporary file/buffer. As the reading procedures are beyond the

   scope of the 'filesort' code the values have to be retrieved via

   the callback function 'unpack_addon_fields'.

*/

typedef struct st_sort_addon_field {  /* Sort addon packed field */

  Field *field;          /* Original field */

  uint32_t   offset;         /* Offset from the last sorted field */

  uint32_t   null_offset;    /* Offset to to null bit from the last sorted field */

  uint32_t   length;         /* Length in the sort buffer */

  uint8_t  null_bit;       /* Null bit mask for the field */

} SORT_ADDON_FIELD;

typedef struct st_buffpek {		/* Struktur om sorteringsbuffrarna */

  my_off_t file_pos;			/* Where we are in the sort file */

  unsigned char *base,*key;			/* key pointers */

  ha_rows count;			/* Number of rows in table */

  ulong mem_count;			/* numbers of keys in memory */

  ulong max_keys;			/* Max keys in buffert */

} BUFFPEK;

struct BUFFPEK_COMPARE_CONTEXT

{

  qsort_cmp2 key_compare;

  void *key_compare_arg;

};

typedef struct st_sort_param {

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

  SORT_FIELD *local_sortorder;

  SORT_FIELD *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;

  BUFFPEK_COMPARE_CONTEXT cmp_context;

} SORTPARAM;

int merge_many_buff(SORTPARAM *param, unsigned char *sort_buffer,

		    BUFFPEK *buffpek,

		    uint32_t *maxbuffer, IO_CACHE *t_file);

uint32_t read_to_buffer(IO_CACHE *fromfile,BUFFPEK *buffpek,

		    uint32_t sort_length);

int merge_buffers(SORTPARAM *param,IO_CACHE *from_file,

		  IO_CACHE *to_file, unsigned char *sort_buffer,

		  BUFFPEK *lastbuff,BUFFPEK *Fb,

		  BUFFPEK *Tb,int flag);

void reuse_freed_buff(QUEUE *queue, BUFFPEK *reuse, uint32_t key_length);

#endif