From: Reginald Kennedy <rk@rejii.com>
Date: Thu, 21 May 2015 01:45:39 +0000 (+0800)
Subject: Cleanup osx/queue.h whitespace.
X-Git-Tag: SPECTRWM_2_7_0~1
X-Git-Url: https://code.delx.au/spectrwm/commitdiff_plain/c7b39bacf2e06740f597dce307549813d2a9c17c

Cleanup osx/queue.h whitespace.

Remove TAILQ_END from osx/osx.h since it is in osx/queue.h.
---

diff --git a/osx/osx.h b/osx/osx.h
index ef10f15..c5786d9 100644
--- a/osx/osx.h
+++ b/osx/osx.h
@@ -1,5 +1 @@
 long long strtonum(const char *, long long, long long, const char **);
-
-#ifndef TAILQ_END
-#define	TAILQ_END(head)			NULL
-#endif
diff --git a/osx/queue.h b/osx/queue.h
index 1db784f..567177c 100644
--- a/osx/queue.h
+++ b/osx/queue.h
@@ -36,7 +36,7 @@
 #define	_SYS_QUEUE_H_
 
 /*
- * This file defines five types of data structures: singly-linked lists, 
+ * This file defines five types of data structures: singly-linked lists,
  * lists, simple queues, tail queues, and circular queues.
  *
  *
@@ -95,15 +95,15 @@
 struct name {								\
 	struct type *slh_first;	/* first element */			\
 }
- 
+
 #define	SLIST_HEAD_INITIALIZER(head)					\
 	{ NULL }
- 
+
 #define SLIST_ENTRY(type)						\
 struct {								\
 	struct type *sle_next;	/* next element */			\
 }
- 
+
 /*
  * Singly-linked List access methods.
  */
@@ -411,7 +411,7 @@ struct {								\
 		    XSIMPLEQ_XOR(head, &(elm)->field.sqx_next);		\
 } while (0)
 
-		    
+
 /*
  * Tail queue definitions.
  */
@@ -430,8 +430,8 @@ struct {								\
 	struct type **tqe_prev;	/* address of previous next element */	\
 }
 
-/* 
- * tail queue access methods 
+/*
+ * tail queue access methods
  */
 #define	TAILQ_FIRST(head)		((head)->tqh_first)
 #define	TAILQ_END(head)			NULL
@@ -568,7 +568,7 @@ struct {								\
 }
 
 /*
- * Circular queue access methods 
+ * Circular queue access methods
  */
 #define	CIRCLEQ_FIRST(head)		((head)->cqh_first)
 #define	CIRCLEQ_LAST(head)		((head)->cqh_last)