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:bc_nlevels
(Results
1 - 25
of
33
) sorted by relevance
1
2
/kernel/linux/linux-6.6/fs/xfs/libxfs/
H
A
D
xfs_btree_staging.c
151
cur->
bc_nlevels
= afake->af_levels;
in xfs_btree_stage_afakeroot()
231
cur->
bc_nlevels
= ifake->if_levels;
in xfs_btree_stage_ifakeroot()
380
level == cur->
bc_nlevels
- 1) {
in xfs_btree_bload_prep_block()
521
if (level == cur->
bc_nlevels
- 1 && cur->bc_ops->get_dmaxrecs)
in xfs_btree_bload_max_npb()
546
if (level == cur->
bc_nlevels
- 1)
in xfs_btree_bload_desired_npb()
656
* maxrecs values for the root block (
bc_nlevels
== level - 1). We're
in xfs_btree_bload_compute_geometry()
657
* checking levels 0 and 1 here, so set
bc_nlevels
such that the btree
in xfs_btree_bload_compute_geometry()
660
cur->
bc_nlevels
= cur->bc_maxlevels - 1;
in xfs_btree_bload_compute_geometry()
665
for (cur->
bc_nlevels
= 1; cur->
bc_nlevels
<
in xfs_btree_bload_compute_geometry()
[all...]
H
A
D
xfs_btree.c
438
for (i = 0; i < cur->
bc_nlevels
; i++) {
in xfs_btree_del_cursor()
492
for (i = 0; i < new->
bc_nlevels
; i++) {
in xfs_btree_dup_cursor()
754
(level == cur->
bc_nlevels
- 1)) {
in xfs_btree_get_block()
997
(lev == cur->
bc_nlevels
- 1))
in xfs_btree_readahead()
1611
ASSERT(level < cur->
bc_nlevels
);
in xfs_btree_increment()
1640
for (lev = level + 1; lev < cur->
bc_nlevels
; lev++) {
in xfs_btree_increment()
1660
if (lev == cur->
bc_nlevels
) {
in xfs_btree_increment()
1667
ASSERT(lev < cur->
bc_nlevels
);
in xfs_btree_increment()
1713
ASSERT(level < cur->
bc_nlevels
);
in xfs_btree_decrement()
1742
for (lev = level + 1; lev < cur->
bc_nlevels
; le
in xfs_btree_decrement()
[all...]
H
A
D
xfs_bmap_btree.c
290
if (level == cur->
bc_nlevels
- 1) {
in xfs_bmbt_get_minrecs()
308
if (level == cur->
bc_nlevels
- 1) {
in xfs_bmbt_get_maxrecs()
336
if (level != cur->
bc_nlevels
- 1)
in xfs_bmbt_get_dmaxrecs()
562
cur->
bc_nlevels
= be16_to_cpu(ifp->if_broot->bb_level) + 1;
in xfs_bmbt_init_cursor()
H
A
D
xfs_ialloc_btree.c
487
cur->
bc_nlevels
= be32_to_cpu(agi->agi_level);
in xfs_inobt_init_cursor()
489
cur->
bc_nlevels
= be32_to_cpu(agi->agi_free_level);
in xfs_inobt_init_cursor()
H
A
D
xfs_alloc_btree.c
541
cur->
bc_nlevels
= be32_to_cpu(agf->agf_levels[XFS_BTNUM_CNT]);
in xfs_allocbt_init_cursor()
543
cur->
bc_nlevels
= be32_to_cpu(agf->agf_levels[XFS_BTNUM_BNO]);
in xfs_allocbt_init_cursor()
H
A
D
xfs_btree.h
277
uint8_t
bc_nlevels
; /* number of levels in the tree */
member
H
A
D
xfs_refcount_btree.c
373
cur->
bc_nlevels
= be32_to_cpu(agf->agf_refcount_level);
in xfs_refcountbt_init_cursor()
H
A
D
xfs_rmap_btree.c
532
cur->
bc_nlevels
= be32_to_cpu(agf->agf_levels[XFS_BTNUM_RMAP]);
in xfs_rmapbt_init_cursor()
/kernel/linux/linux-5.10/fs/xfs/libxfs/
H
A
D
xfs_btree_staging.c
151
cur->
bc_nlevels
= afake->af_levels;
in xfs_btree_stage_afakeroot()
231
cur->
bc_nlevels
= ifake->if_levels;
in xfs_btree_stage_ifakeroot()
380
level == cur->
bc_nlevels
- 1) {
in xfs_btree_bload_prep_block()
522
if (level == cur->
bc_nlevels
- 1 && cur->bc_ops->get_dmaxrecs)
in xfs_btree_bload_max_npb()
547
if (level == cur->
bc_nlevels
- 1)
in xfs_btree_bload_desired_npb()
657
* maxrecs values for the root block (
bc_nlevels
== level - 1). We're
in xfs_btree_bload_compute_geometry()
658
* checking levels 0 and 1 here, so set
bc_nlevels
such that the btree
in xfs_btree_bload_compute_geometry()
661
cur->
bc_nlevels
= XFS_BTREE_MAXLEVELS - 1;
in xfs_btree_bload_compute_geometry()
666
for (cur->
bc_nlevels
= 1; cur->
bc_nlevels
< XFS_BTREE_MAXLEVEL
in xfs_btree_bload_compute_geometry()
[all...]
H
A
D
xfs_btree.c
368
for (i = 0; i < cur->
bc_nlevels
; i++) {
in xfs_btree_del_cursor()
420
for (i = 0; i < new->
bc_nlevels
; i++) {
in xfs_btree_dup_cursor()
682
(level == cur->
bc_nlevels
- 1)) {
in xfs_btree_get_block()
925
(lev == cur->
bc_nlevels
- 1))
in xfs_btree_readahead()
1539
ASSERT(level < cur->
bc_nlevels
);
in xfs_btree_increment()
1568
for (lev = level + 1; lev < cur->
bc_nlevels
; lev++) {
in xfs_btree_increment()
1588
if (lev == cur->
bc_nlevels
) {
in xfs_btree_increment()
1595
ASSERT(lev < cur->
bc_nlevels
);
in xfs_btree_increment()
1641
ASSERT(level < cur->
bc_nlevels
);
in xfs_btree_decrement()
1670
for (lev = level + 1; lev < cur->
bc_nlevels
; le
in xfs_btree_decrement()
[all...]
H
A
D
xfs_bmap_btree.c
302
if (level == cur->
bc_nlevels
- 1) {
in xfs_bmbt_get_minrecs()
320
if (level == cur->
bc_nlevels
- 1) {
in xfs_bmbt_get_maxrecs()
348
if (level != cur->
bc_nlevels
- 1)
in xfs_bmbt_get_dmaxrecs()
559
cur->
bc_nlevels
= be16_to_cpu(ifp->if_broot->bb_level) + 1;
in xfs_bmbt_init_cursor()
H
A
D
xfs_alloc_btree.c
524
cur->
bc_nlevels
= be32_to_cpu(agf->agf_levels[XFS_BTNUM_CNT]);
in xfs_allocbt_init_cursor()
526
cur->
bc_nlevels
= be32_to_cpu(agf->agf_levels[XFS_BTNUM_BNO]);
in xfs_allocbt_init_cursor()
H
A
D
xfs_ialloc_btree.c
470
cur->
bc_nlevels
= be32_to_cpu(agi->agi_level);
in xfs_inobt_init_cursor()
472
cur->
bc_nlevels
= be32_to_cpu(agi->agi_free_level);
in xfs_inobt_init_cursor()
H
A
D
xfs_btree.h
230
uint8_t
bc_nlevels
; /* number of levels in the tree */
member
H
A
D
xfs_rmap_btree.c
485
cur->
bc_nlevels
= be32_to_cpu(agf->agf_levels[XFS_BTNUM_RMAP]);
in xfs_rmapbt_init_cursor()
H
A
D
xfs_refcount_btree.c
354
cur->
bc_nlevels
= be32_to_cpu(agf->agf_refcount_level);
in xfs_refcountbt_init_cursor()
/kernel/linux/linux-6.6/fs/xfs/scrub/
H
A
D
btree.c
161
if (cur->
bc_nlevels
== 1)
in xchk_btree_rec()
209
if (level + 1 >= cur->
bc_nlevels
)
in xchk_btree_key()
243
level == bs->cur->
bc_nlevels
)
in xchk_btree_ptr_ok()
337
if (level == cur->
bc_nlevels
- 1) {
in xchk_btree_block_check_siblings()
497
unsigned int root_level = cur->
bc_nlevels
- 1;
in xchk_btree_check_minrecs()
512
level == cur->
bc_nlevels
- 2) {
in xchk_btree_check_minrecs()
551
if (level == cur->
bc_nlevels
- 1)
in xchk_btree_block_check_keys()
653
if (level >= cur->
bc_nlevels
- 1)
in xchk_btree_block_keys()
709
cur_sz = xchk_btree_sizeof(cur->
bc_nlevels
);
in xchk_btree()
730
level = cur->
bc_nlevels
in xchk_btree()
[all...]
H
A
D
trace.c
26
if (level < cur->
bc_nlevels
&& cur->bc_levels[level].bp)
in xchk_btree_cur_fsbno()
30
if (level == cur->
bc_nlevels
- 1 &&
in xchk_btree_cur_fsbno()
H
A
D
rmap.c
149
for (level = 1; level < cur->
bc_nlevels
; level++) {
in xchk_rmapbt_check_unwritten_in_keyflags()
489
sc->sa.rmap_cur->
bc_nlevels
- 1, &error);
in xchk_rmapbt_walk_ag_metadata()
512
level = cur->
bc_nlevels
- 1;
in xchk_rmapbt_check_bitmaps()
H
A
D
bitmap.c
311
for (i = 0; i < cur->
bc_nlevels
&& cur->bc_levels[i].ptr == 1; i++) {
in xagb_bitmap_set_btcur_path()
H
A
D
bmap.c
459
for (i = 0; i < bs->cur->
bc_nlevels
- 1; i++) {
in xchk_bmapbt_rec()
/kernel/linux/linux-5.10/fs/xfs/scrub/
H
A
D
btree.c
148
if (cur->
bc_nlevels
== 1)
in xchk_btree_rec()
196
if (level + 1 >= cur->
bc_nlevels
)
in xchk_btree_key()
229
level == bs->cur->
bc_nlevels
)
in xchk_btree_ptr_ok()
323
if (level == cur->
bc_nlevels
- 1) {
in xchk_btree_block_check_siblings()
456
unsigned int root_level = cur->
bc_nlevels
- 1;
in xchk_btree_check_minrecs()
471
level == cur->
bc_nlevels
- 2) {
in xchk_btree_check_minrecs()
564
if (level >= cur->
bc_nlevels
- 1)
in xchk_btree_block_keys()
628
if (cur->
bc_nlevels
> XFS_BTREE_MAXLEVELS) {
in xchk_btree()
637
level = cur->
bc_nlevels
- 1;
in xchk_btree()
639
if (!xchk_btree_ptr_ok(&bs, cur->
bc_nlevels
,
in xchk_btree()
[all...]
H
A
D
trace.c
23
if (level < cur->
bc_nlevels
&& cur->bc_bufs[level])
in xchk_btree_cur_fsbno()
25
else if (level == cur->
bc_nlevels
- 1 &&
in xchk_btree_cur_fsbno()
H
A
D
bitmap.c
259
for (i = 0; i < cur->
bc_nlevels
&& cur->bc_ptrs[i] == 1; i++) {
in xbitmap_set_btcur_path()
H
A
D
bmap.c
410
for (i = 0; i < bs->cur->
bc_nlevels
- 1; i++) {
in xchk_bmapbt_rec()
Completed in 37 milliseconds
1
2