2 * Copyright (c) 2020 Neels Hofmeyr <neels@hofmeyr.de>
4 * Permission to use, copy, modify, and distribute this software for any
5 * purpose with or without fee is hereby granted, provided that the above
6 * copyright notice and this permission notice appear in all copies.
8 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
9 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
10 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
11 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
12 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
13 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
14 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
22 #define print(args...) fprintf(stderr, ##args)
24 #define debug_dump dump
25 #define debug_dump_atom dump_atom
26 #define debug_dump_atoms dump_atoms
29 print_atom_byte(unsigned char c) {
34 else if ((c < 32 || c >= 127) && (c != '\t'))
41 dump_atom(const struct diff_data *left, const struct diff_data *right,
42 const struct diff_atom *atom)
49 print(" %3u", diff_atom_root_idx(left, atom));
50 if (right && atom->patience.pos_in_other)
52 diff_atom_root_idx(right, atom->patience.pos_in_other));
55 atom->patience.unique_here ? "u" : " ",
56 atom->patience.unique_in_both ? "c" : " ");
57 if (atom->at == NULL) {
58 off_t remain = atom->len;
59 if (fseek(atom->d->root->f, atom->pos, SEEK_SET) == -1)
60 abort(); /* cannot return error */
65 r = fread(buf, 1, MIN(remain, sizeof(buf)),
68 abort(); /* cannot return error */
72 for (i = 0; i < r; i++)
73 print_atom_byte(buf[i]);
77 for (s = atom->at; s < (const char*)(atom->at + atom->len); s++)
84 dump_atoms(const struct diff_data *d, struct diff_atom *atom,
88 dump_atoms(d, atom, 20);
89 print("[%u lines skipped]\n", count - 20 - 20);
90 dump_atoms(d, atom + count - 20, 20);
94 foreach_diff_atom(i, atom, count) {
95 dump_atom(d, NULL, i);
101 dump(struct diff_data *d)
103 dump_atoms(d, d->atoms.head, d->atoms.len);
106 /* kd is a quadratic space myers matrix from the original Myers algorithm.
107 * kd_forward and kd_backward are linear slices of a myers matrix from the Myers
111 dump_myers_graph(const struct diff_data *l, const struct diff_data *r,
112 int *kd, int *kd_forward, int kd_forward_d,
113 int *kd_backward, int kd_backward_d)
115 #define COLOR_YELLOW "\033[1;33m"
116 #define COLOR_GREEN "\033[1;32m"
117 #define COLOR_BLUE "\033[1;34m"
118 #define COLOR_RED "\033[1;31m"
119 #define COLOR_END "\033[0;m"
123 for (x = 0; x <= l->atoms.len; x++)
124 print("%2d", x % 100);
127 for (y = 0; y <= r->atoms.len; y++) {
129 for (x = 0; x <= l->atoms.len; x++) {
131 /* print d advancements from kd, if any. */
135 int max = l->atoms.len + r->atoms.len;
136 size_t kd_len = max + 1 + max;
139 #define xk_to_y(X, K) ((X) - (K))
140 for (di = 0; di < max; di++) {
142 for (ki = di; ki >= -di; ki -= 2) {
144 || y != xk_to_y(x, ki))
146 label = '0' + (di % 10);
147 color = COLOR_YELLOW;
155 if (kd_forward && kd_forward_d >= 0) {
156 #define xc_to_y(X, C, DELTA) ((X) - (C) + (DELTA))
158 for (ki = kd_forward_d;
161 if (x != kd_forward[ki])
163 if (y != xk_to_y(x, ki))
170 if (kd_backward && kd_backward_d >= 0) {
171 int delta = (int)r->atoms.len
174 for (ki = kd_backward_d;
175 ki >= -kd_backward_d;
177 if (x != kd_backward[ki])
179 if (y != xc_to_y(x, ki, delta))
195 print("%s", COLOR_END);
196 if (x < l->atoms.len)
200 if (y == r->atoms.len)
204 for (x = 0; x < l->atoms.len; x++) {
206 diff_atom_same(&same, &l->atoms.head[x],
218 debug_dump_myers_graph(const struct diff_data *l, const struct diff_data *r,
219 int *kd, int *kd_forward, int kd_forward_d,
220 int *kd_backward, int kd_backward_d)
222 if (l->atoms.len > 99 || r->atoms.len > 99)
224 dump_myers_graph(l, r, kd, kd_forward, kd_forward_d,
225 kd_backward, kd_backward_d);
229 #define debug(args...)
230 #define debug_dump(args...)
231 #define debug_dump_atom(args...)
232 #define debug_dump_atoms(args...)
233 #define debug_dump_myers_graph(args...)