Uncrustify configuration, and shorter copyright banners, plus reformat

code with uncrustify.  (Minor adjustments.)  No more arguments!

1 files changed, 22 insertions, 22 deletions

diff --git a/src/core/list.c b/src/core/list.c
index d81c6379..eb3f73d2 100644
--- a/src/core/list.c
+++ b/src/core/list.c
@@ -1,23 +1,10 @@
 /*
  * Copyright 2016 Garrett D'Amore <garrett@damore.org>
  *
- * Permission is hereby granted, free of charge, to any person obtaining a copy
- * of this software and associated documentation files (the "Software"),
- * to deal in the Software without restriction, including without limitation
- * the rights to use, copy, modify, merge, publish, distribute, sublicense,
- * and/or sell copies of the Software, and to permit persons to whom
- * the Software is furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included
- * in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
- * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
- * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
- * IN THE SOFTWARE.
+ * This software is supplied under the terms of the MIT License, a
+ * copy of which should be located in the distribution where this
+ * file was obtained (LICENSE.txt).  A copy of the license may also be
+ * found online at https://opensource.org/licenses/MIT.
  */
 
 #include <stdlib.h>
@@ -30,10 +17,10 @@
  * Using pointer arithmetic, we can operate as a list of "anything".
  */
 
-#define	NODE(list, item)	\
-	(nni_list_node_t *)(void *)(((char *)item) + list->ll_offset)
-#define	ITEM(list, node)	\
-	(void *)(((char *)node) - list->ll_offset)
+#define NODE(list, item) \
+	(nni_list_node_t *) (void *) (((char *) item) + list->ll_offset)
+#define ITEM(list, node) \
+	(void *) (((char *) node) - list->ll_offset)
 
 void
 nni_list_init_offset(nni_list_t *list, size_t offset)
@@ -43,26 +30,31 @@ nni_list_init_offset(nni_list_t *list, size_t offset)
 	list->ll_head.ln_prev = &list->ll_head;
 }
 
+
 void *
 nni_list_first(nni_list_t *list)
 {
 	nni_list_node_t *node = list->ll_head.ln_next;
+
 	if (node == &list->ll_head) {
 		return (NULL);
 	}
 	return (ITEM(list, node));
 }
 
+
 void *
 nni_list_last(nni_list_t *list)
 {
 	nni_list_node_t *node = list->ll_head.ln_prev;
+
 	if (node == &list->ll_head) {
 		return (NULL);
 	}
 	return (ITEM(list, node));
 }
 
+
 void
 nni_list_append(nni_list_t *list, void *item)
 {
@@ -73,6 +65,8 @@ nni_list_append(nni_list_t *list, void *item)
 	node->ln_next->ln_prev = node;
 	node->ln_prev->ln_next = node;
 }
+
+
 void
 nni_list_prepend(nni_list_t *list, void *item)
 {
@@ -84,6 +78,7 @@ nni_list_prepend(nni_list_t *list, void *item)
 	node->ln_prev->ln_next = node;
 }
 
+
 void *
 nni_list_next(nni_list_t *list, void *item)
 {
@@ -95,6 +90,7 @@ nni_list_next(nni_list_t *list, void *item)
 	return (ITEM(list, node));
 }
 
+
 void *
 nni_list_prev(nni_list_t *list, void *item)
 {
@@ -106,17 +102,21 @@ nni_list_prev(nni_list_t *list, void *item)
 	return (ITEM(list, node));
 }
 
+
 void
 nni_list_remove(nni_list_t *list, void *item)
 {
 	nni_list_node_t *node = NODE(list, item);
+
 	node->ln_prev->ln_next = node->ln_next;
 	node->ln_next->ln_prev = node->ln_prev;
 }
 
+
 void
 nni_list_node_init(nni_list_t *list, void *item)
 {
-	nni_list_node_t	*node = NODE(list, item);
+	nni_list_node_t *node = NODE(list, item);
+
 	node->ln_prev = node->ln_next = NULL;
 }