reachable.c 4.79 KB
Newer Older
1 2 3 4 5 6 7 8 9
#include "cache.h"
#include "refs.h"
#include "tag.h"
#include "commit.h"
#include "blob.h"
#include "diff.h"
#include "revision.h"
#include "reachable.h"
#include "cache-tree.h"
10
#include "progress.h"
11
#include "list-objects.h"
12
#include "packfile.h"
13

14 15 16 17 18 19 20 21 22 23 24 25
struct connectivity_progress {
	struct progress *progress;
	unsigned long count;
};

static void update_progress(struct connectivity_progress *cp)
{
	cp->count++;
	if ((cp->count & 1023) == 0)
		display_progress(cp->progress, cp->count);
}

26 27
static int add_one_ref(const char *path, const struct object_id *oid,
		       int flag, void *cb_data)
28 29
{
	struct rev_info *revs = (struct rev_info *)cb_data;
30
	struct object *object;
31

32 33 34 35 36
	if ((flag & REF_ISSYMREF) && (flag & REF_ISBROKEN)) {
		warning("symbolic ref is dangling: %s", path);
		return 0;
	}

37
	object = parse_object_or_die(oid, path);
38 39 40 41 42
	add_pending_object(revs, object, "");

	return 0;
}

43 44 45 46
/*
 * The traversal will have already marked us as SEEN, so we
 * only need to handle any progress reporting here.
 */
47
static void mark_object(struct object *obj, const char *name, void *data)
48 49 50 51 52 53
{
	update_progress(data);
}

static void mark_commit(struct commit *c, void *data)
{
54
	mark_object(&c->object, NULL, data);
55 56
}

57 58
struct recent_data {
	struct rev_info *revs;
59
	timestamp_t timestamp;
60 61
};

62
static void add_recent_object(const struct object_id *oid,
63
			      timestamp_t mtime,
64 65 66 67 68 69 70 71 72 73 74 75 76 77 78
			      struct recent_data *data)
{
	struct object *obj;
	enum object_type type;

	if (mtime <= data->timestamp)
		return;

	/*
	 * We do not want to call parse_object here, because
	 * inflating blobs and trees could be very expensive.
	 * However, we do need to know the correct type for
	 * later processing, and the revision machinery expects
	 * commits and tags to have been parsed.
	 */
79
	type = sha1_object_info(oid->hash, NULL);
80
	if (type < 0)
81
		die("unable to get object info for %s", oid_to_hex(oid));
82 83 84 85

	switch (type) {
	case OBJ_TAG:
	case OBJ_COMMIT:
86
		obj = parse_object_or_die(oid, NULL);
87 88
		break;
	case OBJ_TREE:
89
		obj = (struct object *)lookup_tree(oid);
90 91
		break;
	case OBJ_BLOB:
92
		obj = (struct object *)lookup_blob(oid);
93 94 95
		break;
	default:
		die("unknown object type for %s: %s",
96
		    oid_to_hex(oid), typename(type));
97 98 99
	}

	if (!obj)
100
		die("unable to lookup %s", oid_to_hex(oid));
101 102 103 104

	add_pending_object(data->revs, obj, "");
}

105
static int add_recent_loose(const struct object_id *oid,
106 107 108
			    const char *path, void *data)
{
	struct stat st;
109
	struct object *obj = lookup_object(oid->hash);
110 111 112 113 114 115 116 117 118 119 120 121 122

	if (obj && obj->flags & SEEN)
		return 0;

	if (stat(path, &st) < 0) {
		/*
		 * It's OK if an object went away during our iteration; this
		 * could be due to a simultaneous repack. But anything else
		 * we should abort, since we might then fail to mark objects
		 * which should not be pruned.
		 */
		if (errno == ENOENT)
			return 0;
123
		return error_errno("unable to stat %s", oid_to_hex(oid));
124 125
	}

126
	add_recent_object(oid, st.st_mtime, data);
127 128 129
	return 0;
}

130
static int add_recent_packed(const struct object_id *oid,
131 132 133
			     struct packed_git *p, uint32_t pos,
			     void *data)
{
134
	struct object *obj = lookup_object(oid->hash);
135 136 137

	if (obj && obj->flags & SEEN)
		return 0;
138
	add_recent_object(oid, p->mtime, data);
139 140 141
	return 0;
}

142
int add_unseen_recent_objects_to_traversal(struct rev_info *revs,
143
					   timestamp_t timestamp)
144 145 146 147 148 149 150
{
	struct recent_data data;
	int r;

	data.revs = revs;
	data.timestamp = timestamp;

151 152
	r = for_each_loose_object(add_recent_loose, &data,
				  FOR_EACH_OBJECT_LOCAL_ONLY);
153 154
	if (r)
		return r;
155 156
	return for_each_packed_object(add_recent_packed, &data,
				      FOR_EACH_OBJECT_LOCAL_ONLY);
157 158
}

159
void mark_reachable_objects(struct rev_info *revs, int mark_reflog,
160
			    timestamp_t mark_recent, struct progress *progress)
161
{
162 163
	struct connectivity_progress cp;

164 165 166 167 168 169 170 171 172
	/*
	 * Set up revision parsing, and mark us as being interested
	 * in all object types, not just commits.
	 */
	revs->tag_objects = 1;
	revs->blob_objects = 1;
	revs->tree_objects = 1;

	/* Add all refs from the index file */
173
	add_index_objects_to_pending(revs, 0);
174 175

	/* Add all external refs */
176
	for_each_ref(add_one_ref, revs);
177

178
	/* detached HEAD is not included in the list above */
179
	head_ref(add_one_ref, revs);
180

181
	/* Add all reflog info */
182
	if (mark_reflog)
183
		add_reflogs_to_pending(revs, 0);
184

185 186 187
	cp.progress = progress;
	cp.count = 0;

188 189 190 191
	/*
	 * Set up the revision walk - this will move all commits
	 * from the pending list to the commit walking list.
	 */
192 193
	if (prepare_revision_walk(revs))
		die("revision walk setup failed");
194
	traverse_commit_list(revs, mark_commit, mark_object, &cp);
195 196 197 198 199 200 201 202 203 204

	if (mark_recent) {
		revs->ignore_missing_links = 1;
		if (add_unseen_recent_objects_to_traversal(revs, mark_recent))
			die("unable to mark recent objects");
		if (prepare_revision_walk(revs))
			die("revision walk setup failed");
		traverse_commit_list(revs, mark_commit, mark_object, &cp);
	}

205
	display_progress(cp.progress, cp.count);
206
}