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
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
|
// file : odb/relational/schema.cxx
// author : Boris Kolpackov <boris@codesynthesis.com>
// copyright : Copyright (c) 2009-2011 Code Synthesis Tools CC
// license : GNU GPL v3; see accompanying LICENSE file
#include <odb/gcc.hxx>
#include <cassert>
#include <limits>
#include <sstream>
#include <odb/emitter.hxx>
#include <odb/relational/schema.hxx>
#include <odb/relational/generate.hxx>
using namespace std;
namespace relational
{
namespace schema
{
// object_columns
//
void object_columns::
default_ (semantics::data_member& m)
{
string s;
tree n (0);
semantics::type& t (m.type ());
if (m.count ("default"))
{
s = m.get<string> ("default");
// Empty string is a default value override which means
// there is no default value.
//
if (s.empty ())
return;
if (m.count ("default-node"))
n = m.get<tree> ("default-node");
}
else if (t.count ("default"))
{
s = t.get<string> ("default");
if (s.empty ())
return;
if (t.count ("default-node"))
n = t.get<tree> ("default-node");
}
else
return; // No default value for this column.
// The first letter in the default value string identifies
// the type of the value. See pragma.cxx for details.
//
switch (s[0])
{
case 'n':
{
default_null (m);
break;
}
case 't':
case 'f':
{
default_bool (m, s[0] == 't');
break;
}
case '+':
case '-':
{
switch (TREE_CODE (n))
{
case INTEGER_CST:
{
HOST_WIDE_INT hwl (TREE_INT_CST_LOW (n));
HOST_WIDE_INT hwh (TREE_INT_CST_HIGH (n));
unsigned long long l (hwl);
unsigned long long h (hwh);
unsigned short width (HOST_BITS_PER_WIDE_INT);
unsigned long long v ((h << width) + l);
default_integer (m, v, s[0] == '-');
break;
}
case REAL_CST:
{
double v;
REAL_VALUE_TYPE d (TREE_REAL_CST (n));
if (REAL_VALUE_ISINF (d))
v = numeric_limits<double>::infinity ();
else if (REAL_VALUE_ISNAN (d))
v = numeric_limits<double>::quiet_NaN ();
else
{
char tmp[256];
real_to_decimal (tmp, &d, sizeof (tmp), 0, true);
istringstream is (tmp);
is >> v;
}
if (s[0] == '-')
v = -v;
default_float (m, v);
break;
}
default:
assert (false);
}
break;
}
case 's':
{
default_string (m, string (s, 1, string::npos));
break;
}
case 'e':
{
default_enum (m, n, string (s, 1, string::npos));
break;
}
default:
assert (false);
}
}
struct schema_emitter: emitter, context
{
virtual void
pre ()
{
first_ = true;
}
virtual void
line (const std::string& l)
{
if (first_)
first_ = false;
else
os << endl;
os << l;
}
virtual void
post ()
{
if (!first_) // Ignore empty statements.
os << ';' << endl
<< endl;
}
private:
bool first_;
};
static char const file_header[] =
"/* This file was generated by ODB, object-relational mapping (ORM)\n"
" * compiler for C++.\n"
" */\n\n";
void
generate ()
{
context ctx;
ostream& os (ctx.os);
os << file_header;
schema_emitter emitter;
// Drop.
//
{
traversal::unit unit;
traversal::defines unit_defines;
traversal::namespace_ ns;
instance<class_drop> c (emitter);
unit >> unit_defines >> ns;
unit_defines >> c;
traversal::defines ns_defines;
ns >> ns_defines >> ns;
ns_defines >> c;
// Pass 1 and 2.
//
for (unsigned short pass (1); pass < 3; ++pass)
{
c->pass (pass);
unit.dispatch (ctx.unit);
}
}
os << endl;
// Create.
//
{
traversal::unit unit;
traversal::defines unit_defines;
traversal::namespace_ ns;
instance<class_create> c (emitter);
unit >> unit_defines >> ns;
unit_defines >> c;
traversal::defines ns_defines;
ns >> ns_defines >> ns;
ns_defines >> c;
// Pass 1 and 2.
//
for (unsigned short pass (1); pass < 3; ++pass)
{
c->pass (pass);
unit.dispatch (ctx.unit);
}
}
}
}
}
|
