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:CAKE_MAX_TINS
(Results
1 - 2
of
2
) sorted by relevance
/kernel/linux/linux-5.10/net/sched/
H
A
D
sch_cake.c
78
#define
CAKE_MAX_TINS
(8)
macro
204
struct cake_heap_entry overflow_heap[CAKE_QUEUES *
CAKE_MAX_TINS
];
1417
static const u32 a =
CAKE_MAX_TINS
* CAKE_QUEUES;
in cake_heapify()
1454
while (i > 0 && i <
CAKE_MAX_TINS
* CAKE_QUEUES) {
in cake_heapify_up()
1514
for (i =
CAKE_MAX_TINS
* CAKE_QUEUES / 2; i >= 0; i--)
in cake_drop()
2233
for (c = 0; c <
CAKE_MAX_TINS
; c++)
in cake_reset()
2543
for (c = q->tin_cnt; c <
CAKE_MAX_TINS
; c++) {
in cake_reconfigure()
2740
q->tins = kvcalloc(
CAKE_MAX_TINS
, sizeof(struct cake_tin_data),
in cake_init()
2745
for (i = 0; i <
CAKE_MAX_TINS
; i++) {
in cake_init()
2757
u32 k = j *
CAKE_MAX_TINS
in cake_init()
[all...]
/kernel/linux/linux-6.6/net/sched/
H
A
D
sch_cake.c
79
#define
CAKE_MAX_TINS
(8)
macro
205
struct cake_heap_entry overflow_heap[CAKE_QUEUES *
CAKE_MAX_TINS
];
1418
static const u32 a =
CAKE_MAX_TINS
* CAKE_QUEUES;
in cake_heapify()
1455
while (i > 0 && i <
CAKE_MAX_TINS
* CAKE_QUEUES) {
in cake_heapify_up()
1515
for (i =
CAKE_MAX_TINS
* CAKE_QUEUES / 2; i >= 0; i--)
in cake_drop()
2234
for (c = 0; c <
CAKE_MAX_TINS
; c++)
in cake_reset()
2544
for (c = q->tin_cnt; c <
CAKE_MAX_TINS
; c++) {
in cake_reconfigure()
2738
q->tins = kvcalloc(
CAKE_MAX_TINS
, sizeof(struct cake_tin_data),
in cake_init()
2743
for (i = 0; i <
CAKE_MAX_TINS
; i++) {
in cake_init()
2755
u32 k = j *
CAKE_MAX_TINS
in cake_init()
[all...]
Completed in 10 milliseconds