Aren/haiku
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

* Fixed warnings when compiled with DEBUG=1.

Browse Source 
git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@33550 a95241bf-73f2-0310-859d-f6bbb57e9c96
This commit is contained in:
Axel Dörfler 2009-10-12 14:33:22 +00:00
parent 8e13fac960
commit 265694bb1f
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp
View File

@ -2203,7 +2203,7 @@ TreeIterator::Dump()
__out("TreeIterator at %p:\n", this);
__out("\tfTree = %p\n", fTree);
__out("\tfCurrentNodeOffset = %Ld\n", fCurrentNodeOffset);
__out("\tfCurrentKey = %ld\n", fCurrentKey);
__out("\tfCurrentKey = %d\n", (int)fCurrentKey);
__out("\tfDuplicateNode = %Ld (%Ld, 0x%Lx)\n",
bplustree_node::FragmentOffset(fDuplicateNode), fDuplicateNode,
fDuplicateNode);
@ -2304,12 +2304,12 @@ bplustree_node::CheckIntegrity(uint32 nodeSize) const
if (key + length + sizeof(off_t) + sizeof(uint16)
> (uint8*)this + nodeSize
|| length > BPLUSTREE_MAX_KEY_LENGTH) {
dprintf("node %p, key %ld\n", this, i);
dprintf("node %p, key %d\n", this, (int)i);
DEBUGGER(("invalid node: keys corrupted"));
return B_BAD_DATA;
}
if (Values()[i] == -1) {
dprintf("node %p, value %ld: %Ld\n", this, i, Values()[i]);
dprintf("node %p, value %d: %lld\n", this, (int)i, Values()[i]);
DEBUGGER(("invalid node: values corrupted"));
return B_BAD_DATA;
}