4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.gnu.org/licenses/gpl-2.0.html
23 * Copyright (c) 2002, 2010, Oracle and/or its affiliates. All rights reserved.
24 * Use is subject to license terms.
26 * Copyright (c) 2011, 2017, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
30 * Lustre is a trademark of Sun Microsystems, Inc.
34 #include <linux/sched.h>
35 #include <linux/quotaops.h>
36 #include <linux/kernel.h>
38 #define DEBUG_SUBSYSTEM S_LLITE
40 #include <obd_support.h>
41 #include <lustre_dlm.h>
43 #include "llite_internal.h"
45 static void free_dentry_data(struct rcu_head *head)
47 struct ll_dentry_data *lld;
49 lld = container_of(head, struct ll_dentry_data, lld_rcu_head);
53 /* should NOT be called with the dcache lock, see fs/dcache.c */
54 static void ll_release(struct dentry *de)
56 struct ll_dentry_data *lld;
60 if (lld == NULL) /* NFS copies the de->d_op methods (bug 4655) */
64 ll_intent_release(lld->lld_it);
65 OBD_FREE(lld->lld_it, sizeof(*lld->lld_it));
69 call_rcu(&lld->lld_rcu_head, free_dentry_data);
74 /* Compare if two dentries are the same. Don't match if the existing dentry
75 * is marked invalid. Returns 1 if different, 0 if the same.
77 * This avoids a race where ll_lookup_it() instantiates a dentry, but we get
78 * an AST before calling d_revalidate_it(). The dentry still exists (marked
79 * INVALID) so d_lookup() matches it, but we have no lock on it (so
80 * lock_match() fails) and we spin around real_lookup(). */
81 #ifdef HAVE_D_COMPARE_7ARGS
82 static int ll_dcompare(const struct dentry *parent, const struct inode *pinode,
83 const struct dentry *dentry, const struct inode *inode,
84 unsigned int len, const char *str,
85 const struct qstr *name)
86 #elif defined(HAVE_D_COMPARE_5ARGS)
87 static int ll_dcompare(const struct dentry *parent, const struct dentry *dentry,
88 unsigned int len, const char *str,
89 const struct qstr *name)
90 #elif defined(HAVE_D_COMPARE_4ARGS)
91 static int ll_dcompare(const struct dentry *dentry, unsigned int len,
92 const char *str, const struct qstr *name)
94 static int ll_dcompare(struct dentry *parent, struct qstr *d_name,
98 #if !defined(HAVE_D_COMPARE_7ARGS) && !defined(HAVE_D_COMPARE_5ARGS) && !defined(HAVE_D_COMPARE_4ARGS)
99 /* XXX: (ugh !) d_name must be in-dentry structure */
100 struct dentry *dentry = container_of(d_name, struct dentry, d_name);
101 unsigned int len = d_name->len;
102 const char *str = d_name->name;
106 if (len != name->len)
109 if (memcmp(str, name->name, len))
112 CDEBUG(D_DENTRY, "found name %.*s(%p) flags %#x refc %d\n",
113 name->len, name->name, dentry, dentry->d_flags,
116 /* mountpoint is always valid */
117 if (d_mountpoint((struct dentry *)dentry))
120 if (d_lustre_invalid(dentry))
127 * Called when last reference to a dentry is dropped and dcache wants to know
128 * whether or not it should cache it:
129 * - return 1 to delete the dentry immediately
130 * - return 0 to cache the dentry
131 * Should NOT be called with the dcache lock, see fs/dcache.c
133 static int ll_ddelete(HAVE_D_DELETE_CONST struct dentry *de)
138 CDEBUG(D_DENTRY, "%s dentry %.*s (%p, parent %p, inode %p) %s%s\n",
139 d_lustre_invalid((struct dentry *)de) ? "deleting" : "keeping",
140 de->d_name.len, de->d_name.name, de, de->d_parent, de->d_inode,
141 d_unhashed((struct dentry *)de) ? "" : "hashed,",
142 list_empty(&de->d_subdirs) ? "" : "subdirs");
144 #ifdef HAVE_DCACHE_LOCK
145 LASSERT(ll_d_count(de) == 0);
147 /* kernel >= 2.6.38 last refcount is decreased after this function. */
148 LASSERT(ll_d_count(de) == 1);
151 if (d_lustre_invalid((struct dentry *)de))
156 int ll_d_init(struct dentry *de)
161 CDEBUG(D_DENTRY, "ldd on dentry %.*s (%p) parent %p inode %p refc %d\n",
162 de->d_name.len, de->d_name.name, de, de->d_parent, de->d_inode,
165 if (de->d_fsdata == NULL) {
166 struct ll_dentry_data *lld;
169 if (likely(lld != NULL)) {
170 spin_lock(&de->d_lock);
171 if (likely(de->d_fsdata == NULL)) {
172 #ifdef HAVE_DCACHE_LOCK
173 /* kernel >= 2.6.38 d_op is set in d_alloc() */
174 de->d_op = &ll_d_ops;
178 __d_lustre_invalidate(de);
182 spin_unlock(&de->d_lock);
187 LASSERT(de->d_op == &ll_d_ops);
192 void ll_intent_drop_lock(struct lookup_intent *it)
194 if (it->it_op && it->it_lock_mode) {
195 struct lustre_handle handle;
197 handle.cookie = it->it_lock_handle;
199 CDEBUG(D_DLMTRACE, "releasing lock with cookie %#llx from it %p\n",
201 ldlm_lock_decref(&handle, it->it_lock_mode);
203 /* bug 494: intent_release may be called multiple times, from
204 * this thread and we don't want to double-decref this lock */
205 it->it_lock_mode = 0;
206 if (it->it_remote_lock_mode != 0) {
207 handle.cookie = it->it_remote_lock_handle;
209 CDEBUG(D_DLMTRACE, "releasing remote lock with cookie"
210 "%#llx from it %p\n", handle.cookie, it);
211 ldlm_lock_decref(&handle,
212 it->it_remote_lock_mode);
213 it->it_remote_lock_mode = 0;
218 void ll_intent_release(struct lookup_intent *it)
222 CDEBUG(D_INFO, "intent %p released\n", it);
223 ll_intent_drop_lock(it);
224 /* We are still holding extra reference on a request, need to free it */
225 if (it_disposition(it, DISP_ENQ_OPEN_REF))
226 ptlrpc_req_finished(it->it_request); /* ll_file_open */
228 if (it_disposition(it, DISP_ENQ_CREATE_REF)) /* create rec */
229 ptlrpc_req_finished(it->it_request);
231 it->it_disposition = 0;
232 it->it_request = NULL;
236 void ll_invalidate_aliases(struct inode *inode)
238 struct dentry *dentry;
239 DECLARE_LL_D_HLIST_NODE_PTR(p);
242 LASSERT(inode != NULL);
244 CDEBUG(D_INODE, "marking dentries for inode "DFID"(%p) invalid\n",
245 PFID(ll_inode2fid(inode)), inode);
247 ll_lock_dcache(inode);
248 ll_d_hlist_for_each_entry(dentry, p, &inode->i_dentry) {
249 CDEBUG(D_DENTRY, "dentry in drop %.*s (%p) parent %p "
250 "inode %p flags %d\n", dentry->d_name.len,
251 dentry->d_name.name, dentry, dentry->d_parent,
252 dentry->d_inode, dentry->d_flags);
254 d_lustre_invalidate(dentry, 0);
256 ll_unlock_dcache(inode);
261 int ll_revalidate_it_finish(struct ptlrpc_request *request,
262 struct lookup_intent *it,
271 if (it_disposition(it, DISP_LOOKUP_NEG))
274 rc = ll_prep_inode(&de->d_inode, request, NULL, it);
279 void ll_lookup_finish_locks(struct lookup_intent *it, struct dentry *dentry)
282 LASSERT(dentry != NULL);
284 if (it->it_lock_mode && dentry->d_inode != NULL) {
285 struct inode *inode = dentry->d_inode;
286 struct ll_sb_info *sbi = ll_i2sbi(dentry->d_inode);
288 CDEBUG(D_DLMTRACE, "setting l_data to inode "DFID"(%p)\n",
289 PFID(ll_inode2fid(inode)), inode);
290 ll_set_lock_data(sbi->ll_md_exp, inode, it, NULL);
293 /* drop lookup or getattr locks immediately */
294 if (it->it_op == IT_LOOKUP || it->it_op == IT_GETATTR) {
295 /* on 2.6 there are situation when several lookups and
296 * revalidations may be requested during single operation.
297 * therefore, we don't release intent here -bzzz */
298 ll_intent_drop_lock(it);
302 static int ll_revalidate_dentry(struct dentry *dentry,
303 unsigned int lookup_flags)
305 struct inode *dir = dentry->d_parent->d_inode;
307 /* If this is intermediate component path lookup and we were able to get
308 * to this dentry, then its lock has not been revoked and the
309 * path component is valid. */
310 if (lookup_flags & (LOOKUP_CONTINUE | LOOKUP_PARENT))
313 /* Symlink - always valid as long as the dentry was found */
314 #ifdef HAVE_IOP_GET_LINK
315 if (dentry->d_inode && dentry->d_inode->i_op->get_link)
317 if (dentry->d_inode && dentry->d_inode->i_op->follow_link)
322 * VFS warns us that this is the second go around and previous
323 * operation failed (most likely open|creat), so this time
324 * we better talk to the server via the lookup path by name,
327 if (lookup_flags & LOOKUP_REVAL)
330 #ifndef HAVE_DCACHE_LOCK
331 if (lookup_flags & LOOKUP_RCU)
335 if (dentry_may_statahead(dir, dentry))
336 ll_statahead(dir, &dentry, dentry->d_inode == NULL);
342 * Always trust cached dentries. Update statahead window if necessary.
344 #ifdef HAVE_IOP_ATOMIC_OPEN
345 static int ll_revalidate_nd(struct dentry *dentry, unsigned int flags)
350 CDEBUG(D_VFSTRACE, "VFS Op:name=%s, flags=%u\n",
351 dentry->d_name.name, flags);
353 rc = ll_revalidate_dentry(dentry, flags);
357 static int ll_revalidate_nd(struct dentry *dentry, struct nameidata *nd)
363 * this is normally called from NFS export, and we don't know whether
364 * this is the last component.
369 CDEBUG(D_VFSTRACE, "VFS Op:name=%s, flags=%u\n",
370 dentry->d_name.name, nd->flags);
372 rc = ll_revalidate_dentry(dentry, nd->flags);
377 const struct dentry_operations ll_d_ops = {
378 .d_revalidate = ll_revalidate_nd,
379 .d_release = ll_release,
380 .d_delete = ll_ddelete,
381 .d_compare = ll_dcompare,