A new set of tools and libraries for working with SquashFS images https://git.infraroot.at/squashfs-tools-ng.git/atom?h=v1.2.0 2022-11-22T13:45:32+00:00 2022-11-22T13:45:32+00:00 David Oberhollenzer david.oberhollenzer@sigma-star.at 2022-11-22T13:45:32+00:00 urn:sha1:168ef9be32ad754d7bcb38ed70787237fc12630d The "from dir" and from "from file" code, as well as the "sort file" code is specific to gensquashfs, so move them there and the test cases as well. The medium term idea is to reduce libfstree to a stub, merge it into the generic writer and ultimately hoist that into libsquashfs. Signed-off-by: David Oberhollenzer <david.oberhollenzer@sigma-star.at> 2022-11-17T23:58:13+00:00 David Oberhollenzer david.oberhollenzer@sigma-star.at 2022-11-17T23:57:01+00:00 urn:sha1:844fdd42f03a633f1dbce5d90b2ecf44698cf8b0 Similar to the hex blob decoder, we need this once for tar and once for the filemap xattr parser. Simply add a single, central implementation to libutil, with a simple unit test, and then use it in both libtar and gensquashfs. Signed-off-by: David Oberhollenzer <david.oberhollenzer@sigma-star.at> 2022-11-17T23:58:07+00:00 David Oberhollenzer david.oberhollenzer@sigma-star.at 2022-11-16T14:41:57+00:00 urn:sha1:da6eadc840716eb29b0175f39b2790bba166db4a Since we need it twice (once for tar, once for the filemap xattr parser), add a single, central implementation to libutil, add a unit test for that implementation and then use it in both libtar and gensquashfs. Signed-off-by: David Oberhollenzer <david.oberhollenzer@sigma-star.at> 2022-09-20T06:47:02+00:00 David Oberhollenzer david.oberhollenzer@sigma-star.at 2022-09-18T14:04:24+00:00 urn:sha1:56edfefb9718f72bd45093e0efd76bd88645fa89 Slightly modify the byte-for-byte comparison function to compare an arbitrary range in a file and move it to libutil. Instead of calling it for each block in the block writer, simply let it check an entire range in the block writer and compute the range position/size of the reference ahead, before looking for potential matches. Signed-off-by: David Oberhollenzer <david.oberhollenzer@sigma-star.at> 2022-07-08T17:17:35+00:00 David Oberhollenzer david.oberhollenzer@sigma-star.at 2022-07-05T13:50:09+00:00 urn:sha1:62753ec36958c40f151fa223605aea5e6a50bd89 Signed-off-by: David Oberhollenzer <david.oberhollenzer@sigma-star.at> 2022-07-08T17:17:35+00:00 David Oberhollenzer david.oberhollenzer@sigma-star.at 2022-07-05T13:41:41+00:00 urn:sha1:a412425bca4bb90a7c1b35acac6b185158f3cd4f Signed-off-by: David Oberhollenzer <david.oberhollenzer@sigma-star.at> 2022-07-08T17:17:35+00:00 David Oberhollenzer david.oberhollenzer@sigma-star.at 2022-07-05T13:34:08+00:00 urn:sha1:d6e2106e96b6969e045251d972e1adcceb9728df Signed-off-by: David Oberhollenzer <david.oberhollenzer@sigma-star.at> 2022-07-08T17:17:35+00:00 David Oberhollenzer david.oberhollenzer@sigma-star.at 2022-07-05T10:16:36+00:00 urn:sha1:75063b2e14dacc13fcbeeba24e580198a7c1c638 Test against various invariants: - Every non-root node must have a name - The root node muts not have a name - The name must not be ".." or "." - The name must not contain '/' - The loop that chases parent pointers must terminate, i.e. we must never reach the starting state again (link loop). Furthermore, make sure the sum of all path components plus separators does not overflow. Signed-off-by: David Oberhollenzer <david.oberhollenzer@sigma-star.at> 2022-07-08T17:17:35+00:00 David Oberhollenzer david.oberhollenzer@sigma-star.at 2022-07-04T18:01:59+00:00 urn:sha1:3946cf086183f8dd4d5d115f52ba1b87560b7ce4 Signed-off-by: David Oberhollenzer <david.oberhollenzer@sigma-star.at> 2022-07-08T17:17:35+00:00 David Oberhollenzer david.oberhollenzer@sigma-star.at 2022-07-02T19:14:45+00:00 urn:sha1:8c0aa2504199036eaaa09673ea93dcdcd79606ef After trying removing many instances of `struct stat`, there is only one user of inode_stat left, so move the function there. Signed-off-by: David Oberhollenzer <david.oberhollenzer@sigma-star.at>