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
|
// file : odb/mysql/query.cxx
// author : Boris Kolpackov <boris@codesynthesis.com>
// copyright : Copyright (c) 2009-2011 Code Synthesis Tools CC
// license : GNU GPL v2; see accompanying LICENSE file
#include <cstddef> // std::size_t
#include <cstring> // std::memset
#include <odb/mysql/query.hxx>
using namespace std;
namespace odb
{
namespace mysql
{
// query_param
//
query_param::
~query_param ()
{
}
query::
query (const query& q)
: clause_ (q.clause_),
parameters_ (q.parameters_),
bind_ (q.bind_),
binding_ (0, 0)
{
// Here and below we want to maintain up to date binding info so
// that the call to parameters_binding() below is an immutable
// operation, provided the query does not have any by-reference
// parameters. This way a by-value-only query can be shared
// between multiple threads without the need for synchronization.
//
if (size_t n = bind_.size ())
{
binding_.bind = &bind_[0];
binding_.count = n;
binding_.version++;
}
}
query& query::
operator= (const query& q)
{
if (this != &q)
{
clause_ = q.clause_;
parameters_ = q.parameters_;
bind_ = q.bind_;
size_t n (bind_.size ());
binding_.bind = n != 0 ? &bind_[0] : 0;
binding_.count = n;
binding_.version++;
}
return *this;
}
query& query::
operator+= (const query& q)
{
size_t n (clause_.size ());
if (n != 0 && clause_[n - 1] != ' ' &&
!q.clause_.empty () && q.clause_[0] != ' ')
clause_ += ' ';
clause_ += q.clause_;
n = bind_.size ();
parameters_.insert (
parameters_.end (), q.parameters_.begin (), q.parameters_.end ());
bind_.insert (
bind_.end (), q.bind_.begin (), q.bind_.end ());
if (n != bind_.size ())
{
binding_.bind = &bind_[0];
binding_.count = bind_.size ();
binding_.version++;
}
return *this;
}
void query::
add (details::shared_ptr<query_param> p)
{
size_t n (clause_.size ());
if (n != 0 && clause_[n - 1] != ' ')
clause_ += ' ';
clause_ += '?';
parameters_.push_back (p);
bind_.push_back (MYSQL_BIND ());
binding_.bind = &bind_[0];
binding_.count = bind_.size ();
binding_.version++;
MYSQL_BIND* b (&bind_.back ());
memset (b, 0, sizeof (MYSQL_BIND));
p->bind (b);
}
binding& query::
parameters_binding () const
{
size_t n (parameters_.size ());
binding& r (binding_);
if (n == 0)
return r;
bool inc_ver (false);
MYSQL_BIND* b (&bind_[0]);
for (size_t i (0); i < n; ++i)
{
query_param& p (*parameters_[i]);
if (p.reference ())
{
if (p.init ())
{
p.bind (b + i);
inc_ver = true;
}
}
}
if (inc_ver)
r.version++;
return r;
}
std::string query::
clause () const
{
if (clause_.empty () ||
clause_.compare (0, 6, "WHERE ") == 0 ||
clause_.compare (0, 9, "ORDER BY ") == 0 ||
clause_.compare (0, 9, "GROUP BY ") == 0 ||
clause_.compare (0, 7, "HAVING ") == 0)
return clause_;
else
return "WHERE " + clause_;
}
}
}
|
