From: Martin Pool <mbp@samba.org>
Date: Mon, 8 Apr 2002 09:05:26 +0000 (+0000)
Subject: Doc and indent only.
X-Git-Url: https://mattmccutchen.net/rsync/rsync.git/commitdiff_plain/e66dfd1879f0135fa7d5de25052627fc1686497e

Doc and indent only.
---

diff --git a/generator.c b/generator.c
index 888835f8..183138cb 100644
--- a/generator.c
+++ b/generator.c
@@ -157,56 +157,63 @@ static BOOL disable_deltas_p(void)
 }
 
 
-/*
-  generate a stream of signatures/checksums that describe a buffer
-
-  generate approximately one checksum every n bytes
-  */
-static struct sum_struct *generate_sums(struct map_struct *buf,OFF_T len,int n)
+/**
+ * Generate a stream of signatures/checksums that describe a buffer.
+ *
+ * Generate approximately one checksum every @p n bytes.
+ *
+ * @return Newly-allocated sum_struct
+ **/
+static struct sum_struct *generate_sums(struct map_struct *buf, OFF_T len,
+					int n)
 {
 	int i;
 	struct sum_struct *s;
 	int count;
 	int block_len = n;
-	int remainder = (len%block_len);
+	int remainder = (len % block_len);
 	OFF_T offset = 0;
 
-	count = (len+(block_len-1))/block_len;
+	count = (len + (block_len - 1)) / block_len;
 
-	s = (struct sum_struct *)malloc(sizeof(*s));
-	if (!s) out_of_memory("generate_sums");
+	s = (struct sum_struct *) malloc(sizeof(*s));
+	if (!s)
+		out_of_memory("generate_sums");
 
 	s->count = count;
 	s->remainder = remainder;
 	s->n = n;
 	s->flength = len;
 
-	if (count==0) {
+	if (count == 0) {
 		s->sums = NULL;
 		return s;
 	}
 
 	if (verbose > 3)
-		rprintf(FINFO,"count=%d rem=%d n=%d flength=%.0f\n",
-			s->count,s->remainder,s->n,(double)s->flength);
+		rprintf(FINFO, "count=%d rem=%d n=%d flength=%.0f\n",
+			s->count, s->remainder, s->n, (double) s->flength);
+
+	s->sums = (struct sum_buf *) malloc(sizeof(s->sums[0]) * s->count);
+	if (!s->sums)
+		out_of_memory("generate_sums");
 
-	s->sums = (struct sum_buf *)malloc(sizeof(s->sums[0])*s->count);
-	if (!s->sums) out_of_memory("generate_sums");
-  
-	for (i=0;i<count;i++) {
-		int n1 = MIN(len,n);
-		char *map = map_ptr(buf,offset,n1);
+	for (i = 0; i < count; i++) {
+		int n1 = MIN(len, n);
+		char *map = map_ptr(buf, offset, n1);
 
-		s->sums[i].sum1 = get_checksum1(map,n1);
-		get_checksum2(map,n1,s->sums[i].sum2);
+		s->sums[i].sum1 = get_checksum1(map, n1);
+		get_checksum2(map, n1, s->sums[i].sum2);
 
 		s->sums[i].offset = offset;
 		s->sums[i].len = n1;
 		s->sums[i].i = i;
 
 		if (verbose > 3)
-			rprintf(FINFO,"chunk[%d] offset=%.0f len=%d sum1=%08x\n",
-				i,(double)s->sums[i].offset,s->sums[i].len,s->sums[i].sum1);
+			rprintf(FINFO,
+				"chunk[%d] offset=%.0f len=%d sum1=%08x\n",
+				i, (double) s->sums[i].offset,
+				s->sums[i].len, s->sums[i].sum1);
 
 		len -= n1;
 		offset += n1;