]>
Commit | Line | Data |
---|---|---|
4250a5e5 | 1 | #include "cache.h" |
85023577 | 2 | #include "fetch.h" |
4250a5e5 DB |
3 | #include "commit.h" |
4 | #include "tree.h" | |
1bc995a3 | 5 | #include "tree-walk.h" |
3173bd49 DB |
6 | #include "tag.h" |
7 | #include "blob.h" | |
cd541a68 | 8 | #include "refs.h" |
8e87ca66 | 9 | #include "strbuf.h" |
cd541a68 | 10 | |
4250a5e5 DB |
11 | int get_tree = 0; |
12 | int get_history = 0; | |
13 | int get_all = 0; | |
e78d9772 | 14 | int get_verbosely = 0; |
820eca68 | 15 | int get_recover = 0; |
b2d62f16 | 16 | static unsigned char current_commit_sha1[20]; |
4250a5e5 | 17 | |
1e8be59d DB |
18 | void pull_say(const char *fmt, const char *hex) |
19 | { | |
e78d9772 JH |
20 | if (get_verbosely) |
21 | fprintf(stderr, fmt, hex); | |
22 | } | |
23 | ||
0d7a6e4e | 24 | static void report_missing(const struct object *obj) |
b2d62f16 JH |
25 | { |
26 | char missing_hex[41]; | |
0d7a6e4e AR |
27 | strcpy(missing_hex, sha1_to_hex(obj->sha1));; |
28 | fprintf(stderr, "Cannot obtain needed %s %s\n", | |
29 | obj->type ? typename(obj->type): "object", missing_hex); | |
30 | if (!is_null_sha1(current_commit_sha1)) | |
31 | fprintf(stderr, "while processing commit %s.\n", | |
32 | sha1_to_hex(current_commit_sha1)); | |
b2d62f16 JH |
33 | } |
34 | ||
80077f07 | 35 | static int process(struct object *obj); |
3173bd49 | 36 | |
1e8be59d | 37 | static int process_tree(struct tree *tree) |
4250a5e5 | 38 | { |
1bc995a3 | 39 | struct tree_desc desc; |
4c068a98 | 40 | struct name_entry entry; |
4250a5e5 DB |
41 | |
42 | if (parse_tree(tree)) | |
43 | return -1; | |
44 | ||
6fda5e51 | 45 | init_tree_desc(&desc, tree->buffer, tree->size); |
4c068a98 | 46 | while (tree_entry(&desc, &entry)) { |
6f9012b6 JH |
47 | struct object *obj = NULL; |
48 | ||
4c068a98 LT |
49 | if (S_ISDIR(entry.mode)) { |
50 | struct tree *tree = lookup_tree(entry.sha1); | |
6f9012b6 JH |
51 | if (tree) |
52 | obj = &tree->object; | |
53 | } | |
54 | else { | |
4c068a98 | 55 | struct blob *blob = lookup_blob(entry.sha1); |
6f9012b6 JH |
56 | if (blob) |
57 | obj = &blob->object; | |
2d9c58c6 | 58 | } |
6f9012b6 | 59 | if (!obj || process(obj)) |
4250a5e5 | 60 | return -1; |
4250a5e5 | 61 | } |
2d9c58c6 LT |
62 | free(tree->buffer); |
63 | tree->buffer = NULL; | |
1bc995a3 | 64 | tree->size = 0; |
4250a5e5 DB |
65 | return 0; |
66 | } | |
67 | ||
24451c31 SV |
68 | #define COMPLETE (1U << 0) |
69 | #define SEEN (1U << 1) | |
70 | #define TO_SCAN (1U << 2) | |
85d106c2 | 71 | |
d0ac30f2 | 72 | static struct commit_list *complete = NULL; |
22c6e1d0 | 73 | |
1e8be59d | 74 | static int process_commit(struct commit *commit) |
4250a5e5 | 75 | { |
1e8be59d | 76 | if (parse_commit(commit)) |
4250a5e5 DB |
77 | return -1; |
78 | ||
22c6e1d0 | 79 | while (complete && complete->item->date >= commit->date) { |
d0ac30f2 | 80 | pop_most_recent_commit(&complete, COMPLETE); |
22c6e1d0 | 81 | } |
22c6e1d0 | 82 | |
d0ac30f2 | 83 | if (commit->object.flags & COMPLETE) |
22c6e1d0 DB |
84 | return 0; |
85 | ||
e702496e | 86 | hashcpy(current_commit_sha1, commit->object.sha1); |
4250a5e5 | 87 | |
85d106c2 JH |
88 | pull_say("walk %s\n", sha1_to_hex(commit->object.sha1)); |
89 | ||
4250a5e5 | 90 | if (get_tree) { |
80077f07 | 91 | if (process(&commit->tree->object)) |
4250a5e5 DB |
92 | return -1; |
93 | if (!get_all) | |
94 | get_tree = 0; | |
95 | } | |
96 | if (get_history) { | |
1e8be59d | 97 | struct commit_list *parents = commit->parents; |
4250a5e5 | 98 | for (; parents; parents = parents->next) { |
80077f07 | 99 | if (process(&parents->item->object)) |
4250a5e5 DB |
100 | return -1; |
101 | } | |
102 | } | |
103 | return 0; | |
104 | } | |
105 | ||
1e8be59d | 106 | static int process_tag(struct tag *tag) |
3173bd49 | 107 | { |
1e8be59d | 108 | if (parse_tag(tag)) |
3173bd49 | 109 | return -1; |
80077f07 | 110 | return process(tag->tagged); |
3173bd49 DB |
111 | } |
112 | ||
1e8be59d DB |
113 | static struct object_list *process_queue = NULL; |
114 | static struct object_list **process_queue_end = &process_queue; | |
115 | ||
f88fcf8b | 116 | static int process_object(struct object *obj) |
3173bd49 | 117 | { |
1974632c | 118 | if (obj->type == OBJ_COMMIT) { |
f88fcf8b DB |
119 | if (process_commit((struct commit *)obj)) |
120 | return -1; | |
121 | return 0; | |
122 | } | |
1974632c | 123 | if (obj->type == OBJ_TREE) { |
f88fcf8b DB |
124 | if (process_tree((struct tree *)obj)) |
125 | return -1; | |
126 | return 0; | |
127 | } | |
1974632c | 128 | if (obj->type == OBJ_BLOB) { |
f88fcf8b DB |
129 | return 0; |
130 | } | |
1974632c | 131 | if (obj->type == OBJ_TAG) { |
f88fcf8b DB |
132 | if (process_tag((struct tag *)obj)) |
133 | return -1; | |
3173bd49 | 134 | return 0; |
f88fcf8b DB |
135 | } |
136 | return error("Unable to determine requirements " | |
137 | "of type %s for %s", | |
885a86ab | 138 | typename(obj->type), sha1_to_hex(obj->sha1)); |
f88fcf8b DB |
139 | } |
140 | ||
80077f07 | 141 | static int process(struct object *obj) |
f88fcf8b | 142 | { |
a82d07e5 SV |
143 | if (obj->flags & SEEN) |
144 | return 0; | |
145 | obj->flags |= SEEN; | |
146 | ||
80077f07 | 147 | if (has_sha1_file(obj->sha1)) { |
f88fcf8b | 148 | /* We already have it, so we should scan it now. */ |
85d106c2 | 149 | obj->flags |= TO_SCAN; |
e5f38ec3 JH |
150 | } |
151 | else { | |
7b64d06b SV |
152 | if (obj->flags & COMPLETE) |
153 | return 0; | |
154 | prefetch(obj->sha1); | |
f88fcf8b | 155 | } |
7b64d06b | 156 | |
1e8be59d DB |
157 | object_list_insert(obj, process_queue_end); |
158 | process_queue_end = &(*process_queue_end)->next; | |
1e8be59d DB |
159 | return 0; |
160 | } | |
161 | ||
162 | static int loop(void) | |
163 | { | |
85d106c2 JH |
164 | struct object_list *elem; |
165 | ||
1e8be59d DB |
166 | while (process_queue) { |
167 | struct object *obj = process_queue->item; | |
85d106c2 JH |
168 | elem = process_queue; |
169 | process_queue = elem->next; | |
170 | free(elem); | |
1e8be59d DB |
171 | if (!process_queue) |
172 | process_queue_end = &process_queue; | |
173 | ||
85d106c2 JH |
174 | /* If we are not scanning this object, we placed it in |
175 | * the queue because we needed to fetch it first. | |
176 | */ | |
177 | if (! (obj->flags & TO_SCAN)) { | |
11f0dafe | 178 | if (fetch(obj->sha1)) { |
0d7a6e4e | 179 | report_missing(obj); |
85d106c2 JH |
180 | return -1; |
181 | } | |
182 | } | |
1e8be59d DB |
183 | if (!obj->type) |
184 | parse_object(obj->sha1); | |
f88fcf8b DB |
185 | if (process_object(obj)) |
186 | return -1; | |
1e8be59d DB |
187 | } |
188 | return 0; | |
3173bd49 DB |
189 | } |
190 | ||
cd541a68 DB |
191 | static int interpret_target(char *target, unsigned char *sha1) |
192 | { | |
193 | if (!get_sha1_hex(target, sha1)) | |
194 | return 0; | |
195 | if (!check_ref_format(target)) { | |
196 | if (!fetch_ref(target, sha1)) { | |
197 | return 0; | |
198 | } | |
199 | } | |
200 | return -1; | |
201 | } | |
202 | ||
8da19775 | 203 | static int mark_complete(const char *path, const unsigned char *sha1, int flag, void *cb_data) |
22c6e1d0 | 204 | { |
d0ac30f2 JH |
205 | struct commit *commit = lookup_commit_reference_gently(sha1, 1); |
206 | if (commit) { | |
207 | commit->object.flags |= COMPLETE; | |
208 | insert_by_date(commit, &complete); | |
22c6e1d0 DB |
209 | } |
210 | return 0; | |
211 | } | |
cd541a68 | 212 | |
8e87ca66 PB |
213 | int pull_targets_stdin(char ***target, const char ***write_ref) |
214 | { | |
215 | int targets = 0, targets_alloc = 0; | |
216 | struct strbuf buf; | |
217 | *target = NULL; *write_ref = NULL; | |
218 | strbuf_init(&buf); | |
219 | while (1) { | |
220 | char *rf_one = NULL; | |
221 | char *tg_one; | |
222 | ||
223 | read_line(&buf, stdin, '\n'); | |
224 | if (buf.eof) | |
225 | break; | |
226 | tg_one = buf.buf; | |
227 | rf_one = strchr(tg_one, '\t'); | |
228 | if (rf_one) | |
229 | *rf_one++ = 0; | |
230 | ||
231 | if (targets >= targets_alloc) { | |
232 | targets_alloc = targets_alloc ? targets_alloc * 2 : 64; | |
233 | *target = xrealloc(*target, targets_alloc * sizeof(**target)); | |
234 | *write_ref = xrealloc(*write_ref, targets_alloc * sizeof(**write_ref)); | |
235 | } | |
9befac47 SP |
236 | (*target)[targets] = xstrdup(tg_one); |
237 | (*write_ref)[targets] = rf_one ? xstrdup(rf_one) : NULL; | |
8e87ca66 PB |
238 | targets++; |
239 | } | |
240 | return targets; | |
241 | } | |
242 | ||
243 | void pull_targets_free(int targets, char **target, const char **write_ref) | |
244 | { | |
245 | while (targets--) { | |
246 | free(target[targets]); | |
1b03dfed | 247 | if (write_ref && write_ref[targets]) |
8e87ca66 PB |
248 | free((char *) write_ref[targets]); |
249 | } | |
250 | } | |
251 | ||
4211e4d1 | 252 | int pull(int targets, char **target, const char **write_ref, |
c6b69bdb | 253 | const char *write_ref_log_details) |
4250a5e5 | 254 | { |
4211e4d1 PB |
255 | struct ref_lock **lock = xcalloc(targets, sizeof(struct ref_lock *)); |
256 | unsigned char *sha1 = xmalloc(targets * 20); | |
d0740d92 SP |
257 | char *msg; |
258 | int ret; | |
4211e4d1 | 259 | int i; |
cd541a68 | 260 | |
98533b90 | 261 | save_commit_buffer = 0; |
a95cb6fb | 262 | track_object_refs = 0; |
4211e4d1 PB |
263 | |
264 | for (i = 0; i < targets; i++) { | |
1b03dfed | 265 | if (!write_ref || !write_ref[i]) |
4211e4d1 PB |
266 | continue; |
267 | ||
4431fcc4 | 268 | lock[i] = lock_ref_sha1(write_ref[i], NULL); |
4211e4d1 PB |
269 | if (!lock[i]) { |
270 | error("Can't lock ref %s", write_ref[i]); | |
271 | goto unlock_and_fail; | |
d0740d92 | 272 | } |
cd541a68 DB |
273 | } |
274 | ||
84c667ff | 275 | if (!get_recover) |
cb5d709f | 276 | for_each_ref(mark_complete, NULL); |
22c6e1d0 | 277 | |
4211e4d1 PB |
278 | for (i = 0; i < targets; i++) { |
279 | if (interpret_target(target[i], &sha1[20 * i])) { | |
280 | error("Could not interpret %s as something to pull", target[i]); | |
281 | goto unlock_and_fail; | |
282 | } | |
283 | if (process(lookup_unknown_object(&sha1[20 * i]))) | |
284 | goto unlock_and_fail; | |
4bd18c43 | 285 | } |
4211e4d1 PB |
286 | |
287 | if (loop()) | |
288 | goto unlock_and_fail; | |
289 | ||
290 | if (write_ref_log_details) { | |
291 | msg = xmalloc(strlen(write_ref_log_details) + 12); | |
292 | sprintf(msg, "fetch from %s", write_ref_log_details); | |
293 | } else { | |
294 | msg = NULL; | |
4bd18c43 | 295 | } |
4211e4d1 | 296 | for (i = 0; i < targets; i++) { |
1b03dfed | 297 | if (!write_ref || !write_ref[i]) |
4211e4d1 PB |
298 | continue; |
299 | ret = write_ref_sha1(lock[i], &sha1[20 * i], msg ? msg : "fetch (unknown)"); | |
300 | lock[i] = NULL; | |
301 | if (ret) | |
302 | goto unlock_and_fail; | |
4bd18c43 | 303 | } |
4cac42b1 | 304 | free(msg); |
4bd18c43 | 305 | |
cd541a68 | 306 | return 0; |
4211e4d1 PB |
307 | |
308 | ||
309 | unlock_and_fail: | |
310 | for (i = 0; i < targets; i++) | |
311 | if (lock[i]) | |
312 | unlock_ref(lock[i]); | |
313 | return -1; | |
4250a5e5 | 314 | } |