| /fs/cifs/ |
| D | smbdes.c | 194 int i, j, k; in dohash() local
236 for (j = 0; j < 32; j++) { in dohash()
237 l[j] = pd1[j]; in dohash()
238 r[j] = pd1[j + 32]; in dohash()
264 for (j = 0; j < 8; j++) in dohash()
266 b[j][k] = erk[j * 6 + k]; in dohash()
268 for (j = 0; j < 8; j++) { in dohash()
270 m = (b[j][0] << 1) | b[j][5]; in dohash()
272 n = (b[j][1] << 3) | (b[j][2] << 2) | (b[j][3] << in dohash()
273 1) | b[j][4]; in dohash()
[all …]
|
| D | misc.c | 602 int i, j; in dump_smb() local
610 for (i = 0, j = 0; i < smb_buf_length; i++, j++) { in dump_smb()
614 j = 0; in dump_smb()
617 debug_line[2 * j] = ' '; in dump_smb()
619 debug_line[1 + (2 * j)] = buffer[i]; in dump_smb()
621 debug_line[1 + (2 * j)] = '_'; in dump_smb()
629 for (; j < 8; j++) { in dump_smb()
631 debug_line[2 * j] = ' '; in dump_smb()
632 debug_line[1 + (2 * j)] = ' '; in dump_smb()
657 int i, j, len; in cifs_convertUCSpath() local
[all …]
|
| D | md4.c | 61 int j; in mdfour64() local
66 for (j = 0; j < 16; j++) in mdfour64()
67 X[j] = M[j]; in mdfour64()
135 for (j = 0; j < 16; j++) in mdfour64()
136 X[j] = 0; in mdfour64()
|
| D | cifs_debug.c | 37 int i, j; in cifs_dump_mem() local
46 for (j = 0; (j < 4) && (i + j * 4 < length); j++) { in cifs_dump_mem()
47 sprintf(buf, " %08x", intptr[i / 4 + j]); in cifs_dump_mem()
52 for (j = 0; (j < 16) && (i + j < length); j++) { in cifs_dump_mem()
53 buf[1] = isprint(charptr[i + j]) ? charptr[i + j] : '.'; in cifs_dump_mem()
115 int i, j; in cifs_debug_data_proc_show() local
161 j = 0; in cifs_debug_data_proc_show()
165 ++j; in cifs_debug_data_proc_show()
167 seq_printf(m, "\n\t%d) %s Mounts: %d ", j, in cifs_debug_data_proc_show()
|
| D | cifsacl.c | 54 int i, j; in match_sid() local
69 for (j = 0; j < 6; ++j) { in match_sid()
70 if (ctsid->authority[j] != cwsid->authority[j]) in match_sid()
73 if (j < 6) in match_sid()
81 for (j = 0; j < num_subauth; ++j) { in match_sid()
82 if (ctsid->sub_auth[j] != cwsid->sub_auth[j]) in match_sid()
85 if (j < num_subauth) in match_sid()
|
| /fs/minix/ |
| D | bitmap.c | 24 unsigned i, j, sum = 0; in count_free() local
30 for (j=0; j<bh->b_size; j++) in count_free()
31 sum += nibblemap[bh->b_data[j] & 0xf] in count_free()
32 + nibblemap[(bh->b_data[j]>>4) & 0xf]; in count_free()
38 for (j=0; j<i; j++) { in count_free()
39 sum += nibblemap[bh->b_data[j] & 0xf] in count_free()
40 + nibblemap[(bh->b_data[j]>>4) & 0xf]; in count_free()
45 i = *(__u16 *)(&bh->b_data[j]) | ~((1<<i) - 1); in count_free()
89 int j; in minix_new_block() local
92 j = minix_find_first_zero_bit(bh->b_data, bits_per_zone); in minix_new_block()
[all …]
|
| /fs/ufs/ |
| D | cylinder.c | 35 unsigned i, j; in ufs_read_cylinder() local
72 for (j = 1; j < i; j++) in ufs_read_cylinder()
73 brelse (sbi->s_ucg[j]); in ufs_read_cylinder()
132 unsigned cg, i, j; in ufs_load_cylinder() local
176 for (j = i; j > 0; j--) { in ufs_load_cylinder()
177 sbi->s_cgno[j] = sbi->s_cgno[j-1]; in ufs_load_cylinder()
178 sbi->s_ucpi[j] = sbi->s_ucpi[j-1]; in ufs_load_cylinder()
192 for (j = sbi->s_cg_loaded - 1; j > 0; j--) { in ufs_load_cylinder()
193 sbi->s_cgno[j] = sbi->s_cgno[j-1]; in ufs_load_cylinder()
194 sbi->s_ucpi[j] = sbi->s_ucpi[j-1]; in ufs_load_cylinder()
|
| D | util.c | 22 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()
|
| D | ialloc.c | 192 unsigned cg, bit, i, j, start; in ufs_new_inode() local
224 for ( j = 1; j < uspi->s_ncg; j <<= 1 ) { in ufs_new_inode()
225 i += j; in ufs_new_inode()
238 for (j = 2; j < uspi->s_ncg; j++) { in ufs_new_inode()
|
| /fs/reiserfs/ |
| D | hashes.c | 135 int j, pow; in yura_hash() local
149 for (pow = 1, j = i; j < len - 1; j++) in yura_hash()
156 for (pow = 1, j = i; j < len - 1; j++) in yura_hash()
163 for (pow = 1, j = i; j < len - 1; j++) in yura_hash()
|
| D | item_ops.c | 144 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()
273 int j; in indirect_print_item() local
284 for (j = 0; j < I_UNFM_NUM(ih); j++) { in indirect_print_item()
285 if (sequence_finished(prev, &num, get_block_num(unp, j))) { in indirect_print_item()
287 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/ |
| D | symlink.c | 20 int i, j; in affs_symlink_readpage() local
32 j = 0; in affs_symlink_readpage()
40 while (i < 1023 && lf->symname[j] != ':') in affs_symlink_readpage()
41 link[i++] = lf->symname[j++]; in affs_symlink_readpage()
44 j++; in affs_symlink_readpage()
47 while (i < 1023 && (c = lf->symname[j])) { in affs_symlink_readpage()
54 j++; in affs_symlink_readpage()
|
| /fs/udf/ |
| D | partition.c | 159 int i, j, k, l; in udf_relocate_blocks() local
172 for (j = 0; j < 4; j++) in udf_relocate_blocks()
173 if (sdata->s_spar_map[j] != NULL) { in udf_relocate_blocks()
175 sdata->s_spar_map[j]->b_data; in udf_relocate_blocks()
189 for (; j < 4; j++) { in udf_relocate_blocks()
191 bh = sdata->s_spar_map[j]; in udf_relocate_blocks()
230 for (; j < 4; j++) { in udf_relocate_blocks()
231 bh = sdata->s_spar_map[j]; in udf_relocate_blocks()
|
| /fs/xfs/ |
| D | xfs_rename.c | 58 int i, j; in xfs_sort_for_rename() local
83 for (j = 1; j < *num_inodes; j++) { in xfs_sort_for_rename()
84 if (i_tab[j]->i_ino < i_tab[j-1]->i_ino) { in xfs_sort_for_rename()
85 temp = i_tab[j]; in xfs_sort_for_rename()
86 i_tab[j] = i_tab[j-1]; in xfs_sort_for_rename()
87 i_tab[j-1] = temp; in xfs_sort_for_rename()
|
| D | xfs_btree_trace.h | 88 #define XFS_BTREE_TRACE_ARGBII(c, b, i, j) \ argument
89 xfs_btree_trace_argbii(__func__, c, b, i, j, __LINE__)
90 #define XFS_BTREE_TRACE_ARGFFFI(c, o, b, i, j) \ argument
91 xfs_btree_trace_argfffi(__func__, c, o, b, i, j, __LINE__)
106 #define XFS_BTREE_TRACE_ARGBII(c, b, i, j) argument
107 #define XFS_BTREE_TRACE_ARGFFFI(c, o, b, i, j) argument
|
| /fs/squashfs/ |
| D | cache.c | 210 int i, j; in squashfs_cache_delete() local
217 for (j = 0; j < cache->pages; j++) in squashfs_cache_delete()
218 kfree(cache->entry[i].data[j]); in squashfs_cache_delete()
236 int i, j; in squashfs_cache_init() local
272 for (j = 0; j < cache->pages; j++) { in squashfs_cache_init()
273 entry->data[j] = kmalloc(PAGE_CACHE_SIZE, GFP_KERNEL); in squashfs_cache_init()
274 if (entry->data[j] == NULL) { in squashfs_cache_init()
|
| /fs/xfs/linux-2.6/ |
| D | xfs_stats.c | 32 int c, i, j, len, val; in xfs_read_xfsstats() local
63 for (i=j=len = 0; i < ARRAY_SIZE(xstats); i++) { in xfs_read_xfsstats()
66 while (j < xstats[i].endpoint) { in xfs_read_xfsstats()
70 val += *(((__u32*)&per_cpu(xfsstats, c) + j)); in xfs_read_xfsstats()
72 j++; in xfs_read_xfsstats()
|
| /fs/hpfs/ |
| D | name.c | 125 int i,j; in hpfs_is_name_long() local
130 for (j = i + 1; j < len; j++) in hpfs_is_name_long()
131 if (name[j] == '.' || no_dos_char(name[i])) return 1; in hpfs_is_name_long()
132 return j - i > 4; in hpfs_is_name_long()
|
| D | alloc.c | 329 int i, j; in hpfs_check_free_dnodes() local
333 for (j = 0; j < 512; j++) { in hpfs_check_free_dnodes()
335 if (!bmp[j]) continue; in hpfs_check_free_dnodes()
336 for (k = bmp[j]; k; k >>= 1) if (k & 1) if (!--n) { in hpfs_check_free_dnodes()
354 for (j = 0; j < 512; j++) { in hpfs_check_free_dnodes()
356 if (!bmp[j]) continue; in hpfs_check_free_dnodes()
358 if ((bmp[j] & k) == k) { in hpfs_check_free_dnodes()
|
| /fs/befs/ |
| D | datastream.c | 309 int i, j; in befs_find_brun_indirect() local
338 for (j = 0; j < arraylen; ++j) { in befs_find_brun_indirect()
339 int len = fs16_to_cpu(sb, array[j].len); in befs_find_brun_indirect()
344 fs32_to_cpu(sb, array[j].allocation_group); in befs_find_brun_indirect()
346 fs16_to_cpu(sb, array[j].start) + offset; in befs_find_brun_indirect()
348 fs16_to_cpu(sb, array[j].len) - offset; in befs_find_brun_indirect()
354 blockno, j + (i * arraylen)); in befs_find_brun_indirect()
|
| /fs/proc/ |
| D | stat.c | 24 int i, j; in show_stat() local
48 for_each_irq_nr(j) { in show_stat()
49 sum += kstat_irqs_cpu(j, i); in show_stat()
93 for_each_irq_nr(j) { in show_stat()
96 per_irq_sum += kstat_irqs_cpu(j, i); in show_stat()
|
| /fs/efs/ |
| D | super.c | 177 int j; in module_exit() local
180 for(j = 0; j < VDNAMESIZE; j++) { in module_exit()
181 name[j] = vh->vh_vd[i].vd_name[j]; in module_exit()
183 name[j] = (char) 0; in module_exit()
|
| /fs/fat/ |
| D | dir.c | 359 int chl, i, j, last_u, err, len; in fat_search_long() local
391 for (i = 0, j = 0, last_u = 0; i < 8;) { in fat_search_long()
395 &bufuname[j++], opt_shortname, in fat_search_long()
399 last_u = j; in fat_search_long()
401 last_u = j; in fat_search_long()
405 j = last_u; in fat_search_long()
406 fat_short2uni(nls_disk, ".", 1, &bufuname[j++]); in fat_search_long()
412 &bufuname[j++], opt_shortname, in fat_search_long()
416 last_u = j; in fat_search_long()
418 last_u = j; in fat_search_long()
[all …]
|
| /fs/ |
| D | binfmt_misc.c | 76 int j; in check_file() local
89 for (j = 0; j < e->size; j++) in check_file()
90 if ((*s++ ^ e->magic[j]) & e->mask[j]) in check_file()
93 for (j = 0; j < e->size; j++) in check_file()
94 if ((*s++ ^ e->magic[j])) in check_file()
97 if (j == e->size) in check_file()
|
| /fs/xfs/quota/ |
| D | xfs_trans_dquot.c | 120 int i,j; in xfs_trans_dup_dqinfo() local
137 for (j = 0; j < 2; j++) { in xfs_trans_dup_dqinfo()
353 int i, j; in xfs_trans_apply_dquot_deltas() local
365 for (j = 0; j < 2; j++) { in xfs_trans_apply_dquot_deltas()
538 int i, j; in xfs_trans_unreserve_and_mod_dquots() local
548 for (j = 0; j < 2; j++) { in xfs_trans_unreserve_and_mod_dquots()
|