plist_del(node, head);
- /* After plist_del(), iter is the replacement of node
- * , if node was on prio_list, then take shortcut to
- * find node_next instead of looping.
+ /*
+ * After plist_del(), iter is the replacement of the node. If the node
+ * was on prio_list, take shortcut to find node_next instead of looping.
*/
if (!list_empty(&iter->prio_list)) {
- iter = list_entry(iter->prio_list.next, struct plist_node, prio_list);
+ iter = list_entry(iter->prio_list.next, struct plist_node,
+ prio_list);
node_next = &iter->node_list;
goto queue;
}