commit 849134a9af8cda92f6f30bac783cc2db5e02866d
parent acda95e0e4166e8ab3cfa6a4924e729e2747e70e
Author: Kyle Milz <krwmilz@gmail.com>
Date:   Sat, 11 Mar 2023 19:53:06 +0000
remove extra newlines
Diffstat:
| M | util.c | | | 20 | -------------------- | 
1 file changed, 0 insertions(+), 20 deletions(-)
diff --git a/util.c b/util.c
@@ -47,7 +47,6 @@ NOTE:
 /*
  *	Either (re)allocate storage or fail with explanation.
  */
-
 void *
 xmalloc(size_t size)
 {
@@ -58,7 +57,6 @@ xmalloc(size_t size)
 	return mem;
 }
 
-
 void *
 xrealloc(void *where, size_t size)
 {
@@ -69,11 +67,9 @@ xrealloc(void *where, size_t size)
 	return mem;
 }
 
-
 /*
  *	Allocate a new string.
  */
-
 char *
 xstrdup(const char *str)
 {
@@ -84,11 +80,9 @@ xstrdup(const char *str)
 	return new;
 }
 
-
 /*
  *	Allocate a new string.  The second argument is the length.
  */
-
 char *
 xmemdup(const char *str, size_t len)
 {
@@ -99,11 +93,9 @@ xmemdup(const char *str, size_t len)
 	return new;
 }
 
-
 /*
  *	Expand the matrix *ffline to at least the given size.
  */
-
 void
 expandline(size_t n)
 {
@@ -113,11 +105,9 @@ expandline(size_t n)
 	ffline_len = newlen;
 }
 
-
 /*
  *	Allocate bitmap for given font and character
  */
-
 void
 alloc_bitmap(struct bitmap *bitmap)
 {
@@ -129,11 +119,9 @@ alloc_bitmap(struct bitmap *bitmap)
 	bitmap->bits = xmalloc(size != 0 ? size : 1);
 }
 
-
 /*
  *	Open a file in the given mode.
  */
-
 FILE *
 xfopen(const char *filename, const char *type)
 {
@@ -147,12 +135,10 @@ xfopen(const char *filename, const char *type)
 	return f;
 }
 
-
 /*
  *	Perform tilde expansion, updating the character pointer unless the
  *	user was not found.
  */
-
 const	struct passwd *
 ff_getpw(const char **pp, const char *p_end)
 {
@@ -194,14 +180,12 @@ ff_getpw(const char **pp, const char *p_end)
 	}
 }
 
-
 /*
  *
  *      Read size bytes from the FILE fp, constructing them into a
  *      signed/unsigned integer.
  *
  */
-
 unsigned long
 num(FILE *fp, int size)
 {
@@ -223,14 +207,11 @@ snum(FILE *fp, int size)
 	return x;
 }
 
-
-
 /*
  *	General AVL tree mechanism.  Search for a node, and return it if found.
  *	Otherwise insert a node.
  *	This uses the AVL algorithm from Knuth Vol. 3.
  */
-
 struct avl *
 avladd(const char *key, size_t key_len, struct avl **headp, size_t size)
 {
@@ -360,7 +341,6 @@ avladd(const char *key, size_t key_len, struct avl **headp, size_t size)
  *	Prepare the file descriptor to generate SIGPOLL/SIGIO events.
  *	If called with a True argument, set it up for non-blocking I/O.
  */
-
 void
 prep_fd(int fd, Boolean noblock)
 {