tree.c 5.52 KB
Newer Older
1
#include "cache.h"
2 3
#include "tree.h"
#include "blob.h"
4 5
#include "commit.h"
#include "tag.h"
6 7 8 9
#include <stdlib.h>

const char *tree_type = "tree";

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

	if (S_ISDIR(mode))
		return READ_TREE_RECURSIVE;

	len = strlen(pathname);
	size = cache_entry_size(baselen + len);
21
	ce = xcalloc(1, size);
22 23 24 25 26 27

	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);
28
	return add_cache_entry(ce, ADD_CACHE_OK_TO_ADD|ADD_CACHE_SKIP_DFCHECK);
29 30
}

31
static int match_tree_entry(const char *base, int baselen, const char *path, unsigned int mode, const char **paths)
32
{
33
	const char *match;
34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68
	int pathlen;

	if (!paths)
		return 1;
	pathlen = strlen(path);
	while ((match = *paths++) != NULL) {
		int matchlen = strlen(match);

		if (baselen >= matchlen) {
			/* If it doesn't match, move along... */
			if (strncmp(base, match, matchlen))
				continue;
			/* The base is a subdirectory of a path which was specified. */
			return 1;
		}

		/* Does the base match? */
		if (strncmp(base, match, baselen))
			continue;

		match += baselen;
		matchlen -= baselen;

		if (pathlen > matchlen)
			continue;

		if (matchlen > pathlen) {
			if (match[pathlen] != '/')
				continue;
			if (!S_ISDIR(mode))
				continue;
		}

		if (strncmp(path, match, pathlen))
			continue;
69 70

		return 1;
71 72 73 74
	}
	return 0;
}

75
int read_tree_recursive(struct tree *tree,
76 77 78
			const char *base, int baselen,
			int stage, const char **match,
			read_tree_fn_t fn)
79
{
80 81 82 83 84 85 86 87 88
	struct tree_entry_list *list;
	if (parse_tree(tree))
		return -1;
	list = tree->entries;
	while (list) {
		struct tree_entry_list *current = list;
		list = list->next;
		if (!match_tree_entry(base, baselen, current->name,
				      current->mode, match))
89 90
			continue;

91 92
		switch (fn(current->item.any->sha1, base, baselen,
			   current->name, current->mode, stage)) {
93 94 95 96 97 98 99
		case 0:
			continue;
		case READ_TREE_RECURSIVE:
			break;;
		default:
			return -1;
		}
100
		if (current->directory) {
101
			int retval;
102
			int pathlen = strlen(current->name);
103
			char *newbase;
104

105
			newbase = xmalloc(baselen + 1 + pathlen);
106
			memcpy(newbase, base, baselen);
107
			memcpy(newbase + baselen, current->name, pathlen);
108
			newbase[baselen + pathlen] = '/';
109
			retval = read_tree_recursive(current->item.tree,
110
						     newbase,
111
						     baselen + pathlen + 1,
112
						     stage, match, fn);
113 114 115 116 117 118 119 120 121
			free(newbase);
			if (retval)
				return -1;
			continue;
		}
	}
	return 0;
}

122
int read_tree(struct tree *tree, int stage, const char **match)
123
{
124
	return read_tree_recursive(tree, "", 0, stage, match, read_one_entry);
125 126
}

127
struct tree *lookup_tree(const unsigned char *sha1)
128 129 130
{
	struct object *obj = lookup_object(sha1);
	if (!obj) {
131
		struct tree *ret = xcalloc(1, sizeof(struct tree));
132
		created_object(sha1, &ret->object);
133
		ret->object.type = tree_type;
134 135
		return ret;
	}
Nicolas Pitre's avatar
Nicolas Pitre committed
136 137
	if (!obj->type)
		obj->type = tree_type;
138
	if (obj->type != tree_type) {
139 140 141 142 143 144 145
		error("Object %s is a %s, not a tree", 
		      sha1_to_hex(sha1), obj->type);
		return NULL;
	}
	return (struct tree *) obj;
}

146
int parse_tree_buffer(struct tree *item, void *buffer, unsigned long size)
147
{
148
	void *bufptr = buffer;
149
	struct tree_entry_list **list_p;
150
	int n_refs = 0;
151

152 153 154
	if (item->object.parsed)
		return 0;
	item->object.parsed = 1;
155
	list_p = &item->entries;
156 157
	while (size) {
		struct object *obj;
158
		struct tree_entry_list *entry;
159 160 161 162 163
		int len = 1+strlen(bufptr);
		unsigned char *file_sha1 = bufptr + len;
		char *path = strchr(bufptr, ' ');
		unsigned int mode;
		if (size < len + 20 || !path || 
164
		    sscanf(bufptr, "%o", &mode) != 1)
165 166
			return -1;

167
		entry = xmalloc(sizeof(struct tree_entry_list));
168
		entry->name = strdup(path + 1);
169 170 171
		entry->directory = S_ISDIR(mode) != 0;
		entry->executable = (mode & S_IXUSR) != 0;
		entry->symlink = S_ISLNK(mode) != 0;
172
		entry->zeropad = *(char *)bufptr == '0';
173
		entry->mode = mode;
174 175
		entry->next = NULL;

176 177 178
		bufptr += len + 20;
		size -= len + 20;

179 180 181
		if (entry->directory) {
			entry->item.tree = lookup_tree(file_sha1);
			obj = &entry->item.tree->object;
182
		} else {
183 184
			entry->item.blob = lookup_blob(file_sha1);
			obj = &entry->item.blob->object;
185
		}
186
		if (obj)
187
			n_refs++;
188 189
		*list_p = entry;
		list_p = &entry->next;
190
	}
191 192 193 194 195 196 197 198 199 200

	if (track_object_refs) {
		struct tree_entry_list *entry;
		unsigned i = 0;
		struct object_refs *refs = alloc_object_refs(n_refs);
		for (entry = item->entries; entry; entry = entry->next)
			refs->ref[i++] = entry->item.any;
		set_object_refs(&item->object, refs);
	}

201 202
	return 0;
}
203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225

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;
}
226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244

struct tree *parse_tree_indirect(const unsigned char *sha1)
{
	struct object *obj = parse_object(sha1);
	do {
		if (!obj)
			return NULL;
		if (obj->type == tree_type)
			return (struct tree *) obj;
		else if (obj->type == commit_type)
			obj = &(((struct commit *) obj)->tree->object);
		else if (obj->type == tag_type)
			obj = ((struct tag *) obj)->tagged;
		else
			return NULL;
		if (!obj->parsed)
			parse_object(obj->sha1);
	} while (1);
}