3 #include "parse-options.h"
11 #include "ref-filter.h"
14 #include "git-compat-util.h"
17 #include "wt-status.h"
18 #include "commit-slab.h"
20 static struct ref_msg {
24 const char *ahead_behind;
26 /* Untranslated plumbing messages: */
33 void setup_ref_filter_porcelain_msg(void)
35 msgs.gone = _("gone");
36 msgs.ahead = _("ahead %d");
37 msgs.behind = _("behind %d");
38 msgs.ahead_behind = _("ahead %d, behind %d");
41 typedef enum { FIELD_STR, FIELD_ULONG, FIELD_TIME } cmp_type;
42 typedef enum { COMPARE_EQUAL, COMPARE_UNEQUAL, COMPARE_NONE } cmp_status;
50 cmp_status cmp_status;
52 unsigned int then_atom_seen : 1,
54 condition_satisfied : 1;
58 enum { R_NORMAL, R_SHORT, R_LSTRIP, R_RSTRIP } option;
63 * An atom is a valid field atom listed below, possibly prefixed with
64 * a "*" to denote deref_tag().
66 * We parse given format string and sort specifiers, and make a list
67 * of properties that we need to extract out of objects. ref_array_item
68 * structure will hold an array of values extracted that can be
69 * indexed with the "atom number", which is an index into this
72 static struct used_atom {
76 char color[COLOR_MAXLEN];
80 RR_REF, RR_TRACK, RR_TRACKSHORT, RR_REMOTE_NAME, RR_REMOTE_REF
82 struct refname_atom refname;
83 unsigned int nobracket : 1, push : 1, push_remote : 1;
86 enum { C_BARE, C_BODY, C_BODY_DEP, C_LINES, C_SIG, C_SUB, C_TRAILERS } option;
87 struct process_trailer_options trailer_opts;
91 cmp_status cmp_status;
95 enum { O_FULL, O_LENGTH, O_SHORT } option;
98 struct refname_atom refname;
102 static int used_atom_cnt, need_tagged, need_symref;
105 * Expand string, append it to strbuf *sb, then return error code ret.
106 * Allow to save few lines of code.
108 static int strbuf_addf_ret(struct strbuf *sb, int ret, const char *fmt, ...)
112 strbuf_vaddf(sb, fmt, ap);
117 static void color_atom_parser(const struct ref_format *format, struct used_atom *atom, const char *color_value)
120 die(_("expected format: %%(color:<color>)"));
121 if (color_parse(color_value, atom->u.color) < 0)
122 die(_("unrecognized color: %%(color:%s)"), color_value);
124 * We check this after we've parsed the color, which lets us complain
125 * about syntactically bogus color names even if they won't be used.
127 if (!want_color(format->use_color))
128 color_parse("", atom->u.color);
131 static void refname_atom_parser_internal(struct refname_atom *atom,
132 const char *arg, const char *name)
135 atom->option = R_NORMAL;
136 else if (!strcmp(arg, "short"))
137 atom->option = R_SHORT;
138 else if (skip_prefix(arg, "lstrip=", &arg) ||
139 skip_prefix(arg, "strip=", &arg)) {
140 atom->option = R_LSTRIP;
141 if (strtol_i(arg, 10, &atom->lstrip))
142 die(_("Integer value expected refname:lstrip=%s"), arg);
143 } else if (skip_prefix(arg, "rstrip=", &arg)) {
144 atom->option = R_RSTRIP;
145 if (strtol_i(arg, 10, &atom->rstrip))
146 die(_("Integer value expected refname:rstrip=%s"), arg);
148 die(_("unrecognized %%(%s) argument: %s"), name, arg);
151 static void remote_ref_atom_parser(const struct ref_format *format, struct used_atom *atom, const char *arg)
153 struct string_list params = STRING_LIST_INIT_DUP;
156 if (!strcmp(atom->name, "push") || starts_with(atom->name, "push:"))
157 atom->u.remote_ref.push = 1;
160 atom->u.remote_ref.option = RR_REF;
161 refname_atom_parser_internal(&atom->u.remote_ref.refname,
166 atom->u.remote_ref.nobracket = 0;
167 string_list_split(¶ms, arg, ',', -1);
169 for (i = 0; i < params.nr; i++) {
170 const char *s = params.items[i].string;
172 if (!strcmp(s, "track"))
173 atom->u.remote_ref.option = RR_TRACK;
174 else if (!strcmp(s, "trackshort"))
175 atom->u.remote_ref.option = RR_TRACKSHORT;
176 else if (!strcmp(s, "nobracket"))
177 atom->u.remote_ref.nobracket = 1;
178 else if (!strcmp(s, "remotename")) {
179 atom->u.remote_ref.option = RR_REMOTE_NAME;
180 atom->u.remote_ref.push_remote = 1;
181 } else if (!strcmp(s, "remoteref")) {
182 atom->u.remote_ref.option = RR_REMOTE_REF;
183 atom->u.remote_ref.push_remote = 1;
185 atom->u.remote_ref.option = RR_REF;
186 refname_atom_parser_internal(&atom->u.remote_ref.refname,
191 string_list_clear(¶ms, 0);
194 static void body_atom_parser(const struct ref_format *format, struct used_atom *atom, const char *arg)
197 die(_("%%(body) does not take arguments"));
198 atom->u.contents.option = C_BODY_DEP;
201 static void subject_atom_parser(const struct ref_format *format, struct used_atom *atom, const char *arg)
204 die(_("%%(subject) does not take arguments"));
205 atom->u.contents.option = C_SUB;
208 static void trailers_atom_parser(const struct ref_format *format, struct used_atom *atom, const char *arg)
210 struct string_list params = STRING_LIST_INIT_DUP;
214 string_list_split(¶ms, arg, ',', -1);
215 for (i = 0; i < params.nr; i++) {
216 const char *s = params.items[i].string;
217 if (!strcmp(s, "unfold"))
218 atom->u.contents.trailer_opts.unfold = 1;
219 else if (!strcmp(s, "only"))
220 atom->u.contents.trailer_opts.only_trailers = 1;
222 die(_("unknown %%(trailers) argument: %s"), s);
225 atom->u.contents.option = C_TRAILERS;
226 string_list_clear(¶ms, 0);
229 static void contents_atom_parser(const struct ref_format *format, struct used_atom *atom, const char *arg)
232 atom->u.contents.option = C_BARE;
233 else if (!strcmp(arg, "body"))
234 atom->u.contents.option = C_BODY;
235 else if (!strcmp(arg, "signature"))
236 atom->u.contents.option = C_SIG;
237 else if (!strcmp(arg, "subject"))
238 atom->u.contents.option = C_SUB;
239 else if (skip_prefix(arg, "trailers", &arg)) {
240 skip_prefix(arg, ":", &arg);
241 trailers_atom_parser(format, atom, *arg ? arg : NULL);
242 } else if (skip_prefix(arg, "lines=", &arg)) {
243 atom->u.contents.option = C_LINES;
244 if (strtoul_ui(arg, 10, &atom->u.contents.nlines))
245 die(_("positive value expected contents:lines=%s"), arg);
247 die(_("unrecognized %%(contents) argument: %s"), arg);
250 static void objectname_atom_parser(const struct ref_format *format, struct used_atom *atom, const char *arg)
253 atom->u.objectname.option = O_FULL;
254 else if (!strcmp(arg, "short"))
255 atom->u.objectname.option = O_SHORT;
256 else if (skip_prefix(arg, "short=", &arg)) {
257 atom->u.objectname.option = O_LENGTH;
258 if (strtoul_ui(arg, 10, &atom->u.objectname.length) ||
259 atom->u.objectname.length == 0)
260 die(_("positive value expected objectname:short=%s"), arg);
261 if (atom->u.objectname.length < MINIMUM_ABBREV)
262 atom->u.objectname.length = MINIMUM_ABBREV;
264 die(_("unrecognized %%(objectname) argument: %s"), arg);
267 static void refname_atom_parser(const struct ref_format *format, struct used_atom *atom, const char *arg)
269 refname_atom_parser_internal(&atom->u.refname, arg, atom->name);
272 static align_type parse_align_position(const char *s)
274 if (!strcmp(s, "right"))
276 else if (!strcmp(s, "middle"))
278 else if (!strcmp(s, "left"))
283 static void align_atom_parser(const struct ref_format *format, struct used_atom *atom, const char *arg)
285 struct align *align = &atom->u.align;
286 struct string_list params = STRING_LIST_INIT_DUP;
288 unsigned int width = ~0U;
291 die(_("expected format: %%(align:<width>,<position>)"));
293 align->position = ALIGN_LEFT;
295 string_list_split(¶ms, arg, ',', -1);
296 for (i = 0; i < params.nr; i++) {
297 const char *s = params.items[i].string;
300 if (skip_prefix(s, "position=", &s)) {
301 position = parse_align_position(s);
303 die(_("unrecognized position:%s"), s);
304 align->position = position;
305 } else if (skip_prefix(s, "width=", &s)) {
306 if (strtoul_ui(s, 10, &width))
307 die(_("unrecognized width:%s"), s);
308 } else if (!strtoul_ui(s, 10, &width))
310 else if ((position = parse_align_position(s)) >= 0)
311 align->position = position;
313 die(_("unrecognized %%(align) argument: %s"), s);
317 die(_("positive width expected with the %%(align) atom"));
318 align->width = width;
319 string_list_clear(¶ms, 0);
322 static void if_atom_parser(const struct ref_format *format, struct used_atom *atom, const char *arg)
325 atom->u.if_then_else.cmp_status = COMPARE_NONE;
327 } else if (skip_prefix(arg, "equals=", &atom->u.if_then_else.str)) {
328 atom->u.if_then_else.cmp_status = COMPARE_EQUAL;
329 } else if (skip_prefix(arg, "notequals=", &atom->u.if_then_else.str)) {
330 atom->u.if_then_else.cmp_status = COMPARE_UNEQUAL;
332 die(_("unrecognized %%(if) argument: %s"), arg);
336 static void head_atom_parser(const struct ref_format *format, struct used_atom *atom, const char *arg)
338 atom->u.head = resolve_refdup("HEAD", RESOLVE_REF_READING, NULL, NULL);
344 void (*parser)(const struct ref_format *format, struct used_atom *atom, const char *arg);
346 { "refname" , FIELD_STR, refname_atom_parser },
348 { "objectsize", FIELD_ULONG },
349 { "objectname", FIELD_STR, objectname_atom_parser },
352 { "numparent", FIELD_ULONG },
359 { "authordate", FIELD_TIME },
362 { "committeremail" },
363 { "committerdate", FIELD_TIME },
367 { "taggerdate", FIELD_TIME },
369 { "creatordate", FIELD_TIME },
370 { "subject", FIELD_STR, subject_atom_parser },
371 { "body", FIELD_STR, body_atom_parser },
372 { "trailers", FIELD_STR, trailers_atom_parser },
373 { "contents", FIELD_STR, contents_atom_parser },
374 { "upstream", FIELD_STR, remote_ref_atom_parser },
375 { "push", FIELD_STR, remote_ref_atom_parser },
376 { "symref", FIELD_STR, refname_atom_parser },
378 { "HEAD", FIELD_STR, head_atom_parser },
379 { "color", FIELD_STR, color_atom_parser },
380 { "align", FIELD_STR, align_atom_parser },
382 { "if", FIELD_STR, if_atom_parser },
387 #define REF_FORMATTING_STATE_INIT { 0, NULL }
389 struct ref_formatting_stack {
390 struct ref_formatting_stack *prev;
391 struct strbuf output;
392 void (*at_end)(struct ref_formatting_stack **stack);
396 struct ref_formatting_state {
398 struct ref_formatting_stack *stack;
403 int (*handler)(struct atom_value *atomv, struct ref_formatting_state *state,
405 uintmax_t value; /* used for sorting when not FIELD_STR */
406 struct used_atom *atom;
410 * Used to parse format string and sort specifiers
412 static int parse_ref_filter_atom(const struct ref_format *format,
413 const char *atom, const char *ep,
421 if (*sp == '*' && sp < ep)
424 return strbuf_addf_ret(err, -1, _("malformed field name: %.*s"),
425 (int)(ep-atom), atom);
427 /* Do we have the atom already used elsewhere? */
428 for (i = 0; i < used_atom_cnt; i++) {
429 int len = strlen(used_atom[i].name);
430 if (len == ep - atom && !memcmp(used_atom[i].name, atom, len))
435 * If the atom name has a colon, strip it and everything after
436 * it off - it specifies the format for this entry, and
437 * shouldn't be used for checking against the valid_atom
440 arg = memchr(sp, ':', ep - sp);
441 atom_len = (arg ? arg : ep) - sp;
443 /* Is the atom a valid one? */
444 for (i = 0; i < ARRAY_SIZE(valid_atom); i++) {
445 int len = strlen(valid_atom[i].name);
446 if (len == atom_len && !memcmp(valid_atom[i].name, sp, len))
450 if (ARRAY_SIZE(valid_atom) <= i)
451 return strbuf_addf_ret(err, -1, _("unknown field name: %.*s"),
452 (int)(ep-atom), atom);
454 /* Add it in, including the deref prefix */
457 REALLOC_ARRAY(used_atom, used_atom_cnt);
458 used_atom[at].name = xmemdupz(atom, ep - atom);
459 used_atom[at].type = valid_atom[i].cmp_type;
461 arg = used_atom[at].name + (arg - atom) + 1;
464 * Treat empty sub-arguments list as NULL (i.e.,
465 * "%(atom:)" is equivalent to "%(atom)").
470 memset(&used_atom[at].u, 0, sizeof(used_atom[at].u));
471 if (valid_atom[i].parser)
472 valid_atom[i].parser(format, &used_atom[at], arg);
475 if (!strcmp(valid_atom[i].name, "symref"))
480 static void quote_formatting(struct strbuf *s, const char *str, int quote_style)
482 switch (quote_style) {
484 strbuf_addstr(s, str);
487 sq_quote_buf(s, str);
490 perl_quote_buf(s, str);
493 python_quote_buf(s, str);
496 tcl_quote_buf(s, str);
501 static int append_atom(struct atom_value *v, struct ref_formatting_state *state,
502 struct strbuf *unused_err)
505 * Quote formatting is only done when the stack has a single
506 * element. Otherwise quote formatting is done on the
507 * element's entire output strbuf when the %(end) atom is
510 if (!state->stack->prev)
511 quote_formatting(&state->stack->output, v->s, state->quote_style);
513 strbuf_addstr(&state->stack->output, v->s);
517 static void push_stack_element(struct ref_formatting_stack **stack)
519 struct ref_formatting_stack *s = xcalloc(1, sizeof(struct ref_formatting_stack));
521 strbuf_init(&s->output, 0);
526 static void pop_stack_element(struct ref_formatting_stack **stack)
528 struct ref_formatting_stack *current = *stack;
529 struct ref_formatting_stack *prev = current->prev;
532 strbuf_addbuf(&prev->output, ¤t->output);
533 strbuf_release(¤t->output);
538 static void end_align_handler(struct ref_formatting_stack **stack)
540 struct ref_formatting_stack *cur = *stack;
541 struct align *align = (struct align *)cur->at_end_data;
542 struct strbuf s = STRBUF_INIT;
544 strbuf_utf8_align(&s, align->position, align->width, cur->output.buf);
545 strbuf_swap(&cur->output, &s);
549 static int align_atom_handler(struct atom_value *atomv, struct ref_formatting_state *state,
550 struct strbuf *unused_err)
552 struct ref_formatting_stack *new_stack;
554 push_stack_element(&state->stack);
555 new_stack = state->stack;
556 new_stack->at_end = end_align_handler;
557 new_stack->at_end_data = &atomv->atom->u.align;
561 static void if_then_else_handler(struct ref_formatting_stack **stack)
563 struct ref_formatting_stack *cur = *stack;
564 struct ref_formatting_stack *prev = cur->prev;
565 struct if_then_else *if_then_else = (struct if_then_else *)cur->at_end_data;
567 if (!if_then_else->then_atom_seen)
568 die(_("format: %%(if) atom used without a %%(then) atom"));
570 if (if_then_else->else_atom_seen) {
572 * There is an %(else) atom: we need to drop one state from the
573 * stack, either the %(else) branch if the condition is satisfied, or
574 * the %(then) branch if it isn't.
576 if (if_then_else->condition_satisfied) {
577 strbuf_reset(&cur->output);
578 pop_stack_element(&cur);
580 strbuf_swap(&cur->output, &prev->output);
581 strbuf_reset(&cur->output);
582 pop_stack_element(&cur);
584 } else if (!if_then_else->condition_satisfied) {
586 * No %(else) atom: just drop the %(then) branch if the
587 * condition is not satisfied.
589 strbuf_reset(&cur->output);
596 static int if_atom_handler(struct atom_value *atomv, struct ref_formatting_state *state,
597 struct strbuf *unused_err)
599 struct ref_formatting_stack *new_stack;
600 struct if_then_else *if_then_else = xcalloc(sizeof(struct if_then_else), 1);
602 if_then_else->str = atomv->atom->u.if_then_else.str;
603 if_then_else->cmp_status = atomv->atom->u.if_then_else.cmp_status;
605 push_stack_element(&state->stack);
606 new_stack = state->stack;
607 new_stack->at_end = if_then_else_handler;
608 new_stack->at_end_data = if_then_else;
612 static int is_empty(const char *s)
622 static int then_atom_handler(struct atom_value *atomv, struct ref_formatting_state *state,
625 struct ref_formatting_stack *cur = state->stack;
626 struct if_then_else *if_then_else = NULL;
628 if (cur->at_end == if_then_else_handler)
629 if_then_else = (struct if_then_else *)cur->at_end_data;
631 return strbuf_addf_ret(err, -1, _("format: %%(then) atom used without an %%(if) atom"));
632 if (if_then_else->then_atom_seen)
633 return strbuf_addf_ret(err, -1, _("format: %%(then) atom used more than once"));
634 if (if_then_else->else_atom_seen)
635 return strbuf_addf_ret(err, -1, _("format: %%(then) atom used after %%(else)"));
636 if_then_else->then_atom_seen = 1;
638 * If the 'equals' or 'notequals' attribute is used then
639 * perform the required comparison. If not, only non-empty
640 * strings satisfy the 'if' condition.
642 if (if_then_else->cmp_status == COMPARE_EQUAL) {
643 if (!strcmp(if_then_else->str, cur->output.buf))
644 if_then_else->condition_satisfied = 1;
645 } else if (if_then_else->cmp_status == COMPARE_UNEQUAL) {
646 if (strcmp(if_then_else->str, cur->output.buf))
647 if_then_else->condition_satisfied = 1;
648 } else if (cur->output.len && !is_empty(cur->output.buf))
649 if_then_else->condition_satisfied = 1;
650 strbuf_reset(&cur->output);
654 static int else_atom_handler(struct atom_value *atomv, struct ref_formatting_state *state,
657 struct ref_formatting_stack *prev = state->stack;
658 struct if_then_else *if_then_else = NULL;
660 if (prev->at_end == if_then_else_handler)
661 if_then_else = (struct if_then_else *)prev->at_end_data;
663 return strbuf_addf_ret(err, -1, _("format: %%(else) atom used without an %%(if) atom"));
664 if (!if_then_else->then_atom_seen)
665 return strbuf_addf_ret(err, -1, _("format: %%(else) atom used without a %%(then) atom"));
666 if (if_then_else->else_atom_seen)
667 return strbuf_addf_ret(err, -1, _("format: %%(else) atom used more than once"));
668 if_then_else->else_atom_seen = 1;
669 push_stack_element(&state->stack);
670 state->stack->at_end_data = prev->at_end_data;
671 state->stack->at_end = prev->at_end;
675 static int end_atom_handler(struct atom_value *atomv, struct ref_formatting_state *state,
678 struct ref_formatting_stack *current = state->stack;
679 struct strbuf s = STRBUF_INIT;
681 if (!current->at_end)
682 return strbuf_addf_ret(err, -1, _("format: %%(end) atom used without corresponding atom"));
683 current->at_end(&state->stack);
685 /* Stack may have been popped within at_end(), hence reset the current pointer */
686 current = state->stack;
689 * Perform quote formatting when the stack element is that of
690 * a supporting atom. If nested then perform quote formatting
691 * only on the topmost supporting atom.
693 if (!current->prev->prev) {
694 quote_formatting(&s, current->output.buf, state->quote_style);
695 strbuf_swap(¤t->output, &s);
698 pop_stack_element(&state->stack);
703 * In a format string, find the next occurrence of %(atom).
705 static const char *find_next(const char *cp)
710 * %( is the start of an atom;
711 * %% is a quoted per-cent.
715 else if (cp[1] == '%')
716 cp++; /* skip over two % */
717 /* otherwise this is a singleton, literal % */
725 * Make sure the format string is well formed, and parse out
728 int verify_ref_format(struct ref_format *format)
732 format->need_color_reset_at_eol = 0;
733 for (cp = format->format; *cp && (sp = find_next(cp)); ) {
734 struct strbuf err = STRBUF_INIT;
735 const char *color, *ep = strchr(sp, ')');
739 return error(_("malformed format string %s"), sp);
740 /* sp points at "%(" and ep points at the closing ")" */
741 at = parse_ref_filter_atom(format, sp + 2, ep, &err);
746 if (skip_prefix(used_atom[at].name, "color:", &color))
747 format->need_color_reset_at_eol = !!strcmp(color, "reset");
748 strbuf_release(&err);
750 if (format->need_color_reset_at_eol && !want_color(format->use_color))
751 format->need_color_reset_at_eol = 0;
756 * Given an object name, read the object data and size, and return a
757 * "struct object". If the object data we are returning is also borrowed
758 * by the "struct object" representation, set *eaten as well---it is a
759 * signal from parse_object_buffer to us not to free the buffer.
761 static void *get_obj(const struct object_id *oid, struct object **obj, unsigned long *sz, int *eaten)
763 enum object_type type;
764 void *buf = read_sha1_file(oid->hash, &type, sz);
767 *obj = parse_object_buffer(oid, type, *sz, buf, eaten);
773 static int grab_objectname(const char *name, const unsigned char *sha1,
774 struct atom_value *v, struct used_atom *atom)
776 if (starts_with(name, "objectname")) {
777 if (atom->u.objectname.option == O_SHORT) {
778 v->s = xstrdup(find_unique_abbrev(sha1, DEFAULT_ABBREV));
780 } else if (atom->u.objectname.option == O_FULL) {
781 v->s = xstrdup(sha1_to_hex(sha1));
783 } else if (atom->u.objectname.option == O_LENGTH) {
784 v->s = xstrdup(find_unique_abbrev(sha1, atom->u.objectname.length));
787 die("BUG: unknown %%(objectname) option");
792 /* See grab_values */
793 static void grab_common_values(struct atom_value *val, int deref, struct object *obj, void *buf, unsigned long sz)
797 for (i = 0; i < used_atom_cnt; i++) {
798 const char *name = used_atom[i].name;
799 struct atom_value *v = &val[i];
800 if (!!deref != (*name == '*'))
804 if (!strcmp(name, "objecttype"))
805 v->s = type_name(obj->type);
806 else if (!strcmp(name, "objectsize")) {
808 v->s = xstrfmt("%lu", sz);
811 grab_objectname(name, obj->oid.hash, v, &used_atom[i]);
815 /* See grab_values */
816 static void grab_tag_values(struct atom_value *val, int deref, struct object *obj, void *buf, unsigned long sz)
819 struct tag *tag = (struct tag *) obj;
821 for (i = 0; i < used_atom_cnt; i++) {
822 const char *name = used_atom[i].name;
823 struct atom_value *v = &val[i];
824 if (!!deref != (*name == '*'))
828 if (!strcmp(name, "tag"))
830 else if (!strcmp(name, "type") && tag->tagged)
831 v->s = type_name(tag->tagged->type);
832 else if (!strcmp(name, "object") && tag->tagged)
833 v->s = xstrdup(oid_to_hex(&tag->tagged->oid));
837 /* See grab_values */
838 static void grab_commit_values(struct atom_value *val, int deref, struct object *obj, void *buf, unsigned long sz)
841 struct commit *commit = (struct commit *) obj;
843 for (i = 0; i < used_atom_cnt; i++) {
844 const char *name = used_atom[i].name;
845 struct atom_value *v = &val[i];
846 if (!!deref != (*name == '*'))
850 if (!strcmp(name, "tree")) {
851 v->s = xstrdup(oid_to_hex(&commit->tree->object.oid));
853 else if (!strcmp(name, "numparent")) {
854 v->value = commit_list_count(commit->parents);
855 v->s = xstrfmt("%lu", (unsigned long)v->value);
857 else if (!strcmp(name, "parent")) {
858 struct commit_list *parents;
859 struct strbuf s = STRBUF_INIT;
860 for (parents = commit->parents; parents; parents = parents->next) {
861 struct commit *parent = parents->item;
862 if (parents != commit->parents)
863 strbuf_addch(&s, ' ');
864 strbuf_addstr(&s, oid_to_hex(&parent->object.oid));
866 v->s = strbuf_detach(&s, NULL);
871 static const char *find_wholine(const char *who, int wholen, const char *buf, unsigned long sz)
875 if (!strncmp(buf, who, wholen) &&
877 return buf + wholen + 1;
878 eol = strchr(buf, '\n');
883 return ""; /* end of header */
889 static const char *copy_line(const char *buf)
891 const char *eol = strchrnul(buf, '\n');
892 return xmemdupz(buf, eol - buf);
895 static const char *copy_name(const char *buf)
898 for (cp = buf; *cp && *cp != '\n'; cp++) {
899 if (!strncmp(cp, " <", 2))
900 return xmemdupz(buf, cp - buf);
905 static const char *copy_email(const char *buf)
907 const char *email = strchr(buf, '<');
911 eoemail = strchr(email, '>');
914 return xmemdupz(email, eoemail + 1 - email);
917 static char *copy_subject(const char *buf, unsigned long len)
919 char *r = xmemdupz(buf, len);
922 for (i = 0; i < len; i++)
929 static void grab_date(const char *buf, struct atom_value *v, const char *atomname)
931 const char *eoemail = strstr(buf, "> ");
933 timestamp_t timestamp;
935 struct date_mode date_mode = { DATE_NORMAL };
939 * We got here because atomname ends in "date" or "date<something>";
940 * it's not possible that <something> is not ":<format>" because
941 * parse_ref_filter_atom() wouldn't have allowed it, so we can assume that no
942 * ":" means no format is specified, and use the default.
944 formatp = strchr(atomname, ':');
945 if (formatp != NULL) {
947 parse_date_format(formatp, &date_mode);
952 timestamp = parse_timestamp(eoemail + 2, &zone, 10);
953 if (timestamp == TIME_MAX)
955 tz = strtol(zone, NULL, 10);
956 if ((tz == LONG_MIN || tz == LONG_MAX) && errno == ERANGE)
958 v->s = xstrdup(show_date(timestamp, tz, &date_mode));
959 v->value = timestamp;
966 /* See grab_values */
967 static void grab_person(const char *who, struct atom_value *val, int deref, struct object *obj, void *buf, unsigned long sz)
970 int wholen = strlen(who);
971 const char *wholine = NULL;
973 for (i = 0; i < used_atom_cnt; i++) {
974 const char *name = used_atom[i].name;
975 struct atom_value *v = &val[i];
976 if (!!deref != (*name == '*'))
980 if (strncmp(who, name, wholen))
982 if (name[wholen] != 0 &&
983 strcmp(name + wholen, "name") &&
984 strcmp(name + wholen, "email") &&
985 !starts_with(name + wholen, "date"))
988 wholine = find_wholine(who, wholen, buf, sz);
990 return; /* no point looking for it */
991 if (name[wholen] == 0)
992 v->s = copy_line(wholine);
993 else if (!strcmp(name + wholen, "name"))
994 v->s = copy_name(wholine);
995 else if (!strcmp(name + wholen, "email"))
996 v->s = copy_email(wholine);
997 else if (starts_with(name + wholen, "date"))
998 grab_date(wholine, v, name);
1002 * For a tag or a commit object, if "creator" or "creatordate" is
1003 * requested, do something special.
1005 if (strcmp(who, "tagger") && strcmp(who, "committer"))
1006 return; /* "author" for commit object is not wanted */
1008 wholine = find_wholine(who, wholen, buf, sz);
1011 for (i = 0; i < used_atom_cnt; i++) {
1012 const char *name = used_atom[i].name;
1013 struct atom_value *v = &val[i];
1014 if (!!deref != (*name == '*'))
1019 if (starts_with(name, "creatordate"))
1020 grab_date(wholine, v, name);
1021 else if (!strcmp(name, "creator"))
1022 v->s = copy_line(wholine);
1026 static void find_subpos(const char *buf, unsigned long sz,
1027 const char **sub, unsigned long *sublen,
1028 const char **body, unsigned long *bodylen,
1029 unsigned long *nonsiglen,
1030 const char **sig, unsigned long *siglen)
1033 /* skip past header until we hit empty line */
1034 while (*buf && *buf != '\n') {
1035 eol = strchrnul(buf, '\n');
1040 /* skip any empty lines */
1041 while (*buf == '\n')
1044 /* parse signature first; we might not even have a subject line */
1045 *sig = buf + parse_signature(buf, strlen(buf));
1046 *siglen = strlen(*sig);
1048 /* subject is first non-empty line */
1050 /* subject goes to first empty line */
1051 while (buf < *sig && *buf && *buf != '\n') {
1052 eol = strchrnul(buf, '\n');
1057 *sublen = buf - *sub;
1058 /* drop trailing newline, if present */
1059 if (*sublen && (*sub)[*sublen - 1] == '\n')
1062 /* skip any empty lines */
1063 while (*buf == '\n')
1066 *bodylen = strlen(buf);
1067 *nonsiglen = *sig - buf;
1071 * If 'lines' is greater than 0, append that many lines from the given
1072 * 'buf' of length 'size' to the given strbuf.
1074 static void append_lines(struct strbuf *out, const char *buf, unsigned long size, int lines)
1077 const char *sp, *eol;
1082 for (i = 0; i < lines && sp < buf + size; i++) {
1084 strbuf_addstr(out, "\n ");
1085 eol = memchr(sp, '\n', size - (sp - buf));
1086 len = eol ? eol - sp : size - (sp - buf);
1087 strbuf_add(out, sp, len);
1094 /* See grab_values */
1095 static void grab_sub_body_contents(struct atom_value *val, int deref, struct object *obj, void *buf, unsigned long sz)
1098 const char *subpos = NULL, *bodypos = NULL, *sigpos = NULL;
1099 unsigned long sublen = 0, bodylen = 0, nonsiglen = 0, siglen = 0;
1101 for (i = 0; i < used_atom_cnt; i++) {
1102 struct used_atom *atom = &used_atom[i];
1103 const char *name = atom->name;
1104 struct atom_value *v = &val[i];
1105 if (!!deref != (*name == '*'))
1109 if (strcmp(name, "subject") &&
1110 strcmp(name, "body") &&
1111 !starts_with(name, "trailers") &&
1112 !starts_with(name, "contents"))
1115 find_subpos(buf, sz,
1117 &bodypos, &bodylen, &nonsiglen,
1120 if (atom->u.contents.option == C_SUB)
1121 v->s = copy_subject(subpos, sublen);
1122 else if (atom->u.contents.option == C_BODY_DEP)
1123 v->s = xmemdupz(bodypos, bodylen);
1124 else if (atom->u.contents.option == C_BODY)
1125 v->s = xmemdupz(bodypos, nonsiglen);
1126 else if (atom->u.contents.option == C_SIG)
1127 v->s = xmemdupz(sigpos, siglen);
1128 else if (atom->u.contents.option == C_LINES) {
1129 struct strbuf s = STRBUF_INIT;
1130 const char *contents_end = bodylen + bodypos - siglen;
1132 /* Size is the length of the message after removing the signature */
1133 append_lines(&s, subpos, contents_end - subpos, atom->u.contents.nlines);
1134 v->s = strbuf_detach(&s, NULL);
1135 } else if (atom->u.contents.option == C_TRAILERS) {
1136 struct strbuf s = STRBUF_INIT;
1138 /* Format the trailer info according to the trailer_opts given */
1139 format_trailers_from_commit(&s, subpos, &atom->u.contents.trailer_opts);
1141 v->s = strbuf_detach(&s, NULL);
1142 } else if (atom->u.contents.option == C_BARE)
1143 v->s = xstrdup(subpos);
1148 * We want to have empty print-string for field requests
1149 * that do not apply (e.g. "authordate" for a tag object)
1151 static void fill_missing_values(struct atom_value *val)
1154 for (i = 0; i < used_atom_cnt; i++) {
1155 struct atom_value *v = &val[i];
1162 * val is a list of atom_value to hold returned values. Extract
1163 * the values for atoms in used_atom array out of (obj, buf, sz).
1164 * when deref is false, (obj, buf, sz) is the object that is
1165 * pointed at by the ref itself; otherwise it is the object the
1166 * ref (which is a tag) refers to.
1168 static void grab_values(struct atom_value *val, int deref, struct object *obj, void *buf, unsigned long sz)
1170 grab_common_values(val, deref, obj, buf, sz);
1171 switch (obj->type) {
1173 grab_tag_values(val, deref, obj, buf, sz);
1174 grab_sub_body_contents(val, deref, obj, buf, sz);
1175 grab_person("tagger", val, deref, obj, buf, sz);
1178 grab_commit_values(val, deref, obj, buf, sz);
1179 grab_sub_body_contents(val, deref, obj, buf, sz);
1180 grab_person("author", val, deref, obj, buf, sz);
1181 grab_person("committer", val, deref, obj, buf, sz);
1184 /* grab_tree_values(val, deref, obj, buf, sz); */
1187 /* grab_blob_values(val, deref, obj, buf, sz); */
1190 die("Eh? Object of type %d?", obj->type);
1194 static inline char *copy_advance(char *dst, const char *src)
1201 static const char *lstrip_ref_components(const char *refname, int len)
1203 long remaining = len;
1204 const char *start = refname;
1208 const char *p = refname;
1210 /* Find total no of '/' separated path-components */
1211 for (i = 0; p[i]; p[i] == '/' ? i++ : *p++)
1214 * The number of components we need to strip is now
1215 * the total minus the components to be left (Plus one
1216 * because we count the number of '/', but the number
1217 * of components is one more than the no of '/').
1219 remaining = i + len + 1;
1222 while (remaining > 0) {
1235 static const char *rstrip_ref_components(const char *refname, int len)
1237 long remaining = len;
1238 char *start = xstrdup(refname);
1242 const char *p = refname;
1244 /* Find total no of '/' separated path-components */
1245 for (i = 0; p[i]; p[i] == '/' ? i++ : *p++)
1248 * The number of components we need to strip is now
1249 * the total minus the components to be left (Plus one
1250 * because we count the number of '/', but the number
1251 * of components is one more than the no of '/').
1253 remaining = i + len + 1;
1256 while (remaining-- > 0) {
1257 char *p = strrchr(start, '/');
1266 static const char *show_ref(struct refname_atom *atom, const char *refname)
1268 if (atom->option == R_SHORT)
1269 return shorten_unambiguous_ref(refname, warn_ambiguous_refs);
1270 else if (atom->option == R_LSTRIP)
1271 return lstrip_ref_components(refname, atom->lstrip);
1272 else if (atom->option == R_RSTRIP)
1273 return rstrip_ref_components(refname, atom->rstrip);
1278 static void fill_remote_ref_details(struct used_atom *atom, const char *refname,
1279 struct branch *branch, const char **s)
1281 int num_ours, num_theirs;
1282 if (atom->u.remote_ref.option == RR_REF)
1283 *s = show_ref(&atom->u.remote_ref.refname, refname);
1284 else if (atom->u.remote_ref.option == RR_TRACK) {
1285 if (stat_tracking_info(branch, &num_ours, &num_theirs,
1286 NULL, AHEAD_BEHIND_FULL) < 0) {
1287 *s = xstrdup(msgs.gone);
1288 } else if (!num_ours && !num_theirs)
1291 *s = xstrfmt(msgs.behind, num_theirs);
1292 else if (!num_theirs)
1293 *s = xstrfmt(msgs.ahead, num_ours);
1295 *s = xstrfmt(msgs.ahead_behind,
1296 num_ours, num_theirs);
1297 if (!atom->u.remote_ref.nobracket && *s[0]) {
1298 const char *to_free = *s;
1299 *s = xstrfmt("[%s]", *s);
1300 free((void *)to_free);
1302 } else if (atom->u.remote_ref.option == RR_TRACKSHORT) {
1303 if (stat_tracking_info(branch, &num_ours, &num_theirs,
1304 NULL, AHEAD_BEHIND_FULL) < 0)
1307 if (!num_ours && !num_theirs)
1311 else if (!num_theirs)
1315 } else if (atom->u.remote_ref.option == RR_REMOTE_NAME) {
1317 const char *remote = atom->u.remote_ref.push ?
1318 pushremote_for_branch(branch, &explicit) :
1319 remote_for_branch(branch, &explicit);
1321 *s = xstrdup(remote);
1324 } else if (atom->u.remote_ref.option == RR_REMOTE_REF) {
1328 merge = remote_ref_for_branch(branch, atom->u.remote_ref.push,
1331 *s = xstrdup(merge);
1335 die("BUG: unhandled RR_* enum");
1338 char *get_head_description(void)
1340 struct strbuf desc = STRBUF_INIT;
1341 struct wt_status_state state;
1342 memset(&state, 0, sizeof(state));
1343 wt_status_get_state(&state, 1);
1344 if (state.rebase_in_progress ||
1345 state.rebase_interactive_in_progress)
1346 strbuf_addf(&desc, _("(no branch, rebasing %s)"),
1348 else if (state.bisect_in_progress)
1349 strbuf_addf(&desc, _("(no branch, bisect started on %s)"),
1351 else if (state.detached_from) {
1352 if (state.detached_at)
1354 * TRANSLATORS: make sure this matches "HEAD
1355 * detached at " in wt-status.c
1357 strbuf_addf(&desc, _("(HEAD detached at %s)"),
1358 state.detached_from);
1361 * TRANSLATORS: make sure this matches "HEAD
1362 * detached from " in wt-status.c
1364 strbuf_addf(&desc, _("(HEAD detached from %s)"),
1365 state.detached_from);
1368 strbuf_addstr(&desc, _("(no branch)"));
1371 free(state.detached_from);
1372 return strbuf_detach(&desc, NULL);
1375 static const char *get_symref(struct used_atom *atom, struct ref_array_item *ref)
1380 return show_ref(&atom->u.refname, ref->symref);
1383 static const char *get_refname(struct used_atom *atom, struct ref_array_item *ref)
1385 if (ref->kind & FILTER_REFS_DETACHED_HEAD)
1386 return get_head_description();
1387 return show_ref(&atom->u.refname, ref->refname);
1390 static void get_object(struct ref_array_item *ref, const struct object_id *oid,
1391 int deref, struct object **obj)
1395 void *buf = get_obj(oid, obj, &size, &eaten);
1397 die(_("missing object %s for %s"),
1398 oid_to_hex(oid), ref->refname);
1400 die(_("parse_object_buffer failed on %s for %s"),
1401 oid_to_hex(oid), ref->refname);
1403 grab_values(ref->value, deref, *obj, buf, size);
1409 * Parse the object referred by ref, and grab needed value.
1411 static void populate_value(struct ref_array_item *ref)
1415 const struct object_id *tagged;
1417 ref->value = xcalloc(used_atom_cnt, sizeof(struct atom_value));
1419 if (need_symref && (ref->flag & REF_ISSYMREF) && !ref->symref) {
1420 ref->symref = resolve_refdup(ref->refname, RESOLVE_REF_READING,
1426 /* Fill in specials first */
1427 for (i = 0; i < used_atom_cnt; i++) {
1428 struct used_atom *atom = &used_atom[i];
1429 const char *name = used_atom[i].name;
1430 struct atom_value *v = &ref->value[i];
1432 const char *refname;
1433 struct branch *branch = NULL;
1435 v->handler = append_atom;
1443 if (starts_with(name, "refname"))
1444 refname = get_refname(atom, ref);
1445 else if (starts_with(name, "symref"))
1446 refname = get_symref(atom, ref);
1447 else if (starts_with(name, "upstream")) {
1448 const char *branch_name;
1449 /* only local branches may have an upstream */
1450 if (!skip_prefix(ref->refname, "refs/heads/",
1453 branch = branch_get(branch_name);
1455 refname = branch_get_upstream(branch, NULL);
1457 fill_remote_ref_details(atom, refname, branch, &v->s);
1459 } else if (atom->u.remote_ref.push) {
1460 const char *branch_name;
1461 if (!skip_prefix(ref->refname, "refs/heads/",
1464 branch = branch_get(branch_name);
1466 if (atom->u.remote_ref.push_remote)
1469 refname = branch_get_push(branch, NULL);
1473 fill_remote_ref_details(atom, refname, branch, &v->s);
1475 } else if (starts_with(name, "color:")) {
1476 v->s = atom->u.color;
1478 } else if (!strcmp(name, "flag")) {
1479 char buf[256], *cp = buf;
1480 if (ref->flag & REF_ISSYMREF)
1481 cp = copy_advance(cp, ",symref");
1482 if (ref->flag & REF_ISPACKED)
1483 cp = copy_advance(cp, ",packed");
1488 v->s = xstrdup(buf + 1);
1491 } else if (!deref && grab_objectname(name, ref->objectname.hash, v, atom)) {
1493 } else if (!strcmp(name, "HEAD")) {
1494 if (atom->u.head && !strcmp(ref->refname, atom->u.head))
1499 } else if (starts_with(name, "align")) {
1500 v->handler = align_atom_handler;
1502 } else if (!strcmp(name, "end")) {
1503 v->handler = end_atom_handler;
1505 } else if (starts_with(name, "if")) {
1508 if (skip_prefix(name, "if:", &s))
1510 v->handler = if_atom_handler;
1512 } else if (!strcmp(name, "then")) {
1513 v->handler = then_atom_handler;
1515 } else if (!strcmp(name, "else")) {
1516 v->handler = else_atom_handler;
1524 v->s = xstrfmt("%s^{}", refname);
1527 for (i = 0; i < used_atom_cnt; i++) {
1528 struct atom_value *v = &ref->value[i];
1532 if (used_atom_cnt <= i)
1535 get_object(ref, &ref->objectname, 0, &obj);
1538 * If there is no atom that wants to know about tagged
1539 * object, we are done.
1541 if (!need_tagged || (obj->type != OBJ_TAG))
1545 * If it is a tag object, see if we use a value that derefs
1546 * the object, and if we do grab the object it refers to.
1548 tagged = &((struct tag *)obj)->tagged->oid;
1551 * NEEDSWORK: This derefs tag only once, which
1552 * is good to deal with chains of trust, but
1553 * is not consistent with what deref_tag() does
1554 * which peels the onion to the core.
1556 get_object(ref, tagged, 1, &obj);
1560 * Given a ref, return the value for the atom. This lazily gets value
1561 * out of the object by calling populate value.
1563 static void get_ref_atom_value(struct ref_array_item *ref, int atom, struct atom_value **v)
1566 populate_value(ref);
1567 fill_missing_values(ref->value);
1569 *v = &ref->value[atom];
1573 * Unknown has to be "0" here, because that's the default value for
1574 * contains_cache slab entries that have not yet been assigned.
1576 enum contains_result {
1577 CONTAINS_UNKNOWN = 0,
1582 define_commit_slab(contains_cache, enum contains_result);
1584 struct ref_filter_cbdata {
1585 struct ref_array *array;
1586 struct ref_filter *filter;
1587 struct contains_cache contains_cache;
1588 struct contains_cache no_contains_cache;
1592 * Mimicking the real stack, this stack lives on the heap, avoiding stack
1595 * At each recursion step, the stack items points to the commits whose
1596 * ancestors are to be inspected.
1598 struct contains_stack {
1600 struct contains_stack_entry {
1601 struct commit *commit;
1602 struct commit_list *parents;
1606 static int in_commit_list(const struct commit_list *want, struct commit *c)
1608 for (; want; want = want->next)
1609 if (!oidcmp(&want->item->object.oid, &c->object.oid))
1615 * Test whether the candidate or one of its parents is contained in the list.
1616 * Do not recurse to find out, though, but return -1 if inconclusive.
1618 static enum contains_result contains_test(struct commit *candidate,
1619 const struct commit_list *want,
1620 struct contains_cache *cache)
1622 enum contains_result *cached = contains_cache_at(cache, candidate);
1624 /* If we already have the answer cached, return that. */
1629 if (in_commit_list(want, candidate)) {
1630 *cached = CONTAINS_YES;
1631 return CONTAINS_YES;
1634 /* Otherwise, we don't know; prepare to recurse */
1635 parse_commit_or_die(candidate);
1636 return CONTAINS_UNKNOWN;
1639 static void push_to_contains_stack(struct commit *candidate, struct contains_stack *contains_stack)
1641 ALLOC_GROW(contains_stack->contains_stack, contains_stack->nr + 1, contains_stack->alloc);
1642 contains_stack->contains_stack[contains_stack->nr].commit = candidate;
1643 contains_stack->contains_stack[contains_stack->nr++].parents = candidate->parents;
1646 static enum contains_result contains_tag_algo(struct commit *candidate,
1647 const struct commit_list *want,
1648 struct contains_cache *cache)
1650 struct contains_stack contains_stack = { 0, 0, NULL };
1651 enum contains_result result = contains_test(candidate, want, cache);
1653 if (result != CONTAINS_UNKNOWN)
1656 push_to_contains_stack(candidate, &contains_stack);
1657 while (contains_stack.nr) {
1658 struct contains_stack_entry *entry = &contains_stack.contains_stack[contains_stack.nr - 1];
1659 struct commit *commit = entry->commit;
1660 struct commit_list *parents = entry->parents;
1663 *contains_cache_at(cache, commit) = CONTAINS_NO;
1664 contains_stack.nr--;
1667 * If we just popped the stack, parents->item has been marked,
1668 * therefore contains_test will return a meaningful yes/no.
1670 else switch (contains_test(parents->item, want, cache)) {
1672 *contains_cache_at(cache, commit) = CONTAINS_YES;
1673 contains_stack.nr--;
1676 entry->parents = parents->next;
1678 case CONTAINS_UNKNOWN:
1679 push_to_contains_stack(parents->item, &contains_stack);
1683 free(contains_stack.contains_stack);
1684 return contains_test(candidate, want, cache);
1687 static int commit_contains(struct ref_filter *filter, struct commit *commit,
1688 struct commit_list *list, struct contains_cache *cache)
1690 if (filter->with_commit_tag_algo)
1691 return contains_tag_algo(commit, list, cache) == CONTAINS_YES;
1692 return is_descendant_of(commit, list);
1696 * Return 1 if the refname matches one of the patterns, otherwise 0.
1697 * A pattern can be a literal prefix (e.g. a refname "refs/heads/master"
1698 * matches a pattern "refs/heads/mas") or a wildcard (e.g. the same ref
1699 * matches "refs/heads/mas*", too).
1701 static int match_pattern(const struct ref_filter *filter, const char *refname)
1703 const char **patterns = filter->name_patterns;
1706 if (filter->ignore_case)
1707 flags |= WM_CASEFOLD;
1710 * When no '--format' option is given we need to skip the prefix
1711 * for matching refs of tags and branches.
1713 (void)(skip_prefix(refname, "refs/tags/", &refname) ||
1714 skip_prefix(refname, "refs/heads/", &refname) ||
1715 skip_prefix(refname, "refs/remotes/", &refname) ||
1716 skip_prefix(refname, "refs/", &refname));
1718 for (; *patterns; patterns++) {
1719 if (!wildmatch(*patterns, refname, flags))
1726 * Return 1 if the refname matches one of the patterns, otherwise 0.
1727 * A pattern can be path prefix (e.g. a refname "refs/heads/master"
1728 * matches a pattern "refs/heads/" but not "refs/heads/m") or a
1729 * wildcard (e.g. the same ref matches "refs/heads/m*", too).
1731 static int match_name_as_path(const struct ref_filter *filter, const char *refname)
1733 const char **pattern = filter->name_patterns;
1734 int namelen = strlen(refname);
1735 unsigned flags = WM_PATHNAME;
1737 if (filter->ignore_case)
1738 flags |= WM_CASEFOLD;
1740 for (; *pattern; pattern++) {
1741 const char *p = *pattern;
1742 int plen = strlen(p);
1744 if ((plen <= namelen) &&
1745 !strncmp(refname, p, plen) &&
1746 (refname[plen] == '\0' ||
1747 refname[plen] == '/' ||
1750 if (!wildmatch(p, refname, WM_PATHNAME))
1756 /* Return 1 if the refname matches one of the patterns, otherwise 0. */
1757 static int filter_pattern_match(struct ref_filter *filter, const char *refname)
1759 if (!*filter->name_patterns)
1760 return 1; /* No pattern always matches */
1761 if (filter->match_as_path)
1762 return match_name_as_path(filter, refname);
1763 return match_pattern(filter, refname);
1767 * Find the longest prefix of pattern we can pass to
1768 * `for_each_fullref_in()`, namely the part of pattern preceding the
1769 * first glob character. (Note that `for_each_fullref_in()` is
1770 * perfectly happy working with a prefix that doesn't end at a
1771 * pathname component boundary.)
1773 static void find_longest_prefix(struct strbuf *out, const char *pattern)
1777 for (p = pattern; *p && !is_glob_special(*p); p++)
1780 strbuf_add(out, pattern, p - pattern);
1784 * This is the same as for_each_fullref_in(), but it tries to iterate
1785 * only over the patterns we'll care about. Note that it _doesn't_ do a full
1786 * pattern match, so the callback still has to match each ref individually.
1788 static int for_each_fullref_in_pattern(struct ref_filter *filter,
1793 struct strbuf prefix = STRBUF_INIT;
1796 if (!filter->match_as_path) {
1798 * in this case, the patterns are applied after
1799 * prefixes like "refs/heads/" etc. are stripped off,
1800 * so we have to look at everything:
1802 return for_each_fullref_in("", cb, cb_data, broken);
1805 if (!filter->name_patterns[0]) {
1806 /* no patterns; we have to look at everything */
1807 return for_each_fullref_in("", cb, cb_data, broken);
1810 if (filter->name_patterns[1]) {
1812 * multiple patterns; in theory this could still work as long
1813 * as the patterns are disjoint. We'd just make multiple calls
1814 * to for_each_ref(). But if they're not disjoint, we'd end up
1815 * reporting the same ref multiple times. So let's punt on that
1818 return for_each_fullref_in("", cb, cb_data, broken);
1821 find_longest_prefix(&prefix, filter->name_patterns[0]);
1823 ret = for_each_fullref_in(prefix.buf, cb, cb_data, broken);
1824 strbuf_release(&prefix);
1829 * Given a ref (sha1, refname), check if the ref belongs to the array
1830 * of sha1s. If the given ref is a tag, check if the given tag points
1831 * at one of the sha1s in the given sha1 array.
1832 * the given sha1_array.
1834 * 1. Only a single level of inderection is obtained, we might want to
1835 * change this to account for multiple levels (e.g. annotated tags
1836 * pointing to annotated tags pointing to a commit.)
1837 * 2. As the refs are cached we might know what refname peels to without
1838 * the need to parse the object via parse_object(). peel_ref() might be a
1839 * more efficient alternative to obtain the pointee.
1841 static const struct object_id *match_points_at(struct oid_array *points_at,
1842 const struct object_id *oid,
1843 const char *refname)
1845 const struct object_id *tagged_oid = NULL;
1848 if (oid_array_lookup(points_at, oid) >= 0)
1850 obj = parse_object(oid);
1852 die(_("malformed object at '%s'"), refname);
1853 if (obj->type == OBJ_TAG)
1854 tagged_oid = &((struct tag *)obj)->tagged->oid;
1855 if (tagged_oid && oid_array_lookup(points_at, tagged_oid) >= 0)
1860 /* Allocate space for a new ref_array_item and copy the objectname and flag to it */
1861 static struct ref_array_item *new_ref_array_item(const char *refname,
1862 const unsigned char *objectname,
1865 struct ref_array_item *ref;
1866 FLEX_ALLOC_STR(ref, refname, refname);
1867 hashcpy(ref->objectname.hash, objectname);
1873 static int ref_kind_from_refname(const char *refname)
1881 { "refs/heads/" , FILTER_REFS_BRANCHES },
1882 { "refs/remotes/" , FILTER_REFS_REMOTES },
1883 { "refs/tags/", FILTER_REFS_TAGS}
1886 if (!strcmp(refname, "HEAD"))
1887 return FILTER_REFS_DETACHED_HEAD;
1889 for (i = 0; i < ARRAY_SIZE(ref_kind); i++) {
1890 if (starts_with(refname, ref_kind[i].prefix))
1891 return ref_kind[i].kind;
1894 return FILTER_REFS_OTHERS;
1897 static int filter_ref_kind(struct ref_filter *filter, const char *refname)
1899 if (filter->kind == FILTER_REFS_BRANCHES ||
1900 filter->kind == FILTER_REFS_REMOTES ||
1901 filter->kind == FILTER_REFS_TAGS)
1902 return filter->kind;
1903 return ref_kind_from_refname(refname);
1907 * A call-back given to for_each_ref(). Filter refs and keep them for
1908 * later object processing.
1910 static int ref_filter_handler(const char *refname, const struct object_id *oid, int flag, void *cb_data)
1912 struct ref_filter_cbdata *ref_cbdata = cb_data;
1913 struct ref_filter *filter = ref_cbdata->filter;
1914 struct ref_array_item *ref;
1915 struct commit *commit = NULL;
1918 if (flag & REF_BAD_NAME) {
1919 warning(_("ignoring ref with broken name %s"), refname);
1923 if (flag & REF_ISBROKEN) {
1924 warning(_("ignoring broken ref %s"), refname);
1928 /* Obtain the current ref kind from filter_ref_kind() and ignore unwanted refs. */
1929 kind = filter_ref_kind(filter, refname);
1930 if (!(kind & filter->kind))
1933 if (!filter_pattern_match(filter, refname))
1936 if (filter->points_at.nr && !match_points_at(&filter->points_at, oid, refname))
1940 * A merge filter is applied on refs pointing to commits. Hence
1941 * obtain the commit using the 'oid' available and discard all
1942 * non-commits early. The actual filtering is done later.
1944 if (filter->merge_commit || filter->with_commit || filter->no_commit || filter->verbose) {
1945 commit = lookup_commit_reference_gently(oid, 1);
1948 /* We perform the filtering for the '--contains' option... */
1949 if (filter->with_commit &&
1950 !commit_contains(filter, commit, filter->with_commit, &ref_cbdata->contains_cache))
1952 /* ...or for the `--no-contains' option */
1953 if (filter->no_commit &&
1954 commit_contains(filter, commit, filter->no_commit, &ref_cbdata->no_contains_cache))
1959 * We do not open the object yet; sort may only need refname
1960 * to do its job and the resulting list may yet to be pruned
1961 * by maxcount logic.
1963 ref = new_ref_array_item(refname, oid->hash, flag);
1964 ref->commit = commit;
1966 REALLOC_ARRAY(ref_cbdata->array->items, ref_cbdata->array->nr + 1);
1967 ref_cbdata->array->items[ref_cbdata->array->nr++] = ref;
1972 /* Free memory allocated for a ref_array_item */
1973 static void free_array_item(struct ref_array_item *item)
1975 free((char *)item->symref);
1979 /* Free all memory allocated for ref_array */
1980 void ref_array_clear(struct ref_array *array)
1984 for (i = 0; i < array->nr; i++)
1985 free_array_item(array->items[i]);
1986 FREE_AND_NULL(array->items);
1987 array->nr = array->alloc = 0;
1990 static void do_merge_filter(struct ref_filter_cbdata *ref_cbdata)
1992 struct rev_info revs;
1994 struct ref_filter *filter = ref_cbdata->filter;
1995 struct ref_array *array = ref_cbdata->array;
1996 struct commit **to_clear = xcalloc(sizeof(struct commit *), array->nr);
1998 init_revisions(&revs, NULL);
2000 for (i = 0; i < array->nr; i++) {
2001 struct ref_array_item *item = array->items[i];
2002 add_pending_object(&revs, &item->commit->object, item->refname);
2003 to_clear[i] = item->commit;
2006 filter->merge_commit->object.flags |= UNINTERESTING;
2007 add_pending_object(&revs, &filter->merge_commit->object, "");
2010 if (prepare_revision_walk(&revs))
2011 die(_("revision walk setup failed"));
2016 for (i = 0; i < old_nr; i++) {
2017 struct ref_array_item *item = array->items[i];
2018 struct commit *commit = item->commit;
2020 int is_merged = !!(commit->object.flags & UNINTERESTING);
2022 if (is_merged == (filter->merge == REF_FILTER_MERGED_INCLUDE))
2023 array->items[array->nr++] = array->items[i];
2025 free_array_item(item);
2028 clear_commit_marks_many(old_nr, to_clear, ALL_REV_FLAGS);
2029 clear_commit_marks(filter->merge_commit, ALL_REV_FLAGS);
2034 * API for filtering a set of refs. Based on the type of refs the user
2035 * has requested, we iterate through those refs and apply filters
2036 * as per the given ref_filter structure and finally store the
2037 * filtered refs in the ref_array structure.
2039 int filter_refs(struct ref_array *array, struct ref_filter *filter, unsigned int type)
2041 struct ref_filter_cbdata ref_cbdata;
2043 unsigned int broken = 0;
2045 ref_cbdata.array = array;
2046 ref_cbdata.filter = filter;
2048 if (type & FILTER_REFS_INCLUDE_BROKEN)
2050 filter->kind = type & FILTER_REFS_KIND_MASK;
2052 init_contains_cache(&ref_cbdata.contains_cache);
2053 init_contains_cache(&ref_cbdata.no_contains_cache);
2055 /* Simple per-ref filtering */
2057 die("filter_refs: invalid type");
2060 * For common cases where we need only branches or remotes or tags,
2061 * we only iterate through those refs. If a mix of refs is needed,
2062 * we iterate over all refs and filter out required refs with the help
2063 * of filter_ref_kind().
2065 if (filter->kind == FILTER_REFS_BRANCHES)
2066 ret = for_each_fullref_in("refs/heads/", ref_filter_handler, &ref_cbdata, broken);
2067 else if (filter->kind == FILTER_REFS_REMOTES)
2068 ret = for_each_fullref_in("refs/remotes/", ref_filter_handler, &ref_cbdata, broken);
2069 else if (filter->kind == FILTER_REFS_TAGS)
2070 ret = for_each_fullref_in("refs/tags/", ref_filter_handler, &ref_cbdata, broken);
2071 else if (filter->kind & FILTER_REFS_ALL)
2072 ret = for_each_fullref_in_pattern(filter, ref_filter_handler, &ref_cbdata, broken);
2073 if (!ret && (filter->kind & FILTER_REFS_DETACHED_HEAD))
2074 head_ref(ref_filter_handler, &ref_cbdata);
2077 clear_contains_cache(&ref_cbdata.contains_cache);
2078 clear_contains_cache(&ref_cbdata.no_contains_cache);
2080 /* Filters that need revision walking */
2081 if (filter->merge_commit)
2082 do_merge_filter(&ref_cbdata);
2087 static int cmp_ref_sorting(struct ref_sorting *s, struct ref_array_item *a, struct ref_array_item *b)
2089 struct atom_value *va, *vb;
2091 cmp_type cmp_type = used_atom[s->atom].type;
2092 int (*cmp_fn)(const char *, const char *);
2094 get_ref_atom_value(a, s->atom, &va);
2095 get_ref_atom_value(b, s->atom, &vb);
2096 cmp_fn = s->ignore_case ? strcasecmp : strcmp;
2098 cmp = versioncmp(va->s, vb->s);
2099 else if (cmp_type == FIELD_STR)
2100 cmp = cmp_fn(va->s, vb->s);
2102 if (va->value < vb->value)
2104 else if (va->value == vb->value)
2105 cmp = cmp_fn(a->refname, b->refname);
2110 return (s->reverse) ? -cmp : cmp;
2113 static int compare_refs(const void *a_, const void *b_, void *ref_sorting)
2115 struct ref_array_item *a = *((struct ref_array_item **)a_);
2116 struct ref_array_item *b = *((struct ref_array_item **)b_);
2117 struct ref_sorting *s;
2119 for (s = ref_sorting; s; s = s->next) {
2120 int cmp = cmp_ref_sorting(s, a, b);
2127 void ref_array_sort(struct ref_sorting *sorting, struct ref_array *array)
2129 QSORT_S(array->items, array->nr, compare_refs, sorting);
2132 static void append_literal(const char *cp, const char *ep, struct ref_formatting_state *state)
2134 struct strbuf *s = &state->stack->output;
2136 while (*cp && (!ep || cp < ep)) {
2141 int ch = hex2chr(cp + 1);
2143 strbuf_addch(s, ch);
2149 strbuf_addch(s, *cp);
2154 int format_ref_array_item(struct ref_array_item *info,
2155 const struct ref_format *format,
2156 struct strbuf *final_buf,
2157 struct strbuf *error_buf)
2159 const char *cp, *sp, *ep;
2160 struct ref_formatting_state state = REF_FORMATTING_STATE_INIT;
2162 state.quote_style = format->quote_style;
2163 push_stack_element(&state.stack);
2165 for (cp = format->format; *cp && (sp = find_next(cp)); cp = ep + 1) {
2166 struct atom_value *atomv;
2169 ep = strchr(sp, ')');
2171 append_literal(cp, sp, &state);
2172 pos = parse_ref_filter_atom(format, sp + 2, ep, error_buf);
2174 pop_stack_element(&state.stack);
2177 get_ref_atom_value(info, pos, &atomv);
2178 if (atomv->handler(atomv, &state, error_buf)) {
2179 pop_stack_element(&state.stack);
2184 sp = cp + strlen(cp);
2185 append_literal(cp, sp, &state);
2187 if (format->need_color_reset_at_eol) {
2188 struct atom_value resetv;
2189 resetv.s = GIT_COLOR_RESET;
2190 if (append_atom(&resetv, &state, error_buf)) {
2191 pop_stack_element(&state.stack);
2195 if (state.stack->prev) {
2196 pop_stack_element(&state.stack);
2197 return strbuf_addf_ret(error_buf, -1, _("format: %%(end) atom missing"));
2199 strbuf_addbuf(final_buf, &state.stack->output);
2200 pop_stack_element(&state.stack);
2204 void show_ref_array_item(struct ref_array_item *info,
2205 const struct ref_format *format)
2207 struct strbuf final_buf = STRBUF_INIT;
2208 struct strbuf error_buf = STRBUF_INIT;
2210 if (format_ref_array_item(info, format, &final_buf, &error_buf))
2211 die("%s", error_buf.buf);
2212 fwrite(final_buf.buf, 1, final_buf.len, stdout);
2213 strbuf_release(&error_buf);
2214 strbuf_release(&final_buf);
2218 void pretty_print_ref(const char *name, const unsigned char *sha1,
2219 const struct ref_format *format)
2221 struct ref_array_item *ref_item;
2222 ref_item = new_ref_array_item(name, sha1, 0);
2223 ref_item->kind = ref_kind_from_refname(name);
2224 show_ref_array_item(ref_item, format);
2225 free_array_item(ref_item);
2228 static int parse_sorting_atom(const char *atom)
2231 * This parses an atom using a dummy ref_format, since we don't
2232 * actually care about the formatting details.
2234 struct ref_format dummy = REF_FORMAT_INIT;
2235 const char *end = atom + strlen(atom);
2236 struct strbuf err = STRBUF_INIT;
2237 int res = parse_ref_filter_atom(&dummy, atom, end, &err);
2240 strbuf_release(&err);
2244 /* If no sorting option is given, use refname to sort as default */
2245 struct ref_sorting *ref_default_sorting(void)
2247 static const char cstr_name[] = "refname";
2249 struct ref_sorting *sorting = xcalloc(1, sizeof(*sorting));
2251 sorting->next = NULL;
2252 sorting->atom = parse_sorting_atom(cstr_name);
2256 void parse_ref_sorting(struct ref_sorting **sorting_tail, const char *arg)
2258 struct ref_sorting *s;
2260 s = xcalloc(1, sizeof(*s));
2261 s->next = *sorting_tail;
2268 if (skip_prefix(arg, "version:", &arg) ||
2269 skip_prefix(arg, "v:", &arg))
2271 s->atom = parse_sorting_atom(arg);
2274 int parse_opt_ref_sorting(const struct option *opt, const char *arg, int unset)
2276 if (!arg) /* should --no-sort void the list ? */
2278 parse_ref_sorting(opt->value, arg);
2282 int parse_opt_merge_filter(const struct option *opt, const char *arg, int unset)
2284 struct ref_filter *rf = opt->value;
2285 struct object_id oid;
2286 int no_merged = starts_with(opt->long_name, "no");
2290 return opterror(opt, "is incompatible with --merged", 0);
2292 return opterror(opt, "is incompatible with --no-merged", 0);
2296 rf->merge = no_merged
2297 ? REF_FILTER_MERGED_OMIT
2298 : REF_FILTER_MERGED_INCLUDE;
2300 if (get_oid(arg, &oid))
2301 die(_("malformed object name %s"), arg);
2303 rf->merge_commit = lookup_commit_reference_gently(&oid, 0);
2304 if (!rf->merge_commit)
2305 return opterror(opt, "must point to a commit", 0);