![]() |
|
|||
Name | Size | Date (UTC) | Last indexed | Description | |
---|---|---|---|---|---|
Name | Size | Date (UTC) | Last indexed | Description | |
![]() |
Parent directory | - | 2025-03-06 09:18:39 | ||
![]() |
autogroup.c | 7098 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:39 | Auto-group scheduling implementation: |
![]() |
autogroup.h | 1640 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:39 | |
![]() |
build_policy.c | 1215 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:40 | These are the scheduling policy related scheduler files, built in a single compilation unit for build efficiency reasons. |
![]() |
build_utility.c | 2409 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:40 | These are various utility functions of the scheduler, built in a single compilation unit for build efficiency reasons. |
![]() |
clock.c | 12504 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:40 | Scheduler clock - returns current time in nanosec units. This is default implementation. Architectures and sub-architectures can override this. |
![]() |
completion.c | 10260 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:40 | Generic wait-for-completion handler; It differs from semaphores in that their default case is the opposite, wait_for_completion default blocks whereas semaphore default non-block. |
![]() |
core.c | 291906 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:41 | |
![]() |
core_sched.c | 6913 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:41 | A simple wrapper around refcount. An allocated sched_core_cookie's address is used to compute the cookie of the task. |
![]() |
cpuacct.c | 8248 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:41 | CPU accounting code for task groups. Based on the work by Paul Menage (menage@google.com) and Balbir Singh (balbir@in.ibm.com). |
![]() |
cpudeadline.c | 6418 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:41 | kernel/sched/ Global CPU deadline management Author: Juri Lelli <j.lelli@sssup.it">j.lelli@sssup.it> |
![]() |
cpudeadline.h | 637 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:41 | |
![]() |
cpufreq.c | 2680 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:41 | cpufreq_add_update_util_hook - Populate the CPU's update_util_data pointer. |
![]() |
cpufreq_schedutil.c | 23949 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:41 | |
![]() |
cpupri.c | 8710 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:42 | |
![]() |
cpupri.h | 775 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:42 | |
![]() |
cputime.c | 27112 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:42 | |
![]() |
deadline.c | 83769 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:42 | Default limits for DL period; on the top end we guard against small util tasks still getting ridiculously long effective runtimes, on the bottom end we guard against timer DoS. |
![]() |
debug.c | 26067 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:42 | This allows printing both to /proc/sched_debug and to the console |
![]() |
fair.c | 323940 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:43 | |
![]() |
features.h | 2647 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:43 | Only give sleepers 50% of their service deficit. This allows them to run sooner, but does not allow tons of sleepers to rip the spread apart. |
![]() |
idle.c | 12566 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:44 | Generic entry points for the idle threads and implementation of the idle task scheduling class. (NOTE: these are not related to SCHED_IDLE batch scheduled tasks which are handled in sched/fair.c ) |
![]() |
isolation.c | 6408 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:44 | |
![]() |
loadavg.c | 11499 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:44 | kernel/sched/ This file contains the magic bits required to compute the global loadavg figure. |
![]() |
Makefile | 1351 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:44 | |
![]() |
membarrier.c | 19490 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:44 | |
![]() |
pelt.c | 12519 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:44 | Approximate: val * y^n, where y^32 ~= 0.5 (~1 scheduling period) |
![]() |
pelt.h | 6177 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:44 | |
![]() |
psi.c | 39513 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:44 | Pressure stall information for CPU, memory and IO Copyright (c) 2018 Facebook, Inc. |
![]() |
rt.c | 73208 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:44 | Real-Time Scheduling Class (mapped to the SCHED_FIFO and SCHED_RR policies) |
![]() |
sched-pelt.h | 616 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:44 | Generated by Documentation/scheduler/sched-pelt; do not modify. |
![]() |
sched.h | 84408 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:45 | |
![]() |
smp.h | 406 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:45 | Scheduler internal SMP callback types and methods between the scheduler and other internal parts of the core kernel: |
![]() |
stats.c | 5620 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:45 | proc/schedstat implementation |
![]() |
stats.h | 9178 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:45 | |
![]() |
stop_task.c | 3283 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:45 | stop-task scheduling class. The stop task is the highest priority task in the system, it preempts everything and will be preempted by nothing. See kernel/stop_machine.c |
![]() |
swait.c | 3681 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:45 | linux/swait.h> (simple wait queues ) implementation: |
![]() |
topology.c | 68617 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:45 | |
![]() |
wait.c | 14838 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:45 | Generic waiting primitives. (C) 2004 Nadia Yvette Chambers, Oracle |
![]() |
wait_bit.c | 7002 bytes | 2025-03-06 09:18:39 | 2025-03-06 13:27:45 | The implementation of the wait_bit*() and related waiting APIs: |
[ Source navigation ] | [ Identifier search ] | [ general search ] |
This page was automatically generated by the 2.1.0 LXR engine. The LXR team |
![]() ![]() |