Project

General

Profile

Submit #2765

[PATCH] sys/vfs/hammer: make btree_search() climb up btree slightly faster

Added by tkusumi over 2 years ago. Updated over 2 years ago.

Status:
Closed
Priority:
Normal
Assignee:
Category:
VFS subsystem
Target version:
Start date:
01/11/2015
Due date:
% Done:

100%


Description

This cleanup patch lets cursor climb up deep/fat btree slightly faster (lightweight), if not slower.

The local variable enospc won't be anything other than 0 at this point thus (&& enospc == 0) isn't necessary here. Also node type checking is redundant as they both use btree_node_is_full(). There used to be btree_node_is_almost_full() and internal/leaf needed to be separated by if/else but not anymore.

Associated revisions

Revision a9fd59b8 (diff)
Added by tkusumi over 2 years ago

sys/vfs/hammer: make btree_search() climb up btree slightly faster

- This cleanup patch lets cursor climb up deep/fat btree slightly faster
(lightweight), if not slower.
- Remove a duplicate check that traces back to a moment where there was
btree_node_is_almost_full() and the differentiation was needed.

Closes: #2765

Revision 978531ec (diff)
Added by tkusumi over 2 years ago

sys/vfs/hammer: make btree_search() climb up btree slightly faster

- This cleanup patch lets cursor climb up deep/fat btree slightly faster
(lightweight), if not slower.
- Remove a duplicate check that traces back to a moment where there was
btree_node_is_almost_full() and the differentiation was needed.

Closes: #2765

History

#1 Updated by tuxillo over 2 years ago

  • Assignee set to tuxillo
  • Target version set to 4.2.x

#2 Updated by tkusumi over 2 years ago

  • Status changed from New to Closed
  • % Done changed from 0 to 100

Also available in: Atom PDF