fetch.c 4.7 KB
Newer Older
J
Junio C Hamano 已提交
1
#include "fetch.h"
2 3 4 5

#include "cache.h"
#include "commit.h"
#include "tree.h"
D
Daniel Barkalow 已提交
6 7
#include "tag.h"
#include "blob.h"
8 9 10 11 12
#include "refs.h"

const char *write_ref = NULL;

const unsigned char *current_ref = NULL;
13 14 15 16

int get_tree = 0;
int get_history = 0;
int get_all = 0;
17
int get_verbosely = 0;
18
int get_recover = 0;
19
static unsigned char current_commit_sha1[20];
20

21 22
void pull_say(const char *fmt, const char *hex) 
{
23 24 25 26
	if (get_verbosely)
		fprintf(stderr, fmt, hex);
}

27 28 29 30 31 32 33 34 35 36
static void report_missing(const char *what, const unsigned char *missing)
{
	char missing_hex[41];

	strcpy(missing_hex, sha1_to_hex(missing));;
	fprintf(stderr,
		"Cannot obtain needed %s %s\nwhile processing commit %s.\n",
		what, missing_hex, sha1_to_hex(current_commit_sha1));
}

37
static int process(struct object *obj);
D
Daniel Barkalow 已提交
38

39
static int process_tree(struct tree *tree)
40
{
41
	struct tree_entry_list *entry;
42 43 44 45

	if (parse_tree(tree))
		return -1;

46 47 48 49
	entry = tree->entries;
	tree->entries = NULL;
	while (entry) {
		struct tree_entry_list *next = entry->next;
50
		if (process(entry->item.any))
51
			return -1;
52
		free(entry->name);
53 54
		free(entry);
		entry = next;
55 56 57 58
	}
	return 0;
}

59 60 61
#define COMPLETE	(1U << 0)
#define SEEN		(1U << 1)
#define TO_SCAN		(1U << 2)
62

J
Junio C Hamano 已提交
63
static struct commit_list *complete = NULL;
64

65
static int process_commit(struct commit *commit)
66
{
67
	if (parse_commit(commit))
68 69
		return -1;

70
	while (complete && complete->item->date >= commit->date) {
J
Junio C Hamano 已提交
71
		pop_most_recent_commit(&complete, COMPLETE);
72 73
	}

J
Junio C Hamano 已提交
74
	if (commit->object.flags & COMPLETE)
75 76
		return 0;

77
	memcpy(current_commit_sha1, commit->object.sha1, 20);
78

79 80
	pull_say("walk %s\n", sha1_to_hex(commit->object.sha1));

81
	if (get_tree) {
82
		if (process(&commit->tree->object))
83 84 85 86 87
			return -1;
		if (!get_all)
			get_tree = 0;
	}
	if (get_history) {
88
		struct commit_list *parents = commit->parents;
89
		for (; parents; parents = parents->next) {
90
			if (process(&parents->item->object))
91 92 93 94 95 96
				return -1;
		}
	}
	return 0;
}

97
static int process_tag(struct tag *tag)
D
Daniel Barkalow 已提交
98
{
99
	if (parse_tag(tag))
D
Daniel Barkalow 已提交
100
		return -1;
101
	return process(tag->tagged);
D
Daniel Barkalow 已提交
102 103
}

104 105 106
static struct object_list *process_queue = NULL;
static struct object_list **process_queue_end = &process_queue;

107
static int process_object(struct object *obj)
D
Daniel Barkalow 已提交
108
{
109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124
	if (obj->type == commit_type) {
		if (process_commit((struct commit *)obj))
			return -1;
		return 0;
	}
	if (obj->type == tree_type) {
		if (process_tree((struct tree *)obj))
			return -1;
		return 0;
	}
	if (obj->type == blob_type) {
		return 0;
	}
	if (obj->type == tag_type) {
		if (process_tag((struct tag *)obj))
			return -1;
D
Daniel Barkalow 已提交
125
		return 0;
126 127 128 129 130 131
	}
	return error("Unable to determine requirements "
		     "of type %s for %s",
		     obj->type, sha1_to_hex(obj->sha1));
}

132
static int process(struct object *obj)
133
{
134 135 136 137
	if (obj->flags & SEEN)
		return 0;
	obj->flags |= SEEN;

138
	if (has_sha1_file(obj->sha1)) {
139
		/* We already have it, so we should scan it now. */
140
		obj->flags |= TO_SCAN;
141 142 143 144
	} else {
		if (obj->flags & COMPLETE)
			return 0;
		prefetch(obj->sha1);
145
	}
146
		
147 148 149 150 151 152 153
	object_list_insert(obj, process_queue_end);
	process_queue_end = &(*process_queue_end)->next;
	return 0;
}

static int loop(void)
{
154 155
	struct object_list *elem;

156 157
	while (process_queue) {
		struct object *obj = process_queue->item;
158 159 160
		elem = process_queue;
		process_queue = elem->next;
		free(elem);
161 162 163
		if (!process_queue)
			process_queue_end = &process_queue;

164 165 166 167
		/* If we are not scanning this object, we placed it in
		 * the queue because we needed to fetch it first.
		 */
		if (! (obj->flags & TO_SCAN)) {
168
			if (!has_sha1_file(obj->sha1) && fetch(obj->sha1)) {
169 170 171 172 173 174
				report_missing(obj->type
					       ? obj->type
					       : "object", obj->sha1);
				return -1;
			}
		}
175 176
		if (!obj->type)
			parse_object(obj->sha1);
177 178
		if (process_object(obj))
			return -1;
179 180
	}
	return 0;
D
Daniel Barkalow 已提交
181 182
}

183 184 185 186 187 188 189 190 191 192 193 194
static int interpret_target(char *target, unsigned char *sha1)
{
	if (!get_sha1_hex(target, sha1))
		return 0;
	if (!check_ref_format(target)) {
		if (!fetch_ref(target, sha1)) {
			return 0;
		}
	}
	return -1;
}

195 196
static int mark_complete(const char *path, const unsigned char *sha1)
{
J
Junio C Hamano 已提交
197 198 199 200
	struct commit *commit = lookup_commit_reference_gently(sha1, 1);
	if (commit) {
		commit->object.flags |= COMPLETE;
		insert_by_date(commit, &complete);
201 202 203
	}
	return 0;
}
204

205 206 207
int pull(char *target)
{
	unsigned char sha1[20];
208 209
	int fd = -1;

210
	save_commit_buffer = 0;
211
	track_object_refs = 0;
212 213 214 215 216 217
	if (write_ref && current_ref) {
		fd = lock_ref_sha1(write_ref, current_ref);
		if (fd < 0)
			return -1;
	}

218 219 220
	if (!get_recover) {
		for_each_ref(mark_complete);
	}
221

222 223 224
	if (interpret_target(target, sha1))
		return error("Could not interpret %s as something to pull",
			     target);
225
	if (process(lookup_unknown_object(sha1)))
226 227
		return -1;
	if (loop())
228 229 230 231 232 233 234 235 236 237
		return -1;
	
	if (write_ref) {
		if (current_ref) {
			write_ref_sha1(write_ref, fd, sha1);
		} else {
			write_ref_sha1_unlocked(write_ref, sha1);
		}
	}
	return 0;
238
}