20 	u32 size; /* max_entries + 1 */  member
39 	if (unlikely(head >= qs->size))  in queue_stack_map_is_full()
68 	u64 size, queue_size;  in queue_stack_map_alloc()  local
70 	size = (u64) attr->max_entries + 1;  in queue_stack_map_alloc()
71 	queue_size = sizeof(*qs) + size * attr->value_size;  in queue_stack_map_alloc()
79 	qs->size = size;  in queue_stack_map_alloc()
118 		if (unlikely(++qs->tail >= qs->size))  in __queue_map_get()
150 	if (unlikely(index >= qs->size))  in __stack_map_get()
151 		index = qs->size - 1;  in __stack_map_get()
219 		if (unlikely(++qs->tail >= qs->size))  in queue_stack_map_push_elem()
226 	if (unlikely(++qs->head >= qs->size))  in queue_stack_map_push_elem()