commit.hon commit [PATCH] Possible cleanups for local-pull.c (2ab141a)
   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);
  24struct commit *lookup_commit_reference_gently(const unsigned char *sha1,
  25                                              int quiet);
  26
  27int parse_commit_buffer(struct commit *item, void *buffer, unsigned long size);
  28
  29int parse_commit(struct commit *item);
  30
  31struct commit_list * commit_list_insert(struct commit *item, struct commit_list **list_p);
  32struct commit_list * insert_by_date(struct commit *item, struct commit_list **list);
  33
  34void free_commit_list(struct commit_list *list);
  35
  36void sort_by_date(struct commit_list **list);
  37
  38/* Commit formats */
  39enum cmit_fmt {
  40        CMIT_FMT_RAW,
  41        CMIT_FMT_MEDIUM,
  42        CMIT_FMT_DEFAULT = CMIT_FMT_MEDIUM,
  43        CMIT_FMT_SHORT,
  44        CMIT_FMT_FULL,
  45        CMIT_FMT_ONELINE,
  46};
  47
  48extern enum cmit_fmt get_commit_format(const char *arg);
  49extern unsigned long pretty_print_commit(enum cmit_fmt fmt, const char *msg, unsigned long len, char *buf, unsigned long space);
  50
  51/** Removes the first commit from a list sorted by date, and adds all
  52 * of its parents.
  53 **/
  54struct commit *pop_most_recent_commit(struct commit_list **list, 
  55                                      unsigned int mark);
  56
  57struct commit *pop_commit(struct commit_list **stack);
  58
  59int count_parents(struct commit * commit);
  60
  61/*
  62 * Performs an in-place topological sort of list supplied.
  63 *
  64 * Pre-conditions:
  65 *   all commits in input list and all parents of those
  66 *   commits must have object.util == NULL
  67 *        
  68 * Post-conditions: 
  69 *   invariant of resulting list is:
  70 *      a reachable from b => ord(b) < ord(a)
  71 */
  72void sort_in_topological_order(struct commit_list ** list);
  73#endif /* COMMIT_H */