Home
last modified time | relevance | path

Searched refs:k (Results 1 – 25 of 44) sorted by relevance

12

/fs/proc/
Dpage.c110 u64 k; in stable_page_flags() local
120 k = page->flags; in stable_page_flags()
183 u |= kpf_copy_bit(k, KPF_LOCKED, PG_locked); in stable_page_flags()
185 u |= kpf_copy_bit(k, KPF_SLAB, PG_slab); in stable_page_flags()
189 u |= kpf_copy_bit(k, KPF_ERROR, PG_error); in stable_page_flags()
190 u |= kpf_copy_bit(k, KPF_DIRTY, PG_dirty); in stable_page_flags()
191 u |= kpf_copy_bit(k, KPF_UPTODATE, PG_uptodate); in stable_page_flags()
192 u |= kpf_copy_bit(k, KPF_WRITEBACK, PG_writeback); in stable_page_flags()
194 u |= kpf_copy_bit(k, KPF_LRU, PG_lru); in stable_page_flags()
195 u |= kpf_copy_bit(k, KPF_REFERENCED, PG_referenced); in stable_page_flags()
[all …]
Darray.c244 struct k_sigaction *k; in collect_sigign_sigcatch() local
247 k = p->sighand->action; in collect_sigign_sigcatch()
248 for (i = 1; i <= _NSIG; ++i, ++k) { in collect_sigign_sigcatch()
249 if (k->sa.sa_handler == SIG_IGN) in collect_sigign_sigcatch()
251 else if (k->sa.sa_handler != SIG_DFL) in collect_sigign_sigcatch()
/fs/ubifs/
Dkey.h103 static inline void ino_key_init_flash(const struct ubifs_info *c, void *k, in ino_key_init_flash() argument
106 union ubifs_key *key = k; in ino_key_init_flash()
110 memset(k + 8, 0, UBIFS_MAX_KEY_LEN - 8); in ino_key_init_flash()
181 static inline void dent_key_init_flash(const struct ubifs_info *c, void *k, in dent_key_init_flash() argument
185 union ubifs_key *key = k; in dent_key_init_flash()
192 memset(k + 8, 0, UBIFS_MAX_KEY_LEN - 8); in dent_key_init_flash()
233 static inline void xent_key_init_flash(const struct ubifs_info *c, void *k, in xent_key_init_flash() argument
236 union ubifs_key *key = k; in xent_key_init_flash()
243 memset(k + 8, 0, UBIFS_MAX_KEY_LEN - 8); in xent_key_init_flash()
333 static inline int key_type_flash(const struct ubifs_info *c, const void *k) in key_type_flash() argument
[all …]
/fs/reiserfs/
Dprints.c176 char *k = fmt; in is_there_reiserfs_struct() local
178 while ((k = strchr(k, '%')) != NULL) { in is_there_reiserfs_struct()
179 if (k[1] == 'k' || k[1] == 'K' || k[1] == 'h' || k[1] == 't' || in is_there_reiserfs_struct()
180 k[1] == 'z' || k[1] == 'b' || k[1] == 'y' || k[1] == 'a') { in is_there_reiserfs_struct()
181 *what = k[1]; in is_there_reiserfs_struct()
184 k++; in is_there_reiserfs_struct()
186 return k; in is_there_reiserfs_struct()
206 char *k; in prepare_error_buf() local
218 while ((k = is_there_reiserfs_struct(fmt1, &what)) != NULL) { in prepare_error_buf()
219 *k = 0; in prepare_error_buf()
[all …]
Dibalance.c819 int insert_num, n, k; in balance_internal() local
853 k = 0; in balance_internal()
891 k = tb->lnum[h] - child_pos - 1; in balance_internal()
898 n + child_pos + 1, k, in balance_internal()
901 replace_lkey(tb, h, insert_key + k); in balance_internal()
909 MAX_CHILD_SIZE(insert_ptr[k]) - in balance_internal()
910 B_FREE_SPACE(insert_ptr[k])); in balance_internal()
911 put_dc_block_number(dc, insert_ptr[k]->b_blocknr); in balance_internal()
915 k++; in balance_internal()
916 insert_key += k; in balance_internal()
[all …]
Dhashes.c46 u32 k[] = { 0x9464a485, 0x542e1a94, 0x3e846bff, 0xb75bcfc3 }; in keyed_hash() local
48 u32 h0 = k[0], h1 = k[1]; in keyed_hash()
Ditem_ops.c499 int k, l; in direntry_create_vi() local
502 for (k = 0; k < dir_u->entry_count; k++) in direntry_create_vi()
503 l += dir_u->entry_sizes[k]; in direntry_create_vi()
/fs/udf/
Dpartition.c158 int i, j, k, l; in udf_relocate_blocks() local
187 for (k = 0; k < reallocationTableLen; k++) { in udf_relocate_blocks()
188 struct sparingEntry *entry = &st->mapEntry[k]; in udf_relocate_blocks()
228 for (l = k; l < reallocationTableLen; l++) { in udf_relocate_blocks()
244 memmove(&st->mapEntry[k + 1], in udf_relocate_blocks()
245 &st->mapEntry[k], in udf_relocate_blocks()
246 (l - k) * in udf_relocate_blocks()
248 st->mapEntry[k] = mapEntry; in udf_relocate_blocks()
257 st->mapEntry[k].mappedLocation) + in udf_relocate_blocks()
/fs/hpfs/
Dalloc.c161 unsigned k = le32_to_cpu(bmp[i-1]); in alloc_in_bmp() local
162 while (k & 0x80000000) { in alloc_in_bmp()
163 q--; k <<= 1; in alloc_in_bmp()
368 unsigned k; in hpfs_check_free_dnodes() local
370 for (k = le32_to_cpu(bmp[j]); k; k >>= 1) if (k & 1) if (!--n) { in hpfs_check_free_dnodes()
389 u32 k; in hpfs_check_free_dnodes() local
391 for (k = 0xf; k; k <<= 4) in hpfs_check_free_dnodes()
392 if ((le32_to_cpu(bmp[j]) & k) == k) { in hpfs_check_free_dnodes()
/fs/minix/
Ditree_common.c230 int k, err; in find_shared() local
233 for (k = depth; k > 1 && !offsets[k-1]; k--) in find_shared()
235 partial = get_branch(inode, k, offsets, chain, &err); in find_shared()
239 partial = chain + k-1; in find_shared()
246 if (p == chain + k - 1 && p > chain) { in find_shared()
359 int k = sb->s_blocksize_bits - 10; in nblocks() local
361 blocks = (size + sb->s_blocksize - 1) >> (BLOCK_SIZE_BITS + k); in nblocks()
Dbitmap.c47 int k = sb->s_blocksize_bits + 3; in minix_free_block() local
55 bit = zone & ((1<<k) - 1); in minix_free_block()
56 zone >>= k; in minix_free_block()
188 int k = sb->s_blocksize_bits + 3; in minix_free_inode() local
196 bit = ino & ((1<<k) - 1); in minix_free_inode()
197 ino >>= k; in minix_free_inode()
/fs/jfs/
Djfs_txnmgr.c227 int k, size; in txInit() local
275 for (k = 1; k < nTxBlock - 1; k++) { in txInit()
276 TxBlock[k].next = k + 1; in txInit()
277 init_waitqueue_head(&TxBlock[k].gcwait); in txInit()
278 init_waitqueue_head(&TxBlock[k].waitor); in txInit()
280 TxBlock[k].next = 0; in txInit()
281 init_waitqueue_head(&TxBlock[k].gcwait); in txInit()
282 init_waitqueue_head(&TxBlock[k].waitor); in txInit()
303 for (k = 1; k < nTxLock - 1; k++) in txInit()
304 TxLock[k].next = k + 1; in txInit()
[all …]
Djfs_extent.c631 u64 m, k; in extRoundDown() local
639 k = (u64) 1 << i; in extRoundDown()
640 k = ((k - 1) & nb) ? k : k >> 1; in extRoundDown()
642 return (k); in extRoundDown()
Djfs_dmap.c1395 int rc, ti, i, k, m, n, agperlev; in dbAllocAG() local
1487 for (k = bmp->db_agheight; k > 0; k--) { in dbAllocAG()
2932 int lp, pp, k; in dbAdjTree() local
2956 for (k = 0; k < le32_to_cpu(tp->dmt_height); k++) { in dbAdjTree()
3012 int ti, n = 0, k, x = 0; in dbFindLeaf() local
3027 for (k = le32_to_cpu(tp->dmt_height), ti = 1; in dbFindLeaf()
3028 k > 0; k--, ti = ((ti + n) << 2) + 1) { in dbFindLeaf()
3431 int i, i0 = true, j, j0 = true, k, n; in dbExtendFS() local
3480 k = 1 << (l2agsize - oldl2agsize); in dbExtendFS()
3486 for (j = 0; j < k && i < agno; j++, i++) { in dbExtendFS()
[all …]
/fs/smbfs_common/
Dcifs_arc4.c17 int i, j = 0, k = 0; in cifs_arc4_setkey() local
28 j = (j + in_key[k] + a) & 0xff; in cifs_arc4_setkey()
31 if (++k >= key_len) in cifs_arc4_setkey()
32 k = 0; in cifs_arc4_setkey()
Dcifs_md4.c50 #define ROUND1(a,b,c,d,k,s) (a = lshift(a + F(b,c,d) + k, s)) argument
51 #define ROUND2(a,b,c,d,k,s) (a = lshift(a + G(b,c,d) + k + (u32)0x5A827999,s)) argument
52 #define ROUND3(a,b,c,d,k,s) (a = lshift(a + H(b,c,d) + k + (u32)0x6ED9EBA1,s)) argument
/fs/
Dbinfmt_elf.c629 unsigned long k, map_addr; in load_elf_interp() local
655 k = load_addr + eppnt->p_vaddr; in load_elf_interp()
656 if (BAD_ADDR(k) || in load_elf_interp()
659 TASK_SIZE - eppnt->p_memsz < k) { in load_elf_interp()
668 k = load_addr + eppnt->p_vaddr + eppnt->p_filesz; in load_elf_interp()
669 if (k > elf_bss) in load_elf_interp()
670 elf_bss = k; in load_elf_interp()
676 k = load_addr + eppnt->p_vaddr + eppnt->p_memsz; in load_elf_interp()
677 if (k > last_bss) { in load_elf_interp()
678 last_bss = k; in load_elf_interp()
[all …]
/fs/sysv/
Ditree.c288 int k, err; in find_shared() local
291 for (k = depth; k > 1 && !offsets[k-1]; k--) in find_shared()
295 partial = get_branch(inode, k, offsets, chain, &err); in find_shared()
297 partial = chain + k-1; in find_shared()
314 if (p == chain + k - 1 && p > chain) { in find_shared()
/fs/exfat/
Dballoc.c203 unsigned char k, clu_mask; in exfat_find_free_bitmap() local
216 k = *(sbi->vol_amap[map_i]->b_data + map_b); in exfat_find_free_bitmap()
218 k |= clu_mask; in exfat_find_free_bitmap()
221 if (k < 0xFF) { in exfat_find_free_bitmap()
222 clu_free = clu_base + free_bit[k]; in exfat_find_free_bitmap()
/fs/ntfs3/
Dbitmap.c152 struct rb_node_key *k; in rb_lookup() local
154 k = rb_entry(*p, struct rb_node_key, node); in rb_lookup()
155 if (v < k->key) { in rb_lookup()
157 } else if (v > k->key) { in rb_lookup()
158 r = &k->node; in rb_lookup()
161 return &k->node; in rb_lookup()
179 struct e_node *k = in rb_insert_count() local
182 if (e_ckey > k->count.key) { in rb_insert_count()
184 } else if (e_ckey < k->count.key) { in rb_insert_count()
186 } else if (e_skey < k->start.key) { in rb_insert_count()
[all …]
/fs/ext4/
Dindirect.c277 static int ext4_blks_to_allocate(Indirect *branch, int k, unsigned int blks, in ext4_blks_to_allocate() argument
286 if (k > 0) { in ext4_blks_to_allocate()
809 int k, err; in ext4_find_shared() local
813 for (k = depth; k > 1 && !offsets[k-1]; k--) in ext4_find_shared()
815 partial = ext4_get_branch(inode, k, offsets, chain, &err); in ext4_find_shared()
818 partial = chain + k-1; in ext4_find_shared()
834 if (p == chain + k - 1 && p > chain) { in ext4_find_shared()
Dextents.c647 int k, l = path->p_depth; in ext4_ext_show_path() local
650 for (k = 0; k <= l; k++, path++) { in ext4_ext_show_path()
775 int k; in ext4_ext_binsearch_idx() local
778 for (k = 0; k < le16_to_cpu(eh->eh_entries); k++, ix++) { in ext4_ext_binsearch_idx()
779 if (k != 0 && le32_to_cpu(ix->ei_block) <= in ext4_ext_binsearch_idx()
782 "first=0x%p\n", k, in ext4_ext_binsearch_idx()
788 BUG_ON(k && le32_to_cpu(ix->ei_block) in ext4_ext_binsearch_idx()
846 int k; in ext4_ext_binsearch() local
849 for (k = 0; k < le16_to_cpu(eh->eh_entries); k++, ex++) { in ext4_ext_binsearch()
850 BUG_ON(k && le32_to_cpu(ex->ee_block) in ext4_ext_binsearch()
[all …]
/fs/fat/
Ddir.c361 int chi, chl, i, j, k; in fat_parse_short() local
414 for (k = 8; k < MSDOS_NAME;) { in fat_parse_short()
415 c = work[k]; in fat_parse_short()
418 chl = fat_shortname2uni(nls_disk, &work[k], MSDOS_NAME - k, in fat_parse_short()
422 k++; in fat_parse_short()
433 int offset = min(chl, MSDOS_NAME-k); in fat_parse_short()
434 k += offset; in fat_parse_short()
437 for (chi = 0; chi < chl && k < MSDOS_NAME; in fat_parse_short()
438 chi++, i++, k++) { in fat_parse_short()
439 ptname[i] = work[k]; in fat_parse_short()
/fs/nilfs2/
Dalloc.c737 int i, j, k, ret; in nilfs_palloc_freev() local
808 for (k = 0; k < nempties; k++) { in nilfs_palloc_freev()
810 last_nrs[k]); in nilfs_palloc_freev()
814 ret, (unsigned long long)last_nrs[k], in nilfs_palloc_freev()
/fs/ext2/
Dinode.c361 ext2_blks_to_allocate(Indirect * branch, int k, unsigned long blks, in ext2_blks_to_allocate() argument
370 if (k > 0) { in ext2_blks_to_allocate()
1054 int k, err; in ext2_find_shared() local
1057 for (k = depth; k > 1 && !offsets[k-1]; k--) in ext2_find_shared()
1059 partial = ext2_get_branch(inode, k, offsets, chain, &err); in ext2_find_shared()
1061 partial = chain + k-1; in ext2_find_shared()
1079 if (p == chain + k - 1 && p > chain) { in ext2_find_shared()

12