|
|
@ -145,7 +145,7 @@ ConfNodeFree(ConfNode *node)
|
|
|
|
{
|
|
|
|
{
|
|
|
|
ConfNode *tmp;
|
|
|
|
ConfNode *tmp;
|
|
|
|
|
|
|
|
|
|
|
|
while (tmp = TAILQ_FIRST(&node->head)) {
|
|
|
|
while ((tmp = TAILQ_FIRST(&node->head))) {
|
|
|
|
TAILQ_REMOVE(&node->head, tmp, next);
|
|
|
|
TAILQ_REMOVE(&node->head, tmp, next);
|
|
|
|
ConfNodeFree(tmp);
|
|
|
|
ConfNodeFree(tmp);
|
|
|
|
}
|
|
|
|
}
|
|
|
@ -399,7 +399,7 @@ ConfDeInit(void)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static char *
|
|
|
|
static char *
|
|
|
|
ConfPrintNameArray(const char **name_arr, int level)
|
|
|
|
ConfPrintNameArray(char **name_arr, int level)
|
|
|
|
{
|
|
|
|
{
|
|
|
|
static char name[128*128];
|
|
|
|
static char name[128*128];
|
|
|
|
int i;
|
|
|
|
int i;
|
|
|
@ -773,7 +773,7 @@ ConfNodeLookupChildValueTest(void)
|
|
|
|
|
|
|
|
|
|
|
|
ConfNode *parent = ConfNodeNew();
|
|
|
|
ConfNode *parent = ConfNodeNew();
|
|
|
|
ConfNode *child;
|
|
|
|
ConfNode *child;
|
|
|
|
char *value;
|
|
|
|
const char *value;
|
|
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < sizeof(test_vals)/sizeof(test_vals[0]); i++) {
|
|
|
|
for (i = 0; i < sizeof(test_vals)/sizeof(test_vals[0]); i++) {
|
|
|
|
child = ConfNodeNew();
|
|
|
|
child = ConfNodeNew();
|
|
|
|