tree.c 4.98 KB
Newer Older
1
#include "cache.h"
2 3
#include "tree.h"
#include "blob.h"
4 5
#include "commit.h"
#include "tag.h"
6
#include "tree-walk.h"
7 8 9

const char *tree_type = "tree";

10
static int read_one_entry(const unsigned char *sha1, const char *base, int baselen, const char *pathname, unsigned mode, int stage)
11
{
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

	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);
27
	hashcpy(ce->sha1, sha1);
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
	struct tree_desc desc;
81
	struct name_entry entry;
82

83 84
	if (parse_tree(tree))
		return -1;
85

86
	init_tree_desc(&desc, tree->buffer, tree->size);
87

88 89
	while (tree_entry(&desc, &entry)) {
		if (!match_tree_entry(base, baselen, entry.path, entry.mode, match))
90 91
			continue;

92
		switch (fn(entry.sha1, base, baselen, entry.path, entry.mode, stage)) {
93 94 95 96 97 98 99
		case 0:
			continue;
		case READ_TREE_RECURSIVE:
			break;;
		default:
			return -1;
		}
100
		if (S_ISDIR(entry.mode)) {
101
			int retval;
102
			char *newbase;
103
			unsigned int pathlen = tree_entry_len(entry.path, entry.sha1);
104

105
			newbase = xmalloc(baselen + 1 + pathlen);
106
			memcpy(newbase, base, baselen);
107 108
			memcpy(newbase + baselen, entry.path, pathlen);
			newbase[baselen + pathlen] = '/';
109
			retval = read_tree_recursive(lookup_tree(entry.sha1),
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 = alloc_tree_node();
132
		created_object(sha1, &ret->object);
133
		ret->object.type = OBJ_TREE;
134 135
		return ret;
	}
Nicolas Pitre's avatar
Nicolas Pitre committed
136
	if (!obj->type)
137 138
		obj->type = OBJ_TREE;
	if (obj->type != OBJ_TREE) {
139 140
		error("Object %s is a %s, not a tree",
		      sha1_to_hex(sha1), typename(obj->type));
141 142 143 144 145
		return NULL;
	}
	return (struct tree *) obj;
}

David Rientjes's avatar
David Rientjes committed
146
static void track_tree_refs(struct tree *item)
147
{
148 149
	int n_refs = 0, i;
	struct object_refs *refs;
150
	struct tree_desc desc;
151
	struct name_entry entry;
152

153
	/* Count how many entries there are.. */
154
	init_tree_desc(&desc, item->buffer, item->size);
155
	while (tree_entry(&desc, &entry))
156 157 158 159 160
		n_refs++;

	/* Allocate object refs and walk it again.. */
	i = 0;
	refs = alloc_object_refs(n_refs);
161
	init_tree_desc(&desc, item->buffer, item->size);
162
	while (tree_entry(&desc, &entry)) {
163 164
		struct object *obj;

165 166
		if (S_ISDIR(entry.mode))
			obj = &lookup_tree(entry.sha1)->object;
167
		else
168
			obj = &lookup_blob(entry.sha1)->object;
169 170 171 172 173 174 175
		refs->ref[i++] = obj;
	}
	set_object_refs(&item->object, refs);
}

int parse_tree_buffer(struct tree *item, void *buffer, unsigned long size)
{
176 177 178
	if (item->object.parsed)
		return 0;
	item->object.parsed = 1;
179 180 181
	item->buffer = buffer;
	item->size = size;

182 183 184 185 186
	if (track_object_refs)
		track_tree_refs(item);
	return 0;
}

187 188
int parse_tree(struct tree *item)
{
189
	 enum object_type type;
190 191 192 193 194
	 void *buffer;
	 unsigned long size;

	if (item->object.parsed)
		return 0;
195
	buffer = read_sha1_file(item->object.sha1, &type, &size);
196 197 198
	if (!buffer)
		return error("Could not read %s",
			     sha1_to_hex(item->object.sha1));
199
	if (type != OBJ_TREE) {
200 201 202 203
		free(buffer);
		return error("Object %s not a tree",
			     sha1_to_hex(item->object.sha1));
	}
204
	return parse_tree_buffer(item, buffer, size);
205
}
206 207 208 209 210 211 212

struct tree *parse_tree_indirect(const unsigned char *sha1)
{
	struct object *obj = parse_object(sha1);
	do {
		if (!obj)
			return NULL;
213
		if (obj->type == OBJ_TREE)
214
			return (struct tree *) obj;
215
		else if (obj->type == OBJ_COMMIT)
216
			obj = &(((struct commit *) obj)->tree->object);
217
		else if (obj->type == OBJ_TAG)
218 219 220 221 222 223 224
			obj = ((struct tag *) obj)->tagged;
		else
			return NULL;
		if (!obj->parsed)
			parse_object(obj->sha1);
	} while (1);
}