Skip to content
Navigation Menu
{{ message }}
-
-
Notifications
You must be signed in to change notification settings - Fork 415
Expand file tree
/
Copy pathcql2.cpp
More file actions
646 lines (566 loc) · 20.6 KB
/
Copy pathcql2.cpp
File metadata and controls
646 lines (566 loc) · 20.6 KB
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
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
/******************************************************************************
*
* Project: MapServer
* Purpose: CQL2 expression
* Author: Even Rouault <even dot rouault at spatialys dot com>
*
******************************************************************************
* Copyright (C) 2026 Even Rouault <even dot rouault at spatialys dot com>
*
* SPDX-License-Identifier: MIT
****************************************************************************/
#include "cql2.h"
#include <algorithm>
#include <cassert>
#include <cstring>
#include <queue>
#include <string>
#include "mapogcfilter.h"
#include "mapows.h"
/************************************************************************/
/* to_string() */
/************************************************************************/
static std::string to_string(double x) {
char szBuf[32];
snprintf(szBuf, sizeof(szBuf), "%.17g", x);
return szBuf;
}
/************************************************************************/
/* cql2_expr_node(cql2_op) */
/************************************************************************/
cql2_expr_node::cql2_expr_node(cql2_op op)
: m_op(op), m_node_type(CQL2_NT_OPERATION) {
switch (op) {
case CQL2_OR:
case CQL2_AND:
case CQL2_NOT:
case CQL2_EQ:
case CQL2_IEQ:
case CQL2_NE:
case CQL2_INE:
case CQL2_GE:
case CQL2_LE:
case CQL2_LT:
case CQL2_GT:
case CQL2_IN:
case CQL2_LIKE:
case CQL2_ILIKE:
case CQL2_BETWEEN:
case CQL2_IS_NULL:
case CQL2_S_INTERSECTS:
case CQL2_S_EQUALS:
case CQL2_S_DISJOINT:
case CQL2_S_TOUCHES:
case CQL2_S_WITHIN:
case CQL2_S_OVERLAPS:
case CQL2_S_CROSSES:
case CQL2_S_CONTAINS:
m_field_type = CQL2_BOOLEAN;
break;
case CQL2_ADD:
case CQL2_SUBTRACT:
case CQL2_MULTIPLY:
case CQL2_DIV:
case CQL2_MOD:
case CQL2_ARGUMENT_LIST:
case CQL2_CUSTOM_FUNC:
break;
case CQL2_NONE:
assert(false);
break;
}
}
/************************************************************************/
/* ~cql2_expr_node() */
/************************************************************************/
cql2_expr_node::~cql2_expr_node() = default;
/************************************************************************/
/* PushSubExpression() */
/************************************************************************/
void cql2_expr_node::PushSubExpression(cql2_expr_node *child) {
m_depth = std::max(m_depth, 1 + child->m_depth);
m_apoChildren.push_back(std::unique_ptr<cql2_expr_node>(child));
}
/************************************************************************/
/* ReverseSubExpressions() */
/************************************************************************/
void cql2_expr_node::ReverseSubExpressions() {
for (size_t i = 0; i < m_apoChildren.size() / 2; i++) {
std::swap(m_apoChildren[i], m_apoChildren[m_apoChildren.size() - i - 1]);
}
}
/************************************************************************/
/* RebalanceAndOr() */
/************************************************************************/
void cql2_expr_node::RebalanceAndOr() {
std::queue<cql2_expr_node *> nodes;
nodes.push(this);
while (!nodes.empty()) {
cql2_expr_node *node = nodes.front();
nodes.pop();
if (node->m_node_type == CQL2_NT_OPERATION) {
const auto op = node->m_op;
if ((op == CQL2_OR || op == CQL2_AND) && node->m_apoChildren.size() > 2) {
std::vector<std::unique_ptr<cql2_expr_node>> exprs;
for (auto &subexpr : node->m_apoChildren) {
subexpr->RebalanceAndOr();
exprs.push_back(std::move(subexpr));
}
node->m_apoChildren.clear();
while (exprs.size() > 2) {
std::vector<std::unique_ptr<cql2_expr_node>> new_exprs;
for (size_t i = 0; i < exprs.size(); i++) {
if (i + 1 < exprs.size()) {
auto cur_expr = std::make_unique<cql2_expr_node>(op);
cur_expr->PushSubExpression(exprs[i].release());
cur_expr->PushSubExpression(exprs[i + 1].release());
i++;
new_exprs.push_back(std::move(cur_expr));
} else {
new_exprs.push_back(std::move(exprs[i]));
}
}
exprs = std::move(new_exprs);
}
assert(exprs.size() == 2);
node->m_apoChildren = std::move(exprs);
} else {
for (auto &subexpr : node->m_apoChildren) {
nodes.push(subexpr.get());
}
}
}
}
}
/************************************************************************/
/* cql2_create_and_or_or() */
/************************************************************************/
cql2_expr_node *cql2_create_and_or_or(cql2_op op,
std::unique_ptr<cql2_expr_node> left,
std::unique_ptr<cql2_expr_node> right) {
auto poNode = std::make_unique<cql2_expr_node>(op);
poNode->m_field_type = CQL2_BOOLEAN;
if (left->m_node_type == CQL2_NT_OPERATION && left->m_op == op) {
poNode->m_apoChildren = std::move(left->m_apoChildren);
// Temporary non-binary formulation
if (right->m_node_type == CQL2_NT_OPERATION && right->m_op == op) {
poNode->m_apoChildren.insert(
poNode->m_apoChildren.end(),
std::make_move_iterator(right->m_apoChildren.begin()),
std::make_move_iterator(right->m_apoChildren.end()));
} else {
poNode->m_apoChildren.push_back(std::move(right));
}
} else if (right->m_node_type == CQL2_NT_OPERATION && right->m_op == op) {
// Temporary non-binary formulation
poNode->m_apoChildren = std::move(right->m_apoChildren);
poNode->m_apoChildren.push_back(std::move(left));
} else {
poNode->m_apoChildren.push_back(std::move(left));
poNode->m_apoChildren.push_back(std::move(right));
}
return poNode.release();
}
/************************************************************************/
/* getItemAliasOrName() */
/************************************************************************/
static const char *getItemAliasOrName(const layerObj *layer, const char *item) {
std::string key = std::string(item) + "_alias";
if (const char *value =
msOWSLookupMetadata(&(layer->metadata), "OGA", key.c_str())) {
return value;
}
return item;
}
/************************************************************************/
/* ChangeBBOXToWKT() */
/************************************************************************/
bool cql2_expr_node::ChangeBBOXToWKT(const layerObj *layer,
const std::string &filterCrs,
bool axisInverted) {
if (m_node_type == CQL2_NT_OPERATION && m_op == CQL2_CUSTOM_FUNC &&
EQUAL(m_osVal.c_str(), "BBOX") && m_apoChildren.size() == 4 &&
m_apoChildren[0]->IsNumeric() && m_apoChildren[1]->IsNumeric() &&
m_apoChildren[2]->IsNumeric() && m_apoChildren[3]->IsNumeric()) {
rectObj rect;
rect.minx = m_apoChildren[0]->AsDouble();
rect.miny = m_apoChildren[1]->AsDouble();
rect.maxx = m_apoChildren[2]->AsDouble();
rect.maxy = m_apoChildren[3]->AsDouble();
if (axisInverted) {
std::swap(rect.minx, rect.miny);
std::swap(rect.maxx, rect.maxy);
}
projectionObj shapeProj;
msInitProjection(&shapeProj);
msProjectionInheritContextFrom(&shapeProj, &(layer->projection));
if (msLoadProjectionString(&shapeProj, filterCrs.c_str()) != 0) {
msFreeProjection(&shapeProj);
return false;
}
int status = msProjectRect(
&shapeProj, const_cast<projectionObj *>(&(layer->projection)), &rect);
msFreeProjection(&shapeProj);
if (status != MS_SUCCESS) {
return false;
}
const std::string minx = to_string(rect.minx);
const std::string miny = to_string(rect.miny);
const std::string maxx = to_string(rect.maxx);
const std::string maxy = to_string(rect.maxy);
std::string s("POLYGON((");
s += minx + " " + miny + ",";
s += minx + " " + maxy + ",";
s += maxx + " " + maxy + ",";
s += maxx + " " + miny + ",";
s += minx + " " + miny;
s += "))";
m_node_type = CQL2_NT_CONSTANT;
m_field_type = CQL2_WKT;
m_osVal = std::move(s);
m_apoChildren.clear();
m_alreadyReprojected = true;
return true;
} else {
for (auto &child : m_apoChildren) {
if (!child->ChangeBBOXToWKT(layer, filterCrs, axisInverted)) {
return false;
}
}
}
return true;
}
/************************************************************************/
/* ToMapServerFilter() */
/************************************************************************/
std::string cql2_expr_node::ToMapServerFilter(
const layerObj *layer, const std::vector<std::string> &queryableItems,
const std::string &geometryName, const std::string &filterCrs,
bool axisInverted, std::string &errorMsg) const {
if (!errorMsg.empty())
return std::string();
switch (m_node_type) {
case CQL2_NT_CONSTANT: {
switch (m_field_type) {
case CQL2_INTEGER: {
return std::to_string(m_nVal);
}
case CQL2_DOUBLE: {
return to_string(m_dfVal);
}
case CQL2_STRING: {
return std::string("'")
.append(msStdStringEscape(m_osVal.c_str()))
.append("'");
}
case CQL2_WKT: {
if (m_alreadyReprojected)
return m_osVal;
shapeObj *shape = msShapeFromWKT(m_osVal.c_str());
if (!shape) {
errorMsg = m_osVal;
errorMsg += " is invalid WKT";
return std::string();
}
projectionObj shapeProj;
msInitProjection(&shapeProj);
msProjectionInheritContextFrom(&shapeProj, &(layer->projection));
if (msLoadProjectionString(&shapeProj, filterCrs.c_str()) != 0) {
msFreeProjection(&shapeProj);
errorMsg = "Cannot process filter-crs";
return std::string();
}
if (axisInverted)
msAxisSwapShape(shape);
if (msProjectShape(&shapeProj,
const_cast<projectionObj *>(&(layer->projection)),
shape) != MS_SUCCESS) {
msFreeProjection(&shapeProj);
errorMsg = "Cannot reproject " + m_osVal;
return std::string();
}
msFreeProjection(&shapeProj);
char *wkt = msShapeToWKT(shape);
msFreeShape(shape);
msFree(shape);
if (!wkt) {
errorMsg = "Cannot export back to WKT";
return std::string();
}
std::string s(wkt);
msFree(wkt);
return s;
}
case CQL2_BOOLEAN: {
return m_nVal ? "1" : "0";
}
}
break;
}
case CQL2_NT_COLUMN: {
if (std::find(queryableItems.begin(), queryableItems.end(),
m_osVal.c_str()) == queryableItems.end()) {
errorMsg = m_osVal;
errorMsg += " is not a queryable item";
break;
}
// Find actual item name from alias
const char *pszItem = nullptr;
for (int j = 0; j < layer->numitems; ++j) {
if (m_osVal == getItemAliasOrName(layer, layer->items[j])) {
pszItem = layer->items[j];
break;
}
}
const char *pszType =
msOWSLookupMetadata(&(layer->metadata), "OFG",
std::string(pszItem).append("_type").c_str());
if (pszType && (EQUAL(pszType, "Integer") || EQUAL(pszType, "Long") ||
EQUAL(pszType, "Real")))
return std::string("[").append(msStdStringEscape(pszItem)).append("]");
else if (pszType && (EQUAL(pszType, "Date") || EQUAL(pszType, "DateTime")))
return std::string("`[").append(msStdStringEscape(pszItem)).append("]`");
else
return std::string("\"[")
.append(msStdStringEscape(pszItem))
.append("]\"");
}
case CQL2_NT_OPERATION: {
const auto ReturnBinaryOp = [this, layer, axisInverted, &queryableItems,
&geometryName, &filterCrs,
&errorMsg](const char *pszOp) {
assert(m_apoChildren.size() == 2);
return std::string("(")
.append(m_apoChildren[0]->ToMapServerFilter(layer, queryableItems,
geometryName, filterCrs,
axisInverted, errorMsg))
.append(" ")
.append(pszOp)
.append(" ")
.append(m_apoChildren[1]->ToMapServerFilter(layer, queryableItems,
geometryName, filterCrs,
axisInverted, errorMsg))
.append(")");
};
switch (m_op) {
case CQL2_OR:
return ReturnBinaryOp("OR");
case CQL2_AND:
return ReturnBinaryOp("AND");
case CQL2_NOT: {
assert(m_apoChildren.size() == 1);
return std::string("(NOT ")
.append(m_apoChildren[0]->ToMapServerFilter(layer, queryableItems,
geometryName, filterCrs,
axisInverted, errorMsg))
.append(")");
}
case CQL2_EQ:
return ReturnBinaryOp("=");
case CQL2_NE:
return ReturnBinaryOp("!=");
case CQL2_GE:
return ReturnBinaryOp(">=");
case CQL2_LE:
return ReturnBinaryOp("<=");
case CQL2_LT:
return ReturnBinaryOp("<");
case CQL2_GT:
return ReturnBinaryOp(">");
case CQL2_IN: {
assert(m_apoChildren.size() >= 2);
std::string s = "((";
for (size_t i = 1; i < m_apoChildren.size(); ++i) {
if (i > 1)
s.append(") OR (");
s.append(m_apoChildren[0]->ToMapServerFilter(layer, queryableItems,
geometryName, filterCrs,
axisInverted, errorMsg))
.append(" ")
.append("=")
.append(" ")
.append(m_apoChildren[i]->ToMapServerFilter(
layer, queryableItems, geometryName, filterCrs, axisInverted,
errorMsg));
}
s += "))";
return s;
}
case CQL2_LIKE:
case CQL2_ILIKE: {
assert(m_apoChildren.size() == 2);
FEPropertyIsLike propIsLike;
propIsLike.pszWildCard = const_cast<char *>("%");
propIsLike.pszSingleChar = const_cast<char *>("_");
propIsLike.pszEscapeChar = const_cast<char *>("\\");
propIsLike.bCaseInsensitive = 0;
return std::string("(")
.append(m_apoChildren[0]->ToMapServerFilter(layer, queryableItems,
geometryName, filterCrs,
axisInverted, errorMsg))
.append(" ")
.append(m_op == CQL2_LIKE ? "~" : "~*")
.append(" \"")
.append(msGetLikePatternAsRegex(&propIsLike,
m_apoChildren[1]->m_osVal.c_str()))
.append("\")");
}
case CQL2_IEQ:
case CQL2_INE: {
assert(m_apoChildren.size() == 2);
FEPropertyIsLike propIsLike;
propIsLike.pszWildCard = const_cast<char *>("");
propIsLike.pszSingleChar = const_cast<char *>("");
propIsLike.pszEscapeChar = const_cast<char *>("\\");
propIsLike.bCaseInsensitive = 0;
std::string s;
if (m_op == CQL2_INE)
s = "( NOT";
s.append("(")
.append(m_apoChildren[0]->ToMapServerFilter(layer, queryableItems,
geometryName, filterCrs,
axisInverted, errorMsg))
.append(" ~* \"")
.append(msGetLikePatternAsRegex(&propIsLike,
m_apoChildren[1]->m_osVal.c_str()))
.append("\")");
if (m_op == CQL2_INE)
s.append(")");
return s;
}
case CQL2_BETWEEN: {
assert(m_apoChildren.size() == 3);
return std::string("((")
.append(m_apoChildren[0]->ToMapServerFilter(layer, queryableItems,
geometryName, filterCrs,
axisInverted, errorMsg))
.append(" ")
.append(">=")
.append(" ")
.append(m_apoChildren[1]->ToMapServerFilter(layer, queryableItems,
geometryName, filterCrs,
axisInverted, errorMsg))
.append(") AND (")
.append(m_apoChildren[0]->ToMapServerFilter(layer, queryableItems,
geometryName, filterCrs,
axisInverted, errorMsg))
.append(" ")
.append("<=")
.append(" ")
.append(m_apoChildren[2]->ToMapServerFilter(layer, queryableItems,
geometryName, filterCrs,
axisInverted, errorMsg))
.append("))");
}
case CQL2_IS_NULL: {
errorMsg = "IS NULL not supported by MapServer";
break;
}
case CQL2_S_INTERSECTS:
case CQL2_S_EQUALS:
case CQL2_S_DISJOINT:
case CQL2_S_TOUCHES:
case CQL2_S_WITHIN:
case CQL2_S_OVERLAPS:
case CQL2_S_CROSSES:
case CQL2_S_CONTAINS: {
const char *pszFunc = "";
switch (m_op) {
case CQL2_S_INTERSECTS:
pszFunc = "intersects";
break;
case CQL2_S_EQUALS:
pszFunc = "equals";
break;
case CQL2_S_DISJOINT:
pszFunc = "disjoint";
break;
case CQL2_S_TOUCHES:
pszFunc = "touches";
break;
case CQL2_S_WITHIN:
pszFunc = "within";
break;
case CQL2_S_OVERLAPS:
pszFunc = "overlaps";
break;
case CQL2_S_CROSSES:
pszFunc = "crosses";
break;
case CQL2_S_CONTAINS:
pszFunc = "contains";
break;
default:
assert(false);
break;
}
assert(m_apoChildren.size() == 2);
if (m_apoChildren[0]->m_node_type != CQL2_NT_COLUMN ||
m_apoChildren[0]->m_osVal != geometryName) {
errorMsg = "First parameter of s_";
errorMsg += pszFunc;
errorMsg += "() must be the geometry "
"column name '" +
geometryName + "'";
return std::string();
}
if (!m_apoChildren[1]->ChangeBBOXToWKT(layer, filterCrs, axisInverted)) {
errorMsg = "Error while reprojecting BBOX";
return std::string();
}
if (m_apoChildren[1]->m_field_type != CQL2_WKT) {
errorMsg = "Second parameter of s_";
errorMsg += pszFunc;
errorMsg += "() must be "
"BBOX(minx,miny,maxx,maxy) or a WKT literal'";
return std::string();
}
std::string s("(");
s += pszFunc;
s += "([shape],fromText('";
s += m_apoChildren[1]->ToMapServerFilter(layer, queryableItems,
geometryName, filterCrs,
axisInverted, errorMsg);
s += "'))=true)";
return s;
}
case CQL2_CUSTOM_FUNC: {
if (m_osVal == "TIMESTAMP" || m_osVal == "DATE") {
if (m_apoChildren.size() == 1 &&
m_apoChildren[0]->m_field_type == CQL2_STRING) {
const std::string &val = m_apoChildren[0]->m_osVal;
// Reject anything that isn't a valid RFC 3339 timestamp/date
if (val.find_first_of("`'\"\\") != std::string::npos) {
errorMsg = "Invalid characters in " + m_osVal + "() argument";
break;
}
return std::string("`").append(val).append("`");
} else {
errorMsg = "Unhandled syntax for function ";
errorMsg += m_osVal;
}
} else {
errorMsg = "Unhandled function ";
errorMsg += m_osVal;
}
break;
}
case CQL2_ADD:
return ReturnBinaryOp("+");
case CQL2_SUBTRACT:
return ReturnBinaryOp("-");
case CQL2_MULTIPLY:
return ReturnBinaryOp("*");
case CQL2_DIV:
return ReturnBinaryOp("/");
case CQL2_MOD:
return ReturnBinaryOp("%");
case CQL2_NONE:
case CQL2_ARGUMENT_LIST:
assert(false);
break;
}
}
}
return std::string();
}
You can’t perform that action at this time.