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
|
/* 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_update_scan_hpp
#define ODBC_CODEGEN_Code_update_scan_hpp
#include <common/common.hpp>
#include "Code_base.hpp"
#include "Code_dml.hpp"
#include "Code_table.hpp"
#include "Code_pred.hpp"
#include "Code_query.hpp"
/**
* @class Plan_update_scan
* @brief Update in PlanTree
*/
class Plan_update_scan : public Plan_dml {
public:
Plan_update_scan(Plan_root* root);
virtual ~Plan_update_scan();
Plan_base* analyze(Ctx& ctx, Ctl& ctl);
void describe(Ctx& ctx);
Exec_base* codegen(Ctx& ctx, Ctl& ctl);
void print(Ctx& ctx);
// children
void setTable(Plan_table* table);
void setDmlRow(Plan_dml_row* dmlRow);
void setQuery(Plan_query* query);
protected:
Plan_table* m_table;
Plan_dml_row* m_dmlRow;
Plan_query* m_query;
};
inline
Plan_update_scan::Plan_update_scan(Plan_root* root) :
Plan_dml(root),
m_table(0),
m_dmlRow(0),
m_query(0)
{
}
// children
inline void
Plan_update_scan::setTable(Plan_table* table)
{
ctx_assert(table != 0);
m_table = table;
}
inline void
Plan_update_scan::setDmlRow(Plan_dml_row* dmlRow)
{
ctx_assert(dmlRow != 0);
m_dmlRow = dmlRow;
}
inline void
Plan_update_scan::setQuery(Plan_query* query)
{
ctx_assert(query != 0);
m_query = query;
}
/**
* @class Exec_update_scan
* @brief Insert in ExecTree
*/
class Exec_update_scan : public Exec_dml {
public:
class Code : public Exec_dml::Code {
public:
Code();
virtual ~Code();
protected:
friend class Plan_update_scan;
friend class Exec_update_scan;
unsigned m_attrCount;
NdbAttrId* m_attrId;
};
class Data : public Exec_dml::Data {
public:
Data();
virtual ~Data();
protected:
friend class Exec_update_scan;
};
Exec_update_scan(Exec_root* root);
virtual ~Exec_update_scan();
void alloc(Ctx& ctx, Ctl& ctl);
void execImpl(Ctx& ctx, Ctl& ctl);
void close(Ctx& ctx);
void print(Ctx& ctx);
// children
const Code& getCode() const;
Data& getData() const;
void setQuery(Exec_query* query);
protected:
Exec_query* m_query;
};
inline
Exec_update_scan::Code::Code() :
m_attrCount(0),
m_attrId(0)
{
}
inline
Exec_update_scan::Data::Data()
{
}
inline
Exec_update_scan::Exec_update_scan(Exec_root* root) :
Exec_dml(root),
m_query(0)
{
}
// children
inline const Exec_update_scan::Code&
Exec_update_scan::getCode() const
{
const Code* code = static_cast<const Code*>(m_code);
return *code;
}
inline Exec_update_scan::Data&
Exec_update_scan::getData() const
{
Data* data = static_cast<Data*>(m_data);
return *data;
}
inline void
Exec_update_scan::setQuery(Exec_query* query)
{
ctx_assert(query != 0 && m_query == 0);
m_query = query;
}
#endif
|
