mirror of
https://github.com/irssi/irssi.git
synced 2024-09-15 04:28:09 -04:00
fef25d6a35
We add some additional checks into the config parser's node_section_index, node_traverse and node_set_str functions. In particular, we check if the requested node is of scalar or complex type and whether this matches the value found in the config. If it does not match, then a warning is issued appropriately and the config is corrected.
175 lines
4.6 KiB
C
175 lines
4.6 KiB
C
/*
|
|
set.c : irssi configuration - change settings in memory
|
|
|
|
Copyright (C) 1999 Timo Sirainen
|
|
|
|
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; either version 2 of the License, or
|
|
(at your option) any later version.
|
|
|
|
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.,
|
|
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
*/
|
|
|
|
#include "module.h"
|
|
|
|
static void cache_remove(CONFIG_REC *rec, CONFIG_NODE *node)
|
|
{
|
|
char *path;
|
|
|
|
path = g_hash_table_lookup(rec->cache_nodes, node);
|
|
if (path != NULL) {
|
|
g_hash_table_remove(rec->cache, path);
|
|
g_hash_table_remove(rec->cache_nodes, node);
|
|
g_free(path);
|
|
}
|
|
}
|
|
|
|
void config_node_remove(CONFIG_REC *rec, CONFIG_NODE *parent, CONFIG_NODE *node)
|
|
{
|
|
g_return_if_fail(node != NULL);
|
|
|
|
if (parent == NULL)
|
|
parent = rec->mainnode;
|
|
|
|
rec->modifycounter++;
|
|
cache_remove(rec, node);
|
|
parent->value = g_slist_remove(parent->value, node);
|
|
|
|
switch (node->type) {
|
|
case NODE_TYPE_KEY:
|
|
case NODE_TYPE_VALUE:
|
|
case NODE_TYPE_COMMENT:
|
|
g_free_not_null(node->value);
|
|
break;
|
|
case NODE_TYPE_BLOCK:
|
|
case NODE_TYPE_LIST:
|
|
while (node->value != NULL)
|
|
config_node_remove(rec, node, ((GSList *) node->value)->data);
|
|
break;
|
|
}
|
|
g_free_not_null(node->key);
|
|
g_free(node);
|
|
}
|
|
|
|
void config_node_list_remove(CONFIG_REC *rec, CONFIG_NODE *node, int index)
|
|
{
|
|
CONFIG_NODE *child;
|
|
|
|
g_return_if_fail(node != NULL);
|
|
g_return_if_fail(is_node_list(node));
|
|
|
|
child = config_node_nth(node, index);
|
|
if (child != NULL) config_node_remove(rec, node, child);
|
|
}
|
|
|
|
void config_node_clear(CONFIG_REC *rec, CONFIG_NODE *node)
|
|
{
|
|
g_return_if_fail(node != NULL);
|
|
g_return_if_fail(is_node_list(node));
|
|
|
|
while (node->value != NULL)
|
|
config_node_remove(rec, node, ((GSList *) node->value)->data);
|
|
}
|
|
|
|
void config_nodes_remove_all(CONFIG_REC *rec)
|
|
{
|
|
g_return_if_fail(rec != NULL);
|
|
|
|
while (rec->mainnode->value != NULL)
|
|
config_node_remove(rec, rec->mainnode, ((GSList *) rec->mainnode->value)->data);
|
|
}
|
|
|
|
void config_node_set_str(CONFIG_REC *rec, CONFIG_NODE *parent, const char *key, const char *value)
|
|
{
|
|
CONFIG_NODE *node;
|
|
int no_key;
|
|
|
|
g_return_if_fail(rec != NULL);
|
|
g_return_if_fail(parent != NULL);
|
|
|
|
no_key = key == NULL;
|
|
node = no_key ? NULL : config_node_find(parent, key);
|
|
|
|
if (value == NULL) {
|
|
/* remove the key */
|
|
if (node != NULL) config_node_remove(rec, parent, node);
|
|
return;
|
|
}
|
|
|
|
if (node != NULL && !has_node_value(node)) {
|
|
g_critical("Expected scalar node at `..%s/%s' was of complex type. Corrupt config?",
|
|
parent->key, key);
|
|
config_node_remove(rec, parent, node);
|
|
node = NULL;
|
|
}
|
|
if (node != NULL) {
|
|
if (strcmp(node->value, value) == 0)
|
|
return;
|
|
g_free(node->value);
|
|
} else {
|
|
node = g_new0(CONFIG_NODE, 1);
|
|
parent->value = g_slist_append(parent->value, node);
|
|
|
|
node->type = no_key ? NODE_TYPE_VALUE : NODE_TYPE_KEY;
|
|
node->key = no_key ? NULL : g_strdup(key);
|
|
}
|
|
|
|
node->value = g_strdup(value);
|
|
rec->modifycounter++;
|
|
}
|
|
|
|
void config_node_set_int(CONFIG_REC *rec, CONFIG_NODE *parent, const char *key, int value)
|
|
{
|
|
char str[MAX_INT_STRLEN];
|
|
|
|
g_snprintf(str, sizeof(str), "%d", value);
|
|
config_node_set_str(rec, parent, key, str);
|
|
}
|
|
|
|
void config_node_set_bool(CONFIG_REC *rec, CONFIG_NODE *parent, const char *key, int value)
|
|
{
|
|
config_node_set_str(rec, parent, key, value ? "yes" : "no");
|
|
}
|
|
|
|
int config_set_str(CONFIG_REC *rec, const char *section, const char *key, const char *value)
|
|
{
|
|
CONFIG_NODE *parent;
|
|
|
|
g_return_val_if_fail(rec != NULL, -1);
|
|
|
|
parent = config_node_traverse(rec, section, TRUE);
|
|
if (parent == NULL) return -1;
|
|
|
|
config_node_set_str(rec, parent, key, value);
|
|
return 0;
|
|
}
|
|
|
|
int config_set_int(CONFIG_REC *rec, const char *section, const char *key, int value)
|
|
{
|
|
char str[MAX_INT_STRLEN];
|
|
|
|
g_snprintf(str, sizeof(str), "%d", value);
|
|
return config_set_str(rec, section, key, str);
|
|
}
|
|
|
|
int config_set_bool(CONFIG_REC *rec, const char *section, const char *key, int value)
|
|
{
|
|
return config_set_str(rec, section, key, value ? "yes" : "no");
|
|
}
|
|
|
|
void config_node_add_list(CONFIG_REC *rec, CONFIG_NODE *node, char **array)
|
|
{
|
|
char **tmp;
|
|
|
|
for (tmp = array; *tmp != NULL; tmp++)
|
|
config_node_set_str(rec, node, NULL, *tmp);
|
|
}
|