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:LIH_INDEX
(Results
1 - 2
of
2
) sorted by relevance
/kernel/linux/linux-5.10/net/dccp/ccids/lib/
H
A
D
loss_interval.c
16
static inline u8
LIH_INDEX
(const u8 ctr)
in LIH_INDEX()
function
24
return lh->counter ? lh->ring[
LIH_INDEX
(lh->counter - 1)] : NULL;
in tfrc_lh_peek()
31
return lh->ring[
LIH_INDEX
(lh->counter - i - 1)]->li_length;
in tfrc_lh_get_interval()
39
if (lh->ring[
LIH_INDEX
(lh->counter)] == NULL)
in tfrc_lh_demand_next()
40
lh->ring[
LIH_INDEX
(lh->counter)] = kmem_cache_alloc(tfrc_lh_slab,
in tfrc_lh_demand_next()
42
return lh->ring[
LIH_INDEX
(lh->counter)];
in tfrc_lh_demand_next()
51
if (lh->ring[
LIH_INDEX
(lh->counter)] != NULL) {
in tfrc_lh_cleanup()
53
lh->ring[
LIH_INDEX
(lh->counter)]);
in tfrc_lh_cleanup()
54
lh->ring[
LIH_INDEX
(lh->counter)] = NULL;
in tfrc_lh_cleanup()
/kernel/linux/linux-6.6/net/dccp/ccids/lib/
H
A
D
loss_interval.c
16
static inline u8
LIH_INDEX
(const u8 ctr)
in LIH_INDEX()
function
24
return lh->counter ? lh->ring[
LIH_INDEX
(lh->counter - 1)] : NULL;
in tfrc_lh_peek()
31
return lh->ring[
LIH_INDEX
(lh->counter - i - 1)]->li_length;
in tfrc_lh_get_interval()
39
if (lh->ring[
LIH_INDEX
(lh->counter)] == NULL)
in tfrc_lh_demand_next()
40
lh->ring[
LIH_INDEX
(lh->counter)] = kmem_cache_alloc(tfrc_lh_slab,
in tfrc_lh_demand_next()
42
return lh->ring[
LIH_INDEX
(lh->counter)];
in tfrc_lh_demand_next()
51
if (lh->ring[
LIH_INDEX
(lh->counter)] != NULL) {
in tfrc_lh_cleanup()
53
lh->ring[
LIH_INDEX
(lh->counter)]);
in tfrc_lh_cleanup()
54
lh->ring[
LIH_INDEX
(lh->counter)] = NULL;
in tfrc_lh_cleanup()
Completed in 1 milliseconds