Re: [PATCH 1/2] string: simplify stricmp()

From: Andrew Morton
Date: Fri Jan 22 2010 - 19:28:35 EST


On Sat, 16 Jan 2010 18:57:00 -0200
Andr__ Goddard Rosa <andre.goddard@xxxxxxxxx> wrote:

> Removes 32 bytes on core2 with gcc 4.4.1:
> text data bss dec hex filename
> 3196 0 0 3196 c7c lib/string-BEFORE.o
> 3164 0 0 3164 c5c lib/string-AFTER.o
>
> Signed-off-by: Andr__ Goddard Rosa <andre.goddard@xxxxxxxxx>
> cc: Joe Perches <joe@xxxxxxxxxxx>
> cc: Frederic Weisbecker <fweisbec@xxxxxxxxx>
> cc: Andrew Morton <akpm@xxxxxxxxxxxxxxxxxxxx>
> ---
> lib/string.c | 34 +++++++++++++++-------------------
> 1 files changed, 15 insertions(+), 19 deletions(-)
>
> diff --git a/lib/string.c b/lib/string.c
> index a1cdcfc..0f86245 100644
> --- a/lib/string.c
> +++ b/lib/string.c
> @@ -36,25 +36,21 @@ int strnicmp(const char *s1, const char *s2, size_t len)
> /* Yes, Virginia, it had better be unsigned */
> unsigned char c1, c2;
>
> - c1 = c2 = 0;
> - if (len) {
> - do {
> - c1 = *s1;
> - c2 = *s2;
> - s1++;
> - s2++;
> - if (!c1)
> - break;
> - if (!c2)
> - break;
> - if (c1 == c2)
> - continue;
> - c1 = tolower(c1);
> - c2 = tolower(c2);
> - if (c1 != c2)
> - break;
> - } while (--len);
> - }
> + if (!len)
> + return 0;
> +
> + do {
> + c1 = *s1++;
> + c2 = *s2++;
> + if (!c1 || !c2)
> + break;
> + if (c1 == c2)
> + continue;
> + c1 = tolower(c1);
> + c2 = tolower(c2);
> + if (c1 != c2)
> + break;
> + } while (--len);
> return (int)c1 - (int)c2;
> }
> EXPORT_SYMBOL(strnicmp);

hm, that function seems a little broken.

If it reaches the end of s1 or s2 it will return (c1 - c2). If however
it detects a difference due to other than end-of-string, it returns
(tolower(c1) - tolower(c2)).

IOW, perhaps it should be performing tolower() in the
I-reached-end-of-string case.

I wonder what strnicmp() is _supposed_ to return..
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/