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:to_klist_node
(Results
1 - 2
of
2
) sorted by relevance
/kernel/linux/linux-5.10/lib/
H
A
D
klist.c
320
static struct klist_node *
to_klist_node
(struct list_head *n)
in to_klist_node()
function
343
prev =
to_klist_node
(last->n_node.prev);
in klist_prev()
347
prev =
to_klist_node
(i->i_klist->k_list.prev);
in klist_prev()
350
while (prev !=
to_klist_node
(&i->i_klist->k_list)) {
in klist_prev()
356
prev =
to_klist_node
(prev->n_node.prev);
in klist_prev()
385
next =
to_klist_node
(last->n_node.next);
in klist_next()
389
next =
to_klist_node
(i->i_klist->k_list.next);
in klist_next()
392
while (next !=
to_klist_node
(&i->i_klist->k_list)) {
in klist_next()
398
next =
to_klist_node
(next->n_node.next);
in klist_next()
/kernel/linux/linux-6.6/lib/
H
A
D
klist.c
320
static struct klist_node *
to_klist_node
(struct list_head *n)
in to_klist_node()
function
343
prev =
to_klist_node
(last->n_node.prev);
in klist_prev()
347
prev =
to_klist_node
(i->i_klist->k_list.prev);
in klist_prev()
350
while (prev !=
to_klist_node
(&i->i_klist->k_list)) {
in klist_prev()
356
prev =
to_klist_node
(prev->n_node.prev);
in klist_prev()
385
next =
to_klist_node
(last->n_node.next);
in klist_next()
389
next =
to_klist_node
(i->i_klist->k_list.next);
in klist_next()
392
while (next !=
to_klist_node
(&i->i_klist->k_list)) {
in klist_next()
398
next =
to_klist_node
(next->n_node.next);
in klist_next()
Completed in 3 milliseconds