]>
Commit | Line | Data |
---|---|---|
215a7ad1 | 1 | #include "fetch.h" |
4250a5e5 DB |
2 | |
3 | #include "cache.h" | |
4 | #include "commit.h" | |
5 | #include "tree.h" | |
3173bd49 DB |
6 | #include "tag.h" |
7 | #include "blob.h" | |
cd541a68 DB |
8 | #include "refs.h" |
9 | ||
10 | const char *write_ref = NULL; | |
11 | ||
4250a5e5 DB |
12 | int get_tree = 0; |
13 | int get_history = 0; | |
14 | int get_all = 0; | |
e78d9772 | 15 | int get_verbosely = 0; |
820eca68 | 16 | int get_recover = 0; |
b2d62f16 | 17 | static unsigned char current_commit_sha1[20]; |
4250a5e5 | 18 | |
1e8be59d DB |
19 | void pull_say(const char *fmt, const char *hex) |
20 | { | |
e78d9772 JH |
21 | if (get_verbosely) |
22 | fprintf(stderr, fmt, hex); | |
23 | } | |
24 | ||
b2d62f16 JH |
25 | static void report_missing(const char *what, const unsigned char *missing) |
26 | { | |
27 | char missing_hex[41]; | |
28 | ||
29 | strcpy(missing_hex, sha1_to_hex(missing));; | |
30 | fprintf(stderr, | |
31 | "Cannot obtain needed %s %s\nwhile processing commit %s.\n", | |
32 | what, missing_hex, sha1_to_hex(current_commit_sha1)); | |
33 | } | |
34 | ||
80077f07 | 35 | static int process(struct object *obj); |
3173bd49 | 36 | |
1e8be59d | 37 | static int process_tree(struct tree *tree) |
4250a5e5 | 38 | { |
85d106c2 | 39 | struct tree_entry_list *entry; |
4250a5e5 DB |
40 | |
41 | if (parse_tree(tree)) | |
42 | return -1; | |
43 | ||
2d9c58c6 | 44 | entry = create_tree_entry_list(tree); |
85d106c2 JH |
45 | while (entry) { |
46 | struct tree_entry_list *next = entry->next; | |
2d9c58c6 LT |
47 | |
48 | if (entry->directory) { | |
49 | struct tree *tree = lookup_tree(entry->sha1); | |
50 | process_tree(tree); | |
51 | } else { | |
52 | struct blob *blob = lookup_blob(entry->sha1); | |
53 | process(&blob->object); | |
54 | } | |
85d106c2 JH |
55 | free(entry); |
56 | entry = next; | |
4250a5e5 | 57 | } |
2d9c58c6 LT |
58 | free(tree->buffer); |
59 | tree->buffer = NULL; | |
4250a5e5 DB |
60 | return 0; |
61 | } | |
62 | ||
24451c31 SV |
63 | #define COMPLETE (1U << 0) |
64 | #define SEEN (1U << 1) | |
65 | #define TO_SCAN (1U << 2) | |
85d106c2 | 66 | |
d0ac30f2 | 67 | static struct commit_list *complete = NULL; |
22c6e1d0 | 68 | |
1e8be59d | 69 | static int process_commit(struct commit *commit) |
4250a5e5 | 70 | { |
1e8be59d | 71 | if (parse_commit(commit)) |
4250a5e5 DB |
72 | return -1; |
73 | ||
22c6e1d0 | 74 | while (complete && complete->item->date >= commit->date) { |
d0ac30f2 | 75 | pop_most_recent_commit(&complete, COMPLETE); |
22c6e1d0 | 76 | } |
22c6e1d0 | 77 | |
d0ac30f2 | 78 | if (commit->object.flags & COMPLETE) |
22c6e1d0 DB |
79 | return 0; |
80 | ||
1e8be59d | 81 | memcpy(current_commit_sha1, commit->object.sha1, 20); |
4250a5e5 | 82 | |
85d106c2 JH |
83 | pull_say("walk %s\n", sha1_to_hex(commit->object.sha1)); |
84 | ||
4250a5e5 | 85 | if (get_tree) { |
80077f07 | 86 | if (process(&commit->tree->object)) |
4250a5e5 DB |
87 | return -1; |
88 | if (!get_all) | |
89 | get_tree = 0; | |
90 | } | |
91 | if (get_history) { | |
1e8be59d | 92 | struct commit_list *parents = commit->parents; |
4250a5e5 | 93 | for (; parents; parents = parents->next) { |
80077f07 | 94 | if (process(&parents->item->object)) |
4250a5e5 DB |
95 | return -1; |
96 | } | |
97 | } | |
98 | return 0; | |
99 | } | |
100 | ||
1e8be59d | 101 | static int process_tag(struct tag *tag) |
3173bd49 | 102 | { |
1e8be59d | 103 | if (parse_tag(tag)) |
3173bd49 | 104 | return -1; |
80077f07 | 105 | return process(tag->tagged); |
3173bd49 DB |
106 | } |
107 | ||
1e8be59d DB |
108 | static struct object_list *process_queue = NULL; |
109 | static struct object_list **process_queue_end = &process_queue; | |
110 | ||
f88fcf8b | 111 | static int process_object(struct object *obj) |
3173bd49 | 112 | { |
f88fcf8b DB |
113 | if (obj->type == commit_type) { |
114 | if (process_commit((struct commit *)obj)) | |
115 | return -1; | |
116 | return 0; | |
117 | } | |
118 | if (obj->type == tree_type) { | |
119 | if (process_tree((struct tree *)obj)) | |
120 | return -1; | |
121 | return 0; | |
122 | } | |
123 | if (obj->type == blob_type) { | |
124 | return 0; | |
125 | } | |
126 | if (obj->type == tag_type) { | |
127 | if (process_tag((struct tag *)obj)) | |
128 | return -1; | |
3173bd49 | 129 | return 0; |
f88fcf8b DB |
130 | } |
131 | return error("Unable to determine requirements " | |
132 | "of type %s for %s", | |
133 | obj->type, sha1_to_hex(obj->sha1)); | |
134 | } | |
135 | ||
80077f07 | 136 | static int process(struct object *obj) |
f88fcf8b | 137 | { |
a82d07e5 SV |
138 | if (obj->flags & SEEN) |
139 | return 0; | |
140 | obj->flags |= SEEN; | |
141 | ||
80077f07 | 142 | if (has_sha1_file(obj->sha1)) { |
f88fcf8b | 143 | /* We already have it, so we should scan it now. */ |
85d106c2 | 144 | obj->flags |= TO_SCAN; |
7b64d06b SV |
145 | } else { |
146 | if (obj->flags & COMPLETE) | |
147 | return 0; | |
148 | prefetch(obj->sha1); | |
f88fcf8b | 149 | } |
7b64d06b | 150 | |
1e8be59d DB |
151 | object_list_insert(obj, process_queue_end); |
152 | process_queue_end = &(*process_queue_end)->next; | |
1e8be59d DB |
153 | return 0; |
154 | } | |
155 | ||
156 | static int loop(void) | |
157 | { | |
85d106c2 JH |
158 | struct object_list *elem; |
159 | ||
1e8be59d DB |
160 | while (process_queue) { |
161 | struct object *obj = process_queue->item; | |
85d106c2 JH |
162 | elem = process_queue; |
163 | process_queue = elem->next; | |
164 | free(elem); | |
1e8be59d DB |
165 | if (!process_queue) |
166 | process_queue_end = &process_queue; | |
167 | ||
85d106c2 JH |
168 | /* If we are not scanning this object, we placed it in |
169 | * the queue because we needed to fetch it first. | |
170 | */ | |
171 | if (! (obj->flags & TO_SCAN)) { | |
11f0dafe | 172 | if (fetch(obj->sha1)) { |
85d106c2 JH |
173 | report_missing(obj->type |
174 | ? obj->type | |
175 | : "object", obj->sha1); | |
176 | return -1; | |
177 | } | |
178 | } | |
1e8be59d DB |
179 | if (!obj->type) |
180 | parse_object(obj->sha1); | |
f88fcf8b DB |
181 | if (process_object(obj)) |
182 | return -1; | |
1e8be59d DB |
183 | } |
184 | return 0; | |
3173bd49 DB |
185 | } |
186 | ||
cd541a68 DB |
187 | static int interpret_target(char *target, unsigned char *sha1) |
188 | { | |
189 | if (!get_sha1_hex(target, sha1)) | |
190 | return 0; | |
191 | if (!check_ref_format(target)) { | |
192 | if (!fetch_ref(target, sha1)) { | |
193 | return 0; | |
194 | } | |
195 | } | |
196 | return -1; | |
197 | } | |
198 | ||
22c6e1d0 DB |
199 | static int mark_complete(const char *path, const unsigned char *sha1) |
200 | { | |
d0ac30f2 JH |
201 | struct commit *commit = lookup_commit_reference_gently(sha1, 1); |
202 | if (commit) { | |
203 | commit->object.flags |= COMPLETE; | |
204 | insert_by_date(commit, &complete); | |
22c6e1d0 DB |
205 | } |
206 | return 0; | |
207 | } | |
cd541a68 | 208 | |
4250a5e5 DB |
209 | int pull(char *target) |
210 | { | |
4250a5e5 | 211 | unsigned char sha1[20]; |
cd541a68 | 212 | |
98533b90 | 213 | save_commit_buffer = 0; |
a95cb6fb | 214 | track_object_refs = 0; |
cd541a68 | 215 | |
84c667ff | 216 | if (!get_recover) |
820eca68 | 217 | for_each_ref(mark_complete); |
22c6e1d0 | 218 | |
cd541a68 DB |
219 | if (interpret_target(target, sha1)) |
220 | return error("Could not interpret %s as something to pull", | |
221 | target); | |
80077f07 | 222 | if (process(lookup_unknown_object(sha1))) |
1e8be59d DB |
223 | return -1; |
224 | if (loop()) | |
cd541a68 DB |
225 | return -1; |
226 | ||
84c667ff JH |
227 | if (write_ref) |
228 | write_ref_sha1_unlocked(write_ref, sha1); | |
cd541a68 | 229 | return 0; |
4250a5e5 | 230 | } |