19 	u32 head, tail;  member
32 	return qs->head == qs->tail;  in queue_stack_map_is_empty()
37 	u32 head = qs->head + 1;  in queue_stack_map_is_full()  local
39 	if (unlikely(head >= qs->size))  in queue_stack_map_is_full()
40 		head = 0;  in queue_stack_map_is_full()
42 	return head == qs->tail;  in queue_stack_map_is_full()
159 	index = qs->head - 1;  in __stack_map_get()
167 		qs->head = index;  in __stack_map_get()
228 	dst = &qs->elements[qs->head * qs->map.value_size];  in queue_stack_map_push_elem()
231 	if (unlikely(++qs->head >= qs->size))  in queue_stack_map_push_elem()
232 		qs->head = 0;  in queue_stack_map_push_elem()