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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
|
/* Copyright (C) 2003 MySQL AB
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
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 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
#ifndef ODBC_CODEGEN_Code_expr_op_hpp
#define ODBC_CODEGEN_Code_expr_op_hpp
#include <common/common.hpp>
#include <common/DataField.hpp>
#include "Code_expr.hpp"
/**
* @class Expr_op
* @brief Arithmetic and string operators
*/
struct Expr_op {
enum Opcode {
Add = 1, // binary
Subtract,
Multiply,
Divide,
Plus, // unary
Minus
};
Expr_op(Opcode opcode);
const char* name() const;
unsigned arity() const;
Opcode m_opcode;
};
inline
Expr_op::Expr_op(Opcode opcode) :
m_opcode(opcode)
{
}
/**
* @class Plan_expr_op
* @brief Operator node in an expression in PlanTree
*/
class Plan_expr_op : public Plan_expr {
public:
Plan_expr_op(Plan_root* root, Expr_op op);
virtual ~Plan_expr_op();
Plan_base* analyze(Ctx& ctx, Ctl& ctl);
Exec_base* codegen(Ctx& ctx, Ctl& ctl);
void print(Ctx& ctx);
bool isEqual(const Plan_expr* expr) const;
bool isGroupBy(const Plan_expr_row* row) const;
// children
void setExpr(unsigned i, Plan_expr* expr);
protected:
Expr_op m_op;
Plan_expr* m_expr[1 + 2];
};
inline
Plan_expr_op::Plan_expr_op(Plan_root* root, Expr_op op) :
Plan_expr(root, TypeOp),
m_op(op)
{
m_expr[0] = m_expr[1] = m_expr[2] = 0;
}
inline void
Plan_expr_op::setExpr(unsigned i, Plan_expr* expr)
{
ctx_assert(1 <= i && i <= 2 && expr != 0);
m_expr[i] = expr;
}
/**
* @class Exec_expr_op
* @brief Operator node in an expression in ExecTree
*/
class Exec_expr_op : public Exec_expr {
public:
class Code : public Exec_expr::Code {
public:
Code(Expr_op op, const SqlSpec& spec);
virtual ~Code();
protected:
friend class Exec_expr_op;
Expr_op m_op;
const SqlSpec m_sqlSpec;
};
class Data : public Exec_expr::Data {
public:
Data(const SqlField& sqlField);
virtual ~Data();
protected:
friend class Exec_expr_op;
SqlField m_sqlField;
};
Exec_expr_op(Exec_root* root);
virtual ~Exec_expr_op();
void alloc(Ctx& ctx, Ctl& ctl);
void evaluate(Ctx& ctx, Ctl& ctl);
void close(Ctx& ctx);
void print(Ctx& ctx);
// children
const Code& getCode() const;
Data& getData() const;
void setExpr(unsigned i, Exec_expr* expr);
protected:
Exec_expr* m_expr[1 + 2];
};
inline
Exec_expr_op::Code::Code(Expr_op op, const SqlSpec& sqlSpec) :
Exec_expr::Code(m_sqlSpec),
m_op(op),
m_sqlSpec(sqlSpec)
{
}
inline
Exec_expr_op::Data::Data(const SqlField& sqlField) :
Exec_expr::Data(m_sqlField),
m_sqlField(sqlField)
{
}
inline
Exec_expr_op::Exec_expr_op(Exec_root* root) :
Exec_expr(root)
{
m_expr[0] = m_expr[1] = m_expr[2] = 0;
}
// children
inline const Exec_expr_op::Code&
Exec_expr_op::getCode() const
{
const Code* code = static_cast<const Code*>(m_code);
return *code;
}
inline Exec_expr_op::Data&
Exec_expr_op::getData() const
{
Data* data = static_cast<Data*>(m_data);
return *data;
}
inline void
Exec_expr_op::setExpr(unsigned i, Exec_expr* expr)
{
ctx_assert(1 <= i && i <= 2 && m_expr[i] == 0);
m_expr[i] = expr;
}
#endif
|
