Files
gVisor bot 8bf3d3eaaf Internal change.
PiperOrigin-RevId: 936208851
2026-06-22 13:04:00 -07:00

925 lines
31 KiB
Go

// Copyright 2019 The gVisor Authors.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
// Package kernfs provides the tools to implement inode-based filesystems.
// Kernfs has two main features:
//
// 1. The Inode interface, which maps VFS's path-based filesystem operations to
// specific filesystem nodes. Kernfs uses the Inode interface to provide a
// blanket implementation for the vfs.FilesystemImpl. Kernfs also serves as
// the synchronization mechanism for all filesystem operations by holding a
// filesystem-wide lock across all operations.
//
// 2. Various utility types which provide generic implementations for various
// parts of the Inode and vfs.FileDescription interfaces. Client filesystems
// based on kernfs can embed the appropriate set of these to avoid having to
// reimplement common filesystem operations. See inode_impl_util.go and
// fd_impl_util.go.
//
// Reference Model:
//
// Kernfs dentries represents named pointers to inodes. Kernfs is solely
// responsible for maintaining and modifying its dentry tree; inode
// implementations can not access the tree. Dentries and inodes have
// independent lifetimes and reference counts. A child dentry unconditionally
// holds a reference on its parent directory's dentry. A dentry also holds a
// reference on the inode it points to (although that might not be the only
// reference on the inode). Due to this inodes can outlive the dentries that
// point to them. Multiple dentries can point to the same inode (for example,
// in the case of hardlinks). File descriptors hold a reference to the dentry
// they're opened on.
//
// Dentries are guaranteed to exist while holding Filesystem.mu for
// reading. Dropping dentries require holding Filesystem.mu for writing. To
// queue dentries for destruction from a read critical section, see
// Filesystem.deferDecRef.
//
// Lock ordering:
//
// kernfs.Filesystem.mu
// kernel.TaskSet.mu
// kernel.Task.mu
// kernfs.Dentry.dirMu
// vfs.VirtualFilesystem.mountMu
// vfs.Dentry.mu
// (inode implementation locks, if any)
//
// kernfs.Filesystem.deferredDecRefsMu
package kernfs
import (
"fmt"
"sync/atomic"
"gvisor.dev/gvisor/pkg/abi/linux"
"gvisor.dev/gvisor/pkg/atomicbitops"
"gvisor.dev/gvisor/pkg/context"
"gvisor.dev/gvisor/pkg/errors/linuxerr"
"gvisor.dev/gvisor/pkg/fspath"
"gvisor.dev/gvisor/pkg/refs"
"gvisor.dev/gvisor/pkg/sentry/kernel/auth"
"gvisor.dev/gvisor/pkg/sentry/vfs"
"gvisor.dev/gvisor/pkg/sync"
)
// Filesystem mostly implements vfs.FilesystemImpl for a generic in-memory
// filesystem. Concrete implementations are expected to embed this in their own
// Filesystem type.
//
// +stateify savable
type Filesystem struct {
vfsfs vfs.Filesystem
deferredDecRefsMu deferredDecRefsMutex `state:"nosave"`
// deferredDecRefs is a list of dentries waiting to be DecRef()ed. This is
// used to defer dentry destruction until mu can be acquired for
// writing. Protected by deferredDecRefsMu.
deferredDecRefs []refs.RefCounter
// mu synchronizes the lifetime of Dentries on this filesystem. Holding it
// for reading guarantees continued existence of any resolved dentries, but
// the dentry tree may be modified.
//
// Kernfs dentries can only be DecRef()ed while holding mu for writing. For
// example:
//
// fs.mu.Lock()
// defer fs.mu.Unlock()
// ...
// dentry1.DecRef()
// defer dentry2.DecRef() // Ok, will run before Unlock.
//
// If discarding dentries in a read context, use Filesystem.deferDecRef. For
// example:
//
// fs.mu.RLock()
// defer fs.processDeferredDecRefs()
// defer fs.mu.RUnlock()
// ...
// fs.deferDecRef(dentry)
mu filesystemRWMutex `state:"nosave"`
// ancestryMu additionally protects dentry.parent and dentry.name as
// required by genericfstree.
ancestryMu ancestryRWMutex `state:"nosave"`
// nextInoMinusOne is used to to allocate inode numbers on this
// filesystem. Must be accessed by atomic operations.
nextInoMinusOne atomicbitops.Uint64
// cachedDentries contains all dentries with 0 references. (Due to race
// conditions, it may also contain dentries with non-zero references.)
// cachedDentriesLen is the number of dentries in cachedDentries. These
// fields are protected by mu.
cachedDentries dentryList
cachedDentriesLen uint64
// MaxCachedDentries is the maximum size of cachedDentries. If not set,
// defaults to 0 and kernfs does not cache any dentries. This is immutable.
MaxCachedDentries uint64
// root is the root dentry of this filesystem. Note that root may be nil for
// filesystems on a disconnected mount without a root (e.g. pipefs, sockfs,
// hostfs). Filesystem holds an extra reference on root to prevent it from
// being destroyed prematurely. This is immutable.
root *Dentry
}
// deferDecRef defers dropping a dentry ref until the next call to
// processDeferredDecRefs{,Locked}. See comment on Filesystem.mu.
// This may be called while Filesystem.mu or Dentry.dirMu is locked.
func (fs *Filesystem) deferDecRef(d refs.RefCounter) {
fs.deferredDecRefsMu.Lock()
fs.deferredDecRefs = append(fs.deferredDecRefs, d)
fs.deferredDecRefsMu.Unlock()
}
// SafeDecRefFD safely DecRef the FileDescription making sure DecRef is deferred
// in case Filesystem.mu is held. See comment on Filesystem.mu.
func (fs *Filesystem) SafeDecRefFD(ctx context.Context, fd *vfs.FileDescription) {
if d, ok := fd.Dentry().Impl().(*Dentry); ok && d.fs == fs {
// Only defer if dentry belongs to this filesystem, since locks cannot cross
// filesystems.
fs.deferDecRef(fd)
return
}
fd.DecRef(ctx)
}
// SafeDecRef safely DecRef the virtual dentry making sure DecRef is deferred
// in case Filesystem.mu is held. See comment on Filesystem.mu.
func (fs *Filesystem) SafeDecRef(ctx context.Context, vd vfs.VirtualDentry) {
if d, ok := vd.Dentry().Impl().(*Dentry); ok && d.fs == fs {
// Only defer if dentry belongs to this filesystem, since locks cannot cross
// filesystems.
fs.deferDecRef(&vd)
return
}
vd.DecRef(ctx)
}
// processDeferredDecRefs calls vfs.Dentry.DecRef on all dentries in the
// deferredDecRefs list. See comment on Filesystem.mu.
//
// Precondition: Filesystem.mu or Dentry.dirMu must NOT be locked.
func (fs *Filesystem) processDeferredDecRefs(ctx context.Context) {
fs.deferredDecRefsMu.Lock()
for _, d := range fs.deferredDecRefs {
// Defer the DecRef call so that we are not holding deferredDecRefsMu
// when DecRef is called.
defer d.DecRef(ctx)
}
fs.deferredDecRefs = fs.deferredDecRefs[:0] // Keep slice memory for reuse.
fs.deferredDecRefsMu.Unlock()
}
// VFSFilesystem returns the generic vfs filesystem object.
func (fs *Filesystem) VFSFilesystem() *vfs.Filesystem {
return &fs.vfsfs
}
// NextIno allocates a new inode number on this filesystem.
func (fs *Filesystem) NextIno() uint64 {
return fs.nextInoMinusOne.Add(1)
}
// These consts are used in the Dentry.flags field.
const (
// Dentry points to a directory inode.
dflagsIsDir = 1 << iota
// Dentry points to a symlink inode.
dflagsIsSymlink
// Dentry points to a regular file inode.
dflagsIsRegular
)
// Dentry implements vfs.DentryImpl.
//
// A kernfs dentry is similar to a dentry in a traditional filesystem: it's a
// named reference to an inode. A dentry generally lives as long as it's part of
// a mounted filesystem tree. Kernfs drops dentries once all references to them
// are dropped. Dentries hold a single reference to the inode they point
// to, and child dentries hold a reference on their parent.
//
// Must be initialized by Init prior to first use.
//
// +stateify savable
type Dentry struct {
vfsd vfs.Dentry
// refs is the reference count. When refs reaches 0, the dentry may be
// added to the cache or destroyed. If refs == -1, the dentry has already
// been destroyed. refs are allowed to go to 0 and increase again. refs is
// accessed using atomic memory operations.
refs atomicbitops.Int64
// fs is the owning filesystem. fs is immutable.
fs *Filesystem
// flags caches useful information about the dentry from the inode. See the
// dflags* consts above.
flags atomicbitops.Uint32
parent atomic.Pointer[Dentry] `state:".(*Dentry)"`
name string
// If cached is true, dentryEntry links dentry into
// Filesystem.cachedDentries. cached and dentryEntry are protected by
// Filesystem.mu.
cached bool
dentryEntry
// dirMu protects children and the names of child Dentries.
//
// Note that holding fs.mu for writing is not sufficient;
// revalidateChildLocked(), which is a very hot path, may modify children with
// fs.mu acquired for reading only.
dirMu sync.Mutex `state:"nosave"`
children map[string]*Dentry
inode Inode
// If deleted is non-zero, the file represented by this dentry has been
// deleted. deleted is accessed using atomic memory operations.
deleted atomicbitops.Uint32
}
// IncRef implements vfs.DentryImpl.IncRef.
func (d *Dentry) IncRef() {
// d.refs may be 0 if d.fs.mu is locked, which serializes against
// d.cacheLocked().
r := d.refs.Add(1)
if d.LogRefs() {
refs.LogIncRef(d, r)
}
}
// TryIncRef implements vfs.DentryImpl.TryIncRef.
func (d *Dentry) TryIncRef() bool {
for {
r := d.refs.Load()
if r <= 0 {
return false
}
if d.refs.CompareAndSwap(r, r+1) {
if d.LogRefs() {
refs.LogTryIncRef(d, r+1)
}
return true
}
}
}
// DecRef implements vfs.DentryImpl.DecRef.
func (d *Dentry) DecRef(ctx context.Context) {
r := d.refs.Add(-1)
if d.LogRefs() {
refs.LogDecRef(d, r)
}
if r == 0 {
if d.inode.Anonymous() {
// Nothing to cache. Skip right to destroy. This avoids
// taking fs.mu in the DecRef() path for anonymous
// inodes.
d.destroy(ctx)
return
}
d.fs.mu.Lock()
defer d.fs.mu.Unlock()
d.cacheLocked(ctx)
} else if r < 0 {
panic("kernfs.Dentry.DecRef() called without holding a reference")
}
}
func (d *Dentry) decRefLocked(ctx context.Context) {
r := d.refs.Add(-1)
if d.LogRefs() {
refs.LogDecRef(d, r)
}
if r == 0 {
d.cacheLocked(ctx)
} else if r < 0 {
panic("kernfs.Dentry.DecRef() called without holding a reference")
}
}
// Invalidate invalidates the dentry and its children.
func (d *Dentry) Invalidate(ctx context.Context) {
d.fs.mu.RLock()
defer d.fs.processDeferredDecRefs(ctx)
defer d.fs.mu.RUnlock()
parent := d.parent.Load()
if parent == nil {
return
}
parent.dirMu.Lock()
child := parent.children[d.name]
if child != d {
parent.dirMu.Unlock()
return
}
delete(parent.children, d.name)
parent.dirMu.Unlock()
d.fs.invalidateRemovedChildLocked(ctx, d.fs.vfsfs.VirtualFilesystem(), child)
}
// cacheLocked should be called after d's reference count becomes 0. The ref
// count check may happen before acquiring d.fs.mu so there might be a race
// condition where the ref count is increased again by the time the caller
// acquires d.fs.mu. This race is handled.
// Only reachable dentries are added to the cache. However, a dentry might
// become unreachable *while* it is in the cache due to invalidation.
//
// Preconditions: d.fs.mu must be locked for writing.
func (d *Dentry) cacheLocked(ctx context.Context) {
// Dentries with a non-zero reference count must be retained. (The only way
// to obtain a reference on a dentry with zero references is via path
// resolution, which requires d.fs.mu, so if d.refs is zero then it will
// remain zero while we hold d.fs.mu for writing.)
refs := d.refs.Load()
if refs == -1 {
// Dentry has already been destroyed.
return
}
if refs > 0 {
if d.cached {
d.fs.cachedDentries.Remove(d)
d.fs.cachedDentriesLen--
d.cached = false
}
return
}
// If the dentry is deleted and invalidated or has no parent, then it is no
// longer reachable by path resolution and should be dropped immediately
// because it has zero references.
// Note that a dentry may not always have a parent; for example magic links
// as described in Inode.Getlink.
if isDead, parent := d.VFSDentry().IsDead(), d.parent.Load(); isDead || parent == nil {
if !isDead {
rcs := d.fs.vfsfs.VirtualFilesystem().InvalidateDentry(ctx, d.VFSDentry())
for _, rc := range rcs {
d.fs.deferDecRef(rc)
}
}
if d.cached {
d.fs.cachedDentries.Remove(d)
d.fs.cachedDentriesLen--
d.cached = false
}
if d.isDeleted() {
d.inode.Watches().HandleDeletion(ctx)
}
d.destroy(ctx)
if parent != nil {
parent.decRefLocked(ctx)
}
return
}
if d.VFSDentry().IsEvictable() {
d.evictLocked(ctx)
return
}
// If d is already cached, just move it to the front of the LRU.
if d.cached {
d.fs.cachedDentries.Remove(d)
d.fs.cachedDentries.PushFront(d)
return
}
// Cache the dentry, then evict the least recently used cached dentry if
// the cache becomes over-full.
d.fs.cachedDentries.PushFront(d)
d.fs.cachedDentriesLen++
d.cached = true
if d.fs.cachedDentriesLen <= d.fs.MaxCachedDentries {
return
}
d.fs.evictCachedDentryLocked(ctx)
// Whether or not victim was destroyed, we brought fs.cachedDentriesLen
// back down to fs.opts.maxCachedDentries, so we don't loop.
}
// Preconditions:
// - fs.mu must be locked for writing.
func (fs *Filesystem) evictCachedDentryLocked(ctx context.Context) {
// Evict the least recently used dentry because cache size is greater than
// max cache size (configured on mount).
fs.cachedDentries.Back().evictLocked(ctx)
}
// Preconditions:
// - d.fs.mu must be locked for writing.
func (d *Dentry) evictLocked(ctx context.Context) {
if d == nil {
return
}
if d.cached {
d.fs.cachedDentries.Remove(d)
d.fs.cachedDentriesLen--
d.cached = false
}
// victim.refs may have become non-zero from an earlier path resolution
// after it was inserted into fs.cachedDentries.
if d.refs.Load() == 0 {
if !d.vfsd.IsDead() {
parent := d.parent.Load()
parent.dirMu.Lock()
// Note that victim can't be a mount point (in any mount
// namespace), since VFS holds references on mount points.
rcs := d.fs.vfsfs.VirtualFilesystem().InvalidateDentry(ctx, d.VFSDentry())
for _, rc := range rcs {
d.fs.deferDecRef(rc)
}
delete(parent.children, d.name)
parent.dirMu.Unlock()
}
d.destroy(ctx)
if parent := d.parent.Load(); parent != nil {
parent.decRefLocked(ctx)
}
}
}
// destroy destroys the dentry.
//
// Preconditions:
// - d.refs == 0.
// - d should have been removed from d.parent.children, i.e. d is not reachable
// by path traversal.
// - d.vfsd.IsDead() is true.
func (d *Dentry) destroy(ctx context.Context) {
switch refs := d.refs.Load(); refs {
case 0:
// Mark the dentry destroyed.
d.refs.Store(-1)
case -1:
panic("dentry.destroy() called on already destroyed dentry")
default:
panic("dentry.destroy() called with references on the dentry")
}
d.inode.UnregisterDentry(d)
d.inode.DecRef(ctx) // IncRef from Init.
refs.Unregister(d)
}
// RefType implements refs.CheckedObject.Type.
func (d *Dentry) RefType() string {
return "kernfs.Dentry"
}
// LeakMessage implements refs.CheckedObject.LeakMessage.
func (d *Dentry) LeakMessage() string {
return fmt.Sprintf("[kernfs.Dentry %p] reference count of %d instead of -1", d, d.refs.Load())
}
// LogRefs implements refs.CheckedObject.LogRefs.
//
// This should only be set to true for debugging purposes, as it can generate an
// extremely large amount of output and drastically degrade performance.
func (d *Dentry) LogRefs() bool {
return false
}
// InitRoot initializes this dentry as the root of the filesystem.
//
// Precondition: Caller must hold a reference on inode.
//
// Postcondition: Caller's reference on inode is transferred to the dentry.
func (d *Dentry) InitRoot(fs *Filesystem, inode Inode) {
d.Init(fs, inode)
fs.root = d
// Hold an extra reference on the root dentry. It is held by fs to prevent the
// root from being "cached" and subsequently evicted.
d.IncRef()
}
// Init initializes this dentry.
//
// Precondition: Caller must hold a reference on inode.
//
// Postcondition: Caller's reference on inode is transferred to the dentry.
func (d *Dentry) Init(fs *Filesystem, inode Inode) {
d.vfsd.Init(d)
d.fs = fs
d.inode = inode
d.refs.Store(1)
switch inode.Mode().FileType() {
case linux.ModeDirectory:
d.flags = atomicbitops.FromUint32(d.flags.RacyLoad() | dflagsIsDir)
case linux.ModeSymlink:
d.flags = atomicbitops.FromUint32(d.flags.RacyLoad() | dflagsIsSymlink)
case linux.ModeRegular:
d.flags = atomicbitops.FromUint32(d.flags.RacyLoad() | dflagsIsRegular)
}
refs.Register(d)
inode.RegisterDentry(d)
}
// VFSDentry returns the generic vfs dentry for this kernfs dentry.
func (d *Dentry) VFSDentry() *vfs.Dentry {
return &d.vfsd
}
func (d *Dentry) isDeleted() bool {
return d.deleted.Load() != 0
}
func (d *Dentry) setDeleted() {
d.deleted.Store(1)
}
// isDir checks whether the dentry points to a directory inode.
func (d *Dentry) isDir() bool {
return d.flags.Load()&dflagsIsDir != 0
}
// isSymlink checks whether the dentry points to a symlink inode.
func (d *Dentry) isSymlink() bool {
return d.flags.Load()&dflagsIsSymlink != 0
}
// isRegular checks whether the dentry points to a regular file inode.
func (d *Dentry) isRegular() bool {
return d.flags.Load()&dflagsIsRegular != 0
}
// InotifyWithParent implements vfs.DentryImpl.InotifyWithParent.
func (d *Dentry) InotifyWithParent(ctx context.Context, events, cookie uint32, et vfs.EventType) {
if d.isDir() {
events |= linux.IN_ISDIR
}
// Linux always notifies the parent first.
// Don't bother looking for a parent if the inode is anonymous. It
// won't have one.
if !d.inode.Anonymous() {
d.fs.ancestryMu.RLock()
if parent := d.parent.Load(); parent != nil {
parent.inode.Watches().Notify(ctx, d.name, events, cookie, et, d.isDeleted())
}
d.fs.ancestryMu.RUnlock()
}
d.inode.Watches().Notify(ctx, "", events, cookie, et, d.isDeleted())
}
// Watches implements vfs.DentryImpl.Watches.
func (d *Dentry) Watches() *vfs.Watches {
return d.inode.Watches()
}
// OnZeroWatches implements vfs.Dentry.OnZeroWatches.
func (d *Dentry) OnZeroWatches(context.Context) {}
// insertChild inserts child into the vfs dentry cache with the given name under
// this dentry. This does not update the directory inode, so calling this on its
// own isn't sufficient to insert a child into a directory.
//
// Preconditions:
// - d must represent a directory inode.
// - d.fs.mu must be locked for at least reading.
func (d *Dentry) insertChild(name string, child *Dentry) {
d.dirMu.Lock()
d.insertChildLocked(name, child)
d.dirMu.Unlock()
}
// insertChildLocked is equivalent to insertChild, with additional
// preconditions.
//
// Preconditions:
// - d must represent a directory inode.
// - d.dirMu must be locked.
// - d.fs.mu must be locked for at least reading.
func (d *Dentry) insertChildLocked(name string, child *Dentry) {
if !d.isDir() {
panic(fmt.Sprintf("insertChildLocked called on non-directory Dentry: %+v.", d))
}
d.IncRef() // DecRef in child's Dentry.destroy.
child.parent.Store(d)
child.name = name
if d.children == nil {
d.children = make(map[string]*Dentry)
}
d.children[name] = child
}
// Inode returns the dentry's inode.
func (d *Dentry) Inode() Inode {
return d.inode
}
// FSLocalPath returns an absolute path to d, relative to the root of its
// filesystem.
func (d *Dentry) FSLocalPath() string {
var b fspath.Builder
_ = genericPrependPath(d.fs, vfs.VirtualDentry{}, nil, d, &b)
b.PrependByte('/')
return b.String()
}
// WalkDentryTree traverses p in the dentry tree for this filesystem. Note that
// this only traverses the dentry tree and is not a general path traversal. No
// symlinks and dynamic children are resolved, and no permission checks are
// performed. The caller is responsible for ensuring the returned Dentry exists
// for an appropriate lifetime.
//
// p is interpreted starting at d, and may be absolute or relative (absolute vs
// relative paths both refer to the same target here, since p is absolute from
// d). p may contain "." and "..", but will not allow traversal above d (similar
// to ".." at the root dentry).
//
// This is useful for filesystem internals, where the filesystem may not be
// mounted yet. For a mounted filesystem, use GetDentryAt.
func (d *Dentry) WalkDentryTree(ctx context.Context, vfsObj *vfs.VirtualFilesystem, p fspath.Path) (*Dentry, error) {
d.fs.mu.RLock()
defer d.fs.processDeferredDecRefs(ctx)
defer d.fs.mu.RUnlock()
target := d
for pit := p.Begin; pit.Ok(); pit = pit.Next() {
pc := pit.String()
switch {
case target == nil:
return nil, linuxerr.ENOENT
case pc == ".":
// No-op, consume component and continue.
case pc == "..":
if target == d {
// Don't let .. traverse above the start point of the walk.
continue
}
target = target.parent.Load()
// Parent doesn't need revalidation since we revalidated it on the
// way to the child, and we're still holding fs.mu.
default:
var err error
target, err = d.fs.revalidateChildLocked(ctx, vfsObj, target, pc)
if err != nil {
return nil, err
}
}
}
if target == nil {
return nil, linuxerr.ENOENT
}
target.IncRef()
return target, nil
}
// Parent returns the parent of this Dentry. This is not safe in general, the
// filesystem may concurrently move d elsewhere. The caller is responsible for
// ensuring the returned result remains valid while it is used.
func (d *Dentry) Parent() *Dentry {
return d.parent.Load()
}
// The Inode interface maps filesystem-level operations that operate on paths to
// equivalent operations on specific filesystem nodes.
//
// The interface methods are groups into logical categories as sub interfaces
// below. Generally, an implementation for each sub interface can be provided by
// embedding an appropriate type from inode_impl_utils.go. The sub interfaces
// are purely organizational. Methods declared directly in the main interface
// have no generic implementations, and should be explicitly provided by the
// client filesystem.
//
// Generally, implementations are not responsible for tasks that are common to
// all filesystems. These include:
//
// - Checking that dentries passed to methods are of the appropriate file type.
// - Checking permissions.
//
// Inode functions may be called holding filesystem wide locks and are not
// allowed to call vfs functions that may reenter, unless otherwise noted.
//
// Specific responsibilities of implementations are documented below.
type Inode interface {
// Methods related to reference counting. A generic implementation is
// provided by InodeNoopRefCount. These methods are generally called by the
// equivalent Dentry methods.
inodeRefs
// Methods related to node metadata. A generic implementation is provided by
// InodeAttrs. Note that a concrete filesystem using kernfs is responsible for
// managing link counts.
inodeMetadata
// Method for inodes that represent symlink. InodeNotSymlink provides a
// blanket implementation for all non-symlink inodes.
inodeSymlink
// Method for inodes that represent directories. InodeNotDirectory provides
// a blanket implementation for all non-directory inodes.
inodeDirectory
// Open creates a file description for the filesystem object represented by
// this inode. The returned file description should hold a reference on the
// dentry for its lifetime.
//
// Precondition: rp.Done(). vfsd.Impl() must be the kernfs Dentry containing
// the inode on which Open() is being called.
Open(ctx context.Context, rp *vfs.ResolvingPath, d *Dentry, opts vfs.OpenOptions) (*vfs.FileDescription, error)
// StatFS returns filesystem statistics for the client filesystem. This
// corresponds to vfs.FilesystemImpl.StatFSAt. If the client filesystem
// doesn't support statfs(2), this should return ENOSYS.
StatFS(ctx context.Context, fs *vfs.Filesystem) (linux.Statfs, error)
// Keep indicates whether the dentry created after Inode.Lookup should be
// kept in the kernfs dentry tree.
Keep() bool
// Valid should return true if this inode is still valid, or needs to
// be resolved again by a call to Lookup.
Valid(ctx context.Context, parent *Dentry, name string) bool
// Watches returns the set of inotify watches associated with this inode.
Watches() *vfs.Watches
// Anonymous indicates that the Inode is anonymous. It will never have
// a name or parent.
Anonymous() bool
// RegisterDentry is called when a new dentry representing the inode is
// created.
RegisterDentry(d *Dentry)
// UnregisterDentry is called when the specified dentry is destroyed.
UnregisterDentry(d *Dentry)
}
type inodeRefs interface {
IncRef()
DecRef(ctx context.Context)
TryIncRef() bool
}
type inodeMetadata interface {
// CheckPermissions checks that creds may access this inode for the
// requested access type, per the rules of
// fs/namei.c:generic_permission().
CheckPermissions(ctx context.Context, creds *auth.Credentials, ats vfs.AccessTypes) error
// Mode returns the (struct stat)::st_mode value for this inode. This is
// separated from Stat for performance.
Mode() linux.FileMode
// UID returns the (struct stat)::st_uid value for this inode. This is
// separated from Stat for performance.
UID() auth.KUID
// GID returns the (struct stat)::st_gid value for this inode. This is
// separated from Stat for performance.
GID() auth.KGID
// Stat returns the metadata for this inode. This corresponds to
// vfs.FilesystemImpl.StatAt.
Stat(ctx context.Context, fs *vfs.Filesystem, opts vfs.StatOptions) (linux.Statx, error)
// SetStat updates the metadata for this inode. This corresponds to
// vfs.FilesystemImpl.SetStatAt. Implementations are responsible for checking
// if the operation can be performed (see vfs.CheckSetStat() for common
// checks).
SetStat(ctx context.Context, fs *vfs.Filesystem, creds *auth.Credentials, opts vfs.SetStatOptions) error
}
// Precondition: All methods in this interface may only be called on directory
// inodes.
type inodeDirectory interface {
// The New{File,Dir,Node,Link,Symlink} methods below should return a new inode
// that will be hashed into the dentry tree.
//
// These inode constructors are inode-level operations rather than
// filesystem-level operations to allow client filesystems to mix different
// implementations based on the new node's location in the
// filesystem.
// HasChildren returns true if the directory inode has any children.
HasChildren() bool
// NewFile creates a new regular file inode.
NewFile(ctx context.Context, name string, opts vfs.OpenOptions) (Inode, error)
// NewDir creates a new directory inode.
NewDir(ctx context.Context, name string, opts vfs.MkdirOptions) (Inode, error)
// NewLink creates a new hardlink to a specified inode in this
// directory. Implementations should create a new kernfs Dentry pointing to
// target, and update target's link count.
NewLink(ctx context.Context, name string, target Inode) (Inode, error)
// NewSymlink creates a new symbolic link inode.
NewSymlink(ctx context.Context, name, target string) (Inode, error)
// NewNode creates a new filesystem node for a mknod syscall.
NewNode(ctx context.Context, name string, opts vfs.MknodOptions) (Inode, error)
// Unlink removes a child dentry from this directory inode.
Unlink(ctx context.Context, name string, child Inode) error
// RmDir removes an empty child directory from this directory
// inode. Implementations must update the parent directory's link count,
// if required. Implementations are not responsible for checking that child
// is a directory, or checking for an empty directory.
RmDir(ctx context.Context, name string, child Inode) error
// Rename is called on the source directory containing an inode being
// renamed. child points to the resolved child in the source directory.
// dstDir is guaranteed to be a directory inode.
//
// On a successful call to Rename, the caller updates the dentry tree to
// reflect the name change.
//
// Precondition: Caller must serialize concurrent calls to Rename.
Rename(ctx context.Context, oldname, newname string, child, dstDir Inode) error
// Lookup should return an appropriate inode if name should resolve to a
// child of this directory inode. This gives the directory an opportunity
// on every lookup to resolve additional entries. This is only called when
// the inode is a directory.
//
// The child returned by Lookup will be hashed into the VFS dentry tree,
// at least for the duration of the current FS operation.
//
// Lookup must return the child with an extra reference whose ownership is
// transferred to the dentry that is created to point to that inode. If
// Inode.Keep returns false, that new dentry will be dropped at the end of
// the current filesystem operation (before returning back to the VFS
// layer) if no other ref is picked on that dentry. If Inode.Keep returns
// true, then the dentry will be cached into the dentry tree until it is
// Unlink'd or RmDir'd.
Lookup(ctx context.Context, name string) (Inode, error)
// IterDirents is used to iterate over dynamically created entries. It invokes
// cb on each entry in the directory represented by the Inode.
// 'offset' is the offset for the entire IterDirents call, which may include
// results from the caller (e.g. "." and ".."). 'relOffset' is the offset
// inside the entries returned by this IterDirents invocation. In other words,
// 'offset' should be used to calculate each vfs.Dirent.NextOff as well as
// the return value, while 'relOffset' is the place to start iteration.
IterDirents(ctx context.Context, mnt *vfs.Mount, callback vfs.IterDirentsCallback, offset, relOffset int64) (newOffset int64, err error)
}
type inodeSymlink interface {
// Readlink returns the target of a symbolic link. If an inode is not a
// symlink, the implementation should return EINVAL.
//
// Readlink is called with no kernfs locks held, so it may reenter if needed
// to resolve symlink targets.
Readlink(ctx context.Context, mnt *vfs.Mount) (string, error)
// Getlink returns the target of a symbolic link, as used by path
// resolution:
//
// - If the inode is a "magic link" (a link whose target is most accurately
// represented as a VirtualDentry), Getlink returns (ok VirtualDentry, "",
// nil). A reference is taken on the returned VirtualDentry.
//
// - If the inode is an ordinary symlink, Getlink returns (zero-value
// VirtualDentry, symlink target, nil).
//
// - If the inode is not a symlink, Getlink returns (zero-value
// VirtualDentry, "", EINVAL).
Getlink(ctx context.Context, mnt *vfs.Mount) (vfs.VirtualDentry, string, error)
}
// InodeWithXattrs should be implemented by kernfs Inodes that support xattrs.
type InodeWithXattrs interface {
// GetXattr returns the value associated with the given extended attribute.
GetXattr(ctx context.Context, opts vfs.GetXattrOptions) (string, error)
// SetXattr changes the value associated with the given extended attribute.
SetXattr(ctx context.Context, opts vfs.SetXattrOptions) error
// ListXattr returns the names of the extended attributes.
ListXattr(ctx context.Context, size uint64) ([]string, error)
// RemoveXattr removes the given extended attribute.
RemoveXattr(ctx context.Context, name string) error
}