From c0c3f78afb6070721848574e2e5dff5cfa20e28d Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Ond=C5=99ej=20B=C3=ADlka?= Date: Wed, 21 Aug 2013 19:48:48 +0200 Subject: Fix typos. --- iconv/iconv_charmap.c | 2 +- iconv/skeleton.c | 4 ++-- iconv/strtab.c | 2 +- 3 files changed, 4 insertions(+), 4 deletions(-) (limited to 'iconv') diff --git a/iconv/iconv_charmap.c b/iconv/iconv_charmap.c index 56f156e..09024a9 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 45beb06..6997e05 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 c62553e..1728640 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) -- cgit v1.1