summaryrefslogtreecommitdiff
path: root/src/mongo/db/storage/mmap_v1/record_store_v1_repair_iterator.cpp
blob: 728f07d60133a903f09c3631b8b8b78d5d8170f4 (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
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
/**
 *    Copyright (C) 2014 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::kStorage

#include "mongo/db/storage/mmap_v1/record_store_v1_repair_iterator.h"

#include "mongo/db/catalog/collection.h"
#include "mongo/db/storage/mmap_v1/extent.h"
#include "mongo/db/storage/mmap_v1/extent_manager.h"
#include "mongo/db/storage/mmap_v1/record_store_v1_simple.h"
#include "mongo/util/log.h"

namespace mongo {

using std::endl;

RecordStoreV1RepairCursor::RecordStoreV1RepairCursor(OperationContext* txn,
                                                     const RecordStoreV1Base* recordStore)
    : _txn(txn), _recordStore(recordStore), _stage(FORWARD_SCAN) {
    // Position the iterator at the first record
    //
    advance();
}

boost::optional<Record> RecordStoreV1RepairCursor::next() {
    if (_currRecord.isNull())
        return {};
    auto out = _currRecord.toRecordId();
    advance();
    return {{out, _recordStore->dataFor(_txn, out)}};
}

boost::optional<Record> RecordStoreV1RepairCursor::seekExact(const RecordId& id) {
    invariant(!"seekExact not supported");
}

void RecordStoreV1RepairCursor::advance() {
    const ExtentManager* em = _recordStore->_extentManager;

    while (true) {
        if (_currRecord.isNull()) {
            if (!_advanceToNextValidExtent()) {
                return;
            }

            _seenInCurrentExtent.clear();

            // Otherwise _advanceToNextValidExtent would have returned false
            //
            invariant(!_currExtent.isNull());

            const Extent* e = em->getExtent(_currExtent, false);
            _currRecord = (FORWARD_SCAN == _stage ? e->firstRecord : e->lastRecord);
        } else {
            switch (_stage) {
                case FORWARD_SCAN:
                    _currRecord = _recordStore->getNextRecordInExtent(_txn, _currRecord);
                    break;
                case BACKWARD_SCAN:
                    _currRecord = _recordStore->getPrevRecordInExtent(_txn, _currRecord);
                    break;
                default:
                    invariant(!"This should never be reached.");
                    break;
            }
        }

        if (_currRecord.isNull()) {
            continue;
        }

        // Validate the contents of the record's disk location and deduplicate
        //
        if (!_seenInCurrentExtent.insert(_currRecord).second) {
            error() << "infinite loop in extent, seen: " << _currRecord << " before" << endl;
            _currRecord = DiskLoc();
            continue;
        }

        if (_currRecord.getOfs() <= 0) {
            error() << "offset is 0 for record which should be impossible" << endl;
            _currRecord = DiskLoc();
            continue;
        }

        return;
    }
}

bool RecordStoreV1RepairCursor::_advanceToNextValidExtent() {
    const ExtentManager* em = _recordStore->_extentManager;

    while (true) {
        if (_currExtent.isNull()) {
            switch (_stage) {
                case FORWARD_SCAN:
                    _currExtent = _recordStore->details()->firstExtent(_txn);
                    break;
                case BACKWARD_SCAN:
                    _currExtent = _recordStore->details()->lastExtent(_txn);
                    break;
                default:
                    invariant(DONE == _stage);
                    return false;
            }
        } else {
            // If _currExtent is not NULL, then it must point to a valid extent, so no extra
            // checks here.
            //
            const Extent* e = em->getExtent(_currExtent, false);
            _currExtent = (FORWARD_SCAN == _stage ? e->xnext : e->xprev);
        }

        bool hasNextExtent = !_currExtent.isNull();

        // Sanity checks for the extent's disk location
        //
        if (hasNextExtent && (!_currExtent.isValid() || (_currExtent.getOfs() < 0))) {
            error() << "Invalid extent location: " << _currExtent << endl;

            // Switch the direction of scan
            //
            hasNextExtent = false;
        }

        if (hasNextExtent) {
            break;
        }

        // Swap the direction of scan and loop again
        //
        switch (_stage) {
            case FORWARD_SCAN:
                _stage = BACKWARD_SCAN;
                break;
            case BACKWARD_SCAN:
                _stage = DONE;
                break;
            default:
                invariant(!"This should never be reached.");
                break;
        }

        _currExtent = DiskLoc();
    }


    // Check _currExtent's contents for validity, but do not count is as failure if they
    // don't check out.
    //
    const Extent* e = em->getExtent(_currExtent, false);
    if (!e->isOk()) {
        warning() << "Extent not ok magic: " << e->magic << " going to try to continue" << endl;
    }

    log() << (FORWARD_SCAN == _stage ? "FORWARD" : "BACKWARD") << "  Extent loc: " << _currExtent
          << ", length: " << e->length << endl;

    return true;
}

void RecordStoreV1RepairCursor::invalidate(const RecordId& id) {
    // If we see this record again it probably means it was reinserted rather than an infinite
    // loop. If we do loop, we should quickly hit another seen record that hasn't been
    // invalidated.
    DiskLoc dl = DiskLoc::fromRecordId(id);
    _seenInCurrentExtent.erase(dl);

    if (_currRecord == dl) {
        // The DiskLoc being invalidated is also the one pointed at by this iterator. We
        // advance the iterator so it's not pointing at invalid data.
        advance();

        if (_currRecord == dl) {
            // Even after advancing the iterator, we're still pointing at the DiskLoc being
            // invalidated. This is expected when 'dl' is the last DiskLoc in the FORWARD scan,
            // and the initial call to getNext() moves the iterator to the first loc in the
            // BACKWARDS scan.
            advance();
        }

        invariant(_currRecord != dl);
    }
}

}  // namespace mongo