]>
Commit | Line | Data |
---|---|---|
8f1d2e6f | 1 | #include "cache.h" |
961784ee | 2 | #include "tag.h" |
175785e5 | 3 | #include "commit.h" |
175785e5 | 4 | |
60ab26de LT |
5 | int save_commit_buffer = 1; |
6 | ||
ab580ace JS |
7 | struct sort_node |
8 | { | |
9 | /* | |
10 | * the number of children of the associated commit | |
11 | * that also occur in the list being sorted. | |
12 | */ | |
13 | unsigned int indegree; | |
14 | ||
15 | /* | |
16 | * reference to original list item that we will re-use | |
17 | * on output. | |
18 | */ | |
19 | struct commit_list * list_item; | |
20 | ||
21 | }; | |
22 | ||
175785e5 DB |
23 | const char *commit_type = "commit"; |
24 | ||
9b66ec04 LT |
25 | enum cmit_fmt get_commit_format(const char *arg) |
26 | { | |
27 | if (!*arg) | |
28 | return CMIT_FMT_DEFAULT; | |
29 | if (!strcmp(arg, "=raw")) | |
30 | return CMIT_FMT_RAW; | |
31 | if (!strcmp(arg, "=medium")) | |
32 | return CMIT_FMT_MEDIUM; | |
33 | if (!strcmp(arg, "=short")) | |
34 | return CMIT_FMT_SHORT; | |
35 | if (!strcmp(arg, "=full")) | |
36 | return CMIT_FMT_FULL; | |
ff56fe1c JH |
37 | if (!strcmp(arg, "=fuller")) |
38 | return CMIT_FMT_FULLER; | |
d87449c5 JH |
39 | if (!strcmp(arg, "=oneline")) |
40 | return CMIT_FMT_ONELINE; | |
9b66ec04 LT |
41 | die("invalid --pretty format"); |
42 | } | |
43 | ||
f76412ed JH |
44 | static struct commit *check_commit(struct object *obj, |
45 | const unsigned char *sha1, | |
46 | int quiet) | |
961784ee LT |
47 | { |
48 | if (obj->type != commit_type) { | |
f76412ed JH |
49 | if (!quiet) |
50 | error("Object %s is a %s, not a commit", | |
51 | sha1_to_hex(sha1), obj->type); | |
961784ee LT |
52 | return NULL; |
53 | } | |
54 | return (struct commit *) obj; | |
55 | } | |
56 | ||
f76412ed JH |
57 | struct commit *lookup_commit_reference_gently(const unsigned char *sha1, |
58 | int quiet) | |
961784ee | 59 | { |
9534f40b | 60 | struct object *obj = deref_tag(parse_object(sha1), NULL, 0); |
961784ee LT |
61 | |
62 | if (!obj) | |
63 | return NULL; | |
f76412ed JH |
64 | return check_commit(obj, sha1, quiet); |
65 | } | |
66 | ||
67 | struct commit *lookup_commit_reference(const unsigned char *sha1) | |
68 | { | |
69 | return lookup_commit_reference_gently(sha1, 0); | |
961784ee LT |
70 | } |
71 | ||
5d6ccf5c | 72 | struct commit *lookup_commit(const unsigned char *sha1) |
175785e5 DB |
73 | { |
74 | struct object *obj = lookup_object(sha1); | |
75 | if (!obj) { | |
90321c10 | 76 | struct commit *ret = xcalloc(1, sizeof(struct commit)); |
175785e5 | 77 | created_object(sha1, &ret->object); |
d32987be | 78 | ret->object.type = commit_type; |
175785e5 DB |
79 | return ret; |
80 | } | |
d1af002d NP |
81 | if (!obj->type) |
82 | obj->type = commit_type; | |
f76412ed | 83 | return check_commit(obj, sha1, 0); |
175785e5 DB |
84 | } |
85 | ||
86 | static unsigned long parse_commit_date(const char *buf) | |
87 | { | |
88 | unsigned long date; | |
89 | ||
90 | if (memcmp(buf, "author", 6)) | |
91 | return 0; | |
92 | while (*buf++ != '\n') | |
93 | /* nada */; | |
94 | if (memcmp(buf, "committer", 9)) | |
95 | return 0; | |
96 | while (*buf++ != '>') | |
97 | /* nada */; | |
98 | date = strtoul(buf, NULL, 10); | |
99 | if (date == ULONG_MAX) | |
100 | date = 0; | |
101 | return date; | |
102 | } | |
103 | ||
5040f17e | 104 | static struct commit_graft **commit_graft; |
5da5c8f4 JH |
105 | static int commit_graft_alloc, commit_graft_nr; |
106 | ||
107 | static int commit_graft_pos(const unsigned char *sha1) | |
108 | { | |
109 | int lo, hi; | |
110 | lo = 0; | |
111 | hi = commit_graft_nr; | |
112 | while (lo < hi) { | |
113 | int mi = (lo + hi) / 2; | |
114 | struct commit_graft *graft = commit_graft[mi]; | |
115 | int cmp = memcmp(sha1, graft->sha1, 20); | |
116 | if (!cmp) | |
117 | return mi; | |
118 | if (cmp < 0) | |
119 | hi = mi; | |
120 | else | |
121 | lo = mi + 1; | |
122 | } | |
123 | return -lo - 1; | |
124 | } | |
125 | ||
5040f17e JH |
126 | int register_commit_graft(struct commit_graft *graft, int ignore_dups) |
127 | { | |
128 | int pos = commit_graft_pos(graft->sha1); | |
129 | ||
130 | if (0 <= pos) { | |
131 | if (ignore_dups) | |
132 | free(graft); | |
133 | else { | |
134 | free(commit_graft[pos]); | |
135 | commit_graft[pos] = graft; | |
136 | } | |
137 | return 1; | |
138 | } | |
139 | pos = -pos - 1; | |
140 | if (commit_graft_alloc <= ++commit_graft_nr) { | |
141 | commit_graft_alloc = alloc_nr(commit_graft_alloc); | |
142 | commit_graft = xrealloc(commit_graft, | |
143 | sizeof(*commit_graft) * | |
144 | commit_graft_alloc); | |
145 | } | |
146 | if (pos < commit_graft_nr) | |
147 | memmove(commit_graft + pos + 1, | |
148 | commit_graft + pos, | |
149 | (commit_graft_nr - pos - 1) * | |
150 | sizeof(*commit_graft)); | |
151 | commit_graft[pos] = graft; | |
152 | return 0; | |
153 | } | |
154 | ||
155 | struct commit_graft *read_graft_line(char *buf, int len) | |
156 | { | |
157 | /* The format is just "Commit Parent1 Parent2 ...\n" */ | |
158 | int i; | |
159 | struct commit_graft *graft = NULL; | |
160 | ||
161 | if (buf[len-1] == '\n') | |
162 | buf[--len] = 0; | |
360204c3 | 163 | if (buf[0] == '#' || buf[0] == '\0') |
5bc4ce58 | 164 | return NULL; |
5040f17e JH |
165 | if ((len + 1) % 41) { |
166 | bad_graft_data: | |
167 | error("bad graft data: %s", buf); | |
168 | free(graft); | |
169 | return NULL; | |
170 | } | |
171 | i = (len + 1) / 41 - 1; | |
172 | graft = xmalloc(sizeof(*graft) + 20 * i); | |
173 | graft->nr_parent = i; | |
174 | if (get_sha1_hex(buf, graft->sha1)) | |
175 | goto bad_graft_data; | |
176 | for (i = 40; i < len; i += 41) { | |
177 | if (buf[i] != ' ') | |
178 | goto bad_graft_data; | |
179 | if (get_sha1_hex(buf + i + 1, graft->parent[i/41])) | |
180 | goto bad_graft_data; | |
181 | } | |
182 | return graft; | |
183 | } | |
184 | ||
185 | int read_graft_file(const char *graft_file) | |
5da5c8f4 | 186 | { |
5da5c8f4 JH |
187 | FILE *fp = fopen(graft_file, "r"); |
188 | char buf[1024]; | |
5040f17e JH |
189 | if (!fp) |
190 | return -1; | |
5da5c8f4 JH |
191 | while (fgets(buf, sizeof(buf), fp)) { |
192 | /* The format is just "Commit Parent1 Parent2 ...\n" */ | |
193 | int len = strlen(buf); | |
5040f17e | 194 | struct commit_graft *graft = read_graft_line(buf, len); |
5bc4ce58 JH |
195 | if (!graft) |
196 | continue; | |
5040f17e | 197 | if (register_commit_graft(graft, 1)) |
5da5c8f4 | 198 | error("duplicate graft data: %s", buf); |
5da5c8f4 JH |
199 | } |
200 | fclose(fp); | |
5040f17e JH |
201 | return 0; |
202 | } | |
203 | ||
204 | static void prepare_commit_graft(void) | |
205 | { | |
206 | static int commit_graft_prepared; | |
207 | char *graft_file; | |
208 | ||
209 | if (commit_graft_prepared) | |
210 | return; | |
211 | graft_file = get_graft_file(); | |
212 | read_graft_file(graft_file); | |
213 | commit_graft_prepared = 1; | |
5da5c8f4 JH |
214 | } |
215 | ||
216 | static struct commit_graft *lookup_commit_graft(const unsigned char *sha1) | |
217 | { | |
218 | int pos; | |
5040f17e | 219 | prepare_commit_graft(); |
5da5c8f4 JH |
220 | pos = commit_graft_pos(sha1); |
221 | if (pos < 0) | |
222 | return NULL; | |
223 | return commit_graft[pos]; | |
224 | } | |
225 | ||
bd2c39f5 | 226 | int parse_commit_buffer(struct commit *item, void *buffer, unsigned long size) |
175785e5 | 227 | { |
f7cc77d7 | 228 | char *bufptr = buffer; |
175785e5 | 229 | unsigned char parent[20]; |
6c88be16 | 230 | struct commit_list **pptr; |
5da5c8f4 | 231 | struct commit_graft *graft; |
27dedf0c | 232 | unsigned n_refs = 0; |
bd2c39f5 | 233 | |
175785e5 DB |
234 | if (item->object.parsed) |
235 | return 0; | |
236 | item->object.parsed = 1; | |
f7cc77d7 LT |
237 | if (memcmp(bufptr, "tree ", 5)) |
238 | return error("bogus commit object %s", sha1_to_hex(item->object.sha1)); | |
239 | if (get_sha1_hex(bufptr + 5, parent) < 0) | |
bd2afde8 JH |
240 | return error("bad tree pointer in commit %s", |
241 | sha1_to_hex(item->object.sha1)); | |
175785e5 | 242 | item->tree = lookup_tree(parent); |
235ac407 | 243 | if (item->tree) |
27dedf0c | 244 | n_refs++; |
175785e5 | 245 | bufptr += 46; /* "tree " + "hex sha1" + "\n" */ |
6c88be16 | 246 | pptr = &item->parents; |
5da5c8f4 JH |
247 | |
248 | graft = lookup_commit_graft(item->object.sha1); | |
f7cc77d7 LT |
249 | while (!memcmp(bufptr, "parent ", 7)) { |
250 | struct commit *new_parent; | |
251 | ||
252 | if (get_sha1_hex(bufptr + 7, parent) || bufptr[47] != '\n') | |
253 | return error("bad parents in commit %s", sha1_to_hex(item->object.sha1)); | |
5da5c8f4 JH |
254 | bufptr += 48; |
255 | if (graft) | |
256 | continue; | |
f7cc77d7 | 257 | new_parent = lookup_commit(parent); |
235ac407 | 258 | if (new_parent) { |
6c88be16 | 259 | pptr = &commit_list_insert(new_parent, pptr)->next; |
27dedf0c | 260 | n_refs++; |
235ac407 | 261 | } |
5da5c8f4 JH |
262 | } |
263 | if (graft) { | |
264 | int i; | |
265 | struct commit *new_parent; | |
266 | for (i = 0; i < graft->nr_parent; i++) { | |
267 | new_parent = lookup_commit(graft->parent[i]); | |
268 | if (!new_parent) | |
269 | continue; | |
270 | pptr = &commit_list_insert(new_parent, pptr)->next; | |
27dedf0c | 271 | n_refs++; |
5da5c8f4 | 272 | } |
175785e5 DB |
273 | } |
274 | item->date = parse_commit_date(bufptr); | |
27dedf0c JH |
275 | |
276 | if (track_object_refs) { | |
277 | unsigned i = 0; | |
278 | struct commit_list *p; | |
279 | struct object_refs *refs = alloc_object_refs(n_refs); | |
280 | if (item->tree) | |
281 | refs->ref[i++] = &item->tree->object; | |
282 | for (p = item->parents; p; p = p->next) | |
283 | refs->ref[i++] = &p->item->object; | |
284 | set_object_refs(&item->object, refs); | |
285 | } | |
286 | ||
175785e5 DB |
287 | return 0; |
288 | } | |
289 | ||
bd2c39f5 NP |
290 | int parse_commit(struct commit *item) |
291 | { | |
292 | char type[20]; | |
293 | void *buffer; | |
294 | unsigned long size; | |
295 | int ret; | |
296 | ||
297 | if (item->object.parsed) | |
298 | return 0; | |
299 | buffer = read_sha1_file(item->object.sha1, type, &size); | |
300 | if (!buffer) | |
301 | return error("Could not read %s", | |
302 | sha1_to_hex(item->object.sha1)); | |
303 | if (strcmp(type, commit_type)) { | |
304 | free(buffer); | |
305 | return error("Object %s not a commit", | |
306 | sha1_to_hex(item->object.sha1)); | |
307 | } | |
308 | ret = parse_commit_buffer(item, buffer, size); | |
60ab26de | 309 | if (save_commit_buffer && !ret) { |
3ff1fbbb LT |
310 | item->buffer = buffer; |
311 | return 0; | |
312 | } | |
bd2c39f5 NP |
313 | free(buffer); |
314 | return ret; | |
315 | } | |
316 | ||
ac5155ef | 317 | struct commit_list *commit_list_insert(struct commit *item, struct commit_list **list_p) |
dd97f850 | 318 | { |
812666c8 | 319 | struct commit_list *new_list = xmalloc(sizeof(struct commit_list)); |
dd97f850 DB |
320 | new_list->item = item; |
321 | new_list->next = *list_p; | |
322 | *list_p = new_list; | |
ac5155ef | 323 | return new_list; |
dd97f850 DB |
324 | } |
325 | ||
175785e5 DB |
326 | void free_commit_list(struct commit_list *list) |
327 | { | |
328 | while (list) { | |
329 | struct commit_list *temp = list; | |
330 | list = temp->next; | |
331 | free(temp); | |
332 | } | |
333 | } | |
dd97f850 | 334 | |
f755494c | 335 | struct commit_list * insert_by_date(struct commit *item, struct commit_list **list) |
dd97f850 DB |
336 | { |
337 | struct commit_list **pp = list; | |
338 | struct commit_list *p; | |
339 | while ((p = *pp) != NULL) { | |
340 | if (p->item->date < item->date) { | |
341 | break; | |
342 | } | |
343 | pp = &p->next; | |
344 | } | |
f755494c | 345 | return commit_list_insert(item, pp); |
dd97f850 DB |
346 | } |
347 | ||
348 | ||
349 | void sort_by_date(struct commit_list **list) | |
350 | { | |
351 | struct commit_list *ret = NULL; | |
352 | while (*list) { | |
f755494c | 353 | insert_by_date((*list)->item, &ret); |
dd97f850 DB |
354 | *list = (*list)->next; |
355 | } | |
356 | *list = ret; | |
357 | } | |
358 | ||
58e28af6 DB |
359 | struct commit *pop_most_recent_commit(struct commit_list **list, |
360 | unsigned int mark) | |
dd97f850 DB |
361 | { |
362 | struct commit *ret = (*list)->item; | |
363 | struct commit_list *parents = ret->parents; | |
364 | struct commit_list *old = *list; | |
365 | ||
366 | *list = (*list)->next; | |
367 | free(old); | |
368 | ||
369 | while (parents) { | |
4056c091 | 370 | struct commit *commit = parents->item; |
58e28af6 DB |
371 | parse_commit(commit); |
372 | if (!(commit->object.flags & mark)) { | |
373 | commit->object.flags |= mark; | |
f755494c | 374 | insert_by_date(commit, list); |
4056c091 | 375 | } |
dd97f850 DB |
376 | parents = parents->next; |
377 | } | |
378 | return ret; | |
379 | } | |
e3bc7a3b | 380 | |
f8f9c73c JH |
381 | void clear_commit_marks(struct commit *commit, unsigned int mark) |
382 | { | |
383 | struct commit_list *parents; | |
384 | ||
385 | parents = commit->parents; | |
386 | commit->object.flags &= ~mark; | |
387 | while (parents) { | |
181dc776 JH |
388 | struct commit *parent = parents->item; |
389 | if (parent && parent->object.parsed && | |
390 | (parent->object.flags & mark)) | |
391 | clear_commit_marks(parent, mark); | |
f8f9c73c JH |
392 | parents = parents->next; |
393 | } | |
394 | } | |
395 | ||
e3bc7a3b LT |
396 | /* |
397 | * Generic support for pretty-printing the header | |
398 | */ | |
399 | static int get_one_line(const char *msg, unsigned long len) | |
400 | { | |
401 | int ret = 0; | |
402 | ||
403 | while (len--) { | |
404 | char c = *msg++; | |
684958ae LT |
405 | if (!c) |
406 | break; | |
e3bc7a3b LT |
407 | ret++; |
408 | if (c == '\n') | |
409 | break; | |
e3bc7a3b LT |
410 | } |
411 | return ret; | |
412 | } | |
413 | ||
9b66ec04 | 414 | static int add_user_info(const char *what, enum cmit_fmt fmt, char *buf, const char *line) |
e3bc7a3b LT |
415 | { |
416 | char *date; | |
5de36bfe | 417 | int namelen; |
e3bc7a3b | 418 | unsigned long time; |
000182ea | 419 | int tz, ret; |
ff56fe1c | 420 | const char *filler = " "; |
e3bc7a3b | 421 | |
d87449c5 JH |
422 | if (fmt == CMIT_FMT_ONELINE) |
423 | return 0; | |
e3bc7a3b LT |
424 | date = strchr(line, '>'); |
425 | if (!date) | |
426 | return 0; | |
427 | namelen = ++date - line; | |
428 | time = strtoul(date, &date, 10); | |
429 | tz = strtol(date, NULL, 10); | |
430 | ||
ff56fe1c JH |
431 | ret = sprintf(buf, "%s: %.*s%.*s\n", what, |
432 | (fmt == CMIT_FMT_FULLER) ? 4 : 0, | |
433 | filler, namelen, line); | |
434 | switch (fmt) { | |
435 | case CMIT_FMT_MEDIUM: | |
000182ea | 436 | ret += sprintf(buf + ret, "Date: %s\n", show_date(time, tz)); |
ff56fe1c JH |
437 | break; |
438 | case CMIT_FMT_FULLER: | |
439 | ret += sprintf(buf + ret, "%sDate: %s\n", what, show_date(time, tz)); | |
440 | break; | |
441 | default: | |
442 | /* notin' */ | |
443 | break; | |
444 | } | |
000182ea LT |
445 | return ret; |
446 | } | |
447 | ||
448 | static int is_empty_line(const char *line, int len) | |
449 | { | |
450 | while (len && isspace(line[len-1])) | |
451 | len--; | |
452 | return !len; | |
e3bc7a3b LT |
453 | } |
454 | ||
f2d42275 | 455 | static int add_merge_info(enum cmit_fmt fmt, char *buf, const struct commit *commit, int abbrev) |
28342a5d | 456 | { |
f2d42275 JH |
457 | struct commit_list *parent = commit->parents; |
458 | int offset; | |
d87449c5 | 459 | |
f2d42275 JH |
460 | if ((fmt == CMIT_FMT_ONELINE) || !parent || !parent->next) |
461 | return 0; | |
462 | ||
463 | offset = sprintf(buf, "Merge:"); | |
464 | ||
465 | while (parent) { | |
466 | struct commit *p = parent->item; | |
6bfb27a0 JH |
467 | const char *hex = abbrev |
468 | ? find_unique_abbrev(p->object.sha1, abbrev) | |
469 | : sha1_to_hex(p->object.sha1); | |
470 | char *dots = (abbrev && strlen(hex) != 40) ? "..." : ""; | |
f2d42275 JH |
471 | parent = parent->next; |
472 | ||
6bfb27a0 | 473 | offset += sprintf(buf + offset, " %s%s", hex, dots); |
28342a5d | 474 | } |
f2d42275 | 475 | buf[offset++] = '\n'; |
28342a5d LT |
476 | return offset; |
477 | } | |
478 | ||
3815f423 | 479 | unsigned long pretty_print_commit(enum cmit_fmt fmt, const struct commit *commit, unsigned long len, char *buf, unsigned long space, int abbrev) |
e3bc7a3b | 480 | { |
000182ea | 481 | int hdr = 1, body = 0; |
e3bc7a3b | 482 | unsigned long offset = 0; |
d87449c5 | 483 | int indent = (fmt == CMIT_FMT_ONELINE) ? 0 : 4; |
f2d42275 | 484 | int parents_shown = 0; |
3815f423 | 485 | const char *msg = commit->buffer; |
e3bc7a3b LT |
486 | |
487 | for (;;) { | |
488 | const char *line = msg; | |
489 | int linelen = get_one_line(msg, len); | |
490 | ||
491 | if (!linelen) | |
492 | break; | |
493 | ||
494 | /* | |
495 | * We want some slop for indentation and a possible | |
496 | * final "...". Thus the "+ 20". | |
497 | */ | |
498 | if (offset + linelen + 20 > space) { | |
499 | memcpy(buf + offset, " ...\n", 8); | |
500 | offset += 8; | |
501 | break; | |
502 | } | |
503 | ||
504 | msg += linelen; | |
505 | len -= linelen; | |
e3bc7a3b | 506 | if (hdr) { |
000182ea LT |
507 | if (linelen == 1) { |
508 | hdr = 0; | |
d87449c5 JH |
509 | if (fmt != CMIT_FMT_ONELINE) |
510 | buf[offset++] = '\n'; | |
000182ea LT |
511 | continue; |
512 | } | |
513 | if (fmt == CMIT_FMT_RAW) { | |
514 | memcpy(buf + offset, line, linelen); | |
515 | offset += linelen; | |
516 | continue; | |
517 | } | |
28342a5d LT |
518 | if (!memcmp(line, "parent ", 7)) { |
519 | if (linelen != 48) | |
520 | die("bad parent line in commit"); | |
f2d42275 | 521 | continue; |
28342a5d | 522 | } |
ff56fe1c | 523 | |
f2d42275 JH |
524 | if (!parents_shown) { |
525 | offset += add_merge_info(fmt, buf + offset, | |
526 | commit, abbrev); | |
527 | parents_shown = 1; | |
528 | continue; | |
529 | } | |
ff56fe1c JH |
530 | /* |
531 | * MEDIUM == DEFAULT shows only author with dates. | |
532 | * FULL shows both authors but not dates. | |
533 | * FULLER shows both authors and dates. | |
534 | */ | |
e3bc7a3b | 535 | if (!memcmp(line, "author ", 7)) |
ff56fe1c JH |
536 | offset += add_user_info("Author", fmt, |
537 | buf + offset, | |
538 | line + 7); | |
539 | if (!memcmp(line, "committer ", 10) && | |
540 | (fmt == CMIT_FMT_FULL || fmt == CMIT_FMT_FULLER)) | |
541 | offset += add_user_info("Commit", fmt, | |
542 | buf + offset, | |
543 | line + 10); | |
e3bc7a3b LT |
544 | continue; |
545 | } | |
000182ea LT |
546 | |
547 | if (is_empty_line(line, linelen)) { | |
548 | if (!body) | |
549 | continue; | |
550 | if (fmt == CMIT_FMT_SHORT) | |
551 | break; | |
552 | } else { | |
553 | body = 1; | |
554 | } | |
d87449c5 JH |
555 | |
556 | memset(buf + offset, ' ', indent); | |
557 | memcpy(buf + offset + indent, line, linelen); | |
558 | offset += linelen + indent; | |
559 | if (fmt == CMIT_FMT_ONELINE) | |
560 | break; | |
561 | } | |
40c2fe00 LT |
562 | while (offset && isspace(buf[offset-1])) |
563 | offset--; | |
564 | /* Make sure there is an EOLN for the non-oneline case */ | |
565 | if (fmt != CMIT_FMT_ONELINE) | |
566 | buf[offset++] = '\n'; | |
e3bc7a3b LT |
567 | buf[offset] = '\0'; |
568 | return offset; | |
569 | } | |
a3437b8c JS |
570 | |
571 | struct commit *pop_commit(struct commit_list **stack) | |
572 | { | |
573 | struct commit_list *top = *stack; | |
574 | struct commit *item = top ? top->item : NULL; | |
575 | ||
576 | if (top) { | |
577 | *stack = top->next; | |
578 | free(top); | |
579 | } | |
580 | return item; | |
581 | } | |
582 | ||
583 | int count_parents(struct commit * commit) | |
584 | { | |
585 | int count = 0; | |
586 | struct commit_list * parents = commit->parents; | |
587 | for (count=0;parents; parents=parents->next,count++) | |
588 | ; | |
589 | return count; | |
590 | } | |
591 | ||
6b6dcfc2 FK |
592 | void topo_sort_default_setter(struct commit *c, void *data) |
593 | { | |
594 | c->object.util = data; | |
595 | } | |
596 | ||
597 | void *topo_sort_default_getter(struct commit *c) | |
598 | { | |
599 | return c->object.util; | |
600 | } | |
601 | ||
ab580ace JS |
602 | /* |
603 | * Performs an in-place topological sort on the list supplied. | |
604 | */ | |
4c8725f1 | 605 | void sort_in_topological_order(struct commit_list ** list, int lifo) |
6b6dcfc2 FK |
606 | { |
607 | sort_in_topological_order_fn(list, lifo, topo_sort_default_setter, | |
608 | topo_sort_default_getter); | |
609 | } | |
610 | ||
611 | void sort_in_topological_order_fn(struct commit_list ** list, int lifo, | |
612 | topo_sort_set_fn_t setter, | |
613 | topo_sort_get_fn_t getter) | |
ab580ace JS |
614 | { |
615 | struct commit_list * next = *list; | |
2ed02887 | 616 | struct commit_list * work = NULL, **insert; |
ab580ace JS |
617 | struct commit_list ** pptr = list; |
618 | struct sort_node * nodes; | |
619 | struct sort_node * next_nodes; | |
620 | int count = 0; | |
621 | ||
622 | /* determine the size of the list */ | |
623 | while (next) { | |
624 | next = next->next; | |
625 | count++; | |
626 | } | |
7d6fb370 EW |
627 | |
628 | if (!count) | |
629 | return; | |
ab580ace JS |
630 | /* allocate an array to help sort the list */ |
631 | nodes = xcalloc(count, sizeof(*nodes)); | |
632 | /* link the list to the array */ | |
633 | next_nodes = nodes; | |
634 | next=*list; | |
635 | while (next) { | |
636 | next_nodes->list_item = next; | |
6b6dcfc2 | 637 | setter(next->item, next_nodes); |
ab580ace JS |
638 | next_nodes++; |
639 | next = next->next; | |
640 | } | |
641 | /* update the indegree */ | |
642 | next=*list; | |
643 | while (next) { | |
644 | struct commit_list * parents = next->item->parents; | |
645 | while (parents) { | |
646 | struct commit * parent=parents->item; | |
6b6dcfc2 FK |
647 | struct sort_node * pn = (struct sort_node *) getter(parent); |
648 | ||
ab580ace JS |
649 | if (pn) |
650 | pn->indegree++; | |
651 | parents=parents->next; | |
652 | } | |
653 | next=next->next; | |
654 | } | |
655 | /* | |
656 | * find the tips | |
657 | * | |
658 | * tips are nodes not reachable from any other node in the list | |
659 | * | |
660 | * the tips serve as a starting set for the work queue. | |
661 | */ | |
662 | next=*list; | |
2ed02887 | 663 | insert = &work; |
ab580ace | 664 | while (next) { |
6b6dcfc2 | 665 | struct sort_node * node = (struct sort_node *) getter(next->item); |
ab580ace JS |
666 | |
667 | if (node->indegree == 0) { | |
2ed02887 | 668 | insert = &commit_list_insert(next->item, insert)->next; |
ab580ace JS |
669 | } |
670 | next=next->next; | |
671 | } | |
4c8725f1 | 672 | |
ab580ace | 673 | /* process the list in topological order */ |
4c8725f1 JH |
674 | if (!lifo) |
675 | sort_by_date(&work); | |
ab580ace JS |
676 | while (work) { |
677 | struct commit * work_item = pop_commit(&work); | |
6b6dcfc2 | 678 | struct sort_node * work_node = (struct sort_node *) getter(work_item); |
ab580ace JS |
679 | struct commit_list * parents = work_item->parents; |
680 | ||
681 | while (parents) { | |
682 | struct commit * parent=parents->item; | |
6b6dcfc2 FK |
683 | struct sort_node * pn = (struct sort_node *) getter(parent); |
684 | ||
ab580ace | 685 | if (pn) { |
6b6dcfc2 | 686 | /* |
ab580ace JS |
687 | * parents are only enqueued for emission |
688 | * when all their children have been emitted thereby | |
689 | * guaranteeing topological order. | |
690 | */ | |
691 | pn->indegree--; | |
4c8725f1 JH |
692 | if (!pn->indegree) { |
693 | if (!lifo) | |
694 | insert_by_date(parent, &work); | |
695 | else | |
696 | commit_list_insert(parent, &work); | |
697 | } | |
ab580ace JS |
698 | } |
699 | parents=parents->next; | |
700 | } | |
701 | /* | |
702 | * work_item is a commit all of whose children | |
703 | * have already been emitted. we can emit it now. | |
704 | */ | |
705 | *pptr = work_node->list_item; | |
706 | pptr = &(*pptr)->next; | |
707 | *pptr = NULL; | |
6b6dcfc2 | 708 | setter(work_item, NULL); |
ab580ace JS |
709 | } |
710 | free(nodes); | |
711 | } |