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
|
/**
* Copyright (C) 2013 10gen 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::kIndex
#include "mongo/platform/basic.h"
#include "mongo/db/index/btree_based_bulk_access_method.h"
#include "mongo/db/curop.h"
#include "mongo/db/operation_context.h"
#include "mongo/db/storage_options.h"
#include "mongo/util/log.h"
#include "mongo/util/progress_meter.h"
namespace mongo {
//
// Comparison for external sorter interface
//
// Defined in db/structure/btree/key.cpp
// XXX TODO: rename to something more descriptive, etc. etc.
int oldCompare(const BSONObj& l,const BSONObj& r, const Ordering &o);
class BtreeExternalSortComparison {
public:
BtreeExternalSortComparison(const BSONObj& ordering, int version)
: _ordering(Ordering::make(ordering)),
_version(version) {
invariant(version == 1 || version == 0);
}
typedef std::pair<BSONObj, RecordId> Data;
int operator() (const Data& l, const Data& r) const {
int x = (_version == 1
? l.first.woCompare(r.first, _ordering, /*considerfieldname*/false)
: oldCompare(l.first, r.first, _ordering));
if (x) { return x; }
return l.second.compare(r.second);
}
private:
const Ordering _ordering;
const int _version;
};
BtreeBasedBulkAccessMethod::BtreeBasedBulkAccessMethod(OperationContext* txn,
BtreeBasedAccessMethod* real,
SortedDataInterface* interface,
const IndexDescriptor* descriptor) {
_real = real;
_interface = interface;
_txn = txn;
_docsInserted = 0;
_keysInserted = 0;
_isMultiKey = false;
_sorter.reset(BSONObjExternalSorter::make(
SortOptions().TempDir(storageGlobalParams.dbpath + "/_tmp")
.ExtSortAllowed()
.MaxMemoryUsageBytes(100*1024*1024),
BtreeExternalSortComparison(descriptor->keyPattern(), descriptor->version())));
}
Status BtreeBasedBulkAccessMethod::insert(OperationContext* txn,
const BSONObj& obj,
const RecordId& loc,
const InsertDeleteOptions& options,
int64_t* numInserted) {
BSONObjSet keys;
_real->getKeys(obj, &keys);
_isMultiKey = _isMultiKey || (keys.size() > 1);
for (BSONObjSet::iterator it = keys.begin(); it != keys.end(); ++it) {
// False is for mayInterrupt.
_sorter->add(*it, loc);
_keysInserted++;
}
_docsInserted++;
if (NULL != numInserted) {
*numInserted += keys.size();
}
return Status::OK();
}
Status BtreeBasedBulkAccessMethod::commit(set<RecordId>* dupsToDrop,
bool mayInterrupt,
bool dupsAllowed) {
Timer timer;
scoped_ptr<BSONObjExternalSorter::Iterator> i(_sorter->done());
// verifies that pm and op refer to the same ProgressMeter
ProgressMeter& pm = _txn->getCurOp()->setMessage("Index Bulk Build: (2/3) btree bottom up",
"Index: (2/3) BTree Bottom Up Progress",
_keysInserted,
10);
scoped_ptr<SortedDataBuilderInterface> builder;
{
WriteUnitOfWork wunit(_txn);
if (_isMultiKey) {
_real->_btreeState->setMultikey( _txn );
}
builder.reset(_interface->getBulkBuilder(_txn, dupsAllowed));
wunit.commit();
}
while (i->more()) {
if (mayInterrupt) {
_txn->checkForInterrupt();
}
WriteUnitOfWork wunit(_txn);
// Get the next datum and add it to the builder.
BSONObjExternalSorter::Data d = i->next();
Status status = builder->addKey(d.first, d.second);
if (!status.isOK()) {
if (ErrorCodes::DuplicateKey != status.code()) {
return status;
}
invariant(!dupsAllowed); // shouldn't be getting DupKey errors if dupsAllowed.
// If we're here it's a duplicate key.
if (dupsToDrop) {
dupsToDrop->insert(d.second);
continue;
}
return status;
}
// If we're here either it's a dup and we're cool with it or the addKey went just
// fine.
pm.hit();
wunit.commit();
}
pm.finished();
_txn->getCurOp()->setMessage("Index Bulk Build: (3/3) btree-middle",
"Index: (3/3) BTree Middle Progress");
LOG(timer.seconds() > 10 ? 0 : 1 ) << "\t done building bottom layer, going to commit";
builder->commit(mayInterrupt);
return Status::OK();
}
} // namespace mongo
#include "mongo/db/sorter/sorter.cpp"
MONGO_CREATE_SORTER(mongo::BSONObj, mongo::RecordId, mongo::BtreeExternalSortComparison);
|
