projects
/
tinc
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Fix subnet-up/down scripts being called with an empty SUBNET.
[tinc]
/
lib
/
list.c
diff --git
a/lib/list.c
b/lib/list.c
index
bf52280
..
a26c58d
100644
(file)
--- a/
lib/list.c
+++ b/
lib/list.c
@@
-25,8
+25,7
@@
/* (De)constructors */
/* (De)constructors */
-list_t *list_alloc(list_action_t delete)
-{
+list_t *list_alloc(list_action_t delete) {
list_t *list;
list = xmalloc_and_zero(sizeof(list_t));
list_t *list;
list = xmalloc_and_zero(sizeof(list_t));
@@
-35,18
+34,15
@@
list_t *list_alloc(list_action_t delete)
return list;
}
return list;
}
-void list_free(list_t *list)
-{
+void list_free(list_t *list) {
free(list);
}
free(list);
}
-list_node_t *list_alloc_node(void)
-{
+list_node_t *list_alloc_node(void) {
return xmalloc_and_zero(sizeof(list_node_t));
}
return xmalloc_and_zero(sizeof(list_node_t));
}
-void list_free_node(list_t *list, list_node_t *node)
-{
+void list_free_node(list_t *list, list_node_t *node) {
if(node->data && list->delete)
list->delete(node->data);
if(node->data && list->delete)
list->delete(node->data);
@@
-55,8
+51,7
@@
void list_free_node(list_t *list, list_node_t *node)
/* Insertion and deletion */
/* Insertion and deletion */
-list_node_t *list_insert_head(list_t *list, void *data)
-{
+list_node_t *list_insert_head(list_t *list, void *data) {
list_node_t *node;
node = list_alloc_node();
list_node_t *node;
node = list_alloc_node();
@@
-76,8
+71,7
@@
list_node_t *list_insert_head(list_t *list, void *data)
return node;
}
return node;
}
-list_node_t *list_insert_tail(list_t *list, void *data)
-{
+list_node_t *list_insert_tail(list_t *list, void *data) {
list_node_t *node;
node = list_alloc_node();
list_node_t *node;
node = list_alloc_node();
@@
-97,8
+91,7
@@
list_node_t *list_insert_tail(list_t *list, void *data)
return node;
}
return node;
}
-void list_unlink_node(list_t *list, list_node_t *node)
-{
+void list_unlink_node(list_t *list, list_node_t *node) {
if(node->prev)
node->prev->next = node->next;
else
if(node->prev)
node->prev->next = node->next;
else
@@
-112,34
+105,29
@@
void list_unlink_node(list_t *list, list_node_t *node)
list->count--;
}
list->count--;
}
-void list_delete_node(list_t *list, list_node_t *node)
-{
+void list_delete_node(list_t *list, list_node_t *node) {
list_unlink_node(list, node);
list_free_node(list, node);
}
list_unlink_node(list, node);
list_free_node(list, node);
}
-void list_delete_head(list_t *list)
-{
+void list_delete_head(list_t *list) {
list_delete_node(list, list->head);
}
list_delete_node(list, list->head);
}
-void list_delete_tail(list_t *list)
-{
+void list_delete_tail(list_t *list) {
list_delete_node(list, list->tail);
}
/* Head/tail lookup */
list_delete_node(list, list->tail);
}
/* Head/tail lookup */
-void *list_get_head(list_t *list)
-{
+void *list_get_head(list_t *list) {
if(list->head)
return list->head->data;
else
return NULL;
}
if(list->head)
return list->head->data;
else
return NULL;
}
-void *list_get_tail(list_t *list)
-{
+void *list_get_tail(list_t *list) {
if(list->tail)
return list->tail->data;
else
if(list->tail)
return list->tail->data;
else
@@
-148,8
+136,7
@@
void *list_get_tail(list_t *list)
/* Fast list deletion */
/* Fast list deletion */
-void list_delete_list(list_t *list)
-{
+void list_delete_list(list_t *list) {
list_node_t *node, *next;
for(node = list->head; node; node = next) {
list_node_t *node, *next;
for(node = list->head; node; node = next) {
@@
-162,8
+149,7
@@
void list_delete_list(list_t *list)
/* Traversing */
/* Traversing */
-void list_foreach_node(list_t *list, list_action_node_t action)
-{
+void list_foreach_node(list_t *list, list_action_node_t action) {
list_node_t *node, *next;
for(node = list->head; node; node = next) {
list_node_t *node, *next;
for(node = list->head; node; node = next) {
@@
-172,8
+158,7
@@
void list_foreach_node(list_t *list, list_action_node_t action)
}
}
}
}
-void list_foreach(list_t *list, list_action_t action)
-{
+void list_foreach(list_t *list, list_action_t action) {
list_node_t *node, *next;
for(node = list->head; node; node = next) {
list_node_t *node, *next;
for(node = list->head; node; node = next) {