| /fs/squashfs/ |
| H A D | export.c | 124 u64 lookup_table_start, u64 next_table, unsigned int inodes)
126 unsigned int length = SQUASHFS_LOOKUP_BLOCK_BYTES(inodes);
134 if (inodes == 0)
123 squashfs_read_inode_lookup_table(struct super_block *sb, u64 lookup_table_start, u64 next_table, unsigned int inodes) argument
|
| H A D | squashfs_fs_sb.h | 77 unsigned int inodes; member in struct:squashfs_sb_info
|
| H A D | super.c | 178 msblk->inodes = le32_to_cpu(sblk->inodes);
188 TRACE("Number of inodes %d\n", msblk->inodes);
264 lookup_table_start, next_table, msblk->inodes);
364 buf->f_files = msblk->inodes;
432 * Make sure all delayed rcu free inodes are flushed before we
|
| H A D | squashfs_fs.h | 247 __le32 inodes; member in struct:squashfs_super_block
|
| /fs/qnx6/ |
| H A D | qnx6.h | 35 struct inode * inodes; member in struct:qnx6_sb_info
|
| H A D | inode.c | 109 * inodebits requred as there are multiple inodes in one inode block
435 sbi->inodes = qnx6_private_inode(s, &sb1->Inode);
436 if (!sbi->inodes)
470 iput(sbi->inodes);
487 iput(qs->inodes);
547 mapping = sbi->inodes->i_mapping;
637 * Make sure all delayed rcu free inodes are flushed before we
|
| /fs/ |
| H A D | super.c | 63 long inodes; local
80 inodes = list_lru_count_node(&sb->s_inode_lru, sc->nid);
82 total_objects = dentries + inodes + fs_objects + 1;
88 inodes = mult_frac(sc->nr_to_scan, inodes, total_objects);
95 freed += prune_icache_sb(sb, inodes, sc->nid);
381 * and release aforementioned objects. Note: dentries and inodes _are_
386 * change the attachments of dentries to inodes.
410 printk("VFS: Busy inodes after unmount of %s. "
1274 * should not dirty new pages or inodes), writebac
[all...] |
| H A D | Kconfig | 142 Extended attributes are name:value pairs associated with inodes by
|
| /fs/btrfs/ |
| H A D | ioctl.c | 730 * will see the same inodes regardless of whether a transaction
4281 struct btrfs_data_container *inodes = ctx; local
4284 if (inodes->bytes_left >= c) {
4285 inodes->bytes_left -= c;
4286 inodes->val[inodes->elem_cnt] = inum;
4287 inodes->val[inodes->elem_cnt + 1] = offset;
4288 inodes->val[inodes
4305 struct btrfs_data_container *inodes = NULL; local
[all...] |
| H A D | scrub.c | 173 struct list_head inodes; member in struct:scrub_copy_nocow_ctx
714 * we only need to call readpage for one of the inodes belonging
3205 INIT_LIST_HEAD(&nocow_ctx->inodes);
3223 list_add_tail(&nocow_inode->list, &nocow_ctx->inodes);
3276 while (!list_empty(&nocow_ctx->inodes)) {
3278 entry = list_first_entry(&nocow_ctx->inodes,
3293 while (!list_empty(&nocow_ctx->inodes)) {
3295 entry = list_first_entry(&nocow_ctx->inodes,
|
| /fs/ubifs/ |
| H A D | io.c | 1037 wbuf->inodes = kmalloc(size, GFP_KERNEL);
1038 if (!wbuf->inodes) {
1084 wbuf->inodes[wbuf->next_ino++] = inum;
1102 if (inum == wbuf->inodes[i]) {
|
| H A D | debug.c | 1063 * inode size. This function has to be called only for locked inodes (@i_mutex
1741 * @rb: link in the RB-tree of inodes
1778 * @inodes: RB-tree of all inodes (contains @struct fsck_inode objects)
1781 struct rb_root inodes; member in struct:fsck_data
1785 * add_inode - add inode information to RB-tree of inodes.
1791 * inode @ino to the RB-tree of inodes. Returns inode information pointer in
1804 p = &fsckd->inodes.rb_node;
1864 rb_insert_color(&fscki->rb, &fsckd->inodes);
1870 * search_inode - search inode in the RB-tree of inodes
[all...] |
| H A D | ubifs.h | 108 /* Maximum possible inode number (only 32-bit inodes are supported now) */
362 * inodes
371 * @ui_mutex exists for two main reasons. At first it prevents inodes from
374 * example, in 'ubifs_rename()' we change 3 inodes simultaneously, and
382 * actually). But unfortunately, VFS marks inodes dirty in many places, and it
663 * @lock: serializes @buf, @lnum, @offs, @avail, @used, @next_ino and @inodes
672 * @inodes: stores the inode numbers of the nodes which are in wbuf
702 ino_t *inodes; member in struct:ubifs_wbuf
857 * @dirtied_ino: how many inodes the operation makes dirty
870 * is 13 bits, and @dirtied_ino_d - 15, because up to 4 inodes ma
[all...] |
| H A D | super.c | 47 /* Slab cache for UBIFS inodes */
317 * As an optimization, do not write orphan inodes to the media just
346 * 'ubifs_removexattr()'. These inodes are special and have
695 * Note, data, which may be stored in inodes is budgeted separately, so
837 kfree(c->jheads[i].wbuf.inodes);
1763 * of the media. For example, there will be dirty inodes if we failed
2289 * Make sure all delayed rcu free inodes are flushed before we
|
| /fs/xfs/ |
| H A D | xfs_inode.c | 334 * The following routine will lock n inodes in exclusive mode.
335 * We assume the caller calls us with the inodes in i_ino order.
347 int inodes,
353 ASSERT(ips && (inodes >= 2)); /* we need at least two */
359 for (; i < inodes; i++) {
366 * If try_lock is not set yet, make sure all locked inodes
635 * If we are allocating quota inodes, we do not have a parent inode
685 * We always convert v1 inodes to v2 now - we only support filesystems
1214 * Attach the dquot(s) to the inodes and modify them incore.
1325 * Attach the dquot(s) to the inodes an
345 xfs_lock_inodes( xfs_inode_t **ips, int inodes, uint lock_mode) argument
2692 xfs_inode_t *inodes[4]; local
[all...] |
| /fs/quota/ |
| H A D | dquot.c | 27 * remove_dquot_ref() moved to inode.c - it now traverses through inodes
113 * from inodes (dquot_alloc_space() and such don't check the dq_lock).
508 * quota is disabled and pointers from inodes removed so there cannot be new
509 * quota users. There can still be some users of quotas due to inodes being
993 * Dquots are removed from inodes and no new references can be got so we are
1020 * We have to scan also I_NEW inodes because they can already
1043 /* Gather all references from inodes and drop them */
1250 static int check_idq(struct dquot *dquot, qsize_t inodes, argument
1253 qsize_t newinodes = dquot->dq_dqb.dqb_curinodes + inodes;
1337 static int info_idq_free(struct dquot *dquot, qsize_t inodes) argument
[all...] |