Documentation: sharedsubtree: Convert notes to note directive

While a few of the notes are already in reST syntax, others are left
intact (inconsistent). Convert them to reST syntax too.

Signed-off-by: Bagas Sanjaya <bagasdotme@gmail.com>
Signed-off-by: Jonathan Corbet <corbet@lwn.net>
Link: https://lore.kernel.org/r/20250819061254.31220-6-bagasdotme@gmail.com
pull/1354/merge
Bagas Sanjaya 2025-08-19 13:12:53 +07:00 committed by Jonathan Corbet
parent b293fd55a1
commit ec1a37468f
1 changed files with 13 additions and 7 deletions

View File

@ -43,7 +43,8 @@ a) A **shared mount** can be replicated to as many mountpoints and all the
# mount --make-shared /mnt # mount --make-shared /mnt
Note: mount(8) command now supports the --make-shared flag, .. note::
mount(8) command now supports the --make-shared flag,
so the sample 'smount' program is no longer needed and has been so the sample 'smount' program is no longer needed and has been
removed. removed.
@ -242,7 +243,8 @@ D) Versioned files
The section below explains the detailed semantics of The section below explains the detailed semantics of
bind, rbind, move, mount, umount and clone-namespace operations. bind, rbind, move, mount, umount and clone-namespace operations.
Note: the word 'vfsmount' and the noun 'mount' have been used .. Note::
the word 'vfsmount' and the noun 'mount' have been used
to mean the same thing, throughout this document. to mean the same thing, throughout this document.
a) Mount states a) Mount states
@ -885,8 +887,12 @@ A) Datastructure
non-NULL, they form a contiguous (ordered) segment of slave list. non-NULL, they form a contiguous (ordered) segment of slave list.
A example propagation tree looks as shown in the figure below. A example propagation tree looks as shown in the figure below.
[ NOTE: Though it looks like a forest, if we consider all the shared
mounts as a conceptual entity called 'pnode', it becomes a tree]:: .. note::
Though it looks like a forest, if we consider all the shared
mounts as a conceptual entity called 'pnode', it becomes a tree.
::
A <--> B <--> C <---> D A <--> B <--> C <---> D