id_map_entry
static struct id_map_entry *
struct id_map_entry *id_map_entry =
rb_entry(node, struct id_map_entry, node);
if (id_map_entry->sl_cm_id > sl_cm_id)
else if (id_map_entry->sl_cm_id < sl_cm_id)
else if (id_map_entry->slave_id > slave_id)
else if (id_map_entry->slave_id < slave_id)
return id_map_entry;
struct id_map_entry *ent = container_of(delay, struct id_map_entry, timeout);
struct id_map_entry *db_ent, *found_ent;
db_ent = (struct id_map_entry *)idr_find(&sriov->pv_id_table, pv_id);
struct id_map_entry *ent, *found_ent;
ent = (struct id_map_entry *)idr_find(&sriov->pv_id_table, pv_cm_id);
static void sl_id_map_add(struct ib_device *ibdev, struct id_map_entry *new)
struct id_map_entry *ent;
ent = rb_entry(parent, struct id_map_entry, node);
static struct id_map_entry *
struct id_map_entry *ent;
ent = kmalloc(sizeof (struct id_map_entry), GFP_KERNEL);
static struct id_map_entry *
struct id_map_entry *ent;
ent = (struct id_map_entry *)idr_find(&sriov->pv_id_table, *pv_cm_id);
static void schedule_delayed(struct ib_device *ibdev, struct id_map_entry *id)
struct id_map_entry *id;
struct id_map_entry *id;
struct id_map_entry *map, *tmp_map;
struct id_map_entry *ent =
struct id_map_entry, node);
struct id_map_entry *ent =
rb_entry(nd, struct id_map_entry, node);