2005-06-28 07:04:36 +04:00
|
|
|
/*
|
2012-03-17 02:38:13 +04:00
|
|
|
Copyright (c) 2004-2012 Jay Sorg
|
2005-06-28 07:04:36 +04:00
|
|
|
|
2006-10-12 08:46:40 +04:00
|
|
|
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:
|
2005-06-28 07:04:36 +04:00
|
|
|
|
2006-10-12 08:46:40 +04:00
|
|
|
The above copyright notice and this permission notice shall be included
|
|
|
|
in all copies or substantial portions of the Software.
|
2005-06-28 07:04:36 +04:00
|
|
|
|
2006-10-12 08:46:40 +04:00
|
|
|
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.
|
2005-06-28 07:04:36 +04:00
|
|
|
|
|
|
|
read a config file
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "arch.h"
|
|
|
|
#include "os_calls.h"
|
|
|
|
#include "list.h"
|
|
|
|
#include "file.h"
|
|
|
|
#include "parse.h"
|
|
|
|
|
|
|
|
/*****************************************************************************/
|
2005-09-25 08:08:26 +04:00
|
|
|
/* returns error
|
|
|
|
returns 0 if everything is ok
|
|
|
|
returns 1 if problem reading file */
|
2007-10-28 08:49:08 +03:00
|
|
|
static int APP_CC
|
|
|
|
l_file_read_sections(int fd, int max_file_size, struct list* names)
|
2005-06-28 07:04:36 +04:00
|
|
|
{
|
|
|
|
struct stream* s;
|
|
|
|
char text[256];
|
|
|
|
char c;
|
|
|
|
int in_it;
|
|
|
|
int in_it_index;
|
|
|
|
int len;
|
|
|
|
int index;
|
2005-09-25 08:08:26 +04:00
|
|
|
int rv;
|
2005-06-28 07:04:36 +04:00
|
|
|
|
2005-09-25 08:08:26 +04:00
|
|
|
rv = 0;
|
2005-06-28 07:04:36 +04:00
|
|
|
g_file_seek(fd, 0);
|
|
|
|
in_it_index = 0;
|
|
|
|
in_it = 0;
|
|
|
|
g_memset(text, 0, 256);
|
|
|
|
list_clear(names);
|
|
|
|
make_stream(s);
|
2007-10-28 08:49:08 +03:00
|
|
|
init_stream(s, max_file_size);
|
|
|
|
len = g_file_read(fd, s->data, max_file_size);
|
2005-06-28 07:04:36 +04:00
|
|
|
if (len > 0)
|
|
|
|
{
|
|
|
|
s->end = s->p + len;
|
|
|
|
for (index = 0; index < len; index++)
|
|
|
|
{
|
|
|
|
in_uint8(s, c);
|
|
|
|
if (c == '[')
|
|
|
|
{
|
|
|
|
in_it = 1;
|
|
|
|
}
|
|
|
|
else if (c == ']')
|
|
|
|
{
|
2007-10-27 11:02:28 +04:00
|
|
|
list_add_item(names, (tbus)g_strdup(text));
|
2005-06-28 07:04:36 +04:00
|
|
|
in_it = 0;
|
|
|
|
in_it_index = 0;
|
|
|
|
g_memset(text, 0, 256);
|
|
|
|
}
|
|
|
|
else if (in_it)
|
|
|
|
{
|
|
|
|
text[in_it_index] = c;
|
|
|
|
in_it_index++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2005-09-25 08:08:26 +04:00
|
|
|
else if (len < 0)
|
|
|
|
{
|
|
|
|
rv = 1;
|
|
|
|
}
|
2005-06-28 07:04:36 +04:00
|
|
|
free_stream(s);
|
2005-09-25 08:08:26 +04:00
|
|
|
return rv;
|
2005-06-28 07:04:36 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*****************************************************************************/
|
2006-10-24 08:05:38 +04:00
|
|
|
static int APP_CC
|
2005-06-28 07:04:36 +04:00
|
|
|
file_read_line(struct stream* s, char* text)
|
|
|
|
{
|
|
|
|
int i;
|
2006-07-21 07:27:03 +04:00
|
|
|
int skip_to_end;
|
2007-01-15 12:02:21 +03:00
|
|
|
int at_end;
|
2005-06-28 07:04:36 +04:00
|
|
|
char c;
|
|
|
|
char* hold;
|
|
|
|
|
2006-07-21 07:27:03 +04:00
|
|
|
skip_to_end = 0;
|
2007-01-15 12:02:21 +03:00
|
|
|
if (!s_check_rem(s, 1))
|
2005-06-28 07:04:36 +04:00
|
|
|
{
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
hold = s->p;
|
|
|
|
i = 0;
|
|
|
|
in_uint8(s, c);
|
2007-01-15 12:02:21 +03:00
|
|
|
while (c != 10 && c != 13)
|
2005-06-28 07:04:36 +04:00
|
|
|
{
|
2009-09-07 22:54:03 +04:00
|
|
|
if (c == '#' || c == '!' || c == ';')
|
2006-07-21 07:27:03 +04:00
|
|
|
{
|
|
|
|
skip_to_end = 1;
|
|
|
|
}
|
|
|
|
if (!skip_to_end)
|
|
|
|
{
|
|
|
|
text[i] = c;
|
|
|
|
i++;
|
|
|
|
}
|
2007-01-15 12:02:21 +03:00
|
|
|
if (s_check_rem(s, 1))
|
|
|
|
{
|
|
|
|
in_uint8(s, c);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
c = 0;
|
|
|
|
break;
|
|
|
|
}
|
2005-06-28 07:04:36 +04:00
|
|
|
}
|
|
|
|
if (c == 10 || c == 13)
|
|
|
|
{
|
2007-01-15 12:02:21 +03:00
|
|
|
at_end = 0;
|
|
|
|
while (c == 10 || c == 13)
|
2005-06-28 07:04:36 +04:00
|
|
|
{
|
2007-01-15 12:02:21 +03:00
|
|
|
if (s_check_rem(s, 1))
|
|
|
|
{
|
|
|
|
in_uint8(s, c);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
at_end = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!at_end)
|
|
|
|
{
|
|
|
|
s->p--;
|
2005-06-28 07:04:36 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
text[i] = 0;
|
|
|
|
if (text[0] == '[')
|
|
|
|
{
|
|
|
|
s->p = hold;
|
|
|
|
return 1;
|
|
|
|
}
|
2007-01-15 12:02:21 +03:00
|
|
|
return 0;
|
2005-06-28 07:04:36 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*****************************************************************************/
|
2007-10-28 08:49:08 +03:00
|
|
|
/* returns error */
|
2006-10-24 08:05:38 +04:00
|
|
|
static int APP_CC
|
2005-06-28 07:04:36 +04:00
|
|
|
file_split_name_value(char* text, char* name, char* value)
|
|
|
|
{
|
|
|
|
int len;
|
|
|
|
int i;
|
|
|
|
int value_index;
|
|
|
|
int name_index;
|
|
|
|
int on_to;
|
|
|
|
|
|
|
|
value_index = 0;
|
|
|
|
name_index = 0;
|
|
|
|
on_to = 0;
|
|
|
|
name[0] = 0;
|
|
|
|
value[0] = 0;
|
|
|
|
len = g_strlen(text);
|
|
|
|
for (i = 0; i < len; i++)
|
|
|
|
{
|
|
|
|
if (text[i] == '=')
|
|
|
|
{
|
|
|
|
on_to = 1;
|
|
|
|
}
|
|
|
|
else if (on_to)
|
|
|
|
{
|
|
|
|
value[value_index] = text[i];
|
|
|
|
value_index++;
|
|
|
|
value[value_index] = 0;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
name[name_index] = text[i];
|
|
|
|
name_index++;
|
|
|
|
name[name_index] = 0;
|
|
|
|
}
|
|
|
|
}
|
2007-10-27 09:53:19 +04:00
|
|
|
g_strtrim(name, 3); /* trim both right and left */
|
|
|
|
g_strtrim(value, 3); /* trim both right and left */
|
2005-06-28 07:04:36 +04:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*****************************************************************************/
|
2005-09-29 07:19:52 +04:00
|
|
|
/* return error */
|
2007-10-28 08:49:08 +03:00
|
|
|
static int APP_CC
|
|
|
|
l_file_read_section(int fd, int max_file_size, const char* section,
|
|
|
|
struct list* names, struct list* values)
|
2005-06-28 07:04:36 +04:00
|
|
|
{
|
|
|
|
struct stream* s;
|
2005-09-26 06:16:37 +04:00
|
|
|
char text[512];
|
|
|
|
char name[512];
|
|
|
|
char value[512];
|
2012-03-17 02:38:13 +04:00
|
|
|
char* lvalue;
|
2005-06-28 07:04:36 +04:00
|
|
|
char c;
|
|
|
|
int in_it;
|
|
|
|
int in_it_index;
|
|
|
|
int len;
|
|
|
|
int index;
|
2007-10-28 08:49:08 +03:00
|
|
|
int file_size;
|
2005-06-28 07:04:36 +04:00
|
|
|
|
2007-10-28 08:49:08 +03:00
|
|
|
file_size = 32 * 1024; /* 32 K file size limit */
|
2005-06-28 07:04:36 +04:00
|
|
|
g_file_seek(fd, 0);
|
|
|
|
in_it_index = 0;
|
|
|
|
in_it = 0;
|
2005-09-26 06:16:37 +04:00
|
|
|
g_memset(text, 0, 512);
|
2005-06-28 07:04:36 +04:00
|
|
|
list_clear(names);
|
|
|
|
list_clear(values);
|
|
|
|
make_stream(s);
|
2007-10-28 08:49:08 +03:00
|
|
|
init_stream(s, file_size);
|
|
|
|
len = g_file_read(fd, s->data, file_size);
|
2005-06-28 07:04:36 +04:00
|
|
|
if (len > 0)
|
|
|
|
{
|
|
|
|
s->end = s->p + len;
|
|
|
|
for (index = 0; index < len; index++)
|
|
|
|
{
|
|
|
|
in_uint8(s, c);
|
|
|
|
if (c == '[')
|
|
|
|
{
|
|
|
|
in_it = 1;
|
|
|
|
}
|
|
|
|
else if (c == ']')
|
|
|
|
{
|
2006-04-24 01:29:05 +04:00
|
|
|
if (g_strcasecmp(section, text) == 0)
|
2005-06-28 07:04:36 +04:00
|
|
|
{
|
|
|
|
file_read_line(s, text);
|
|
|
|
while (file_read_line(s, text) == 0)
|
|
|
|
{
|
2006-07-21 07:27:03 +04:00
|
|
|
if (g_strlen(text) > 0)
|
|
|
|
{
|
|
|
|
file_split_name_value(text, name, value);
|
2007-10-27 11:02:28 +04:00
|
|
|
list_add_item(names, (tbus)g_strdup(name));
|
2012-03-17 02:38:13 +04:00
|
|
|
if (value[0] == '$')
|
|
|
|
{
|
|
|
|
lvalue = g_getenv(value + 1);
|
|
|
|
if (lvalue != 0)
|
|
|
|
{
|
|
|
|
list_add_item(values, (tbus)g_strdup(lvalue));
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
list_add_item(values, (tbus)g_strdup(""));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
list_add_item(values, (tbus)g_strdup(value));
|
|
|
|
}
|
2006-07-21 07:27:03 +04:00
|
|
|
}
|
2005-06-28 07:04:36 +04:00
|
|
|
}
|
|
|
|
free_stream(s);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
in_it = 0;
|
|
|
|
in_it_index = 0;
|
2005-09-26 06:16:37 +04:00
|
|
|
g_memset(text, 0, 512);
|
2005-06-28 07:04:36 +04:00
|
|
|
}
|
|
|
|
else if (in_it)
|
|
|
|
{
|
|
|
|
text[in_it_index] = c;
|
|
|
|
in_it_index++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
free_stream(s);
|
2005-09-29 07:19:52 +04:00
|
|
|
return 1;
|
2005-06-28 07:04:36 +04:00
|
|
|
}
|
2007-10-28 08:49:08 +03:00
|
|
|
|
|
|
|
/*****************************************************************************/
|
|
|
|
/* returns error
|
|
|
|
returns 0 if everything is ok
|
|
|
|
returns 1 if problem reading file */
|
|
|
|
/* 32 K file size limit */
|
|
|
|
int APP_CC
|
|
|
|
file_read_sections(int fd, struct list* names)
|
|
|
|
{
|
|
|
|
return l_file_read_sections(fd, 32 * 1024, names);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*****************************************************************************/
|
|
|
|
/* return error */
|
|
|
|
/* this function should be prefered over file_read_sections because it can
|
|
|
|
read any file size */
|
|
|
|
int APP_CC
|
|
|
|
file_by_name_read_sections(const char* file_name, struct list* names)
|
|
|
|
{
|
|
|
|
int fd;
|
|
|
|
int file_size;
|
|
|
|
int rv;
|
|
|
|
|
|
|
|
file_size = g_file_get_size(file_name);
|
|
|
|
if (file_size < 1)
|
|
|
|
{
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
fd = g_file_open(file_name);
|
|
|
|
if (fd < 1)
|
|
|
|
{
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
rv = l_file_read_sections(fd, file_size, names);
|
|
|
|
g_file_close(fd);
|
|
|
|
return rv;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*****************************************************************************/
|
|
|
|
/* return error */
|
|
|
|
/* 32 K file size limit */
|
|
|
|
int APP_CC
|
|
|
|
file_read_section(int fd, const char* section,
|
|
|
|
struct list* names, struct list* values)
|
|
|
|
{
|
|
|
|
return l_file_read_section(fd, 32 * 1024, section, names, values);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*****************************************************************************/
|
|
|
|
/* return error */
|
|
|
|
/* this function should be prefered over file_read_section because it can
|
|
|
|
read any file size */
|
|
|
|
int APP_CC
|
|
|
|
file_by_name_read_section(const char* file_name, const char* section,
|
|
|
|
struct list* names, struct list* values)
|
|
|
|
{
|
|
|
|
int fd;
|
|
|
|
int file_size;
|
|
|
|
int rv;
|
|
|
|
|
|
|
|
file_size = g_file_get_size(file_name);
|
|
|
|
if (file_size < 1)
|
|
|
|
{
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
fd = g_file_open(file_name);
|
|
|
|
if (fd < 1)
|
|
|
|
{
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
rv = l_file_read_section(fd, file_size, section, names, values);
|
|
|
|
g_file_close(fd);
|
|
|
|
return rv;
|
|
|
|
}
|