Age | Commit message (Collapse) | Author | |
---|---|---|---|
2020-02-22 | Make hard link detection scale better | David Oberhollenzer | |
Instead of doing a linear search, which scales quadratically, use a red-black tree with inode numbers as key for finding hard links. To reiterate: we can't just use a flat table, because the SquashFS file is potentially untrusted and the inode numbers can be anything, no matter what the super block says. Signed-off-by: David Oberhollenzer <david.oberhollenzer@sigma-star.at> | |||
2020-01-26 | Fix memory leak in hard link detection code | David Oberhollenzer | |
Signed-off-by: David Oberhollenzer <david.oberhollenzer@sigma-star.at> | |||
2019-12-23 | Add simple sqfs_tree_node_t hardlink detection to libcommon | David Oberhollenzer | |
Signed-off-by: David Oberhollenzer <david.oberhollenzer@sigma-star.at> |