]>
Commit | Line | Data |
---|---|---|
8f1d2e6f | 1 | #include "cache.h" |
961784ee | 2 | #include "tag.h" |
175785e5 | 3 | #include "commit.h" |
177722b3 | 4 | #include "commit-graph.h" |
ed09aef0 | 5 | #include "pkt-line.h" |
52883fbd | 6 | #include "utf8.h" |
199c45bf JH |
7 | #include "diff.h" |
8 | #include "revision.h" | |
a97a7468 | 9 | #include "notes.h" |
ba3c69a9 | 10 | #include "gpg-interface.h" |
46905893 | 11 | #include "mergesort.h" |
a84b794a | 12 | #include "commit-slab.h" |
da24b104 | 13 | #include "prio-queue.h" |
0a9136f3 | 14 | #include "sha1-lookup.h" |
d76650b8 | 15 | #include "wt-status.h" |
175785e5 | 16 | |
82a75299 JH |
17 | static struct commit_extra_header *read_commit_extra_header_lines(const char *buf, size_t len, const char **); |
18 | ||
60ab26de LT |
19 | int save_commit_buffer = 1; |
20 | ||
175785e5 DB |
21 | const char *commit_type = "commit"; |
22 | ||
bc83266a | 23 | struct commit *lookup_commit_reference_gently(const struct object_id *oid, |
f76412ed | 24 | int quiet) |
961784ee | 25 | { |
c251c83d | 26 | struct object *obj = deref_tag(parse_object(oid), NULL, 0); |
961784ee LT |
27 | |
28 | if (!obj) | |
29 | return NULL; | |
8ff226a9 | 30 | return object_as_type(obj, OBJ_COMMIT, quiet); |
f76412ed JH |
31 | } |
32 | ||
bc83266a | 33 | struct commit *lookup_commit_reference(const struct object_id *oid) |
f76412ed | 34 | { |
bc83266a | 35 | return lookup_commit_reference_gently(oid, 0); |
961784ee LT |
36 | } |
37 | ||
bc83266a | 38 | struct commit *lookup_commit_or_die(const struct object_id *oid, const char *ref_name) |
baf18fc2 | 39 | { |
bc83266a | 40 | struct commit *c = lookup_commit_reference(oid); |
baf18fc2 NTND |
41 | if (!c) |
42 | die(_("could not parse %s"), ref_name); | |
bc83266a | 43 | if (oidcmp(oid, &c->object.oid)) { |
baf18fc2 | 44 | warning(_("%s %s is not a commit!"), |
bc83266a | 45 | ref_name, oid_to_hex(oid)); |
baf18fc2 NTND |
46 | } |
47 | return c; | |
48 | } | |
49 | ||
bc83266a | 50 | struct commit *lookup_commit(const struct object_id *oid) |
175785e5 | 51 | { |
bc83266a | 52 | struct object *obj = lookup_object(oid->hash); |
d36f51c1 | 53 | if (!obj) |
bc83266a | 54 | return create_object(oid->hash, alloc_commit_node()); |
8ff226a9 | 55 | return object_as_type(obj, OBJ_COMMIT, 0); |
175785e5 DB |
56 | } |
57 | ||
a6fa5992 PN |
58 | struct commit *lookup_commit_reference_by_name(const char *name) |
59 | { | |
7683e2e6 | 60 | struct object_id oid; |
a6fa5992 PN |
61 | struct commit *commit; |
62 | ||
e82caf38 | 63 | if (get_oid_committish(name, &oid)) |
a6fa5992 | 64 | return NULL; |
bc83266a | 65 | commit = lookup_commit_reference(&oid); |
5e7d4d3e | 66 | if (parse_commit(commit)) |
a6fa5992 PN |
67 | return NULL; |
68 | return commit; | |
69 | } | |
70 | ||
dddbad72 | 71 | static timestamp_t parse_commit_date(const char *buf, const char *tail) |
175785e5 | 72 | { |
0a617799 | 73 | const char *dateptr; |
175785e5 | 74 | |
0a617799 MK |
75 | if (buf + 6 >= tail) |
76 | return 0; | |
175785e5 DB |
77 | if (memcmp(buf, "author", 6)) |
78 | return 0; | |
0a617799 | 79 | while (buf < tail && *buf++ != '\n') |
175785e5 | 80 | /* nada */; |
0a617799 MK |
81 | if (buf + 9 >= tail) |
82 | return 0; | |
175785e5 DB |
83 | if (memcmp(buf, "committer", 9)) |
84 | return 0; | |
0a617799 | 85 | while (buf < tail && *buf++ != '>') |
175785e5 | 86 | /* nada */; |
0a617799 MK |
87 | if (buf >= tail) |
88 | return 0; | |
89 | dateptr = buf; | |
90 | while (buf < tail && *buf++ != '\n') | |
91 | /* nada */; | |
92 | if (buf >= tail) | |
93 | return 0; | |
1aeb7e75 JS |
94 | /* dateptr < buf && buf[-1] == '\n', so parsing will stop at buf-1 */ |
95 | return parse_timestamp(dateptr, NULL, 10); | |
175785e5 DB |
96 | } |
97 | ||
5040f17e | 98 | static struct commit_graft **commit_graft; |
5da5c8f4 JH |
99 | static int commit_graft_alloc, commit_graft_nr; |
100 | ||
0a9136f3 DD |
101 | static const unsigned char *commit_graft_sha1_access(size_t index, void *table) |
102 | { | |
103 | struct commit_graft **commit_graft_table = table; | |
7683e2e6 | 104 | return commit_graft_table[index]->oid.hash; |
0a9136f3 DD |
105 | } |
106 | ||
5da5c8f4 JH |
107 | static int commit_graft_pos(const unsigned char *sha1) |
108 | { | |
0a9136f3 DD |
109 | return sha1_pos(sha1, commit_graft, commit_graft_nr, |
110 | commit_graft_sha1_access); | |
5da5c8f4 JH |
111 | } |
112 | ||
5040f17e JH |
113 | int register_commit_graft(struct commit_graft *graft, int ignore_dups) |
114 | { | |
7683e2e6 | 115 | int pos = commit_graft_pos(graft->oid.hash); |
a6080a0a | 116 | |
5040f17e JH |
117 | if (0 <= pos) { |
118 | if (ignore_dups) | |
119 | free(graft); | |
120 | else { | |
121 | free(commit_graft[pos]); | |
122 | commit_graft[pos] = graft; | |
123 | } | |
124 | return 1; | |
125 | } | |
126 | pos = -pos - 1; | |
d6e82b57 DD |
127 | ALLOC_GROW(commit_graft, commit_graft_nr + 1, commit_graft_alloc); |
128 | commit_graft_nr++; | |
5040f17e | 129 | if (pos < commit_graft_nr) |
f919ffeb SG |
130 | MOVE_ARRAY(commit_graft + pos + 1, commit_graft + pos, |
131 | commit_graft_nr - pos - 1); | |
5040f17e JH |
132 | commit_graft[pos] = graft; |
133 | return 0; | |
134 | } | |
135 | ||
9a934032 | 136 | struct commit_graft *read_graft_line(struct strbuf *line) |
5040f17e JH |
137 | { |
138 | /* The format is just "Commit Parent1 Parent2 ...\n" */ | |
cfa5bf16 PO |
139 | int i, phase; |
140 | const char *tail = NULL; | |
5040f17e | 141 | struct commit_graft *graft = NULL; |
cfa5bf16 | 142 | struct object_id dummy_oid, *oid; |
5040f17e | 143 | |
9a934032 PO |
144 | strbuf_rtrim(line); |
145 | if (!line->len || line->buf[0] == '#') | |
5bc4ce58 | 146 | return NULL; |
cfa5bf16 PO |
147 | /* |
148 | * phase 0 verifies line, counts hashes in line and allocates graft | |
149 | * phase 1 fills graft | |
150 | */ | |
151 | for (phase = 0; phase < 2; phase++) { | |
152 | oid = graft ? &graft->oid : &dummy_oid; | |
153 | if (parse_oid_hex(line->buf, oid, &tail)) | |
5040f17e | 154 | goto bad_graft_data; |
cfa5bf16 PO |
155 | for (i = 0; *tail != '\0'; i++) { |
156 | oid = graft ? &graft->parent[i] : &dummy_oid; | |
157 | if (!isspace(*tail++) || parse_oid_hex(tail, oid, &tail)) | |
158 | goto bad_graft_data; | |
159 | } | |
160 | if (!graft) { | |
161 | graft = xmalloc(st_add(sizeof(*graft), | |
162 | st_mult(sizeof(struct object_id), i))); | |
163 | graft->nr_parent = i; | |
164 | } | |
5040f17e JH |
165 | } |
166 | return graft; | |
df5d43be RT |
167 | |
168 | bad_graft_data: | |
9a934032 | 169 | error("bad graft data: %s", line->buf); |
cfa5bf16 | 170 | assert(!graft); |
df5d43be | 171 | return NULL; |
5040f17e JH |
172 | } |
173 | ||
c5ae6439 | 174 | static int read_graft_file(const char *graft_file) |
5da5c8f4 | 175 | { |
e9d983f1 | 176 | FILE *fp = fopen_or_warn(graft_file, "r"); |
e228c173 | 177 | struct strbuf buf = STRBUF_INIT; |
5040f17e JH |
178 | if (!fp) |
179 | return -1; | |
e228c173 | 180 | while (!strbuf_getwholeline(&buf, fp, '\n')) { |
5da5c8f4 | 181 | /* The format is just "Commit Parent1 Parent2 ...\n" */ |
9a934032 | 182 | struct commit_graft *graft = read_graft_line(&buf); |
5bc4ce58 JH |
183 | if (!graft) |
184 | continue; | |
5040f17e | 185 | if (register_commit_graft(graft, 1)) |
e228c173 | 186 | error("duplicate graft data: %s", buf.buf); |
5da5c8f4 JH |
187 | } |
188 | fclose(fp); | |
e228c173 | 189 | strbuf_release(&buf); |
5040f17e JH |
190 | return 0; |
191 | } | |
192 | ||
193 | static void prepare_commit_graft(void) | |
194 | { | |
195 | static int commit_graft_prepared; | |
196 | char *graft_file; | |
197 | ||
198 | if (commit_graft_prepared) | |
199 | return; | |
200 | graft_file = get_graft_file(); | |
201 | read_graft_file(graft_file); | |
ed09aef0 JS |
202 | /* make sure shallows are read */ |
203 | is_repository_shallow(); | |
5040f17e | 204 | commit_graft_prepared = 1; |
5da5c8f4 JH |
205 | } |
206 | ||
8b65a34c | 207 | struct commit_graft *lookup_commit_graft(const struct object_id *oid) |
5da5c8f4 JH |
208 | { |
209 | int pos; | |
5040f17e | 210 | prepare_commit_graft(); |
8b65a34c | 211 | pos = commit_graft_pos(oid->hash); |
5da5c8f4 JH |
212 | if (pos < 0) |
213 | return NULL; | |
214 | return commit_graft[pos]; | |
215 | } | |
216 | ||
09d46644 | 217 | int for_each_commit_graft(each_commit_graft_fn fn, void *cb_data) |
ed09aef0 | 218 | { |
09d46644 NTND |
219 | int i, ret; |
220 | for (i = ret = 0; i < commit_graft_nr && !ret; i++) | |
221 | ret = fn(commit_graft[i], cb_data); | |
222 | return ret; | |
ed09aef0 JS |
223 | } |
224 | ||
e92b848c | 225 | int unregister_shallow(const struct object_id *oid) |
f53514bc | 226 | { |
e92b848c | 227 | int pos = commit_graft_pos(oid->hash); |
f53514bc JS |
228 | if (pos < 0) |
229 | return -1; | |
230 | if (pos + 1 < commit_graft_nr) | |
f331ab9d RS |
231 | MOVE_ARRAY(commit_graft + pos, commit_graft + pos + 1, |
232 | commit_graft_nr - pos - 1); | |
f53514bc JS |
233 | commit_graft_nr--; |
234 | return 0; | |
235 | } | |
236 | ||
8597ea3a JK |
237 | struct commit_buffer { |
238 | void *buffer; | |
239 | unsigned long size; | |
240 | }; | |
241 | define_commit_slab(buffer_slab, struct commit_buffer); | |
c1b3c71f JK |
242 | static struct buffer_slab buffer_slab = COMMIT_SLAB_INIT(1, buffer_slab); |
243 | ||
8597ea3a | 244 | void set_commit_buffer(struct commit *commit, void *buffer, unsigned long size) |
66c2827e | 245 | { |
8597ea3a JK |
246 | struct commit_buffer *v = buffer_slab_at(&buffer_slab, commit); |
247 | v->buffer = buffer; | |
248 | v->size = size; | |
66c2827e JK |
249 | } |
250 | ||
8597ea3a | 251 | const void *get_cached_commit_buffer(const struct commit *commit, unsigned long *sizep) |
152ff1cc | 252 | { |
862e730e JH |
253 | struct commit_buffer *v = buffer_slab_peek(&buffer_slab, commit); |
254 | if (!v) { | |
255 | if (sizep) | |
256 | *sizep = 0; | |
257 | return NULL; | |
258 | } | |
8597ea3a JK |
259 | if (sizep) |
260 | *sizep = v->size; | |
261 | return v->buffer; | |
152ff1cc JK |
262 | } |
263 | ||
8597ea3a | 264 | const void *get_commit_buffer(const struct commit *commit, unsigned long *sizep) |
152ff1cc | 265 | { |
8597ea3a | 266 | const void *ret = get_cached_commit_buffer(commit, sizep); |
152ff1cc JK |
267 | if (!ret) { |
268 | enum object_type type; | |
269 | unsigned long size; | |
ed1c9977 | 270 | ret = read_sha1_file(commit->object.oid.hash, &type, &size); |
152ff1cc JK |
271 | if (!ret) |
272 | die("cannot read commit object %s", | |
f2fd0760 | 273 | oid_to_hex(&commit->object.oid)); |
152ff1cc JK |
274 | if (type != OBJ_COMMIT) |
275 | die("expected commit for %s, got %s", | |
debca9d2 | 276 | oid_to_hex(&commit->object.oid), type_name(type)); |
8597ea3a JK |
277 | if (sizep) |
278 | *sizep = size; | |
152ff1cc JK |
279 | } |
280 | return ret; | |
281 | } | |
282 | ||
283 | void unuse_commit_buffer(const struct commit *commit, const void *buffer) | |
284 | { | |
862e730e JH |
285 | struct commit_buffer *v = buffer_slab_peek(&buffer_slab, commit); |
286 | if (!(v && v->buffer == buffer)) | |
152ff1cc JK |
287 | free((void *)buffer); |
288 | } | |
289 | ||
0fb370da JK |
290 | void free_commit_buffer(struct commit *commit) |
291 | { | |
862e730e JH |
292 | struct commit_buffer *v = buffer_slab_peek(&buffer_slab, commit); |
293 | if (v) { | |
6a83d902 | 294 | FREE_AND_NULL(v->buffer); |
862e730e JH |
295 | v->size = 0; |
296 | } | |
0fb370da JK |
297 | } |
298 | ||
5bb03de1 DS |
299 | struct tree *get_commit_tree(const struct commit *commit) |
300 | { | |
301 | return commit->maybe_tree; | |
302 | } | |
303 | ||
304 | struct object_id *get_commit_tree_oid(const struct commit *commit) | |
305 | { | |
306 | return &get_commit_tree(commit)->object.oid; | |
307 | } | |
308 | ||
8597ea3a | 309 | const void *detach_commit_buffer(struct commit *commit, unsigned long *sizep) |
0fb370da | 310 | { |
862e730e | 311 | struct commit_buffer *v = buffer_slab_peek(&buffer_slab, commit); |
8597ea3a JK |
312 | void *ret; |
313 | ||
862e730e JH |
314 | if (!v) { |
315 | if (sizep) | |
316 | *sizep = 0; | |
317 | return NULL; | |
318 | } | |
8597ea3a JK |
319 | ret = v->buffer; |
320 | if (sizep) | |
321 | *sizep = v->size; | |
322 | ||
323 | v->buffer = NULL; | |
324 | v->size = 0; | |
0fb370da JK |
325 | return ret; |
326 | } | |
327 | ||
cf7b1cad | 328 | int parse_commit_buffer(struct commit *item, const void *buffer, unsigned long size) |
175785e5 | 329 | { |
cf7b1cad NTND |
330 | const char *tail = buffer; |
331 | const char *bufptr = buffer; | |
7683e2e6 | 332 | struct object_id parent; |
6c88be16 | 333 | struct commit_list **pptr; |
5da5c8f4 | 334 | struct commit_graft *graft; |
7683e2e6 | 335 | const int tree_entry_len = GIT_SHA1_HEXSZ + 5; |
336 | const int parent_entry_len = GIT_SHA1_HEXSZ + 7; | |
bd2c39f5 | 337 | |
175785e5 DB |
338 | if (item->object.parsed) |
339 | return 0; | |
340 | item->object.parsed = 1; | |
3b44f15a | 341 | tail += size; |
7683e2e6 | 342 | if (tail <= bufptr + tree_entry_len + 1 || memcmp(bufptr, "tree ", 5) || |
343 | bufptr[tree_entry_len] != '\n') | |
f2fd0760 | 344 | return error("bogus commit object %s", oid_to_hex(&item->object.oid)); |
7683e2e6 | 345 | if (get_sha1_hex(bufptr + 5, parent.hash) < 0) |
bd2afde8 | 346 | return error("bad tree pointer in commit %s", |
f2fd0760 | 347 | oid_to_hex(&item->object.oid)); |
891435d5 | 348 | item->maybe_tree = lookup_tree(&parent); |
7683e2e6 | 349 | bufptr += tree_entry_len + 1; /* "tree " + "hex sha1" + "\n" */ |
6c88be16 | 350 | pptr = &item->parents; |
5da5c8f4 | 351 | |
8b65a34c | 352 | graft = lookup_commit_graft(&item->object.oid); |
7683e2e6 | 353 | while (bufptr + parent_entry_len < tail && !memcmp(bufptr, "parent ", 7)) { |
f7cc77d7 LT |
354 | struct commit *new_parent; |
355 | ||
7683e2e6 | 356 | if (tail <= bufptr + parent_entry_len + 1 || |
357 | get_sha1_hex(bufptr + 7, parent.hash) || | |
358 | bufptr[parent_entry_len] != '\n') | |
f2fd0760 | 359 | return error("bad parents in commit %s", oid_to_hex(&item->object.oid)); |
7683e2e6 | 360 | bufptr += parent_entry_len + 1; |
7f3140cd JS |
361 | /* |
362 | * The clone is shallow if nr_parent < 0, and we must | |
363 | * not traverse its real parents even when we unhide them. | |
364 | */ | |
365 | if (graft && (graft->nr_parent < 0 || grafts_replace_parents)) | |
5da5c8f4 | 366 | continue; |
bc83266a | 367 | new_parent = lookup_commit(&parent); |
39468def | 368 | if (new_parent) |
6c88be16 | 369 | pptr = &commit_list_insert(new_parent, pptr)->next; |
5da5c8f4 JH |
370 | } |
371 | if (graft) { | |
372 | int i; | |
373 | struct commit *new_parent; | |
374 | for (i = 0; i < graft->nr_parent; i++) { | |
bc83266a | 375 | new_parent = lookup_commit(&graft->parent[i]); |
5da5c8f4 JH |
376 | if (!new_parent) |
377 | continue; | |
378 | pptr = &commit_list_insert(new_parent, pptr)->next; | |
5da5c8f4 | 379 | } |
175785e5 | 380 | } |
0a617799 | 381 | item->date = parse_commit_date(bufptr, tail); |
27dedf0c | 382 | |
175785e5 DB |
383 | return 0; |
384 | } | |
385 | ||
9cc2b07a | 386 | int parse_commit_gently(struct commit *item, int quiet_on_missing) |
bd2c39f5 | 387 | { |
21666f1a | 388 | enum object_type type; |
bd2c39f5 NP |
389 | void *buffer; |
390 | unsigned long size; | |
391 | int ret; | |
392 | ||
9786f68b MK |
393 | if (!item) |
394 | return -1; | |
bd2c39f5 NP |
395 | if (item->object.parsed) |
396 | return 0; | |
177722b3 DS |
397 | if (parse_commit_in_graph(item)) |
398 | return 0; | |
ed1c9977 | 399 | buffer = read_sha1_file(item->object.oid.hash, &type, &size); |
bd2c39f5 | 400 | if (!buffer) |
9cc2b07a JK |
401 | return quiet_on_missing ? -1 : |
402 | error("Could not read %s", | |
f2fd0760 | 403 | oid_to_hex(&item->object.oid)); |
21666f1a | 404 | if (type != OBJ_COMMIT) { |
bd2c39f5 NP |
405 | free(buffer); |
406 | return error("Object %s not a commit", | |
f2fd0760 | 407 | oid_to_hex(&item->object.oid)); |
bd2c39f5 NP |
408 | } |
409 | ret = parse_commit_buffer(item, buffer, size); | |
60ab26de | 410 | if (save_commit_buffer && !ret) { |
8597ea3a | 411 | set_commit_buffer(item, buffer, size); |
3ff1fbbb LT |
412 | return 0; |
413 | } | |
bd2c39f5 NP |
414 | free(buffer); |
415 | return ret; | |
416 | } | |
417 | ||
7059dccc JK |
418 | void parse_commit_or_die(struct commit *item) |
419 | { | |
420 | if (parse_commit(item)) | |
421 | die("unable to parse commit %s", | |
f2fd0760 | 422 | item ? oid_to_hex(&item->object.oid) : "(null)"); |
7059dccc JK |
423 | } |
424 | ||
11af2aae CC |
425 | int find_commit_subject(const char *commit_buffer, const char **subject) |
426 | { | |
427 | const char *eol; | |
428 | const char *p = commit_buffer; | |
429 | ||
430 | while (*p && (*p != '\n' || p[1] != '\n')) | |
431 | p++; | |
432 | if (*p) { | |
4e1b06da | 433 | p = skip_blank_lines(p + 2); |
9c9b03b1 | 434 | eol = strchrnul(p, '\n'); |
11af2aae CC |
435 | } else |
436 | eol = p; | |
437 | ||
438 | *subject = p; | |
439 | ||
440 | return eol - p; | |
441 | } | |
442 | ||
ac5155ef | 443 | struct commit_list *commit_list_insert(struct commit *item, struct commit_list **list_p) |
dd97f850 | 444 | { |
812666c8 | 445 | struct commit_list *new_list = xmalloc(sizeof(struct commit_list)); |
dd97f850 DB |
446 | new_list->item = item; |
447 | new_list->next = *list_p; | |
448 | *list_p = new_list; | |
ac5155ef | 449 | return new_list; |
dd97f850 DB |
450 | } |
451 | ||
65319475 MV |
452 | unsigned commit_list_count(const struct commit_list *l) |
453 | { | |
454 | unsigned c = 0; | |
455 | for (; l; l = l->next ) | |
456 | c++; | |
457 | return c; | |
458 | } | |
459 | ||
53d00b39 TR |
460 | struct commit_list *copy_commit_list(struct commit_list *list) |
461 | { | |
462 | struct commit_list *head = NULL; | |
463 | struct commit_list **pp = &head; | |
464 | while (list) { | |
cb979dbd | 465 | pp = commit_list_append(list->item, pp); |
53d00b39 TR |
466 | list = list->next; |
467 | } | |
468 | return head; | |
469 | } | |
470 | ||
175785e5 DB |
471 | void free_commit_list(struct commit_list *list) |
472 | { | |
e510ab89 RS |
473 | while (list) |
474 | pop_commit(&list); | |
175785e5 | 475 | } |
dd97f850 | 476 | |
47e44ed1 | 477 | struct commit_list * commit_list_insert_by_date(struct commit *item, struct commit_list **list) |
dd97f850 DB |
478 | { |
479 | struct commit_list **pp = list; | |
480 | struct commit_list *p; | |
481 | while ((p = *pp) != NULL) { | |
482 | if (p->item->date < item->date) { | |
483 | break; | |
484 | } | |
485 | pp = &p->next; | |
486 | } | |
f755494c | 487 | return commit_list_insert(item, pp); |
dd97f850 DB |
488 | } |
489 | ||
46905893 RS |
490 | static int commit_list_compare_by_date(const void *a, const void *b) |
491 | { | |
dddbad72 JS |
492 | timestamp_t a_date = ((const struct commit_list *)a)->item->date; |
493 | timestamp_t b_date = ((const struct commit_list *)b)->item->date; | |
46905893 RS |
494 | if (a_date < b_date) |
495 | return 1; | |
496 | if (a_date > b_date) | |
497 | return -1; | |
498 | return 0; | |
499 | } | |
500 | ||
501 | static void *commit_list_get_next(const void *a) | |
502 | { | |
503 | return ((const struct commit_list *)a)->next; | |
504 | } | |
505 | ||
506 | static void commit_list_set_next(void *a, void *next) | |
507 | { | |
508 | ((struct commit_list *)a)->next = next; | |
509 | } | |
a6080a0a | 510 | |
47e44ed1 | 511 | void commit_list_sort_by_date(struct commit_list **list) |
dd97f850 | 512 | { |
7365c95d JH |
513 | *list = llist_mergesort(*list, commit_list_get_next, commit_list_set_next, |
514 | commit_list_compare_by_date); | |
dd97f850 DB |
515 | } |
516 | ||
58e28af6 DB |
517 | struct commit *pop_most_recent_commit(struct commit_list **list, |
518 | unsigned int mark) | |
dd97f850 | 519 | { |
e510ab89 | 520 | struct commit *ret = pop_commit(list); |
dd97f850 | 521 | struct commit_list *parents = ret->parents; |
dd97f850 DB |
522 | |
523 | while (parents) { | |
4056c091 | 524 | struct commit *commit = parents->item; |
dec38c81 | 525 | if (!parse_commit(commit) && !(commit->object.flags & mark)) { |
58e28af6 | 526 | commit->object.flags |= mark; |
47e44ed1 | 527 | commit_list_insert_by_date(commit, list); |
4056c091 | 528 | } |
dd97f850 DB |
529 | parents = parents->next; |
530 | } | |
531 | return ret; | |
532 | } | |
e3bc7a3b | 533 | |
941ba8db NTND |
534 | static void clear_commit_marks_1(struct commit_list **plist, |
535 | struct commit *commit, unsigned int mark) | |
f8f9c73c | 536 | { |
60fcc2e6 JS |
537 | while (commit) { |
538 | struct commit_list *parents; | |
f8f9c73c | 539 | |
60fcc2e6 JS |
540 | if (!(mark & commit->object.flags)) |
541 | return; | |
58ecf5c1 | 542 | |
60fcc2e6 JS |
543 | commit->object.flags &= ~mark; |
544 | ||
545 | parents = commit->parents; | |
546 | if (!parents) | |
547 | return; | |
548 | ||
549 | while ((parents = parents->next)) | |
941ba8db | 550 | commit_list_insert(parents->item, plist); |
60fcc2e6 JS |
551 | |
552 | commit = commit->parents->item; | |
f8f9c73c JH |
553 | } |
554 | } | |
555 | ||
e895cb51 | 556 | void clear_commit_marks_many(int nr, struct commit **commit, unsigned int mark) |
941ba8db NTND |
557 | { |
558 | struct commit_list *list = NULL; | |
e895cb51 JH |
559 | |
560 | while (nr--) { | |
07f7d55a | 561 | clear_commit_marks_1(&list, *commit, mark); |
e895cb51 JH |
562 | commit++; |
563 | } | |
941ba8db NTND |
564 | while (list) |
565 | clear_commit_marks_1(&list, pop_commit(&list), mark); | |
566 | } | |
567 | ||
e895cb51 JH |
568 | void clear_commit_marks(struct commit *commit, unsigned int mark) |
569 | { | |
570 | clear_commit_marks_many(1, &commit, mark); | |
571 | } | |
572 | ||
a3437b8c JS |
573 | struct commit *pop_commit(struct commit_list **stack) |
574 | { | |
575 | struct commit_list *top = *stack; | |
576 | struct commit *item = top ? top->item : NULL; | |
577 | ||
578 | if (top) { | |
579 | *stack = top->next; | |
580 | free(top); | |
581 | } | |
582 | return item; | |
583 | } | |
584 | ||
a84b794a JH |
585 | /* |
586 | * Topological sort support | |
587 | */ | |
96c4f4a3 | 588 | |
a84b794a JH |
589 | /* count number of children that have not been emitted */ |
590 | define_commit_slab(indegree_slab, int); | |
96c4f4a3 | 591 | |
81c6b38b JH |
592 | /* record author-date for each commit object */ |
593 | define_commit_slab(author_date_slab, unsigned long); | |
594 | ||
595 | static void record_author_date(struct author_date_slab *author_date, | |
596 | struct commit *commit) | |
597 | { | |
8597ea3a | 598 | const char *buffer = get_commit_buffer(commit, NULL); |
81c6b38b | 599 | struct ident_split ident; |
ea5517f0 JK |
600 | const char *ident_line; |
601 | size_t ident_len; | |
81c6b38b | 602 | char *date_end; |
dddbad72 | 603 | timestamp_t date; |
81c6b38b | 604 | |
ea5517f0 JK |
605 | ident_line = find_commit_header(buffer, "author", &ident_len); |
606 | if (!ident_line) | |
607 | goto fail_exit; /* no author line */ | |
608 | if (split_ident_line(&ident, ident_line, ident_len) || | |
609 | !ident.date_begin || !ident.date_end) | |
610 | goto fail_exit; /* malformed "author" line */ | |
81c6b38b | 611 | |
1aeb7e75 | 612 | date = parse_timestamp(ident.date_begin, &date_end, 10); |
81c6b38b JH |
613 | if (date_end != ident.date_end) |
614 | goto fail_exit; /* malformed date */ | |
615 | *(author_date_slab_at(author_date, commit)) = date; | |
616 | ||
617 | fail_exit: | |
ba41c1c9 | 618 | unuse_commit_buffer(commit, buffer); |
81c6b38b JH |
619 | } |
620 | ||
621 | static int compare_commits_by_author_date(const void *a_, const void *b_, | |
622 | void *cb_data) | |
623 | { | |
624 | const struct commit *a = a_, *b = b_; | |
625 | struct author_date_slab *author_date = cb_data; | |
dddbad72 JS |
626 | timestamp_t a_date = *(author_date_slab_at(author_date, a)); |
627 | timestamp_t b_date = *(author_date_slab_at(author_date, b)); | |
81c6b38b JH |
628 | |
629 | /* newer commits with larger date first */ | |
630 | if (a_date < b_date) | |
631 | return 1; | |
632 | else if (a_date > b_date) | |
633 | return -1; | |
634 | return 0; | |
635 | } | |
636 | ||
727377ff | 637 | int compare_commits_by_commit_date(const void *a_, const void *b_, void *unused) |
da24b104 JH |
638 | { |
639 | const struct commit *a = a_, *b = b_; | |
640 | /* newer commits with larger date first */ | |
641 | if (a->date < b->date) | |
642 | return 1; | |
643 | else if (a->date > b->date) | |
644 | return -1; | |
645 | return 0; | |
646 | } | |
647 | ||
ab580ace JS |
648 | /* |
649 | * Performs an in-place topological sort on the list supplied. | |
650 | */ | |
da24b104 | 651 | void sort_in_topological_order(struct commit_list **list, enum rev_sort_order sort_order) |
6b6dcfc2 | 652 | { |
23c17d4a | 653 | struct commit_list *next, *orig = *list; |
23c17d4a | 654 | struct commit_list **pptr; |
a84b794a | 655 | struct indegree_slab indegree; |
da24b104 JH |
656 | struct prio_queue queue; |
657 | struct commit *commit; | |
81c6b38b | 658 | struct author_date_slab author_date; |
a6080a0a | 659 | |
23c17d4a | 660 | if (!orig) |
7d6fb370 | 661 | return; |
23c17d4a LT |
662 | *list = NULL; |
663 | ||
a84b794a | 664 | init_indegree_slab(&indegree); |
da24b104 | 665 | memset(&queue, '\0', sizeof(queue)); |
81c6b38b | 666 | |
da24b104 JH |
667 | switch (sort_order) { |
668 | default: /* REV_SORT_IN_GRAPH_ORDER */ | |
669 | queue.compare = NULL; | |
670 | break; | |
671 | case REV_SORT_BY_COMMIT_DATE: | |
672 | queue.compare = compare_commits_by_commit_date; | |
673 | break; | |
81c6b38b JH |
674 | case REV_SORT_BY_AUTHOR_DATE: |
675 | init_author_date_slab(&author_date); | |
676 | queue.compare = compare_commits_by_author_date; | |
677 | queue.cb_data = &author_date; | |
678 | break; | |
da24b104 | 679 | } |
96c4f4a3 | 680 | |
23c17d4a LT |
681 | /* Mark them and clear the indegree */ |
682 | for (next = orig; next; next = next->next) { | |
683 | struct commit *commit = next->item; | |
a84b794a | 684 | *(indegree_slab_at(&indegree, commit)) = 1; |
81c6b38b JH |
685 | /* also record the author dates, if needed */ |
686 | if (sort_order == REV_SORT_BY_AUTHOR_DATE) | |
687 | record_author_date(&author_date, commit); | |
ab580ace | 688 | } |
23c17d4a | 689 | |
ab580ace | 690 | /* update the indegree */ |
23c17d4a | 691 | for (next = orig; next; next = next->next) { |
da24b104 | 692 | struct commit_list *parents = next->item->parents; |
ab580ace | 693 | while (parents) { |
23c17d4a | 694 | struct commit *parent = parents->item; |
a84b794a | 695 | int *pi = indegree_slab_at(&indegree, parent); |
6b6dcfc2 | 696 | |
96c4f4a3 JK |
697 | if (*pi) |
698 | (*pi)++; | |
23c17d4a | 699 | parents = parents->next; |
ab580ace | 700 | } |
ab580ace | 701 | } |
23c17d4a | 702 | |
a6080a0a | 703 | /* |
674d1727 PH |
704 | * find the tips |
705 | * | |
706 | * tips are nodes not reachable from any other node in the list | |
707 | * | |
708 | * the tips serve as a starting set for the work queue. | |
709 | */ | |
23c17d4a LT |
710 | for (next = orig; next; next = next->next) { |
711 | struct commit *commit = next->item; | |
ab580ace | 712 | |
a84b794a | 713 | if (*(indegree_slab_at(&indegree, commit)) == 1) |
da24b104 | 714 | prio_queue_put(&queue, commit); |
ab580ace | 715 | } |
4c8725f1 | 716 | |
da24b104 JH |
717 | /* |
718 | * This is unfortunate; the initial tips need to be shown | |
719 | * in the order given from the revision traversal machinery. | |
720 | */ | |
721 | if (sort_order == REV_SORT_IN_GRAPH_ORDER) | |
722 | prio_queue_reverse(&queue); | |
723 | ||
724 | /* We no longer need the commit list */ | |
725 | free_commit_list(orig); | |
23c17d4a LT |
726 | |
727 | pptr = list; | |
728 | *list = NULL; | |
da24b104 JH |
729 | while ((commit = prio_queue_get(&queue)) != NULL) { |
730 | struct commit_list *parents; | |
23c17d4a | 731 | |
23c17d4a | 732 | for (parents = commit->parents; parents ; parents = parents->next) { |
cd2b8ae9 | 733 | struct commit *parent = parents->item; |
a84b794a | 734 | int *pi = indegree_slab_at(&indegree, parent); |
23c17d4a | 735 | |
96c4f4a3 | 736 | if (!*pi) |
23c17d4a LT |
737 | continue; |
738 | ||
739 | /* | |
740 | * parents are only enqueued for emission | |
741 | * when all their children have been emitted thereby | |
742 | * guaranteeing topological order. | |
743 | */ | |
da24b104 JH |
744 | if (--(*pi) == 1) |
745 | prio_queue_put(&queue, parent); | |
ab580ace JS |
746 | } |
747 | /* | |
da24b104 JH |
748 | * all children of commit have already been |
749 | * emitted. we can emit it now. | |
674d1727 | 750 | */ |
a84b794a | 751 | *(indegree_slab_at(&indegree, commit)) = 0; |
da24b104 JH |
752 | |
753 | pptr = &commit_list_insert(commit, pptr)->next; | |
ab580ace | 754 | } |
96c4f4a3 | 755 | |
a84b794a | 756 | clear_indegree_slab(&indegree); |
da24b104 | 757 | clear_prio_queue(&queue); |
81c6b38b JH |
758 | if (sort_order == REV_SORT_BY_AUTHOR_DATE) |
759 | clear_author_date_slab(&author_date); | |
ab580ace | 760 | } |
7c6f8aaf | 761 | |
1295228d | 762 | /* merge-base stuff */ |
7c6f8aaf | 763 | |
208acbfb | 764 | /* Remember to update object flag allocation in object.h */ |
577ed5c2 JH |
765 | #define PARENT1 (1u<<16) |
766 | #define PARENT2 (1u<<17) | |
767 | #define STALE (1u<<18) | |
768 | #define RESULT (1u<<19) | |
7c6f8aaf | 769 | |
1295228d JH |
770 | static const unsigned all_flags = (PARENT1 | PARENT2 | STALE | RESULT); |
771 | ||
73f43f22 | 772 | static int queue_has_nonstale(struct prio_queue *queue) |
7c6f8aaf | 773 | { |
73f43f22 JK |
774 | int i; |
775 | for (i = 0; i < queue->nr; i++) { | |
776 | struct commit *commit = queue->array[i].data; | |
777 | if (!(commit->object.flags & STALE)) | |
778 | return 1; | |
7c6f8aaf | 779 | } |
73f43f22 | 780 | return 0; |
7c6f8aaf JS |
781 | } |
782 | ||
d866924a | 783 | /* all input commits in one and twos[] must have been parsed! */ |
da1f5156 | 784 | static struct commit_list *paint_down_to_common(struct commit *one, int n, struct commit **twos) |
7c6f8aaf | 785 | { |
73f43f22 | 786 | struct prio_queue queue = { compare_commits_by_commit_date }; |
7c6f8aaf | 787 | struct commit_list *result = NULL; |
6a938648 | 788 | int i; |
7c6f8aaf | 789 | |
f3249438 | 790 | one->object.flags |= PARENT1; |
73f43f22 JK |
791 | if (!n) { |
792 | commit_list_append(one, &result); | |
793 | return result; | |
794 | } | |
795 | prio_queue_put(&queue, one); | |
796 | ||
6a938648 JH |
797 | for (i = 0; i < n; i++) { |
798 | twos[i]->object.flags |= PARENT2; | |
73f43f22 | 799 | prio_queue_put(&queue, twos[i]); |
6a938648 | 800 | } |
7c6f8aaf | 801 | |
73f43f22 JK |
802 | while (queue_has_nonstale(&queue)) { |
803 | struct commit *commit = prio_queue_get(&queue); | |
7c6f8aaf | 804 | struct commit_list *parents; |
f3249438 | 805 | int flags; |
7c6f8aaf | 806 | |
f3249438 JH |
807 | flags = commit->object.flags & (PARENT1 | PARENT2 | STALE); |
808 | if (flags == (PARENT1 | PARENT2)) { | |
809 | if (!(commit->object.flags & RESULT)) { | |
810 | commit->object.flags |= RESULT; | |
47e44ed1 | 811 | commit_list_insert_by_date(commit, &result); |
f3249438 | 812 | } |
542ccefe JH |
813 | /* Mark parents of a found merge stale */ |
814 | flags |= STALE; | |
7c6f8aaf JS |
815 | } |
816 | parents = commit->parents; | |
817 | while (parents) { | |
818 | struct commit *p = parents->item; | |
819 | parents = parents->next; | |
820 | if ((p->object.flags & flags) == flags) | |
821 | continue; | |
172947e6 MK |
822 | if (parse_commit(p)) |
823 | return NULL; | |
7c6f8aaf | 824 | p->object.flags |= flags; |
73f43f22 | 825 | prio_queue_put(&queue, p); |
7c6f8aaf JS |
826 | } |
827 | } | |
828 | ||
73f43f22 | 829 | clear_prio_queue(&queue); |
da1f5156 JH |
830 | return result; |
831 | } | |
832 | ||
833 | static struct commit_list *merge_bases_many(struct commit *one, int n, struct commit **twos) | |
834 | { | |
835 | struct commit_list *list = NULL; | |
836 | struct commit_list *result = NULL; | |
837 | int i; | |
838 | ||
839 | for (i = 0; i < n; i++) { | |
840 | if (one == twos[i]) | |
841 | /* | |
842 | * We do not mark this even with RESULT so we do not | |
843 | * have to clean it up. | |
844 | */ | |
845 | return commit_list_insert(one, &result); | |
846 | } | |
847 | ||
848 | if (parse_commit(one)) | |
849 | return NULL; | |
850 | for (i = 0; i < n; i++) { | |
851 | if (parse_commit(twos[i])) | |
852 | return NULL; | |
853 | } | |
854 | ||
855 | list = paint_down_to_common(one, n, twos); | |
856 | ||
f3249438 | 857 | while (list) { |
e510ab89 RS |
858 | struct commit *commit = pop_commit(&list); |
859 | if (!(commit->object.flags & STALE)) | |
860 | commit_list_insert_by_date(commit, &result); | |
f3249438 JH |
861 | } |
862 | return result; | |
863 | } | |
7c6f8aaf | 864 | |
5240c9d7 MV |
865 | struct commit_list *get_octopus_merge_bases(struct commit_list *in) |
866 | { | |
867 | struct commit_list *i, *j, *k, *ret = NULL; | |
5240c9d7 | 868 | |
6bc76725 VM |
869 | if (!in) |
870 | return ret; | |
871 | ||
872 | commit_list_insert(in->item, &ret); | |
873 | ||
874 | for (i = in->next; i; i = i->next) { | |
258c03eb | 875 | struct commit_list *new_commits = NULL, *end = NULL; |
6bc76725 VM |
876 | |
877 | for (j = ret; j; j = j->next) { | |
878 | struct commit_list *bases; | |
2ce406cc | 879 | bases = get_merge_bases(i->item, j->item); |
258c03eb BW |
880 | if (!new_commits) |
881 | new_commits = bases; | |
6bc76725 VM |
882 | else |
883 | end->next = bases; | |
884 | for (k = bases; k; k = k->next) | |
885 | end = k; | |
5240c9d7 | 886 | } |
258c03eb | 887 | ret = new_commits; |
5240c9d7 MV |
888 | } |
889 | return ret; | |
890 | } | |
891 | ||
94f0ced0 JH |
892 | static int remove_redundant(struct commit **array, int cnt) |
893 | { | |
894 | /* | |
895 | * Some commit in the array may be an ancestor of | |
896 | * another commit. Move such commit to the end of | |
897 | * the array, and return the number of commits that | |
898 | * are independent from each other. | |
899 | */ | |
900 | struct commit **work; | |
901 | unsigned char *redundant; | |
902 | int *filled_index; | |
903 | int i, j, filled; | |
904 | ||
905 | work = xcalloc(cnt, sizeof(*work)); | |
906 | redundant = xcalloc(cnt, 1); | |
b32fa95f | 907 | ALLOC_ARRAY(filled_index, cnt - 1); |
94f0ced0 | 908 | |
d866924a JH |
909 | for (i = 0; i < cnt; i++) |
910 | parse_commit(array[i]); | |
94f0ced0 JH |
911 | for (i = 0; i < cnt; i++) { |
912 | struct commit_list *common; | |
913 | ||
914 | if (redundant[i]) | |
915 | continue; | |
916 | for (j = filled = 0; j < cnt; j++) { | |
917 | if (i == j || redundant[j]) | |
918 | continue; | |
919 | filled_index[filled] = j; | |
920 | work[filled++] = array[j]; | |
921 | } | |
922 | common = paint_down_to_common(array[i], filled, work); | |
923 | if (array[i]->object.flags & PARENT2) | |
924 | redundant[i] = 1; | |
925 | for (j = 0; j < filled; j++) | |
926 | if (work[j]->object.flags & PARENT1) | |
927 | redundant[filled_index[j]] = 1; | |
928 | clear_commit_marks(array[i], all_flags); | |
abc03512 | 929 | clear_commit_marks_many(filled, work, all_flags); |
94f0ced0 JH |
930 | free_commit_list(common); |
931 | } | |
932 | ||
933 | /* Now collect the result */ | |
45ccef87 | 934 | COPY_ARRAY(work, array, cnt); |
94f0ced0 JH |
935 | for (i = filled = 0; i < cnt; i++) |
936 | if (!redundant[i]) | |
937 | array[filled++] = work[i]; | |
938 | for (j = filled, i = 0; i < cnt; i++) | |
939 | if (redundant[i]) | |
940 | array[j++] = work[i]; | |
941 | free(work); | |
942 | free(redundant); | |
943 | free(filled_index); | |
944 | return filled; | |
945 | } | |
946 | ||
2ce406cc JH |
947 | static struct commit_list *get_merge_bases_many_0(struct commit *one, |
948 | int n, | |
949 | struct commit **twos, | |
950 | int cleanup) | |
f3249438 | 951 | { |
f3249438 JH |
952 | struct commit_list *list; |
953 | struct commit **rslt; | |
954 | struct commit_list *result; | |
94f0ced0 | 955 | int cnt, i; |
f3249438 | 956 | |
6a938648 JH |
957 | result = merge_bases_many(one, n, twos); |
958 | for (i = 0; i < n; i++) { | |
959 | if (one == twos[i]) | |
960 | return result; | |
961 | } | |
f3249438 JH |
962 | if (!result || !result->next) { |
963 | if (cleanup) { | |
964 | clear_commit_marks(one, all_flags); | |
e895cb51 | 965 | clear_commit_marks_many(n, twos, all_flags); |
7c6f8aaf | 966 | } |
f3249438 | 967 | return result; |
7c6f8aaf JS |
968 | } |
969 | ||
f3249438 | 970 | /* There are more than one */ |
4bbaa1eb | 971 | cnt = commit_list_count(result); |
f3249438 JH |
972 | rslt = xcalloc(cnt, sizeof(*rslt)); |
973 | for (list = result, i = 0; list; list = list->next) | |
974 | rslt[i++] = list->item; | |
975 | free_commit_list(result); | |
976 | ||
977 | clear_commit_marks(one, all_flags); | |
e895cb51 | 978 | clear_commit_marks_many(n, twos, all_flags); |
7c6f8aaf | 979 | |
94f0ced0 | 980 | cnt = remove_redundant(rslt, cnt); |
f3249438 | 981 | result = NULL; |
94f0ced0 JH |
982 | for (i = 0; i < cnt; i++) |
983 | commit_list_insert_by_date(rslt[i], &result); | |
f3249438 | 984 | free(rslt); |
7c6f8aaf JS |
985 | return result; |
986 | } | |
2ecd2bbc | 987 | |
2ce406cc JH |
988 | struct commit_list *get_merge_bases_many(struct commit *one, |
989 | int n, | |
990 | struct commit **twos) | |
991 | { | |
992 | return get_merge_bases_many_0(one, n, twos, 1); | |
993 | } | |
994 | ||
995 | struct commit_list *get_merge_bases_many_dirty(struct commit *one, | |
996 | int n, | |
997 | struct commit **twos) | |
998 | { | |
999 | return get_merge_bases_many_0(one, n, twos, 0); | |
1000 | } | |
1001 | ||
1002 | struct commit_list *get_merge_bases(struct commit *one, struct commit *two) | |
6a938648 | 1003 | { |
2ce406cc | 1004 | return get_merge_bases_many_0(one, 1, &two, 1); |
6a938648 JH |
1005 | } |
1006 | ||
a20efee9 | 1007 | /* |
41ccfdd9 | 1008 | * Is "commit" a descendant of one of the elements on the "with_commit" list? |
a20efee9 | 1009 | */ |
7fcdb36e JG |
1010 | int is_descendant_of(struct commit *commit, struct commit_list *with_commit) |
1011 | { | |
1012 | if (!with_commit) | |
1013 | return 1; | |
1014 | while (with_commit) { | |
1015 | struct commit *other; | |
1016 | ||
1017 | other = with_commit->item; | |
1018 | with_commit = with_commit->next; | |
a20efee9 | 1019 | if (in_merge_bases(other, commit)) |
7fcdb36e JG |
1020 | return 1; |
1021 | } | |
1022 | return 0; | |
1023 | } | |
1024 | ||
a20efee9 | 1025 | /* |
4c4b27e8 | 1026 | * Is "commit" an ancestor of one of the "references"? |
a20efee9 | 1027 | */ |
4c4b27e8 | 1028 | int in_merge_bases_many(struct commit *commit, int nr_reference, struct commit **reference) |
2ecd2bbc | 1029 | { |
6440fdba | 1030 | struct commit_list *bases; |
4c4b27e8 | 1031 | int ret = 0, i; |
2ecd2bbc | 1032 | |
4c4b27e8 | 1033 | if (parse_commit(commit)) |
6440fdba | 1034 | return ret; |
4c4b27e8 JH |
1035 | for (i = 0; i < nr_reference; i++) |
1036 | if (parse_commit(reference[i])) | |
1037 | return ret; | |
2ecd2bbc | 1038 | |
4c4b27e8 | 1039 | bases = paint_down_to_common(commit, nr_reference, reference); |
6440fdba JH |
1040 | if (commit->object.flags & PARENT2) |
1041 | ret = 1; | |
b0f9e9ee | 1042 | clear_commit_marks(commit, all_flags); |
557899ff | 1043 | clear_commit_marks_many(nr_reference, reference, all_flags); |
2ecd2bbc JH |
1044 | free_commit_list(bases); |
1045 | return ret; | |
1046 | } | |
98cf9c3b | 1047 | |
4c4b27e8 JH |
1048 | /* |
1049 | * Is "commit" an ancestor of (i.e. reachable from) the "reference"? | |
1050 | */ | |
1051 | int in_merge_bases(struct commit *commit, struct commit *reference) | |
1052 | { | |
1053 | return in_merge_bases_many(commit, 1, &reference); | |
1054 | } | |
1055 | ||
98cf9c3b JH |
1056 | struct commit_list *reduce_heads(struct commit_list *heads) |
1057 | { | |
1058 | struct commit_list *p; | |
1059 | struct commit_list *result = NULL, **tail = &result; | |
f37d3c75 JH |
1060 | struct commit **array; |
1061 | int num_head, i; | |
98cf9c3b JH |
1062 | |
1063 | if (!heads) | |
1064 | return NULL; | |
1065 | ||
f37d3c75 JH |
1066 | /* Uniquify */ |
1067 | for (p = heads; p; p = p->next) | |
1068 | p->item->object.flags &= ~STALE; | |
1069 | for (p = heads, num_head = 0; p; p = p->next) { | |
1070 | if (p->item->object.flags & STALE) | |
711f6b29 | 1071 | continue; |
f37d3c75 JH |
1072 | p->item->object.flags |= STALE; |
1073 | num_head++; | |
1074 | } | |
c4a7b009 | 1075 | array = xcalloc(num_head, sizeof(*array)); |
f37d3c75 JH |
1076 | for (p = heads, i = 0; p; p = p->next) { |
1077 | if (p->item->object.flags & STALE) { | |
1078 | array[i++] = p->item; | |
1079 | p->item->object.flags &= ~STALE; | |
98cf9c3b | 1080 | } |
98cf9c3b | 1081 | } |
f37d3c75 JH |
1082 | num_head = remove_redundant(array, num_head); |
1083 | for (i = 0; i < num_head; i++) | |
1084 | tail = &commit_list_insert(array[i], tail)->next; | |
cb7b29eb | 1085 | free(array); |
98cf9c3b JH |
1086 | return result; |
1087 | } | |
40d52ff7 | 1088 | |
4da72644 MÅ |
1089 | void reduce_heads_replace(struct commit_list **heads) |
1090 | { | |
1091 | struct commit_list *result = reduce_heads(*heads); | |
1092 | free_commit_list(*heads); | |
1093 | *heads = result; | |
1094 | } | |
1095 | ||
ba3c69a9 JH |
1096 | static const char gpg_sig_header[] = "gpgsig"; |
1097 | static const int gpg_sig_header_len = sizeof(gpg_sig_header) - 1; | |
1098 | ||
1099 | static int do_sign_commit(struct strbuf *buf, const char *keyid) | |
1100 | { | |
1101 | struct strbuf sig = STRBUF_INIT; | |
1102 | int inspos, copypos; | |
3324dd8f | 1103 | const char *eoh; |
ba3c69a9 JH |
1104 | |
1105 | /* find the end of the header */ | |
3324dd8f JS |
1106 | eoh = strstr(buf->buf, "\n\n"); |
1107 | if (!eoh) | |
1108 | inspos = buf->len; | |
1109 | else | |
1110 | inspos = eoh - buf->buf + 1; | |
ba3c69a9 JH |
1111 | |
1112 | if (!keyid || !*keyid) | |
1113 | keyid = get_signing_key(); | |
1114 | if (sign_buffer(buf, &sig, keyid)) { | |
1115 | strbuf_release(&sig); | |
1116 | return -1; | |
1117 | } | |
1118 | ||
1119 | for (copypos = 0; sig.buf[copypos]; ) { | |
1120 | const char *bol = sig.buf + copypos; | |
1121 | const char *eol = strchrnul(bol, '\n'); | |
1122 | int len = (eol - bol) + !!*eol; | |
1123 | ||
1124 | if (!copypos) { | |
1125 | strbuf_insert(buf, inspos, gpg_sig_header, gpg_sig_header_len); | |
1126 | inspos += gpg_sig_header_len; | |
1127 | } | |
1128 | strbuf_insert(buf, inspos++, " ", 1); | |
1129 | strbuf_insert(buf, inspos, bol, len); | |
1130 | inspos += len; | |
1131 | copypos += len; | |
1132 | } | |
1133 | strbuf_release(&sig); | |
1134 | return 0; | |
1135 | } | |
1136 | ||
218aa3a6 | 1137 | int parse_signed_commit(const struct commit *commit, |
0c37f1fc JH |
1138 | struct strbuf *payload, struct strbuf *signature) |
1139 | { | |
218aa3a6 | 1140 | |
0c37f1fc | 1141 | unsigned long size; |
218aa3a6 | 1142 | const char *buffer = get_commit_buffer(commit, &size); |
0c37f1fc | 1143 | int in_signature, saw_signature = -1; |
218aa3a6 | 1144 | const char *line, *tail; |
0c37f1fc JH |
1145 | |
1146 | line = buffer; | |
1147 | tail = buffer + size; | |
1148 | in_signature = 0; | |
1149 | saw_signature = 0; | |
1150 | while (line < tail) { | |
1151 | const char *sig = NULL; | |
218aa3a6 | 1152 | const char *next = memchr(line, '\n', tail - line); |
0c37f1fc JH |
1153 | |
1154 | next = next ? next + 1 : tail; | |
1155 | if (in_signature && line[0] == ' ') | |
1156 | sig = line + 1; | |
59556548 | 1157 | else if (starts_with(line, gpg_sig_header) && |
0c37f1fc JH |
1158 | line[gpg_sig_header_len] == ' ') |
1159 | sig = line + gpg_sig_header_len + 1; | |
1160 | if (sig) { | |
1161 | strbuf_add(signature, sig, next - sig); | |
1162 | saw_signature = 1; | |
1163 | in_signature = 1; | |
1164 | } else { | |
1165 | if (*line == '\n') | |
1166 | /* dump the whole remainder of the buffer */ | |
1167 | next = tail; | |
1168 | strbuf_add(payload, line, next - line); | |
1169 | in_signature = 0; | |
1170 | } | |
1171 | line = next; | |
1172 | } | |
218aa3a6 | 1173 | unuse_commit_buffer(commit, buffer); |
0c37f1fc JH |
1174 | return saw_signature; |
1175 | } | |
1176 | ||
0b05ab6f CC |
1177 | int remove_signature(struct strbuf *buf) |
1178 | { | |
1179 | const char *line = buf->buf; | |
1180 | const char *tail = buf->buf + buf->len; | |
1181 | int in_signature = 0; | |
1182 | const char *sig_start = NULL; | |
1183 | const char *sig_end = NULL; | |
1184 | ||
1185 | while (line < tail) { | |
1186 | const char *next = memchr(line, '\n', tail - line); | |
1187 | next = next ? next + 1 : tail; | |
1188 | ||
1189 | if (in_signature && line[0] == ' ') | |
1190 | sig_end = next; | |
1191 | else if (starts_with(line, gpg_sig_header) && | |
1192 | line[gpg_sig_header_len] == ' ') { | |
1193 | sig_start = line; | |
1194 | sig_end = next; | |
1195 | in_signature = 1; | |
1196 | } else { | |
1197 | if (*line == '\n') | |
1198 | /* dump the whole remainder of the buffer */ | |
1199 | next = tail; | |
1200 | in_signature = 0; | |
1201 | } | |
1202 | line = next; | |
1203 | } | |
1204 | ||
1205 | if (sig_start) | |
1206 | strbuf_remove(buf, sig_start - buf->buf, sig_end - sig_start); | |
1207 | ||
1208 | return sig_start != NULL; | |
1209 | } | |
1210 | ||
5231c633 JH |
1211 | static void handle_signed_tag(struct commit *parent, struct commit_extra_header ***tail) |
1212 | { | |
1213 | struct merge_remote_desc *desc; | |
1214 | struct commit_extra_header *mergetag; | |
1215 | char *buf; | |
1216 | unsigned long size, len; | |
1217 | enum object_type type; | |
1218 | ||
1219 | desc = merge_remote_util(parent); | |
1220 | if (!desc || !desc->obj) | |
1221 | return; | |
ed1c9977 | 1222 | buf = read_sha1_file(desc->obj->oid.hash, &type, &size); |
5231c633 JH |
1223 | if (!buf || type != OBJ_TAG) |
1224 | goto free_return; | |
1225 | len = parse_signature(buf, size); | |
1226 | if (size == len) | |
1227 | goto free_return; | |
1228 | /* | |
1229 | * We could verify this signature and either omit the tag when | |
1230 | * it does not validate, but the integrator may not have the | |
1231 | * public key of the signer of the tag he is merging, while a | |
1232 | * later auditor may have it while auditing, so let's not run | |
1233 | * verify-signed-buffer here for now... | |
1234 | * | |
1235 | * if (verify_signed_buffer(buf, len, buf + len, size - len, ...)) | |
1236 | * warn("warning: signed tag unverified."); | |
1237 | */ | |
1238 | mergetag = xcalloc(1, sizeof(*mergetag)); | |
1239 | mergetag->key = xstrdup("mergetag"); | |
1240 | mergetag->value = buf; | |
1241 | mergetag->len = size; | |
1242 | ||
1243 | **tail = mergetag; | |
1244 | *tail = &mergetag->next; | |
1245 | return; | |
1246 | ||
1247 | free_return: | |
1248 | free(buf); | |
1249 | } | |
1250 | ||
434060ec | 1251 | int check_commit_signature(const struct commit *commit, struct signature_check *sigc) |
ffb6d7d5 SG |
1252 | { |
1253 | struct strbuf payload = STRBUF_INIT; | |
1254 | struct strbuf signature = STRBUF_INIT; | |
434060ec | 1255 | int ret = 1; |
ffb6d7d5 SG |
1256 | |
1257 | sigc->result = 'N'; | |
1258 | ||
218aa3a6 | 1259 | if (parse_signed_commit(commit, &payload, &signature) <= 0) |
ffb6d7d5 | 1260 | goto out; |
434060ec | 1261 | ret = check_signature(payload.buf, payload.len, signature.buf, |
1262 | signature.len, sigc); | |
ffb6d7d5 SG |
1263 | |
1264 | out: | |
ffb6d7d5 SG |
1265 | strbuf_release(&payload); |
1266 | strbuf_release(&signature); | |
434060ec | 1267 | |
1268 | return ret; | |
ffb6d7d5 SG |
1269 | } |
1270 | ||
1271 | ||
1272 | ||
5231c633 JH |
1273 | void append_merge_tag_headers(struct commit_list *parents, |
1274 | struct commit_extra_header ***tail) | |
1275 | { | |
1276 | while (parents) { | |
1277 | struct commit *parent = parents->item; | |
1278 | handle_signed_tag(parent, tail); | |
1279 | parents = parents->next; | |
1280 | } | |
1281 | } | |
1282 | ||
1283 | static void add_extra_header(struct strbuf *buffer, | |
1284 | struct commit_extra_header *extra) | |
1285 | { | |
1286 | strbuf_addstr(buffer, extra->key); | |
ed7a42a0 JH |
1287 | if (extra->len) |
1288 | strbuf_add_lines(buffer, " ", extra->value, extra->len); | |
1289 | else | |
1290 | strbuf_addch(buffer, '\n'); | |
1291 | } | |
1292 | ||
c871a1d1 JH |
1293 | struct commit_extra_header *read_commit_extra_headers(struct commit *commit, |
1294 | const char **exclude) | |
ed7a42a0 JH |
1295 | { |
1296 | struct commit_extra_header *extra = NULL; | |
1297 | unsigned long size; | |
218aa3a6 JK |
1298 | const char *buffer = get_commit_buffer(commit, &size); |
1299 | extra = read_commit_extra_header_lines(buffer, size, exclude); | |
1300 | unuse_commit_buffer(commit, buffer); | |
ed7a42a0 JH |
1301 | return extra; |
1302 | } | |
1303 | ||
063da62b CC |
1304 | void for_each_mergetag(each_mergetag_fn fn, struct commit *commit, void *data) |
1305 | { | |
1306 | struct commit_extra_header *extra, *to_free; | |
1307 | ||
1308 | to_free = read_commit_extra_headers(commit, NULL); | |
1309 | for (extra = to_free; extra; extra = extra->next) { | |
1310 | if (strcmp(extra->key, "mergetag")) | |
1311 | continue; /* not a merge tag */ | |
1312 | fn(commit, extra, data); | |
1313 | } | |
1314 | free_commit_extra_headers(to_free); | |
1315 | } | |
1316 | ||
ed7a42a0 JH |
1317 | static inline int standard_header_field(const char *field, size_t len) |
1318 | { | |
b072504c RS |
1319 | return ((len == 4 && !memcmp(field, "tree", 4)) || |
1320 | (len == 6 && !memcmp(field, "parent", 6)) || | |
1321 | (len == 6 && !memcmp(field, "author", 6)) || | |
1322 | (len == 9 && !memcmp(field, "committer", 9)) || | |
1323 | (len == 8 && !memcmp(field, "encoding", 8))); | |
ed7a42a0 JH |
1324 | } |
1325 | ||
c871a1d1 JH |
1326 | static int excluded_header_field(const char *field, size_t len, const char **exclude) |
1327 | { | |
1328 | if (!exclude) | |
1329 | return 0; | |
1330 | ||
1331 | while (*exclude) { | |
1332 | size_t xlen = strlen(*exclude); | |
b072504c | 1333 | if (len == xlen && !memcmp(field, *exclude, xlen)) |
c871a1d1 JH |
1334 | return 1; |
1335 | exclude++; | |
1336 | } | |
1337 | return 0; | |
1338 | } | |
1339 | ||
82a75299 JH |
1340 | static struct commit_extra_header *read_commit_extra_header_lines( |
1341 | const char *buffer, size_t size, | |
1342 | const char **exclude) | |
ed7a42a0 JH |
1343 | { |
1344 | struct commit_extra_header *extra = NULL, **tail = &extra, *it = NULL; | |
1345 | const char *line, *next, *eof, *eob; | |
1346 | struct strbuf buf = STRBUF_INIT; | |
1347 | ||
1348 | for (line = buffer, eob = line + size; | |
1349 | line < eob && *line != '\n'; | |
1350 | line = next) { | |
1351 | next = memchr(line, '\n', eob - line); | |
1352 | next = next ? next + 1 : eob; | |
1353 | if (*line == ' ') { | |
1354 | /* continuation */ | |
1355 | if (it) | |
1356 | strbuf_add(&buf, line + 1, next - (line + 1)); | |
1357 | continue; | |
1358 | } | |
1359 | if (it) | |
1360 | it->value = strbuf_detach(&buf, &it->len); | |
1361 | strbuf_reset(&buf); | |
1362 | it = NULL; | |
1363 | ||
50a01cc4 RS |
1364 | eof = memchr(line, ' ', next - line); |
1365 | if (!eof) | |
ed7a42a0 | 1366 | eof = next; |
b072504c RS |
1367 | else if (standard_header_field(line, eof - line) || |
1368 | excluded_header_field(line, eof - line, exclude)) | |
ed7a42a0 JH |
1369 | continue; |
1370 | ||
1371 | it = xcalloc(1, sizeof(*it)); | |
1372 | it->key = xmemdupz(line, eof-line); | |
1373 | *tail = it; | |
1374 | tail = &it->next; | |
1375 | if (eof + 1 < next) | |
1376 | strbuf_add(&buf, eof + 1, next - (eof + 1)); | |
1377 | } | |
1378 | if (it) | |
1379 | it->value = strbuf_detach(&buf, &it->len); | |
1380 | return extra; | |
5231c633 JH |
1381 | } |
1382 | ||
1383 | void free_commit_extra_headers(struct commit_extra_header *extra) | |
1384 | { | |
1385 | while (extra) { | |
1386 | struct commit_extra_header *next = extra->next; | |
1387 | free(extra->key); | |
1388 | free(extra->value); | |
1389 | free(extra); | |
1390 | extra = next; | |
1391 | } | |
1392 | } | |
1393 | ||
5078f344 PO |
1394 | int commit_tree(const char *msg, size_t msg_len, const struct object_id *tree, |
1395 | struct commit_list *parents, struct object_id *ret, | |
ba3c69a9 | 1396 | const char *author, const char *sign_commit) |
5231c633 JH |
1397 | { |
1398 | struct commit_extra_header *extra = NULL, **tail = &extra; | |
1399 | int result; | |
1400 | ||
1401 | append_merge_tag_headers(parents, &tail); | |
3ffefb54 | 1402 | result = commit_tree_extended(msg, msg_len, tree, parents, ret, |
ba3c69a9 | 1403 | author, sign_commit, extra); |
5231c633 JH |
1404 | free_commit_extra_headers(extra); |
1405 | return result; | |
1406 | } | |
1407 | ||
08a94a14 LT |
1408 | static int find_invalid_utf8(const char *buf, int len) |
1409 | { | |
1410 | int offset = 0; | |
e82bd6cc | 1411 | static const unsigned int max_codepoint[] = { |
1412 | 0x7f, 0x7ff, 0xffff, 0x10ffff | |
1413 | }; | |
08a94a14 LT |
1414 | |
1415 | while (len) { | |
1416 | unsigned char c = *buf++; | |
1417 | int bytes, bad_offset; | |
28110d4b | 1418 | unsigned int codepoint; |
e82bd6cc | 1419 | unsigned int min_val, max_val; |
08a94a14 LT |
1420 | |
1421 | len--; | |
1422 | offset++; | |
1423 | ||
1424 | /* Simple US-ASCII? No worries. */ | |
1425 | if (c < 0x80) | |
1426 | continue; | |
1427 | ||
1428 | bad_offset = offset-1; | |
1429 | ||
1430 | /* | |
1431 | * Count how many more high bits set: that's how | |
1432 | * many more bytes this sequence should have. | |
1433 | */ | |
1434 | bytes = 0; | |
1435 | while (c & 0x40) { | |
1436 | c <<= 1; | |
1437 | bytes++; | |
1438 | } | |
1439 | ||
28110d4b | 1440 | /* |
1441 | * Must be between 1 and 3 more bytes. Longer sequences result in | |
1442 | * codepoints beyond U+10FFFF, which are guaranteed never to exist. | |
1443 | */ | |
1444 | if (bytes < 1 || 3 < bytes) | |
08a94a14 LT |
1445 | return bad_offset; |
1446 | ||
1447 | /* Do we *have* that many bytes? */ | |
1448 | if (len < bytes) | |
1449 | return bad_offset; | |
1450 | ||
e82bd6cc | 1451 | /* |
1452 | * Place the encoded bits at the bottom of the value and compute the | |
1453 | * valid range. | |
1454 | */ | |
28110d4b | 1455 | codepoint = (c & 0x7f) >> bytes; |
e82bd6cc | 1456 | min_val = max_codepoint[bytes-1] + 1; |
1457 | max_val = max_codepoint[bytes]; | |
28110d4b | 1458 | |
08a94a14 LT |
1459 | offset += bytes; |
1460 | len -= bytes; | |
1461 | ||
1462 | /* And verify that they are good continuation bytes */ | |
1463 | do { | |
28110d4b | 1464 | codepoint <<= 6; |
1465 | codepoint |= *buf & 0x3f; | |
08a94a14 LT |
1466 | if ((*buf++ & 0xc0) != 0x80) |
1467 | return bad_offset; | |
1468 | } while (--bytes); | |
1469 | ||
e82bd6cc | 1470 | /* Reject codepoints that are out of range for the sequence length. */ |
1471 | if (codepoint < min_val || codepoint > max_val) | |
28110d4b | 1472 | return bad_offset; |
1473 | /* Surrogates are only for UTF-16 and cannot be encoded in UTF-8. */ | |
1474 | if ((codepoint & 0x1ff800) == 0xd800) | |
1475 | return bad_offset; | |
81050ac6 | 1476 | /* U+xxFFFE and U+xxFFFF are guaranteed non-characters. */ |
dc773a67 | 1477 | if ((codepoint & 0xfffe) == 0xfffe) |
81050ac6 PK |
1478 | return bad_offset; |
1479 | /* So are anything in the range U+FDD0..U+FDEF. */ | |
1480 | if (codepoint >= 0xfdd0 && codepoint <= 0xfdef) | |
28110d4b | 1481 | return bad_offset; |
08a94a14 LT |
1482 | } |
1483 | return -1; | |
1484 | } | |
1485 | ||
1486 | /* | |
1487 | * This verifies that the buffer is in proper utf8 format. | |
1488 | * | |
1489 | * If it isn't, it assumes any non-utf8 characters are Latin1, | |
1490 | * and does the conversion. | |
08a94a14 LT |
1491 | */ |
1492 | static int verify_utf8(struct strbuf *buf) | |
1493 | { | |
1494 | int ok = 1; | |
1495 | long pos = 0; | |
1496 | ||
1497 | for (;;) { | |
1498 | int bad; | |
1499 | unsigned char c; | |
1500 | unsigned char replace[2]; | |
1501 | ||
1502 | bad = find_invalid_utf8(buf->buf + pos, buf->len - pos); | |
1503 | if (bad < 0) | |
1504 | return ok; | |
1505 | pos += bad; | |
1506 | ok = 0; | |
1507 | c = buf->buf[pos]; | |
1508 | strbuf_remove(buf, pos, 1); | |
1509 | ||
1510 | /* We know 'c' must be in the range 128-255 */ | |
1511 | replace[0] = 0xc0 + (c >> 6); | |
1512 | replace[1] = 0x80 + (c & 0x3f); | |
1513 | strbuf_insert(buf, pos, replace, 2); | |
1514 | pos += 2; | |
1515 | } | |
1516 | } | |
1517 | ||
40d52ff7 | 1518 | static const char commit_utf8_warn[] = |
4fa4b315 VA |
1519 | N_("Warning: commit message did not conform to UTF-8.\n" |
1520 | "You may want to amend it after fixing the message, or set the config\n" | |
1521 | "variable i18n.commitencoding to the encoding your project uses.\n"); | |
40d52ff7 | 1522 | |
3ffefb54 | 1523 | int commit_tree_extended(const char *msg, size_t msg_len, |
5078f344 PO |
1524 | const struct object_id *tree, |
1525 | struct commit_list *parents, struct object_id *ret, | |
ba3c69a9 JH |
1526 | const char *author, const char *sign_commit, |
1527 | struct commit_extra_header *extra) | |
40d52ff7 JK |
1528 | { |
1529 | int result; | |
1530 | int encoding_is_utf8; | |
1531 | struct strbuf buffer; | |
1532 | ||
5078f344 | 1533 | assert_sha1_type(tree->hash, OBJ_TREE); |
40d52ff7 | 1534 | |
3ffefb54 | 1535 | if (memchr(msg, '\0', msg_len)) |
37576c14 NTND |
1536 | return error("a NUL byte in commit log message not allowed."); |
1537 | ||
40d52ff7 JK |
1538 | /* Not having i18n.commitencoding is the same as having utf-8 */ |
1539 | encoding_is_utf8 = is_encoding_utf8(git_commit_encoding); | |
1540 | ||
1541 | strbuf_init(&buffer, 8192); /* should avoid reallocs for the headers */ | |
5078f344 | 1542 | strbuf_addf(&buffer, "tree %s\n", oid_to_hex(tree)); |
40d52ff7 JK |
1543 | |
1544 | /* | |
1545 | * NOTE! This ordering means that the same exact tree merged with a | |
1546 | * different order of parents will be a _different_ changeset even | |
1547 | * if everything else stays the same. | |
1548 | */ | |
1549 | while (parents) { | |
e510ab89 | 1550 | struct commit *parent = pop_commit(&parents); |
40d52ff7 | 1551 | strbuf_addf(&buffer, "parent %s\n", |
f2fd0760 | 1552 | oid_to_hex(&parent->object.oid)); |
40d52ff7 JK |
1553 | } |
1554 | ||
1555 | /* Person/date information */ | |
1556 | if (!author) | |
f9bc573f | 1557 | author = git_author_info(IDENT_STRICT); |
40d52ff7 | 1558 | strbuf_addf(&buffer, "author %s\n", author); |
f9bc573f | 1559 | strbuf_addf(&buffer, "committer %s\n", git_committer_info(IDENT_STRICT)); |
40d52ff7 JK |
1560 | if (!encoding_is_utf8) |
1561 | strbuf_addf(&buffer, "encoding %s\n", git_commit_encoding); | |
5231c633 JH |
1562 | |
1563 | while (extra) { | |
1564 | add_extra_header(&buffer, extra); | |
1565 | extra = extra->next; | |
1566 | } | |
40d52ff7 JK |
1567 | strbuf_addch(&buffer, '\n'); |
1568 | ||
1569 | /* And add the comment */ | |
3ffefb54 | 1570 | strbuf_add(&buffer, msg, msg_len); |
40d52ff7 JK |
1571 | |
1572 | /* And check the encoding */ | |
08a94a14 | 1573 | if (encoding_is_utf8 && !verify_utf8(&buffer)) |
4fa4b315 | 1574 | fprintf(stderr, _(commit_utf8_warn)); |
40d52ff7 | 1575 | |
e505146d RS |
1576 | if (sign_commit && do_sign_commit(&buffer, sign_commit)) { |
1577 | result = -1; | |
1578 | goto out; | |
1579 | } | |
ba3c69a9 | 1580 | |
a09c985e | 1581 | result = write_object_file(buffer.buf, buffer.len, commit_type, ret); |
e505146d | 1582 | out: |
40d52ff7 JK |
1583 | strbuf_release(&buffer); |
1584 | return result; | |
1585 | } | |
ae8e4c9c | 1586 | |
beb518c9 RS |
1587 | void set_merge_remote_desc(struct commit *commit, |
1588 | const char *name, struct object *obj) | |
1589 | { | |
1590 | struct merge_remote_desc *desc; | |
5447a76a | 1591 | FLEX_ALLOC_STR(desc, name, name); |
beb518c9 | 1592 | desc->obj = obj; |
beb518c9 RS |
1593 | commit->util = desc; |
1594 | } | |
1595 | ||
ae8e4c9c JH |
1596 | struct commit *get_merge_parent(const char *name) |
1597 | { | |
1598 | struct object *obj; | |
1599 | struct commit *commit; | |
7683e2e6 | 1600 | struct object_id oid; |
e82caf38 | 1601 | if (get_oid(name, &oid)) |
ae8e4c9c | 1602 | return NULL; |
c251c83d | 1603 | obj = parse_object(&oid); |
ae8e4c9c | 1604 | commit = (struct commit *)peel_to_type(name, 0, obj, OBJ_COMMIT); |
beb518c9 RS |
1605 | if (commit && !commit->util) |
1606 | set_merge_remote_desc(commit, name, obj); | |
ae8e4c9c JH |
1607 | return commit; |
1608 | } | |
89b5f1d9 RS |
1609 | |
1610 | /* | |
1611 | * Append a commit to the end of the commit_list. | |
1612 | * | |
1613 | * next starts by pointing to the variable that holds the head of an | |
1614 | * empty commit_list, and is updated to point to the "next" field of | |
1615 | * the last item on the list as new commits are appended. | |
1616 | * | |
1617 | * Usage example: | |
1618 | * | |
1619 | * struct commit_list *list; | |
1620 | * struct commit_list **next = &list; | |
1621 | * | |
1622 | * next = commit_list_append(c1, next); | |
1623 | * next = commit_list_append(c2, next); | |
1624 | * assert(commit_list_count(list) == 2); | |
1625 | * return list; | |
1626 | */ | |
1627 | struct commit_list **commit_list_append(struct commit *commit, | |
1628 | struct commit_list **next) | |
1629 | { | |
258c03eb BW |
1630 | struct commit_list *new_commit = xmalloc(sizeof(struct commit_list)); |
1631 | new_commit->item = commit; | |
1632 | *next = new_commit; | |
1633 | new_commit->next = NULL; | |
1634 | return &new_commit->next; | |
89b5f1d9 | 1635 | } |
efc7df45 | 1636 | |
fe6eb7f2 JK |
1637 | const char *find_commit_header(const char *msg, const char *key, size_t *out_len) |
1638 | { | |
1639 | int key_len = strlen(key); | |
1640 | const char *line = msg; | |
1641 | ||
1642 | while (line) { | |
1643 | const char *eol = strchrnul(line, '\n'); | |
1644 | ||
1645 | if (line == eol) | |
1646 | return NULL; | |
1647 | ||
1648 | if (eol - line > key_len && | |
1649 | !strncmp(line, key, key_len) && | |
1650 | line[key_len] == ' ') { | |
1651 | *out_len = eol - line - key_len - 1; | |
1652 | return line + key_len + 1; | |
1653 | } | |
1654 | line = *eol ? eol + 1 : NULL; | |
1655 | } | |
1656 | return NULL; | |
1657 | } | |
0ed8a4e1 | 1658 | |
8c384589 | 1659 | /* |
710714aa | 1660 | * Inspect the given string and determine the true "end" of the log message, in |
8c384589 | 1661 | * order to find where to put a new Signed-off-by: line. Ignored are |
d76650b8 BM |
1662 | * trailing comment lines and blank lines. To support "git commit -s |
1663 | * --amend" on an existing commit, we also ignore "Conflicts:". To | |
1664 | * support "git commit -v", we truncate at cut lines. | |
8c384589 CC |
1665 | * |
1666 | * Returns the number of bytes from the tail to ignore, to be fed as | |
1667 | * the second parameter to append_signoff(). | |
1668 | */ | |
710714aa | 1669 | int ignore_non_trailer(const char *buf, size_t len) |
8c384589 CC |
1670 | { |
1671 | int boc = 0; | |
1672 | int bol = 0; | |
1673 | int in_old_conflicts_block = 0; | |
d76650b8 | 1674 | size_t cutoff = wt_status_locate_end(buf, len); |
8c384589 | 1675 | |
d76650b8 | 1676 | while (bol < cutoff) { |
710714aa | 1677 | const char *next_line = memchr(buf + bol, '\n', len - bol); |
8c384589 | 1678 | |
710714aa JT |
1679 | if (!next_line) |
1680 | next_line = buf + len; | |
8c384589 CC |
1681 | else |
1682 | next_line++; | |
1683 | ||
710714aa | 1684 | if (buf[bol] == comment_line_char || buf[bol] == '\n') { |
8c384589 CC |
1685 | /* is this the first of the run of comments? */ |
1686 | if (!boc) | |
1687 | boc = bol; | |
1688 | /* otherwise, it is just continuing */ | |
710714aa | 1689 | } else if (starts_with(buf + bol, "Conflicts:\n")) { |
8c384589 CC |
1690 | in_old_conflicts_block = 1; |
1691 | if (!boc) | |
1692 | boc = bol; | |
710714aa | 1693 | } else if (in_old_conflicts_block && buf[bol] == '\t') { |
8c384589 CC |
1694 | ; /* a pathname in the conflicts block */ |
1695 | } else if (boc) { | |
1696 | /* the previous was not trailing comment */ | |
1697 | boc = 0; | |
1698 | in_old_conflicts_block = 0; | |
1699 | } | |
710714aa | 1700 | bol = next_line - buf; |
8c384589 | 1701 | } |
d76650b8 | 1702 | return boc ? len - boc : len - cutoff; |
8c384589 | 1703 | } |