18 int input_mapper_add(struct list_head *mappers, struct imapper *entry,  in input_mapper_add()  argument
27 		entry->next = entry->addr;  in input_mapper_add()
28 		map_op(data, entry);  in input_mapper_add()
29 		list_add(&entry->list, head);  in input_mapper_add()
35 		if (pos_ent->slot > entry->slot) {  in input_mapper_add()
46 		__list_add(&entry->list, pos->prev, pos);  in input_mapper_add()
50 		list_add_tail(&entry->list, head);  in input_mapper_add()
56 	entry->next = pos_ent->addr;  in input_mapper_add()
57 	map_op(data, entry);  in input_mapper_add()
58 	pre_ent->next = entry->addr;  in input_mapper_add()
64 int input_mapper_delete(struct list_head *mappers, struct imapper *entry,  in input_mapper_delete()  argument
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()
78 	if (pre == &entry->list) {  in input_mapper_delete()
80 		entry->next = entry->addr = entry->user = entry->slot = 0;  in input_mapper_delete()
81 		map_op(data, entry);  in input_mapper_delete()
82 		list_del(&entry->list);  in input_mapper_delete()
91 	list_del(&entry->list);  in input_mapper_delete()
98 	struct imapper *entry;  in free_input_mapper_list()  local
104 		entry = list_entry(pos, struct imapper, list);  in free_input_mapper_list()
105 		kfree(entry);  in free_input_mapper_list()