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
|
/* - mode: c++ c-basic-offset: 2; indent-tabs-mode: nil; -*-
* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
*
* Copyright (C) 2008 MySQL
*
* 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., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <config.h>
#include <drizzled/field/int64.h>
#include <drizzled/error.h>
#include <drizzled/table.h>
#include <drizzled/session.h>
#include <drizzled/internal/my_sys.h>
#include <math.h>
#include <algorithm>
using namespace std;
namespace drizzled {
namespace field {
/****************************************************************************
Field type Int64 int (8 bytes)
****************************************************************************/
int Int64::store(const char *from,uint32_t len, const charset_info_st * const cs)
{
int error= 0;
char *end;
ASSERT_COLUMN_MARKED_FOR_WRITE;
uint64_t tmp= cs->cset->strntoull10rnd(cs, from, len, false, &end,&error);
if (error == ERANGE)
{
set_warning(DRIZZLE_ERROR::WARN_LEVEL_WARN, ER_WARN_DATA_OUT_OF_RANGE, 1);
error= 1;
}
else if (getTable()->in_use->count_cuted_fields && check_int(cs, from, len, end, error))
{
error= 1;
}
else
{
error= 0;
}
int64_tstore(ptr,tmp);
return error;
}
int Int64::store(double nr)
{
int error= 0;
int64_t res;
ASSERT_COLUMN_MARKED_FOR_WRITE;
nr= rint(nr);
if (nr <= (double) INT64_MIN)
{
res= INT64_MIN;
error= (nr < (double) INT64_MIN);
}
else if (nr >= (double) (uint64_t) INT64_MAX)
{
res= INT64_MAX;
error= (nr > (double) INT64_MAX);
}
else
{
res=(int64_t) nr;
}
if (error)
set_warning(DRIZZLE_ERROR::WARN_LEVEL_WARN, ER_WARN_DATA_OUT_OF_RANGE, 1);
int64_tstore(ptr, res);
return error;
}
int Int64::store(int64_t nr, bool arg)
{
int error= 0;
ASSERT_COLUMN_MARKED_FOR_WRITE;
if (arg && nr < 0) // Only a partial fix for overflow
{
set_warning(DRIZZLE_ERROR::WARN_LEVEL_WARN, ER_WARN_DATA_OUT_OF_RANGE, 1);
error= 1;
}
int64_tstore(ptr,nr);
return error;
}
double Int64::val_real() const
{
int64_t j;
ASSERT_COLUMN_MARKED_FOR_READ;
int64_tget(j,ptr);
/* The following is open coded to avoid a bug in gcc 3.3 */
return (double) j;
}
int64_t Int64::val_int() const
{
int64_t j;
ASSERT_COLUMN_MARKED_FOR_READ;
int64_tget(j,ptr);
return j;
}
String *Int64::val_str(String *val_buffer, String *) const
{
const charset_info_st * const cs= &my_charset_bin;
uint32_t length;
uint32_t mlength= max(field_length+1,22*cs->mbmaxlen);
val_buffer->alloc(mlength);
char *to=(char*) val_buffer->ptr();
int64_t j;
ASSERT_COLUMN_MARKED_FOR_READ;
int64_tget(j,ptr);
length=(uint32_t) (cs->cset->int64_t10_to_str)(cs,to,mlength, -10, j);
val_buffer->length(length);
return val_buffer;
}
int Int64::cmp(const unsigned char *a_ptr, const unsigned char *b_ptr)
{
int64_t a,b;
int64_tget(a,a_ptr);
int64_tget(b,b_ptr);
return (a < b) ? -1 : (a > b) ? 1 : 0;
}
void Int64::sort_string(unsigned char *to,uint32_t )
{
#ifdef WORDS_BIGENDIAN
{
to[0] = (char) (ptr[0] ^ 128); /* Revers signbit */
to[1] = ptr[1];
to[2] = ptr[2];
to[3] = ptr[3];
to[4] = ptr[4];
to[5] = ptr[5];
to[6] = ptr[6];
to[7] = ptr[7];
}
#else
{
to[0] = (char) (ptr[7] ^ 128); /* Revers signbit */
to[1] = ptr[6];
to[2] = ptr[5];
to[3] = ptr[4];
to[4] = ptr[3];
to[5] = ptr[2];
to[6] = ptr[1];
to[7] = ptr[0];
}
#endif
}
unsigned char *Int64::pack(unsigned char* to, const unsigned char *from, uint32_t, bool)
{
int64_t val;
int64_tget(val, from);
int64_tstore(to, val);
return to + sizeof(val);
}
const unsigned char *Int64::unpack(unsigned char* to, const unsigned char *from, uint32_t, bool)
{
int64_t val;
int64_tget(val, from);
int64_tstore(to, val);
return from + sizeof(val);
}
} /* namespace field */
} /* namespace drizzled */
|