1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
|
/* -*- 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
#include <unistd.h>
#include "drizzled/base.h"
#include "drizzled/qsort_cmp.h"
namespace drizzled
{
namespace internal
{
typedef struct st_io_cache IO_CACHE;
}
class Field;
class Table;
class SortField;
/* Defines used by filesort and uniques */
#define MERGEBUFF 7
#define MERGEBUFF2 15
/*
The structure sort_addon_field_st 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'.
*/
struct sort_addon_field_st { /* 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_st() :
field(NULL),
offset(0),
null_offset(0),
length(0),
null_bit(0)
{ }
};
struct buffpek_st { /* Struktur om sorteringsbuffrarna */
off_t file_pos; /* Where we are in the sort file */
unsigned char *base; /* key pointers */
unsigned char *key; /* key pointers */
ha_rows count; /* Number of rows in table */
size_t mem_count; /* numbers of keys in memory */
size_t max_keys; /* Max keys in buffert */
buffpek_st() :
file_pos(0),
base(0),
key(0),
count(0),
mem_count(0),
max_keys(0)
{ }
};
struct BUFFPEK_COMPARE_CONTEXT
{
qsort_cmp2 key_compare;
void *key_compare_arg;
};
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 */
SortField *local_sortorder;
SortField *end;
sort_addon_field_st *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;
};
typedef struct st_sort_param SORTPARAM;
int merge_many_buff(SORTPARAM *param, unsigned char *sort_buffer,
buffpek_st *buffpek,
uint32_t *maxbuffer, internal::IO_CACHE *t_file);
uint32_t read_to_buffer(internal::IO_CACHE *fromfile, buffpek_st *buffpek,
uint32_t sort_length);
int merge_buffers(SORTPARAM *param,internal::IO_CACHE *from_file,
internal::IO_CACHE *to_file, unsigned char *sort_buffer,
buffpek_st *lastbuff,
buffpek_st *Fb,
buffpek_st *Tb,int flag);
} /* namespace drizzled */
#endif /* DRIZZLED_SQL_SORT_H */
|