| /Linux-v6.6/rust/kernel/ |
| D | task.rs | 16 unsafe { &*$crate::task::Task::current() }
65 pub struct Task(pub(crate) Opaque<bindings::task_struct>); struct
71 unsafe impl Send for Task {} implementation
76 unsafe impl Sync for Task {} implementation
81 impl Task { implementation
90 pub unsafe fn current() -> impl Deref<Target = Task> { in current()
92 task: &'a Task, in current()
97 type Target = Task; in current()
117 pub fn group_leader(&self) -> &Task { in group_leader() argument
151 unsafe impl crate::types::AlwaysRefCounted for Task { implementation
|
| /Linux-v6.6/Documentation/RCU/Design/Expedited-Grace-Periods/ |
| D | Expedited-Grace-Periods.rst | 307 The next diagram shows the situation after the arrival of Task A and
308 Task B at the leftmost and rightmost leaf ``rcu_node`` structures,
317 Suppose that Task A wins, recording its desired grace-period sequence
322 Task A now advances to initiate a new grace period, while Task B moves
351 Task A now acquires the ``rcu_state`` structure's ``->exp_mutex`` and
359 Task F blocking on the root ``rcu_node`` structure and Task E wait for
360 Task A to finish so that it can start the next grace period. The
365 Once the grace period completes, Task A starts waking up the tasks
372 Task E can then acquire ``->exp_mutex`` and increment
380 occupied. However, at some point, Task A will wake up the tasks blocked
[all …]
|
| /Linux-v6.6/Documentation/scheduler/ |
| D | sched-deadline.rst | 2 Deadline Task Scheduling
19 4.2 Task interface
230 A Task T1
240 A Task T2
263 Suppose Task T1 is the first task to start execution.
269 Task T1 therefore enters the ActiveNonContending state. Since its remaining
271 Task T2 start execution, with runtime still decreased as dq = -1 dt since
276 This is the 0-lag time for Task T1. Since it didn't woken up in the
279 Task T2 continues its execution. However, its runtime is now decreased as
281 Task T2 therefore reclaims the bandwidth unused by Task T1.
[all …]
|
| D | schedutil.rst | 90 - Documentation/scheduler/sched-capacity.rst:"1. CPU Capacity + 2. Task utilization"
148 XXX: deadline tasks (Sporadic Task Model) allows us to calculate a hard f_min
|
| D | sched-capacity.rst | 126 2. Task utilization
137 Task utilization is a percentage meant to represent the throughput requirements
|
| /Linux-v6.6/Documentation/scsi/ |
| D | cxgb3i.rst | 27 on the Initiator Task Tag (ITT) in Data-In or Target Task Tag (TTT)
|
| D | ufs.rst | 64 Task Manager and Device manager. The UFS interface is designed to be
72 * Task manager:
95 * UTP_TM_SAP: Task management service access point is exposed to task
|
| D | libsas.rst | 204 A SAS LLDD should also implement at least one of the Task
207 /* Task Management Functions. Must be called from process context. */
|
| /Linux-v6.6/arch/arm/mach-omap2/ |
| D | omap-smc.S | 68 mov r6, #0xff @ Indicate new Task call
|
| /Linux-v6.6/drivers/message/fusion/lsi/ |
| D | mpi_history.txt | 554 * Added a TaskType of Clear Task Set to SCSI
555 * Task Management request.
556 * 12-07-04 01.05.02 Added support for Task Management Query Task.
568 * 03-27-06 01.05.07 Added Task Management type of Clear ACA.
569 * 10-11-06 01.05.08 Shortened define for Task Management type of Clear ACA.
570 * 02-28-07 01.05.09 Defined two new MsgFlags bits for SCSI Task Management
571 * Request: Do Not Send Task IU and Soft Reset Option.
611 * Task buffer, and SSP Status IU.
|
| /Linux-v6.6/Documentation/translations/zh_CN/scheduler/ |
| D | schedutil.rst | 89 …- Documentation/translations/zh_CN/scheduler/sched-capacity.rst:"1. CPU Capacity + 2. Task utiliza…
|
| /Linux-v6.6/Documentation/security/ |
| D | credentials.rst | 247 Task Credentials
304 Accessing Task Credentials
357 Accessing Another Task's Credentials
399 uid_t task_uid(task) Task's real UID
400 uid_t task_euid(task) Task's effective UID
548 (see the Task Credentials section).
|
| /Linux-v6.6/Documentation/admin-guide/mm/ |
| D | numa_memory_policy.rst | 44 Task/Process Policy
420 Set [Task] Memory Policy::
435 Get [Task] Memory Policy or Related Information::
448 Install VMA/Shared Policy for a Range of Task's Address Space::
461 Set home node for a Range of Task's Address Spacec::
|
| /Linux-v6.6/Documentation/driver-api/rapidio/ |
| D | mport_cdev.rst | 9 Software Task Group (STG) between Texas Instruments, Freescale,
|
| D | rio_cm.rst | 10 Software Task Group (STG) between Texas Instruments, Prodrive Technologies,
|
| /Linux-v6.6/Documentation/bpf/ |
| D | bpf_iterators.rst | 249 Parameterizing BPF Task Iterators
261 BPF Task Iterator Program
476 Parametrizing Task Iterators
|
| /Linux-v6.6/tools/perf/scripts/python/ |
| D | task-analyzer.py | 531 class Task(object): class
765 task = Task(_id, tid, cpu, comm)
|
| /Linux-v6.6/arch/arc/kernel/ |
| D | entry-compact.S | 336 ; e.g. Task'A' user-code -> L2 intr -> schedule -> 'B' user-code ret
|
| /Linux-v6.6/arch/arm/kernel/ |
| D | entry-header.S | 435 @ Test whether the SP has overflowed. Task and IRQ stacks are aligned
|
| /Linux-v6.6/Documentation/arch/x86/ |
| D | kernel-stacks.rst | 45 index into the Task State Segment (TSS). The IST entries in the TSS
|
| /Linux-v6.6/Documentation/core-api/ |
| D | entry.rst | 122 Task work handling is done separately for guest at the boundary of the
|
| /Linux-v6.6/Documentation/locking/ |
| D | rt-mutex-design.rst | 205 Task PI Tree
469 Task blocks on mutex
|
| D | lockdep-design.rst | 435 Task A gets the reader (no matter whether recursive or non-recursive) on X via
509 Task A is waiting for task B to read_unlock() Y and task B is waiting for task
|
| D | locktypes.rst | 257 - Task state is preserved across spinlock acquisition, ensuring that the
|
| /Linux-v6.6/arch/arc/ |
| D | Kconfig | 499 This reserves gp register to point to Current Task in
|
