1#ifndef REVISION_H
2#define REVISION_H
3
4#define SEEN (1u<<0)
5#define UNINTERESTING (1u<<1)
6#define TREECHANGE (1u<<2)
7#define SHOWN (1u<<3)
8#define TMP_MARK (1u<<4) /* for isolated cases; clean after use */
9#define BOUNDARY (1u<<5)
10#define ADDED (1u<<6) /* Parents already parsed and added? */
11
12struct rev_info;
13
14typedef void (prune_fn_t)(struct rev_info *revs, struct commit *commit);
15
16struct rev_info {
17 /* Starting list */
18 struct commit_list *commits;
19 struct object_list *pending_objects;
20
21 /* Basic information */
22 const char *prefix;
23 void *prune_data;
24 prune_fn_t *prune_fn;
25
26 /* Traversal flags */
27 unsigned int dense:1,
28 no_merges:1,
29 no_walk:1,
30 remove_empty_trees:1,
31 lifo:1,
32 topo_order:1,
33 tag_objects:1,
34 tree_objects:1,
35 blob_objects:1,
36 edge_hint:1,
37 limited:1,
38 unpacked:1,
39 boundary:1,
40 parents:1;
41
42 /* special limits */
43 int max_count;
44 unsigned long max_age;
45 unsigned long min_age;
46
47 /* paths limiting */
48 struct diff_options diffopt;
49
50 topo_sort_set_fn_t topo_setter;
51 topo_sort_get_fn_t topo_getter;
52};
53
54#define REV_TREE_SAME 0
55#define REV_TREE_NEW 1
56#define REV_TREE_DIFFERENT 2
57
58/* revision.c */
59extern int rev_same_tree_as_empty(struct rev_info *, struct tree *t1);
60extern int rev_compare_tree(struct rev_info *, struct tree *t1, struct tree *t2);
61
62extern void init_revisions(struct rev_info *revs);
63extern int setup_revisions(int argc, const char **argv, struct rev_info *revs, const char *def);
64extern void prepare_revision_walk(struct rev_info *revs);
65extern struct commit *get_revision(struct rev_info *revs);
66
67extern void mark_parents_uninteresting(struct commit *commit);
68extern void mark_tree_uninteresting(struct tree *tree);
69
70struct name_path {
71 struct name_path *up;
72 int elem_len;
73 const char *elem;
74};
75
76extern struct object_list **add_object(struct object *obj,
77 struct object_list **p,
78 struct name_path *path,
79 const char *name);
80
81#endif