score/rbtree: Delete protected operations

The user of the red-black tree container must now ensure that at most
one thread at once can access an instance.

1 files changed, 0 insertions, 31 deletions

diff --git a/cpukit/score/src/rbtreeinsert.c b/cpukit/score/src/rbtreeinsert.c
index 0d8e4a6dc4..a2f6f09ab3 100644
--- a/cpukit/score/src/rbtreeinsert.c
+++ b/cpukit/score/src/rbtreeinsert.c
@@ -122,34 +122,3 @@ RBTree_Node *_RBTree_Insert_unprotected(
   }
   return (RBTree_Node*)0;
 }
-
-
-/*
- *  _RBTree_Insert
- *
- *  This kernel routine inserts a given node after a specified node
- *  a requested rbtree.
- *
- *  Input parameters:
- *    tree - pointer to RBTree Control for tree to insert to
- *    node       - pointer to node to be inserted
- *
- *  Output parameters:  NONE
- *
- *  INTERRUPT LATENCY:
- *    only case
- */
-
-RBTree_Node *_RBTree_Insert(
-  RBTree_Control *tree,
-  RBTree_Node *node
-)
-{
-  ISR_Level level;
-  RBTree_Node *return_node;
-
-  _ISR_Disable( level );
-  return_node = _RBTree_Insert_unprotected( tree, node );
-  _ISR_Enable( level );
-  return return_node;
-}