2 * Copyright 2000, International Business Machines Corporation and others.
5 * This software has been released under the terms of the IBM Public
6 * License. For details, see the LICENSE file in the top-level source
7 * directory or online at http://www.openafs.org/dl/license10.html
11 * Linux specific vnodeops. Also includes the glue routines required to call
14 * So far the only truly scary part is that Linux relies on the inode cache
15 * to be up to date. Don't you dare break a callback and expect an fstat
16 * to give you meaningful information. This appears to be fixed in the 2.1
17 * development kernels. As it is we can fix this now by intercepting the
21 #include <afsconfig.h>
22 #include "afs/param.h"
25 #include "afs/sysincludes.h"
26 #include "afsincludes.h"
27 #include "afs/afs_stats.h"
29 #ifdef HAVE_MM_INLINE_H
30 #include <linux/mm_inline.h>
32 #include <linux/pagemap.h>
33 #include <linux/writeback.h>
34 #include <linux/pagevec.h>
35 #include <linux/aio.h>
37 #include "afs/afs_bypasscache.h"
39 #include "osi_compat.h"
40 #include "osi_pagecopy.h"
42 #ifndef HAVE_LINUX_PAGEVEC_LRU_ADD_FILE
43 #define __pagevec_lru_add_file __pagevec_lru_add
47 #define MAX_ERRNO 1000L
50 int cachefs_noreadpage = 0;
52 extern struct backing_dev_info *afs_backing_dev_info;
54 extern struct vcache *afs_globalVp;
56 /* This function converts a positive error code from AFS into a negative
57 * code suitable for passing into the Linux VFS layer. It checks that the
58 * error code is within the permissable bounds for the ERR_PTR mechanism.
60 * _All_ error codes which come from the AFS layer should be passed through
61 * this function before being returned to the kernel.
65 afs_convert_code(int code) {
66 if ((code >= 0) && (code <= MAX_ERRNO))
72 /* Linux doesn't require a credp for many functions, and crref is an expensive
73 * operation. This helper function avoids obtaining it for VerifyVCache calls
77 afs_linux_VerifyVCache(struct vcache *avc, cred_t **retcred) {
79 struct vrequest *treq = NULL;
82 if (avc->f.states & CStatd) {
90 code = afs_CreateReq(&treq, credp);
92 code = afs_VerifyVCache2(avc, treq);
101 return afs_convert_code(code);
104 #if defined(STRUCT_FILE_OPERATIONS_HAS_READ_ITER) || defined(HAVE_LINUX_GENERIC_FILE_AIO_READ)
105 # if defined(STRUCT_FILE_OPERATIONS_HAS_READ_ITER)
107 afs_linux_read_iter(struct kiocb *iocb, struct iov_iter *iter)
108 # elif defined(LINUX_HAS_NONVECTOR_AIO)
110 afs_linux_aio_read(struct kiocb *iocb, char __user *buf, size_t bufsize,
114 afs_linux_aio_read(struct kiocb *iocb, const struct iovec *buf,
115 unsigned long bufsize, loff_t pos)
118 struct file *fp = iocb->ki_filp;
120 struct vcache *vcp = VTOAFS(fp->f_dentry->d_inode);
121 # if defined(STRUCT_FILE_OPERATIONS_HAS_READ_ITER)
122 loff_t pos = iocb->ki_pos;
123 unsigned long bufsize = iter->nr_segs;
128 afs_Trace4(afs_iclSetp, CM_TRACE_AIOREADOP, ICL_TYPE_POINTER, vcp,
129 ICL_TYPE_OFFSET, ICL_HANDLE_OFFSET(pos), ICL_TYPE_INT32,
130 (afs_int32)bufsize, ICL_TYPE_INT32, 99999);
131 code = afs_linux_VerifyVCache(vcp, NULL);
134 /* Linux's FlushPages implementation doesn't ever use credp,
135 * so we optimise by not using it */
136 osi_FlushPages(vcp, NULL); /* ensure stale pages are gone */
138 # if defined(STRUCT_FILE_OPERATIONS_HAS_READ_ITER)
139 code = generic_file_read_iter(iocb, iter);
141 code = generic_file_aio_read(iocb, buf, bufsize, pos);
146 afs_Trace4(afs_iclSetp, CM_TRACE_AIOREADOP, ICL_TYPE_POINTER, vcp,
147 ICL_TYPE_OFFSET, ICL_HANDLE_OFFSET(pos), ICL_TYPE_INT32,
148 (afs_int32)bufsize, ICL_TYPE_INT32, code);
154 afs_linux_read(struct file *fp, char *buf, size_t count, loff_t * offp)
157 struct vcache *vcp = VTOAFS(fp->f_dentry->d_inode);
160 afs_Trace4(afs_iclSetp, CM_TRACE_READOP, ICL_TYPE_POINTER, vcp,
161 ICL_TYPE_OFFSET, offp, ICL_TYPE_INT32, count, ICL_TYPE_INT32,
163 code = afs_linux_VerifyVCache(vcp, NULL);
166 /* Linux's FlushPages implementation doesn't ever use credp,
167 * so we optimise by not using it */
168 osi_FlushPages(vcp, NULL); /* ensure stale pages are gone */
170 code = do_sync_read(fp, buf, count, offp);
174 afs_Trace4(afs_iclSetp, CM_TRACE_READOP, ICL_TYPE_POINTER, vcp,
175 ICL_TYPE_OFFSET, offp, ICL_TYPE_INT32, count, ICL_TYPE_INT32,
183 /* Now we have integrated VM for writes as well as reads. the generic write operations
184 * also take care of re-positioning the pointer if file is open in append
185 * mode. Call fake open/close to ensure we do writes of core dumps.
187 #if defined(STRUCT_FILE_OPERATIONS_HAS_READ_ITER) || defined(HAVE_LINUX_GENERIC_FILE_AIO_READ)
188 # if defined(STRUCT_FILE_OPERATIONS_HAS_READ_ITER)
190 afs_linux_write_iter(struct kiocb *iocb, struct iov_iter *iter)
191 # elif defined(LINUX_HAS_NONVECTOR_AIO)
193 afs_linux_aio_write(struct kiocb *iocb, const char __user *buf, size_t bufsize,
197 afs_linux_aio_write(struct kiocb *iocb, const struct iovec *buf,
198 unsigned long bufsize, loff_t pos)
202 struct vcache *vcp = VTOAFS(iocb->ki_filp->f_dentry->d_inode);
204 # if defined(STRUCT_FILE_OPERATIONS_HAS_READ_ITER)
205 loff_t pos = iocb->ki_pos;
206 unsigned long bufsize = iter->nr_segs;
211 afs_Trace4(afs_iclSetp, CM_TRACE_AIOWRITEOP, ICL_TYPE_POINTER, vcp,
212 ICL_TYPE_OFFSET, ICL_HANDLE_OFFSET(pos), ICL_TYPE_INT32,
213 (afs_int32)bufsize, ICL_TYPE_INT32,
214 (iocb->ki_filp->f_flags & O_APPEND) ? 99998 : 99999);
216 code = afs_linux_VerifyVCache(vcp, &credp);
218 ObtainWriteLock(&vcp->lock, 529);
220 ReleaseWriteLock(&vcp->lock);
223 # if defined(STRUCT_FILE_OPERATIONS_HAS_READ_ITER)
224 code = generic_file_write_iter(iocb, iter);
226 code = generic_file_aio_write(iocb, buf, bufsize, pos);
231 ObtainWriteLock(&vcp->lock, 530);
233 if (vcp->execsOrWriters == 1 && !credp)
236 afs_FakeClose(vcp, credp);
237 ReleaseWriteLock(&vcp->lock);
239 afs_Trace4(afs_iclSetp, CM_TRACE_AIOWRITEOP, ICL_TYPE_POINTER, vcp,
240 ICL_TYPE_OFFSET, ICL_HANDLE_OFFSET(pos), ICL_TYPE_INT32,
241 (afs_int32)bufsize, ICL_TYPE_INT32, code);
250 afs_linux_write(struct file *fp, const char *buf, size_t count, loff_t * offp)
253 struct vcache *vcp = VTOAFS(fp->f_dentry->d_inode);
258 afs_Trace4(afs_iclSetp, CM_TRACE_WRITEOP, ICL_TYPE_POINTER, vcp,
259 ICL_TYPE_OFFSET, offp, ICL_TYPE_INT32, count, ICL_TYPE_INT32,
260 (fp->f_flags & O_APPEND) ? 99998 : 99999);
262 code = afs_linux_VerifyVCache(vcp, &credp);
264 ObtainWriteLock(&vcp->lock, 529);
266 ReleaseWriteLock(&vcp->lock);
269 code = do_sync_write(fp, buf, count, offp);
273 ObtainWriteLock(&vcp->lock, 530);
275 if (vcp->execsOrWriters == 1 && !credp)
278 afs_FakeClose(vcp, credp);
279 ReleaseWriteLock(&vcp->lock);
281 afs_Trace4(afs_iclSetp, CM_TRACE_WRITEOP, ICL_TYPE_POINTER, vcp,
282 ICL_TYPE_OFFSET, offp, ICL_TYPE_INT32, count, ICL_TYPE_INT32,
292 extern int BlobScan(struct dcache * afile, afs_int32 ablob);
294 /* This is a complete rewrite of afs_readdir, since we can make use of
295 * filldir instead of afs_readdir_move. Note that changes to vcache/dcache
296 * handling and use of bulkstats will need to be reflected here as well.
299 #if defined(STRUCT_FILE_OPERATIONS_HAS_ITERATE)
300 afs_linux_readdir(struct file *fp, struct dir_context *ctx)
302 afs_linux_readdir(struct file *fp, void *dirbuf, filldir_t filldir)
305 struct vcache *avc = VTOAFS(FILE_INODE(fp));
306 struct vrequest *treq = NULL;
312 struct DirBuffer entry;
315 afs_size_t origOffset, tlen;
316 cred_t *credp = crref();
317 struct afs_fakestat_state fakestat;
320 AFS_STATCNT(afs_readdir);
322 code = afs_convert_code(afs_CreateReq(&treq, credp));
327 afs_InitFakeStat(&fakestat);
328 code = afs_convert_code(afs_EvalFakeStat(&avc, &fakestat, treq));
332 /* update the cache entry */
334 code = afs_convert_code(afs_VerifyVCache2(avc, treq));
338 /* get a reference to the entire directory */
339 tdc = afs_GetDCache(avc, (afs_size_t) 0, treq, &origOffset, &tlen, 1);
345 ObtainWriteLock(&avc->lock, 811);
346 ObtainReadLock(&tdc->lock);
348 * Make sure that the data in the cache is current. There are two
349 * cases we need to worry about:
350 * 1. The cache data is being fetched by another process.
351 * 2. The cache data is no longer valid
353 while ((avc->f.states & CStatd)
354 && (tdc->dflags & DFFetching)
355 && hsame(avc->f.m.DataVersion, tdc->f.versionNo)) {
356 ReleaseReadLock(&tdc->lock);
357 ReleaseWriteLock(&avc->lock);
358 afs_osi_Sleep(&tdc->validPos);
359 ObtainWriteLock(&avc->lock, 812);
360 ObtainReadLock(&tdc->lock);
362 if (!(avc->f.states & CStatd)
363 || !hsame(avc->f.m.DataVersion, tdc->f.versionNo)) {
364 ReleaseReadLock(&tdc->lock);
365 ReleaseWriteLock(&avc->lock);
370 /* Set the readdir-in-progress flag, and downgrade the lock
371 * to shared so others will be able to acquire a read lock.
373 avc->f.states |= CReadDir;
374 avc->dcreaddir = tdc;
375 avc->readdir_pid = MyPidxx2Pid(MyPidxx);
376 ConvertWToSLock(&avc->lock);
378 /* Fill in until we get an error or we're done. This implementation
379 * takes an offset in units of blobs, rather than bytes.
382 #if defined(STRUCT_FILE_OPERATIONS_HAS_ITERATE)
385 offset = (int) fp->f_pos;
388 dirpos = BlobScan(tdc, offset);
392 code = afs_dir_GetVerifiedBlob(tdc, dirpos, &entry);
394 if (!(avc->f.states & CCorrupt)) {
395 struct cell *tc = afs_GetCellStale(avc->f.fid.Cell, READ_LOCK);
396 afs_warn("Corrupt directory (%d.%d.%d.%d [%s] @%lx, pos %d)",
397 avc->f.fid.Cell, avc->f.fid.Fid.Volume,
398 avc->f.fid.Fid.Vnode, avc->f.fid.Fid.Unique,
399 tc ? tc->cellName : "",
400 (unsigned long)&tdc->f.inode, dirpos);
402 afs_PutCell(tc, READ_LOCK);
403 UpgradeSToWLock(&avc->lock, 814);
404 avc->f.states |= CCorrupt;
410 de = (struct DirEntry *)entry.data;
411 ino = afs_calc_inum (avc->f.fid.Cell, avc->f.fid.Fid.Volume,
412 ntohl(de->fid.vnode));
413 len = strlen(de->name);
415 /* filldir returns -EINVAL when the buffer is full. */
417 unsigned int type = DT_UNKNOWN;
418 struct VenusFid afid;
421 afid.Cell = avc->f.fid.Cell;
422 afid.Fid.Volume = avc->f.fid.Fid.Volume;
423 afid.Fid.Vnode = ntohl(de->fid.vnode);
424 afid.Fid.Unique = ntohl(de->fid.vunique);
425 if ((avc->f.states & CForeign) == 0 && (ntohl(de->fid.vnode) & 1)) {
427 } else if ((tvc = afs_FindVCache(&afid, 0, 0))) {
430 } else if (((tvc->f.states) & (CStatd | CTruth))) {
431 /* CTruth will be set if the object has
436 else if (vtype == VREG)
438 /* Don't do this until we're sure it can't be a mtpt */
439 /* else if (vtype == VLNK)
441 /* what other types does AFS support? */
443 /* clean up from afs_FindVCache */
447 * If this is NFS readdirplus, then the filler is going to
448 * call getattr on this inode, which will deadlock if we're
452 #if defined(STRUCT_FILE_OPERATIONS_HAS_ITERATE)
453 /* dir_emit returns a bool - true when it succeeds.
454 * Inverse the result to fit with how we check "code" */
455 code = !dir_emit(ctx, de->name, len, ino, type);
457 code = (*filldir) (dirbuf, de->name, len, offset, ino, type);
464 offset = dirpos + 1 + ((len + 16) >> 5);
466 /* If filldir didn't fill in the last one this is still pointing to that
472 #if defined(STRUCT_FILE_OPERATIONS_HAS_ITERATE)
473 ctx->pos = (loff_t) offset;
475 fp->f_pos = (loff_t) offset;
477 ReleaseReadLock(&tdc->lock);
479 UpgradeSToWLock(&avc->lock, 813);
480 avc->f.states &= ~CReadDir;
482 avc->readdir_pid = 0;
483 ReleaseSharedLock(&avc->lock);
486 afs_PutFakeStat(&fakestat);
487 afs_DestroyReq(treq);
494 /* in afs_pioctl.c */
495 extern int afs_xioctl(struct inode *ip, struct file *fp, unsigned int com,
498 #if defined(HAVE_UNLOCKED_IOCTL) || defined(HAVE_COMPAT_IOCTL)
499 static long afs_unlocked_xioctl(struct file *fp, unsigned int com,
501 return afs_xioctl(FILE_INODE(fp), fp, com, arg);
508 afs_linux_mmap(struct file *fp, struct vm_area_struct *vmap)
510 struct vcache *vcp = VTOAFS(FILE_INODE(fp));
514 afs_Trace3(afs_iclSetp, CM_TRACE_GMAP, ICL_TYPE_POINTER, vcp,
515 ICL_TYPE_POINTER, vmap->vm_start, ICL_TYPE_INT32,
516 vmap->vm_end - vmap->vm_start);
518 /* get a validated vcache entry */
519 code = afs_linux_VerifyVCache(vcp, NULL);
522 /* Linux's Flushpage implementation doesn't use credp, so optimise
523 * our code to not need to crref() it */
524 osi_FlushPages(vcp, NULL); /* ensure stale pages are gone */
526 code = generic_file_mmap(fp, vmap);
529 vcp->f.states |= CMAPPED;
537 afs_linux_open(struct inode *ip, struct file *fp)
539 struct vcache *vcp = VTOAFS(ip);
540 cred_t *credp = crref();
544 code = afs_open(&vcp, fp->f_flags, credp);
548 return afs_convert_code(code);
552 afs_linux_release(struct inode *ip, struct file *fp)
554 struct vcache *vcp = VTOAFS(ip);
555 cred_t *credp = crref();
559 code = afs_close(vcp, fp->f_flags, credp);
560 ObtainWriteLock(&vcp->lock, 807);
565 ReleaseWriteLock(&vcp->lock);
569 return afs_convert_code(code);
573 #if defined(FOP_FSYNC_TAKES_DENTRY)
574 afs_linux_fsync(struct file *fp, struct dentry *dp, int datasync)
575 #elif defined(FOP_FSYNC_TAKES_RANGE)
576 afs_linux_fsync(struct file *fp, loff_t start, loff_t end, int datasync)
578 afs_linux_fsync(struct file *fp, int datasync)
582 struct inode *ip = FILE_INODE(fp);
583 cred_t *credp = crref();
585 #if defined(FOP_FSYNC_TAKES_RANGE)
586 mutex_lock(&ip->i_mutex);
589 code = afs_fsync(VTOAFS(ip), credp);
591 #if defined(FOP_FSYNC_TAKES_RANGE)
592 mutex_unlock(&ip->i_mutex);
595 return afs_convert_code(code);
601 afs_linux_lock(struct file *fp, int cmd, struct file_lock *flp)
604 struct vcache *vcp = VTOAFS(FILE_INODE(fp));
605 cred_t *credp = crref();
606 struct AFS_FLOCK flock;
608 /* Convert to a lock format afs_lockctl understands. */
609 memset(&flock, 0, sizeof(flock));
610 flock.l_type = flp->fl_type;
611 flock.l_pid = flp->fl_pid;
613 flock.l_start = flp->fl_start;
614 if (flp->fl_end == OFFSET_MAX)
615 flock.l_len = 0; /* Lock to end of file */
617 flock.l_len = flp->fl_end - flp->fl_start + 1;
619 /* Safe because there are no large files, yet */
620 #if defined(F_GETLK64) && (F_GETLK != F_GETLK64)
621 if (cmd == F_GETLK64)
623 else if (cmd == F_SETLK64)
625 else if (cmd == F_SETLKW64)
627 #endif /* F_GETLK64 && F_GETLK != F_GETLK64 */
630 code = afs_convert_code(afs_lockctl(vcp, &flock, cmd, credp));
633 if ((code == 0 || flp->fl_type == F_UNLCK) &&
634 (cmd == F_SETLK || cmd == F_SETLKW)) {
635 code = afs_posix_lock_file(fp, flp);
636 if (code && flp->fl_type != F_UNLCK) {
637 struct AFS_FLOCK flock2;
639 flock2.l_type = F_UNLCK;
641 afs_lockctl(vcp, &flock2, F_SETLK, credp);
645 /* If lockctl says there are no conflicting locks, then also check with the
646 * kernel, as lockctl knows nothing about byte range locks
648 if (code == 0 && cmd == F_GETLK && flock.l_type == F_UNLCK) {
649 afs_posix_test_lock(fp, flp);
650 /* If we found a lock in the kernel's structure, return it */
651 if (flp->fl_type != F_UNLCK) {
657 /* Convert flock back to Linux's file_lock */
658 flp->fl_type = flock.l_type;
659 flp->fl_pid = flock.l_pid;
660 flp->fl_start = flock.l_start;
661 if (flock.l_len == 0)
662 flp->fl_end = OFFSET_MAX; /* Lock to end of file */
664 flp->fl_end = flock.l_start + flock.l_len - 1;
670 #ifdef STRUCT_FILE_OPERATIONS_HAS_FLOCK
672 afs_linux_flock(struct file *fp, int cmd, struct file_lock *flp) {
674 struct vcache *vcp = VTOAFS(FILE_INODE(fp));
675 cred_t *credp = crref();
676 struct AFS_FLOCK flock;
677 /* Convert to a lock format afs_lockctl understands. */
678 memset(&flock, 0, sizeof(flock));
679 flock.l_type = flp->fl_type;
680 flock.l_pid = flp->fl_pid;
685 /* Safe because there are no large files, yet */
686 #if defined(F_GETLK64) && (F_GETLK != F_GETLK64)
687 if (cmd == F_GETLK64)
689 else if (cmd == F_SETLK64)
691 else if (cmd == F_SETLKW64)
693 #endif /* F_GETLK64 && F_GETLK != F_GETLK64 */
696 code = afs_convert_code(afs_lockctl(vcp, &flock, cmd, credp));
699 if ((code == 0 || flp->fl_type == F_UNLCK) &&
700 (cmd == F_SETLK || cmd == F_SETLKW)) {
701 flp->fl_flags &=~ FL_SLEEP;
702 code = flock_lock_file_wait(fp, flp);
703 if (code && flp->fl_type != F_UNLCK) {
704 struct AFS_FLOCK flock2;
706 flock2.l_type = F_UNLCK;
708 afs_lockctl(vcp, &flock2, F_SETLK, credp);
712 /* Convert flock back to Linux's file_lock */
713 flp->fl_type = flock.l_type;
714 flp->fl_pid = flock.l_pid;
722 * essentially the same as afs_fsync() but we need to get the return
723 * code for the sys_close() here, not afs_linux_release(), so call
724 * afs_StoreAllSegments() with AFS_LASTSTORE
727 #if defined(FOP_FLUSH_TAKES_FL_OWNER_T)
728 afs_linux_flush(struct file *fp, fl_owner_t id)
730 afs_linux_flush(struct file *fp)
733 struct vrequest *treq = NULL;
741 if ((fp->f_flags & O_ACCMODE) == O_RDONLY) { /* readers dont flush */
749 vcp = VTOAFS(FILE_INODE(fp));
751 code = afs_CreateReq(&treq, credp);
754 /* If caching is bypassed for this file, or globally, just return 0 */
755 if (cache_bypass_strategy == ALWAYS_BYPASS_CACHE)
758 ObtainReadLock(&vcp->lock);
759 if (vcp->cachingStates & FCSBypass)
761 ReleaseReadLock(&vcp->lock);
764 /* future proof: don't rely on 0 return from afs_InitReq */
769 ObtainSharedLock(&vcp->lock, 535);
770 if ((vcp->execsOrWriters > 0) && (file_count(fp) == 1)) {
771 UpgradeSToWLock(&vcp->lock, 536);
772 if (!AFS_IS_DISCONNECTED) {
773 code = afs_StoreAllSegments(vcp,
775 AFS_SYNC | AFS_LASTSTORE);
777 afs_DisconAddDirty(vcp, VDisconWriteOsiFlush, 1);
779 ConvertWToSLock(&vcp->lock);
781 code = afs_CheckCode(code, treq, 54);
782 ReleaseSharedLock(&vcp->lock);
785 afs_DestroyReq(treq);
790 return afs_convert_code(code);
793 struct file_operations afs_dir_fops = {
794 .read = generic_read_dir,
795 #if defined(STRUCT_FILE_OPERATIONS_HAS_ITERATE)
796 .iterate = afs_linux_readdir,
798 .readdir = afs_linux_readdir,
800 #ifdef HAVE_UNLOCKED_IOCTL
801 .unlocked_ioctl = afs_unlocked_xioctl,
805 #ifdef HAVE_COMPAT_IOCTL
806 .compat_ioctl = afs_unlocked_xioctl,
808 .open = afs_linux_open,
809 .release = afs_linux_release,
810 .llseek = default_llseek,
811 #ifdef HAVE_LINUX_NOOP_FSYNC
814 .fsync = simple_sync_file,
818 struct file_operations afs_file_fops = {
819 #ifdef STRUCT_FILE_OPERATIONS_HAS_READ_ITER
820 .read_iter = afs_linux_read_iter,
821 .write_iter = afs_linux_write_iter,
822 .read = new_sync_read,
823 .write = new_sync_write,
824 #elif defined(HAVE_LINUX_GENERIC_FILE_AIO_READ)
825 .aio_read = afs_linux_aio_read,
826 .aio_write = afs_linux_aio_write,
827 .read = do_sync_read,
828 .write = do_sync_write,
830 .read = afs_linux_read,
831 .write = afs_linux_write,
833 #ifdef HAVE_UNLOCKED_IOCTL
834 .unlocked_ioctl = afs_unlocked_xioctl,
838 #ifdef HAVE_COMPAT_IOCTL
839 .compat_ioctl = afs_unlocked_xioctl,
841 .mmap = afs_linux_mmap,
842 .open = afs_linux_open,
843 .flush = afs_linux_flush,
844 #if defined(STRUCT_FILE_OPERATIONS_HAS_SENDFILE)
845 .sendfile = generic_file_sendfile,
847 #if defined(STRUCT_FILE_OPERATIONS_HAS_SPLICE)
848 # if defined(HAVE_LINUX_ITER_FILE_SPLICE_WRITE)
849 .splice_write = iter_file_splice_write,
851 .splice_write = generic_file_splice_write,
853 .splice_read = generic_file_splice_read,
855 .release = afs_linux_release,
856 .fsync = afs_linux_fsync,
857 .lock = afs_linux_lock,
858 #ifdef STRUCT_FILE_OPERATIONS_HAS_FLOCK
859 .flock = afs_linux_flock,
861 .llseek = default_llseek,
864 static struct dentry *
865 canonical_dentry(struct inode *ip)
867 struct vcache *vcp = VTOAFS(ip);
868 struct dentry *first = NULL, *ret = NULL, *cur;
869 #if defined(D_ALIAS_IS_HLIST) && !defined(HLIST_ITERATOR_NO_NODE)
870 struct hlist_node *p;
874 * if vcp->target_link is set, and can be found in ip->i_dentry, use that.
875 * otherwise, use the first dentry in ip->i_dentry.
876 * if ip->i_dentry is empty, use the 'dentry' argument we were given.
878 /* note that vcp->target_link specifies which dentry to use, but we have
879 * no reference held on that dentry. so, we cannot use or dereference
880 * vcp->target_link itself, since it may have been freed. instead, we only
881 * use it to compare to pointers in the ip->i_dentry list. */
885 # ifdef HAVE_DCACHE_LOCK
886 spin_lock(&dcache_lock);
888 spin_lock(&ip->i_lock);
891 #if defined(D_ALIAS_IS_HLIST)
892 # if defined(HLIST_ITERATOR_NO_NODE)
893 hlist_for_each_entry(cur, &ip->i_dentry, d_alias) {
895 hlist_for_each_entry(cur, p, &ip->i_dentry, d_alias) {
898 list_for_each_entry_reverse(cur, &ip->i_dentry, d_alias) {
901 if (!vcp->target_link || cur == vcp->target_link) {
914 vcp->target_link = ret;
916 # ifdef HAVE_DCACHE_LOCK
920 spin_unlock(&dcache_lock);
925 spin_unlock(&ip->i_lock);
931 /**********************************************************************
932 * AFS Linux dentry operations
933 **********************************************************************/
935 /* afs_linux_revalidate
936 * Ensure vcache is stat'd before use. Return 0 if entry is valid.
939 afs_linux_revalidate(struct dentry *dp)
941 struct vattr *vattr = NULL;
942 struct vcache *vcp = VTOAFS(dp->d_inode);
946 if (afs_shuttingdown)
951 code = afs_CreateAttr(&vattr);
956 /* This avoids the crref when we don't have to do it. Watch for
957 * changes in afs_getattr that don't get replicated here!
959 if (vcp->f.states & CStatd &&
960 (!afs_fakestat_enable || vcp->mvstat != 1) &&
962 (vType(vcp) == VDIR || vType(vcp) == VLNK)) {
963 code = afs_CopyOutAttrs(vcp, vattr);
966 code = afs_getattr(vcp, vattr, credp);
971 afs_fill_inode(AFSTOV(vcp), vattr);
973 afs_DestroyAttr(vattr);
978 return afs_convert_code(code);
982 * Set iattr data into vattr. Assume vattr cleared before call.
985 iattr2vattr(struct vattr *vattrp, struct iattr *iattrp)
987 vattrp->va_mask = iattrp->ia_valid;
988 if (iattrp->ia_valid & ATTR_MODE)
989 vattrp->va_mode = iattrp->ia_mode;
990 if (iattrp->ia_valid & ATTR_UID)
991 vattrp->va_uid = afs_from_kuid(iattrp->ia_uid);
992 if (iattrp->ia_valid & ATTR_GID)
993 vattrp->va_gid = afs_from_kgid(iattrp->ia_gid);
994 if (iattrp->ia_valid & ATTR_SIZE)
995 vattrp->va_size = iattrp->ia_size;
996 if (iattrp->ia_valid & ATTR_ATIME) {
997 vattrp->va_atime.tv_sec = iattrp->ia_atime.tv_sec;
998 vattrp->va_atime.tv_usec = 0;
1000 if (iattrp->ia_valid & ATTR_MTIME) {
1001 vattrp->va_mtime.tv_sec = iattrp->ia_mtime.tv_sec;
1002 vattrp->va_mtime.tv_usec = 0;
1004 if (iattrp->ia_valid & ATTR_CTIME) {
1005 vattrp->va_ctime.tv_sec = iattrp->ia_ctime.tv_sec;
1006 vattrp->va_ctime.tv_usec = 0;
1011 * Rewrite the inode cache from the attr. Assumes all vattr fields are valid.
1014 vattr2inode(struct inode *ip, struct vattr *vp)
1016 ip->i_ino = vp->va_nodeid;
1017 #ifdef HAVE_LINUX_SET_NLINK
1018 set_nlink(ip, vp->va_nlink);
1020 ip->i_nlink = vp->va_nlink;
1022 ip->i_blocks = vp->va_blocks;
1023 #ifdef STRUCT_INODE_HAS_I_BLKBITS
1024 ip->i_blkbits = AFS_BLKBITS;
1026 #ifdef STRUCT_INODE_HAS_I_BLKSIZE
1027 ip->i_blksize = vp->va_blocksize;
1029 ip->i_rdev = vp->va_rdev;
1030 ip->i_mode = vp->va_mode;
1031 ip->i_uid = afs_make_kuid(vp->va_uid);
1032 ip->i_gid = afs_make_kgid(vp->va_gid);
1033 i_size_write(ip, vp->va_size);
1034 ip->i_atime.tv_sec = vp->va_atime.tv_sec;
1035 ip->i_atime.tv_nsec = 0;
1036 ip->i_mtime.tv_sec = vp->va_mtime.tv_sec;
1037 /* Set the mtime nanoseconds to the sysname generation number.
1038 * This convinces NFS clients that all directories have changed
1039 * any time the sysname list changes.
1041 ip->i_mtime.tv_nsec = afs_sysnamegen;
1042 ip->i_ctime.tv_sec = vp->va_ctime.tv_sec;
1043 ip->i_ctime.tv_nsec = 0;
1046 /* afs_notify_change
1047 * Linux version of setattr call. What to change is in the iattr struct.
1048 * We need to set bits in both the Linux inode as well as the vcache.
1051 afs_notify_change(struct dentry *dp, struct iattr *iattrp)
1053 struct vattr *vattr = NULL;
1054 cred_t *credp = crref();
1055 struct inode *ip = dp->d_inode;
1059 code = afs_CreateAttr(&vattr);
1064 iattr2vattr(vattr, iattrp); /* Convert for AFS vnodeops call. */
1066 code = afs_setattr(VTOAFS(ip), vattr, credp);
1068 afs_getattr(VTOAFS(ip), vattr, credp);
1069 vattr2inode(ip, vattr);
1071 afs_DestroyAttr(vattr);
1076 return afs_convert_code(code);
1080 afs_linux_getattr(struct vfsmount *mnt, struct dentry *dentry, struct kstat *stat)
1082 int err = afs_linux_revalidate(dentry);
1084 generic_fillattr(dentry->d_inode, stat);
1090 parent_vcache_dv(struct inode *inode, cred_t *credp)
1093 struct vcache *pvcp;
1096 * If parent is a mount point and we are using fakestat, we may need
1097 * to look at the fake vcache entry instead of what the vfs is giving
1098 * us. The fake entry is the one with the useful DataVersion.
1100 pvcp = VTOAFS(inode);
1101 if (pvcp->mvstat == 1 && afs_fakestat_enable) {
1102 struct vrequest treq;
1103 struct afs_fakestat_state fakestate;
1109 afs_InitReq(&treq, credp);
1110 afs_InitFakeStat(&fakestate);
1111 afs_TryEvalFakeStat(&pvcp, &fakestate, &treq);
1114 afs_PutFakeStat(&fakestate);
1116 return hgetlo(pvcp->f.m.DataVersion);
1119 /* Validate a dentry. Return 1 if unchanged, 0 if VFS layer should re-evaluate.
1120 * In kernels 2.2.10 and above, we are passed an additional flags var which
1121 * may have either the LOOKUP_FOLLOW OR LOOKUP_DIRECTORY set in which case
1122 * we are advised to follow the entry if it is a link or to make sure that
1123 * it is a directory. But since the kernel itself checks these possibilities
1124 * later on, we shouldn't have to do it until later. Perhaps in the future..
1126 * The code here assumes that on entry the global lock is not held
1129 #if defined(DOP_REVALIDATE_TAKES_UNSIGNED)
1130 afs_linux_dentry_revalidate(struct dentry *dp, unsigned int flags)
1131 #elif defined(DOP_REVALIDATE_TAKES_NAMEIDATA)
1132 afs_linux_dentry_revalidate(struct dentry *dp, struct nameidata *nd)
1134 afs_linux_dentry_revalidate(struct dentry *dp, int flags)
1137 cred_t *credp = NULL;
1138 struct vcache *vcp, *pvcp, *tvc = NULL;
1139 struct dentry *parent;
1141 struct afs_fakestat_state fakestate;
1144 afs_uint32 parent_dv;
1147 /* We don't support RCU path walking */
1148 # if defined(DOP_REVALIDATE_TAKES_UNSIGNED)
1149 if (flags & LOOKUP_RCU)
1151 if (nd->flags & LOOKUP_RCU)
1156 afs_InitFakeStat(&fakestate);
1159 vcp = VTOAFS(dp->d_inode);
1161 if (vcp == afs_globalVp)
1164 parent = dget_parent(dp);
1165 pvcp = VTOAFS(parent->d_inode);
1167 if ((vcp->mvstat == 1) || (vcp->mvstat == 2) ||
1168 (pvcp->mvstat == 1 && afs_fakestat_enable)) { /* need to lock */
1174 if (locked && vcp->mvstat == 1) { /* mount point */
1175 if (vcp->mvid && (vcp->f.states & CMValid)) {
1176 int tryEvalOnly = 0;
1178 struct vrequest *treq = NULL;
1180 code = afs_CreateReq(&treq, credp);
1185 if ((strcmp(dp->d_name.name, ".directory") == 0)) {
1189 code = afs_TryEvalFakeStat(&vcp, &fakestate, treq);
1191 code = afs_EvalFakeStat(&vcp, &fakestate, treq);
1192 afs_DestroyReq(treq);
1193 if ((tryEvalOnly && vcp->mvstat == 1) || code) {
1194 /* a mount point, not yet replaced by its directory */
1202 /* If the last looker changes, we should make sure the current
1203 * looker still has permission to examine this file. This would
1204 * always require a crref() which would be "slow".
1206 if (vcp->last_looker != treq.uid) {
1207 if (!afs_AccessOK(vcp, (vType(vcp) == VREG) ? PRSFS_READ : PRSFS_LOOKUP, &treq, CHECK_MODE_BITS)) {
1212 vcp->last_looker = treq.uid;
1216 parent_dv = parent_vcache_dv(parent->d_inode, credp);
1218 /* If the parent's DataVersion has changed or the vnode
1219 * is longer valid, we need to do a full lookup. VerifyVCache
1220 * isn't enough since the vnode may have been renamed.
1223 if ((!locked) && (parent_dv > dp->d_time || !(vcp->f.states & CStatd)) ) {
1229 if (locked && (parent_dv > dp->d_time || !(vcp->f.states & CStatd))) {
1230 struct vattr *vattr = NULL;
1234 code = afs_lookup(pvcp, (char *)dp->d_name.name, &tvc, credp);
1237 /* We couldn't perform the lookup, so we're not okay. */
1240 } else if (tvc == vcp) {
1241 /* We got back the same vcache, so we're good. */
1244 } else if (tvc == VTOAFS(dp->d_inode)) {
1245 /* We got back the same vcache, so we're good. This is
1246 * different from the above case, because sometimes 'vcp' is
1247 * not the same as the vcache for dp->d_inode, if 'vcp' was a
1248 * mtpt and we evaluated it to a root dir. In rare cases,
1249 * afs_lookup might not evalute the mtpt when we do, or vice
1250 * versa, so the previous case will not succeed. But this is
1251 * still 'correct', so make sure not to mark the dentry as
1252 * invalid; it still points to the same thing! */
1256 /* We got back a different file, so we're definitely not
1263 /* Force unhash; the name doesn't point to this file
1266 if (code && code != ENOENT) {
1267 /* ...except if we couldn't perform the actual lookup,
1268 * we don't know if the name points to this file or not. */
1274 code = afs_CreateAttr(&vattr);
1280 if (afs_getattr(vcp, vattr, credp)) {
1282 afs_DestroyAttr(vattr);
1286 vattr2inode(AFSTOV(vcp), vattr);
1287 dp->d_time = parent_dv;
1289 afs_DestroyAttr(vattr);
1292 /* should we always update the attributes at this point? */
1293 /* unlikely--the vcache entry hasn't changed */
1298 /* If this code is ever enabled, we should use dget_parent to handle
1299 * getting the parent, and dput() to dispose of it. See above for an
1301 pvcp = VTOAFS(dp->d_parent->d_inode);
1302 if (hgetlo(pvcp->f.m.DataVersion) > dp->d_time)
1306 /* No change in parent's DataVersion so this negative
1307 * lookup is still valid. BUT, if a server is down a
1308 * negative lookup can result so there should be a
1309 * liftime as well. For now, always expire.
1322 afs_PutFakeStat(&fakestate); /* from here on vcp may be no longer valid */
1324 /* we hold the global lock if we evaluated a mount point */
1332 * If we had a negative lookup for the name we want to forcibly
1333 * unhash the dentry.
1334 * Otherwise use d_invalidate which will not unhash it if still in use.
1337 shrink_dcache_parent(dp);
1346 if (have_submounts(dp))
1354 afs_dentry_iput(struct dentry *dp, struct inode *ip)
1356 struct vcache *vcp = VTOAFS(ip);
1359 if (!AFS_IS_DISCONNECTED || (vcp->f.states & CUnlinked)) {
1360 (void) afs_InactiveVCache(vcp, NULL);
1363 afs_linux_clear_nfsfs_renamed(dp);
1369 #if defined(DOP_D_DELETE_TAKES_CONST)
1370 afs_dentry_delete(const struct dentry *dp)
1372 afs_dentry_delete(struct dentry *dp)
1375 if (dp->d_inode && (VTOAFS(dp->d_inode)->f.states & CUnlinked))
1376 return 1; /* bad inode? */
1381 #ifdef STRUCT_DENTRY_OPERATIONS_HAS_D_AUTOMOUNT
1382 static struct vfsmount *
1383 afs_dentry_automount(afs_linux_path_t *path)
1385 struct dentry *target;
1387 /* avoid symlink resolution limits when resolving; we cannot contribute to
1388 * an infinite symlink loop */
1389 current->total_link_count--;
1391 target = canonical_dentry(path->dentry->d_inode);
1393 if (target == path->dentry) {
1400 path->dentry = target;
1403 spin_lock(&path->dentry->d_lock);
1404 path->dentry->d_flags &= ~DCACHE_NEED_AUTOMOUNT;
1405 spin_unlock(&path->dentry->d_lock);
1410 #endif /* STRUCT_DENTRY_OPERATIONS_HAS_D_AUTOMOUNT */
1412 struct dentry_operations afs_dentry_operations = {
1413 .d_revalidate = afs_linux_dentry_revalidate,
1414 .d_delete = afs_dentry_delete,
1415 .d_iput = afs_dentry_iput,
1416 #ifdef STRUCT_DENTRY_OPERATIONS_HAS_D_AUTOMOUNT
1417 .d_automount = afs_dentry_automount,
1418 #endif /* STRUCT_DENTRY_OPERATIONS_HAS_D_AUTOMOUNT */
1421 /**********************************************************************
1422 * AFS Linux inode operations
1423 **********************************************************************/
1427 * Merely need to set enough of vattr to get us through the create. Note
1428 * that the higher level code (open_namei) will take care of any tuncation
1429 * explicitly. Exclusive open is also taken care of in open_namei.
1431 * name is in kernel space at this point.
1434 #if defined(IOP_CREATE_TAKES_BOOL)
1435 afs_linux_create(struct inode *dip, struct dentry *dp, umode_t mode,
1437 #elif defined(IOP_CREATE_TAKES_UMODE_T)
1438 afs_linux_create(struct inode *dip, struct dentry *dp, umode_t mode,
1439 struct nameidata *nd)
1440 #elif defined(IOP_CREATE_TAKES_NAMEIDATA)
1441 afs_linux_create(struct inode *dip, struct dentry *dp, int mode,
1442 struct nameidata *nd)
1444 afs_linux_create(struct inode *dip, struct dentry *dp, int mode)
1447 struct vattr *vattr = NULL;
1448 cred_t *credp = crref();
1449 const char *name = dp->d_name.name;
1455 code = afs_CreateAttr(&vattr);
1459 vattr->va_mode = mode;
1460 vattr->va_type = mode & S_IFMT;
1462 code = afs_create(VTOAFS(dip), (char *)name, vattr, NONEXCL, mode,
1466 struct inode *ip = AFSTOV(vcp);
1468 afs_getattr(vcp, vattr, credp);
1469 afs_fill_inode(ip, vattr);
1470 insert_inode_hash(ip);
1471 #if !defined(STRUCT_SUPER_BLOCK_HAS_S_D_OP)
1472 dp->d_op = &afs_dentry_operations;
1474 dp->d_time = parent_vcache_dv(dip, credp);
1475 d_instantiate(dp, ip);
1478 afs_DestroyAttr(vattr);
1484 return afs_convert_code(code);
1487 /* afs_linux_lookup */
1488 static struct dentry *
1489 #if defined(IOP_LOOKUP_TAKES_UNSIGNED)
1490 afs_linux_lookup(struct inode *dip, struct dentry *dp,
1492 #elif defined(IOP_LOOKUP_TAKES_NAMEIDATA)
1493 afs_linux_lookup(struct inode *dip, struct dentry *dp,
1494 struct nameidata *nd)
1496 afs_linux_lookup(struct inode *dip, struct dentry *dp)
1499 cred_t *credp = crref();
1500 struct vcache *vcp = NULL;
1501 const char *comp = dp->d_name.name;
1502 struct inode *ip = NULL;
1503 struct dentry *newdp = NULL;
1507 code = afs_lookup(VTOAFS(dip), (char *)comp, &vcp, credp);
1510 struct vattr *vattr = NULL;
1511 struct vcache *parent_vc = VTOAFS(dip);
1513 if (parent_vc == vcp) {
1514 /* This is possible if the parent dir is a mountpoint to a volume,
1515 * and the dir entry we looked up is a mountpoint to the same
1516 * volume. Linux cannot cope with this, so return an error instead
1517 * of risking a deadlock or panic. */
1524 code = afs_CreateAttr(&vattr);
1532 afs_getattr(vcp, vattr, credp);
1533 afs_fill_inode(ip, vattr);
1534 if (hlist_unhashed(&ip->i_hash))
1535 insert_inode_hash(ip);
1537 afs_DestroyAttr(vattr);
1539 #if !defined(STRUCT_SUPER_BLOCK_HAS_S_D_OP)
1540 dp->d_op = &afs_dentry_operations;
1542 dp->d_time = parent_vcache_dv(dip, credp);
1546 if (ip && S_ISDIR(ip->i_mode)) {
1547 d_prune_aliases(ip);
1549 #ifdef STRUCT_DENTRY_OPERATIONS_HAS_D_AUTOMOUNT
1550 ip->i_flags |= S_AUTOMOUNT;
1554 * Take an extra reference so the inode doesn't go away if
1555 * d_splice_alias drops our reference on error.
1558 #ifdef HAVE_LINUX_IHOLD
1564 newdp = d_splice_alias(ip, dp);
1569 /* It's ok for the file to not be found. That's noted by the caller by
1570 * seeing that the dp->d_inode field is NULL.
1572 if (!code || code == ENOENT) {
1574 * d_splice_alias can return an error (EIO) if there is an existing
1575 * connected directory alias for this dentry.
1577 if (!IS_ERR(newdp)) {
1583 * Depending on the kernel version, d_splice_alias may or may
1584 * not drop the inode reference on error. If it didn't, do it
1587 #if defined(D_SPLICE_ALIAS_LEAK_ON_ERROR)
1595 return ERR_PTR(afs_convert_code(code));
1600 afs_linux_link(struct dentry *olddp, struct inode *dip, struct dentry *newdp)
1603 cred_t *credp = crref();
1604 const char *name = newdp->d_name.name;
1605 struct inode *oldip = olddp->d_inode;
1607 /* If afs_link returned the vnode, we could instantiate the
1608 * dentry. Since it's not, we drop this one and do a new lookup.
1613 code = afs_link(VTOAFS(oldip), VTOAFS(dip), (char *)name, credp);
1617 return afs_convert_code(code);
1620 /* We have to have a Linux specific sillyrename function, because we
1621 * also have to keep the dcache up to date when we're doing a silly
1622 * rename - so we don't want the generic vnodeops doing this behind our
1627 afs_linux_sillyrename(struct inode *dir, struct dentry *dentry,
1630 struct vcache *tvc = VTOAFS(dentry->d_inode);
1631 struct dentry *__dp = NULL;
1632 char *__name = NULL;
1635 if (afs_linux_nfsfs_renamed(dentry))
1643 osi_FreeSmallSpace(__name);
1644 __name = afs_newname();
1647 __dp = lookup_one_len(__name, dentry->d_parent, strlen(__name));
1650 osi_FreeSmallSpace(__name);
1653 } while (__dp->d_inode != NULL);
1656 code = afs_rename(VTOAFS(dir), (char *)dentry->d_name.name,
1657 VTOAFS(dir), (char *)__dp->d_name.name,
1660 tvc->mvid = (void *) __name;
1663 crfree(tvc->uncred);
1665 tvc->uncred = credp;
1666 tvc->f.states |= CUnlinked;
1667 afs_linux_set_nfsfs_renamed(dentry);
1669 osi_FreeSmallSpace(__name);
1674 __dp->d_time = hgetlo(VTOAFS(dir)->f.m.DataVersion);
1675 d_move(dentry, __dp);
1684 afs_linux_unlink(struct inode *dip, struct dentry *dp)
1687 cred_t *credp = crref();
1688 const char *name = dp->d_name.name;
1689 struct vcache *tvc = VTOAFS(dp->d_inode);
1691 if (VREFCOUNT(tvc) > 1 && tvc->opens > 0
1692 && !(tvc->f.states & CUnlinked)) {
1694 code = afs_linux_sillyrename(dip, dp, credp);
1697 code = afs_remove(VTOAFS(dip), (char *)name, credp);
1704 return afs_convert_code(code);
1709 afs_linux_symlink(struct inode *dip, struct dentry *dp, const char *target)
1712 cred_t *credp = crref();
1713 struct vattr *vattr = NULL;
1714 const char *name = dp->d_name.name;
1716 /* If afs_symlink returned the vnode, we could instantiate the
1717 * dentry. Since it's not, we drop this one and do a new lookup.
1722 code = afs_CreateAttr(&vattr);
1727 code = afs_symlink(VTOAFS(dip), (char *)name, vattr, (char *)target, NULL,
1729 afs_DestroyAttr(vattr);
1734 return afs_convert_code(code);
1738 #if defined(IOP_MKDIR_TAKES_UMODE_T)
1739 afs_linux_mkdir(struct inode *dip, struct dentry *dp, umode_t mode)
1741 afs_linux_mkdir(struct inode *dip, struct dentry *dp, int mode)
1745 cred_t *credp = crref();
1746 struct vcache *tvcp = NULL;
1747 struct vattr *vattr = NULL;
1748 const char *name = dp->d_name.name;
1751 code = afs_CreateAttr(&vattr);
1756 vattr->va_mask = ATTR_MODE;
1757 vattr->va_mode = mode;
1759 code = afs_mkdir(VTOAFS(dip), (char *)name, vattr, &tvcp, credp);
1762 struct inode *ip = AFSTOV(tvcp);
1764 afs_getattr(tvcp, vattr, credp);
1765 afs_fill_inode(ip, vattr);
1767 #if !defined(STRUCT_SUPER_BLOCK_HAS_S_D_OP)
1768 dp->d_op = &afs_dentry_operations;
1770 dp->d_time = hgetlo(VTOAFS(dip)->f.m.DataVersion);
1771 d_instantiate(dp, ip);
1773 afs_DestroyAttr(vattr);
1779 return afs_convert_code(code);
1783 afs_linux_rmdir(struct inode *dip, struct dentry *dp)
1786 cred_t *credp = crref();
1787 const char *name = dp->d_name.name;
1789 /* locking kernel conflicts with glock? */
1792 code = afs_rmdir(VTOAFS(dip), (char *)name, credp);
1795 /* Linux likes to see ENOTEMPTY returned from an rmdir() syscall
1796 * that failed because a directory is not empty. So, we map
1797 * EEXIST to ENOTEMPTY on linux.
1799 if (code == EEXIST) {
1808 return afs_convert_code(code);
1813 afs_linux_rename(struct inode *oldip, struct dentry *olddp,
1814 struct inode *newip, struct dentry *newdp)
1817 cred_t *credp = crref();
1818 const char *oldname = olddp->d_name.name;
1819 const char *newname = newdp->d_name.name;
1820 struct dentry *rehash = NULL;
1822 /* Prevent any new references during rename operation. */
1824 if (!d_unhashed(newdp)) {
1829 afs_maybe_shrink_dcache(olddp);
1832 code = afs_rename(VTOAFS(oldip), (char *)oldname, VTOAFS(newip), (char *)newname, credp);
1836 olddp->d_time = 0; /* force to revalidate */
1842 return afs_convert_code(code);
1846 /* afs_linux_ireadlink
1847 * Internal readlink which can return link contents to user or kernel space.
1848 * Note that the buffer is NOT supposed to be null-terminated.
1851 afs_linux_ireadlink(struct inode *ip, char *target, int maxlen, uio_seg_t seg)
1854 cred_t *credp = crref();
1858 setup_uio(&tuio, &iov, target, (afs_offs_t) 0, maxlen, UIO_READ, seg);
1859 code = afs_readlink(VTOAFS(ip), &tuio, credp);
1863 return maxlen - tuio.uio_resid;
1865 return afs_convert_code(code);
1868 #if !defined(USABLE_KERNEL_PAGE_SYMLINK_CACHE)
1869 /* afs_linux_readlink
1870 * Fill target (which is in user space) with contents of symlink.
1873 afs_linux_readlink(struct dentry *dp, char *target, int maxlen)
1876 struct inode *ip = dp->d_inode;
1879 code = afs_linux_ireadlink(ip, target, maxlen, AFS_UIOUSER);
1885 /* afs_linux_follow_link
1886 * a file system dependent link following routine.
1888 static int afs_linux_follow_link(struct dentry *dentry, struct nameidata *nd)
1893 name = kmalloc(PATH_MAX, GFP_NOFS);
1899 code = afs_linux_ireadlink(dentry->d_inode, name, PATH_MAX - 1, AFS_UIOSYS);
1907 nd_set_link(nd, name);
1912 afs_linux_put_link(struct dentry *dentry, struct nameidata *nd)
1914 char *name = nd_get_link(nd);
1916 if (name && !IS_ERR(name))
1920 #endif /* USABLE_KERNEL_PAGE_SYMLINK_CACHE */
1922 /* Populate a page by filling it from the cache file pointed at by cachefp
1923 * (which contains indicated chunk)
1924 * If task is NULL, the page copy occurs syncronously, and the routine
1925 * returns with page still locked. If task is non-NULL, then page copies
1926 * may occur in the background, and the page will be unlocked when it is
1930 afs_linux_read_cache(struct file *cachefp, struct page *page,
1931 int chunk, struct pagevec *lrupv,
1932 struct afs_pagecopy_task *task) {
1933 loff_t offset = page_offset(page);
1934 struct inode *cacheinode = cachefp->f_dentry->d_inode;
1935 struct page *newpage, *cachepage;
1936 struct address_space *cachemapping;
1940 cachemapping = cacheinode->i_mapping;
1944 /* If we're trying to read a page that's past the end of the disk
1945 * cache file, then just return a zeroed page */
1946 if (AFS_CHUNKOFFSET(offset) >= i_size_read(cacheinode)) {
1947 zero_user_segment(page, 0, PAGE_CACHE_SIZE);
1948 SetPageUptodate(page);
1954 /* From our offset, we now need to work out which page in the disk
1955 * file it corresponds to. This will be fun ... */
1956 pageindex = (offset - AFS_CHUNKTOBASE(chunk)) >> PAGE_CACHE_SHIFT;
1958 while (cachepage == NULL) {
1959 cachepage = find_get_page(cachemapping, pageindex);
1962 newpage = page_cache_alloc_cold(cachemapping);
1968 code = add_to_page_cache(newpage, cachemapping,
1969 pageindex, GFP_KERNEL);
1971 cachepage = newpage;
1974 page_cache_get(cachepage);
1975 if (!pagevec_add(lrupv, cachepage))
1976 __pagevec_lru_add_file(lrupv);
1979 page_cache_release(newpage);
1981 if (code != -EEXIST)
1985 lock_page(cachepage);
1989 if (!PageUptodate(cachepage)) {
1990 ClearPageError(cachepage);
1991 code = cachemapping->a_ops->readpage(NULL, cachepage);
1992 if (!code && !task) {
1993 wait_on_page_locked(cachepage);
1996 unlock_page(cachepage);
2000 if (PageUptodate(cachepage)) {
2001 copy_highpage(page, cachepage);
2002 flush_dcache_page(page);
2003 SetPageUptodate(page);
2008 afs_pagecopy_queue_page(task, cachepage, page);
2020 page_cache_release(cachepage);
2026 afs_linux_readpage_fastpath(struct file *fp, struct page *pp, int *codep)
2028 loff_t offset = page_offset(pp);
2029 struct inode *ip = FILE_INODE(fp);
2030 struct vcache *avc = VTOAFS(ip);
2032 struct file *cacheFp = NULL;
2035 struct pagevec lrupv;
2037 /* Not a UFS cache, don't do anything */
2038 if (cacheDiskType != AFS_FCACHE_TYPE_UFS)
2041 /* No readpage (ex: tmpfs) , skip */
2042 if (cachefs_noreadpage)
2045 /* Can't do anything if the vcache isn't statd , or if the read
2046 * crosses a chunk boundary.
2048 if (!(avc->f.states & CStatd) ||
2049 AFS_CHUNK(offset) != AFS_CHUNK(offset + PAGE_SIZE)) {
2053 ObtainWriteLock(&avc->lock, 911);
2055 /* XXX - See if hinting actually makes things faster !!! */
2057 /* See if we have a suitable entry already cached */
2061 /* We need to lock xdcache, then dcache, to handle situations where
2062 * the hint is on the free list. However, we can't safely do this
2063 * according to the locking hierarchy. So, use a non blocking lock.
2065 ObtainReadLock(&afs_xdcache);
2066 dcLocked = ( 0 == NBObtainReadLock(&tdc->lock));
2068 if (dcLocked && (tdc->index != NULLIDX)
2069 && !FidCmp(&tdc->f.fid, &avc->f.fid)
2070 && tdc->f.chunk == AFS_CHUNK(offset)
2071 && !(afs_indexFlags[tdc->index] & (IFFree | IFDiscarded))) {
2072 /* Bonus - the hint was correct */
2075 /* Only destroy the hint if its actually invalid, not if there's
2076 * just been a locking failure */
2078 ReleaseReadLock(&tdc->lock);
2085 ReleaseReadLock(&afs_xdcache);
2088 /* No hint, or hint is no longer valid - see if we can get something
2089 * directly from the dcache
2092 tdc = afs_FindDCache(avc, offset);
2095 ReleaseWriteLock(&avc->lock);
2100 ObtainReadLock(&tdc->lock);
2102 /* Is the dcache we've been given currently up to date */
2103 if (!hsame(avc->f.m.DataVersion, tdc->f.versionNo) ||
2104 (tdc->dflags & DFFetching))
2107 /* Update our hint for future abuse */
2110 /* Okay, so we've now got a cache file that is up to date */
2112 /* XXX - I suspect we should be locking the inodes before we use them! */
2114 cacheFp = afs_linux_raw_open(&tdc->f.inode);
2115 if (!cacheFp->f_dentry->d_inode->i_mapping->a_ops->readpage) {
2116 cachefs_noreadpage = 1;
2120 pagevec_init(&lrupv, 0);
2122 code = afs_linux_read_cache(cacheFp, pp, tdc->f.chunk, &lrupv, NULL);
2124 if (pagevec_count(&lrupv))
2125 __pagevec_lru_add_file(&lrupv);
2127 filp_close(cacheFp, NULL);
2130 ReleaseReadLock(&tdc->lock);
2131 ReleaseWriteLock(&avc->lock);
2138 ReleaseWriteLock(&avc->lock);
2139 ReleaseReadLock(&tdc->lock);
2144 /* afs_linux_readpage
2146 * This function is split into two, because prepare_write/begin_write
2147 * require a readpage call which doesn't unlock the resulting page upon
2151 afs_linux_fillpage(struct file *fp, struct page *pp)
2156 struct iovec *iovecp;
2157 struct inode *ip = FILE_INODE(fp);
2158 afs_int32 cnt = page_count(pp);
2159 struct vcache *avc = VTOAFS(ip);
2160 afs_offs_t offset = page_offset(pp);
2164 if (afs_linux_readpage_fastpath(fp, pp, &code)) {
2174 auio = kmalloc(sizeof(struct uio), GFP_NOFS);
2175 iovecp = kmalloc(sizeof(struct iovec), GFP_NOFS);
2177 setup_uio(auio, iovecp, (char *)address, offset, PAGE_SIZE, UIO_READ,
2182 afs_Trace4(afs_iclSetp, CM_TRACE_READPAGE, ICL_TYPE_POINTER, ip,
2183 ICL_TYPE_POINTER, pp, ICL_TYPE_INT32, cnt, ICL_TYPE_INT32,
2184 99999); /* not a possible code value */
2186 code = afs_rdwr(avc, auio, UIO_READ, 0, credp);
2188 afs_Trace4(afs_iclSetp, CM_TRACE_READPAGE, ICL_TYPE_POINTER, ip,
2189 ICL_TYPE_POINTER, pp, ICL_TYPE_INT32, cnt, ICL_TYPE_INT32,
2191 AFS_DISCON_UNLOCK();
2194 /* XXX valid for no-cache also? Check last bits of files... :)
2195 * Cognate code goes in afs_NoCacheFetchProc. */
2196 if (auio->uio_resid) /* zero remainder of page */
2197 memset((void *)(address + (PAGE_SIZE - auio->uio_resid)), 0,
2200 flush_dcache_page(pp);
2201 SetPageUptodate(pp);
2210 return afs_convert_code(code);
2214 afs_linux_prefetch(struct file *fp, struct page *pp)
2217 struct vcache *avc = VTOAFS(FILE_INODE(fp));
2218 afs_offs_t offset = page_offset(pp);
2220 if (AFS_CHUNKOFFSET(offset) == 0) {
2222 struct vrequest *treq = NULL;
2227 code = afs_CreateReq(&treq, credp);
2228 if (!code && !NBObtainWriteLock(&avc->lock, 534)) {
2229 tdc = afs_FindDCache(avc, offset);
2231 if (!(tdc->mflags & DFNextStarted))
2232 afs_PrefetchChunk(avc, tdc, credp, treq);
2235 ReleaseWriteLock(&avc->lock);
2237 afs_DestroyReq(treq);
2241 return afs_convert_code(code);
2246 afs_linux_bypass_readpages(struct file *fp, struct address_space *mapping,
2247 struct list_head *page_list, unsigned num_pages)
2252 struct iovec* iovecp;
2253 struct nocache_read_request *ancr;
2255 struct pagevec lrupv;
2259 struct inode *ip = FILE_INODE(fp);
2260 struct vcache *avc = VTOAFS(ip);
2261 afs_int32 base_index = 0;
2262 afs_int32 page_count = 0;
2265 /* background thread must free: iovecp, auio, ancr */
2266 iovecp = osi_Alloc(num_pages * sizeof(struct iovec));
2268 auio = osi_Alloc(sizeof(struct uio));
2269 auio->uio_iov = iovecp;
2270 auio->uio_iovcnt = num_pages;
2271 auio->uio_flag = UIO_READ;
2272 auio->uio_seg = AFS_UIOSYS;
2273 auio->uio_resid = num_pages * PAGE_SIZE;
2275 ancr = osi_Alloc(sizeof(struct nocache_read_request));
2277 ancr->offset = auio->uio_offset;
2278 ancr->length = auio->uio_resid;
2280 pagevec_init(&lrupv, 0);
2282 for(page_ix = 0; page_ix < num_pages; ++page_ix) {
2284 if(list_empty(page_list))
2287 pp = list_entry(page_list->prev, struct page, lru);
2288 /* If we allocate a page and don't remove it from page_list,
2289 * the page cache gets upset. */
2291 isize = (i_size_read(fp->f_mapping->host) - 1) >> PAGE_CACHE_SHIFT;
2292 if(pp->index > isize) {
2299 offset = page_offset(pp);
2300 ancr->offset = auio->uio_offset = offset;
2301 base_index = pp->index;
2303 iovecp[page_ix].iov_len = PAGE_SIZE;
2304 code = add_to_page_cache(pp, mapping, pp->index, GFP_KERNEL);
2305 if(base_index != pp->index) {
2308 page_cache_release(pp);
2309 iovecp[page_ix].iov_base = (void *) 0;
2311 ancr->length -= PAGE_SIZE;
2318 page_cache_release(pp);
2319 iovecp[page_ix].iov_base = (void *) 0;
2322 if(!PageLocked(pp)) {
2326 /* increment page refcount--our original design assumed
2327 * that locking it would effectively pin it; protect
2328 * ourselves from the possiblity that this assumption is
2329 * is faulty, at low cost (provided we do not fail to
2330 * do the corresponding decref on the other side) */
2333 /* save the page for background map */
2334 iovecp[page_ix].iov_base = (void*) pp;
2336 /* and put it on the LRU cache */
2337 if (!pagevec_add(&lrupv, pp))
2338 __pagevec_lru_add_file(&lrupv);
2342 /* If there were useful pages in the page list, make sure all pages
2343 * are in the LRU cache, then schedule the read */
2345 if (pagevec_count(&lrupv))
2346 __pagevec_lru_add_file(&lrupv);
2348 code = afs_ReadNoCache(avc, ancr, credp);
2351 /* If there is nothing for the background thread to handle,
2352 * it won't be freeing the things that we never gave it */
2353 osi_Free(iovecp, num_pages * sizeof(struct iovec));
2354 osi_Free(auio, sizeof(struct uio));
2355 osi_Free(ancr, sizeof(struct nocache_read_request));
2357 /* we do not flush, release, or unmap pages--that will be
2358 * done for us by the background thread as each page comes in
2359 * from the fileserver */
2360 return afs_convert_code(code);
2365 afs_linux_bypass_readpage(struct file *fp, struct page *pp)
2367 cred_t *credp = NULL;
2369 struct iovec *iovecp;
2370 struct nocache_read_request *ancr;
2374 * Special case: if page is at or past end of file, just zero it and set
2377 if (page_offset(pp) >= i_size_read(fp->f_mapping->host)) {
2378 zero_user_segment(pp, 0, PAGE_CACHE_SIZE);
2379 SetPageUptodate(pp);
2386 /* receiver frees */
2387 auio = osi_Alloc(sizeof(struct uio));
2388 iovecp = osi_Alloc(sizeof(struct iovec));
2390 /* address can be NULL, because we overwrite it with 'pp', below */
2391 setup_uio(auio, iovecp, NULL, page_offset(pp),
2392 PAGE_SIZE, UIO_READ, AFS_UIOSYS);
2394 /* save the page for background map */
2395 get_page(pp); /* see above */
2396 auio->uio_iov->iov_base = (void*) pp;
2397 /* the background thread will free this */
2398 ancr = osi_Alloc(sizeof(struct nocache_read_request));
2400 ancr->offset = page_offset(pp);
2401 ancr->length = PAGE_SIZE;
2404 code = afs_ReadNoCache(VTOAFS(FILE_INODE(fp)), ancr, credp);
2407 return afs_convert_code(code);
2411 afs_linux_can_bypass(struct inode *ip) {
2413 switch(cache_bypass_strategy) {
2414 case NEVER_BYPASS_CACHE:
2416 case ALWAYS_BYPASS_CACHE:
2418 case LARGE_FILES_BYPASS_CACHE:
2419 if (i_size_read(ip) > cache_bypass_threshold)
2426 /* Check if a file is permitted to bypass the cache by policy, and modify
2427 * the cache bypass state recorded for that file */
2430 afs_linux_bypass_check(struct inode *ip) {
2433 int bypass = afs_linux_can_bypass(ip);
2436 trydo_cache_transition(VTOAFS(ip), credp, bypass);
2444 afs_linux_readpage(struct file *fp, struct page *pp)
2448 if (afs_linux_bypass_check(FILE_INODE(fp))) {
2449 code = afs_linux_bypass_readpage(fp, pp);
2451 code = afs_linux_fillpage(fp, pp);
2453 code = afs_linux_prefetch(fp, pp);
2460 /* Readpages reads a number of pages for a particular file. We use
2461 * this to optimise the reading, by limiting the number of times upon which
2462 * we have to lookup, lock and open vcaches and dcaches
2466 afs_linux_readpages(struct file *fp, struct address_space *mapping,
2467 struct list_head *page_list, unsigned int num_pages)
2469 struct inode *inode = mapping->host;
2470 struct vcache *avc = VTOAFS(inode);
2472 struct file *cacheFp = NULL;
2474 unsigned int page_idx;
2476 struct pagevec lrupv;
2477 struct afs_pagecopy_task *task;
2479 if (afs_linux_bypass_check(inode))
2480 return afs_linux_bypass_readpages(fp, mapping, page_list, num_pages);
2482 if (cacheDiskType == AFS_FCACHE_TYPE_MEM)
2485 /* No readpage (ex: tmpfs) , skip */
2486 if (cachefs_noreadpage)
2490 if ((code = afs_linux_VerifyVCache(avc, NULL))) {
2495 ObtainWriteLock(&avc->lock, 912);
2498 task = afs_pagecopy_init_task();
2501 pagevec_init(&lrupv, 0);
2502 for (page_idx = 0; page_idx < num_pages; page_idx++) {
2503 struct page *page = list_entry(page_list->prev, struct page, lru);
2504 list_del(&page->lru);
2505 offset = page_offset(page);
2507 if (tdc && tdc->f.chunk != AFS_CHUNK(offset)) {
2509 ReleaseReadLock(&tdc->lock);
2514 filp_close(cacheFp, NULL);
2519 if ((tdc = afs_FindDCache(avc, offset))) {
2520 ObtainReadLock(&tdc->lock);
2521 if (!hsame(avc->f.m.DataVersion, tdc->f.versionNo) ||
2522 (tdc->dflags & DFFetching)) {
2523 ReleaseReadLock(&tdc->lock);
2530 cacheFp = afs_linux_raw_open(&tdc->f.inode);
2531 if (!cacheFp->f_dentry->d_inode->i_mapping->a_ops->readpage) {
2532 cachefs_noreadpage = 1;
2538 if (tdc && !add_to_page_cache(page, mapping, page->index,
2540 page_cache_get(page);
2541 if (!pagevec_add(&lrupv, page))
2542 __pagevec_lru_add_file(&lrupv);
2544 afs_linux_read_cache(cacheFp, page, tdc->f.chunk, &lrupv, task);
2546 page_cache_release(page);
2548 if (pagevec_count(&lrupv))
2549 __pagevec_lru_add_file(&lrupv);
2553 filp_close(cacheFp, NULL);
2555 afs_pagecopy_put_task(task);
2559 ReleaseReadLock(&tdc->lock);
2563 ReleaseWriteLock(&avc->lock);
2568 /* Prepare an AFS vcache for writeback. Should be called with the vcache
2571 afs_linux_prepare_writeback(struct vcache *avc) {
2572 if (avc->f.states & CPageWrite) {
2573 return AOP_WRITEPAGE_ACTIVATE;
2575 avc->f.states |= CPageWrite;
2580 afs_linux_dopartialwrite(struct vcache *avc, cred_t *credp) {
2581 struct vrequest *treq = NULL;
2584 if (!afs_CreateReq(&treq, credp)) {
2585 code = afs_DoPartialWrite(avc, treq);
2586 afs_DestroyReq(treq);
2589 return afs_convert_code(code);
2593 afs_linux_complete_writeback(struct vcache *avc) {
2594 avc->f.states &= ~CPageWrite;
2597 /* Writeback a given page syncronously. Called with no AFS locks held */
2599 afs_linux_page_writeback(struct inode *ip, struct page *pp,
2600 unsigned long offset, unsigned int count,
2603 struct vcache *vcp = VTOAFS(ip);
2611 buffer = kmap(pp) + offset;
2612 base = page_offset(pp) + offset;
2615 afs_Trace4(afs_iclSetp, CM_TRACE_UPDATEPAGE, ICL_TYPE_POINTER, vcp,
2616 ICL_TYPE_POINTER, pp, ICL_TYPE_INT32, page_count(pp),
2617 ICL_TYPE_INT32, 99999);
2619 setup_uio(&tuio, &iovec, buffer, base, count, UIO_WRITE, AFS_UIOSYS);
2621 code = afs_write(vcp, &tuio, f_flags, credp, 0);
2623 i_size_write(ip, vcp->f.m.Length);
2624 ip->i_blocks = ((vcp->f.m.Length + 1023) >> 10) << 1;
2626 code = code ? afs_convert_code(code) : count - tuio.uio_resid;
2628 afs_Trace4(afs_iclSetp, CM_TRACE_UPDATEPAGE, ICL_TYPE_POINTER, vcp,
2629 ICL_TYPE_POINTER, pp, ICL_TYPE_INT32, page_count(pp),
2630 ICL_TYPE_INT32, code);
2639 afs_linux_writepage_sync(struct inode *ip, struct page *pp,
2640 unsigned long offset, unsigned int count)
2644 struct vcache *vcp = VTOAFS(ip);
2647 /* Catch recursive writeback. This occurs if the kernel decides
2648 * writeback is required whilst we are writing to the cache, or
2649 * flushing to the server. When we're running syncronously (as
2650 * opposed to from writepage) we can't actually do anything about
2651 * this case - as we can't return AOP_WRITEPAGE_ACTIVATE to write()
2654 ObtainWriteLock(&vcp->lock, 532);
2655 afs_linux_prepare_writeback(vcp);
2656 ReleaseWriteLock(&vcp->lock);
2660 code = afs_linux_page_writeback(ip, pp, offset, count, credp);
2663 ObtainWriteLock(&vcp->lock, 533);
2665 code1 = afs_linux_dopartialwrite(vcp, credp);
2666 afs_linux_complete_writeback(vcp);
2667 ReleaseWriteLock(&vcp->lock);
2678 #ifdef AOP_WRITEPAGE_TAKES_WRITEBACK_CONTROL
2679 afs_linux_writepage(struct page *pp, struct writeback_control *wbc)
2681 afs_linux_writepage(struct page *pp)
2684 struct address_space *mapping = pp->mapping;
2685 struct inode *inode;
2688 unsigned int to = PAGE_CACHE_SIZE;
2695 inode = mapping->host;
2696 vcp = VTOAFS(inode);
2697 isize = i_size_read(inode);
2699 /* Don't defeat an earlier truncate */
2700 if (page_offset(pp) > isize) {
2701 set_page_writeback(pp);
2707 ObtainWriteLock(&vcp->lock, 537);
2708 code = afs_linux_prepare_writeback(vcp);
2709 if (code == AOP_WRITEPAGE_ACTIVATE) {
2710 /* WRITEPAGE_ACTIVATE is the only return value that permits us
2711 * to return with the page still locked */
2712 ReleaseWriteLock(&vcp->lock);
2717 /* Grab the creds structure currently held in the vnode, and
2718 * get a reference to it, in case it goes away ... */
2724 ReleaseWriteLock(&vcp->lock);
2727 set_page_writeback(pp);
2729 SetPageUptodate(pp);
2731 /* We can unlock the page here, because it's protected by the
2732 * page_writeback flag. This should make us less vulnerable to
2733 * deadlocking in afs_write and afs_DoPartialWrite
2737 /* If this is the final page, then just write the number of bytes that
2738 * are actually in it */
2739 if ((isize - page_offset(pp)) < to )
2740 to = isize - page_offset(pp);
2742 code = afs_linux_page_writeback(inode, pp, 0, to, credp);
2745 ObtainWriteLock(&vcp->lock, 538);
2747 /* As much as we might like to ignore a file server error here,
2748 * and just try again when we close(), unfortunately StoreAllSegments
2749 * will invalidate our chunks if the server returns a permanent error,
2750 * so we need to at least try and get that error back to the user
2753 code1 = afs_linux_dopartialwrite(vcp, credp);
2755 afs_linux_complete_writeback(vcp);
2756 ReleaseWriteLock(&vcp->lock);
2761 end_page_writeback(pp);
2762 page_cache_release(pp);
2773 /* afs_linux_permission
2774 * Check access rights - returns error if can't check or permission denied.
2777 #if defined(IOP_PERMISSION_TAKES_FLAGS)
2778 afs_linux_permission(struct inode *ip, int mode, unsigned int flags)
2779 #elif defined(IOP_PERMISSION_TAKES_NAMEIDATA)
2780 afs_linux_permission(struct inode *ip, int mode, struct nameidata *nd)
2782 afs_linux_permission(struct inode *ip, int mode)
2789 /* Check for RCU path walking */
2790 #if defined(IOP_PERMISSION_TAKES_FLAGS)
2791 if (flags & IPERM_FLAG_RCU)
2793 #elif defined(MAY_NOT_BLOCK)
2794 if (mode & MAY_NOT_BLOCK)
2800 if (mode & MAY_EXEC)
2802 if (mode & MAY_READ)
2804 if (mode & MAY_WRITE)
2806 code = afs_access(VTOAFS(ip), tmp, credp);
2810 return afs_convert_code(code);
2814 afs_linux_commit_write(struct file *file, struct page *page, unsigned offset,
2818 struct inode *inode = FILE_INODE(file);
2819 loff_t pagebase = page_offset(page);
2821 if (i_size_read(inode) < (pagebase + offset))
2822 i_size_write(inode, pagebase + offset);
2824 if (PageChecked(page)) {
2825 SetPageUptodate(page);
2826 ClearPageChecked(page);
2829 code = afs_linux_writepage_sync(inode, page, offset, to - offset);
2835 afs_linux_prepare_write(struct file *file, struct page *page, unsigned from,
2839 /* http://kerneltrap.org/node/4941 details the expected behaviour of
2840 * prepare_write. Essentially, if the page exists within the file,
2841 * and is not being fully written, then we should populate it.
2844 if (!PageUptodate(page)) {
2845 loff_t pagebase = page_offset(page);
2846 loff_t isize = i_size_read(page->mapping->host);
2848 /* Is the location we are writing to beyond the end of the file? */
2849 if (pagebase >= isize ||
2850 ((from == 0) && (pagebase + to) >= isize)) {
2851 zero_user_segments(page, 0, from, to, PAGE_CACHE_SIZE);
2852 SetPageChecked(page);
2853 /* Are we we writing a full page */
2854 } else if (from == 0 && to == PAGE_CACHE_SIZE) {
2855 SetPageChecked(page);
2856 /* Is the page readable, if it's wronly, we don't care, because we're
2857 * not actually going to read from it ... */
2858 } else if ((file->f_flags && O_ACCMODE) != O_WRONLY) {
2859 /* We don't care if fillpage fails, because if it does the page
2860 * won't be marked as up to date
2862 afs_linux_fillpage(file, page);
2868 #if defined(STRUCT_ADDRESS_SPACE_OPERATIONS_HAS_WRITE_BEGIN)
2870 afs_linux_write_end(struct file *file, struct address_space *mapping,
2871 loff_t pos, unsigned len, unsigned copied,
2872 struct page *page, void *fsdata)
2875 unsigned int from = pos & (PAGE_CACHE_SIZE - 1);
2877 code = afs_linux_commit_write(file, page, from, from + len);
2880 page_cache_release(page);
2885 afs_linux_write_begin(struct file *file, struct address_space *mapping,
2886 loff_t pos, unsigned len, unsigned flags,
2887 struct page **pagep, void **fsdata)
2890 pgoff_t index = pos >> PAGE_CACHE_SHIFT;
2891 unsigned int from = pos & (PAGE_CACHE_SIZE - 1);
2894 page = grab_cache_page_write_begin(mapping, index, flags);
2897 code = afs_linux_prepare_write(file, page, from, from + len);
2900 page_cache_release(page);
2907 #ifndef STRUCT_DENTRY_OPERATIONS_HAS_D_AUTOMOUNT
2909 afs_linux_dir_follow_link(struct dentry *dentry, struct nameidata *nd)
2911 struct dentry **dpp;
2912 struct dentry *target;
2914 if (current->total_link_count > 0) {
2915 /* avoid symlink resolution limits when resolving; we cannot contribute to
2916 * an infinite symlink loop */
2917 /* only do this for follow_link when total_link_count is positive to be
2918 * on the safe side; there is at least one code path in the Linux
2919 * kernel where it seems like it may be possible to get here without
2920 * total_link_count getting incremented. it is not clear on how that
2921 * path is actually reached, but guard against it just to be safe */
2922 current->total_link_count--;
2925 target = canonical_dentry(dentry->d_inode);
2927 # ifdef STRUCT_NAMEIDATA_HAS_PATH
2928 dpp = &nd->path.dentry;
2938 *dpp = dget(dentry);
2941 nd->last_type = LAST_BIND;
2945 #endif /* !STRUCT_DENTRY_OPERATIONS_HAS_D_AUTOMOUNT */
2948 static struct inode_operations afs_file_iops = {
2949 .permission = afs_linux_permission,
2950 .getattr = afs_linux_getattr,
2951 .setattr = afs_notify_change,
2954 static struct address_space_operations afs_file_aops = {
2955 .readpage = afs_linux_readpage,
2956 .readpages = afs_linux_readpages,
2957 .writepage = afs_linux_writepage,
2958 #if defined (STRUCT_ADDRESS_SPACE_OPERATIONS_HAS_WRITE_BEGIN)
2959 .write_begin = afs_linux_write_begin,
2960 .write_end = afs_linux_write_end,
2962 .commit_write = afs_linux_commit_write,
2963 .prepare_write = afs_linux_prepare_write,
2968 /* Separate ops vector for directories. Linux 2.2 tests type of inode
2969 * by what sort of operation is allowed.....
2972 static struct inode_operations afs_dir_iops = {
2973 .setattr = afs_notify_change,
2974 .create = afs_linux_create,
2975 .lookup = afs_linux_lookup,
2976 .link = afs_linux_link,
2977 .unlink = afs_linux_unlink,
2978 .symlink = afs_linux_symlink,
2979 .mkdir = afs_linux_mkdir,
2980 .rmdir = afs_linux_rmdir,
2981 .rename = afs_linux_rename,
2982 .getattr = afs_linux_getattr,
2983 .permission = afs_linux_permission,
2984 #ifndef STRUCT_DENTRY_OPERATIONS_HAS_D_AUTOMOUNT
2985 .follow_link = afs_linux_dir_follow_link,
2989 /* We really need a separate symlink set of ops, since do_follow_link()
2990 * determines if it _is_ a link by checking if the follow_link op is set.
2992 #if defined(USABLE_KERNEL_PAGE_SYMLINK_CACHE)
2994 afs_symlink_filler(struct file *file, struct page *page)
2996 struct inode *ip = (struct inode *)page->mapping->host;
2997 char *p = (char *)kmap(page);
3001 code = afs_linux_ireadlink(ip, p, PAGE_SIZE, AFS_UIOSYS);
3006 p[code] = '\0'; /* null terminate? */
3008 SetPageUptodate(page);
3020 static struct address_space_operations afs_symlink_aops = {
3021 .readpage = afs_symlink_filler
3023 #endif /* USABLE_KERNEL_PAGE_SYMLINK_CACHE */
3025 static struct inode_operations afs_symlink_iops = {
3026 #if defined(USABLE_KERNEL_PAGE_SYMLINK_CACHE)
3027 .readlink = page_readlink,
3028 # if defined(HAVE_LINUX_PAGE_FOLLOW_LINK)
3029 .follow_link = page_follow_link,
3031 .follow_link = page_follow_link_light,
3032 .put_link = page_put_link,
3034 #else /* !defined(USABLE_KERNEL_PAGE_SYMLINK_CACHE) */
3035 .readlink = afs_linux_readlink,
3036 .follow_link = afs_linux_follow_link,
3037 .put_link = afs_linux_put_link,
3038 #endif /* USABLE_KERNEL_PAGE_SYMLINK_CACHE */
3039 .setattr = afs_notify_change,
3043 afs_fill_inode(struct inode *ip, struct vattr *vattr)
3047 vattr2inode(ip, vattr);
3049 ip->i_mapping->backing_dev_info = afs_backing_dev_info;
3050 /* Reset ops if symlink or directory. */
3051 if (S_ISREG(ip->i_mode)) {
3052 ip->i_op = &afs_file_iops;
3053 ip->i_fop = &afs_file_fops;
3054 ip->i_data.a_ops = &afs_file_aops;
3056 } else if (S_ISDIR(ip->i_mode)) {
3057 ip->i_op = &afs_dir_iops;
3058 ip->i_fop = &afs_dir_fops;
3060 } else if (S_ISLNK(ip->i_mode)) {
3061 ip->i_op = &afs_symlink_iops;
3062 #if defined(USABLE_KERNEL_PAGE_SYMLINK_CACHE)
3063 ip->i_data.a_ops = &afs_symlink_aops;
3064 ip->i_mapping = &ip->i_data;