add function to convert tree structure to graphviz tree (DOT file)

util.c

@@ -65,11 +65,112 @@ void wm_treenode_split_space(TreeNode *node, Rect *ret1, Rect *ret2)
     }
 }
 
+void wm_node_type_to_str(NodeType type, char *buf, size_t bufsize)
+{
+    switch (type) {
+    case NODE_CLIENT:
+        strncpy(buf, "NODE_CLIENT", bufsize);
+        return;
+    case NODE_VERTICAL:
+        strncpy(buf, "NODE_VERTICAL", bufsize);
+        return;
+    case NODE_HORIZONTAL:
+        strncpy(buf, "NODE_HORIZONTAL", bufsize);
+        return;
+    case NODE_TAB:
+        strncpy(buf, "NODE_TAB", bufsize);
+        return;
+    case NODE_COUNT:
+        return;
+    }
+}
+
+void wm_tree_to_DOT(TreeNode *root, const char *filename)
+{
+    DEBUG_PRINT("%s\n", __func__);
+
+    FILE *fp = fopen(filename, "w");
+    assert(fp);
+
+    fprintf(fp, "digraph {\n");
+
+    PtrArray all_nodes = wm_all_nodes_to_ptrarray(root);
+    NodeArray printed_nodes = wm_nodearray_new();
+
+    const int bufsize = 100;
+    char buf1[bufsize];
+    char buf2[bufsize];
+
+    for (size_t i = 0; i < all_nodes.size; i++) {
+        TreeNode *node = all_nodes.ptrs[i];
+
+        bool contains = false;
+        for (size_t j = 0; j < printed_nodes.size; j++) {
+            if (printed_nodes.nodes[i].id == node->id)
+                contains = true;
+        }
+
+        if (contains)
+            continue;
+
+        for (size_t j = 0; j < node->children.size; j++) {
+            memset(buf1, 0, bufsize);
+            memset(buf2, 0, bufsize);
+
+            wm_node_type_to_str(node->type, buf1, bufsize);
+            wm_node_type_to_str(node->children.nodes[j].type, buf2, bufsize);
+
+            fprintf(fp, "_%d_%s -> _%d_%s;\n", node->id, buf1,
+                    node->children.nodes[j].id, buf2);
+        }
+        wm_nodearray_push(&printed_nodes, *node);
+    }
+
+    fprintf(fp, "}");
+
+    fflush(fp);
+    fclose(fp);
+
+    wm_nodearray_free(&printed_nodes);
+    wm_ptrarray_free(&all_nodes);
+}
+
+int wm_get_node_index(TreeNode *parent, unsigned int node_id)
+{
+    for (size_t i = 0; i < parent->children.size; i++) {
+        if (node_id == parent->children.nodes[i].id)
+            return i;
+    }
+
+    return -1;
+}
+
+void wm_treenode_remove_node(TreeNode *root, unsigned int node_id)
+{
+    DEBUG_PRINT("%s\n", __func__);
+    assert(root);
+
+    PtrArray all_nodes = wm_all_nodes_to_ptrarray(root);
+
+    for (size_t i = 0; i < all_nodes.size; i++) {
+        TreeNode *node = all_nodes.ptrs[i];
+        if (node->id == node_id) {
+            TreeNode *parent = node->parent;
+            int index = wm_get_node_index(parent, node_id);
+            assert(index >= 0);
+
+            wm_nodearray_remove(&parent->children, index);
+        }
+    }
+}
+
 TreeNode* wm_treenode_remove_client(TreeNode *root, Client *client)
 {
     DEBUG_PRINT("%s\n", __func__);
     TreeNode *client_node = wm_treenode_ptr_find_client_node(root, client);
 
+    wm_tree_to_DOT(root, "wm_output.dot");
+
     if (client_node->parent == NULL) {
         client_node->client = NULL;
         wm_nodearray_clear(&client_node->children);
@@ -87,6 +188,12 @@ TreeNode* wm_treenode_remove_client(TreeNode *root, Client *client)
         }
     }
 
+    if (other_client == NULL) {
+        DEBUG_PRINT("%s: other_client was NULL!\n", __func__);
+
+        // todo
+    }
+
     node->client = other_client;
     wm_nodearray_clear(&node->children);
 
@@ -456,6 +563,52 @@ ret:
     return ret;
 }
 
+PtrArray wm_all_nodes_to_ptrarray(TreeNode *root)
+{
+    DEBUG_PRINT("%s\n", __func__);
+    assert(root);
+
+    PtrArray ret = wm_ptrarray_new();
+
+    NodeArray visited = wm_nodearray_new();
+    wm_nodearray_push(&visited, *root);
+
+    PtrArray queue = wm_ptrarray_new();
+
+    wm_ptrarray_push(&queue, root);
+
+    while (queue.size > 0) {
+        TreeNode *node;
+
+        if (!wm_ptrarray_pop_front(&queue, (void**)&node))
+            goto ret;
+
+        wm_ptrarray_push(&ret, node);
+
+        for (int i = 0; i < node->children.size; i++) {
+            TreeNode *child_node = &node->children.nodes[i];
+            bool _visited = false;
+
+            for (int j = 0; j < visited.size; j++) {
+                if (visited.nodes[j].id == child_node->id) {
+                    _visited = true;
+                    break;
+                }
+            }
+
+            if (!_visited) {
+                wm_nodearray_push(&visited, *child_node);
+                wm_ptrarray_push(&queue, child_node);
+            }
+        }
+    }
+
+ret:
+    wm_nodearray_free(&visited);
+    wm_ptrarray_free(&queue);
+    return ret;
+}
+
 ClientArray wm_clientarray_new()
 {
     ClientArray arr;

util.h

@@ -66,6 +66,10 @@ TreeNode wm_treenode_new(NodeType type, TreeNode *parent);
 bool wm_treenode_is_empty(TreeNode *node);
 void wm_treenode_split_space(TreeNode *node, Rect *ret1, Rect *ret2);
 TreeNode* wm_treenode_remove_client(TreeNode *root, Client *client);
+void wm_treenode_remove_node(TreeNode *root, unsigned int node_id);
+int wm_get_node_index(TreeNode *parent, unsigned int node_id);
+void wm_tree_to_DOT(TreeNode *root, const char *filename);
+void wm_node_type_to_str(NodeType type, char *buf, size_t bufsize);
 
 NodeArray wm_nodearray_new();
 void wm_nodearray_push(NodeArray *arr, TreeNode node);
@@ -86,6 +90,7 @@ void wm_ptrarray_free(PtrArray *arr);
 TreeNode* wm_treenode_ptr_find_focused_client_node(TreeNode *root);
 TreeNode* wm_treenode_ptr_find_client_node(TreeNode *root, Client *client);
 PtrArray wm_treenode_find_client_nodes_ptr(TreeNode *root);
+PtrArray wm_all_nodes_to_ptrarray(TreeNode *root);
 
 ClientArray wm_clientarray_new();
 void wm_clientarray_push(ClientArray *arr, Client node);