#include <row0sel.h>

Collaboration diagram for plan_t:

Public Attributes
dict_table_t *	table
dict_index_t *	index
btr_pcur_t	pcur
ibool	asc
ibool	pcur_is_open
ibool	cursor_at_end
ibool	stored_cursor_rec_processed
que_node_t **	tuple_exps
dtuple_t *	tuple
ulint	mode
ulint	n_exact_match
ibool	unique_search
ulint	n_rows_fetched
ulint	n_rows_prefetched
ulint	first_prefetched
ibool	no_prefetch
sym_node_list_t	columns
	end_conds
	other_conds
ibool	must_get_clust
ulint *	clust_map
dtuple_t *	clust_ref
btr_pcur_t	clust_pcur
mem_heap_t *	old_vers_heap

Detailed Description

Query plan

Definition at line 209 of file row0sel.h.

Member Data Documentation

ibool plan_t::asc

TRUE if cursor traveling upwards

Definition at line 215 of file row0sel.h.

ulint* plan_t::clust_map

map telling how clust_ref is built from the fields of a non-clustered record

Definition at line 272 of file row0sel.h.

btr_pcur_t plan_t::clust_pcur

if index is non-clustered, we use this pcur to search the clustered index

Definition at line 278 of file row0sel.h.

dtuple_t* plan_t::clust_ref

the reference to the clustered index entry is built here if index is a non-clustered index

Definition at line 275 of file row0sel.h.

sym_node_list_t plan_t::columns

symbol table nodes for the columns to retrieve from the table

Definition at line 250 of file row0sel.h.

ibool plan_t::cursor_at_end

TRUE if the cursor is open but we know that there are no more qualifying rows left to retrieve from the index tree; NOTE though, that there may still be unprocessed rows in the prefetch stack; always FALSE when pcur_is_open is FALSE

Definition at line 218 of file row0sel.h.

plan_t::end_conds

conditions which determine the fetch limit of the index segment we have to look at: when one of these fails, the result set has been exhausted for the cursor in this index; these conditions are normalized so that in a comparison the column for this table is the first argument

Definition at line 253 of file row0sel.h.

ulint plan_t::first_prefetched

index of the first cached row in select buffer arrays for each column

Definition at line 247 of file row0sel.h.

dict_index_t* plan_t::index

table index used in the search

Definition at line 212 of file row0sel.h.

ulint plan_t::mode

search mode: PAGE_CUR_G, ...

Definition at line 236 of file row0sel.h.

ibool plan_t::must_get_clust

TRUE if index is a non-clustered index and we must also fetch the clustered index record; this is the case if the non-clustered record does not contain all the needed columns, or if this is a single-table explicit cursor, or a searched update or delete

Definition at line 264 of file row0sel.h.

ulint plan_t::n_exact_match

number of first fields in the search tuple which must be exactly matched

Definition at line 237 of file row0sel.h.

ulint plan_t::n_rows_fetched

number of rows fetched using pcur after it was opened

Definition at line 242 of file row0sel.h.

ulint plan_t::n_rows_prefetched

number of prefetched rows cached for fetch: fetching several rows in the same mtr saves CPU time

Definition at line 244 of file row0sel.h.

ibool plan_t::no_prefetch

no prefetch for this table

Definition at line 249 of file row0sel.h.

mem_heap_t* plan_t::old_vers_heap

memory heap used in building an old version of a row, or NULL

Definition at line 281 of file row0sel.h.

plan_t::other_conds

the rest of search conditions we can test at this table in a join

Definition at line 262 of file row0sel.h.

btr_pcur_t plan_t::pcur

persistent cursor used to search the index

Definition at line 213 of file row0sel.h.

ibool plan_t::pcur_is_open

TRUE if pcur has been positioned and we can try to fetch new rows

Definition at line 216 of file row0sel.h.

ibool plan_t::stored_cursor_rec_processed

TRUE if the pcur position has been stored and the record it is positioned on has already been processed

Definition at line 226 of file row0sel.h.

dict_table_t* plan_t::table

table struct in the dictionary cache

Definition at line 210 of file row0sel.h.

dtuple_t* plan_t::tuple

search tuple

Definition at line 235 of file row0sel.h.

que_node_t** plan_t::tuple_exps

array of expressions which are used to calculate the field values in the search tuple: there is one expression for each field in the search tuple

Definition at line 229 of file row0sel.h.

ibool plan_t::unique_search

TRUE if we are searching an index record with a unique key

Definition at line 240 of file row0sel.h.

The documentation for this struct was generated from the following file:

storage/innobase/include/row0sel.h

Public Attributes

Detailed Description

Member Data Documentation