diff options
author | Linus Torvalds <torvalds@linux-foundation.org> | 2011-01-07 11:56:33 -0500 |
---|---|---|
committer | Linus Torvalds <torvalds@linux-foundation.org> | 2011-01-07 11:56:33 -0500 |
commit | b4a45f5fe8078bfc10837dbd5b98735058bc4698 (patch) | |
tree | df6f13a27610a3ec7eb4a661448cd779a8f84c79 /fs/hfsplus/unicode.c | |
parent | 01539ba2a706ab7d35fc0667dff919ade7f87d63 (diff) | |
parent | b3e19d924b6eaf2ca7d22cba99a517c5171007b6 (diff) |
Merge branch 'vfs-scale-working' of git://git.kernel.org/pub/scm/linux/kernel/git/npiggin/linux-npiggin
* 'vfs-scale-working' of git://git.kernel.org/pub/scm/linux/kernel/git/npiggin/linux-npiggin: (57 commits)
fs: scale mntget/mntput
fs: rename vfsmount counter helpers
fs: implement faster dentry memcmp
fs: prefetch inode data in dcache lookup
fs: improve scalability of pseudo filesystems
fs: dcache per-inode inode alias locking
fs: dcache per-bucket dcache hash locking
bit_spinlock: add required includes
kernel: add bl_list
xfs: provide simple rcu-walk ACL implementation
btrfs: provide simple rcu-walk ACL implementation
ext2,3,4: provide simple rcu-walk ACL implementation
fs: provide simple rcu-walk generic_check_acl implementation
fs: provide rcu-walk aware permission i_ops
fs: rcu-walk aware d_revalidate method
fs: cache optimise dentry and inode for rcu-walk
fs: dcache reduce branches in lookup path
fs: dcache remove d_mounted
fs: fs_struct use seqlock
fs: rcu-walk for path lookup
...
Diffstat (limited to 'fs/hfsplus/unicode.c')
-rw-r--r-- | fs/hfsplus/unicode.c | 18 |
1 files changed, 11 insertions, 7 deletions
diff --git a/fs/hfsplus/unicode.c b/fs/hfsplus/unicode.c index b66d67de882c..d800aa0f2c80 100644 --- a/fs/hfsplus/unicode.c +++ b/fs/hfsplus/unicode.c | |||
@@ -320,7 +320,8 @@ int hfsplus_asc2uni(struct super_block *sb, struct hfsplus_unistr *ustr, | |||
320 | * Composed unicode characters are decomposed and case-folding is performed | 320 | * Composed unicode characters are decomposed and case-folding is performed |
321 | * if the appropriate bits are (un)set on the superblock. | 321 | * if the appropriate bits are (un)set on the superblock. |
322 | */ | 322 | */ |
323 | int hfsplus_hash_dentry(struct dentry *dentry, struct qstr *str) | 323 | int hfsplus_hash_dentry(const struct dentry *dentry, const struct inode *inode, |
324 | struct qstr *str) | ||
324 | { | 325 | { |
325 | struct super_block *sb = dentry->d_sb; | 326 | struct super_block *sb = dentry->d_sb; |
326 | const char *astr; | 327 | const char *astr; |
@@ -363,9 +364,12 @@ int hfsplus_hash_dentry(struct dentry *dentry, struct qstr *str) | |||
363 | * Composed unicode characters are decomposed and case-folding is performed | 364 | * Composed unicode characters are decomposed and case-folding is performed |
364 | * if the appropriate bits are (un)set on the superblock. | 365 | * if the appropriate bits are (un)set on the superblock. |
365 | */ | 366 | */ |
366 | int hfsplus_compare_dentry(struct dentry *dentry, struct qstr *s1, struct qstr *s2) | 367 | int hfsplus_compare_dentry(const struct dentry *parent, |
368 | const struct inode *pinode, | ||
369 | const struct dentry *dentry, const struct inode *inode, | ||
370 | unsigned int len, const char *str, const struct qstr *name) | ||
367 | { | 371 | { |
368 | struct super_block *sb = dentry->d_sb; | 372 | struct super_block *sb = parent->d_sb; |
369 | int casefold, decompose, size; | 373 | int casefold, decompose, size; |
370 | int dsize1, dsize2, len1, len2; | 374 | int dsize1, dsize2, len1, len2; |
371 | const u16 *dstr1, *dstr2; | 375 | const u16 *dstr1, *dstr2; |
@@ -375,10 +379,10 @@ int hfsplus_compare_dentry(struct dentry *dentry, struct qstr *s1, struct qstr * | |||
375 | 379 | ||
376 | casefold = test_bit(HFSPLUS_SB_CASEFOLD, &HFSPLUS_SB(sb)->flags); | 380 | casefold = test_bit(HFSPLUS_SB_CASEFOLD, &HFSPLUS_SB(sb)->flags); |
377 | decompose = !test_bit(HFSPLUS_SB_NODECOMPOSE, &HFSPLUS_SB(sb)->flags); | 381 | decompose = !test_bit(HFSPLUS_SB_NODECOMPOSE, &HFSPLUS_SB(sb)->flags); |
378 | astr1 = s1->name; | 382 | astr1 = str; |
379 | len1 = s1->len; | 383 | len1 = len; |
380 | astr2 = s2->name; | 384 | astr2 = name->name; |
381 | len2 = s2->len; | 385 | len2 = name->len; |
382 | dsize1 = dsize2 = 0; | 386 | dsize1 = dsize2 = 0; |
383 | dstr1 = dstr2 = NULL; | 387 | dstr1 = dstr2 = NULL; |
384 | 388 | ||