drizzle
C++ MySQL-protocol-compatible database server
Loading...
Searching...
No Matches
que0types.h
Go to the documentation of this file.
1/*****************************************************************************
2
3Copyright (C) 1996, 2009, Innobase Oy. All Rights Reserved.
4
5This program is free software; you can redistribute it and/or modify it under
6the terms of the GNU General Public License as published by the Free Software
7Foundation; version 2 of the License.
8
9This program is distributed in the hope that it will be useful, but WITHOUT
10ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
11FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
12
13You should have received a copy of the GNU General Public License along with
14this program; if not, write to the Free Software Foundation, Inc., 51 Franklin
15St, Fifth Floor, Boston, MA 02110-1301 USA
16
17*****************************************************************************/
18
19/**************************************************/
25
26#pragma once
27#ifndef que0types_h
28#define que0types_h
29
30#include "data0data.h"
31#include "dict0types.h"
32
33/* Pseudotype for all graph nodes */
34typedef void que_node_t;
35
36typedef struct que_fork_struct que_fork_t;
37
38/* Query graph root is a fork node */
39typedef que_fork_t que_t;
40
41typedef struct que_thr_struct que_thr_t;
42typedef struct que_common_struct que_common_t;
43
44/* Common struct at the beginning of each query graph node; the name of this
45substruct must be 'common' */
46
48 ulint type;
49 que_node_t* parent;
50 que_node_t* brother;/* pointer to a possible brother node */
51 dfield_t val;
52 ulint val_buf_size;
53 /* buffer size for the evaluated value data,
54 if the buffer has been allocated dynamically:
55 if this field is != 0, and the node is a
56 symbol node or a function node, then we
57 have to free the data field in val
58 explicitly */
59};
60
61#endif
que_node_t * parent
Definition que0types.h:49