trap_list
list_for_each_entry_safe(node, q, &trap_list, list) {
struct trap_list *trap_list;
trap_list = &ibp->rvp.trap_lists[queue_id];
list_for_each_entry(node, &trap_list->list, list) {
if (trap_list->list_len < RVT_MAX_TRAP_LEN) {
trap_list->list_len++;
list_add_tail(&trap->list, &trap_list->list);
node = list_first_entry(&trap_list->list, struct trap_node,
struct trap_list *trap_list;
trap_list = &ibp->rvp.trap_lists[i];
trap = list_first_entry_or_null(&trap_list->list,
trap_list->list_len--;
struct list_head trap_list;
list_replace_init(&ibp->rvp.trap_lists[i].list, &trap_list);
struct trap_list trap_lists[RVT_MAX_TRAP_LISTS];
INIT_LIST_HEAD(&devlink->trap_list);
WARN_ON(!list_empty(&devlink->trap_list));
WARN_ON(!list_empty(&devlink->trap_list));
struct list_head trap_list;
list_for_each_entry(trap_item, &devlink->trap_list, list)
list_for_each_entry_reverse(trap_item, &devlink->trap_list, list)
list_add_tail(&trap_item->list, &devlink->trap_list);
if (list_empty(&devlink->trap_list))
list_for_each_entry(trap_item, &devlink->trap_list, list) {
if (list_empty(&devlink->trap_list))
list_for_each_entry(trap_item, &devlink->trap_list, list) {
list_for_each_entry(trap_item, &devlink->trap_list, list) {
list_for_each_entry(trap_item, &devlink->trap_list, list) {