-
Notifications
You must be signed in to change notification settings - Fork 5.6k
/
index_bounds_builder.cpp
1218 lines (1065 loc) · 47.9 KB
/
index_bounds_builder.cpp
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
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/**
* Copyright (C) 2018-present MongoDB, Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the Server Side Public License, version 1,
* as published by MongoDB, Inc.
*
* 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
* Server Side Public License for more details.
*
* You should have received a copy of the Server Side Public License
* along with this program. If not, see
* <http://www.mongodb.com/licensing/server-side-public-license>.
*
* As a special exception, the copyright holders give permission to link the
* code of portions of this program with the OpenSSL library under certain
* conditions as described in each individual source file and distribute
* linked combinations including the program with the OpenSSL library. You
* must comply with the Server Side Public License in all respects for
* all of the code used other than as permitted herein. If you modify file(s)
* with this exception, you may extend this exception to your version of the
* file(s), but you are not obligated to do so. If you do not wish to do so,
* delete this exception statement from your version. If you delete this
* exception statement from all source files in the program, then also delete
* it in the license file.
*/
#define MONGO_LOG_DEFAULT_COMPONENT ::mongo::logger::LogComponent::kQuery
#include "mongo/db/query/index_bounds_builder.h"
#include <cmath>
#include <limits>
#include "mongo/base/string_data.h"
#include "mongo/db/geo/geoconstants.h"
#include "mongo/db/geo/s2.h"
#include "mongo/db/index/expression_params.h"
#include "mongo/db/index/s2_common.h"
#include "mongo/db/matcher/expression_geo.h"
#include "mongo/db/matcher/expression_internal_expr_eq.h"
#include "mongo/db/query/collation/collation_index_key.h"
#include "mongo/db/query/collation/collator_interface.h"
#include "mongo/db/query/expression_index.h"
#include "mongo/db/query/expression_index_knobs_gen.h"
#include "mongo/db/query/indexability.h"
#include "mongo/db/query/planner_ixselect.h"
#include "mongo/db/query/planner_wildcard_helpers.h"
#include "mongo/db/query/query_knobs_gen.h"
#include "mongo/util/log.h"
#include "mongo/util/str.h"
#include "third_party/s2/s2cell.h"
#include "third_party/s2/s2regioncoverer.h"
namespace mongo {
namespace {
namespace wcp = ::mongo::wildcard_planning;
// Helper for checking that an OIL "appears" to be ascending given one interval.
void assertOILIsAscendingLocally(const vector<Interval>& intervals, size_t idx) {
// Each individual interval being examined should be ascending or none.
const auto dir = intervals[idx].getDirection();
// Should be either ascending, or have no direction (be a point/null/empty interval).
invariant(dir == Interval::Direction::kDirectionAscending ||
dir == Interval::Direction::kDirectionNone);
// The previous OIL's end value should be <= the next OIL's start value.
if (idx > 0) {
// Pass 'false' to avoid comparing the field names.
const int res = intervals[idx - 1].end.woCompare(intervals[idx].start, false);
invariant(res <= 0);
}
}
// Tightness rules are shared for $lt, $lte, $gt, $gte.
IndexBoundsBuilder::BoundsTightness getInequalityPredicateTightness(const Interval& interval,
const BSONElement& dataElt,
const IndexEntry& index) {
if (interval.isNull()) {
// Any time the bounds are empty, we consider them to be exact.
return IndexBoundsBuilder::EXACT;
}
return Indexability::isExactBoundsGenerating(dataElt) ? IndexBoundsBuilder::EXACT
: IndexBoundsBuilder::INEXACT_FETCH;
}
/**
* Returns true if 'str' contains a non-escaped pipe character '|' on a best-effort basis. This
* function reports no false negatives, but will return false positives. For example, a pipe
* character inside of a character class or the \Q...\E escape sequence has no special meaning but
* may still be reported by this function as being non-escaped.
*/
bool stringMayHaveUnescapedPipe(StringData str) {
if (str.size() > 0 && str[0] == '|') {
return true;
}
if (str.size() > 1 && str[1] == '|' && str[0] != '\\') {
return true;
}
for (size_t i = 2U; i < str.size(); ++i) {
auto probe = str[i];
auto prev = str[i - 1];
auto tail = str[i - 2];
// We consider the pipe to have a special meaning if it is not preceded by a backslash, or
// preceded by a backslash that is itself escaped.
if (probe == '|' && (prev != '\\' || (prev == '\\' && tail == '\\'))) {
return true;
}
}
return false;
}
const BSONObj kUndefinedElementObj = BSON("" << BSONUndefined);
const BSONObj kNullElementObj = BSON("" << BSONNULL);
const Interval kHashedUndefinedInterval = IndexBoundsBuilder::makePointInterval(
ExpressionMapping::hash(kUndefinedElementObj.firstElement()));
const Interval kHashedNullInterval =
IndexBoundsBuilder::makePointInterval(ExpressionMapping::hash(kNullElementObj.firstElement()));
void makeNullEqualityBounds(const IndexEntry& index,
bool isHashed,
OrderedIntervalList* oil,
IndexBoundsBuilder::BoundsTightness* tightnessOut) {
// An equality to null predicate cannot be covered because the index does not distinguish
// between the lack of a value and the literal value null.
*tightnessOut = IndexBoundsBuilder::INEXACT_FETCH;
// There are two values that could possibly be equal to null in an index: undefined and null.
oil->intervals.push_back(isHashed
? kHashedUndefinedInterval
: IndexBoundsBuilder::makePointInterval(kUndefinedElementObj));
oil->intervals.push_back(isHashed ? kHashedNullInterval
: IndexBoundsBuilder::makePointInterval(kNullElementObj));
// Just to be sure, make sure the bounds are in the right order if the hash values are opposite.
IndexBoundsBuilder::unionize(oil);
}
bool isEqualityOrInNull(MatchExpression* me) {
// Because of type-bracketing, {$gte: null} and {$lte: null} are equivalent to {$eq: null}.
if (MatchExpression::EQ == me->matchType() || MatchExpression::GTE == me->matchType() ||
MatchExpression::LTE == me->matchType()) {
return static_cast<ComparisonMatchExpression*>(me)->getData().type() == BSONType::jstNULL;
}
if (me->matchType() == MatchExpression::MATCH_IN) {
const InMatchExpression* in = static_cast<const InMatchExpression*>(me);
return in->hasNull();
}
return false;
}
} // namespace
string IndexBoundsBuilder::simpleRegex(const char* regex,
const char* flags,
const IndexEntry& index,
BoundsTightness* tightnessOut) {
if (index.collator) {
// Bounds building for simple regular expressions assumes that the index is in ASCII order,
// which is not necessarily true for an index with a collator. Therefore, a regex can never
// use tight bounds if the index has a non-null collator. In this case, the regex must be
// applied to the fetched document rather than the index key, so the tightness is
// INEXACT_FETCH.
*tightnessOut = IndexBoundsBuilder::INEXACT_FETCH;
return "";
}
*tightnessOut = IndexBoundsBuilder::INEXACT_COVERED;
bool multilineOK;
if (regex[0] == '\\' && regex[1] == 'A') {
multilineOK = true;
regex += 2;
} else if (regex[0] == '^') {
multilineOK = false;
regex += 1;
} else {
return "";
}
// A regex with an unescaped pipe character is not considered a simple regex.
if (stringMayHaveUnescapedPipe(StringData(regex))) {
return "";
}
bool extended = false;
while (*flags) {
switch (*(flags++)) {
case 'm':
// Multiline mode.
if (multilineOK)
continue;
else
return "";
case 's':
// Single-line mode specified. This just changes the behavior of the '.'
// character to match every character instead of every character except '\n'.
continue;
case 'x':
// Extended free-spacing mode.
extended = true;
break;
default:
// Cannot use the index.
return "";
}
}
str::stream ss;
string r = "";
while (*regex) {
char c = *(regex++);
if (c == '*' || c == '?') {
// These are the only two symbols that make the last char optional
r = ss;
r = r.substr(0, r.size() - 1);
return r; // breaking here fails with /^a?/
} else if (c == '\\') {
c = *(regex++);
if (c == 'Q') {
// \Q...\E quotes everything inside
while (*regex) {
c = (*regex++);
if (c == '\\' && (*regex == 'E')) {
regex++; // skip the 'E'
break; // go back to start of outer loop
} else {
ss << c; // character should match itself
}
}
} else if ((c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z') || (c >= '0' && c <= '9') ||
(c == '\0')) {
// don't know what to do with these
r = ss;
break;
} else {
// slash followed by non-alphanumeric represents the following char
ss << c;
}
} else if (strchr("^$.[()+{", c)) {
// list of "metacharacters" from man pcrepattern
r = ss;
break;
} else if (extended && c == '#') {
// comment
r = ss;
break;
} else if (extended && isspace(c)) {
continue;
} else {
// self-matching char
ss << c;
}
}
if (r.empty() && *regex == 0) {
r = ss;
*tightnessOut = r.empty() ? IndexBoundsBuilder::INEXACT_COVERED : IndexBoundsBuilder::EXACT;
}
return r;
}
// static
void IndexBoundsBuilder::allValuesForField(const BSONElement& elt, OrderedIntervalList* out) {
// ARGH, BSONValue would make this shorter.
BSONObjBuilder bob;
bob.appendMinKey("");
bob.appendMaxKey("");
out->name = elt.fieldName();
out->intervals.push_back(
makeRangeInterval(bob.obj(), BoundInclusion::kIncludeBothStartAndEndKeys));
}
Interval IndexBoundsBuilder::allValuesRespectingInclusion(BoundInclusion bi) {
BSONObjBuilder bob;
bob.appendMinKey("");
bob.appendMaxKey("");
return makeRangeInterval(bob.obj(), bi);
}
Interval IndexBoundsBuilder::allValues() {
BSONObjBuilder bob;
bob.appendMinKey("");
bob.appendMaxKey("");
return makeRangeInterval(bob.obj(), BoundInclusion::kIncludeBothStartAndEndKeys);
}
bool IntervalComparison(const Interval& lhs, const Interval& rhs) {
int wo = lhs.start.woCompare(rhs.start, false);
if (0 != wo) {
return wo < 0;
}
// The start and end are equal.
// Strict weak requires irreflexivity which implies that equivalence returns false.
if (lhs.startInclusive == rhs.startInclusive) {
return false;
}
// Put the bound that's inclusive to the left.
return lhs.startInclusive;
}
// static
void IndexBoundsBuilder::translateAndIntersect(const MatchExpression* expr,
const BSONElement& elt,
const IndexEntry& index,
OrderedIntervalList* oilOut,
BoundsTightness* tightnessOut) {
OrderedIntervalList arg;
translate(expr, elt, index, &arg, tightnessOut);
// translate outputs arg in sorted order. intersectize assumes that its arguments are
// sorted.
intersectize(arg, oilOut);
}
// static
void IndexBoundsBuilder::translateAndUnion(const MatchExpression* expr,
const BSONElement& elt,
const IndexEntry& index,
OrderedIntervalList* oilOut,
BoundsTightness* tightnessOut) {
OrderedIntervalList arg;
translate(expr, elt, index, &arg, tightnessOut);
// Append the new intervals to oilOut.
oilOut->intervals.insert(oilOut->intervals.end(), arg.intervals.begin(), arg.intervals.end());
// Union the appended intervals with the existing ones.
unionize(oilOut);
}
bool typeMatch(const BSONObj& obj) {
BSONObjIterator it(obj);
verify(it.more());
BSONElement first = it.next();
verify(it.more());
BSONElement second = it.next();
return first.canonicalType() == second.canonicalType();
}
bool IndexBoundsBuilder::canUseCoveredMatching(const MatchExpression* expr,
const IndexEntry& index) {
IndexBoundsBuilder::BoundsTightness tightness;
OrderedIntervalList oil;
translate(expr, BSONElement{}, index, &oil, &tightness);
return tightness >= IndexBoundsBuilder::INEXACT_COVERED;
}
// static
void IndexBoundsBuilder::translate(const MatchExpression* expr,
const BSONElement& elt,
const IndexEntry& index,
OrderedIntervalList* oilOut,
BoundsTightness* tightnessOut) {
// Fill out the bounds and tightness appropriate for the given predicate.
_translatePredicate(expr, elt, index, oilOut, tightnessOut);
// Under certain circumstances, queries on a $** index require that the bounds' tightness be
// adjusted regardless of the predicate. Having filled out the initial bounds, we apply any
// necessary changes to the tightness here.
if (index.type == IndexType::INDEX_WILDCARD) {
*tightnessOut = wcp::translateWildcardIndexBoundsAndTightness(index, *tightnessOut, oilOut);
}
}
void IndexBoundsBuilder::_translatePredicate(const MatchExpression* expr,
const BSONElement& elt,
const IndexEntry& index,
OrderedIntervalList* oilOut,
BoundsTightness* tightnessOut) {
// We expect that the OIL we are constructing starts out empty.
invariant(oilOut->intervals.empty());
oilOut->name = elt.fieldName();
bool isHashed = false;
if (elt.valueStringDataSafe() == "hashed") {
isHashed = true;
}
if (isHashed) {
invariant(MatchExpression::MATCH_IN == expr->matchType() ||
ComparisonMatchExpressionBase::isEquality(expr->matchType()));
}
if (MatchExpression::ELEM_MATCH_VALUE == expr->matchType()) {
OrderedIntervalList acc;
_translatePredicate(expr->getChild(0), elt, index, &acc, tightnessOut);
for (size_t i = 1; i < expr->numChildren(); ++i) {
OrderedIntervalList next;
BoundsTightness tightness;
_translatePredicate(expr->getChild(i), elt, index, &next, &tightness);
intersectize(next, &acc);
}
for (size_t i = 0; i < acc.intervals.size(); ++i) {
oilOut->intervals.push_back(acc.intervals[i]);
}
if (!oilOut->intervals.empty()) {
std::sort(oilOut->intervals.begin(), oilOut->intervals.end(), IntervalComparison);
}
// $elemMatch value requires an array.
// Scalars and directly nested objects are not matched with $elemMatch.
// We can't tell if a multi-key index key is derived from an array field.
// Therefore, a fetch is required.
*tightnessOut = IndexBoundsBuilder::INEXACT_FETCH;
} else if (MatchExpression::NOT == expr->matchType()) {
// A NOT is indexed by virtue of its child. If we're here then the NOT's child
// must be a kind of node for which we can index negations. It can't be things like
// $mod, $regex, or $type.
MatchExpression* child = expr->getChild(0);
// If we have a NOT -> EXISTS, we must handle separately.
if (MatchExpression::EXISTS == child->matchType()) {
// We should never try to use a sparse index for $exists:false.
invariant(!index.sparse);
BSONObjBuilder bob;
bob.appendNull("");
bob.appendNull("");
BSONObj dataObj = bob.obj();
oilOut->intervals.push_back(
makeRangeInterval(dataObj, BoundInclusion::kIncludeBothStartAndEndKeys));
*tightnessOut = IndexBoundsBuilder::INEXACT_FETCH;
return;
}
_translatePredicate(child, elt, index, oilOut, tightnessOut);
oilOut->complement();
// Until the index distinguishes between missing values and literal null values, we cannot
// build exact bounds for equality predicates on the literal value null. However, we _can_
// build exact bounds for the inverse, for example the query {a: {$ne: null}}.
if (isEqualityOrInNull(child)) {
*tightnessOut = IndexBoundsBuilder::EXACT;
}
// If this invariant would fail, we would otherwise return incorrect query results.
invariant(*tightnessOut == IndexBoundsBuilder::EXACT);
// If the index is multikey on this path, it doesn't matter what the tightness of the child
// is, we must return INEXACT_FETCH. Consider a multikey index on 'a' with document
// {a: [1, 2, 3]} and query {a: {$ne: 3}}. If we treated the bounds [MinKey, 3), (3, MaxKey]
// as exact, then we would erroneously return the document!
if (index.pathHasMultikeyComponent(elt.fieldNameStringData())) {
*tightnessOut = IndexBoundsBuilder::INEXACT_FETCH;
}
} else if (MatchExpression::EXISTS == expr->matchType()) {
oilOut->intervals.push_back(allValues());
// We only handle the {$exists:true} case, as {$exists:false}
// will have been translated to {$not:{ $exists:true }}.
//
// Documents with a missing value are stored *as if* they were
// explicitly given the value 'null'. Given:
// X = { b : 1 }
// Y = { a : null, b : 1 }
// X and Y look identical from within a standard index on { a : 1 }.
// HOWEVER a sparse index on { a : 1 } will treat X and Y differently,
// storing Y and not storing X.
//
// We can safely use an index in the following cases:
// {a:{ $exists:true }} - normal index helps, but we must still fetch
// {a:{ $exists:true }} - sparse index is exact
// {a:{ $exists:false }} - normal index requires a fetch
// {a:{ $exists:false }} - sparse indexes cannot be used at all.
//
// Noted in SERVER-12869, in case this ever changes some day.
if (index.sparse) {
// A sparse, compound index on { a:1, b:1 } will include entries
// for all of the following documents:
// { a:1 }, { b:1 }, { a:1, b:1 }
// So we must use INEXACT bounds in this case.
if (1 < index.keyPattern.nFields()) {
*tightnessOut = IndexBoundsBuilder::INEXACT_FETCH;
} else {
*tightnessOut = IndexBoundsBuilder::EXACT;
}
} else {
*tightnessOut = IndexBoundsBuilder::INEXACT_FETCH;
}
} else if (ComparisonMatchExpressionBase::isEquality(expr->matchType())) {
const auto* node = static_cast<const ComparisonMatchExpressionBase*>(expr);
// There is no need to sort intervals or merge overlapping intervals here since the output
// is from one element.
translateEquality(node->getData(), index, isHashed, oilOut, tightnessOut);
} else if (MatchExpression::LTE == expr->matchType()) {
const LTEMatchExpression* node = static_cast<const LTEMatchExpression*>(expr);
BSONElement dataElt = node->getData();
// Everything is <= MaxKey.
if (MaxKey == dataElt.type()) {
oilOut->intervals.push_back(allValues());
*tightnessOut =
index.collator ? IndexBoundsBuilder::INEXACT_FETCH : IndexBoundsBuilder::EXACT;
return;
}
// Only NaN is <= NaN.
if (std::isnan(dataElt.numberDouble())) {
double nan = dataElt.numberDouble();
oilOut->intervals.push_back(makePointInterval(nan));
*tightnessOut = IndexBoundsBuilder::EXACT;
return;
}
if (BSONType::jstNULL == dataElt.type()) {
// Because of type-bracketing, $lte null is equivalent to $eq null. An equality to null
// query is special. It should return both undefined and null values.
makeNullEqualityBounds(index, isHashed, oilOut, tightnessOut);
return;
}
BSONObjBuilder bob;
// Use -infinity for one-sided numerical bounds
if (dataElt.isNumber()) {
bob.appendNumber("", -std::numeric_limits<double>::infinity());
} else {
bob.appendMinForType("", dataElt.type());
}
CollationIndexKey::collationAwareIndexKeyAppend(dataElt, index.collator, &bob);
BSONObj dataObj = bob.obj();
verify(dataObj.isOwned());
const Interval interval = makeRangeInterval(
dataObj, IndexBounds::makeBoundInclusionFromBoundBools(typeMatch(dataObj), true));
oilOut->intervals.push_back(interval);
*tightnessOut = getInequalityPredicateTightness(interval, dataElt, index);
} else if (MatchExpression::LT == expr->matchType()) {
const LTMatchExpression* node = static_cast<const LTMatchExpression*>(expr);
BSONElement dataElt = node->getData();
// Everything is < MaxKey, except for MaxKey.
if (MaxKey == dataElt.type()) {
oilOut->intervals.push_back(allValuesRespectingInclusion(
IndexBounds::makeBoundInclusionFromBoundBools(true, false)));
*tightnessOut =
index.collator ? IndexBoundsBuilder::INEXACT_FETCH : IndexBoundsBuilder::EXACT;
return;
}
// Nothing is < NaN.
if (std::isnan(dataElt.numberDouble())) {
*tightnessOut = IndexBoundsBuilder::EXACT;
return;
}
BSONObjBuilder bob;
// Use -infinity for one-sided numerical bounds
if (dataElt.isNumber()) {
bob.appendNumber("", -std::numeric_limits<double>::infinity());
} else {
bob.appendMinForType("", dataElt.type());
}
CollationIndexKey::collationAwareIndexKeyAppend(dataElt, index.collator, &bob);
BSONObj dataObj = bob.obj();
verify(dataObj.isOwned());
Interval interval = makeRangeInterval(
dataObj, IndexBounds::makeBoundInclusionFromBoundBools(typeMatch(dataObj), false));
// If the operand to LT is equal to the lower bound X, the interval [X, X) is invalid
// and should not be added to the bounds.
if (!interval.isNull()) {
oilOut->intervals.push_back(interval);
}
*tightnessOut = getInequalityPredicateTightness(interval, dataElt, index);
} else if (MatchExpression::GT == expr->matchType()) {
const GTMatchExpression* node = static_cast<const GTMatchExpression*>(expr);
BSONElement dataElt = node->getData();
// Everything is > MinKey, except MinKey.
if (MinKey == dataElt.type()) {
oilOut->intervals.push_back(allValuesRespectingInclusion(
IndexBounds::makeBoundInclusionFromBoundBools(false, true)));
*tightnessOut =
index.collator ? IndexBoundsBuilder::INEXACT_FETCH : IndexBoundsBuilder::EXACT;
return;
}
// Nothing is > NaN.
if (std::isnan(dataElt.numberDouble())) {
*tightnessOut = IndexBoundsBuilder::EXACT;
return;
}
BSONObjBuilder bob;
CollationIndexKey::collationAwareIndexKeyAppend(dataElt, index.collator, &bob);
if (dataElt.isNumber()) {
bob.appendNumber("", std::numeric_limits<double>::infinity());
} else {
bob.appendMaxForType("", dataElt.type());
}
BSONObj dataObj = bob.obj();
verify(dataObj.isOwned());
Interval interval = makeRangeInterval(
dataObj, IndexBounds::makeBoundInclusionFromBoundBools(false, typeMatch(dataObj)));
// If the operand to GT is equal to the upper bound X, the interval (X, X] is invalid
// and should not be added to the bounds.
if (!interval.isNull()) {
oilOut->intervals.push_back(interval);
}
*tightnessOut = getInequalityPredicateTightness(interval, dataElt, index);
} else if (MatchExpression::GTE == expr->matchType()) {
const GTEMatchExpression* node = static_cast<const GTEMatchExpression*>(expr);
BSONElement dataElt = node->getData();
// Everything is >= MinKey.
if (MinKey == dataElt.type()) {
oilOut->intervals.push_back(allValues());
*tightnessOut =
index.collator ? IndexBoundsBuilder::INEXACT_FETCH : IndexBoundsBuilder::EXACT;
return;
}
// Only NaN is >= NaN.
if (std::isnan(dataElt.numberDouble())) {
double nan = dataElt.numberDouble();
oilOut->intervals.push_back(makePointInterval(nan));
*tightnessOut = IndexBoundsBuilder::EXACT;
return;
}
if (BSONType::jstNULL == dataElt.type()) {
// Because of type-bracketing, $lte null is equivalent to $eq null. An equality to null
// query is special. It should return both undefined and null values.
makeNullEqualityBounds(index, isHashed, oilOut, tightnessOut);
return;
}
BSONObjBuilder bob;
CollationIndexKey::collationAwareIndexKeyAppend(dataElt, index.collator, &bob);
if (dataElt.isNumber()) {
bob.appendNumber("", std::numeric_limits<double>::infinity());
} else {
bob.appendMaxForType("", dataElt.type());
}
BSONObj dataObj = bob.obj();
verify(dataObj.isOwned());
const Interval interval = makeRangeInterval(
dataObj, IndexBounds::makeBoundInclusionFromBoundBools(true, typeMatch(dataObj)));
oilOut->intervals.push_back(interval);
*tightnessOut = getInequalityPredicateTightness(interval, dataElt, index);
} else if (MatchExpression::REGEX == expr->matchType()) {
const RegexMatchExpression* rme = static_cast<const RegexMatchExpression*>(expr);
translateRegex(rme, index, oilOut, tightnessOut);
} else if (MatchExpression::MOD == expr->matchType()) {
BSONObjBuilder bob;
bob.appendMinForType("", NumberDouble);
bob.appendMaxForType("", NumberDouble);
BSONObj dataObj = bob.obj();
verify(dataObj.isOwned());
oilOut->intervals.push_back(
makeRangeInterval(dataObj, BoundInclusion::kIncludeBothStartAndEndKeys));
*tightnessOut = IndexBoundsBuilder::INEXACT_COVERED;
} else if (MatchExpression::TYPE_OPERATOR == expr->matchType()) {
const TypeMatchExpression* tme = static_cast<const TypeMatchExpression*>(expr);
if (tme->typeSet().hasType(BSONType::Array)) {
// We have $type:"array". Since arrays are indexed by creating a key for each element,
// we have to fetch all indexed documents and check whether the full document contains
// an array.
oilOut->intervals.push_back(allValues());
*tightnessOut = IndexBoundsBuilder::INEXACT_FETCH;
return;
}
// If we are matching all numbers, we just use the bounds for NumberInt, as these bounds
// also include all NumberDouble and NumberLong values.
if (tme->typeSet().allNumbers) {
BSONObjBuilder bob;
bob.appendMinForType("", BSONType::NumberInt);
bob.appendMaxForType("", BSONType::NumberInt);
oilOut->intervals.push_back(
makeRangeInterval(bob.obj(), BoundInclusion::kIncludeBothStartAndEndKeys));
}
for (auto type : tme->typeSet().bsonTypes) {
BSONObjBuilder bob;
bob.appendMinForType("", type);
bob.appendMaxForType("", type);
oilOut->intervals.push_back(
makeRangeInterval(bob.obj(), BoundInclusion::kIncludeBothStartAndEndKeys));
}
// If we're only matching the "number" type, then the bounds are exact. Otherwise, the
// bounds may be inexact.
*tightnessOut = (tme->typeSet().isSingleType() && tme->typeSet().allNumbers)
? IndexBoundsBuilder::EXACT
: IndexBoundsBuilder::INEXACT_FETCH;
// Sort the intervals, and merge redundant ones.
unionize(oilOut);
} else if (MatchExpression::MATCH_IN == expr->matchType()) {
const InMatchExpression* ime = static_cast<const InMatchExpression*>(expr);
*tightnessOut = IndexBoundsBuilder::EXACT;
// Create our various intervals.
IndexBoundsBuilder::BoundsTightness tightness;
bool arrayOrNullPresent = false;
for (auto&& equality : ime->getEqualities()) {
translateEquality(equality, index, isHashed, oilOut, &tightness);
// The ordering invariant of oil has been violated by the call to translateEquality.
arrayOrNullPresent = arrayOrNullPresent || equality.type() == BSONType::jstNULL ||
equality.type() == BSONType::Array;
if (tightness != IndexBoundsBuilder::EXACT) {
*tightnessOut = tightness;
}
}
for (auto&& regex : ime->getRegexes()) {
translateRegex(regex.get(), index, oilOut, &tightness);
if (tightness != IndexBoundsBuilder::EXACT) {
*tightnessOut = tightness;
}
}
if (ime->hasNull()) {
// A null index key does not always match a null query value so we must fetch the
// doc and run a full comparison. See SERVER-4529.
// TODO: Do we already set the tightnessOut by calling translateEquality?
*tightnessOut = INEXACT_FETCH;
}
if (ime->hasEmptyArray()) {
// Empty arrays are indexed as undefined.
BSONObjBuilder undefinedBob;
undefinedBob.appendUndefined("");
oilOut->intervals.push_back(makePointInterval(undefinedBob.obj()));
*tightnessOut = IndexBoundsBuilder::INEXACT_FETCH;
}
// Equalities are already sorted and deduped so unionize is unneccesary if no regexes
// are present. Hashed indexes may also cause the bounds to be out-of-order.
// Arrays and nulls introduce multiple elements that neccesitate a sort and deduping.
if (!ime->getRegexes().empty() || index.type == IndexType::INDEX_HASHED ||
arrayOrNullPresent)
unionize(oilOut);
} else if (MatchExpression::GEO == expr->matchType()) {
const GeoMatchExpression* gme = static_cast<const GeoMatchExpression*>(expr);
if ("2dsphere" == elt.valueStringDataSafe()) {
verify(gme->getGeoExpression().getGeometry().hasS2Region());
const S2Region& region = gme->getGeoExpression().getGeometry().getS2Region();
S2IndexingParams indexParams;
ExpressionParams::initialize2dsphereParams(index.infoObj, index.collator, &indexParams);
ExpressionMapping::cover2dsphere(region, indexParams, oilOut);
*tightnessOut = IndexBoundsBuilder::INEXACT_FETCH;
} else if ("2d" == elt.valueStringDataSafe()) {
verify(gme->getGeoExpression().getGeometry().hasR2Region());
const R2Region& region = gme->getGeoExpression().getGeometry().getR2Region();
ExpressionMapping::cover2d(
region, index.infoObj, gInternalGeoPredicateQuery2DMaxCoveringCells.load(), oilOut);
*tightnessOut = IndexBoundsBuilder::INEXACT_FETCH;
} else {
warning() << "Planner error trying to build geo bounds for " << elt.toString()
<< " index element.";
verify(0);
}
} else {
warning() << "Planner error, trying to build bounds for expression: "
<< redact(expr->debugString());
verify(0);
}
}
// static
Interval IndexBoundsBuilder::makeRangeInterval(const BSONObj& obj, BoundInclusion boundInclusion) {
Interval ret;
ret._intervalData = obj;
ret.startInclusive = IndexBounds::isStartIncludedInBound(boundInclusion);
ret.endInclusive = IndexBounds::isEndIncludedInBound(boundInclusion);
BSONObjIterator it(obj);
verify(it.more());
ret.start = it.next();
verify(it.more());
ret.end = it.next();
return ret;
}
// static
void IndexBoundsBuilder::intersectize(const OrderedIntervalList& oilA, OrderedIntervalList* oilB) {
invariant(oilB);
invariant(oilA.name == oilB->name);
size_t oilAIdx = 0;
const vector<Interval>& oilAIntervals = oilA.intervals;
size_t oilBIdx = 0;
vector<Interval>& oilBIntervals = oilB->intervals;
vector<Interval> result;
while (oilAIdx < oilAIntervals.size() && oilBIdx < oilBIntervals.size()) {
if (kDebugBuild) {
// Ensure that both OILs are ascending.
assertOILIsAscendingLocally(oilAIntervals, oilAIdx);
assertOILIsAscendingLocally(oilBIntervals, oilBIdx);
}
Interval::IntervalComparison cmp = oilAIntervals[oilAIdx].compare(oilBIntervals[oilBIdx]);
verify(Interval::INTERVAL_UNKNOWN != cmp);
if (cmp == Interval::INTERVAL_PRECEDES || cmp == Interval::INTERVAL_PRECEDES_COULD_UNION) {
// oilAIntervals is before oilBIntervals. move oilAIntervals forward.
++oilAIdx;
} else if (cmp == Interval::INTERVAL_SUCCEEDS) {
// oilBIntervals is before oilAIntervals. move oilBIntervals forward.
++oilBIdx;
} else {
Interval newInt = oilAIntervals[oilAIdx];
newInt.intersect(oilBIntervals[oilBIdx], cmp);
result.push_back(newInt);
if (Interval::INTERVAL_EQUALS == cmp) {
++oilAIdx;
++oilBIdx;
} else if (Interval::INTERVAL_WITHIN == cmp) {
++oilAIdx;
} else if (Interval::INTERVAL_CONTAINS == cmp) {
++oilBIdx;
} else if (Interval::INTERVAL_OVERLAPS_BEFORE == cmp) {
++oilAIdx;
} else if (Interval::INTERVAL_OVERLAPS_AFTER == cmp) {
++oilBIdx;
} else {
MONGO_UNREACHABLE;
}
}
}
oilB->intervals.swap(result);
}
// static
void IndexBoundsBuilder::unionize(OrderedIntervalList* oilOut) {
vector<Interval>& iv = oilOut->intervals;
// This can happen.
if (iv.empty()) {
return;
}
// Step 1: sort.
std::sort(iv.begin(), iv.end(), IntervalComparison);
// Step 2: Walk through and merge.
size_t i = 0;
while (i < iv.size() - 1) {
// Compare i with i + 1.
Interval::IntervalComparison cmp = iv[i].compare(iv[i + 1]);
// This means our sort didn't work.
verify(Interval::INTERVAL_SUCCEEDS != cmp);
// Intervals are correctly ordered.
if (Interval::INTERVAL_PRECEDES == cmp) {
// We can move to the next pair.
++i;
} else if (Interval::INTERVAL_EQUALS == cmp || Interval::INTERVAL_WITHIN == cmp) {
// Interval 'i' is equal to i+1, or is contained within i+1.
// Remove interval i and don't move to the next value of 'i'.
iv.erase(iv.begin() + i);
} else if (Interval::INTERVAL_CONTAINS == cmp) {
// Interval 'i' contains i+1, remove i+1 and don't move to the next value of 'i'.
iv.erase(iv.begin() + i + 1);
} else if (Interval::INTERVAL_OVERLAPS_BEFORE == cmp ||
Interval::INTERVAL_PRECEDES_COULD_UNION == cmp) {
// We want to merge intervals i and i+1.
// Interval 'i' starts before interval 'i+1'.
BSONObjBuilder bob;
bob.appendAs(iv[i].start, "");
bob.appendAs(iv[i + 1].end, "");
BSONObj data = bob.obj();
bool startInclusive = iv[i].startInclusive;
bool endInclusive = iv[i + 1].endInclusive;
iv.erase(iv.begin() + i);
// iv[i] is now the former iv[i + 1]
iv[i] = makeRangeInterval(
data, IndexBounds::makeBoundInclusionFromBoundBools(startInclusive, endInclusive));
// Don't increment 'i'.
}
}
}
// static
Interval IndexBoundsBuilder::makeRangeInterval(const string& start,
const string& end,
BoundInclusion boundInclusion) {
BSONObjBuilder bob;
bob.append("", start);
bob.append("", end);
return makeRangeInterval(bob.obj(), boundInclusion);
}
// static
Interval IndexBoundsBuilder::makePointInterval(const BSONObj& obj) {
Interval ret;
ret._intervalData = obj;
ret.startInclusive = ret.endInclusive = true;
ret.start = ret.end = obj.firstElement();
return ret;
}
// static
Interval IndexBoundsBuilder::makePointInterval(StringData str) {
BSONObjBuilder bob;
bob.append("", str);
return makePointInterval(bob.obj());
}
// static
Interval IndexBoundsBuilder::makePointInterval(double d) {
BSONObjBuilder bob;
bob.append("", d);
return makePointInterval(bob.obj());
}
// static
BSONObj IndexBoundsBuilder::objFromElement(const BSONElement& elt,
const CollatorInterface* collator) {
BSONObjBuilder bob;
CollationIndexKey::collationAwareIndexKeyAppend(elt, collator, &bob);
return bob.obj();
}
// static
void IndexBoundsBuilder::reverseInterval(Interval* ival) {
BSONElement tmp = ival->start;
ival->start = ival->end;
ival->end = tmp;
bool tmpInc = ival->startInclusive;
ival->startInclusive = ival->endInclusive;
ival->endInclusive = tmpInc;
}
// static
void IndexBoundsBuilder::translateRegex(const RegexMatchExpression* rme,
const IndexEntry& index,
OrderedIntervalList* oilOut,
BoundsTightness* tightnessOut) {
const string start =
simpleRegex(rme->getString().c_str(), rme->getFlags().c_str(), index, tightnessOut);
// Note that 'tightnessOut' is set by simpleRegex above.
if (!start.empty()) {
string end = start;
end[end.size() - 1]++;
oilOut->intervals.push_back(
makeRangeInterval(start, end, BoundInclusion::kIncludeStartKeyOnly));
} else {
BSONObjBuilder bob;
bob.appendMinForType("", String);
bob.appendMaxForType("", String);
BSONObj dataObj = bob.obj();
verify(dataObj.isOwned());
oilOut->intervals.push_back(
makeRangeInterval(dataObj, BoundInclusion::kIncludeStartKeyOnly));
}
// Regexes are after strings.
BSONObjBuilder bob;
bob.appendRegex("", rme->getString(), rme->getFlags());
oilOut->intervals.push_back(makePointInterval(bob.obj()));
}
// static
void IndexBoundsBuilder::translateEquality(const BSONElement& data,
const IndexEntry& index,
bool isHashed,
OrderedIntervalList* oil,
BoundsTightness* tightnessOut) {
if (BSONType::jstNULL == data.type()) {