« back to all changes in this revision
Viewing changes to drizzled/sql_select.h
- browse files at revision 1089.1.8
- compare with another revision
- compare with revision 336
- download diff
- download tarball
- view history from revision 1089.1.8
- Committer: Brian Aker
- Date: 2009-07-10 07:41:21 UTC
- mto: (1090.1.1 staging)
- mto: This revision was merged to the branch mainline in revision 1091.
- Revision ID: brian@gaz-20090710074121-jigk6raqnmmrupw7
Shuffled around a few structures.
added
removed
drizzled/sql_select.h
24
24
#include "drizzled/session.h"
25
25
#include "drizzled/field/varstring.h"
26
26
#include "drizzled/item/null.h"
27
#include <drizzled/enum_nested_loop_state.h>
28
#include "drizzled/join_cache.h"
29
#include "drizzled/join_table.h"
30
27
31
28
32
class select_result;
29
33
41
45
#define KEY_OPTIMIZE_EXISTS 1
42
46
#define KEY_OPTIMIZE_REF_OR_NULL 2
43
47
44
typedef struct keyuse_t
48
class KeyUse
45
49
{
50
public:
46
51
Table *table; /**< Pointer to the table this key belongs to */
47
52
Item *val; /**< or value if no field */
48
53
table_map used_tables;
57
62
*/
58
63
bool null_rejecting;
59
64
/**
60
!NULL - This KEYUSE was created from an equality that was wrapped into
65
!NULL - This KeyUse was created from an equality that was wrapped into
61
66
an Item_func_trig_cond. This means the equality (and validity of
62
this KEYUSE element) can be turned on and off. The on/off state
67
this KeyUse element) can be turned on and off. The on/off state
63
68
is indicted by the pointed value:
64
69
*cond_guard == true <=> equality condition is on
65
70
*cond_guard == false <=> equality condition is off
72
77
MAX_UINT Otherwise
73
78
*/
74
79
uint32_t sj_pred_no;
75
} KEYUSE;
76
77
class StoredKey;
78
79
typedef struct st_table_ref
80
{
81
bool key_err;
82
uint32_t key_parts; /**< num of key parts */
83
uint32_t key_length; /**< length of key_buff */
84
int32_t key; /**< key no (index) */
85
unsigned char *key_buff; /**< value to look for with key */
86
unsigned char *key_buff2; /**< key_buff+key_length */
87
StoredKey **key_copy; /**< No idea what this does... */
88
Item **items; /**< val()'s for each keypart */
89
/**
90
Array of pointers to trigger variables. Some/all of the pointers may be
91
NULL. The ref access can be used iff
92
93
for each used key part i, (!cond_guards[i] || *cond_guards[i])
94
95
This array is used by subquery code. The subquery code may inject
96
triggered conditions, i.e. conditions that can be 'switched off'. A ref
97
access created from such condition is not valid when at least one of the
98
underlying conditions is switched off (see subquery code for more details)
99
*/
100
bool **cond_guards;
101
/**
102
(null_rejecting & (1<<i)) means the condition is '=' and no matching
103
rows will be produced if items[i] IS NULL (see add_not_null_conds())
104
*/
105
key_part_map null_rejecting;
106
table_map depend_map; /**< Table depends on these tables. */
107
/** null byte position in the key_buf. Used for REF_OR_NULL optimization */
108
unsigned char *null_ref_key;
109
/**
110
true <=> disable the "cache" as doing lookup with the same key value may
111
produce different results (because of Index Condition Pushdown)
112
*/
113
bool disable_cache;
114
} TABLE_REF;
80
};
115
81
116
82
class JOIN;
117
83
118
#include "drizzled/join_cache.h"
119
120
/** The states in which a nested loop join can be in */
121
enum enum_nested_loop_state
122
{
123
NESTED_LOOP_KILLED= -2,
124
NESTED_LOOP_ERROR= -1,
125
NESTED_LOOP_OK= 0,
126
NESTED_LOOP_NO_MORE_ROWS= 1,
127
NESTED_LOOP_QUERY_LIMIT= 3,
128
NESTED_LOOP_CURSOR_LIMIT= 4
129
};
130
131
/** Description of a join type */
132
enum join_type
133
{
134
JT_UNKNOWN,
135
JT_SYSTEM,
136
JT_CONST,
137
JT_EQ_REF,
138
JT_REF,
139
JT_MAYBE_REF,
140
JT_ALL,
141
JT_RANGE,
142
JT_NEXT,
143
JT_REF_OR_NULL,
144
JT_UNIQUE_SUBQUERY,
145
JT_INDEX_SUBQUERY,
146
JT_INDEX_MERGE
147
};
148
149
84
class SemiJoinTable;
150
85
151
typedef enum_nested_loop_state (*Next_select_func)(JOIN *, JoinTable *, bool);
152
typedef int (*Read_record_func)(JoinTable *tab);
153
Next_select_func setup_end_select_func(JOIN *join);
154
155
#include "drizzled/join_table.h"
156
86
157
87
enum_nested_loop_state sub_select_cache(JOIN *join, JoinTable *join_tab, bool end_of_records);
158
88
enum_nested_loop_state sub_select(JOIN *join,JoinTable *join_tab, bool end_of_records);
184
114
NULL - 'index' or 'range' or 'index_merge' or 'ALL' access is used.
185
115
Other - [eq_]ref[_or_null] access is used. Pointer to {t.keypart1 = expr}
186
116
*/
187
KEYUSE *key;
117
KeyUse *key;
188
118
189
119
/** If ref-based access is used: bitmap of tables this table depends on */
190
120
table_map ref_depend_map;
236
166
when val IS NULL.
237
167
*/
238
168
bool null_rejecting;
239
bool *cond_guard; /**< @see KEYUSE::cond_guard */
240
uint32_t sj_pred_no; /**< @see KEYUSE::sj_pred_no */
169
bool *cond_guard; /**< @see KeyUse::cond_guard */
170
uint32_t sj_pred_no; /**< @see KeyUse::sj_pred_no */
241
171
} KEY_FIELD;
242
172
243
173
/*****************************************************************************
342
272
343
273
void calc_used_field_length(Session *, JoinTable *join_tab);
344
274
StoredKey *get_store_key(Session *session,
345
KEYUSE *keyuse,
275
KeyUse *keyuse,
346
276
table_map used_tables,
347
277
KEY_PART_INFO *key_part,
348
278
unsigned char *key_buff,
388
318
void update_tmptable_sum_func(Item_sum **func,Table *tmp_table);
389
319
bool find_eq_ref_candidate(Table *table, table_map sj_inner_tables);
390
320
bool only_eq_ref_tables(JOIN *join, order_st *order, table_map tables);
391
bool create_ref_for_key(JOIN *join, JoinTable *j, KEYUSE *org_keyuse, table_map used_tables);
321
bool create_ref_for_key(JOIN *join, JoinTable *j, KeyUse *org_keyuse, table_map used_tables);
392
322
393
323
/* functions from opt_sum.cc */
394
324
bool simple_pred(Item_func *func_item, Item **args, bool *inv_order);
Loggerhead is a web-based interface for Breezy
Version: 2.0.1