Lines Matching defs:entry
22 int input_mapper_add(struct list_head *mappers, struct imapper *entry,
31 entry->next = entry->addr;
32 map_op(data, entry);
33 list_add(&entry->list, head);
39 if (pos_ent->slot > entry->slot) {
50 __list_add(&entry->list, pos->prev, pos);
54 list_add_tail(&entry->list, head);
60 entry->next = pos_ent->addr;
61 map_op(data, entry);
62 pre_ent->next = entry->addr;
68 int input_mapper_delete(struct list_head *mappers, struct imapper *entry,
79 pre = (entry->list.prev == head) ? head->prev : entry->list.prev;
80 next = (entry->list.next == head) ? head->next : entry->list.next;
82 if (pre == &entry->list) {
83 /* entry is the only one node in mappers list */
84 entry->next = entry->addr = entry->user = entry->slot = 0;
85 map_op(data, entry);
86 list_del(&entry->list);
95 list_del(&entry->list);
102 struct imapper *entry;
108 entry = list_entry(pos, struct imapper, list);
109 kfree(entry);