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
|
// @file namespace-inl.h
/**
* Copyright (C) 2009 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/>.
*/
#pragma once
#include "mongo/db/namespace_details.h"
namespace mongo {
inline IndexDetails& NamespaceDetails::idx(int idxNo, bool missingExpected ) {
if( idxNo < NIndexesBase ) {
IndexDetails& id = _indexes[idxNo];
return id;
}
Extra *e = extra();
if ( ! e ) {
if ( missingExpected )
throw MsgAssertionException( 13283 , "Missing Extra" );
massert(14045, "missing Extra", e);
}
int i = idxNo - NIndexesBase;
if( i >= NIndexesExtra ) {
e = e->next(this);
if ( ! e ) {
if ( missingExpected )
throw MsgAssertionException( 14823 , "missing extra" );
massert(14824, "missing Extra", e);
}
i -= NIndexesExtra;
}
return e->details[i];
}
inline int NamespaceDetails::idxNo(const IndexDetails& idx) {
IndexIterator i = ii();
while( i.more() ) {
if( &i.next() == &idx )
return i.pos()-1;
}
massert( 10349 , "E12000 idxNo fails", false);
return -1;
}
inline int NamespaceDetails::findIndexByKeyPattern(const BSONObj& keyPattern,
bool includeBackgroundInProgress) {
IndexIterator i = ii(includeBackgroundInProgress);
while( i.more() ) {
if( i.next().keyPattern() == keyPattern )
return i.pos()-1;
}
return -1;
}
inline const IndexDetails* NamespaceDetails::findIndexByPrefix( const BSONObj &keyPattern ,
bool requireSingleKey ) {
const IndexDetails* bestMultiKeyIndex = NULL;
IndexIterator i = ii();
while( i.more() ) {
const IndexDetails& currentIndex = i.next();
if( keyPattern.isPrefixOf( currentIndex.keyPattern() ) ){
if( ! isMultikey( i.pos()-1 ) ){
return ¤tIndex;
} else {
bestMultiKeyIndex = ¤tIndex;
}
}
}
return requireSingleKey ? NULL : bestMultiKeyIndex;
}
// @return offset in indexes[]
inline int NamespaceDetails::findIndexByName(const char *name,
bool includeBackgroundInProgress) {
IndexIterator i = ii(includeBackgroundInProgress);
while( i.more() ) {
if ( strcmp(i.next().info.obj().getStringField("name"),name) == 0 )
return i.pos()-1;
}
return -1;
}
inline NamespaceDetails::IndexIterator::IndexIterator(NamespaceDetails *_d,
bool includeBackgroundInProgress) {
d = _d;
i = 0;
n = includeBackgroundInProgress ? d->getTotalIndexCount() : d->nIndexes;
}
}
|
