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 #if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,34)
51 /* Enable our workaround for a race with d_splice_alias. The race was fixed in
52 * 2.6.34, so don't do it after that point. */
53 # define D_SPLICE_ALIAS_RACE
56 int cachefs_noreadpage = 0;
58 extern struct backing_dev_info *afs_backing_dev_info;
60 extern struct vcache *afs_globalVp;
62 /* This function converts a positive error code from AFS into a negative
63 * code suitable for passing into the Linux VFS layer. It checks that the
64 * error code is within the permissable bounds for the ERR_PTR mechanism.
66 * _All_ error codes which come from the AFS layer should be passed through
67 * this function before being returned to the kernel.
71 afs_convert_code(int code) {
72 if ((code >= 0) && (code <= MAX_ERRNO))
78 /* Linux doesn't require a credp for many functions, and crref is an expensive
79 * operation. This helper function avoids obtaining it for VerifyVCache calls
83 afs_linux_VerifyVCache(struct vcache *avc, cred_t **retcred) {
85 struct vrequest *treq = NULL;
88 if (avc->f.states & CStatd) {
96 code = afs_CreateReq(&treq, credp);
98 code = afs_VerifyVCache2(avc, treq);
107 return afs_convert_code(code);
110 #if defined(STRUCT_FILE_OPERATIONS_HAS_READ_ITER) || defined(HAVE_LINUX_GENERIC_FILE_AIO_READ)
111 # if defined(STRUCT_FILE_OPERATIONS_HAS_READ_ITER)
113 afs_linux_read_iter(struct kiocb *iocb, struct iov_iter *iter)
114 # elif defined(LINUX_HAS_NONVECTOR_AIO)
116 afs_linux_aio_read(struct kiocb *iocb, char __user *buf, size_t bufsize,
120 afs_linux_aio_read(struct kiocb *iocb, const struct iovec *buf,
121 unsigned long bufsize, loff_t pos)
124 struct file *fp = iocb->ki_filp;
126 struct vcache *vcp = VTOAFS(fp->f_dentry->d_inode);
127 # if defined(STRUCT_FILE_OPERATIONS_HAS_READ_ITER)
128 loff_t pos = iocb->ki_pos;
129 unsigned long bufsize = iter->nr_segs;
134 afs_Trace4(afs_iclSetp, CM_TRACE_AIOREADOP, ICL_TYPE_POINTER, vcp,
135 ICL_TYPE_OFFSET, ICL_HANDLE_OFFSET(pos), ICL_TYPE_INT32,
136 (afs_int32)bufsize, ICL_TYPE_INT32, 99999);
137 code = afs_linux_VerifyVCache(vcp, NULL);
140 /* Linux's FlushPages implementation doesn't ever use credp,
141 * so we optimise by not using it */
142 osi_FlushPages(vcp, NULL); /* ensure stale pages are gone */
144 # if defined(STRUCT_FILE_OPERATIONS_HAS_READ_ITER)
145 code = generic_file_read_iter(iocb, iter);
147 code = generic_file_aio_read(iocb, buf, bufsize, pos);
152 afs_Trace4(afs_iclSetp, CM_TRACE_AIOREADOP, ICL_TYPE_POINTER, vcp,
153 ICL_TYPE_OFFSET, ICL_HANDLE_OFFSET(pos), ICL_TYPE_INT32,
154 (afs_int32)bufsize, ICL_TYPE_INT32, code);
160 afs_linux_read(struct file *fp, char *buf, size_t count, loff_t * offp)
163 struct vcache *vcp = VTOAFS(fp->f_dentry->d_inode);
166 afs_Trace4(afs_iclSetp, CM_TRACE_READOP, ICL_TYPE_POINTER, vcp,
167 ICL_TYPE_OFFSET, offp, ICL_TYPE_INT32, count, ICL_TYPE_INT32,
169 code = afs_linux_VerifyVCache(vcp, NULL);
172 /* Linux's FlushPages implementation doesn't ever use credp,
173 * so we optimise by not using it */
174 osi_FlushPages(vcp, NULL); /* ensure stale pages are gone */
176 code = do_sync_read(fp, buf, count, offp);
180 afs_Trace4(afs_iclSetp, CM_TRACE_READOP, ICL_TYPE_POINTER, vcp,
181 ICL_TYPE_OFFSET, offp, ICL_TYPE_INT32, count, ICL_TYPE_INT32,
189 /* Now we have integrated VM for writes as well as reads. the generic write operations
190 * also take care of re-positioning the pointer if file is open in append
191 * mode. Call fake open/close to ensure we do writes of core dumps.
193 #if defined(STRUCT_FILE_OPERATIONS_HAS_READ_ITER) || defined(HAVE_LINUX_GENERIC_FILE_AIO_READ)
194 # if defined(STRUCT_FILE_OPERATIONS_HAS_READ_ITER)
196 afs_linux_write_iter(struct kiocb *iocb, struct iov_iter *iter)
197 # elif defined(LINUX_HAS_NONVECTOR_AIO)
199 afs_linux_aio_write(struct kiocb *iocb, const char __user *buf, size_t bufsize,
203 afs_linux_aio_write(struct kiocb *iocb, const struct iovec *buf,
204 unsigned long bufsize, loff_t pos)
208 struct vcache *vcp = VTOAFS(iocb->ki_filp->f_dentry->d_inode);
210 # if defined(STRUCT_FILE_OPERATIONS_HAS_READ_ITER)
211 loff_t pos = iocb->ki_pos;
212 unsigned long bufsize = iter->nr_segs;
217 afs_Trace4(afs_iclSetp, CM_TRACE_AIOWRITEOP, ICL_TYPE_POINTER, vcp,
218 ICL_TYPE_OFFSET, ICL_HANDLE_OFFSET(pos), ICL_TYPE_INT32,
219 (afs_int32)bufsize, ICL_TYPE_INT32,
220 (iocb->ki_filp->f_flags & O_APPEND) ? 99998 : 99999);
222 code = afs_linux_VerifyVCache(vcp, &credp);
224 ObtainWriteLock(&vcp->lock, 529);
226 ReleaseWriteLock(&vcp->lock);
229 # if defined(STRUCT_FILE_OPERATIONS_HAS_READ_ITER)
230 code = generic_file_write_iter(iocb, iter);
232 code = generic_file_aio_write(iocb, buf, bufsize, pos);
237 ObtainWriteLock(&vcp->lock, 530);
239 if (vcp->execsOrWriters == 1 && !credp)
242 afs_FakeClose(vcp, credp);
243 ReleaseWriteLock(&vcp->lock);
245 afs_Trace4(afs_iclSetp, CM_TRACE_AIOWRITEOP, ICL_TYPE_POINTER, vcp,
246 ICL_TYPE_OFFSET, ICL_HANDLE_OFFSET(pos), ICL_TYPE_INT32,
247 (afs_int32)bufsize, ICL_TYPE_INT32, code);
256 afs_linux_write(struct file *fp, const char *buf, size_t count, loff_t * offp)
259 struct vcache *vcp = VTOAFS(fp->f_dentry->d_inode);
264 afs_Trace4(afs_iclSetp, CM_TRACE_WRITEOP, ICL_TYPE_POINTER, vcp,
265 ICL_TYPE_OFFSET, offp, ICL_TYPE_INT32, count, ICL_TYPE_INT32,
266 (fp->f_flags & O_APPEND) ? 99998 : 99999);
268 code = afs_linux_VerifyVCache(vcp, &credp);
270 ObtainWriteLock(&vcp->lock, 529);
272 ReleaseWriteLock(&vcp->lock);
275 code = do_sync_write(fp, buf, count, offp);
279 ObtainWriteLock(&vcp->lock, 530);
281 if (vcp->execsOrWriters == 1 && !credp)
284 afs_FakeClose(vcp, credp);
285 ReleaseWriteLock(&vcp->lock);
287 afs_Trace4(afs_iclSetp, CM_TRACE_WRITEOP, ICL_TYPE_POINTER, vcp,
288 ICL_TYPE_OFFSET, offp, ICL_TYPE_INT32, count, ICL_TYPE_INT32,
298 extern int BlobScan(struct dcache * afile, afs_int32 ablob, afs_int32 *ablobOut);
300 /* This is a complete rewrite of afs_readdir, since we can make use of
301 * filldir instead of afs_readdir_move. Note that changes to vcache/dcache
302 * handling and use of bulkstats will need to be reflected here as well.
305 #if defined(STRUCT_FILE_OPERATIONS_HAS_ITERATE)
306 afs_linux_readdir(struct file *fp, struct dir_context *ctx)
308 afs_linux_readdir(struct file *fp, void *dirbuf, filldir_t filldir)
311 struct vcache *avc = VTOAFS(FILE_INODE(fp));
312 struct vrequest *treq = NULL;
318 struct DirBuffer entry;
321 afs_size_t origOffset, tlen;
322 cred_t *credp = crref();
323 struct afs_fakestat_state fakestat;
326 AFS_STATCNT(afs_readdir);
328 code = afs_convert_code(afs_CreateReq(&treq, credp));
333 afs_InitFakeStat(&fakestat);
334 code = afs_convert_code(afs_EvalFakeStat(&avc, &fakestat, treq));
338 /* update the cache entry */
340 code = afs_convert_code(afs_VerifyVCache2(avc, treq));
344 /* get a reference to the entire directory */
345 tdc = afs_GetDCache(avc, (afs_size_t) 0, treq, &origOffset, &tlen, 1);
351 ObtainWriteLock(&avc->lock, 811);
352 ObtainReadLock(&tdc->lock);
354 * Make sure that the data in the cache is current. There are two
355 * cases we need to worry about:
356 * 1. The cache data is being fetched by another process.
357 * 2. The cache data is no longer valid
359 while ((avc->f.states & CStatd)
360 && (tdc->dflags & DFFetching)
361 && hsame(avc->f.m.DataVersion, tdc->f.versionNo)) {
362 ReleaseReadLock(&tdc->lock);
363 ReleaseWriteLock(&avc->lock);
364 afs_osi_Sleep(&tdc->validPos);
365 ObtainWriteLock(&avc->lock, 812);
366 ObtainReadLock(&tdc->lock);
368 if (!(avc->f.states & CStatd)
369 || !hsame(avc->f.m.DataVersion, tdc->f.versionNo)) {
370 ReleaseReadLock(&tdc->lock);
371 ReleaseWriteLock(&avc->lock);
376 /* Set the readdir-in-progress flag, and downgrade the lock
377 * to shared so others will be able to acquire a read lock.
379 avc->f.states |= CReadDir;
380 avc->dcreaddir = tdc;
381 avc->readdir_pid = MyPidxx2Pid(MyPidxx);
382 ConvertWToSLock(&avc->lock);
384 /* Fill in until we get an error or we're done. This implementation
385 * takes an offset in units of blobs, rather than bytes.
388 #if defined(STRUCT_FILE_OPERATIONS_HAS_ITERATE)
391 offset = (int) fp->f_pos;
394 code = BlobScan(tdc, offset, &dirpos);
398 code = afs_dir_GetVerifiedBlob(tdc, dirpos, &entry);
400 if (!(avc->f.states & CCorrupt)) {
401 struct cell *tc = afs_GetCellStale(avc->f.fid.Cell, READ_LOCK);
402 afs_warn("afs: Corrupt directory (%d.%d.%d.%d [%s] @%lx, pos %d)\n",
403 avc->f.fid.Cell, avc->f.fid.Fid.Volume,
404 avc->f.fid.Fid.Vnode, avc->f.fid.Fid.Unique,
405 tc ? tc->cellName : "",
406 (unsigned long)&tdc->f.inode, dirpos);
408 afs_PutCell(tc, READ_LOCK);
409 UpgradeSToWLock(&avc->lock, 814);
410 avc->f.states |= CCorrupt;
416 de = (struct DirEntry *)entry.data;
417 ino = afs_calc_inum (avc->f.fid.Cell, avc->f.fid.Fid.Volume,
418 ntohl(de->fid.vnode));
419 len = strlen(de->name);
421 /* filldir returns -EINVAL when the buffer is full. */
423 unsigned int type = DT_UNKNOWN;
424 struct VenusFid afid;
427 afid.Cell = avc->f.fid.Cell;
428 afid.Fid.Volume = avc->f.fid.Fid.Volume;
429 afid.Fid.Vnode = ntohl(de->fid.vnode);
430 afid.Fid.Unique = ntohl(de->fid.vunique);
431 if ((avc->f.states & CForeign) == 0 && (ntohl(de->fid.vnode) & 1)) {
433 } else if ((tvc = afs_FindVCache(&afid, 0, 0))) {
434 if (tvc->mvstat != AFS_MVSTAT_FILE) {
436 } else if (((tvc->f.states) & (CStatd | CTruth))) {
437 /* CTruth will be set if the object has
442 else if (vtype == VREG)
444 /* Don't do this until we're sure it can't be a mtpt */
445 /* else if (vtype == VLNK)
447 /* what other types does AFS support? */
449 /* clean up from afs_FindVCache */
453 * If this is NFS readdirplus, then the filler is going to
454 * call getattr on this inode, which will deadlock if we're
458 #if defined(STRUCT_FILE_OPERATIONS_HAS_ITERATE)
459 /* dir_emit returns a bool - true when it succeeds.
460 * Inverse the result to fit with how we check "code" */
461 code = !dir_emit(ctx, de->name, len, ino, type);
463 code = (*filldir) (dirbuf, de->name, len, offset, ino, type);
470 offset = dirpos + 1 + ((len + 16) >> 5);
472 /* If filldir didn't fill in the last one this is still pointing to that
478 #if defined(STRUCT_FILE_OPERATIONS_HAS_ITERATE)
479 ctx->pos = (loff_t) offset;
481 fp->f_pos = (loff_t) offset;
483 ReleaseReadLock(&tdc->lock);
485 UpgradeSToWLock(&avc->lock, 813);
486 avc->f.states &= ~CReadDir;
488 avc->readdir_pid = 0;
489 ReleaseSharedLock(&avc->lock);
492 afs_PutFakeStat(&fakestat);
493 afs_DestroyReq(treq);
500 /* in afs_pioctl.c */
501 extern int afs_xioctl(struct inode *ip, struct file *fp, unsigned int com,
504 #if defined(HAVE_UNLOCKED_IOCTL) || defined(HAVE_COMPAT_IOCTL)
505 static long afs_unlocked_xioctl(struct file *fp, unsigned int com,
507 return afs_xioctl(FILE_INODE(fp), fp, com, arg);
514 afs_linux_mmap(struct file *fp, struct vm_area_struct *vmap)
516 struct vcache *vcp = VTOAFS(FILE_INODE(fp));
520 afs_Trace3(afs_iclSetp, CM_TRACE_GMAP, ICL_TYPE_POINTER, vcp,
521 ICL_TYPE_POINTER, vmap->vm_start, ICL_TYPE_INT32,
522 vmap->vm_end - vmap->vm_start);
524 /* get a validated vcache entry */
525 code = afs_linux_VerifyVCache(vcp, NULL);
528 /* Linux's Flushpage implementation doesn't use credp, so optimise
529 * our code to not need to crref() it */
530 osi_FlushPages(vcp, NULL); /* ensure stale pages are gone */
532 code = generic_file_mmap(fp, vmap);
535 vcp->f.states |= CMAPPED;
543 afs_linux_open(struct inode *ip, struct file *fp)
545 struct vcache *vcp = VTOAFS(ip);
546 cred_t *credp = crref();
550 code = afs_open(&vcp, fp->f_flags, credp);
554 return afs_convert_code(code);
558 afs_linux_release(struct inode *ip, struct file *fp)
560 struct vcache *vcp = VTOAFS(ip);
561 cred_t *credp = crref();
565 code = afs_close(vcp, fp->f_flags, credp);
566 ObtainWriteLock(&vcp->lock, 807);
571 ReleaseWriteLock(&vcp->lock);
575 return afs_convert_code(code);
579 #if defined(FOP_FSYNC_TAKES_DENTRY)
580 afs_linux_fsync(struct file *fp, struct dentry *dp, int datasync)
581 #elif defined(FOP_FSYNC_TAKES_RANGE)
582 afs_linux_fsync(struct file *fp, loff_t start, loff_t end, int datasync)
584 afs_linux_fsync(struct file *fp, int datasync)
588 struct inode *ip = FILE_INODE(fp);
589 cred_t *credp = crref();
591 #if defined(FOP_FSYNC_TAKES_RANGE)
592 afs_linux_lock_inode(ip);
595 code = afs_fsync(VTOAFS(ip), credp);
597 #if defined(FOP_FSYNC_TAKES_RANGE)
598 afs_linux_unlock_inode(ip);
601 return afs_convert_code(code);
607 afs_linux_lock(struct file *fp, int cmd, struct file_lock *flp)
610 struct vcache *vcp = VTOAFS(FILE_INODE(fp));
611 cred_t *credp = crref();
612 struct AFS_FLOCK flock;
614 /* Convert to a lock format afs_lockctl understands. */
615 memset(&flock, 0, sizeof(flock));
616 flock.l_type = flp->fl_type;
617 flock.l_pid = flp->fl_pid;
619 flock.l_start = flp->fl_start;
620 if (flp->fl_end == OFFSET_MAX)
621 flock.l_len = 0; /* Lock to end of file */
623 flock.l_len = flp->fl_end - flp->fl_start + 1;
625 /* Safe because there are no large files, yet */
626 #if defined(F_GETLK64) && (F_GETLK != F_GETLK64)
627 if (cmd == F_GETLK64)
629 else if (cmd == F_SETLK64)
631 else if (cmd == F_SETLKW64)
633 #endif /* F_GETLK64 && F_GETLK != F_GETLK64 */
636 code = afs_convert_code(afs_lockctl(vcp, &flock, cmd, credp));
639 if ((code == 0 || flp->fl_type == F_UNLCK) &&
640 (cmd == F_SETLK || cmd == F_SETLKW)) {
641 code = afs_posix_lock_file(fp, flp);
642 if (code && flp->fl_type != F_UNLCK) {
643 struct AFS_FLOCK flock2;
645 flock2.l_type = F_UNLCK;
647 afs_lockctl(vcp, &flock2, F_SETLK, credp);
651 /* If lockctl says there are no conflicting locks, then also check with the
652 * kernel, as lockctl knows nothing about byte range locks
654 if (code == 0 && cmd == F_GETLK && flock.l_type == F_UNLCK) {
655 afs_posix_test_lock(fp, flp);
656 /* If we found a lock in the kernel's structure, return it */
657 if (flp->fl_type != F_UNLCK) {
663 /* Convert flock back to Linux's file_lock */
664 flp->fl_type = flock.l_type;
665 flp->fl_pid = flock.l_pid;
666 flp->fl_start = flock.l_start;
667 if (flock.l_len == 0)
668 flp->fl_end = OFFSET_MAX; /* Lock to end of file */
670 flp->fl_end = flock.l_start + flock.l_len - 1;
676 #ifdef STRUCT_FILE_OPERATIONS_HAS_FLOCK
678 afs_linux_flock(struct file *fp, int cmd, struct file_lock *flp) {
680 struct vcache *vcp = VTOAFS(FILE_INODE(fp));
681 cred_t *credp = crref();
682 struct AFS_FLOCK flock;
683 /* Convert to a lock format afs_lockctl understands. */
684 memset(&flock, 0, sizeof(flock));
685 flock.l_type = flp->fl_type;
686 flock.l_pid = flp->fl_pid;
691 /* Safe because there are no large files, yet */
692 #if defined(F_GETLK64) && (F_GETLK != F_GETLK64)
693 if (cmd == F_GETLK64)
695 else if (cmd == F_SETLK64)
697 else if (cmd == F_SETLKW64)
699 #endif /* F_GETLK64 && F_GETLK != F_GETLK64 */
702 code = afs_convert_code(afs_lockctl(vcp, &flock, cmd, credp));
705 if ((code == 0 || flp->fl_type == F_UNLCK) &&
706 (cmd == F_SETLK || cmd == F_SETLKW)) {
707 flp->fl_flags &=~ FL_SLEEP;
708 code = flock_lock_file_wait(fp, flp);
709 if (code && flp->fl_type != F_UNLCK) {
710 struct AFS_FLOCK flock2;
712 flock2.l_type = F_UNLCK;
714 afs_lockctl(vcp, &flock2, F_SETLK, credp);
718 /* Convert flock back to Linux's file_lock */
719 flp->fl_type = flock.l_type;
720 flp->fl_pid = flock.l_pid;
728 * essentially the same as afs_fsync() but we need to get the return
729 * code for the sys_close() here, not afs_linux_release(), so call
730 * afs_StoreAllSegments() with AFS_LASTSTORE
733 #if defined(FOP_FLUSH_TAKES_FL_OWNER_T)
734 afs_linux_flush(struct file *fp, fl_owner_t id)
736 afs_linux_flush(struct file *fp)
739 struct vrequest *treq = NULL;
747 if ((fp->f_flags & O_ACCMODE) == O_RDONLY) { /* readers dont flush */
755 vcp = VTOAFS(FILE_INODE(fp));
757 code = afs_CreateReq(&treq, credp);
760 /* If caching is bypassed for this file, or globally, just return 0 */
761 if (cache_bypass_strategy == ALWAYS_BYPASS_CACHE)
764 ObtainReadLock(&vcp->lock);
765 if (vcp->cachingStates & FCSBypass)
767 ReleaseReadLock(&vcp->lock);
770 /* future proof: don't rely on 0 return from afs_InitReq */
775 ObtainSharedLock(&vcp->lock, 535);
776 if ((vcp->execsOrWriters > 0) && (file_count(fp) == 1)) {
777 UpgradeSToWLock(&vcp->lock, 536);
778 if (!AFS_IS_DISCONNECTED) {
779 code = afs_StoreAllSegments(vcp,
781 AFS_SYNC | AFS_LASTSTORE);
783 afs_DisconAddDirty(vcp, VDisconWriteOsiFlush, 1);
785 ConvertWToSLock(&vcp->lock);
787 code = afs_CheckCode(code, treq, 54);
788 ReleaseSharedLock(&vcp->lock);
791 afs_DestroyReq(treq);
796 return afs_convert_code(code);
799 struct file_operations afs_dir_fops = {
800 .read = generic_read_dir,
801 #if defined(STRUCT_FILE_OPERATIONS_HAS_ITERATE)
802 .iterate = afs_linux_readdir,
804 .readdir = afs_linux_readdir,
806 #ifdef HAVE_UNLOCKED_IOCTL
807 .unlocked_ioctl = afs_unlocked_xioctl,
811 #ifdef HAVE_COMPAT_IOCTL
812 .compat_ioctl = afs_unlocked_xioctl,
814 .open = afs_linux_open,
815 .release = afs_linux_release,
816 .llseek = default_llseek,
817 #ifdef HAVE_LINUX_NOOP_FSYNC
820 .fsync = simple_sync_file,
824 struct file_operations afs_file_fops = {
825 #ifdef STRUCT_FILE_OPERATIONS_HAS_READ_ITER
826 .read_iter = afs_linux_read_iter,
827 .write_iter = afs_linux_write_iter,
828 # if !defined(HAVE_LINUX___VFS_WRITE) && !defined(HAVE_LINUX_KERNEL_WRITE)
829 .read = new_sync_read,
830 .write = new_sync_write,
832 #elif defined(HAVE_LINUX_GENERIC_FILE_AIO_READ)
833 .aio_read = afs_linux_aio_read,
834 .aio_write = afs_linux_aio_write,
835 .read = do_sync_read,
836 .write = do_sync_write,
838 .read = afs_linux_read,
839 .write = afs_linux_write,
841 #ifdef HAVE_UNLOCKED_IOCTL
842 .unlocked_ioctl = afs_unlocked_xioctl,
846 #ifdef HAVE_COMPAT_IOCTL
847 .compat_ioctl = afs_unlocked_xioctl,
849 .mmap = afs_linux_mmap,
850 .open = afs_linux_open,
851 .flush = afs_linux_flush,
852 #if defined(STRUCT_FILE_OPERATIONS_HAS_SENDFILE)
853 .sendfile = generic_file_sendfile,
855 #if defined(STRUCT_FILE_OPERATIONS_HAS_SPLICE) && !defined(HAVE_LINUX_DEFAULT_FILE_SPLICE_READ)
856 # if defined(HAVE_LINUX_ITER_FILE_SPLICE_WRITE)
857 .splice_write = iter_file_splice_write,
859 .splice_write = generic_file_splice_write,
861 .splice_read = generic_file_splice_read,
863 .release = afs_linux_release,
864 .fsync = afs_linux_fsync,
865 .lock = afs_linux_lock,
866 #ifdef STRUCT_FILE_OPERATIONS_HAS_FLOCK
867 .flock = afs_linux_flock,
869 .llseek = default_llseek,
872 static struct dentry *
873 canonical_dentry(struct inode *ip)
875 struct vcache *vcp = VTOAFS(ip);
876 struct dentry *first = NULL, *ret = NULL, *cur;
877 #if defined(D_ALIAS_IS_HLIST) && !defined(HLIST_ITERATOR_NO_NODE)
878 struct hlist_node *p;
882 * if vcp->target_link is set, and can be found in ip->i_dentry, use that.
883 * otherwise, use the first dentry in ip->i_dentry.
884 * if ip->i_dentry is empty, use the 'dentry' argument we were given.
886 /* note that vcp->target_link specifies which dentry to use, but we have
887 * no reference held on that dentry. so, we cannot use or dereference
888 * vcp->target_link itself, since it may have been freed. instead, we only
889 * use it to compare to pointers in the ip->i_dentry list. */
893 afs_d_alias_lock(ip);
895 #if defined(D_ALIAS_IS_HLIST)
896 # if defined(HLIST_ITERATOR_NO_NODE)
897 hlist_for_each_entry(cur, &ip->i_dentry, d_alias) {
899 hlist_for_each_entry(cur, p, &ip->i_dentry, d_alias) {
902 list_for_each_entry_reverse(cur, &ip->i_dentry, d_alias) {
905 if (!vcp->target_link || cur == vcp->target_link) {
918 vcp->target_link = ret;
920 # ifdef HAVE_DCACHE_LOCK
924 afs_d_alias_unlock(ip);
929 afs_d_alias_unlock(ip);
935 /**********************************************************************
936 * AFS Linux dentry operations
937 **********************************************************************/
939 /* afs_linux_revalidate
940 * Ensure vcache is stat'd before use. Return 0 if entry is valid.
943 afs_linux_revalidate(struct dentry *dp)
945 struct vattr *vattr = NULL;
946 struct vcache *vcp = VTOAFS(dp->d_inode);
950 if (afs_shuttingdown != AFS_RUNNING)
955 code = afs_CreateAttr(&vattr);
960 /* This avoids the crref when we don't have to do it. Watch for
961 * changes in afs_getattr that don't get replicated here!
963 if (vcp->f.states & CStatd &&
964 (!afs_fakestat_enable || vcp->mvstat != AFS_MVSTAT_MTPT) &&
966 (vType(vcp) == VDIR || vType(vcp) == VLNK)) {
967 code = afs_CopyOutAttrs(vcp, vattr);
970 code = afs_getattr(vcp, vattr, credp);
975 afs_fill_inode(AFSTOV(vcp), vattr);
977 afs_DestroyAttr(vattr);
982 return afs_convert_code(code);
986 * Set iattr data into vattr. Assume vattr cleared before call.
989 iattr2vattr(struct vattr *vattrp, struct iattr *iattrp)
991 vattrp->va_mask = iattrp->ia_valid;
992 if (iattrp->ia_valid & ATTR_MODE)
993 vattrp->va_mode = iattrp->ia_mode;
994 if (iattrp->ia_valid & ATTR_UID)
995 vattrp->va_uid = afs_from_kuid(iattrp->ia_uid);
996 if (iattrp->ia_valid & ATTR_GID)
997 vattrp->va_gid = afs_from_kgid(iattrp->ia_gid);
998 if (iattrp->ia_valid & ATTR_SIZE)
999 vattrp->va_size = iattrp->ia_size;
1000 if (iattrp->ia_valid & ATTR_ATIME) {
1001 vattrp->va_atime.tv_sec = iattrp->ia_atime.tv_sec;
1002 vattrp->va_atime.tv_usec = 0;
1004 if (iattrp->ia_valid & ATTR_MTIME) {
1005 vattrp->va_mtime.tv_sec = iattrp->ia_mtime.tv_sec;
1006 vattrp->va_mtime.tv_usec = 0;
1008 if (iattrp->ia_valid & ATTR_CTIME) {
1009 vattrp->va_ctime.tv_sec = iattrp->ia_ctime.tv_sec;
1010 vattrp->va_ctime.tv_usec = 0;
1015 * Rewrite the inode cache from the attr. Assumes all vattr fields are valid.
1018 vattr2inode(struct inode *ip, struct vattr *vp)
1020 ip->i_ino = vp->va_nodeid;
1021 #ifdef HAVE_LINUX_SET_NLINK
1022 set_nlink(ip, vp->va_nlink);
1024 ip->i_nlink = vp->va_nlink;
1026 ip->i_blocks = vp->va_blocks;
1027 #ifdef STRUCT_INODE_HAS_I_BLKBITS
1028 ip->i_blkbits = AFS_BLKBITS;
1030 #ifdef STRUCT_INODE_HAS_I_BLKSIZE
1031 ip->i_blksize = vp->va_blocksize;
1033 ip->i_rdev = vp->va_rdev;
1034 ip->i_mode = vp->va_mode;
1035 ip->i_uid = afs_make_kuid(vp->va_uid);
1036 ip->i_gid = afs_make_kgid(vp->va_gid);
1037 i_size_write(ip, vp->va_size);
1038 ip->i_atime.tv_sec = vp->va_atime.tv_sec;
1039 ip->i_atime.tv_nsec = 0;
1040 ip->i_mtime.tv_sec = vp->va_mtime.tv_sec;
1041 /* Set the mtime nanoseconds to the sysname generation number.
1042 * This convinces NFS clients that all directories have changed
1043 * any time the sysname list changes.
1045 ip->i_mtime.tv_nsec = afs_sysnamegen;
1046 ip->i_ctime.tv_sec = vp->va_ctime.tv_sec;
1047 ip->i_ctime.tv_nsec = 0;
1050 /* afs_notify_change
1051 * Linux version of setattr call. What to change is in the iattr struct.
1052 * We need to set bits in both the Linux inode as well as the vcache.
1055 afs_notify_change(struct dentry *dp, struct iattr *iattrp)
1057 struct vattr *vattr = NULL;
1058 cred_t *credp = crref();
1059 struct inode *ip = dp->d_inode;
1063 code = afs_CreateAttr(&vattr);
1068 iattr2vattr(vattr, iattrp); /* Convert for AFS vnodeops call. */
1070 code = afs_setattr(VTOAFS(ip), vattr, credp);
1072 afs_getattr(VTOAFS(ip), vattr, credp);
1073 vattr2inode(ip, vattr);
1075 afs_DestroyAttr(vattr);
1080 return afs_convert_code(code);
1083 #if defined(IOP_GETATTR_TAKES_PATH_STRUCT)
1085 afs_linux_getattr(const struct path *path, struct kstat *stat, u32 request_mask, unsigned int sync_mode)
1087 int err = afs_linux_revalidate(path->dentry);
1089 generic_fillattr(path->dentry->d_inode, stat);
1095 afs_linux_getattr(struct vfsmount *mnt, struct dentry *dentry, struct kstat *stat)
1097 int err = afs_linux_revalidate(dentry);
1099 generic_fillattr(dentry->d_inode, stat);
1106 parent_vcache_dv(struct inode *inode, cred_t *credp)
1109 struct vcache *pvcp;
1112 * If parent is a mount point and we are using fakestat, we may need
1113 * to look at the fake vcache entry instead of what the vfs is giving
1114 * us. The fake entry is the one with the useful DataVersion.
1116 pvcp = VTOAFS(inode);
1117 if (pvcp->mvstat == AFS_MVSTAT_MTPT && afs_fakestat_enable) {
1118 struct vrequest treq;
1119 struct afs_fakestat_state fakestate;
1125 afs_InitReq(&treq, credp);
1126 afs_InitFakeStat(&fakestate);
1127 afs_TryEvalFakeStat(&pvcp, &fakestate, &treq);
1130 afs_PutFakeStat(&fakestate);
1132 return hgetlo(pvcp->f.m.DataVersion);
1135 #ifdef D_SPLICE_ALIAS_RACE
1136 /* Leave some trace that this code is enabled; otherwise it's pretty hard to
1138 static __attribute__((used)) const char dentry_race_marker[] = "d_splice_alias race workaround enabled";
1141 check_dentry_race(struct dentry *dp)
1145 struct dentry *parent = dget_parent(dp);
1147 /* In Linux, before commit 4919c5e45a91b5db5a41695fe0357fbdff0d5767,
1148 * d_splice_alias can momentarily hash a dentry before it's fully
1149 * populated. This only happens for a moment, since it's unhashed again
1150 * right after (in d_move), but this can make the dentry be found by
1151 * __d_lookup, and then given to us.
1153 * So check if the dentry is unhashed; if it is, then the dentry is not
1154 * valid. We lock the parent inode to ensure that d_splice_alias is no
1155 * longer running (the inode mutex will be held during
1156 * afs_linux_lookup). Locking d_lock is required to check the dentry's
1157 * flags, so lock that, too.
1159 afs_linux_lock_inode(parent->d_inode);
1160 spin_lock(&dp->d_lock);
1161 if (d_unhashed(dp)) {
1164 spin_unlock(&dp->d_lock);
1165 afs_linux_unlock_inode(parent->d_inode);
1171 #endif /* D_SPLICE_ALIAS_RACE */
1173 /* Validate a dentry. Return 1 if unchanged, 0 if VFS layer should re-evaluate.
1174 * In kernels 2.2.10 and above, we are passed an additional flags var which
1175 * may have either the LOOKUP_FOLLOW OR LOOKUP_DIRECTORY set in which case
1176 * we are advised to follow the entry if it is a link or to make sure that
1177 * it is a directory. But since the kernel itself checks these possibilities
1178 * later on, we shouldn't have to do it until later. Perhaps in the future..
1180 * The code here assumes that on entry the global lock is not held
1183 #if defined(DOP_REVALIDATE_TAKES_UNSIGNED)
1184 afs_linux_dentry_revalidate(struct dentry *dp, unsigned int flags)
1185 #elif defined(DOP_REVALIDATE_TAKES_NAMEIDATA)
1186 afs_linux_dentry_revalidate(struct dentry *dp, struct nameidata *nd)
1188 afs_linux_dentry_revalidate(struct dentry *dp, int flags)
1191 cred_t *credp = NULL;
1192 struct vcache *vcp, *pvcp, *tvc = NULL;
1193 struct dentry *parent;
1195 struct afs_fakestat_state fakestate;
1197 afs_uint32 parent_dv;
1200 /* We don't support RCU path walking */
1201 # if defined(DOP_REVALIDATE_TAKES_UNSIGNED)
1202 if (flags & LOOKUP_RCU)
1204 if (nd->flags & LOOKUP_RCU)
1209 #ifdef D_SPLICE_ALIAS_RACE
1210 if (check_dentry_race(dp)) {
1217 afs_InitFakeStat(&fakestate);
1220 vcp = VTOAFS(dp->d_inode);
1222 if (vcp == afs_globalVp)
1225 if (vcp->mvstat == AFS_MVSTAT_MTPT) {
1226 if (vcp->mvid.target_root && (vcp->f.states & CMValid)) {
1227 int tryEvalOnly = 0;
1229 struct vrequest *treq = NULL;
1233 code = afs_CreateReq(&treq, credp);
1237 if ((strcmp(dp->d_name.name, ".directory") == 0)) {
1241 code = afs_TryEvalFakeStat(&vcp, &fakestate, treq);
1243 code = afs_EvalFakeStat(&vcp, &fakestate, treq);
1244 afs_DestroyReq(treq);
1245 if ((tryEvalOnly && vcp->mvstat == AFS_MVSTAT_MTPT) || code) {
1246 /* a mount point, not yet replaced by its directory */
1250 } else if (vcp->mvstat == AFS_MVSTAT_ROOT && *dp->d_name.name != '/') {
1251 osi_Assert(vcp->mvid.parent != NULL);
1255 /* If the last looker changes, we should make sure the current
1256 * looker still has permission to examine this file. This would
1257 * always require a crref() which would be "slow".
1259 if (vcp->last_looker != treq.uid) {
1260 if (!afs_AccessOK(vcp, (vType(vcp) == VREG) ? PRSFS_READ : PRSFS_LOOKUP, &treq, CHECK_MODE_BITS)) {
1264 vcp->last_looker = treq.uid;
1268 parent = dget_parent(dp);
1269 pvcp = VTOAFS(parent->d_inode);
1270 parent_dv = parent_vcache_dv(parent->d_inode, credp);
1272 /* If the parent's DataVersion has changed or the vnode
1273 * is longer valid, we need to do a full lookup. VerifyVCache
1274 * isn't enough since the vnode may have been renamed.
1277 if (parent_dv > dp->d_time || !(vcp->f.states & CStatd)) {
1278 struct vattr *vattr = NULL;
1282 if (credp == NULL) {
1285 code = afs_lookup(pvcp, (char *)dp->d_name.name, &tvc, credp);
1288 /* We couldn't perform the lookup, so we're not okay. */
1291 } else if (tvc == vcp) {
1292 /* We got back the same vcache, so we're good. */
1295 } else if (tvc == VTOAFS(dp->d_inode)) {
1296 /* We got back the same vcache, so we're good. This is
1297 * different from the above case, because sometimes 'vcp' is
1298 * not the same as the vcache for dp->d_inode, if 'vcp' was a
1299 * mtpt and we evaluated it to a root dir. In rare cases,
1300 * afs_lookup might not evalute the mtpt when we do, or vice
1301 * versa, so the previous case will not succeed. But this is
1302 * still 'correct', so make sure not to mark the dentry as
1303 * invalid; it still points to the same thing! */
1307 /* We got back a different file, so we're definitely not
1314 /* Force unhash; the name doesn't point to this file
1317 if (code && code != ENOENT) {
1318 /* ...except if we couldn't perform the actual lookup,
1319 * we don't know if the name points to this file or not. */
1325 code = afs_CreateAttr(&vattr);
1331 if (afs_getattr(vcp, vattr, credp)) {
1333 afs_DestroyAttr(vattr);
1337 vattr2inode(AFSTOV(vcp), vattr);
1338 dp->d_time = parent_dv;
1340 afs_DestroyAttr(vattr);
1343 /* should we always update the attributes at this point? */
1344 /* unlikely--the vcache entry hasn't changed */
1350 /* 'dp' represents a cached negative lookup. */
1352 parent = dget_parent(dp);
1353 pvcp = VTOAFS(parent->d_inode);
1354 parent_dv = parent_vcache_dv(parent->d_inode, credp);
1356 if (parent_dv > dp->d_time || !(pvcp->f.states & CStatd)
1357 || afs_IsDynroot(pvcp)) {
1371 #ifndef D_INVALIDATE_IS_VOID
1372 /* When (v3.18) d_invalidate was converted to void, it also started
1373 * being called automatically from revalidate, and automatically
1375 * - shrink_dcache_parent
1376 * - automatic detach of submounts
1378 * Therefore, after that point, OpenAFS revalidate logic no longer needs
1379 * to do any of those things itself for invalid dentry structs. We only need
1380 * to tell VFS it's invalid (by returning 0), and VFS will handle the rest.
1382 if (have_submounts(dp))
1390 afs_PutFakeStat(&fakestate);
1395 #ifndef D_INVALIDATE_IS_VOID
1398 * If we had a negative lookup for the name we want to forcibly
1399 * unhash the dentry.
1400 * Otherwise use d_invalidate which will not unhash it if still in use.
1403 shrink_dcache_parent(dp);
1414 afs_dentry_iput(struct dentry *dp, struct inode *ip)
1416 struct vcache *vcp = VTOAFS(ip);
1419 if (!AFS_IS_DISCONNECTED || (vcp->f.states & CUnlinked)) {
1420 (void) afs_InactiveVCache(vcp, NULL);
1423 afs_linux_clear_nfsfs_renamed(dp);
1429 #if defined(DOP_D_DELETE_TAKES_CONST)
1430 afs_dentry_delete(const struct dentry *dp)
1432 afs_dentry_delete(struct dentry *dp)
1435 if (dp->d_inode && (VTOAFS(dp->d_inode)->f.states & CUnlinked))
1436 return 1; /* bad inode? */
1441 #ifdef STRUCT_DENTRY_OPERATIONS_HAS_D_AUTOMOUNT
1442 static struct vfsmount *
1443 afs_dentry_automount(afs_linux_path_t *path)
1445 struct dentry *target;
1448 * Avoid symlink resolution limits when resolving; we cannot contribute to
1449 * an infinite symlink loop.
1451 * On newer kernels the field has moved to the private nameidata structure
1452 * so we can't adjust it here. This may cause ELOOP when using a path with
1453 * 40 or more directories that are not already in the dentry cache.
1455 #if defined(STRUCT_TASK_STRUCT_HAS_TOTAL_LINK_COUNT)
1456 current->total_link_count--;
1459 target = canonical_dentry(path->dentry->d_inode);
1461 if (target == path->dentry) {
1468 path->dentry = target;
1471 spin_lock(&path->dentry->d_lock);
1472 path->dentry->d_flags &= ~DCACHE_NEED_AUTOMOUNT;
1473 spin_unlock(&path->dentry->d_lock);
1478 #endif /* STRUCT_DENTRY_OPERATIONS_HAS_D_AUTOMOUNT */
1480 struct dentry_operations afs_dentry_operations = {
1481 .d_revalidate = afs_linux_dentry_revalidate,
1482 .d_delete = afs_dentry_delete,
1483 .d_iput = afs_dentry_iput,
1484 #ifdef STRUCT_DENTRY_OPERATIONS_HAS_D_AUTOMOUNT
1485 .d_automount = afs_dentry_automount,
1486 #endif /* STRUCT_DENTRY_OPERATIONS_HAS_D_AUTOMOUNT */
1489 /**********************************************************************
1490 * AFS Linux inode operations
1491 **********************************************************************/
1495 * Merely need to set enough of vattr to get us through the create. Note
1496 * that the higher level code (open_namei) will take care of any tuncation
1497 * explicitly. Exclusive open is also taken care of in open_namei.
1499 * name is in kernel space at this point.
1502 #if defined(IOP_CREATE_TAKES_BOOL)
1503 afs_linux_create(struct inode *dip, struct dentry *dp, umode_t mode,
1505 #elif defined(IOP_CREATE_TAKES_UMODE_T)
1506 afs_linux_create(struct inode *dip, struct dentry *dp, umode_t mode,
1507 struct nameidata *nd)
1508 #elif defined(IOP_CREATE_TAKES_NAMEIDATA)
1509 afs_linux_create(struct inode *dip, struct dentry *dp, int mode,
1510 struct nameidata *nd)
1512 afs_linux_create(struct inode *dip, struct dentry *dp, int mode)
1515 struct vattr *vattr = NULL;
1516 cred_t *credp = crref();
1517 const char *name = dp->d_name.name;
1523 code = afs_CreateAttr(&vattr);
1527 vattr->va_mode = mode;
1528 vattr->va_type = mode & S_IFMT;
1530 code = afs_create(VTOAFS(dip), (char *)name, vattr, NONEXCL, mode,
1534 struct inode *ip = AFSTOV(vcp);
1536 afs_getattr(vcp, vattr, credp);
1537 afs_fill_inode(ip, vattr);
1538 insert_inode_hash(ip);
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);
1543 d_instantiate(dp, ip);
1546 afs_DestroyAttr(vattr);
1552 return afs_convert_code(code);
1555 /* afs_linux_lookup */
1556 static struct dentry *
1557 #if defined(IOP_LOOKUP_TAKES_UNSIGNED)
1558 afs_linux_lookup(struct inode *dip, struct dentry *dp,
1560 #elif defined(IOP_LOOKUP_TAKES_NAMEIDATA)
1561 afs_linux_lookup(struct inode *dip, struct dentry *dp,
1562 struct nameidata *nd)
1564 afs_linux_lookup(struct inode *dip, struct dentry *dp)
1567 cred_t *credp = crref();
1568 struct vcache *vcp = NULL;
1569 const char *comp = dp->d_name.name;
1570 struct inode *ip = NULL;
1571 struct dentry *newdp = NULL;
1576 code = afs_lookup(VTOAFS(dip), (char *)comp, &vcp, credp);
1577 if (code == ENOENT) {
1578 /* It's ok for the file to not be found. That's noted by the caller by
1579 * seeing that the dp->d_inode field is NULL (set by d_splice_alias or
1582 osi_Assert(vcp == NULL);
1590 struct vattr *vattr = NULL;
1591 struct vcache *parent_vc = VTOAFS(dip);
1593 if (parent_vc == vcp) {
1594 /* This is possible if the parent dir is a mountpoint to a volume,
1595 * and the dir entry we looked up is a mountpoint to the same
1596 * volume. Linux cannot cope with this, so return an error instead
1597 * of risking a deadlock or panic. */
1604 code = afs_CreateAttr(&vattr);
1612 afs_getattr(vcp, vattr, credp);
1613 afs_fill_inode(ip, vattr);
1614 if (hlist_unhashed(&ip->i_hash))
1615 insert_inode_hash(ip);
1617 afs_DestroyAttr(vattr);
1619 #if !defined(STRUCT_SUPER_BLOCK_HAS_S_D_OP)
1620 dp->d_op = &afs_dentry_operations;
1622 dp->d_time = parent_vcache_dv(dip, credp);
1626 if (ip && S_ISDIR(ip->i_mode)) {
1627 d_prune_aliases(ip);
1629 #ifdef STRUCT_DENTRY_OPERATIONS_HAS_D_AUTOMOUNT
1630 /* Only needed if this is a volume root */
1631 if (vcp->mvstat == 2)
1632 ip->i_flags |= S_AUTOMOUNT;
1636 * Take an extra reference so the inode doesn't go away if
1637 * d_splice_alias drops our reference on error.
1640 #ifdef HAVE_LINUX_IHOLD
1646 newdp = d_splice_alias(ip, dp);
1651 if (IS_ERR(newdp)) {
1652 /* d_splice_alias can return an error (EIO) if there is an existing
1653 * connected directory alias for this dentry. Add our dentry manually
1654 * ourselves if this happens. */
1657 #if defined(D_SPLICE_ALIAS_LEAK_ON_ERROR)
1658 /* Depending on the kernel version, d_splice_alias may or may not drop
1659 * the inode reference on error. If it didn't, do it here. */
1668 return ERR_PTR(afs_convert_code(code));
1676 afs_linux_link(struct dentry *olddp, struct inode *dip, struct dentry *newdp)
1679 cred_t *credp = crref();
1680 const char *name = newdp->d_name.name;
1681 struct inode *oldip = olddp->d_inode;
1683 /* If afs_link returned the vnode, we could instantiate the
1684 * dentry. Since it's not, we drop this one and do a new lookup.
1689 code = afs_link(VTOAFS(oldip), VTOAFS(dip), (char *)name, credp);
1693 return afs_convert_code(code);
1696 /* We have to have a Linux specific sillyrename function, because we
1697 * also have to keep the dcache up to date when we're doing a silly
1698 * rename - so we don't want the generic vnodeops doing this behind our
1703 afs_linux_sillyrename(struct inode *dir, struct dentry *dentry,
1706 struct vcache *tvc = VTOAFS(dentry->d_inode);
1707 struct dentry *__dp = NULL;
1708 char *__name = NULL;
1711 if (afs_linux_nfsfs_renamed(dentry))
1719 osi_FreeSmallSpace(__name);
1720 __name = afs_newname();
1723 __dp = lookup_one_len(__name, dentry->d_parent, strlen(__name));
1726 osi_FreeSmallSpace(__name);
1729 } while (__dp->d_inode != NULL);
1732 code = afs_rename(VTOAFS(dir), (char *)dentry->d_name.name,
1733 VTOAFS(dir), (char *)__dp->d_name.name,
1736 tvc->mvid.silly_name = __name;
1739 crfree(tvc->uncred);
1741 tvc->uncred = credp;
1742 tvc->f.states |= CUnlinked;
1743 afs_linux_set_nfsfs_renamed(dentry);
1745 __dp->d_time = 0; /* force to revalidate */
1746 d_move(dentry, __dp);
1748 osi_FreeSmallSpace(__name);
1759 afs_linux_unlink(struct inode *dip, struct dentry *dp)
1762 cred_t *credp = crref();
1763 const char *name = dp->d_name.name;
1764 struct vcache *tvc = VTOAFS(dp->d_inode);
1766 if (VREFCOUNT(tvc) > 1 && tvc->opens > 0
1767 && !(tvc->f.states & CUnlinked)) {
1769 code = afs_linux_sillyrename(dip, dp, credp);
1772 code = afs_remove(VTOAFS(dip), (char *)name, credp);
1779 return afs_convert_code(code);
1784 afs_linux_symlink(struct inode *dip, struct dentry *dp, const char *target)
1787 cred_t *credp = crref();
1788 struct vattr *vattr = NULL;
1789 const char *name = dp->d_name.name;
1791 /* If afs_symlink returned the vnode, we could instantiate the
1792 * dentry. Since it's not, we drop this one and do a new lookup.
1797 code = afs_CreateAttr(&vattr);
1802 code = afs_symlink(VTOAFS(dip), (char *)name, vattr, (char *)target, NULL,
1804 afs_DestroyAttr(vattr);
1809 return afs_convert_code(code);
1813 #if defined(IOP_MKDIR_TAKES_UMODE_T)
1814 afs_linux_mkdir(struct inode *dip, struct dentry *dp, umode_t mode)
1816 afs_linux_mkdir(struct inode *dip, struct dentry *dp, int mode)
1820 cred_t *credp = crref();
1821 struct vcache *tvcp = NULL;
1822 struct vattr *vattr = NULL;
1823 const char *name = dp->d_name.name;
1826 code = afs_CreateAttr(&vattr);
1831 vattr->va_mask = ATTR_MODE;
1832 vattr->va_mode = mode;
1834 code = afs_mkdir(VTOAFS(dip), (char *)name, vattr, &tvcp, credp);
1837 struct inode *ip = AFSTOV(tvcp);
1839 afs_getattr(tvcp, vattr, credp);
1840 afs_fill_inode(ip, vattr);
1842 #if !defined(STRUCT_SUPER_BLOCK_HAS_S_D_OP)
1843 dp->d_op = &afs_dentry_operations;
1845 dp->d_time = parent_vcache_dv(dip, credp);
1846 d_instantiate(dp, ip);
1848 afs_DestroyAttr(vattr);
1854 return afs_convert_code(code);
1858 afs_linux_rmdir(struct inode *dip, struct dentry *dp)
1861 cred_t *credp = crref();
1862 const char *name = dp->d_name.name;
1864 /* locking kernel conflicts with glock? */
1867 code = afs_rmdir(VTOAFS(dip), (char *)name, credp);
1870 /* Linux likes to see ENOTEMPTY returned from an rmdir() syscall
1871 * that failed because a directory is not empty. So, we map
1872 * EEXIST to ENOTEMPTY on linux.
1874 if (code == EEXIST) {
1883 return afs_convert_code(code);
1888 afs_linux_rename(struct inode *oldip, struct dentry *olddp,
1889 struct inode *newip, struct dentry *newdp
1890 #ifdef HAVE_LINUX_INODE_OPERATIONS_RENAME_TAKES_FLAGS
1891 , unsigned int flags
1896 cred_t *credp = crref();
1897 const char *oldname = olddp->d_name.name;
1898 const char *newname = newdp->d_name.name;
1899 struct dentry *rehash = NULL;
1901 #ifdef HAVE_LINUX_INODE_OPERATIONS_RENAME_TAKES_FLAGS
1903 return -EINVAL; /* no support for new flags yet */
1906 /* Prevent any new references during rename operation. */
1908 if (!d_unhashed(newdp)) {
1913 afs_maybe_shrink_dcache(olddp);
1916 code = afs_rename(VTOAFS(oldip), (char *)oldname, VTOAFS(newip), (char *)newname, credp);
1920 olddp->d_time = 0; /* force to revalidate */
1926 return afs_convert_code(code);
1930 /* afs_linux_ireadlink
1931 * Internal readlink which can return link contents to user or kernel space.
1932 * Note that the buffer is NOT supposed to be null-terminated.
1935 afs_linux_ireadlink(struct inode *ip, char *target, int maxlen, uio_seg_t seg)
1938 cred_t *credp = crref();
1942 memset(&tuio, 0, sizeof(tuio));
1943 memset(&iov, 0, sizeof(iov));
1945 setup_uio(&tuio, &iov, target, (afs_offs_t) 0, maxlen, UIO_READ, seg);
1946 code = afs_readlink(VTOAFS(ip), &tuio, credp);
1950 return maxlen - tuio.uio_resid;
1952 return afs_convert_code(code);
1955 #if !defined(USABLE_KERNEL_PAGE_SYMLINK_CACHE)
1956 /* afs_linux_readlink
1957 * Fill target (which is in user space) with contents of symlink.
1960 afs_linux_readlink(struct dentry *dp, char *target, int maxlen)
1963 struct inode *ip = dp->d_inode;
1966 code = afs_linux_ireadlink(ip, target, maxlen, AFS_UIOUSER);
1972 /* afs_linux_follow_link
1973 * a file system dependent link following routine.
1975 #if defined(HAVE_LINUX_INODE_OPERATIONS_FOLLOW_LINK_NO_NAMEIDATA)
1976 static const char *afs_linux_follow_link(struct dentry *dentry, void **link_data)
1978 static int afs_linux_follow_link(struct dentry *dentry, struct nameidata *nd)
1984 name = kmalloc(PATH_MAX, GFP_NOFS);
1986 #if defined(HAVE_LINUX_INODE_OPERATIONS_FOLLOW_LINK_NO_NAMEIDATA)
1987 return ERR_PTR(-EIO);
1994 code = afs_linux_ireadlink(dentry->d_inode, name, PATH_MAX - 1, AFS_UIOSYS);
1998 #if defined(HAVE_LINUX_INODE_OPERATIONS_FOLLOW_LINK_NO_NAMEIDATA)
1999 return ERR_PTR(code);
2006 #if defined(HAVE_LINUX_INODE_OPERATIONS_FOLLOW_LINK_NO_NAMEIDATA)
2007 return *link_data = name;
2009 nd_set_link(nd, name);
2014 #if defined(HAVE_LINUX_INODE_OPERATIONS_PUT_LINK_NO_NAMEIDATA)
2016 afs_linux_put_link(struct inode *inode, void *link_data)
2018 char *name = link_data;
2020 if (name && !IS_ERR(name))
2025 afs_linux_put_link(struct dentry *dentry, struct nameidata *nd)
2027 char *name = nd_get_link(nd);
2029 if (name && !IS_ERR(name))
2032 #endif /* HAVE_LINUX_INODE_OPERATIONS_PUT_LINK_NO_NAMEIDATA */
2034 #endif /* USABLE_KERNEL_PAGE_SYMLINK_CACHE */
2036 /* Populate a page by filling it from the cache file pointed at by cachefp
2037 * (which contains indicated chunk)
2038 * If task is NULL, the page copy occurs syncronously, and the routine
2039 * returns with page still locked. If task is non-NULL, then page copies
2040 * may occur in the background, and the page will be unlocked when it is
2044 afs_linux_read_cache(struct file *cachefp, struct page *page,
2045 int chunk, struct pagevec *lrupv,
2046 struct afs_pagecopy_task *task) {
2047 loff_t offset = page_offset(page);
2048 struct inode *cacheinode = cachefp->f_dentry->d_inode;
2049 struct page *newpage, *cachepage;
2050 struct address_space *cachemapping;
2054 cachemapping = cacheinode->i_mapping;
2058 /* If we're trying to read a page that's past the end of the disk
2059 * cache file, then just return a zeroed page */
2060 if (AFS_CHUNKOFFSET(offset) >= i_size_read(cacheinode)) {
2061 zero_user_segment(page, 0, PAGE_SIZE);
2062 SetPageUptodate(page);
2068 /* From our offset, we now need to work out which page in the disk
2069 * file it corresponds to. This will be fun ... */
2070 pageindex = (offset - AFS_CHUNKTOBASE(chunk)) >> PAGE_SHIFT;
2072 while (cachepage == NULL) {
2073 cachepage = find_get_page(cachemapping, pageindex);
2076 newpage = page_cache_alloc(cachemapping);
2082 code = add_to_page_cache(newpage, cachemapping,
2083 pageindex, GFP_KERNEL);
2085 cachepage = newpage;
2088 get_page(cachepage);
2089 if (!pagevec_add(lrupv, cachepage))
2090 __pagevec_lru_add_file(lrupv);
2095 if (code != -EEXIST)
2099 lock_page(cachepage);
2103 if (!PageUptodate(cachepage)) {
2104 ClearPageError(cachepage);
2105 code = cachemapping->a_ops->readpage(NULL, cachepage);
2106 if (!code && !task) {
2107 wait_on_page_locked(cachepage);
2110 unlock_page(cachepage);
2114 if (PageUptodate(cachepage)) {
2115 copy_highpage(page, cachepage);
2116 flush_dcache_page(page);
2117 SetPageUptodate(page);
2122 afs_pagecopy_queue_page(task, cachepage, page);
2134 put_page(cachepage);
2140 afs_linux_readpage_fastpath(struct file *fp, struct page *pp, int *codep)
2142 loff_t offset = page_offset(pp);
2143 struct inode *ip = FILE_INODE(fp);
2144 struct vcache *avc = VTOAFS(ip);
2146 struct file *cacheFp = NULL;
2149 struct pagevec lrupv;
2151 /* Not a UFS cache, don't do anything */
2152 if (cacheDiskType != AFS_FCACHE_TYPE_UFS)
2155 /* No readpage (ex: tmpfs) , skip */
2156 if (cachefs_noreadpage)
2159 /* Can't do anything if the vcache isn't statd , or if the read
2160 * crosses a chunk boundary.
2162 if (!(avc->f.states & CStatd) ||
2163 AFS_CHUNK(offset) != AFS_CHUNK(offset + PAGE_SIZE)) {
2167 ObtainWriteLock(&avc->lock, 911);
2169 /* XXX - See if hinting actually makes things faster !!! */
2171 /* See if we have a suitable entry already cached */
2175 /* We need to lock xdcache, then dcache, to handle situations where
2176 * the hint is on the free list. However, we can't safely do this
2177 * according to the locking hierarchy. So, use a non blocking lock.
2179 ObtainReadLock(&afs_xdcache);
2180 dcLocked = ( 0 == NBObtainReadLock(&tdc->lock));
2182 if (dcLocked && (tdc->index != NULLIDX)
2183 && !FidCmp(&tdc->f.fid, &avc->f.fid)
2184 && tdc->f.chunk == AFS_CHUNK(offset)
2185 && !(afs_indexFlags[tdc->index] & (IFFree | IFDiscarded))) {
2186 /* Bonus - the hint was correct */
2189 /* Only destroy the hint if its actually invalid, not if there's
2190 * just been a locking failure */
2192 ReleaseReadLock(&tdc->lock);
2199 ReleaseReadLock(&afs_xdcache);
2202 /* No hint, or hint is no longer valid - see if we can get something
2203 * directly from the dcache
2206 tdc = afs_FindDCache(avc, offset);
2209 ReleaseWriteLock(&avc->lock);
2214 ObtainReadLock(&tdc->lock);
2216 /* Is the dcache we've been given currently up to date */
2217 if (!hsame(avc->f.m.DataVersion, tdc->f.versionNo) ||
2218 (tdc->dflags & DFFetching))
2221 /* Update our hint for future abuse */
2224 /* Okay, so we've now got a cache file that is up to date */
2226 /* XXX - I suspect we should be locking the inodes before we use them! */
2228 cacheFp = afs_linux_raw_open(&tdc->f.inode);
2229 if (!cacheFp->f_dentry->d_inode->i_mapping->a_ops->readpage) {
2230 cachefs_noreadpage = 1;
2234 #if defined(PAGEVEC_INIT_COLD_ARG)
2235 pagevec_init(&lrupv, 0);
2237 pagevec_init(&lrupv);
2240 code = afs_linux_read_cache(cacheFp, pp, tdc->f.chunk, &lrupv, NULL);
2242 if (pagevec_count(&lrupv))
2243 __pagevec_lru_add_file(&lrupv);
2245 filp_close(cacheFp, NULL);
2248 ReleaseReadLock(&tdc->lock);
2249 ReleaseWriteLock(&avc->lock);
2256 ReleaseWriteLock(&avc->lock);
2257 ReleaseReadLock(&tdc->lock);
2262 /* afs_linux_readpage
2264 * This function is split into two, because prepare_write/begin_write
2265 * require a readpage call which doesn't unlock the resulting page upon
2269 afs_linux_fillpage(struct file *fp, struct page *pp)
2274 struct iovec *iovecp;
2275 struct inode *ip = FILE_INODE(fp);
2276 afs_int32 cnt = page_count(pp);
2277 struct vcache *avc = VTOAFS(ip);
2278 afs_offs_t offset = page_offset(pp);
2282 if (afs_linux_readpage_fastpath(fp, pp, &code)) {
2292 auio = kmalloc(sizeof(struct uio), GFP_NOFS);
2293 iovecp = kmalloc(sizeof(struct iovec), GFP_NOFS);
2295 setup_uio(auio, iovecp, (char *)address, offset, PAGE_SIZE, UIO_READ,
2300 afs_Trace4(afs_iclSetp, CM_TRACE_READPAGE, ICL_TYPE_POINTER, ip,
2301 ICL_TYPE_POINTER, pp, ICL_TYPE_INT32, cnt, ICL_TYPE_INT32,
2302 99999); /* not a possible code value */
2304 code = afs_rdwr(avc, auio, UIO_READ, 0, credp);
2306 afs_Trace4(afs_iclSetp, CM_TRACE_READPAGE, ICL_TYPE_POINTER, ip,
2307 ICL_TYPE_POINTER, pp, ICL_TYPE_INT32, cnt, ICL_TYPE_INT32,
2309 AFS_DISCON_UNLOCK();
2312 /* XXX valid for no-cache also? Check last bits of files... :)
2313 * Cognate code goes in afs_NoCacheFetchProc. */
2314 if (auio->uio_resid) /* zero remainder of page */
2315 memset((void *)(address + (PAGE_SIZE - auio->uio_resid)), 0,
2318 flush_dcache_page(pp);
2319 SetPageUptodate(pp);
2328 return afs_convert_code(code);
2332 afs_linux_prefetch(struct file *fp, struct page *pp)
2335 struct vcache *avc = VTOAFS(FILE_INODE(fp));
2336 afs_offs_t offset = page_offset(pp);
2338 if (AFS_CHUNKOFFSET(offset) == 0) {
2340 struct vrequest *treq = NULL;
2345 code = afs_CreateReq(&treq, credp);
2346 if (!code && !NBObtainWriteLock(&avc->lock, 534)) {
2347 tdc = afs_FindDCache(avc, offset);
2349 if (!(tdc->mflags & DFNextStarted))
2350 afs_PrefetchChunk(avc, tdc, credp, treq);
2353 ReleaseWriteLock(&avc->lock);
2355 afs_DestroyReq(treq);
2359 return afs_convert_code(code);
2364 afs_linux_bypass_readpages(struct file *fp, struct address_space *mapping,
2365 struct list_head *page_list, unsigned num_pages)
2370 struct iovec* iovecp;
2371 struct nocache_read_request *ancr;
2373 struct pagevec lrupv;
2377 struct inode *ip = FILE_INODE(fp);
2378 struct vcache *avc = VTOAFS(ip);
2379 afs_int32 base_index = 0;
2380 afs_int32 page_count = 0;
2383 /* background thread must free: iovecp, auio, ancr */
2384 iovecp = osi_Alloc(num_pages * sizeof(struct iovec));
2386 auio = osi_Alloc(sizeof(struct uio));
2387 auio->uio_iov = iovecp;
2388 auio->uio_iovcnt = num_pages;
2389 auio->uio_flag = UIO_READ;
2390 auio->uio_seg = AFS_UIOSYS;
2391 auio->uio_resid = num_pages * PAGE_SIZE;
2393 ancr = osi_Alloc(sizeof(struct nocache_read_request));
2395 ancr->offset = auio->uio_offset;
2396 ancr->length = auio->uio_resid;
2398 #if defined(PAGEVEC_INIT_COLD_ARG)
2399 pagevec_init(&lrupv, 0);
2401 pagevec_init(&lrupv);
2404 for(page_ix = 0; page_ix < num_pages; ++page_ix) {
2406 if(list_empty(page_list))
2409 pp = list_entry(page_list->prev, struct page, lru);
2410 /* If we allocate a page and don't remove it from page_list,
2411 * the page cache gets upset. */
2413 isize = (i_size_read(fp->f_mapping->host) - 1) >> PAGE_SHIFT;
2414 if(pp->index > isize) {
2421 offset = page_offset(pp);
2422 ancr->offset = auio->uio_offset = offset;
2423 base_index = pp->index;
2425 iovecp[page_ix].iov_len = PAGE_SIZE;
2426 code = add_to_page_cache(pp, mapping, pp->index, GFP_KERNEL);
2427 if(base_index != pp->index) {
2431 iovecp[page_ix].iov_base = (void *) 0;
2433 ancr->length -= PAGE_SIZE;
2441 iovecp[page_ix].iov_base = (void *) 0;
2444 if(!PageLocked(pp)) {
2448 /* increment page refcount--our original design assumed
2449 * that locking it would effectively pin it; protect
2450 * ourselves from the possiblity that this assumption is
2451 * is faulty, at low cost (provided we do not fail to
2452 * do the corresponding decref on the other side) */
2455 /* save the page for background map */
2456 iovecp[page_ix].iov_base = (void*) pp;
2458 /* and put it on the LRU cache */
2459 if (!pagevec_add(&lrupv, pp))
2460 __pagevec_lru_add_file(&lrupv);
2464 /* If there were useful pages in the page list, make sure all pages
2465 * are in the LRU cache, then schedule the read */
2467 if (pagevec_count(&lrupv))
2468 __pagevec_lru_add_file(&lrupv);
2470 code = afs_ReadNoCache(avc, ancr, credp);
2473 /* If there is nothing for the background thread to handle,
2474 * it won't be freeing the things that we never gave it */
2475 osi_Free(iovecp, num_pages * sizeof(struct iovec));
2476 osi_Free(auio, sizeof(struct uio));
2477 osi_Free(ancr, sizeof(struct nocache_read_request));
2479 /* we do not flush, release, or unmap pages--that will be
2480 * done for us by the background thread as each page comes in
2481 * from the fileserver */
2482 return afs_convert_code(code);
2487 afs_linux_bypass_readpage(struct file *fp, struct page *pp)
2489 cred_t *credp = NULL;
2491 struct iovec *iovecp;
2492 struct nocache_read_request *ancr;
2496 * Special case: if page is at or past end of file, just zero it and set
2499 if (page_offset(pp) >= i_size_read(fp->f_mapping->host)) {
2500 zero_user_segment(pp, 0, PAGE_SIZE);
2501 SetPageUptodate(pp);
2508 /* receiver frees */
2509 auio = osi_Alloc(sizeof(struct uio));
2510 iovecp = osi_Alloc(sizeof(struct iovec));
2512 /* address can be NULL, because we overwrite it with 'pp', below */
2513 setup_uio(auio, iovecp, NULL, page_offset(pp),
2514 PAGE_SIZE, UIO_READ, AFS_UIOSYS);
2516 /* save the page for background map */
2517 get_page(pp); /* see above */
2518 auio->uio_iov->iov_base = (void*) pp;
2519 /* the background thread will free this */
2520 ancr = osi_Alloc(sizeof(struct nocache_read_request));
2522 ancr->offset = page_offset(pp);
2523 ancr->length = PAGE_SIZE;
2526 code = afs_ReadNoCache(VTOAFS(FILE_INODE(fp)), ancr, credp);
2529 return afs_convert_code(code);
2533 afs_linux_can_bypass(struct inode *ip) {
2535 switch(cache_bypass_strategy) {
2536 case NEVER_BYPASS_CACHE:
2538 case ALWAYS_BYPASS_CACHE:
2540 case LARGE_FILES_BYPASS_CACHE:
2541 if (i_size_read(ip) > cache_bypass_threshold)
2548 /* Check if a file is permitted to bypass the cache by policy, and modify
2549 * the cache bypass state recorded for that file */
2552 afs_linux_bypass_check(struct inode *ip) {
2555 int bypass = afs_linux_can_bypass(ip);
2558 trydo_cache_transition(VTOAFS(ip), credp, bypass);
2566 afs_linux_readpage(struct file *fp, struct page *pp)
2570 if (afs_linux_bypass_check(FILE_INODE(fp))) {
2571 code = afs_linux_bypass_readpage(fp, pp);
2573 code = afs_linux_fillpage(fp, pp);
2575 code = afs_linux_prefetch(fp, pp);
2582 /* Readpages reads a number of pages for a particular file. We use
2583 * this to optimise the reading, by limiting the number of times upon which
2584 * we have to lookup, lock and open vcaches and dcaches
2588 afs_linux_readpages(struct file *fp, struct address_space *mapping,
2589 struct list_head *page_list, unsigned int num_pages)
2591 struct inode *inode = mapping->host;
2592 struct vcache *avc = VTOAFS(inode);
2594 struct file *cacheFp = NULL;
2596 unsigned int page_idx;
2598 struct pagevec lrupv;
2599 struct afs_pagecopy_task *task;
2601 if (afs_linux_bypass_check(inode))
2602 return afs_linux_bypass_readpages(fp, mapping, page_list, num_pages);
2604 if (cacheDiskType == AFS_FCACHE_TYPE_MEM)
2607 /* No readpage (ex: tmpfs) , skip */
2608 if (cachefs_noreadpage)
2612 if ((code = afs_linux_VerifyVCache(avc, NULL))) {
2617 ObtainWriteLock(&avc->lock, 912);
2620 task = afs_pagecopy_init_task();
2623 #if defined(PAGEVEC_INIT_COLD_ARG)
2624 pagevec_init(&lrupv, 0);
2626 pagevec_init(&lrupv);
2628 for (page_idx = 0; page_idx < num_pages; page_idx++) {
2629 struct page *page = list_entry(page_list->prev, struct page, lru);
2630 list_del(&page->lru);
2631 offset = page_offset(page);
2633 if (tdc && tdc->f.chunk != AFS_CHUNK(offset)) {
2635 ReleaseReadLock(&tdc->lock);
2640 filp_close(cacheFp, NULL);
2645 if ((tdc = afs_FindDCache(avc, offset))) {
2646 ObtainReadLock(&tdc->lock);
2647 if (!hsame(avc->f.m.DataVersion, tdc->f.versionNo) ||
2648 (tdc->dflags & DFFetching)) {
2649 ReleaseReadLock(&tdc->lock);
2656 cacheFp = afs_linux_raw_open(&tdc->f.inode);
2657 if (!cacheFp->f_dentry->d_inode->i_mapping->a_ops->readpage) {
2658 cachefs_noreadpage = 1;
2664 if (tdc && !add_to_page_cache(page, mapping, page->index,
2667 if (!pagevec_add(&lrupv, page))
2668 __pagevec_lru_add_file(&lrupv);
2670 afs_linux_read_cache(cacheFp, page, tdc->f.chunk, &lrupv, task);
2674 if (pagevec_count(&lrupv))
2675 __pagevec_lru_add_file(&lrupv);
2679 filp_close(cacheFp, NULL);
2681 afs_pagecopy_put_task(task);
2685 ReleaseReadLock(&tdc->lock);
2689 ReleaseWriteLock(&avc->lock);
2694 /* Prepare an AFS vcache for writeback. Should be called with the vcache
2697 afs_linux_prepare_writeback(struct vcache *avc) {
2699 struct pagewriter *pw;
2701 pid = MyPidxx2Pid(MyPidxx);
2702 /* Prevent recursion into the writeback code */
2703 spin_lock(&avc->pagewriter_lock);
2704 list_for_each_entry(pw, &avc->pagewriters, link) {
2705 if (pw->writer == pid) {
2706 spin_unlock(&avc->pagewriter_lock);
2707 return AOP_WRITEPAGE_ACTIVATE;
2710 spin_unlock(&avc->pagewriter_lock);
2712 /* Add ourselves to writer list */
2713 pw = osi_Alloc(sizeof(struct pagewriter));
2715 spin_lock(&avc->pagewriter_lock);
2716 list_add_tail(&pw->link, &avc->pagewriters);
2717 spin_unlock(&avc->pagewriter_lock);
2723 afs_linux_dopartialwrite(struct vcache *avc, cred_t *credp) {
2724 struct vrequest *treq = NULL;
2727 if (!afs_CreateReq(&treq, credp)) {
2728 code = afs_DoPartialWrite(avc, treq);
2729 afs_DestroyReq(treq);
2732 return afs_convert_code(code);
2736 afs_linux_complete_writeback(struct vcache *avc) {
2737 struct pagewriter *pw, *store;
2739 struct list_head tofree;
2741 INIT_LIST_HEAD(&tofree);
2742 pid = MyPidxx2Pid(MyPidxx);
2743 /* Remove ourselves from writer list */
2744 spin_lock(&avc->pagewriter_lock);
2745 list_for_each_entry_safe(pw, store, &avc->pagewriters, link) {
2746 if (pw->writer == pid) {
2747 list_del(&pw->link);
2748 /* osi_Free may sleep so we need to defer it */
2749 list_add_tail(&pw->link, &tofree);
2752 spin_unlock(&avc->pagewriter_lock);
2753 list_for_each_entry_safe(pw, store, &tofree, link) {
2754 list_del(&pw->link);
2755 osi_Free(pw, sizeof(struct pagewriter));
2759 /* Writeback a given page syncronously. Called with no AFS locks held */
2761 afs_linux_page_writeback(struct inode *ip, struct page *pp,
2762 unsigned long offset, unsigned int count,
2765 struct vcache *vcp = VTOAFS(ip);
2773 memset(&tuio, 0, sizeof(tuio));
2774 memset(&iovec, 0, sizeof(iovec));
2776 buffer = kmap(pp) + offset;
2777 base = page_offset(pp) + offset;
2780 afs_Trace4(afs_iclSetp, CM_TRACE_UPDATEPAGE, ICL_TYPE_POINTER, vcp,
2781 ICL_TYPE_POINTER, pp, ICL_TYPE_INT32, page_count(pp),
2782 ICL_TYPE_INT32, 99999);
2784 setup_uio(&tuio, &iovec, buffer, base, count, UIO_WRITE, AFS_UIOSYS);
2786 code = afs_write(vcp, &tuio, f_flags, credp, 0);
2788 i_size_write(ip, vcp->f.m.Length);
2789 ip->i_blocks = ((vcp->f.m.Length + 1023) >> 10) << 1;
2791 code = code ? afs_convert_code(code) : count - tuio.uio_resid;
2793 afs_Trace4(afs_iclSetp, CM_TRACE_UPDATEPAGE, ICL_TYPE_POINTER, vcp,
2794 ICL_TYPE_POINTER, pp, ICL_TYPE_INT32, page_count(pp),
2795 ICL_TYPE_INT32, code);
2804 afs_linux_writepage_sync(struct inode *ip, struct page *pp,
2805 unsigned long offset, unsigned int count)
2809 struct vcache *vcp = VTOAFS(ip);
2812 /* Catch recursive writeback. This occurs if the kernel decides
2813 * writeback is required whilst we are writing to the cache, or
2814 * flushing to the server. When we're running syncronously (as
2815 * opposed to from writepage) we can't actually do anything about
2816 * this case - as we can't return AOP_WRITEPAGE_ACTIVATE to write()
2819 ObtainWriteLock(&vcp->lock, 532);
2820 afs_linux_prepare_writeback(vcp);
2821 ReleaseWriteLock(&vcp->lock);
2825 code = afs_linux_page_writeback(ip, pp, offset, count, credp);
2828 ObtainWriteLock(&vcp->lock, 533);
2830 code1 = afs_linux_dopartialwrite(vcp, credp);
2831 afs_linux_complete_writeback(vcp);
2832 ReleaseWriteLock(&vcp->lock);
2843 #ifdef AOP_WRITEPAGE_TAKES_WRITEBACK_CONTROL
2844 afs_linux_writepage(struct page *pp, struct writeback_control *wbc)
2846 afs_linux_writepage(struct page *pp)
2849 struct address_space *mapping = pp->mapping;
2850 struct inode *inode;
2853 unsigned int to = PAGE_SIZE;
2860 inode = mapping->host;
2861 vcp = VTOAFS(inode);
2862 isize = i_size_read(inode);
2864 /* Don't defeat an earlier truncate */
2865 if (page_offset(pp) > isize) {
2866 set_page_writeback(pp);
2872 ObtainWriteLock(&vcp->lock, 537);
2873 code = afs_linux_prepare_writeback(vcp);
2874 if (code == AOP_WRITEPAGE_ACTIVATE) {
2875 /* WRITEPAGE_ACTIVATE is the only return value that permits us
2876 * to return with the page still locked */
2877 ReleaseWriteLock(&vcp->lock);
2882 /* Grab the creds structure currently held in the vnode, and
2883 * get a reference to it, in case it goes away ... */
2889 ReleaseWriteLock(&vcp->lock);
2892 set_page_writeback(pp);
2894 SetPageUptodate(pp);
2896 /* We can unlock the page here, because it's protected by the
2897 * page_writeback flag. This should make us less vulnerable to
2898 * deadlocking in afs_write and afs_DoPartialWrite
2902 /* If this is the final page, then just write the number of bytes that
2903 * are actually in it */
2904 if ((isize - page_offset(pp)) < to )
2905 to = isize - page_offset(pp);
2907 code = afs_linux_page_writeback(inode, pp, 0, to, credp);
2910 ObtainWriteLock(&vcp->lock, 538);
2912 /* As much as we might like to ignore a file server error here,
2913 * and just try again when we close(), unfortunately StoreAllSegments
2914 * will invalidate our chunks if the server returns a permanent error,
2915 * so we need to at least try and get that error back to the user
2918 code1 = afs_linux_dopartialwrite(vcp, credp);
2920 afs_linux_complete_writeback(vcp);
2921 ReleaseWriteLock(&vcp->lock);
2926 end_page_writeback(pp);
2938 /* afs_linux_permission
2939 * Check access rights - returns error if can't check or permission denied.
2942 #if defined(IOP_PERMISSION_TAKES_FLAGS)
2943 afs_linux_permission(struct inode *ip, int mode, unsigned int flags)
2944 #elif defined(IOP_PERMISSION_TAKES_NAMEIDATA)
2945 afs_linux_permission(struct inode *ip, int mode, struct nameidata *nd)
2947 afs_linux_permission(struct inode *ip, int mode)
2954 /* Check for RCU path walking */
2955 #if defined(IOP_PERMISSION_TAKES_FLAGS)
2956 if (flags & IPERM_FLAG_RCU)
2958 #elif defined(MAY_NOT_BLOCK)
2959 if (mode & MAY_NOT_BLOCK)
2965 if (mode & MAY_EXEC)
2967 if (mode & MAY_READ)
2969 if (mode & MAY_WRITE)
2971 code = afs_access(VTOAFS(ip), tmp, credp);
2975 return afs_convert_code(code);
2979 afs_linux_commit_write(struct file *file, struct page *page, unsigned offset,
2983 struct inode *inode = FILE_INODE(file);
2984 loff_t pagebase = page_offset(page);
2986 if (i_size_read(inode) < (pagebase + offset))
2987 i_size_write(inode, pagebase + offset);
2989 if (PageChecked(page)) {
2990 SetPageUptodate(page);
2991 ClearPageChecked(page);
2994 code = afs_linux_writepage_sync(inode, page, offset, to - offset);
3000 afs_linux_prepare_write(struct file *file, struct page *page, unsigned from,
3004 /* http://kerneltrap.org/node/4941 details the expected behaviour of
3005 * prepare_write. Essentially, if the page exists within the file,
3006 * and is not being fully written, then we should populate it.
3009 if (!PageUptodate(page)) {
3010 loff_t pagebase = page_offset(page);
3011 loff_t isize = i_size_read(page->mapping->host);
3013 /* Is the location we are writing to beyond the end of the file? */
3014 if (pagebase >= isize ||
3015 ((from == 0) && (pagebase + to) >= isize)) {
3016 zero_user_segments(page, 0, from, to, PAGE_SIZE);
3017 SetPageChecked(page);
3018 /* Are we we writing a full page */
3019 } else if (from == 0 && to == PAGE_SIZE) {
3020 SetPageChecked(page);
3021 /* Is the page readable, if it's wronly, we don't care, because we're
3022 * not actually going to read from it ... */
3023 } else if ((file->f_flags && O_ACCMODE) != O_WRONLY) {
3024 /* We don't care if fillpage fails, because if it does the page
3025 * won't be marked as up to date
3027 afs_linux_fillpage(file, page);
3033 #if defined(STRUCT_ADDRESS_SPACE_OPERATIONS_HAS_WRITE_BEGIN)
3035 afs_linux_write_end(struct file *file, struct address_space *mapping,
3036 loff_t pos, unsigned len, unsigned copied,
3037 struct page *page, void *fsdata)
3040 unsigned int from = pos & (PAGE_SIZE - 1);
3042 code = afs_linux_commit_write(file, page, from, from + copied);
3050 afs_linux_write_begin(struct file *file, struct address_space *mapping,
3051 loff_t pos, unsigned len, unsigned flags,
3052 struct page **pagep, void **fsdata)
3055 pgoff_t index = pos >> PAGE_SHIFT;
3056 unsigned int from = pos & (PAGE_SIZE - 1);
3059 page = grab_cache_page_write_begin(mapping, index, flags);
3062 code = afs_linux_prepare_write(file, page, from, from + len);
3072 #ifndef STRUCT_DENTRY_OPERATIONS_HAS_D_AUTOMOUNT
3074 afs_linux_dir_follow_link(struct dentry *dentry, struct nameidata *nd)
3076 struct dentry **dpp;
3077 struct dentry *target;
3079 if (current->total_link_count > 0) {
3080 /* avoid symlink resolution limits when resolving; we cannot contribute to
3081 * an infinite symlink loop */
3082 /* only do this for follow_link when total_link_count is positive to be
3083 * on the safe side; there is at least one code path in the Linux
3084 * kernel where it seems like it may be possible to get here without
3085 * total_link_count getting incremented. it is not clear on how that
3086 * path is actually reached, but guard against it just to be safe */
3087 current->total_link_count--;
3090 target = canonical_dentry(dentry->d_inode);
3092 # ifdef STRUCT_NAMEIDATA_HAS_PATH
3093 dpp = &nd->path.dentry;
3103 *dpp = dget(dentry);
3106 nd->last_type = LAST_BIND;
3110 #endif /* !STRUCT_DENTRY_OPERATIONS_HAS_D_AUTOMOUNT */
3113 static struct inode_operations afs_file_iops = {
3114 .permission = afs_linux_permission,
3115 .getattr = afs_linux_getattr,
3116 .setattr = afs_notify_change,
3119 static struct address_space_operations afs_file_aops = {
3120 .readpage = afs_linux_readpage,
3121 .readpages = afs_linux_readpages,
3122 .writepage = afs_linux_writepage,
3123 #if defined (STRUCT_ADDRESS_SPACE_OPERATIONS_HAS_WRITE_BEGIN)
3124 .write_begin = afs_linux_write_begin,
3125 .write_end = afs_linux_write_end,
3127 .commit_write = afs_linux_commit_write,
3128 .prepare_write = afs_linux_prepare_write,
3133 /* Separate ops vector for directories. Linux 2.2 tests type of inode
3134 * by what sort of operation is allowed.....
3137 static struct inode_operations afs_dir_iops = {
3138 .setattr = afs_notify_change,
3139 .create = afs_linux_create,
3140 .lookup = afs_linux_lookup,
3141 .link = afs_linux_link,
3142 .unlink = afs_linux_unlink,
3143 .symlink = afs_linux_symlink,
3144 .mkdir = afs_linux_mkdir,
3145 .rmdir = afs_linux_rmdir,
3146 .rename = afs_linux_rename,
3147 .getattr = afs_linux_getattr,
3148 .permission = afs_linux_permission,
3149 #ifndef STRUCT_DENTRY_OPERATIONS_HAS_D_AUTOMOUNT
3150 .follow_link = afs_linux_dir_follow_link,
3154 /* We really need a separate symlink set of ops, since do_follow_link()
3155 * determines if it _is_ a link by checking if the follow_link op is set.
3157 #if defined(USABLE_KERNEL_PAGE_SYMLINK_CACHE)
3159 afs_symlink_filler(struct file *file, struct page *page)
3161 struct inode *ip = (struct inode *)page->mapping->host;
3162 char *p = (char *)kmap(page);
3166 code = afs_linux_ireadlink(ip, p, PAGE_SIZE, AFS_UIOSYS);
3171 p[code] = '\0'; /* null terminate? */
3173 SetPageUptodate(page);
3185 static struct address_space_operations afs_symlink_aops = {
3186 .readpage = afs_symlink_filler
3188 #endif /* USABLE_KERNEL_PAGE_SYMLINK_CACHE */
3190 static struct inode_operations afs_symlink_iops = {
3191 #if defined(USABLE_KERNEL_PAGE_SYMLINK_CACHE)
3192 .readlink = page_readlink,
3193 # if defined(HAVE_LINUX_PAGE_GET_LINK)
3194 .get_link = page_get_link,
3195 # elif defined(HAVE_LINUX_PAGE_FOLLOW_LINK)
3196 .follow_link = page_follow_link,
3198 .follow_link = page_follow_link_light,
3199 .put_link = page_put_link,
3201 #else /* !defined(USABLE_KERNEL_PAGE_SYMLINK_CACHE) */
3202 .readlink = afs_linux_readlink,
3203 .follow_link = afs_linux_follow_link,
3204 .put_link = afs_linux_put_link,
3205 #endif /* USABLE_KERNEL_PAGE_SYMLINK_CACHE */
3206 .setattr = afs_notify_change,
3210 afs_fill_inode(struct inode *ip, struct vattr *vattr)
3213 vattr2inode(ip, vattr);
3215 #ifdef STRUCT_ADDRESS_SPACE_HAS_BACKING_DEV_INFO
3216 ip->i_mapping->backing_dev_info = afs_backing_dev_info;
3218 /* Reset ops if symlink or directory. */
3219 if (S_ISREG(ip->i_mode)) {
3220 ip->i_op = &afs_file_iops;
3221 ip->i_fop = &afs_file_fops;
3222 ip->i_data.a_ops = &afs_file_aops;
3224 } else if (S_ISDIR(ip->i_mode)) {
3225 ip->i_op = &afs_dir_iops;
3226 ip->i_fop = &afs_dir_fops;
3228 } else if (S_ISLNK(ip->i_mode)) {
3229 ip->i_op = &afs_symlink_iops;
3230 #if defined(HAVE_LINUX_INODE_NOHIGHMEM)
3231 inode_nohighmem(ip);
3233 #if defined(USABLE_KERNEL_PAGE_SYMLINK_CACHE)
3234 ip->i_data.a_ops = &afs_symlink_aops;
3235 ip->i_mapping = &ip->i_data;