xfsprogs: remove unused functions

[thirdparty/xfsprogs-dev.git] / repair / README

diff --git a/repair/README b/repair/README
index e912f710846d45aec86c5e0521441cfb77d690a5..f3c7be6aa9e996cf42d4afc4f966222171c65d98 100644 (file)
--- a/repair/README
+++ b/repair/README
@@ -1,3 +1,5 @@
+# SPDX-License-Identifier: GPL-2.0
+
 A living document.  The basic algorithm.
 
 TODO: (D == DONE)
@@ -130,7 +132,7 @@ D - 0)      rewrite directory leaf block holemap comparison code.
        it does describe doesn't conflict with reality.
 
 D - 0) rewrite setting nlinks handling -- for version 1
-       inodes, set both nlinks and onlinks (zero projid
+       inodes, set both nlinks and onlinks (zero projid_lo/hi
        and pad) if we have to change anything.  For
        version 2, I think we're ok.
 
@@ -189,7 +191,7 @@ D - 0) look at usage of XFS_MAKE_IPTR().  It does the right
 
 
 D - 0) look at references to XFS_INODES_PER_CHUNK.  change the
-       ones that really mean sizeof(__uint64_t)*NBBY to
+       ones that really mean sizeof(uint64_t)*NBBY to
        something else (like that only defined as a constant
        INOS_PER_IREC. this isn't as important since
        XFS_INODES_PER_CHUNK will never chang
@@ -350,7 +352,7 @@ Phase 3 -- traverse inodes to make the inodes, bmaps and freespace maps
 
        Third, make sure that the root inode is known.  If not,
                and we know the inode number from the superblock,
-               discover that inode and it's chunk.
+               discover that inode and its chunk.
 
        Then, walk the incore inode-cluster tree.
 
@@ -649,7 +651,7 @@ XXX         if in no_modify mode, compare contents of realtime bitmap
                link count for the inode that the entry points to.
 
        After traversal, scan incore inode map for directories not
-               reached.  Go to first one and try and find it's root
+               reached.  Go to first one and try and find its root
                by following .. entries.  Once at root, run traversal
                algorithm.  When algorithm terminates, move subtree
                root inode to the orphanage.  Repeat as necessary