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:BLKH_SIZE
(Results
1 - 8
of
8
) sorted by relevance
/kernel/linux/linux-5.10/fs/reiserfs/
H
A
D
prints.c
738
if (nr > (bh->b_size -
BLKH_SIZE
) / IH_SIZE)
in check_leaf_block_head()
741
if (blkh_free_space(blkh) > bh->b_size -
BLKH_SIZE
- IH_SIZE * nr)
in check_leaf_block_head()
752
if (B_NR_ITEMS(bh) > (bh->b_size -
BLKH_SIZE
) / IH_SIZE)
in check_internal_block_head()
756
bh->b_size -
BLKH_SIZE
- KEY_SIZE * B_NR_ITEMS(bh) -
in check_internal_block_head()
H
A
D
stree.c
425
if (nr < 1 || nr > ((blocksize -
BLKH_SIZE
) / (IH_SIZE + MIN_ITEM_LEN))) {
in is_leaf()
431
ih = (struct item_head *)(buf +
BLKH_SIZE
) + nr - 1;
in is_leaf()
432
used_space =
BLKH_SIZE
+ IH_SIZE * nr + (blocksize - ih_location(ih));
in is_leaf()
446
ih = (struct item_head *)(buf +
BLKH_SIZE
);
in is_leaf()
509
if (nr > (blocksize -
BLKH_SIZE
- DC_SIZE) / (KEY_SIZE + DC_SIZE)) {
in is_internal()
515
used_space =
BLKH_SIZE
+ KEY_SIZE * nr + DC_SIZE * (nr + 1);
in is_internal()
H
A
D
reiserfs.h
1625
#define MAX_ITEM_LEN(block_size) (block_size -
BLKH_SIZE
- IH_SIZE)
1658
#define
BLKH_SIZE
(sizeof(struct block_head))
macro
2051
((bh)->b_data +
BLKH_SIZE
+ B_NR_ITEMS(bh) * KEY_SIZE + DC_SIZE * (n_pos)))
2060
#define MAX_CHILD_SIZE(bh) ((int)( (bh)->b_size -
BLKH_SIZE
))
2681
#define MAX_DIRECT_ITEM_LEN(size) ((size) -
BLKH_SIZE
- 2*IH_SIZE - SD_SIZE - UNFM_P_SIZE)
H
A
D
fix_node.c
2249
max_num_of_items = (blocksize -
BLKH_SIZE
) / (IH_SIZE + MIN_ITEM_LEN);
in get_virtual_node_size()
2250
max_num_of_entries = (blocksize -
BLKH_SIZE
- IH_SIZE) /
in get_virtual_node_size()
/kernel/linux/linux-6.6/fs/reiserfs/
H
A
D
prints.c
738
if (nr > (bh->b_size -
BLKH_SIZE
) / IH_SIZE)
in check_leaf_block_head()
741
if (blkh_free_space(blkh) > bh->b_size -
BLKH_SIZE
- IH_SIZE * nr)
in check_leaf_block_head()
752
if (B_NR_ITEMS(bh) > (bh->b_size -
BLKH_SIZE
) / IH_SIZE)
in check_internal_block_head()
756
bh->b_size -
BLKH_SIZE
- KEY_SIZE * B_NR_ITEMS(bh) -
in check_internal_block_head()
H
A
D
stree.c
425
if (nr < 1 || nr > ((blocksize -
BLKH_SIZE
) / (IH_SIZE + MIN_ITEM_LEN))) {
in is_leaf()
431
ih = (struct item_head *)(buf +
BLKH_SIZE
) + nr - 1;
in is_leaf()
432
used_space =
BLKH_SIZE
+ IH_SIZE * nr + (blocksize - ih_location(ih));
in is_leaf()
446
ih = (struct item_head *)(buf +
BLKH_SIZE
);
in is_leaf()
509
if (nr > (blocksize -
BLKH_SIZE
- DC_SIZE) / (KEY_SIZE + DC_SIZE)) {
in is_internal()
515
used_space =
BLKH_SIZE
+ KEY_SIZE * nr + DC_SIZE * (nr + 1);
in is_internal()
H
A
D
reiserfs.h
1622
#define MAX_ITEM_LEN(block_size) (block_size -
BLKH_SIZE
- IH_SIZE)
1655
#define
BLKH_SIZE
(sizeof(struct block_head))
macro
2048
((bh)->b_data +
BLKH_SIZE
+ B_NR_ITEMS(bh) * KEY_SIZE + DC_SIZE * (n_pos)))
2057
#define MAX_CHILD_SIZE(bh) ((int)( (bh)->b_size -
BLKH_SIZE
))
2678
#define MAX_DIRECT_ITEM_LEN(size) ((size) -
BLKH_SIZE
- 2*IH_SIZE - SD_SIZE - UNFM_P_SIZE)
H
A
D
fix_node.c
2249
max_num_of_items = (blocksize -
BLKH_SIZE
) / (IH_SIZE + MIN_ITEM_LEN);
in get_virtual_node_size()
2250
max_num_of_entries = (blocksize -
BLKH_SIZE
- IH_SIZE) /
in get_virtual_node_size()
Completed in 26 milliseconds