You may have covered this but its not explicit. Could you write few lines on whats wrong with the current TREE SEARCH and how V2 is helping. Thanks, Anand On 01/27/2014 09:28 PM, Gerhard Heift wrote:
This patch series adds a new ioctl TREE_SEARCH_V2 with which we could store the results in a varying buffer. Now even items larger than 3992 bytes or a large amount of items can be returned. I have a few questions: Which value should I assign to TREE_SEARCH_V2? Should we limit the buffer size? What about documentation? Changelog RFCv2 * fixed a build bug caused by using a wrong patch * added a patch to expand buffer lifetime Gerhard -- To unsubscribe from this list: send the line "unsubscribe linux-btrfs" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html
-- To unsubscribe from this list: send the line "unsubscribe linux-btrfs" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html
