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
|
/* -*- mode: c++; c-basic-offset: 2; indent-tabs-mode: nil; -*-
* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
*
* Copyright (C) 2010 Brian Aker
*
* 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., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
/*
This is a "work in progress". The concept needs to be replicated throughout
the code, but we will start with baby steps for the moment. To not incur
cost until we are complete, for the moment it will do no allocation.
This is mainly here so that it can be used in the SE interface for
the time being.
This will replace Table_ident.
*/
#ifndef DRIZZLED_FILESORT_H
#define DRIZZLED_FILESORT_H
namespace drizzled {
class Session;
class Table;
class SortField;
namespace optimizer {
class SqlSelect;
}
class SortParam;
class FileSort {
Session &_session;
uint32_t sortlength(SortField *sortorder, uint32_t s_length, bool *multi_byte_charset);
sort_addon_field *get_addon_fields(Field **ptabfield, uint32_t sortlength, uint32_t *plength);
ha_rows find_all_keys(SortParam *param,
optimizer::SqlSelect *select,
unsigned char **sort_keys,
internal::IO_CACHE *buffpek_pointers,
internal::IO_CACHE *tempfile, internal::IO_CACHE *indexfile);
int merge_buffers(SortParam *param,internal::IO_CACHE *from_file,
internal::IO_CACHE *to_file, unsigned char *sort_buffer,
buffpek *lastbuff,
buffpek *Fb,
buffpek *Tb,int flag);
int merge_index(SortParam *param,
unsigned char *sort_buffer,
buffpek *buffpek,
uint32_t maxbuffer,
internal::IO_CACHE *tempfile,
internal::IO_CACHE *outfile);
int merge_many_buff(SortParam *param, unsigned char *sort_buffer,
buffpek *buffpek,
uint32_t *maxbuffer, internal::IO_CACHE *t_file);
uint32_t read_to_buffer(internal::IO_CACHE *fromfile, buffpek *buffpek,
uint32_t sort_length);
public:
FileSort(Session &arg);
Session &getSession()
{
return _session;
}
ha_rows run(Table *table, SortField *sortorder, uint32_t s_length,
optimizer::SqlSelect *select, ha_rows max_rows,
bool sort_positions, ha_rows &examined_rows);
};
} /* namespace drizzled */
#endif /* DRIZZLED_FILESORT_H */
|