Searched refs:space (Results 1 - 25 of 25) sorted by relevance

/fs/xfs/
H A Dxfs_log_priv.h86 * space allocation transactions which can undo non-transactional changes
87 * after a crash. Writes to a file with space
89 * might include space beyond the EOF. So if we just push the EOF a
140 * one file space allocation. When this happens, the log recovery
141 * code replays the space allocation and a file could be truncated.
189 * xlog_rec_header_t into the reserved space.
295 * The amount of log space we allow the CIL to aggregate is difficult to size.
297 * log space effectively, that it is large enough to capture sufficient
300 * track both space consumed and the number of vectors in the checkpoint
305 * at least 512 bytes per 32k of log space jus
493 xlog_crack_grant_head_val(int64_t val, int *cycle, int *space) argument
500 xlog_crack_grant_head(atomic64_t *head, int *cycle, int *space) argument
502 xlog_crack_grant_head_val(atomic64_read(head), cycle, space); local
506 xlog_assign_grant_head_val(int cycle, int space) argument
512 xlog_assign_grant_head(atomic64_t *head, int cycle, int space) argument
[all...]
H A Dxfs_dquot.c277 __uint64_t space; local
287 space = dqp->q_prealloc_hi_wmark;
289 do_div(space, 100);
290 dqp->q_low_space[XFS_QLOWSP_1_PCNT] = space;
291 dqp->q_low_space[XFS_QLOWSP_3_PCNT] = space * 3;
292 dqp->q_low_space[XFS_QLOWSP_5_PCNT] = space * 5;
H A Dxfs_log.c149 int cycle, space; local
151 xlog_crack_grant_head_val(head_val, &cycle, &space);
153 space -= bytes;
154 if (space < 0) {
155 space += log->l_logsize;
160 new = xlog_assign_grant_head_val(cycle, space);
176 int cycle, space; local
178 xlog_crack_grant_head_val(head_val, &cycle, &space);
180 tmp = log->l_logsize - space;
182 space
3684 int cycle, space; local
[all...]
H A Dxfs_mount.c239 * the legacy 32-bit address space clear the inode32 option.
497 * precalculate the low space thresholds for dynamic speculative preallocation.
506 __uint64_t space = mp->m_sb.sb_dblocks; local
508 do_div(space, 100);
509 mp->m_low_space[i] = space * (i + 1);
628 * We default to 5% or 8192 fsbs of space reserved, whichever is
740 /* set the low space thresholds for dynamic preallocation */
953 * Now we are mounted, reserve a small amount of unused space for
955 * space required for critical operations can dip into this pool
958 * are not allowed to use this reserved space
[all...]
/fs/btrfs/
H A DMakefile9 export.o tree-log.o free-space-cache.o zlib.o lzo.o \
17 btrfs-$(CONFIG_BTRFS_FS_RUN_SANITY_TESTS) += tests/free-space-tests.o \
H A Dioctl.c3862 struct btrfs_ioctl_space_info *space)
3866 space->total_bytes = 0;
3867 space->used_bytes = 0;
3868 space->flags = 0;
3870 space->flags = block_group->flags;
3871 space->total_bytes += block_group->key.offset;
3872 space->used_bytes +=
3880 struct btrfs_ioctl_space_info space; local
3940 /* we generally have at most 6 or so space infos, one for each raid
3976 &info->block_groups[c], &space);
3861 btrfs_get_block_group_info(struct list_head *groups_list, struct btrfs_ioctl_space_info *space) argument
[all...]
H A Ddisk-io.c44 #include "free-space-cache.h"
411 * BTRFS_SUPER_INFO_SIZE range, we expect that the unused space
2317 * the real end of the address space is determined by all of
2795 printk(KERN_ERR "BTRFS: Failed to initial space info: %d\n", ret);
3041 /* we can't trust the free space cache either */
3339 struct btrfs_ioctl_space_info space; local
3373 &sinfo->block_groups[c], &space);
3374 if (space.total_bytes == 0 ||
3375 space.used_bytes == 0)
3377 flags = space
[all...]
H A Dctree.c3540 * space used both by the item structs and the item data
3565 * The space between the end of the leaf items and
3577 "leaf free space ret %d, leaf data size %lu, used %d nritems %d",
3629 int space = btrfs_leaf_free_space(root, left); local
3630 if (space + push_space * 2 > free_space)
3848 int space = btrfs_leaf_free_space(root, right); local
3849 if (space + push_space * 2 > free_space)
H A Dctree.h109 /* for space balancing */
120 /* For storing free space cache */
558 * [item0, item1....itemN] [free space] [dataN...data1, data0]
602 * and to force calls to keep space in the nodes
674 /* dev extents record free space on individual devices. The owner
833 /* btrfs virtual address space subset filter [vstart..vend) */
900 * disk space consumed by the extent, checksum blocks are included
1133 u64 total_bytes; /* total bytes in the space,
1146 chunks for this space */
1149 unsigned int flush:1; /* set if we are trying to make space */
[all...]
/fs/efs/
H A Defs.h105 unsigned char space[EFS_DIRBSIZE - EFS_DIRBLK_HEADERSIZE]; member in struct:efs_dir
112 #define EFS_SLOTAT(dir, slot) EFS_REALOFF((dir)->space[slot])
H A Ddir.c66 if (dirblock->space[slot] == 0)
/fs/fat/
H A Dnamei_msdos.c30 int space; local
43 space = 1;
68 space = (c == ' ');
71 if (space)
101 space = c == ' ';
107 if (space)
/fs/quota/
H A Dquota_v1.c21 static inline qsize_t v1_stoqb(qsize_t space) argument
23 return (space + QUOTABLOCK_SIZE - 1) >> QUOTABLOCK_BITS;
H A Dquota_v2.c48 static inline qsize_t v2_stoqb(qsize_t space) argument
50 return (space + QUOTABLOCK_SIZE - 1) >> QUOTABLOCK_BITS;
123 /* used space is stored as unsigned 64-bit value */
H A Ddquot.c114 * Currently dquot is locked only when it is being read to memory (or space for
400 * Read dquot from disk and alloc space for it
878 /* Read the dquot / allocate space in quota file */
1071 * Claim reserved quota space
1287 static int check_bdq(struct dquot *dquot, qsize_t space, int prealloc, argument
1298 + space;
1355 static int info_bdq_free(struct dquot *dquot, qsize_t space) argument
1361 if (dquot->dq_dqb.dqb_curspace - space <= dquot->dq_dqb.dqb_bsoftlimit)
1364 dquot->dq_dqb.dqb_curspace - space < dquot->dq_dqb.dqb_bhardlimit)
1382 * might need a lot of space i
1831 qsize_t space, cur_space; local
2388 stoqb(qsize_t space) argument
[all...]
/fs/xfs/libxfs/
H A Dxfs_dir2.c240 * Enter a name in a directory, or check for available space.
241 * If inum is 0, only the available space test is performed.
542 * See if this entry can be added to the directory without allocating space.
566 int space, /* v2 dir's space XFS_DIR2_xxx_SPACE */
575 trace_xfs_dir2_grow_inode(args, space);
578 * Set lowest possible block in the space requested.
580 bno = XFS_B_TO_FSBT(mp, space * XFS_DIR2_SPACE_SIZE);
590 * Update file's size if this is the data space and it grew.
592 if (space
564 xfs_dir2_grow_inode( struct xfs_da_args *args, int space, xfs_dir2_db_t *dbp) argument
[all...]
H A Dxfs_dir2_priv.h30 * Convert dataptr to byte in file space
39 * Convert byte in file space to dataptr. It had better be aligned.
48 * Convert byte in space to (DB) block
66 * Convert byte in space to offset in a block
84 * Convert block and offset to byte in space
103 * Convert byte in space to (DA) block
131 * Convert block (dablk) to byte offset in space
159 extern int xfs_dir2_grow_inode(struct xfs_da_args *args, int space,
H A Dxfs_attr_leaf.c296 * attribute space will be able to fit inline.
339 * For attr2 we can try to move the forkoff if there is space in the
341 * space in the fixed attribute fork.
354 * minimum offset only needs to be the space required for
378 * A data fork btree root must have space for at least
1015 * Allocate space for a new leaf node.
1094 continue; /* no space in this map */
1106 * If there are no holes in the address space of the block,
1114 * Compact the entries to coalesce free space.
1163 * Force open some space i
1383 int space; local
[all...]
/fs/gfs2/
H A Dops_fstype.c322 u64 space, d; local
325 space = sdp->sd_heightsize[x - 1] * sdp->sd_inptrs;
326 d = space;
331 sdp->sd_heightsize[x] = space;
341 u64 space, d; local
344 space = sdp->sd_jheightsize[x - 1] * sdp->sd_inptrs;
345 d = space;
350 sdp->sd_jheightsize[x] = space;
1149 * If user space has failed to join the cluster or some similar
/fs/ufs/
H A Dsuper.c526 unsigned char * base, * space; local
537 base = space = kmalloc(size, GFP_NOFS);
540 sbi->s_csp = (struct ufs_csum *)space;
551 ubh_ubhcpymem (space, ubh, size);
553 space += size;
656 unsigned char * base, * space; local
665 base = space = (char*) sbi->s_csp;
673 ubh_memcpyubh (ubh, space, size);
674 space += size;
/fs/cachefiles/
H A Drdwr.c445 /* there's space in the cache we can use */
690 int ret, ret2, space; local
704 space = 1;
706 space = 0;
728 ret = space ? -ENODATA : -ENOBUFS;
753 } else if (space && pagevec_add(&pagevec, page) == 0) {
/fs/ext3/
H A Dnamei.c254 unsigned space; member in struct:stats
261 unsigned names = 0, space = 0; local
279 space += EXT3_DIR_REC_LEN(de->name_len);
285 return (struct stats) { names, space, 1 };
292 unsigned count = dx_get_count (entries), names = 0, space = 0, i; local
308 space += stats.space;
314 names, space/bcount,(space/bcount)*100/blocksize);
315 return (struct stats) { names, space, bcoun
[all...]
/fs/
H A DKconfig111 space. If you unmount a tmpfs instance, everything stored therein is
/fs/ocfs2/
H A Dstack_user.c49 * SETN<space><8-char-hex-nodenum><newline>
58 * SETV<space><2-char-hex-major><space><2-char-hex-minor><newline>
73 * DOWN<space><32-char-cap-hex-uuid><space><8-char-hex-nodenum><newline>
136 /* SETN<space><8-char-hex-nodenum><newline> */
139 char space; member in struct:ocfs2_control_message_setn
144 /* SETV<space><2-char-hex-major><space><2-char-hex-minor><newline> */
154 /* DOWN<space><3
[all...]
/fs/ext4/
H A Dnamei.c332 ext4_warning(inode->i_sb, "no space in directory inode %lu leaf for "
585 unsigned space; member in struct:stats
592 unsigned names = 0, space = 0; local
610 space += EXT4_DIR_REC_LEN(de->name_len);
616 return (struct stats) { names, space, 1 };
623 unsigned count = dx_get_count(entries), names = 0, space = 0, i; local
642 space += stats.space;
648 levels ? "" : " ", names, space/bcount,
649 (space/bcoun
[all...]

Completed in 1444 milliseconds