Home
last modified time | relevance | path

Searched refs:i (Results 1 – 25 of 636) sorted by relevance

12345678910>>...26

/fs/hpfs/
Dinode.c14 void hpfs_init_inode(struct inode *i) in hpfs_init_inode() argument
16 struct super_block *sb = i->i_sb; in hpfs_init_inode()
17 struct hpfs_inode_info *hpfs_inode = hpfs_i(i); in hpfs_init_inode()
19 i->i_uid = hpfs_sb(sb)->sb_uid; in hpfs_init_inode()
20 i->i_gid = hpfs_sb(sb)->sb_gid; in hpfs_init_inode()
21 i->i_mode = hpfs_sb(sb)->sb_mode; in hpfs_init_inode()
22 i->i_size = -1; in hpfs_init_inode()
23 i->i_blocks = -1; in hpfs_init_inode()
39 i->i_ctime.tv_sec = i->i_ctime.tv_nsec = 0; in hpfs_init_inode()
40 i->i_mtime.tv_sec = i->i_mtime.tv_nsec = 0; in hpfs_init_inode()
[all …]
Dname.c44 int i; in hpfs_chk_name() local
48 for (i = 0; i < *len; i++) if (not_allowed_char(name[i])) return -EINVAL; in hpfs_chk_name()
58 int i; in hpfs_translate_name() local
61 for (i = 0; i < len; i++) in hpfs_translate_name()
62 pr_cont("%c", from[i]); in hpfs_translate_name()
71 for (i = 0; i < len; i++) to[i] = locase(hpfs_sb(s)->sb_cp_table,from[i]); in hpfs_translate_name()
80 unsigned i; in hpfs_compare_names() local
82 for (i = 0; i < l; i++) { in hpfs_compare_names()
83 unsigned char c1 = upcase(hpfs_sb(s)->sb_cp_table,n1[i]); in hpfs_compare_names()
84 unsigned char c2 = upcase(hpfs_sb(s)->sb_cp_table,n2[i]); in hpfs_compare_names()
[all …]
Ddnode.c16 int i = 1; in get_pos() local
18 if (de == fde) return ((loff_t) le32_to_cpu(d->self) << 4) | (loff_t)i; in get_pos()
19 i++; in get_pos()
28 int i = 0; in hpfs_add_pos() local
32 for (; hpfs_inode->i_rddir_off[i]; i++) in hpfs_add_pos()
33 if (hpfs_inode->i_rddir_off[i] == pos) in hpfs_add_pos()
35 if (!(i&0x0f)) { in hpfs_add_pos()
36 ppos = kmalloc_array(i + 0x11, sizeof(loff_t *), GFP_NOFS); in hpfs_add_pos()
42 memcpy(ppos, hpfs_inode->i_rddir_off, i * sizeof(loff_t)); in hpfs_add_pos()
47 hpfs_inode->i_rddir_off[i] = pos; in hpfs_add_pos()
[all …]
/fs/ufs/
Dutil.c23 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/libxfs/
Dxfs_iext_tree.c180 int height, i; in xfs_iext_find_last_leaf() local
186 for (i = 1; i < KEYS_PER_NODE; i++) in xfs_iext_find_last_leaf()
187 if (!node->ptrs[i]) in xfs_iext_find_last_leaf()
189 node = node->ptrs[i - 1]; in xfs_iext_find_last_leaf()
210 int i; in xfs_iext_last() local
218 for (i = 1; i < xfs_iext_max_recs(ifp); i++) { in xfs_iext_last()
219 if (xfs_iext_rec_is_empty(&cur->leaf->recs[i])) in xfs_iext_last()
222 cur->pos = i - 1; in xfs_iext_last()
310 int height, i; in xfs_iext_find_level() local
316 for (i = 1; i < KEYS_PER_NODE; i++) in xfs_iext_find_level()
[all …]
/fs/jfs/
Djfs_unicode.c22 int i; in jfs_strfromUCS_le() local
28 for (i = 0; (i < len) && from[i]; i++) { in jfs_strfromUCS_le()
31 codepage->uni2char(le16_to_cpu(from[i]), in jfs_strfromUCS_le()
40 for (i = 0; (i < len) && from[i]; i++) { in jfs_strfromUCS_le()
41 if (unlikely(le16_to_cpu(from[i]) & 0xff00)) { in jfs_strfromUCS_le()
42 to[i] = '?'; in jfs_strfromUCS_le()
48 le16_to_cpu(from[i])); in jfs_strfromUCS_le()
55 to[i] = (char) (le16_to_cpu(from[i])); in jfs_strfromUCS_le()
57 outlen = i; in jfs_strfromUCS_le()
73 int i; in jfs_strtoUCS() local
[all …]
/fs/jffs2/
Dcompr_rubin.c141 int i; in end_rubin() local
143 for (i = 0; i < RUBIN_REG_SIZE; i++) { in end_rubin()
232 int i, ret; in out_byte() local
236 for (i=0; i<8; i++) { in out_byte()
237 ret = encode(rs, rs->bit_divider-rs->bits[i], in out_byte()
238 rs->bits[i], byte & 1); in out_byte()
251 int i, result = 0, bit_divider = rs->bit_divider; in in_byte() local
253 for (i = 0; i < 8; i++) in in_byte()
254 result |= decode(rs, bit_divider - rs->bits[i], in in_byte()
255 rs->bits[i]) << i; in in_byte()
[all …]
/fs/unicode/
Dutf8-selftest.c165 int i; in check_utf8_nfdi() local
176 for (i = 0; i < ARRAY_SIZE(nfdi_test_data); i++) { in check_utf8_nfdi()
177 int len = strlen(nfdi_test_data[i].str); in check_utf8_nfdi()
178 int nlen = strlen(nfdi_test_data[i].dec); in check_utf8_nfdi()
182 test((utf8len(data, nfdi_test_data[i].str) == nlen)); in check_utf8_nfdi()
183 test((utf8nlen(data, nfdi_test_data[i].str, len) == nlen)); in check_utf8_nfdi()
185 if (utf8cursor(&u8c, data, nfdi_test_data[i].str) < 0) in check_utf8_nfdi()
189 test_f((c == nfdi_test_data[i].dec[j]), in check_utf8_nfdi()
191 c, nfdi_test_data[i].dec[j]); in check_utf8_nfdi()
201 int i; in check_utf8_nfdicf() local
[all …]
/fs/dlm/
Dast.c22 int i; in dlm_dump_lkb_callbacks() local
40 for (i = 0; i < DLM_CALLBACKS_SIZE; i++) { in dlm_dump_lkb_callbacks()
43 (unsigned long long)lkb->lkb_callbacks[i].seq, in dlm_dump_lkb_callbacks()
44 lkb->lkb_callbacks[i].flags, in dlm_dump_lkb_callbacks()
45 lkb->lkb_callbacks[i].mode, in dlm_dump_lkb_callbacks()
46 lkb->lkb_callbacks[i].sb_status, in dlm_dump_lkb_callbacks()
47 lkb->lkb_callbacks[i].sb_flags); in dlm_dump_lkb_callbacks()
57 int i, rv; in dlm_add_lkb_callback() local
59 for (i = 0; i < DLM_CALLBACKS_SIZE; i++) { in dlm_add_lkb_callback()
60 if (lkb->lkb_callbacks[i].seq) in dlm_add_lkb_callback()
[all …]
/fs/reiserfs/
Dhashes.c51 int i; in keyed_hash() local
86 for (i = 12; i < len; i++) { in keyed_hash()
88 d |= msg[i]; in keyed_hash()
97 for (i = 8; i < len; i++) { in keyed_hash()
99 c |= msg[i]; in keyed_hash()
106 for (i = 4; i < len; i++) { in keyed_hash()
108 b |= msg[i]; in keyed_hash()
112 for (i = 0; i < len; i++) { in keyed_hash()
114 a |= msg[i]; in keyed_hash()
132 int i; in yura_hash() local
[all …]
Dobjectid.c103 int i = 0; in reiserfs_release_objectid() local
119 while (i < sb_oid_cursize(rs)) { in reiserfs_release_objectid()
120 if (objectid_to_release == le32_to_cpu(map[i])) { in reiserfs_release_objectid()
122 le32_add_cpu(&map[i], 1); in reiserfs_release_objectid()
128 if (map[i] == map[i + 1]) { in reiserfs_release_objectid()
130 memmove(map + i, map + i + 2, in reiserfs_release_objectid()
131 (sb_oid_cursize(rs) - i - in reiserfs_release_objectid()
143 if (objectid_to_release > le32_to_cpu(map[i]) && in reiserfs_release_objectid()
144 objectid_to_release < le32_to_cpu(map[i + 1])) { in reiserfs_release_objectid()
146 if (objectid_to_release + 1 == le32_to_cpu(map[i + 1])) { in reiserfs_release_objectid()
[all …]
Dresize.c35 int i; in reiserfs_resize() local
103 for (i = 0; i < JOURNAL_NUM_BITMAPS; i++) { in reiserfs_resize()
105 jb = SB_JOURNAL(s)->j_list_bitmap + i; in reiserfs_resize()
106 memcpy(jbitmap[i].bitmaps, jb->bitmaps, copy_size); in reiserfs_resize()
114 jb->bitmaps = jbitmap[i].bitmaps; in reiserfs_resize()
133 for (i = 0; i < bmap_nr; i++) in reiserfs_resize()
134 bitmap[i] = old_bitmap[i]; in reiserfs_resize()
142 for (i = bmap_nr; i < bmap_nr_new; i++) { in reiserfs_resize()
149 bh = sb_bread(s, i * s->s_blocksize * 8); in reiserfs_resize()
157 reiserfs_cache_bitmap_metadata(s, bh, bitmap + i); in reiserfs_resize()
[all …]
/fs/ocfs2/
Dblockcheck.c56 static unsigned int calc_code_bit(unsigned int i, unsigned int *p_cache) in calc_code_bit() argument
64 b = i + 1; in calc_code_bit()
101 unsigned int i, b, p = 0; in ocfs2_hamming_encode() local
114 for (i = 0; (i = ocfs2_find_next_bit(data, d, i)) < d; i++) in ocfs2_hamming_encode()
120 b = calc_code_bit(nr + i, &p); in ocfs2_hamming_encode()
161 unsigned int i, b; in ocfs2_hamming_fix() local
189 for (i = 0; i < d; i++, b++) in ocfs2_hamming_fix()
205 if (ocfs2_test_bit(i, data)) in ocfs2_hamming_fix()
206 ocfs2_clear_bit(i, data); in ocfs2_hamming_fix()
208 ocfs2_set_bit(i, data); in ocfs2_hamming_fix()
[all …]
Dslot_map.c68 int b, i, slotno; in ocfs2_update_slot_info_extended() local
74 for (i = 0; in ocfs2_update_slot_info_extended()
75 (i < si->si_slots_per_block) && in ocfs2_update_slot_info_extended()
77 i++, slotno++) { in ocfs2_update_slot_info_extended()
78 if (se->se_slots[i].es_valid) in ocfs2_update_slot_info_extended()
80 le32_to_cpu(se->se_slots[i].es_node_num)); in ocfs2_update_slot_info_extended()
93 int i; in ocfs2_update_slot_info_old() local
98 for (i = 0; i < si->si_num_slots; i++) { in ocfs2_update_slot_info_old()
99 if (le16_to_cpu(sm->sm_slots[i]) == (u16)OCFS2_INVALID_SLOT) in ocfs2_update_slot_info_old()
100 ocfs2_invalidate_slot(si, i); in ocfs2_update_slot_info_old()
[all …]
/fs/ubifs/
Dlpt_commit.c34 int i, cont = 0; in first_dirty_cnode() local
36 for (i = 0; i < UBIFS_LPT_FANOUT; i++) { in first_dirty_cnode()
39 cnode = nnode->nbranch[i].cnode; in first_dirty_cnode()
64 int i; in next_dirty_cnode() local
70 for (i = cnode->iip + 1; i < UBIFS_LPT_FANOUT; i++) { in next_dirty_cnode()
71 cnode = nnode->nbranch[i].cnode; in next_dirty_cnode()
151 int i, n; in alloc_lpt_leb() local
154 for (i = n; i < c->lpt_lebs; i++) { in alloc_lpt_leb()
155 if (c->ltab[i].tgc || c->ltab[i].cmt) in alloc_lpt_leb()
157 if (c->ltab[i].free == c->leb_size) { in alloc_lpt_leb()
[all …]
Dlpt.c48 int i, n, bits, per_leb_wastage, max_pnode_cnt; in do_calc_lpt_geom() local
65 for (i = 1; i < c->lpt_hght; i++) { in do_calc_lpt_geom()
165 int i, lebs_needed; in calc_dflt_lpt_geom() local
191 for (i = 0; i < 64 ; i++) { in calc_dflt_lpt_geom()
344 int i, pos = 0; in ubifs_pack_pnode() local
350 for (i = 0; i < UBIFS_LPT_FANOUT; i++) { in ubifs_pack_pnode()
351 pack_bits(c, &addr, &pos, pnode->lprops[i].free >> 3, in ubifs_pack_pnode()
353 pack_bits(c, &addr, &pos, pnode->lprops[i].dirty >> 3, in ubifs_pack_pnode()
355 if (pnode->lprops[i].flags & LPROPS_INDEX) in ubifs_pack_pnode()
377 int i, pos = 0; in ubifs_pack_nnode() local
[all …]
/fs/cifs/
Dcifs_unicode.c182 int i, charlen, safelen; in cifs_from_utf16() local
197 for (i = 0; i < fromwords; i++) { in cifs_from_utf16()
198 ftmp[0] = get_unaligned_le16(&from[i]); in cifs_from_utf16()
201 if (i + 1 < fromwords) in cifs_from_utf16()
202 ftmp[1] = get_unaligned_le16(&from[i + 1]); in cifs_from_utf16()
205 if (i + 2 < fromwords) in cifs_from_utf16()
206 ftmp[2] = get_unaligned_le16(&from[i + 2]); in cifs_from_utf16()
230 i++; in cifs_from_utf16()
233 i += 2; in cifs_from_utf16()
237 for (i = 0; i < nullsize; i++) in cifs_from_utf16()
[all …]
/fs/afs/
Dserver_list.c14 int i; in afs_put_serverlist() local
17 for (i = 0; i < slist->nr_servers; i++) { in afs_put_serverlist()
18 afs_put_cb_interest(net, slist->servers[i].cb_interest); in afs_put_serverlist()
19 afs_put_server(net, slist->servers[i].server, in afs_put_serverlist()
36 int ret = -ENOMEM, nr_servers = 0, i, j; in afs_alloc_server_list() local
38 for (i = 0; i < vldb->nr_servers; i++) in afs_alloc_server_list()
39 if (vldb->fs_mask[i] & type_mask) in afs_alloc_server_list()
50 for (i = 0; i < vldb->nr_servers; i++) { in afs_alloc_server_list()
51 if (!(vldb->fs_mask[i] & type_mask)) in afs_alloc_server_list()
54 server = afs_lookup_server(cell, key, &vldb->fs_server[i]); in afs_alloc_server_list()
[all …]
Dsecurity.c84 int i; in afs_permits_rcu() local
86 for (i = 0; i < permits->nr_permits; i++) in afs_permits_rcu()
87 key_put(permits->permits[i].key); in afs_permits_rcu()
127 int i; in afs_hash_permits() local
129 for (i = 0; i < permits->nr_permits; i++) { in afs_hash_permits()
130 h += (unsigned long)permits->permits[i].key / sizeof(void *); in afs_hash_permits()
131 h += permits->permits[i].access; in afs_hash_permits()
150 int i, j; in afs_cache_permit() local
163 for (i = 0; i < permits->nr_permits; i++) { in afs_cache_permit()
164 if (permits->permits[i].key < key) in afs_cache_permit()
[all …]
/fs/squashfs/
Dfile_direct.c36 int i, n, pages, missing_pages, bytes, res = -ENOMEM; in squashfs_readpage_block() local
59 for (missing_pages = 0, i = 0, n = start_index; i < pages; i++, n++) { in squashfs_readpage_block()
60 page[i] = (n == target_page->index) ? target_page : in squashfs_readpage_block()
63 if (page[i] == NULL) { in squashfs_readpage_block()
68 if (PageUptodate(page[i])) { in squashfs_readpage_block()
69 unlock_page(page[i]); in squashfs_readpage_block()
70 put_page(page[i]); in squashfs_readpage_block()
71 page[i] = NULL; in squashfs_readpage_block()
111 for (i = 0; i < pages; i++) { in squashfs_readpage_block()
112 flush_dcache_page(page[i]); in squashfs_readpage_block()
[all …]
/fs/nfsd/
Dnfs4acl.c376 int sorted = 0, i; in sort_pacl_range() local
382 for (i = start; i < end; i++) { in sort_pacl_range()
383 if (pace_gt(&pacl->a_entries[i], in sort_pacl_range()
384 &pacl->a_entries[i+1])) { in sort_pacl_range()
386 swap(pacl->a_entries[i], in sort_pacl_range()
387 pacl->a_entries[i + 1]); in sort_pacl_range()
398 int i, j; in sort_pacl() local
404 i = 1; in sort_pacl()
405 while (pacl->a_entries[i].e_tag == ACL_USER) in sort_pacl()
406 i++; in sort_pacl()
[all …]
Dnfssvc.c156 unsigned i; in nfsd_alloc_versions() local
160 for (i = 0; i < NFSD_NRVERS; i++) in nfsd_alloc_versions()
161 vers[i] = nfsd_support_version(i); in nfsd_alloc_versions()
171 unsigned i; in nfsd_alloc_minorversions() local
175 for (i = 0; i <= NFSD_SUPPORTED_MINOR_VERSION; i++) in nfsd_alloc_minorversions()
176 vers[i] = nfsd_support_version(4); in nfsd_alloc_minorversions()
228 unsigned i; in nfsd_adjust_nfsd_versions4() local
230 for (i = 0; i <= NFSD_SUPPORTED_MINOR_VERSION; i++) { in nfsd_adjust_nfsd_versions4()
231 if (nn->nfsd4_minorversions[i]) in nfsd_adjust_nfsd_versions4()
526 int i; in nfsd_reset_versions() local
[all …]
/fs/btrfs/
Dprint-tree.c13 int i; in print_chunk() local
17 for (i = 0 ; i < num_stripes ; i++) { in print_chunk()
18 pr_info("\t\t\tstripe %d devid %llu offset %llu\n", i, in print_chunk()
19 btrfs_stripe_devid_nr(eb, chunk, i), in print_chunk()
20 btrfs_stripe_offset_nr(eb, chunk, i)); in print_chunk()
169 int i; in btrfs_print_leaf() local
194 for (i = 0 ; i < nr ; i++) { in btrfs_print_leaf()
195 item = btrfs_item_nr(i); in btrfs_print_leaf()
196 btrfs_item_key_to_cpu(l, &key, i); in btrfs_print_leaf()
199 i, key.objectid, type, key.offset, in btrfs_print_leaf()
[all …]
Dcompression.c49 int i; in btrfs_compress_is_valid_type() local
51 for (i = 1; i < ARRAY_SIZE(btrfs_compress_types); i++) { in btrfs_compress_is_valid_type()
52 size_t comp_len = strlen(btrfs_compress_types[i]); in btrfs_compress_is_valid_type()
57 if (!strncmp(btrfs_compress_types[i], str, comp_len)) in btrfs_compress_is_valid_type()
83 unsigned long i; in check_compressed_csum() local
93 for (i = 0; i < cb->nr_pages; i++) { in check_compressed_csum()
94 page = cb->compressed_pages[i]; in check_compressed_csum()
218 int i; in end_compressed_writeback() local
233 for (i = 0; i < ret; i++) { in end_compressed_writeback()
235 SetPageError(pages[i]); in end_compressed_writeback()
[all …]
/fs/ntfs/
Dunistr.c138 size_t i; in ntfs_ucsncmp() local
140 for (i = 0; i < n; ++i) { in ntfs_ucsncmp()
141 c1 = le16_to_cpu(s1[i]); in ntfs_ucsncmp()
142 c2 = le16_to_cpu(s2[i]); in ntfs_ucsncmp()
174 size_t i; in ntfs_ucsncasecmp() local
177 for (i = 0; i < n; ++i) { in ntfs_ucsncasecmp()
178 if ((c1 = le16_to_cpu(s1[i])) < upcase_size) in ntfs_ucsncasecmp()
180 if ((c2 = le16_to_cpu(s2[i])) < upcase_size) in ntfs_ucsncasecmp()
195 u32 i; in ntfs_upcase_name() local
198 for (i = 0; i < name_len; i++) in ntfs_upcase_name()
[all …]

12345678910>>...26