X-Git-Url: https://git.proxmox.com/?a=blobdiff_plain;f=include%2Flinux%2Flist_compat.h;h=fece8ad345d985c3734baa34291480ab2f42e4af;hb=ce319db57b1662a21d60550e546592c96c3da7a1;hp=26d5dfe072abe8082c78dd396ef63ea544322e9b;hpb=716154c5926eb391eb8178203496430ffa7ebed8;p=mirror_spl.git

diff --git a/include/linux/list_compat.h b/include/linux/list_compat.h
index 26d5dfe..fece8ad 100644
--- a/include/linux/list_compat.h
+++ b/include/linux/list_compat.h
@@ -1,4 +1,4 @@
-/*****************************************************************************\
+/*
  *  Copyright (C) 2007-2010 Lawrence Livermore National Security, LLC.
  *  Copyright (C) 2007 The Regents of the University of California.
  *  Produced at Lawrence Livermore National Laboratory (cf, DISCLAIMER).
@@ -6,7 +6,7 @@
  *  UCRL-CODE-235197
  *
  *  This file is part of the SPL, Solaris Porting Layer.
- *  For details, see <http://github.com/behlendorf/spl/>.
+ *  For details, see <http://zfsonlinux.org/>.
  *
  *  The SPL is free software; you can redistribute it and/or modify it
  *  under the terms of the GNU General Public License as published by the
@@ -20,32 +20,31 @@
  *
  *  You should have received a copy of the GNU General Public License along
  *  with the SPL.  If not, see <http://www.gnu.org/licenses/>.
-\*****************************************************************************/
+ */
 
 #ifndef _SPL_LIST_COMPAT_H
-#define _SPL_LIST_COMPAT_H
+#define	_SPL_LIST_COMPAT_H
 
 #include <linux/list.h>
 
 #ifndef list_for_each_entry_safe_reverse
 
-/**
+/*
  * list_for_each_entry_safe_reverse
- * @pos:        the type * to use as a loop cursor.
- * @n:          another type * to use as temporary storage
- * @head:       the head for your list.
- * @member:     the name of the list_struct within the struct.
+ * @pos:	the type * to use as a loop cursor.
+ * @n:		another type * to use as temporary storage
+ * @head:	the head for your list.
+ * @member:	the name of the list_struct within the struct.
  *
  * Iterate backwards over list of given type, safe against removal
  * of list entry.
  */
-#define list_for_each_entry_safe_reverse(pos, n, head, member)          \
-        for (pos = list_entry((head)->prev, typeof(*pos), member),      \
-                n = list_entry(pos->member.prev, typeof(*pos), member); \
-             &pos->member != (head);                                    \
-             pos = n, n = list_entry(n->member.prev, typeof(*n), member))
+#define	list_for_each_entry_safe_reverse(pos, n, head, member)		\
+	for (pos = list_entry((head)->prev, typeof(*pos), member),	\
+	    n = list_entry(pos->member.prev, typeof(*pos), member); 	\
+	    &pos->member != (head);					\
+	    pos = n, n = list_entry(n->member.prev, typeof(*n), member))
 
 #endif /* list_for_each_entry_safe_reverse */
 
 #endif /* SPL_LIST_COMPAT_H */
-