This version of lessfs comes with a large number of changes and improvements.
- Lessfs now returns -ENOSPC by default when it runs out of space.
- Lessfs will now try to reuse deleted data chunks aggressively when it reaches MIN_SPACE_FREE – 3%.
- Lessfs uses a pool of threads to compress and write the data. Previously the threads would work on the incoming data queue without sorting the data. This would lead to data being written in random order to the blockdata file. Now the data is sorted so that less seeks are required when the data is accessed.
- When compiled to used BerkeleyDB lessfs now uses HASH databases for inuse and fileblock instead of BTREE databases. (Sorry). Again this increases performance with large data sets.