sha1_file: fix iterating loose alternate objects
[git/git.git] / reachable.c
CommitLineData
94421474
JH
1#include "cache.h"
2#include "refs.h"
3#include "tag.h"
4#include "commit.h"
5#include "blob.h"
6#include "diff.h"
7#include "revision.h"
8#include "reachable.h"
9#include "cache-tree.h"
dc347195 10#include "progress.h"
5f78a431 11#include "list-objects.h"
94421474 12
0b26abc0
JK
13struct connectivity_progress {
14 struct progress *progress;
15 unsigned long count;
16};
17
18static void update_progress(struct connectivity_progress *cp)
19{
20 cp->count++;
21 if ((cp->count & 1023) == 0)
22 display_progress(cp->progress, cp->count);
23}
24
94421474
JH
25static int add_one_ref(const char *path, const unsigned char *sha1, int flag, void *cb_data)
26{
f7892d18 27 struct object *object = parse_object_or_die(sha1, path);
94421474
JH
28 struct rev_info *revs = (struct rev_info *)cb_data;
29
94421474
JH
30 add_pending_object(revs, object, "");
31
32 return 0;
33}
34
5f78a431
JK
35/*
36 * The traversal will have already marked us as SEEN, so we
37 * only need to handle any progress reporting here.
38 */
39static void mark_object(struct object *obj, const struct name_path *path,
40 const char *name, void *data)
41{
42 update_progress(data);
43}
44
45static void mark_commit(struct commit *c, void *data)
46{
47 mark_object(&c->object, NULL, NULL, data);
48}
49
d3038d22
JK
50struct recent_data {
51 struct rev_info *revs;
52 unsigned long timestamp;
53};
54
55static void add_recent_object(const unsigned char *sha1,
56 unsigned long mtime,
57 struct recent_data *data)
58{
59 struct object *obj;
60 enum object_type type;
61
62 if (mtime <= data->timestamp)
63 return;
64
65 /*
66 * We do not want to call parse_object here, because
67 * inflating blobs and trees could be very expensive.
68 * However, we do need to know the correct type for
69 * later processing, and the revision machinery expects
70 * commits and tags to have been parsed.
71 */
72 type = sha1_object_info(sha1, NULL);
73 if (type < 0)
74 die("unable to get object info for %s", sha1_to_hex(sha1));
75
76 switch (type) {
77 case OBJ_TAG:
78 case OBJ_COMMIT:
79 obj = parse_object_or_die(sha1, NULL);
80 break;
81 case OBJ_TREE:
82 obj = (struct object *)lookup_tree(sha1);
83 break;
84 case OBJ_BLOB:
85 obj = (struct object *)lookup_blob(sha1);
86 break;
87 default:
88 die("unknown object type for %s: %s",
89 sha1_to_hex(sha1), typename(type));
90 }
91
92 if (!obj)
93 die("unable to lookup %s", sha1_to_hex(sha1));
94
95 add_pending_object(data->revs, obj, "");
96}
97
98static int add_recent_loose(const unsigned char *sha1,
99 const char *path, void *data)
100{
101 struct stat st;
102 struct object *obj = lookup_object(sha1);
103
104 if (obj && obj->flags & SEEN)
105 return 0;
106
107 if (stat(path, &st) < 0) {
108 /*
109 * It's OK if an object went away during our iteration; this
110 * could be due to a simultaneous repack. But anything else
111 * we should abort, since we might then fail to mark objects
112 * which should not be pruned.
113 */
114 if (errno == ENOENT)
115 return 0;
116 return error("unable to stat %s: %s",
117 sha1_to_hex(sha1), strerror(errno));
118 }
119
120 add_recent_object(sha1, st.st_mtime, data);
121 return 0;
122}
123
124static int add_recent_packed(const unsigned char *sha1,
125 struct packed_git *p, uint32_t pos,
126 void *data)
127{
128 struct object *obj = lookup_object(sha1);
129
130 if (obj && obj->flags & SEEN)
131 return 0;
132 add_recent_object(sha1, p->mtime, data);
133 return 0;
134}
135
abcb8655
JK
136int add_unseen_recent_objects_to_traversal(struct rev_info *revs,
137 unsigned long timestamp)
d3038d22
JK
138{
139 struct recent_data data;
140 int r;
141
142 data.revs = revs;
143 data.timestamp = timestamp;
144
145 r = for_each_loose_object(add_recent_loose, &data);
146 if (r)
147 return r;
148 return for_each_packed_object(add_recent_packed, &data);
149}
150
dc347195 151void mark_reachable_objects(struct rev_info *revs, int mark_reflog,
d3038d22 152 unsigned long mark_recent,
dc347195 153 struct progress *progress)
94421474 154{
0b26abc0
JK
155 struct connectivity_progress cp;
156
94421474
JH
157 /*
158 * Set up revision parsing, and mark us as being interested
159 * in all object types, not just commits.
160 */
161 revs->tag_objects = 1;
162 revs->blob_objects = 1;
163 revs->tree_objects = 1;
164
165 /* Add all refs from the index file */
1be111d8 166 add_index_objects_to_pending(revs, 0);
94421474
JH
167
168 /* Add all external refs */
169 for_each_ref(add_one_ref, revs);
170
c40fdd01
MK
171 /* detached HEAD is not included in the list above */
172 head_ref(add_one_ref, revs);
173
eb8381c8 174 /* Add all reflog info */
94421474 175 if (mark_reflog)
718ccc97 176 add_reflogs_to_pending(revs, 0);
94421474 177
0b26abc0
JK
178 cp.progress = progress;
179 cp.count = 0;
180
94421474
JH
181 /*
182 * Set up the revision walk - this will move all commits
183 * from the pending list to the commit walking list.
184 */
3d51e1b5
MK
185 if (prepare_revision_walk(revs))
186 die("revision walk setup failed");
5f78a431 187 traverse_commit_list(revs, mark_commit, mark_object, &cp);
d3038d22
JK
188
189 if (mark_recent) {
190 revs->ignore_missing_links = 1;
191 if (add_unseen_recent_objects_to_traversal(revs, mark_recent))
192 die("unable to mark recent objects");
193 if (prepare_revision_walk(revs))
194 die("revision walk setup failed");
195 traverse_commit_list(revs, mark_commit, mark_object, &cp);
196 }
197
0b26abc0 198 display_progress(cp.progress, cp.count);
94421474 199}