mirror of
				https://github.com/RGBCube/serenity
				synced 2025-10-31 21:32:44 +00:00 
			
		
		
		
	 c88cc8557f
			
		
	
	
		c88cc8557f
		
	
	
	
	
		
			
			We make these methods non-virtual because we want to ensure we properly enforce locking of the m_inode_lock mutex. Also, for write operations, we want to call prepare_to_write_data before the actual write. The previous design required us to ensure the callers do that at various places which lead to hard-to-find bugs. By moving everything to a place where we call prepare_to_write_data only once, we eliminate a possibilty of forgeting to call it on some code path in the kernel.
		
			
				
	
	
		
			406 lines
		
	
	
	
		
			12 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			406 lines
		
	
	
	
		
			12 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| /*
 | |
|  * Copyright (c) 2018-2021, Andreas Kling <kling@serenityos.org>
 | |
|  * Copyright (c) 2021, sin-ack <sin-ack@protonmail.com>
 | |
|  * Copyright (c) 2022, Idan Horowitz <idan.horowitz@serenityos.org>
 | |
|  *
 | |
|  * SPDX-License-Identifier: BSD-2-Clause
 | |
|  */
 | |
| 
 | |
| #include <AK/Singleton.h>
 | |
| #include <AK/StringView.h>
 | |
| #include <Kernel/API/InodeWatcherEvent.h>
 | |
| #include <Kernel/FileSystem/Custody.h>
 | |
| #include <Kernel/FileSystem/Inode.h>
 | |
| #include <Kernel/FileSystem/InodeWatcher.h>
 | |
| #include <Kernel/FileSystem/OpenFileDescription.h>
 | |
| #include <Kernel/FileSystem/VirtualFileSystem.h>
 | |
| #include <Kernel/KBufferBuilder.h>
 | |
| #include <Kernel/Library/NonnullLockRefPtrVector.h>
 | |
| #include <Kernel/Memory/SharedInodeVMObject.h>
 | |
| #include <Kernel/Net/LocalSocket.h>
 | |
| #include <Kernel/Process.h>
 | |
| 
 | |
| namespace Kernel {
 | |
| 
 | |
| static Singleton<SpinlockProtected<Inode::AllInstancesList>> s_all_instances;
 | |
| 
 | |
| SpinlockProtected<Inode::AllInstancesList>& Inode::all_instances()
 | |
| {
 | |
|     return s_all_instances;
 | |
| }
 | |
| 
 | |
| void Inode::sync_all()
 | |
| {
 | |
|     NonnullLockRefPtrVector<Inode, 32> inodes;
 | |
|     Inode::all_instances().with([&](auto& all_inodes) {
 | |
|         for (auto& inode : all_inodes) {
 | |
|             if (inode.is_metadata_dirty())
 | |
|                 inodes.append(inode);
 | |
|         }
 | |
|     });
 | |
| 
 | |
|     for (auto& inode : inodes) {
 | |
|         VERIFY(inode.is_metadata_dirty());
 | |
|         (void)inode.flush_metadata();
 | |
|     }
 | |
| }
 | |
| 
 | |
| void Inode::sync()
 | |
| {
 | |
|     if (is_metadata_dirty())
 | |
|         (void)flush_metadata();
 | |
|     fs().flush_writes();
 | |
| }
 | |
| 
 | |
| ErrorOr<NonnullOwnPtr<KBuffer>> Inode::read_entire(OpenFileDescription* description) const
 | |
| {
 | |
|     auto builder = TRY(KBufferBuilder::try_create());
 | |
| 
 | |
|     u8 buffer[4096];
 | |
|     off_t offset = 0;
 | |
|     for (;;) {
 | |
|         auto buf = UserOrKernelBuffer::for_kernel_buffer(buffer);
 | |
|         auto nread = TRY(read_bytes(offset, sizeof(buffer), buf, description));
 | |
|         VERIFY(nread <= sizeof(buffer));
 | |
|         if (nread == 0)
 | |
|             break;
 | |
|         TRY(builder.append((char const*)buffer, nread));
 | |
|         offset += nread;
 | |
|         if (nread < sizeof(buffer))
 | |
|             break;
 | |
|     }
 | |
| 
 | |
|     auto entire_file = builder.build();
 | |
|     if (!entire_file)
 | |
|         return ENOMEM;
 | |
|     return entire_file.release_nonnull();
 | |
| }
 | |
| 
 | |
| ErrorOr<NonnullRefPtr<Custody>> Inode::resolve_as_link(Credentials const& credentials, Custody& base, RefPtr<Custody>* out_parent, int options, int symlink_recursion_level) const
 | |
| {
 | |
|     // The default implementation simply treats the stored
 | |
|     // contents as a path and resolves that. That is, it
 | |
|     // behaves exactly how you would expect a symlink to work.
 | |
|     auto contents = TRY(read_entire());
 | |
|     return VirtualFileSystem::the().resolve_path(credentials, StringView { contents->bytes() }, base, out_parent, options, symlink_recursion_level);
 | |
| }
 | |
| 
 | |
| Inode::Inode(FileSystem& fs, InodeIndex index)
 | |
|     : m_file_system(fs)
 | |
|     , m_index(index)
 | |
| {
 | |
|     Inode::all_instances().with([&](auto& all_inodes) { all_inodes.append(*this); });
 | |
| }
 | |
| 
 | |
| Inode::~Inode()
 | |
| {
 | |
|     m_watchers.for_each([&](auto& watcher) {
 | |
|         watcher->unregister_by_inode({}, identifier());
 | |
|     });
 | |
| }
 | |
| 
 | |
| void Inode::will_be_destroyed()
 | |
| {
 | |
|     MutexLocker locker(m_inode_lock);
 | |
|     if (m_metadata_dirty)
 | |
|         (void)flush_metadata();
 | |
| }
 | |
| 
 | |
| ErrorOr<size_t> Inode::write_bytes(off_t offset, size_t length, UserOrKernelBuffer const& target_buffer, OpenFileDescription* open_description)
 | |
| {
 | |
|     MutexLocker locker(m_inode_lock);
 | |
|     TRY(prepare_to_write_data());
 | |
|     return write_bytes_locked(offset, length, target_buffer, open_description);
 | |
| }
 | |
| 
 | |
| ErrorOr<size_t> Inode::read_bytes(off_t offset, size_t length, UserOrKernelBuffer& buffer, OpenFileDescription* open_description) const
 | |
| {
 | |
|     MutexLocker locker(m_inode_lock, Mutex::Mode::Shared);
 | |
|     return read_bytes_locked(offset, length, buffer, open_description);
 | |
| }
 | |
| 
 | |
| ErrorOr<void> Inode::update_timestamps([[maybe_unused]] Optional<time_t> atime, [[maybe_unused]] Optional<time_t> ctime, [[maybe_unused]] Optional<time_t> mtime)
 | |
| {
 | |
|     return ENOTIMPL;
 | |
| }
 | |
| 
 | |
| ErrorOr<void> Inode::increment_link_count()
 | |
| {
 | |
|     return ENOTIMPL;
 | |
| }
 | |
| 
 | |
| ErrorOr<void> Inode::decrement_link_count()
 | |
| {
 | |
|     return ENOTIMPL;
 | |
| }
 | |
| 
 | |
| ErrorOr<void> Inode::set_shared_vmobject(Memory::SharedInodeVMObject& vmobject)
 | |
| {
 | |
|     MutexLocker locker(m_inode_lock);
 | |
|     m_shared_vmobject = TRY(vmobject.try_make_weak_ptr<Memory::SharedInodeVMObject>());
 | |
|     return {};
 | |
| }
 | |
| 
 | |
| LockRefPtr<LocalSocket> Inode::bound_socket() const
 | |
| {
 | |
|     return m_bound_socket;
 | |
| }
 | |
| 
 | |
| bool Inode::bind_socket(LocalSocket& socket)
 | |
| {
 | |
|     MutexLocker locker(m_inode_lock);
 | |
|     if (m_bound_socket)
 | |
|         return false;
 | |
|     m_bound_socket = socket;
 | |
|     return true;
 | |
| }
 | |
| 
 | |
| bool Inode::unbind_socket()
 | |
| {
 | |
|     MutexLocker locker(m_inode_lock);
 | |
|     if (!m_bound_socket)
 | |
|         return false;
 | |
|     m_bound_socket = nullptr;
 | |
|     return true;
 | |
| }
 | |
| 
 | |
| ErrorOr<void> Inode::register_watcher(Badge<InodeWatcher>, InodeWatcher& watcher)
 | |
| {
 | |
|     return m_watchers.with([&](auto& watchers) -> ErrorOr<void> {
 | |
|         VERIFY(!watchers.contains(&watcher));
 | |
|         TRY(watchers.try_set(&watcher));
 | |
|         return {};
 | |
|     });
 | |
| }
 | |
| 
 | |
| void Inode::unregister_watcher(Badge<InodeWatcher>, InodeWatcher& watcher)
 | |
| {
 | |
|     m_watchers.with([&](auto& watchers) {
 | |
|         VERIFY(watchers.contains(&watcher));
 | |
|         watchers.remove(&watcher);
 | |
|     });
 | |
| }
 | |
| 
 | |
| ErrorOr<NonnullLockRefPtr<FIFO>> Inode::fifo()
 | |
| {
 | |
|     MutexLocker locker(m_inode_lock);
 | |
|     VERIFY(metadata().is_fifo());
 | |
| 
 | |
|     // FIXME: Release m_fifo when it is closed by all readers and writers
 | |
|     if (!m_fifo)
 | |
|         m_fifo = TRY(FIFO::try_create(metadata().uid));
 | |
| 
 | |
|     return NonnullLockRefPtr { *m_fifo };
 | |
| }
 | |
| 
 | |
| void Inode::set_metadata_dirty(bool metadata_dirty)
 | |
| {
 | |
|     MutexLocker locker(m_inode_lock);
 | |
| 
 | |
|     if (metadata_dirty) {
 | |
|         // Sanity check.
 | |
|         VERIFY(!fs().is_readonly());
 | |
|     }
 | |
| 
 | |
|     if (m_metadata_dirty == metadata_dirty)
 | |
|         return;
 | |
| 
 | |
|     m_metadata_dirty = metadata_dirty;
 | |
|     if (m_metadata_dirty) {
 | |
|         // FIXME: Maybe we should hook into modification events somewhere else, I'm not sure where.
 | |
|         //        We don't always end up on this particular code path, for instance when writing to an ext2fs file.
 | |
|         m_watchers.for_each([&](auto& watcher) {
 | |
|             watcher->notify_inode_event({}, identifier(), InodeWatcherEvent::Type::MetadataModified);
 | |
|         });
 | |
|     }
 | |
| }
 | |
| 
 | |
| void Inode::did_add_child(InodeIdentifier, StringView name)
 | |
| {
 | |
|     m_watchers.for_each([&](auto& watcher) {
 | |
|         watcher->notify_inode_event({}, identifier(), InodeWatcherEvent::Type::ChildCreated, name);
 | |
|     });
 | |
| }
 | |
| 
 | |
| void Inode::did_remove_child(InodeIdentifier, StringView name)
 | |
| {
 | |
|     if (name == "." || name == "..") {
 | |
|         // These are just aliases and are not interesting to userspace.
 | |
|         return;
 | |
|     }
 | |
| 
 | |
|     m_watchers.for_each([&](auto& watcher) {
 | |
|         watcher->notify_inode_event({}, identifier(), InodeWatcherEvent::Type::ChildDeleted, name);
 | |
|     });
 | |
| }
 | |
| 
 | |
| void Inode::did_modify_contents()
 | |
| {
 | |
|     // FIXME: What happens if this fails?
 | |
|     //        ENOTIMPL would be a meaningless error to return here
 | |
|     auto time = kgettimeofday().to_truncated_seconds();
 | |
|     (void)update_timestamps({}, time, time);
 | |
| 
 | |
|     m_watchers.for_each([&](auto& watcher) {
 | |
|         watcher->notify_inode_event({}, identifier(), InodeWatcherEvent::Type::ContentModified);
 | |
|     });
 | |
| }
 | |
| 
 | |
| void Inode::did_delete_self()
 | |
| {
 | |
|     m_watchers.for_each([&](auto& watcher) {
 | |
|         watcher->notify_inode_event({}, identifier(), InodeWatcherEvent::Type::Deleted);
 | |
|     });
 | |
| }
 | |
| 
 | |
| ErrorOr<void> Inode::prepare_to_write_data()
 | |
| {
 | |
|     VERIFY(m_inode_lock.is_locked());
 | |
|     if (fs().is_readonly())
 | |
|         return EROFS;
 | |
|     auto metadata = this->metadata();
 | |
|     if (metadata.is_setuid() || metadata.is_setgid()) {
 | |
|         dbgln("Inode::prepare_to_write_data(): Stripping SUID/SGID bits from {}", identifier());
 | |
|         return chmod(metadata.mode & ~(04000 | 02000));
 | |
|     }
 | |
|     return {};
 | |
| }
 | |
| 
 | |
| LockRefPtr<Memory::SharedInodeVMObject> Inode::shared_vmobject() const
 | |
| {
 | |
|     MutexLocker locker(m_inode_lock);
 | |
|     return m_shared_vmobject.strong_ref();
 | |
| }
 | |
| 
 | |
| template<typename T>
 | |
| static inline bool range_overlap(T start1, T len1, T start2, T len2)
 | |
| {
 | |
|     return ((start1 < start2 + len2) || len2 == 0) && ((start2 < start1 + len1) || len1 == 0);
 | |
| }
 | |
| 
 | |
| static inline ErrorOr<void> normalize_flock(OpenFileDescription const& description, flock& lock)
 | |
| {
 | |
|     off_t start;
 | |
|     switch (lock.l_whence) {
 | |
|     case SEEK_SET:
 | |
|         start = lock.l_start;
 | |
|         break;
 | |
|     case SEEK_CUR:
 | |
|         start = description.offset() + lock.l_start;
 | |
|         break;
 | |
|     case SEEK_END:
 | |
|         // FIXME: Implement SEEK_END and negative lengths.
 | |
|         return ENOTSUP;
 | |
|     default:
 | |
|         return EINVAL;
 | |
|     }
 | |
|     lock = { lock.l_type, SEEK_SET, start, lock.l_len, 0 };
 | |
|     return {};
 | |
| }
 | |
| 
 | |
| bool Inode::can_apply_flock(flock const& new_lock) const
 | |
| {
 | |
|     VERIFY(new_lock.l_whence == SEEK_SET);
 | |
| 
 | |
|     if (new_lock.l_type == F_UNLCK)
 | |
|         return true;
 | |
| 
 | |
|     return m_flocks.with([&](auto& flocks) {
 | |
|         for (auto const& lock : flocks) {
 | |
|             if (!range_overlap(lock.start, lock.len, new_lock.l_start, new_lock.l_len))
 | |
|                 continue;
 | |
| 
 | |
|             if (new_lock.l_type == F_RDLCK && lock.type == F_WRLCK)
 | |
|                 return false;
 | |
| 
 | |
|             if (new_lock.l_type == F_WRLCK)
 | |
|                 return false;
 | |
|         }
 | |
|         return true;
 | |
|     });
 | |
| }
 | |
| 
 | |
| ErrorOr<bool> Inode::try_apply_flock(Process const& process, OpenFileDescription const& description, flock const& lock)
 | |
| {
 | |
|     return m_flocks.with([&](auto& flocks) -> ErrorOr<bool> {
 | |
|         if (!can_apply_flock(lock))
 | |
|             return false;
 | |
| 
 | |
|         if (lock.l_type == F_UNLCK) {
 | |
|             bool any_locks_unlocked = false;
 | |
|             for (size_t i = 0; i < flocks.size(); ++i) {
 | |
|                 if (&description == flocks[i].owner && flocks[i].start == lock.l_start && flocks[i].len == lock.l_len) {
 | |
|                     flocks.remove(i);
 | |
|                     any_locks_unlocked |= true;
 | |
|                 }
 | |
|             }
 | |
| 
 | |
|             if (any_locks_unlocked)
 | |
|                 m_flock_blocker_set.unblock_all_blockers_whose_conditions_are_met();
 | |
| 
 | |
|             // Judging by the Linux implementation, unlocking a non-existent lock also works.
 | |
|             return true;
 | |
|         }
 | |
| 
 | |
|         TRY(flocks.try_append(Flock { lock.l_start, lock.l_len, &description, process.pid().value(), lock.l_type }));
 | |
|         return true;
 | |
|     });
 | |
| }
 | |
| 
 | |
| ErrorOr<void> Inode::apply_flock(Process const& process, OpenFileDescription const& description, Userspace<flock const*> input_lock, ShouldBlock should_block)
 | |
| {
 | |
|     auto new_lock = TRY(copy_typed_from_user(input_lock));
 | |
|     TRY(normalize_flock(description, new_lock));
 | |
| 
 | |
|     while (true) {
 | |
|         auto success = TRY(try_apply_flock(process, description, new_lock));
 | |
|         if (success)
 | |
|             return {};
 | |
| 
 | |
|         if (should_block == ShouldBlock::No)
 | |
|             return EAGAIN;
 | |
| 
 | |
|         if (Thread::current()->block<Thread::FlockBlocker>({}, *this, new_lock).was_interrupted())
 | |
|             return EINTR;
 | |
|     }
 | |
| }
 | |
| 
 | |
| ErrorOr<void> Inode::get_flock(OpenFileDescription const& description, Userspace<flock*> reference_lock) const
 | |
| {
 | |
|     flock lookup = {};
 | |
|     TRY(copy_from_user(&lookup, reference_lock));
 | |
|     TRY(normalize_flock(description, lookup));
 | |
| 
 | |
|     return m_flocks.with([&](auto& flocks) {
 | |
|         for (auto const& lock : flocks) {
 | |
|             if (!range_overlap(lock.start, lock.len, lookup.l_start, lookup.l_len))
 | |
|                 continue;
 | |
| 
 | |
|             // Locks with the same owner can't conflict with each other.
 | |
|             if (lock.pid == Process::current().pid())
 | |
|                 continue;
 | |
| 
 | |
|             if ((lookup.l_type == F_RDLCK && lock.type == F_WRLCK) || lookup.l_type == F_WRLCK) {
 | |
|                 lookup = { lock.type, SEEK_SET, lock.start, lock.len, lock.pid };
 | |
|                 return copy_to_user(reference_lock, &lookup);
 | |
|             }
 | |
|         }
 | |
| 
 | |
|         lookup.l_type = F_UNLCK;
 | |
|         return copy_to_user(reference_lock, &lookup);
 | |
|     });
 | |
| }
 | |
| 
 | |
| void Inode::remove_flocks_for_description(OpenFileDescription const& description)
 | |
| {
 | |
|     m_flocks.with([&](auto& flocks) {
 | |
|         flocks.remove_all_matching([&](auto& entry) { return entry.owner == &description; });
 | |
|     });
 | |
| }
 | |
| 
 | |
| bool Inode::has_watchers() const
 | |
| {
 | |
|     return !m_watchers.with([&](auto& watchers) { return watchers.is_empty(); });
 | |
| }
 | |
| 
 | |
| }
 |