 |
MySQL 9.1.0
Source Code Documentation
|
|
MySQL 9.1.0
Source Code Documentation
|
This is the complete list of members for anonymous_namespace{join_optimizer.cc}::CostingReceiver, including all inherited members.
| active_fds_at_root() const | anonymous_namespace{join_optimizer.cc}::CostingReceiver | inline |
| AllowHashJoin(NodeMap left, NodeMap right, const AccessPath &left_path, const AccessPath &right_path, const JoinPredicate &edge) const | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| AllowNestedLoopJoin(NodeMap left, NodeMap right, const AccessPath &left_path, const AccessPath &right_path, const JoinPredicate &edge) const | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| AlreadyAppliedAsSargable(Item *condition, const AccessPath *left_path, const AccessPath *right_path) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | inlineprivate |
| always_empty() const | anonymous_namespace{join_optimizer.cc}::CostingReceiver | inline |
| ApplyDelayedPredicatesAfterJoin(NodeMap left, NodeMap right, const AccessPath *left_path, const AccessPath *right_path, int join_predicate_first, int join_predicate_last, bool materialize_subqueries, AccessPath *join_path, FunctionalDependencySet *new_fd_set) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| ApplyPredicatesForBaseTable(int node_idx, OverflowBitset applied_predicates, OverflowBitset subsumed_predicates, bool materialize_subqueries, double force_num_output_rows_after_filter, AccessPath *path, FunctionalDependencySet *new_fd_set) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| BitsetsAreCommitted(AccessPath *path) const | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| CommitBitsetsToHeap(AccessPath *path) const | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| CostingReceiver(THD *thd, Query_block *query_block, JoinHypergraph &graph, const LogicalOrderings *orderings, const Mem_root_array< SortAheadOrdering > *sort_ahead_orderings, const Mem_root_array< ActiveIndexInfo > *active_indexes, const Mem_root_array< SpatialDistanceScanInfo > *spatial_indexes, const Mem_root_array< FullTextIndexInfo > *fulltext_searches, NodeMap fulltext_tables, uint64_t sargable_fulltext_predicates, table_map update_delete_target_tables, table_map immediate_update_delete_candidates, bool need_rowid, SecondaryEngineFlags engine_flags, int subgraph_pair_limit, secondary_engine_modify_access_path_cost_t secondary_engine_cost_hook, secondary_engine_check_optimizer_request_t secondary_engine_planning_complexity_check_hook) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | inline |
| CostingReceiver(const CostingReceiver &)=delete | anonymous_namespace{join_optimizer.cc}::CostingReceiver | |
| CostingReceiver(CostingReceiver &&)=default | anonymous_namespace{join_optimizer.cc}::CostingReceiver | |
| evaluate_secondary_engine_optimizer_state_request() | anonymous_namespace{join_optimizer.cc}::CostingReceiver | |
| FindAlreadyAppliedSelectivity(const JoinPredicate *edge, const AccessPath *left_path, const AccessPath *right_path, NodeMap left, NodeMap right) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| FindIndexRangeScans(int node_idx, bool *impossible, double *num_output_rows_after_filter, bool force_imerge, bool force_skip_scan, bool *found_forced_plan) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| FindRangeScans(int node_idx, Table_ref *table_ref) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| forced_leftmost_table | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| FoundSingleNode(int node_idx) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | |
| FoundSubgraphPair(NodeMap left, NodeMap right, int edge_idx) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | |
| has_clamped_multipart_eq_ref | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| has_semijoin_with_possibly_clamped_child | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| HasSecondaryEngineCostHook() const | anonymous_namespace{join_optimizer.cc}::CostingReceiver | inline |
| HasSeen(NodeMap subgraph) const | anonymous_namespace{join_optimizer.cc}::CostingReceiver | inline |
| m_access_paths | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| m_active_indexes | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| m_engine_flags | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| m_fulltext_searches | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| m_fulltext_tables | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| m_graph | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| m_immediate_update_delete_candidates | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| m_need_rowid | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| m_num_seen_subgraph_pairs | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| m_orderings | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| m_overflow_bitset_mem_root | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| m_query_block | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| m_range_optimizer_mem_root | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| m_sargable_fulltext_predicates | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| m_secondary_engine_cost_hook | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| m_secondary_engine_planning_complexity_check | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| m_sort_ahead_orderings | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| m_spatial_indexes | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| m_subgraph_pair_limit | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| m_thd | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| m_update_delete_target_nodes | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| MakeMaterializePath(const AccessPath &path, TABLE *table) const | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| num_access_paths() const | anonymous_namespace{join_optimizer.cc}::CostingReceiver | inline |
| num_subplans() const | anonymous_namespace{join_optimizer.cc}::CostingReceiver | inline |
| operator=(const CostingReceiver &)=delete | anonymous_namespace{join_optimizer.cc}::CostingReceiver | |
| operator=(CostingReceiver &&)=default | anonymous_namespace{join_optimizer.cc}::CostingReceiver | |
| PrintSet(NodeMap x) const | anonymous_namespace{join_optimizer.cc}::CostingReceiver | inlineprivate |
| PrintSubgraphHeader(const JoinPredicate *edge, const AccessPath &join_path, NodeMap left, NodeMap right) const | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| ProposeAccessPath(AccessPath *path, AccessPathArray *existing_paths, OrderingSet obsolete_orderings, const char *description_for_trace) const | anonymous_namespace{join_optimizer.cc}::CostingReceiver | |
| ProposeAccessPathForBaseTable(int node_idx, double force_num_output_rows_after_filter, const char *description_for_trace, AccessPath *path) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| ProposeAccessPathForIndex(int node_idx, OverflowBitset applied_predicates, OverflowBitset subsumed_predicates, double force_num_output_rows_after_filter, const char *description_for_trace, AccessPath *path) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| ProposeAccessPathWithOrderings(NodeMap nodes, FunctionalDependencySet fd_set, OrderingSet obsolete_orderings, AccessPath *path, const char *description_for_trace) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| ProposeAllFullTextIndexScans(TABLE *table, int node_idx, double force_num_output_rows_after_filter, bool *found_fulltext) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| ProposeAllIndexMergeScans(int node_idx, double num_output_rows_after_filter, RANGE_OPT_PARAM *param, SEL_TREE *tree, const Mem_root_array< PossibleRangeScan > *possible_scans, const Mem_root_array< PossibleIndexMerge > *index_merges, bool *found_imerge) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| ProposeAllRowIdOrderedIntersectPlans(TABLE *table, int node_idx, SEL_TREE *tree, int num_where_predicates, const Mem_root_array< PossibleRORScan > &possible_ror_scans, double num_output_rows_after_filter, const RANGE_OPT_PARAM *param, bool *found_imerge) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| ProposeAllSkipScans(int node_idx, double num_output_rows_after_filter, RANGE_OPT_PARAM *param, SEL_TREE *tree, Mem_root_array< PossibleIndexSkipScan > *index_skip_scans, MutableOverflowBitset *all_predicates, bool *found_skip_scan) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| ProposeAllUniqueIndexLookupsWithConstantKey(int node_idx, bool *found) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| ProposeDistanceIndexScan(TABLE *table, int node_idx, double force_num_output_rows_after_filter, const SpatialDistanceScanInfo &order_info, int ordering_idx) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| ProposeFullTextIndexScan(TABLE *table, int node_idx, Item_func_match *match, int predicate_idx, int ordering_idx, double force_num_output_rows_after_filter) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| ProposeHashJoin(NodeMap left, NodeMap right, AccessPath *left_path, AccessPath *right_path, const JoinPredicate *edge, FunctionalDependencySet new_fd_set, OrderingSet new_obsolete_orderings, bool rewrite_semi_to_inner, bool *wrote_trace) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| ProposeIndexMerge(TABLE *table, int node_idx, const SEL_IMERGE &imerge, int pred_idx, bool inexact, bool allow_clustered_primary_key_scan, int num_where_predicates, double num_output_rows_after_filter, RANGE_OPT_PARAM *param, bool *has_clustered_primary_key_scan, bool *found_imerge) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| ProposeIndexScan(TABLE *table, int node_idx, double force_num_output_rows_after_filter, unsigned key_idx, bool reverse, int ordering_idx) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| ProposeIndexSkipScan(int node_idx, RANGE_OPT_PARAM *param, AccessPath *skip_scan_path, TABLE *table, OverflowBitset all_predicates, size_t num_where_predicates, size_t predicate_idx, double num_output_rows_after_filter, bool inexact) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| ProposeNestedLoopJoin(NodeMap left, NodeMap right, AccessPath *left_path, AccessPath *right_path, const JoinPredicate *edge, bool rewrite_semi_to_inner, FunctionalDependencySet new_fd_set, OrderingSet new_obsolete_orderings, bool *wrote_trace) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| ProposeRangeScans(int node_idx, double num_output_rows_after_filter, RANGE_OPT_PARAM *param, SEL_TREE *tree, Mem_root_array< PossibleRangeScan > *possible_scans, bool *found_range_scan) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| ProposeRefs(const ActiveIndexInfo &order_info, int node_idx, double row_estimate) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| ProposeRowIdOrderedIntersect(TABLE *table, int node_idx, int num_where_predicates, const Mem_root_array< PossibleRORScan > &possible_ror_scans, const Mem_root_array< ROR_SCAN_INFO * > &ror_scans, ROR_SCAN_INFO *cpk_scan, double num_output_rows_after_filter, const RANGE_OPT_PARAM *param, OverflowBitset needed_fields, bool *found_imerge) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| ProposeRowIdOrderedUnion(TABLE *table, int node_idx, const SEL_IMERGE &imerge, int pred_idx, bool inexact, int num_where_predicates, double num_output_rows_after_filter, const RANGE_OPT_PARAM *param, const Mem_root_array< AccessPath * > &paths, bool *found_imerge) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| ProposeTableScan(TABLE *table, int node_idx, double force_num_output_rows_after_filter) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| RedundantThroughSargable(OverflowBitset redundant_against_sargable_predicates, const AccessPath *left_path, const AccessPath *right_path, NodeMap left, NodeMap right) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| RefAccessBuilder | anonymous_namespace{join_optimizer.cc}::CostingReceiver | friend |
| root_candidates() | anonymous_namespace{join_optimizer.cc}::CostingReceiver | inline |
| SetUpRangeScans(int node_idx, bool *impossible, double *num_output_rows_after_filter, RANGE_OPT_PARAM *param, SEL_TREE **tree, Mem_root_array< PossibleRangeScan > *possible_scans, Mem_root_array< PossibleIndexMerge > *index_merges, Mem_root_array< PossibleIndexSkipScan > *index_skip_scans, MutableOverflowBitset *all_predicates) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
| subgraph_pair_limit() const | anonymous_namespace{join_optimizer.cc}::CostingReceiver | inline |
| SupportedEngineFlag(SecondaryEngineFlag flag) const | anonymous_namespace{join_optimizer.cc}::CostingReceiver | inlineprivate |
| TraceAccessPaths(NodeMap nodes) | anonymous_namespace{join_optimizer.cc}::CostingReceiver | private |
1.9.2