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