250 	struct mlx4_zone_entry *it;  in mlx4_zone_add_one()  local
270 	list_for_each_entry(it, &zone_alloc->prios, prio_list)  in mlx4_zone_add_one()
271 		if (it->priority >= priority)  in mlx4_zone_add_one()
274 	if (&it->prio_list == &zone_alloc->prios || it->priority > priority)  in mlx4_zone_add_one()
275 		list_add_tail(&zone->prio_list, &it->prio_list);  in mlx4_zone_add_one()
276 	list_add_tail(&zone->list, &it->list);  in mlx4_zone_add_one()
308 		struct mlx4_zone_entry *it;  in __mlx4_zone_remove_one_entry()  local
310 		list_for_each_entry(it, &zone_alloc->prios, prio_list) {  in __mlx4_zone_remove_one_entry()
311 			u32 cur_mask = mlx4_bitmap_masked_value(it->bitmap, (u32)-1);  in __mlx4_zone_remove_one_entry()
362 		struct mlx4_zone_entry *it = curr_node;  in __mlx4_alloc_from_zone()  local
364 		list_for_each_entry_continue_reverse(it, &zone_alloc->entries, list) {  in __mlx4_alloc_from_zone()
365 			res = mlx4_bitmap_alloc_range(it->bitmap, count,  in __mlx4_alloc_from_zone()
368 				res += it->offset;  in __mlx4_alloc_from_zone()
369 				uid = it->uid;  in __mlx4_alloc_from_zone()
376 		struct mlx4_zone_entry *it = curr_node;  in __mlx4_alloc_from_zone()  local
378 		list_for_each_entry_from(it, &zone_alloc->entries, list) {  in __mlx4_alloc_from_zone()
379 			if (unlikely(it == zone))  in __mlx4_alloc_from_zone()
382 			if (unlikely(it->priority != curr_node->priority))  in __mlx4_alloc_from_zone()
385 			res = mlx4_bitmap_alloc_range(it->bitmap, count,  in __mlx4_alloc_from_zone()
388 				res += it->offset;  in __mlx4_alloc_from_zone()
389 				uid = it->uid;  in __mlx4_alloc_from_zone()