@@ -112,9 +112,9 @@ struct name { \
112112 * entry to \a NULL (empty list) and recreating the embedded lock.
113113 */
114114#define RWLIST_HEAD_INIT (head ) { \
115- (head)->first = NULL; \
116- (head)->last = NULL; \
117- __bbs_rwlock_init(&(head)->lock, __FILE__, __LINE__, __func__, #head); \
115+ (head)->first = NULL; \
116+ (head)->last = NULL; \
117+ __bbs_rwlock_init(&(head)->lock, __FILE__, __LINE__, __func__, #head); \
118118}
119119
120120/*!
@@ -126,9 +126,9 @@ struct name { \
126126 * It does not free the structure from memory.
127127 */
128128#define RWLIST_HEAD_DESTROY (head ) { \
129- (head)->first = NULL; \
130- (head)->last = NULL; \
131- __bbs_rwlock_destroy(&(head)->lock, __FILE__, __LINE__, __func__, #head); \
129+ (head)->first = NULL; \
130+ (head)->last = NULL; \
131+ __bbs_rwlock_destroy(&(head)->lock, __FILE__, __LINE__, __func__, #head); \
132132}
133133
134134/*!
@@ -310,13 +310,13 @@ struct { \
310310 * temporarily (until the next RWLIST_INSERT_TAIL is performed).
311311 */
312312#define RWLIST_INSERT_TAIL (head , elm , field ) do { \
313- if (!(head)->first) { \
313+ if (!(head)->first) { \
314314 (head)->first = (elm); \
315315 (head)->last = (elm); \
316- } else { \
316+ } else { \
317317 (head)->last->field.next = (elm); \
318318 (head)->last = (elm); \
319- } \
319+ } \
320320} while (0)
321321
322322/*!
0 commit comments