aboutsummaryrefslogtreecommitdiffstats
path: root/include/linux/plist.h
diff options
context:
space:
mode:
authorJohn Kacur <jkacur@redhat.com>2010-01-11 15:21:06 -0500
committerIngo Molnar <mingo@elte.hu>2010-01-13 04:51:39 -0500
commit9ca94d7c016130f9ed77f142424ace9c19742809 (patch)
tree5567265cb65caa4f2b8a0c96aee509fcf6fb2eed /include/linux/plist.h
parent7284ce6c9f6153d1777df5f310c959724d1bd446 (diff)
plist: Fix grammar mistake, and c-style mistake
Signed-off-by: John Kacur <jkacur@redhat.com> Acked-by: Peter Zijlstra <peterz@infradead.org> LKML-Reference: <1263241267-25204-2-git-send-email-jkacur@redhat.com> Signed-off-by: Ingo Molnar <mingo@elte.hu>
Diffstat (limited to 'include/linux/plist.h')
-rw-r--r--include/linux/plist.h4
1 files changed, 2 insertions, 2 deletions
diff --git a/include/linux/plist.h b/include/linux/plist.h
index 8227f717c70f..6898985e7b38 100644
--- a/include/linux/plist.h
+++ b/include/linux/plist.h
@@ -45,7 +45,7 @@
45 * the insertion of new nodes. There are no nodes with duplicate 45 * the insertion of new nodes. There are no nodes with duplicate
46 * priorites on the list. 46 * priorites on the list.
47 * 47 *
48 * The nodes on the node_list is ordered by priority and can contain 48 * The nodes on the node_list are ordered by priority and can contain
49 * entries which have the same priority. Those entries are ordered 49 * entries which have the same priority. Those entries are ordered
50 * FIFO 50 * FIFO
51 * 51 *
@@ -265,7 +265,7 @@ static inline int plist_node_empty(const struct plist_node *node)
265 * 265 *
266 * Assumes the plist is _not_ empty. 266 * Assumes the plist is _not_ empty.
267 */ 267 */
268static inline struct plist_node* plist_first(const struct plist_head *head) 268static inline struct plist_node *plist_first(const struct plist_head *head)
269{ 269{
270 return list_entry(head->node_list.next, 270 return list_entry(head->node_list.next,
271 struct plist_node, plist.node_list); 271 struct plist_node, plist.node_list);