From f286afb8ee7c5b5ccef07660d82a7ff5e029a3b8 Mon Sep 17 00:00:00 2001 From: Yingxin Cheng Date: Wed, 3 Mar 2021 16:48:59 +0800 Subject: [PATCH] crimson/onode-staged-tree: remove implemented TODO Already implemented in c32c1032de1223169a1223d1b8995856e8763df5 Signed-off-by: Yingxin Cheng --- .../os/seastore/onode_manager/staged-fltree/node_layout.h | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/crimson/os/seastore/onode_manager/staged-fltree/node_layout.h b/src/crimson/os/seastore/onode_manager/staged-fltree/node_layout.h index aeb3735b27c..e66b3ef5c22 100644 --- a/src/crimson/os/seastore/onode_manager/staged-fltree/node_layout.h +++ b/src/crimson/os/seastore/onode_manager/staged-fltree/node_layout.h @@ -386,7 +386,7 @@ class NodeLayoutT final : public InternalNodeImpl, public LeafNodeImpl { * the estimated left_node_size <= target_split_size; * B. the fair one takes a further step to calculate the next slot of * P KiB, and if left_node_size + P/2 < target_split_size, compensate - * the split position to include the next slot; (TODO) + * the split position to include the next slot; * * Say that the node_block_size = N KiB, the largest allowed * insert_size = 1/I * N KiB (I > 1). We want to identify the minimal 'I'