Based on kdave for-next As heuristic skeleton already merged Populate heuristic with basic code that: 1. Collect sample from input data 2. Calculate byte set for sample For detect easily compressible data 3. Calculate byte core set size For detect easily and not compressible data Timofey Titovets (3): Btrfs: heuristic add simple sampling logic Btrfs: heuristic add byte set calculation Btrfs: heuristic add byte core set calculation fs/btrfs/compression.c | 111 ++++++++++++++++++++++++++++++++++++++++++++++++- fs/btrfs/compression.h | 14 +++++++ 2 files changed, 123 insertions(+), 2 deletions(-) -- 2.13.3 -- 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
