25 	struct list_head *pos, *pre, *head;  in input_mapper_add()  local
28 	head = mappers;  in input_mapper_add()
30 	if (list_empty(head)) {  in input_mapper_add()
33 		list_add(&entry->list, head);  in input_mapper_add()
37 	list_for_each(pos, head) {  in input_mapper_add()
45 	if (pos != head) {  in input_mapper_add()
47 		if (pre == head)  in input_mapper_add()
48 			pre = head->prev;  in input_mapper_add()
52 		pre = head->prev;  in input_mapper_add()
53 		pos = head->next;  in input_mapper_add()
54 		list_add_tail(&entry->list, head);  in input_mapper_add()
71 	struct list_head *next, *pre, *head;  in input_mapper_delete()  local
74 	head = mappers;  in input_mapper_delete()
76 	if (list_empty(head))  in input_mapper_delete()
79 	pre = (entry->list.prev == head) ? head->prev : entry->list.prev;  in input_mapper_delete()
80 	next = (entry->list.next == head) ? head->next : entry->list.next;  in input_mapper_delete()
100 void free_input_mapper_list(struct list_head *head)  in free_input_mapper_list()  argument
105 	while (!list_empty(head)) {  in free_input_mapper_list()
106 		pos = head->next;  in free_input_mapper_list()