lib/libalpm/rawstr.c


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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137

/***************************************************************************
 *                                  _   _ ____  _
 *  Project                     ___| | | |  _ \| |
 *                             / __| | | | |_) | |
 *                            | (__| |_| |  _ <| |___
 *                             \___|\___/|_| \_\_____|
 *
 * Copyright (C) 1998 - 2011, Daniel Stenberg, <daniel@haxx.se>, et al.
 *
 * This software is licensed as described in the file COPYING, which
 * you should have received as part of this distribution. The terms
 * are also available at http://curl.haxx.se/docs/copyright.html.
 *
 * You may opt to use, copy, modify, merge, publish, distribute and/or sell
 * copies of the Software, and permit persons to whom the Software is
 * furnished to do so, under the terms of the COPYING file.
 *
 * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
 * KIND, either express or implied.
 *
 ***************************************************************************/

/* These functions are borrowed from libcurl's lib/rawstr.c with minor
 * modifications to style and naming. Curl_raw_equal and Curl_raw_nequal are
 * further modified to be true cmp style functions, returning negative, zero,
 * or positive. */

#include <stdlib.h>

#include "util.h"

/* Portable, consistent toupper (remember EBCDIC). Do not use toupper() because
         its behavior is altered by the current locale. */
static char raw_toupper(char in)
{
        switch(in) {
        case 'a':
                return 'A';
        case 'b':
                return 'B';
        case 'c':
                return 'C';
        case 'd':
                return 'D';
        case 'e':
                return 'E';
        case 'f':
                return 'F';
        case 'g':
                return 'G';
        case 'h':
                return 'H';
        case 'i':
                return 'I';
        case 'j':
                return 'J';
        case 'k':
                return 'K';
        case 'l':
                return 'L';
        case 'm':
                return 'M';
        case 'n':
                return 'N';
        case 'o':
                return 'O';
        case 'p':
                return 'P';
        case 'q':
                return 'Q';
        case 'r':
                return 'R';
        case 's':
                return 'S';
        case 't':
                return 'T';
        case 'u':
                return 'U';
        case 'v':
                return 'V';
        case 'w':
                return 'W';
        case 'x':
                return 'X';
        case 'y':
                return 'Y';
        case 'z':
                return 'Z';
        }
        return in;
}

/*
 * _alpm_raw_cmp() is for doing "raw" case insensitive strings. This is meant
 * to be locale independent and only compare strings we know are safe for
 * this.  See http://daniel.haxx.se/blog/2008/10/15/strcasecmp-in-turkish/ for
 * some further explanation to why this function is necessary.
 *
 * The function is capable of comparing a-z case insensitively even for
 * non-ascii.
 */

int _alpm_raw_cmp(const char *first, const char *second)
{
        while(*first && *second) {
                if(raw_toupper(*first) != raw_toupper(*second)) {
                        /* get out of the loop as soon as they don't match */
                        break;
                }
                first++;
                second++;
        }
        /* we do the comparison here (possibly again), just to make sure that if the
                 loop above is skipped because one of the strings reached zero, we must not
                 return this as a successful match */
        return (raw_toupper(*first) - raw_toupper(*second));
}

int _alpm_raw_ncmp(const char *first, const char *second, size_t max)
{
        while(*first && *second && max) {
                if(raw_toupper(*first) != raw_toupper(*second)) {
                        break;
                }
                max--;
                first++;
                second++;
        }
        if(0 == max) {
                /* they are equal this far */
                return 0;
        }

        return (raw_toupper(*first) - raw_toupper(*second));
}

/* vim: set noet: */