| /fs/minix/ |
| D | itree_v2.c | 27 static int block_to_path(struct inode * inode, long block, int offsets[DEPTH]) in block_to_path()
41 offsets[n++] = block; in block_to_path()
43 offsets[n++] = DIRCOUNT; in block_to_path()
44 offsets[n++] = block; in block_to_path()
46 offsets[n++] = DIRCOUNT + 1; in block_to_path()
47 offsets[n++] = block / INDIRCOUNT(sb); in block_to_path()
48 offsets[n++] = block % INDIRCOUNT(sb); in block_to_path()
51 offsets[n++] = DIRCOUNT + 2; in block_to_path()
52 offsets[n++] = (block / INDIRCOUNT(sb)) / INDIRCOUNT(sb); in block_to_path()
53 offsets[n++] = (block / INDIRCOUNT(sb)) % INDIRCOUNT(sb); in block_to_path()
[all …]
|
| D | itree_common.c | 32 int *offsets, in get_branch() argument
42 add_chain (chain, NULL, i_data(inode) + *offsets); in get_branch()
52 add_chain(++p, bh, (block_t *)bh->b_data + *++offsets); in get_branch()
72 int *offsets, in alloc_branch() argument
97 branch[n].p = (block_t*) bh->b_data + offsets[n]; in alloc_branch()
156 int offsets[DEPTH]; in get_block() local
160 int depth = block_to_path(inode, block, offsets); in get_block()
166 partial = get_branch(inode, depth, offsets, chain, &err); in get_block()
197 err = alloc_branch(inode, left, offsets+(partial-chain), partial); in get_block()
225 int offsets[DEPTH], in find_shared()
[all …]
|
| D | itree_v1.c | 25 static int block_to_path(struct inode * inode, long block, int offsets[DEPTH]) in block_to_path()
38 offsets[n++] = block; in block_to_path()
40 offsets[n++] = 7; in block_to_path()
41 offsets[n++] = block; in block_to_path()
44 offsets[n++] = 8; in block_to_path()
45 offsets[n++] = block>>9; in block_to_path()
46 offsets[n++] = block & 511; in block_to_path()
|
| /fs/sysv/ |
| D | itree.c | 23 static int block_to_path(struct inode *inode, long block, int offsets[DEPTH]) in block_to_path()
35 offsets[n++] = block; in block_to_path()
37 offsets[n++] = DIRECT; in block_to_path()
38 offsets[n++] = block; in block_to_path()
40 offsets[n++] = DIRECT+1; in block_to_path()
41 offsets[n++] = block >> ptrs_bits; in block_to_path()
42 offsets[n++] = block & (indirect_blocks - 1); in block_to_path()
44 offsets[n++] = DIRECT+2; in block_to_path()
45 offsets[n++] = block >> (ptrs_bits * 2); in block_to_path()
46 offsets[n++] = (block >> ptrs_bits) & (indirect_blocks - 1); in block_to_path()
[all …]
|
| /fs/ext4/ |
| D | indirect.c | 76 ext4_lblk_t offsets[4], int *boundary) in ext4_block_to_path()
87 offsets[n++] = i_block; in ext4_block_to_path()
90 offsets[n++] = EXT4_IND_BLOCK; in ext4_block_to_path()
91 offsets[n++] = i_block; in ext4_block_to_path()
94 offsets[n++] = EXT4_DIND_BLOCK; in ext4_block_to_path()
95 offsets[n++] = i_block >> ptrs_bits; in ext4_block_to_path()
96 offsets[n++] = i_block & (ptrs - 1); in ext4_block_to_path()
99 offsets[n++] = EXT4_TIND_BLOCK; in ext4_block_to_path()
100 offsets[n++] = i_block >> (ptrs_bits * 2); in ext4_block_to_path()
101 offsets[n++] = (i_block >> ptrs_bits) & (ptrs - 1); in ext4_block_to_path()
[all …]
|
| D | namei.c | 313 char *to, struct dx_map_entry *offsets,
|
| /fs/ext2/ |
| D | inode.c | 164 long i_block, int offsets[4], int *boundary) in ext2_block_to_path()
178 offsets[n++] = i_block; in ext2_block_to_path()
181 offsets[n++] = EXT2_IND_BLOCK; in ext2_block_to_path()
182 offsets[n++] = i_block; in ext2_block_to_path()
185 offsets[n++] = EXT2_DIND_BLOCK; in ext2_block_to_path()
186 offsets[n++] = i_block >> ptrs_bits; in ext2_block_to_path()
187 offsets[n++] = i_block & (ptrs - 1); in ext2_block_to_path()
190 offsets[n++] = EXT2_TIND_BLOCK; in ext2_block_to_path()
191 offsets[n++] = i_block >> (ptrs_bits * 2); in ext2_block_to_path()
192 offsets[n++] = (i_block >> ptrs_bits) & (ptrs - 1); in ext2_block_to_path()
[all …]
|
| /fs/ufs/ |
| D | inode.c | 46 static int ufs_block_to_path(struct inode *inode, sector_t i_block, unsigned offsets[4]) in ufs_block_to_path()
59 offsets[n++] = i_block; in ufs_block_to_path()
61 offsets[n++] = UFS_IND_BLOCK; in ufs_block_to_path()
62 offsets[n++] = i_block; in ufs_block_to_path()
64 offsets[n++] = UFS_DIND_BLOCK; in ufs_block_to_path()
65 offsets[n++] = i_block >> ptrs_bits; in ufs_block_to_path()
66 offsets[n++] = i_block & (ptrs - 1); in ufs_block_to_path()
68 offsets[n++] = UFS_TIND_BLOCK; in ufs_block_to_path()
69 offsets[n++] = i_block >> (ptrs_bits * 2); in ufs_block_to_path()
70 offsets[n++] = (i_block >> ptrs_bits) & (ptrs - 1); in ufs_block_to_path()
[all …]
|
| /fs/ntfs3/lib/ |
| D | decompress_common.c | 115 u16 * const offsets = &working_space[1 * (max_codeword_len + 1)]; in make_huffman_decode_table() local
181 offsets[1] = 0; in make_huffman_decode_table()
183 offsets[len + 1] = offsets[len] + len_counts[len]; in make_huffman_decode_table()
191 sorted_syms[offsets[lens[sym]]++] = sym; in make_huffman_decode_table()
|
| /fs/xfs/libxfs/ |
| D | xfs_btree.h | 331 const short *offsets,/* table of field offsets */
|
| D | xfs_ialloc.c | 2423 static const short offsets[] = { /* field starting offsets */ in xfs_ialloc_log_agi() local
2453 xfs_btree_offsets(fields, offsets, XFS_AGI_NUM_BITS_R1, in xfs_ialloc_log_agi()
2464 xfs_btree_offsets(fields, offsets, XFS_AGI_NUM_BITS_R2, in xfs_ialloc_log_agi()
|
| D | xfs_btree.c | 833 const short *offsets, /* table of field offsets */ in xfs_btree_offsets() argument
847 *first = offsets[i]; in xfs_btree_offsets()
856 *last = offsets[i + 1] - 1; in xfs_btree_offsets()
|
| D | xfs_alloc.c | 2767 static const short offsets[] = { in xfs_alloc_log_agf() local
2794 xfs_btree_offsets(fields, offsets, XFS_AGF_NUM_BITS, &first, &last); in xfs_alloc_log_agf()
|
| /fs/proc/ |
| D | base.c | 1583 struct proc_timens_offset offsets[2]; in timens_offsets_write() local
1601 struct proc_timens_offset *off = &offsets[noffsets]; in timens_offsets_write()
1630 if (noffsets == ARRAY_SIZE(offsets)) { in timens_offsets_write()
1641 ret = proc_timens_set_offset(file, p, offsets, noffsets); in timens_offsets_write()
|
| /fs/befs/ |
| D | ChangeLog | 234 uses befs_get_block() by way of befs_readpage() to find the disk offsets
|