[rtems commit] score: Add const qualifier

[Sebastian Huber]

Module:    rtems
Branch:    master
Commit:    0ca6172722e70acac106816cb69a752ce389a61a
Changeset: http://git.rtems.org/rtems/commit/?id=0ca6172722e70acac106816cb69a752ce389a61a

Author:    Sebastian Huber <sebastian.huber at embedded-brains.de>
Date:      Sat Dec 22 17:58:50 2012 +0100

score: Add const qualifier

---

 cpukit/sapi/inline/rtems/rbtree.inl       |    8 ++++----
 cpukit/score/include/rtems/score/rbtree.h |    8 ++++----
 cpukit/score/src/rbtreefind.c             |    8 ++++----
 3 files changed, 12 insertions(+), 12 deletions(-)

diff --git a/cpukit/sapi/inline/rtems/rbtree.inl b/cpukit/sapi/inline/rtems/rbtree.inl
index dc53fa0..f7983ad 100644
--- a/cpukit/sapi/inline/rtems/rbtree.inl
+++ b/cpukit/sapi/inline/rtems/rbtree.inl
@@ -255,8 +255,8 @@ RTEMS_INLINE_ROUTINE bool rtems_rbtree_is_root(
  * @copydoc _RBTree_Find_unprotected()
  */
 RTEMS_INLINE_ROUTINE rtems_rbtree_node* rtems_rbtree_find_unprotected(
-    rtems_rbtree_control *the_rbtree,
-    rtems_rbtree_node *the_node
+  const rtems_rbtree_control *the_rbtree,
+  const rtems_rbtree_node *the_node
 )
 {
   return _RBTree_Find_unprotected( the_rbtree, the_node );
@@ -272,8 +272,8 @@ RTEMS_INLINE_ROUTINE rtems_rbtree_node* rtems_rbtree_find_unprotected(
  *        of duplicate keys acts as FIFO.
  */
 RTEMS_INLINE_ROUTINE rtems_rbtree_node* rtems_rbtree_find(
-  rtems_rbtree_control *the_rbtree,
-  rtems_rbtree_node *the_node
+  const rtems_rbtree_control *the_rbtree,
+  const rtems_rbtree_node *the_node
 )
 {
   return _RBTree_Find( the_rbtree, the_node );
diff --git a/cpukit/score/include/rtems/score/rbtree.h b/cpukit/score/include/rtems/score/rbtree.h
index db26e59..7b86d29 100644
--- a/cpukit/score/include/rtems/score/rbtree.h
+++ b/cpukit/score/include/rtems/score/rbtree.h
@@ -234,8 +234,8 @@ RBTree_Node *_RBTree_Get(
  *        of duplicate keys acts as FIFO.
  */
 RBTree_Node *_RBTree_Find_unprotected(
-  RBTree_Control *the_rbtree,
-  RBTree_Node *the_node
+  const RBTree_Control *the_rbtree,
+  const RBTree_Node *the_node
 );
 
 /**
@@ -255,8 +255,8 @@ RBTree_Node *_RBTree_Find_unprotected(
  *    + single case
  */
 RBTree_Node *_RBTree_Find(
-  RBTree_Control *the_rbtree,
-  RBTree_Node *the_node
+  const RBTree_Control *the_rbtree,
+  const RBTree_Node *the_node
 );
 
 /**
diff --git a/cpukit/score/src/rbtreefind.c b/cpukit/score/src/rbtreefind.c
index 3f205ab..2eb92a5 100644
--- a/cpukit/score/src/rbtreefind.c
+++ b/cpukit/score/src/rbtreefind.c
@@ -23,8 +23,8 @@
 #include <rtems/score/isr.h>
 
 RBTree_Node *_RBTree_Find(
-  RBTree_Control *the_rbtree,
-  RBTree_Node *search_node
+  const RBTree_Control *the_rbtree,
+  const RBTree_Node *search_node
 )
 {
   ISR_Level          level;
@@ -38,8 +38,8 @@ RBTree_Node *_RBTree_Find(
 }
 
 RBTree_Node *_RBTree_Find_unprotected(
-  RBTree_Control *the_rbtree,
-  RBTree_Node *the_node
+  const RBTree_Control *the_rbtree,
+  const RBTree_Node *the_node
 )
 {
   RBTree_Node* iter_node = the_rbtree->root;