| /fs/ubifs/ |
| D | key.h | 109 static inline void ino_key_init_flash(const struct ubifs_info *c, void *k, in ino_key_init_flash() argument
112 union ubifs_key *key = k; in ino_key_init_flash()
116 memset(k + 8, 0, UBIFS_MAX_KEY_LEN - 8); in ino_key_init_flash()
187 static inline void dent_key_init_flash(const struct ubifs_info *c, void *k, in dent_key_init_flash() argument
190 union ubifs_key *key = k; in dent_key_init_flash()
197 memset(k + 8, 0, UBIFS_MAX_KEY_LEN - 8); in dent_key_init_flash()
255 static inline void xent_key_init_flash(const struct ubifs_info *c, void *k, in xent_key_init_flash() argument
258 union ubifs_key *key = k; in xent_key_init_flash()
265 memset(k + 8, 0, UBIFS_MAX_KEY_LEN - 8); in xent_key_init_flash()
304 static inline void data_key_init_flash(const struct ubifs_info *c, void *k, in data_key_init_flash() argument
[all …]
|
| /fs/squashfs/ |
| D | block.c | 89 int bytes, compressed, b = 0, k = 0, page = 0, avail; in squashfs_read_data() local
169 if (msblk->stream.avail_in == 0 && k < b) { in squashfs_read_data()
172 wait_on_buffer(bh[k]); in squashfs_read_data()
173 if (!buffer_uptodate(bh[k])) in squashfs_read_data()
178 put_bh(bh[k++]); in squashfs_read_data()
182 msblk->stream.next_in = bh[k]->b_data + offset; in squashfs_read_data()
206 if (msblk->stream.avail_in == 0 && k < b) in squashfs_read_data()
207 put_bh(bh[k++]); in squashfs_read_data()
234 for (bytes = length; k < b; k++) { in squashfs_read_data()
245 bh[k]->b_data + offset, avail); in squashfs_read_data()
[all …]
|
| /fs/cifs/ |
| D | smbdes.c | 194 int i, j, k; in dohash() local
265 for (k = 0; k < 6; k++) in dohash()
266 b[j][k] = erk[j * 6 + k]; in dohash()
275 for (k = 0; k < 4; k++) in dohash()
276 b[j][k] = in dohash()
277 (sbox[j][m][n] & (1 << (3 - k))) ? 1 : 0; in dohash()
281 for (k = 0; k < 4; k++) in dohash()
282 cb[j * 4 + k] = b[j][k]; in dohash()
|
| D | md4.c | 53 #define ROUND1(a,b,c,d,k,s) (*a) = lshift((*a) + F(*b,*c,*d) + X[k], s) argument
54 #define ROUND2(a,b,c,d,k,s) (*a) = lshift((*a) + G(*b,*c,*d) + X[k] + (__u32)0x5A827999,s) argument
55 #define ROUND3(a,b,c,d,k,s) (*a) = lshift((*a) + H(*b,*c,*d) + X[k] + (__u32)0x6ED9EBA1,s) argument
|
| /fs/reiserfs/ |
| D | prints.c | 162 char *k = fmt; in is_there_reiserfs_struct() local
166 while ((k = strchr(k, '%')) != NULL) { in is_there_reiserfs_struct()
167 if (k[1] == 'k' || k[1] == 'K' || k[1] == 'h' || k[1] == 't' || in is_there_reiserfs_struct()
168 k[1] == 'z' || k[1] == 'b' || k[1] == 'y' || k[1] == 'a') { in is_there_reiserfs_struct()
169 *what = k[1]; in is_there_reiserfs_struct()
173 k++; in is_there_reiserfs_struct()
175 return k; in is_there_reiserfs_struct()
194 char *k; in prepare_error_buf() local
200 while ((k = is_there_reiserfs_struct(fmt1, &what, &skip)) != NULL) { in prepare_error_buf()
201 *k = 0; in prepare_error_buf()
[all …]
|
| D | ibalance.c | 763 int insert_num, n, k; in balance_internal() local
795 k = 0; in balance_internal()
832 k = tb->lnum[h] - child_pos - 1; in balance_internal()
839 n + child_pos + 1, k, in balance_internal()
842 replace_lkey(tb, h, insert_key + k); in balance_internal()
847 MAX_CHILD_SIZE(insert_ptr[k]) - in balance_internal()
848 B_FREE_SPACE(insert_ptr[k])); in balance_internal()
849 put_dc_block_number(dc, insert_ptr[k]->b_blocknr); in balance_internal()
853 k++; in balance_internal()
854 insert_key += k; in balance_internal()
[all …]
|
| D | hashes.c | 52 u32 k[] = { 0x9464a485, 0x542e1a94, 0x3e846bff, 0xb75bcfc3 }; in keyed_hash() local
54 u32 h0 = k[0], h1 = k[1]; in keyed_hash()
|
| D | item_ops.c | 507 int k, l; in direntry_create_vi() local
510 for (k = 0; k < dir_u->entry_count; k++) in direntry_create_vi()
511 l += dir_u->entry_sizes[k]; in direntry_create_vi()
|
| /fs/udf/ |
| D | partition.c | 159 int i, j, k, l; in udf_relocate_blocks() local
184 for (k = 0; k < reallocationTableLen; k++) { in udf_relocate_blocks()
185 struct sparingEntry *entry = &st->mapEntry[k]; in udf_relocate_blocks()
223 for (l = k; l < reallocationTableLen; l++) { in udf_relocate_blocks()
239 memmove(&st->mapEntry[k + 1], in udf_relocate_blocks()
240 &st->mapEntry[k], in udf_relocate_blocks()
241 (l - k) * in udf_relocate_blocks()
243 st->mapEntry[k] = mapEntry; in udf_relocate_blocks()
252 st->mapEntry[k].mappedLocation) + in udf_relocate_blocks()
|
| /fs/hpfs/ |
| D | alloc.c | 115 unsigned k = bmp[i-1]; in alloc_in_bmp() local
116 while (k & 0x80000000) { in alloc_in_bmp()
117 q--; k <<= 1; in alloc_in_bmp()
334 unsigned k; in hpfs_check_free_dnodes() local
336 for (k = bmp[j]; k; k >>= 1) if (k & 1) if (!--n) { in hpfs_check_free_dnodes()
355 unsigned k; in hpfs_check_free_dnodes() local
357 for (k = 0xf; k; k <<= 4) in hpfs_check_free_dnodes()
358 if ((bmp[j] & k) == k) { in hpfs_check_free_dnodes()
|
| /fs/xfs/ |
| D | xfs_btree_trace.h | 94 #define XFS_BTREE_TRACE_ARGIPK(c, i, p, k) \ argument
95 xfs_btree_trace_argipk(__func__, c, i, p, k, __LINE__)
98 #define XFS_BTREE_TRACE_ARGIK(c, i, k) \ argument
99 xfs_btree_trace_argik(__func__, c, i, k, __LINE__)
111 #define XFS_BTREE_TRACE_ARGIK(c, i, k) argument
|
| D | xfs_bmap_btree.h | 89 static inline xfs_fsblock_t nullstartblock(int k) in nullstartblock() argument
91 ASSERT(k < (1 << STARTBLOCKVALBITS)); in nullstartblock()
92 return STARTBLOCKMASK | (k); in nullstartblock()
|
| D | xfs_inum.h | 47 #define XFS_INO_MASK(k) (__uint32_t)((1ULL << (k)) - 1) argument
|
| /fs/ncpfs/ |
| D | ncplib_kernel.h | 142 #define ncp_io2vol(S,m,i,n,k,U) ncp__io2vol(S,m,i,n,k,U) argument
143 #define ncp_vol2io(S,m,i,n,k,U) ncp__vol2io(S,m,i,n,k,U) argument
155 #define ncp_io2vol(S,m,i,n,k,U) ncp__io2vol(m,i,n,k,U) argument
156 #define ncp_vol2io(S,m,i,n,k,U) ncp__vol2io(m,i,n,k,U) argument
|
| D | ncplib_kernel.c | 1115 int k; in ncp__io2vol() local
1117 k = utf8_mbtowc(&ec, iname, iname_end - iname); in ncp__io2vol()
1118 if (k < 0) in ncp__io2vol()
1120 iname += k; in ncp__io2vol()
1123 int k; in ncp__io2vol() local
1129 for (k = 1; k < 5; k++) { in ncp__io2vol()
1132 nc = iname[k] - '0'; in ncp__io2vol()
1215 int k; in ncp__vol2io() local
1217 k = utf8_wctomb(iname, ec, iname_end - iname); in ncp__vol2io()
1218 if (k < 0) { in ncp__vol2io()
[all …]
|
| /fs/minix/ |
| D | itree_common.c | 223 int k, err; in find_shared() local
226 for (k = depth; k > 1 && !offsets[k-1]; k--) in find_shared()
228 partial = get_branch(inode, k, offsets, chain, &err); in find_shared()
232 partial = chain + k-1; in find_shared()
239 if (p == chain + k - 1 && p > chain) { in find_shared()
352 int k = sb->s_blocksize_bits - 10; in nblocks() local
354 blocks = (size + sb->s_blocksize - 1) >> (BLOCK_SIZE_BITS + k); in nblocks()
|
| D | bitmap.c | 57 int k = sb->s_blocksize_bits + 3; in minix_free_block() local
65 bit = zone & ((1<<k) - 1); in minix_free_block()
66 zone >>= k; in minix_free_block()
196 int k = sb->s_blocksize_bits + 3; in minix_free_inode() local
204 bit = ino & ((1<<k) - 1); in minix_free_inode()
205 ino >>= k; in minix_free_inode()
|
| /fs/jfs/ |
| D | jfs_txnmgr.c | 241 int k, size; in txInit() local
289 for (k = 1; k < nTxBlock - 1; k++) { in txInit()
290 TxBlock[k].next = k + 1; in txInit()
291 init_waitqueue_head(&TxBlock[k].gcwait); in txInit()
292 init_waitqueue_head(&TxBlock[k].waitor); in txInit()
294 TxBlock[k].next = 0; in txInit()
295 init_waitqueue_head(&TxBlock[k].gcwait); in txInit()
296 init_waitqueue_head(&TxBlock[k].waitor); in txInit()
317 for (k = 1; k < nTxLock - 1; k++) in txInit()
318 TxLock[k].next = k + 1; in txInit()
[all …]
|
| D | jfs_extent.c | 651 u64 m, k; in extRoundDown() local
659 k = (u64) 1 << i; in extRoundDown()
660 k = ((k - 1) & nb) ? k : k >> 1; in extRoundDown()
662 return (k); in extRoundDown()
|
| D | jfs_dmap.c | 1368 int rc, ti, i, k, m, n, agperlev; in dbAllocAG() local
1462 for (k = bmp->db_agheigth; k > 0; k--) { in dbAllocAG()
2795 int lp, pp, k; in dbAdjTree() local
2814 for (k = 0; k < le32_to_cpu(tp->dmt_height); k++) { in dbAdjTree()
2869 int ti, n = 0, k, x = 0; in dbFindLeaf() local
2881 for (k = le32_to_cpu(tp->dmt_height), ti = 1; in dbFindLeaf()
2882 k > 0; k--, ti = ((ti + n) << 2) + 1) { in dbFindLeaf()
3286 int i, i0 = true, j, j0 = true, k, n; in dbExtendFS() local
3335 k = 1 << (l2agsize - oldl2agsize); in dbExtendFS()
3341 for (j = 0; j < k && i < agno; j++, i++) { in dbExtendFS()
[all …]
|
| /fs/ |
| D | binfmt_elf.c | 450 unsigned long k, map_addr; in load_elf_interp() local
484 k = load_addr + eppnt->p_vaddr; in load_elf_interp()
485 if (BAD_ADDR(k) || in load_elf_interp()
488 TASK_SIZE - eppnt->p_memsz < k) { in load_elf_interp()
497 k = load_addr + eppnt->p_vaddr + eppnt->p_filesz; in load_elf_interp()
498 if (k > elf_bss) in load_elf_interp()
499 elf_bss = k; in load_elf_interp()
505 k = load_addr + eppnt->p_memsz + eppnt->p_vaddr; in load_elf_interp()
506 if (k > last_bss) in load_elf_interp()
507 last_bss = k; in load_elf_interp()
[all …]
|
| /fs/sysv/ |
| D | itree.c | 283 int k, err; in find_shared() local
286 for (k = depth; k > 1 && !offsets[k-1]; k--) in find_shared()
290 partial = get_branch(inode, k, offsets, chain, &err); in find_shared()
292 partial = chain + k-1; in find_shared()
309 if (p == chain + k - 1 && p > chain) { in find_shared()
|
| /fs/ext4/ |
| D | extents.c | 351 int k, l = path->p_depth; in ext4_ext_show_path() local
354 for (k = 0; k <= l; k++, path++) { in ext4_ext_show_path()
440 int k; in ext4_ext_binsearch_idx() local
443 for (k = 0; k < le16_to_cpu(eh->eh_entries); k++, ix++) { in ext4_ext_binsearch_idx()
444 if (k != 0 && in ext4_ext_binsearch_idx()
447 "first=0x%p\n", k, in ext4_ext_binsearch_idx()
453 BUG_ON(k && le32_to_cpu(ix->ei_block) in ext4_ext_binsearch_idx()
510 int k; in ext4_ext_binsearch() local
513 for (k = 0; k < le16_to_cpu(eh->eh_entries); k++, ex++) { in ext4_ext_binsearch()
514 BUG_ON(k && le32_to_cpu(ex->ee_block) in ext4_ext_binsearch()
[all …]
|
| /fs/proc/ |
| D | array.c | 234 struct k_sigaction *k; in collect_sigign_sigcatch() local
237 k = p->sighand->action; in collect_sigign_sigcatch()
238 for (i = 1; i <= _NSIG; ++i, ++k) { in collect_sigign_sigcatch()
239 if (k->sa.sa_handler == SIG_IGN) in collect_sigign_sigcatch()
241 else if (k->sa.sa_handler != SIG_DFL) in collect_sigign_sigcatch()
|
| /fs/ext2/ |
| D | inode.c | 327 ext2_blks_to_allocate(Indirect * branch, int k, unsigned long blks, in ext2_blks_to_allocate() argument
336 if (k > 0) { in ext2_blks_to_allocate()
876 int k, err; in ext2_find_shared() local
879 for (k = depth; k > 1 && !offsets[k-1]; k--) in ext2_find_shared()
881 partial = ext2_get_branch(inode, k, offsets, chain, &err); in ext2_find_shared()
883 partial = chain + k-1; in ext2_find_shared()
901 if (p == chain + k - 1 && p > chain) { in ext2_find_shared()
|