| /fs/hpfs/ |
| D | inode.c | 11 void hpfs_init_inode(struct inode *i) in hpfs_init_inode() argument
13 struct super_block *sb = i->i_sb; in hpfs_init_inode()
14 struct hpfs_inode_info *hpfs_inode = hpfs_i(i); in hpfs_init_inode()
16 i->i_uid = hpfs_sb(sb)->sb_uid; in hpfs_init_inode()
17 i->i_gid = hpfs_sb(sb)->sb_gid; in hpfs_init_inode()
18 i->i_mode = hpfs_sb(sb)->sb_mode; in hpfs_init_inode()
20 i->i_size = -1; in hpfs_init_inode()
21 i->i_blocks = -1; in hpfs_init_inode()
37 i->i_ctime.tv_sec = i->i_ctime.tv_nsec = 0; in hpfs_init_inode()
38 i->i_mtime.tv_sec = i->i_mtime.tv_nsec = 0; in hpfs_init_inode()
[all …]
|
| D | name.c | 23 int i; in hpfs_decide_conv() local
25 for (i = 0; *text_postfix[i]; i++) { in hpfs_decide_conv()
26 int l = strlen(text_postfix[i]); in hpfs_decide_conv()
28 if (!hpfs_compare_names(inode->i_sb, text_postfix[i], l, name + len - l, l, 0)) in hpfs_decide_conv()
31 for (i = 0; *text_prefix[i]; i++) { in hpfs_decide_conv()
32 int l = strlen(text_prefix[i]); in hpfs_decide_conv()
34 if (!hpfs_compare_names(inode->i_sb, text_prefix[i], l, name, l, 0)) in hpfs_decide_conv()
76 int i; in hpfs_chk_name() local
80 for (i = 0; i < *len; i++) if (not_allowed_char(name[i])) return -EINVAL; in hpfs_chk_name()
90 int i; in hpfs_translate_name() local
[all …]
|
| D | dnode.c | 15 int i = 1; in get_pos() local
17 if (de == fde) return ((loff_t) d->self << 4) | (loff_t)i; in get_pos()
18 i++; in get_pos()
27 int i = 0; in hpfs_add_pos() local
31 for (; hpfs_inode->i_rddir_off[i]; i++) in hpfs_add_pos()
32 if (hpfs_inode->i_rddir_off[i] == pos) return; in hpfs_add_pos()
33 if (!(i&0x0f)) { in hpfs_add_pos()
34 if (!(ppos = kmalloc((i+0x11) * sizeof(loff_t*), GFP_NOFS))) { in hpfs_add_pos()
39 memcpy(ppos, hpfs_inode->i_rddir_off, i * sizeof(loff_t)); in hpfs_add_pos()
44 hpfs_inode->i_rddir_off[i] = pos; in hpfs_add_pos()
[all …]
|
| /fs/cifs/ |
| D | smbdes.c | 158 int i; in permute() local
159 for (i = 0; i < n; i++) in permute()
160 out[i] = in[p[i] - 1]; in permute()
167 int i; in lshift() local
168 for (i = 0; i < n; i++) in lshift()
169 out[i] = d[(i + count) % n]; in lshift()
170 for (i = 0; i < n; i++) in lshift()
171 d[i] = out[i]; in lshift()
186 int i; in xor() local
187 for (i = 0; i < n; i++) in xor()
[all …]
|
| D | cifsacl.c | 54 int i, j; in match_sid() local
61 for (i = 0; i < NUM_WK_SIDS; ++i) { in match_sid()
62 cwsid = &(wksidarr[i].cifssid); in match_sid()
89 cFYI(1, ("matching sid: %s\n", wksidarr[i].sidname)); in match_sid()
101 int i; in compare_sids() local
112 for (i = 0; i < 6; ++i) { in compare_sids()
113 if (ctsid->authority[i] != cwsid->authority[i]) in compare_sids()
122 for (i = 0; i < num_subauth; ++i) { in compare_sids()
123 if (ctsid->sub_auth[i] != cwsid->sub_auth[i]) in compare_sids()
136 int i; in copy_sec_desc() local
[all …]
|
| /fs/ufs/ |
| D | util.c | 22 unsigned i, j ; in _ubh_bread_() local
35 for (i = 0; i < count; i++) in _ubh_bread_()
36 if (!(ubh->bh[i] = sb_bread(sb, fragment + i))) in _ubh_bread_()
38 for (; i < UFS_MAXFRAG; i++) in _ubh_bread_()
39 ubh->bh[i] = NULL; in _ubh_bread_()
42 for (j = 0; j < i; j++) in _ubh_bread_()
51 unsigned i, j; in ubh_bread_uspi() local
60 for (i = 0; i < count; i++) in ubh_bread_uspi()
61 if (!(USPI_UBH(uspi)->bh[i] = sb_bread(sb, fragment + i))) in ubh_bread_uspi()
63 for (; i < UFS_MAXFRAG; i++) in ubh_bread_uspi()
[all …]
|
| /fs/xfs/ |
| D | xfs_error.c | 46 int i; in xfs_error_trap() local
50 for (i = 0; i < XFS_ERROR_NTRAP; i++) { in xfs_error_trap()
51 if (xfs_etrap[i] == 0) in xfs_error_trap()
53 if (e != xfs_etrap[i]) in xfs_error_trap()
70 int i; in xfs_error_test() local
78 for (i = 0; i < XFS_NUM_INJECT_ERROR; i++) { in xfs_error_test()
79 if (xfs_etest[i] == error_tag && xfs_etest_fsid[i] == fsid) { in xfs_error_test()
82 expression, file, line, xfs_etest_fsname[i]); in xfs_error_test()
93 int i; in xfs_errortag_add() local
99 for (i = 0; i < XFS_NUM_INJECT_ERROR; i++) { in xfs_errortag_add()
[all …]
|
| D | xfs_trans_item.c | 50 int i=0; in xfs_trans_add_item() local
102 i = licp->lic_unused; in xfs_trans_add_item()
103 ASSERT(xfs_lic_isfree(licp, i)); in xfs_trans_add_item()
106 for (i = 0; i <= XFS_LIC_MAX_SLOT; i++) { in xfs_trans_add_item()
107 if (xfs_lic_isfree(licp, i)) in xfs_trans_add_item()
110 ASSERT(i <= XFS_LIC_MAX_SLOT); in xfs_trans_add_item()
120 xfs_lic_claim(licp, i); in xfs_trans_add_item()
121 if (licp->lic_unused <= i) { in xfs_trans_add_item()
122 licp->lic_unused = i + 1; in xfs_trans_add_item()
123 xfs_lic_init_slot(licp, i); in xfs_trans_add_item()
[all …]
|
| D | xfs_btree_trace.h | 86 #define XFS_BTREE_TRACE_ARGBI(c, b, i) \ argument
87 xfs_btree_trace_argbi(__func__, c, b, i, __LINE__)
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__)
92 #define XFS_BTREE_TRACE_ARGI(c, i) \ argument
93 xfs_btree_trace_argi(__func__, c, i, __LINE__)
94 #define XFS_BTREE_TRACE_ARGIPK(c, i, p, k) \ argument
95 xfs_btree_trace_argipk(__func__, c, i, p, k, __LINE__)
[all …]
|
| /fs/ocfs2/ |
| D | blockcheck.c | 61 static unsigned int calc_code_bit(unsigned int i, unsigned int *p_cache) in calc_code_bit() argument
69 b = i + 1; in calc_code_bit()
106 unsigned int i, b, p = 0; in ocfs2_hamming_encode() local
119 for (i = 0; (i = ocfs2_find_next_bit(data, d, i)) < d; i++) in ocfs2_hamming_encode()
125 b = calc_code_bit(nr + i, &p); in ocfs2_hamming_encode()
166 unsigned int i, b; in ocfs2_hamming_fix() local
194 for (i = 0; i < d; i++, b++) in ocfs2_hamming_fix()
210 if (ocfs2_test_bit(i, data)) in ocfs2_hamming_fix()
211 ocfs2_clear_bit(i, data); in ocfs2_hamming_fix()
213 ocfs2_set_bit(i, data); in ocfs2_hamming_fix()
[all …]
|
| D | slot_map.c | 84 int b, i, slotno; in ocfs2_update_slot_info_extended() local
90 for (i = 0; in ocfs2_update_slot_info_extended()
91 (i < si->si_slots_per_block) && in ocfs2_update_slot_info_extended()
93 i++, slotno++) { in ocfs2_update_slot_info_extended()
94 if (se->se_slots[i].es_valid) in ocfs2_update_slot_info_extended()
96 le32_to_cpu(se->se_slots[i].es_node_num)); in ocfs2_update_slot_info_extended()
109 int i; in ocfs2_update_slot_info_old() local
114 for (i = 0; i < si->si_num_slots; i++) { in ocfs2_update_slot_info_old()
115 if (le16_to_cpu(sm->sm_slots[i]) == (u16)OCFS2_INVALID_SLOT) in ocfs2_update_slot_info_old()
116 ocfs2_invalidate_slot(si, i); in ocfs2_update_slot_info_old()
[all …]
|
| /fs/jfs/ |
| D | jfs_unicode.c | 35 int i; in jfs_strfromUCS_le() local
41 for (i = 0; (i < len) && from[i]; i++) { in jfs_strfromUCS_le()
44 codepage->uni2char(le16_to_cpu(from[i]), in jfs_strfromUCS_le()
53 for (i = 0; (i < len) && from[i]; i++) { in jfs_strfromUCS_le()
54 if (unlikely(le16_to_cpu(from[i]) & 0xff00)) { in jfs_strfromUCS_le()
55 to[i] = '?'; in jfs_strfromUCS_le()
61 le16_to_cpu(from[i])); in jfs_strfromUCS_le()
68 to[i] = (char) (le16_to_cpu(from[i])); in jfs_strfromUCS_le()
70 outlen = i; in jfs_strfromUCS_le()
86 int i; in jfs_strtoUCS() local
[all …]
|
| /fs/reiserfs/ |
| D | hashes.c | 57 int i; in keyed_hash() local
92 for (i = 12; i < len; i++) { in keyed_hash()
94 d |= msg[i]; in keyed_hash()
103 for (i = 8; i < len; i++) { in keyed_hash()
105 c |= msg[i]; in keyed_hash()
112 for (i = 4; i < len; i++) { in keyed_hash()
114 b |= msg[i]; in keyed_hash()
118 for (i = 0; i < len; i++) { in keyed_hash()
120 a |= msg[i]; in keyed_hash()
137 int i; in yura_hash() local
[all …]
|
| D | objectid.c | 99 int i = 0; in reiserfs_release_objectid() local
113 while (i < sb_oid_cursize(rs)) { in reiserfs_release_objectid()
114 if (objectid_to_release == le32_to_cpu(map[i])) { in reiserfs_release_objectid()
117 le32_add_cpu(&map[i], 1); in reiserfs_release_objectid()
120 if (map[i] == map[i + 1]) { in reiserfs_release_objectid()
122 memmove(map + i, map + i + 2, in reiserfs_release_objectid()
123 (sb_oid_cursize(rs) - i - in reiserfs_release_objectid()
136 if (objectid_to_release > le32_to_cpu(map[i]) && in reiserfs_release_objectid()
137 objectid_to_release < le32_to_cpu(map[i + 1])) { in reiserfs_release_objectid()
139 if (objectid_to_release + 1 == le32_to_cpu(map[i + 1])) { in reiserfs_release_objectid()
[all …]
|
| /fs/jffs2/ |
| D | compr_rubin.c | 143 int i; in end_rubin() local
145 for (i = 0; i < RUBIN_REG_SIZE; i++) { in end_rubin()
234 int i, ret; in out_byte() local
238 for (i=0; i<8; i++) { in out_byte()
239 ret = encode(rs, rs->bit_divider-rs->bits[i], in out_byte()
240 rs->bits[i], byte & 1); in out_byte()
253 int i, result = 0, bit_divider = rs->bit_divider; in in_byte() local
255 for (i = 0; i < 8; i++) in in_byte()
256 result |= decode(rs, bit_divider - rs->bits[i], in in_byte()
257 rs->bits[i]) << i; in in_byte()
[all …]
|
| /fs/btrfs/ |
| D | print-tree.c | 26 int i; in print_chunk() local
33 for (i = 0 ; i < num_stripes ; i++) { in print_chunk()
34 printk(KERN_INFO "\t\t\tstripe %d devid %llu offset %llu\n", i, in print_chunk()
35 (unsigned long long)btrfs_stripe_devid_nr(eb, chunk, i), in print_chunk()
36 (unsigned long long)btrfs_stripe_offset_nr(eb, chunk, i)); in print_chunk()
50 int i; in btrfs_print_leaf() local
68 for (i = 0 ; i < nr ; i++) { in btrfs_print_leaf()
69 item = btrfs_item_nr(l, i); in btrfs_print_leaf()
70 btrfs_item_key_to_cpu(l, &key, i); in btrfs_print_leaf()
74 i, in btrfs_print_leaf()
[all …]
|
| /fs/nfsd/ |
| D | nfssvc.c | 185 int i; in nfsd_reset_versions() local
187 for (i = NFSD_MINVERS; i < NFSD_NRVERS; i++) { in nfsd_reset_versions()
188 if (nfsd_program.pg_vers[i]) in nfsd_reset_versions()
193 for (i = NFSD_MINVERS; i < NFSD_NRVERS; i++) in nfsd_reset_versions()
194 nfsd_program.pg_vers[i] = nfsd_version[i]; in nfsd_reset_versions()
196 for (i = NFSD_ACL_MINVERS; i < NFSD_ACL_NRVERS; i++) in nfsd_reset_versions()
197 nfsd_acl_program.pg_vers[i] = in nfsd_reset_versions()
198 nfsd_acl_version[i]; in nfsd_reset_versions()
215 struct sysinfo i; in nfsd_create_serv() local
216 si_meminfo(&i); in nfsd_create_serv()
[all …]
|
| D | nfs4acl.c | 358 int sorted = 0, i; in sort_pacl_range() local
365 for (i = start; i < end; i++) { in sort_pacl_range()
366 if (pacl->a_entries[i].e_id in sort_pacl_range()
367 > pacl->a_entries[i+1].e_id) { in sort_pacl_range()
369 tmp = pacl->a_entries[i]; in sort_pacl_range()
370 pacl->a_entries[i] = pacl->a_entries[i+1]; in sort_pacl_range()
371 pacl->a_entries[i+1] = tmp; in sort_pacl_range()
382 int i, j; in sort_pacl() local
386 i = 1; in sort_pacl()
387 while (pacl->a_entries[i].e_tag == ACL_USER) in sort_pacl()
[all …]
|
| /fs/ubifs/ |
| D | lpt_commit.c | 42 int i, cont = 0; in first_dirty_cnode() local
44 for (i = 0; i < UBIFS_LPT_FANOUT; i++) { in first_dirty_cnode()
47 cnode = nnode->nbranch[i].cnode; in first_dirty_cnode()
71 int i; in next_dirty_cnode() local
77 for (i = cnode->iip + 1; i < UBIFS_LPT_FANOUT; i++) { in next_dirty_cnode()
78 cnode = nnode->nbranch[i].cnode; in next_dirty_cnode()
158 int i, n; in alloc_lpt_leb() local
161 for (i = n; i < c->lpt_lebs; i++) { in alloc_lpt_leb()
162 if (c->ltab[i].tgc || c->ltab[i].cmt) in alloc_lpt_leb()
164 if (c->ltab[i].free == c->leb_size) { in alloc_lpt_leb()
[all …]
|
| D | lpt.c | 59 int i, n, bits, per_leb_wastage, max_pnode_cnt; in do_calc_lpt_geom() local
76 for (i = 1; i < c->lpt_hght; i++) { in do_calc_lpt_geom()
176 int i, lebs_needed; in calc_dflt_lpt_geom() local
202 for (i = 0; i < 64 ; i++) { in calc_dflt_lpt_geom()
353 int i, pos = 0; in ubifs_pack_pnode() local
359 for (i = 0; i < UBIFS_LPT_FANOUT; i++) { in ubifs_pack_pnode()
360 pack_bits(&addr, &pos, pnode->lprops[i].free >> 3, in ubifs_pack_pnode()
362 pack_bits(&addr, &pos, pnode->lprops[i].dirty >> 3, in ubifs_pack_pnode()
364 if (pnode->lprops[i].flags & LPROPS_INDEX) in ubifs_pack_pnode()
386 int i, pos = 0; in ubifs_pack_nnode() local
[all …]
|
| /fs/yaffs2/ |
| D | yaffs_checkptrw.c | 35 int i; in yaffs_CheckpointErase() local
42 for (i = dev->internalStartBlock; i <= dev->internalEndBlock; i++) { in yaffs_CheckpointErase()
43 yaffs_BlockInfo *bi = yaffs_GetBlockInfo(dev, i); in yaffs_CheckpointErase()
45 T(YAFFS_TRACE_CHECKPOINT, (TSTR("erasing checkpt block %d"TENDSTR), i)); in yaffs_CheckpointErase()
49 if (dev->eraseBlockInNAND(dev, i - dev->blockOffset /* realign */)) { in yaffs_CheckpointErase()
54 dev->markNANDBlockBad(dev, i); in yaffs_CheckpointErase()
68 int i; in yaffs_CheckpointFindNextErasedBlock() local
78 for (i = dev->checkpointNextBlock; i <= dev->internalEndBlock; i++) { in yaffs_CheckpointFindNextErasedBlock()
79 yaffs_BlockInfo *bi = yaffs_GetBlockInfo(dev, i); in yaffs_CheckpointFindNextErasedBlock()
81 dev->checkpointNextBlock = i + 1; in yaffs_CheckpointFindNextErasedBlock()
[all …]
|
| /fs/proc/ |
| D | stat.c | 24 int i, j; in show_stat() local
38 for_each_possible_cpu(i) { in show_stat()
39 user = cputime64_add(user, kstat_cpu(i).cpustat.user); in show_stat()
40 nice = cputime64_add(nice, kstat_cpu(i).cpustat.nice); in show_stat()
41 system = cputime64_add(system, kstat_cpu(i).cpustat.system); in show_stat()
42 idle = cputime64_add(idle, kstat_cpu(i).cpustat.idle); in show_stat()
43 iowait = cputime64_add(iowait, kstat_cpu(i).cpustat.iowait); in show_stat()
44 irq = cputime64_add(irq, kstat_cpu(i).cpustat.irq); in show_stat()
45 softirq = cputime64_add(softirq, kstat_cpu(i).cpustat.softirq); in show_stat()
46 steal = cputime64_add(steal, kstat_cpu(i).cpustat.steal); in show_stat()
[all …]
|
| /fs/ntfs/ |
| D | unistr.c | 152 size_t i; in ntfs_ucsncmp() local
154 for (i = 0; i < n; ++i) { in ntfs_ucsncmp()
155 c1 = le16_to_cpu(s1[i]); in ntfs_ucsncmp()
156 c2 = le16_to_cpu(s2[i]); in ntfs_ucsncmp()
188 size_t i; in ntfs_ucsncasecmp() local
191 for (i = 0; i < n; ++i) { in ntfs_ucsncasecmp()
192 if ((c1 = le16_to_cpu(s1[i])) < upcase_size) in ntfs_ucsncasecmp()
194 if ((c2 = le16_to_cpu(s2[i])) < upcase_size) in ntfs_ucsncasecmp()
209 u32 i; in ntfs_upcase_name() local
212 for (i = 0; i < name_len; i++) in ntfs_upcase_name()
[all …]
|
| /fs/xfs/support/ |
| D | uuid.c | 58 int i; in uuid_is_nil() local
64 for (i = 0; i < sizeof *uuid; i++) in uuid_is_nil()
93 int i, hole; in uuid_table_insert() local
96 for (i = 0, hole = -1; i < uuid_table_size; i++) { in uuid_table_insert()
97 if (uuid_is_nil(&uuid_table[i])) { in uuid_table_insert()
98 hole = i; in uuid_table_insert()
101 if (uuid_equal(uuid, &uuid_table[i])) { in uuid_table_insert()
121 int i; in uuid_table_remove() local
124 for (i = 0; i < uuid_table_size; i++) { in uuid_table_remove()
125 if (uuid_is_nil(&uuid_table[i])) in uuid_table_remove()
[all …]
|
| /fs/ncpfs/ |
| D | ncpsign_kernel.c | 54 int i; in nwsign() local
61 for (i=0;i<16;i++) in nwsign()
62 data2[i]=GET_LE32(r_data2+(i<<2)); in nwsign()
68 for (i=0;i<16;i+=4) { in nwsign()
69 w0=rol32(w0 + ((w1 & w2) | ((~w1) & w3)) + data2[i+0],3); in nwsign()
70 w3=rol32(w3 + ((w0 & w1) | ((~w0) & w2)) + data2[i+1],7); in nwsign()
71 w2=rol32(w2 + ((w3 & w0) | ((~w3) & w1)) + data2[i+2],11); in nwsign()
72 w1=rol32(w1 + ((w2 & w3) | ((~w2) & w0)) + data2[i+3],19); in nwsign()
74 for (i=0;i<4;i++) { in nwsign()
75 w0=rol32(w0 + (((w2 | w3) & w1) | (w2 & w3)) + 0x5a827999 + data2[i+0],3); in nwsign()
[all …]
|