probably a better name...

src/vdp_pesi.c

@@ -497,7 +497,7 @@ node_fini(struct req *req, struct node *node)
 
 /* recursively free all nodes == free the tree */
 static void
-node_free(struct req *req, struct node *node)
+tree_free(struct req *req, struct node *node)
 {
 	struct node *child, *tmp;
 
@@ -506,7 +506,7 @@ node_free(struct req *req, struct node *node)
 
 	if (node->type == T_NEXUS)
 		VSTAILQ_FOREACH_SAFE(child, &node->nexus.children, sibling, tmp)
-			node_free(req, child);
+			tree_free(req, child);
 
 	node_fini(req, node);
 	MPL_Free(mempool, node);
@@ -1607,7 +1607,7 @@ bytes_push_worklist(struct req *req, struct bytes_tree *tree,
 	}
 
 	/* not running the finis in the error case, they
-	 * will be called from final cleanup via node_free()
+	 * will be called from final cleanup via tree_free()
 	 *
 	 * this avoids waiting for subreq tasks
 	 */
@@ -2075,7 +2075,7 @@ vdp_pesi_fini(struct req *req, void **priv)
 	Lck_Delete(&bytes_tree->tree_lock);
 	AZ(pthread_cond_destroy(&bytes_tree->cond));
 
-	node_free(req, bytes_tree->root);
+	tree_free(req, bytes_tree->root);
 
 	*priv = NULL;
 	return (0);