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