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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
|
/** BEGIN COPYRIGHT BLOCK
* This Program is free software; you can redistribute it and/or modify it under
* the terms of the GNU General Public License as published by the Free Software
* Foundation; version 2 of the License.
*
* This Program is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
* FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License along with
* this Program; if not, write to the Free Software Foundation, Inc., 59 Temple
* Place, Suite 330, Boston, MA 02111-1307 USA.
*
* In addition, as a special exception, Red Hat, Inc. gives You the additional
* right to link the code of this Program with code not covered under the GNU
* General Public License ("Non-GPL Code") and to distribute linked combinations
* including the two, subject to the limitations in this paragraph. Non-GPL Code
* permitted under this exception must only link to the code of this Program
* through those well defined interfaces identified in the file named EXCEPTION
* found in the source code files (the "Approved Interfaces"). The files of
* Non-GPL Code may instantiate templates or use macros or inline functions from
* the Approved Interfaces without causing the resulting work to be covered by
* the GNU General Public License. Only Red Hat, Inc. may make changes or
* additions to the list of Approved Interfaces. You must obey the GNU General
* Public License in all respects for all of the Program code and other code used
* in conjunction with the Program except the Non-GPL Code covered by this
* exception. If you modify this file, you may extend this exception to your
* version of the file, but you are not obligated to do so. If you do not wish to
* provide this exception without modification, you must delete this exception
* statement from your version and license this file solely under the GPL without
* exception.
*
*
* Copyright (C) 2001 Sun Microsystems, Inc. Used by permission.
* Copyright (C) 2005 Red Hat, Inc.
* All rights reserved.
* END COPYRIGHT BLOCK **/
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include <stdlib.h>
#include "i18n.h"
/*
* Accept-Language = "Accept-Language" ":"
* 1#( language-range [ ";" "q" "=" qvalue ] )
* language-range = ( ( 1*8ALPHA *( "-" 1*8ALPHA ) ) | "*" )
*
* NLS_AccLangList() assumes that "Accept-Language:" has already
* been stripped off. It takes as input
*
* 1#( ( ( 1*8ALPHA *( "-" 1*8ALPHA ) ) | "*" ) [ ";" "q" "=" qvalue ] )
*
* and returns a list of languages, ordered by qvalues, in
* the array NLS_ACCEPT_LANGUAGE_LIST.
*
* If there are to many languages (>NLS_MAX_ACCEPT_LANGUAGE) the excess
* is ignored. If the language-range is too long (>NLS_MAX_ACCEPT_LENGTH),
* the language-range is ignored. In these cases, NLS_AccLangList()
* will quietly return, perhaps with numLang = 0. numLang is
* returned by the function.
*/
static size_t
AcceptLangList(const char* AcceptLanguage,
ACCEPT_LANGUAGE_LIST AcceptLanguageList)
{
char* input;
char* cPtr;
char* cPtr1;
char* cPtr2;
int i;
int j;
int countLang = 0;
input = strdup(AcceptLanguage);
if (input == (char*)NULL){
return 0;
}
cPtr1 = input-1;
cPtr2 = input;
/* put in standard form */
while (*(++cPtr1)) {
if (isalpha(*cPtr1)) *cPtr2++ = tolower(*cPtr1); /* force lower case */
else if (isspace(*cPtr1)); /* ignore any space */
else if (*cPtr1=='-') *cPtr2++ = '_'; /* "-" -> "_" */
else if (*cPtr1=='*'); /* ignore "*" */
else *cPtr2++ = *cPtr1; /* else unchanged */
}
*cPtr2 = '\0';
countLang = 0;
if (strchr(input,';')) {
/* deal with the quality values */
float qvalue[MAX_ACCEPT_LANGUAGE];
float qSwap;
float bias = 0.0f;
char* ptrLanguage[MAX_ACCEPT_LANGUAGE];
char* ptrSwap;
cPtr = strtok(input,",");
while (cPtr) {
qvalue[countLang] = 1.0f;
if ((cPtr1 = strchr(cPtr,';'))) {
sscanf(cPtr1,";q=%f",&qvalue[countLang]);
*cPtr1 = '\0';
}
if (strlen(cPtr)<MAX_ACCEPT_LENGTH) { /* ignore if too long */
qvalue[countLang] -= (bias += 0.0001f); /* to insure original order */
ptrLanguage[countLang++] = cPtr;
if (countLang>=MAX_ACCEPT_LANGUAGE) break; /* quit if too many */
}
cPtr = strtok(NULL,",");
}
/* sort according to decending qvalue */
/* not a very good algorithm, but count is not likely large */
for ( i=0 ; i<countLang-1 ; i++ ) {
for ( j=i+1 ; j<countLang ; j++ ) {
if (qvalue[i]<qvalue[j]) {
qSwap = qvalue[i];
qvalue[i] = qvalue[j];
qvalue[j] = qSwap;
ptrSwap = ptrLanguage[i];
ptrLanguage[i] = ptrLanguage[j];
ptrLanguage[j] = ptrSwap;
}
}
}
for ( i=0 ; i<countLang ; i++ ) {
strcpy(AcceptLanguageList[i],ptrLanguage[i]);
}
} else {
/* simple case: no quality values */
cPtr = strtok(input,",");
while (cPtr) {
if (strlen(cPtr)<MAX_ACCEPT_LENGTH) { /* ignore if too long */
strcpy(AcceptLanguageList[countLang++],cPtr);
if (countLang>=MAX_ACCEPT_LANGUAGE) break; /* quit if too many */
}
cPtr = strtok(NULL,",");
}
}
free(input);
return countLang;
}
/*
* Get prioritized locale list from NLS_AcceptLangList
*
* Add additonal language to the list for fallback if locale
* name is language_region
*
*/
int
XP_AccLangList(char* AcceptLanguage,
ACCEPT_LANGUAGE_LIST AcceptLanguageList)
{
int i;
int n;
char *defaultLanguage = "en";
ACCEPT_LANGUAGE_LIST curLanguageList;
int index = 0;
char lang[3];
int k;
n = AcceptLangList(AcceptLanguage, curLanguageList);
if (n == 0)
return 0;
memset(lang, 0, 3);
for (i = 0; i < n; i++) {
if (*lang && (strncmp(lang, curLanguageList[i], 2) != 0)) {
/* add lang if current language is the last occurence in the list */
for (k = i+1; (k < n) && strncmp(curLanguageList[k],lang,2); k++);
if (k == n) {
strcpy(AcceptLanguageList[index++], lang);
*lang = '\0';
}
}
strcpy(AcceptLanguageList[index++], curLanguageList[i]);
/* Add current language for future appending.,make sure it's not on list */
if ((strlen(curLanguageList[i]) > 2) && (curLanguageList[i][2] == '_')) {
strncpy(lang, curLanguageList[i], 2);
lang[sizeof(lang)-1] = 0;
for (k = 0; (k < index) && strcmp(AcceptLanguageList[k], lang); k++);
if (k != index) lang[0] = '\0';
}
}
if (lang[0] != '\0')
strcpy(AcceptLanguageList[index++], lang); /* add new lang */
/* Append defaultLanguage if it's not in the list */
for (i = 0; (i < index) && strcmp(AcceptLanguageList[i], defaultLanguage); i++);
if (i == index)
strcpy(AcceptLanguageList[index++], defaultLanguage);
return index;
}
|
