Lines Matching defs:entry
18 int input_mapper_add(struct list_head *mappers, struct imapper *entry,
27 entry->next = entry->addr;
28 map_op(data, entry);
29 list_add(&entry->list, head);
35 if (pos_ent->slot > entry->slot) {
46 __list_add(&entry->list, pos->prev, pos);
50 list_add_tail(&entry->list, head);
56 entry->next = pos_ent->addr;
57 map_op(data, entry);
58 pre_ent->next = entry->addr;
64 int input_mapper_delete(struct list_head *mappers, struct imapper *entry,
75 pre = (entry->list.prev == head) ? head->prev : entry->list.prev;
76 next = (entry->list.next == head) ? head->next : entry->list.next;
78 if (pre == &entry->list) {
79 /* entry is the only one node in mappers list */
80 entry->next = entry->addr = entry->user = entry->slot = 0;
81 map_op(data, entry);
82 list_del(&entry->list);
91 list_del(&entry->list);
98 struct imapper *entry;
104 entry = list_entry(pos, struct imapper, list);
105 kfree(entry);