![]()  | 
  
    MySQL 8.4.7
    
   Source Code Documentation 
   | 
 
Vectors holding the matching internal pages/nodes and leaf records. More...
#include <gis0type.h>
Public Attributes | |
| rtr_node_path_t * | path | 
| vector holding matching pages  More... | |
| rtr_node_path_t * | parent_path | 
| vector holding parent pages during search  More... | |
| matched_rec_t * | matches | 
| struct holding matching leaf records  More... | |
| ib_mutex_t | rtr_path_mutex | 
| mutex protect the "path" vector  More... | |
| buf_block_t * | tree_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_t * | thr | 
| the search thread  More... | |
| mem_heap_t * | heap | 
| memory heap  More... | |
| btr_cur_t * | cursor | 
| cursor used for search  More... | |
| dict_index_t * | index | 
| 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_t * | search_tuple | 
| search tuple being used  More... | |
| page_cur_mode_t | search_mode | 
| current search mode  More... | |
| bool * | is_dup | 
| whether the current rec is a duplicate record.  More... | |
Vectors holding the matching internal pages/nodes and leaf records.
| bool rtr_info::allocated | 
whether this structure is allocate or on stack
| btr_cur_t* rtr_info::cursor | 
cursor used for search
| bool rtr_info::fd_del | 
found deleted row
| mem_heap_t* rtr_info::heap | 
memory heap
| dict_index_t* rtr_info::index | 
index it is searching
| bool* rtr_info::is_dup | 
whether the current rec is a duplicate record.
| matched_rec_t* rtr_info::matches | 
struct holding matching leaf records
| rtr_mbr_t rtr_info::mbr | 
the search MBR
| bool rtr_info::mbr_adj | 
whether mbr will need to be enlarged for an insertion operation
| bool rtr_info::need_page_lock | 
whether we will need predicate page lock the tree
| bool rtr_info::need_prdt_lock | 
whether we will need predicate lock the tree
| rtr_node_path_t* rtr_info::parent_path | 
vector holding parent pages during search
| rtr_node_path_t* rtr_info::path | 
vector holding matching pages
| ib_mutex_t rtr_info::rtr_path_mutex | 
mutex protect the "path" vector
| page_cur_mode_t rtr_info::search_mode | 
current search mode
| const dtuple_t* rtr_info::search_tuple | 
search tuple being used
| que_thr_t* rtr_info::thr | 
the search thread
| buf_block_t* rtr_info::tree_blocks[RTR_MAX_LEVELS+RTR_LEAF_LATCH_NUM] | 
tracking pages that would be locked at leaf level, for future free
| ulint rtr_info::tree_savepoints[RTR_MAX_LEVELS+RTR_LEAF_LATCH_NUM] | 
savepoint used to release latches/blocks on each level and leaf level