3 #include "parse-options.h"
6 #include "object-store.h"
7 #include "repository.h"
13 #include "ref-filter.h"
16 #include "git-compat-util.h"
19 #include "wt-status.h"
20 #include "commit-slab.h"
21 #include "commit-graph.h"
23 static struct ref_msg
{
27 const char *ahead_behind
;
29 /* Untranslated plumbing messages: */
36 void setup_ref_filter_porcelain_msg(void)
38 msgs
.gone
= _("gone");
39 msgs
.ahead
= _("ahead %d");
40 msgs
.behind
= _("behind %d");
41 msgs
.ahead_behind
= _("ahead %d, behind %d");
44 typedef enum { FIELD_STR
, FIELD_ULONG
, FIELD_TIME
} cmp_type
;
45 typedef enum { COMPARE_EQUAL
, COMPARE_UNEQUAL
, COMPARE_NONE
} cmp_status
;
53 cmp_status cmp_status
;
55 unsigned int then_atom_seen
: 1,
57 condition_satisfied
: 1;
61 enum { R_NORMAL
, R_SHORT
, R_LSTRIP
, R_RSTRIP
} option
;
66 * An atom is a valid field atom listed below, possibly prefixed with
67 * a "*" to denote deref_tag().
69 * We parse given format string and sort specifiers, and make a list
70 * of properties that we need to extract out of objects. ref_array_item
71 * structure will hold an array of values extracted that can be
72 * indexed with the "atom number", which is an index into this
75 static struct used_atom
{
79 char color
[COLOR_MAXLEN
];
83 RR_REF
, RR_TRACK
, RR_TRACKSHORT
, RR_REMOTE_NAME
, RR_REMOTE_REF
85 struct refname_atom refname
;
86 unsigned int nobracket
: 1, push
: 1, push_remote
: 1;
89 enum { C_BARE
, C_BODY
, C_BODY_DEP
, C_LINES
, C_SIG
, C_SUB
, C_TRAILERS
} option
;
90 struct process_trailer_options trailer_opts
;
94 cmp_status cmp_status
;
98 enum { O_FULL
, O_LENGTH
, O_SHORT
} option
;
101 struct refname_atom refname
;
105 static int used_atom_cnt
, need_tagged
, need_symref
;
108 * Expand string, append it to strbuf *sb, then return error code ret.
109 * Allow to save few lines of code.
111 static int strbuf_addf_ret(struct strbuf
*sb
, int ret
, const char *fmt
, ...)
115 strbuf_vaddf(sb
, fmt
, ap
);
120 static int color_atom_parser(const struct ref_format
*format
, struct used_atom
*atom
,
121 const char *color_value
, struct strbuf
*err
)
124 return strbuf_addf_ret(err
, -1, _("expected format: %%(color:<color>)"));
125 if (color_parse(color_value
, atom
->u
.color
) < 0)
126 return strbuf_addf_ret(err
, -1, _("unrecognized color: %%(color:%s)"),
129 * We check this after we've parsed the color, which lets us complain
130 * about syntactically bogus color names even if they won't be used.
132 if (!want_color(format
->use_color
))
133 color_parse("", atom
->u
.color
);
137 static int refname_atom_parser_internal(struct refname_atom
*atom
, const char *arg
,
138 const char *name
, struct strbuf
*err
)
141 atom
->option
= R_NORMAL
;
142 else if (!strcmp(arg
, "short"))
143 atom
->option
= R_SHORT
;
144 else if (skip_prefix(arg
, "lstrip=", &arg
) ||
145 skip_prefix(arg
, "strip=", &arg
)) {
146 atom
->option
= R_LSTRIP
;
147 if (strtol_i(arg
, 10, &atom
->lstrip
))
148 return strbuf_addf_ret(err
, -1, _("Integer value expected refname:lstrip=%s"), arg
);
149 } else if (skip_prefix(arg
, "rstrip=", &arg
)) {
150 atom
->option
= R_RSTRIP
;
151 if (strtol_i(arg
, 10, &atom
->rstrip
))
152 return strbuf_addf_ret(err
, -1, _("Integer value expected refname:rstrip=%s"), arg
);
154 return strbuf_addf_ret(err
, -1, _("unrecognized %%(%s) argument: %s"), name
, arg
);
158 static int remote_ref_atom_parser(const struct ref_format
*format
, struct used_atom
*atom
,
159 const char *arg
, struct strbuf
*err
)
161 struct string_list params
= STRING_LIST_INIT_DUP
;
164 if (!strcmp(atom
->name
, "push") || starts_with(atom
->name
, "push:"))
165 atom
->u
.remote_ref
.push
= 1;
168 atom
->u
.remote_ref
.option
= RR_REF
;
169 return refname_atom_parser_internal(&atom
->u
.remote_ref
.refname
,
170 arg
, atom
->name
, err
);
173 atom
->u
.remote_ref
.nobracket
= 0;
174 string_list_split(¶ms
, arg
, ',', -1);
176 for (i
= 0; i
< params
.nr
; i
++) {
177 const char *s
= params
.items
[i
].string
;
179 if (!strcmp(s
, "track"))
180 atom
->u
.remote_ref
.option
= RR_TRACK
;
181 else if (!strcmp(s
, "trackshort"))
182 atom
->u
.remote_ref
.option
= RR_TRACKSHORT
;
183 else if (!strcmp(s
, "nobracket"))
184 atom
->u
.remote_ref
.nobracket
= 1;
185 else if (!strcmp(s
, "remotename")) {
186 atom
->u
.remote_ref
.option
= RR_REMOTE_NAME
;
187 atom
->u
.remote_ref
.push_remote
= 1;
188 } else if (!strcmp(s
, "remoteref")) {
189 atom
->u
.remote_ref
.option
= RR_REMOTE_REF
;
190 atom
->u
.remote_ref
.push_remote
= 1;
192 atom
->u
.remote_ref
.option
= RR_REF
;
193 if (refname_atom_parser_internal(&atom
->u
.remote_ref
.refname
,
194 arg
, atom
->name
, err
)) {
195 string_list_clear(¶ms
, 0);
201 string_list_clear(¶ms
, 0);
205 static int body_atom_parser(const struct ref_format
*format
, struct used_atom
*atom
,
206 const char *arg
, struct strbuf
*err
)
209 return strbuf_addf_ret(err
, -1, _("%%(body) does not take arguments"));
210 atom
->u
.contents
.option
= C_BODY_DEP
;
214 static int subject_atom_parser(const struct ref_format
*format
, struct used_atom
*atom
,
215 const char *arg
, struct strbuf
*err
)
218 return strbuf_addf_ret(err
, -1, _("%%(subject) does not take arguments"));
219 atom
->u
.contents
.option
= C_SUB
;
223 static int trailers_atom_parser(const struct ref_format
*format
, struct used_atom
*atom
,
224 const char *arg
, struct strbuf
*err
)
226 struct string_list params
= STRING_LIST_INIT_DUP
;
230 string_list_split(¶ms
, arg
, ',', -1);
231 for (i
= 0; i
< params
.nr
; i
++) {
232 const char *s
= params
.items
[i
].string
;
233 if (!strcmp(s
, "unfold"))
234 atom
->u
.contents
.trailer_opts
.unfold
= 1;
235 else if (!strcmp(s
, "only"))
236 atom
->u
.contents
.trailer_opts
.only_trailers
= 1;
238 strbuf_addf(err
, _("unknown %%(trailers) argument: %s"), s
);
239 string_list_clear(¶ms
, 0);
244 atom
->u
.contents
.option
= C_TRAILERS
;
245 string_list_clear(¶ms
, 0);
249 static int contents_atom_parser(const struct ref_format
*format
, struct used_atom
*atom
,
250 const char *arg
, struct strbuf
*err
)
253 atom
->u
.contents
.option
= C_BARE
;
254 else if (!strcmp(arg
, "body"))
255 atom
->u
.contents
.option
= C_BODY
;
256 else if (!strcmp(arg
, "signature"))
257 atom
->u
.contents
.option
= C_SIG
;
258 else if (!strcmp(arg
, "subject"))
259 atom
->u
.contents
.option
= C_SUB
;
260 else if (skip_prefix(arg
, "trailers", &arg
)) {
261 skip_prefix(arg
, ":", &arg
);
262 if (trailers_atom_parser(format
, atom
, *arg
? arg
: NULL
, err
))
264 } else if (skip_prefix(arg
, "lines=", &arg
)) {
265 atom
->u
.contents
.option
= C_LINES
;
266 if (strtoul_ui(arg
, 10, &atom
->u
.contents
.nlines
))
267 return strbuf_addf_ret(err
, -1, _("positive value expected contents:lines=%s"), arg
);
269 return strbuf_addf_ret(err
, -1, _("unrecognized %%(contents) argument: %s"), arg
);
273 static int objectname_atom_parser(const struct ref_format
*format
, struct used_atom
*atom
,
274 const char *arg
, struct strbuf
*err
)
277 atom
->u
.objectname
.option
= O_FULL
;
278 else if (!strcmp(arg
, "short"))
279 atom
->u
.objectname
.option
= O_SHORT
;
280 else if (skip_prefix(arg
, "short=", &arg
)) {
281 atom
->u
.objectname
.option
= O_LENGTH
;
282 if (strtoul_ui(arg
, 10, &atom
->u
.objectname
.length
) ||
283 atom
->u
.objectname
.length
== 0)
284 return strbuf_addf_ret(err
, -1, _("positive value expected objectname:short=%s"), arg
);
285 if (atom
->u
.objectname
.length
< MINIMUM_ABBREV
)
286 atom
->u
.objectname
.length
= MINIMUM_ABBREV
;
288 return strbuf_addf_ret(err
, -1, _("unrecognized %%(objectname) argument: %s"), arg
);
292 static int refname_atom_parser(const struct ref_format
*format
, struct used_atom
*atom
,
293 const char *arg
, struct strbuf
*err
)
295 return refname_atom_parser_internal(&atom
->u
.refname
, arg
, atom
->name
, err
);
298 static align_type
parse_align_position(const char *s
)
300 if (!strcmp(s
, "right"))
302 else if (!strcmp(s
, "middle"))
304 else if (!strcmp(s
, "left"))
309 static int align_atom_parser(const struct ref_format
*format
, struct used_atom
*atom
,
310 const char *arg
, struct strbuf
*err
)
312 struct align
*align
= &atom
->u
.align
;
313 struct string_list params
= STRING_LIST_INIT_DUP
;
315 unsigned int width
= ~0U;
318 return strbuf_addf_ret(err
, -1, _("expected format: %%(align:<width>,<position>)"));
320 align
->position
= ALIGN_LEFT
;
322 string_list_split(¶ms
, arg
, ',', -1);
323 for (i
= 0; i
< params
.nr
; i
++) {
324 const char *s
= params
.items
[i
].string
;
327 if (skip_prefix(s
, "position=", &s
)) {
328 position
= parse_align_position(s
);
330 strbuf_addf(err
, _("unrecognized position:%s"), s
);
331 string_list_clear(¶ms
, 0);
334 align
->position
= position
;
335 } else if (skip_prefix(s
, "width=", &s
)) {
336 if (strtoul_ui(s
, 10, &width
)) {
337 strbuf_addf(err
, _("unrecognized width:%s"), s
);
338 string_list_clear(¶ms
, 0);
341 } else if (!strtoul_ui(s
, 10, &width
))
343 else if ((position
= parse_align_position(s
)) >= 0)
344 align
->position
= position
;
346 strbuf_addf(err
, _("unrecognized %%(align) argument: %s"), s
);
347 string_list_clear(¶ms
, 0);
353 string_list_clear(¶ms
, 0);
354 return strbuf_addf_ret(err
, -1, _("positive width expected with the %%(align) atom"));
356 align
->width
= width
;
357 string_list_clear(¶ms
, 0);
361 static int if_atom_parser(const struct ref_format
*format
, struct used_atom
*atom
,
362 const char *arg
, struct strbuf
*err
)
365 atom
->u
.if_then_else
.cmp_status
= COMPARE_NONE
;
367 } else if (skip_prefix(arg
, "equals=", &atom
->u
.if_then_else
.str
)) {
368 atom
->u
.if_then_else
.cmp_status
= COMPARE_EQUAL
;
369 } else if (skip_prefix(arg
, "notequals=", &atom
->u
.if_then_else
.str
)) {
370 atom
->u
.if_then_else
.cmp_status
= COMPARE_UNEQUAL
;
372 return strbuf_addf_ret(err
, -1, _("unrecognized %%(if) argument: %s"), arg
);
376 static int head_atom_parser(const struct ref_format
*format
, struct used_atom
*atom
,
377 const char *arg
, struct strbuf
*unused_err
)
379 atom
->u
.head
= resolve_refdup("HEAD", RESOLVE_REF_READING
, NULL
, NULL
);
386 int (*parser
)(const struct ref_format
*format
, struct used_atom
*atom
,
387 const char *arg
, struct strbuf
*err
);
389 { "refname" , FIELD_STR
, refname_atom_parser
},
391 { "objectsize", FIELD_ULONG
},
392 { "objectname", FIELD_STR
, objectname_atom_parser
},
395 { "numparent", FIELD_ULONG
},
402 { "authordate", FIELD_TIME
},
405 { "committeremail" },
406 { "committerdate", FIELD_TIME
},
410 { "taggerdate", FIELD_TIME
},
412 { "creatordate", FIELD_TIME
},
413 { "subject", FIELD_STR
, subject_atom_parser
},
414 { "body", FIELD_STR
, body_atom_parser
},
415 { "trailers", FIELD_STR
, trailers_atom_parser
},
416 { "contents", FIELD_STR
, contents_atom_parser
},
417 { "upstream", FIELD_STR
, remote_ref_atom_parser
},
418 { "push", FIELD_STR
, remote_ref_atom_parser
},
419 { "symref", FIELD_STR
, refname_atom_parser
},
421 { "HEAD", FIELD_STR
, head_atom_parser
},
422 { "color", FIELD_STR
, color_atom_parser
},
423 { "align", FIELD_STR
, align_atom_parser
},
425 { "if", FIELD_STR
, if_atom_parser
},
430 #define REF_FORMATTING_STATE_INIT { 0, NULL }
432 struct ref_formatting_stack
{
433 struct ref_formatting_stack
*prev
;
434 struct strbuf output
;
435 void (*at_end
)(struct ref_formatting_stack
**stack
);
439 struct ref_formatting_state
{
441 struct ref_formatting_stack
*stack
;
446 int (*handler
)(struct atom_value
*atomv
, struct ref_formatting_state
*state
,
448 uintmax_t value
; /* used for sorting when not FIELD_STR */
449 struct used_atom
*atom
;
453 * Used to parse format string and sort specifiers
455 static int parse_ref_filter_atom(const struct ref_format
*format
,
456 const char *atom
, const char *ep
,
464 if (*sp
== '*' && sp
< ep
)
467 return strbuf_addf_ret(err
, -1, _("malformed field name: %.*s"),
468 (int)(ep
-atom
), atom
);
470 /* Do we have the atom already used elsewhere? */
471 for (i
= 0; i
< used_atom_cnt
; i
++) {
472 int len
= strlen(used_atom
[i
].name
);
473 if (len
== ep
- atom
&& !memcmp(used_atom
[i
].name
, atom
, len
))
478 * If the atom name has a colon, strip it and everything after
479 * it off - it specifies the format for this entry, and
480 * shouldn't be used for checking against the valid_atom
483 arg
= memchr(sp
, ':', ep
- sp
);
484 atom_len
= (arg
? arg
: ep
) - sp
;
486 /* Is the atom a valid one? */
487 for (i
= 0; i
< ARRAY_SIZE(valid_atom
); i
++) {
488 int len
= strlen(valid_atom
[i
].name
);
489 if (len
== atom_len
&& !memcmp(valid_atom
[i
].name
, sp
, len
))
493 if (ARRAY_SIZE(valid_atom
) <= i
)
494 return strbuf_addf_ret(err
, -1, _("unknown field name: %.*s"),
495 (int)(ep
-atom
), atom
);
497 /* Add it in, including the deref prefix */
500 REALLOC_ARRAY(used_atom
, used_atom_cnt
);
501 used_atom
[at
].name
= xmemdupz(atom
, ep
- atom
);
502 used_atom
[at
].type
= valid_atom
[i
].cmp_type
;
504 arg
= used_atom
[at
].name
+ (arg
- atom
) + 1;
507 * Treat empty sub-arguments list as NULL (i.e.,
508 * "%(atom:)" is equivalent to "%(atom)").
513 memset(&used_atom
[at
].u
, 0, sizeof(used_atom
[at
].u
));
514 if (valid_atom
[i
].parser
&& valid_atom
[i
].parser(format
, &used_atom
[at
], arg
, err
))
518 if (!strcmp(valid_atom
[i
].name
, "symref"))
523 static void quote_formatting(struct strbuf
*s
, const char *str
, int quote_style
)
525 switch (quote_style
) {
527 strbuf_addstr(s
, str
);
530 sq_quote_buf(s
, str
);
533 perl_quote_buf(s
, str
);
536 python_quote_buf(s
, str
);
539 tcl_quote_buf(s
, str
);
544 static int append_atom(struct atom_value
*v
, struct ref_formatting_state
*state
,
545 struct strbuf
*unused_err
)
548 * Quote formatting is only done when the stack has a single
549 * element. Otherwise quote formatting is done on the
550 * element's entire output strbuf when the %(end) atom is
553 if (!state
->stack
->prev
)
554 quote_formatting(&state
->stack
->output
, v
->s
, state
->quote_style
);
556 strbuf_addstr(&state
->stack
->output
, v
->s
);
560 static void push_stack_element(struct ref_formatting_stack
**stack
)
562 struct ref_formatting_stack
*s
= xcalloc(1, sizeof(struct ref_formatting_stack
));
564 strbuf_init(&s
->output
, 0);
569 static void pop_stack_element(struct ref_formatting_stack
**stack
)
571 struct ref_formatting_stack
*current
= *stack
;
572 struct ref_formatting_stack
*prev
= current
->prev
;
575 strbuf_addbuf(&prev
->output
, ¤t
->output
);
576 strbuf_release(¤t
->output
);
581 static void end_align_handler(struct ref_formatting_stack
**stack
)
583 struct ref_formatting_stack
*cur
= *stack
;
584 struct align
*align
= (struct align
*)cur
->at_end_data
;
585 struct strbuf s
= STRBUF_INIT
;
587 strbuf_utf8_align(&s
, align
->position
, align
->width
, cur
->output
.buf
);
588 strbuf_swap(&cur
->output
, &s
);
592 static int align_atom_handler(struct atom_value
*atomv
, struct ref_formatting_state
*state
,
593 struct strbuf
*unused_err
)
595 struct ref_formatting_stack
*new_stack
;
597 push_stack_element(&state
->stack
);
598 new_stack
= state
->stack
;
599 new_stack
->at_end
= end_align_handler
;
600 new_stack
->at_end_data
= &atomv
->atom
->u
.align
;
604 static void if_then_else_handler(struct ref_formatting_stack
**stack
)
606 struct ref_formatting_stack
*cur
= *stack
;
607 struct ref_formatting_stack
*prev
= cur
->prev
;
608 struct if_then_else
*if_then_else
= (struct if_then_else
*)cur
->at_end_data
;
610 if (!if_then_else
->then_atom_seen
)
611 die(_("format: %%(if) atom used without a %%(then) atom"));
613 if (if_then_else
->else_atom_seen
) {
615 * There is an %(else) atom: we need to drop one state from the
616 * stack, either the %(else) branch if the condition is satisfied, or
617 * the %(then) branch if it isn't.
619 if (if_then_else
->condition_satisfied
) {
620 strbuf_reset(&cur
->output
);
621 pop_stack_element(&cur
);
623 strbuf_swap(&cur
->output
, &prev
->output
);
624 strbuf_reset(&cur
->output
);
625 pop_stack_element(&cur
);
627 } else if (!if_then_else
->condition_satisfied
) {
629 * No %(else) atom: just drop the %(then) branch if the
630 * condition is not satisfied.
632 strbuf_reset(&cur
->output
);
639 static int if_atom_handler(struct atom_value
*atomv
, struct ref_formatting_state
*state
,
640 struct strbuf
*unused_err
)
642 struct ref_formatting_stack
*new_stack
;
643 struct if_then_else
*if_then_else
= xcalloc(sizeof(struct if_then_else
), 1);
645 if_then_else
->str
= atomv
->atom
->u
.if_then_else
.str
;
646 if_then_else
->cmp_status
= atomv
->atom
->u
.if_then_else
.cmp_status
;
648 push_stack_element(&state
->stack
);
649 new_stack
= state
->stack
;
650 new_stack
->at_end
= if_then_else_handler
;
651 new_stack
->at_end_data
= if_then_else
;
655 static int is_empty(const char *s
)
665 static int then_atom_handler(struct atom_value
*atomv
, struct ref_formatting_state
*state
,
668 struct ref_formatting_stack
*cur
= state
->stack
;
669 struct if_then_else
*if_then_else
= NULL
;
671 if (cur
->at_end
== if_then_else_handler
)
672 if_then_else
= (struct if_then_else
*)cur
->at_end_data
;
674 return strbuf_addf_ret(err
, -1, _("format: %%(then) atom used without an %%(if) atom"));
675 if (if_then_else
->then_atom_seen
)
676 return strbuf_addf_ret(err
, -1, _("format: %%(then) atom used more than once"));
677 if (if_then_else
->else_atom_seen
)
678 return strbuf_addf_ret(err
, -1, _("format: %%(then) atom used after %%(else)"));
679 if_then_else
->then_atom_seen
= 1;
681 * If the 'equals' or 'notequals' attribute is used then
682 * perform the required comparison. If not, only non-empty
683 * strings satisfy the 'if' condition.
685 if (if_then_else
->cmp_status
== COMPARE_EQUAL
) {
686 if (!strcmp(if_then_else
->str
, cur
->output
.buf
))
687 if_then_else
->condition_satisfied
= 1;
688 } else if (if_then_else
->cmp_status
== COMPARE_UNEQUAL
) {
689 if (strcmp(if_then_else
->str
, cur
->output
.buf
))
690 if_then_else
->condition_satisfied
= 1;
691 } else if (cur
->output
.len
&& !is_empty(cur
->output
.buf
))
692 if_then_else
->condition_satisfied
= 1;
693 strbuf_reset(&cur
->output
);
697 static int else_atom_handler(struct atom_value
*atomv
, struct ref_formatting_state
*state
,
700 struct ref_formatting_stack
*prev
= state
->stack
;
701 struct if_then_else
*if_then_else
= NULL
;
703 if (prev
->at_end
== if_then_else_handler
)
704 if_then_else
= (struct if_then_else
*)prev
->at_end_data
;
706 return strbuf_addf_ret(err
, -1, _("format: %%(else) atom used without an %%(if) atom"));
707 if (!if_then_else
->then_atom_seen
)
708 return strbuf_addf_ret(err
, -1, _("format: %%(else) atom used without a %%(then) atom"));
709 if (if_then_else
->else_atom_seen
)
710 return strbuf_addf_ret(err
, -1, _("format: %%(else) atom used more than once"));
711 if_then_else
->else_atom_seen
= 1;
712 push_stack_element(&state
->stack
);
713 state
->stack
->at_end_data
= prev
->at_end_data
;
714 state
->stack
->at_end
= prev
->at_end
;
718 static int end_atom_handler(struct atom_value
*atomv
, struct ref_formatting_state
*state
,
721 struct ref_formatting_stack
*current
= state
->stack
;
722 struct strbuf s
= STRBUF_INIT
;
724 if (!current
->at_end
)
725 return strbuf_addf_ret(err
, -1, _("format: %%(end) atom used without corresponding atom"));
726 current
->at_end(&state
->stack
);
728 /* Stack may have been popped within at_end(), hence reset the current pointer */
729 current
= state
->stack
;
732 * Perform quote formatting when the stack element is that of
733 * a supporting atom. If nested then perform quote formatting
734 * only on the topmost supporting atom.
736 if (!current
->prev
->prev
) {
737 quote_formatting(&s
, current
->output
.buf
, state
->quote_style
);
738 strbuf_swap(¤t
->output
, &s
);
741 pop_stack_element(&state
->stack
);
746 * In a format string, find the next occurrence of %(atom).
748 static const char *find_next(const char *cp
)
753 * %( is the start of an atom;
754 * %% is a quoted per-cent.
758 else if (cp
[1] == '%')
759 cp
++; /* skip over two % */
760 /* otherwise this is a singleton, literal % */
768 * Make sure the format string is well formed, and parse out
771 int verify_ref_format(struct ref_format
*format
)
775 format
->need_color_reset_at_eol
= 0;
776 for (cp
= format
->format
; *cp
&& (sp
= find_next(cp
)); ) {
777 struct strbuf err
= STRBUF_INIT
;
778 const char *color
, *ep
= strchr(sp
, ')');
782 return error(_("malformed format string %s"), sp
);
783 /* sp points at "%(" and ep points at the closing ")" */
784 at
= parse_ref_filter_atom(format
, sp
+ 2, ep
, &err
);
789 if (skip_prefix(used_atom
[at
].name
, "color:", &color
))
790 format
->need_color_reset_at_eol
= !!strcmp(color
, "reset");
791 strbuf_release(&err
);
793 if (format
->need_color_reset_at_eol
&& !want_color(format
->use_color
))
794 format
->need_color_reset_at_eol
= 0;
799 * Given an object name, read the object data and size, and return a
800 * "struct object". If the object data we are returning is also borrowed
801 * by the "struct object" representation, set *eaten as well---it is a
802 * signal from parse_object_buffer to us not to free the buffer.
804 static void *get_obj(const struct object_id
*oid
, struct object
**obj
, unsigned long *sz
, int *eaten
)
806 enum object_type type
;
807 void *buf
= read_object_file(oid
, &type
, sz
);
810 *obj
= parse_object_buffer(oid
, type
, *sz
, buf
, eaten
);
816 static int grab_objectname(const char *name
, const struct object_id
*oid
,
817 struct atom_value
*v
, struct used_atom
*atom
)
819 if (starts_with(name
, "objectname")) {
820 if (atom
->u
.objectname
.option
== O_SHORT
) {
821 v
->s
= xstrdup(find_unique_abbrev(oid
, DEFAULT_ABBREV
));
823 } else if (atom
->u
.objectname
.option
== O_FULL
) {
824 v
->s
= xstrdup(oid_to_hex(oid
));
826 } else if (atom
->u
.objectname
.option
== O_LENGTH
) {
827 v
->s
= xstrdup(find_unique_abbrev(oid
, atom
->u
.objectname
.length
));
830 BUG("unknown %%(objectname) option");
835 /* See grab_values */
836 static void grab_common_values(struct atom_value
*val
, int deref
, struct object
*obj
, void *buf
, unsigned long sz
)
840 for (i
= 0; i
< used_atom_cnt
; i
++) {
841 const char *name
= used_atom
[i
].name
;
842 struct atom_value
*v
= &val
[i
];
843 if (!!deref
!= (*name
== '*'))
847 if (!strcmp(name
, "objecttype"))
848 v
->s
= type_name(obj
->type
);
849 else if (!strcmp(name
, "objectsize")) {
851 v
->s
= xstrfmt("%lu", sz
);
854 grab_objectname(name
, &obj
->oid
, v
, &used_atom
[i
]);
858 /* See grab_values */
859 static void grab_tag_values(struct atom_value
*val
, int deref
, struct object
*obj
, void *buf
, unsigned long sz
)
862 struct tag
*tag
= (struct tag
*) obj
;
864 for (i
= 0; i
< used_atom_cnt
; i
++) {
865 const char *name
= used_atom
[i
].name
;
866 struct atom_value
*v
= &val
[i
];
867 if (!!deref
!= (*name
== '*'))
871 if (!strcmp(name
, "tag"))
873 else if (!strcmp(name
, "type") && tag
->tagged
)
874 v
->s
= type_name(tag
->tagged
->type
);
875 else if (!strcmp(name
, "object") && tag
->tagged
)
876 v
->s
= xstrdup(oid_to_hex(&tag
->tagged
->oid
));
880 /* See grab_values */
881 static void grab_commit_values(struct atom_value
*val
, int deref
, struct object
*obj
, void *buf
, unsigned long sz
)
884 struct commit
*commit
= (struct commit
*) obj
;
886 for (i
= 0; i
< used_atom_cnt
; i
++) {
887 const char *name
= used_atom
[i
].name
;
888 struct atom_value
*v
= &val
[i
];
889 if (!!deref
!= (*name
== '*'))
893 if (!strcmp(name
, "tree")) {
894 v
->s
= xstrdup(oid_to_hex(get_commit_tree_oid(commit
)));
896 else if (!strcmp(name
, "numparent")) {
897 v
->value
= commit_list_count(commit
->parents
);
898 v
->s
= xstrfmt("%lu", (unsigned long)v
->value
);
900 else if (!strcmp(name
, "parent")) {
901 struct commit_list
*parents
;
902 struct strbuf s
= STRBUF_INIT
;
903 for (parents
= commit
->parents
; parents
; parents
= parents
->next
) {
904 struct commit
*parent
= parents
->item
;
905 if (parents
!= commit
->parents
)
906 strbuf_addch(&s
, ' ');
907 strbuf_addstr(&s
, oid_to_hex(&parent
->object
.oid
));
909 v
->s
= strbuf_detach(&s
, NULL
);
914 static const char *find_wholine(const char *who
, int wholen
, const char *buf
, unsigned long sz
)
918 if (!strncmp(buf
, who
, wholen
) &&
920 return buf
+ wholen
+ 1;
921 eol
= strchr(buf
, '\n');
926 return ""; /* end of header */
932 static const char *copy_line(const char *buf
)
934 const char *eol
= strchrnul(buf
, '\n');
935 return xmemdupz(buf
, eol
- buf
);
938 static const char *copy_name(const char *buf
)
941 for (cp
= buf
; *cp
&& *cp
!= '\n'; cp
++) {
942 if (!strncmp(cp
, " <", 2))
943 return xmemdupz(buf
, cp
- buf
);
948 static const char *copy_email(const char *buf
)
950 const char *email
= strchr(buf
, '<');
954 eoemail
= strchr(email
, '>');
957 return xmemdupz(email
, eoemail
+ 1 - email
);
960 static char *copy_subject(const char *buf
, unsigned long len
)
962 char *r
= xmemdupz(buf
, len
);
965 for (i
= 0; i
< len
; i
++)
972 static void grab_date(const char *buf
, struct atom_value
*v
, const char *atomname
)
974 const char *eoemail
= strstr(buf
, "> ");
976 timestamp_t timestamp
;
978 struct date_mode date_mode
= { DATE_NORMAL
};
982 * We got here because atomname ends in "date" or "date<something>";
983 * it's not possible that <something> is not ":<format>" because
984 * parse_ref_filter_atom() wouldn't have allowed it, so we can assume that no
985 * ":" means no format is specified, and use the default.
987 formatp
= strchr(atomname
, ':');
988 if (formatp
!= NULL
) {
990 parse_date_format(formatp
, &date_mode
);
995 timestamp
= parse_timestamp(eoemail
+ 2, &zone
, 10);
996 if (timestamp
== TIME_MAX
)
998 tz
= strtol(zone
, NULL
, 10);
999 if ((tz
== LONG_MIN
|| tz
== LONG_MAX
) && errno
== ERANGE
)
1001 v
->s
= xstrdup(show_date(timestamp
, tz
, &date_mode
));
1002 v
->value
= timestamp
;
1009 /* See grab_values */
1010 static void grab_person(const char *who
, struct atom_value
*val
, int deref
, struct object
*obj
, void *buf
, unsigned long sz
)
1013 int wholen
= strlen(who
);
1014 const char *wholine
= NULL
;
1016 for (i
= 0; i
< used_atom_cnt
; i
++) {
1017 const char *name
= used_atom
[i
].name
;
1018 struct atom_value
*v
= &val
[i
];
1019 if (!!deref
!= (*name
== '*'))
1023 if (strncmp(who
, name
, wholen
))
1025 if (name
[wholen
] != 0 &&
1026 strcmp(name
+ wholen
, "name") &&
1027 strcmp(name
+ wholen
, "email") &&
1028 !starts_with(name
+ wholen
, "date"))
1031 wholine
= find_wholine(who
, wholen
, buf
, sz
);
1033 return; /* no point looking for it */
1034 if (name
[wholen
] == 0)
1035 v
->s
= copy_line(wholine
);
1036 else if (!strcmp(name
+ wholen
, "name"))
1037 v
->s
= copy_name(wholine
);
1038 else if (!strcmp(name
+ wholen
, "email"))
1039 v
->s
= copy_email(wholine
);
1040 else if (starts_with(name
+ wholen
, "date"))
1041 grab_date(wholine
, v
, name
);
1045 * For a tag or a commit object, if "creator" or "creatordate" is
1046 * requested, do something special.
1048 if (strcmp(who
, "tagger") && strcmp(who
, "committer"))
1049 return; /* "author" for commit object is not wanted */
1051 wholine
= find_wholine(who
, wholen
, buf
, sz
);
1054 for (i
= 0; i
< used_atom_cnt
; i
++) {
1055 const char *name
= used_atom
[i
].name
;
1056 struct atom_value
*v
= &val
[i
];
1057 if (!!deref
!= (*name
== '*'))
1062 if (starts_with(name
, "creatordate"))
1063 grab_date(wholine
, v
, name
);
1064 else if (!strcmp(name
, "creator"))
1065 v
->s
= copy_line(wholine
);
1069 static void find_subpos(const char *buf
, unsigned long sz
,
1070 const char **sub
, unsigned long *sublen
,
1071 const char **body
, unsigned long *bodylen
,
1072 unsigned long *nonsiglen
,
1073 const char **sig
, unsigned long *siglen
)
1076 /* skip past header until we hit empty line */
1077 while (*buf
&& *buf
!= '\n') {
1078 eol
= strchrnul(buf
, '\n');
1083 /* skip any empty lines */
1084 while (*buf
== '\n')
1087 /* parse signature first; we might not even have a subject line */
1088 *sig
= buf
+ parse_signature(buf
, strlen(buf
));
1089 *siglen
= strlen(*sig
);
1091 /* subject is first non-empty line */
1093 /* subject goes to first empty line */
1094 while (buf
< *sig
&& *buf
&& *buf
!= '\n') {
1095 eol
= strchrnul(buf
, '\n');
1100 *sublen
= buf
- *sub
;
1101 /* drop trailing newline, if present */
1102 if (*sublen
&& (*sub
)[*sublen
- 1] == '\n')
1105 /* skip any empty lines */
1106 while (*buf
== '\n')
1109 *bodylen
= strlen(buf
);
1110 *nonsiglen
= *sig
- buf
;
1114 * If 'lines' is greater than 0, append that many lines from the given
1115 * 'buf' of length 'size' to the given strbuf.
1117 static void append_lines(struct strbuf
*out
, const char *buf
, unsigned long size
, int lines
)
1120 const char *sp
, *eol
;
1125 for (i
= 0; i
< lines
&& sp
< buf
+ size
; i
++) {
1127 strbuf_addstr(out
, "\n ");
1128 eol
= memchr(sp
, '\n', size
- (sp
- buf
));
1129 len
= eol
? eol
- sp
: size
- (sp
- buf
);
1130 strbuf_add(out
, sp
, len
);
1137 /* See grab_values */
1138 static void grab_sub_body_contents(struct atom_value
*val
, int deref
, struct object
*obj
, void *buf
, unsigned long sz
)
1141 const char *subpos
= NULL
, *bodypos
= NULL
, *sigpos
= NULL
;
1142 unsigned long sublen
= 0, bodylen
= 0, nonsiglen
= 0, siglen
= 0;
1144 for (i
= 0; i
< used_atom_cnt
; i
++) {
1145 struct used_atom
*atom
= &used_atom
[i
];
1146 const char *name
= atom
->name
;
1147 struct atom_value
*v
= &val
[i
];
1148 if (!!deref
!= (*name
== '*'))
1152 if (strcmp(name
, "subject") &&
1153 strcmp(name
, "body") &&
1154 !starts_with(name
, "trailers") &&
1155 !starts_with(name
, "contents"))
1158 find_subpos(buf
, sz
,
1160 &bodypos
, &bodylen
, &nonsiglen
,
1163 if (atom
->u
.contents
.option
== C_SUB
)
1164 v
->s
= copy_subject(subpos
, sublen
);
1165 else if (atom
->u
.contents
.option
== C_BODY_DEP
)
1166 v
->s
= xmemdupz(bodypos
, bodylen
);
1167 else if (atom
->u
.contents
.option
== C_BODY
)
1168 v
->s
= xmemdupz(bodypos
, nonsiglen
);
1169 else if (atom
->u
.contents
.option
== C_SIG
)
1170 v
->s
= xmemdupz(sigpos
, siglen
);
1171 else if (atom
->u
.contents
.option
== C_LINES
) {
1172 struct strbuf s
= STRBUF_INIT
;
1173 const char *contents_end
= bodylen
+ bodypos
- siglen
;
1175 /* Size is the length of the message after removing the signature */
1176 append_lines(&s
, subpos
, contents_end
- subpos
, atom
->u
.contents
.nlines
);
1177 v
->s
= strbuf_detach(&s
, NULL
);
1178 } else if (atom
->u
.contents
.option
== C_TRAILERS
) {
1179 struct strbuf s
= STRBUF_INIT
;
1181 /* Format the trailer info according to the trailer_opts given */
1182 format_trailers_from_commit(&s
, subpos
, &atom
->u
.contents
.trailer_opts
);
1184 v
->s
= strbuf_detach(&s
, NULL
);
1185 } else if (atom
->u
.contents
.option
== C_BARE
)
1186 v
->s
= xstrdup(subpos
);
1191 * We want to have empty print-string for field requests
1192 * that do not apply (e.g. "authordate" for a tag object)
1194 static void fill_missing_values(struct atom_value
*val
)
1197 for (i
= 0; i
< used_atom_cnt
; i
++) {
1198 struct atom_value
*v
= &val
[i
];
1205 * val is a list of atom_value to hold returned values. Extract
1206 * the values for atoms in used_atom array out of (obj, buf, sz).
1207 * when deref is false, (obj, buf, sz) is the object that is
1208 * pointed at by the ref itself; otherwise it is the object the
1209 * ref (which is a tag) refers to.
1211 static void grab_values(struct atom_value
*val
, int deref
, struct object
*obj
, void *buf
, unsigned long sz
)
1213 grab_common_values(val
, deref
, obj
, buf
, sz
);
1214 switch (obj
->type
) {
1216 grab_tag_values(val
, deref
, obj
, buf
, sz
);
1217 grab_sub_body_contents(val
, deref
, obj
, buf
, sz
);
1218 grab_person("tagger", val
, deref
, obj
, buf
, sz
);
1221 grab_commit_values(val
, deref
, obj
, buf
, sz
);
1222 grab_sub_body_contents(val
, deref
, obj
, buf
, sz
);
1223 grab_person("author", val
, deref
, obj
, buf
, sz
);
1224 grab_person("committer", val
, deref
, obj
, buf
, sz
);
1227 /* grab_tree_values(val, deref, obj, buf, sz); */
1230 /* grab_blob_values(val, deref, obj, buf, sz); */
1233 die("Eh? Object of type %d?", obj
->type
);
1237 static inline char *copy_advance(char *dst
, const char *src
)
1244 static const char *lstrip_ref_components(const char *refname
, int len
)
1246 long remaining
= len
;
1247 const char *start
= refname
;
1251 const char *p
= refname
;
1253 /* Find total no of '/' separated path-components */
1254 for (i
= 0; p
[i
]; p
[i
] == '/' ? i
++ : *p
++)
1257 * The number of components we need to strip is now
1258 * the total minus the components to be left (Plus one
1259 * because we count the number of '/', but the number
1260 * of components is one more than the no of '/').
1262 remaining
= i
+ len
+ 1;
1265 while (remaining
> 0) {
1278 static const char *rstrip_ref_components(const char *refname
, int len
)
1280 long remaining
= len
;
1281 char *start
= xstrdup(refname
);
1285 const char *p
= refname
;
1287 /* Find total no of '/' separated path-components */
1288 for (i
= 0; p
[i
]; p
[i
] == '/' ? i
++ : *p
++)
1291 * The number of components we need to strip is now
1292 * the total minus the components to be left (Plus one
1293 * because we count the number of '/', but the number
1294 * of components is one more than the no of '/').
1296 remaining
= i
+ len
+ 1;
1299 while (remaining
-- > 0) {
1300 char *p
= strrchr(start
, '/');
1309 static const char *show_ref(struct refname_atom
*atom
, const char *refname
)
1311 if (atom
->option
== R_SHORT
)
1312 return shorten_unambiguous_ref(refname
, warn_ambiguous_refs
);
1313 else if (atom
->option
== R_LSTRIP
)
1314 return lstrip_ref_components(refname
, atom
->lstrip
);
1315 else if (atom
->option
== R_RSTRIP
)
1316 return rstrip_ref_components(refname
, atom
->rstrip
);
1321 static void fill_remote_ref_details(struct used_atom
*atom
, const char *refname
,
1322 struct branch
*branch
, const char **s
)
1324 int num_ours
, num_theirs
;
1325 if (atom
->u
.remote_ref
.option
== RR_REF
)
1326 *s
= show_ref(&atom
->u
.remote_ref
.refname
, refname
);
1327 else if (atom
->u
.remote_ref
.option
== RR_TRACK
) {
1328 if (stat_tracking_info(branch
, &num_ours
, &num_theirs
,
1329 NULL
, AHEAD_BEHIND_FULL
) < 0) {
1330 *s
= xstrdup(msgs
.gone
);
1331 } else if (!num_ours
&& !num_theirs
)
1334 *s
= xstrfmt(msgs
.behind
, num_theirs
);
1335 else if (!num_theirs
)
1336 *s
= xstrfmt(msgs
.ahead
, num_ours
);
1338 *s
= xstrfmt(msgs
.ahead_behind
,
1339 num_ours
, num_theirs
);
1340 if (!atom
->u
.remote_ref
.nobracket
&& *s
[0]) {
1341 const char *to_free
= *s
;
1342 *s
= xstrfmt("[%s]", *s
);
1343 free((void *)to_free
);
1345 } else if (atom
->u
.remote_ref
.option
== RR_TRACKSHORT
) {
1346 if (stat_tracking_info(branch
, &num_ours
, &num_theirs
,
1347 NULL
, AHEAD_BEHIND_FULL
) < 0)
1350 if (!num_ours
&& !num_theirs
)
1354 else if (!num_theirs
)
1358 } else if (atom
->u
.remote_ref
.option
== RR_REMOTE_NAME
) {
1360 const char *remote
= atom
->u
.remote_ref
.push
?
1361 pushremote_for_branch(branch
, &explicit) :
1362 remote_for_branch(branch
, &explicit);
1364 *s
= xstrdup(remote
);
1367 } else if (atom
->u
.remote_ref
.option
== RR_REMOTE_REF
) {
1371 merge
= remote_ref_for_branch(branch
, atom
->u
.remote_ref
.push
,
1374 *s
= xstrdup(merge
);
1378 BUG("unhandled RR_* enum");
1381 char *get_head_description(void)
1383 struct strbuf desc
= STRBUF_INIT
;
1384 struct wt_status_state state
;
1385 memset(&state
, 0, sizeof(state
));
1386 wt_status_get_state(&state
, 1);
1387 if (state
.rebase_in_progress
||
1388 state
.rebase_interactive_in_progress
) {
1390 strbuf_addf(&desc
, _("(no branch, rebasing %s)"),
1393 strbuf_addf(&desc
, _("(no branch, rebasing detached HEAD %s)"),
1394 state
.detached_from
);
1395 } else if (state
.bisect_in_progress
)
1396 strbuf_addf(&desc
, _("(no branch, bisect started on %s)"),
1398 else if (state
.detached_from
) {
1399 if (state
.detached_at
)
1401 * TRANSLATORS: make sure this matches "HEAD
1402 * detached at " in wt-status.c
1404 strbuf_addf(&desc
, _("(HEAD detached at %s)"),
1405 state
.detached_from
);
1408 * TRANSLATORS: make sure this matches "HEAD
1409 * detached from " in wt-status.c
1411 strbuf_addf(&desc
, _("(HEAD detached from %s)"),
1412 state
.detached_from
);
1415 strbuf_addstr(&desc
, _("(no branch)"));
1418 free(state
.detached_from
);
1419 return strbuf_detach(&desc
, NULL
);
1422 static const char *get_symref(struct used_atom
*atom
, struct ref_array_item
*ref
)
1427 return show_ref(&atom
->u
.refname
, ref
->symref
);
1430 static const char *get_refname(struct used_atom
*atom
, struct ref_array_item
*ref
)
1432 if (ref
->kind
& FILTER_REFS_DETACHED_HEAD
)
1433 return get_head_description();
1434 return show_ref(&atom
->u
.refname
, ref
->refname
);
1437 static int get_object(struct ref_array_item
*ref
, const struct object_id
*oid
,
1438 int deref
, struct object
**obj
, struct strbuf
*err
)
1443 void *buf
= get_obj(oid
, obj
, &size
, &eaten
);
1445 ret
= strbuf_addf_ret(err
, -1, _("missing object %s for %s"),
1446 oid_to_hex(oid
), ref
->refname
);
1448 ret
= strbuf_addf_ret(err
, -1, _("parse_object_buffer failed on %s for %s"),
1449 oid_to_hex(oid
), ref
->refname
);
1451 grab_values(ref
->value
, deref
, *obj
, buf
, size
);
1458 * Parse the object referred by ref, and grab needed value.
1460 static int populate_value(struct ref_array_item
*ref
, struct strbuf
*err
)
1464 const struct object_id
*tagged
;
1466 ref
->value
= xcalloc(used_atom_cnt
, sizeof(struct atom_value
));
1468 if (need_symref
&& (ref
->flag
& REF_ISSYMREF
) && !ref
->symref
) {
1469 ref
->symref
= resolve_refdup(ref
->refname
, RESOLVE_REF_READING
,
1475 /* Fill in specials first */
1476 for (i
= 0; i
< used_atom_cnt
; i
++) {
1477 struct used_atom
*atom
= &used_atom
[i
];
1478 const char *name
= used_atom
[i
].name
;
1479 struct atom_value
*v
= &ref
->value
[i
];
1481 const char *refname
;
1482 struct branch
*branch
= NULL
;
1484 v
->handler
= append_atom
;
1492 if (starts_with(name
, "refname"))
1493 refname
= get_refname(atom
, ref
);
1494 else if (starts_with(name
, "symref"))
1495 refname
= get_symref(atom
, ref
);
1496 else if (starts_with(name
, "upstream")) {
1497 const char *branch_name
;
1498 /* only local branches may have an upstream */
1499 if (!skip_prefix(ref
->refname
, "refs/heads/",
1502 branch
= branch_get(branch_name
);
1504 refname
= branch_get_upstream(branch
, NULL
);
1506 fill_remote_ref_details(atom
, refname
, branch
, &v
->s
);
1508 } else if (atom
->u
.remote_ref
.push
) {
1509 const char *branch_name
;
1510 if (!skip_prefix(ref
->refname
, "refs/heads/",
1513 branch
= branch_get(branch_name
);
1515 if (atom
->u
.remote_ref
.push_remote
)
1518 refname
= branch_get_push(branch
, NULL
);
1522 fill_remote_ref_details(atom
, refname
, branch
, &v
->s
);
1524 } else if (starts_with(name
, "color:")) {
1525 v
->s
= atom
->u
.color
;
1527 } else if (!strcmp(name
, "flag")) {
1528 char buf
[256], *cp
= buf
;
1529 if (ref
->flag
& REF_ISSYMREF
)
1530 cp
= copy_advance(cp
, ",symref");
1531 if (ref
->flag
& REF_ISPACKED
)
1532 cp
= copy_advance(cp
, ",packed");
1537 v
->s
= xstrdup(buf
+ 1);
1540 } else if (!deref
&& grab_objectname(name
, &ref
->objectname
, v
, atom
)) {
1542 } else if (!strcmp(name
, "HEAD")) {
1543 if (atom
->u
.head
&& !strcmp(ref
->refname
, atom
->u
.head
))
1548 } else if (starts_with(name
, "align")) {
1549 v
->handler
= align_atom_handler
;
1551 } else if (!strcmp(name
, "end")) {
1552 v
->handler
= end_atom_handler
;
1554 } else if (starts_with(name
, "if")) {
1557 if (skip_prefix(name
, "if:", &s
))
1559 v
->handler
= if_atom_handler
;
1561 } else if (!strcmp(name
, "then")) {
1562 v
->handler
= then_atom_handler
;
1564 } else if (!strcmp(name
, "else")) {
1565 v
->handler
= else_atom_handler
;
1573 v
->s
= xstrfmt("%s^{}", refname
);
1576 for (i
= 0; i
< used_atom_cnt
; i
++) {
1577 struct atom_value
*v
= &ref
->value
[i
];
1581 if (used_atom_cnt
<= i
)
1584 if (get_object(ref
, &ref
->objectname
, 0, &obj
, err
))
1588 * If there is no atom that wants to know about tagged
1589 * object, we are done.
1591 if (!need_tagged
|| (obj
->type
!= OBJ_TAG
))
1595 * If it is a tag object, see if we use a value that derefs
1596 * the object, and if we do grab the object it refers to.
1598 tagged
= &((struct tag
*)obj
)->tagged
->oid
;
1601 * NEEDSWORK: This derefs tag only once, which
1602 * is good to deal with chains of trust, but
1603 * is not consistent with what deref_tag() does
1604 * which peels the onion to the core.
1606 return get_object(ref
, tagged
, 1, &obj
, err
);
1610 * Given a ref, return the value for the atom. This lazily gets value
1611 * out of the object by calling populate value.
1613 static int get_ref_atom_value(struct ref_array_item
*ref
, int atom
,
1614 struct atom_value
**v
, struct strbuf
*err
)
1617 if (populate_value(ref
, err
))
1619 fill_missing_values(ref
->value
);
1621 *v
= &ref
->value
[atom
];
1626 * Unknown has to be "0" here, because that's the default value for
1627 * contains_cache slab entries that have not yet been assigned.
1629 enum contains_result
{
1630 CONTAINS_UNKNOWN
= 0,
1635 define_commit_slab(contains_cache
, enum contains_result
);
1637 struct ref_filter_cbdata
{
1638 struct ref_array
*array
;
1639 struct ref_filter
*filter
;
1640 struct contains_cache contains_cache
;
1641 struct contains_cache no_contains_cache
;
1645 * Mimicking the real stack, this stack lives on the heap, avoiding stack
1648 * At each recursion step, the stack items points to the commits whose
1649 * ancestors are to be inspected.
1651 struct contains_stack
{
1653 struct contains_stack_entry
{
1654 struct commit
*commit
;
1655 struct commit_list
*parents
;
1659 static int in_commit_list(const struct commit_list
*want
, struct commit
*c
)
1661 for (; want
; want
= want
->next
)
1662 if (!oidcmp(&want
->item
->object
.oid
, &c
->object
.oid
))
1668 * Test whether the candidate is contained in the list.
1669 * Do not recurse to find out, though, but return -1 if inconclusive.
1671 static enum contains_result
contains_test(struct commit
*candidate
,
1672 const struct commit_list
*want
,
1673 struct contains_cache
*cache
,
1676 enum contains_result
*cached
= contains_cache_at(cache
, candidate
);
1678 /* If we already have the answer cached, return that. */
1683 if (in_commit_list(want
, candidate
)) {
1684 *cached
= CONTAINS_YES
;
1685 return CONTAINS_YES
;
1688 /* Otherwise, we don't know; prepare to recurse */
1689 parse_commit_or_die(candidate
);
1691 if (candidate
->generation
< cutoff
)
1694 return CONTAINS_UNKNOWN
;
1697 static void push_to_contains_stack(struct commit
*candidate
, struct contains_stack
*contains_stack
)
1699 ALLOC_GROW(contains_stack
->contains_stack
, contains_stack
->nr
+ 1, contains_stack
->alloc
);
1700 contains_stack
->contains_stack
[contains_stack
->nr
].commit
= candidate
;
1701 contains_stack
->contains_stack
[contains_stack
->nr
++].parents
= candidate
->parents
;
1704 static enum contains_result
contains_tag_algo(struct commit
*candidate
,
1705 const struct commit_list
*want
,
1706 struct contains_cache
*cache
)
1708 struct contains_stack contains_stack
= { 0, 0, NULL
};
1709 enum contains_result result
;
1710 uint32_t cutoff
= GENERATION_NUMBER_INFINITY
;
1711 const struct commit_list
*p
;
1713 for (p
= want
; p
; p
= p
->next
) {
1714 struct commit
*c
= p
->item
;
1715 load_commit_graph_info(c
);
1716 if (c
->generation
< cutoff
)
1717 cutoff
= c
->generation
;
1720 result
= contains_test(candidate
, want
, cache
, cutoff
);
1721 if (result
!= CONTAINS_UNKNOWN
)
1724 push_to_contains_stack(candidate
, &contains_stack
);
1725 while (contains_stack
.nr
) {
1726 struct contains_stack_entry
*entry
= &contains_stack
.contains_stack
[contains_stack
.nr
- 1];
1727 struct commit
*commit
= entry
->commit
;
1728 struct commit_list
*parents
= entry
->parents
;
1731 *contains_cache_at(cache
, commit
) = CONTAINS_NO
;
1732 contains_stack
.nr
--;
1735 * If we just popped the stack, parents->item has been marked,
1736 * therefore contains_test will return a meaningful yes/no.
1738 else switch (contains_test(parents
->item
, want
, cache
, cutoff
)) {
1740 *contains_cache_at(cache
, commit
) = CONTAINS_YES
;
1741 contains_stack
.nr
--;
1744 entry
->parents
= parents
->next
;
1746 case CONTAINS_UNKNOWN
:
1747 push_to_contains_stack(parents
->item
, &contains_stack
);
1751 free(contains_stack
.contains_stack
);
1752 return contains_test(candidate
, want
, cache
, cutoff
);
1755 static int commit_contains(struct ref_filter
*filter
, struct commit
*commit
,
1756 struct commit_list
*list
, struct contains_cache
*cache
)
1758 if (filter
->with_commit_tag_algo
)
1759 return contains_tag_algo(commit
, list
, cache
) == CONTAINS_YES
;
1760 return is_descendant_of(commit
, list
);
1764 * Return 1 if the refname matches one of the patterns, otherwise 0.
1765 * A pattern can be a literal prefix (e.g. a refname "refs/heads/master"
1766 * matches a pattern "refs/heads/mas") or a wildcard (e.g. the same ref
1767 * matches "refs/heads/mas*", too).
1769 static int match_pattern(const struct ref_filter
*filter
, const char *refname
)
1771 const char **patterns
= filter
->name_patterns
;
1774 if (filter
->ignore_case
)
1775 flags
|= WM_CASEFOLD
;
1778 * When no '--format' option is given we need to skip the prefix
1779 * for matching refs of tags and branches.
1781 (void)(skip_prefix(refname
, "refs/tags/", &refname
) ||
1782 skip_prefix(refname
, "refs/heads/", &refname
) ||
1783 skip_prefix(refname
, "refs/remotes/", &refname
) ||
1784 skip_prefix(refname
, "refs/", &refname
));
1786 for (; *patterns
; patterns
++) {
1787 if (!wildmatch(*patterns
, refname
, flags
))
1794 * Return 1 if the refname matches one of the patterns, otherwise 0.
1795 * A pattern can be path prefix (e.g. a refname "refs/heads/master"
1796 * matches a pattern "refs/heads/" but not "refs/heads/m") or a
1797 * wildcard (e.g. the same ref matches "refs/heads/m*", too).
1799 static int match_name_as_path(const struct ref_filter
*filter
, const char *refname
)
1801 const char **pattern
= filter
->name_patterns
;
1802 int namelen
= strlen(refname
);
1803 unsigned flags
= WM_PATHNAME
;
1805 if (filter
->ignore_case
)
1806 flags
|= WM_CASEFOLD
;
1808 for (; *pattern
; pattern
++) {
1809 const char *p
= *pattern
;
1810 int plen
= strlen(p
);
1812 if ((plen
<= namelen
) &&
1813 !strncmp(refname
, p
, plen
) &&
1814 (refname
[plen
] == '\0' ||
1815 refname
[plen
] == '/' ||
1818 if (!wildmatch(p
, refname
, WM_PATHNAME
))
1824 /* Return 1 if the refname matches one of the patterns, otherwise 0. */
1825 static int filter_pattern_match(struct ref_filter
*filter
, const char *refname
)
1827 if (!*filter
->name_patterns
)
1828 return 1; /* No pattern always matches */
1829 if (filter
->match_as_path
)
1830 return match_name_as_path(filter
, refname
);
1831 return match_pattern(filter
, refname
);
1835 * Find the longest prefix of pattern we can pass to
1836 * `for_each_fullref_in()`, namely the part of pattern preceding the
1837 * first glob character. (Note that `for_each_fullref_in()` is
1838 * perfectly happy working with a prefix that doesn't end at a
1839 * pathname component boundary.)
1841 static void find_longest_prefix(struct strbuf
*out
, const char *pattern
)
1845 for (p
= pattern
; *p
&& !is_glob_special(*p
); p
++)
1848 strbuf_add(out
, pattern
, p
- pattern
);
1852 * This is the same as for_each_fullref_in(), but it tries to iterate
1853 * only over the patterns we'll care about. Note that it _doesn't_ do a full
1854 * pattern match, so the callback still has to match each ref individually.
1856 static int for_each_fullref_in_pattern(struct ref_filter
*filter
,
1861 struct strbuf prefix
= STRBUF_INIT
;
1864 if (!filter
->match_as_path
) {
1866 * in this case, the patterns are applied after
1867 * prefixes like "refs/heads/" etc. are stripped off,
1868 * so we have to look at everything:
1870 return for_each_fullref_in("", cb
, cb_data
, broken
);
1873 if (!filter
->name_patterns
[0]) {
1874 /* no patterns; we have to look at everything */
1875 return for_each_fullref_in("", cb
, cb_data
, broken
);
1878 if (filter
->name_patterns
[1]) {
1880 * multiple patterns; in theory this could still work as long
1881 * as the patterns are disjoint. We'd just make multiple calls
1882 * to for_each_ref(). But if they're not disjoint, we'd end up
1883 * reporting the same ref multiple times. So let's punt on that
1886 return for_each_fullref_in("", cb
, cb_data
, broken
);
1889 find_longest_prefix(&prefix
, filter
->name_patterns
[0]);
1891 ret
= for_each_fullref_in(prefix
.buf
, cb
, cb_data
, broken
);
1892 strbuf_release(&prefix
);
1897 * Given a ref (sha1, refname), check if the ref belongs to the array
1898 * of sha1s. If the given ref is a tag, check if the given tag points
1899 * at one of the sha1s in the given sha1 array.
1900 * the given sha1_array.
1902 * 1. Only a single level of inderection is obtained, we might want to
1903 * change this to account for multiple levels (e.g. annotated tags
1904 * pointing to annotated tags pointing to a commit.)
1905 * 2. As the refs are cached we might know what refname peels to without
1906 * the need to parse the object via parse_object(). peel_ref() might be a
1907 * more efficient alternative to obtain the pointee.
1909 static const struct object_id
*match_points_at(struct oid_array
*points_at
,
1910 const struct object_id
*oid
,
1911 const char *refname
)
1913 const struct object_id
*tagged_oid
= NULL
;
1916 if (oid_array_lookup(points_at
, oid
) >= 0)
1918 obj
= parse_object(the_repository
, oid
);
1920 die(_("malformed object at '%s'"), refname
);
1921 if (obj
->type
== OBJ_TAG
)
1922 tagged_oid
= &((struct tag
*)obj
)->tagged
->oid
;
1923 if (tagged_oid
&& oid_array_lookup(points_at
, tagged_oid
) >= 0)
1929 * Allocate space for a new ref_array_item and copy the name and oid to it.
1931 * Callers can then fill in other struct members at their leisure.
1933 static struct ref_array_item
*new_ref_array_item(const char *refname
,
1934 const struct object_id
*oid
)
1936 struct ref_array_item
*ref
;
1938 FLEX_ALLOC_STR(ref
, refname
, refname
);
1939 oidcpy(&ref
->objectname
, oid
);
1944 struct ref_array_item
*ref_array_push(struct ref_array
*array
,
1945 const char *refname
,
1946 const struct object_id
*oid
)
1948 struct ref_array_item
*ref
= new_ref_array_item(refname
, oid
);
1950 ALLOC_GROW(array
->items
, array
->nr
+ 1, array
->alloc
);
1951 array
->items
[array
->nr
++] = ref
;
1956 static int ref_kind_from_refname(const char *refname
)
1964 { "refs/heads/" , FILTER_REFS_BRANCHES
},
1965 { "refs/remotes/" , FILTER_REFS_REMOTES
},
1966 { "refs/tags/", FILTER_REFS_TAGS
}
1969 if (!strcmp(refname
, "HEAD"))
1970 return FILTER_REFS_DETACHED_HEAD
;
1972 for (i
= 0; i
< ARRAY_SIZE(ref_kind
); i
++) {
1973 if (starts_with(refname
, ref_kind
[i
].prefix
))
1974 return ref_kind
[i
].kind
;
1977 return FILTER_REFS_OTHERS
;
1980 static int filter_ref_kind(struct ref_filter
*filter
, const char *refname
)
1982 if (filter
->kind
== FILTER_REFS_BRANCHES
||
1983 filter
->kind
== FILTER_REFS_REMOTES
||
1984 filter
->kind
== FILTER_REFS_TAGS
)
1985 return filter
->kind
;
1986 return ref_kind_from_refname(refname
);
1990 * A call-back given to for_each_ref(). Filter refs and keep them for
1991 * later object processing.
1993 static int ref_filter_handler(const char *refname
, const struct object_id
*oid
, int flag
, void *cb_data
)
1995 struct ref_filter_cbdata
*ref_cbdata
= cb_data
;
1996 struct ref_filter
*filter
= ref_cbdata
->filter
;
1997 struct ref_array_item
*ref
;
1998 struct commit
*commit
= NULL
;
2001 if (flag
& REF_BAD_NAME
) {
2002 warning(_("ignoring ref with broken name %s"), refname
);
2006 if (flag
& REF_ISBROKEN
) {
2007 warning(_("ignoring broken ref %s"), refname
);
2011 /* Obtain the current ref kind from filter_ref_kind() and ignore unwanted refs. */
2012 kind
= filter_ref_kind(filter
, refname
);
2013 if (!(kind
& filter
->kind
))
2016 if (!filter_pattern_match(filter
, refname
))
2019 if (filter
->points_at
.nr
&& !match_points_at(&filter
->points_at
, oid
, refname
))
2023 * A merge filter is applied on refs pointing to commits. Hence
2024 * obtain the commit using the 'oid' available and discard all
2025 * non-commits early. The actual filtering is done later.
2027 if (filter
->merge_commit
|| filter
->with_commit
|| filter
->no_commit
|| filter
->verbose
) {
2028 commit
= lookup_commit_reference_gently(oid
, 1);
2031 /* We perform the filtering for the '--contains' option... */
2032 if (filter
->with_commit
&&
2033 !commit_contains(filter
, commit
, filter
->with_commit
, &ref_cbdata
->contains_cache
))
2035 /* ...or for the `--no-contains' option */
2036 if (filter
->no_commit
&&
2037 commit_contains(filter
, commit
, filter
->no_commit
, &ref_cbdata
->no_contains_cache
))
2042 * We do not open the object yet; sort may only need refname
2043 * to do its job and the resulting list may yet to be pruned
2044 * by maxcount logic.
2046 ref
= ref_array_push(ref_cbdata
->array
, refname
, oid
);
2047 ref
->commit
= commit
;
2054 /* Free memory allocated for a ref_array_item */
2055 static void free_array_item(struct ref_array_item
*item
)
2057 free((char *)item
->symref
);
2061 /* Free all memory allocated for ref_array */
2062 void ref_array_clear(struct ref_array
*array
)
2066 for (i
= 0; i
< array
->nr
; i
++)
2067 free_array_item(array
->items
[i
]);
2068 FREE_AND_NULL(array
->items
);
2069 array
->nr
= array
->alloc
= 0;
2072 static void do_merge_filter(struct ref_filter_cbdata
*ref_cbdata
)
2074 struct rev_info revs
;
2076 struct ref_filter
*filter
= ref_cbdata
->filter
;
2077 struct ref_array
*array
= ref_cbdata
->array
;
2078 struct commit
**to_clear
= xcalloc(sizeof(struct commit
*), array
->nr
);
2080 init_revisions(&revs
, NULL
);
2082 for (i
= 0; i
< array
->nr
; i
++) {
2083 struct ref_array_item
*item
= array
->items
[i
];
2084 add_pending_object(&revs
, &item
->commit
->object
, item
->refname
);
2085 to_clear
[i
] = item
->commit
;
2088 filter
->merge_commit
->object
.flags
|= UNINTERESTING
;
2089 add_pending_object(&revs
, &filter
->merge_commit
->object
, "");
2092 if (prepare_revision_walk(&revs
))
2093 die(_("revision walk setup failed"));
2098 for (i
= 0; i
< old_nr
; i
++) {
2099 struct ref_array_item
*item
= array
->items
[i
];
2100 struct commit
*commit
= item
->commit
;
2102 int is_merged
= !!(commit
->object
.flags
& UNINTERESTING
);
2104 if (is_merged
== (filter
->merge
== REF_FILTER_MERGED_INCLUDE
))
2105 array
->items
[array
->nr
++] = array
->items
[i
];
2107 free_array_item(item
);
2110 clear_commit_marks_many(old_nr
, to_clear
, ALL_REV_FLAGS
);
2111 clear_commit_marks(filter
->merge_commit
, ALL_REV_FLAGS
);
2116 * API for filtering a set of refs. Based on the type of refs the user
2117 * has requested, we iterate through those refs and apply filters
2118 * as per the given ref_filter structure and finally store the
2119 * filtered refs in the ref_array structure.
2121 int filter_refs(struct ref_array
*array
, struct ref_filter
*filter
, unsigned int type
)
2123 struct ref_filter_cbdata ref_cbdata
;
2125 unsigned int broken
= 0;
2127 ref_cbdata
.array
= array
;
2128 ref_cbdata
.filter
= filter
;
2130 if (type
& FILTER_REFS_INCLUDE_BROKEN
)
2132 filter
->kind
= type
& FILTER_REFS_KIND_MASK
;
2134 init_contains_cache(&ref_cbdata
.contains_cache
);
2135 init_contains_cache(&ref_cbdata
.no_contains_cache
);
2137 /* Simple per-ref filtering */
2139 die("filter_refs: invalid type");
2142 * For common cases where we need only branches or remotes or tags,
2143 * we only iterate through those refs. If a mix of refs is needed,
2144 * we iterate over all refs and filter out required refs with the help
2145 * of filter_ref_kind().
2147 if (filter
->kind
== FILTER_REFS_BRANCHES
)
2148 ret
= for_each_fullref_in("refs/heads/", ref_filter_handler
, &ref_cbdata
, broken
);
2149 else if (filter
->kind
== FILTER_REFS_REMOTES
)
2150 ret
= for_each_fullref_in("refs/remotes/", ref_filter_handler
, &ref_cbdata
, broken
);
2151 else if (filter
->kind
== FILTER_REFS_TAGS
)
2152 ret
= for_each_fullref_in("refs/tags/", ref_filter_handler
, &ref_cbdata
, broken
);
2153 else if (filter
->kind
& FILTER_REFS_ALL
)
2154 ret
= for_each_fullref_in_pattern(filter
, ref_filter_handler
, &ref_cbdata
, broken
);
2155 if (!ret
&& (filter
->kind
& FILTER_REFS_DETACHED_HEAD
))
2156 head_ref(ref_filter_handler
, &ref_cbdata
);
2159 clear_contains_cache(&ref_cbdata
.contains_cache
);
2160 clear_contains_cache(&ref_cbdata
.no_contains_cache
);
2162 /* Filters that need revision walking */
2163 if (filter
->merge_commit
)
2164 do_merge_filter(&ref_cbdata
);
2169 static int cmp_ref_sorting(struct ref_sorting
*s
, struct ref_array_item
*a
, struct ref_array_item
*b
)
2171 struct atom_value
*va
, *vb
;
2173 cmp_type cmp_type
= used_atom
[s
->atom
].type
;
2174 int (*cmp_fn
)(const char *, const char *);
2175 struct strbuf err
= STRBUF_INIT
;
2177 if (get_ref_atom_value(a
, s
->atom
, &va
, &err
))
2179 if (get_ref_atom_value(b
, s
->atom
, &vb
, &err
))
2181 strbuf_release(&err
);
2182 cmp_fn
= s
->ignore_case
? strcasecmp
: strcmp
;
2184 cmp
= versioncmp(va
->s
, vb
->s
);
2185 else if (cmp_type
== FIELD_STR
)
2186 cmp
= cmp_fn(va
->s
, vb
->s
);
2188 if (va
->value
< vb
->value
)
2190 else if (va
->value
== vb
->value
)
2191 cmp
= cmp_fn(a
->refname
, b
->refname
);
2196 return (s
->reverse
) ? -cmp
: cmp
;
2199 static int compare_refs(const void *a_
, const void *b_
, void *ref_sorting
)
2201 struct ref_array_item
*a
= *((struct ref_array_item
**)a_
);
2202 struct ref_array_item
*b
= *((struct ref_array_item
**)b_
);
2203 struct ref_sorting
*s
;
2205 for (s
= ref_sorting
; s
; s
= s
->next
) {
2206 int cmp
= cmp_ref_sorting(s
, a
, b
);
2213 void ref_array_sort(struct ref_sorting
*sorting
, struct ref_array
*array
)
2215 QSORT_S(array
->items
, array
->nr
, compare_refs
, sorting
);
2218 static void append_literal(const char *cp
, const char *ep
, struct ref_formatting_state
*state
)
2220 struct strbuf
*s
= &state
->stack
->output
;
2222 while (*cp
&& (!ep
|| cp
< ep
)) {
2227 int ch
= hex2chr(cp
+ 1);
2229 strbuf_addch(s
, ch
);
2235 strbuf_addch(s
, *cp
);
2240 int format_ref_array_item(struct ref_array_item
*info
,
2241 const struct ref_format
*format
,
2242 struct strbuf
*final_buf
,
2243 struct strbuf
*error_buf
)
2245 const char *cp
, *sp
, *ep
;
2246 struct ref_formatting_state state
= REF_FORMATTING_STATE_INIT
;
2248 state
.quote_style
= format
->quote_style
;
2249 push_stack_element(&state
.stack
);
2251 for (cp
= format
->format
; *cp
&& (sp
= find_next(cp
)); cp
= ep
+ 1) {
2252 struct atom_value
*atomv
;
2255 ep
= strchr(sp
, ')');
2257 append_literal(cp
, sp
, &state
);
2258 pos
= parse_ref_filter_atom(format
, sp
+ 2, ep
, error_buf
);
2259 if (pos
< 0 || get_ref_atom_value(info
, pos
, &atomv
, error_buf
) ||
2260 atomv
->handler(atomv
, &state
, error_buf
)) {
2261 pop_stack_element(&state
.stack
);
2266 sp
= cp
+ strlen(cp
);
2267 append_literal(cp
, sp
, &state
);
2269 if (format
->need_color_reset_at_eol
) {
2270 struct atom_value resetv
;
2271 resetv
.s
= GIT_COLOR_RESET
;
2272 if (append_atom(&resetv
, &state
, error_buf
)) {
2273 pop_stack_element(&state
.stack
);
2277 if (state
.stack
->prev
) {
2278 pop_stack_element(&state
.stack
);
2279 return strbuf_addf_ret(error_buf
, -1, _("format: %%(end) atom missing"));
2281 strbuf_addbuf(final_buf
, &state
.stack
->output
);
2282 pop_stack_element(&state
.stack
);
2286 void show_ref_array_item(struct ref_array_item
*info
,
2287 const struct ref_format
*format
)
2289 struct strbuf final_buf
= STRBUF_INIT
;
2290 struct strbuf error_buf
= STRBUF_INIT
;
2292 if (format_ref_array_item(info
, format
, &final_buf
, &error_buf
))
2293 die("%s", error_buf
.buf
);
2294 fwrite(final_buf
.buf
, 1, final_buf
.len
, stdout
);
2295 strbuf_release(&error_buf
);
2296 strbuf_release(&final_buf
);
2300 void pretty_print_ref(const char *name
, const struct object_id
*oid
,
2301 const struct ref_format
*format
)
2303 struct ref_array_item
*ref_item
;
2304 ref_item
= new_ref_array_item(name
, oid
);
2305 ref_item
->kind
= ref_kind_from_refname(name
);
2306 show_ref_array_item(ref_item
, format
);
2307 free_array_item(ref_item
);
2310 static int parse_sorting_atom(const char *atom
)
2313 * This parses an atom using a dummy ref_format, since we don't
2314 * actually care about the formatting details.
2316 struct ref_format dummy
= REF_FORMAT_INIT
;
2317 const char *end
= atom
+ strlen(atom
);
2318 struct strbuf err
= STRBUF_INIT
;
2319 int res
= parse_ref_filter_atom(&dummy
, atom
, end
, &err
);
2322 strbuf_release(&err
);
2326 /* If no sorting option is given, use refname to sort as default */
2327 struct ref_sorting
*ref_default_sorting(void)
2329 static const char cstr_name
[] = "refname";
2331 struct ref_sorting
*sorting
= xcalloc(1, sizeof(*sorting
));
2333 sorting
->next
= NULL
;
2334 sorting
->atom
= parse_sorting_atom(cstr_name
);
2338 void parse_ref_sorting(struct ref_sorting
**sorting_tail
, const char *arg
)
2340 struct ref_sorting
*s
;
2342 s
= xcalloc(1, sizeof(*s
));
2343 s
->next
= *sorting_tail
;
2350 if (skip_prefix(arg
, "version:", &arg
) ||
2351 skip_prefix(arg
, "v:", &arg
))
2353 s
->atom
= parse_sorting_atom(arg
);
2356 int parse_opt_ref_sorting(const struct option
*opt
, const char *arg
, int unset
)
2358 if (!arg
) /* should --no-sort void the list ? */
2360 parse_ref_sorting(opt
->value
, arg
);
2364 int parse_opt_merge_filter(const struct option
*opt
, const char *arg
, int unset
)
2366 struct ref_filter
*rf
= opt
->value
;
2367 struct object_id oid
;
2368 int no_merged
= starts_with(opt
->long_name
, "no");
2372 return opterror(opt
, "is incompatible with --merged", 0);
2374 return opterror(opt
, "is incompatible with --no-merged", 0);
2378 rf
->merge
= no_merged
2379 ? REF_FILTER_MERGED_OMIT
2380 : REF_FILTER_MERGED_INCLUDE
;
2382 if (get_oid(arg
, &oid
))
2383 die(_("malformed object name %s"), arg
);
2385 rf
->merge_commit
= lookup_commit_reference_gently(&oid
, 0);
2386 if (!rf
->merge_commit
)
2387 return opterror(opt
, "must point to a commit", 0);