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