1#ifndef COMMIT_H
2#define COMMIT_H
3
4#include "object.h"
5#include "tree.h"
6
7struct commit_list {
8 struct commit *item;
9 struct commit_list *next;
10};
11
12struct commit {
13 struct object object;
14 unsigned long date;
15 struct commit_list *parents;
16 struct tree *tree;
17 char *buffer;
18};
19
20extern const char *commit_type;
21
22struct commit *lookup_commit(const unsigned char *sha1);
23struct commit *lookup_commit_reference(const unsigned char *sha1);
24
25int parse_commit_buffer(struct commit *item, void *buffer, unsigned long size);
26
27int parse_commit(struct commit *item);
28
29struct commit_list * commit_list_insert(struct commit *item, struct commit_list **list_p);
30struct commit_list * insert_by_date(struct commit *item, struct commit_list **list);
31
32void free_commit_list(struct commit_list *list);
33
34void sort_by_date(struct commit_list **list);
35
36/* Commit formats */
37enum cmit_fmt {
38 CMIT_FMT_RAW,
39 CMIT_FMT_MEDIUM,
40 CMIT_FMT_DEFAULT = CMIT_FMT_MEDIUM,
41 CMIT_FMT_SHORT,
42 CMIT_FMT_FULL,
43};
44
45extern enum cmit_fmt get_commit_format(const char *arg);
46extern unsigned long pretty_print_commit(enum cmit_fmt fmt, const char *msg, unsigned long len, char *buf, unsigned long space);
47
48/** Removes the first commit from a list sorted by date, and adds all
49 * of its parents.
50 **/
51struct commit *pop_most_recent_commit(struct commit_list **list,
52 unsigned int mark);
53
54struct commit *pop_commit(struct commit_list **stack);
55
56int count_parents(struct commit * commit);
57
58/*
59 * Performs an in-place topological sort of list supplied.
60 *
61 * Pre-conditions:
62 * all commits in input list and all parents of those
63 * commits must have object.util == NULL
64 *
65 * Post-conditions:
66 * invariant of resulting list is:
67 * a reachable from b => ord(b) < ord(a)
68 */
69void sort_in_topological_order(struct commit_list ** list);
70#endif /* COMMIT_H */