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
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* 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/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include <file/fcode.hxx>
#include <osl/diagnose.h>
#include <sal/log.hxx>
#include <connectivity/sqlparse.hxx>
#include <sqlbison.hxx>
#include <i18nlangtag/mslangid.hxx>
#include <TConnection.hxx>
#include <com/sun/star/sdb/SQLFilterOperator.hpp>
#include <comphelper/types.hxx>
using namespace ::comphelper;
using namespace connectivity;
using namespace connectivity::file;
using namespace ::com::sun::star::sdbc;
using namespace ::com::sun::star::sdb;
OCode::~OCode() = default;
OOperandRow::OOperandRow(sal_uInt16 _nPos, sal_Int32 _rType)
: OOperand(_rType)
, m_nRowPos(_nPos)
{}
void OOperandRow::bindValue(const OValueRefRow& _pRow)
{
OSL_ENSURE(_pRow.is(),"NO EMPTY row allowed!");
m_pRow = _pRow;
OSL_ENSURE(m_pRow.is() && m_nRowPos < m_pRow->get().size(),"Invalid RowPos is >= vector.size()");
(m_pRow->get())[m_nRowPos]->setBound(true);
}
void OOperandRow::setValue(const ORowSetValue& _rVal)
{
OSL_ENSURE(m_pRow.is() && m_nRowPos < m_pRow->get().size(),"Invalid RowPos is >= vector.size()");
(*(m_pRow->get())[m_nRowPos]) = _rVal;
}
const ORowSetValue& OOperandRow::getValue() const
{
OSL_ENSURE(m_pRow.is() && m_nRowPos < m_pRow->get().size(),"Invalid RowPos is >= vector.size()");
return (m_pRow->get())[m_nRowPos]->getValue();
}
void OOperandValue::setValue(const ORowSetValue& _rVal)
{
m_aValue = _rVal;
}
OOperandParam::OOperandParam(OSQLParseNode const * pNode, sal_Int32 _nPos)
: OOperandRow(static_cast<sal_uInt16>(_nPos), DataType::VARCHAR) // Standard-Type
{
OSL_ENSURE(SQL_ISRULE(pNode,parameter),"Argument is not a parameter");
OSL_ENSURE(pNode->count() > 0,"Error in Parse Tree");
OSQLParseNode *pMark = pNode->getChild(0);
OUString aParameterName;
if (SQL_ISPUNCTUATION(pMark, "?"))
aParameterName = "?";
else if (SQL_ISPUNCTUATION(pMark, ":"))
aParameterName = pNode->getChild(1)->getTokenValue();
else
{
SAL_WARN( "connectivity.drivers","Error in Parse Tree");
}
// set up Parameter-Column with default type, can be specified more precisely later using Describe-Parameter
// save Identity (not escpecially necessary here, just for the sake of symmetry)
// todo
// OColumn* pColumn = new OFILEColumn(aParameterName,eDBType,255,0,SQL_FLAGS_NULLALLOWED);
// rParamColumns->AddColumn(pColumn);
// the value will be set just before the evaluation
}
const ORowSetValue& OOperandValue::getValue() const
{
return m_aValue;
}
OOperandConst::OOperandConst(const OSQLParseNode& rColumnRef, const OUString& aStrValue)
{
switch (rColumnRef.getNodeType())
{
case SQLNodeType::String:
m_aValue = aStrValue;
m_eDBType = DataType::VARCHAR;
m_aValue.setBound(true);
return;
case SQLNodeType::IntNum:
case SQLNodeType::ApproxNum:
m_aValue = aStrValue.toDouble();
m_eDBType = DataType::DOUBLE;
m_aValue.setBound(true);
return;
default:
break;
}
if (SQL_ISTOKEN(&rColumnRef, TRUE))
{
m_aValue = 1.0;
m_eDBType = DataType::BIT;
}
else if (SQL_ISTOKEN(&rColumnRef, FALSE))
{
m_aValue = 0.0;
m_eDBType = DataType::BIT;
}
else
{
SAL_WARN( "connectivity.drivers", "Parse Error");
}
m_aValue.setBound(true);
}
// Implementation of the operators
bool OBoolOperator::operate(const OOperand*, const OOperand*) const
{
return false;
}
void OBoolOperator::Exec(OCodeStack& rCodeStack)
{
OOperand *pRight = rCodeStack.top();
rCodeStack.pop();
OOperand *pLeft = rCodeStack.top();
rCodeStack.pop();
rCodeStack.push(new OOperandResultBOOL(operate(pLeft, pRight)));
if( typeid(OOperandResult) == typeid(*pLeft))
delete pLeft;
if( typeid(OOperandResult) == typeid(*pRight))
delete pRight;
}
bool OOp_NOT::operate(const OOperand* pLeft, const OOperand* ) const
{
return !pLeft->isValid();
}
void OOp_NOT::Exec(OCodeStack& rCodeStack)
{
OOperand* pOperand = rCodeStack.top();
rCodeStack.pop();
rCodeStack.push(new OOperandResultBOOL(operate(pOperand, nullptr)));
if( typeid(OOperandResult) == typeid(*pOperand))
delete pOperand;
}
bool OOp_AND::operate(const OOperand* pLeft, const OOperand* pRight) const
{
return pLeft->isValid() && pRight->isValid();
}
bool OOp_OR::operate(const OOperand* pLeft, const OOperand* pRight) const
{
return pLeft->isValid() || pRight->isValid();
}
void OOp_ISNULL::Exec(OCodeStack& rCodeStack)
{
OOperand* pOperand = rCodeStack.top();
rCodeStack.pop();
rCodeStack.push(new OOperandResultBOOL(operate(pOperand, nullptr)));
if( typeid(OOperandResult) == typeid(*pOperand))
delete pOperand;
}
bool OOp_ISNULL::operate(const OOperand* pOperand, const OOperand*) const
{
return pOperand->getValue().isNull();
}
bool OOp_ISNOTNULL::operate(const OOperand* pOperand, const OOperand*) const
{
return !OOp_ISNULL::operate(pOperand, nullptr);
}
bool OOp_LIKE::operate(const OOperand* pLeft, const OOperand* pRight) const
{
bool bMatch;
const ORowSetValue& aLH(pLeft->getValue());
const ORowSetValue& aRH(pRight->getValue());
if (aLH.isNull() || aRH.isNull())
bMatch = false;
else
{
bMatch = match(aRH.getString(), aLH.getString(), cEscape);
}
return bMatch;
}
bool OOp_NOTLIKE::operate(const OOperand* pLeft, const OOperand* pRight) const
{
return !OOp_LIKE::operate(pLeft, pRight);
}
bool OOp_COMPARE::operate(const OOperand* pLeft, const OOperand* pRight) const
{
const ORowSetValue& aLH(pLeft->getValue());
const ORowSetValue& aRH(pRight->getValue());
if (aLH.isNull() || aRH.isNull()) // if (!aLH.getValue() || !aRH.getValue())
return false;
bool bResult = false;
sal_Int32 eDBType = pLeft->getDBType();
// Comparison (depending on Data-type):
switch (eDBType)
{
case DataType::CHAR:
case DataType::VARCHAR:
case DataType::LONGVARCHAR:
{
OUString sLH = aLH, sRH = aRH;
sal_Int32 nRes = sLH.compareToIgnoreAsciiCase(sRH);
switch(aPredicateType)
{
case SQLFilterOperator::EQUAL: bResult = (nRes == 0); break;
case SQLFilterOperator::NOT_EQUAL: bResult = (nRes != 0); break;
case SQLFilterOperator::LESS: bResult = (nRes < 0); break;
case SQLFilterOperator::LESS_EQUAL: bResult = (nRes <= 0); break;
case SQLFilterOperator::GREATER: bResult = (nRes > 0); break;
case SQLFilterOperator::GREATER_EQUAL: bResult = (nRes >= 0); break;
default: bResult = false;
}
} break;
case DataType::TINYINT:
case DataType::SMALLINT:
case DataType::INTEGER:
case DataType::DECIMAL:
case DataType::NUMERIC:
case DataType::REAL:
case DataType::DOUBLE:
case DataType::BIT:
case DataType::TIMESTAMP:
case DataType::DATE:
case DataType::TIME:
{
double n = aLH ,m = aRH;
switch (aPredicateType)
{
case SQLFilterOperator::EQUAL: bResult = (n == m); break;
case SQLFilterOperator::LIKE: bResult = (n == m); break;
case SQLFilterOperator::NOT_EQUAL: bResult = (n != m); break;
case SQLFilterOperator::NOT_LIKE: bResult = (n != m); break;
case SQLFilterOperator::LESS: bResult = (n < m); break;
case SQLFilterOperator::LESS_EQUAL: bResult = (n <= m); break;
case SQLFilterOperator::GREATER: bResult = (n > m); break;
case SQLFilterOperator::GREATER_EQUAL: bResult = (n >= m); break;
default: bResult = false;
}
} break;
default:
bResult = aLH == aRH;
}
return bResult;
}
void ONumOperator::Exec(OCodeStack& rCodeStack)
{
OOperand *pRight = rCodeStack.top();
rCodeStack.pop();
OOperand *pLeft = rCodeStack.top();
rCodeStack.pop();
rCodeStack.push(new OOperandResultNUM(operate(pLeft->getValue(), pRight->getValue())));
if( typeid(OOperandResult) == typeid(*pLeft))
delete pLeft;
if( typeid(OOperandResult) == typeid(*pRight))
delete pRight;
}
double OOp_ADD::operate(const double& fLeft,const double& fRight) const
{
return fLeft + fRight;
}
double OOp_SUB::operate(const double& fLeft,const double& fRight) const
{
return fLeft - fRight;
}
double OOp_MUL::operate(const double& fLeft,const double& fRight) const
{
return fLeft * fRight;
}
double OOp_DIV::operate(const double& fLeft,const double& fRight) const
{
return fLeft / fRight;
}
void ONthOperator::Exec(OCodeStack& rCodeStack)
{
std::vector<ORowSetValue> aValues;
std::vector<OOperand*> aOperands;
OOperand* pOperand;
do
{
OSL_ENSURE(!rCodeStack.empty(),"Stack must be none empty!");
pOperand = rCodeStack.top();
rCodeStack.pop();
assert(pOperand);
if (pOperand && typeid(OStopOperand) != typeid(*pOperand))
aValues.push_back( pOperand->getValue() );
aOperands.push_back( pOperand );
}
while (pOperand && typeid(OStopOperand) != typeid(*pOperand));
rCodeStack.push(new OOperandResult(operate(aValues)));
std::vector<OOperand*>::iterator aIter = aOperands.begin();
std::vector<OOperand*>::const_iterator aEnd = aOperands.end();
for (; aIter != aEnd; ++aIter)
{
if (typeid(OOperandResult) == typeid(*(*aIter)))
delete *aIter;
}
}
void OBinaryOperator::Exec(OCodeStack& rCodeStack)
{
OOperand *pRight = rCodeStack.top();
rCodeStack.pop();
OOperand *pLeft = rCodeStack.top();
rCodeStack.pop();
if ( !rCodeStack.empty() && typeid(OStopOperand) == typeid(*rCodeStack.top()) )
rCodeStack.pop();
rCodeStack.push(new OOperandResult(operate(pLeft->getValue(),pRight->getValue())));
if(typeid(OOperandResult) == typeid(*pRight))
delete pRight;
if(typeid(OOperandResult) == typeid(*pLeft))
delete pLeft;
}
void OUnaryOperator::Exec(OCodeStack& rCodeStack)
{
OSL_ENSURE(!rCodeStack.empty(),"Stack is empty!");
OOperand* pOperand = rCodeStack.top();
rCodeStack.pop();
rCodeStack.push(new OOperandResult(operate(pOperand->getValue())));
if (typeid(OOperandResult) == typeid(*pOperand))
delete pOperand;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|