Home
last modified time | relevance | path

Searched refs:j (Results 1 – 25 of 109) sorted by relevance

12345

/fs/ufs/
Dcylinder.c36 unsigned i, j; in ufs_read_cylinder() local
73 for (j = 1; j < i; j++) in ufs_read_cylinder()
74 brelse (sbi->s_ucg[j]); in ufs_read_cylinder()
133 unsigned cg, i, j; in ufs_load_cylinder() local
177 for (j = i; j > 0; j--) { in ufs_load_cylinder()
178 sbi->s_cgno[j] = sbi->s_cgno[j-1]; in ufs_load_cylinder()
179 sbi->s_ucpi[j] = sbi->s_ucpi[j-1]; in ufs_load_cylinder()
193 for (j = sbi->s_cg_loaded - 1; j > 0; j--) { in ufs_load_cylinder()
194 sbi->s_cgno[j] = sbi->s_cgno[j-1]; in ufs_load_cylinder()
195 sbi->s_ucpi[j] = sbi->s_ucpi[j-1]; in ufs_load_cylinder()
Dutil.c23 unsigned i, j ; in _ubh_bread_() local
42 for (j = 0; j < i; j++) in _ubh_bread_()
43 brelse (ubh->bh[j]); in _ubh_bread_()
51 unsigned i, j; in ubh_bread_uspi() local
67 for (j = 0; j < i; j++) in ubh_bread_uspi()
68 brelse (USPI_UBH(uspi)->bh[j]); in ubh_bread_uspi()
Dialloc.c181 unsigned cg, bit, i, j, start; in ufs_new_inode() local
212 for ( j = 1; j < uspi->s_ncg; j <<= 1 ) { in ufs_new_inode()
213 i += j; in ufs_new_inode()
226 for (j = 2; j < uspi->s_ncg; j++) { in ufs_new_inode()
/fs/minix/
Dbitmap.c79 int j; in minix_new_block() local
82 j = minix_find_first_zero_bit(bh->b_data, bits_per_zone); in minix_new_block()
83 if (j < bits_per_zone) { in minix_new_block()
84 minix_set_bit(j, bh->b_data); in minix_new_block()
87 j += i * bits_per_zone + sbi->s_firstdatazone-1; in minix_new_block()
88 if (j < sbi->s_firstdatazone || j >= sbi->s_nzones) in minix_new_block()
90 return j; in minix_new_block()
220 unsigned long j; in minix_new_inode() local
227 j = bits_per_zone; in minix_new_inode()
233 j = minix_find_first_zero_bit(bh->b_data, bits_per_zone); in minix_new_inode()
[all …]
/fs/xfs/
Dxfs_stats.c34 int i, j; in xfs_stats_format() local
72 for (i = j = 0; i < ARRAY_SIZE(xstats); i++) { in xfs_stats_format()
76 for (; j < xstats[i].endpoint; j++) in xfs_stats_format()
78 counter_val(stats, j)); in xfs_stats_format()
142 int j; in xqmstat_proc_show() local
145 for (j = XFSSTAT_END_IBT_V2; j < XFSSTAT_END_XQMSTAT; j++) in xqmstat_proc_show()
146 seq_printf(m, " %u", counter_val(xfsstats.xs_stats, j)); in xqmstat_proc_show()
Dxfs_trans_dquot.c93 int i, j; in xfs_trans_dup_dqinfo() local
109 for (j = 0; j < XFS_QM_TRANS_DQTYPES; j++) { in xfs_trans_dup_dqinfo()
110 oqa = otp->t_dqinfo->dqs[j]; in xfs_trans_dup_dqinfo()
111 nqa = ntp->t_dqinfo->dqs[j]; in xfs_trans_dup_dqinfo()
331 int i, j; in xfs_trans_apply_dquot_deltas() local
342 for (j = 0; j < XFS_QM_TRANS_DQTYPES; j++) { in xfs_trans_apply_dquot_deltas()
343 qa = tp->t_dqinfo->dqs[j]; in xfs_trans_apply_dquot_deltas()
514 int i, j; in xfs_trans_unreserve_and_mod_dquots() local
522 for (j = 0; j < XFS_QM_TRANS_DQTYPES; j++) { in xfs_trans_unreserve_and_mod_dquots()
523 qa = tp->t_dqinfo->dqs[j]; in xfs_trans_unreserve_and_mod_dquots()
/fs/reiserfs/
Dhashes.c130 int j, pow; in yura_hash() local
144 for (pow = 1, j = i; j < len - 1; j++) in yura_hash()
151 for (pow = 1, j = i; j < len - 1; j++) in yura_hash()
158 for (pow = 1, j = i; j < len - 1; j++) in yura_hash()
Ditem_ops.c144 int j = 0; in direct_print_item() local
148 while (j < ih_item_len(ih)) in direct_print_item()
149 printk("%c", item[j++]); in direct_print_item()
270 int j; in indirect_print_item() local
281 for (j = 0; j < I_UNFM_NUM(ih); j++) { in indirect_print_item()
282 if (sequence_finished(prev, &num, get_block_num(unp, j))) { in indirect_print_item()
284 start_new_sequence(&prev, &num, get_block_num(unp, j)); in indirect_print_item()
471 int i, j; in direntry_create_vi() local
491 j = old_entry_num(is_affected, i, vn->vn_pos_in_item, in direntry_create_vi()
494 (j ? deh_location(&deh[j - 1]) : ih_item_len(vi->vi_ih)) - in direntry_create_vi()
[all …]
/fs/affs/
Dsymlink.c20 int i, j; in affs_symlink_readpage() local
30 j = 0; in affs_symlink_readpage()
42 while (i < 1023 && lf->symname[j] != ':') in affs_symlink_readpage()
43 link[i++] = lf->symname[j++]; in affs_symlink_readpage()
46 j++; in affs_symlink_readpage()
49 while (i < 1023 && (c = lf->symname[j])) { in affs_symlink_readpage()
56 j++; in affs_symlink_readpage()
/fs/cifs/
Dcifs_unicode.c477 int j = 0; in cifsConvertToUTF16() local
490 for (i = 0; i < srclen; j++) { in cifsConvertToUTF16()
547 put_unaligned(dst_char, &target[j]); in cifsConvertToUTF16()
552 put_unaligned(dst_char, &target[j]); in cifsConvertToUTF16()
554 j++; in cifsConvertToUTF16()
555 put_unaligned(dst_char, &target[j]); in cifsConvertToUTF16()
558 put_unaligned(dst_char, &target[j]); in cifsConvertToUTF16()
560 j++; in cifsConvertToUTF16()
561 put_unaligned(dst_char, &target[j]); in cifsConvertToUTF16()
563 j++; in cifsConvertToUTF16()
[all …]
/fs/jbd2/
Drecovery.c177 static int jbd2_descriptor_block_csum_verify(journal_t *j, void *buf) in jbd2_descriptor_block_csum_verify() argument
183 if (!jbd2_journal_has_csum_v2or3(j)) in jbd2_descriptor_block_csum_verify()
186 tail = (struct jbd2_journal_block_tail *)(buf + j->j_blocksize - in jbd2_descriptor_block_csum_verify()
190 calculated = jbd2_chksum(j, j->j_csum_seed, buf, j->j_blocksize); in jbd2_descriptor_block_csum_verify()
381 static int jbd2_commit_block_csum_verify(journal_t *j, void *buf) in jbd2_commit_block_csum_verify() argument
387 if (!jbd2_journal_has_csum_v2or3(j)) in jbd2_commit_block_csum_verify()
393 calculated = jbd2_chksum(j, j->j_csum_seed, buf, j->j_blocksize); in jbd2_commit_block_csum_verify()
399 static int jbd2_block_tag_csum_verify(journal_t *j, journal_block_tag_t *tag, in jbd2_block_tag_csum_verify() argument
406 if (!jbd2_journal_has_csum_v2or3(j)) in jbd2_block_tag_csum_verify()
410 csum32 = jbd2_chksum(j, j->j_csum_seed, (__u8 *)&seq, sizeof(seq)); in jbd2_block_tag_csum_verify()
[all …]
/fs/udf/
Dpartition.c158 int i, j, k, l; in udf_relocate_blocks() local
173 for (j = 0; j < 4; j++) in udf_relocate_blocks()
174 if (sdata->s_spar_map[j] != NULL) { in udf_relocate_blocks()
176 sdata->s_spar_map[j]->b_data; in udf_relocate_blocks()
192 for (; j < 4; j++) { in udf_relocate_blocks()
194 bh = sdata->s_spar_map[j]; in udf_relocate_blocks()
235 for (; j < 4; j++) { in udf_relocate_blocks()
236 bh = sdata->s_spar_map[j]; in udf_relocate_blocks()
/fs/squashfs/
Dcache.c212 int i, j; in squashfs_cache_delete() local
219 for (j = 0; j < cache->pages; j++) in squashfs_cache_delete()
220 kfree(cache->entry[i].data[j]); in squashfs_cache_delete()
239 int i, j; in squashfs_cache_init() local
277 for (j = 0; j < cache->pages; j++) { in squashfs_cache_init()
278 entry->data[j] = kmalloc(PAGE_SIZE, GFP_KERNEL); in squashfs_cache_init()
279 if (entry->data[j] == NULL) { in squashfs_cache_init()
/fs/nfs/filelayout/
Dfilelayoutdev.c154 int j; in nfs4_fl_alloc_deviceid_node() local
162 for (j = 0; j < mp_count; j++) { in nfs4_fl_alloc_deviceid_node()
236 nfs4_fl_calc_ds_index(struct pnfs_layout_segment *lseg, u32 j) in nfs4_fl_calc_ds_index() argument
238 return FILELAYOUT_LSEG(lseg)->dsaddr->stripe_indices[j]; in nfs4_fl_calc_ds_index()
242 nfs4_fl_select_ds_fh(struct pnfs_layout_segment *lseg, u32 j) in nfs4_fl_select_ds_fh() argument
254 i = nfs4_fl_calc_ds_index(lseg, j); in nfs4_fl_select_ds_fh()
256 i = j; in nfs4_fl_select_ds_fh()
/fs/hpfs/
Dname.c95 int i,j; in hpfs_is_name_long() local
100 for (j = i + 1; j < len; j++) in hpfs_is_name_long()
101 if (name[j] == '.' || no_dos_char(name[i])) return 1; in hpfs_is_name_long()
102 return j - i > 4; in hpfs_is_name_long()
Dalloc.c363 int i, j; in hpfs_check_free_dnodes() local
367 for (j = 0; j < 512; j++) { in hpfs_check_free_dnodes()
369 if (!le32_to_cpu(bmp[j])) continue; in hpfs_check_free_dnodes()
370 for (k = le32_to_cpu(bmp[j]); k; k >>= 1) if (k & 1) if (!--n) { in hpfs_check_free_dnodes()
388 for (j = 0; j < 512; j++) { in hpfs_check_free_dnodes()
390 if (!le32_to_cpu(bmp[j])) continue; in hpfs_check_free_dnodes()
392 if ((le32_to_cpu(bmp[j]) & k) == k) { in hpfs_check_free_dnodes()
/fs/proc/
Dstat.c84 int i, j; in show_stat() local
111 for (j = 0; j < NR_SOFTIRQS; j++) { in show_stat()
112 unsigned int softirq_stat = kstat_softirqs_cpu(j, i); in show_stat()
114 per_softirq_sums[j] += softirq_stat; in show_stat()
160 for_each_irq_nr(j) in show_stat()
161 seq_put_decimal_ull(p, " ", kstat_irqs_usr(j)); in show_stat()
Dsoftirqs.c12 int i, j; in show_softirqs() local
21 for_each_possible_cpu(j) in show_softirqs()
22 seq_printf(p, " %10u", kstat_softirqs_cpu(i, j)); in show_softirqs()
/fs/freevxfs/
Dvxfs_super.c221 u32 j; in vxfs_fill_super() local
255 j = fs32_to_cpu(infp, rsbp->vs_version); in vxfs_fill_super()
256 if ((j < 2 || j > 4) && !silent) { in vxfs_fill_super()
257 printk(KERN_NOTICE "vxfs: unsupported VxFS version (%d)\n", j); in vxfs_fill_super()
262 printk(KERN_DEBUG "vxfs: supported VxFS version (%d)\n", j); in vxfs_fill_super()
272 j = fs32_to_cpu(infp, rsbp->vs_bsize); in vxfs_fill_super()
273 if (!sb_set_blocksize(sbp, j)) { in vxfs_fill_super()
/fs/befs/
Ddatastream.c310 int i, j; in befs_find_brun_indirect() local
339 for (j = 0; j < arraylen; ++j) { in befs_find_brun_indirect()
340 int len = fs16_to_cpu(sb, array[j].len); in befs_find_brun_indirect()
345 fs32_to_cpu(sb, array[j].allocation_group); in befs_find_brun_indirect()
347 fs16_to_cpu(sb, array[j].start) + offset; in befs_find_brun_indirect()
349 fs16_to_cpu(sb, array[j].len) - offset; in befs_find_brun_indirect()
356 j + (i * arraylen)); in befs_find_brun_indirect()
/fs/nilfs2/
Dalloc.c517 unsigned long i, j; in nilfs_palloc_prepare_alloc_entry() local
541 for (j = 0; j < n; j++, desc++, group++) { in nilfs_palloc_prepare_alloc_entry()
745 int i, j, k, ret; in nilfs_palloc_freev() local
748 for (i = 0; i < nitems; i = j) { in nilfs_palloc_freev()
770 j = i; in nilfs_palloc_freev()
778 (unsigned long long)entry_nrs[j]); in nilfs_palloc_freev()
783 j++; in nilfs_palloc_freev()
784 if (j >= nitems || entry_nrs[j] < group_min_nr || in nilfs_palloc_freev()
785 entry_nrs[j] >= group_min_nr + epg) { in nilfs_palloc_freev()
788 group_offset = entry_nrs[j] - group_min_nr; in nilfs_palloc_freev()
[all …]
Dsufile.c321 int ret, j; in nilfs_sufile_alloc() local
371 for (j = 0; j < nsus; j++, su = (void *)su + susz, segnum++) { in nilfs_sufile_alloc()
663 int j; in nilfs_sufile_truncate_range() local
695 for (j = 0; j < n; j++, su = (void *)su + susz) { in nilfs_sufile_truncate_range()
698 nilfs_segment_is_active(nilfs, segnum + j)) { in nilfs_sufile_truncate_range()
706 for (su = su2, j = 0; j < n; j++, su = (void *)su + susz) { in nilfs_sufile_truncate_range()
832 int ret, i, j; in nilfs_sufile_get_suinfo() local
859 for (j = 0; j < n; in nilfs_sufile_get_suinfo()
860 j++, su = (void *)su + susz, si = (void *)si + sisz) { in nilfs_sufile_get_suinfo()
865 if (nilfs_segment_is_active(nilfs, segnum + j)) in nilfs_sufile_get_suinfo()
/fs/efs/
Dsuper.c191 int j; in module_exit() local
194 for(j = 0; j < VDNAMESIZE; j++) { in module_exit()
195 name[j] = vh->vh_vd[i].vd_name[j]; in module_exit()
197 name[j] = (char) 0; in module_exit()
/fs/btrfs/tests/
Dextent-io-tests.c304 unsigned long i, j; in __test_eb_bitmaps() local
367 for (j = 0; j < 32; j++) { in __test_eb_bitmaps()
368 if (x & (1U << j)) { in __test_eb_bitmaps()
369 bitmap_set(bitmap, i * 32 + j, 1); in __test_eb_bitmaps()
370 extent_buffer_bitmap_set(eb, 0, i * 32 + j, 1); in __test_eb_bitmaps()
/fs/
Dbinfmt_misc.c97 int j; in check_file() local
113 for (j = 0; j < e->size; j++) in check_file()
114 if ((*s++ ^ e->magic[j]) & e->mask[j]) in check_file()
117 for (j = 0; j < e->size; j++) in check_file()
118 if ((*s++ ^ e->magic[j])) in check_file()
121 if (j == e->size) in check_file()

12345