static GNode *
xmms_magic_add_node (GNode *tree, const gchar *s, GNode *prev_node)
{
xmms_magic_entry_t *entry;
gpointer *data = tree->data;
guint indent = 0, prev_indent;
g_assert (s);
XMMS_DBG ("adding magic spec to tree '%s'", (gchar *) data[0]);
/* indent level is number of leading '>' characters */
while (*s == '>') {
indent++;
s++;
}
entry = parse_entry (s);
if (!entry) {
XMMS_DBG ("cannot parse magic entry");
return NULL;
}
if (!indent) {
return g_node_append_data (tree, entry);
}
if (!prev_node) {
XMMS_DBG ("invalid indent level");
xmms_magic_entry_free (entry);
return NULL;
}
prev_indent = g_node_depth (prev_node) - 2;
if (indent > prev_indent) {
/* larger jumps are invalid */
if (indent != prev_indent + 1) {
XMMS_DBG ("invalid indent level");
xmms_magic_entry_free (entry);
return NULL;
}
return g_node_append_data (prev_node, entry);
} else {
while (indent < prev_indent) {
prev_indent--;
prev_node = prev_node->parent;
}
return g_node_insert_after (prev_node->parent, prev_node,
g_node_new (entry));
}
}
gboolean
sort_func_priority_extended(GNode *node, gpointer data)
{
struct VyattaNode *gp = (struct VyattaNode *) node->data;
struct Config *gcfg = &(gp->_config);
GNode *root_node = (GNode*)data;
//WILL STOP AT DEPTH OF 10 REFERENCES
//GET PARENT WORKING FIRST....
//change action state of node according to enclosing behavior
if (gcfg->_priority_extended) {
//only if priority is specified.
GNode *new_node = g_node_copy(node);
//NOW, we need to figure out where this node belongs in the priority chain
if (strncmp(gcfg->_priority_extended, "PARENT", 6) == 0) {
//needs to walk up parents until priority is found and insert there....
GNode *n = node;
while (TRUE) {
n = n->parent;
if (n == NULL) {
break;
}
gpointer nd = ((GNode*)n)->data;
if (((struct VyattaNode*)nd)->_config._priority != LOWEST_PRIORITY) {
//means we are done--found anchor in parent
g_node_unlink(node);
if (IS_DELETE(gp->_data._operation)) {
g_node_insert_before(root_node,n,new_node);
}
else {
g_node_insert_after(root_node,n,new_node);
}
break;
}
}
}
}
return FALSE;
}
