1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
|
/*****************************************************************************
Copyright (c) 1997, 2025, Oracle and/or its affiliates.
This program is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License, version 2.0, as published by the
Free Software Foundation.
This program is designed to work with certain software (including
but not limited to OpenSSL) that is licensed under separate terms,
as designated in a particular file or component or in included license
documentation. The authors of MySQL hereby grant you an additional
permission to link the program and your derivative works with the
separately licensed software that they have either included with
the program or referenced in the documentation.
This program is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
FOR A PARTICULAR PURPOSE. See the GNU General Public License, version 2.0,
for more details.
You should have received a copy of the GNU General Public License along with
this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*****************************************************************************/
/** @file include/pars0opt.h
Simple SQL optimizer
Created 12/21/1997 Heikki Tuuri
*******************************************************/
#ifndef pars0opt_h
#define pars0opt_h
#include "dict0types.h"
#include "pars0sym.h"
#include "que0types.h"
#include "row0sel.h"
#include "univ.i"
#include "usr0types.h"
/** Optimizes a select. Decides which indexes to tables to use. The tables
are accessed in the order that they were written to the FROM part in the
select statement. */
void opt_search_plan(sel_node_t *sel_node); /*!< in: parsed select node */
/** Looks for occurrences of the columns of the table in the query subgraph and
adds them to the list of columns if an occurrence of the same column does not
already exist in the list. If the column is already in the list, puts a value
indirection to point to the occurrence in the column list, except if the
column occurrence we are looking at is in the column list, in which case
nothing is done. */
void opt_find_all_cols(
bool copy_val, /*!< in: if true, new found columns are
added as columns to copy */
dict_index_t *index, /*!< in: index to use */
sym_node_list_t *col_list, /*!< in: base node of a list where
to add new found columns */
plan_t *plan, /*!< in: plan or NULL */
que_node_t *exp); /*!< in: expression or condition */
#endif
|
