diff options
author | Alberto Lerner <alerner@10gen.com> | 2010-11-22 08:28:27 -0500 |
---|---|---|
committer | Alberto Lerner <alerner@10gen.com> | 2010-11-22 08:28:38 -0500 |
commit | ab7fa6504ce5ff9b3b4ad47f13a1f9aaf2598d3a (patch) | |
tree | a91f5b0115448801edefa59e6d096a91950aa594 /s/d_split.cpp | |
parent | a47cae76249e2a2f679a853782d6988d99793471 (diff) | |
download | mongo-ab7fa6504ce5ff9b3b4ad47f13a1f9aaf2598d3a.tar.gz |
log command start
Diffstat (limited to 's/d_split.cpp')
-rw-r--r-- | s/d_split.cpp | 9 |
1 files changed, 5 insertions, 4 deletions
diff --git a/s/d_split.cpp b/s/d_split.cpp index 77275718858..dad8cb7eedd 100644 --- a/s/d_split.cpp +++ b/s/d_split.cpp @@ -238,14 +238,15 @@ namespace mongo { return true; } + log() << "request split points lookup for chunk " << ns << " " << min << " -->> " << max << endl; + // We'll use the average object size and number of object to find approximately how many keys // each chunk should have. We'll split at half the maxChunkSize or maxChunkObjects, if // provided. const long long avgRecSize = dataSize / recCount; long long keyCount = maxChunkSize / (2 * avgRecSize); if ( maxChunkObjects && ( maxChunkObjects < keyCount ) ) { - log() << "limiting split vector to " << maxChunkObjects << " (from " << keyCount << ") objects for chunk " - << ns << " " << min << "-->>" << max << endl; + log() << "limiting split vector to " << maxChunkObjects << " (from " << keyCount << ") objects " << endl; keyCount = maxChunkObjects; } @@ -295,8 +296,8 @@ namespace mongo { // Stop if we have enough split points. if ( maxSplitPoints && ( numChunks >= maxSplitPoints ) ){ - log(1) << "max number of requested split points reached (" << numChunks - << ") before the end of chunk " << ns << " " << min << "-->>" << max + log() << "max number of requested split points reached (" << numChunks + << ") before the end of chunk " << ns << " " << min << " -->> " << max << endl; break; } |