Lines Matching defs:head
98 static void delete_list(struct list_head *head)
102 while (!list_empty(head)) {
103 n = list_first_entry(head, struct wakeup_irq_node, siblings);
109 static bool add_sibling_node_sorted(struct list_head *head, int irq)
112 struct list_head *predecessor = head;
114 if (unlikely(WARN_ON(!head)))
117 if (!list_empty(head))
118 list_for_each_entry(n, head, siblings) {
136 static struct wakeup_irq_node *find_node_in_list(struct list_head *head,
141 if (unlikely(WARN_ON(!head)))
144 list_for_each_entry(n, head, siblings)