about summary refs log tree commit diff
path: root/iconv
diff options
context:
space:
mode:
Diffstat (limited to 'iconv')
-rw-r--r--iconv/iconv_charmap.c2
-rw-r--r--iconv/skeleton.c4
-rw-r--r--iconv/strtab.c2
3 files changed, 4 insertions, 4 deletions
diff --git a/iconv/iconv_charmap.c b/iconv/iconv_charmap.c
index 56f156e117..09024a97cc 100644
--- a/iconv/iconv_charmap.c
+++ b/iconv/iconv_charmap.c
@@ -454,7 +454,7 @@ process_block (struct convtable *tbl, char *addr, size_t len, FILE *output)
       while (! is_term (cur, byte))
 	if (cur->val[byte].sub == NULL)
 	  {
-	    /* This is a invalid sequence.  Skip the first byte if we are
+	    /* This is an invalid sequence.  Skip the first byte if we are
 	       ignoring errors.  Otherwise punt.  */
 	    if (! omit_invalid)
 	      {
diff --git a/iconv/skeleton.c b/iconv/skeleton.c
index 45beb06d34..6997e05682 100644
--- a/iconv/skeleton.c
+++ b/iconv/skeleton.c
@@ -514,7 +514,7 @@ FUNCTION_NAME (struct __gconv_step *step, struct __gconv_step_data *data,
       size_t *lirreversiblep = irreversible ? &lirreversible : NULL;
 
       /* The following assumes that encodings, which have a variable length
-	 what might unalign a buffer even though it is a aligned in the
+	 what might unalign a buffer even though it is an aligned in the
 	 beginning, either don't have the minimal number of bytes as a divisor
 	 of the maximum length or have a minimum length of 1.  This is true
 	 for all known and supported encodings.
@@ -659,7 +659,7 @@ FUNCTION_NAME (struct __gconv_step *step, struct __gconv_step_data *data,
 	      data->__outbuf = outbuf;
 
 	      /* Remember how many non-identical characters we
-		 converted in a irreversible way.  */
+		 converted in an irreversible way.  */
 	      *irreversible += lirreversible;
 
 	      break;
diff --git a/iconv/strtab.c b/iconv/strtab.c
index c62553e2e0..17286401a0 100644
--- a/iconv/strtab.c
+++ b/iconv/strtab.c
@@ -180,7 +180,7 @@ newstring (struct Strtab *st, const char *str, size_t len)
 
 
 /* XXX This function should definitely be rewritten to use a balancing
-   tree algorith (AVL, red-black trees).  For now a simple, correct
+   tree algorithm (AVL, red-black trees).  For now a simple, correct
    implementation is enough.  */
 static struct Strent **
 searchstring (struct Strent **sep, struct Strent *newstr)