Vadim Yanitskiy has uploaded this change for review. ( 
https://gerrit.osmocom.org/13399


Change subject: core/linuxlist.h: fix white-space and inconsistent alignment
......................................................................

core/linuxlist.h: fix white-space and inconsistent alignment

  - fix trailing white-space;
  - properly align parameters of functions;
  - use tabs instead of 8 spaces where possible.

Change-Id: Iaf616592a6bd72a1e7e94d8c55475710868beef0
---
M include/osmocom/core/linuxlist.h
1 file changed, 18 insertions(+), 18 deletions(-)



  git pull ssh://gerrit.osmocom.org:29418/libosmocore refs/changes/99/13399/1

diff --git a/include/osmocom/core/linuxlist.h b/include/osmocom/core/linuxlist.h
index 6d263a4..68cc00f 100644
--- a/include/osmocom/core/linuxlist.h
+++ b/include/osmocom/core/linuxlist.h
@@ -29,8 +29,8 @@
  *  \param[in] member the name of the member within the struct.
  */
 #define container_of(ptr, type, member) ({                     \
-        const typeof( ((type *)0)->member ) *__mptr = (ptr);   \
-        (type *)( (char *)__mptr - offsetof(type, member) );})
+       const typeof( ((type *)0)->member ) *__mptr = (ptr);    \
+       (type *)( (char *)__mptr - offsetof(type, member) );})


 /*!
@@ -72,8 +72,8 @@
  * the prev/next entries already!
  */
 static inline void __llist_add(struct llist_head *_new,
-                             struct llist_head *prev,
-                             struct llist_head *next)
+                              struct llist_head *prev,
+                              struct llist_head *next)
 {
        next->prev = _new;
        _new->next = next;
@@ -146,8 +146,8 @@
  */
 static inline void llist_move(struct llist_head *llist, struct llist_head 
*head)
 {
-        __llist_del(llist->prev, llist->next);
-        llist_add(llist, head);
+       __llist_del(llist->prev, llist->next);
+       llist_add(llist, head);
 }

 /*! Delete from one llist and add as another's tail.
@@ -155,10 +155,10 @@
  *  \param head  the head that will follow our entry.
  */
 static inline void llist_move_tail(struct llist_head *llist,
-                                 struct llist_head *head)
+                                  struct llist_head *head)
 {
-        __llist_del(llist->prev, llist->next);
-        llist_add_tail(llist, head);
+       __llist_del(llist->prev, llist->next);
+       llist_add_tail(llist, head);
 }

 /*! Test whether a linked list is empty.
@@ -171,7 +171,7 @@
 }

 static inline void __llist_splice(struct llist_head *llist,
-                                struct llist_head *head)
+                                 struct llist_head *head)
 {
        struct llist_head *first = llist->next;
        struct llist_head *last = llist->prev;
@@ -201,7 +201,7 @@
  * The llist is reinitialised.
  */
 static inline void llist_splice_init(struct llist_head *llist,
-                                   struct llist_head *head)
+                                    struct llist_head *head)
 {
        if (!llist_empty(llist)) {
                __llist_splice(llist, head);
@@ -253,7 +253,7 @@
  */
 #define llist_for_each(pos, head) \
        for (pos = (head)->next, prefetch(pos->next); pos != (head); \
-               pos = pos->next, prefetch(pos->next))
+               pos = pos->next, prefetch(pos->next))

 /*! Iterate over a linked list (no prefetch).
  *  \param pos  the llist_head to use as a loop counter.
@@ -273,7 +273,7 @@
  */
 #define llist_for_each_prev(pos, head) \
        for (pos = (head)->prev, prefetch(pos->prev); pos != (head); \
-               pos = pos->prev, prefetch(pos->prev))
+               pos = pos->prev, prefetch(pos->prev))

 /*! Iterate over a linked list, safe against removal of llist entry.
  *  \param pos  the llist_head to use as a loop counter.
@@ -340,12 +340,12 @@
  */
 #define llist_for_each_rcu(pos, head) \
        for (pos = (head)->next, prefetch(pos->next); pos != (head); \
-               pos = pos->next, ({ smp_read_barrier_depends(); 0;}), 
prefetch(pos->next))
-
+               pos = pos->next, ({ smp_read_barrier_depends(); 0;}), 
prefetch(pos->next))
+
 #define __llist_for_each_rcu(pos, head) \
        for (pos = (head)->next; pos != (head); \
-               pos = pos->next, ({ smp_read_barrier_depends(); 0;}))
-       
+               pos = pos->next, ({ smp_read_barrier_depends(); 0;}))
+
 /*! Iterate over an rcu-protected llist, safe against removal of llist entry.
  *  \param pos  the llist_head to use as a loop counter.
  *  \param n    another llist_head to use as temporary storage.
@@ -375,7 +375,7 @@
  */
 #define llist_for_each_continue_rcu(pos, head) \
        for ((pos) = (pos)->next, prefetch((pos)->next); (pos) != (head); \
-               (pos) = (pos)->next, ({ smp_read_barrier_depends(); 0;}), 
prefetch((pos)->next))
+               (pos) = (pos)->next, ({ smp_read_barrier_depends(); 0;}), 
prefetch((pos)->next))

 /*! Count number of llist items by iterating.
  *  \param head the llist head to count items of.

--
To view, visit https://gerrit.osmocom.org/13399
To unsubscribe, or for help writing mail filters, visit 
https://gerrit.osmocom.org/settings

Gerrit-Project: libosmocore
Gerrit-Branch: master
Gerrit-MessageType: newchange
Gerrit-Change-Id: Iaf616592a6bd72a1e7e94d8c55475710868beef0
Gerrit-Change-Number: 13399
Gerrit-PatchSet: 1
Gerrit-Owner: Vadim Yanitskiy <[email protected]>

Reply via email to