2
* Copyright (C) 2012 10gen Inc.
4
* This program is free software: you can redistribute it and/or modify
5
* it under the terms of the GNU Affero General Public License, version 3,
6
* as published by the Free Software Foundation.
8
* This program is distributed in the hope that it will be useful,
9
* but WITHOUT ANY WARRANTY; without even the implied warranty of
10
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11
* GNU Affero General Public License for more details.
13
* You should have received a copy of the GNU Affero General Public License
14
* along with this program. If not, see <http://www.gnu.org/licenses/>.
17
#include "mongo/db/btreeposition.h"
19
#include "mongo/db/btree.h"
20
#include "mongo/db/index.h"
21
#include "mongo/db/pdfile.h"
25
std::ostream& operator<<( std::ostream& stream, const BtreeKeyLocation& loc ) {
26
return stream << BSON( "bucket" << loc.bucket.toString() <<
27
"index" << loc.pos ).jsonString();
30
LogicalBtreePosition::LogicalBtreePosition( const IndexDetails& indexDetails,
32
const BtreeKeyLocation& initialLocation ) :
33
_indexDetails( &indexDetails ),
34
_ordering( ordering ),
35
_initialLocation( initialLocation ),
36
_initialLocationValid() {
37
fassert( 16494, _indexDetails->version() == 1 );
40
void LogicalBtreePosition::init() {
41
if ( _initialLocation.bucket.isNull() ) {
42
// Abort if the initial location is not a valid bucket.
46
// Store the key and record referenced at the supplied initial location.
47
BucketBasics<V1>::KeyNode keyNode =
48
_initialLocation.bucket.btree<V1>()->keyNode( _initialLocation.pos );
49
_key = keyNode.key.toBson().getOwned();
50
_record = keyNode.recordLoc;
51
_initialLocationValid = true;
54
BtreeKeyLocation LogicalBtreePosition::currentLocation() const {
55
if ( _initialLocation.bucket.isNull() ) {
56
// Abort if the initial location is not a valid bucket.
57
return BtreeKeyLocation();
60
// If the initial location has not been invalidated ...
61
if ( _initialLocationValid ) {
63
const BtreeBucket<V1>* bucket = _initialLocation.bucket.btree<V1>();
64
if ( // ... and the bucket was not marked as invalid ...
65
bucket->getN() != bucket->INVALID_N_SENTINEL &&
66
// ... and the initial location index is valid for the bucket ...
67
_initialLocation.pos < bucket->getN() ) {
69
BucketBasics<V1>::KeyNode keyNode = bucket->keyNode( _initialLocation.pos );
70
if ( // ... and the record location equals the initial record location ...
71
keyNode.recordLoc == _record &&
72
// ... and the key equals the initial key ...
73
keyNode.key.toBson().binaryEqual( _key ) ) {
74
// ... then the initial location is the current location, so return it.
75
return _initialLocation;
80
// Relocate the key and record location retrieved from _initialLocation.
83
ret.bucket = _indexDetails->head.btree<V1>()->locate( *_indexDetails,
90
1 // Forward direction means the next
91
// ordered key will be returned if
92
// the requested key is missing.