| /linux/Documentation/scheduler/ |
| H A D | sched-ext.rst | 297 Task Lifecycle
312 ops.runnable(); /* Task becomes ready to run */
316 ops.enqueue(); /* Task can be added to a DSQ */
320 ops.dispatch(); /* Task is moved to a local DSQ */
322 ops.running(); /* Task starts running on its assigned CPU */
325 ops.stopping(); /* Task stops running (time slice expires or wait) */
327 /* Task's CPU becomes available */
332 ops.quiescent(); /* Task releases its assigned CPU (wait) */
336 ops.exit_task(); /* Task is destroyed */
|
| H A D | schedutil.rst | 90 - Documentation/scheduler/sched-capacity.rst:"1. CPU Capacity + 2. Task utilization"
147 XXX: deadline tasks (Sporadic Task Model) allows us to calculate a hard f_min
|
| H A D | sched-capacity.rst | 127 2. Task utilization
138 Task utilization is a percentage meant to represent the throughput requirements
|
| /linux/Documentation/RCU/Design/Expedited-Grace-Periods/ |
| H A 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/Documentation/translations/zh_CN/security/ |
| H A D | credentials.rst | 342 uid_t task_uid(task) Task's real UID
343 uid_t task_euid(task) Task's effective UID
|
| /linux/Documentation/scsi/ |
| H A D | cxgb3i.rst | 27 on the Initiator Task Tag (ITT) in Data-In or Target Task Tag (TTT)
|
| H A 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
|
| H A 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/arch/arm/mach-omap2/ |
| H A D | omap-smc.S | 68 mov r6, #0xff @ Indicate new Task call
|
| /linux/drivers/message/fusion/lsi/ |
| H A 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/Documentation/translations/zh_CN/scheduler/ |
| H A D | schedutil.rst | 89 …- Documentation/translations/zh_CN/scheduler/sched-capacity.rst:"1. CPU Capacity + 2. Task utiliza…
|
| /linux/Documentation/security/ |
| H A 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
543 (see the Task Credentials section).
|
| /linux/Documentation/admin-guide/mm/ |
| H A D | numa_memory_policy.rst | 44 Task/Process Policy
429 Set [Task] Memory Policy::
444 Get [Task] Memory Policy or Related Information::
457 Install VMA/Shared Policy for a Range of Task's Address Space::
470 Set home node for a Range of Task's Address Spacec::
|
| /linux/Documentation/driver-api/rapidio/ |
| H A D | mport_cdev.rst | 9 Software Task Group (STG) between Texas Instruments, Freescale,
|
| H A D | rio_cm.rst | 10 Software Task Group (STG) between Texas Instruments, Prodrive Technologies,
|
| /linux/tools/perf/scripts/python/ |
| H A D | task-analyzer.py | 531 class Task(object): class
765 task = Task(_id, tid, cpu, comm)
|
| /linux/arch/arc/kernel/ |
| H A D | entry-compact.S | 336 ; e.g. Task'A' user-code -> L2 intr -> schedule -> 'B' user-code ret
|
| /linux/arch/arm/kernel/ |
| H A D | entry-header.S | 435 @ Test whether the SP has overflowed. Task and IRQ stacks are aligned
|
| /linux/Documentation/arch/x86/ |
| H A D | kernel-stacks.rst | 45 index into the Task State Segment (TSS). The IST entries in the TSS
|
| /linux/drivers/android/binder/ |
| H A D | thread.rs | 21 task::Task,
421 pub(crate) task: ARef<Task>,
|
| H A D | process.rs | 35 task::Task,
438 pub(crate) task: ARef<Task>,
|
| /linux/tools/sched_ext/ |
| H A D | README.md | 101 bpf_printk("Task %s enabled in example scheduler", p->comm);
|
| /linux/Documentation/locking/ |
| H A D | rt-mutex-design.rst | 205 Task PI Tree
469 Task blocks on mutex
|
| H A 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
|
| /linux/tools/perf/Documentation/ |
| H A D | perf-sched.txt | 28 …Task | Runtime ms | Count | Avg delay ms | Max delay ms | Max delay s…
|