reading, in dir-item.c, the code in struct btrfs_dir_item *btrfs_match_dir_item_name (...) I am a little surprised to see an O(n) iterative name comparison check instead of something that would efficiently support directories with lots of items in them. Is this function a fall-back if a O(1) table lookup somewhere else misses, perhaps?
-- "In one instance, a rai being transported by canoe was accidentally dropped and sunk to the sea floor. Although it was never seen again, everyone agreed that the rai must still be there, so it continued to be transacted as genuine currency" -- Wikipedia -- To unsubscribe from this list: send the line "unsubscribe linux-btrfs" in the body of a message to majord...@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html
