On Thu, Feb 17, 2022 at 12:25:17PM -0500, Brian Foster wrote: > The free inode btree currently tracks all inode chunk records with > at least one free inode. This simplifies the chunk and allocation > selection algorithms as free inode availability can be guaranteed > after a few simple checks. This is no longer the case with busy > inode avoidance, however, because busy inode state is tracked in the > radix tree independent from physical allocation status. > > A busy inode avoidance algorithm relies on the ability to fall back > to an inode chunk allocation one way or another in the event that > all current free inodes are busy. Hack in a crude allocation > fallback mechanism for experimental purposes. If the inode selection > algorithm is unable to locate a usable inode, allow it to return > -EAGAIN to perform another physical chunk allocation in the AG and > retry the inode allocation. > > The current prototype can perform this allocation and retry sequence > repeatedly because a newly allocated chunk may still be covered by > busy in-core inodes in the radix tree (if it were recently freed, > for example). This is inefficient and temporary. It will be properly > mitigated by background chunk removal. This defers freeing of inode > chunk blocks from the free of the last used inode in the chunk to a > background task that only frees chunks once completely idle, thereby > providing a guarantee that a new chunk allocation always adds > non-busy inodes to the AG. I think you can get rid of this simply by checking the radix tree tags for busy inodes at the location of the new inode chunk before we do the cluster allocation. If there are busy inodes in the range of the chunk (pure gang tag lookup, don't need to dereference any of the inodes), just skip to the next chunk offset and try that. Hence we only ever end up allocating a chunk that we know there are no busy inodes in and this retry mechanism is unnecessary. Cheers, Dave. -- Dave Chinner david@xxxxxxxxxxxxx
