2007-07-27 05:35:13 -04:00
|
|
|
/** File utilities
|
|
|
|
* @file */
|
2005-09-15 09:58:31 -04:00
|
|
|
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
|
|
#include "config.h"
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include <ctype.h>
|
2006-01-05 04:49:05 -05:00
|
|
|
#include <errno.h>
|
2005-09-15 09:58:31 -04:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/stat.h> /* OS/2 needs this after sys/types.h */
|
|
|
|
#ifdef HAVE_DIRENT_H
|
|
|
|
#include <dirent.h> /* OS/2 needs this after sys/types.h */
|
|
|
|
#endif
|
|
|
|
#ifdef HAVE_FCNTL_H
|
|
|
|
#include <fcntl.h> /* OS/2 needs this after sys/types.h */
|
|
|
|
#endif
|
|
|
|
#ifdef HAVE_PWD_H
|
|
|
|
#include <pwd.h>
|
|
|
|
#endif
|
|
|
|
#ifdef HAVE_UNISTD_H
|
|
|
|
#include <unistd.h>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef TIME_WITH_SYS_TIME
|
|
|
|
#ifdef HAVE_SYS_TIME_H
|
|
|
|
#include <sys/time.h>
|
|
|
|
#endif
|
|
|
|
#ifdef HAVE_TIME_H
|
|
|
|
#include <time.h>
|
|
|
|
#endif
|
|
|
|
#else
|
|
|
|
#if defined(TM_IN_SYS_TIME) && defined(HAVE_SYS_TIME_H)
|
|
|
|
#include <sys/time.h>
|
|
|
|
#elif defined(HAVE_TIME_H)
|
|
|
|
#include <time.h>
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include "elinks.h"
|
|
|
|
|
|
|
|
#include "osdep/osdep.h"
|
|
|
|
#include "util/conv.h"
|
|
|
|
#include "util/error.h"
|
|
|
|
#include "util/file.h"
|
|
|
|
#include "util/memory.h"
|
|
|
|
#include "util/string.h"
|
2006-01-04 15:41:56 -05:00
|
|
|
|
2005-09-15 09:58:31 -04:00
|
|
|
|
|
|
|
/* Not that these two would be so useful for portability (they are ANSI C) but
|
|
|
|
* they encapsulate the lowlevel stuff (need for <unistd.h>) nicely. */
|
|
|
|
|
|
|
|
int
|
|
|
|
file_exists(const unsigned char *filename)
|
|
|
|
{
|
|
|
|
#ifdef HAVE_ACCESS
|
2006-01-04 15:41:56 -05:00
|
|
|
return access(filename, F_OK) >= 0;
|
2005-09-15 09:58:31 -04:00
|
|
|
#else
|
|
|
|
struct stat buf;
|
|
|
|
|
2006-01-04 15:41:56 -05:00
|
|
|
return stat(filename, &buf) >= 0;
|
2005-09-15 09:58:31 -04:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
file_can_read(const unsigned char *filename)
|
|
|
|
{
|
|
|
|
#ifdef HAVE_ACCESS
|
|
|
|
return access(filename, R_OK) >= 0;
|
|
|
|
#else
|
|
|
|
FILE *f = fopen(filename, "rb");
|
|
|
|
int ok = !!f;
|
|
|
|
|
|
|
|
if (f) fclose(f);
|
|
|
|
return ok;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
file_is_dir(const unsigned char *filename)
|
|
|
|
{
|
|
|
|
struct stat st;
|
|
|
|
|
|
|
|
if (stat(filename, &st))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
return S_ISDIR(st.st_mode);
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned char *
|
|
|
|
get_filename_position(unsigned char *filename)
|
|
|
|
{
|
|
|
|
unsigned char *pos;
|
|
|
|
|
|
|
|
assert(filename);
|
|
|
|
if_assert_failed return NULL;
|
|
|
|
|
|
|
|
for (pos = filename; *pos; pos++)
|
|
|
|
if (dir_sep(*pos)) filename = pos + 1;
|
|
|
|
|
|
|
|
return filename;
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned char *
|
|
|
|
expand_tilde(unsigned char *filename)
|
|
|
|
{
|
|
|
|
struct string file;
|
|
|
|
|
|
|
|
if (!init_string(&file)) return NULL;
|
|
|
|
|
|
|
|
if (filename[0] == '~') {
|
|
|
|
if (!filename[1] || dir_sep(filename[1])) {
|
|
|
|
unsigned char *home = getenv("HOME");
|
|
|
|
|
|
|
|
if (home) {
|
|
|
|
add_to_string(&file, home);
|
|
|
|
filename++;
|
|
|
|
}
|
|
|
|
#ifdef HAVE_GETPWNAM
|
|
|
|
} else {
|
|
|
|
struct passwd *passwd = NULL;
|
|
|
|
unsigned char *user = filename + 1;
|
|
|
|
int userlen = 0;
|
|
|
|
|
|
|
|
while (user[userlen] && !dir_sep(user[userlen]))
|
|
|
|
userlen++;
|
|
|
|
|
|
|
|
user = memacpy(user, userlen);
|
|
|
|
if (user) {
|
|
|
|
passwd = getpwnam(user);
|
|
|
|
mem_free(user);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (passwd && passwd->pw_dir) {
|
|
|
|
add_to_string(&file, passwd->pw_dir);
|
|
|
|
filename += 1 + userlen;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
add_to_string(&file, filename);
|
|
|
|
|
|
|
|
return file.source;
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned char *
|
|
|
|
get_unique_name(unsigned char *fileprefix)
|
|
|
|
{
|
|
|
|
unsigned char *file = fileprefix;
|
|
|
|
int fileprefixlen = strlen(fileprefix);
|
|
|
|
int memtrigger = 1;
|
|
|
|
int suffix = 1;
|
|
|
|
int digits = 0;
|
|
|
|
|
|
|
|
while (file_exists(file)) {
|
|
|
|
if (!(suffix < memtrigger)) {
|
|
|
|
if (suffix >= 10000)
|
|
|
|
INTERNAL("Too big suffix in get_unique_name().");
|
|
|
|
memtrigger *= 10;
|
|
|
|
digits++;
|
|
|
|
|
|
|
|
if (file != fileprefix) mem_free(file);
|
|
|
|
file = mem_alloc(fileprefixlen + 2 + digits);
|
|
|
|
if (!file) return NULL;
|
|
|
|
|
|
|
|
memcpy(file, fileprefix, fileprefixlen);
|
|
|
|
file[fileprefixlen] = '.';
|
|
|
|
}
|
|
|
|
|
|
|
|
longcat(&file[fileprefixlen + 1], NULL, suffix, digits + 1, 0);
|
|
|
|
suffix++;
|
|
|
|
}
|
|
|
|
|
|
|
|
return file;
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned char *
|
|
|
|
get_tempdir_filename(unsigned char *name)
|
|
|
|
{
|
|
|
|
unsigned char *tmpdir = getenv("TMPDIR");
|
|
|
|
|
|
|
|
if (!tmpdir || !*tmpdir) tmpdir = getenv("TMP");
|
|
|
|
if (!tmpdir || !*tmpdir) tmpdir = getenv("TEMPDIR");
|
|
|
|
if (!tmpdir || !*tmpdir) tmpdir = getenv("TEMP");
|
|
|
|
if (!tmpdir || !*tmpdir) tmpdir = "/tmp";
|
|
|
|
|
2007-03-11 06:59:11 -04:00
|
|
|
return straconcat(tmpdir, "/", name, (unsigned char *) NULL);
|
2005-09-15 09:58:31 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
unsigned char *
|
|
|
|
file_read_line(unsigned char *line, size_t *size, FILE *file, int *lineno)
|
|
|
|
{
|
|
|
|
size_t offset = 0;
|
|
|
|
|
|
|
|
if (!line) {
|
|
|
|
line = mem_alloc(MAX_STR_LEN);
|
|
|
|
if (!line)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
*size = MAX_STR_LEN;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (fgets(line + offset, *size - offset, file)) {
|
|
|
|
unsigned char *linepos = strchr(line + offset, '\n');
|
|
|
|
|
|
|
|
if (!linepos) {
|
|
|
|
/* Test if the line buffer should be increase because
|
|
|
|
* it was continued and could not fit. */
|
|
|
|
unsigned char *newline;
|
|
|
|
int next = getc(file);
|
|
|
|
|
|
|
|
if (next == EOF) {
|
|
|
|
/* We are on the last line. */
|
|
|
|
(*lineno)++;
|
|
|
|
return line;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Undo our dammage */
|
|
|
|
ungetc(next, file);
|
|
|
|
offset = *size - 1;
|
|
|
|
*size += MAX_STR_LEN;
|
|
|
|
|
|
|
|
newline = mem_realloc(line, *size);
|
|
|
|
if (!newline)
|
|
|
|
break;
|
|
|
|
line = newline;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* A whole line was read. Fetch next into the buffer if
|
|
|
|
* the line is 'continued'. */
|
|
|
|
(*lineno)++;
|
|
|
|
|
|
|
|
while (line < linepos && isspace(*linepos))
|
|
|
|
linepos--;
|
|
|
|
|
|
|
|
if (*linepos != '\\') {
|
|
|
|
*(linepos + 1) = '\0';
|
|
|
|
return line;
|
|
|
|
}
|
|
|
|
offset = linepos - line - 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
mem_free_if(line);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Some mkstemp() implementations do not set safe permissions,
|
|
|
|
* so it may result in temporary files readable by all users.
|
|
|
|
* This may be a problem when textarea fields are edited through
|
|
|
|
* an external editor (see src/viewer/text/textarea.c).
|
|
|
|
*
|
|
|
|
* From 2001-12-23 mkstemp(3) gnu man page:
|
|
|
|
*
|
|
|
|
* ...
|
|
|
|
* The file is then created with mode read/write and permissions 0666
|
|
|
|
* (glibc 2.0.6 and earlier), 0600 (glibc 2.0.7 and later).
|
|
|
|
* ...
|
|
|
|
*
|
|
|
|
* NOTES:
|
|
|
|
* The old behaviour (creating a file with mode 0666) may be a security
|
|
|
|
* risk, especially since other Unix flavours use 0600, and somebody
|
|
|
|
* might overlook this detail when porting programs.
|
|
|
|
* More generally, the POSIX specification does not say anything
|
|
|
|
* about file modes, so the application should make sure its umask is
|
|
|
|
* set appropriately before calling mkstemp.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
safe_mkstemp(unsigned char *template)
|
|
|
|
{
|
2006-05-18 15:46:42 -04:00
|
|
|
#ifndef CONFIG_OS_WIN32
|
2006-01-10 17:35:22 -05:00
|
|
|
mode_t saved_mask = umask(S_IXUSR | S_IRWXG | S_IRWXO);
|
2006-05-31 13:34:49 -04:00
|
|
|
#endif
|
2005-09-15 09:58:31 -04:00
|
|
|
int fd = mkstemp(template);
|
2006-05-18 15:46:42 -04:00
|
|
|
#ifndef CONFIG_OS_WIN32
|
2005-09-15 09:58:31 -04:00
|
|
|
umask(saved_mask);
|
2006-05-18 15:46:42 -04:00
|
|
|
#endif
|
2005-09-15 09:58:31 -04:00
|
|
|
return fd;
|
|
|
|
}
|
|
|
|
|
Don't cast qsort comparison function pointers.
Instead, convert the element pointers inside the comparison functions.
The last argument of qsort() is supposed to be of type
int (*)(const void *, const void *). Previously, comp_links() was
defined to take struct link * instead of const void *, and the type
mismatch was silenced by casting the function pointer to void *.
This was in principle not portable because:
(1) The different pointer types may have different representations.
In a word-oriented machine, the const void * might include a byte
selector while the struct link * might not.
(2) Casting a function pointer to a data pointer can lose bits in some
memory models. Apparently this does not occur in POSIX-conforming
systems though, as dlsym() would fail if it did.
This commit also fixes hits_cmp() and compare_dir_entries(), which
had similar problems. However, I'm leaving alias_compare() in
src/intl/gettext/localealias.c unchanged for now, so as not to diverge
from the GNU version.
I also checked the bsearch() calls but they were all okay, apart from
one that used the alias_compare() mentioned above.
2007-10-05 22:59:20 -04:00
|
|
|
/* comparison function for qsort() */
|
2010-09-06 12:38:36 -04:00
|
|
|
int
|
Don't cast qsort comparison function pointers.
Instead, convert the element pointers inside the comparison functions.
The last argument of qsort() is supposed to be of type
int (*)(const void *, const void *). Previously, comp_links() was
defined to take struct link * instead of const void *, and the type
mismatch was silenced by casting the function pointer to void *.
This was in principle not portable because:
(1) The different pointer types may have different representations.
In a word-oriented machine, the const void * might include a byte
selector while the struct link * might not.
(2) Casting a function pointer to a data pointer can lose bits in some
memory models. Apparently this does not occur in POSIX-conforming
systems though, as dlsym() would fail if it did.
This commit also fixes hits_cmp() and compare_dir_entries(), which
had similar problems. However, I'm leaving alias_compare() in
src/intl/gettext/localealias.c unchanged for now, so as not to diverge
from the GNU version.
I also checked the bsearch() calls but they were all okay, apart from
one that used the alias_compare() mentioned above.
2007-10-05 22:59:20 -04:00
|
|
|
compare_dir_entries(const void *v1, const void *v2)
|
2005-09-15 09:58:31 -04:00
|
|
|
{
|
Don't cast qsort comparison function pointers.
Instead, convert the element pointers inside the comparison functions.
The last argument of qsort() is supposed to be of type
int (*)(const void *, const void *). Previously, comp_links() was
defined to take struct link * instead of const void *, and the type
mismatch was silenced by casting the function pointer to void *.
This was in principle not portable because:
(1) The different pointer types may have different representations.
In a word-oriented machine, the const void * might include a byte
selector while the struct link * might not.
(2) Casting a function pointer to a data pointer can lose bits in some
memory models. Apparently this does not occur in POSIX-conforming
systems though, as dlsym() would fail if it did.
This commit also fixes hits_cmp() and compare_dir_entries(), which
had similar problems. However, I'm leaving alias_compare() in
src/intl/gettext/localealias.c unchanged for now, so as not to diverge
from the GNU version.
I also checked the bsearch() calls but they were all okay, apart from
one that used the alias_compare() mentioned above.
2007-10-05 22:59:20 -04:00
|
|
|
const struct directory_entry *d1 = v1, *d2 = v2;
|
|
|
|
|
2005-09-15 09:58:31 -04:00
|
|
|
if (d1->name[0] == '.' && d1->name[1] == '.' && !d1->name[2]) return -1;
|
|
|
|
if (d2->name[0] == '.' && d2->name[1] == '.' && !d2->name[2]) return 1;
|
|
|
|
if (d1->attrib[0] == 'd' && d2->attrib[0] != 'd') return -1;
|
|
|
|
if (d1->attrib[0] != 'd' && d2->attrib[0] == 'd') return 1;
|
|
|
|
return strcmp(d1->name, d2->name);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2007-07-27 05:35:13 -04:00
|
|
|
/** This function decides whether a file should be shown in directory
|
|
|
|
* listing or not. @returns according boolean value. */
|
2005-09-15 09:58:31 -04:00
|
|
|
static inline int
|
|
|
|
file_visible(unsigned char *name, int get_hidden_files, int is_root_directory)
|
|
|
|
{
|
|
|
|
/* Always show everything not beginning with a dot. */
|
|
|
|
if (name[0] != '.')
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
/* Always hide the "." directory. */
|
|
|
|
if (name[1] == '\0')
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* Always show the ".." directory (but for root directory). */
|
|
|
|
if (name[1] == '.' && name[2] == '\0')
|
|
|
|
return !is_root_directory;
|
|
|
|
|
|
|
|
/* Others like ".x" or "..foo" are shown if get_hidden_files
|
|
|
|
* == 1. */
|
|
|
|
return get_hidden_files;
|
|
|
|
}
|
|
|
|
|
2007-07-27 05:35:13 -04:00
|
|
|
/** First information such as permissions is gathered for each directory entry.
|
|
|
|
* All entries are then sorted. */
|
2005-09-15 09:58:31 -04:00
|
|
|
struct directory_entry *
|
|
|
|
get_directory_entries(unsigned char *dirname, int get_hidden)
|
|
|
|
{
|
|
|
|
struct directory_entry *entries = NULL;
|
|
|
|
DIR *directory;
|
|
|
|
int size = 0;
|
|
|
|
struct dirent *entry;
|
|
|
|
int is_root_directory = dirname[0] == '/' && !dirname[1];
|
|
|
|
|
|
|
|
directory = opendir(dirname);
|
|
|
|
if (!directory) return NULL;
|
|
|
|
|
|
|
|
while ((entry = readdir(directory))) {
|
|
|
|
struct stat st, *stp;
|
|
|
|
struct directory_entry *new_entries;
|
|
|
|
unsigned char *name;
|
|
|
|
struct string attrib;
|
|
|
|
|
|
|
|
if (!file_visible(entry->d_name, get_hidden, is_root_directory))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
new_entries = mem_realloc(entries, (size + 2) * sizeof(*new_entries));
|
|
|
|
if (!new_entries) continue;
|
|
|
|
entries = new_entries;
|
|
|
|
|
|
|
|
/* We allocate the full path because it is used in a few places
|
|
|
|
* which means less allocation although a bit more short term
|
|
|
|
* memory usage. */
|
2007-03-11 06:59:11 -04:00
|
|
|
name = straconcat(dirname, entry->d_name,
|
|
|
|
(unsigned char *) NULL);
|
2005-09-15 09:58:31 -04:00
|
|
|
if (!name) continue;
|
|
|
|
|
|
|
|
if (!init_string(&attrib)) {
|
|
|
|
mem_free(name);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef FS_UNIX_SOFTLINKS
|
|
|
|
stp = (lstat(name, &st)) ? NULL : &st;
|
|
|
|
#else
|
|
|
|
stp = (stat(name, &st)) ? NULL : &st;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
stat_type(&attrib, stp);
|
|
|
|
stat_mode(&attrib, stp);
|
|
|
|
stat_links(&attrib, stp);
|
|
|
|
stat_user(&attrib, stp);
|
|
|
|
stat_group(&attrib, stp);
|
|
|
|
stat_size(&attrib, stp);
|
|
|
|
stat_date(&attrib, stp);
|
|
|
|
|
|
|
|
entries[size].name = name;
|
|
|
|
entries[size].attrib = attrib.source;
|
|
|
|
size++;
|
|
|
|
}
|
|
|
|
|
|
|
|
closedir(directory);
|
|
|
|
|
|
|
|
if (!size) {
|
|
|
|
/* We may have allocated space for entries but added none. */
|
|
|
|
mem_free_if(entries);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
Don't cast qsort comparison function pointers.
Instead, convert the element pointers inside the comparison functions.
The last argument of qsort() is supposed to be of type
int (*)(const void *, const void *). Previously, comp_links() was
defined to take struct link * instead of const void *, and the type
mismatch was silenced by casting the function pointer to void *.
This was in principle not portable because:
(1) The different pointer types may have different representations.
In a word-oriented machine, the const void * might include a byte
selector while the struct link * might not.
(2) Casting a function pointer to a data pointer can lose bits in some
memory models. Apparently this does not occur in POSIX-conforming
systems though, as dlsym() would fail if it did.
This commit also fixes hits_cmp() and compare_dir_entries(), which
had similar problems. However, I'm leaving alias_compare() in
src/intl/gettext/localealias.c unchanged for now, so as not to diverge
from the GNU version.
I also checked the bsearch() calls but they were all okay, apart from
one that used the alias_compare() mentioned above.
2007-10-05 22:59:20 -04:00
|
|
|
qsort(entries, size, sizeof(*entries), compare_dir_entries);
|
2005-09-15 09:58:31 -04:00
|
|
|
|
|
|
|
memset(&entries[size], 0, sizeof(*entries));
|
|
|
|
|
|
|
|
return entries;
|
|
|
|
}
|
2006-01-04 15:43:42 -05:00
|
|
|
|
2007-07-27 05:35:13 -04:00
|
|
|
/** Recursively create directories in @a path. The last element in the path is
|
2006-01-05 04:49:05 -05:00
|
|
|
* taken to be a filename, and simply ignored */
|
|
|
|
int
|
|
|
|
mkalldirs(const unsigned char *path)
|
2006-01-04 15:43:42 -05:00
|
|
|
{
|
2006-01-05 04:49:05 -05:00
|
|
|
int pos, len, ret = 0;
|
|
|
|
unsigned char *p;
|
2006-01-04 15:43:42 -05:00
|
|
|
|
2006-01-05 04:49:05 -05:00
|
|
|
if (!*path) return -1;
|
2006-01-04 15:43:42 -05:00
|
|
|
|
2006-01-05 04:49:05 -05:00
|
|
|
/* Make a copy of path, to be able to write to it. Otherwise, the
|
|
|
|
* function is unsafe if called with a read-only char *argument. */
|
|
|
|
len = strlen(path) + 1;
|
|
|
|
p = fmem_alloc(len);
|
|
|
|
if (!p) return -1;
|
|
|
|
memcpy(p, path, len);
|
2006-01-04 15:43:42 -05:00
|
|
|
|
2006-01-05 04:49:05 -05:00
|
|
|
for (pos = 1; p[pos]; pos++) {
|
|
|
|
unsigned char separator = p[pos];
|
2006-01-04 15:43:42 -05:00
|
|
|
|
2006-01-05 04:49:05 -05:00
|
|
|
if (!dir_sep(separator))
|
|
|
|
continue;
|
2006-01-04 15:43:42 -05:00
|
|
|
|
2006-01-05 04:49:05 -05:00
|
|
|
p[pos] = 0;
|
2006-01-04 15:43:42 -05:00
|
|
|
|
2006-01-10 17:40:39 -05:00
|
|
|
ret = mkdir(p, S_IRWXU);
|
2006-01-04 15:43:42 -05:00
|
|
|
|
2006-01-05 04:49:05 -05:00
|
|
|
p[pos] = separator;
|
2006-01-04 15:43:42 -05:00
|
|
|
|
2008-03-27 03:52:45 -04:00
|
|
|
if (ret < 0) {
|
|
|
|
if (errno != EEXIST) break;
|
|
|
|
ret = 0;
|
|
|
|
}
|
2006-01-04 15:43:42 -05:00
|
|
|
}
|
|
|
|
|
2006-01-05 04:49:05 -05:00
|
|
|
fmem_free(p);
|
2006-01-04 15:43:42 -05:00
|
|
|
return ret;
|
|
|
|
}
|