join_optimizer.cc File Reference

#include "sql/join_optimizer/join_optimizer.h"
#include <assert.h>
#include <float.h>
#include <stdint.h>
#include <stdio.h>
#include <string.h>
#include <sys/types.h>
#include <algorithm>
#include <bit>
#include <bitset>
#include <cmath>
#include <initializer_list>
#include <limits>
#include <string>
#include <string_view>
#include <unordered_map>
#include <utility>
#include <vector>
#include "ft_global.h"
#include "map_helpers.h"
#include "mem_root_deque.h"
#include "my_alloc.h"
#include "my_base.h"
#include "my_bitmap.h"
#include "my_dbug.h"
#include "my_inttypes.h"
#include "my_sqlcommand.h"
#include "my_sys.h"
#include "my_table_map.h"
#include "mysql/components/services/bits/psi_bits.h"
#include "mysql/udf_registration_types.h"
#include "mysqld_error.h"
#include "prealloced_array.h"
#include "scope_guard.h"
#include "sql/field.h"
#include "sql/filesort.h"
#include "sql/handler.h"
#include "sql/item.h"
#include "sql/item_cmpfunc.h"
#include "sql/item_func.h"
#include "sql/item_sum.h"
#include "sql/join_optimizer/access_path.h"
#include "sql/join_optimizer/bit_utils.h"
#include "sql/join_optimizer/build_interesting_orders.h"
#include "sql/join_optimizer/compare_access_paths.h"
#include "sql/join_optimizer/cost_model.h"
#include "sql/join_optimizer/estimate_selectivity.h"
#include "sql/join_optimizer/explain_access_path.h"
#include "sql/join_optimizer/find_contained_subqueries.h"
#include "sql/join_optimizer/graph_simplification.h"
#include "sql/join_optimizer/hypergraph.h"
#include "sql/join_optimizer/interesting_orders.h"
#include "sql/join_optimizer/interesting_orders_defs.h"
#include "sql/join_optimizer/make_join_hypergraph.h"
#include "sql/join_optimizer/node_map.h"
#include "sql/join_optimizer/overflow_bitset.h"
#include "sql/join_optimizer/print_utils.h"
#include "sql/join_optimizer/relational_expression.h"
#include "sql/join_optimizer/secondary_engine_costing_flags.h"
#include "sql/join_optimizer/subgraph_enumeration.h"
#include "sql/join_optimizer/walk_access_paths.h"
#include "sql/join_type.h"
#include "sql/key.h"
#include "sql/key_spec.h"
#include "sql/mem_root_array.h"
#include "sql/opt_costmodel.h"
#include "sql/opt_hints.h"
#include "sql/parse_tree_node_base.h"
#include "sql/partition_info.h"
#include "sql/query_options.h"
#include "sql/range_optimizer/index_range_scan_plan.h"
#include "sql/range_optimizer/index_skip_scan_plan.h"
#include "sql/range_optimizer/internal.h"
#include "sql/range_optimizer/path_helpers.h"
#include "sql/range_optimizer/range_analysis.h"
#include "sql/range_optimizer/range_opt_param.h"
#include "sql/range_optimizer/range_optimizer.h"
#include "sql/range_optimizer/rowid_ordered_retrieval_plan.h"
#include "sql/range_optimizer/tree.h"
#include "sql/sql_array.h"
#include "sql/sql_base.h"
#include "sql/sql_class.h"
#include "sql/sql_cmd.h"
#include "sql/sql_const.h"
#include "sql/sql_executor.h"
#include "sql/sql_lex.h"
#include "sql/sql_list.h"
#include "sql/sql_opt_exec_shared.h"
#include "sql/sql_optimizer.h"
#include "sql/sql_partition.h"
#include "sql/sql_select.h"
#include "sql/system_variables.h"
#include "sql/table.h"
#include "sql/table_function.h"
#include "sql/uniques.h"
#include "sql/window.h"
#include "template_utils.h"

Classes
struct	anonymous_namespace{join_optimizer.cc}::PossibleRORScan
class	anonymous_namespace{join_optimizer.cc}::CostingReceiver
	CostingReceiver contains the main join planning logic, selecting access paths based on cost. More...
struct	anonymous_namespace{join_optimizer.cc}::CostingReceiver::AccessPathSet
	Besides the access paths for a set of nodes (see m_access_paths), AccessPathSet contains information that is common between all access paths for that set. More...
struct	anonymous_namespace{join_optimizer.cc}::PossibleRangeScan
struct	anonymous_namespace{join_optimizer.cc}::PossibleIndexMerge
	Represents a candidate index merge, ie. More...
struct	anonymous_namespace{join_optimizer.cc}::PossibleIndexSkipScan
	Represents a candidate index skip scan, i.e. More...
struct	anonymous_namespace{join_optimizer.cc}::KeypartForRef

Namespaces
namespace	anonymous_namespace{join_optimizer.cc}

Functions
string	anonymous_namespace{join_optimizer.cc}::PrintAccessPath (const AccessPath &path, const JoinHypergraph &graph, const char *description_for_trace)
void	anonymous_namespace{join_optimizer.cc}::PrintJoinOrder (const AccessPath *path, string *join_order)
	Used by optimizer trace to print join order of join paths. More...
AccessPath *	anonymous_namespace{join_optimizer.cc}::CreateMaterializationPath (THD *thd, JOIN *join, AccessPath *path, TABLE *temp_table, Temp_table_param *temp_table_param, bool copy_items)
	Sets up an access path for materializing the results returned from a path in a temporary table. More...
AccessPath *	anonymous_namespace{join_optimizer.cc}::GetSafePathToSort (THD *thd, JOIN *join, AccessPath *path, bool need_rowid, bool force_materialization=false)
SecondaryEngineFlags	anonymous_namespace{join_optimizer.cc}::EngineFlags (const THD *thd)
	Lists the current secondary engine flags in use. More...
secondary_engine_modify_access_path_cost_t	anonymous_namespace{join_optimizer.cc}::SecondaryEngineCostHook (const THD *thd)
	Gets the secondary storage engine cost modification function, if any. More...
secondary_engine_check_optimizer_request_t	anonymous_namespace{join_optimizer.cc}::SecondaryEngineStateCheckHook (const THD *thd)
	Gets the secondary storage engine hypergraph state hook function, if any. More...
bool	anonymous_namespace{join_optimizer.cc}::IsClusteredPrimaryKey (unsigned key_index, const TABLE &table)
Item_func_match *	anonymous_namespace{join_optimizer.cc}::GetSargableFullTextPredicate (const Predicate &predicate)
	Returns the MATCH function of a predicate that can be pushed down to a full-text index. More...
bool	anonymous_namespace{join_optimizer.cc}::IsDeleteStatement (const THD *thd)
	Is the current statement a DELETE statement? More...
bool	anonymous_namespace{join_optimizer.cc}::IsUpdateStatement (const THD *thd)
	Is the current statement a DELETE statement? More...
void	anonymous_namespace{join_optimizer.cc}::FindAppliedAndSubsumedPredicatesForRangeScan (THD *thd, KEY *key, unsigned used_key_parts, unsigned num_exact_key_parts, TABLE *table, OverflowBitset tree_applied_predicates, OverflowBitset tree_subsumed_predicates, const JoinHypergraph &graph, OverflowBitset *applied_predicates_out, OverflowBitset *subsumed_predicates_out)
bool	anonymous_namespace{join_optimizer.cc}::CollectPossibleRangeScans (THD *thd, SEL_TREE *tree, RANGE_OPT_PARAM *param, OverflowBitset tree_applied_predicates, OverflowBitset tree_subsumed_predicates, const JoinHypergraph &graph, Mem_root_array< PossibleRangeScan > *possible_scans)
double	anonymous_namespace{join_optimizer.cc}::EstimateOutputRowsFromRangeTree (THD *thd, const RANGE_OPT_PARAM &param, ha_rows total_rows, const Mem_root_array< PossibleRangeScan > &possible_scans, const JoinHypergraph &graph, OverflowBitset predicates, string *trace)
	Based on estimates for all the different range scans (which cover different but potentially overlapping combinations of predicates), try to find an estimate for the number of rows scanning the given table, with all predicates applied. More...
AccessPath *	anonymous_namespace{join_optimizer.cc}::FindCheapestIndexRangeScan (THD *thd, SEL_TREE *tree, RANGE_OPT_PARAM *param, bool prefer_clustered_primary_key_scan, bool *inexact, bool need_rowid_ordered_rows)
	From a collection of index scans, find the single cheapest one and generate an AccessPath for it. More...
void	anonymous_namespace{join_optimizer.cc}::UpdateAppliedAndSubsumedPredicates (const uint idx, const Mem_root_array< PossibleRORScan > &possible_ror_scans, const RANGE_OPT_PARAM *param, OverflowBitset *applied_predicates, OverflowBitset *subsumed_predicates)
int	anonymous_namespace{join_optimizer.cc}::GetRowIdOrdering (const TABLE *table, const LogicalOrderings *orderings, const Mem_root_array< ActiveIndexInfo > *active_indexes)
int	anonymous_namespace{join_optimizer.cc}::WasPushedDownToRef (Item *condition, const KeypartForRef *keyparts, unsigned num_keyparts)
bool	anonymous_namespace{join_optimizer.cc}::ContainsSubqueries (Item *item_arg)
bool	anonymous_namespace{join_optimizer.cc}::HasConstantEqualityForField (const Mem_root_array< SargablePredicate > &sargable_predicates, const Field *field)
	Do we have a sargable predicate which checks if "field" is equal to a constant? More...
bool	anonymous_namespace{join_optimizer.cc}::IsSubsumableFullTextPredicate (Item_func *condition)
bool	anonymous_namespace{join_optimizer.cc}::IsLimitHintPushableToFullTextSearch (const Item_func_match *match, const JoinHypergraph &graph, uint64_t fulltext_predicates)
bool	anonymous_namespace{join_optimizer.cc}::LateralDependenciesAreSatisfied (int node_idx, NodeMap tables, const JoinHypergraph &graph)
	Checks if the table given by "node_idx" has all its lateral dependencies satisfied by the set of tables given by "tables". More...
NodeMap	anonymous_namespace{join_optimizer.cc}::FindReachableTablesFrom (NodeMap tables, const JoinHypergraph &graph)
	Find the set of tables we can join directly against, given that we have the given set of tables on one of the sides (effectively the same concept as DPhyp's “neighborhood”). More...
bool	anonymous_namespace{join_optimizer.cc}::PartiallyResolvedParameterization (NodeMap parameter_tables, NodeMap other_side)
bool	anonymous_namespace{join_optimizer.cc}::DisallowParameterizedJoinPath (AccessPath *left_path, AccessPath *right_path, NodeMap left, NodeMap right, NodeMap left_reachable, NodeMap right_reachable)
	Decide whether joining the two given paths would create a disallowed parameterized path. More...
bool	anonymous_namespace{join_optimizer.cc}::IsEmptyJoin (const RelationalExpression::Type join_type, bool left_is_empty, bool right_is_empty)
	Checks if the result of a join is empty, given that it is known that one or both of the join legs always produces an empty result. More...
void	anonymous_namespace{join_optimizer.cc}::MoveDegenerateJoinConditionToFilter (THD *thd, Query_block *query_block, const JoinPredicate **edge, AccessPath **right_path)
	If the ON clause of a left join only references tables on the right side of the join, pushing the condition into the right side is a valid thing to do. More...
AccessPath *	anonymous_namespace{join_optimizer.cc}::DeduplicateForSemijoin (THD *thd, AccessPath *path, Item **semijoin_group, int semijoin_group_size, std::string *trace)
	Build an access path that deduplicates its input on a certain grouping. More...
uint32_t	anonymous_namespace{join_optimizer.cc}::AddFlag (uint32_t flags, FuzzyComparisonResult flag)
bool	anonymous_namespace{join_optimizer.cc}::HasFlag (uint32_t flags, FuzzyComparisonResult flag)
PathComparisonResult	CompareAccessPaths (const LogicalOrderings &orderings, const AccessPath &a, const AccessPath &b, OrderingSet obsolete_orderings)
AccessPath	anonymous_namespace{join_optimizer.cc}::MakeSortPathWithoutFilesort (THD *thd, AccessPath *child, ORDER *order, int ordering_state, int num_where_predicates)
bool	anonymous_namespace{join_optimizer.cc}::CheckSupportedQuery (THD *thd)
AccessPath *	anonymous_namespace{join_optimizer.cc}::CreateMaterializationOrStreamingPath (THD *thd, JOIN *join, AccessPath *path, bool need_rowid, bool copy_items)
	Set up an access path for streaming or materializing through a temporary table. More...
bool	anonymous_namespace{join_optimizer.cc}::IsMaterializationPath (const AccessPath *path)
bool	anonymous_namespace{join_optimizer.cc}::IsImmediateDeleteCandidate (const Table_ref *table_ref, const Query_block *query_block)
	Is this DELETE target table a candidate for being deleted from immediately, while scanning the result of the join? It only checks if it is a candidate for immediate delete. More...
void	anonymous_namespace{join_optimizer.cc}::AddFieldsToTmpSet (Item *item, TABLE *table)
	Adds all fields of "table" that are referenced from "item" to table->tmp_set. More...
bool	anonymous_namespace{join_optimizer.cc}::IsImmediateUpdateCandidate (const Table_ref *table_ref, int node_idx, const JoinHypergraph &graph, table_map target_tables)
	Is this UPDATE target table a candidate for being updated immediately, while scanning the result of the join? It only checks if it is a candidate for immediate update. More...
table_map	anonymous_namespace{join_optimizer.cc}::FindUpdateDeleteTargetTables (const Query_block *query_block)
	Finds all the target tables of an UPDATE or DELETE statement. More...
table_map	anonymous_namespace{join_optimizer.cc}::FindImmediateUpdateDeleteCandidates (const JoinHypergraph &graph, table_map target_tables, bool is_delete)
	Finds all of the target tables of an UPDATE or DELETE statement that are candidates from being updated or deleted from immediately while scanning the results of the join, without need to buffer the row IDs in a temporary table for delayed update/delete after the join has completed. More...
NodeMap	anonymous_namespace{join_optimizer.cc}::FindFullTextSearchedTables (const JoinHypergraph &graph)
bool	anonymous_namespace{join_optimizer.cc}::IsSargableFullTextIndexPredicate (Item *condition)
uint64_t	anonymous_namespace{join_optimizer.cc}::FindSargableFullTextPredicates (const JoinHypergraph &graph)
bool	anonymous_namespace{join_optimizer.cc}::InjectCastNodes (JoinHypergraph *graph)
void	anonymous_namespace{join_optimizer.cc}::EnableFullTextCoveringIndexes (const Query_block *query_block)
AccessPath *	anonymous_namespace{join_optimizer.cc}::CreateZeroRowsForEmptyJoin (JOIN *join, const char *cause)
	Creates a ZERO_ROWS access path for an always empty join result, or a ZERO_ROWS_AGGREGATED in case of an implicitly grouped query. More...
AccessPath	anonymous_namespace{join_optimizer.cc}::CreateStreamingAggregationPath (THD *thd, AccessPath *path, JOIN *join, olap_type olap, double row_estimate, string *trace)
	Creates an AGGREGATE AccessPath, possibly with an intermediary STREAM node if one is needed. More...
void	anonymous_namespace{join_optimizer.cc}::SplitHavingCondition (THD *thd, Item *cond, Item **having_cond, Item **having_cond_wf)
void	anonymous_namespace{join_optimizer.cc}::ApplyHavingOrQualifyCondition (THD *thd, Item *having_cond, Query_block *query_block, const char *description_for_trace, string *trace, Prealloced_array< AccessPath *, 4 > *root_candidates, CostingReceiver *receiver)
AccessPath	anonymous_namespace{join_optimizer.cc}::MakeSortPathForDistinct (THD *thd, AccessPath *root_path, int ordering_idx, bool aggregation_is_unordered, const LogicalOrderings &orderings, LogicalOrderings::StateIndex ordering_state)
JoinHypergraph::Node *	anonymous_namespace{join_optimizer.cc}::FindNodeWithTable (JoinHypergraph *graph, TABLE *table)
Prealloced_array< AccessPath *, 4 >	anonymous_namespace{join_optimizer.cc}::ApplyDistinctAndOrder (THD *thd, const CostingReceiver &receiver, const LogicalOrderings &orderings, bool aggregation_is_unordered, int order_by_ordering_idx, int distinct_ordering_idx, const Mem_root_array< SortAheadOrdering > &sort_ahead_orderings, FunctionalDependencySet fd_set, Query_block *query_block, bool need_rowid, bool force_sort_rowids, Prealloced_array< AccessPath *, 4 > root_candidates, string *trace)
static AccessPath *	anonymous_namespace{join_optimizer.cc}::ApplyWindow (THD *thd, AccessPath *root_path, Window *window, JOIN *join, bool need_rowid_for_window)
static int	anonymous_namespace{join_optimizer.cc}::FindBestOrderingForWindow (JOIN *join, const LogicalOrderings &orderings, FunctionalDependencySet fd_set, const Mem_root_array< SortAheadOrdering > &sort_ahead_orderings, Bounds_checked_array< bool > finished_windows, Bounds_checked_array< bool > tmp_buffer, int first_ordering_idx, int second_ordering_idx, Bounds_checked_array< bool > included_windows)
	Find the ordering that allows us to process the most unprocessed windows. More...
AccessPath *	anonymous_namespace{join_optimizer.cc}::MakeSortPathAndApplyWindows (THD *thd, JOIN *join, AccessPath *root_path, int ordering_idx, ORDER *order, const LogicalOrderings &orderings, Bounds_checked_array< bool > windows_this_iteration, FunctionalDependencySet fd_set, int num_where_predicates, bool need_rowid_for_window, int single_window_idx, Bounds_checked_array< bool > finished_windows, int *num_windows_left)
static Prealloced_array< AccessPath *, 4 >	ApplyWindowFunctions (THD *thd, const CostingReceiver &receiver, const LogicalOrderings &orderings, FunctionalDependencySet fd_set, bool aggregation_is_unordered, int order_by_ordering_idx, int distinct_ordering_idx, const JoinHypergraph &graph, const Mem_root_array< SortAheadOrdering > &sort_ahead_orderings, Query_block *query_block, int num_where_predicates, bool need_rowid, Prealloced_array< AccessPath *, 4 > root_candidates, string *trace)
	Apply window functions. More...
static bool	CompatibleTypesForIndexLookup (Item_func_eq *eq_item, Field *field, Item *value)
	Find out if "value" has a type which is compatible with "field" so that it can be used for an index lookup if there is an index on "field". More...
static void	PossiblyAddSargableCondition (THD *thd, Item *item, const CompanionSet &companion_set, TABLE *force_table, int predicate_index, bool is_join_condition, JoinHypergraph *graph, string *trace)
	Find out whether “item” is a sargable condition; if so, add it to: More...
void	FindSargablePredicates (THD *thd, string *trace, JoinHypergraph *graph)
static bool	ComesFromSameMultiEquality (Item *cond1, Item_eq_base *cond2)
static void	CacheCostInfoForJoinConditions (THD *thd, const Query_block *query_block, JoinHypergraph *graph, string *trace)
	For each edge, cache some information for each of its join conditions. More...
static bool	IsAlreadyAggregated (const AccessPath *root_path)
bool	ApplyAggregation (THD *thd, JoinHypergraph *graph, CostingReceiver &receiver, int group_by_ordering_idx, bool need_rowid, bool aggregation_is_unordered, const LogicalOrderings &orderings, const Mem_root_array< SortAheadOrdering > &sort_ahead_orderings, FunctionalDependencySet fd_set, Query_block *query_block, Prealloced_array< AccessPath *, 4 > &root_candidates, string *trace)
static AccessPath *	FindBestQueryPlanInner (THD *thd, Query_block *query_block, bool *retry, int *subgraph_pair_limit, string *trace)
	Find the lowest-cost plan (which hopefully is also the cheapest to execute) of all the legal ways to execute the query. More...
AccessPath *	FindBestQueryPlan (THD *thd, Query_block *query_block, string *trace)

Function Documentation

ApplyAggregation()

bool ApplyAggregation	(	THD *	thd,
		JoinHypergraph *	graph,
		CostingReceiver &	receiver,
		int	group_by_ordering_idx,
		bool	need_rowid,
		bool	aggregation_is_unordered,
		const LogicalOrderings &	orderings,
		const Mem_root_array< SortAheadOrdering > &	sort_ahead_orderings,
		FunctionalDependencySet	fd_set,
		Query_block *	query_block,
		Prealloced_array< AccessPath *, 4 > &	root_candidates,
		string *	trace
	)

ApplyWindowFunctions()

static Prealloced_array< AccessPath *, 4 > ApplyWindowFunctions ( THD *  thd, const CostingReceiver &  receiver, const LogicalOrderings &  orderings, FunctionalDependencySet  fd_set, bool  aggregation_is_unordered, int  order_by_ordering_idx, int  distinct_ordering_idx, const JoinHypergraph &  graph, const Mem_root_array< SortAheadOrdering > &  sort_ahead_orderings, Query_block *  query_block, int  num_where_predicates, bool  need_rowid, Prealloced_array< AccessPath *, 4 >  root_candidates, string *  trace  )

static

Apply window functions.

Ordering of window functions is a tricky topic. We can apply window functions in any order that we'd like, but we would like to do as few sorts as possible. In its most general form, this would entail solving an instance of the traveling salesman problem (TSP), and although the number of windows is typically small (one or two in most queries), this can blow up for large numbers of windows.

Thankfully, window functions never add or remove rows. We also assume that all sorts are equally expensive (which isn't really true, as ones on more columns take more processing time and buffer, but it's close enough in practice), and we also ignore the fact that as we compute more buffers, the temporary tables and sort buffers will get more columns. These assumptions, combined with some reasonable assumptions about ordering transitivity (if an ordering A is more sorted than an ordering B, and B > C, then also A > C – the only thing that can disturb this is groupings, which we ignore for the sake of simplicity), mean that we need to care only about the number of sorts, and can do them greedily. Thus, at any point, we pick the ordering that allows us to process the largest number of windows, process them, remove them from consideration, and repeat until there are none left.

There is one more ordering complication; after windowing, we may have DISTINCT and/or ORDER BY, which may also benefit from groupings/orderings we leave after the last window. Thus, first of all, we see if there's an ordering that can satisfy them (ideally both if possible) and at least one window; if so, we save that ordering and those windows for last.

Temporary tables are set up in FinalizePlanForQueryBlock(). This is so that it is easier to have multiple different orderings for the temporary table parameters later.

CacheCostInfoForJoinConditions()

static void CacheCostInfoForJoinConditions ( THD *  thd, const Query_block *  query_block, JoinHypergraph *  graph, string *  trace  )

static

For each edge, cache some information for each of its join conditions.

This reduces work when repeatedly applying these join conditions later on. In particular, FindContainedSubqueries() contains a large amount of virtual function calls that we would like to avoid doing every time we consider a given join.

ComesFromSameMultiEquality()

static bool ComesFromSameMultiEquality ( Item *  cond1, Item_eq_base *  cond2  )

static

CompareAccessPaths()

PathComparisonResult CompareAccessPaths	(	const LogicalOrderings &	orderings,
		const AccessPath &	a,
		const AccessPath &	b,
		OrderingSet	obsolete_orderings
	)

CompatibleTypesForIndexLookup()

static bool CompatibleTypesForIndexLookup ( Item_func_eq *  eq_item, Field *  field, Item *  value  )

static

Find out if "value" has a type which is compatible with "field" so that it can be used for an index lookup if there is an index on "field".

FindBestQueryPlan()

AccessPath * FindBestQueryPlan	(	THD *	thd,
		Query_block *	query_block,
		string *	trace
	)

FindBestQueryPlanInner()

static AccessPath * FindBestQueryPlanInner ( THD *  thd, Query_block *  query_block, bool *  retry, int *  subgraph_pair_limit, string *  trace  )

static

Find the lowest-cost plan (which hopefully is also the cheapest to execute) of all the legal ways to execute the query.

The overall order of operations is largely dictated by the standard:

1. All joined tables, including join predicates.
2. WHERE predicates (we push these down into #1 where allowed)
3. GROUP BY (it is sometimes possible to push this down into #1, but we don't have the functionality to do so).
4. HAVING.
5. Window functions.
6. DISTINCT.
7. ORDER BY.
8. LIMIT.
9. SQL_BUFFER_RESULT (a MySQL extension).

The place where we have the most leeway by far is #1, which is why this part of the optimizer is generally called the join optimizer (there are potentially billions of different join orderings, whereas each of the other steps, except windowing, can only be done in one or two ways). But the various outputs of #1 can have different properties, that can make for higher or lower costs in the other steps. (For instance, LIMIT will affect candidates with different init_cost differently, and ordering properties can skip sorting in ORDER BY entirely.) Thus, we allow keeping multiple candidates in play at every step if they are meaningfully different, and only pick out the winning candidate based on cost at the very end.

ensure full enumeration is done for primary engine.

FindSargablePredicates()

void FindSargablePredicates	(	THD *	thd,
		string *	trace,
		JoinHypergraph *	graph
	)

IsAlreadyAggregated()

static bool IsAlreadyAggregated ( const AccessPath *  root_path )

static

PossiblyAddSargableCondition()

static void PossiblyAddSargableCondition ( THD *  thd, Item *  item, const CompanionSet &  companion_set, TABLE *  force_table, int  predicate_index, bool  is_join_condition, JoinHypergraph *  graph, string *  trace  )

static

Find out whether “item” is a sargable condition; if so, add it to:

• The list of sargable predicate for the tables (hypergraph nodes) the condition touches. For a regular condition, this will typically be one table; for a join condition, it will typically be two. If “force_table” is non-nullptr, only that table will be considered (this is used for join conditions, to ensure that we do not push down predicates that cannot, e.g. to the outer side of left joins).
• The graph's global list of predicates, if it is not already present (predicate_index = -1). This will never happen for WHERE conditions, only for join conditions.