# HG changeset patch
# User Augie Fackler <augie@google.com>
# Date 1507128685 14400
# Node ID 4dea82ee7945087443fd3f0958a5115ae7265780
# Parent  38463bd96d21e17d36563ab355dc48485500aec4
bdiff: rewrap function prototypes per clang-format

Differential Revision: https://phab.mercurial-scm.org/D1008

diff -r 38463bd96d21 -r 4dea82ee7945 mercurial/bdiff.c
--- a/mercurial/bdiff.c	Wed Oct 04 10:50:54 2017 -0400
+++ b/mercurial/bdiff.c	Wed Oct 04 10:51:25 2017 -0400
@@ -84,7 +84,7 @@
 }
 
 static int equatelines(struct bdiff_line *a, int an, struct bdiff_line *b,
-	int bn)
+                       int bn)
 {
 	int i, j, buckets = 1, t, scale;
 	struct pos *h = NULL;
@@ -150,8 +150,8 @@
 }
 
 static int longest_match(struct bdiff_line *a, struct bdiff_line *b,
-			struct pos *pos,
-			 int a1, int a2, int b1, int b2, int *omi, int *omj)
+                         struct pos *pos, int a1, int a2, int b1, int b2,
+                         int *omi, int *omj)
 {
 	int mi = a1, mj = b1, mk = 0, i, j, k, half, bhalf;
 
@@ -222,8 +222,8 @@
 }
 
 static struct bdiff_hunk *recurse(struct bdiff_line *a, struct bdiff_line *b,
-				struct pos *pos,
-			    int a1, int a2, int b1, int b2, struct bdiff_hunk *l)
+                                  struct pos *pos, int a1, int a2, int b1,
+                                  int b2, struct bdiff_hunk *l)
 {
 	int i, j, k;
 
@@ -256,8 +256,8 @@
 	}
 }
 
-int bdiff_diff(struct bdiff_line *a, int an, struct bdiff_line *b,
-		int bn, struct bdiff_hunk *base)
+int bdiff_diff(struct bdiff_line *a, int an, struct bdiff_line *b, int bn,
+               struct bdiff_hunk *base)
 {
 	struct bdiff_hunk *curr;
 	struct pos *pos;