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:tree_count
(Results
1 - 8
of
8
) sorted by relevance
/kernel/linux/linux-5.10/drivers/net/ethernet/mellanox/mlxsw/
H
A
D
spectrum_router.h
30
unsigned int
tree_count
;
member
H
A
D
spectrum_router.c
475
for (i = 0; i < mlxsw_sp->router->lpm.
tree_count
; i++) {
in mlxsw_sp_lpm_tree_find_unused()
575
for (i = 0; i < mlxsw_sp->router->lpm.
tree_count
; i++) {
in mlxsw_sp_lpm_tree_get()
613
mlxsw_sp->router->lpm.
tree_count
= max_trees - MLXSW_SP_LPM_TREE_MIN;
in mlxsw_sp_lpm_init()
614
mlxsw_sp->router->lpm.trees = kcalloc(mlxsw_sp->router->lpm.
tree_count
,
in mlxsw_sp_lpm_init()
620
for (i = 0; i < mlxsw_sp->router->lpm.
tree_count
; i++) {
in mlxsw_sp_lpm_init()
/kernel/linux/linux-5.10/kernel/
H
A
D
auditsc.c
225
* ->
tree_count
is the number of free entries in array pointed to by ->trees.
243
int left = ctx->
tree_count
;
in put_tree_ref()
246
ctx->
tree_count
= left;
in put_tree_ref()
255
ctx->
tree_count
= 30;
in put_tree_ref()
273
ctx->
tree_count
= 31;
in grow_tree_refs()
297
while (n-- > ctx->
tree_count
) {
in unroll_tree_refs()
302
ctx->
tree_count
= count;
in unroll_tree_refs()
328
for (n = ctx->
tree_count
; n < 31; n++)
in match_tree_refs()
1827
count = context->
tree_count
;
in handle_one()
1856
count = context->
tree_count
;
in handle_path()
[all...]
H
A
D
audit.h
142
int
tree_count
;
member
/kernel/linux/linux-6.6/kernel/
H
A
D
auditsc.c
217
* ->
tree_count
is the number of free entries in array pointed to by ->trees.
235
int left = ctx->
tree_count
;
in put_tree_ref()
239
ctx->
tree_count
= left;
in put_tree_ref()
248
ctx->
tree_count
= 30;
in put_tree_ref()
267
ctx->
tree_count
= 31;
in grow_tree_refs()
292
while (n-- > ctx->
tree_count
) {
in unroll_tree_refs()
297
ctx->
tree_count
= count;
in unroll_tree_refs()
325
for (n = ctx->
tree_count
; n < 31; n++)
in match_tree_refs()
2096
count = context->
tree_count
;
in handle_one()
2125
count = context->
tree_count
;
in handle_path()
[all...]
H
A
D
audit.h
151
int
tree_count
;
member
/kernel/linux/linux-6.6/drivers/net/ethernet/mellanox/mlxsw/
H
A
D
spectrum_router.h
39
unsigned int
tree_count
;
member
H
A
D
spectrum_router.c
579
for (i = 0; i < mlxsw_sp->router->lpm.
tree_count
; i++) {
in mlxsw_sp_lpm_tree_find_unused()
679
for (i = 0; i < mlxsw_sp->router->lpm.
tree_count
; i++) {
in mlxsw_sp_lpm_tree_get()
717
mlxsw_sp->router->lpm.
tree_count
= max_trees - MLXSW_SP_LPM_TREE_MIN;
in mlxsw_sp_lpm_init()
718
mlxsw_sp->router->lpm.trees = kcalloc(mlxsw_sp->router->lpm.
tree_count
,
in mlxsw_sp_lpm_init()
724
for (i = 0; i < mlxsw_sp->router->lpm.
tree_count
; i++) {
in mlxsw_sp_lpm_init()
Completed in 34 milliseconds