blob: e7d5e2079590fa152445f24b3dd1f03583f5ae7c (
plain)
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
|
/**
* Copyright (C) 2014 MongoDB Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License, version 3,
* as published by the Free Software Foundation.
*
* 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 Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* 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 GNU Affero General 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/platform/basic.h"
#include "mongo/db/query/query_planner_common.h"
#include "mongo/util/assert_util.h"
#include "mongo/util/log.h"
namespace mongo {
void QueryPlannerCommon::reverseScans(QuerySolutionNode* node) {
StageType type = node->getType();
if (STAGE_IXSCAN == type) {
IndexScanNode* isn = static_cast<IndexScanNode*>(node);
isn->direction *= -1;
if (isn->bounds.isSimpleRange) {
std::swap(isn->bounds.startKey, isn->bounds.endKey);
// XXX: Not having a startKeyInclusive means that if we reverse a max/min query
// we have different results with and without the reverse...
isn->bounds.endKeyInclusive = true;
}
else {
for (size_t i = 0; i < isn->bounds.fields.size(); ++i) {
std::vector<Interval>& iv = isn->bounds.fields[i].intervals;
// Step 1: reverse the list.
std::reverse(iv.begin(), iv.end());
// Step 2: reverse each interval.
for (size_t j = 0; j < iv.size(); ++j) {
iv[j].reverse();
}
}
}
if (!isn->bounds.isValidFor(isn->indexKeyPattern, isn->direction)) {
LOG(5) << "Invalid bounds: " << isn->bounds.toString() << std::endl;
invariant(0);
}
// TODO: we can just negate every value in the already computed properties.
isn->computeProperties();
}
else if (STAGE_SORT_MERGE == type) {
// reverse direction of comparison for merge
MergeSortNode* msn = static_cast<MergeSortNode*>(node);
msn->sort = reverseSortObj(msn->sort);
}
else {
invariant(STAGE_SORT != type);
// This shouldn't be here...
}
for (size_t i = 0; i < node->children.size(); ++i) {
reverseScans(node->children[i]);
}
}
} // namespace mongo
|
