drivers/iommu/iommufd/io_pagetable.c

110

if (span->is_hole)

drivers/iommu/iommufd/io_pagetable.c

161

allowed_span.is_hole = false;

drivers/iommu/iommufd/ioas.c

89

if (!span.is_hole)

drivers/iommu/iommufd/pages.c

118

if (iter->spans[i].is_hole) {

drivers/iommu/iommufd/vfio_compat.c

392

if (!span.is_hole)

fs/f2fs/data.c

1676

bool is_hole;

fs/f2fs/data.c

1746

is_hole = !__is_valid_data_blkaddr(blkaddr);

fs/f2fs/data.c

1747

if (!is_hole &&

fs/f2fs/data.c

1754

if (map->m_may_create && (is_hole ||

fs/f2fs/data.c

1785

if (is_hole)

fs/f2fs/data.c

1787

} else if (is_hole) {

fs/f2fs/data.c

1833

if (!(flag == F2FS_GET_BLOCK_DIO && is_hole && !map->m_may_create))

fs/f2fs/data.c

1934

*map->m_next_extent = is_hole ? pgofs + 1 : pgofs;

fs/nfs/blocklayout/blocklayout.c

282

if (is_hole(&be)) {

include/linux/interval_tree.h

68

int is_hole;

include/linux/interval_tree.h

83

return state->is_hole == -1;

lib/interval_tree.c

104

iter->is_hole = 0;

lib/interval_tree.c

113

iter->is_hole = 1;

lib/interval_tree.c

120

iter->is_hole = 1;

lib/interval_tree.c

135

if (iter->is_hole == -1)

lib/interval_tree.c

140

iter->is_hole = -1;

lib/interval_tree.c

64

iter->is_hole = 1;

lib/interval_tree.c

71

iter->is_hole = 1;

lib/interval_tree.c

78

iter->is_hole = 0;

lib/interval_tree.c

92

iter->is_hole = -1;

lib/interval_tree.c

96

if (iter->is_hole) {

lib/interval_tree_test.c

207

int is_hole;

lib/interval_tree_test.c

213

state->is_hole = mas_walk(mas) ? 0 : 1;

lib/interval_tree_test.c

224

is_hole = mas_next_range(mas, state->last_index) ? 0 : 1;

lib/interval_tree_test.c

226

} while (mas->status != ma_overflow && is_hole == state->is_hole);

lib/interval_tree_test.c

228

if (state->is_hole) {

lib/interval_tree_test.c

280

mas_span.is_hole = -1;

lib/interval_tree_test.c

286

WARN_ON_ONCE(span.is_hole != mas_span.is_hole);

lib/interval_tree_test.c

288

if (span.is_hole) {