]>
Commit | Line | Data |
---|---|---|
908e5310 LT |
1 | #include "cache.h" |
2 | #include "commit.h" | |
635d4134 | 3 | #include "tag.h" |
908e5310 | 4 | #include "refs.h" |
9a0eaf83 | 5 | #include "builtin.h" |
23615708 | 6 | #include "exec_cmd.h" |
166185be | 7 | #include "parse-options.h" |
908e5310 | 8 | |
8713ab30 SP |
9 | #define SEEN (1u<<0) |
10 | #define MAX_TAGS (FLAG_BITS - 1) | |
11 | ||
166185be PH |
12 | static const char * const describe_usage[] = { |
13 | "git-describe [options] <committish>*", | |
14 | NULL | |
15 | }; | |
908e5310 | 16 | |
8713ab30 | 17 | static int debug; /* Display lots of verbose info */ |
96f1e58f DR |
18 | static int all; /* Default to annotated tags only */ |
19 | static int tags; /* But allow any tags if --tags is specified */ | |
518120e3 | 20 | static int longformat; |
2d9e7c9f | 21 | static int abbrev = DEFAULT_ABBREV; |
8713ab30 | 22 | static int max_candidates = 10; |
30ffa603 | 23 | const char *pattern = NULL; |
da2478db | 24 | static int always; |
908e5310 | 25 | |
e7eb5034 | 26 | struct commit_name { |
212945d4 | 27 | struct tag *tag; |
64deb858 | 28 | int prio; /* annotated tag = 2, tag = 1, head = 0 */ |
212945d4 | 29 | unsigned char sha1[20]; |
5a2282de | 30 | char path[FLEX_ARRAY]; /* more */ |
e7eb5034 | 31 | }; |
cf69fd49 SP |
32 | static const char *prio_names[] = { |
33 | "head", "lightweight", "annotated", | |
34 | }; | |
908e5310 | 35 | |
64deb858 | 36 | static void add_to_known_names(const char *path, |
80dbae03 | 37 | struct commit *commit, |
212945d4 SP |
38 | int prio, |
39 | const unsigned char *sha1) | |
908e5310 | 40 | { |
e7eb5034 SP |
41 | struct commit_name *e = commit->util; |
42 | if (!e || e->prio < prio) { | |
43 | size_t len = strlen(path)+1; | |
44 | free(e); | |
45 | e = xmalloc(sizeof(struct commit_name) + len); | |
212945d4 | 46 | e->tag = NULL; |
e7eb5034 | 47 | e->prio = prio; |
212945d4 | 48 | hashcpy(e->sha1, sha1); |
e7eb5034 SP |
49 | memcpy(e->path, path, len); |
50 | commit->util = e; | |
908e5310 | 51 | } |
908e5310 LT |
52 | } |
53 | ||
8da19775 | 54 | static int get_name(const char *path, const unsigned char *sha1, int flag, void *cb_data) |
908e5310 | 55 | { |
8a5a1884 | 56 | int might_be_tag = !prefixcmp(path, "refs/tags/"); |
feededd0 | 57 | struct commit *commit; |
64deb858 | 58 | struct object *object; |
feededd0 SP |
59 | unsigned char peeled[20]; |
60 | int is_tag, prio; | |
61 | ||
8a5a1884 SP |
62 | if (!all && !might_be_tag) |
63 | return 0; | |
64 | ||
feededd0 SP |
65 | if (!peel_ref(path, peeled) && !is_null_sha1(peeled)) { |
66 | commit = lookup_commit_reference_gently(peeled, 1); | |
67 | if (!commit) | |
68 | return 0; | |
69 | is_tag = !!hashcmp(sha1, commit->object.sha1); | |
70 | } else { | |
71 | commit = lookup_commit_reference_gently(sha1, 1); | |
72 | object = parse_object(sha1); | |
73 | if (!commit || !object) | |
74 | return 0; | |
75 | is_tag = object->type == OBJ_TAG; | |
76 | } | |
64deb858 | 77 | |
2d9e7c9f JH |
78 | /* If --all, then any refs are used. |
79 | * If --tags, then any tags are used. | |
80 | * Otherwise only annotated tags are used. | |
81 | */ | |
8a5a1884 | 82 | if (might_be_tag) { |
4ed19a3c | 83 | if (is_tag) |
64deb858 | 84 | prio = 2; |
4ed19a3c | 85 | else |
64deb858 | 86 | prio = 1; |
4ed19a3c MD |
87 | |
88 | if (pattern && fnmatch(pattern, path + 10, 0)) | |
89 | prio = 0; | |
64deb858 JH |
90 | } |
91 | else | |
92 | prio = 0; | |
93 | ||
635d4134 | 94 | if (!all) { |
64deb858 JH |
95 | if (!prio) |
96 | return 0; | |
97 | if (!tags && prio < 2) | |
635d4134 | 98 | return 0; |
635d4134 | 99 | } |
212945d4 | 100 | add_to_known_names(all ? path + 5 : path + 10, commit, prio, sha1); |
908e5310 LT |
101 | return 0; |
102 | } | |
103 | ||
80dbae03 | 104 | struct possible_tag { |
80dbae03 | 105 | struct commit_name *name; |
cf69fd49 SP |
106 | int depth; |
107 | int found_order; | |
8713ab30 | 108 | unsigned flag_within; |
80dbae03 SP |
109 | }; |
110 | ||
cf69fd49 SP |
111 | static int compare_pt(const void *a_, const void *b_) |
112 | { | |
113 | struct possible_tag *a = (struct possible_tag *)a_; | |
114 | struct possible_tag *b = (struct possible_tag *)b_; | |
115 | if (a->name->prio != b->name->prio) | |
116 | return b->name->prio - a->name->prio; | |
117 | if (a->depth != b->depth) | |
118 | return a->depth - b->depth; | |
119 | if (a->found_order != b->found_order) | |
120 | return a->found_order - b->found_order; | |
121 | return 0; | |
122 | } | |
123 | ||
1b600e65 SP |
124 | static unsigned long finish_depth_computation( |
125 | struct commit_list **list, | |
126 | struct possible_tag *best) | |
127 | { | |
128 | unsigned long seen_commits = 0; | |
129 | while (*list) { | |
130 | struct commit *c = pop_commit(list); | |
131 | struct commit_list *parents = c->parents; | |
132 | seen_commits++; | |
133 | if (c->object.flags & best->flag_within) { | |
134 | struct commit_list *a = *list; | |
135 | while (a) { | |
136 | struct commit *i = a->item; | |
137 | if (!(i->object.flags & best->flag_within)) | |
138 | break; | |
139 | a = a->next; | |
140 | } | |
141 | if (!a) | |
142 | break; | |
143 | } else | |
144 | best->depth++; | |
145 | while (parents) { | |
146 | struct commit *p = parents->item; | |
147 | parse_commit(p); | |
148 | if (!(p->object.flags & SEEN)) | |
149 | insert_by_date(p, list); | |
150 | p->object.flags |= c->object.flags; | |
151 | parents = parents->next; | |
152 | } | |
153 | } | |
154 | return seen_commits; | |
155 | } | |
156 | ||
212945d4 SP |
157 | static void display_name(struct commit_name *n) |
158 | { | |
159 | if (n->prio == 2 && !n->tag) { | |
160 | n->tag = lookup_tag(n->sha1); | |
3167d725 | 161 | if (!n->tag || parse_tag(n->tag) || !n->tag->tag) |
212945d4 SP |
162 | die("annotated tag %s not available", n->path); |
163 | if (strcmp(n->tag->tag, n->path)) | |
164 | warning("tag '%s' is really '%s' here", n->tag->tag, n->path); | |
165 | } | |
166 | ||
167 | if (n->tag) | |
168 | printf("%s", n->tag->tag); | |
169 | else | |
170 | printf("%s", n->path); | |
870cf7d6 JH |
171 | } |
172 | ||
173 | static void show_suffix(int depth, const unsigned char *sha1) | |
174 | { | |
175 | printf("-%d-g%s", depth, find_unique_abbrev(sha1, abbrev)); | |
212945d4 SP |
176 | } |
177 | ||
554fe20d | 178 | static void describe(const char *arg, int last_one) |
908e5310 | 179 | { |
4c34a2c5 | 180 | unsigned char sha1[20]; |
8713ab30 | 181 | struct commit *cmit, *gave_up_on = NULL; |
908e5310 LT |
182 | struct commit_list *list; |
183 | static int initialized = 0; | |
184 | struct commit_name *n; | |
cf69fd49 | 185 | struct possible_tag all_matches[MAX_TAGS]; |
8713ab30 SP |
186 | unsigned int match_cnt = 0, annotated_cnt = 0, cur_match; |
187 | unsigned long seen_commits = 0; | |
908e5310 | 188 | |
31fff305 DL |
189 | if (get_sha1(arg, sha1)) |
190 | die("Not a valid object name %s", arg); | |
4c34a2c5 JH |
191 | cmit = lookup_commit_reference(sha1); |
192 | if (!cmit) | |
31fff305 | 193 | die("%s is not a valid '%s' object", arg, commit_type); |
4c34a2c5 | 194 | |
908e5310 LT |
195 | if (!initialized) { |
196 | initialized = 1; | |
cb5d709f | 197 | for_each_ref(get_name, NULL); |
908e5310 LT |
198 | } |
199 | ||
e7eb5034 | 200 | n = cmit->util; |
908e5310 | 201 | if (n) { |
870cf7d6 JH |
202 | /* |
203 | * Exact match to an existing ref. | |
204 | */ | |
212945d4 | 205 | display_name(n); |
870cf7d6 | 206 | if (longformat) |
14d4642e | 207 | show_suffix(0, n->tag ? n->tag->tagged->sha1 : sha1); |
212945d4 | 208 | printf("\n"); |
908e5310 LT |
209 | return; |
210 | } | |
211 | ||
2c33f757 SP |
212 | if (!max_candidates) |
213 | die("no tag exactly matches '%s'", sha1_to_hex(cmit->object.sha1)); | |
8713ab30 SP |
214 | if (debug) |
215 | fprintf(stderr, "searching to describe %s\n", arg); | |
216 | ||
908e5310 | 217 | list = NULL; |
8713ab30 | 218 | cmit->object.flags = SEEN; |
908e5310 LT |
219 | commit_list_insert(cmit, &list); |
220 | while (list) { | |
80dbae03 | 221 | struct commit *c = pop_commit(&list); |
dccd0c2a | 222 | struct commit_list *parents = c->parents; |
8713ab30 | 223 | seen_commits++; |
e7eb5034 | 224 | n = c->util; |
908e5310 | 225 | if (n) { |
8713ab30 SP |
226 | if (match_cnt < max_candidates) { |
227 | struct possible_tag *t = &all_matches[match_cnt++]; | |
228 | t->name = n; | |
229 | t->depth = seen_commits - 1; | |
230 | t->flag_within = 1u << match_cnt; | |
8a8169c0 | 231 | t->found_order = match_cnt; |
8713ab30 SP |
232 | c->object.flags |= t->flag_within; |
233 | if (n->prio == 2) | |
234 | annotated_cnt++; | |
235 | } | |
236 | else { | |
237 | gave_up_on = c; | |
238 | break; | |
239 | } | |
240 | } | |
241 | for (cur_match = 0; cur_match < match_cnt; cur_match++) { | |
242 | struct possible_tag *t = &all_matches[cur_match]; | |
243 | if (!(c->object.flags & t->flag_within)) | |
244 | t->depth++; | |
245 | } | |
246 | if (annotated_cnt && !list) { | |
247 | if (debug) | |
248 | fprintf(stderr, "finished search at %s\n", | |
249 | sha1_to_hex(c->object.sha1)); | |
250 | break; | |
dccd0c2a SP |
251 | } |
252 | while (parents) { | |
253 | struct commit *p = parents->item; | |
254 | parse_commit(p); | |
8713ab30 | 255 | if (!(p->object.flags & SEEN)) |
dccd0c2a | 256 | insert_by_date(p, &list); |
8713ab30 | 257 | p->object.flags |= c->object.flags; |
dccd0c2a | 258 | parents = parents->next; |
80dbae03 SP |
259 | } |
260 | } | |
261 | ||
da2478db JH |
262 | if (!match_cnt) { |
263 | const unsigned char *sha1 = cmit->object.sha1; | |
264 | if (always) { | |
265 | printf("%s\n", find_unique_abbrev(sha1, abbrev)); | |
266 | return; | |
267 | } | |
268 | die("cannot describe '%s'", sha1_to_hex(sha1)); | |
269 | } | |
80dbae03 | 270 | |
cf69fd49 | 271 | qsort(all_matches, match_cnt, sizeof(all_matches[0]), compare_pt); |
1b600e65 SP |
272 | |
273 | if (gave_up_on) { | |
274 | insert_by_date(gave_up_on, &list); | |
275 | seen_commits--; | |
276 | } | |
277 | seen_commits += finish_depth_computation(&list, &all_matches[0]); | |
278 | free_commit_list(list); | |
279 | ||
8713ab30 SP |
280 | if (debug) { |
281 | for (cur_match = 0; cur_match < match_cnt; cur_match++) { | |
282 | struct possible_tag *t = &all_matches[cur_match]; | |
cf69fd49 SP |
283 | fprintf(stderr, " %-11s %8d %s\n", |
284 | prio_names[t->name->prio], | |
8713ab30 SP |
285 | t->depth, t->name->path); |
286 | } | |
287 | fprintf(stderr, "traversed %lu commits\n", seen_commits); | |
288 | if (gave_up_on) { | |
289 | fprintf(stderr, | |
290 | "more than %i tags found; listed %i most recent\n" | |
291 | "gave up search at %s\n", | |
292 | max_candidates, max_candidates, | |
293 | sha1_to_hex(gave_up_on->object.sha1)); | |
294 | } | |
80dbae03 | 295 | } |
212945d4 SP |
296 | |
297 | display_name(all_matches[0].name); | |
298 | if (abbrev) | |
870cf7d6 | 299 | show_suffix(all_matches[0].depth, cmit->object.sha1); |
212945d4 | 300 | printf("\n"); |
80dbae03 | 301 | |
8713ab30 SP |
302 | if (!last_one) |
303 | clear_commit_marks(cmit, -1); | |
908e5310 LT |
304 | } |
305 | ||
9a0eaf83 | 306 | int cmd_describe(int argc, const char **argv, const char *prefix) |
908e5310 | 307 | { |
23615708 | 308 | int contains = 0; |
166185be PH |
309 | struct option options[] = { |
310 | OPT_BOOLEAN(0, "contains", &contains, "find the tag that comes after the commit"), | |
311 | OPT_BOOLEAN(0, "debug", &debug, "debug search strategy on stderr"), | |
312 | OPT_BOOLEAN(0, "all", &all, "use any ref in .git/refs"), | |
313 | OPT_BOOLEAN(0, "tags", &tags, "use any tag in .git/refs/tags"), | |
518120e3 | 314 | OPT_BOOLEAN(0, "long", &longformat, "always use long format"), |
166185be | 315 | OPT__ABBREV(&abbrev), |
2c33f757 SP |
316 | OPT_SET_INT(0, "exact-match", &max_candidates, |
317 | "only output exact matches", 0), | |
166185be | 318 | OPT_INTEGER(0, "candidates", &max_candidates, |
30ffa603 PH |
319 | "consider <n> most recent tags (default: 10)"), |
320 | OPT_STRING(0, "match", &pattern, "pattern", | |
321 | "only consider tags matching <pattern>"), | |
da2478db JH |
322 | OPT_BOOLEAN(0, "always", &always, |
323 | "show abbreviated commit object as fallback"), | |
166185be PH |
324 | OPT_END(), |
325 | }; | |
908e5310 | 326 | |
166185be | 327 | argc = parse_options(argc, argv, options, describe_usage, 0); |
2c33f757 SP |
328 | if (max_candidates < 0) |
329 | max_candidates = 0; | |
166185be PH |
330 | else if (max_candidates > MAX_TAGS) |
331 | max_candidates = MAX_TAGS; | |
4c34a2c5 | 332 | |
8c599c74 | 333 | save_commit_buffer = 0; |
8112894d | 334 | |
518120e3 SB |
335 | if (longformat && abbrev == 0) |
336 | die("--long is incompatible with --abbrev=0"); | |
337 | ||
23615708 | 338 | if (contains) { |
da2478db | 339 | const char **args = xmalloc((7 + argc) * sizeof(char*)); |
3f7701a4 NP |
340 | int i = 0; |
341 | args[i++] = "name-rev"; | |
342 | args[i++] = "--name-only"; | |
a2cf9f44 | 343 | args[i++] = "--no-undefined"; |
da2478db JH |
344 | if (always) |
345 | args[i++] = "--always"; | |
30ffa603 | 346 | if (!all) { |
3f7701a4 | 347 | args[i++] = "--tags"; |
30ffa603 PH |
348 | if (pattern) { |
349 | char *s = xmalloc(strlen("--refs=refs/tags/") + strlen(pattern) + 1); | |
350 | sprintf(s, "--refs=refs/tags/%s", pattern); | |
351 | args[i++] = s; | |
352 | } | |
353 | } | |
3f7701a4 NP |
354 | memcpy(args + i, argv, argc * sizeof(char*)); |
355 | args[i + argc] = NULL; | |
356 | return cmd_name_rev(i + argc, args, prefix); | |
23615708 SP |
357 | } |
358 | ||
166185be | 359 | if (argc == 0) { |
fec9ebf1 | 360 | describe("HEAD", 1); |
166185be PH |
361 | } else { |
362 | while (argc-- > 0) { | |
363 | describe(*argv++, argc == 0); | |
fec9ebf1 | 364 | } |
166185be | 365 | } |
908e5310 LT |
366 | return 0; |
367 | } |