News: 0001497030

  ARM Give a man a fire and he's warm for a day, but set fire to him and he's warm for the rest of his life (Terry Pratchett, Jingo)

NTFS Driver Lands Some Late Feature Enhancements For Linux 6.12

([Linux Storage] 3 Hours Ago NTFS3 Driver)


While the [1]Linux 6.12 merge window has been closed for more than one week, the modern NTFS "NTFS3" driver has seen some late feature enhancements as well as some fixes merged today for this new kernel version.

Konstantin Komarov of Paragon Software who continues to manage this modern NTFS read/write kernel driver for Linux sent out a merge request today with various enhancements and fixes. Among the changes are improved compression support and optimizing large writes to sparse files.

This NTFS driver didn't see any Git pull requests back during the Linux 6.12 merge window and so I was curious if Linus Torvalds would end up pulling this late feature code for the current cycle... He did. But it did lead him to [2]comment :

"The bulk of this *really* should have come in during the merge window.

I've pulled it (.. because ntfs3), but still,"

So now [3]merged for Linux 6.12 with this NTFS3 driver is support for fallocate for compressed files, support for the NTFS compression attribute, and optimizing large writes to sparse files. The optimized large writes into sparse files is done by optimizing cluster allocation by allocating a large chunk in advance of writing rather than allocating during the writing process by clusters. Among the fixes are for potential deadlocks, various internal bugs, and other changes.



[1] https://www.phoronix.com/search/Linux+6.12

[2] https://lore.kernel.org/lkml/172841237676.640621.11629920171530544260.pr-tracker-bot@kernel.org/T/#m9b92ddc3a07e1c7d1033c08bce5da07b1acbb721

[3] https://git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git/commit/?id=5b7c893ed5ed0fc1cbe28c0e3296a6fb45698486



NotMine999

avis

alexenv

Lemma: All horses are the same color.
Proof (by induction):
Case n = 1: In a set with only one horse, it is obvious that all
horses in that set are the same color.
Case n = k: Suppose you have a set of k+1 horses. Pull one of these
horses out of the set, so that you have k horses. Suppose that all
of these horses are the same color. Now put back the horse that you
took out, and pull out a different one. Suppose that all of the k
horses now in the set are the same color. Then the set of k+1 horses
are all the same color. We have k true => k+1 true; therefore all
horses are the same color.
Theorem: All horses have an infinite number of legs.
Proof (by intimidation):
Everyone would agree that all horses have an even number of legs. It
is also well-known that horses have forelegs in front and two legs in
back. 4 + 2 = 6 legs, which is certainly an odd number of legs for a
horse to have! Now the only number that is both even and odd is
infinity; therefore all horses have an infinite number of legs.
However, suppose that there is a horse somewhere that does not have an
infinite number of legs. Well, that would be a horse of a different
color; and by the Lemma, it doesn't exist.