]>
Commit | Line | Data |
---|---|---|
6eb8ae00 DB |
1 | #ifndef COMMIT_H |
2 | #define COMMIT_H | |
3 | ||
4 | #include "object.h" | |
5 | #include "tree.h" | |
6 | ||
7 | struct commit_list { | |
8 | struct commit *item; | |
9 | struct commit_list *next; | |
10 | }; | |
11 | ||
12 | struct commit { | |
13 | struct object object; | |
14 | unsigned long date; | |
15 | struct commit_list *parents; | |
16 | struct tree *tree; | |
bd1e17e2 | 17 | char *buffer; |
6eb8ae00 DB |
18 | }; |
19 | ||
20 | extern const char *commit_type; | |
21 | ||
5d6ccf5c JM |
22 | struct commit *lookup_commit(const unsigned char *sha1); |
23 | struct commit *lookup_commit_reference(const unsigned char *sha1); | |
6eb8ae00 | 24 | |
bd2c39f5 NP |
25 | int parse_commit_buffer(struct commit *item, void *buffer, unsigned long size); |
26 | ||
6eb8ae00 DB |
27 | int parse_commit(struct commit *item); |
28 | ||
ac5155ef | 29 | struct commit_list * commit_list_insert(struct commit *item, struct commit_list **list_p); |
f755494c | 30 | struct commit_list * insert_by_date(struct commit *item, struct commit_list **list); |
dd97f850 | 31 | |
6eb8ae00 DB |
32 | void free_commit_list(struct commit_list *list); |
33 | ||
dd97f850 DB |
34 | void sort_by_date(struct commit_list **list); |
35 | ||
000182ea LT |
36 | /* Commit formats */ |
37 | enum cmit_fmt { | |
38 | CMIT_FMT_RAW, | |
39 | CMIT_FMT_MEDIUM, | |
40 | CMIT_FMT_DEFAULT = CMIT_FMT_MEDIUM, | |
9b66ec04 LT |
41 | CMIT_FMT_SHORT, |
42 | CMIT_FMT_FULL, | |
000182ea LT |
43 | }; |
44 | ||
9b66ec04 | 45 | extern enum cmit_fmt get_commit_format(const char *arg); |
000182ea | 46 | extern unsigned long pretty_print_commit(enum cmit_fmt fmt, const char *msg, unsigned long len, char *buf, unsigned long space); |
e3bc7a3b | 47 | |
dd97f850 DB |
48 | /** Removes the first commit from a list sorted by date, and adds all |
49 | * of its parents. | |
50 | **/ | |
58e28af6 DB |
51 | struct commit *pop_most_recent_commit(struct commit_list **list, |
52 | unsigned int mark); | |
dd97f850 | 53 | |
a3437b8c JS |
54 | struct commit *pop_commit(struct commit_list **stack); |
55 | ||
56 | int count_parents(struct commit * commit); | |
ab580ace JS |
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 | */ | |
69 | void sort_in_topological_order(struct commit_list ** list); | |
6eb8ae00 | 70 | #endif /* COMMIT_H */ |