From aa194141c430622e49fda0ef6bf8c3b08e245a0a Mon Sep 17 00:00:00 2001 From: anujbillore-0-0 Date: Tue, 10 Mar 2026 13:32:21 +0530 Subject: [PATCH] btrfs: Clarify why Traverse() is not used in PreviousLeaf() PreviousLeaf() navigates by tree structure rather than key value, making Traverse() unsuitable here. Add a comment to explain this instead of leaving an open TODO question. Change-Id: Icd93d483bea5d5dab939abbef1f9f628238041ed Reviewed-on: https://review.haiku-os.org/c/haiku/+/10458 Reviewed-by: Adrien Destugues Haiku-Format: Haiku-format Bot Tested-by: Commit checker robot --- src/add-ons/kernel/file_systems/btrfs/BTree.cpp | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/src/add-ons/kernel/file_systems/btrfs/BTree.cpp b/src/add-ons/kernel/file_systems/btrfs/BTree.cpp index d21c830eb5..86c3737922 100644 --- a/src/add-ons/kernel/file_systems/btrfs/BTree.cpp +++ b/src/add-ons/kernel/file_systems/btrfs/BTree.cpp @@ -760,7 +760,8 @@ BTree::RemoveEntries(Transaction& transaction, Path* path, status_t BTree::PreviousLeaf(Path* path) const { - // TODO: use Traverse() ??? + // Traverse() is not used here because it searches by key value, + // while leaf navigation only requires following tree structure. int level = 0; int slot; Node* node = NULL;