extents 370 fs/btrfs/inode.c struct list_head extents; extents 398 fs/btrfs/inode.c list_add_tail(&async_extent->list, &cow->extents); extents 766 fs/btrfs/inode.c while (!list_empty(&async_chunk->extents)) { extents 767 fs/btrfs/inode.c async_extent = list_entry(async_chunk->extents.next, extents 1270 fs/btrfs/inode.c INIT_LIST_HEAD(&async_chunk[i].extents); extents 23 fs/btrfs/tests/free-space-tree-tests.c const struct free_space_extent * const extents, extents 66 fs/btrfs/tests/free-space-tree-tests.c extent_start != extents[i].start || extents 67 fs/btrfs/tests/free-space-tree-tests.c offset - extent_start != extents[i].length) extents 77 fs/btrfs/tests/free-space-tree-tests.c extent_start != extents[i].start || extents 78 fs/btrfs/tests/free-space-tree-tests.c end - extent_start != extents[i].length) extents 92 fs/btrfs/tests/free-space-tree-tests.c key.objectid != extents[i].start || extents 93 fs/btrfs/tests/free-space-tree-tests.c key.offset != extents[i].length) extents 112 fs/btrfs/tests/free-space-tree-tests.c const struct free_space_extent * const extents, extents 128 fs/btrfs/tests/free-space-tree-tests.c ret = __check_free_space_extents(trans, fs_info, cache, path, extents, extents 147 fs/btrfs/tests/free-space-tree-tests.c return __check_free_space_extents(trans, fs_info, cache, path, extents, extents 157 fs/btrfs/tests/free-space-tree-tests.c const struct free_space_extent extents[] = { extents 162 fs/btrfs/tests/free-space-tree-tests.c extents, ARRAY_SIZE(extents)); extents 171 fs/btrfs/tests/free-space-tree-tests.c const struct free_space_extent extents[] = {}; extents 183 fs/btrfs/tests/free-space-tree-tests.c extents, ARRAY_SIZE(extents)); extents 192 fs/btrfs/tests/free-space-tree-tests.c const struct free_space_extent extents[] = { extents 206 fs/btrfs/tests/free-space-tree-tests.c extents, ARRAY_SIZE(extents)); extents 216 fs/btrfs/tests/free-space-tree-tests.c const struct free_space_extent extents[] = { extents 231 fs/btrfs/tests/free-space-tree-tests.c extents, ARRAY_SIZE(extents)); extents 240 fs/btrfs/tests/free-space-tree-tests.c const struct free_space_extent extents[] = { extents 256 fs/btrfs/tests/free-space-tree-tests.c extents, ARRAY_SIZE(extents)); extents 265 fs/btrfs/tests/free-space-tree-tests.c const struct free_space_extent extents[] = { extents 294 fs/btrfs/tests/free-space-tree-tests.c extents, ARRAY_SIZE(extents)); extents 303 fs/btrfs/tests/free-space-tree-tests.c const struct free_space_extent extents[] = { extents 333 fs/btrfs/tests/free-space-tree-tests.c extents, ARRAY_SIZE(extents)); extents 342 fs/btrfs/tests/free-space-tree-tests.c const struct free_space_extent extents[] = { extents 379 fs/btrfs/tests/free-space-tree-tests.c extents, ARRAY_SIZE(extents)); extents 388 fs/btrfs/tests/free-space-tree-tests.c const struct free_space_extent extents[] = { extents 427 fs/btrfs/tests/free-space-tree-tests.c extents, ARRAY_SIZE(extents)); extents 4376 fs/btrfs/tree-log.c struct list_head extents; extents 4382 fs/btrfs/tree-log.c INIT_LIST_HEAD(&extents); extents 4429 fs/btrfs/tree-log.c list_add_tail(&em->list, &extents); extents 4433 fs/btrfs/tree-log.c list_sort(NULL, &extents, extent_cmp); extents 4435 fs/btrfs/tree-log.c while (!list_empty(&extents)) { extents 4436 fs/btrfs/tree-log.c em = list_entry(extents.next, struct extent_map, list); extents 4457 fs/btrfs/tree-log.c WARN_ON(!list_empty(&extents)); extents 80 fs/efs/efs.h efs_extent extents[EFS_DIRECTEXTENTS]; extents 132 fs/efs/inode.c extent_copy(&(efs_inode->di_u.di_extents[i]), &(in->extents[i])); extents 133 fs/efs/inode.c if (i < in->numextents && in->extents[i].cooked.ex_magic != 0) { extents 213 fs/efs/inode.c if ((result = efs_extent_check(&in->extents[last], block, sb))) extents 230 fs/efs/inode.c if ((result = efs_extent_check(&in->extents[cur], block, sb))) { extents 242 fs/efs/inode.c direxts = in->extents[0].cooked.ex_offset; extents 257 fs/efs/inode.c ibase += in->extents[dirext].cooked.ex_length * extents 270 fs/efs/inode.c iblock = sb->fs_start + in->extents[dirext].cooked.ex_bn + extents 1822 fs/ext4/ext4.h EXT4_FEATURE_INCOMPAT_FUNCS(extents, EXTENTS) extents 3279 fs/ext4/ext4.h extern int ext4_ext_index_trans_blocks(struct inode *inode, int extents); extents 2534 fs/ext4/extents.c int ext4_ext_index_trans_blocks(struct inode *inode, int extents) extents 2545 fs/ext4/extents.c if (extents <= 1) extents 410 fs/hfsplus/extents.c blocks += be32_to_cpu(fork->extents[i].block_count); extents 412 fs/hfsplus/extents.c res = hfsplus_free_extents(sb, fork->extents, blocks, blocks); extents 100 fs/hfsplus/hfsplus_raw.h hfsplus_extent_rec extents; extents 378 fs/hfsplus/hfsplus_raw.h struct hfsplus_extent extents; extents 396 fs/hfsplus/hfsplus_raw.h struct hfsplus_attr_extents extents; extents 457 fs/hfsplus/inode.c memcpy(&hip->first_extents, &fork->extents, sizeof(hfsplus_extent_rec)); extents 459 fs/hfsplus/inode.c count += be32_to_cpu(fork->extents[i].block_count); extents 482 fs/hfsplus/inode.c memcpy(&fork->extents, &HFSPLUS_I(inode)->first_extents, extents 612 fs/nfs/blocklayout/blocklayout.c struct layout_verification *lv, struct list_head *extents, extents 657 fs/nfs/blocklayout/blocklayout.c list_add_tail(&be->be_list, extents); extents 685 fs/nfs/blocklayout/blocklayout.c LIST_HEAD(extents); extents 715 fs/nfs/blocklayout/blocklayout.c status = bl_alloc_extent(&xdr, lo, &lv, &extents, gfp_mask); extents 733 fs/nfs/blocklayout/blocklayout.c while (!list_empty(&extents)) { extents 735 fs/nfs/blocklayout/blocklayout.c list_first_entry(&extents, struct pnfs_block_extent, extents 254 kernel/user_namespace.c map_id_range_down_max(unsigned extents, struct uid_gid_map *map, u32 id, u32 count) extents 262 kernel/user_namespace.c return bsearch(&key, map->forward, extents, extents 272 kernel/user_namespace.c map_id_range_down_base(unsigned extents, struct uid_gid_map *map, u32 id, u32 count) extents 280 kernel/user_namespace.c for (idx = 0; idx < extents; idx++) { extents 293 kernel/user_namespace.c unsigned extents = map->nr_extents; extents 296 kernel/user_namespace.c if (extents <= UID_GID_MAP_MAX_BASE_EXTENTS) extents 297 kernel/user_namespace.c extent = map_id_range_down_base(extents, map, id, count); extents 299 kernel/user_namespace.c extent = map_id_range_down_max(extents, map, id, count); extents 321 kernel/user_namespace.c map_id_up_base(unsigned extents, struct uid_gid_map *map, u32 id) extents 327 kernel/user_namespace.c for (idx = 0; idx < extents; idx++) { extents 341 kernel/user_namespace.c map_id_up_max(unsigned extents, struct uid_gid_map *map, u32 id) extents 349 kernel/user_namespace.c return bsearch(&key, map->reverse, extents, extents 356 kernel/user_namespace.c unsigned extents = map->nr_extents; extents 359 kernel/user_namespace.c if (extents <= UID_GID_MAP_MAX_BASE_EXTENTS) extents 360 kernel/user_namespace.c extent = map_id_up_base(extents, map, id); extents 362 kernel/user_namespace.c extent = map_id_up_max(extents, map, id); extents 644 kernel/user_namespace.c unsigned extents = map->nr_extents; extents 647 kernel/user_namespace.c if (pos >= extents) extents 650 kernel/user_namespace.c if (extents <= UID_GID_MAP_MAX_BASE_EXTENTS)