/*
* Allocate new dentry private data, free old one if necessary.
* On success, returns a dentry whose ->info node is locked already.
+ *
+ * Note: this function may get a dentry with an already existing *and*
+ * locked info node!
*/
int new_dentry_private_data(struct dentry *dentry)
{
int size;
struct unionfs_dentry_info *info = UNIONFS_D(dentry);
void *p;
+ int unlock_on_err = 0;
- BUG_ON(info);
+ if (!info) {
+ dentry->d_fsdata = kmem_cache_alloc(unionfs_dentry_cachep,
+ GFP_ATOMIC);
+ info = UNIONFS_D(dentry);
+ if (!info)
+ goto out;
- dentry->d_fsdata = kmem_cache_alloc(unionfs_dentry_cachep,
- GFP_ATOMIC);
- info = UNIONFS_D(dentry);
- if (!info)
- goto out;
+ mutex_init(&info->lock);
+ unionfs_lock_dentry(dentry);
+ unlock_on_err = 1;
+
+ info->lower_paths = NULL;
+ }
- mutex_init(&info->lock);
- info->lower_paths = NULL;
- unionfs_lock_dentry(dentry);
info->bstart = info->bend = info->bopaque = -1;
info->bcount = sbmax(dentry->d_sb);
return 0;
out_free:
- unionfs_unlock_dentry(dentry);
+ kfree(info->lower_paths);
+ if (unlock_on_err)
+ unionfs_unlock_dentry(dentry);
+
out:
free_dentry_private_data(info);
dentry->d_fsdata = NULL;