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
11struct rev_info;
12
13typedef void (prune_fn_t)(struct rev_info *revs, struct commit *commit);
14
15struct rev_info {
16 /* Starting list */
17 struct commit_list *commits;
18 struct object_list *pending_objects;
19
20 /* Basic information */
21 const char *prefix;
22 void *prune_data;
23 prune_fn_t *prune_fn;
24
25 /* Traversal flags */
26 unsigned int dense:1,
27 no_merges:1,
28 remove_empty_trees:1,
29 lifo:1,
30 topo_order:1,
31 tag_objects:1,
32 tree_objects:1,
33 blob_objects:1,
34 edge_hint:1,
35 limited:1,
36 unpacked:1,
37 boundary:1,
38 parents:1;
39
40 /* special limits */
41 int max_count;
42 unsigned long max_age;
43 unsigned long min_age;
44
45 topo_sort_set_fn_t topo_setter;
46 topo_sort_get_fn_t topo_getter;
47};
48
49#define REV_TREE_SAME 0
50#define REV_TREE_NEW 1
51#define REV_TREE_DIFFERENT 2
52
53/* revision.c */
54extern int rev_same_tree_as_empty(struct tree *t1);
55extern int rev_compare_tree(struct tree *t1, struct tree *t2);
56
57extern void init_revisions(struct rev_info *revs);
58extern int setup_revisions(int argc, const char **argv, struct rev_info *revs, const char *def);
59extern void prepare_revision_walk(struct rev_info *revs);
60extern struct commit *get_revision(struct rev_info *revs);
61
62extern void mark_parents_uninteresting(struct commit *commit);
63extern void mark_tree_uninteresting(struct tree *tree);
64
65struct name_path {
66 struct name_path *up;
67 int elem_len;
68 const char *elem;
69};
70
71extern struct object_list **add_object(struct object *obj,
72 struct object_list **p,
73 struct name_path *path,
74 const char *name);
75
76#endif