9 * - Add colors to the graph.
10 * Pick a color for each column, and print all characters
11 * in that column with the specified color.
13 * - Limit the number of columns, similar to the way gitk does.
14 * If we reach more than a specified number of columns, omit
15 * sections of some columns.
17 * - The output during the GRAPH_PRE_COMMIT and GRAPH_COLLAPSING states
18 * could be made more compact by printing horizontal lines, instead of
19 * long diagonal lines. For example, during collapsing, something like
20 * this: instead of this:
28 * If there are several parallel diagonal lines, they will need to be
29 * replaced with horizontal lines on subsequent rows.
34 * The parent commit of this column.
36 struct commit *commit;
38 * XXX: Once we add support for colors, struct column could also
39 * contain the color of its branch line.
54 * The commit currently being processed
56 struct commit *commit;
57 /* The rev-info used for the current traversal */
58 struct rev_info *revs;
60 * The number of interesting parents that this commit has.
62 * Note that this is not the same as the actual number of parents.
63 * This count excludes parents that won't be printed in the graph
64 * output, as determined by graph_is_interesting().
68 * The width of the graph output for this commit.
69 * All rows for this commit are padded to this width, so that
70 * messages printed after the graph output are aligned.
74 * The next expansion row to print
75 * when state is GRAPH_PRE_COMMIT
79 * The current output state.
80 * This tells us what kind of line graph_next_line() should output.
82 enum graph_state state;
84 * The output state for the previous line of output.
85 * This is primarily used to determine how the first merge line
86 * should appear, based on the last line of the previous commit.
88 enum graph_state prev_state;
90 * The index of the column that refers to this commit.
92 * If none of the incoming columns refer to this commit,
93 * this will be equal to num_columns.
97 * The commit_index for the previously displayed commit.
99 * This is used to determine how the first line of a merge
100 * graph output should appear, based on the last line of the
103 int prev_commit_index;
105 * The maximum number of columns that can be stored in the columns
106 * and new_columns arrays. This is also half the number of entries
107 * that can be stored in the mapping and new_mapping arrays.
111 * The number of columns (also called "branch lines" in some places)
115 * The number of columns in the new_columns array
119 * The number of entries in the mapping array
123 * The column state before we output the current commit.
125 struct column *columns;
127 * The new column state after we output the current commit.
128 * Only valid when state is GRAPH_COLLAPSING.
130 struct column *new_columns;
132 * An array that tracks the current state of each
133 * character in the output line during state GRAPH_COLLAPSING.
134 * Each entry is -1 if this character is empty, or a non-negative
135 * integer if the character contains a branch line. The value of
136 * the integer indicates the target position for this branch line.
137 * (I.e., this array maps the current column positions to their
138 * desired positions.)
140 * The maximum capacity of this array is always
141 * sizeof(int) * 2 * column_capacity.
145 * A temporary array for computing the next mapping state
146 * while we are outputting a mapping line. This is stored as part
147 * of the git_graph simply so we don't have to allocate a new
148 * temporary array each time we have to output a collapsing line.
153 struct git_graph *graph_init(struct rev_info *opt)
155 struct git_graph *graph = xmalloc(sizeof(struct git_graph));
156 graph->commit = NULL;
158 graph->num_parents = 0;
159 graph->expansion_row = 0;
160 graph->state = GRAPH_PADDING;
161 graph->prev_state = GRAPH_PADDING;
162 graph->commit_index = 0;
163 graph->prev_commit_index = 0;
164 graph->num_columns = 0;
165 graph->num_new_columns = 0;
166 graph->mapping_size = 0;
169 * Allocate a reasonably large default number of columns
170 * We'll automatically grow columns later if we need more room.
172 graph->column_capacity = 30;
173 graph->columns = xmalloc(sizeof(struct column) *
174 graph->column_capacity);
175 graph->new_columns = xmalloc(sizeof(struct column) *
176 graph->column_capacity);
177 graph->mapping = xmalloc(sizeof(int) * 2 * graph->column_capacity);
178 graph->new_mapping = xmalloc(sizeof(int) * 2 * graph->column_capacity);
183 void graph_release(struct git_graph *graph)
185 free(graph->columns);
186 free(graph->new_columns);
187 free(graph->mapping);
191 static void graph_update_state(struct git_graph *graph, enum graph_state s)
193 graph->prev_state = graph->state;
197 static void graph_ensure_capacity(struct git_graph *graph, int num_columns)
199 if (graph->column_capacity >= num_columns)
203 graph->column_capacity *= 2;
204 } while (graph->column_capacity < num_columns);
206 graph->columns = xrealloc(graph->columns,
207 sizeof(struct column) *
208 graph->column_capacity);
209 graph->new_columns = xrealloc(graph->new_columns,
210 sizeof(struct column) *
211 graph->column_capacity);
212 graph->mapping = xrealloc(graph->mapping,
213 sizeof(int) * 2 * graph->column_capacity);
214 graph->new_mapping = xrealloc(graph->new_mapping,
215 sizeof(int) * 2 * graph->column_capacity);
219 * Returns 1 if the commit will be printed in the graph output,
222 static int graph_is_interesting(struct git_graph *graph, struct commit *commit)
225 * If revs->boundary is set, commits whose children have
226 * been shown are always interesting, even if they have the
227 * UNINTERESTING or TREESAME flags set.
229 if (graph->revs && graph->revs->boundary) {
230 if (commit->object.flags & CHILD_SHOWN)
235 * Uninteresting and pruned commits won't be printed
237 return (commit->object.flags & (UNINTERESTING | TREESAME)) ? 0 : 1;
240 static void graph_insert_into_new_columns(struct git_graph *graph,
241 struct commit *commit,
247 * Ignore uinteresting commits
249 if (!graph_is_interesting(graph, commit))
253 * If the commit is already in the new_columns list, we don't need to
254 * add it. Just update the mapping correctly.
256 for (i = 0; i < graph->num_new_columns; i++) {
257 if (graph->new_columns[i].commit == commit) {
258 graph->mapping[*mapping_index] = i;
265 * This commit isn't already in new_columns. Add it.
267 graph->new_columns[graph->num_new_columns].commit = commit;
268 graph->mapping[*mapping_index] = graph->num_new_columns;
270 graph->num_new_columns++;
273 static void graph_update_width(struct git_graph *graph,
274 int is_commit_in_existing_columns)
277 * Compute the width needed to display the graph for this commit.
278 * This is the maximum width needed for any row. All other rows
279 * will be padded to this width.
281 * Compute the number of columns in the widest row:
282 * Count each existing column (graph->num_columns), and each new
283 * column added by this commit.
285 int max_cols = graph->num_columns + graph->num_parents;
288 * Even if the current commit has no parents to be printed, it
289 * still takes up a column for itself.
291 if (graph->num_parents < 1)
295 * We added a column for the the current commit as part of
296 * graph->num_parents. If the current commit was already in
297 * graph->columns, then we have double counted it.
299 if (is_commit_in_existing_columns)
303 * Each column takes up 2 spaces
305 graph->width = max_cols * 2;
308 static void graph_update_columns(struct git_graph *graph)
310 struct commit_list *parent;
311 struct column *tmp_columns;
314 int i, seen_this, is_commit_in_columns;
317 * Swap graph->columns with graph->new_columns
318 * graph->columns contains the state for the previous commit,
319 * and new_columns now contains the state for our commit.
321 * We'll re-use the old columns array as storage to compute the new
322 * columns list for the commit after this one.
324 tmp_columns = graph->columns;
325 graph->columns = graph->new_columns;
326 graph->num_columns = graph->num_new_columns;
328 graph->new_columns = tmp_columns;
329 graph->num_new_columns = 0;
332 * Now update new_columns and mapping with the information for the
333 * commit after this one.
335 * First, make sure we have enough room. At most, there will
336 * be graph->num_columns + graph->num_parents columns for the next
339 max_new_columns = graph->num_columns + graph->num_parents;
340 graph_ensure_capacity(graph, max_new_columns);
343 * Clear out graph->mapping
345 graph->mapping_size = 2 * max_new_columns;
346 for (i = 0; i < graph->mapping_size; i++)
347 graph->mapping[i] = -1;
350 * Populate graph->new_columns and graph->mapping
352 * Some of the parents of this commit may already be in
353 * graph->columns. If so, graph->new_columns should only contain a
354 * single entry for each such commit. graph->mapping should
355 * contain information about where each current branch line is
356 * supposed to end up after the collapsing is performed.
360 is_commit_in_columns = 1;
361 for (i = 0; i <= graph->num_columns; i++) {
362 struct commit *col_commit;
363 if (i == graph->num_columns) {
366 is_commit_in_columns = 0;
367 col_commit = graph->commit;
369 col_commit = graph->columns[i].commit;
372 if (col_commit == graph->commit) {
373 int old_mapping_idx = mapping_idx;
375 graph->commit_index = i;
376 for (parent = graph->commit->parents;
378 parent = parent->next) {
379 graph_insert_into_new_columns(graph,
384 * We always need to increment mapping_idx by at
385 * least 2, even if it has no interesting parents.
386 * The current commit always takes up at least 2
389 if (mapping_idx == old_mapping_idx)
392 graph_insert_into_new_columns(graph, col_commit,
398 * Shrink mapping_size to be the minimum necessary
400 while (graph->mapping_size > 1 &&
401 graph->mapping[graph->mapping_size - 1] < 0)
402 graph->mapping_size--;
405 * Compute graph->width for this commit
407 graph_update_width(graph, is_commit_in_columns);
410 void graph_update(struct git_graph *graph, struct commit *commit)
412 struct commit_list *parent;
417 graph->commit = commit;
420 * Count how many interesting parents this commit has
422 graph->num_parents = 0;
423 for (parent = commit->parents; parent; parent = parent->next) {
424 if (graph_is_interesting(graph, parent->item))
425 graph->num_parents++;
429 * Store the old commit_index in prev_commit_index.
430 * graph_update_columns() will update graph->commit_index for this
433 graph->prev_commit_index = graph->commit_index;
436 * Call graph_update_columns() to update
437 * columns, new_columns, and mapping.
439 graph_update_columns(graph);
441 graph->expansion_row = 0;
444 * Update graph->state.
445 * Note that we don't call graph_update_state() here, since
446 * we don't want to update graph->prev_state. No line for
447 * graph->state was ever printed.
449 * If the previous commit didn't get to the GRAPH_PADDING state,
450 * it never finished its output. Goto GRAPH_SKIP, to print out
451 * a line to indicate that portion of the graph is missing.
453 * Otherwise, if there are 3 or more parents, we need to print
454 * extra rows before the commit, to expand the branch lines around
455 * it and make room for it.
457 * If there are less than 3 parents, we can immediately print the
460 if (graph->state != GRAPH_PADDING)
461 graph->state = GRAPH_SKIP;
462 else if (graph->num_parents >= 3)
463 graph->state = GRAPH_PRE_COMMIT;
465 graph->state = GRAPH_COMMIT;
468 static int graph_is_mapping_correct(struct git_graph *graph)
473 * The mapping is up to date if each entry is at its target,
474 * or is 1 greater than its target.
475 * (If it is 1 greater than the target, '/' will be printed, so it
476 * will look correct on the next row.)
478 for (i = 0; i < graph->mapping_size; i++) {
479 int target = graph->mapping[i];
482 if (target == (i / 2))
490 static void graph_pad_horizontally(struct git_graph *graph, struct strbuf *sb)
493 * Add additional spaces to the end of the strbuf, so that all
494 * lines for a particular commit have the same width.
496 * This way, fields printed to the right of the graph will remain
497 * aligned for the entire commit.
500 if (sb->len >= graph->width)
503 extra = graph->width - sb->len;
504 strbuf_addf(sb, "%*s", (int) extra, "");
507 static void graph_output_padding_line(struct git_graph *graph,
513 * We could conceivable be called with a NULL commit
514 * if our caller has a bug, and invokes graph_next_line()
515 * immediately after graph_init(), without first calling
516 * graph_update(). Return without outputting anything in this
523 * Output a padding row, that leaves all branch lines unchanged
525 for (i = 0; i < graph->num_new_columns; i++) {
526 strbuf_addstr(sb, "| ");
529 graph_pad_horizontally(graph, sb);
532 static void graph_output_skip_line(struct git_graph *graph, struct strbuf *sb)
535 * Output an ellipsis to indicate that a portion
536 * of the graph is missing.
538 strbuf_addstr(sb, "...");
539 graph_pad_horizontally(graph, sb);
541 if (graph->num_parents >= 3)
542 graph_update_state(graph, GRAPH_PRE_COMMIT);
544 graph_update_state(graph, GRAPH_COMMIT);
547 static void graph_output_pre_commit_line(struct git_graph *graph,
550 int num_expansion_rows;
554 * This function formats a row that increases the space around a commit
555 * with multiple parents, to make room for it. It should only be
556 * called when there are 3 or more parents.
558 * We need 2 extra rows for every parent over 2.
560 assert(graph->num_parents >= 3);
561 num_expansion_rows = (graph->num_parents - 2) * 2;
564 * graph->expansion_row tracks the current expansion row we are on.
565 * It should be in the range [0, num_expansion_rows - 1]
567 assert(0 <= graph->expansion_row &&
568 graph->expansion_row < num_expansion_rows);
574 for (i = 0; i < graph->num_columns; i++) {
575 struct column *col = &graph->columns[i];
576 if (col->commit == graph->commit) {
578 strbuf_addf(sb, "| %*s", graph->expansion_row, "");
579 } else if (seen_this && (graph->expansion_row == 0)) {
581 * This is the first line of the pre-commit output.
582 * If the previous commit was a merge commit and
583 * ended in the GRAPH_POST_MERGE state, all branch
584 * lines after graph->prev_commit_index were
585 * printed as "\" on the previous line. Continue
586 * to print them as "\" on this line. Otherwise,
587 * print the branch lines as "|".
589 if (graph->prev_state == GRAPH_POST_MERGE &&
590 graph->prev_commit_index < i)
591 strbuf_addstr(sb, "\\ ");
593 strbuf_addstr(sb, "| ");
594 } else if (seen_this && (graph->expansion_row > 0)) {
595 strbuf_addstr(sb, "\\ ");
597 strbuf_addstr(sb, "| ");
601 graph_pad_horizontally(graph, sb);
604 * Increment graph->expansion_row,
605 * and move to state GRAPH_COMMIT if necessary
607 graph->expansion_row++;
608 if (graph->expansion_row >= num_expansion_rows)
609 graph_update_state(graph, GRAPH_COMMIT);
612 static void graph_output_commit_char(struct git_graph *graph, struct strbuf *sb)
615 * For boundary commits, print 'o'
616 * (We should only see boundary commits when revs->boundary is set.)
618 if (graph->commit->object.flags & BOUNDARY) {
619 assert(graph->revs->boundary);
620 strbuf_addch(sb, 'o');
625 * If revs->left_right is set, print '<' for commits that
626 * come from the left side, and '>' for commits from the right
629 if (graph->revs && graph->revs->left_right) {
630 if (graph->commit->object.flags & SYMMETRIC_LEFT)
631 strbuf_addch(sb, '<');
633 strbuf_addch(sb, '>');
638 * Print 'M' for merge commits
640 * Note that we don't check graph->num_parents to determine if the
641 * commit is a merge, since that only tracks the number of
642 * "interesting" parents. We want to print 'M' for merge commits
643 * even if they have less than 2 interesting parents.
645 if (graph->commit->parents != NULL &&
646 graph->commit->parents->next != NULL) {
647 strbuf_addch(sb, 'M');
652 * Print '*' in all other cases
654 strbuf_addch(sb, '*');
657 void graph_output_commit_line(struct git_graph *graph, struct strbuf *sb)
663 * Output the row containing this commit
664 * Iterate up to and including graph->num_columns,
665 * since the current commit may not be in any of the existing
666 * columns. (This happens when the current commit doesn't have any
667 * children that we have already processed.)
670 for (i = 0; i <= graph->num_columns; i++) {
671 struct commit *col_commit;
672 if (i == graph->num_columns) {
675 col_commit = graph->commit;
677 col_commit = graph->columns[i].commit;
680 if (col_commit == graph->commit) {
682 graph_output_commit_char(graph, sb);
684 if (graph->num_parents < 3)
685 strbuf_addch(sb, ' ');
688 ((graph->num_parents - 2) * 2) - 1;
689 for (j = 0; j < num_dashes; j++)
690 strbuf_addch(sb, '-');
691 strbuf_addstr(sb, ". ");
693 } else if (seen_this && (graph->num_parents > 2)) {
694 strbuf_addstr(sb, "\\ ");
695 } else if (seen_this && (graph->num_parents == 2)) {
697 * This is a 2-way merge commit.
698 * There is no GRAPH_PRE_COMMIT stage for 2-way
699 * merges, so this is the first line of output
700 * for this commit. Check to see what the previous
701 * line of output was.
703 * If it was GRAPH_POST_MERGE, the branch line
704 * coming into this commit may have been '\',
705 * and not '|' or '/'. If so, output the branch
706 * line as '\' on this line, instead of '|'. This
707 * makes the output look nicer.
709 if (graph->prev_state == GRAPH_POST_MERGE &&
710 graph->prev_commit_index < i)
711 strbuf_addstr(sb, "\\ ");
713 strbuf_addstr(sb, "| ");
715 strbuf_addstr(sb, "| ");
719 graph_pad_horizontally(graph, sb);
722 * Update graph->state
724 if (graph->num_parents > 1)
725 graph_update_state(graph, GRAPH_POST_MERGE);
726 else if (graph_is_mapping_correct(graph))
727 graph_update_state(graph, GRAPH_PADDING);
729 graph_update_state(graph, GRAPH_COLLAPSING);
732 void graph_output_post_merge_line(struct git_graph *graph, struct strbuf *sb)
738 * Output the post-merge row
740 for (i = 0; i <= graph->num_columns; i++) {
741 struct commit *col_commit;
742 if (i == graph->num_columns) {
745 col_commit = graph->commit;
747 col_commit = graph->columns[i].commit;
750 if (col_commit == graph->commit) {
752 strbuf_addch(sb, '|');
753 for (j = 0; j < graph->num_parents - 1; j++)
754 strbuf_addstr(sb, "\\ ");
755 } else if (seen_this) {
756 strbuf_addstr(sb, "\\ ");
758 strbuf_addstr(sb, "| ");
762 graph_pad_horizontally(graph, sb);
765 * Update graph->state
767 if (graph_is_mapping_correct(graph))
768 graph_update_state(graph, GRAPH_PADDING);
770 graph_update_state(graph, GRAPH_COLLAPSING);
773 void graph_output_collapsing_line(struct git_graph *graph, struct strbuf *sb)
779 * Clear out the new_mapping array
781 for (i = 0; i < graph->mapping_size; i++)
782 graph->new_mapping[i] = -1;
784 for (i = 0; i < graph->mapping_size; i++) {
785 int target = graph->mapping[i];
790 * Since update_columns() always inserts the leftmost
791 * column first, each branch's target location should
792 * always be either its current location or to the left of
793 * its current location.
795 * We never have to move branches to the right. This makes
796 * the graph much more legible, since whenever branches
797 * cross, only one is moving directions.
799 assert(target * 2 <= i);
801 if (target * 2 == i) {
803 * This column is already in the
806 assert(graph->new_mapping[i] == -1);
807 graph->new_mapping[i] = target;
808 } else if (graph->new_mapping[i - 1] < 0) {
810 * Nothing is to the left.
811 * Move to the left by one
813 graph->new_mapping[i - 1] = target;
814 } else if (graph->new_mapping[i - 1] == target) {
816 * There is a branch line to our left
817 * already, and it is our target. We
818 * combine with this line, since we share
819 * the same parent commit.
821 * We don't have to add anything to the
822 * output or new_mapping, since the
823 * existing branch line has already taken
828 * There is a branch line to our left,
829 * but it isn't our target. We need to
832 * The space just to the left of this
833 * branch should always be empty.
835 assert(graph->new_mapping[i - 1] > target);
836 assert(graph->new_mapping[i - 2] < 0);
837 graph->new_mapping[i - 2] = target;
842 * The new mapping may be 1 smaller than the old mapping
844 if (graph->new_mapping[graph->mapping_size - 1] < 0)
845 graph->mapping_size--;
848 * Output out a line based on the new mapping info
850 for (i = 0; i < graph->mapping_size; i++) {
851 int target = graph->new_mapping[i];
853 strbuf_addch(sb, ' ');
854 else if (target * 2 == i)
855 strbuf_addch(sb, '|');
857 strbuf_addch(sb, '/');
860 graph_pad_horizontally(graph, sb);
863 * Swap mapping and new_mapping
865 tmp_mapping = graph->mapping;
866 graph->mapping = graph->new_mapping;
867 graph->new_mapping = tmp_mapping;
870 * If graph->mapping indicates that all of the branch lines
871 * are already in the correct positions, we are done.
872 * Otherwise, we need to collapse some branch lines together.
874 if (graph_is_mapping_correct(graph))
875 graph_update_state(graph, GRAPH_PADDING);
878 int graph_next_line(struct git_graph *graph, struct strbuf *sb)
880 switch (graph->state) {
882 graph_output_padding_line(graph, sb);
885 graph_output_skip_line(graph, sb);
887 case GRAPH_PRE_COMMIT:
888 graph_output_pre_commit_line(graph, sb);
891 graph_output_commit_line(graph, sb);
893 case GRAPH_POST_MERGE:
894 graph_output_post_merge_line(graph, sb);
896 case GRAPH_COLLAPSING:
897 graph_output_collapsing_line(graph, sb);
905 void graph_padding_line(struct git_graph *graph, struct strbuf *sb)
909 if (graph->state != GRAPH_COMMIT) {
910 graph_next_line(graph, sb);
915 * Output the row containing this commit
916 * Iterate up to and including graph->num_columns,
917 * since the current commit may not be in any of the existing
918 * columns. (This happens when the current commit doesn't have any
919 * children that we have already processed.)
921 for (i = 0; i < graph->num_columns; i++) {
922 struct commit *col_commit = graph->columns[i].commit;
923 if (col_commit == graph->commit) {
924 strbuf_addch(sb, '|');
926 if (graph->num_parents < 3)
927 strbuf_addch(sb, ' ');
929 int num_spaces = ((graph->num_parents - 2) * 2);
930 for (j = 0; j < num_spaces; j++)
931 strbuf_addch(sb, ' ');
934 strbuf_addstr(sb, "| ");
938 graph_pad_horizontally(graph, sb);
941 * Update graph->prev_state since we have output a padding line
943 graph->prev_state = GRAPH_PADDING;
946 int graph_is_commit_finished(struct git_graph const *graph)
948 return (graph->state == GRAPH_PADDING);
951 void graph_show_commit(struct git_graph *graph)
953 struct strbuf msgbuf;
954 int shown_commit_line = 0;
959 strbuf_init(&msgbuf, 0);
961 while (!shown_commit_line) {
962 shown_commit_line = graph_next_line(graph, &msgbuf);
963 fwrite(msgbuf.buf, sizeof(char), msgbuf.len, stdout);
964 if (!shown_commit_line)
966 strbuf_setlen(&msgbuf, 0);
969 strbuf_release(&msgbuf);
972 void graph_show_oneline(struct git_graph *graph)
974 struct strbuf msgbuf;
979 strbuf_init(&msgbuf, 0);
980 graph_next_line(graph, &msgbuf);
981 fwrite(msgbuf.buf, sizeof(char), msgbuf.len, stdout);
982 strbuf_release(&msgbuf);
985 void graph_show_padding(struct git_graph *graph)
987 struct strbuf msgbuf;
992 strbuf_init(&msgbuf, 0);
993 graph_padding_line(graph, &msgbuf);
994 fwrite(msgbuf.buf, sizeof(char), msgbuf.len, stdout);
995 strbuf_release(&msgbuf);
998 int graph_show_remainder(struct git_graph *graph)
1000 struct strbuf msgbuf;
1006 if (graph_is_commit_finished(graph))
1009 strbuf_init(&msgbuf, 0);
1011 graph_next_line(graph, &msgbuf);
1012 fwrite(msgbuf.buf, sizeof(char), msgbuf.len, stdout);
1013 strbuf_setlen(&msgbuf, 0);
1016 if (!graph_is_commit_finished(graph))
1021 strbuf_release(&msgbuf);
1027 void graph_show_strbuf(struct git_graph *graph, struct strbuf const *sb)
1032 fwrite(sb->buf, sizeof(char), sb->len, stdout);
1037 * Print the strbuf line by line,
1038 * and display the graph info before each line but the first.
1043 char *next_p = strchr(p, '\n');
1048 len = (sb->buf + sb->len) - p;
1050 fwrite(p, sizeof(char), len, stdout);
1051 if (next_p && *next_p != '\0')
1052 graph_show_oneline(graph);
1057 void graph_show_commit_msg(struct git_graph *graph,
1058 struct strbuf const *sb)
1060 int newline_terminated;
1064 * If there's no graph, just print the message buffer.
1066 * The message buffer for CMIT_FMT_ONELINE and
1067 * CMIT_FMT_USERFORMAT are already missing a terminating
1068 * newline. All of the other formats should have it.
1070 fwrite(sb->buf, sizeof(char), sb->len, stdout);
1074 newline_terminated = (sb->len && sb->buf[sb->len - 1] == '\n');
1077 * Show the commit message
1079 graph_show_strbuf(graph, sb);
1082 * If there is more output needed for this commit, show it now
1084 if (!graph_is_commit_finished(graph)) {
1086 * If sb doesn't have a terminating newline, print one now,
1087 * so we can start the remainder of the graph output on a
1090 if (!newline_terminated)
1093 graph_show_remainder(graph);
1096 * If sb ends with a newline, our output should too.
1098 if (newline_terminated)