2 Unix SMB/CIFS implementation.
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 3 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program. If not, see <http://www.gnu.org/licenses/>.
18 Created by Ryo Kawahara <rkawa@lbe.co.jp>
22 #include "web/swat_proto.h"
25 during a file download we first check to see if there is a language
26 specific file available. If there is then use that, otherwise
27 just open the specified file
29 int web_open(const char *fname
, int flags
, mode_t mode
)
32 char *lang
= lang_tdb_current();
35 asprintf(&p
, "lang/%s/%s", lang
, fname
);
37 fd
= sys_open(p
, flags
, mode
);
45 /* fall through to default name */
46 return sys_open(fname
, flags
, mode
);
55 static int qsort_cmp_list(const void *x
, const void *y
) {
56 struct pri_list
*a
= (struct pri_list
*)x
;
57 struct pri_list
*b
= (struct pri_list
*)y
;
58 if (a
->pri
> b
->pri
) return -1;
59 if (a
->pri
< b
->pri
) return 1;
64 choose from a list of languages. The list can be comma or space
66 Keep choosing until we get a hit
67 Changed to habdle priority -- Simo
70 void web_set_lang(const char *lang_string
)
72 char **lang_list
, **count
;
76 /* build the lang list */
77 lang_list
= str_list_make(talloc_tos(), lang_string
, ", \t\r\n");
78 if (!lang_list
) return;
80 /* sort the list by priority */
83 while (*count
&& **count
) {
87 pl
= SMB_MALLOC_ARRAY(struct pri_list
, lang_num
);
92 for (i
= 0; i
< lang_num
; i
++) {
94 if ((pri_code
=strstr(lang_list
[i
], ";q="))) {
97 sscanf(pri_code
, "%f", &(pl
[i
].pri
));
101 pl
[i
].string
= SMB_STRDUP(lang_list
[i
]);
103 TALLOC_FREE(lang_list
);
105 qsort(pl
, lang_num
, sizeof(struct pri_list
), &qsort_cmp_list
);
107 /* it's not an error to not initialise - we just fall back to
110 for (i
= 0; i
< lang_num
; i
++) {
111 if (lang_tdb_init(pl
[i
].string
)) break;
114 for (i
= 0; i
< lang_num
; i
++) {
115 SAFE_FREE(pl
[i
].string
);