Lines Matching defs:id_map_entry
43 struct id_map_entry {
103 static struct id_map_entry *
110 struct id_map_entry *id_map_entry =
111 rb_entry(node, struct id_map_entry, node);
113 if (id_map_entry->sl_cm_id > sl_cm_id)
115 else if (id_map_entry->sl_cm_id < sl_cm_id)
117 else if (id_map_entry->slave_id > slave_id)
119 else if (id_map_entry->slave_id < slave_id)
122 return id_map_entry;
130 struct id_map_entry *ent = container_of(delay, struct id_map_entry, timeout);
131 struct id_map_entry *db_ent, *found_ent;
138 db_ent = (struct id_map_entry *)idr_find(&sriov->pv_id_table, pv_id);
156 struct id_map_entry *ent, *found_ent;
159 ent = (struct id_map_entry *)idr_find(&sriov->pv_id_table, pv_cm_id);
170 static void sl_id_map_add(struct ib_device *ibdev, struct id_map_entry *new)
174 struct id_map_entry *ent;
190 ent = rb_entry(parent, struct id_map_entry, node);
202 static struct id_map_entry *
207 struct id_map_entry *ent;
210 ent = kmalloc(sizeof (struct id_map_entry), GFP_KERNEL);
247 static struct id_map_entry *
250 struct id_map_entry *ent;
259 ent = (struct id_map_entry *)idr_find(&sriov->pv_id_table, *pv_cm_id);
265 static void schedule_delayed(struct ib_device *ibdev, struct id_map_entry *id)
284 struct id_map_entry *id;
324 struct id_map_entry *id;
382 struct id_map_entry *map, *tmp_map;
402 struct id_map_entry *ent =
404 struct id_map_entry, node);
414 struct id_map_entry *ent =
415 rb_entry(nd, struct id_map_entry, node);