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

12

/linux-master/fs/squashfs/
H A Dexport.c50 if (ino_num == 0 || (ino_num - 1) >= msblk->inodes)
116 u64 lookup_table_start, u64 next_table, unsigned int inodes)
118 unsigned int length = SQUASHFS_LOOKUP_BLOCK_BYTES(inodes);
119 unsigned int indexes = SQUASHFS_LOOKUP_BLOCKS(inodes);
129 if (inodes == 0)
115 squashfs_read_inode_lookup_table(struct super_block *sb, u64 lookup_table_start, u64 next_table, unsigned int inodes) argument
H A Dsquashfs_fs_sb.h65 unsigned int inodes; member in struct:squashfs_sb_info
H A Dsuper.c289 msblk->inodes = le32_to_cpu(sblk->inodes);
301 TRACE("Number of inodes %d\n", msblk->inodes);
391 lookup_table_start, next_table, msblk->inodes);
574 buf->f_files = msblk->inodes;
628 * Make sure all delayed rcu free inodes are flushed before we
H A Dsquashfs_fs.h242 __le32 inodes; member in struct:squashfs_super_block
/linux-master/fs/ceph/
H A Dmetric.c28 struct ceph_opened_inodes *inodes; local
50 + sizeof(*icaps) + sizeof(*inodes) + sizeof(*rsize)
145 /* encode the opened inodes metric */
146 inodes = (struct ceph_opened_inodes *)(icaps + 1);
147 inodes->header.type = cpu_to_le32(CLIENT_METRIC_TYPE_OPENED_INODES);
148 inodes->header.ver = 1;
149 inodes->header.compat = 1;
150 inodes->header.data_len = cpu_to_le32(sizeof(*inodes) - header_len);
151 inodes
[all...]
/linux-master/fs/xfs/
H A Dxfs_iwalk.c31 * This iterator function walks a subset of filesystem inodes in increasing
32 * order from @startino until there are no more inodes. For each allocated
46 * allocated inodes, as the inobt records may be stale by the time they are
79 * Make it look like the inodes up to startino are free so that
94 * record. Do a readahead if there are any allocated inodes in that cluster.
127 * Set the bits in @irec's free mask that correspond to the inodes before
245 * inobt and make the record look like all the inodes before agino are free so
320 * the inodes up to agino are free so that we don't return them again.
396 /* Walk all inodes in a single AG, from @iwag->startino to the end of the AG. */
438 /* No allocated inodes i
498 xfs_iwalk_prefetch( unsigned int inodes) argument
[all...]
H A Dxfs_inode.c409 * The following routine will lock n inodes in exclusive mode. We assume the
410 * caller calls us with the inodes in i_ino order.
426 int inodes,
436 * Currently supports between 2 and 5 inodes with exclusive locking. We
438 * inodes depend on the type of locking and the limits placed by
442 ASSERT(ips && inodes >= 2 && inodes <= 5);
448 inodes <= XFS_MMAPLOCK_MAX_SUBCLASS + 1);
450 inodes <= XFS_ILOCK_MAX_SUBCLASS + 1);
460 for (; i < inodes;
424 xfs_lock_inodes( struct xfs_inode **ips, int inodes, uint lock_mode) argument
2983 struct xfs_inode *inodes[__XFS_SORT_INODES]; local
[all...]
/linux-master/fs/xfs/scrub/
H A Dialloc.c43 /* Number of inodes we see while scanning inobt. */
44 unsigned long long inodes; member in struct:xchk_iallocbt
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 */
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,
513 * inodes, an
688 xchk_iallocbt_xref_rmap_inodes( struct xfs_scrub *sc, unsigned long long inodes) argument
[all...]
H A Dquotacheck.c132 int64_t inodes,
144 xcdq.icount += inodes;
250 /* Skip inodes that haven't been scanned yet. */
479 /* Walk all the allocated inodes and run a quota scan on them. */
735 * Scan all inodes in the entire filesystem to generate quota counter data.
795 * Hook into the quota code. The hook only triggers for inodes that
834 /* Walk all inodes, picking up quota information. */
128 xqcheck_update_incore_counts( struct xqcheck *xqc, struct xfarray *counts, xfs_dqid_t id, int64_t inodes, int64_t nblks, int64_t rtblks) argument
/linux-master/fs/qnx6/
H A Dqnx6.h36 struct inode * inodes; member in struct:qnx6_sb_info
H A Dinode.c109 * inodebits requred as there are multiple inodes in one inode block
436 sbi->inodes = qnx6_private_inode(s, &sb1->Inode);
437 if (!sbi->inodes)
471 iput(sbi->inodes);
486 iput(qs->inodes);
546 mapping = sbi->inodes->i_mapping;
628 * Make sure all delayed rcu free inodes are flushed before we
/linux-master/fs/bcachefs/
H A Dfsck.c657 for (_i = (_w)->inodes.data; _i < (_w)->inodes.data + (_w)->inodes.nr && \
673 DARRAY(struct inode_walker_entry) inodes; member in struct:inode_walker
678 darray_exit(&w->inodes);
693 return darray_push(&w->inodes, ((struct inode_walker_entry) {
708 w->inodes.nr = 0;
734 __darray_for_each(w->inodes, i)
757 while (i > w->inodes.data && i[-1].snapshot > snapshot)
760 size_t pos = i - w->inodes
[all...]
/linux-master/fs/ext4/
H A Dxattr.h134 struct inode *inodes[]; member in struct:ext4_xattr_inode_array
/linux-master/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.
147 * periodic background write-out of dirty inodes. Since the write-out would
256 * Maximum inodes per isw. A specific value has been chosen to make
302 * list. Only inodes attached to cgwb's are kept on this list.
376 * Multiple inodes can be switched at once. The switching procedure
384 struct inode *inodes[]; member in struct:inode_switch_wbs_context
495 struct backing_dev_info *bdi = inode_to_bdi(isw->inodes[
[all...]
H A Dsuper.c185 long inodes; local
202 inodes = list_lru_shrink_count(&sb->s_inode_lru, sc);
204 total_objects = dentries + inodes + fs_objects + 1;
210 inodes = mult_frac(sc->nr_to_scan, inodes, total_objects);
222 sc->nr_to_scan = inodes + 1;
607 * and release aforementioned objects. Note: dentries and inodes _are_
612 * change the attachments of dentries to inodes.
625 /* Evict all inodes with zero refcount. */
629 * Clean up and evict any inodes tha
[all...]
/linux-master/fs/ubifs/
H A Dio.c1159 wbuf->inodes = kmalloc(size, GFP_KERNEL);
1160 if (!wbuf->inodes) {
1202 wbuf->inodes[wbuf->next_ino++] = inum;
1220 if (inum == wbuf->inodes[i]) {
H A Ddebug.c1082 * inode size. This function has to be called only for locked inodes (@i_mutex
1765 * @rb: link in the RB-tree of inodes
1802 * @inodes: RB-tree of all inodes (contains @struct fsck_inode objects)
1805 struct rb_root inodes; member in struct:fsck_data
1809 * add_inode - add inode information to RB-tree of inodes.
1815 * inode @ino to the RB-tree of inodes. Returns inode information pointer in
1828 p = &fsckd->inodes.rb_node;
1888 rb_insert_color(&fscki->rb, &fsckd->inodes);
1894 * search_inode - search inode in the RB-tree of inodes
[all...]
/linux-master/fs/proc/
H A Dinternal.h221 void proc_invalidate_siblings_dcache(struct hlist_head *inodes, spinlock_t *lock);
H A Dinode.c108 void proc_invalidate_siblings_dcache(struct hlist_head *inodes, spinlock_t *lock) argument
114 while ((node = hlist_first_rcu(inodes))) {
H A Dproc_sysctl.c204 INIT_HLIST_HEAD(&head->inodes);
283 proc_invalidate_siblings_dcache(&head->inodes, &sysctl_lock);
464 hlist_add_head_rcu(&ei->sibling_inodes, &head->inodes);
/linux-master/include/linux/
H A Dsysctl.h167 * @count: Upped every time something is added to @inodes and downed every time
168 * something is removed from inodes
190 struct hlist_head inodes; /* head for proc_inode->sysctl_inodes */ member in struct:ctl_table_header
H A Dpid.h64 struct hlist_head inodes; member in struct:pid
/linux-master/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.
2425 btrfs_debug(ctx->fs_info, "resolving all inodes for extent %llu",
2538 struct btrfs_data_container *inodes = ctx; local
2541 if (inodes->bytes_left >= c) {
2542 inodes->bytes_left -= c;
2543 inodes->val[inodes->elem_cnt] = inum;
2544 inodes
[all...]
H A Dioctl.c3451 struct btrfs_data_container *inodes = NULL; local
3480 inodes = init_data_container(size);
3481 if (IS_ERR(inodes)) {
3482 ret = PTR_ERR(inodes);
3492 inodes, ignore_offset);
3499 ret = copy_to_user((void __user *)(unsigned long)loi->inodes, inodes,
3505 kvfree(inodes);
/linux-master/mm/
H A Dshmem.c115 unsigned long long inodes; member in struct:shmem_options
1504 * Add inode to shmem_unuse()'s list of swapped-out inodes,
3359 * No ordinary (disk based) filesystem counts links as inodes;
3858 * so as we hash inodes here rather than at creation
3972 ctx->inodes = memparse(param->string, &rest);
3973 if (*rest || ctx->inodes > ULONG_MAX / BOGO_INODE_SIZE)
4177 if ((ctx->seen & SHMEM_SEEN_INODES) && ctx->inodes) {
4179 err = "Cannot retroactively limit inodes";
4182 if (ctx->inodes * BOGO_INODE_SIZE < used_isp) {
4183 err = "Too few inodes fo
[all...]

Completed in 413 milliseconds

12