Home
Sort by
last modified time
|
relevance
|
path
Repository(s)
applications
arkcompiler
base
build
commonlibrary
developtools
device
docs
domains
drivers
foundation
ide
interface
kernel
napi_generator
productdefine
test
third_party
vendor
select all
invert selection
clear
Full Search
Search through all text tokens(words,strings,identifiers,numbers) in index.
Definition
Only finds symbol definitions(where e.g a variable(function,...) is defined).
Symbol
Only finds symbol(e.g. methods classes,function,variables).
File Path
Path of the source file(use "/").If you want just exact path,enclose it in "".Source files end with: .jar/.bz2/.a/.h/.java...
History
History log comments.
Type
Any
Bzip(2)
C
Clojure
C#
C++
ELF
Erlang
Image file
Fortran
Golang
GZIP
Haskell
Jar
Java
Java class
JavaScript
Lisp
Lua
Pascal
Perl
PHP
Plain Text
PL/SQL
Python
Rust
Scala
Shell script
SQL
Tar
Tcl
Troff
UUEncoded
Visual Basic
XML
Zip
Type of analyzer used to filter file types include with selected(e.g. just C sources).
Help
Searched
refs:next_task
(Results
1 - 2
of
2
) sorted by relevance
/device/soc/rockchip/common/sdk_linux/kernel/sched/
H
A
D
rt.c
2129
struct task_struct *
next_task
= pick_next_pushable_task(rq);
in find_lock_lowest_rq()
local
2130
if (unlikely(
next_task
!= task || !cpumask_test_cpu(lowest_rq->cpu, task->cpus_ptr))) {
in find_lock_lowest_rq()
2157
struct task_struct *
next_task
;
in push_rt_task()
local
2165
next_task
= pick_next_pushable_task(rq);
in push_rt_task()
2166
if (!
next_task
) {
in push_rt_task()
2171
if (WARN_ON(
next_task
== rq->curr)) {
in push_rt_task()
2176
* It's possible that the
next_task
slipped in of
in push_rt_task()
2180
if (unlikely(
next_task
->prio < rq->curr->prio)) {
in push_rt_task()
2186
get_task_struct(
next_task
);
in push_rt_task()
2189
lowest_rq = find_lock_lowest_rq(
next_task
, r
in push_rt_task()
2741
struct task_struct *
next_task
= busiest_rq->rt_push_task;
rt_active_load_balance_cpu_stop()
local
[all...]
/device/soc/rockchip/common/sdk_linux/include/linux/sched/
H
A
D
signal.h
604
#define
next_task
(p) list_entry_rcu((p)->tasks.next, struct task_struct, tasks)
macro
606
#define for_each_process(p) for ((p) = &init_task; ((p) =
next_task
(p)) != &init_task;)
615
for ((g) = (t) = &init_task; ((g) = (t) =
next_task
(g)) != &init_task;) \
Completed in 6 milliseconds