summaryrefslogtreecommitdiffstats
path: root/src/lib/kStuff/kHlp/Generic/kHlpMemICompAscii.c
blob: 6df5767921f79104c6cc76997701686b9c45f0de (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
/* $Id: kHlpMemICompAscii.c 29 2009-07-01 20:30:29Z bird $ */
/** @file
 * kHlpString - kHlpMemICompAscii.
 */

/*
 * Copyright (c) 2006-2007 Knut St. Osmundsen <bird-kStuff-spamix@anduin.net>
 *
 * Permission is hereby granted, free of charge, to any person
 * obtaining a copy of this software and associated documentation
 * files (the "Software"), to deal in the Software without
 * restriction, including without limitation the rights to use,
 * copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the
 * Software is furnished to do so, subject to the following
 * conditions:
 *
 * The above copyright notice and this permission notice shall be
 * included in all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
 * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
 * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
 * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
 * OTHER DEALINGS IN THE SOFTWARE.
 */

/*******************************************************************************
*   Header Files                                                               *
*******************************************************************************/
#include <k/kHlpString.h>


KHLP_DECL(int) kHlpMemICompAscii(const void *pv1, const void *pv2, KSIZE cb)
{
    union
    {
        const void *pv;
        const KU8 *pb;
        const KUPTR *pu;
    } u1, u2;

    u1.pv = pv1;
    u2.pv = pv2;

    if (cb >= 32)
    {
        while (cb > sizeof(KUPTR))
        {
            if (*u1.pu != *u2.pu)
                break; /* hand it on to the byte-by-byte routine. */
            u1.pu++;
            u2.pu++;
            cb -= sizeof(KUPTR);
        }
    }

    while (cb-- > 0)
    {
        if (u1.pb != u2.pb)
        {
            KU8 ch1 = *u1.pb;
            KU8 ch2 = *u2.pb;
            if (ch1 <= 'Z' && ch1 >= 'A')
                ch1 += 'a' - 'A';
            if (ch2 <= 'Z' && ch2 >= 'A')
                ch2 += 'a' - 'A';
            if (ch1 != ch2)
                return ch1 > ch2 ? 1 : -1;
        }
        u1.pb++;
        u2.pb++;
    }

    return 0;
}