MySQL 9.0.0
Source Code Documentation
|
This is the complete list of members for Optimize_table_order, including all inherited members.
advance_sj_state(table_map remaining_tables, const JOIN_TAB *tab, uint idx) | Optimize_table_order | private |
backout_nj_state(const table_map remaining_tables, const JOIN_TAB *tab) | Optimize_table_order | private |
best_access_path(JOIN_TAB *tab, const table_map remaining_tables, const uint idx, bool disable_jbuf, const double prefix_rowcount, POSITION *pos) | Optimize_table_order | private |
best_extension_by_limited_search(table_map remaining_tables, uint idx, uint current_search_depth) | Optimize_table_order | private |
calculate_lateral_deps_of_final_plan(uint tab_no) const | Optimize_table_order | private |
calculate_scan_cost(const JOIN_TAB *tab, const uint idx, const Key_use *best_ref, const double prefix_rowcount, const bool found_condition, const bool disable_jbuf, double *rows_after_filtering, Opt_trace_object *trace_access_scan) | Optimize_table_order | private |
check_interleaving_with_nj(JOIN_TAB *next_tab) | Optimize_table_order | private |
choose_table_order() | Optimize_table_order | |
consider_plan(uint idx, Opt_trace_object *trace_obj) | Optimize_table_order | private |
cur_embedding_map | Optimize_table_order | private |
determine_search_depth(uint search_depth, uint table_count) | Optimize_table_order | privatestatic |
emb_sjm_nest | Optimize_table_order | private |
eq_ref_extension_by_limited_search(table_map remaining_tables, uint idx, uint current_search_depth) | Optimize_table_order | private |
excluded_tables | Optimize_table_order | private |
find_best_ref(const JOIN_TAB *tab, const table_map remaining_tables, const uint idx, const double prefix_rowcount, bool *found_condition, table_map *ref_depends_map, uint *used_key_parts) | Optimize_table_order | inlineprivate |
fix_semijoin_strategies() | Optimize_table_order | private |
found_plan_with_allowed_sj | Optimize_table_order | private |
got_final_plan | Optimize_table_order | private |
greedy_search(table_map remaining_tables) | Optimize_table_order | private |
has_sj | Optimize_table_order | private |
join | Optimize_table_order | private |
lateral_derived_cost(const JOIN_TAB *tab, const uint idx, const double prefix_rowcount, const Cost_model_server *cost_model) | Optimize_table_order | private |
optimize_straight_join(table_map join_tables) | Optimize_table_order | private |
Optimize_table_order(THD *thd_arg, JOIN *join_arg, Table_ref *sjm_nest_arg) | Optimize_table_order | |
plan_has_duplicate_tabs() const | Optimize_table_order | private |
prune_level | Optimize_table_order | private |
recalculate_lateral_deps(uint first_tab_no) | Optimize_table_order | |
recalculate_lateral_deps_incrementally(uint first_tab_no) | Optimize_table_order | |
search_depth | Optimize_table_order | private |
semijoin_dupsweedout_access_paths(uint first_tab, uint last_tab, double *newcount, double *newcost) | Optimize_table_order | private |
semijoin_firstmatch_loosescan_access_paths(uint first_tab, uint last_tab, table_map remaining_tables, bool loosescan, double *newcount, double *newcost) | Optimize_table_order | private |
semijoin_loosescan_fill_driving_table_position(const JOIN_TAB *s, table_map remaining_tables, uint idx, double prefix_rowcount, POSITION *loose_scan_pos) | Optimize_table_order | private |
semijoin_mat_lookup_access_paths(uint last_inner, Table_ref *sjm_nest, double *newcount, double *newcost) | Optimize_table_order | private |
semijoin_mat_scan_access_paths(uint last_inner_tab, uint last_outer_tab, table_map remaining_tables, Table_ref *sjm_nest, double *newcount, double *newcost) | Optimize_table_order | private |
test_all_ref_keys | Optimize_table_order | private |
thd | Optimize_table_order | private |
use_best_so_far | Optimize_table_order | private |
~Optimize_table_order()=default | Optimize_table_order |