Add the function cil_tree_node_remove() which takes a node pointer
as an input, finds the parent, walks the list of nodes to the node
prior to the given node, updates that node's next pointer to remove
the given node from the tree, and then destroys the node.
Signed-off-by: James Carter <jwcart2@xxxxxxxxx>
---
v2:
Renamed cil_tree_remove_node() as cil_tree_node_remove() to fit the naming
convention in cil_tree.c
Have cil_tree_node_remove() call cil_tree_node_destroy() to destroy the
node after it has been removed as suggested by Daniel Burgener.
libsepol/cil/src/cil_tree.c | 28 ++++++++++++++++++++++++++++
libsepol/cil/src/cil_tree.h | 1 +
2 files changed, 29 insertions(+)
diff --git a/libsepol/cil/src/cil_tree.c b/libsepol/cil/src/cil_tree.c
index 6376c208..f2703a75 100644
--- a/libsepol/cil/src/cil_tree.c
+++ b/libsepol/cil/src/cil_tree.c
@@ -248,6 +248,34 @@ void cil_tree_node_destroy(struct cil_tree_node **node)
*node = NULL;
}
+void cil_tree_node_remove(struct cil_tree_node *node)
+{
+ struct cil_tree_node *parent, *curr;
+
+ if (node == NULL || node->parent == NULL) {
+ return;
+ }
+
+ parent = node->parent;
+
+ if (parent->cl_head == node) {
+ parent->cl_head = node->next;
+ return;
+ }
+
+ curr = parent->cl_head;
+ while (curr && curr->next != node) {
+ curr = curr->next;
+ }
+
+ if (curr == NULL) {
+ return;
+ }
+
+ curr->next = node->next;
+ cil_tree_node_destroy(&node);
+}
+
/* Perform depth-first walk of the tree
Parameters:
start_node: root node to start walking from
diff --git a/libsepol/cil/src/cil_tree.h b/libsepol/cil/src/cil_tree.h
index 5a98da55..cb6a0d24 100644
--- a/libsepol/cil/src/cil_tree.h
+++ b/libsepol/cil/src/cil_tree.h
@@ -63,6 +63,7 @@ void cil_tree_children_destroy(struct cil_tree_node *node);
void cil_tree_node_init(struct cil_tree_node **node);
void cil_tree_node_destroy(struct cil_tree_node **node);
+void cil_tree_node_remove(struct cil_tree_node *node);
//finished values
#define CIL_TREE_SKIP_NOTHING 0
--
2.39.2
