tree.c 3.99 KB
Newer Older
1 2 3 4 5 6 7
#include "tree.h"
#include "blob.h"
#include "cache.h"
#include <stdlib.h>

const char *tree_type = "tree";

8 9 10 11
static int read_one_entry(unsigned char *sha1, const char *base, int baselen, const char *pathname, unsigned mode, int stage)
{
	int len = strlen(pathname);
	unsigned int size = cache_entry_size(baselen + len);
12
	struct cache_entry *ce = xmalloc(size);
13 14 15 16 17 18 19 20

	memset(ce, 0, size);

	ce->ce_mode = create_ce_mode(mode);
	ce->ce_flags = create_ce_flags(baselen + len, stage);
	memcpy(ce->name, base, baselen);
	memcpy(ce->name + baselen, pathname, len+1);
	memcpy(ce->sha1, sha1, 20);
21
	return add_cache_entry(ce, ADD_CACHE_OK_TO_ADD|ADD_CACHE_SKIP_DFCHECK);
22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41
}

static int read_tree_recursive(void *buffer, unsigned long size,
			       const char *base, int baselen, int stage)
{
	while (size) {
		int len = strlen(buffer)+1;
		unsigned char *sha1 = buffer + len;
		char *path = strchr(buffer, ' ')+1;
		unsigned int mode;

		if (size < len + 20 || sscanf(buffer, "%o", &mode) != 1)
			return -1;

		buffer = sha1 + 20;
		size -= len + 20;

		if (S_ISDIR(mode)) {
			int retval;
			int pathlen = strlen(path);
42
			char *newbase;
43 44 45 46 47
			void *eltbuf;
			char elttype[20];
			unsigned long eltsize;

			eltbuf = read_sha1_file(sha1, elttype, &eltsize);
48 49
			if (!eltbuf || strcmp(elttype, "tree")) {
				if (eltbuf) free(eltbuf);
50
				return -1;
51 52
			}
			newbase = xmalloc(baselen + 1 + pathlen);
53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75
			memcpy(newbase, base, baselen);
			memcpy(newbase + baselen, path, pathlen);
			newbase[baselen + pathlen] = '/';
			retval = read_tree_recursive(eltbuf, eltsize,
						     newbase,
						     baselen + pathlen + 1, stage);
			free(eltbuf);
			free(newbase);
			if (retval)
				return -1;
			continue;
		}
		if (read_one_entry(sha1, base, baselen, path, mode, stage) < 0)
			return -1;
	}
	return 0;
}

int read_tree(void *buffer, unsigned long size, int stage)
{
	return read_tree_recursive(buffer, size, "", 0, stage);
}

76
struct tree *lookup_tree(const unsigned char *sha1)
77 78 79
{
	struct object *obj = lookup_object(sha1);
	if (!obj) {
80
		struct tree *ret = xmalloc(sizeof(struct tree));
81 82
		memset(ret, 0, sizeof(struct tree));
		created_object(sha1, &ret->object);
83
		ret->object.type = tree_type;
84 85
		return ret;
	}
Nicolas Pitre's avatar
Nicolas Pitre committed
86 87
	if (!obj->type)
		obj->type = tree_type;
88
	if (obj->type != tree_type) {
89 90 91 92 93 94 95
		error("Object %s is a %s, not a tree", 
		      sha1_to_hex(sha1), obj->type);
		return NULL;
	}
	return (struct tree *) obj;
}

96
int parse_tree_buffer(struct tree *item, void *buffer, unsigned long size)
97
{
98
	void *bufptr = buffer;
99
	struct tree_entry_list **list_p;
100

101 102 103
	if (item->object.parsed)
		return 0;
	item->object.parsed = 1;
104
	list_p = &item->entries;
105 106
	while (size) {
		struct object *obj;
107
		struct tree_entry_list *entry;
108 109 110 111 112
		int len = 1+strlen(bufptr);
		unsigned char *file_sha1 = bufptr + len;
		char *path = strchr(bufptr, ' ');
		unsigned int mode;
		if (size < len + 20 || !path || 
113
		    sscanf(bufptr, "%o", &mode) != 1)
114 115
			return -1;

116
		entry = xmalloc(sizeof(struct tree_entry_list));
117
		entry->name = strdup(path + 1);
118 119 120 121
		entry->directory = S_ISDIR(mode) != 0;
		entry->executable = (mode & S_IXUSR) != 0;
		entry->symlink = S_ISLNK(mode) != 0;
		entry->mode = mode;
122 123
		entry->next = NULL;

124 125 126
		bufptr += len + 20;
		size -= len + 20;

127 128 129
		if (entry->directory) {
			entry->item.tree = lookup_tree(file_sha1);
			obj = &entry->item.tree->object;
130
		} else {
131 132
			entry->item.blob = lookup_blob(file_sha1);
			obj = &entry->item.blob->object;
133
		}
134 135
		if (obj)
			add_ref(&item->object, obj);
136
		entry->parent = NULL; /* needs to be filled by the user */
137 138
		*list_p = entry;
		list_p = &entry->next;
139 140 141
	}
	return 0;
}
142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164

int parse_tree(struct tree *item)
{
	 char type[20];
	 void *buffer;
	 unsigned long size;
	 int ret;

	if (item->object.parsed)
		return 0;
	buffer = read_sha1_file(item->object.sha1, type, &size);
	if (!buffer)
		return error("Could not read %s",
			     sha1_to_hex(item->object.sha1));
	if (strcmp(type, tree_type)) {
		free(buffer);
		return error("Object %s not a tree",
			     sha1_to_hex(item->object.sha1));
	}
	ret = parse_tree_buffer(item, buffer, size);
	free(buffer);
	return ret;
}