MySQL 8.3.0
Source Code Documentation
que0types.h
Go to the documentation of this file.
1/*****************************************************************************
2
3Copyright (c) 1996, 2023, Oracle and/or its affiliates.
4
5This program is free software; you can redistribute it and/or modify it under
6the terms of the GNU General Public License, version 2.0, as published by the
7Free Software Foundation.
8
9This program is also distributed with certain software (including but not
10limited to OpenSSL) that is licensed under separate terms, as designated in a
11particular file or component or in included license documentation. The authors
12of MySQL hereby grant you an additional permission to link the program and
13your derivative works with the separately licensed software that they have
14included with MySQL.
15
16This program is distributed in the hope that it will be useful, but WITHOUT
17ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
18FOR A PARTICULAR PURPOSE. See the GNU General Public License, version 2.0,
19for more details.
20
21You should have received a copy of the GNU General Public License along with
22this program; if not, write to the Free Software Foundation, Inc.,
2351 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 */
40typedef void que_node_t;
41
42/* Query graph root is a fork node */
43typedef struct que_fork_t que_t;
44
45struct que_thr_t;
46
47/* Common struct at the beginning of each query graph node; the name of this
48substruct must be 'common' */
49
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 */
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
SQL data field and tuple.
Data dictionary global types.
void que_node_t
Definition: que0types.h:40
Structure for an SQL data field.
Definition: data0data.h:604
Definition: que0types.h:50
ulint type
query node type
Definition: que0types.h:51
dfield_t val
evaluated value for an expression
Definition: que0types.h:54
que_node_t * brother
Definition: que0types.h:53
ulint val_buf_size
Definition: que0types.h:55
que_node_t * parent
back pointer to parent node, or NULL
Definition: que0types.h:52
Definition: que0que.h:300
Definition: que0que.h:241
unsigned long int ulint
Definition: univ.i:405