##// END OF EJS Templates
bdiff: rewrap function prototypes per clang-format...
Augie Fackler -
r34632:4dea82ee default
parent child Browse files
Show More
@@ -84,7 +84,7 b' static inline int cmp(struct bdiff_line '
84 }
84 }
85
85
86 static int equatelines(struct bdiff_line *a, int an, struct bdiff_line *b,
86 static int equatelines(struct bdiff_line *a, int an, struct bdiff_line *b,
87 int bn)
87 int bn)
88 {
88 {
89 int i, j, buckets = 1, t, scale;
89 int i, j, buckets = 1, t, scale;
90 struct pos *h = NULL;
90 struct pos *h = NULL;
@@ -150,8 +150,8 b' static int equatelines(struct bdiff_line'
150 }
150 }
151
151
152 static int longest_match(struct bdiff_line *a, struct bdiff_line *b,
152 static int longest_match(struct bdiff_line *a, struct bdiff_line *b,
153 struct pos *pos,
153 struct pos *pos, int a1, int a2, int b1, int b2,
154 int a1, int a2, int b1, int b2, int *omi, int *omj)
154 int *omi, int *omj)
155 {
155 {
156 int mi = a1, mj = b1, mk = 0, i, j, k, half, bhalf;
156 int mi = a1, mj = b1, mk = 0, i, j, k, half, bhalf;
157
157
@@ -222,8 +222,8 b' static int longest_match(struct bdiff_li'
222 }
222 }
223
223
224 static struct bdiff_hunk *recurse(struct bdiff_line *a, struct bdiff_line *b,
224 static struct bdiff_hunk *recurse(struct bdiff_line *a, struct bdiff_line *b,
225 struct pos *pos,
225 struct pos *pos, int a1, int a2, int b1,
226 int a1, int a2, int b1, int b2, struct bdiff_hunk *l)
226 int b2, struct bdiff_hunk *l)
227 {
227 {
228 int i, j, k;
228 int i, j, k;
229
229
@@ -256,8 +256,8 b' static struct bdiff_hunk *recurse(struct'
256 }
256 }
257 }
257 }
258
258
259 int bdiff_diff(struct bdiff_line *a, int an, struct bdiff_line *b,
259 int bdiff_diff(struct bdiff_line *a, int an, struct bdiff_line *b, int bn,
260 int bn, struct bdiff_hunk *base)
260 struct bdiff_hunk *base)
261 {
261 {
262 struct bdiff_hunk *curr;
262 struct bdiff_hunk *curr;
263 struct pos *pos;
263 struct pos *pos;
General Comments 0
You need to be logged in to leave comments. Login now