i2p/haiku-beta6
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

* Minor cleanup.

Browse Source 
git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@27627 a95241bf-73f2-0310-859d-f6bbb57e9c96
This commit is contained in:
Axel Dörfler
2008-09-18 16:04:28 +00:00
parent e9a105668d
commit 6126236e8a
1 changed files with 20 additions and 21 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
+1 -2
View File
@@ -473,7 +473,7 @@ BPlusTree::SetTo(Inode* stream)
fNodeSize = fHeader->NodeSize(); fNodeSize = fHeader->NodeSize();
{ // validity check
uint32 toMode[] = {S_STR_INDEX, S_INT_INDEX, S_UINT_INDEX, uint32 toMode[] = {S_STR_INDEX, S_INT_INDEX, S_UINT_INDEX,
S_LONG_LONG_INDEX, S_ULONG_LONG_INDEX, S_FLOAT_INDEX, S_LONG_LONG_INDEX, S_ULONG_LONG_INDEX, S_FLOAT_INDEX,
S_DOUBLE_INDEX}; S_DOUBLE_INDEX};
@@ -495,7 +495,6 @@ BPlusTree::SetTo(Inode* stream)
// in the original BFS code - we will honour it nevertheless // in the original BFS code - we will honour it nevertheless
fAllowDuplicates = stream->IsIndex() fAllowDuplicates = stream->IsIndex()
|| (stream->Mode() & S_ALLOW_DUPS) != 0; || (stream->Mode() & S_ALLOW_DUPS) != 0;
}
CachedNode cached(this, fHeader->RootNode()); CachedNode cached(this, fHeader->RootNode());
RETURN_ERROR(fStatus = cached.Node() ? B_OK : B_BAD_DATA); RETURN_ERROR(fStatus = cached.Node() ? B_OK : B_BAD_DATA);