« back to all changes in this revision
Viewing changes to drizzled/optimizer/table_read_plan.h
- browse files at revision 1237.13.22
- compare with another revision
- compare with revision 1441
- download diff
- download tarball
- view history from revision 1237.13.22
- Committer: Padraig O'Sullivan
- Date: 2009-12-11 17:49:56 UTC
- mto: (1241.2.6 build)
- mto: This revision was merged to the branch mainline in revision 1243.
- Revision ID: osullivan.padraig@gmail.com-20091211174956-dgwh0c8zjhy6c1j9
Extracted a number of small classes into the table_read_plan.h header file.
- files added:
- drizzled/optimizer/table_read_plan.h
- files modified:
- drizzled/include.am
added
removed
drizzled/optimizer/table_read_plan.h
1
2
#ifndef DRIZZLED_OPTIMIZER_TABLE_READ_PLAN_H
3
#define DRIZZLED_OPTIMIZER_TABLE_READ_PLAN_H
4
5
class SEL_TREE;
6
struct st_ror_scan_info;
7
8
namespace drizzled
9
{
10
11
namespace optimizer
12
{
13
14
class Parameter;
15
class SEL_ARG;
16
17
/*
18
Table rows retrieval plan. Range optimizer creates QuickSelectInterface-derived
19
objects from table read plans.
20
*/
21
class TABLE_READ_PLAN
22
{
23
public:
24
/*
25
Plan read cost, with or without cost of full row retrieval, depending
26
on plan creation parameters.
27
*/
28
double read_cost;
29
ha_rows records; /* estimate of #rows to be examined */
30
31
/*
32
If true, the scan returns rows in rowid order. This is used only for
33
scans that can be both ROR and non-ROR.
34
*/
35
bool is_ror;
36
37
/*
38
Create quick select for this plan.
39
SYNOPSIS
40
make_quick()
41
param Parameter from test_quick_select
42
retrieve_full_rows If true, created quick select will do full record
43
retrieval.
44
parent_alloc Memory pool to use, if any.
45
46
NOTES
47
retrieve_full_rows is ignored by some implementations.
48
49
RETURN
50
created quick select
51
NULL on any error.
52
*/
53
virtual QuickSelectInterface *make_quick(Parameter *param,
54
bool retrieve_full_rows,
55
MEM_ROOT *parent_alloc= NULL) = 0;
56
57
/* Table read plans are allocated on MEM_ROOT and are never deleted */
58
static void *operator new(size_t size, MEM_ROOT *mem_root)
59
{
60
return (void*) alloc_root(mem_root, (uint32_t) size);
61
}
62
63
static void operator delete(void *, size_t)
64
{
65
TRASH(ptr, size);
66
}
67
68
static void operator delete(void *, MEM_ROOT *)
69
{ /* Never called */ }
70
71
virtual ~TABLE_READ_PLAN() {} /* Remove gcc warning */
72
73
};
74
75
76
/*
77
Plan for a QuickRangeSelect scan.
78
TRP_RANGE::make_quick ignores retrieve_full_rows parameter because
79
QuickRangeSelect doesn't distinguish between 'index only' scans and full
80
record retrieval scans.
81
*/
82
class TRP_RANGE : public TABLE_READ_PLAN
83
{
84
85
public:
86
87
SEL_ARG *key; /* set of intervals to be used in "range" method retrieval */
88
uint32_t key_idx; /* key number in Parameter::key */
89
uint32_t mrr_flags;
90
uint32_t mrr_buf_size;
91
92
TRP_RANGE(SEL_ARG *key_arg, uint32_t idx_arg, uint32_t mrr_flags_arg)
93
:
94
key(key_arg),
95
key_idx(idx_arg),
96
mrr_flags(mrr_flags_arg)
97
{}
98
virtual ~TRP_RANGE() {} /* Remove gcc warning */
99
100
QuickSelectInterface *make_quick(Parameter *param, bool, MEM_ROOT *parent_alloc);
101
102
};
103
104
105
/* Plan for QuickRorIntersectSelect scan. */
106
107
class TRP_ROR_INTERSECT : public TABLE_READ_PLAN
108
{
109
public:
110
TRP_ROR_INTERSECT() {} /* Remove gcc warning */
111
virtual ~TRP_ROR_INTERSECT() {} /* Remove gcc warning */
112
QuickSelectInterface *make_quick(Parameter *param,
113
bool retrieve_full_rows,
114
MEM_ROOT *parent_alloc);
115
116
/* Array of pointers to ROR range scans used in this intersection */
117
struct st_ror_scan_info **first_scan;
118
struct st_ror_scan_info **last_scan; /* End of the above array */
119
struct st_ror_scan_info *cpk_scan; /* Clustered PK scan, if there is one */
120
bool is_covering; /* true if no row retrieval phase is necessary */
121
double index_scan_costs; /* SUM(cost(index_scan)) */
122
};
123
124
125
/*
126
Plan for QuickRorUnionSelect scan.
127
QuickRorUnionSelect always retrieves full rows, so retrieve_full_rows
128
is ignored by make_quick.
129
*/
130
131
class TRP_ROR_UNION : public TABLE_READ_PLAN
132
{
133
public:
134
TRP_ROR_UNION() {} /* Remove gcc warning */
135
virtual ~TRP_ROR_UNION() {} /* Remove gcc warning */
136
QuickSelectInterface *make_quick(Parameter *param,
137
bool retrieve_full_rows,
138
MEM_ROOT *parent_alloc);
139
TABLE_READ_PLAN **first_ror; /* array of ptrs to plans for merged scans */
140
TABLE_READ_PLAN **last_ror; /* end of the above array */
141
};
142
143
144
/*
145
Plan for QuickIndexMergeSelect scan.
146
QuickRorIntersectSelect always retrieves full rows, so retrieve_full_rows
147
is ignored by make_quick.
148
*/
149
150
class TRP_INDEX_MERGE : public TABLE_READ_PLAN
151
{
152
public:
153
TRP_INDEX_MERGE() {} /* Remove gcc warning */
154
virtual ~TRP_INDEX_MERGE() {} /* Remove gcc warning */
155
QuickSelectInterface *make_quick(Parameter *param,
156
bool retrieve_full_rows,
157
MEM_ROOT *parent_alloc);
158
TRP_RANGE **range_scans; /* array of ptrs to plans of merged scans */
159
TRP_RANGE **range_scans_end; /* end of the array */
160
};
161
162
163
/*
164
Plan for a QuickGroupMinMaxSelect scan.
165
*/
166
167
class TRP_GROUP_MIN_MAX : public TABLE_READ_PLAN
168
{
169
private:
170
bool have_min;
171
bool have_max;
172
KEY_PART_INFO *min_max_arg_part;
173
uint32_t group_prefix_len;
174
uint32_t used_key_parts;
175
uint32_t group_key_parts;
176
KEY *index_info;
177
uint32_t index;
178
uint32_t key_infix_len;
179
unsigned char key_infix[MAX_KEY_LENGTH];
180
SEL_TREE *range_tree; /* Represents all range predicates in the query. */
181
SEL_ARG *index_tree; /* The SEL_ARG sub-tree corresponding to index_info. */
182
uint32_t param_idx; /* Index of used key in param->key. */
183
/* Number of records selected by the ranges in index_tree. */
184
public:
185
ha_rows quick_prefix_records;
186
187
public:
188
TRP_GROUP_MIN_MAX(bool have_min_arg,
189
bool have_max_arg,
190
KEY_PART_INFO *min_max_arg_part_arg,
191
uint32_t group_prefix_len_arg,
192
uint32_t used_key_parts_arg,
193
uint32_t group_key_parts_arg,
194
KEY *index_info_arg,
195
uint32_t index_arg,
196
uint32_t key_infix_len_arg,
197
unsigned char *key_infix_arg,
198
SEL_TREE *tree_arg,
199
SEL_ARG *index_tree_arg,
200
uint32_t param_idx_arg,
201
ha_rows quick_prefix_records_arg)
202
:
203
have_min(have_min_arg),
204
have_max(have_max_arg),
205
min_max_arg_part(min_max_arg_part_arg),
206
group_prefix_len(group_prefix_len_arg),
207
used_key_parts(used_key_parts_arg),
208
group_key_parts(group_key_parts_arg),
209
index_info(index_info_arg),
210
index(index_arg),
211
key_infix_len(key_infix_len_arg),
212
range_tree(tree_arg),
213
index_tree(index_tree_arg),
214
param_idx(param_idx_arg),
215
quick_prefix_records(quick_prefix_records_arg)
216
{
217
if (key_infix_len)
218
memcpy(this->key_infix, key_infix_arg, key_infix_len);
219
}
220
virtual ~TRP_GROUP_MIN_MAX() {} /* Remove gcc warning */
221
222
QuickSelectInterface *make_quick(Parameter *param,
223
bool retrieve_full_rows,
224
MEM_ROOT *parent_alloc);
225
};
226
227
228
} /* namespace optimizer */
229
230
} /* namespace drizzled */
231
232
#endif /* DRIZZLED_OPTIMIZER_TABLE_READ_PLAN_H */
Loggerhead is a web-based interface for Breezy
Version: 2.0.1