Question on readdir implementation

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



Hi all,

I'm reading EXT4 codes and has some questions about readdir
implementation.

Why traverse the directory in hash order? This brings lots of code to
build and traverse a red-black tree. Why not just plainly traverse the
directory's blocks?

Since the red-black tree is built every time a NFS readdir request comes
in, in case of hash collision, the nfs client may receive duplicate dir
entries if the buffer is not large enough to return all entries with the
same hash value in once.

Thanks.

-- 
Zhang Huan
--
To unsubscribe from this list: send the line "unsubscribe linux-ext4" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at  http://vger.kernel.org/majordomo-info.html

[Index of Archives]     [Reiser Filesystem Development]     [Ceph FS]     [Kernel Newbies]     [Security]     [Netfilter]     [Bugtraq]     [Linux FS]     [Yosemite National Park]     [MIPS Linux]     [ARM Linux]     [Linux Security]     [Linux RAID]     [Samba]     [Device Mapper]     [Linux Media]

  Powered by Linux