2018-06-06 10:42:14 +08:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
2005-11-02 11:58:39 +08:00
|
|
|
* Copyright (c) 2000,2005 Silicon Graphics, Inc.
|
|
|
|
|
* All Rights Reserved.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
|
|
|
|
#ifndef __XFS_IALLOC_H__
|
|
|
|
|
#define __XFS_IALLOC_H__
|
|
|
|
|
|
|
|
|
|
struct xfs_buf;
|
|
|
|
|
struct xfs_dinode;
|
2008-11-28 11:23:41 +08:00
|
|
|
struct xfs_imap;
|
2005-04-17 06:20:36 +08:00
|
|
|
struct xfs_mount;
|
|
|
|
|
struct xfs_trans;
|
2013-10-23 07:51:50 +08:00
|
|
|
struct xfs_btree_cur;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2013-12-13 12:51:48 +08:00
|
|
|
/* Move inodes in clusters of this size */
|
2005-04-17 06:20:36 +08:00
|
|
|
#define XFS_INODE_BIG_CLUSTER_SIZE 8192
|
|
|
|
|
|
2015-05-29 07:26:03 +08:00
|
|
|
struct xfs_icluster {
|
|
|
|
|
bool deleted; /* record is deleted */
|
|
|
|
|
xfs_ino_t first_ino; /* first inode number */
|
|
|
|
|
uint64_t alloc; /* inode phys. allocation bitmap for
|
|
|
|
|
* sparse chunks */
|
|
|
|
|
};
|
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
|
* Make an inode pointer out of the buffer/offset.
|
|
|
|
|
*/
|
2005-11-02 11:38:42 +08:00
|
|
|
static inline struct xfs_dinode *
|
|
|
|
|
xfs_make_iptr(struct xfs_mount *mp, struct xfs_buf *b, int o)
|
|
|
|
|
{
|
2015-06-22 07:44:29 +08:00
|
|
|
return xfs_buf_offset(b, o << (mp)->m_sb.sb_inodelog);
|
2005-11-02 11:38:42 +08:00
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
/*
|
2021-06-02 08:48:24 +08:00
|
|
|
* Allocate an inode on disk. Mode is used to tell whether the new inode will
|
|
|
|
|
* need space, and whether it is a directory.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
2021-06-02 08:48:24 +08:00
|
|
|
int xfs_dialloc(struct xfs_trans **tpp, xfs_ino_t parent, umode_t mode,
|
|
|
|
|
xfs_ino_t *new_ino);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2021-06-02 08:48:51 +08:00
|
|
|
int xfs_difree(struct xfs_trans *tp, struct xfs_perag *pag,
|
|
|
|
|
xfs_ino_t ino, struct xfs_icluster *ifree);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
/*
|
2008-11-28 11:23:41 +08:00
|
|
|
* Return the location of the inode in imap, for mapping it into a buffer.
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
|
|
|
|
int
|
2008-11-28 11:23:41 +08:00
|
|
|
xfs_imap(
|
2005-04-17 06:20:36 +08:00
|
|
|
struct xfs_mount *mp, /* file system mount structure */
|
|
|
|
|
struct xfs_trans *tp, /* transaction pointer */
|
|
|
|
|
xfs_ino_t ino, /* inode to locate */
|
2008-11-28 11:23:41 +08:00
|
|
|
struct xfs_imap *imap, /* location map structure */
|
2005-04-17 06:20:36 +08:00
|
|
|
uint flags); /* flags for inode btree lookup */
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Log specified fields for the ag hdr (inode section)
|
|
|
|
|
*/
|
|
|
|
|
void
|
|
|
|
|
xfs_ialloc_log_agi(
|
|
|
|
|
struct xfs_trans *tp, /* transaction pointer */
|
|
|
|
|
struct xfs_buf *bp, /* allocation group header buffer */
|
|
|
|
|
int fields); /* bitmask of fields to log */
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Read in the allocation group header (inode allocation section)
|
|
|
|
|
*/
|
|
|
|
|
int /* error */
|
|
|
|
|
xfs_ialloc_read_agi(
|
|
|
|
|
struct xfs_mount *mp, /* file system mount structure */
|
|
|
|
|
struct xfs_trans *tp, /* transaction pointer */
|
|
|
|
|
xfs_agnumber_t agno, /* allocation group number */
|
|
|
|
|
struct xfs_buf **bpp); /* allocation group hdr buf */
|
|
|
|
|
|
[XFS] Lazy Superblock Counters
When we have a couple of hundred transactions on the fly at once, they all
typically modify the on disk superblock in some way.
create/unclink/mkdir/rmdir modify inode counts, allocation/freeing modify
free block counts.
When these counts are modified in a transaction, they must eventually lock
the superblock buffer and apply the mods. The buffer then remains locked
until the transaction is committed into the incore log buffer. The result
of this is that with enough transactions on the fly the incore superblock
buffer becomes a bottleneck.
The result of contention on the incore superblock buffer is that
transaction rates fall - the more pressure that is put on the superblock
buffer, the slower things go.
The key to removing the contention is to not require the superblock fields
in question to be locked. We do that by not marking the superblock dirty
in the transaction. IOWs, we modify the incore superblock but do not
modify the cached superblock buffer. In short, we do not log superblock
modifications to critical fields in the superblock on every transaction.
In fact we only do it just before we write the superblock to disk every
sync period or just before unmount.
This creates an interesting problem - if we don't log or write out the
fields in every transaction, then how do the values get recovered after a
crash? the answer is simple - we keep enough duplicate, logged information
in other structures that we can reconstruct the correct count after log
recovery has been performed.
It is the AGF and AGI structures that contain the duplicate information;
after recovery, we walk every AGI and AGF and sum their individual
counters to get the correct value, and we do a transaction into the log to
correct them. An optimisation of this is that if we have a clean unmount
record, we know the value in the superblock is correct, so we can avoid
the summation walk under normal conditions and so mount/recovery times do
not change under normal operation.
One wrinkle that was discovered during development was that the blocks
used in the freespace btrees are never accounted for in the AGF counters.
This was once a valid optimisation to make; when the filesystem is full,
the free space btrees are empty and consume no space. Hence when it
matters, the "accounting" is correct. But that means the when we do the
AGF summations, we would not have a correct count and xfs_check would
complain. Hence a new counter was added to track the number of blocks used
by the free space btrees. This is an *on-disk format change*.
As a result of this, lazy superblock counters are a mkfs option and at the
moment on linux there is no way to convert an old filesystem. This is
possible - xfs_db can be used to twiddle the right bits and then
xfs_repair will do the format conversion for you. Similarly, you can
convert backwards as well. At some point we'll add functionality to
xfs_admin to do the bit twiddling easily....
SGI-PV: 964999
SGI-Modid: xfs-linux-melb:xfs-kern:28652a
Signed-off-by: David Chinner <dgc@sgi.com>
Signed-off-by: Christoph Hellwig <hch@infradead.org>
Signed-off-by: Tim Shimmin <tes@sgi.com>
2007-05-24 13:26:31 +08:00
|
|
|
/*
|
|
|
|
|
* Read in the allocation group header to initialise the per-ag data
|
|
|
|
|
* in the mount structure
|
|
|
|
|
*/
|
|
|
|
|
int
|
|
|
|
|
xfs_ialloc_pagi_init(
|
|
|
|
|
struct xfs_mount *mp, /* file system mount structure */
|
|
|
|
|
struct xfs_trans *tp, /* transaction pointer */
|
|
|
|
|
xfs_agnumber_t agno); /* allocation group number */
|
|
|
|
|
|
2008-10-30 13:56:09 +08:00
|
|
|
/*
|
2009-09-01 07:58:21 +08:00
|
|
|
* Lookup a record by ino in the btree given by cur.
|
2008-10-30 13:56:09 +08:00
|
|
|
*/
|
2009-09-01 07:58:21 +08:00
|
|
|
int xfs_inobt_lookup(struct xfs_btree_cur *cur, xfs_agino_t ino,
|
|
|
|
|
xfs_lookup_t dir, int *stat);
|
2008-10-30 13:56:09 +08:00
|
|
|
|
2008-10-30 13:58:11 +08:00
|
|
|
/*
|
|
|
|
|
* Get the data from the pointed-to record.
|
|
|
|
|
*/
|
2012-11-14 14:53:49 +08:00
|
|
|
int xfs_inobt_get_rec(struct xfs_btree_cur *cur,
|
2009-09-01 07:56:58 +08:00
|
|
|
xfs_inobt_rec_incore_t *rec, int *stat);
|
2008-10-30 13:56:09 +08:00
|
|
|
|
2013-06-27 14:04:55 +08:00
|
|
|
/*
|
|
|
|
|
* Inode chunk initialisation routine
|
|
|
|
|
*/
|
|
|
|
|
int xfs_ialloc_inode_init(struct xfs_mount *mp, struct xfs_trans *tp,
|
2015-05-29 07:05:49 +08:00
|
|
|
struct list_head *buffer_list, int icount,
|
2013-06-27 14:04:55 +08:00
|
|
|
xfs_agnumber_t agno, xfs_agblock_t agbno,
|
|
|
|
|
xfs_agblock_t length, unsigned int gen);
|
|
|
|
|
|
2014-11-28 11:25:04 +08:00
|
|
|
int xfs_read_agi(struct xfs_mount *mp, struct xfs_trans *tp,
|
|
|
|
|
xfs_agnumber_t agno, struct xfs_buf **bpp);
|
|
|
|
|
|
2017-06-17 02:00:08 +08:00
|
|
|
union xfs_btree_rec;
|
|
|
|
|
void xfs_inobt_btrec_to_irec(struct xfs_mount *mp, union xfs_btree_rec *rec,
|
|
|
|
|
struct xfs_inobt_rec_incore *irec);
|
2018-01-17 10:52:12 +08:00
|
|
|
int xfs_ialloc_has_inodes_at_extent(struct xfs_btree_cur *cur,
|
|
|
|
|
xfs_agblock_t bno, xfs_extlen_t len, bool *exists);
|
|
|
|
|
int xfs_ialloc_has_inode_record(struct xfs_btree_cur *cur, xfs_agino_t low,
|
|
|
|
|
xfs_agino_t high, bool *exists);
|
|
|
|
|
int xfs_ialloc_count_inodes(struct xfs_btree_cur *cur, xfs_agino_t *count,
|
|
|
|
|
xfs_agino_t *freecount);
|
2018-05-10 01:02:02 +08:00
|
|
|
int xfs_inobt_insert_rec(struct xfs_btree_cur *cur, uint16_t holemask,
|
|
|
|
|
uint8_t count, int32_t freecount, xfs_inofree_t free,
|
|
|
|
|
int *stat);
|
2017-06-17 02:00:08 +08:00
|
|
|
|
|
|
|
|
int xfs_ialloc_cluster_alignment(struct xfs_mount *mp);
|
2019-06-06 02:19:35 +08:00
|
|
|
void xfs_ialloc_setup_geometry(struct xfs_mount *mp);
|
2019-12-12 05:19:06 +08:00
|
|
|
xfs_ino_t xfs_ialloc_calc_rootino(struct xfs_mount *mp, int sunit);
|
2014-11-28 11:25:04 +08:00
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
#endif /* __XFS_IALLOC_H__ */
|