Lines Matching refs:i
43 int i; in hpfs_chk_name() local
47 for (i = 0; i < *len; i++) if (not_allowed_char(name[i])) return -EINVAL; in hpfs_chk_name()
57 int i; in hpfs_translate_name() local
60 for (i = 0; i < len; i++) in hpfs_translate_name()
61 pr_cont("%c", from[i]); in hpfs_translate_name()
70 for (i = 0; i < len; i++) to[i] = locase(hpfs_sb(s)->sb_cp_table,from[i]); in hpfs_translate_name()
79 unsigned i; in hpfs_compare_names() local
81 for (i = 0; i < l; i++) { in hpfs_compare_names()
82 unsigned char c1 = upcase(hpfs_sb(s)->sb_cp_table,n1[i]); in hpfs_compare_names()
83 unsigned char c2 = upcase(hpfs_sb(s)->sb_cp_table,n2[i]); in hpfs_compare_names()
94 int i,j; in hpfs_is_name_long() local
95 for (i = 0; i < len && name[i] != '.'; i++) in hpfs_is_name_long()
96 if (no_dos_char(name[i])) return 1; in hpfs_is_name_long()
97 if (!i || i > 8) return 1; in hpfs_is_name_long()
98 if (i == len) return 0; in hpfs_is_name_long()
99 for (j = i + 1; j < len; j++) in hpfs_is_name_long()
100 if (name[j] == '.' || no_dos_char(name[i])) return 1; in hpfs_is_name_long()
101 return j - i > 4; in hpfs_is_name_long()