X-Git-Url: https://git.verplant.org/?a=blobdiff_plain;f=fsck-cache.c;h=c35acaa82c93824f952327e12727d0c92edc5bd7;hb=d6d3f9d0125a7215f3cdc2600b2307ca55b69536;hp=81fd25a10050fd60d6f901191c9cc9e5cdb4f3d6;hpb=20222118ae4cbd0a7ba91a7012574cd2f91101ec;p=git.git

diff --git a/fsck-cache.c b/fsck-cache.c
index 81fd25a1..c35acaa8 100644
--- a/fsck-cache.c
+++ b/fsck-cache.c
@@ -4,33 +4,81 @@
 #include <dirent.h>
 
 /*
- * These three functions should build up a graph in memory about
+ * These two functions should build up a graph in memory about
  * what objects we've referenced, and found, and types..
  *
  * Right now we don't do that kind of reachability checking. Yet.
  */
-static void fsck_tree(void *data, unsigned long size)
+static void mark_needs_sha1(unsigned char *parent, const char * type, unsigned char *child)
 {
 }
 
-static void fsck_commit(void *data, unsigned long size)
+static int mark_sha1_seen(unsigned char *sha1, char *tag)
 {
+	return 0;
 }
 
-static int mark_sha1_seen(unsigned char *sha1, char *tag)
+static int fsck_tree(unsigned char *sha1, void *data, unsigned long size)
+{
+	int warn_old_tree = 1;
+
+	while (size) {
+		int len = 1+strlen(data);
+		unsigned char *file_sha1 = data + len;
+		char *path = strchr(data, ' ');
+		unsigned int mode;
+		if (size < len + 20 || !path || sscanf(data, "%o", &mode) != 1)
+			return -1;
+
+		/* Warn about trees that don't do the recursive thing.. */
+		if (warn_old_tree && strchr(path, '/')) {
+			fprintf(stderr, "warning: fsck-cache: tree %s has full pathnames in it\n", sha1_to_hex(sha1));
+			warn_old_tree = 0;
+		}
+
+		data += len + 20;
+		size -= len + 20;
+		mark_needs_sha1(sha1, S_ISDIR(mode) ? "tree" : "blob", file_sha1);
+	}
+	return 0;
+}
+
+static int fsck_commit(unsigned char *sha1, void *data, unsigned long size)
 {
+	int parents;
+	unsigned char tree_sha1[20];
+	unsigned char parent_sha1[20];
+
+	if (memcmp(data, "tree ", 5))
+		return -1;
+	if (get_sha1_hex(data + 5, tree_sha1) < 0)
+		return -1;
+	mark_needs_sha1(sha1, "tree", tree_sha1);
+	data += 5 + 40 + 1;	/* "tree " + <hex sha1> + '\n' */
+	parents = 0;
+	while (!memcmp(data, "parent ", 7)) {
+		if (get_sha1_hex(data + 7, parent_sha1) < 0)
+			return -1;
+		mark_needs_sha1(sha1, "commit", parent_sha1);
+		data += 7 + 40 + 1; 	/* "parent " + <hex sha1> + '\n' */
+		parents++;
+	}
+	if (!parents)
+		printf("root: %s\n", sha1_to_hex(sha1));
 	return 0;
 }
 
 static int fsck_entry(unsigned char *sha1, char *tag, void *data, unsigned long size)
 {
-	if (!strcmp(tag, "blob")) 
+	if (!strcmp(tag, "blob")) {
 		/* Nothing to check */;
-	else if (!strcmp(tag, "tree"))
-		fsck_tree(data, size);
-	else if (!strcmp(tag, "commit"))
-		fsck_commit(data, size);
-	else
+	} else if (!strcmp(tag, "tree")) {
+		if (fsck_tree(sha1, data, size) < 0)
+			return -1;
+	} else if (!strcmp(tag, "commit")) {
+		if (fsck_commit(sha1, data, size) < 0)
+			return -1;
+	} else
 		return -1;
 	return mark_sha1_seen(sha1, tag);
 }