MySQL  8.0.21
Source Code Documentation
rtr_info Struct Reference

Vectors holding the matching internal pages/nodes and leaf records. More...

#include <gis0type.h>

Public Attributes

rtr_node_path_tpath
 vector holding matching pages More...
 
rtr_node_path_tparent_path
 vector holding parent pages during search More...
 
matched_rec_tmatches
 struct holding matching leaf records More...
 
ib_mutex_t rtr_path_mutex
 mutex protect the "path" vector More...
 
buf_block_ttree_blocks [RTR_MAX_LEVELS+RTR_LEAF_LATCH_NUM]
 tracking pages that would be locked at leaf level, for future free More...
 
ulint tree_savepoints [RTR_MAX_LEVELS+RTR_LEAF_LATCH_NUM]
 savepoint used to release latches/blocks on each level and leaf level More...
 
rtr_mbr_t mbr
 the search MBR More...
 
que_thr_tthr
 the search thread More...
 
mem_heap_theap
 memory heap More...
 
btr_cur_tcursor
 cursor used for search More...
 
dict_index_tindex
 index it is searching More...
 
bool need_prdt_lock
 whether we will need predicate lock the tree More...
 
bool need_page_lock
 whether we will need predicate page lock the tree More...
 
bool allocated
 whether this structure is allocate or on stack More...
 
bool mbr_adj
 whether mbr will need to be enlarged for an insertion operation More...
 
bool fd_del
 found deleted row More...
 
const dtuple_tsearch_tuple
 search tuple being used More...
 
page_cur_mode_t search_mode
 current search mode More...
 
boolis_dup
 whether the current rec is a duplicate record. More...
 

Detailed Description

Vectors holding the matching internal pages/nodes and leaf records.

Member Data Documentation

◆ allocated

bool rtr_info::allocated

whether this structure is allocate or on stack

◆ cursor

btr_cur_t* rtr_info::cursor

cursor used for search

◆ fd_del

bool rtr_info::fd_del

found deleted row

◆ heap

mem_heap_t* rtr_info::heap

memory heap

◆ index

dict_index_t* rtr_info::index

index it is searching

◆ is_dup

bool* rtr_info::is_dup

whether the current rec is a duplicate record.

◆ matches

matched_rec_t* rtr_info::matches

struct holding matching leaf records

◆ mbr

rtr_mbr_t rtr_info::mbr

the search MBR

◆ mbr_adj

bool rtr_info::mbr_adj

whether mbr will need to be enlarged for an insertion operation

◆ need_page_lock

bool rtr_info::need_page_lock

whether we will need predicate page lock the tree

◆ need_prdt_lock

bool rtr_info::need_prdt_lock

whether we will need predicate lock the tree

◆ parent_path

rtr_node_path_t* rtr_info::parent_path

vector holding parent pages during search

◆ path

rtr_node_path_t* rtr_info::path

vector holding matching pages

◆ rtr_path_mutex

ib_mutex_t rtr_info::rtr_path_mutex

mutex protect the "path" vector

◆ search_mode

page_cur_mode_t rtr_info::search_mode

current search mode

◆ search_tuple

const dtuple_t* rtr_info::search_tuple

search tuple being used

◆ thr

que_thr_t* rtr_info::thr

the search thread

◆ tree_blocks

tracking pages that would be locked at leaf level, for future free

◆ tree_savepoints

ulint rtr_info::tree_savepoints[RTR_MAX_LEVELS+RTR_LEAF_LATCH_NUM]

savepoint used to release latches/blocks on each level and leaf level


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