drizzle
C++ MySQL-protocol-compatible database server
Loading...
Searching...
No Matches
sql_sort.h
1/* -*- mode: c++; c-basic-offset: 2; indent-tabs-mode: nil; -*-
2 * vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
3 *
4 * Copyright (C) 2008 Sun Microsystems, Inc.
5 *
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; version 2 of the License.
9 *
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
14 *
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
18 */
19
20#pragma once
21
22#include <unistd.h>
23#include <drizzled/base.h>
24#include <drizzled/common_fwd.h>
25#include <drizzled/qsort_cmp.h>
26
27namespace drizzled {
28
29/*
30 The structure sort_addon_field describes a fixed layout
31 for field values appended to sorted values in records to be sorted
32 in the sort buffer.
33 Only fixed layout is supported now.
34 Null bit maps for the appended values is placed before the values
35 themselves. Offsets are from the last sorted field, that is from the
36 record referefence, which is still last component of sorted records.
37 It is preserved for backward compatiblility.
38 The structure is used tp store values of the additional fields
39 in the sort buffer. It is used also when these values are read
40 from a temporary file/buffer. As the reading procedures are beyond the
41 scope of the 'filesort' code the values have to be retrieved via
42 the callback function 'unpack_addon_fields'.
43*/
44
45class sort_addon_field { /* Sort addon packed field */
46public:
47 Field *field; /* Original field */
48 uint32_t offset; /* Offset from the last sorted field */
49 uint32_t null_offset; /* Offset to to null bit from the last sorted field */
50 uint32_t length; /* Length in the sort buffer */
51 uint8_t null_bit; /* Null bit mask for the field */
52
53 sort_addon_field() :
54 field(NULL),
55 offset(0),
56 null_offset(0),
57 length(0),
58 null_bit(0)
59 { }
60
61};
62
63class buffpek { /* Struktur om sorteringsbuffrarna */
64public:
65 off_t file_pos; /* Where we are in the sort file */
66 unsigned char *base; /* key pointers */
67 unsigned char *key; /* key pointers */
68 ha_rows count; /* Number of rows in table */
69 size_t mem_count; /* numbers of keys in memory */
70 size_t max_keys; /* Max keys in buffert */
71
72 buffpek() :
73 file_pos(0),
74 base(0),
75 key(0),
76 count(0),
77 mem_count(0),
78 max_keys(0)
79 { }
80
81};
82
83} /* namespace drizzled */
84
TODO: Rename this file - func.h is stupid.