Home
last modified time | relevance | path

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

123

/kernel/linux/linux-5.10/fs/squashfs/
H A Dexport.c50 if (ino_num == 0 || (ino_num - 1) >= msblk->inodes) in squashfs_inode_lookup()
116 u64 lookup_table_start, u64 next_table, unsigned int inodes) in squashfs_read_inode_lookup_table()
118 unsigned int length = SQUASHFS_LOOKUP_BLOCK_BYTES(inodes); in squashfs_read_inode_lookup_table()
119 unsigned int indexes = SQUASHFS_LOOKUP_BLOCKS(inodes); in squashfs_read_inode_lookup_table()
129 if (inodes == 0) in squashfs_read_inode_lookup_table()
115 squashfs_read_inode_lookup_table(struct super_block *sb, u64 lookup_table_start, u64 next_table, unsigned int inodes) squashfs_read_inode_lookup_table() argument
H A Dsuper.c199 msblk->inodes = le32_to_cpu(sblk->inodes); in squashfs_fill_super()
211 TRACE("Number of inodes %d\n", msblk->inodes); in squashfs_fill_super()
288 lookup_table_start, next_table, msblk->inodes); in squashfs_fill_super()
412 buf->f_files = msblk->inodes; in squashfs_statfs()
464 * Make sure all delayed rcu free inodes are flushed before we in destroy_inodecache()
H A Dsquashfs_fs_sb.h64 unsigned int inodes; member
/kernel/linux/linux-6.6/fs/squashfs/
H A Dexport.c50 if (ino_num == 0 || (ino_num - 1) >= msblk->inodes) in squashfs_inode_lookup()
116 u64 lookup_table_start, u64 next_table, unsigned int inodes) in squashfs_read_inode_lookup_table()
118 unsigned int length = SQUASHFS_LOOKUP_BLOCK_BYTES(inodes); in squashfs_read_inode_lookup_table()
119 unsigned int indexes = SQUASHFS_LOOKUP_BLOCKS(inodes); in squashfs_read_inode_lookup_table()
129 if (inodes == 0) in squashfs_read_inode_lookup_table()
115 squashfs_read_inode_lookup_table(struct super_block *sb, u64 lookup_table_start, u64 next_table, unsigned int inodes) squashfs_read_inode_lookup_table() argument
H A Dsuper.c289 msblk->inodes = le32_to_cpu(sblk->inodes); in squashfs_fill_super()
301 TRACE("Number of inodes %d\n", msblk->inodes); in squashfs_fill_super()
391 lookup_table_start, next_table, msblk->inodes); in squashfs_fill_super()
574 buf->f_files = msblk->inodes; in squashfs_statfs()
628 * Make sure all delayed rcu free inodes are flushed before we in destroy_inodecache()
H A Dsquashfs_fs_sb.h65 unsigned int inodes; member
/kernel/linux/linux-6.6/fs/ceph/
H A Dmetric.c28 struct ceph_opened_inodes *inodes; in ceph_mdsc_send_metrics() local
49 + sizeof(*icaps) + sizeof(*inodes) + sizeof(*rsize) in ceph_mdsc_send_metrics()
144 /* encode the opened inodes metric */ in ceph_mdsc_send_metrics()
145 inodes = (struct ceph_opened_inodes *)(icaps + 1); in ceph_mdsc_send_metrics()
146 inodes->header.type = cpu_to_le32(CLIENT_METRIC_TYPE_OPENED_INODES); in ceph_mdsc_send_metrics()
147 inodes->header.ver = 1; in ceph_mdsc_send_metrics()
148 inodes->header.compat = 1; in ceph_mdsc_send_metrics()
149 inodes->header.data_len = cpu_to_le32(sizeof(*inodes) - header_len); in ceph_mdsc_send_metrics()
150 inodes in ceph_mdsc_send_metrics()
[all...]
/kernel/linux/linux-5.10/fs/xfs/
H A Dxfs_iwalk.c29 * This iterator function walks a subset of filesystem inodes in increasing
30 * order from @startino until there are no more inodes. For each allocated
44 * allocated inodes, as the inobt records may be stale by the time they are
76 * Make it look like the inodes up to startino are free so that
88 * record. Do a readahead if there are any allocated inodes in that cluster.
119 * Set the bits in @irec's free mask that correspond to the inodes before
134 * We got a right chunk with some left inodes allocated at it. Grab in xfs_iwalk_adjust_start()
135 * the chunk record. Mark all the uninteresting inodes free because in xfs_iwalk_adjust_start()
247 * inobt and make the record look like all the inodes before agino are free so
319 * the inodes u in xfs_iwalk_ag_start()
489 xfs_iwalk_prefetch( unsigned int inodes) xfs_iwalk_prefetch() argument
[all...]
H A Dxfs_inode.c428 * The following routine will lock n inodes in exclusive mode. We assume the
429 * caller calls us with the inodes in i_ino order.
445 int inodes, in xfs_lock_inodes()
452 * Currently supports between 2 and 5 inodes with exclusive locking. We in xfs_lock_inodes()
454 * inodes depend on the type of locking and the limits placed by in xfs_lock_inodes()
458 ASSERT(ips && inodes >= 2 && inodes <= 5); in xfs_lock_inodes()
464 inodes <= XFS_MMAPLOCK_MAX_SUBCLASS + 1); in xfs_lock_inodes()
466 inodes <= XFS_ILOCK_MAX_SUBCLASS + 1); in xfs_lock_inodes()
476 for (; i < inodes; in xfs_lock_inodes()
443 xfs_lock_inodes( struct xfs_inode **ips, int inodes, uint lock_mode) xfs_lock_inodes() argument
3156 struct xfs_inode *inodes[__XFS_SORT_INODES]; xfs_rename() local
[all...]
/kernel/linux/linux-6.6/fs/xfs/
H A Dxfs_iwalk.c30 * This iterator function walks a subset of filesystem inodes in increasing
31 * order from @startino until there are no more inodes. For each allocated
45 * allocated inodes, as the inobt records may be stale by the time they are
78 * Make it look like the inodes up to startino are free so that
93 * record. Do a readahead if there are any allocated inodes in that cluster.
124 * Set the bits in @irec's free mask that correspond to the inodes before
139 * We got a right chunk with some left inodes allocated at it. Grab in xfs_iwalk_adjust_start()
140 * the chunk record. Mark all the uninteresting inodes free because in xfs_iwalk_adjust_start()
252 * inobt and make the record look like all the inodes before agino are free so
324 * the inodes u in xfs_iwalk_ag_start()
502 xfs_iwalk_prefetch( unsigned int inodes) xfs_iwalk_prefetch() argument
[all...]
H A Dxfs_inode.c436 * The following routine will lock n inodes in exclusive mode. We assume the
437 * caller calls us with the inodes in i_ino order.
453 int inodes, in xfs_lock_inodes()
463 * Currently supports between 2 and 5 inodes with exclusive locking. We in xfs_lock_inodes()
465 * inodes depend on the type of locking and the limits placed by in xfs_lock_inodes()
469 ASSERT(ips && inodes >= 2 && inodes <= 5); in xfs_lock_inodes()
475 inodes <= XFS_MMAPLOCK_MAX_SUBCLASS + 1); in xfs_lock_inodes()
477 inodes <= XFS_ILOCK_MAX_SUBCLASS + 1); in xfs_lock_inodes()
487 for (; i < inodes; in xfs_lock_inodes()
451 xfs_lock_inodes( struct xfs_inode **ips, int inodes, uint lock_mode) xfs_lock_inodes() argument
2854 struct xfs_inode *inodes[__XFS_SORT_INODES]; xfs_rename() local
[all...]
/kernel/linux/linux-5.10/fs/xfs/scrub/
H A Dialloc.c41 /* Number of inodes we see while scanning inobt. */
42 unsigned long long inodes; member
121 /* Count the number of free inodes. */
202 * what's actually on disk. If sparse inodes are enabled, the cluster does
203 * not actually have to map to inodes if the corresponding holemask bit is set.
339 * contains multiple inodes, we check that the inobt record is aligned to the
358 * Note that if a fs block contains more than a single chunk of inodes, in xchk_iallocbt_rec_alignment()
360 * inodes, and therefore expect chunk alignment of finobt records. in xchk_iallocbt_rec_alignment()
376 * We're midway through a cluster of inodes that is mapped by in xchk_iallocbt_rec_alignment()
460 iabt->inodes in xchk_iallocbt_rec()
549 xchk_iallocbt_xref_rmap_inodes( struct xfs_scrub *sc, int which, unsigned long long inodes) xchk_iallocbt_xref_rmap_inodes() argument
[all...]
/kernel/linux/linux-6.6/fs/xfs/scrub/
H A Dialloc.c43 /* Number of inodes we see while scanning inobt. */
44 unsigned long long inodes; member
57 * - The finobt need not have a record if all inodes in the inobt record are
59 * - The finobt need not have a record if all inodes in the inobt record are
119 /* finobt doesn't care about allocated inodes */ in xchk_inobt_xref_finobt()
356 * what's actually on disk. If sparse inodes are enabled, the cluster does
357 * not actually have to map to inodes if the corresponding holemask bit is set.
492 * contains multiple inodes, we check that the inobt record is aligned to the
511 * Note that if a fs block contains more than a single chunk of inodes, in xchk_iallocbt_rec_alignment()
513 * inodes, an in xchk_iallocbt_rec_alignment()
689 xchk_iallocbt_xref_rmap_inodes( struct xfs_scrub *sc, int which, unsigned long long inodes) xchk_iallocbt_xref_rmap_inodes() argument
[all...]
/kernel/linux/linux-5.10/fs/qnx6/
H A Dinode.c109 * inodebits requred as there are multiple inodes in one inode block
436 sbi->inodes = qnx6_private_inode(s, &sb1->Inode); in qnx6_fill_super()
437 if (!sbi->inodes) in qnx6_fill_super()
471 iput(sbi->inodes); in qnx6_fill_super()
488 iput(qs->inodes); in qnx6_put_super()
548 mapping = sbi->inodes->i_mapping; in qnx6_iget()
633 * Make sure all delayed rcu free inodes are flushed before we in destroy_inodecache()
H A Dqnx6.h36 struct inode * inodes; member
/kernel/linux/linux-6.6/fs/qnx6/
H A Dinode.c109 * inodebits requred as there are multiple inodes in one inode block
436 sbi->inodes = qnx6_private_inode(s, &sb1->Inode); in qnx6_fill_super()
437 if (!sbi->inodes) in qnx6_fill_super()
471 iput(sbi->inodes); in qnx6_fill_super()
486 iput(qs->inodes); in qnx6_put_super()
546 mapping = sbi->inodes->i_mapping; in qnx6_iget()
630 * Make sure all delayed rcu free inodes are flushed before we in destroy_inodecache()
H A Dqnx6.h36 struct inode * inodes; member
/kernel/linux/linux-5.10/fs/btrfs/
H A Dbackref.c2008 btrfs_debug(fs_info, "resolving all inodes for extent %llu",
2069 struct btrfs_data_container *inodes = ctx; local
2072 if (inodes->bytes_left >= c) {
2073 inodes->bytes_left -= c;
2074 inodes->val[inodes->elem_cnt] = inum;
2075 inodes->val[inodes->elem_cnt + 1] = offset;
2076 inodes->val[inodes
[all...]
/kernel/linux/linux-5.10/fs/
H A Dsuper.c69 long inodes; in super_cache_scan() local
86 inodes = list_lru_shrink_count(&sb->s_inode_lru, sc); in super_cache_scan()
88 total_objects = dentries + inodes + fs_objects + 1; in super_cache_scan()
94 inodes = mult_frac(sc->nr_to_scan, inodes, total_objects); in super_cache_scan()
106 sc->nr_to_scan = inodes + 1; in super_cache_scan()
435 * and release aforementioned objects. Note: dentries and inodes _are_
440 * change the attachments of dentries to inodes.
453 /* evict all inodes with zero refcount */ in generic_shutdown_super()
455 /* only nonzero refcount inodes ca in generic_shutdown_super()
[all...]
/kernel/linux/linux-6.6/fs/
H A Dfs-writeback.c8 * upon dirty inodes against superblocks, and writing back dirty
9 * pages against inodes. ie: data writeback. Writeout of the
64 * seconds), which means most of the time inodes will have their
66 * few inodes might not their timestamps updated for 24 hours.
231 * Maximum inodes per isw. A specific value has been chosen to make
277 * list. Only inodes attached to cgwb's are kept on this list.
351 * Multiple inodes can be switched at once. The switching procedure
359 struct inode *inodes[]; member
470 struct backing_dev_info *bdi = inode_to_bdi(isw->inodes[0]); in inode_switch_wbs_work_fn()
471 struct bdi_writeback *old_wb = isw->inodes[ in inode_switch_wbs_work_fn()
[all...]
/kernel/linux/linux-5.10/include/linux/
H A Dpid.h66 struct hlist_head inodes; member
/kernel/linux/linux-6.6/include/linux/
H A Dpid.h66 struct hlist_head inodes; member
/kernel/linux/linux-6.6/fs/btrfs/
H A Dbackref.c171 * Counts number of inodes that refer to an extent (different inodes in
174 * may not reflect the total number of inodes.
2419 btrfs_debug(ctx->fs_info, "resolving all inodes for extent %llu", in iterate_extent_inodes()
2532 struct btrfs_data_container *inodes = ctx; in build_ino_list() local
2535 if (inodes->bytes_left >= c) { in build_ino_list()
2536 inodes->bytes_left -= c; in build_ino_list()
2537 inodes->val[inodes->elem_cnt] = inum; in build_ino_list()
2538 inodes in build_ino_list()
[all...]
/kernel/linux/linux-5.10/fs/hmdfs/
H A Dstash.c76 uint64_t inodes[0]; member
991 new->max = (PAGE_SIZE - offsetof(struct hmdfs_inode_tbl, inodes)) / in hmdfs_new_inode_tbl()
992 sizeof(new->inodes[0]); in hmdfs_new_inode_tbl()
1057 ctx->tbl->inodes[ctx->tbl->cnt++] = stash_inum; in hmdfs_fill_stash_file()
1656 snprintf(name, sizeof(name), "0x%llx", tbl->inodes[i]); in hmdfs_restore_files()
1664 ctx.inum = tbl->inodes[i]; in hmdfs_restore_files()
1719 snprintf(name, sizeof(name), "0x%llx", tbl->inodes[i]); in hmdfs_rebuild_stash_list()
1725 ctx.inum = tbl->inodes[i]; in hmdfs_rebuild_stash_list()
1911 * Wait until all inodes finish rebuilding stash status before in hmdfs_stash_online_prepare()
2013 hmdfs_info("release %u preparing inodes", preparin in hmdfs_stash_del_do_cleanup()
[all...]
/kernel/linux/linux-6.6/fs/hmdfs/
H A Dstash.c76 uint64_t inodes[0]; member
981 new->max = (PAGE_SIZE - offsetof(struct hmdfs_inode_tbl, inodes)) / in hmdfs_new_inode_tbl()
982 sizeof(new->inodes[0]); in hmdfs_new_inode_tbl()
1047 ctx->tbl->inodes[ctx->tbl->cnt++] = stash_inum; in hmdfs_fill_stash_file()
1641 snprintf(name, sizeof(name), "0x%llx", tbl->inodes[i]); in hmdfs_restore_files()
1649 ctx.inum = tbl->inodes[i]; in hmdfs_restore_files()
1704 snprintf(name, sizeof(name), "0x%llx", tbl->inodes[i]); in hmdfs_rebuild_stash_list()
1710 ctx.inum = tbl->inodes[i]; in hmdfs_rebuild_stash_list()
1896 * Wait until all inodes finish rebuilding stash status before in hmdfs_stash_online_prepare()
1998 hmdfs_info("release %u preparing inodes", preparin in hmdfs_stash_del_do_cleanup()
[all...]

Completed in 29 milliseconds

123