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
|
// @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 "namespace.h"
namespace mongo {
inline Namespace& Namespace::operator=(const char *ns) {
// we fill the remaining space with all zeroes here. as the full Namespace struct is in
// the datafiles (the .ns files specifically), that is helpful as then they are deterministic
// in the bytes they have for a given sequence of operations. that makes testing and debugging
// the data files easier.
//
// if profiling indicates this method is a significant bottleneck, we could have a version we
// use for reads which does not fill with zeroes, and keep the zeroing behavior on writes.
//
unsigned len = strlen(ns);
uassert( 10080 , "ns name too long, max size is 128", len < MaxNsLen);
memset(buf, 0, MaxNsLen);
memcpy(buf, ns, len);
return *this;
}
inline string Namespace::extraName(int i) const {
char ex[] = "$extra";
ex[5] += i;
string s = string(buf) + ex;
massert( 10348 , "$extra: ns name too long", s.size() < MaxNsLen);
return s;
}
inline bool Namespace::isExtra() const {
const char *p = strstr(buf, "$extr");
return p && p[5] && p[6] == 0; //==0 important in case an index uses name "$extra_1" for example
}
inline int Namespace::hash() const {
unsigned x = 0;
const char *p = buf;
while ( *p ) {
x = x * 131 + *p;
p++;
}
return (x & 0x7fffffff) | 0x8000000; // must be > 0
}
/* future : this doesn't need to be an inline. */
inline string Namespace::getSisterNS( const char * local ) const {
assert( local && local[0] != '.' );
string old(buf);
if ( old.find( "." ) != string::npos )
old = old.substr( 0 , old.find( "." ) );
return old + "." + local;
}
inline IndexDetails& NamespaceDetails::idx(int idxNo, bool missingExpected ) {
if( idxNo < NIndexesBase )
return _indexes[idxNo];
Extra *e = extra();
if ( ! e ) {
if ( missingExpected )
throw MsgAssertionException( 13283 , "Missing Extra" );
massert(13282, "missing Extra", e);
}
int i = idxNo - NIndexesBase;
if( i >= NIndexesExtra ) {
e = e->next(this);
if ( ! e ) {
if ( missingExpected )
throw MsgAssertionException( 13283 , "missing extra" );
massert(13283, "missing Extra", e);
}
i -= NIndexesExtra;
}
return e->details[i];
}
inline int NamespaceDetails::idxNo(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) {
IndexIterator i = ii();
while( i.more() ) {
if( i.next().keyPattern() == keyPattern )
return i.pos()-1;
}
return -1;
}
// @return offset in indexes[]
inline int NamespaceDetails::findIndexByName(const char *name) {
IndexIterator i = ii();
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) {
d = _d;
i = 0;
n = d->nIndexes;
}
}
|
