Searched refs:extents (Results 1 - 19 of 19) sorted by relevance

/linux-master/fs/xfs/
H A Dxfs_discard.c29 * discards on extents that might be in use, or are so recently in use they are
31 * gathering extents to trim, we must hold the AGF lock to lock out other
37 * couple of million free extents and issuing synchronous discards on each
55 * This is exactly how online discard works - free extents are marked busy when
80 struct xfs_busy_extents *extents = local
83 xfs_extent_busy_clear(extents->mount, &extents->extent_list, false);
84 kfree(extents->owner);
95 struct xfs_busy_extents *extents = bio->bi_private; local
97 INIT_WORK(&extents
108 xfs_discard_extents( struct xfs_mount *mp, struct xfs_busy_extents *extents) argument
150 xfs_trim_gather_extents( struct xfs_perag *pag, xfs_daddr_t start, xfs_daddr_t end, xfs_daddr_t minlen, struct xfs_alloc_rec_incore *tcur, struct xfs_busy_extents *extents, uint64_t *blocks_trimmed) argument
321 struct xfs_busy_extents *extents; local
[all...]
/linux-master/fs/btrfs/tests/
H A Dfree-space-tree-tests.c24 const struct free_space_extent * const extents,
65 extent_start != extents[i].start ||
66 offset - extent_start != extents[i].length)
76 extent_start != extents[i].start ||
77 end - extent_start != extents[i].length)
91 key.objectid != extents[i].start ||
92 key.offset != extents[i].length)
111 const struct free_space_extent * const extents,
127 ret = __check_free_space_extents(trans, fs_info, cache, path, extents,
136 test_err("could not convert to extents");
20 __check_free_space_extents(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, struct btrfs_block_group *cache, struct btrfs_path *path, const struct free_space_extent * const extents, unsigned int num_extents) argument
107 check_free_space_extents(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, struct btrfs_block_group *cache, struct btrfs_path *path, const struct free_space_extent * const extents, unsigned int num_extents) argument
156 const struct free_space_extent extents[] = { local
170 const struct free_space_extent extents[] = {}; local
191 const struct free_space_extent extents[] = { local
214 const struct free_space_extent extents[] = { local
237 const struct free_space_extent extents[] = { local
261 const struct free_space_extent extents[] = { local
298 const struct free_space_extent extents[] = { local
336 const struct free_space_extent extents[] = { local
379 const struct free_space_extent extents[] = { local
[all...]
/linux-master/drivers/md/bcache/
H A DMakefile5 bcache-y := alloc.o bset.o btree.o debug.o extents.o io.o\
/linux-master/fs/hfsplus/
H A DMakefile8 hfsplus-objs := super.o options.o inode.o ioctl.o extents.o catalog.o dir.o btree.o \
H A Dhfsplus_raw.h100 hfsplus_extent_rec extents; member in struct:hfsplus_fork_raw
342 /* HFS+ extents tree key */
382 struct hfsplus_extent extents; member in struct:hfsplus_attr_extents
400 struct hfsplus_attr_extents extents; member in union:__anon66
H A Dextents.c3 * linux/fs/hfsplus/extents.c
9 * Handling of Extents both in catalog and extents overflow trees
19 /* Compare two extents keys, returns 0 on same, pos/neg for difference */
264 * the extents btree. In that case we may have to mark the inode
385 * Try to free all extents and
410 blocks += be32_to_cpu(fork->extents[i].block_count);
412 res = hfsplus_free_extents(sb, fork->extents, blocks, blocks);
487 hfs_dbg(EXTENT, "first extents\n");
488 /* no extents yet */
493 /* try to append to extents i
[all...]
H A Dinode.c467 memcpy(&hip->first_extents, &fork->extents, sizeof(hfsplus_extent_rec));
469 count += be32_to_cpu(fork->extents[i].block_count);
492 memcpy(&fork->extents, &HFSPLUS_I(inode)->first_extents,
/linux-master/fs/efs/
H A Dinode.c127 /* get the number of extents for this object */
131 /* copy the extents contained within the inode to memory */
133 extent_copy(&(efs_inode->di_u.di_extents[i]), &(in->extents[i]));
134 if (i < in->numextents && in->extents[i].cooked.ex_magic != 0) {
143 pr_debug("efs_iget(): inode %lu, extents %d, mode %o\n",
214 if ((result = efs_extent_check(&in->extents[last], block, sb)))
226 * check the stored extents in the inode
231 if ((result = efs_extent_check(&in->extents[cur], block, sb))) {
243 direxts = in->extents[0].cooked.ex_offset;
258 ibase += in->extents[direx
[all...]
H A Defs.h63 __be16 di_numextents; /* # of extents */
77 efs_extent extents[EFS_DIRECTEXTENTS]; member in struct:efs_inode_info
/linux-master/kernel/
H A Duser_namespace.c279 map_id_range_down_max(unsigned extents, struct uid_gid_map *map, u32 id, u32 count) argument
287 return bsearch(&key, map->forward, extents,
297 map_id_range_down_base(unsigned extents, struct uid_gid_map *map, u32 id, u32 count) argument
305 for (idx = 0; idx < extents; idx++) {
318 unsigned extents = map->nr_extents; local
321 if (extents <= UID_GID_MAP_MAX_BASE_EXTENTS)
322 extent = map_id_range_down_base(extents, map, id, count);
324 extent = map_id_range_down_max(extents, map, id, count);
346 map_id_up_base(unsigned extents, struct uid_gid_map *map, u32 id) argument
352 for (idx = 0; idx < extents; id
366 map_id_up_max(unsigned extents, struct uid_gid_map *map, u32 id) argument
381 unsigned extents = map->nr_extents; local
669 unsigned extents = map->nr_extents; local
[all...]
/linux-master/fs/ext4/
H A DMakefile8 ext4-y := balloc.o bitmap.o block_validity.o dir.o ext4_jbd2.o extents.o \
H A Dext4.h86 * Turn on EXT_DEBUG to enable ext4_ext_show_path/leaf/move in extents.c
91 * Dynamic printk for controlled extents debugging.
287 * For converting unwritten extents on a work queue. 'handle' is used for
493 #define EXT4_EXTENTS_FL 0x00080000 /* Inode uses extents */
592 EXT4_INODE_EXTENTS = 19, /* Inode uses extents */
695 unwritten extents if not allocated, split the unwritten
709 /* Convert written extents to unwritten */
711 /* Write zeros to newly created written extents */
727 * caching the extents when reading from the extent tree while a
759 /* Max physical block we can address w/o extents */
[all...]
H A Dextents.c168 * buffer if the extents updating procudure break off du
416 /* Check for overlapping extents */
440 /* Check for overlapping index extents */
698 ext_debug(inode, "Displaying leaf extents\n");
1048 * - moves remaining extents and index entries (right to the split point)
1798 * Returns 0 if the extents (ex and ex+1) were _not_ merged and returns
2150 "move %d extents from 0x%p to 0x%p\n",
2168 /* try to merge extents */
2362 * How many index/leaf blocks need to change/allocate to add @extents extents
2370 ext4_ext_index_trans_blocks(struct inode *inode, int extents) argument
[all...]
/linux-master/fs/bcachefs/
H A DMakefile39 extents.o \
H A Dbcachefs_format.h19 * sharded - we have one btree for extents, another for inodes, et cetera.
1473 x(extents, 0, BTREE_ID_EXTENTS|BTREE_ID_SNAPSHOTS|BTREE_ID_DATA,\
/linux-master/fs/nfs/blocklayout/
H A Dblocklayout.c259 /* Code assumes extents are page-aligned */
494 /* Tracks info needed to ensure extents in layout obey constraints of spec */
590 struct layout_verification *lv, struct list_head *extents,
635 list_add_tail(&be->be_list, extents);
663 LIST_HEAD(extents);
686 dprintk("%s: number of extents %d\n", __func__, count);
689 * Decode individual extents, putting them in temporary staging area
693 status = bl_alloc_extent(&xdr, lo, &lv, &extents, gfp_mask);
711 while (!list_empty(&extents)) {
713 list_first_entry(&extents, struc
589 bl_alloc_extent(struct xdr_stream *xdr, struct pnfs_layout_hdr *lo, struct layout_verification *lv, struct list_head *extents, gfp_t gfp_mask) argument
[all...]
/linux-master/fs/smb/client/
H A Dsmb2pdu.h244 struct smb3_extents extents[]; member in struct:get_retrieval_pointers_refcount_rsp
/linux-master/fs/btrfs/
H A Dtree-log.c94 * The last stage is to deal with directories and links and extents
133 * subvolume tree. Any file data extents found are recorded in the extent
136 * The log tree is read three times, once to pin down all the extents it is
292 /* pin only walk, we record which extents on disk belong to the
323 * process_func used to pin down extents, write them or wait on them
334 * pin down any logged extents, so we have to read the block.
447 * replay the extents we've logged we get the right nbytes.
476 * properly when we replay the extents.
613 * extents in the log tree have not been allocated out of the extent
618 * The extent is inserted into the file, dropping any existing extents
[all...]
H A Dinode.c409 * Cleanup all submitted ordered extents in specified range to handle errors
588 * We align size to sectorsize for inline extents just for simplicity
720 struct list_head extents; member in struct:async_chunk
749 list_add_tail(&async_extent->list, &cow->extents);
1258 * allocate extents on disk for the range, and create ordered data structs
1259 * in ram to track those extents.
1268 * (In reality inline extents are limited to a single page, so locked_page is
1278 * while-loop, the ordered extents created in previous iterations are kept
1368 * Relocation relies on the relocated extents to have exactly the same
1369 * size as the original extents
[all...]

Completed in 470 milliseconds