diff options
| author | Ralf Corsepius <ralf.corsepius@rtems.org> | 2006-12-04 14:31:32 +0000 |
|---|---|---|
| committer | Ralf Corsepius <ralf.corsepius@rtems.org> | 2006-12-04 14:31:32 +0000 |
| commit | 852d53f7a7a5d93e23a3a51ed3b878f8a551405c (patch) | |
| tree | 352a59ed6f8c16d8a16afd2abf84108ff4e1186f /cpukit | |
| parent | 2006-12-04 Joel Sherrill <joel.sherrill@oarcorp.com> (diff) | |
| download | rtems-852d53f7a7a5d93e23a3a51ed3b878f8a551405c.tar.bz2 | |
2006-12-04 Ralf Corsépius <ralf.corsepius@rtems.org>
* score/inline/rtems/score/chain.inl: Add const qualifiers (works
around 651 aliasing bugs).
Diffstat (limited to 'cpukit')
| -rw-r--r-- | cpukit/ChangeLog | 5 | ||||
| -rw-r--r-- | cpukit/score/inline/rtems/score/chain.inl | 12 |
2 files changed, 11 insertions, 6 deletions
diff --git a/cpukit/ChangeLog b/cpukit/ChangeLog index aa47a2e91f..6b400bedff 100644 --- a/cpukit/ChangeLog +++ b/cpukit/ChangeLog @@ -1,3 +1,8 @@ +2006-12-04 Ralf Corsépius <ralf.corsepius@rtems.org> + + * score/inline/rtems/score/chain.inl: Add const qualifiers (works + around 651 aliasing bugs). + 2006-12-04 Joel Sherrill <joel.sherrill@oarcorp.com> * posix/src/prwlockunlock.c, rtems/Makefile.am, diff --git a/cpukit/score/inline/rtems/score/chain.inl b/cpukit/score/inline/rtems/score/chain.inl index d394ec93e1..c309c739e2 100644 --- a/cpukit/score/inline/rtems/score/chain.inl +++ b/cpukit/score/inline/rtems/score/chain.inl @@ -71,7 +71,7 @@ RTEMS_INLINE_ROUTINE boolean _Chain_Is_null( * @return This method returns TRUE if the_node is NULL and FALSE otherwise. */ RTEMS_INLINE_ROUTINE boolean _Chain_Is_null_node( - Chain_Node *the_node + const Chain_Node *the_node ) { return (the_node == NULL); @@ -136,7 +136,7 @@ RTEMS_INLINE_ROUTINE boolean _Chain_Is_empty( * a chain and FALSE otherwise. */ RTEMS_INLINE_ROUTINE boolean _Chain_Is_first( - Chain_Node *the_node + const Chain_Node *the_node ) { return (the_node->previous == NULL); @@ -153,7 +153,7 @@ RTEMS_INLINE_ROUTINE boolean _Chain_Is_first( * a chain and FALSE otherwise. */ RTEMS_INLINE_ROUTINE boolean _Chain_Is_last( - Chain_Node *the_node + const Chain_Node *the_node ) { return (the_node->next == NULL); @@ -170,7 +170,7 @@ RTEMS_INLINE_ROUTINE boolean _Chain_Is_last( * @a the_chain and FALSE otherwise. */ RTEMS_INLINE_ROUTINE boolean _Chain_Has_only_one_node( - Chain_Control *the_chain + const Chain_Control *the_chain ) { return (the_chain->first == the_chain->last); @@ -189,7 +189,7 @@ RTEMS_INLINE_ROUTINE boolean _Chain_Has_only_one_node( */ RTEMS_INLINE_ROUTINE boolean _Chain_Is_head( Chain_Control *the_chain, - Chain_Node *the_node + const Chain_Node *the_node ) { return (the_node == _Chain_Head(the_chain)); @@ -205,7 +205,7 @@ RTEMS_INLINE_ROUTINE boolean _Chain_Is_head( */ RTEMS_INLINE_ROUTINE boolean _Chain_Is_tail( Chain_Control *the_chain, - Chain_Node *the_node + const Chain_Node *the_node ) { return (the_node == _Chain_Tail(the_chain)); |