]>
Commit | Line | Data |
---|---|---|
fc7bd51b EN |
1 | #include "git-compat-util.h" |
2 | #include "gettext.h" | |
b2141fc1 | 3 | #include "config.h" |
c12172d2 | 4 | #include "commit.h" |
427fc5b8 | 5 | #include "color.h" |
c12172d2 | 6 | #include "graph.h" |
c12172d2 | 7 | #include "revision.h" |
dbbcd44f | 8 | #include "strvec.h" |
c12172d2 | 9 | |
064bfbde NS |
10 | /* Internal API */ |
11 | ||
064bfbde NS |
12 | /* |
13 | * Output a padding line in the graph. | |
14 | * This is similar to graph_next_line(). However, it is guaranteed to | |
15 | * never print the current commit line. Instead, if the commit line is | |
16 | * next, it will simply output a line of vertical padding, extending the | |
17 | * branch lines downwards, but leaving them otherwise unchanged. | |
18 | */ | |
19 | static void graph_padding_line(struct git_graph *graph, struct strbuf *sb); | |
20 | ||
21 | /* | |
c61008fd JS |
22 | * Print a strbuf. If the graph is non-NULL, all lines but the first will be |
23 | * prefixed with the graph output. | |
064bfbde NS |
24 | * |
25 | * If the strbuf ends with a newline, the output will end after this | |
26 | * newline. A new graph line will not be printed after the final newline. | |
27 | * If the strbuf is empty, no output will be printed. | |
28 | * | |
3ea3c215 | 29 | * Since the first line will not include the graph output, the caller is |
064bfbde NS |
30 | * responsible for printing this line's graph (perhaps via |
31 | * graph_show_commit() or graph_show_oneline()) before calling | |
32 | * graph_show_strbuf(). | |
660e113c JK |
33 | * |
34 | * Note that unlike some other graph display functions, you must pass the file | |
35 | * handle directly. It is assumed that this is the same file handle as the | |
36 | * file specified by the graph diff options. This is necessary so that | |
37 | * graph_show_strbuf can be called even with a NULL graph. | |
3f1480b7 | 38 | * If a NULL graph is supplied, the strbuf is printed as-is. |
064bfbde | 39 | */ |
660e113c JK |
40 | static void graph_show_strbuf(struct git_graph *graph, |
41 | FILE *file, | |
42 | struct strbuf const *sb); | |
064bfbde | 43 | |
c12172d2 AS |
44 | /* |
45 | * TODO: | |
c12172d2 AS |
46 | * - Limit the number of columns, similar to the way gitk does. |
47 | * If we reach more than a specified number of columns, omit | |
48 | * sections of some columns. | |
c12172d2 AS |
49 | */ |
50 | ||
51 | struct column { | |
52 | /* | |
53 | * The parent commit of this column. | |
54 | */ | |
55 | struct commit *commit; | |
56 | /* | |
427fc5b8 AC |
57 | * The color to (optionally) print this column in. This is an |
58 | * index into column_colors. | |
c12172d2 | 59 | */ |
427fc5b8 | 60 | unsigned short color; |
c12172d2 AS |
61 | }; |
62 | ||
63 | enum graph_state { | |
64 | GRAPH_PADDING, | |
65 | GRAPH_SKIP, | |
66 | GRAPH_PRE_COMMIT, | |
67 | GRAPH_COMMIT, | |
68 | GRAPH_POST_MERGE, | |
69 | GRAPH_COLLAPSING | |
70 | }; | |
71 | ||
660e113c JK |
72 | static void graph_show_line_prefix(const struct diff_options *diffopt) |
73 | { | |
74 | if (!diffopt || !diffopt->line_prefix) | |
75 | return; | |
76 | ||
77 | fwrite(diffopt->line_prefix, | |
78 | sizeof(char), | |
79 | diffopt->line_prefix_length, | |
80 | diffopt->file); | |
81 | } | |
82 | ||
1e3d4119 JH |
83 | static const char **column_colors; |
84 | static unsigned short column_colors_max; | |
85 | ||
ef8d7ac4 | 86 | static void parse_graph_colors_config(struct strvec *colors, const char *string) |
73c727d6 NTND |
87 | { |
88 | const char *end, *start; | |
89 | ||
90 | start = string; | |
91 | end = string + strlen(string); | |
92 | while (start < end) { | |
93 | const char *comma = strchrnul(start, ','); | |
94 | char color[COLOR_MAXLEN]; | |
95 | ||
96 | if (!color_parse_mem(start, comma - start, color)) | |
ef8d7ac4 | 97 | strvec_push(colors, color); |
73c727d6 | 98 | else |
98538307 | 99 | warning(_("ignored invalid color '%.*s' in log.graphColors"), |
73c727d6 NTND |
100 | (int)(comma - start), start); |
101 | start = comma + 1; | |
102 | } | |
ef8d7ac4 | 103 | strvec_push(colors, GIT_COLOR_RESET); |
73c727d6 NTND |
104 | } |
105 | ||
ac751a0b | 106 | void graph_set_column_colors(const char **colors, unsigned short colors_max) |
1e3d4119 JH |
107 | { |
108 | column_colors = colors; | |
109 | column_colors_max = colors_max; | |
110 | } | |
111 | ||
112 | static const char *column_get_color_code(unsigned short color) | |
427fc5b8 | 113 | { |
1e3d4119 | 114 | return column_colors[color]; |
427fc5b8 AC |
115 | } |
116 | ||
fbccf255 JC |
117 | struct graph_line { |
118 | struct strbuf *buf; | |
119 | size_t width; | |
120 | }; | |
121 | ||
122 | static inline void graph_line_addch(struct graph_line *line, int c) | |
123 | { | |
124 | strbuf_addch(line->buf, c); | |
125 | line->width++; | |
126 | } | |
127 | ||
128 | static inline void graph_line_addchars(struct graph_line *line, int c, size_t n) | |
129 | { | |
130 | strbuf_addchars(line->buf, c, n); | |
131 | line->width += n; | |
132 | } | |
133 | ||
134 | static inline void graph_line_addstr(struct graph_line *line, const char *s) | |
135 | { | |
136 | strbuf_addstr(line->buf, s); | |
137 | line->width += strlen(s); | |
138 | } | |
139 | ||
140 | static inline void graph_line_addcolor(struct graph_line *line, unsigned short color) | |
141 | { | |
142 | strbuf_addstr(line->buf, column_get_color_code(color)); | |
143 | } | |
144 | ||
145 | static void graph_line_write_column(struct graph_line *line, const struct column *c, | |
146 | char col_char) | |
427fc5b8 | 147 | { |
1e3d4119 | 148 | if (c->color < column_colors_max) |
fbccf255 JC |
149 | graph_line_addcolor(line, c->color); |
150 | graph_line_addch(line, col_char); | |
1e3d4119 | 151 | if (c->color < column_colors_max) |
fbccf255 | 152 | graph_line_addcolor(line, column_colors_max); |
427fc5b8 AC |
153 | } |
154 | ||
c12172d2 AS |
155 | struct git_graph { |
156 | /* | |
157 | * The commit currently being processed | |
158 | */ | |
159 | struct commit *commit; | |
7528f27d AS |
160 | /* The rev-info used for the current traversal */ |
161 | struct rev_info *revs; | |
c12172d2 | 162 | /* |
37a75abc AS |
163 | * The number of interesting parents that this commit has. |
164 | * | |
165 | * Note that this is not the same as the actual number of parents. | |
166 | * This count excludes parents that won't be printed in the graph | |
167 | * output, as determined by graph_is_interesting(). | |
c12172d2 AS |
168 | */ |
169 | int num_parents; | |
0724cb86 AS |
170 | /* |
171 | * The width of the graph output for this commit. | |
172 | * All rows for this commit are padded to this width, so that | |
173 | * messages printed after the graph output are aligned. | |
174 | */ | |
175 | int width; | |
c12172d2 AS |
176 | /* |
177 | * The next expansion row to print | |
178 | * when state is GRAPH_PRE_COMMIT | |
179 | */ | |
180 | int expansion_row; | |
181 | /* | |
182 | * The current output state. | |
183 | * This tells us what kind of line graph_next_line() should output. | |
184 | */ | |
185 | enum graph_state state; | |
3395908e AS |
186 | /* |
187 | * The output state for the previous line of output. | |
188 | * This is primarily used to determine how the first merge line | |
189 | * should appear, based on the last line of the previous commit. | |
190 | */ | |
191 | enum graph_state prev_state; | |
192 | /* | |
193 | * The index of the column that refers to this commit. | |
194 | * | |
195 | * If none of the incoming columns refer to this commit, | |
196 | * this will be equal to num_columns. | |
197 | */ | |
198 | int commit_index; | |
199 | /* | |
200 | * The commit_index for the previously displayed commit. | |
201 | * | |
202 | * This is used to determine how the first line of a merge | |
203 | * graph output should appear, based on the last line of the | |
204 | * previous commit. | |
205 | */ | |
206 | int prev_commit_index; | |
0f0f389f JC |
207 | /* |
208 | * Which layout variant to use to display merge commits. If the | |
209 | * commit's first parent is known to be in a column to the left of the | |
210 | * merge, then this value is 0 and we use the layout on the left. | |
211 | * Otherwise, the value is 1 and the layout on the right is used. This | |
212 | * field tells us how many columns the first parent occupies. | |
213 | * | |
214 | * 0) 1) | |
215 | * | |
216 | * | | | *-. | | *---. | |
217 | * | |_|/|\ \ | | |\ \ \ | |
218 | * |/| | | | | | | | | | * | |
219 | */ | |
220 | int merge_layout; | |
d62893ec JC |
221 | /* |
222 | * The number of columns added to the graph by the current commit. For | |
571fb965 | 223 | * 2-way and octopus merges, this is usually one less than the |
d62893ec JC |
224 | * number of parents: |
225 | * | |
226 | * | | | | | \ | |
227 | * | * | | *---. \ | |
228 | * | |\ \ | |\ \ \ \ | |
229 | * | | | | | | | | | | | |
230 | * | |
231 | * num_parents: 2 num_parents: 4 | |
232 | * edges_added: 1 edges_added: 3 | |
233 | * | |
234 | * For left-skewed merges, the first parent fuses with its neighbor and | |
235 | * so one less column is added: | |
236 | * | |
237 | * | | | | | \ | |
238 | * | * | | *-. \ | |
239 | * |/| | |/|\ \ \ | |
240 | * | | | | | | | | | |
241 | * | |
242 | * num_parents: 2 num_parents: 4 | |
243 | * edges_added: 0 edges_added: 2 | |
244 | * | |
245 | * This number determines how edges to the right of the merge are | |
246 | * displayed in commit and post-merge lines; if no columns have been | |
247 | * added then a vertical line should be used where a right-tracking | |
248 | * line would otherwise be used. | |
249 | * | |
250 | * | * \ | * | | |
251 | * | |\ \ |/| | | |
252 | * | | * \ | * | | |
253 | */ | |
254 | int edges_added; | |
255 | /* | |
256 | * The number of columns added by the previous commit, which is used to | |
257 | * smooth edges appearing to the right of a commit in a commit line | |
258 | * following a post-merge line. | |
259 | */ | |
260 | int prev_edges_added; | |
c12172d2 AS |
261 | /* |
262 | * The maximum number of columns that can be stored in the columns | |
263 | * and new_columns arrays. This is also half the number of entries | |
0195285b | 264 | * that can be stored in the mapping and old_mapping arrays. |
c12172d2 AS |
265 | */ |
266 | int column_capacity; | |
267 | /* | |
268 | * The number of columns (also called "branch lines" in some places) | |
269 | */ | |
270 | int num_columns; | |
271 | /* | |
272 | * The number of columns in the new_columns array | |
273 | */ | |
274 | int num_new_columns; | |
275 | /* | |
276 | * The number of entries in the mapping array | |
277 | */ | |
278 | int mapping_size; | |
279 | /* | |
280 | * The column state before we output the current commit. | |
281 | */ | |
282 | struct column *columns; | |
283 | /* | |
284 | * The new column state after we output the current commit. | |
285 | * Only valid when state is GRAPH_COLLAPSING. | |
286 | */ | |
287 | struct column *new_columns; | |
288 | /* | |
289 | * An array that tracks the current state of each | |
290 | * character in the output line during state GRAPH_COLLAPSING. | |
291 | * Each entry is -1 if this character is empty, or a non-negative | |
292 | * integer if the character contains a branch line. The value of | |
293 | * the integer indicates the target position for this branch line. | |
294 | * (I.e., this array maps the current column positions to their | |
295 | * desired positions.) | |
296 | * | |
297 | * The maximum capacity of this array is always | |
298 | * sizeof(int) * 2 * column_capacity. | |
299 | */ | |
300 | int *mapping; | |
301 | /* | |
479db18b JC |
302 | * A copy of the contents of the mapping array from the last commit, |
303 | * which we use to improve the display of columns that are tracking | |
304 | * from right to left through a commit line. We also use this to | |
305 | * avoid allocating a fresh array when we compute the next mapping. | |
c12172d2 | 306 | */ |
0195285b | 307 | int *old_mapping; |
427fc5b8 AC |
308 | /* |
309 | * The current default column color being used. This is | |
310 | * stored as an index into the array column_colors. | |
311 | */ | |
312 | unsigned short default_column_color; | |
c12172d2 AS |
313 | }; |
314 | ||
b5a4de9d BY |
315 | static struct strbuf *diff_output_prefix_callback(struct diff_options *opt, void *data) |
316 | { | |
317 | struct git_graph *graph = data; | |
318 | static struct strbuf msgbuf = STRBUF_INIT; | |
319 | ||
5e71a84a | 320 | assert(opt); |
b5a4de9d BY |
321 | |
322 | strbuf_reset(&msgbuf); | |
660e113c JK |
323 | if (opt->line_prefix) |
324 | strbuf_add(&msgbuf, opt->line_prefix, | |
325 | opt->line_prefix_length); | |
326 | if (graph) | |
327 | graph_padding_line(graph, &msgbuf); | |
b5a4de9d BY |
328 | return &msgbuf; |
329 | } | |
330 | ||
660e113c JK |
331 | static const struct diff_options *default_diffopt; |
332 | ||
333 | void graph_setup_line_prefix(struct diff_options *diffopt) | |
334 | { | |
335 | default_diffopt = diffopt; | |
336 | ||
337 | /* setup an output prefix callback if necessary */ | |
338 | if (diffopt && !diffopt->output_prefix) | |
339 | diffopt->output_prefix = diff_output_prefix_callback; | |
340 | } | |
341 | ||
7528f27d | 342 | struct git_graph *graph_init(struct rev_info *opt) |
c12172d2 AS |
343 | { |
344 | struct git_graph *graph = xmalloc(sizeof(struct git_graph)); | |
1e3d4119 | 345 | |
73c727d6 NTND |
346 | if (!column_colors) { |
347 | char *string; | |
348 | if (git_config_get_string("log.graphcolors", &string)) { | |
349 | /* not configured -- use default */ | |
350 | graph_set_column_colors(column_colors_ansi, | |
351 | column_colors_ansi_max); | |
352 | } else { | |
ef8d7ac4 JK |
353 | static struct strvec custom_colors = STRVEC_INIT; |
354 | strvec_clear(&custom_colors); | |
73c727d6 NTND |
355 | parse_graph_colors_config(&custom_colors, string); |
356 | free(string); | |
357 | /* graph_set_column_colors takes a max-index, not a count */ | |
d70a9eb6 JK |
358 | graph_set_column_colors(custom_colors.v, |
359 | custom_colors.nr - 1); | |
73c727d6 NTND |
360 | } |
361 | } | |
1e3d4119 | 362 | |
c12172d2 | 363 | graph->commit = NULL; |
7528f27d | 364 | graph->revs = opt; |
c12172d2 AS |
365 | graph->num_parents = 0; |
366 | graph->expansion_row = 0; | |
367 | graph->state = GRAPH_PADDING; | |
3395908e AS |
368 | graph->prev_state = GRAPH_PADDING; |
369 | graph->commit_index = 0; | |
370 | graph->prev_commit_index = 0; | |
0f0f389f | 371 | graph->merge_layout = 0; |
d62893ec JC |
372 | graph->edges_added = 0; |
373 | graph->prev_edges_added = 0; | |
c12172d2 AS |
374 | graph->num_columns = 0; |
375 | graph->num_new_columns = 0; | |
376 | graph->mapping_size = 0; | |
91e50b2c AS |
377 | /* |
378 | * Start the column color at the maximum value, since we'll | |
379 | * always increment it for the first commit we output. | |
380 | * This way we start at 0 for the first commit. | |
381 | */ | |
1e3d4119 | 382 | graph->default_column_color = column_colors_max - 1; |
c12172d2 AS |
383 | |
384 | /* | |
385 | * Allocate a reasonably large default number of columns | |
386 | * We'll automatically grow columns later if we need more room. | |
387 | */ | |
388 | graph->column_capacity = 30; | |
b32fa95f JK |
389 | ALLOC_ARRAY(graph->columns, graph->column_capacity); |
390 | ALLOC_ARRAY(graph->new_columns, graph->column_capacity); | |
391 | ALLOC_ARRAY(graph->mapping, 2 * graph->column_capacity); | |
0195285b | 392 | ALLOC_ARRAY(graph->old_mapping, 2 * graph->column_capacity); |
c12172d2 | 393 | |
b5a4de9d BY |
394 | /* |
395 | * The diff output prefix callback, with this we can make | |
396 | * all the diff output to align with the graph lines. | |
397 | */ | |
398 | opt->diffopt.output_prefix = diff_output_prefix_callback; | |
399 | opt->diffopt.output_prefix_data = graph; | |
400 | ||
c12172d2 AS |
401 | return graph; |
402 | } | |
403 | ||
dccf6c16 AH |
404 | void graph_clear(struct git_graph *graph) |
405 | { | |
406 | if (!graph) | |
407 | return; | |
408 | ||
409 | free(graph->columns); | |
410 | free(graph->new_columns); | |
411 | free(graph->mapping); | |
412 | free(graph->old_mapping); | |
413 | free(graph); | |
414 | } | |
415 | ||
3395908e AS |
416 | static void graph_update_state(struct git_graph *graph, enum graph_state s) |
417 | { | |
418 | graph->prev_state = graph->state; | |
419 | graph->state = s; | |
420 | } | |
421 | ||
c12172d2 AS |
422 | static void graph_ensure_capacity(struct git_graph *graph, int num_columns) |
423 | { | |
424 | if (graph->column_capacity >= num_columns) | |
425 | return; | |
426 | ||
427 | do { | |
428 | graph->column_capacity *= 2; | |
429 | } while (graph->column_capacity < num_columns); | |
430 | ||
2756ca43 RS |
431 | REALLOC_ARRAY(graph->columns, graph->column_capacity); |
432 | REALLOC_ARRAY(graph->new_columns, graph->column_capacity); | |
433 | REALLOC_ARRAY(graph->mapping, graph->column_capacity * 2); | |
0195285b | 434 | REALLOC_ARRAY(graph->old_mapping, graph->column_capacity * 2); |
c12172d2 AS |
435 | } |
436 | ||
37a75abc AS |
437 | /* |
438 | * Returns 1 if the commit will be printed in the graph output, | |
439 | * and 0 otherwise. | |
440 | */ | |
3c68d67b | 441 | static int graph_is_interesting(struct git_graph *graph, struct commit *commit) |
37a75abc | 442 | { |
3c68d67b AS |
443 | /* |
444 | * If revs->boundary is set, commits whose children have | |
445 | * been shown are always interesting, even if they have the | |
446 | * UNINTERESTING or TREESAME flags set. | |
3c68d67b AS |
447 | */ |
448 | if (graph->revs && graph->revs->boundary) { | |
4603ec0f | 449 | if (commit->object.flags & CHILD_SHOWN) |
3c68d67b AS |
450 | return 1; |
451 | } | |
452 | ||
37a75abc | 453 | /* |
beb5af43 AS |
454 | * Otherwise, use get_commit_action() to see if this commit is |
455 | * interesting | |
37a75abc | 456 | */ |
beb5af43 | 457 | return get_commit_action(graph->revs, commit) == commit_show; |
37a75abc AS |
458 | } |
459 | ||
a0ebe573 AS |
460 | static struct commit_list *next_interesting_parent(struct git_graph *graph, |
461 | struct commit_list *orig) | |
462 | { | |
463 | struct commit_list *list; | |
464 | ||
465 | /* | |
466 | * If revs->first_parent_only is set, only the first | |
467 | * parent is interesting. None of the others are. | |
468 | */ | |
469 | if (graph->revs->first_parent_only) | |
470 | return NULL; | |
471 | ||
472 | /* | |
473 | * Return the next interesting commit after orig | |
474 | */ | |
475 | for (list = orig->next; list; list = list->next) { | |
476 | if (graph_is_interesting(graph, list->item)) | |
477 | return list; | |
478 | } | |
479 | ||
480 | return NULL; | |
481 | } | |
482 | ||
483 | static struct commit_list *first_interesting_parent(struct git_graph *graph) | |
484 | { | |
485 | struct commit_list *parents = graph->commit->parents; | |
486 | ||
487 | /* | |
488 | * If this commit has no parents, ignore it | |
489 | */ | |
490 | if (!parents) | |
491 | return NULL; | |
492 | ||
493 | /* | |
494 | * If the first parent is interesting, return it | |
495 | */ | |
496 | if (graph_is_interesting(graph, parents->item)) | |
497 | return parents; | |
498 | ||
499 | /* | |
500 | * Otherwise, call next_interesting_parent() to get | |
501 | * the next interesting parent | |
502 | */ | |
503 | return next_interesting_parent(graph, parents); | |
504 | } | |
505 | ||
427fc5b8 AC |
506 | static unsigned short graph_get_current_column_color(const struct git_graph *graph) |
507 | { | |
daa0c3d9 | 508 | if (!want_color(graph->revs->diffopt.use_color)) |
1e3d4119 | 509 | return column_colors_max; |
427fc5b8 AC |
510 | return graph->default_column_color; |
511 | } | |
512 | ||
513 | /* | |
514 | * Update the graph's default column color. | |
515 | */ | |
516 | static void graph_increment_column_color(struct git_graph *graph) | |
517 | { | |
518 | graph->default_column_color = (graph->default_column_color + 1) % | |
1e3d4119 | 519 | column_colors_max; |
427fc5b8 AC |
520 | } |
521 | ||
522 | static unsigned short graph_find_commit_color(const struct git_graph *graph, | |
523 | const struct commit *commit) | |
524 | { | |
525 | int i; | |
526 | for (i = 0; i < graph->num_columns; i++) { | |
527 | if (graph->columns[i].commit == commit) | |
528 | return graph->columns[i].color; | |
529 | } | |
530 | return graph_get_current_column_color(graph); | |
531 | } | |
532 | ||
9157a2a0 JC |
533 | static int graph_find_new_column_by_commit(struct git_graph *graph, |
534 | struct commit *commit) | |
535 | { | |
536 | int i; | |
537 | for (i = 0; i < graph->num_new_columns; i++) { | |
538 | if (graph->new_columns[i].commit == commit) | |
539 | return i; | |
540 | } | |
541 | return -1; | |
542 | } | |
543 | ||
c12172d2 | 544 | static void graph_insert_into_new_columns(struct git_graph *graph, |
0f0f389f JC |
545 | struct commit *commit, |
546 | int idx) | |
c12172d2 | 547 | { |
9157a2a0 | 548 | int i = graph_find_new_column_by_commit(graph, commit); |
0f0f389f | 549 | int mapping_idx; |
c12172d2 | 550 | |
c12172d2 | 551 | /* |
a551fd5e JC |
552 | * If the commit is not already in the new_columns array, then add it |
553 | * and record it as being in the final column. | |
c12172d2 | 554 | */ |
a551fd5e JC |
555 | if (i < 0) { |
556 | i = graph->num_new_columns++; | |
557 | graph->new_columns[i].commit = commit; | |
558 | graph->new_columns[i].color = graph_find_commit_color(graph, commit); | |
c12172d2 AS |
559 | } |
560 | ||
0f0f389f JC |
561 | if (graph->num_parents > 1 && idx > -1 && graph->merge_layout == -1) { |
562 | /* | |
563 | * If this is the first parent of a merge, choose a layout for | |
564 | * the merge line based on whether the parent appears in a | |
565 | * column to the left of the merge | |
566 | */ | |
567 | int dist, shift; | |
568 | ||
569 | dist = idx - i; | |
570 | shift = (dist > 1) ? 2 * dist - 3 : 1; | |
571 | ||
572 | graph->merge_layout = (dist > 0) ? 0 : 1; | |
92beecc1 JC |
573 | graph->edges_added = graph->num_parents + graph->merge_layout - 2; |
574 | ||
0f0f389f JC |
575 | mapping_idx = graph->width + (graph->merge_layout - 1) * shift; |
576 | graph->width += 2 * graph->merge_layout; | |
92beecc1 JC |
577 | |
578 | } else if (graph->edges_added > 0 && i == graph->mapping[graph->width - 2]) { | |
579 | /* | |
580 | * If some columns have been added by a merge, but this commit | |
581 | * was found in the last existing column, then adjust the | |
582 | * numbers so that the two edges immediately join, i.e.: | |
583 | * | |
584 | * * | * | | |
585 | * |\ \ => |\| | |
586 | * | |/ | * | |
587 | * | * | |
588 | */ | |
589 | mapping_idx = graph->width - 2; | |
590 | graph->edges_added = -1; | |
0f0f389f JC |
591 | } else { |
592 | mapping_idx = graph->width; | |
593 | graph->width += 2; | |
594 | } | |
595 | ||
596 | graph->mapping[mapping_idx] = i; | |
0724cb86 AS |
597 | } |
598 | ||
c12172d2 AS |
599 | static void graph_update_columns(struct git_graph *graph) |
600 | { | |
601 | struct commit_list *parent; | |
c12172d2 | 602 | int max_new_columns; |
0724cb86 | 603 | int i, seen_this, is_commit_in_columns; |
c12172d2 AS |
604 | |
605 | /* | |
606 | * Swap graph->columns with graph->new_columns | |
607 | * graph->columns contains the state for the previous commit, | |
608 | * and new_columns now contains the state for our commit. | |
609 | * | |
610 | * We'll re-use the old columns array as storage to compute the new | |
611 | * columns list for the commit after this one. | |
612 | */ | |
9e2edd66 | 613 | SWAP(graph->columns, graph->new_columns); |
c12172d2 | 614 | graph->num_columns = graph->num_new_columns; |
c12172d2 AS |
615 | graph->num_new_columns = 0; |
616 | ||
617 | /* | |
618 | * Now update new_columns and mapping with the information for the | |
619 | * commit after this one. | |
620 | * | |
621 | * First, make sure we have enough room. At most, there will | |
622 | * be graph->num_columns + graph->num_parents columns for the next | |
623 | * commit. | |
624 | */ | |
625 | max_new_columns = graph->num_columns + graph->num_parents; | |
626 | graph_ensure_capacity(graph, max_new_columns); | |
627 | ||
628 | /* | |
629 | * Clear out graph->mapping | |
630 | */ | |
631 | graph->mapping_size = 2 * max_new_columns; | |
632 | for (i = 0; i < graph->mapping_size; i++) | |
633 | graph->mapping[i] = -1; | |
634 | ||
46ba2abd | 635 | graph->width = 0; |
92beecc1 JC |
636 | graph->prev_edges_added = graph->edges_added; |
637 | graph->edges_added = 0; | |
46ba2abd | 638 | |
c12172d2 AS |
639 | /* |
640 | * Populate graph->new_columns and graph->mapping | |
641 | * | |
642 | * Some of the parents of this commit may already be in | |
643 | * graph->columns. If so, graph->new_columns should only contain a | |
644 | * single entry for each such commit. graph->mapping should | |
645 | * contain information about where each current branch line is | |
646 | * supposed to end up after the collapsing is performed. | |
647 | */ | |
648 | seen_this = 0; | |
0724cb86 | 649 | is_commit_in_columns = 1; |
c12172d2 AS |
650 | for (i = 0; i <= graph->num_columns; i++) { |
651 | struct commit *col_commit; | |
652 | if (i == graph->num_columns) { | |
653 | if (seen_this) | |
654 | break; | |
0724cb86 | 655 | is_commit_in_columns = 0; |
c12172d2 AS |
656 | col_commit = graph->commit; |
657 | } else { | |
658 | col_commit = graph->columns[i].commit; | |
659 | } | |
660 | ||
661 | if (col_commit == graph->commit) { | |
662 | seen_this = 1; | |
3395908e | 663 | graph->commit_index = i; |
0f0f389f | 664 | graph->merge_layout = -1; |
a0ebe573 | 665 | for (parent = first_interesting_parent(graph); |
c12172d2 | 666 | parent; |
a0ebe573 | 667 | parent = next_interesting_parent(graph, parent)) { |
427fc5b8 | 668 | /* |
91e50b2c AS |
669 | * If this is a merge, or the start of a new |
670 | * childless column, increment the current | |
427fc5b8 AC |
671 | * color. |
672 | */ | |
91e50b2c AS |
673 | if (graph->num_parents > 1 || |
674 | !is_commit_in_columns) { | |
427fc5b8 | 675 | graph_increment_column_color(graph); |
91e50b2c | 676 | } |
0f0f389f | 677 | graph_insert_into_new_columns(graph, parent->item, i); |
c12172d2 | 678 | } |
37a75abc | 679 | /* |
46ba2abd | 680 | * We always need to increment graph->width by at |
37a75abc AS |
681 | * least 2, even if it has no interesting parents. |
682 | * The current commit always takes up at least 2 | |
683 | * spaces. | |
684 | */ | |
46ba2abd JC |
685 | if (graph->num_parents == 0) |
686 | graph->width += 2; | |
c12172d2 | 687 | } else { |
0f0f389f | 688 | graph_insert_into_new_columns(graph, col_commit, -1); |
c12172d2 AS |
689 | } |
690 | } | |
691 | ||
692 | /* | |
693 | * Shrink mapping_size to be the minimum necessary | |
694 | */ | |
695 | while (graph->mapping_size > 1 && | |
696 | graph->mapping[graph->mapping_size - 1] < 0) | |
697 | graph->mapping_size--; | |
698 | } | |
699 | ||
bbb13e81 JC |
700 | static int graph_num_dashed_parents(struct git_graph *graph) |
701 | { | |
702 | return graph->num_parents + graph->merge_layout - 3; | |
703 | } | |
704 | ||
0f0f389f JC |
705 | static int graph_num_expansion_rows(struct git_graph *graph) |
706 | { | |
707 | /* | |
708 | * Normally, we need two expansion rows for each dashed parent line from | |
709 | * an octopus merge: | |
710 | * | |
711 | * | * | |
712 | * | |\ | |
713 | * | | \ | |
714 | * | | \ | |
715 | * | *-. \ | |
716 | * | |\ \ \ | |
717 | * | |
718 | * If the merge is skewed to the left, then its parents occupy one less | |
719 | * column, and we don't need as many expansion rows to route around it; | |
720 | * in some cases that means we don't need any expansion rows at all: | |
721 | * | |
722 | * | * | |
723 | * | |\ | |
724 | * | * \ | |
725 | * |/|\ \ | |
726 | */ | |
bbb13e81 | 727 | return graph_num_dashed_parents(graph) * 2; |
0f0f389f JC |
728 | } |
729 | ||
ee7abb5f JC |
730 | static int graph_needs_pre_commit_line(struct git_graph *graph) |
731 | { | |
732 | return graph->num_parents >= 3 && | |
0f0f389f JC |
733 | graph->commit_index < (graph->num_columns - 1) && |
734 | graph->expansion_row < graph_num_expansion_rows(graph); | |
ee7abb5f JC |
735 | } |
736 | ||
c12172d2 AS |
737 | void graph_update(struct git_graph *graph, struct commit *commit) |
738 | { | |
739 | struct commit_list *parent; | |
740 | ||
741 | /* | |
742 | * Set the new commit | |
743 | */ | |
744 | graph->commit = commit; | |
745 | ||
746 | /* | |
37a75abc | 747 | * Count how many interesting parents this commit has |
c12172d2 AS |
748 | */ |
749 | graph->num_parents = 0; | |
a0ebe573 AS |
750 | for (parent = first_interesting_parent(graph); |
751 | parent; | |
752 | parent = next_interesting_parent(graph, parent)) | |
753 | { | |
754 | graph->num_parents++; | |
37a75abc | 755 | } |
c12172d2 | 756 | |
3395908e AS |
757 | /* |
758 | * Store the old commit_index in prev_commit_index. | |
759 | * graph_update_columns() will update graph->commit_index for this | |
760 | * commit. | |
761 | */ | |
762 | graph->prev_commit_index = graph->commit_index; | |
763 | ||
c12172d2 AS |
764 | /* |
765 | * Call graph_update_columns() to update | |
766 | * columns, new_columns, and mapping. | |
767 | */ | |
768 | graph_update_columns(graph); | |
769 | ||
770 | graph->expansion_row = 0; | |
771 | ||
772 | /* | |
773 | * Update graph->state. | |
3395908e AS |
774 | * Note that we don't call graph_update_state() here, since |
775 | * we don't want to update graph->prev_state. No line for | |
776 | * graph->state was ever printed. | |
c12172d2 AS |
777 | * |
778 | * If the previous commit didn't get to the GRAPH_PADDING state, | |
779 | * it never finished its output. Goto GRAPH_SKIP, to print out | |
780 | * a line to indicate that portion of the graph is missing. | |
781 | * | |
f1979d6b AS |
782 | * If there are 3 or more parents, we may need to print extra rows |
783 | * before the commit, to expand the branch lines around it and make | |
784 | * room for it. We need to do this only if there is a branch row | |
785 | * (or more) to the right of this commit. | |
c12172d2 AS |
786 | * |
787 | * If there are less than 3 parents, we can immediately print the | |
788 | * commit line. | |
789 | */ | |
790 | if (graph->state != GRAPH_PADDING) | |
791 | graph->state = GRAPH_SKIP; | |
ee7abb5f | 792 | else if (graph_needs_pre_commit_line(graph)) |
c12172d2 AS |
793 | graph->state = GRAPH_PRE_COMMIT; |
794 | else | |
795 | graph->state = GRAPH_COMMIT; | |
796 | } | |
797 | ||
798 | static int graph_is_mapping_correct(struct git_graph *graph) | |
799 | { | |
800 | int i; | |
801 | ||
802 | /* | |
803 | * The mapping is up to date if each entry is at its target, | |
804 | * or is 1 greater than its target. | |
805 | * (If it is 1 greater than the target, '/' will be printed, so it | |
806 | * will look correct on the next row.) | |
807 | */ | |
808 | for (i = 0; i < graph->mapping_size; i++) { | |
809 | int target = graph->mapping[i]; | |
810 | if (target < 0) | |
811 | continue; | |
812 | if (target == (i / 2)) | |
813 | continue; | |
814 | return 0; | |
815 | } | |
816 | ||
817 | return 1; | |
818 | } | |
819 | ||
fbccf255 | 820 | static void graph_pad_horizontally(struct git_graph *graph, struct graph_line *line) |
c12172d2 AS |
821 | { |
822 | /* | |
823 | * Add additional spaces to the end of the strbuf, so that all | |
824 | * lines for a particular commit have the same width. | |
825 | * | |
826 | * This way, fields printed to the right of the graph will remain | |
827 | * aligned for the entire commit. | |
c12172d2 | 828 | */ |
fbccf255 JC |
829 | if (line->width < graph->width) |
830 | graph_line_addchars(line, ' ', graph->width - line->width); | |
c12172d2 AS |
831 | } |
832 | ||
833 | static void graph_output_padding_line(struct git_graph *graph, | |
fbccf255 | 834 | struct graph_line *line) |
c12172d2 AS |
835 | { |
836 | int i; | |
837 | ||
c12172d2 AS |
838 | /* |
839 | * Output a padding row, that leaves all branch lines unchanged | |
840 | */ | |
841 | for (i = 0; i < graph->num_new_columns; i++) { | |
fbccf255 JC |
842 | graph_line_write_column(line, &graph->new_columns[i], '|'); |
843 | graph_line_addch(line, ' '); | |
c12172d2 | 844 | } |
c12172d2 AS |
845 | } |
846 | ||
3ad87c80 JK |
847 | |
848 | int graph_width(struct git_graph *graph) | |
849 | { | |
850 | return graph->width; | |
851 | } | |
852 | ||
853 | ||
fbccf255 | 854 | static void graph_output_skip_line(struct git_graph *graph, struct graph_line *line) |
c12172d2 AS |
855 | { |
856 | /* | |
857 | * Output an ellipsis to indicate that a portion | |
858 | * of the graph is missing. | |
859 | */ | |
fbccf255 | 860 | graph_line_addstr(line, "..."); |
c12172d2 | 861 | |
ee7abb5f | 862 | if (graph_needs_pre_commit_line(graph)) |
3395908e | 863 | graph_update_state(graph, GRAPH_PRE_COMMIT); |
c12172d2 | 864 | else |
3395908e | 865 | graph_update_state(graph, GRAPH_COMMIT); |
c12172d2 AS |
866 | } |
867 | ||
868 | static void graph_output_pre_commit_line(struct git_graph *graph, | |
fbccf255 | 869 | struct graph_line *line) |
c12172d2 | 870 | { |
c12172d2 AS |
871 | int i, seen_this; |
872 | ||
873 | /* | |
874 | * This function formats a row that increases the space around a commit | |
875 | * with multiple parents, to make room for it. It should only be | |
876 | * called when there are 3 or more parents. | |
877 | * | |
878 | * We need 2 extra rows for every parent over 2. | |
879 | */ | |
880 | assert(graph->num_parents >= 3); | |
c12172d2 AS |
881 | |
882 | /* | |
883 | * graph->expansion_row tracks the current expansion row we are on. | |
884 | * It should be in the range [0, num_expansion_rows - 1] | |
885 | */ | |
886 | assert(0 <= graph->expansion_row && | |
0f0f389f | 887 | graph->expansion_row < graph_num_expansion_rows(graph)); |
c12172d2 AS |
888 | |
889 | /* | |
890 | * Output the row | |
891 | */ | |
892 | seen_this = 0; | |
893 | for (i = 0; i < graph->num_columns; i++) { | |
894 | struct column *col = &graph->columns[i]; | |
895 | if (col->commit == graph->commit) { | |
896 | seen_this = 1; | |
fbccf255 JC |
897 | graph_line_write_column(line, col, '|'); |
898 | graph_line_addchars(line, ' ', graph->expansion_row); | |
3395908e AS |
899 | } else if (seen_this && (graph->expansion_row == 0)) { |
900 | /* | |
901 | * This is the first line of the pre-commit output. | |
902 | * If the previous commit was a merge commit and | |
903 | * ended in the GRAPH_POST_MERGE state, all branch | |
904 | * lines after graph->prev_commit_index were | |
905 | * printed as "\" on the previous line. Continue | |
906 | * to print them as "\" on this line. Otherwise, | |
907 | * print the branch lines as "|". | |
908 | */ | |
909 | if (graph->prev_state == GRAPH_POST_MERGE && | |
910 | graph->prev_commit_index < i) | |
fbccf255 | 911 | graph_line_write_column(line, col, '\\'); |
3395908e | 912 | else |
fbccf255 | 913 | graph_line_write_column(line, col, '|'); |
3395908e | 914 | } else if (seen_this && (graph->expansion_row > 0)) { |
fbccf255 | 915 | graph_line_write_column(line, col, '\\'); |
c12172d2 | 916 | } else { |
fbccf255 | 917 | graph_line_write_column(line, col, '|'); |
c12172d2 | 918 | } |
fbccf255 | 919 | graph_line_addch(line, ' '); |
c12172d2 AS |
920 | } |
921 | ||
c12172d2 AS |
922 | /* |
923 | * Increment graph->expansion_row, | |
924 | * and move to state GRAPH_COMMIT if necessary | |
925 | */ | |
926 | graph->expansion_row++; | |
0f0f389f | 927 | if (!graph_needs_pre_commit_line(graph)) |
3395908e | 928 | graph_update_state(graph, GRAPH_COMMIT); |
c12172d2 AS |
929 | } |
930 | ||
fbccf255 | 931 | static void graph_output_commit_char(struct git_graph *graph, struct graph_line *line) |
3c68d67b AS |
932 | { |
933 | /* | |
934 | * For boundary commits, print 'o' | |
935 | * (We should only see boundary commits when revs->boundary is set.) | |
936 | */ | |
937 | if (graph->commit->object.flags & BOUNDARY) { | |
938 | assert(graph->revs->boundary); | |
fbccf255 | 939 | graph_line_addch(line, 'o'); |
3c68d67b AS |
940 | return; |
941 | } | |
942 | ||
943 | /* | |
1df2d656 | 944 | * get_revision_mark() handles all other cases without assert() |
3c68d67b | 945 | */ |
fbccf255 | 946 | graph_line_addstr(line, get_revision_mark(graph->revs, graph->commit)); |
3c68d67b AS |
947 | } |
948 | ||
427fc5b8 | 949 | /* |
fbccf255 | 950 | * Draw the horizontal dashes of an octopus merge. |
427fc5b8 | 951 | */ |
fbccf255 | 952 | static void graph_draw_octopus_merge(struct git_graph *graph, struct graph_line *line) |
427fc5b8 AC |
953 | { |
954 | /* | |
bbb13e81 JC |
955 | * The parents of a merge commit can be arbitrarily reordered as they |
956 | * are mapped onto display columns, for example this is a valid merge: | |
04005834 | 957 | * |
bbb13e81 JC |
958 | * | | *---. |
959 | * | | |\ \ \ | |
960 | * | | |/ / / | |
961 | * | |/| | / | |
962 | * | |_|_|/ | |
963 | * |/| | | | |
964 | * 3 1 0 2 | |
04005834 | 965 | * |
bbb13e81 JC |
966 | * The numbers denote which parent of the merge each visual column |
967 | * corresponds to; we can't assume that the parents will initially | |
968 | * display in the order given by new_columns. | |
04005834 | 969 | * |
bbb13e81 JC |
970 | * To find the right color for each dash, we need to consult the |
971 | * mapping array, starting from the column 2 places to the right of the | |
972 | * merge commit, and use that to find out which logical column each | |
973 | * edge will collapse to. | |
04005834 | 974 | * |
bbb13e81 JC |
975 | * Commits are rendered once all edges have collapsed to their correct |
976 | * logcial column, so commit_index gives us the right visual offset for | |
977 | * the merge commit. | |
04005834 | 978 | */ |
04005834 | 979 | |
bbb13e81 JC |
980 | int i, j; |
981 | struct column *col; | |
04005834 | 982 | |
bbb13e81 JC |
983 | int dashed_parents = graph_num_dashed_parents(graph); |
984 | ||
985 | for (i = 0; i < dashed_parents; i++) { | |
986 | j = graph->mapping[(graph->commit_index + i + 2) * 2]; | |
987 | col = &graph->new_columns[j]; | |
988 | ||
989 | graph_line_write_column(line, col, '-'); | |
990 | graph_line_write_column(line, col, (i == dashed_parents - 1) ? '.' : '-'); | |
427fc5b8 | 991 | } |
bbb13e81 JC |
992 | |
993 | return; | |
427fc5b8 AC |
994 | } |
995 | ||
fbccf255 | 996 | static void graph_output_commit_line(struct git_graph *graph, struct graph_line *line) |
c12172d2 AS |
997 | { |
998 | int seen_this = 0; | |
fbccf255 | 999 | int i; |
c12172d2 AS |
1000 | |
1001 | /* | |
1002 | * Output the row containing this commit | |
1003 | * Iterate up to and including graph->num_columns, | |
1004 | * since the current commit may not be in any of the existing | |
1005 | * columns. (This happens when the current commit doesn't have any | |
1006 | * children that we have already processed.) | |
1007 | */ | |
1008 | seen_this = 0; | |
1009 | for (i = 0; i <= graph->num_columns; i++) { | |
427fc5b8 | 1010 | struct column *col = &graph->columns[i]; |
c12172d2 AS |
1011 | struct commit *col_commit; |
1012 | if (i == graph->num_columns) { | |
1013 | if (seen_this) | |
1014 | break; | |
1015 | col_commit = graph->commit; | |
1016 | } else { | |
1017 | col_commit = graph->columns[i].commit; | |
1018 | } | |
1019 | ||
1020 | if (col_commit == graph->commit) { | |
1021 | seen_this = 1; | |
fbccf255 | 1022 | graph_output_commit_char(graph, line); |
c12172d2 | 1023 | |
a6c1a382 | 1024 | if (graph->num_parents > 2) |
fbccf255 | 1025 | graph_draw_octopus_merge(graph, line); |
d62893ec | 1026 | } else if (seen_this && (graph->edges_added > 1)) { |
fbccf255 | 1027 | graph_line_write_column(line, col, '\\'); |
d62893ec | 1028 | } else if (seen_this && (graph->edges_added == 1)) { |
3395908e | 1029 | /* |
d62893ec JC |
1030 | * This is either a right-skewed 2-way merge |
1031 | * commit, or a left-skewed 3-way merge. | |
1032 | * There is no GRAPH_PRE_COMMIT stage for such | |
3395908e AS |
1033 | * merges, so this is the first line of output |
1034 | * for this commit. Check to see what the previous | |
1035 | * line of output was. | |
1036 | * | |
1037 | * If it was GRAPH_POST_MERGE, the branch line | |
1038 | * coming into this commit may have been '\', | |
1039 | * and not '|' or '/'. If so, output the branch | |
1040 | * line as '\' on this line, instead of '|'. This | |
1041 | * makes the output look nicer. | |
1042 | */ | |
1043 | if (graph->prev_state == GRAPH_POST_MERGE && | |
d62893ec | 1044 | graph->prev_edges_added > 0 && |
3395908e | 1045 | graph->prev_commit_index < i) |
fbccf255 | 1046 | graph_line_write_column(line, col, '\\'); |
3395908e | 1047 | else |
fbccf255 | 1048 | graph_line_write_column(line, col, '|'); |
479db18b JC |
1049 | } else if (graph->prev_state == GRAPH_COLLAPSING && |
1050 | graph->old_mapping[2 * i + 1] == i && | |
1051 | graph->mapping[2 * i] < i) { | |
1052 | graph_line_write_column(line, col, '/'); | |
c12172d2 | 1053 | } else { |
fbccf255 | 1054 | graph_line_write_column(line, col, '|'); |
c12172d2 | 1055 | } |
fbccf255 | 1056 | graph_line_addch(line, ' '); |
c12172d2 AS |
1057 | } |
1058 | ||
c12172d2 AS |
1059 | /* |
1060 | * Update graph->state | |
1061 | */ | |
1062 | if (graph->num_parents > 1) | |
3395908e | 1063 | graph_update_state(graph, GRAPH_POST_MERGE); |
c12172d2 | 1064 | else if (graph_is_mapping_correct(graph)) |
3395908e | 1065 | graph_update_state(graph, GRAPH_PADDING); |
c12172d2 | 1066 | else |
3395908e | 1067 | graph_update_state(graph, GRAPH_COLLAPSING); |
c12172d2 AS |
1068 | } |
1069 | ||
9d2152d3 | 1070 | static const char merge_chars[] = {'/', '|', '\\'}; |
0f0f389f | 1071 | |
fbccf255 | 1072 | static void graph_output_post_merge_line(struct git_graph *graph, struct graph_line *line) |
c12172d2 AS |
1073 | { |
1074 | int seen_this = 0; | |
92beecc1 | 1075 | int i, j; |
0f0f389f JC |
1076 | |
1077 | struct commit_list *first_parent = first_interesting_parent(graph); | |
a1087c93 | 1078 | struct column *parent_col = NULL; |
c12172d2 AS |
1079 | |
1080 | /* | |
1081 | * Output the post-merge row | |
1082 | */ | |
1083 | for (i = 0; i <= graph->num_columns; i++) { | |
427fc5b8 | 1084 | struct column *col = &graph->columns[i]; |
c12172d2 AS |
1085 | struct commit *col_commit; |
1086 | if (i == graph->num_columns) { | |
1087 | if (seen_this) | |
1088 | break; | |
1089 | col_commit = graph->commit; | |
1090 | } else { | |
427fc5b8 | 1091 | col_commit = col->commit; |
c12172d2 AS |
1092 | } |
1093 | ||
1094 | if (col_commit == graph->commit) { | |
427fc5b8 AC |
1095 | /* |
1096 | * Since the current commit is a merge find | |
1097 | * the columns for the parent commits in | |
1098 | * new_columns and use those to format the | |
1099 | * edges. | |
1100 | */ | |
0f0f389f | 1101 | struct commit_list *parents = first_parent; |
9157a2a0 | 1102 | int par_column; |
0f0f389f JC |
1103 | int idx = graph->merge_layout; |
1104 | char c; | |
c12172d2 | 1105 | seen_this = 1; |
0f0f389f | 1106 | |
92beecc1 | 1107 | for (j = 0; j < graph->num_parents; j++) { |
9157a2a0 JC |
1108 | par_column = graph_find_new_column_by_commit(graph, parents->item); |
1109 | assert(par_column >= 0); | |
0f0f389f JC |
1110 | |
1111 | c = merge_chars[idx]; | |
1112 | graph_line_write_column(line, &graph->new_columns[par_column], c); | |
92beecc1 JC |
1113 | if (idx == 2) { |
1114 | if (graph->edges_added > 0 || j < graph->num_parents - 1) | |
1115 | graph_line_addch(line, ' '); | |
1116 | } else { | |
0f0f389f | 1117 | idx++; |
92beecc1 JC |
1118 | } |
1119 | parents = next_interesting_parent(graph, parents); | |
427fc5b8 | 1120 | } |
d62893ec JC |
1121 | if (graph->edges_added == 0) |
1122 | graph_line_addch(line, ' '); | |
1123 | ||
3395908e | 1124 | } else if (seen_this) { |
d62893ec JC |
1125 | if (graph->edges_added > 0) |
1126 | graph_line_write_column(line, col, '\\'); | |
1127 | else | |
1128 | graph_line_write_column(line, col, '|'); | |
fbccf255 | 1129 | graph_line_addch(line, ' '); |
c12172d2 | 1130 | } else { |
fbccf255 | 1131 | graph_line_write_column(line, col, '|'); |
a1087c93 DS |
1132 | if (graph->merge_layout != 0 || i != graph->commit_index - 1) { |
1133 | if (parent_col) | |
1134 | graph_line_write_column( | |
1135 | line, parent_col, '_'); | |
1136 | else | |
1137 | graph_line_addch(line, ' '); | |
1138 | } | |
c12172d2 | 1139 | } |
0f0f389f JC |
1140 | |
1141 | if (col_commit == first_parent->item) | |
a1087c93 | 1142 | parent_col = col; |
c12172d2 AS |
1143 | } |
1144 | ||
c12172d2 AS |
1145 | /* |
1146 | * Update graph->state | |
1147 | */ | |
1148 | if (graph_is_mapping_correct(graph)) | |
3395908e | 1149 | graph_update_state(graph, GRAPH_PADDING); |
c12172d2 | 1150 | else |
3395908e | 1151 | graph_update_state(graph, GRAPH_COLLAPSING); |
c12172d2 AS |
1152 | } |
1153 | ||
fbccf255 | 1154 | static void graph_output_collapsing_line(struct git_graph *graph, struct graph_line *line) |
c12172d2 AS |
1155 | { |
1156 | int i; | |
eaf158f8 AC |
1157 | short used_horizontal = 0; |
1158 | int horizontal_edge = -1; | |
1159 | int horizontal_edge_target = -1; | |
c12172d2 AS |
1160 | |
1161 | /* | |
0195285b JC |
1162 | * Swap the mapping and old_mapping arrays |
1163 | */ | |
1164 | SWAP(graph->mapping, graph->old_mapping); | |
1165 | ||
1166 | /* | |
1167 | * Clear out the mapping array | |
c12172d2 AS |
1168 | */ |
1169 | for (i = 0; i < graph->mapping_size; i++) | |
0195285b | 1170 | graph->mapping[i] = -1; |
c12172d2 AS |
1171 | |
1172 | for (i = 0; i < graph->mapping_size; i++) { | |
0195285b | 1173 | int target = graph->old_mapping[i]; |
c12172d2 AS |
1174 | if (target < 0) |
1175 | continue; | |
1176 | ||
1177 | /* | |
1178 | * Since update_columns() always inserts the leftmost | |
1179 | * column first, each branch's target location should | |
1180 | * always be either its current location or to the left of | |
1181 | * its current location. | |
1182 | * | |
1183 | * We never have to move branches to the right. This makes | |
1184 | * the graph much more legible, since whenever branches | |
1185 | * cross, only one is moving directions. | |
1186 | */ | |
1187 | assert(target * 2 <= i); | |
1188 | ||
1189 | if (target * 2 == i) { | |
1190 | /* | |
1191 | * This column is already in the | |
1192 | * correct place | |
1193 | */ | |
0195285b JC |
1194 | assert(graph->mapping[i] == -1); |
1195 | graph->mapping[i] = target; | |
1196 | } else if (graph->mapping[i - 1] < 0) { | |
c12172d2 AS |
1197 | /* |
1198 | * Nothing is to the left. | |
1199 | * Move to the left by one | |
1200 | */ | |
0195285b | 1201 | graph->mapping[i - 1] = target; |
eaf158f8 AC |
1202 | /* |
1203 | * If there isn't already an edge moving horizontally | |
1204 | * select this one. | |
1205 | */ | |
1206 | if (horizontal_edge == -1) { | |
1207 | int j; | |
1208 | horizontal_edge = i; | |
1209 | horizontal_edge_target = target; | |
1210 | /* | |
1211 | * The variable target is the index of the graph | |
1212 | * column, and therefore target*2+3 is the | |
1213 | * actual screen column of the first horizontal | |
1214 | * line. | |
1215 | */ | |
1216 | for (j = (target * 2)+3; j < (i - 2); j += 2) | |
0195285b | 1217 | graph->mapping[j] = target; |
eaf158f8 | 1218 | } |
0195285b | 1219 | } else if (graph->mapping[i - 1] == target) { |
c12172d2 AS |
1220 | /* |
1221 | * There is a branch line to our left | |
1222 | * already, and it is our target. We | |
1223 | * combine with this line, since we share | |
1224 | * the same parent commit. | |
1225 | * | |
1226 | * We don't have to add anything to the | |
0195285b | 1227 | * output or mapping, since the |
c12172d2 AS |
1228 | * existing branch line has already taken |
1229 | * care of it. | |
1230 | */ | |
1231 | } else { | |
1232 | /* | |
1233 | * There is a branch line to our left, | |
1234 | * but it isn't our target. We need to | |
1235 | * cross over it. | |
1236 | * | |
1237 | * The space just to the left of this | |
1238 | * branch should always be empty. | |
1239 | */ | |
0195285b JC |
1240 | assert(graph->mapping[i - 1] > target); |
1241 | assert(graph->mapping[i - 2] < 0); | |
0195285b | 1242 | graph->mapping[i - 2] = target; |
eaf158f8 AC |
1243 | /* |
1244 | * Mark this branch as the horizontal edge to | |
1245 | * prevent any other edges from moving | |
1246 | * horizontally. | |
1247 | */ | |
c958d3bd DS |
1248 | if (horizontal_edge == -1) { |
1249 | int j; | |
1250 | horizontal_edge_target = target; | |
1251 | horizontal_edge = i - 1; | |
1252 | ||
1253 | for (j = (target * 2) + 3; j < (i - 2); j += 2) | |
1254 | graph->mapping[j] = target; | |
1255 | } | |
c12172d2 AS |
1256 | } |
1257 | } | |
1258 | ||
479db18b JC |
1259 | /* |
1260 | * Copy the current mapping array into old_mapping | |
1261 | */ | |
1262 | COPY_ARRAY(graph->old_mapping, graph->mapping, graph->mapping_size); | |
1263 | ||
c12172d2 AS |
1264 | /* |
1265 | * The new mapping may be 1 smaller than the old mapping | |
1266 | */ | |
0195285b | 1267 | if (graph->mapping[graph->mapping_size - 1] < 0) |
c12172d2 AS |
1268 | graph->mapping_size--; |
1269 | ||
1270 | /* | |
1271 | * Output out a line based on the new mapping info | |
1272 | */ | |
1273 | for (i = 0; i < graph->mapping_size; i++) { | |
0195285b | 1274 | int target = graph->mapping[i]; |
c12172d2 | 1275 | if (target < 0) |
fbccf255 | 1276 | graph_line_addch(line, ' '); |
c12172d2 | 1277 | else if (target * 2 == i) |
fbccf255 | 1278 | graph_line_write_column(line, &graph->new_columns[target], '|'); |
eaf158f8 AC |
1279 | else if (target == horizontal_edge_target && |
1280 | i != horizontal_edge - 1) { | |
1281 | /* | |
1282 | * Set the mappings for all but the | |
1283 | * first segment to -1 so that they | |
1284 | * won't continue into the next line. | |
1285 | */ | |
1286 | if (i != (target * 2)+3) | |
0195285b | 1287 | graph->mapping[i] = -1; |
eaf158f8 | 1288 | used_horizontal = 1; |
fbccf255 | 1289 | graph_line_write_column(line, &graph->new_columns[target], '_'); |
eaf158f8 AC |
1290 | } else { |
1291 | if (used_horizontal && i < horizontal_edge) | |
0195285b | 1292 | graph->mapping[i] = -1; |
fbccf255 | 1293 | graph_line_write_column(line, &graph->new_columns[target], '/'); |
eaf158f8 AC |
1294 | |
1295 | } | |
c12172d2 AS |
1296 | } |
1297 | ||
c12172d2 AS |
1298 | /* |
1299 | * If graph->mapping indicates that all of the branch lines | |
1300 | * are already in the correct positions, we are done. | |
1301 | * Otherwise, we need to collapse some branch lines together. | |
1302 | */ | |
1303 | if (graph_is_mapping_correct(graph)) | |
3395908e | 1304 | graph_update_state(graph, GRAPH_PADDING); |
c12172d2 AS |
1305 | } |
1306 | ||
ac751a0b | 1307 | int graph_next_line(struct git_graph *graph, struct strbuf *sb) |
c12172d2 | 1308 | { |
210179a2 | 1309 | int shown_commit_line = 0; |
fbccf255 JC |
1310 | struct graph_line line = { .buf = sb, .width = 0 }; |
1311 | ||
210179a2 JC |
1312 | /* |
1313 | * We could conceivable be called with a NULL commit | |
1314 | * if our caller has a bug, and invokes graph_next_line() | |
1315 | * immediately after graph_init(), without first calling | |
1316 | * graph_update(). Return without outputting anything in this | |
1317 | * case. | |
1318 | */ | |
1319 | if (!graph->commit) | |
1320 | return -1; | |
1321 | ||
c12172d2 AS |
1322 | switch (graph->state) { |
1323 | case GRAPH_PADDING: | |
fbccf255 | 1324 | graph_output_padding_line(graph, &line); |
210179a2 | 1325 | break; |
c12172d2 | 1326 | case GRAPH_SKIP: |
fbccf255 | 1327 | graph_output_skip_line(graph, &line); |
210179a2 | 1328 | break; |
c12172d2 | 1329 | case GRAPH_PRE_COMMIT: |
fbccf255 | 1330 | graph_output_pre_commit_line(graph, &line); |
210179a2 | 1331 | break; |
c12172d2 | 1332 | case GRAPH_COMMIT: |
fbccf255 | 1333 | graph_output_commit_line(graph, &line); |
210179a2 JC |
1334 | shown_commit_line = 1; |
1335 | break; | |
c12172d2 | 1336 | case GRAPH_POST_MERGE: |
fbccf255 | 1337 | graph_output_post_merge_line(graph, &line); |
210179a2 | 1338 | break; |
c12172d2 | 1339 | case GRAPH_COLLAPSING: |
fbccf255 | 1340 | graph_output_collapsing_line(graph, &line); |
210179a2 | 1341 | break; |
c12172d2 AS |
1342 | } |
1343 | ||
210179a2 JC |
1344 | graph_pad_horizontally(graph, &line); |
1345 | return shown_commit_line; | |
c12172d2 AS |
1346 | } |
1347 | ||
064bfbde | 1348 | static void graph_padding_line(struct git_graph *graph, struct strbuf *sb) |
c12172d2 | 1349 | { |
415792ed | 1350 | int i; |
fbccf255 | 1351 | struct graph_line line = { .buf = sb, .width = 0 }; |
c12172d2 AS |
1352 | |
1353 | if (graph->state != GRAPH_COMMIT) { | |
1354 | graph_next_line(graph, sb); | |
1355 | return; | |
1356 | } | |
1357 | ||
1358 | /* | |
1359 | * Output the row containing this commit | |
1360 | * Iterate up to and including graph->num_columns, | |
1361 | * since the current commit may not be in any of the existing | |
1362 | * columns. (This happens when the current commit doesn't have any | |
1363 | * children that we have already processed.) | |
1364 | */ | |
1365 | for (i = 0; i < graph->num_columns; i++) { | |
427fc5b8 | 1366 | struct column *col = &graph->columns[i]; |
16477935 | 1367 | |
fbccf255 | 1368 | graph_line_write_column(&line, col, '|'); |
16477935 JK |
1369 | |
1370 | if (col->commit == graph->commit && graph->num_parents > 2) { | |
1371 | int len = (graph->num_parents - 2) * 2; | |
fbccf255 | 1372 | graph_line_addchars(&line, ' ', len); |
16477935 | 1373 | } else { |
fbccf255 | 1374 | graph_line_addch(&line, ' '); |
16477935 | 1375 | } |
c12172d2 AS |
1376 | } |
1377 | ||
fbccf255 | 1378 | graph_pad_horizontally(graph, &line); |
3395908e AS |
1379 | |
1380 | /* | |
1381 | * Update graph->prev_state since we have output a padding line | |
1382 | */ | |
1383 | graph->prev_state = GRAPH_PADDING; | |
c12172d2 AS |
1384 | } |
1385 | ||
1386 | int graph_is_commit_finished(struct git_graph const *graph) | |
1387 | { | |
1388 | return (graph->state == GRAPH_PADDING); | |
1389 | } | |
1390 | ||
1391 | void graph_show_commit(struct git_graph *graph) | |
1392 | { | |
f285a2d7 | 1393 | struct strbuf msgbuf = STRBUF_INIT; |
c12172d2 AS |
1394 | int shown_commit_line = 0; |
1395 | ||
660e113c JK |
1396 | graph_show_line_prefix(default_diffopt); |
1397 | ||
c12172d2 AS |
1398 | if (!graph) |
1399 | return; | |
1400 | ||
a48ec241 JK |
1401 | /* |
1402 | * When showing a diff of a merge against each of its parents, we | |
1403 | * are called once for each parent without graph_update having been | |
1404 | * called. In this case, simply output a single padding line. | |
1405 | */ | |
1406 | if (graph_is_commit_finished(graph)) { | |
1407 | graph_show_padding(graph); | |
1408 | shown_commit_line = 1; | |
1409 | } | |
1410 | ||
656197ad | 1411 | while (!shown_commit_line && !graph_is_commit_finished(graph)) { |
c12172d2 | 1412 | shown_commit_line = graph_next_line(graph, &msgbuf); |
c61008fd JS |
1413 | fwrite(msgbuf.buf, sizeof(char), msgbuf.len, |
1414 | graph->revs->diffopt.file); | |
660e113c | 1415 | if (!shown_commit_line) { |
c61008fd | 1416 | putc('\n', graph->revs->diffopt.file); |
660e113c JK |
1417 | graph_show_line_prefix(&graph->revs->diffopt); |
1418 | } | |
c12172d2 AS |
1419 | strbuf_setlen(&msgbuf, 0); |
1420 | } | |
1421 | ||
1422 | strbuf_release(&msgbuf); | |
1423 | } | |
1424 | ||
1425 | void graph_show_oneline(struct git_graph *graph) | |
1426 | { | |
f285a2d7 | 1427 | struct strbuf msgbuf = STRBUF_INIT; |
c12172d2 | 1428 | |
660e113c JK |
1429 | graph_show_line_prefix(default_diffopt); |
1430 | ||
c12172d2 AS |
1431 | if (!graph) |
1432 | return; | |
1433 | ||
c12172d2 | 1434 | graph_next_line(graph, &msgbuf); |
c61008fd | 1435 | fwrite(msgbuf.buf, sizeof(char), msgbuf.len, graph->revs->diffopt.file); |
c12172d2 AS |
1436 | strbuf_release(&msgbuf); |
1437 | } | |
1438 | ||
1439 | void graph_show_padding(struct git_graph *graph) | |
1440 | { | |
f285a2d7 | 1441 | struct strbuf msgbuf = STRBUF_INIT; |
c12172d2 | 1442 | |
660e113c JK |
1443 | graph_show_line_prefix(default_diffopt); |
1444 | ||
c12172d2 AS |
1445 | if (!graph) |
1446 | return; | |
1447 | ||
c12172d2 | 1448 | graph_padding_line(graph, &msgbuf); |
c61008fd | 1449 | fwrite(msgbuf.buf, sizeof(char), msgbuf.len, graph->revs->diffopt.file); |
c12172d2 AS |
1450 | strbuf_release(&msgbuf); |
1451 | } | |
1452 | ||
1453 | int graph_show_remainder(struct git_graph *graph) | |
1454 | { | |
f285a2d7 | 1455 | struct strbuf msgbuf = STRBUF_INIT; |
c12172d2 AS |
1456 | int shown = 0; |
1457 | ||
660e113c JK |
1458 | graph_show_line_prefix(default_diffopt); |
1459 | ||
c12172d2 AS |
1460 | if (!graph) |
1461 | return 0; | |
1462 | ||
1463 | if (graph_is_commit_finished(graph)) | |
1464 | return 0; | |
1465 | ||
c12172d2 AS |
1466 | for (;;) { |
1467 | graph_next_line(graph, &msgbuf); | |
c61008fd JS |
1468 | fwrite(msgbuf.buf, sizeof(char), msgbuf.len, |
1469 | graph->revs->diffopt.file); | |
c12172d2 AS |
1470 | strbuf_setlen(&msgbuf, 0); |
1471 | shown = 1; | |
1472 | ||
660e113c | 1473 | if (!graph_is_commit_finished(graph)) { |
c61008fd | 1474 | putc('\n', graph->revs->diffopt.file); |
660e113c JK |
1475 | graph_show_line_prefix(&graph->revs->diffopt); |
1476 | } else { | |
c12172d2 | 1477 | break; |
660e113c | 1478 | } |
c12172d2 AS |
1479 | } |
1480 | strbuf_release(&msgbuf); | |
1481 | ||
1482 | return shown; | |
1483 | } | |
1484 | ||
660e113c JK |
1485 | static void graph_show_strbuf(struct git_graph *graph, |
1486 | FILE *file, | |
1487 | struct strbuf const *sb) | |
c12172d2 AS |
1488 | { |
1489 | char *p; | |
1490 | ||
c12172d2 AS |
1491 | /* |
1492 | * Print the strbuf line by line, | |
1493 | * and display the graph info before each line but the first. | |
1494 | */ | |
1495 | p = sb->buf; | |
1496 | while (p) { | |
1497 | size_t len; | |
1498 | char *next_p = strchr(p, '\n'); | |
1499 | if (next_p) { | |
1500 | next_p++; | |
1501 | len = next_p - p; | |
1502 | } else { | |
1503 | len = (sb->buf + sb->len) - p; | |
1504 | } | |
660e113c | 1505 | fwrite(p, sizeof(char), len, file); |
c12172d2 AS |
1506 | if (next_p && *next_p != '\0') |
1507 | graph_show_oneline(graph); | |
1508 | p = next_p; | |
1509 | } | |
1510 | } | |
1511 | ||
1512 | void graph_show_commit_msg(struct git_graph *graph, | |
660e113c | 1513 | FILE *file, |
c12172d2 AS |
1514 | struct strbuf const *sb) |
1515 | { | |
1516 | int newline_terminated; | |
1517 | ||
c12172d2 AS |
1518 | /* |
1519 | * Show the commit message | |
1520 | */ | |
660e113c JK |
1521 | graph_show_strbuf(graph, file, sb); |
1522 | ||
1523 | if (!graph) | |
1524 | return; | |
1525 | ||
1526 | newline_terminated = (sb->len && sb->buf[sb->len - 1] == '\n'); | |
c12172d2 AS |
1527 | |
1528 | /* | |
1529 | * If there is more output needed for this commit, show it now | |
1530 | */ | |
1531 | if (!graph_is_commit_finished(graph)) { | |
1532 | /* | |
1533 | * If sb doesn't have a terminating newline, print one now, | |
1534 | * so we can start the remainder of the graph output on a | |
1535 | * new line. | |
1536 | */ | |
1537 | if (!newline_terminated) | |
660e113c | 1538 | putc('\n', file); |
c12172d2 AS |
1539 | |
1540 | graph_show_remainder(graph); | |
1541 | ||
1542 | /* | |
1543 | * If sb ends with a newline, our output should too. | |
1544 | */ | |
1545 | if (newline_terminated) | |
660e113c | 1546 | putc('\n', file); |
c12172d2 AS |
1547 | } |
1548 | } |