{"id":2704,"date":"2022-12-20T15:17:04","date_gmt":"2022-12-20T18:17:04","guid":{"rendered":"http:\/\/lode.uno\/linux-man\/index.php\/2022\/12\/20\/xfs_db-man8\/"},"modified":"2022-12-20T15:17:04","modified_gmt":"2022-12-20T18:17:04","slug":"xfs_db-man8","status":"publish","type":"post","link":"https:\/\/lode.uno\/linux-man\/2022\/12\/20\/xfs_db-man8\/","title":{"rendered":"xfs_db (man8)"},"content":{"rendered":"

xfs_db<\/h1>\n

NAME<\/a>
SYNOPSIS<\/a>
DESCRIPTION<\/a>
OPTIONS<\/a>
CONCEPTS<\/a>
COMMANDS<\/a>
TYPES<\/a>
DIAGNOSTICS<\/a>
SEE ALSO<\/a> <\/p>\n

\n

NAME <\/a> <\/h2>\n

xfs_db \u2212 debug an XFS filesystem<\/p>\n

SYNOPSIS <\/a> <\/h2>\n

xfs_db<\/b> [ \u2212c<\/b> cmd<\/i> ] … [ \u2212i<\/b>|r<\/b>|x<\/b>|F<\/b> ] [ \u2212f<\/b> ] [ \u2212l<\/b> logdev<\/i> ] [ \u2212p<\/b> progname<\/i> ] device<\/i>
xfs_db \u2212V<\/b><\/p>\n

DESCRIPTION <\/a> <\/h2>\n

xfs_db<\/b> is used to examine an XFS filesystem. Under rare circumstances it can also be used to modify an XFS filesystem, but that task is normally left to xfs_repair<\/b>(8) or to scripts such as xfs_admin<\/b>(8) that run xfs_db<\/b>.<\/p>\n

OPTIONS <\/a> <\/h2>\n\n\n\n\n\n
<\/td>\n\n

\u2212c<\/b> cmd<\/i><\/p>\n<\/td>\n

<\/td>\n\n

xfs_db<\/b> commands may be run interactively (the default) or as arguments on the command line. Multiple \u2212c<\/b> arguments may be given. The commands are run in the sequence given, then the program exits.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212f<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Specifies that the filesystem image to be processed is stored in a regular file at device<\/i> (see the mkfs.xfs<\/b>(8) -d<\/b> file<\/i> option). This might happen if an image copy of a filesystem has been made into an ordinary file with xfs_copy<\/b>(8).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212F<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Specifies that we want to continue even if the superblock magic is not correct. For use in xfs_metadump<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212i<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Allows execution on a mounted filesystem, provided it is mounted read-only. Useful for shell scripts which must only operate on filesystems in a guaranteed consistent state (either unmounted or mounted read-only). These semantics are slightly different to that of the -r<\/b> option.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

\u2212l<\/b> logdev<\/i><\/p>\n

Specifies the device where the filesystems external log resides. Only for those filesystems which use an external log. See the mkfs.xfs<\/b>(8) \u2212l<\/b> option, and refer to xfs<\/b>(5) for a detailed description of the XFS log.<\/p>\n

\u2212p<\/b> progname<\/i><\/p>\n

Set the program name to progname<\/i> for prompts and some error messages, the default value is xfs_db<\/b>.<\/p>\n\n\n\n\n
<\/td>\n\n

-r<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Open device<\/i> or filename<\/i> read-only. This option is required if the filesystem is mounted. It is only necessary to omit this flag if a command that changes data (write<\/b>, blocktrash<\/b>, crc<\/b>) is to be used.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212x<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Specifies expert mode. This enables the (write<\/b>, blocktrash<\/b>, crc<\/b> invalidate\/revalidate) commands.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212V<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Prints the version number and exits.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

CONCEPTS <\/a> <\/h2>\n

xfs_db<\/b> commands can be broken up into two classes. Most commands are for the navigation and display of data structures in the filesystem. Other commands are for scanning the filesystem in some way.<\/p>\n

Commands which are used to navigate the filesystem structure take arguments which reflect the names of filesystem structure fields. There can be multiple field names separated by dots when the underlying structures are nested, as in C. The field names can be indexed (as an array index) if the underlying field is an array. The array indices can be specified as a range, two numbers separated by a dash.<\/p>\n

xfs_db<\/b> maintains a current address in the filesystem. The granularity of the address is a filesystem structure. This can be a filesystem block, an inode or quota (smaller than a filesystem block), or a directory block (could be larger than a filesystem block). There are a variety of commands to set the current address. Associated with the current address is the current data type, which is the structural type of this data. Commands which follow the structure of the filesystem always set the type as well as the address. Commands which examine pieces of an individual file (inode) need the current inode to be set, this is done with the inode<\/b> command.<\/p>\n

The current address\/type information is actually maintained in a stack that can be explicitly manipulated with the push<\/b>, pop<\/b>, and stack<\/b> commands. This allows for easy examination of a nested filesystem structure. Also, the last several locations visited are stored in a ring buffer which can be manipulated with the forward<\/b>, back<\/b>, and ring<\/b> commands.<\/p>\n

XFS filesystems are divided into a small number of allocation groups. xfs_db<\/b> maintains a notion of the current allocation group which is manipulated by some commands. The initial allocation group is 0.<\/p>\n

COMMANDS <\/a> <\/h2>\n

Many commands have extensive online help. Use the help<\/b> command for more details on any command.<\/p>\n\n\n
<\/td>\n\n

a<\/b><\/p>\n<\/td>\n

<\/td>\n\n

See the addr<\/b> command.<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n<\/table>\n

ablock<\/b> filoff<\/i><\/p>\n

Set current address to the offset filoff<\/i> (a filesystem block number) in the attribute area of the current inode.<\/p>\n

addr [<\/b>field-expression<\/i>]<\/b><\/p>\n

Set current address to the value of the field-expression<\/i>. This is used to “follow” a reference in one structure to the object being referred to. If no argument is given, the current address is printed.<\/p>\n

agf [<\/b>agno<\/i>]<\/b><\/p>\n

Set current address to the AGF block for allocation group agno<\/i>. If no argument is given, use the current allocation group.<\/p>\n

agfl [<\/b>agno<\/i>]<\/b><\/p>\n

Set current address to the AGFL block for allocation group agno<\/i>. If no argument is given, use the current allocation group.<\/p>\n

agi [<\/b>agno<\/i>]<\/b><\/p>\n

Set current address to the AGI block for allocation group agno<\/i>. If no argument is given, use the current allocation group.<\/p>\n

agresv [<\/b>agno<\/i>]<\/b><\/p>\n

Displays the length, free block count, per-AG reservation size, and per-AG reservation usage for a given AG. If no argument is given, display information for all AGs.<\/p>\n

attr_remove [\u2212r|\u2212u|\u2212s] [\u2212n]<\/b> name<\/i><\/p>\n

Remove the specified extended attribute from the current file.<\/p>\n\n\n\n\n\n
<\/td>\n\n

\u2212r<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Sets the attribute in the root namespace. Only one namespace option can be specified.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212u<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Sets the attribute in the user namespace. Only one namespace option can be specified.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212s<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Sets the attribute in the secure namespace. Only one namespace option can be specified.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212n<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Do not enable \u2019noattr2\u2019 mode on V4 filesystems.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

attr_set [\u2212r|\u2212u|\u2212s] [\u2212n] [\u2212R|\u2212C] [\u2212v<\/b> namelen<\/i>]<\/b> name<\/i><\/p>\n

Sets an extended attribute on the current file with the given name.<\/p>\n\n\n\n\n\n\n\n\n\n
<\/td>\n\n

\u2212r<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Sets the attribute in the root namespace. Only one namespace option can be specified.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212u<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Sets the attribute in the user namespace. Only one namespace option can be specified.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212s<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Sets the attribute in the secure namespace. Only one namespace option can be specified.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212n<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Do not enable \u2019noattr2\u2019 mode on V4 filesystems.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212R<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Replace the attribute. The command will fail if the attribute does not already exist.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212C<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Create the attribute. The command will fail if the attribute already exists.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212v<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Set the attribute value to a string of this length containing the letter \u2019v\u2019.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

b<\/b><\/p>\n<\/td>\n

<\/td>\n <\/td>\n<\/tr>\n<\/table>\n

See the back<\/b> command.<\/p>\n\n\n
<\/td>\n\n

back<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Move to the previous location in the position ring.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

blockfree<\/b><\/p>\n

Free block usage information collected by the last execution of the blockget<\/b> command. This must be done before another blockget<\/b> command can be given, presumably with different arguments than the previous one.<\/p>\n

blockget [\u2212npvs] [\u2212b<\/b> bno<\/i>] … [\u2212i<\/b> ino<\/i>] …<\/b><\/p>\n

Get block usage and check filesystem consistency. The information is saved for use by a subsequent blockuse<\/b>, ncheck<\/b>, or blocktrash<\/b> command.<\/p>\n\n\n\n\n\n\n\n
<\/td>\n\n

\u2212b<\/b><\/p>\n<\/td>\n

<\/td>\n\n

is used to specify filesystem block numbers about which verbose information should be printed.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212i<\/b><\/p>\n<\/td>\n

<\/td>\n\n

is used to specify inode numbers about which verbose information should be printed.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212n<\/b><\/p>\n<\/td>\n

<\/td>\n\n

is used to save pathnames for inodes visited, this is used to support the xfs_ncheck<\/b>(8) command. It also means that pathnames will be printed for inodes that have problems. This option uses a lot of memory so is not enabled by default.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212p<\/b><\/p>\n<\/td>\n

<\/td>\n\n

causes error messages to be prefixed with the filesystem name being processed. This is useful if several copies of xfs_db<\/b> are run in parallel.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212s<\/b><\/p>\n<\/td>\n

<\/td>\n\n

restricts output to severe errors only. This is useful if the output is too long otherwise.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212v<\/b><\/p>\n<\/td>\n

<\/td>\n\n

enables verbose output. Messages will be printed for every block and inode processed.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

blocktrash [-z] [\u2212o<\/b> offset<\/i>] [\u2212n<\/b> count<\/i>] [\u2212x<\/b> min<\/i>] [\u2212y<\/b> max<\/i>] [\u2212s<\/b> seed<\/i>]
[\u22120|1|2|3] [\u2212t<\/b> type<\/i>] …<\/b><\/p>\n

Trash randomly selected filesystem metadata blocks. Trashing occurs to randomly selected bits in the chosen blocks. This command is available only in debugging versions of xfs_db<\/b>. It is useful for testing xfs_repair<\/b>(8).<\/p>\n

\u22120<\/b> | -1<\/b> | -2<\/b> | -3<\/b><\/p>\n

These are used to set the operating mode for blocktrash<\/b>. Only one can be used: \u22120<\/b> changed bits are cleared; \u22121<\/b> changed bits are set; -2<\/b> changed bits are inverted; -3<\/b> changed bits are randomized.<\/p>\n\n\n\n\n\n\n\n\n
<\/td>\n\n

\u2212n<\/b><\/p>\n<\/td>\n

<\/td>\n\n

supplies the count<\/i> of block-trashings to perform (default 1).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212o<\/b><\/p>\n<\/td>\n

<\/td>\n\n

supplies the bit offset<\/i> at which to start trashing the block. If the value is preceded by a \u2019+\u2019, the trashing will start at a randomly chosen offset that is larger than the value supplied. The default is to randomly choose an offset anywhere in the block.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212s<\/b><\/p>\n<\/td>\n

<\/td>\n\n

supplies a seed<\/i> to the random processing.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212t<\/b><\/p>\n<\/td>\n

<\/td>\n\n

gives a type<\/i> of blocks to be selected for trashing. Multiple \u2212t<\/b> options may be given. If no \u2212t<\/b> options are given then all metadata types can be trashed.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212x<\/b><\/p>\n<\/td>\n

<\/td>\n\n

sets the minimum<\/i> size of bit range to be trashed. The default value is 1.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212y<\/b><\/p>\n<\/td>\n

<\/td>\n\n

sets the maximum<\/i> size of bit range to be trashed. The default value is 1024.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212z<\/b><\/p>\n<\/td>\n

<\/td>\n\n

trashes the block at the top of the stack. It is not necessary to run blockget<\/b> if this option is supplied.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

blockuse [\u2212n] [\u2212c<\/b> count<\/i>]<\/b><\/p>\n

Print usage for current filesystem block(s). For each block, the type and (if any) inode are printed.<\/p>\n\n\n\n
<\/td>\n\n

\u2212c<\/b><\/p>\n<\/td>\n

<\/td>\n\n

specifies a count<\/i> of blocks to process. The default value is 1 (the current block only).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212n<\/b><\/p>\n<\/td>\n

<\/td>\n\n

specifies that file names should be printed. The prior blockget<\/b> command must have also specified the \u2212n<\/b> option.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

bmap [\u2212a] [\u2212d] [<\/b>block<\/i> [<\/b>len<\/i>]]<\/b><\/p>\n

Show the block map for the current inode. The map display can be restricted to an area of the file with the block<\/i> and len<\/i> arguments. If block<\/i> is given and len<\/i> is omitted then 1 is assumed for len.<\/p>\n

The \u2212a<\/b> and \u2212d<\/b> options are used to select the attribute or data area of the inode, if neither option is given then both areas are shown.<\/p>\n

btdump [-a] [-i]<\/b><\/p>\n

If the cursor points to a btree node, dump the btree from that block downward. If instead the cursor points to an inode, dump the data fork block mapping btree if there is one. If the cursor points to a directory or extended attribute btree node, dump that. By default, only records stored in the btree are dumped.<\/p>\n\n\n\n
<\/td>\n\n

\u2212a<\/b><\/p>\n<\/td>\n

<\/td>\n\n

If the cursor points at an inode, dump the extended attribute block mapping btree, if present.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212i<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Dump all keys and pointers in intermediate btree nodes, and all records in leaf btree nodes.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

btheight [\u2212b<\/b> blksz<\/i>] [\u2212n<\/b> recs<\/i>] [\u2212w<\/b> max<\/i>|\u2212w<\/b> min<\/i>] btree types…<\/b><\/p>\n

For a given number of btree records and a btree type, report the number of records and blocks for each level of the btree, and the total number of blocks. The btree type must be given after the options.<\/p>\n

A raw btree geometry can be provided in the format “record_bytes:key_bytes:ptr_bytes:header_type”, where header_type is one of “short”, “long”, “shortcrc”, or “longcrc”.<\/p>\n

The supported btree types are: bnobt<\/i>, cntbt<\/i>, inobt<\/i>, finobt<\/i>, bmapbt<\/i>, refcountbt<\/i>, and rmapbt<\/i>.<\/p>\n

Options are as follows:<\/p>\n\n\n\n
<\/td>\n\n

\u2212b<\/b><\/p>\n<\/td>\n

<\/td>\n\n

is used to override the btree block size. The default is the filesystem block size.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212n<\/b><\/p>\n<\/td>\n

<\/td>\n\n

is used to specify the number of records to store. This argument is required.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

\u2212w max<\/b><\/p>\n

shows only the best case scenario, which is when the btree blocks are maximally loaded.<\/p>\n

\u2212w min<\/b><\/p>\n

shows only the worst case scenario, which is when the btree blocks are half full.<\/p>\n\n\n
<\/td>\n\n

check<\/b><\/p>\n<\/td>\n

<\/td>\n\n

See the blockget<\/b> command.<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n<\/table>\n

convert<\/b> type number<\/i> [<\/b>type number<\/i>] …<\/b> type<\/i><\/p>\n

Convert from one address form to another. The known type<\/i>s, with alternate names, are:<\/p>\n\n\n\n
<\/td>\n\n

agblock<\/b><\/p>\n<\/td>\n

\n

or agbno<\/b> (filesystem block within an allocation group)<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

agino<\/b><\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n<\/table>\n

or aginode<\/b> (inode number within an allocation group)<\/p>\n\n\n\n
<\/td>\n\n

agnumber<\/b><\/p>\n<\/td>\n

<\/td>\n\n

or agno<\/b> (allocation group number)<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n
<\/td>\n\n

bboff<\/b><\/p>\n<\/td>\n

<\/td>\n<\/td>\n <\/td>\n<\/tr>\n<\/table>\n

or daddroff<\/b> (byte offset in a daddr<\/b>)<\/p>\n\n\n\n
<\/td>\n\n

blkoff<\/b><\/p>\n<\/td>\n

<\/td>\n\n

or fsboff or agboff<\/b> (byte offset in a agblock<\/b> or fsblock<\/b>)<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

byte<\/b><\/p>\n<\/td>\n

<\/td>\n <\/td>\n<\/tr>\n<\/table>\n

or fsbyte<\/b> (byte address in filesystem)<\/p>\n\n\n
<\/td>\n\n

daddr<\/b><\/p>\n<\/td>\n

<\/td>\n\n

or bb<\/b> (disk address, 512-byte blocks)<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n<\/table>\n\n\n\n
<\/td>\n\n

fsblock<\/b><\/p>\n<\/td>\n

<\/td>\n\n

or fsb<\/b> or fsbno<\/b> (filesystem block, see the fsblock<\/b> command)<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

ino<\/b><\/p>\n<\/td>\n

<\/td>\n\n

or inode<\/b> (inode number)<\/p>\n<\/td>\n<\/tr>\n<\/table>\n\n\n\n
<\/td>\n\n

inoidx<\/b><\/p>\n<\/td>\n

<\/td>\n\n

or offset<\/b> (index of inode in filesystem block)<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

inooff<\/b><\/p>\n<\/td>\n

<\/td>\n\n

or inodeoff<\/b> (byte offset in inode)<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

Only conversions that “make sense” are allowed. The compound form (with more than three arguments) is useful for conversions such as convert agno<\/b> ag<\/i> agbno<\/b> agb<\/i> fsblock<\/b>.<\/p>\n

crc [\u2212i|\u2212r|\u2212v]<\/b><\/p>\n

Invalidates, revalidates, or validates the CRC (checksum) field of the current structure, if it has one. This command is available only on CRC-enabled filesystems. With no argument, validation is performed. Each command will display the resulting CRC value and state.<\/p>\n\n\n\n\n
<\/td>\n\n

\u2212i<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Invalidate the structure\u2019s CRC value (incrementing it by one), and write it to disk.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212r<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Recalculate the current structure\u2019s correct CRC value, and write it to disk.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212v<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Validate and display the current value and state of the structure\u2019s CRC.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

daddr [<\/b>d<\/i>]<\/b><\/p>\n

Set current address to the daddr (512 byte block) given by d<\/i>. If no value for d<\/i> is given, the current address is printed, expressed as a daddr. The type is set to data<\/b> (uninterpreted).<\/p>\n

dblock<\/b> filoff<\/i><\/p>\n

Set current address to the offset filoff<\/i> (a filesystem block number) in the data area of the current inode.<\/p>\n

debug [<\/b>flagbits<\/i>]<\/b><\/p>\n

Set debug option bits. These are used for debugging xfs_db<\/b>. If no value is given for flagbits<\/i>, print the current debug option bits. These are for the use of the implementor.<\/p>\n

dquot [<\/b>\u2212g<\/i>|<\/b>\u2212p<\/i>|<\/b>\u2212u<\/i>]<\/b> id<\/i><\/p>\n

Set current address to a group, project or user quota block for the given ID. Defaults to user quota.<\/p>\n

echo [<\/b>arg<\/i>] …<\/b><\/p>\n

Echo the arguments to the output.<\/p>\n\n\n
<\/td>\n\n

f<\/b><\/p>\n<\/td>\n

<\/td>\n\n

See the forward<\/b> command.<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n<\/table>\n

forward<\/b><\/p>\n

Move forward to the next entry in the position ring.<\/p>\n

frag [\u2212adflqRrv]<\/b><\/p>\n

Get file fragmentation data. This prints information about fragmentation of file data in the filesystem (as opposed to fragmentation of freespace, for which see the freesp<\/b> command). Every file in the filesystem is examined to see how far from ideal its extent mappings are. A summary is printed giving the totals.<\/p>\n\n\n\n\n\n\n\n\n\n
<\/td>\n\n

\u2212v<\/b><\/p>\n<\/td>\n

<\/td>\n\n

sets verbosity, every inode has information printed for it. The remaining options select which inodes and extents are examined. If no options are given then all are assumed set, otherwise just those given are enabled.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212a<\/b><\/p>\n<\/td>\n

<\/td>\n\n

enables processing of attribute data.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212d<\/b><\/p>\n<\/td>\n

<\/td>\n\n

enables processing of directory data.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212f<\/b><\/p>\n<\/td>\n

<\/td>\n\n

enables processing of regular file data.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212l<\/b><\/p>\n<\/td>\n

<\/td>\n\n

enables processing of symbolic link data.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212q<\/b><\/p>\n<\/td>\n

<\/td>\n\n

enables processing of quota file data.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212R<\/b><\/p>\n<\/td>\n

<\/td>\n\n

enables processing of realtime control file data.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212r<\/b><\/p>\n<\/td>\n

<\/td>\n\n

enables processing of realtime file data.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

freesp [\u2212bcds] [\u2212A<\/b> alignment<\/i>] [\u2212a<\/b> ag<\/i>] … [\u2212e<\/b> i<\/i>] [\u2212h<\/b> h1<\/i>] … [\u2212m<\/b> m<\/i>]<\/b><\/p>\n

Summarize free space for the filesystem. The free blocks are examined and totalled, and displayed in the form of a histogram, with a count of extents in each range of free extent sizes.<\/p>\n\n\n\n\n\n\n\n\n\n\n\n
<\/td>\n\n

\u2212A<\/b><\/p>\n<\/td>\n

<\/td>\n\n

reports only free extents with starting blocks aligned to alignment<\/i> blocks.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212a<\/b><\/p>\n<\/td>\n

<\/td>\n\n

adds ag<\/i> to the list of allocation groups to be processed. If no \u2212a<\/b> options are given then all allocation groups are processed.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212b<\/b><\/p>\n<\/td>\n

<\/td>\n\n

specifies that the histogram buckets are binary-sized, with the starting sizes being the powers of 2.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212c<\/b><\/p>\n<\/td>\n

<\/td>\n\n

specifies that freesp<\/b> will search the by-size (cnt) space Btree instead of the default by-block (bno) space Btree.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212d<\/b><\/p>\n<\/td>\n

<\/td>\n\n

specifies that every free extent will be displayed.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212e<\/b><\/p>\n<\/td>\n

<\/td>\n\n

specifies that the histogram buckets are equal-sized, with the size specified as i<\/i>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212h<\/b><\/p>\n<\/td>\n

<\/td>\n\n

specifies a starting block number for a histogram bucket as h1<\/i>. Multiple \u2212h<\/b>\u2019s are given to specify the complete set of buckets.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212m<\/b><\/p>\n<\/td>\n

<\/td>\n\n

specifies that the histogram starting block numbers are powers of m<\/i>. This is the general case of \u2212b<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212s<\/b><\/p>\n<\/td>\n

<\/td>\n\n

specifies that a final summary of total free extents, free blocks, and the average free extent size is printed.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

fsb<\/b><\/p>\n<\/td>\n

<\/td>\n <\/td>\n<\/tr>\n<\/table>\n

See the fsblock<\/b> command.<\/p>\n

fsblock [<\/b>fsb<\/i>]<\/b><\/p>\n

Set current address to the fsblock value given by fsb<\/i>. If no value for fsb<\/i> is given the current address is printed, expressed as an fsb. The type is set to data<\/b> (uninterpreted). XFS filesystem block numbers are computed ((agno<\/i> << agshift<\/i>) | agblock<\/i>) where agshift<\/i> depends on the size of an allocation group. Use the convert<\/b> command to convert to and from this form. Block numbers given for file blocks (for instance from the bmap<\/b> command) are in this form.<\/p>\n

fsmap [<\/b> start<\/i> ] [<\/b> end<\/i> ]<\/b><\/p>\n

Prints the mapping of disk blocks used by an XFS filesystem. The map lists each extent used by files, allocation group metadata, journalling logs, and static filesystem metadata, as well as any regions that are unused. All blocks, offsets, and lengths are specified in units of 512-byte blocks, no matter what the filesystem\u2019s block size is. The optional<\/b> start<\/i> and<\/b> end<\/i> arguments can be used to constrain<\/b> the output to a particular range of disk blocks.<\/p>\n

fuzz [\u2212c] [\u2212d]<\/b> field action<\/i><\/p>\n

Write garbage into a specific structure field on disk. Expert mode must be enabled to use this command. The operation happens immediately; there is no buffering.<\/p>\n

The fuzz command can take the following action<\/i>s against a field:<\/p>\n

zeroes<\/b><\/p>\n

Clears all bits in the field.<\/p>\n

ones<\/b><\/p>\n

Sets all bits in the field.<\/p>\n

firstbit<\/b><\/p>\n

Flips the first bit in the field. For a scalar value, this is the highest bit.<\/p>\n

middlebit<\/b><\/p>\n

Flips the middle bit in the field.<\/p>\n

lastbit<\/b><\/p>\n

Flips the last bit in the field. For a scalar value, this is the lowest bit.<\/p>\n\n\n\n
<\/td>\n\n

add<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Adds a small value to a scalar field.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

sub<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Subtracts a small value from a scalar field.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

random<\/b><\/p>\n

Randomizes the contents of the field.<\/p>\n

The following switches affect the write behavior:<\/p>\n\n\n\n
<\/td>\n\n

\u2212c<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Skip write verifiers and CRC recalculation; allows invalid data to be written to disk.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212d<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Skip write verifiers but perform CRC recalculation; allows invalid data to be written to disk to test detection of invalid data.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

hash<\/b> string<\/i><\/p>\n

Prints the hash value of string<\/i> using the hash function of the XFS directory and attribute implementation.<\/p>\n

help [<\/b>command<\/i>]<\/b><\/p>\n

Print help for one or all commands.<\/p>\n\n\n
<\/td>\n\n

info<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Displays selected geometry information about the filesystem. The output will have the same format that mkfs.xfs<\/b>(8) prints when creating a filesystem or xfs_info<\/b>(8) prints when querying a filesystem.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

inode [<\/b>inode#<\/i>]<\/b><\/p>\n

Set the current inode number. If no inode#<\/i> is given, print the current inode number.<\/p>\n

label [<\/b>label<\/i>]<\/b><\/p>\n

Set the filesystem label. The filesystem label can be used by mount<\/b>(8) instead of using a device special file. The maximum length of an XFS label is 12 characters \u2212 use of a longer label<\/i> will result in truncation and a warning will be issued. If no label<\/i> is given, the current filesystem label is printed.<\/p>\n

log [stop | start<\/b> filename<\/i>]<\/b><\/p>\n

Start logging output to filename<\/i>, stop logging, or print the current logging status.<\/p>\n

logformat [\u2212c<\/b> cycle<\/i>] [\u2212s<\/b> sunit<\/i>]<\/b><\/p>\n

Reformats the log to the specified log cycle and log stripe unit. This has the effect of clearing the log destructively. If the log cycle is not specified, the log is reformatted to the current cycle. If the log stripe unit is not specified, the stripe unit from the filesystem superblock is used.<\/p>\n\n\n
<\/td>\n\n

logres<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Print transaction reservation size information for each transaction type. This makes it easier to find discrepancies in the reservation calculations between xfsprogs and the kernel, which will help when diagnosing minimum log size calculation errors.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

ls [\u2212i] [<\/b>paths<\/i>]…<\/b><\/p>\n

List the contents of a directory. If a path resolves to a directory, the directory will be listed. If no paths are supplied and the IO cursor points at a directory inode, the contents of that directory will be listed.<\/p>\n

The output format is: directory cookie, inode number, file type, hash, name length, name.<\/p>\n\n\n
<\/td>\n\n

\u2212i<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Resolve each of the given paths to an inode number and print that number. If no paths are given and the IO cursor points to an inode, print the inode number.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

metadump [\u2212egow]<\/b> filename<\/i><\/p>\n

Dumps metadata to a file. See xfs_metadump<\/b>(8) for more information.<\/p>\n

ncheck [\u2212s] [\u2212i<\/b> ino<\/i>] …<\/b><\/p>\n

Print name-inode pairs. A blockget \u2212n<\/b> command must be run first to gather the information.<\/p>\n\n\n\n\n
<\/td>\n\n

\u2212i<\/b><\/p>\n<\/td>\n

<\/td>\n\n

specifies an inode number to be printed. If no \u2212i<\/b> options are given then all inodes are printed.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212s<\/b><\/p>\n<\/td>\n

<\/td>\n\n

specifies that only setuid and setgid files are printed.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

p<\/b><\/p>\n<\/td>\n

<\/td>\n <\/td>\n<\/tr>\n<\/table>\n

See the print<\/b> command.<\/p>\n

path<\/b> dir_path<\/i><\/p>\n

Walk the directory tree to an inode using the supplied path. Absolute and relative paths are supported.<\/p>\n\n\n
<\/td>\n\n

pop<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Pop location from the stack.<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n<\/table>\n

print [<\/b>field-expression<\/i>] …<\/b><\/p>\n

Print field values. If no argument is given, print all fields in the current structure.<\/p>\n

push [<\/b>command<\/i>]<\/b><\/p>\n

Push location to the stack. If command<\/i> is supplied, set the current location to the results of command<\/i> after pushing the old location.<\/p>\n\n\n\n
<\/td>\n\n

q<\/b><\/p>\n<\/td>\n

<\/td>\n\n

See the quit<\/b> command.<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n
<\/td>\n\n

quit<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Exit xfs_db<\/b>.<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n<\/table>\n

ring [<\/b>index<\/i>]<\/b><\/p>\n

Show position ring (if no index<\/i> argument is given), or move to a specific entry in the position ring given by index<\/i>.<\/p>\n

sb [<\/b>agno<\/i>]<\/b><\/p>\n

Set current address to SB header in allocation group agno<\/i>. If no agno<\/i> is given, use the current allocation group number.<\/p>\n

source<\/b> source-file<\/i><\/p>\n

Process commands from source-file<\/i>. source<\/b> commands can be nested.<\/p>\n\n\n
<\/td>\n\n

stack<\/b><\/p>\n<\/td>\n

<\/td>\n\n

View the location stack.<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n<\/table>\n

type [<\/b>type<\/i>]<\/b><\/p>\n

Set the current data type to type<\/i>. If no argument is given, show the current data type. The possible data types are: agf<\/b>, agfl<\/b>, agi<\/b>, attr<\/b>, bmapbta<\/b>, bmapbtd<\/b>, bnobt<\/b>, cntbt<\/b>, data<\/b>, dir<\/b>, dir2<\/b>, dqblk<\/b>, inobt<\/b>, inode<\/b>, log<\/b>, refcntbt<\/b>, rmapbt<\/b>, rtbitmap<\/b>, rtsummary<\/b>, sb<\/b>, symlink<\/b> and text<\/b>. See the TYPES section below for more information on these data types.<\/p>\n

timelimit [<\/b>OPTIONS<\/i>]<\/b><\/p>\n

Print the minimum and maximum supported values for inode timestamps, quota expiration timers, and quota grace periods supported by this filesystem. Options include:<\/p>\n

\u2212-bigtime<\/b><\/p>\n

Print the time limits of an XFS filesystem with the bigtime<\/b> feature enabled.<\/p>\n

\u2212-classic<\/b><\/p>\n

Print the time limits of a classic XFS filesystem.<\/p>\n

\u2212-compact<\/b><\/p>\n

Print all limits as raw values on a single line.<\/p>\n

\u2212-pretty<\/b><\/p>\n

Print the timestamps in the current locale\u2019s date and time format instead of raw seconds since the Unix epoch.<\/p>\n

uuid [<\/b>uuid<\/i> |<\/b> generate<\/i> |<\/b> rewrite<\/i> |<\/b> restore<\/i>]<\/b><\/p>\n

Set the filesystem universally unique identifier (UUID). The filesystem UUID can be used by mount<\/b>(8) instead of using a device special file. The uuid<\/i> can be set directly to the desired UUID, or it can be automatically generated using the generate<\/b> option. These options will both write the UUID into every copy of the superblock in the filesystem. On a CRC-enabled filesystem, this will set an incompatible superblock flag, and the filesystem will not be mountable with older kernels. This can be reverted with the restore<\/b> option, which will copy the original UUID back into place and clear the incompatible flag as needed. rewrite<\/b> copies the current UUID from the primary superblock to all secondary copies of the superblock. If no argument is given, the current filesystem UUID is printed.<\/p>\n

version [<\/b>feature<\/i> |<\/b> versionnum features2<\/i>]<\/b><\/p>\n

Enable selected features for a filesystem (certain features can be enabled on an unmounted filesystem, after mkfs.xfs<\/b>(8) has created the filesystem). Support for unwritten extents can be enabled using the extflg<\/b> option. Support for version 2 log format can be enabled using the log2<\/b> option. Support for extended attributes can be enabled using the attr1<\/b> or attr2<\/b> option. Once enabled, extended attributes cannot be disabled, but the user may toggle between attr1<\/b> and attr2<\/b> at will (older kernels may not support the newer version).<\/p>\n

If no argument is given, the current version and feature bits are printed. With one argument, this command will write the updated version number into every copy of the superblock in the filesystem. If two arguments are given, they will be used as numeric values for the versionnum<\/i> and features2<\/i> bits respectively, and their string equivalent reported (but no modifications are made).<\/p>\n

write [\u2212c|\u2212d] [<\/b>field value<\/i>] …<\/b><\/p>\n

Write a value to disk. Specific fields can be set in structures (struct mode), or a block can be set to data values (data mode), or a block can be set to string values (string mode, for symlink blocks). The operation happens immediately: there is no buffering.<\/p>\n

Struct mode is in effect when the current type is structural, i.e. not data. For struct mode, the syntax is “write<\/b> field value”.<\/i><\/p>\n

Data mode is in effect when the current type is data. In this case the contents of the block can be shifted or rotated left or right, or filled with a sequence, a constant value, or a random value. In this mode write<\/b> with no arguments gives more information on the allowed commands.<\/p>\n\n\n\n
<\/td>\n\n

\u2212c<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Skip write verifiers and CRC recalculation; allows invalid data to be written to disk.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

\u2212d<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Skip write verifiers but perform CRC recalculation. This allows invalid data to be written to disk to test detection of invalid data. (This is not possible for some types.)<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

TYPES <\/a> <\/h2>\n

This section gives the fields in each structure type and their meanings. Note that some types of block cover multiple actual structures, for instance directory blocks.<\/p>\n\n\n
<\/td>\n\n

agf<\/b><\/p>\n<\/td>\n

<\/td>\n\n

The AGF block is the header for block allocation information; it is in the second 512-byte block of each allocation group. The following fields are defined:<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

magicnum<\/b><\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
<\/td>\n<\/td>\n<\/td>\n\n

AGF block magic number, 0x58414746 (\u2019XAGF\u2019).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

versionnum<\/b><\/p>\n<\/td>\n

<\/td>\n\n

version number, currently 1.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

seqno<\/b><\/p>\n<\/td>\n

<\/td>\n\n

sequence number starting from 0.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

length<\/b><\/p>\n<\/td>\n

<\/td>\n\n

size in filesystem blocks of the allocation group. All allocation groups except the last one of the filesystem have the superblock\u2019s agblocks<\/b> value here.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

bnoroot<\/b><\/p>\n<\/td>\n

<\/td>\n\n

block number of the root of the Btree holding free space information sorted by block number.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

cntroot<\/b><\/p>\n<\/td>\n

<\/td>\n\n

block number of the root of the Btree holding free space information sorted by block count.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

bnolevel<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of levels in the by-block-number Btree.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

cntlevel<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of levels in the by-block-count Btree.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

flfirst<\/b><\/p>\n<\/td>\n

<\/td>\n\n

index into the AGFL block of the first active entry.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

fllast<\/b><\/p>\n<\/td>\n

<\/td>\n\n

index into the AGFL block of the last active entry.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

flcount<\/b><\/p>\n<\/td>\n

<\/td>\n\n

count of active entries in the AGFL block.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

freeblks<\/b><\/p>\n<\/td>\n

<\/td>\n\n

count of blocks represented in the freespace Btrees.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

longest<\/b><\/p>\n<\/td>\n

<\/td>\n\n

longest free space represented in the freespace Btrees.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

btreeblks<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of blocks held in the AGF Btrees.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

agfl<\/b><\/p>\n<\/td>\n

<\/td>\n <\/td>\n<\/tr>\n<\/table>\n

The AGFL block contains block numbers for use of the block allocator; it is in the fourth 512-byte block of each allocation group. Each entry in the active list is a block number within the allocation group that can be used for any purpose if space runs low. The AGF block fields flfirst<\/b>, fllast<\/b>, and flcount<\/b> designate which entries are currently active. Entry space is allocated in a circular manner within the AGFL block. Fields defined:<\/p>\n\n\n\n
<\/td>\n\n

bno<\/b><\/p>\n<\/td>\n

<\/td>\n\n

array of all block numbers. Even those which are not active are printed.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

agi<\/b><\/p>\n<\/td>\n

<\/td>\n <\/td>\n<\/tr>\n<\/table>\n

The AGI block is the header for inode allocation information; it is in the third 512-byte block of each allocation group. Fields defined:<\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n
<\/td>\n\n

magicnum<\/b><\/p>\n<\/td>\n

<\/td>\n\n

AGI block magic number, 0x58414749 (\u2019XAGI\u2019).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

versionnum<\/b><\/p>\n<\/td>\n

<\/td>\n\n

version number, currently 1.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

seqno<\/b><\/p>\n<\/td>\n

<\/td>\n\n

sequence number starting from 0.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

length<\/b><\/p>\n<\/td>\n

<\/td>\n\n

size in filesystem blocks of the allocation group.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

count<\/b><\/p>\n<\/td>\n

<\/td>\n\n

count of inodes allocated.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

root<\/b><\/p>\n<\/td>\n

<\/td>\n\n

block number of the root of the Btree holding inode allocation information.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

level<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of levels in the inode allocation Btree.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

freecount<\/b><\/p>\n<\/td>\n

<\/td>\n\n

count of allocated inodes that are not in use.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

newino<\/b><\/p>\n<\/td>\n

<\/td>\n\n

last inode number allocated.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

dirino<\/b><\/p>\n<\/td>\n

<\/td>\n\n

unused.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

unlinked<\/b><\/p>\n<\/td>\n

<\/td>\n\n

an array of inode numbers within the allocation group. The entries in the AGI block are the heads of lists which run through the inode next_unlinked<\/b> field. These inodes are to be unlinked the next time the filesystem is mounted.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

attr<\/b><\/p>\n<\/td>\n

<\/td>\n <\/td>\n<\/tr>\n<\/table>\n

An attribute fork is organized as a Btree with the actual data embedded in the leaf blocks. The root of the Btree is found in block 0 of the fork. The index (sort order) of the Btree is the hash value of the attribute name. All the blocks contain a blkinfo<\/b> structure at the beginning, see type dir<\/b> for a description. Nonleaf blocks are identical in format to those for version 1 and version 2 directories, see type dir<\/b> for a description. Leaf blocks can refer to “local” or “remote” attribute values. Local values are stored directly in the leaf block. Leaf blocks contain the following fields:<\/p>\n\n\n\n\n
<\/td>\n\n

hdr<\/b><\/p>\n<\/td>\n

<\/td>\n\n

header containing a blkinfo<\/b> structure info<\/b> (magic number 0xfbee), a count<\/b> of active entries, usedbytes<\/b> total bytes of names and values, the firstused<\/b> byte in the name area, holes<\/b> set if the block needs compaction, and array freemap<\/b> as for dir<\/b> leaf blocks.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

entries<\/b><\/p>\n<\/td>\n

<\/td>\n\n

array of structures containing a hashval<\/b>, nameidx<\/b> (index into the block of the name), and flags incomplete<\/b>, root<\/b>, and local<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

nvlist<\/b><\/p>\n<\/td>\n

<\/td>\n\n

array of structures describing the attribute names and values. Fields always present: valuelen<\/b> (length of value in bytes), namelen<\/b>, and name<\/b>. Fields present for local values: value<\/b> (value string). Fields present for remote values: valueblk<\/b> (fork block number of containing the value).<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

Remote values are stored in an independent block in the attribute fork. Prior to v5, value blocks had no structure, but in v5 they acquired a header structure with the following fields:<\/p>\n\n\n\n\n\n\n\n\n\n\n\n
<\/td>\n\n

magic<\/b><\/p>\n<\/td>\n

<\/td>\n\n

attr3 remote block magic number, 0x5841524d (\u2019XARM\u2019).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

offset<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Byte offset of this data block within the overall attribute value.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

bytes<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Number of bytes stored in this block.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

crc<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Checksum of the attribute block contents.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

uuid<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Filesystem UUID.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

owner<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Inode that owns this attribute value.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

bno<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Block offset of this block within the inode\u2019s attribute fork.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

lsn<\/b><\/p>\n<\/td>\n

<\/td>\n\n

Log serial number of the last time this block was logged.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

data<\/b><\/p>\n<\/td>\n

<\/td>\n\n

The attribute value data.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

bmapbt<\/b><\/p>\n<\/td>\n

<\/td>\n <\/td>\n<\/tr>\n<\/table>\n

Files with many extents in their data or attribute fork will have the extents described by the contents of a Btree for that fork, instead of being stored directly in the inode. Each bmap Btree starts with a root block contained within the inode. The other levels of the Btree are stored in filesystem blocks. The blocks are linked to sibling left and right blocks at each level, as well as by pointers from parent to child blocks. Each block contains the following fields:<\/p>\n\n\n\n\n\n\n\n\n\n\n
<\/td>\n\n

magic<\/b><\/p>\n<\/td>\n

<\/td>\n\n

bmap Btree block magic number, 0x424d4150 (\u2019BMAP\u2019).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

level<\/b><\/p>\n<\/td>\n

<\/td>\n\n

level of this block above the leaf level.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

numrecs<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of records or keys in the block.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

leftsib<\/b><\/p>\n<\/td>\n

<\/td>\n\n

left (logically lower) sibling block, 0 if none.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

rightsib<\/b><\/p>\n<\/td>\n

<\/td>\n\n

right (logically higher) sibling block, 0 if none.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

recs<\/b><\/p>\n<\/td>\n

<\/td>\n\n

[leaf blocks only] array of extent records. Each record contains startoff<\/b>, startblock<\/b>, blockcount<\/b>, and extentflag<\/b> (1 if the extent is unwritten).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

keys<\/b><\/p>\n<\/td>\n

<\/td>\n\n

[non-leaf blocks only] array of key records. These are the first key value of each block in the level below this one. Each record contains startoff<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

ptrs<\/b><\/p>\n<\/td>\n

<\/td>\n\n

[non-leaf blocks only] array of child block pointers. Each pointer is a filesystem block number to the next level in the Btree.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

bnobt<\/b><\/p>\n<\/td>\n

<\/td>\n <\/td>\n<\/tr>\n<\/table>\n

There is one set of filesystem blocks forming the by-block-number allocation Btree for each allocation group. The root block of this Btree is designated by the bnoroot<\/b> field in the corresponding AGF block. The blocks are linked to sibling left and right blocks at each level, as well as by pointers from parent to child blocks. Each block has the following fields:<\/p>\n\n\n\n\n\n\n\n\n\n\n
<\/td>\n\n

magic<\/b><\/p>\n<\/td>\n

<\/td>\n\n

BNOBT block magic number, 0x41425442 (\u2019ABTB\u2019).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

level<\/b><\/p>\n<\/td>\n

<\/td>\n\n

level number of this block, 0 is a leaf.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

numrecs<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of data entries in the block.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

leftsib<\/b><\/p>\n<\/td>\n

<\/td>\n\n

left (logically lower) sibling block, 0 if none.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

rightsib<\/b><\/p>\n<\/td>\n

<\/td>\n\n

right (logically higher) sibling block, 0 if none.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

recs<\/b><\/p>\n<\/td>\n

<\/td>\n\n

[leaf blocks only] array of freespace records. Each record contains startblock<\/b> and blockcount<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

keys<\/b><\/p>\n<\/td>\n

<\/td>\n\n

[non-leaf blocks only] array of key records. These are the first value of each block in the level below this one. Each record contains startblock<\/b> and blockcount<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

ptrs<\/b><\/p>\n<\/td>\n

<\/td>\n\n

[non-leaf blocks only] array of child block pointers. Each pointer is a block number within the allocation group to the next level in the Btree.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

cntbt<\/b><\/p>\n<\/td>\n

<\/td>\n <\/td>\n<\/tr>\n<\/table>\n

There is one set of filesystem blocks forming the by-block-count allocation Btree for each allocation group. The root block of this Btree is designated by the cntroot<\/b> field in the corresponding AGF block. The blocks are linked to sibling left and right blocks at each level, as well as by pointers from parent to child blocks. Each block has the following fields:<\/p>\n\n\n\n\n\n\n\n\n\n\n
<\/td>\n\n

magic<\/b><\/p>\n<\/td>\n

<\/td>\n\n

CNTBT block magic number, 0x41425443 (\u2019ABTC\u2019).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

level<\/b><\/p>\n<\/td>\n

<\/td>\n\n

level number of this block, 0 is a leaf.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

numrecs<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of data entries in the block.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

leftsib<\/b><\/p>\n<\/td>\n

<\/td>\n\n

left (logically lower) sibling block, 0 if none.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

rightsib<\/b><\/p>\n<\/td>\n

<\/td>\n\n

right (logically higher) sibling block, 0 if none.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

recs<\/b><\/p>\n<\/td>\n

<\/td>\n\n

[leaf blocks only] array of freespace records. Each record contains startblock<\/b> and blockcount<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

keys<\/b><\/p>\n<\/td>\n

<\/td>\n\n

[non-leaf blocks only] array of key records. These are the first value of each block in the level below this one. Each record contains blockcount<\/b> and startblock<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

ptrs<\/b><\/p>\n<\/td>\n

<\/td>\n\n

[non-leaf blocks only] array of child block pointers. Each pointer is a block number within the allocation group to the next level in the Btree.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

data<\/b><\/p>\n<\/td>\n

<\/td>\n <\/td>\n<\/tr>\n<\/table>\n

User file blocks, and other blocks whose type is unknown, have this type for display purposes in xfs_db<\/b>. The block data is displayed in hexadecimal format.<\/p>\n\n\n
<\/td>\n\n

dir<\/b><\/p>\n<\/td>\n

<\/td>\n\n

A version 1 directory is organized as a Btree with the directory data embedded in the leaf blocks. The root of the Btree is found in block 0 of the file. The index (sort order) of the Btree is the hash value of the entry name. All the blocks contain a blkinfo<\/b> structure at the beginning with the following fields:<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

forw<\/b><\/p>\n\n\n\n\n
<\/td>\n<\/td>\n<\/td>\n\n

next sibling block.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

back<\/b><\/p>\n<\/td>\n

<\/td>\n\n

previous sibling block.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

magic<\/b><\/p>\n<\/td>\n

<\/td>\n\n

magic number for this block type.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

The non-leaf (node) blocks have the following fields:<\/p>\n\n\n\n
<\/td>\n\n

hdr<\/b><\/p>\n<\/td>\n

<\/td>\n\n

header containing a blkinfo<\/b> structure info<\/b> (magic number 0xfebe), the count<\/b> of active entries, and the level<\/b> of this block above the leaves.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

btree<\/b><\/p>\n<\/td>\n

<\/td>\n\n

array of entries containing hashval<\/b> and before<\/b> fields. The before<\/b> value is a block number within the directory file to the child block, the hashval<\/b> is the last hash value in that block.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

The leaf blocks have the following fields:<\/p>\n\n\n\n\n\n
<\/td>\n\n

hdr<\/b><\/p>\n<\/td>\n

<\/td>\n\n

header containing a blkinfo<\/b> structure info<\/b> (magic number 0xfeeb), the count<\/b> of active entries, namebytes<\/b> (total name string bytes), holes<\/b> flag (block needs compaction), and freemap<\/b> (array of base<\/b>, size<\/b> entries for free regions).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

entries<\/b><\/p>\n<\/td>\n

<\/td>\n\n

array of structures containing hashval<\/b>, nameidx<\/b> (byte index into the block of the name string), and namelen<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

namelist<\/b><\/p>\n<\/td>\n

<\/td>\n\n

array of structures containing inumber<\/b> and name<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

dir2<\/b><\/p>\n<\/td>\n

<\/td>\n <\/td>\n<\/tr>\n<\/table>\n

A version 2 directory has four kinds of blocks. Data blocks start at offset 0 in the file. There are two kinds of data blocks: single-block directories have the leaf information embedded at the end of the block, data blocks in multi-block directories do not. Node and leaf blocks start at offset 32GiB (with either a single leaf block or the root node block). Freespace blocks start at offset 64GiB. The node and leaf blocks form a Btree, with references to the data in the data blocks. The freespace blocks form an index of longest free spaces within the data blocks.<\/p>\n

A single-block directory block contains the following fields:<\/p>\n\n\n\n\n\n
<\/td>\n\n

bhdr<\/b><\/p>\n<\/td>\n

<\/td>\n\n

header containing magic<\/b> number 0x58443242 (\u2019XD2B\u2019) and an array bestfree<\/b> of the longest 3 free spaces in the block (offset<\/b>, length<\/b>).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

bu<\/b><\/p>\n<\/td>\n

<\/td>\n\n

array of union structures. Each element is either an entry or a freespace. For entries, there are the following fields: inumber<\/b>, namelen<\/b>, name<\/b>, and tag<\/b>. For freespace, there are the following fields: freetag<\/b> (0xffff), length<\/b>, and tag<\/b>. The tag<\/b> value is the byte offset in the block of the start of the entry it is contained in.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

bleaf<\/b><\/p>\n<\/td>\n

<\/td>\n\n

array of leaf entries containing hashval<\/b> and address<\/b>. The address<\/b> is a 64-bit word offset into the file.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

btail<\/b><\/p>\n<\/td>\n

<\/td>\n\n

tail structure containing the total count<\/b> of leaf entries and stale<\/b> count of unused leaf entries.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

A data block contains the following fields:<\/p>\n\n\n\n
<\/td>\n\n

dhdr<\/b><\/p>\n<\/td>\n

<\/td>\n\n

header containing magic<\/b> number 0x58443244 (\u2019XD2D\u2019) and an array bestfree<\/b> of the longest 3 free spaces in the block (offset<\/b>, length<\/b>).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

du<\/b><\/p>\n<\/td>\n

<\/td>\n\n

array of union structures as for bu<\/b>.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

Leaf blocks have two possible forms. If the Btree consists of a single leaf then the freespace information is in the leaf block, otherwise it is in separate blocks and the root of the Btree is a node block. A leaf block contains the following fields:<\/p>\n\n\n\n\n\n
<\/td>\n\n

lhdr<\/b><\/p>\n<\/td>\n

<\/td>\n\n

header containing a blkinfo<\/b> structure info<\/b> (magic number 0xd2f1 for the single leaf case, 0xd2ff for the true Btree case), the total count<\/b> of leaf entries, and stale<\/b> count of unused leaf entries.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

lents<\/b><\/p>\n<\/td>\n

<\/td>\n\n

leaf entries, as for bleaf<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

lbests<\/b><\/p>\n<\/td>\n

<\/td>\n\n

[single leaf only] array of values which represent the longest freespace in each data block in the directory.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

ltail<\/b><\/p>\n<\/td>\n

<\/td>\n\n

[single leaf only] tail structure containing bestcount<\/b> count of lbests<\/b>.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

A node block is identical to that for types attr<\/b> and dir<\/b>.<\/p>\n

A freespace block contains the following fields:<\/p>\n\n\n\n\n
<\/td>\n\n

fhdr<\/b><\/p>\n<\/td>\n

<\/td>\n\n

header containing magic<\/b> number 0x58443246 (\u2019XD2F\u2019), firstdb<\/b> first data block number covered by this freespace block, nvalid<\/b> number of valid entries, and nused<\/b> number of entries representing real data blocks.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

fbests<\/b><\/p>\n<\/td>\n

<\/td>\n\n

array of values as for lbests<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

dqblk<\/b><\/p>\n<\/td>\n

<\/td>\n <\/td>\n<\/tr>\n<\/table>\n

The quota information is stored in files referred to by the superblock uquotino<\/b> and pquotino<\/b> fields. Each filesystem block in a quota file contains a constant number of quota entries. The quota entry size is currently 136 bytes, so with a 4KiB filesystem block size there are 30 quota entries per block. The dquot<\/b> command is used to locate these entries in the filesystem. The file entries are indexed by the user or project identifier to determine the block and offset. Each quota entry has the following fields:<\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
<\/td>\n\n

magic<\/b><\/p>\n<\/td>\n

<\/td>\n\n

magic number, 0x4451 (\u2019DQ\u2019).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

version<\/b><\/p>\n<\/td>\n

<\/td>\n\n

version number, currently 1.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

flags<\/b><\/p>\n<\/td>\n

<\/td>\n\n

flags, values include 0x01 for user quota, 0x02 for project quota.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

id<\/b><\/p>\n<\/td>\n

<\/td>\n\n

user or project identifier.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

blk_hardlimit<\/b><\/p>\n<\/td>\n

<\/td>\n\n

absolute limit on blocks in use.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

blk_softlimit<\/b><\/p>\n<\/td>\n

<\/td>\n\n

preferred limit on blocks in use.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

ino_hardlimit<\/b><\/p>\n<\/td>\n

<\/td>\n\n

absolute limit on inodes in use.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

ino_softlimit<\/b><\/p>\n<\/td>\n

<\/td>\n\n

preferred limit on inodes in use.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

bcount<\/b><\/p>\n<\/td>\n

<\/td>\n\n

blocks actually in use.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

icount<\/b><\/p>\n<\/td>\n

<\/td>\n\n

inodes actually in use.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

itimer<\/b><\/p>\n<\/td>\n

<\/td>\n\n

time when service will be refused if soft limit is violated for inodes.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

btimer<\/b><\/p>\n<\/td>\n

<\/td>\n\n

time when service will be refused if soft limit is violated for blocks.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

iwarns<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of warnings issued about inode limit violations.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

bwarns<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of warnings issued about block limit violations.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

rtb_hardlimit<\/b><\/p>\n<\/td>\n

<\/td>\n\n

absolute limit on realtime blocks in use.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

rtb_softlimit<\/b><\/p>\n<\/td>\n

<\/td>\n\n

preferred limit on realtime blocks in use.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

rtbcount<\/b><\/p>\n<\/td>\n

<\/td>\n\n

realtime blocks actually in use.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

rtbtimer<\/b><\/p>\n<\/td>\n

<\/td>\n\n

time when service will be refused if soft limit is violated for realtime blocks.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

rtbwarns<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of warnings issued about realtime block limit violations.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

inobt<\/b><\/p>\n<\/td>\n

<\/td>\n <\/td>\n<\/tr>\n<\/table>\n

There is one set of filesystem blocks forming the inode allocation Btree for each allocation group. The root block of this Btree is designated by the root<\/b> field in the corresponding AGI block. The blocks are linked to sibling left and right blocks at each level, as well as by pointers from parent to child blocks. Each block has the following fields:<\/p>\n\n\n\n\n\n\n\n\n\n\n
<\/td>\n\n

magic<\/b><\/p>\n<\/td>\n

<\/td>\n\n

INOBT block magic number, 0x49414254 (\u2019IABT\u2019).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

level<\/b><\/p>\n<\/td>\n

<\/td>\n\n

level number of this block, 0 is a leaf.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

numrecs<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of data entries in the block.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

leftsib<\/b><\/p>\n<\/td>\n

<\/td>\n\n

left (logically lower) sibling block, 0 if none.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

rightsib<\/b><\/p>\n<\/td>\n

<\/td>\n\n

right (logically higher) sibling block, 0 if none.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

recs<\/b><\/p>\n<\/td>\n

<\/td>\n\n

[leaf blocks only] array of inode records. Each record contains startino<\/b> allocation-group relative inode number, freecount<\/b> count of free inodes in this chunk, and free<\/b> bitmap, LSB corresponds to inode 0.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

keys<\/b><\/p>\n<\/td>\n

<\/td>\n\n

[non-leaf blocks only] array of key records. These are the first value of each block in the level below this one. Each record contains startino<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

ptrs<\/b><\/p>\n<\/td>\n

<\/td>\n\n

[non-leaf blocks only] array of child block pointers. Each pointer is a block number within the allocation group to the next level in the Btree.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

inode<\/b><\/p>\n<\/td>\n

<\/td>\n <\/td>\n<\/tr>\n<\/table>\n

Inodes are allocated in “chunks” of 64 inodes each. Usually a chunk is multiple filesystem blocks, although there are cases with large filesystem blocks where a chunk is less than one block. The inode Btree (see inobt<\/b> above) refers to the inode numbers per allocation group. The inode numbers directly reflect the location of the inode block on disk. Use the inode<\/b> command to point xfs_db<\/b> to a specific inode. Each inode contains four regions: core<\/b>, next_unlinked<\/b>, u<\/b>, and a<\/b>. core<\/b> contains the fixed information. next_unlinked<\/b> is separated from the core due to journaling considerations, see type agi<\/b> field unlinked<\/b>. u<\/b> is a union structure that is different in size and format depending on the type and representation of the file data (“data fork”). a<\/b> is an optional union structure to describe attribute data, that is different in size, format, and location depending on the presence and representation of attribute data, and the size of the u<\/b> data (“attribute fork”). xfs_db<\/b> automatically selects the proper union members based on information in the inode.<\/p>\n

The following are fields in the inode core:<\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
<\/td>\n\n

magic<\/b><\/p>\n<\/td>\n

<\/td>\n\n

inode magic number, 0x494e (\u2019IN\u2019).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

mode<\/b><\/p>\n<\/td>\n

<\/td>\n\n

mode and type of file, as described in chmod<\/b>(2), mknod<\/b>(2), and stat<\/b>(2).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

version<\/b><\/p>\n<\/td>\n

<\/td>\n\n

inode version, 1 or 2.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

format<\/b><\/p>\n<\/td>\n

<\/td>\n\n

format of u<\/b> union data (0: xfs_dev_t, 1: local file \u2212 in-inode directory or symlink, 2: extent list, 3: Btree root, 4: unique id [unused]).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

nlinkv1<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of links to the file in a version 1 inode.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

nlinkv2<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of links to the file in a version 2 inode.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

projid_lo<\/b><\/p>\n<\/td>\n

<\/td>\n\n

owner\u2019s project id (low word; version 2 inode only). projid_hi<\/b> owner\u2019s project id (high word; version 2 inode only).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

uid<\/b><\/p>\n<\/td>\n

<\/td>\n\n

owner\u2019s user id.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

gid<\/b><\/p>\n<\/td>\n

<\/td>\n\n

owner\u2019s group id.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

atime<\/b><\/p>\n<\/td>\n

<\/td>\n\n

time last accessed (seconds and nanoseconds).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

mtime<\/b><\/p>\n<\/td>\n

<\/td>\n\n

time last modified.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

ctime<\/b><\/p>\n<\/td>\n

<\/td>\n\n

time created or inode last modified.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

size<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of bytes in the file.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

nblocks<\/b><\/p>\n<\/td>\n

<\/td>\n\n

total number of blocks in the file including indirect and attribute.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

extsize<\/b><\/p>\n<\/td>\n

<\/td>\n\n

basic\/minimum extent size for the file.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

nextents<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of extents in the data fork.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

naextents<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of extents in the attribute fork.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

forkoff<\/b><\/p>\n<\/td>\n

<\/td>\n\n

attribute fork offset in the inode, in 64-bit words from the start of u<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

aformat<\/b><\/p>\n<\/td>\n

<\/td>\n\n

format of a<\/b> data (1: local attribute data, 2: extent list, 3: Btree root).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

dmevmask<\/b><\/p>\n<\/td>\n

<\/td>\n\n

DMAPI event mask.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

dmstate<\/b><\/p>\n<\/td>\n

<\/td>\n\n

DMAPI state information.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

newrtbm<\/b><\/p>\n<\/td>\n

<\/td>\n\n

file is the realtime bitmap and is “new” format.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

prealloc<\/b><\/p>\n<\/td>\n

<\/td>\n\n

file has preallocated data space after EOF.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

realtime<\/b><\/p>\n<\/td>\n

<\/td>\n\n

file data is in the realtime subvolume.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

gen<\/b><\/p>\n<\/td>\n

<\/td>\n\n

inode generation number.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

The following fields are in the u<\/b> data fork union:<\/p>\n\n\n\n\n\n\n\n
<\/td>\n\n

bmbt<\/b><\/p>\n<\/td>\n

<\/td>\n\n

bmap Btree root. This looks like a bmapbtd<\/b> block with redundant information removed.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

bmx<\/b><\/p>\n<\/td>\n

<\/td>\n\n

array of extent descriptors.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

dev<\/b><\/p>\n<\/td>\n

<\/td>\n\n

dev_t for the block or character device.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

sfdir<\/b><\/p>\n<\/td>\n

<\/td>\n\n

shortform (in-inode) version 1 directory. This consists of a hdr<\/b> containing the parent<\/b> inode number and a count<\/b> of active entries in the directory, followed by an array list<\/b> of hdr.count<\/b> entries. Each such entry contains inumber<\/b>, namelen<\/b>, and name<\/b> string.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

sfdir2<\/b><\/p>\n<\/td>\n

<\/td>\n\n

shortform (in-inode) version 2 directory. This consists of a hdr<\/b> containing a count<\/b> of active entries in the directory, an i8count<\/b> of entries with inumbers that don\u2019t fit in a 32-bit value, and the parent<\/b> inode number, followed by an array list<\/b> of hdr.count<\/b> entries. Each such entry contains namelen<\/b>, a saved offset<\/b> used when the directory is converted to a larger form, a name<\/b> string, and the inumber<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

symlink<\/b><\/p>\n<\/td>\n

<\/td>\n\n

symbolic link string value.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

The following fields are in the a<\/b> attribute fork union if it exists:<\/p>\n\n\n\n\n\n
<\/td>\n\n

bmbt<\/b><\/p>\n<\/td>\n

<\/td>\n\n

bmap Btree root, as above.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

bmx<\/b><\/p>\n<\/td>\n

<\/td>\n\n

array of extent descriptors.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

sfattr<\/b><\/p>\n<\/td>\n

<\/td>\n\n

shortform (in-inode) attribute values. This consists of a hdr<\/b> containing a totsize<\/b> (total size in bytes) and a count<\/b> of active entries, followed by an array list<\/b> of hdr.count<\/b> entries. Each such entry contains namelen<\/b>, valuelen<\/b>, root<\/b> flag, name<\/b>, and value<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

log<\/b><\/p>\n<\/td>\n

<\/td>\n <\/td>\n<\/tr>\n<\/table>\n

Log blocks contain the journal entries for XFS. It\u2019s not useful to examine these with xfs_db<\/b>, use xfs_logprint<\/b>(8) instead.<\/p>\n\n\n
<\/td>\n\n

refcntbt<\/b><\/p>\n<\/td>\n

<\/td>\n\n

There is one set of filesystem blocks forming the reference count Btree for each allocation group. The root block of this Btree is designated by the refcntroot<\/b> field in the corresponding AGF block. The blocks are linked to sibling left and right blocks at each level, as well as by pointers from parent to child blocks. Each block has the following fields:<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

magic<\/b><\/p>\n\n\n\n\n\n\n\n\n\n\n
<\/td>\n<\/td>\n<\/td>\n\n

REFC block magic number, 0x52334643 (\u2019R3FC\u2019).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

level<\/b><\/p>\n<\/td>\n

<\/td>\n\n

level number of this block, 0 is a leaf.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

numrecs<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of data entries in the block.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

leftsib<\/b><\/p>\n<\/td>\n

<\/td>\n\n

left (logically lower) sibling block, 0 if none.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

rightsib<\/b><\/p>\n<\/td>\n

<\/td>\n\n

right (logically higher) sibling block, 0 if none.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

recs<\/b><\/p>\n<\/td>\n

<\/td>\n\n

[leaf blocks only] array of reference count records. Each record contains startblock<\/b>, blockcount<\/b>, and refcount<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

keys<\/b><\/p>\n<\/td>\n

<\/td>\n\n

[non-leaf blocks only] array of key records. These are the first value of each block in the level below this one. Each record contains startblock<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

ptrs<\/b><\/p>\n<\/td>\n

<\/td>\n\n

[non-leaf blocks only] array of child block pointers. Each pointer is a block number within the allocation group to the next level in the Btree.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

rmapbt<\/b><\/p>\n<\/td>\n

<\/td>\n <\/td>\n<\/tr>\n<\/table>\n

There is one set of filesystem blocks forming the reverse mapping Btree for each allocation group. The root block of this Btree is designated by the rmaproot<\/b> field in the corresponding AGF block. The blocks are linked to sibling left and right blocks at each level, as well as by pointers from parent to child blocks. Each block has the following fields:<\/p>\n\n\n\n\n\n\n\n\n\n\n
<\/td>\n\n

magic<\/b><\/p>\n<\/td>\n

<\/td>\n\n

RMAP block magic number, 0x524d4233 (\u2019RMB3\u2019).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

level<\/b><\/p>\n<\/td>\n

<\/td>\n\n

level number of this block, 0 is a leaf.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

numrecs<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of data entries in the block.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

leftsib<\/b><\/p>\n<\/td>\n

<\/td>\n\n

left (logically lower) sibling block, 0 if none.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

rightsib<\/b><\/p>\n<\/td>\n

<\/td>\n\n

right (logically higher) sibling block, 0 if none.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

recs<\/b><\/p>\n<\/td>\n

<\/td>\n\n

[leaf blocks only] array of reference count records. Each record contains startblock<\/b>, blockcount<\/b>, owner<\/b>, offset<\/b>, attr_fork<\/b>, bmbt_block<\/b>, and unwritten<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

keys<\/b><\/p>\n<\/td>\n

<\/td>\n\n

[non-leaf blocks only] array of double-key records. The first (“low”) key contains the first value of each block in the level below this one. The second (“high”) key contains the largest key that can be used to identify any record in the subtree. Each record contains startblock<\/b>, owner<\/b>, offset<\/b>, attr_fork<\/b>, and bmbt_block<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

ptrs<\/b><\/p>\n<\/td>\n

<\/td>\n\n

[non-leaf blocks only] array of child block pointers. Each pointer is a block number within the allocation group to the next level in the Btree.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

rtbitmap<\/b><\/p>\n<\/td>\n

<\/td>\n <\/td>\n<\/tr>\n<\/table>\n

If the filesystem has a realtime subvolume, then the rbmino<\/b> field in the superblock refers to a file that contains the realtime bitmap. Each bit in the bitmap file controls the allocation of a single realtime extent (set == free). The bitmap is processed in 32-bit words, the LSB of a word is used for the first extent controlled by that bitmap word. The atime<\/b> field of the realtime bitmap inode contains a counter that is used to control where the next new realtime file will start.<\/p>\n\n\n\n
<\/td>\n\n

rtsummary<\/b><\/p>\n<\/td>\n

<\/td>\n\n

If the filesystem has a realtime subvolume, then the rsumino<\/b> field in the superblock refers to a file that contains the realtime summary data. The summary file contains a two-dimensional array of 16-bit values. Each value counts the number of free extent runs (consecutive free realtime extents) of a given range of sizes that starts in a given bitmap block. The size ranges are binary buckets (low size in the bucket is a power of 2). There are as many size ranges as are necessary given the size of the realtime subvolume. The first dimension is the size range, the second dimension is the starting bitmap block number (adjacent entries are for the same size, adjacent bitmap blocks).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

sb<\/b><\/p>\n<\/td>\n

<\/td>\n\n

There is one sb (superblock) structure per allocation group. It is the first disk block in the allocation group. Only the first one (block 0 of the filesystem) is actually used; the other blocks are redundant information for xfs_repair<\/b>(8) to use if the first superblock is damaged. Fields defined:<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

magicnum<\/b><\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
<\/td>\n<\/td>\n<\/td>\n\n

superblock magic number, 0x58465342 (\u2019XFSB\u2019).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

blocksize<\/b><\/p>\n<\/td>\n

<\/td>\n\n

filesystem block size in bytes.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

dblocks<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of filesystem blocks present in the data subvolume.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

rblocks<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of filesystem blocks present in the realtime subvolume.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

rextents<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of realtime extents that rblocks<\/b> contain.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

uuid<\/b><\/p>\n<\/td>\n

<\/td>\n\n

unique identifier of the filesystem.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

logstart<\/b><\/p>\n<\/td>\n

<\/td>\n\n

starting filesystem block number of the log (journal). If this value is 0 the log is “external”.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

rootino<\/b><\/p>\n<\/td>\n

<\/td>\n\n

root inode number.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

rbmino<\/b><\/p>\n<\/td>\n

<\/td>\n\n

realtime bitmap inode number.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

rsumino<\/b><\/p>\n<\/td>\n

<\/td>\n\n

realtime summary data inode number.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

rextsize<\/b><\/p>\n<\/td>\n

<\/td>\n\n

realtime extent size in filesystem blocks.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

agblocks<\/b><\/p>\n<\/td>\n

<\/td>\n\n

size of an allocation group in filesystem blocks.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

agcount<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of allocation groups.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

rbmblocks<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of realtime bitmap blocks.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

logblocks<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of log blocks (filesystem blocks).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

versionnum<\/b><\/p>\n<\/td>\n

<\/td>\n\n

filesystem version information. This value is currently 1, 2, 3, or 4 in the low 4 bits. If the low bits are 4 then the other bits have additional meanings. 1 is the original value. 2 means that attributes were used. 3 means that version 2 inodes (large link counts) were used. 4 is the bitmask version of the version number. In this case, the other bits are used as flags (0x0010: attributes were used, 0x0020: version 2 inodes were used, 0x0040: quotas were used, 0x0080: inode cluster alignment is in force, 0x0100: data stripe alignment is in force, 0x0200: the shared_vn<\/b> field is used, 0x1000: unwritten extent tracking is on, 0x2000: version 2 directories are in use).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

sectsize<\/b><\/p>\n<\/td>\n

<\/td>\n\n

sector size in bytes, currently always 512. This is the size of the superblock and the other header blocks.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

inodesize<\/b><\/p>\n<\/td>\n

<\/td>\n\n

inode size in bytes.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

inopblock<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of inodes per filesystem block.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

fname<\/b><\/p>\n<\/td>\n

<\/td>\n\n

obsolete, filesystem name.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

fpack<\/b><\/p>\n<\/td>\n

<\/td>\n\n

obsolete, filesystem pack name.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

blocklog<\/b><\/p>\n<\/td>\n

<\/td>\n\n

log2 of blocksize<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

sectlog<\/b><\/p>\n<\/td>\n

<\/td>\n\n

log2 of sectsize<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

inodelog<\/b><\/p>\n<\/td>\n

<\/td>\n\n

log2 of inodesize<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

inopblog<\/b><\/p>\n<\/td>\n

<\/td>\n\n

log2 of inopblock<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

agblklog<\/b><\/p>\n<\/td>\n

<\/td>\n\n

log2 of agblocks<\/b> (rounded up).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

rextslog<\/b><\/p>\n<\/td>\n

<\/td>\n\n

log2 of rextents<\/b>.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

inprogress<\/b><\/p>\n<\/td>\n

<\/td>\n\n

mkfs.xfs<\/b>(8) or xfs_copy<\/b>(8) aborted before completing this filesystem.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

imax_pct<\/b><\/p>\n<\/td>\n

<\/td>\n\n

maximum percentage of filesystem space used for inode blocks.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

icount<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of allocated inodes.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

ifree<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of allocated inodes that are not in use.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

fdblocks<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of free data blocks.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

frextents<\/b><\/p>\n<\/td>\n

<\/td>\n\n

number of free realtime extents.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

uquotino<\/b><\/p>\n<\/td>\n

<\/td>\n\n

user quota inode number.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

pquotino<\/b><\/p>\n<\/td>\n

<\/td>\n\n

project quota inode number; this is currently unused.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

qflags<\/b><\/p>\n<\/td>\n

<\/td>\n\n

quota status flags (0x01: user quota accounting is on, 0x02: user quota limits are enforced, 0x04: quotacheck has been run on user quotas, 0x08: project quota accounting is on, 0x10: project quota limits are enforced, 0x20: quotacheck has been run on project quotas).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

flags<\/b><\/p>\n<\/td>\n

<\/td>\n\n

random flags. 0x01: only read-only mounts are allowed.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

shared_vn<\/b><\/p>\n<\/td>\n

<\/td>\n\n

shared version number (shared readonly filesystems).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

inoalignmt<\/b><\/p>\n<\/td>\n

<\/td>\n\n

inode chunk alignment in filesystem blocks.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

unit<\/b><\/p>\n<\/td>\n

<\/td>\n\n

stripe or RAID unit.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

width<\/b><\/p>\n<\/td>\n

<\/td>\n\n

stripe or RAID width.<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

dirblklog<\/b><\/p>\n<\/td>\n

<\/td>\n\n

log2 of directory block size (filesystem blocks).<\/p>\n<\/td>\n<\/tr>\n

<\/td>\n\n

symlink<\/b><\/p>\n<\/td>\n

<\/td>\n <\/td>\n<\/tr>\n<\/table>\n

Symbolic link blocks are used only when the symbolic link value does not fit inside the inode. The block content is just the string value. Bytes past the logical end of the symbolic link value have arbitrary values.<\/p>\n\n\n
<\/td>\n\n

text<\/b><\/p>\n<\/td>\n

<\/td>\n\n

User file blocks, and other blocks whose type is unknown, have this type for display purposes in xfs_db<\/b>. The block data is displayed in two columns: Hexadecimal format and printable ASCII chars.<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

DIAGNOSTICS <\/a> <\/h2>\n

Many messages can come from the check<\/b> (blockget<\/b>) command. If the filesystem is completely corrupt, a core dump might be produced instead of the message<\/p>\n

device<\/i> is not a valid filesystem<\/b><\/p>\n

If the filesystem is very large (has many files) then check<\/b> might run out of memory. In this case the message<\/p>\n

out of memory<\/b><\/p>\n

is printed.<\/p>\n

The following is a description of the most likely problems and the associated messages. Most of the diagnostics produced are only meaningful with an understanding of the structure of the filesystem.
agf_freeblks<\/b> n<\/i>, counted<\/b> m<\/i> in ag<\/b> a<\/i><\/p>\n

The freeblocks count in the allocation group header for allocation group a<\/i> doesn\u2019t match the number of blocks counted free.<\/p>\n

agf_longest<\/b> n<\/i>, counted<\/b> m<\/i> in ag<\/b> a<\/i><\/p>\n

The longest free extent in the allocation group header for allocation group a<\/i> doesn\u2019t match the longest free extent found in the allocation group.<\/p>\n

agi_count<\/b> n<\/i>, counted<\/b> m<\/i> in ag<\/b> a<\/i><\/p>\n

The allocated inode count in the allocation group header for allocation group a<\/i> doesn\u2019t match the number of inodes counted in the allocation group.<\/p>\n

agi_freecount<\/b> n<\/i>, counted<\/b> m<\/i> in ag<\/b> a<\/i><\/p>\n

The free inode count in the allocation group header for allocation group a<\/i> doesn\u2019t match the number of inodes counted free in the allocation group.<\/p>\n

block<\/b> a\/b<\/i> expected inum 0 got<\/b> i<\/i><\/p>\n

The block number is specified as a pair (allocation group number, block in the allocation group). The block is used multiple times (shared), between multiple inodes. This message usually follows a message of the next type.<\/p>\n

block<\/b> a\/b<\/i> expected type unknown got<\/b> y<\/i><\/p>\n

The block is used multiple times (shared).<\/p>\n

block<\/b> a\/b<\/i> type unknown not expected<\/b><\/p>\n

SEE ALSO <\/a> <\/h2>\n

mkfs.xfs<\/b>(8), xfs_admin<\/b>(8), xfs_copy<\/b>(8), xfs_logprint<\/b>(8), xfs_metadump<\/b>(8), xfs_ncheck<\/b>(8), xfs_repair<\/b>(8), mount<\/b>(8), chmod<\/b>(2), mknod<\/b>(2), stat<\/b>(2), xfs<\/b>(5).<\/p>\n

\n","protected":false},"excerpt":{"rendered":"

xfs_db \u2212 debug an XFS filesystem <\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[2],"tags":[5,52,4,58],"class_list":["post-2704","post","type-post","status-publish","format-standard","hentry","category-8-administracion-del-sistema","tag-5","tag-administracion","tag-man8","tag-xfs_db"],"gutentor_comment":0,"_links":{"self":[{"href":"https:\/\/lode.uno\/linux-man\/wp-json\/wp\/v2\/posts\/2704","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/lode.uno\/linux-man\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/lode.uno\/linux-man\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/lode.uno\/linux-man\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/lode.uno\/linux-man\/wp-json\/wp\/v2\/comments?post=2704"}],"version-history":[{"count":0,"href":"https:\/\/lode.uno\/linux-man\/wp-json\/wp\/v2\/posts\/2704\/revisions"}],"wp:attachment":[{"href":"https:\/\/lode.uno\/linux-man\/wp-json\/wp\/v2\/media?parent=2704"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/lode.uno\/linux-man\/wp-json\/wp\/v2\/categories?post=2704"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/lode.uno\/linux-man\/wp-json\/wp\/v2\/tags?post=2704"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}