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:nsets
(Results
1 - 11
of
11
) sorted by relevance
/kernel/linux/linux-5.10/arch/arm/mm/
H
A
D
cache-uniphier.c
67
* @
nsets
: number of associativity sets
78
u32
nsets
;
member
355
if (of_property_read_u32(np, "cache-sets", &data->
nsets
) ||
in __uniphier_cache_init()
356
!is_power_of_2(data->
nsets
)) {
in __uniphier_cache_init()
364
cache_size == 0 || cache_size % (data->
nsets
* data->line_size)) {
in __uniphier_cache_init()
371
data->way_mask = GENMASK(cache_size / data->
nsets
/ data->line_size - 1,
in __uniphier_cache_init()
/kernel/linux/linux-6.6/arch/arm/mm/
H
A
D
cache-uniphier.c
69
* @
nsets
: number of associativity sets
80
u32
nsets
;
member
357
if (of_property_read_u32(np, "cache-sets", &data->
nsets
) ||
in __uniphier_cache_init()
358
!is_power_of_2(data->
nsets
)) {
in __uniphier_cache_init()
366
cache_size == 0 || cache_size % (data->
nsets
* data->line_size)) {
in __uniphier_cache_init()
373
data->way_mask = GENMASK(cache_size / data->
nsets
/ data->line_size - 1,
in __uniphier_cache_init()
/kernel/linux/linux-5.10/drivers/md/bcache/
H
A
D
bset.c
48
for (i = 0; i <= b->
nsets
; i++)
in bch_dump_bucket()
352
b->
nsets
= 0;
in bch_btree_keys_init()
669
b->set[++b->
nsets
].data = i;
in bch_bset_init_next()
1050
BUG_ON(!b->
nsets
&&
in __bch_bset_search()
1253
b->
nsets
= start;
in __btree_sort()
1300
for (i = start; i <= b->
nsets
; i++)
in bch_btree_sort_partial()
1341
if (!b->
nsets
)
in bch_btree_sort_lazy()
1344
for (i = b->
nsets
- 1; i >= 0; --i) {
in bch_btree_sort_lazy()
1354
if (b->
nsets
+ 1 == MAX_BSETS) {
in bch_btree_sort_lazy()
1367
for (i = 0; i <= b->
nsets
;
in bch_btree_keys_stats()
[all...]
H
A
D
bset.h
220
uint8_t
nsets
;
member
236
return b->set + b->
nsets
;
in bset_tree_last()
241
return t <= b->set + b->
nsets
- b->last_set_unwritten;
in bset_written()
246
return !b->last_set_unwritten || k < b->set[b->
nsets
].data->start;
in bkey_written()
H
A
D
btree.c
115
if (b->level && b->keys.
nsets
)
in bch_btree_init_next()
436
unsigned int
nsets
= b->keys.
nsets
;
in bch_btree_node_write()
local
446
if (
nsets
&& !b->keys.
nsets
)
in bch_btree_node_write()
1027
for (; i <= b->keys.
nsets
&& b->keys.set[i].size; i++) {
in bch_btree_node_get()
1032
for (; i <= b->keys.
nsets
; i++)
in bch_btree_node_get()
1305
for (t = b->keys.set; t <= &b->keys.set[b->keys.
nsets
]; t++)
in btree_gc_mark_node()
/kernel/linux/linux-6.6/drivers/md/bcache/
H
A
D
bset.c
48
for (i = 0; i <= b->
nsets
; i++)
in bch_dump_bucket()
352
b->
nsets
= 0;
in bch_btree_keys_init()
669
b->set[++b->
nsets
].data = i;
in bch_bset_init_next()
1054
BUG_ON(!b->
nsets
&&
in __bch_bset_search()
1257
b->
nsets
= start;
in __btree_sort()
1304
for (i = start; i <= b->
nsets
; i++)
in bch_btree_sort_partial()
1345
if (!b->
nsets
)
in bch_btree_sort_lazy()
1348
for (i = b->
nsets
- 1; i >= 0; --i) {
in bch_btree_sort_lazy()
1358
if (b->
nsets
+ 1 == MAX_BSETS) {
in bch_btree_sort_lazy()
1371
for (i = 0; i <= b->
nsets
;
in bch_btree_keys_stats()
[all...]
H
A
D
bset.h
220
uint8_t
nsets
;
member
236
return b->set + b->
nsets
;
in bset_tree_last()
241
return t <= b->set + b->
nsets
- b->last_set_unwritten;
in bset_written()
246
return !b->last_set_unwritten || k < b->set[b->
nsets
].data->start;
in bkey_written()
H
A
D
btree.c
115
if (b->level && b->keys.
nsets
)
in bch_btree_init_next()
436
unsigned int
nsets
= b->keys.
nsets
;
in bch_btree_node_write()
local
446
if (
nsets
&& !b->keys.
nsets
)
in bch_btree_node_write()
1048
for (; i <= b->keys.
nsets
&& b->keys.set[i].size; i++) {
in bch_btree_node_get()
1053
for (; i <= b->keys.
nsets
; i++)
in bch_btree_node_get()
1326
for (t = b->keys.set; t <= &b->keys.set[b->keys.
nsets
]; t++)
in btree_gc_mark_node()
/kernel/linux/linux-6.6/include/trace/events/
H
A
D
bcache.h
275
__entry->keys = b->keys.set[b->keys.
nsets
].data->keys;
/kernel/linux/linux-5.10/include/trace/events/
H
A
D
bcache.h
275
__entry->keys = b->keys.set[b->keys.
nsets
].data->keys;
/kernel/linux/linux-6.6/drivers/net/ethernet/microchip/sparx5/
H
A
D
sparx5_main.h
447
u32
nsets
;
member
Completed in 16 milliseconds