MySQL  8.0.19
Source Code Documentation
que0types.h
Go to the documentation of this file.
1 /*****************************************************************************
2 
3 Copyright (c) 1996, 2018, Oracle and/or its affiliates. All Rights Reserved.
4 
5 This program is free software; you can redistribute it and/or modify it under
6 the terms of the GNU General Public License, version 2.0, as published by the
7 Free Software Foundation.
8 
9 This program is also distributed with certain software (including but not
10 limited to OpenSSL) that is licensed under separate terms, as designated in a
11 particular file or component or in included license documentation. The authors
12 of MySQL hereby grant you an additional permission to link the program and
13 your derivative works with the separately licensed software that they have
14 included with MySQL.
15 
16 This program is distributed in the hope that it will be useful, but WITHOUT
17 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
18 FOR A PARTICULAR PURPOSE. See the GNU General Public License, version 2.0,
19 for more details.
20 
21 You should have received a copy of the GNU General Public License along with
22 this program; if not, write to the Free Software Foundation, Inc.,
23 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
24 
25 *****************************************************************************/
26 
27 /** @file include/que0types.h
28  Query graph global types
29 
30  Created 5/27/1996 Heikki Tuuri
31  *******************************************************/
32 
33 #ifndef que0types_h
34 #define que0types_h
35 
36 #include "data0data.h"
37 #include "dict0types.h"
38 
39 /* Pseudotype for all graph nodes */
40 typedef void que_node_t;
41 
42 /* Query graph root is a fork node */
43 typedef struct que_fork_t que_t;
44 
45 struct que_thr_t;
46 
47 /* Common struct at the beginning of each query graph node; the name of this
48 substruct must be 'common' */
49 
50 struct que_common_t {
51  ulint type; /*!< query node type */
52  que_node_t *parent; /*!< back pointer to parent node, or NULL */
53  que_node_t *brother; /* pointer to a possible brother node */
54  dfield_t val; /*!< evaluated value for an expression */
55  ulint val_buf_size;
56  /* buffer size for the evaluated value data,
57  if the buffer has been allocated dynamically:
58  if this field is != 0, and the node is a
59  symbol node or a function node, then we
60  have to free the data field in val
61  explicitly */
62 };
63 
64 #endif
dict0types.h
que_common_t::parent
que_node_t * parent
back pointer to parent node, or NULL
Definition: que0types.h:52
que_common_t::type
ulint type
query node type
Definition: que0types.h:51
que_common_t::val_buf_size
ulint val_buf_size
Definition: que0types.h:55
que_node_t
void que_node_t
Definition: que0types.h:40
que_common_t::val
dfield_t val
evaluated value for an expression
Definition: que0types.h:54
que_common_t
Definition: que0types.h:50
que_fork_t
Definition: que0que.h:303
data0data.h
dfield_t
Structure for an SQL data field.
Definition: data0data.h:644
que_thr_t
Definition: que0que.h:246
que_common_t::brother
que_node_t * brother
Definition: que0types.h:53