mirrors/mongodb
mirrors/mongodb
0
0
Fork 0
mirror of https://github.com/mongodb/mongo.git synced 2024-11-30 00:56:44 +01:00
Code Issues Releases Activity

better diagnostics for large keys

Browse Source
This commit is contained in:
Eliot Horowitz 2009-11-10 13:49:15 -05:00
parent 8af511ef9b
commit c47308b1b4
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
db/btree.cpp
View File

@ -782,7 +782,7 @@ found:
const BSONObj& key, const BSONObj &order, bool dupsAllowed, const BSONObj& key, const BSONObj &order, bool dupsAllowed,
DiskLoc lChild, DiskLoc rChild, IndexDetails& idx) { DiskLoc lChild, DiskLoc rChild, IndexDetails& idx) {
if ( key.objsize() > KeyMax ) { if ( key.objsize() > KeyMax ) {
problem() << "ERROR: key too large len:" << key.objsize() << " max:" << KeyMax << ' ' << idx.indexNamespace() << endl; problem() << "ERROR: key too large len:" << key.objsize() << " max:" << KeyMax << ' ' << key.objsize() << ' ' << idx.indexNamespace() << endl;
return 2; return 2;
} }
assert( key.objsize() > 0 ); assert( key.objsize() > 0 );
@ -848,7 +848,7 @@ found:
{ {
if ( toplevel ) { if ( toplevel ) {
if ( key.objsize() > KeyMax ) { if ( key.objsize() > KeyMax ) {
problem() << "Btree::insert: key too large to index, skipping " << idx.indexNamespace().c_str() << ' ' << key.toString() << '\n'; problem() << "Btree::insert: key too large to index, skipping " << idx.indexNamespace().c_str() << ' ' << key.objsize() << ' ' << key.toString() << '\n';
return 3; return 3;
} }
} }
@ -949,7 +949,7 @@ namespace mongo {
if ( ! b->_pushBack(loc, key, order, DiskLoc()) ){ if ( ! b->_pushBack(loc, key, order, DiskLoc()) ){
// no room // no room
if ( key.objsize() > KeyMax ) { if ( key.objsize() > KeyMax ) {
problem() << "Btree::insert: key too large to index, skipping " << idx.indexNamespace().c_str() << ' ' << key.toString() << '\n'; problem() << "Btree::insert: key too large to index, skipping " << idx.indexNamespace().c_str() << ' ' << key.objsize() << ' ' << key.toString() << '\n';
} }
else { else {
// bucket was full // bucket was full