[<prev] [next>] [thread-next>] [day] [month] [year] [list]
Message-Id: <20170911203705.10415-1-armetallica@gmail.com>
Date: Mon, 11 Sep 2017 22:37:05 +0200
From: ArminSchoenlieb <armetallica@...il.com>
To: gregkh@...uxfoundation.org
Cc: devel@...verdev.osuosl.org, linux-kernel@...r.kernel.org,
Armin Schoenlieb <armetallica@...il.com>
Subject: [PATCH] Staging: irda: net: fix coding style issues in irqueue.h
From: Armin Schoenlieb <armetallica@...il.com>
This is a patch to the irqueue.h file that fixes up pointer style errors and
trailing whitespace errors, found by the checkpatch.pl tool
Signed-off-by: Armin Schoenlieb <armetallica@...il.com>
---
drivers/staging/irda/include/net/irda/irqueue.h | 46 ++++++++++++-------------
1 file changed, 23 insertions(+), 23 deletions(-)
diff --git a/drivers/staging/irda/include/net/irda/irqueue.h b/drivers/staging/irda/include/net/irda/irqueue.h
index 37f512bd6733..1e7660888e39 100644
--- a/drivers/staging/irda/include/net/irda/irqueue.h
+++ b/drivers/staging/irda/include/net/irda/irqueue.h
@@ -1,5 +1,5 @@
/*********************************************************************
- *
+ *
* Filename: irqueue.h
* Version: 0.3
* Description: General queue implementation
@@ -8,23 +8,23 @@
* Created at: Tue Jun 9 13:26:50 1998
* Modified at: Thu Oct 7 13:25:16 1999
* Modified by: Dag Brattli <dagb@...uit.no>
- *
+ *
* Copyright (C) 1998-1999, Aage Kvalnes <aage@...uit.no>
* Copyright (c) 1998, Dag Brattli
* All Rights Reserved.
- *
+ *
* This code is taken from the Vortex Operating System written by Aage
* Kvalnes and has been ported to Linux and Linux/IR by Dag Brattli
*
- * This program is free software; you can redistribute it and/or
- * modify it under the terms of the GNU General Public License as
- * published by the Free Software Foundation; either version 2 of
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of
* the License, or (at your option) any later version.
- *
+ *
* Neither Dag Brattli nor University of Tromsø admit liability nor
- * provide warranty for any of this software. This material is
+ * provide warranty for any of this software. This material is
* provided "AS-IS" and at no charge.
- *
+ *
********************************************************************/
#include <linux/types.h>
@@ -48,7 +48,7 @@
#define HASHBIN_SIZE 8
#define HASHBIN_MASK 0x7
-#ifndef IRDA_ALIGN
+#ifndef IRDA_ALIGN
#define IRDA_ALIGN __attribute__((aligned))
#endif
@@ -71,23 +71,23 @@ typedef struct hashbin_t {
int hb_size;
spinlock_t hb_spinlock; /* HB_LOCK - Can be used by the user */
- irda_queue_t* hb_queue[HASHBIN_SIZE] IRDA_ALIGN;
+ irda_queue_t *hb_queue[HASHBIN_SIZE] IRDA_ALIGN;
- irda_queue_t* hb_current;
+ irda_queue_t *hb_current;
} hashbin_t;
hashbin_t *hashbin_new(int type);
-int hashbin_delete(hashbin_t* hashbin, FREE_FUNC func);
-int hashbin_clear(hashbin_t* hashbin, FREE_FUNC free_func);
-void hashbin_insert(hashbin_t* hashbin, irda_queue_t* entry, long hashv,
- const char* name);
-void* hashbin_remove(hashbin_t* hashbin, long hashv, const char* name);
-void* hashbin_remove_first(hashbin_t *hashbin);
-void* hashbin_remove_this( hashbin_t* hashbin, irda_queue_t* entry);
-void* hashbin_find(hashbin_t* hashbin, long hashv, const char* name);
-void* hashbin_lock_find(hashbin_t* hashbin, long hashv, const char* name);
-void* hashbin_find_next(hashbin_t* hashbin, long hashv, const char* name,
- void ** pnext);
+int hashbin_delete(hashbin_t *hashbin, FREE_FUNC func);
+int hashbin_clear(hashbin_t *hashbin, FREE_FUNC free_func);
+void hashbin_insert(hashbin_t *hashbin, irda_queue_t *entry, long hashv,
+ const char *name);
+void *hashbin_remove(hashbin_t *hashbin, long hashv, const char *name);
+void *hashbin_remove_first(hashbin_t *hashbin);
+void *hashbin_remove_this(hashbin_t *hashbin, irda_queue_t *entry);
+void *hashbin_find(hashbin_t *hashbin, long hashv, const char *name);
+void *hashbin_lock_find(hashbin_t *hashbin, long hashv, const char *name);
+void *hashbin_find_next(hashbin_t *hashbin, long hashv, const char *name,
+ void **pnext);
irda_queue_t *hashbin_get_first(hashbin_t *hashbin);
irda_queue_t *hashbin_get_next(hashbin_t *hashbin);
--
2.11.0
Powered by blists - more mailing lists