Contributors: 9
Author Tokens Token Proportion Commits Commit Proportion
Ingo Molnar 110 38.73% 3 21.43%
John Stultz 72 25.35% 1 7.14%
Waiman Long 42 14.79% 2 14.29%
Davidlohr Bueso A 18 6.34% 2 14.29%
Thomas Gleixner 16 5.63% 2 14.29%
Marco Elver 12 4.23% 1 7.14%
Eric Paris 12 4.23% 1 7.14%
Peter Zijlstra 1 0.35% 1 7.14%
Greg Kroah-Hartman 1 0.35% 1 7.14%
Total 284 14 


/* SPDX-License-Identifier: GPL-2.0 */
#ifndef _LINUX_SCHED_WAKE_Q_H
#define _LINUX_SCHED_WAKE_Q_H

/*
 * Wake-queues are lists of tasks with a pending wakeup, whose
 * callers have already marked the task as woken internally,
 * and can thus carry on. A common use case is being able to
 * do the wakeups once the corresponding user lock as been
 * released.
 *
 * We hold reference to each task in the list across the wakeup,
 * thus guaranteeing that the memory is still valid by the time
 * the actual wakeups are performed in wake_up_q().
 *
 * One per task suffices, because there's never a need for a task to be
 * in two wake queues simultaneously; it is forbidden to abandon a task
 * in a wake queue (a call to wake_up_q() _must_ follow), so if a task is
 * already in a wake queue, the wakeup will happen soon and the second
 * waker can just skip it.
 *
 * The DEFINE_WAKE_Q macro declares and initializes the list head.
 * wake_up_q() does NOT reinitialize the list; it's expected to be
 * called near the end of a function. Otherwise, the list can be
 * re-initialized for later re-use by wake_q_init().
 *
 * NOTE that this can cause spurious wakeups. schedule() callers
 * must ensure the call is done inside a loop, confirming that the
 * wakeup condition has in fact occurred.
 *
 * NOTE that there is no guarantee the wakeup will happen any later than the
 * wake_q_add() location. Therefore task must be ready to be woken at the
 * location of the wake_q_add().
 */

#include <linux/sched.h>

struct wake_q_head {
	struct wake_q_node *first;
	struct wake_q_node **lastp;
};

#define WAKE_Q_TAIL ((struct wake_q_node *) 0x01)

#define WAKE_Q_HEAD_INITIALIZER(name)				\
	{ WAKE_Q_TAIL, &name.first }

#define DEFINE_WAKE_Q(name)					\
	struct wake_q_head name = WAKE_Q_HEAD_INITIALIZER(name)

static inline void wake_q_init(struct wake_q_head *head)
{
	head->first = WAKE_Q_TAIL;
	head->lastp = &head->first;
}

static inline bool wake_q_empty(struct wake_q_head *head)
{
	return head->first == WAKE_Q_TAIL;
}

extern void wake_q_add(struct wake_q_head *head, struct task_struct *task);
extern void wake_q_add_safe(struct wake_q_head *head, struct task_struct *task);
extern void wake_up_q(struct wake_q_head *head);

/* Spin unlock helpers to unlock and call wake_up_q with preempt disabled */
static inline
void raw_spin_unlock_wake(raw_spinlock_t *lock, struct wake_q_head *wake_q)
	__releases(lock)
{
	guard(preempt)();
	raw_spin_unlock(lock);
	if (wake_q) {
		wake_up_q(wake_q);
		wake_q_init(wake_q);
	}
}

static inline
void raw_spin_unlock_irq_wake(raw_spinlock_t *lock, struct wake_q_head *wake_q)
	__releases(lock)
{
	guard(preempt)();
	raw_spin_unlock_irq(lock);
	if (wake_q) {
		wake_up_q(wake_q);
		wake_q_init(wake_q);
	}
}

static inline
void raw_spin_unlock_irqrestore_wake(raw_spinlock_t *lock, unsigned long flags,
				     struct wake_q_head *wake_q)
	__releases(lock)
{
	guard(preempt)();
	raw_spin_unlock_irqrestore(lock, flags);
	if (wake_q) {
		wake_up_q(wake_q);
		wake_q_init(wake_q);
	}
}
#endif /* _LINUX_SCHED_WAKE_Q_H */