21 	struct list_head *pos, *pre, *head;  in input_mapper_add()  local
24 	head = mappers;  in input_mapper_add()
26 	if (list_empty(head)) {  in input_mapper_add()
29 		list_add(&entry->list, head);  in input_mapper_add()
33 	list_for_each(pos, head) {  in input_mapper_add()
41 	if (pos != head) {  in input_mapper_add()
43 		if (pre == head)  in input_mapper_add()
44 			pre = head->prev;  in input_mapper_add()
48 		pre = head->prev;  in input_mapper_add()
49 		pos = head->next;  in input_mapper_add()
50 		list_add_tail(&entry->list, head);  in input_mapper_add()
67 	struct list_head *next, *pre, *head;  in input_mapper_delete()  local
70 	head = mappers;  in input_mapper_delete()
72 	if (list_empty(head))  in input_mapper_delete()
75 	pre = (entry->list.prev == head) ? head->prev : entry->list.prev;  in input_mapper_delete()
76 	next = (entry->list.next == head) ? head->next : entry->list.next;  in input_mapper_delete()
96 void free_input_mapper_list(struct list_head *head)  in free_input_mapper_list()  argument
101 	while (!list_empty(head)) {  in free_input_mapper_list()
102 		pos = head->next;  in free_input_mapper_list()