MySQL 9.4.0
Source Code Documentation
anonymous_namespace{i_s.cc} Namespace Reference

Functions

void visit_tree (jdv::Content_tree_node *root, auto &&visit_single_node)
 Iterative depth first traversal of the tree using a stack. More...
 
void get_json_duality_views (Document *doc, jdv::Content_tree_node *root)
 
void get_json_duality_view_tables (Document *doc, jdv::Content_tree_node *root)
 
void get_json_duality_view_columns (Document *doc, jdv::Content_tree_node *root)
 
void get_json_duality_view_links (Document *doc, jdv::Content_tree_node *root)
 
const char * state_str (buf_page_state state)
 
const char * io_fix_str (buf_io_fix io_fix)
 
const char * lru_page_state_str (buf_page_state lru_state)
 

Variables

constexpr char default_catalog [] = "def"
 
const std::unordered_map< buf_io_fix, std::string_view > buf_io_fix_str
 
const std::unordered_map< buf_page_state, std::string_view > buf_lru_page_state_str
 

Function Documentation

◆ get_json_duality_view_columns()

void anonymous_namespace{i_s.cc}::get_json_duality_view_columns ( Document *  doc,
jdv::Content_tree_node root 
)

◆ get_json_duality_view_links()

void anonymous_namespace{i_s.cc}::get_json_duality_view_links ( Document *  doc,
jdv::Content_tree_node root 
)

◆ get_json_duality_view_tables()

void anonymous_namespace{i_s.cc}::get_json_duality_view_tables ( Document *  doc,
jdv::Content_tree_node root 
)

◆ get_json_duality_views()

void anonymous_namespace{i_s.cc}::get_json_duality_views ( Document *  doc,
jdv::Content_tree_node root 
)

◆ io_fix_str()

const char * anonymous_namespace{i_s.cc}::io_fix_str ( buf_io_fix  io_fix)

◆ lru_page_state_str()

const char * anonymous_namespace{i_s.cc}::lru_page_state_str ( buf_page_state  lru_state)

◆ state_str()

const char * anonymous_namespace{i_s.cc}::state_str ( buf_page_state  state)

◆ visit_tree()

void anonymous_namespace{i_s.cc}::visit_tree ( jdv::Content_tree_node root,
auto &&  visit_single_node 
)

Iterative depth first traversal of the tree using a stack.

We assign a temporary id to each table based on the order of traversal. This ought to be repeatable as long as the view does not change. The tree nodes cannot be const since we assign tmp ids.

Parameters
root
visit_single_node

Variable Documentation

◆ buf_io_fix_str

const std::unordered_map<buf_io_fix, std::string_view> anonymous_namespace{i_s.cc}::buf_io_fix_str
Initial value:
{
{BUF_IO_NONE, "IO_NONE"},
{BUF_IO_READ, "IO_READ"},
{BUF_IO_WRITE, "IO_WRITE"},
{BUF_IO_PIN, "IO_PIN"},
}
@ BUF_IO_NONE
no pending I/O
Definition: buf0types.h:101
@ BUF_IO_WRITE
write pending
Definition: buf0types.h:107
@ BUF_IO_READ
read pending
Definition: buf0types.h:104
@ BUF_IO_PIN
disallow relocation of block and its removal from the flush_list
Definition: buf0types.h:110

◆ buf_lru_page_state_str

const std::unordered_map<buf_page_state, std::string_view> anonymous_namespace{i_s.cc}::buf_lru_page_state_str
Initial value:
{
@ BUF_BLOCK_NOT_USED
Is in the free list; must be after the BUF_BLOCK_ZIP_ constants for compressed-only pages.
Definition: buf0buf.h:140
@ BUF_BLOCK_ZIP_PAGE
Contains a clean compressed page.
Definition: buf0buf.h:134
@ BUF_BLOCK_REMOVE_HASH
Hash index should be removed before putting to the free list.
Definition: buf0buf.h:152
@ BUF_BLOCK_MEMORY
Contains some main memory object.
Definition: buf0buf.h:149
@ BUF_BLOCK_ZIP_DIRTY
Contains a compressed page that is in the buf_pool->flush_list.
Definition: buf0buf.h:136
@ BUF_BLOCK_POOL_WATCH
A sentinel for the buffer pool watch, element of buf_pool->watch[].
Definition: buf0buf.h:132
@ BUF_BLOCK_READY_FOR_USE
When buf_LRU_get_free_block returns a block, it is in this state.
Definition: buf0buf.h:143
@ BUF_BLOCK_FILE_PAGE
Contains a buffered file page.
Definition: buf0buf.h:146

◆ default_catalog

constexpr char anonymous_namespace{i_s.cc}::default_catalog[] = "def"
constexpr