lists  /  announce  owl-users  owl-dev  john-users  john-dev  passwdqc-users  yescrypt  popa3d-users  /  oss-security  kernel-hardening  musl  sabotage  tlsify  passwords  /  crypt-dev  xvendor  /  Bugtraq  Full-Disclosure  linux-kernel  linux-netdev  linux-ext4  linux-hardening  PHC 
Open Source and information security mailing list archives
Hash Suite: Windows password security audit tool. GUI, reports in PDF.
[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Date:   Tue, 7 May 2019 13:56:27 -0500
From:   Probir Roy <>
To:     "Theodore Ts'o" <>
Subject: Re: Locality of extent status tree traversal

> block number (e.g., the location on disk).  It's a cache; lookups are
> fast, and is an in-memory lookup.  Well, it's a little more than a
> cache, it also stores some information for delayed allocation buffered
> writes.

For sequential access, it will traverse almost the same path of the
tree. How deep the extent status tree be in general? If the tree is
much deeper, the sequential accesses would have many repeated nodes
traversal on the tree for the lookup. Have you observed significant
bottleneck on "ext4_es_lookup_extent"? Can it be removed by caching
the parent node?

Probir Roy

Powered by blists - more mailing lists