mirror of
https://github.com/seaweedfs/seaweedfs.git
synced 2026-08-19 21:56:54 +00:00
Chris LuandGitHub
47b491b53c
* filer: stamp a log position on lookup and remote-cache responses Metadata events are logged after their store write and stamped with the filer clock. Reading that clock before serving an entry therefore gives a timestamp with a causal guarantee: every event at or below it is reflected in the returned entry. Clients caching filer state can use it as the entry's version to order the response against subscription events, including events committed before the call but delivered after it. * mount: version open file handles by filer log position A subscription event refreshing an open handle did a second lookup; a transient failure left the handle pinned to its old entry with no retry, since the subscription cursor had already advanced. The deeper problem is ordering: the handle is a cache written by three unordered channels — the async invalidation worker, local mutation acks, and open-time lookups — and overwriting cached state safely requires knowing which write is newer. The filer log timestamp is that order, and it now travels with every value instead of being derived out of band. Events carry it natively; lookup and remote-cache responses carry the log position stamped before the serving read; mutation acks carry it in their returned event; and the local store pairs each read with a version cursor advanced under the same lock as the store write. Each handle records the version its entry reflects, and one rule replaces the per-site reasoning: state at or below the handle's version is old news and must not be installed. The invalidation itself applies the event's own entry — no lookup, so no transient-failure window — except under a cached parent, where the store entry is the ordered merge of the event and anything applied since, and its version outranks the event's. An uncached parent receives no store writes, so a hit there would be a stale leftover masking the event. A vacated path (delete, rename away) keeps the last entry so unlinked-but-open reads still work. Directory builds version the completed directory at the listing snapshot and re-invalidate buffered events at that version, since their mid-build refresh ran against an incomplete store. The tests replay every race this replaces machinery for: rollback of a newer local flush (queued, cached, and read-through), stale leftovers under uncached parents, the build window including abort, handles opened after an event was queued, events landing mid-lookup, and undelivered events at remote-cache time across a filer failover. * filer: serialize the log position fence with mutations, stamp mutation acks The fence stamped before an unlocked entry read could precede state the read returned: a mutation writes storage first and assigns its event timestamp only at notify time, so a lookup racing that window handed the mount an entry newer than its fence, and the event's later delivery looked like fresh news — destroying dirty pages for a change the handle already had. The mutation handlers already hold an exclusive per-path lock across read, write, and notify; the lookup and remote-cache reads now take it shared around the stamp and the read, making the fence exact: everything at or below it is in the entry, nothing above it is. A no-change update returns success without an event, leaving the mount nothing to fence with even though the response confirms current state. Create and update acks now carry a log position stamped under the same lock, and the mount falls back to it whenever the ack has no event. Also regenerate the VT marshalers, which the earlier generation missed: without them a VT round-trip silently zeroed every log position. * java: sync filer.proto * mount: scope store versions to what they vouch for; atomic handle install The store's version cursor claimed too much. Advanced by local mutation acks and directory listing snapshots, it inflated the version of store reads for unrelated paths whose events the subscription still owed, and those events were then fenced out permanently. The cursor now tracks subscription progress only — events arrive in log order, so everything at or below it has been delivered for every path — and a completed listing records its snapshot as a per-directory floor instead of a global claim. Local acks never touch it: they version their own handle directly. Buffered build events advance the cursor at delivery, since their store write may never happen (abort) while their invalidation is already queued; their read-through directory pairs no store read with it, and rename fragments are applied first. Concurrent first opens raced: a slower opener's older lookup could overwrite the newer entry a faster opener had installed, while the monotonic version kept the newer timestamp — an old entry fenced at a new version, immune to every correcting event. Entry and version are now installed as one decision under the handle map lock, and an install that does not outrank the handle's version is dropped. The remote-cache commit also escaped the fence: it wrote storage and notified without the path lock, so a lookup's shared-locked fence and read could land between the two and hand out the cached state under-versioned. The commit now re-reads and writes under the exclusive path lock, and backs off entirely when the entry changed during the download — the concurrent writer supersedes the cached content. * mount: floors gate store applies; installs respect handle users; renames join the fence A directory floor certifies the listing state as of its snapshot, but a delayed event at or below the floor was still applied to the store — rolling the content back to pre-snapshot state while the floor kept claiming the snapshot version, so the correcting events were fenced out of every future read. Events are now gated against the affected directory's floor, each half of a rename independently. Fences are lower bounds: a listing or lookup can include a mutation whose event has not been delivered yet, and that event later passes every gate carrying state the handle already holds. Such a re-delivery now advances the version without destroying dirty pages or reinstalling the entry — invalidating local writes over a no-op was the real damage in every remaining under-fence window, including the unlocked listing snapshot, which no per-path lock can serialize. The concurrent-open install moved from the map lock to the handle lock every reader, writer, and invalidation synchronizes on, and rejects what cannot improve the handle: dirty state (local writes would be lost), unversioned lookup responses (they cannot outrank anything, and two zero-version opens must not overwrite each other), and anything not strictly newer. New handles are still fully initialized before the map exposes them. Renames committed metadata and emitted events with no path lock, so a lookup could read the renamed state under a fence preceding its events. Both rename handlers now hold the source and destination locks, ordered by path, across commit and notification; descendants of a renamed directory are not individually locked and rely on the no-op re-delivery handling above. * mount: per-entry store versions replace the cursor and directory floors The store's aggregate versions — a global subscription cursor and per-directory listing floors — were versions at coarser granularity than the values they described, and every over-claiming bug in this series traced to that gap: an aggregate vouching for state its source never saw. Each store entry now carries the filer log position of the write that produced it — the event that applied it, or the listing snapshot that inserted it, recorded in the store's key-value space under the same lock as the entry write. The store becomes what the handle already is: a last-writer-wins register with one rule, install only what outranks the current claim. The cursor, the floors, their advancement rules, the pairing ordering constraint, and the floor gating all collapse into that rule. Applies are gated per entry, each half of a rename independently; an unversioned local write clears the claim its content no longer proves; version records lingering after a bulk folder wipe cannot fence a recreate, since a claim only blocks while its entry exists. Listing inserts are stamped at build completion, before the buffered replay so newer replayed events override the stamp. Filer side, the fence dance every versioned read must perform is now a single choke point, fencedFindEntry, so a future read RPC gets the lock-serialized stamp by construction rather than by convention. * mount: judge no-op re-deliveries against an immutable base, not the live entry The equal-state skip compared the incoming event to the live handle entry, but local writes mutate the live entry — size, timestamps, chunks — so a delayed event re-delivering the base the handle was opened with no longer matched, and the installer destroyed the dirty pages and rolled the entry back over nothing new. The handle now keeps an immutable snapshot of the filer state it last installed or acknowledged, refreshed at every install and mutation ack (flush acks snapshot the request entry before the id mapping mutates it), and the no-op judgment runs against that base: an event carrying the base brings nothing, whatever the live entry has diverged to since. * mount: tombstones for versioned deletes, absence floors, copy enrollment Four gaps in the per-entry version protocol, all the same shape: a versioned fact with nothing carrying its version. A deletion is a fact about a path with no entry left to hold it — clearing the record let a delayed older event resurrect the deleted path, permanently, since the deletion's own redelivery is dedup-suppressed. Versioned deletes now leave a tombstone record that fences without an entry; renames tombstone their source the same way. Plain records still only block while their entry exists, so records lingering after a bulk folder wipe cannot fence a recreate. A completed listing proves absences as well as presences: a name it omitted was deleted as of the snapshot, and a delayed create below the snapshot re-creates it. The snapshot is kept per directory strictly as an absence fence, consulted only when a path has neither an entry nor a version record — present entries carry their own versions and never touch it, which is what separates this from the over-claiming floor it replaces. A rebuild against a pre-upgrade filer returns no snapshot; stamping now clears the children's records in that case, so a reinserted entry cannot reactivate the stale claim its previous incarnation left behind and reject valid events below it. Server-side copies installed the copied entry without enrolling in the base protocol, so the copy's own event differed from the stale pre-copy base and destroyed writes made to the destination after the copy. The install now refreshes the base and takes its version from the fenced readback. * mount: deletion facts outlive the cache's knowledge of the entry A versioned delete of a path the store held no entry for recorded nothing, so a delayed older event recreated the path — permanently, with the deletion's redelivery dedup-suppressed. The tombstone is now written whenever a versioned event vacates a path: the deletion is a fact about the path, not about what this cache happened to hold. For an absent entry, the listing's absence floor now speaks whatever older record remains: a tombstone at one position does not exhaust what is known about the path when a newer snapshot has confirmed the name still absent, and an event between the two was slipping past both. A committed copy whose readback failed installed a synthesized base with local timestamps; the copy's real event legitimately differs from it, and was read as foreign state — destroying writes made to the destination after the copy. The handle now marks that its own event is en route and adopts that event's state as the base without touching the live entry or the dirty pages; the adoption is one-shot, so a genuinely foreign event still invalidates. * mount: authoritative acks cancel pending event adoption; tombstones scoped and pruned The copy-event adoption flag could outlive its purpose: a flush after the failed readback installs a newer base and advances the version, the copy's own event is then version gated without consuming the flag, and the next genuinely foreign event was silently adopted — base advanced, live entry and dirty pages untouched — leaving the mount to later overwrite that remote change. Every local acknowledgment now installs its base through one helper that also cancels any pending adoption: the ack supersedes the mutation the adoption was waiting for. Tombstones were written for every versioned delete under the mount and survived directory eviction by design, growing LevelDB with historical deletions on delete-heavy mounts. They are now scoped to directories whose cached state the fence actually protects — an uncached parent never serves from the store nor applies the resurrecting insert — and a completed listing prunes the direct-child tombstones its absence floor supersedes, leaving only those above the snapshot. The store gains a key-prefix visitor for the sweep. * mount: acked saves install their value; trailer snapshots; direct-child prune range A version must never advance without its value. saveEntry stamped any open handle with the acknowledgment's version, but a handle opened while the save was in flight holds the pre-mutation entry — stamping it fenced out the events carrying the state it lacked, permanently, with the local apply performing no invalidation and the redelivery deduplicated. The acknowledged entry is now installed together with its version, through the same guarded install the racing-open path uses: under the handle lock, only when it outranks the handle, never over dirty local writes. Empty listings return no in-band snapshot — a snapshot-only response would be read as an entry by older consumers — so directories that end empty gained no absence floor and their tombstones were never pruned. The filer now sends the snapshot in the stream trailer, which older clients ignore, and the client reads it when no in-band snapshot arrived. Empty directories get real floors, their tombstones prune, and their buffered replays gain the snapshot filter instead of the replay-all fallback. Version records now encode the parent directory and name separated by a NUL, making a directory's direct children one contiguous key range: the tombstone prune scans exactly them under the cache lock, instead of walking every descendant record — the whole store, for root. * mount: fix dirty-page loss, uid/gid base, download race, copy adopt, leak; dedup Correctness fixes from the versioned-invalidation review: - A foreign delete/rename-away of a file held open with unflushed local writes destroyed the dirty pages unconditionally. A process may keep writing to an unlinked-but-open file and those writes were already acknowledged; preserve the pages when the handle is dirty. - downloadRemoteEntry stored the handle's base with filer-side uid/gid while every candidate it is later compared against is in local form, so under a non-identity UidGidMapper an unchanged re-delivery looked foreign and force-destroyed dirty pages. Map the base to local. - downloadRemoteEntry wrote the entry/base/version triple under only the handle's shared lock, so two concurrent reads of the same remote-only file could tear it. Serialize the install with a dedicated mutex (invalidation is already excluded by the exclusive handle lock). - A committed server-side copy whose readback failed adopted the FIRST event past the version gate as its base; a foreign write delivered first was silently swallowed. Adopt only an event whose content matches the synthesized base — the copy's own event — and install any other normally. - The deferred-create path relied on AcquireFileHandle installing the passed entry on a pre-existing handle, which the version rework dropped. Restore that install in the compat wrapper; the versioned open path keeps its gated install. Growth and hot-path cost: - Per-entry version records and tombstones leaked when a directory was evicted or read-through without a rebuild. An uncached directory gates its own inserts, so its records fence nothing; clear a directory's child version records when it is wiped for eviction. - FindEntry paid for the version KvGet on every lookup/getattr cache hit and threw it away. FindEntry now reads only the entry; the hot lookupEntry cache-hit path skips the version entirely. Cleanups: - Extract ackVersionTsNs over the shared response interface, replacing the metadata-event-else-log-ts snippet copy-pasted at four ack sites. - Extract acquireRenamePathLocks, replacing the verbatim sorted two-path lock fence in both rename handlers. * mount: no resurrection on foreign delete, version no-event acks, gate downloads, tighten copy adopt Follow-ups to the review patches: - Preserving dirty pages on a foreign delete let the next flush pass the isDeleted guard and CreateEntry, resurrecting the remotely-unlinked name. Mark the handle deleted in the vacate branch: the open fd can still read its buffered writes, but a flush no longer recreates the file. - A no-event acknowledgment (log fence only) synthesized a metadata event with TsNs 0, so the cache stored the entry unversioned and an older subscriber event rolled it back. Stamp the synthesized event with the ack's log position at all four ack sites. - downloadRemoteEntry serialized its install but did not check the version, so an older response arriving last overwrote the entry/base while the monotonic version kept the newer value, fencing corrections out. Install only when the response is at least as new as the handle. - sameEntryContent compared only size and chunks, so a foreign chmod with unchanged content was adopted as the copy's own event. Compare everything except server-assigned timestamps, so a metadata-only foreign change installs instead. * mount: trim comments to the non-obvious why The versioning work accumulated multi-line comment blocks restating what the code says. Keep the constraint a reader cannot derive — why a fence is exact, why a version must not advance without its value, why an uncached parent's records fence nothing — and drop the rest. * mount: distinguish rename from delete, tighten the download and adopt gates - A rename emits a nil old-path invalidation just like an unlink, so the vacate branch marked the handle deleted and later writes through the already-open descriptor were skipped instead of persisted. Carry the delete/rename distinction on the invalidation and mark only an actual delete. - The remote-download install accepted an unversioned response regardless of the handle's version, so during a rolling upgrade a delayed response could install stale content under a newer version. Require the response to be at least as new, with one exception: a handle still lacking local chunks takes the content anyway — it cannot read without it — but does not claim the response's log position. - Copy-event adoption returned without installing, so a foreign touch arriving before the copy's own event lost its timestamps. Content is unchanged either way, so the dirty pages stay valid; a clean handle now takes the entry, while a dirty one keeps its diverged version. * mount: one directory floor instead of a record per child; agree on TTL Review feedback: - Build completion wrote one KV record per direct child inside the cache write lock, so a large directory stalled every other cache operation for O(children) store writes. The directory's listing snapshot already covers every child it saw; make that floor the version for any child without a record of its own, and a child earns a record only when a later event touches it. One map write per build replaces the per-child writes, with the same fencing. - The presence probe read the store directly and so counted a TTL-expired entry as present, judging the path by a record describing content that has logically vanished. It now applies the same expiry the read path does, and an expired path falls back to its directory floor. - Preserve ErrNotFound identity when the commit-time re-read finds the object deleted, so callers still surface a 404. - Assert the rename-away source fence timestamp in the invalidation test. Also record the tombstone ceiling: distinct deleted names in a cached directory accumulate until it is rebuilt or evicted, which prunes everything at or below the new snapshot. * mount: pin the fence's clock domain instead of letting skew decide A log-position fence is stamped by one filer's clock under that filer's in-process lock, so comparing it to an event another filer logged is comparing two unrelated clocks. The two error directions are not equally costly: applying an event the fence already covered is a re-apply the base-equality check absorbs, while skipping one it does not cover leaves the handle holding exactly the state the event was meant to correct, with the subscription cursor already past it — the unhealable staleness this whole PR exists to remove. So refuse to guess. Fences now carry the signature of the filer that stamped them, and a handle records it alongside the position. An event is only fenced out when the filer that logged it is the one that stamped the fence — the logging filer appends its own signature, so its presence identifies the clock domain. Events from any other filer are applied. Positions taken from events keep comparing as before; the subscription already delivers those in order. The invalidation callback takes a struct now: it carries the path, entry, position, delete/rename distinction, and signatures, and was about to need a fifth positional parameter. * mount: follow a foreign rename; key page invalidation on content, not equality - A rename's old-path invalidation now carries the destination, and the handle follows the file there: an open fd tracks the inode, and leaving it on the old path made its next flush recreate that name instead of updating the renamed file. - Dirty pages overlay content, so only a content change invalidates them. Keying that on exact equality meant any timestamp-only event destroyed them, which the copy-adoption marker existed to paper over — a foreign touch could consume the marker and leave the copy's own event to drop the post-copy writes. Comparing content instead makes the marker unnecessary, so it is gone: a metadata-only event keeps the overlay, and a dirty handle keeps its diverged entry unless foreign content supersedes it. - A remote download response that is merely older is now refused even when the handle still lacks chunks; only an unversioned one is taken (and claims no position), since an older response's content predates what the handle reflects. - A refused or unversioned download no longer publishes to the metadata cache, where a zero-position event would clear the entry's version and let an older subscriber event roll the cache back. * mount: page invalidation keys on content alone; unversioned writes claim no position - sameEntryContent compared everything but timestamps, so a foreign chmod, chown, or xattr change counted as a content change and destroyed the dirty-page overlay. It was strict only to serve the copy-adoption marker, which is gone; its one caller now asks the question it actually needs — did the bytes change — so metadata-only events leave the overlay alone. - A rename over an existing file destroys that file, but its open handle was left live and still pointed at the name the renamed source now occupies, so its flush could overwrite it. MovePath already reports the displaced inode; mark that handle deleted. - An acknowledgment was refused whenever its position was numerically lower, even when a different filer stamped the fence it lost to. Two known, differing signatures mean unrelated clocks, so the comparison no longer applies there; unknown signatures still compare as before. - A local write with no log position behind it now records that explicitly instead of deleting its version record. Absence means the directory listing covers the path, which is why the snapshot floor applies; local content the listing never saw must not inherit it, or the events that would correct it are fenced out. * mount: widen the existing lookup functions instead of forking WithVersion twins The versioning work grew a parallel function for every accessor that needed to return a log position — lookupEntryWithVersion beside lookupEntry, maybeLoadEntryWithVersion beside maybeLoadEntry, FindEntryWithVersion beside FindEntry, AcquireFileHandleWithVersion beside AcquireFileHandle, advanceEntryVersion beside advanceEntryVersionTsNs, plus a getPbEntryWithVersion wrapper and an InsertListedEntriesForTest hook. Two names for one operation is two places to keep in step, and the split let callers pick the one that happened to compile. Each pair is now the single original name carrying the position, with callers that do not want it discarding it. filer_pb.GetEntry returns the fence its response already carried rather than a mount-side wrapper re-issuing the lookup, and InsertEntry takes the position its content reflects rather than a test-only twin that inserted without one. The one behavioural knot the merge exposed: AcquireFileHandle had been installing the entry on a pre-existing handle only in its unversioned form, which conflated 'the caller is authoritative' with 'the lookup had no version'. Deferred create is the only caller that means the former, so it now installs explicitly and the map function just acquires.
927 lines
36 KiB
Go
927 lines
36 KiB
Go
package mount
|
|
|
|
import (
|
|
"bytes"
|
|
"context"
|
|
"math/rand/v2"
|
|
"os"
|
|
"path"
|
|
"path/filepath"
|
|
"sync"
|
|
"sync/atomic"
|
|
"time"
|
|
|
|
"github.com/seaweedfs/go-fuse/v2/fuse"
|
|
"google.golang.org/grpc"
|
|
"google.golang.org/protobuf/proto"
|
|
|
|
"github.com/seaweedfs/seaweedfs/weed/cluster"
|
|
"github.com/seaweedfs/seaweedfs/weed/filer"
|
|
"github.com/seaweedfs/seaweedfs/weed/filer/posixlock"
|
|
"github.com/seaweedfs/seaweedfs/weed/glog"
|
|
"github.com/seaweedfs/seaweedfs/weed/mount/meta_cache"
|
|
"github.com/seaweedfs/seaweedfs/weed/mount/page_writer"
|
|
"github.com/seaweedfs/seaweedfs/weed/pb"
|
|
"github.com/seaweedfs/seaweedfs/weed/pb/filer_pb"
|
|
"github.com/seaweedfs/seaweedfs/weed/pb/mount_pb"
|
|
"github.com/seaweedfs/seaweedfs/weed/security"
|
|
"github.com/seaweedfs/seaweedfs/weed/storage/types"
|
|
"github.com/seaweedfs/seaweedfs/weed/util"
|
|
"github.com/seaweedfs/seaweedfs/weed/util/chunk_cache"
|
|
"github.com/seaweedfs/seaweedfs/weed/util/grace"
|
|
"github.com/seaweedfs/seaweedfs/weed/util/version"
|
|
"github.com/seaweedfs/seaweedfs/weed/wdclient"
|
|
|
|
"github.com/seaweedfs/go-fuse/v2/fs"
|
|
)
|
|
|
|
type Option struct {
|
|
filerIndex int32 // align memory for atomic read/write
|
|
FilerAddresses []pb.ServerAddress
|
|
MountDirectory string
|
|
GrpcDialOption grpc.DialOption
|
|
FilerSigningKey security.SigningKey
|
|
FilerSigningExpiresAfterSec int
|
|
FilerMountRootPath string
|
|
Collection string
|
|
Replication string
|
|
TtlSec int32
|
|
DiskType types.DiskType
|
|
ChunkSizeLimit int64
|
|
ConcurrentWriters int
|
|
ConcurrentReaders int
|
|
CacheDirForRead string
|
|
CacheSizeMBForRead int64
|
|
CacheDirForWrite string
|
|
WriteBufferSizeMB int64
|
|
CacheMetaTTlSec int
|
|
DataCenter string
|
|
Umask os.FileMode
|
|
Quota int64
|
|
DisableXAttr bool
|
|
IsMacOs bool
|
|
|
|
MountUid uint32
|
|
MountGid uint32
|
|
MountMode os.FileMode
|
|
MountCtime time.Time
|
|
MountMtime time.Time
|
|
MountParentInode uint64
|
|
|
|
VolumeServerAccess string // how to access volume servers
|
|
Cipher bool // whether encrypt data on volume server
|
|
UidGidMapper *meta_cache.UidGidMapper
|
|
IncludeSystemEntries bool
|
|
|
|
// DefaultPermissions mirrors the FUSE default_permissions mount option.
|
|
// When set, the kernel enforces unix permission bits from the getattr/
|
|
// lookup attributes before it ever calls Open/Create/Mknod, so the mount
|
|
// skips its own redundant permission checks (and the group lookups behind
|
|
// them) on those hot paths.
|
|
DefaultPermissions bool
|
|
|
|
// Periodic metadata flush interval in seconds (0 to disable)
|
|
// This protects chunks from being purged by volume.fsck for long-running writes
|
|
MetadataFlushSeconds int
|
|
|
|
// RDMA acceleration options
|
|
RdmaEnabled bool
|
|
RdmaSidecarAddr string
|
|
RdmaFallback bool
|
|
RdmaReadOnly bool
|
|
RdmaMaxConcurrent int
|
|
RdmaTimeoutMs int
|
|
|
|
// Peer chunk sharing options (design-weed-mount-peer-chunk-sharing.md).
|
|
// When PeerEnabled is false (default), the mount runs exactly as today.
|
|
// One gRPC port carries everything: directory RPCs (ChunkAnnounce /
|
|
// ChunkLookup) and streaming FetchChunk byte transfers.
|
|
PeerEnabled bool
|
|
PeerListen string // host:port to bind the peer gRPC server
|
|
PeerAdvertise string // externally reachable host:port (optional; defaults to auto-detected host + PeerListen port)
|
|
PeerDataCenter string // optional data-center label advertised to peers
|
|
PeerRack string // optional rack label advertised to peers (finer than DC)
|
|
|
|
// Directory cache refresh/eviction controls
|
|
DirIdleEvictSec int
|
|
|
|
// EnableDistributedLock enables DLM-based write coordination across mounts.
|
|
// When true, opening a file for write acquires a distributed lock that is
|
|
// held (with auto-renewal) until the file is closed, so only one mount can
|
|
// have a file open for writing at a time; POSIX advisory locks (flock/fcntl)
|
|
// are also routed to the inode's owner filer so they are honored across
|
|
// mounts. Disabled under writeback cache, which implies single-writer.
|
|
EnableDistributedLock bool
|
|
|
|
// WritebackCache enables async flush on close for improved small file write performance.
|
|
// When true, Flush() returns immediately and data upload + metadata flush happen in background.
|
|
WritebackCache bool
|
|
|
|
// PosixDirNlink enables POSIX-compliant directory nlink counting
|
|
// (nlink = 2 + number_of_subdirectories). This requires listing
|
|
// cached directory entries on every stat, which has a performance cost.
|
|
// When false (default), directories report nlink=2.
|
|
PosixDirNlink bool
|
|
|
|
uniqueCacheDirForRead string
|
|
uniqueCacheDirForWrite string
|
|
}
|
|
|
|
type WFS struct {
|
|
// https://dl.acm.org/doi/fullHtml/10.1145/3310148
|
|
// follow https://github.com/hanwen/go-fuse/blob/master/fuse/api.go
|
|
fuse.RawFileSystem
|
|
mount_pb.UnimplementedSeaweedMountServer
|
|
fs.Inode
|
|
option *Option
|
|
metaCache *meta_cache.MetaCache
|
|
stats statsCache
|
|
chunkCache *chunk_cache.TieredChunkCache
|
|
writeBufferAccountant *page_writer.WriteBufferAccountant
|
|
signature int32
|
|
concurrentWriters *util.LimitedConcurrentExecutor
|
|
copyBufferPool sync.Pool
|
|
concurrentCopiersSem chan struct{}
|
|
inodeToPath *InodeToPath
|
|
fhMap *FileHandleToInode
|
|
dhMap *DirectoryHandleToInode
|
|
fuseServer *fuse.Server
|
|
IsOverQuota bool
|
|
fhLockTable *util.LockTable[FileHandleId]
|
|
hardLinkLockTable *util.LockTable[string]
|
|
posixLocks *PosixLockTable
|
|
posixSid uint64 // this mount's session id, for routed-lock owner identity
|
|
posixHint *posixLockHint // local fcntl-lock hint for routed mode
|
|
posixOwn *posixlock.Manager // mirror of locks this mount holds, re-asserted via keepalive
|
|
rdmaClient *RDMAMountClient
|
|
peerRegistrar *PeerRegistrar
|
|
peerDirectory *PeerDirectory
|
|
peerGrpcServer *PeerGrpcServer
|
|
peerAnnouncer *PeerAnnouncer
|
|
peerConnPool *PeerConnPool
|
|
peerDirectoryStop chan struct{} // closed on unmount to stop the sweeper goroutine
|
|
FilerConf *filer.FilerConf
|
|
filerClient *wdclient.FilerClient // Cached volume location client
|
|
refreshMu sync.Mutex
|
|
refreshingDirs map[util.FullPath]struct{}
|
|
atimeMu sync.Mutex
|
|
atimeMap map[uint64]time.Time // inode -> atime, in-memory only, bounded
|
|
dirMtimeMu sync.Mutex
|
|
dirMtimeMap map[uint64]time.Time // inode -> mtime/ctime, in-memory overlay for dirs
|
|
entryValidSec uint64 // kernel FUSE entry cache TTL in seconds
|
|
attrValidSec uint64 // kernel FUSE attr cache TTL in seconds
|
|
dirHotWindow time.Duration
|
|
dirHotThreshold int
|
|
dirIdleEvict time.Duration
|
|
|
|
// openMtimeCache maps inode -> [mtime_sec, mtime_ns] from the last Open.
|
|
// Used to decide whether to set FOPEN_KEEP_CACHE on subsequent opens.
|
|
// Bounded to openMtimeCacheMaxSize entries; when full a random entry is
|
|
// evicted. This trades a small amount of cache-miss overhead for
|
|
// predictable memory usage on mounts that touch many files.
|
|
openMtimeMu sync.Mutex
|
|
openMtimeCache map[uint64][2]int64
|
|
|
|
// asyncFlushWg tracks pending background flush work items for writebackCache mode.
|
|
// Must be waited on before unmount cleanup to prevent data loss.
|
|
asyncFlushWg sync.WaitGroup
|
|
|
|
// asyncFlushCh is a bounded work queue for background flush operations.
|
|
// A fixed pool of worker goroutines processes items from this channel,
|
|
// preventing resource exhaustion from unbounded goroutine creation.
|
|
asyncFlushCh chan *asyncFlushItem
|
|
|
|
// pendingAsyncFlush tracks in-flight async flush goroutines by inode.
|
|
// AcquireHandle checks this to wait for a pending flush before reopening
|
|
// the same inode, preventing stale metadata from overwriting the async flush.
|
|
pendingAsyncFlushMu sync.Mutex
|
|
pendingAsyncFlush map[uint64]chan struct{}
|
|
|
|
// streamMutate is the multiplexed streaming gRPC connection for all filer
|
|
// mutations (create, update, delete, rename). All mutations go through one
|
|
// ordered stream to prevent cross-operation reordering.
|
|
streamMutate *streamMutateMux
|
|
|
|
// lockClient is the DLM client for cross-mount write coordination.
|
|
// Non-nil only when EnableDistributedLock is true.
|
|
lockClient *cluster.LockClient
|
|
}
|
|
|
|
const (
|
|
defaultDirHotWindow = 2 * time.Second
|
|
defaultDirHotThreshold = 64
|
|
defaultDirIdleEvict = 10 * time.Minute
|
|
)
|
|
|
|
func NewSeaweedFileSystem(option *Option) *WFS {
|
|
// Only create FilerClient for direct volume access modes
|
|
// When VolumeServerAccess == "filerProxy", all reads go through filer, so no volume lookup needed
|
|
var filerClient *wdclient.FilerClient
|
|
if option.VolumeServerAccess != "filerProxy" {
|
|
// Create FilerClient for efficient volume location caching
|
|
// Pass all filer addresses for high availability with automatic failover
|
|
// Configure URL preference based on VolumeServerAccess option
|
|
var opts *wdclient.FilerClientOption
|
|
if option.VolumeServerAccess == "publicUrl" {
|
|
opts = &wdclient.FilerClientOption{
|
|
UrlPreference: wdclient.PreferPublicUrl,
|
|
}
|
|
}
|
|
|
|
filerClient = wdclient.NewFilerClient(
|
|
option.FilerAddresses, // Pass all filer addresses for HA
|
|
option.GrpcDialOption,
|
|
option.DataCenter,
|
|
opts,
|
|
)
|
|
}
|
|
|
|
dirHotWindow := defaultDirHotWindow
|
|
dirHotThreshold := defaultDirHotThreshold
|
|
dirIdleEvict := defaultDirIdleEvict
|
|
if option.DirIdleEvictSec != 0 {
|
|
dirIdleEvict = time.Duration(option.DirIdleEvictSec) * time.Second
|
|
} else {
|
|
dirIdleEvict = 0
|
|
}
|
|
|
|
wfs := &WFS{
|
|
RawFileSystem: fuse.NewDefaultRawFileSystem(),
|
|
option: option,
|
|
signature: util.RandomInt32(),
|
|
inodeToPath: NewInodeToPath(util.FullPath(option.FilerMountRootPath), option.CacheMetaTTlSec),
|
|
fhMap: NewFileHandleToInode(),
|
|
dhMap: NewDirectoryHandleToInode(),
|
|
filerClient: filerClient, // nil for proxy mode, initialized for direct access
|
|
pendingAsyncFlush: make(map[uint64]chan struct{}),
|
|
fhLockTable: util.NewLockTable[FileHandleId](),
|
|
hardLinkLockTable: util.NewLockTable[string](),
|
|
posixLocks: NewPosixLockTable(),
|
|
posixSid: randomPosixSid(),
|
|
posixHint: newPosixLockHint(),
|
|
posixOwn: posixlock.NewManager(),
|
|
refreshingDirs: make(map[util.FullPath]struct{}),
|
|
atimeMap: make(map[uint64]time.Time, 8192),
|
|
openMtimeCache: make(map[uint64][2]int64, 8192),
|
|
dirMtimeMap: make(map[uint64]time.Time, 1024),
|
|
entryValidSec: 1,
|
|
attrValidSec: 1,
|
|
dirHotWindow: dirHotWindow,
|
|
dirHotThreshold: dirHotThreshold,
|
|
dirIdleEvict: dirIdleEvict,
|
|
}
|
|
|
|
// With writeback caching, this mount is the single writer. Increase kernel
|
|
// FUSE cache TTLs so the kernel doesn't re-issue Lookup/GetAttr for every
|
|
// path component and stat — the local meta cache is authoritative.
|
|
if option.WritebackCache {
|
|
wfs.entryValidSec = 10
|
|
wfs.attrValidSec = 10
|
|
}
|
|
|
|
if option.EnableDistributedLock && !option.WritebackCache && len(option.FilerAddresses) > 0 {
|
|
wfs.lockClient = cluster.NewLockClient(option.GrpcDialOption, option.FilerAddresses[0])
|
|
glog.V(0).Infof("distributed lock manager enabled for mount")
|
|
} else if option.EnableDistributedLock && option.WritebackCache {
|
|
glog.V(0).Infof("distributed lock manager disabled: writeback cache implies single-writer mode")
|
|
}
|
|
|
|
wfs.option.filerIndex = int32(rand.IntN(len(option.FilerAddresses)))
|
|
wfs.option.setupUniqueCacheDirectory()
|
|
if option.CacheSizeMBForRead > 0 {
|
|
wfs.chunkCache = chunk_cache.NewTieredChunkCache(256, option.getUniqueCacheDirForRead(), option.CacheSizeMBForRead, 1024*1024)
|
|
}
|
|
if option.WriteBufferSizeMB > 0 {
|
|
wfs.writeBufferAccountant = page_writer.NewWriteBufferAccountant(option.WriteBufferSizeMB * 1024 * 1024)
|
|
wfs.writeBufferAccountant.SetEvictor(wfs.evictOneWritableChunk)
|
|
}
|
|
|
|
wfs.metaCache = meta_cache.NewMetaCache(path.Join(option.getUniqueCacheDirForRead(), "meta"), option.UidGidMapper,
|
|
util.FullPath(option.FilerMountRootPath),
|
|
option.IncludeSystemEntries,
|
|
func(path util.FullPath) {
|
|
wfs.inodeToPath.MarkChildrenCached(path)
|
|
}, func(path util.FullPath) bool {
|
|
return wfs.inodeToPath.IsChildrenCached(path)
|
|
}, wfs.invalidateOpenFileHandle, func(dirPath util.FullPath) {
|
|
if wfs.inodeToPath.RecordDirectoryUpdate(dirPath, time.Now(), wfs.dirHotWindow, wfs.dirHotThreshold) {
|
|
wfs.markDirectoryReadThrough(dirPath)
|
|
}
|
|
})
|
|
wfs.metaCache.SetPinnedChildFn(wfs.isLocalOnlyEntry)
|
|
grace.OnInterrupt(func() {
|
|
// grace calls os.Exit(0) after all hooks, so WaitForAsyncFlush
|
|
// after server.Serve() would never execute. Drain here first.
|
|
//
|
|
// Use a timeout to avoid hanging on Ctrl-C if the filer is
|
|
// unreachable (metadata retry can take up to 7 seconds).
|
|
// If the timeout expires, skip the write-cache removal so that
|
|
// still-running goroutines can finish reading swap files.
|
|
asyncDrained := true
|
|
if wfs.option.WritebackCache {
|
|
done := make(chan struct{})
|
|
go func() {
|
|
wfs.asyncFlushWg.Wait()
|
|
close(done)
|
|
}()
|
|
select {
|
|
case <-done:
|
|
glog.V(0).Infof("all async flushes completed before shutdown")
|
|
case <-time.After(30 * time.Second):
|
|
glog.Warningf("timed out waiting for async flushes — swap files preserved for in-flight uploads")
|
|
asyncDrained = false
|
|
}
|
|
}
|
|
wfs.metaCache.Shutdown()
|
|
if asyncDrained {
|
|
os.RemoveAll(option.getUniqueCacheDirForWrite())
|
|
}
|
|
os.RemoveAll(option.getUniqueCacheDirForRead())
|
|
if wfs.rdmaClient != nil {
|
|
wfs.rdmaClient.Close()
|
|
}
|
|
if wfs.peerAnnouncer != nil {
|
|
wfs.peerAnnouncer.Stop()
|
|
}
|
|
if wfs.peerConnPool != nil {
|
|
wfs.peerConnPool.Close()
|
|
}
|
|
if wfs.peerGrpcServer != nil {
|
|
wfs.peerGrpcServer.Stop()
|
|
}
|
|
if wfs.peerDirectoryStop != nil {
|
|
select {
|
|
case <-wfs.peerDirectoryStop:
|
|
// already closed
|
|
default:
|
|
close(wfs.peerDirectoryStop)
|
|
}
|
|
}
|
|
if wfs.peerRegistrar != nil {
|
|
wfs.peerRegistrar.Stop()
|
|
}
|
|
})
|
|
|
|
// Initialize RDMA client if enabled
|
|
if option.RdmaEnabled && option.RdmaSidecarAddr != "" {
|
|
rdmaClient, err := NewRDMAMountClient(
|
|
option.RdmaSidecarAddr,
|
|
wfs.LookupFn(),
|
|
option.RdmaMaxConcurrent,
|
|
option.RdmaTimeoutMs,
|
|
)
|
|
if err != nil {
|
|
glog.Warningf("Failed to initialize RDMA client: %v", err)
|
|
} else {
|
|
wfs.rdmaClient = rdmaClient
|
|
glog.Infof("RDMA acceleration enabled: sidecar=%s, maxConcurrent=%d, timeout=%dms",
|
|
option.RdmaSidecarAddr, option.RdmaMaxConcurrent, option.RdmaTimeoutMs)
|
|
}
|
|
}
|
|
|
|
// Peer chunk sharing: register with every configured filer's mount
|
|
// registry + start the single gRPC server that handles ChunkAnnounce /
|
|
// ChunkLookup / FetchChunk. Broadcasting registration to the full
|
|
// filer set is what lets mounts pointing at different filers see
|
|
// each other — each filer's registry is in-memory with no
|
|
// filer-to-filer sync, so the registrar reconstructs the union
|
|
// client-side. One port, one identity — the advertise address
|
|
// resolved in PR #3 is used for everything.
|
|
if option.PeerEnabled {
|
|
selfAddr, err := ResolvePeerAdvertiseAddr(option.PeerListen, option.PeerAdvertise)
|
|
if err != nil {
|
|
// Downstream code treats PeerEnabled as "peer infrastructure
|
|
// is ready": later PRs wire the gRPC server, fetcher hook,
|
|
// and announcer from this flag. If we can't resolve a
|
|
// reachable self-address those components would nil-deref
|
|
// or advertise garbage, so disable the feature instead of
|
|
// limping along half-initialized.
|
|
glog.Warningf("peer: cannot resolve advertise addr, disabling peer sharing: %v", err)
|
|
option.PeerEnabled = false
|
|
} else {
|
|
dial := func(ctx context.Context, addr pb.ServerAddress, fn func(client filer_pb.SeaweedFilerClient) error) error {
|
|
return pb.WithGrpcFilerClient(false, 0, addr, option.GrpcDialOption, fn)
|
|
}
|
|
wfs.peerRegistrar = NewPeerRegistrar(option.FilerAddresses, dial, selfAddr, option.PeerDataCenter, option.PeerRack)
|
|
if err := wfs.peerRegistrar.Start(context.Background()); err != nil {
|
|
glog.Warningf("peer registrar start: %v", err)
|
|
}
|
|
|
|
wfs.peerDirectory = NewPeerDirectory()
|
|
// Wire TLS/mTLS from security.toml's grpc.mount section so
|
|
// cross-host peer RPCs are authenticated + encrypted. When
|
|
// the section is empty both options come back nil and the
|
|
// server runs plaintext — intentional for dev/test.
|
|
peerTLSCreds, peerTLSVerify := security.LoadServerTLS(util.GetViper(), "grpc.mount")
|
|
var peerServerOpts []grpc.ServerOption
|
|
if peerTLSCreds != nil {
|
|
peerServerOpts = append(peerServerOpts, peerTLSCreds)
|
|
}
|
|
if peerTLSVerify != nil {
|
|
peerServerOpts = append(peerServerOpts, peerTLSVerify)
|
|
}
|
|
wfs.peerGrpcServer = NewPeerGrpcServer(
|
|
wfs.chunkCache,
|
|
wfs.peerDirectory,
|
|
wfs.peerRegistrar.OwnerFor,
|
|
selfAddr,
|
|
peerServerOpts...,
|
|
)
|
|
if err := wfs.peerGrpcServer.Start(option.PeerListen); err != nil {
|
|
glog.Warningf("peer grpc start: %v", err)
|
|
wfs.peerGrpcServer = nil
|
|
} else {
|
|
wfs.peerDirectoryStop = make(chan struct{})
|
|
go wfs.runPeerDirectorySweeper(wfs.peerDirectoryStop)
|
|
|
|
// Shared connection pool + announcer. Pool reuses one
|
|
// grpc.ClientConn per owner mount across both the
|
|
// announcer flush and the fetcher's ChunkLookup +
|
|
// FetchChunk calls. Transport credentials come from
|
|
// option.GrpcDialOption (security.LoadClientTLS), so
|
|
// peer dials match the TLS posture the server wants.
|
|
wfs.peerConnPool = NewPeerConnPool(option.GrpcDialOption)
|
|
wfs.peerAnnouncer = NewPeerAnnouncer(
|
|
selfAddr,
|
|
option.PeerDataCenter,
|
|
option.PeerRack,
|
|
wfs.peerRegistrar.OwnerFor,
|
|
wfs.peerConnPool.Dialer(),
|
|
wfs.peerDirectory,
|
|
)
|
|
// Close the write→announce race: between SetChunk and
|
|
// the flush tick (up to 15 s) the cache can LRU-evict
|
|
// the chunk. Skip announcing fids we no longer hold.
|
|
if wfs.chunkCache != nil {
|
|
cache := wfs.chunkCache
|
|
wfs.peerAnnouncer.SetCachePresence(func(fid string) bool {
|
|
return cache.IsInCache(fid, true)
|
|
})
|
|
}
|
|
wfs.peerAnnouncer.Start()
|
|
}
|
|
}
|
|
}
|
|
|
|
if wfs.option.ConcurrentWriters > 0 {
|
|
wfs.concurrentWriters = util.NewLimitedConcurrentExecutor(wfs.option.ConcurrentWriters)
|
|
wfs.concurrentCopiersSem = make(chan struct{}, wfs.option.ConcurrentWriters)
|
|
}
|
|
if wfs.option.WritebackCache {
|
|
numWorkers := wfs.option.ConcurrentWriters
|
|
if numWorkers <= 0 {
|
|
numWorkers = 128
|
|
}
|
|
wfs.startAsyncFlushWorkers(numWorkers)
|
|
}
|
|
wfs.streamMutate = newStreamMutateMux(wfs)
|
|
wfs.copyBufferPool.New = func() any {
|
|
return make([]byte, option.ChunkSizeLimit)
|
|
}
|
|
return wfs
|
|
}
|
|
|
|
func (wfs *WFS) StartBackgroundTasks() error {
|
|
if wfs.option.WritebackCache {
|
|
glog.V(0).Infof("writebackCache enabled: async flush on close() for improved small file performance")
|
|
}
|
|
|
|
follower, err := wfs.subscribeFilerConfEvents()
|
|
if err != nil {
|
|
return err
|
|
}
|
|
|
|
startTime := time.Now()
|
|
go meta_cache.SubscribeMetaEvents(wfs.metaCache, wfs.signature, wfs, wfs.option.FilerMountRootPath, startTime.UnixNano(), wfs.option.WritebackCache, func(lastTsNs int64, err error) {
|
|
glog.Warningf("meta events follow retry from %v: %v", time.Unix(0, lastTsNs), err)
|
|
// A subscription gap may have dropped events, so distrust every cached
|
|
// listing. Reset the flags first (safe — it never deletes entries), then
|
|
// wipe the root's stale children through the apply loop so the delete
|
|
// cannot strand a concurrent rebuild cached-but-empty.
|
|
wfs.inodeToPath.InvalidateAllChildrenCache()
|
|
wfs.purgeDirectoryCache(util.FullPath(wfs.option.FilerMountRootPath))
|
|
}, follower)
|
|
go wfs.loopCheckQuota()
|
|
go wfs.loopFlushDirtyMetadata()
|
|
go wfs.loopEvictIdleDirCache()
|
|
go wfs.loopProactiveFlush()
|
|
if wfs.crossMountLocks() {
|
|
go wfs.loopRenewPosixLeases()
|
|
}
|
|
|
|
return nil
|
|
}
|
|
|
|
func (wfs *WFS) String() string {
|
|
return "seaweedfs"
|
|
}
|
|
|
|
func (wfs *WFS) Init(server *fuse.Server) {
|
|
wfs.fuseServer = server
|
|
}
|
|
|
|
func (wfs *WFS) maybeReadEntry(inode uint64) (path util.FullPath, fh *FileHandle, entry *filer_pb.Entry, status fuse.Status) {
|
|
path, status = wfs.inodeToPath.GetPath(inode)
|
|
if status != fuse.OK {
|
|
return
|
|
}
|
|
var found bool
|
|
if fh, found = wfs.fhMap.FindFileHandle(inode); found {
|
|
entry = fh.UpdateEntry(func(entry *filer_pb.Entry) {
|
|
if entry != nil && fh.entry.Attributes == nil {
|
|
entry.Attributes = &filer_pb.FuseAttributes{}
|
|
}
|
|
})
|
|
} else {
|
|
entry, _, status = wfs.maybeLoadEntry(path)
|
|
}
|
|
return
|
|
}
|
|
|
|
// isLocalOnlyEntry reports whether entry holds local-only state not yet on the
|
|
// filer — an open handle with dirty metadata, or a pending async flush. A
|
|
// directory rebuild refills from a filer listing that omits such an entry, so it
|
|
// must be preserved across the wipe; this is the same signal lookupEntry trusts
|
|
// over a filer ErrNotFound for deferred creates.
|
|
//
|
|
// Keyed off the inode the entry carries, not inodeToPath: a kernel Forget can
|
|
// drop the path→inode mapping while an async writeback flush is still in flight,
|
|
// and the entry must stay pinned until that flush reaches the filer.
|
|
func (wfs *WFS) isLocalOnlyEntry(entry *filer.Entry) bool {
|
|
if entry == nil || entry.Attr.Inode == 0 {
|
|
return false
|
|
}
|
|
inode := entry.Attr.Inode
|
|
if fh, fhFound := wfs.fhMap.FindFileHandle(inode); fhFound && fh.dirtyMetadata {
|
|
return true
|
|
}
|
|
wfs.pendingAsyncFlushMu.Lock()
|
|
_, pending := wfs.pendingAsyncFlush[inode]
|
|
wfs.pendingAsyncFlushMu.Unlock()
|
|
return pending
|
|
}
|
|
|
|
// maybeLoadEntry returns the entry and the log position it reflects, or a zero
|
|
// position when unknown.
|
|
func (wfs *WFS) maybeLoadEntry(fullpath util.FullPath) (*filer_pb.Entry, entryVersion, fuse.Status) {
|
|
// glog.V(3).Infof("read entry cache miss %s", fullpath)
|
|
_, name := fullpath.DirAndName()
|
|
|
|
// return a valid entry for the mount root
|
|
if string(fullpath) == wfs.option.FilerMountRootPath {
|
|
return &filer_pb.Entry{
|
|
Name: name,
|
|
IsDirectory: true,
|
|
Attributes: &filer_pb.FuseAttributes{
|
|
Mtime: wfs.option.MountMtime.Unix(),
|
|
FileMode: uint32(wfs.option.MountMode),
|
|
Uid: wfs.option.MountUid,
|
|
Gid: wfs.option.MountGid,
|
|
Crtime: wfs.option.MountCtime.Unix(),
|
|
},
|
|
}, entryVersion{}, fuse.OK
|
|
}
|
|
|
|
entry, version, status := wfs.lookupEntry(fullpath)
|
|
if status != fuse.OK {
|
|
return nil, entryVersion{}, status
|
|
}
|
|
return entry.ToProtoEntry(), version, fuse.OK
|
|
}
|
|
|
|
// lookupEntry looks up an entry by path, checking the local cache first.
|
|
// Cached metadata is only authoritative when the parent directory itself is cached.
|
|
// For uncached/read-through directories, always consult the filer directly so stale
|
|
// local entries do not leak back into lookup results.
|
|
// It also returns the log position the entry reflects: the entry's stored
|
|
// version, the lookup response's, or zero if unknown.
|
|
func (wfs *WFS) lookupEntry(fullpath util.FullPath) (*filer.Entry, entryVersion, fuse.Status) {
|
|
dir, _ := fullpath.DirAndName()
|
|
dirPath := util.FullPath(dir)
|
|
|
|
if wfs.metaCache.IsDirectoryCached(dirPath) {
|
|
cachedEntry, cachedVersionTsNs, cacheErr := wfs.metaCache.FindEntry(context.Background(), fullpath)
|
|
if cacheErr != nil && cacheErr != filer_pb.ErrNotFound {
|
|
glog.Errorf("lookupEntry: cache lookup for %s failed: %v", fullpath, cacheErr)
|
|
return nil, entryVersion{}, fuse.EIO
|
|
}
|
|
if cachedEntry != nil {
|
|
glog.V(4).Infof("lookupEntry cache hit %s", fullpath)
|
|
// Store versions come from applied events, not an RPC fence.
|
|
return cachedEntry, entryVersion{tsNs: cachedVersionTsNs}, fuse.OK
|
|
}
|
|
// Re-check: the directory may have been evicted from cache between
|
|
// our IsDirectoryCached check and FindEntry (e.g. markDirectoryReadThrough).
|
|
// If it's no longer cached, fall through to the filer lookup below.
|
|
if wfs.metaCache.IsDirectoryCached(dirPath) {
|
|
// Authoritative ENOENT only if inodeToPath also has no record.
|
|
// If the kernel still tracks this inode, the three layers
|
|
// disagree; trust the filer over the local cache (the
|
|
// filer-ErrNotFound branch below logs the confirmed drift).
|
|
if _, inodeFound := wfs.inodeToPath.GetInode(fullpath); !inodeFound {
|
|
glog.V(4).Infof("lookupEntry cache miss (dir cached) %s", fullpath)
|
|
return nil, entryVersion{}, fuse.ENOENT
|
|
}
|
|
glog.V(2).Infof("lookupEntry: %s missing from cache while parent %s is cached; inode tracked, consulting filer", fullpath, dirPath)
|
|
}
|
|
}
|
|
|
|
// Directory not cached - fetch directly from filer without caching the entire directory.
|
|
glog.V(4).Infof("lookupEntry fetching from filer %s", fullpath)
|
|
var entry *filer_pb.Entry
|
|
var lookupVersion entryVersion
|
|
lookupDir, lookupName := fullpath.DirAndName()
|
|
err := wfs.WithFilerClient(false, func(client filer_pb.SeaweedFilerClient) error {
|
|
resp, lookupErr := filer_pb.LookupEntry(context.Background(), client, &filer_pb.LookupDirectoryEntryRequest{
|
|
Directory: lookupDir,
|
|
Name: lookupName,
|
|
})
|
|
if lookupErr != nil {
|
|
return lookupErr
|
|
}
|
|
entry = resp.Entry
|
|
lookupVersion = entryVersion{tsNs: resp.LogTsNs, signature: resp.LogSignature}
|
|
return nil
|
|
})
|
|
if err != nil {
|
|
if err == filer_pb.ErrNotFound {
|
|
// The entry may exist in the local store from a deferred create
|
|
// (deferFilerCreate=true) that hasn't been flushed yet. Only trust
|
|
// the local store when an open file handle or pending async flush
|
|
// confirms the entry is genuinely local-only; otherwise a stale
|
|
// cache hit could resurrect a deleted/renamed entry.
|
|
inode, inodeFound := wfs.inodeToPath.GetInode(fullpath)
|
|
hasDirtyHandle := false
|
|
hasPendingFlush := false
|
|
if inodeFound {
|
|
if fh, fhFound := wfs.fhMap.FindFileHandle(inode); fhFound && fh.dirtyMetadata {
|
|
hasDirtyHandle = true
|
|
}
|
|
wfs.pendingAsyncFlushMu.Lock()
|
|
_, hasPendingFlush = wfs.pendingAsyncFlush[inode]
|
|
wfs.pendingAsyncFlushMu.Unlock()
|
|
|
|
if hasDirtyHandle || hasPendingFlush {
|
|
if localEntry, localVersionTsNs, localErr := wfs.metaCache.FindEntry(context.Background(), fullpath); localErr == nil && localEntry != nil {
|
|
glog.V(4).Infof("lookupEntry found deferred entry in local cache %s", fullpath)
|
|
return localEntry, entryVersion{tsNs: localVersionTsNs}, fuse.OK
|
|
}
|
|
}
|
|
}
|
|
if inodeFound {
|
|
// Filer reports ErrNotFound for a path the kernel/local map
|
|
// still tracks, with no in-flight create or flush to excuse
|
|
// it. Log loudly (Warningf, not V(4)) so flake captures show
|
|
// up without -v=4 — and include layer-by-layer state so the
|
|
// next failed run pinpoints which layer dropped the entry.
|
|
localPresent := false
|
|
if localEntry, _, localErr := wfs.metaCache.FindEntry(context.Background(), fullpath); localErr == nil && localEntry != nil {
|
|
localPresent = true
|
|
}
|
|
glog.Warningf("lookupEntry: filer ErrNotFound for tracked path %s (inode=%d dirtyHandle=%v pendingFlush=%v localCache=%v dirCached=%v) — possible coherence bug",
|
|
fullpath, inode, hasDirtyHandle, hasPendingFlush, localPresent, wfs.metaCache.IsDirectoryCached(dirPath))
|
|
} else {
|
|
glog.V(4).Infof("lookupEntry not found %s", fullpath)
|
|
}
|
|
return nil, entryVersion{}, fuse.ENOENT
|
|
}
|
|
glog.Warningf("lookupEntry GetEntry %s: %v", fullpath, err)
|
|
return nil, entryVersion{}, fuse.EIO
|
|
}
|
|
if entry != nil && entry.Attributes != nil && wfs.option.UidGidMapper != nil {
|
|
entry.Attributes.Uid, entry.Attributes.Gid = wfs.option.UidGidMapper.FilerToLocal(entry.Attributes.Uid, entry.Attributes.Gid)
|
|
}
|
|
return filer.FromPbEntry(dir, entry), lookupVersion, fuse.OK
|
|
}
|
|
|
|
// entryVersion is a filer log position together with the clock domain it
|
|
// belongs to: the signature of the filer that stamped it, or zero when the
|
|
// position came from an event rather than an RPC fence.
|
|
type entryVersion struct {
|
|
tsNs int64
|
|
signature int32
|
|
}
|
|
|
|
// sameClockDomain reports whether an event's timestamp is comparable with a
|
|
// fence stamped by the filer identified by fenceSignature. The filer that logs
|
|
// an event appends its own signature, so its presence means one clock produced
|
|
// both positions. A zero fence signature means the handle's position came from
|
|
// an event, whose ordering the subscription already provides.
|
|
func sameClockDomain(fenceSignature int32, eventSignatures []int32) bool {
|
|
if fenceSignature == 0 {
|
|
return true
|
|
}
|
|
for _, sig := range eventSignatures {
|
|
if sig == fenceSignature {
|
|
return true
|
|
}
|
|
}
|
|
return false
|
|
}
|
|
|
|
// sameEntryContent reports whether two entries carry the same file content:
|
|
// size, inline bytes, and chunk list. Attributes are deliberately excluded —
|
|
// its caller decides whether the dirty-page overlay is still valid, and a
|
|
// metadata change (chmod, chown, touch, xattr) does not invalidate it.
|
|
func sameEntryContent(a, b *filer_pb.Entry) bool {
|
|
if a == nil || b == nil {
|
|
return a == b
|
|
}
|
|
if filer.FileSize(a) != filer.FileSize(b) || !bytes.Equal(a.Content, b.Content) {
|
|
return false
|
|
}
|
|
if len(a.Chunks) != len(b.Chunks) {
|
|
return false
|
|
}
|
|
for i := range a.Chunks {
|
|
if a.Chunks[i].GetFileIdString() != b.Chunks[i].GetFileIdString() ||
|
|
a.Chunks[i].Offset != b.Chunks[i].Offset || a.Chunks[i].Size != b.Chunks[i].Size {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
|
|
// invalidateOpenFileHandle refreshes an open file handle from a metadata
|
|
// subscription event. No filer lookup here: it can fail transiently, and with
|
|
// the subscription cursor already past the event, nothing would retry.
|
|
func (wfs *WFS) invalidateOpenFileHandle(invalidation meta_cache.EntryInvalidation) {
|
|
filePath, eventEntry, eventTsNs := invalidation.Path, invalidation.Entry, invalidation.TsNs
|
|
inode, inodeFound := wfs.inodeToPath.GetInode(filePath)
|
|
if !inodeFound {
|
|
return
|
|
}
|
|
fh, fhFound := wfs.fhMap.FindFileHandle(inode)
|
|
if !fhFound {
|
|
return
|
|
}
|
|
fhActiveLock := wfs.fhLockTable.AcquireLock("invalidateFunc", fh.fh, util.ExclusiveLock)
|
|
defer wfs.fhLockTable.ReleaseLock(fh.fh, fhActiveLock)
|
|
|
|
// Invalidations apply asynchronously: the handle may already reflect this
|
|
// event or newer state, and rolling it back would never be corrected.
|
|
// Only skip within one clock domain — the handle's position may have been
|
|
// stamped by a different filer, whose clock says nothing about this
|
|
// event's. Applying across domains costs a re-apply the base-equality
|
|
// check absorbs; skipping across them leaves the handle stale for good.
|
|
if eventTsNs != 0 && eventTsNs <= fh.entryVersionTsNs.Load() &&
|
|
sameClockDomain(fh.entryVersionSignature.Load(), invalidation.Signatures) {
|
|
return
|
|
}
|
|
|
|
// A cached parent's store entry is the ordered merge of this event and
|
|
// anything applied since. An uncached parent takes no store writes, so a
|
|
// hit there is a stale leftover — use the event entry instead.
|
|
var candidate *filer_pb.Entry
|
|
candidateTsNs := eventTsNs
|
|
dir, _ := filePath.DirAndName()
|
|
if wfs.metaCache.IsDirectoryCached(util.FullPath(dir)) {
|
|
if storeEntry, storeVersionTsNs, findErr := wfs.metaCache.FindEntry(context.Background(), filePath); findErr == nil && storeEntry != nil && storeVersionTsNs >= eventTsNs {
|
|
candidate = storeEntry.ToProtoEntry()
|
|
candidateTsNs = storeVersionTsNs
|
|
}
|
|
}
|
|
if candidate == nil && eventEntry != nil {
|
|
candidate = proto.Clone(eventEntry).(*filer_pb.Entry)
|
|
if candidate.Attributes == nil {
|
|
candidate.Attributes = &filer_pb.FuseAttributes{}
|
|
}
|
|
if wfs.option.UidGidMapper != nil {
|
|
candidate.Attributes.Uid, candidate.Attributes.Gid = wfs.option.UidGidMapper.FilerToLocal(candidate.Attributes.Uid, candidate.Attributes.Gid)
|
|
}
|
|
}
|
|
if candidate == nil {
|
|
// Path vacated. A rename left the file alive at its new name, so the
|
|
// handle follows it — an open fd tracks the inode, and leaving it on
|
|
// the old path would make its next flush recreate that name instead of
|
|
// updating the renamed file. An actual delete instead marks the handle
|
|
// so no flush recreates the unlinked name. Either way the entry and
|
|
// dirty pages stay, so the open fd still reads its buffered writes.
|
|
if invalidation.RenamedTo != "" {
|
|
_, replacedInode := wfs.inodeToPath.MovePath(filePath, invalidation.RenamedTo)
|
|
// A rename over an existing file destroys that file. Mark its
|
|
// handle deleted so its flush cannot resurrect it on top of the
|
|
// renamed source now occupying the name.
|
|
if replacedInode != 0 && replacedInode != inode {
|
|
if replacedFh, found := wfs.fhMap.FindFileHandle(replacedInode); found {
|
|
replacedFh.isDeleted = true
|
|
}
|
|
}
|
|
fh.RememberPath(invalidation.RenamedTo)
|
|
if _, newName := invalidation.RenamedTo.DirAndName(); newName != "" {
|
|
fh.UpdateEntry(func(entry *filer_pb.Entry) {
|
|
if entry != nil {
|
|
entry.Name = newName
|
|
}
|
|
})
|
|
}
|
|
}
|
|
if invalidation.Deleted {
|
|
fh.isDeleted = true
|
|
}
|
|
if !fh.dirtyMetadata {
|
|
fh.dirtyPages.Destroy()
|
|
fh.dirtyPages = newPageWriter(fh, wfs.option.ChunkSizeLimit)
|
|
}
|
|
fh.advanceEntryVersion(eventTsNs, 0)
|
|
return
|
|
}
|
|
if candidate.Attributes != nil {
|
|
candidate.Attributes.FileSize = filer.FileSize(candidate)
|
|
}
|
|
// Already reflected — an under-fenced re-delivery (a fence is a lower
|
|
// bound). Judged against the base, not the live entry: local writes move
|
|
// the live entry, and a re-delivered base must not discard them.
|
|
base := fh.baseEntry.Load()
|
|
if base != nil && proto.Equal(candidate, base) {
|
|
fh.advanceEntryVersion(candidateTsNs, 0)
|
|
return
|
|
}
|
|
// Dirty pages overlay content, so only a content change invalidates them:
|
|
// a metadata-only event (chmod, touch, or a committed copy's own event
|
|
// against an approximate base) leaves them valid. A dirty handle likewise
|
|
// keeps its diverged entry unless foreign content supersedes it.
|
|
contentChanged := base == nil || !sameEntryContent(candidate, base)
|
|
if contentChanged {
|
|
fh.dirtyPages.Destroy()
|
|
fh.dirtyPages = newPageWriter(fh, wfs.option.ChunkSizeLimit)
|
|
}
|
|
if contentChanged || !fh.dirtyMetadata {
|
|
fh.SetEntry(candidate)
|
|
}
|
|
fh.baseEntry.Store(proto.Clone(candidate).(*filer_pb.Entry))
|
|
fh.advanceEntryVersion(candidateTsNs, 0)
|
|
}
|
|
|
|
func (wfs *WFS) LookupFn() wdclient.LookupFileIdFunctionType {
|
|
if wfs.option.VolumeServerAccess == "filerProxy" {
|
|
return func(ctx context.Context, fileId string) (targetUrls []string, err error) {
|
|
return []string{"http://" + wfs.getCurrentFiler().ToHttpAddress() + "/?proxyChunkId=" + fileId}, nil
|
|
}
|
|
}
|
|
// Use the cached FilerClient for efficient lookups with singleflight and cache history
|
|
return wfs.filerClient.GetLookupFileIdFunction()
|
|
}
|
|
|
|
func (wfs *WFS) getCurrentFiler() pb.ServerAddress {
|
|
i := atomic.LoadInt32(&wfs.option.filerIndex)
|
|
return wfs.option.FilerAddresses[i]
|
|
}
|
|
|
|
func (wfs *WFS) ClearCacheDir() {
|
|
wfs.metaCache.Shutdown()
|
|
os.RemoveAll(wfs.option.getUniqueCacheDirForWrite())
|
|
os.RemoveAll(wfs.option.getUniqueCacheDirForRead())
|
|
}
|
|
|
|
// markDirectoryReadThrough drops a hot directory's cached listing. Only safe
|
|
// from the apply loop (onDirectoryUpdate), where it serializes with a build's
|
|
// markCachedFn; off-loop callers must use purgeDirectoryCache.
|
|
func (wfs *WFS) markDirectoryReadThrough(dirPath util.FullPath) {
|
|
if !wfs.inodeToPath.MarkDirectoryReadThrough(dirPath, time.Now()) {
|
|
return
|
|
}
|
|
if err := wfs.metaCache.DeleteFolderChildren(context.Background(), dirPath); err != nil {
|
|
glog.V(2).Infof("clear dir cache %s: %v", dirPath, err)
|
|
}
|
|
}
|
|
|
|
// purgeDirectoryCache drops a directory's cached listing from off the apply loop
|
|
// (idle eviction, kernel Forget, copy-range fallback), routing through it so a
|
|
// stale wipe can't strand a concurrently-rebuilt directory cached-but-empty.
|
|
func (wfs *WFS) purgeDirectoryCache(dirPath util.FullPath) {
|
|
wfs.metaCache.PurgeDirectoryChildren(dirPath, func() {
|
|
wfs.inodeToPath.InvalidateChildrenCache(dirPath)
|
|
})
|
|
}
|
|
|
|
func (wfs *WFS) loopEvictIdleDirCache() {
|
|
if wfs.dirIdleEvict <= 0 {
|
|
return
|
|
}
|
|
ticker := time.NewTicker(wfs.dirIdleEvict / 2)
|
|
defer ticker.Stop()
|
|
for range ticker.C {
|
|
dirs := wfs.inodeToPath.CollectEvictableDirs(time.Now(), wfs.dirIdleEvict)
|
|
for _, dir := range dirs {
|
|
wfs.purgeDirectoryCache(dir)
|
|
}
|
|
}
|
|
}
|
|
|
|
func (option *Option) setupUniqueCacheDirectory() {
|
|
cacheUniqueId := util.Md5String([]byte(option.MountDirectory + string(option.FilerAddresses[0]) + option.FilerMountRootPath + version.Version()))[0:8]
|
|
option.uniqueCacheDirForRead = path.Join(option.CacheDirForRead, cacheUniqueId)
|
|
os.MkdirAll(option.uniqueCacheDirForRead, os.FileMode(0777)&^option.Umask)
|
|
option.uniqueCacheDirForWrite = filepath.Join(path.Join(option.CacheDirForWrite, cacheUniqueId), "swap")
|
|
os.MkdirAll(option.uniqueCacheDirForWrite, os.FileMode(0777)&^option.Umask)
|
|
}
|
|
|
|
func (option *Option) getUniqueCacheDirForWrite() string {
|
|
return option.uniqueCacheDirForWrite
|
|
}
|
|
|
|
func (option *Option) getUniqueCacheDirForRead() string {
|
|
return option.uniqueCacheDirForRead
|
|
}
|