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

btrfs: Make SearchSlot() look cleaner

Browse Source
This commit is contained in:
hyche
2018-01-14 15:02:20 +00:00
committed by waddlesplash
parent cedb0e1179
commit b568492fbd
1 changed files with 6 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/add-ons/kernel/file_systems/btrfs/BTree.cpp
+6 -10
View File
@@ -125,19 +125,15 @@ BTree::Node::SearchSlot(const btrfs_key& key, int* slot, btree_traversing type)
// m-1 m m+1 // m-1 m m+1
// k : comp < 0 // k : comp < 0
// k : comp > 0 // k : comp > 0
if (type == BTREE_BACKWARD) { if (type == BTREE_BACKWARD && comp < 0)
*slot = mid - 1; mid--;
if (comp > 0) else if (type == BTREE_FORWARD && comp > 0)
*slot = mid; mid++;
} else if (type == BTREE_FORWARD) {
*slot = mid;
if (comp > 0)
*slot = mid + 1;
}
if (type == BTREE_EXACT || *slot < 0) if (type == BTREE_EXACT || mid < 0)
return B_ENTRY_NOT_FOUND; return B_ENTRY_NOT_FOUND;
*slot = mid;
TRACE("SearchSlot() found slot %" B_PRId32 " comp %" B_PRId32 "\n", TRACE("SearchSlot() found slot %" B_PRId32 " comp %" B_PRId32 "\n",
*slot, comp); *slot, comp);
return B_OK; return B_OK;