2 * linux/fs/hpfs/dentry.c
4 * Mikulas Patocka (mikulas@artax.karlin.mff.cuni.cz), 1998-1999
12 * Note: the dentry argument is the parent dentry.
15 static int hpfs_hash_dentry(const struct dentry
*dentry
, struct qstr
*qstr
)
19 unsigned l
= qstr
->len
;
21 if (l
== 1) if (qstr
->name
[0]=='.') goto x
;
22 if (l
== 2) if (qstr
->name
[0]=='.' || qstr
->name
[1]=='.') goto x
;
23 hpfs_adjust_length(qstr
->name
, &l
);
24 /*if (hpfs_chk_name(qstr->name,&l))*/
25 /*return -ENAMETOOLONG;*/
29 hash
= init_name_hash();
30 for (i
= 0; i
< l
; i
++)
31 hash
= partial_name_hash(hpfs_upcase(hpfs_sb(dentry
->d_sb
)->sb_cp_table
,qstr
->name
[i
]), hash
);
32 qstr
->hash
= end_name_hash(hash
);
37 static int hpfs_compare_dentry(const struct dentry
*parent
, const struct dentry
*dentry
,
38 unsigned int len
, const char *str
, const struct qstr
*name
)
41 unsigned bl
= name
->len
;
43 hpfs_adjust_length(str
, &al
);
44 /*hpfs_adjust_length(b->name, &bl);*/
47 * 'str' is the nane of an already existing dentry, so the name
48 * must be valid. 'name' must be validated first.
51 if (hpfs_chk_name(name
->name
, &bl
))
53 if (hpfs_compare_names(parent
->d_sb
, str
, al
, name
->name
, bl
, 0))
58 const struct dentry_operations hpfs_dentry_operations
= {
59 .d_hash
= hpfs_hash_dentry
,
60 .d_compare
= hpfs_compare_dentry
,