The Design and Implementation of the FreeBSD Operating System, Second Edition
Now available: The Design and Implementation of the FreeBSD Operating System (Second Edition)


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]

FreeBSD/Linux Kernel Cross Reference
sys/fs/nfs/unlink.c

Version: -  FREEBSD  -  FREEBSD-13-STABLE  -  FREEBSD-13-0  -  FREEBSD-12-STABLE  -  FREEBSD-12-0  -  FREEBSD-11-STABLE  -  FREEBSD-11-0  -  FREEBSD-10-STABLE  -  FREEBSD-10-0  -  FREEBSD-9-STABLE  -  FREEBSD-9-0  -  FREEBSD-8-STABLE  -  FREEBSD-8-0  -  FREEBSD-7-STABLE  -  FREEBSD-7-0  -  FREEBSD-6-STABLE  -  FREEBSD-6-0  -  FREEBSD-5-STABLE  -  FREEBSD-5-0  -  FREEBSD-4-STABLE  -  FREEBSD-3-STABLE  -  FREEBSD22  -  l41  -  OPENBSD  -  linux-2.6  -  MK84  -  PLAN9  -  xnu-8792 
SearchContext: -  none  -  3  -  10 

    1 /*
    2  *  linux/fs/nfs/unlink.c
    3  *
    4  * nfs sillydelete handling
    5  *
    6  * NOTE: we rely on holding the BKL for list manipulation protection.
    7  */
    8 
    9 #include <linux/slab.h>
   10 #include <linux/string.h>
   11 #include <linux/dcache.h>
   12 #include <linux/sunrpc/sched.h>
   13 #include <linux/sunrpc/clnt.h>
   14 #include <linux/nfs_fs.h>
   15 
   16 
   17 struct nfs_unlinkdata {
   18         struct nfs_unlinkdata   *next;
   19         struct dentry   *dir, *dentry;
   20         struct qstr     name;
   21         struct rpc_task task;
   22         struct rpc_cred *cred;
   23         unsigned int    count;
   24 };
   25 
   26 static struct nfs_unlinkdata    *nfs_deletes;
   27 static RPC_WAITQ(nfs_delete_queue, "nfs_delete_queue");
   28 
   29 /**
   30  * nfs_detach_unlinkdata - Remove asynchronous unlink from global list
   31  * @data: pointer to descriptor
   32  */
   33 static inline void
   34 nfs_detach_unlinkdata(struct nfs_unlinkdata *data)
   35 {
   36         struct nfs_unlinkdata   **q;
   37 
   38         for (q = &nfs_deletes; *q != NULL; q = &((*q)->next)) {
   39                 if (*q == data) {
   40                         *q = data->next;
   41                         break;
   42                 }
   43         }
   44 }
   45 
   46 /**
   47  * nfs_put_unlinkdata - release data from a sillydelete operation.
   48  * @data: pointer to unlink structure.
   49  */
   50 static void
   51 nfs_put_unlinkdata(struct nfs_unlinkdata *data)
   52 {
   53         if (--data->count == 0) {
   54                 nfs_detach_unlinkdata(data);
   55                 if (data->name.name != NULL)
   56                         kfree(data->name.name);
   57                 kfree(data);
   58         }
   59 }
   60 
   61 #define NAME_ALLOC_LEN(len)     ((len+16) & ~15)
   62 /**
   63  * nfs_copy_dname - copy dentry name to data structure
   64  * @dentry: pointer to dentry
   65  * @data: nfs_unlinkdata
   66  */
   67 static inline void
   68 nfs_copy_dname(struct dentry *dentry, struct nfs_unlinkdata *data)
   69 {
   70         char            *str;
   71         int             len = dentry->d_name.len;
   72 
   73         str = kmalloc(NAME_ALLOC_LEN(len), GFP_KERNEL);
   74         if (!str)
   75                 return;
   76         memcpy(str, dentry->d_name.name, len);
   77         if (!data->name.len) {
   78                 data->name.len = len;
   79                 data->name.name = str;
   80         } else
   81                 kfree(str);
   82 }
   83 
   84 /**
   85  * nfs_async_unlink_init - Initialize the RPC info
   86  * @task: rpc_task of the sillydelete
   87  *
   88  * We delay initializing RPC info until after the call to dentry_iput()
   89  * in order to minimize races against rename().
   90  */
   91 static void
   92 nfs_async_unlink_init(struct rpc_task *task)
   93 {
   94         struct nfs_unlinkdata   *data = (struct nfs_unlinkdata *)task->tk_calldata;
   95         struct dentry           *dir = data->dir;
   96         struct rpc_message      msg;
   97         int                     status = -ENOENT;
   98 
   99         if (!data->name.len)
  100                 goto out_err;
  101 
  102         memset(&msg, 0, sizeof(msg));
  103         msg.rpc_cred = data->cred;
  104         status = NFS_PROTO(dir->d_inode)->unlink_setup(&msg, dir, &data->name);
  105         if (status < 0)
  106                 goto out_err;
  107         rpc_call_setup(task, &msg, 0);
  108         return;
  109  out_err:
  110         rpc_exit(task, status);
  111 }
  112 
  113 /**
  114  * nfs_async_unlink_done - Sillydelete post-processing
  115  * @task: rpc_task of the sillydelete
  116  *
  117  * Do the directory attribute update.
  118  */
  119 static void
  120 nfs_async_unlink_done(struct rpc_task *task)
  121 {
  122         struct nfs_unlinkdata   *data = (struct nfs_unlinkdata *)task->tk_calldata;
  123         struct dentry           *dir = data->dir;
  124         struct inode            *dir_i;
  125 
  126         if (nfs_async_handle_jukebox(task))
  127                 return;
  128         if (!dir)
  129                 return;
  130         dir_i = dir->d_inode;
  131         nfs_zap_caches(dir_i);
  132         NFS_PROTO(dir_i)->unlink_done(dir, &task->tk_msg);
  133         put_rpccred(data->cred);
  134         data->cred = NULL;
  135         dput(dir);
  136 }
  137 
  138 /**
  139  * nfs_async_unlink_release - Release the sillydelete data.
  140  * @task: rpc_task of the sillydelete
  141  *
  142  * We need to call nfs_put_unlinkdata as a 'tk_release' task since the
  143  * rpc_task would be freed too.
  144  */
  145 static void
  146 nfs_async_unlink_release(struct rpc_task *task)
  147 {
  148         struct nfs_unlinkdata   *data = (struct nfs_unlinkdata *)task->tk_calldata;
  149         nfs_put_unlinkdata(data);
  150 }
  151 
  152 /**
  153  * nfs_async_unlink - asynchronous unlinking of a file
  154  * @dir: directory in which the file resides.
  155  * @name: name of the file to unlink.
  156  */
  157 int
  158 nfs_async_unlink(struct dentry *dentry)
  159 {
  160         struct dentry   *dir = dentry->d_parent;
  161         struct nfs_unlinkdata   *data;
  162         struct rpc_task *task;
  163         struct rpc_clnt *clnt = NFS_CLIENT(dir->d_inode);
  164         int             status = -ENOMEM;
  165 
  166         data = kmalloc(sizeof(*data), GFP_KERNEL);
  167         if (!data)
  168                 goto out;
  169         memset(data, 0, sizeof(*data));
  170 
  171         data->dir = dget(dir);
  172         data->dentry = dentry;
  173 
  174         data->next = nfs_deletes;
  175         nfs_deletes = data;
  176         data->count = 1;
  177 
  178         task = &data->task;
  179         rpc_init_task(task, clnt, nfs_async_unlink_done , RPC_TASK_ASYNC);
  180         task->tk_calldata = data;
  181         task->tk_action = nfs_async_unlink_init;
  182         task->tk_release = nfs_async_unlink_release;
  183 
  184         dentry->d_flags |= DCACHE_NFSFS_RENAMED;
  185         data->cred = rpcauth_lookupcred(clnt->cl_auth, 0);
  186 
  187         rpc_sleep_on(&nfs_delete_queue, task, NULL, NULL);
  188         status = 0;
  189  out:
  190         return status;
  191 }
  192 
  193 /**
  194  * nfs_complete_remove - Initialize completion of the sillydelete
  195  * @dentry: dentry to delete
  196  *
  197  * Since we're most likely to be called by dentry_iput(), we
  198  * only use the dentry to find the sillydelete. We then copy the name
  199  * into the qstr.
  200  */
  201 void
  202 nfs_complete_unlink(struct dentry *dentry)
  203 {
  204         struct nfs_unlinkdata   *data;
  205 
  206         for(data = nfs_deletes; data != NULL; data = data->next) {
  207                 if (dentry == data->dentry)
  208                         break;
  209         }
  210         if (!data)
  211                 return;
  212         data->count++;
  213         nfs_copy_dname(dentry, data);
  214         dentry->d_flags &= ~DCACHE_NFSFS_RENAMED;
  215         if (data->task.tk_rpcwait == &nfs_delete_queue)
  216                 rpc_wake_up_task(&data->task);
  217         nfs_put_unlinkdata(data);
  218 }

Cache object: dc0fafadcdc67f4eae9bf4c8013fae00


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]


This page is part of the FreeBSD/Linux Linux Kernel Cross-Reference, and was automatically generated using a modified version of the LXR engine.