9 struct commit_list
*next
;
15 struct commit_list
*parents
;
20 extern int save_commit_buffer
;
21 extern const char *commit_type
;
23 struct commit
*lookup_commit(const unsigned char *sha1
);
24 struct commit
*lookup_commit_reference(const unsigned char *sha1
);
25 struct commit
*lookup_commit_reference_gently(const unsigned char *sha1
,
28 int parse_commit_buffer(struct commit
*item
, void *buffer
, unsigned long size
);
30 int parse_commit(struct commit
*item
);
32 struct commit_list
* commit_list_insert(struct commit
*item
, struct commit_list
**list_p
);
33 struct commit_list
* insert_by_date(struct commit
*item
, struct commit_list
**list
);
35 void free_commit_list(struct commit_list
*list
);
37 void sort_by_date(struct commit_list
**list
);
43 CMIT_FMT_DEFAULT
= CMIT_FMT_MEDIUM
,
50 extern enum cmit_fmt
get_commit_format(const char *arg
);
51 extern unsigned long pretty_print_commit(enum cmit_fmt fmt
, const struct commit
*, unsigned long len
, char *buf
, unsigned long space
, int abbrev
);
53 /** Removes the first commit from a list sorted by date, and adds all
56 struct commit
*pop_most_recent_commit(struct commit_list
**list
,
59 struct commit
*pop_commit(struct commit_list
**stack
);
61 void clear_commit_marks(struct commit
*commit
, unsigned int mark
);
63 int count_parents(struct commit
* commit
);
66 * Performs an in-place topological sort of list supplied.
69 * all commits in input list and all parents of those
70 * commits must have object.util == NULL
73 * invariant of resulting list is:
74 * a reachable from b => ord(b) < ord(a)
75 * in addition, when lifo == 0, commits on parallel tracks are
76 * sorted in the dates order.
78 void sort_in_topological_order(struct commit_list
** list
, int lifo
);