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:is_hole
(Results
1 - 9
of
9
) sorted by relevance
/kernel/linux/linux-6.6/lib/
H
A
D
interval_tree.c
57
iter->
is_hole
= 1;
in interval_tree_span_iter_first()
64
iter->
is_hole
= 1;
in interval_tree_span_iter_first()
71
iter->
is_hole
= 0;
in interval_tree_span_iter_first()
85
iter->
is_hole
= -1;
in interval_tree_span_iter_next()
89
if (iter->
is_hole
) {
in interval_tree_span_iter_next()
97
iter->
is_hole
= 0;
in interval_tree_span_iter_next()
106
iter->
is_hole
= 1;
in interval_tree_span_iter_next()
113
iter->
is_hole
= 1;
in interval_tree_span_iter_next()
128
if (iter->
is_hole
== -1)
in interval_tree_span_iter_advance()
133
iter->
is_hole
in interval_tree_span_iter_advance()
[all...]
/kernel/linux/linux-6.6/include/linux/
H
A
D
interval_tree.h
32
* @start_hole: Start of an interval for a hole when
is_hole
== 1
33
* @last_hole: Inclusive end of an interval for a hole when
is_hole
== 1
34
* @start_used: Start of a used interval when
is_hole
== 0
35
* @last_used: Inclusive end of a used interval when
is_hole
== 0
36
* @
is_hole
: 0 == used, 1 ==
is_hole
, -1 == done iteration
64
int
is_hole
;
member
79
return state->
is_hole
== -1;
in interval_tree_span_iter_done()
/kernel/linux/linux-5.10/fs/nfs/blocklayout/
H
A
D
blocklayout.c
52
static bool
is_hole
(struct pnfs_block_extent *be)
in is_hole()
function
306
if (
is_hole
(&be)) {
in bl_read_pagelist()
/kernel/linux/linux-6.6/fs/nfs/blocklayout/
H
A
D
blocklayout.c
52
static bool
is_hole
(struct pnfs_block_extent *be)
in is_hole()
function
283
if (
is_hole
(&be)) {
in bl_read_pagelist()
/kernel/linux/linux-6.6/fs/f2fs/
H
A
D
data.c
1600
bool
is_hole
;
in f2fs_map_blocks()
local
1641
is_hole
= !__is_valid_data_blkaddr(blkaddr);
in f2fs_map_blocks()
1642
if (!
is_hole
&&
in f2fs_map_blocks()
1651
(
is_hole
|| (f2fs_lfs_mode(sbi) && flag == F2FS_GET_BLOCK_DIO))) {
in f2fs_map_blocks()
1680
if (
is_hole
)
in f2fs_map_blocks()
1682
} else if (
is_hole
) {
in f2fs_map_blocks()
/kernel/linux/linux-6.6/drivers/iommu/iommufd/
H
A
D
vfio_compat.c
397
if (!span.
is_hole
)
in iommufd_fill_cap_iova()
H
A
D
ioas.c
85
if (!span.
is_hole
)
in iommufd_ioas_iova_ranges()
H
A
D
io_pagetable.c
93
if (span->
is_hole
|| span->last_used - span->start_used < length - 1)
in __alloc_iova_check_used()
141
allowed_span.
is_hole
= false;
in iopt_alloc_iova()
H
A
D
pages.c
114
if (iter->spans[i].
is_hole
) {
in interval_tree_double_span_iter_update()
Completed in 16 milliseconds