X-Git-Url: https://git.dogcows.com/gitweb?a=blobdiff_plain;f=src%2Fnames.c;h=f533c08736241ec4cc6a6ed67e0dfc3e2dbf4c79;hb=debc485626c0c143731b0ca229d18b48085bb2ef;hp=ba4d509e47ead3bfd99846250f05c623878a11c8;hpb=6689e8db4f53f6a0bed3d1bc4ed12d31eaa3bf51;p=chaz%2Ftar

diff --git a/src/names.c b/src/names.c
index ba4d509..f533c08 100644
--- a/src/names.c
+++ b/src/names.c
@@ -669,9 +669,9 @@ label_notfound (void)
 
 /* Sort *singly* linked LIST of names, of given LENGTH, using COMPARE
    to order names.  Return the sorted list.  Note that after calling
-   this function, the `prev' links in list elements are messed up.
+   this function, the 'prev' links in list elements are messed up.
 
-   Apart from the type `struct name' and the definition of SUCCESSOR,
+   Apart from the type 'struct name' and the definition of SUCCESSOR,
    this is a generic list-sorting function, but it's too painful to
    make it both generic and portable
    in C.  */
@@ -894,7 +894,7 @@ name_compare (void const *entry1, void const *entry2)
 }
 
 
-/* Rebase `name' member of CHILD and all its siblings to
+/* Rebase 'name' member of CHILD and all its siblings to
    the new PARENT. */
 static void
 rebase_child_list (struct name *child, struct name *parent)