Make hard link detection scale better

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>

1 files changed, 7 insertions, 1 deletions

diff --git a/lib/common/perror.c b/lib/common/perror.c
index c7dab08..53a8c16 100644
--- a/lib/common/perror.c
+++ b/lib/common/perror.c
@@ -69,5 +69,11 @@ void sqfs_perror(const char *file, const char *action, int error_code)
 		break;
 	}
 
-	fprintf(stderr, "%s: %s: %s.\n", file, action, errstr);
+	if (file != NULL)
+		fprintf(stderr, "%s: ", file);
+
+	if (action != NULL)
+		fprintf(stderr, "%s: ", action);
+
+	fprintf(stderr, "%s.\n", errstr);
 }