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
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* Effective License of whole file:
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software Foundation.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
* Parts "Copyright by Sun Microsystems, Inc" prior to August 2011:
*
* The Contents of this file are made available subject to the terms of
* the GNU Lesser General Public License Version 2.1
*
* Copyright: 2000 by Sun Microsystems, Inc.
*
* Contributor(s): Joerg Budischewski
*
* All parts contributed on or after August 2011:
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
************************************************************************/
#include "pq_resultset.hxx"
#include "pq_resultsetmetadata.hxx"
#include <connectivity/dbexception.hxx>
#include <com/sun/star/sdbc/FetchDirection.hpp>
#include <com/sun/star/sdbc/ResultSetConcurrency.hpp>
#include <com/sun/star/sdbc/ResultSetType.hpp>
#include <com/sun/star/sdbc/DataType.hpp>
#include <com/sun/star/sdbc/SQLException.hpp>
using osl::MutexGuard;
using com::sun::star::uno::Any;
using com::sun::star::uno::Reference;
using com::sun::star::uno::XInterface;
using com::sun::star::sdbc::SQLException;
using com::sun::star::sdbc::XResultSetMetaData;
namespace pq_sdbc_driver
{
void ResultSet::checkClosed()
{
if( ! m_result )
{
throw SQLException( "pq_resultset: already closed",
*this, OUString(), 1, Any() );
}
if( ! m_ppSettings || ! *m_ppSettings || ! (*m_ppSettings)->pConnection )
{
throw SQLException( "pq_resultset: statement has been closed already",
*this, OUString(), 1, Any() );
}
}
ResultSet::ResultSet( const ::rtl::Reference< comphelper::RefCountedMutex > & refMutex,
const Reference< XInterface > & owner,
ConnectionSettings **ppSettings,
PGresult * result,
const OUString &schema,
const OUString &table)
: BaseResultSet(
refMutex, owner, PQntuples( result ),
PQnfields( result ),(*ppSettings)->tc ),
m_result( result ),
m_schema( schema ),
m_table( table ),
m_ppSettings( ppSettings )
{
// LEM TODO: shouldn't these things be inherited from the statement or something like that?
// Positioned update/delete not supported, so no cursor name
// Fetch direction and size are cursor-specific things, so not used now.
// Fetch size not set
m_props[ BASERESULTSET_FETCH_DIRECTION ] <<= css::sdbc::FetchDirection::UNKNOWN;
// No escape processing for now
m_props[ BASERESULTSET_ESCAPE_PROCESSING ] <<= false;
// Bookmarks not implemented for now
m_props[ BASERESULTSET_IS_BOOKMARKABLE ] <<= false;
m_props[ BASERESULTSET_RESULT_SET_CONCURRENCY ] <<= css::sdbc::ResultSetConcurrency::READ_ONLY;
m_props[ BASERESULTSET_RESULT_SET_TYPE ] <<= css::sdbc::ResultSetType::SCROLL_INSENSITIVE;
}
Any ResultSet::getValue( sal_Int32 columnIndex )
{
Any ret;
if( PQgetisnull( m_result, m_row, columnIndex -1 ) )
{
m_wasNull = true;
}
else
{
m_wasNull = false;
ret <<= OUString(
PQgetvalue( m_result, m_row , columnIndex -1 ) ,
PQgetlength( m_result, m_row , columnIndex -1 ) ,
ConnectionSettings::encoding );
}
return ret;
}
ResultSet::~ResultSet()
{}
void ResultSet::close( )
{
Reference< XInterface > owner;
{
MutexGuard guard( m_xMutex->GetMutex() );
if( m_result )
{
PQclear(m_result );
m_result = nullptr;
m_row = -1;
}
owner = m_owner;
m_owner.clear();
}
}
Reference< XResultSetMetaData > ResultSet::getMetaData( )
{
MutexGuard guard( m_xMutex->GetMutex() );
checkClosed();
return new ResultSetMetaData(
m_xMutex, this, this, m_ppSettings, m_result, m_schema, m_table );
}
sal_Int32 ResultSet::findColumn( const OUString& columnName )
{
MutexGuard guard( m_xMutex->GetMutex() );
checkClosed();
sal_Int32 res = PQfnumber( m_result,
OUStringToOString( columnName, ConnectionSettings::encoding ).getStr());
/* PQfnumber return -1 for not found, which is what we want
* other than that we use col number as 1-based not 0-based */
if(res >= 0)
{
res += 1;
}
else
{
::dbtools::throwInvalidColumnException( columnName, *this );
assert(false);
}
return res;
}
static bool isNumber( const char * data, sal_Int32 len )
{
bool ret = false;
if( len )
{
ret = true;
for( int i = 0 ; i < len ; i ++ )
{
if( ( data[i] >= '0' && data[i] <= '9' ) ||
data[i] == '-' || data[i] == '+' || data[i] == '.' || data[i] == ',' )
{
if( data[i] == '-' && i != 0 && i != len-1 )
{
// no number, maybe a date
ret = false;
break;
}
}
else
{
ret = false;
break;
}
}
}
return ret;
}
static bool isInteger( const char * data, sal_Int32 len )
{
bool ret = false;
if( len )
{
ret = true;
for( int i = 0 ; i < len ; i ++ )
{
if( ( data[i] >= '0' && data[i] <= '9' ) ||
data[i] == '-' || data[i] == '+' )
{
if( data[i] == '-' && i != 0 && i != len-1 )
{
// no number, maybe a date
ret = false;
break;
}
}
else
{
ret = false;
break;
}
}
}
return ret;
}
static bool isDate( const char * data, sal_Int32 len )
{
return 10 == len &&
'-' == data[4] &&
'-' == data[7] &&
isInteger( &(data[0]),4 ) &&
isInteger( &(data[5]),2) &&
isInteger( &(data[8]),2 );
}
static bool isTime( const char * data, sal_Int32 len )
{
return 8 == len &&
':' == data[2] &&
':' == data[5] &&
isInteger( &(data[0]),2 ) &&
isInteger( &(data[3]),2) &&
isInteger( &(data[6]),2 );
}
static bool isTimestamp( const char * data, sal_Int32 len )
{
return len == 19 && isDate( data, 10) && isTime( &(data[11]),8 );
}
sal_Int32 ResultSet::guessDataType( sal_Int32 column )
{
// we don't look into more than 100 rows ...
sal_Int32 ret = css::sdbc::DataType::INTEGER;
int maxRows = std::min<sal_Int32>( m_rowCount, 100 );
for( int i = 0 ; i < maxRows ; i ++ )
{
if( ! PQgetisnull( m_result, i , column-1 ) )
{
const char * p = PQgetvalue( m_result, i , column -1 );
int len = PQgetlength( m_result, i , column -1 );
if( css::sdbc::DataType::INTEGER == ret )
{
if( ! isInteger( p,len ) )
ret = css::sdbc::DataType::NUMERIC;
}
if( css::sdbc::DataType::NUMERIC == ret )
{
if( ! isNumber( p,len ) )
{
ret = css::sdbc::DataType::DATE;
}
}
if( css::sdbc::DataType::DATE == ret )
{
if( ! isDate( p,len ) )
{
ret = css::sdbc::DataType::TIME;
}
}
if( css::sdbc::DataType::TIME == ret )
{
if( ! isTime( p,len ) )
{
ret = css::sdbc::DataType::TIMESTAMP;
}
}
if( css::sdbc::DataType::TIMESTAMP == ret )
{
if( ! isTimestamp( p,len ) )
{
ret = css::sdbc::DataType::LONGVARCHAR;
break;
}
}
}
}
return ret;
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
