|
@@ -45,7 +45,7 @@
|
|
|
* the insertion of new nodes. There are no nodes with duplicate
|
|
|
* priorites on the list.
|
|
|
*
|
|
|
- * The nodes on the node_list is ordered by priority and can contain
|
|
|
+ * The nodes on the node_list are ordered by priority and can contain
|
|
|
* entries which have the same priority. Those entries are ordered
|
|
|
* FIFO
|
|
|
*
|
|
@@ -265,7 +265,7 @@ static inline int plist_node_empty(const struct plist_node *node)
|
|
|
*
|
|
|
* Assumes the plist is _not_ empty.
|
|
|
*/
|
|
|
-static inline struct plist_node* plist_first(const struct plist_head *head)
|
|
|
+static inline struct plist_node *plist_first(const struct plist_head *head)
|
|
|
{
|
|
|
return list_entry(head->node_list.next,
|
|
|
struct plist_node, plist.node_list);
|