mirror of
https://github.com/radareorg/radare2.git
synced 2024-12-05 12:08:24 +00:00
145 lines
2.9 KiB
C
145 lines
2.9 KiB
C
/* radare - LGPL - Copyright 2007-2015 - ret2libc */
|
|
|
|
#include <r_util.h>
|
|
|
|
static void tree_dfs_node (RTreeNode *r, RTreeVisitor *vis) {
|
|
RStack *s;
|
|
RListIter *it;
|
|
RTreeNode *n;
|
|
|
|
s = r_stack_new (16);
|
|
r_stack_push (s, r);
|
|
while (!r_stack_is_empty (s)) {
|
|
RTreeNode *el = (RTreeNode *)r_stack_pop (s);
|
|
|
|
if (vis->pre_visit)
|
|
vis->pre_visit (el, vis);
|
|
|
|
r_list_foreach_prev (el->children, it, n) {
|
|
if (vis->discover_child)
|
|
vis->discover_child (n, vis);
|
|
r_stack_push (s, n);
|
|
}
|
|
|
|
if (vis->post_visit)
|
|
vis->post_visit (el, vis);
|
|
}
|
|
|
|
r_stack_free (s);
|
|
}
|
|
|
|
static void r_tree_node_free (RTreeNode *n) {
|
|
r_list_free (n->children);
|
|
if (n->free)
|
|
n->free (n->data);
|
|
free (n);
|
|
}
|
|
|
|
static void node_free (RTreeNode *n, RTreeVisitor *vis) {
|
|
r_tree_node_free (n);
|
|
}
|
|
|
|
static void free_all_children (RTree *t) {
|
|
RTreeVisitor vis = { 0 };
|
|
vis.post_visit = (RTreeNodeVisitCb)node_free;
|
|
r_tree_bfs (t, &vis);
|
|
}
|
|
|
|
static void update_depth (RTreeNode *n, RTreeVisitor *vis) {
|
|
n->depth = n->parent ? n->parent->depth + 1 : 0;
|
|
}
|
|
|
|
static RTreeNode *node_new (RTree *t, void *data) {
|
|
RTreeNode *n = R_NEW0 (RTreeNode);
|
|
if (!n) return NULL;
|
|
n->children = r_list_new ();
|
|
n->data = data;
|
|
n->tree = t;
|
|
return n;
|
|
}
|
|
|
|
R_API RTree *r_tree_new (void) {
|
|
return R_NEW0 (RTree);
|
|
}
|
|
|
|
R_API void r_tree_free (RTree* t) {
|
|
if (!t)
|
|
return;
|
|
|
|
free_all_children (t);
|
|
free (t);
|
|
}
|
|
|
|
R_API void r_tree_reset (RTree *t) {
|
|
if (!t)
|
|
return;
|
|
|
|
free_all_children (t);
|
|
t->root = NULL;
|
|
}
|
|
|
|
/* add a node in the RTree t as a child of the RTreeNode node.
|
|
* NOTE: the first call to this function, should add the root
|
|
* of the tree so the node will be NULL. */
|
|
/* TODO: allow to replace the root of the tree and make it a child of the new
|
|
* node */
|
|
R_API RTreeNode *r_tree_add_node (RTree *t, RTreeNode *node, void *child_data) {
|
|
RTreeNode *child;
|
|
RTreeVisitor vis = { 0 };
|
|
|
|
/* a NULL node is allowed only the first time, to set the root */
|
|
if (!t || (node && node->tree != t) || (t->root && !node))
|
|
return NULL;
|
|
|
|
child = node_new (t, child_data);
|
|
if (!node && !t->root) {
|
|
t->root = child;
|
|
} else if (node) {
|
|
r_list_append (node->children, child);
|
|
node->n_children++;
|
|
}
|
|
child->parent = node;
|
|
|
|
/* update depth */
|
|
vis.pre_visit = (RTreeNodeVisitCb)update_depth;
|
|
tree_dfs_node (child, &vis);
|
|
|
|
return child;
|
|
}
|
|
|
|
R_API void r_tree_dfs (RTree *t, RTreeVisitor *vis) {
|
|
if (!t || !t->root)
|
|
return;
|
|
|
|
tree_dfs_node (t->root, vis);
|
|
}
|
|
|
|
R_API void r_tree_bfs (RTree *t, RTreeVisitor *vis) {
|
|
RQueue *q;
|
|
|
|
if (!t || !t->root)
|
|
return;
|
|
|
|
q = r_queue_new (16);
|
|
r_queue_enqueue (q, t->root);
|
|
while (!r_queue_is_empty (q)) {
|
|
RTreeNode *el = (RTreeNode *)r_queue_dequeue (q);
|
|
RTreeNode *n;
|
|
RListIter *it;
|
|
|
|
if (vis->pre_visit)
|
|
vis->pre_visit (el, vis);
|
|
|
|
r_list_foreach (el->children, it, n) {
|
|
if (vis->discover_child)
|
|
vis->discover_child (n, vis);
|
|
r_queue_enqueue (q, n);
|
|
}
|
|
|
|
if (vis->post_visit)
|
|
vis->post_visit (el, vis);
|
|
}
|
|
|
|
r_queue_free (q);
|
|
}
|