... so don't use __getname() there.  Switch it (and ntfs_d_hash(), while
we are at it) to kmalloc(PATH_MAX, GFP_NOWAIT).  Yes, ntfs_d_hash()
almost certainly can do with smaller allocations, but let ntfs folks
deal with that - keep the allocation size as-is for now.

Signed-off-by: Al Viro <[email protected]>
---
 fs/ntfs3/namei.c | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/fs/ntfs3/namei.c b/fs/ntfs3/namei.c
index 82c8ae56beee..ab96290ee6d9 100644
--- a/fs/ntfs3/namei.c
+++ b/fs/ntfs3/namei.c
@@ -407,7 +407,7 @@ static int ntfs_d_hash(const struct dentry *dentry, struct 
qstr *name)
        /*
         * Try slow way with current upcase table
         */
-       uni = kmem_cache_alloc(names_cachep, GFP_NOWAIT);
+       uni = kmalloc(PATH_MAX, GFP_NOWAIT);
        if (!uni)
                return -ENOMEM;
 
@@ -429,7 +429,7 @@ static int ntfs_d_hash(const struct dentry *dentry, struct 
qstr *name)
        err = 0;
 
 out:
-       kmem_cache_free(names_cachep, uni);
+       kfree(uni);
        return err;
 }
 
@@ -468,7 +468,7 @@ static int ntfs_d_compare(const struct dentry *dentry, 
unsigned int len1,
         * Try slow way with current upcase table
         */
        sbi = dentry->d_sb->s_fs_info;
-       uni1 = __getname();
+       uni1 = kmalloc(PATH_MAX, GFP_NOWAIT);
        if (!uni1)
                return -ENOMEM;
 
@@ -498,7 +498,7 @@ static int ntfs_d_compare(const struct dentry *dentry, 
unsigned int len1,
        ret = !ntfs_cmp_names_cpu(uni1, uni2, sbi->upcase, false) ? 0 : 1;
 
 out:
-       __putname(uni1);
+       kfree(uni1);
        return ret;
 }
 
-- 
2.47.3


Reply via email to