change log for rtems (2010-11-25)

rtems-vc at rtems.org rtems-vc at rtems.org
Thu Nov 25 10:11:14 UTC 2010


 *sh*:
2010-11-25	Sebastian Huber <sebastian.huber at embedded-brains.de>

	* libfs/src/dosfs/fat_file.c, libfs/src/imfs/imfs_debug.c,
	libfs/src/imfs/imfs_directory.c, libfs/src/imfs/imfs_getchild.c,
	posix/src/killinfo.c, score/inline/rtems/score/schedulerpriority.inl,
	score/inline/rtems/score/watchdog.inl, score/src/apiext.c,
	score/src/chain.c, score/src/coremsgflushsupp.c,
	score/src/coremsginsert.c, score/src/objectshrinkinformation.c,
	score/src/schedulerpriorityyield.c,
	score/src/threadqdequeuepriority.c,
	score/src/threadqenqueuepriority.c,
	score/src/threadqextractpriority.c, score/src/threadqfirstfifo.c,
	score/src/threadqfirstpriority.c, score/src/threadyieldprocessor.c,
	score/src/userextthreadbegin.c, score/src/userextthreadcreate.c,
	score/src/userextthreaddelete.c, score/src/userextthreadrestart.c,
	score/src/userextthreadstart.c, score/src/userextthreadswitch.c,
	score/src/watchdogreportchain.c: Avoid chain API violations.

M 1.2656  cpukit/ChangeLog
M   1.18  cpukit/libfs/src/dosfs/fat_file.c
M   1.18  cpukit/libfs/src/imfs/imfs_debug.c
M   1.28  cpukit/libfs/src/imfs/imfs_directory.c
M   1.13  cpukit/libfs/src/imfs/imfs_getchild.c
M   1.27  cpukit/posix/src/killinfo.c
M    1.2  cpukit/score/inline/rtems/score/schedulerpriority.inl
M   1.19  cpukit/score/inline/rtems/score/watchdog.inl
M   1.16  cpukit/score/src/apiext.c
M   1.19  cpukit/score/src/chain.c
M   1.10  cpukit/score/src/coremsgflushsupp.c
M   1.12  cpukit/score/src/coremsginsert.c
M   1.10  cpukit/score/src/objectshrinkinformation.c
M    1.2  cpukit/score/src/schedulerpriorityyield.c
M   1.10  cpukit/score/src/threadqdequeuepriority.c
M   1.12  cpukit/score/src/threadqenqueuepriority.c
M   1.11  cpukit/score/src/threadqextractpriority.c
M    1.7  cpukit/score/src/threadqfirstfifo.c
M    1.7  cpukit/score/src/threadqfirstpriority.c
M    1.7  cpukit/score/src/threadyieldprocessor.c
M    1.5  cpukit/score/src/userextthreadbegin.c
M    1.5  cpukit/score/src/userextthreadcreate.c
M    1.3  cpukit/score/src/userextthreaddelete.c
M    1.3  cpukit/score/src/userextthreadrestart.c
M    1.3  cpukit/score/src/userextthreadstart.c
M    1.4  cpukit/score/src/userextthreadswitch.c
M    1.2  cpukit/score/src/watchdogreportchain.c

diff -u rtems/cpukit/ChangeLog:1.2655 rtems/cpukit/ChangeLog:1.2656
--- rtems/cpukit/ChangeLog:1.2655	Wed Nov 24 09:51:26 2010
+++ rtems/cpukit/ChangeLog	Thu Nov 25 03:27:05 2010
@@ -1,3 +1,21 @@
+2010-11-25	Sebastian Huber <sebastian.huber at embedded-brains.de>
+
+	* libfs/src/dosfs/fat_file.c, libfs/src/imfs/imfs_debug.c,
+	libfs/src/imfs/imfs_directory.c, libfs/src/imfs/imfs_getchild.c,
+	posix/src/killinfo.c, score/inline/rtems/score/schedulerpriority.inl,
+	score/inline/rtems/score/watchdog.inl, score/src/apiext.c,
+	score/src/chain.c, score/src/coremsgflushsupp.c,
+	score/src/coremsginsert.c, score/src/objectshrinkinformation.c,
+	score/src/schedulerpriorityyield.c,
+	score/src/threadqdequeuepriority.c,
+	score/src/threadqenqueuepriority.c,
+	score/src/threadqextractpriority.c, score/src/threadqfirstfifo.c,
+	score/src/threadqfirstpriority.c, score/src/threadyieldprocessor.c,
+	score/src/userextthreadbegin.c, score/src/userextthreadcreate.c,
+	score/src/userextthreaddelete.c, score/src/userextthreadrestart.c,
+	score/src/userextthreadstart.c, score/src/userextthreadswitch.c,
+	score/src/watchdogreportchain.c: Avoid chain API violations.
+
 2010-11-24	Gedare Bloom <giddyup44 at yahoo.com>
 
 	PR 1647/cpukit

diff -u rtems/cpukit/libfs/src/dosfs/fat_file.c:1.17 rtems/cpukit/libfs/src/dosfs/fat_file.c:1.18
--- rtems/cpukit/libfs/src/dosfs/fat_file.c:1.17	Mon Aug 23 18:17:42 2010
+++ rtems/cpukit/libfs/src/dosfs/fat_file.c	Thu Nov 25 03:27:05 2010
@@ -926,7 +926,7 @@
     )
 {
     uint32_t          mod = (key1) % FAT_HASH_MODULE;
-    rtems_chain_node *the_node = ((rtems_chain_control *)((hash) + mod))->first;
+    rtems_chain_node *the_node = rtems_chain_first(hash + mod);
 
     for ( ; !rtems_chain_is_tail((hash) + mod, the_node) ; )
     {

diff -u rtems/cpukit/libfs/src/imfs/imfs_debug.c:1.17 rtems/cpukit/libfs/src/imfs/imfs_debug.c:1.18
--- rtems/cpukit/libfs/src/imfs/imfs_debug.c:1.17	Fri Jul 30 17:36:32 2010
+++ rtems/cpukit/libfs/src/imfs/imfs_debug.c	Thu Nov 25 03:27:05 2010
@@ -114,7 +114,7 @@
 
   the_chain = &the_directory->info.directory.Entries;
 
-  for ( the_node = the_chain->first;
+  for ( the_node = rtems_chain_first( the_chain );
         !rtems_chain_is_tail( the_chain, the_node );
         the_node = the_node->next ) {
 

diff -u rtems/cpukit/libfs/src/imfs/imfs_directory.c:1.27 rtems/cpukit/libfs/src/imfs/imfs_directory.c:1.28
--- rtems/cpukit/libfs/src/imfs/imfs_directory.c:1.27	Thu Jul 15 03:10:48 2010
+++ rtems/cpukit/libfs/src/imfs/imfs_directory.c	Thu Nov 25 03:27:05 2010
@@ -97,7 +97,7 @@
       return 0;
 
    /* Move to the first of the desired directory entries */
-   the_node = the_chain->first;
+   the_node = rtems_chain_first( the_chain );
 
    bytes_transferred = 0;
    first_entry = iop->offset;
@@ -263,7 +263,7 @@
 
    /* Run through the chain and count the number of directory entries */
    /* that are subordinate to this directory node                     */
-   for ( the_node = the_chain->first ;
+   for ( the_node = rtems_chain_first( the_chain );
          !rtems_chain_is_tail( the_chain, the_node ) ;
          the_node = the_node->next ) {
 

diff -u rtems/cpukit/libfs/src/imfs/imfs_getchild.c:1.12 rtems/cpukit/libfs/src/imfs/imfs_getchild.c:1.13
--- rtems/cpukit/libfs/src/imfs/imfs_getchild.c:1.12	Fri Jul 30 17:36:32 2010
+++ rtems/cpukit/libfs/src/imfs/imfs_getchild.c	Thu Nov 25 03:27:05 2010
@@ -52,7 +52,7 @@
 
   the_chain = &directory->info.directory.Entries;
 
-  for ( the_node = the_chain->first;
+  for ( the_node = rtems_chain_first( the_chain );
         !rtems_chain_is_tail( the_chain, the_node );
         the_node = the_node->next ) {
 

diff -u rtems/cpukit/posix/src/killinfo.c:1.26 rtems/cpukit/posix/src/killinfo.c:1.27
--- rtems/cpukit/posix/src/killinfo.c:1.26	Sun Aug 29 14:50:33 2010
+++ rtems/cpukit/posix/src/killinfo.c	Thu Nov 25 03:27:05 2010
@@ -137,7 +137,7 @@
 
   the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo;
 
-  for ( the_node = the_chain->first ;
+  for ( the_node = _Chain_First( the_chain );
         !_Chain_Is_tail( the_chain, the_node ) ;
         the_node = the_node->next ) {
 

diff -u rtems/cpukit/score/inline/rtems/score/schedulerpriority.inl:1.1 rtems/cpukit/score/inline/rtems/score/schedulerpriority.inl:1.2
--- rtems/cpukit/score/inline/rtems/score/schedulerpriority.inl:1.1	Wed Nov 24 09:51:28 2010
+++ rtems/cpukit/score/inline/rtems/score/schedulerpriority.inl	Thu Nov 25 03:27:06 2010
@@ -138,10 +138,10 @@
   Chain_Control       *the_ready_queue
 )
 {
-  uint32_t    index = _Priority_bit_map_Get_highest();
+  Priority_Control index = _Priority_bit_map_Get_highest();
 
   if ( !_Chain_Is_empty( &the_ready_queue[ index ] ) )
-    return (Thread_Control *) the_ready_queue[ index ].first;
+    return (Thread_Control *) _Chain_First( &the_ready_queue[ index ] );
 
   return NULL;
 }

diff -u rtems/cpukit/score/inline/rtems/score/watchdog.inl:1.18 rtems/cpukit/score/inline/rtems/score/watchdog.inl:1.19
--- rtems/cpukit/score/inline/rtems/score/watchdog.inl:1.18	Mon Dec 22 03:22:17 2008
+++ rtems/cpukit/score/inline/rtems/score/watchdog.inl	Thu Nov 25 03:27:06 2010
@@ -238,7 +238,7 @@
 )
 {
 
-  return ( (Watchdog_Control *) header->first );
+  return ( (Watchdog_Control *) _Chain_First( header ) );
 
 }
 
@@ -252,7 +252,7 @@
 )
 {
 
-  return ( (Watchdog_Control *) header->last );
+  return ( (Watchdog_Control *) _Chain_Last( header ) );
 
 }
 

diff -u rtems/cpukit/score/src/apiext.c:1.15 rtems/cpukit/score/src/apiext.c:1.16
--- rtems/cpukit/score/src/apiext.c:1.15	Thu Jun 17 22:59:55 2010
+++ rtems/cpukit/score/src/apiext.c	Thu Nov 25 03:27:06 2010
@@ -52,7 +52,7 @@
     Chain_Node             *the_node;
     API_extensions_Control *the_extension;
 
-    for ( the_node = _API_extensions_List.first ;
+    for ( the_node = _Chain_First( &_API_extensions_List );
 	  !_Chain_Is_tail( &_API_extensions_List, the_node ) ;
 	  the_node = the_node->next ) {
 
@@ -74,7 +74,7 @@
   Chain_Node             *the_node;
   API_extensions_Control *the_extension;
 
-  for ( the_node = _API_extensions_List.first ;
+  for ( the_node = _Chain_First( &_API_extensions_List );
         !_Chain_Is_tail( &_API_extensions_List, the_node ) ;
         the_node = the_node->next ) {
 
@@ -100,7 +100,7 @@
   Chain_Node             *the_node;
   API_extensions_Control *the_extension;
 
-  for ( the_node = _API_extensions_List.first ;
+  for ( the_node = _Chain_First( &_API_extensions_List );
         !_Chain_Is_tail( &_API_extensions_List, the_node ) ;
         the_node = the_node->next ) {
 

diff -u rtems/cpukit/score/src/chain.c:1.18 rtems/cpukit/score/src/chain.c:1.19
--- rtems/cpukit/score/src/chain.c:1.18	Wed May  9 13:27:26 2007
+++ rtems/cpukit/score/src/chain.c	Thu Nov 25 03:27:06 2010
@@ -40,14 +40,14 @@
   size_t         node_size
 )
 {
-  size_t      count;
-  Chain_Node *current;
-  Chain_Node *next;
+  size_t count = number_nodes;
+  Chain_Node *head = _Chain_Head( the_chain );
+  Chain_Node *tail = _Chain_Tail( the_chain );
+  Chain_Node *current = head;
+  Chain_Node *next = starting_address;
+
+  head->previous = NULL;
 
-  count                     = number_nodes;
-  current                   = _Chain_Head( the_chain );
-  the_chain->permanent_null = NULL;
-  next                      = starting_address;
   while ( count-- ) {
     current->next  = next;
     next->previous = current;
@@ -55,6 +55,7 @@
     next           = (Chain_Node *)
                         _Addresses_Add_offset( (void *) next, node_size );
   }
-  current->next    = _Chain_Tail( the_chain );
-  the_chain->last  = current;
+
+  current->next = tail;
+  tail->previous = current;
 }

diff -u rtems/cpukit/score/src/coremsgflushsupp.c:1.9 rtems/cpukit/score/src/coremsgflushsupp.c:1.10
--- rtems/cpukit/score/src/coremsgflushsupp.c:1.9	Fri Sep  5 16:54:20 2008
+++ rtems/cpukit/score/src/coremsgflushsupp.c	Thu Nov 25 03:27:06 2010
@@ -53,6 +53,7 @@
 )
 {
   ISR_Level   level;
+  Chain_Node *inactive_head;
   Chain_Node *inactive_first;
   Chain_Node *message_queue_first;
   Chain_Node *message_queue_last;
@@ -86,15 +87,15 @@
    */
 
   _ISR_Disable( level );
-    inactive_first      = the_message_queue->Inactive_messages.first;
-    message_queue_first = the_message_queue->Pending_messages.first;
-    message_queue_last  = the_message_queue->Pending_messages.last;
+    inactive_head = _Chain_Head( &the_message_queue->Inactive_messages );
+    inactive_first = inactive_head->next;;
+    message_queue_first = _Chain_First( &the_message_queue->Pending_messages );
+    message_queue_last = _Chain_Last( &the_message_queue->Pending_messages );
 
-    the_message_queue->Inactive_messages.first = message_queue_first;
+    inactive_head->next = message_queue_first;
     message_queue_last->next = inactive_first;
     inactive_first->previous = message_queue_last;
-    message_queue_first->previous          =
-               _Chain_Head( &the_message_queue->Inactive_messages );
+    message_queue_first->previous = inactive_head;
 
     _Chain_Initialize_empty( &the_message_queue->Pending_messages );
 

diff -u rtems/cpukit/score/src/coremsginsert.c:1.11 rtems/cpukit/score/src/coremsginsert.c:1.12
--- rtems/cpukit/score/src/coremsginsert.c:1.11	Wed Aug 25 15:48:43 2010
+++ rtems/cpukit/score/src/coremsginsert.c	Thu Nov 25 03:27:06 2010
@@ -99,7 +99,7 @@
 
       the_priority = _CORE_message_queue_Get_message_priority(the_message);
       the_header = &the_message_queue->Pending_messages;
-      the_node = the_header->first;
+      the_node = _Chain_First( the_header );
       while ( !_Chain_Is_tail( the_header, the_node ) ) {
         int this_priority;
 

diff -u rtems/cpukit/score/src/objectshrinkinformation.c:1.9 rtems/cpukit/score/src/objectshrinkinformation.c:1.10
--- rtems/cpukit/score/src/objectshrinkinformation.c:1.9	Tue Jul  7 17:47:03 2009
+++ rtems/cpukit/score/src/objectshrinkinformation.c	Thu Nov 25 03:27:06 2010
@@ -69,7 +69,7 @@
       /*
        *  Assume the Inactive chain is never empty at this point
        */
-      the_object = (Objects_Control *) information->Inactive.first;
+      the_object = (Objects_Control *) _Chain_First( &information->Inactive );
 
       do {
          index = _Objects_Get_index( the_object->id );

diff -u rtems/cpukit/score/src/schedulerpriorityyield.c:1.1 rtems/cpukit/score/src/schedulerpriorityyield.c:1.2
--- rtems/cpukit/score/src/schedulerpriorityyield.c:1.1	Wed Nov 24 09:51:28 2010
+++ rtems/cpukit/score/src/schedulerpriorityyield.c	Thu Nov 25 03:27:06 2010
@@ -67,7 +67,7 @@
       _ISR_Flash( level );
 
       if ( _Thread_Is_heir( executing ) )
-        _Thread_Heir = (Thread_Control *) ready->first;
+        _Thread_Heir = (Thread_Control *) _Chain_First( ready );
       _Thread_Dispatch_necessary = true;
     }
     else if ( !_Thread_Is_heir( executing ) )

diff -u rtems/cpukit/score/src/threadqdequeuepriority.c:1.9 rtems/cpukit/score/src/threadqdequeuepriority.c:1.10
--- rtems/cpukit/score/src/threadqdequeuepriority.c:1.9	Tue Jan 22 15:19:18 2008
+++ rtems/cpukit/score/src/threadqdequeuepriority.c	Thu Nov 25 03:27:06 2010
@@ -50,6 +50,8 @@
   ISR_Level       level;
   Thread_Control *the_thread = NULL;  /* just to remove warnings */
   Thread_Control *new_first_thread;
+  Chain_Node     *head;
+  Chain_Node     *tail;
   Chain_Node     *new_first_node;
   Chain_Node     *new_second_node;
   Chain_Node     *last_node;
@@ -61,8 +63,9 @@
        index < TASK_QUEUE_DATA_NUMBER_OF_PRIORITY_HEADERS ;
        index++ ) {
     if ( !_Chain_Is_empty( &the_thread_queue->Queues.Priority[ index ] ) ) {
-      the_thread = (Thread_Control *)
-                    the_thread_queue->Queues.Priority[ index ].first;
+      the_thread = (Thread_Control *) _Chain_First(
+        &the_thread_queue->Queues.Priority[ index ]
+      );
       goto dequeue;
     }
   }
@@ -75,13 +78,13 @@
 
 dequeue:
   the_thread->Wait.queue = NULL;
-  new_first_node   = the_thread->Wait.Block2n.first;
+  new_first_node   = _Chain_First( &the_thread->Wait.Block2n );
   new_first_thread = (Thread_Control *) new_first_node;
   next_node        = the_thread->Object.Node.next;
   previous_node    = the_thread->Object.Node.previous;
 
   if ( !_Chain_Is_empty( &the_thread->Wait.Block2n ) ) {
-    last_node       = the_thread->Wait.Block2n.last;
+    last_node       = _Chain_Last( &the_thread->Wait.Block2n );
     new_second_node = new_first_node->next;
 
     previous_node->next      = new_first_node;
@@ -91,13 +94,13 @@
 
     if ( !_Chain_Has_only_one_node( &the_thread->Wait.Block2n ) ) {
                                                 /* > two threads on 2-n */
-      new_second_node->previous =
-                _Chain_Head( &new_first_thread->Wait.Block2n );
+      head = _Chain_Head( &new_first_thread->Wait.Block2n );
+      tail = _Chain_Tail( &new_first_thread->Wait.Block2n );
 
-      new_first_thread->Wait.Block2n.first = new_second_node;
-      new_first_thread->Wait.Block2n.last  = last_node;
-
-      last_node->next = _Chain_Tail( &new_first_thread->Wait.Block2n );
+      new_second_node->previous = head;
+      head->next = new_second_node;
+      tail->previous = last_node;
+      last_node->next = tail;
     }
   } else {
     previous_node->next = next_node;

diff -u rtems/cpukit/score/src/threadqenqueuepriority.c:1.11 rtems/cpukit/score/src/threadqenqueuepriority.c:1.12
--- rtems/cpukit/score/src/threadqenqueuepriority.c:1.11	Fri Jul 10 15:32:48 2009
+++ rtems/cpukit/score/src/threadqenqueuepriority.c	Thu Nov 25 03:27:06 2010
@@ -80,7 +80,7 @@
 restart_forward_search:
   search_priority = PRIORITY_MINIMUM - 1;
   _ISR_Disable( level );
-  search_thread = (Thread_Control *) header->first;
+  search_thread = (Thread_Control *) _Chain_First( header );
   while ( !_Chain_Is_tail( header, (Chain_Node *)search_thread ) ) {
     search_priority = search_thread->current_priority;
     if ( priority <= search_priority )
@@ -128,7 +128,7 @@
   search_priority     = PRIORITY_MAXIMUM + 1;
 
   _ISR_Disable( level );
-  search_thread = (Thread_Control *) header->last;
+  search_thread = (Thread_Control *) _Chain_Last( header );
   while ( !_Chain_Is_head( header, (Chain_Node *)search_thread ) ) {
     search_priority = search_thread->current_priority;
     if ( priority >= search_priority )

diff -u rtems/cpukit/score/src/threadqextractpriority.c:1.10 rtems/cpukit/score/src/threadqextractpriority.c:1.11
--- rtems/cpukit/score/src/threadqextractpriority.c:1.10	Tue Dec 30 21:36:04 2008
+++ rtems/cpukit/score/src/threadqextractpriority.c	Thu Nov 25 03:27:06 2010
@@ -50,6 +50,8 @@
 )
 {
   ISR_Level       level;
+  Chain_Node     *head;
+  Chain_Node     *tail;
   Chain_Node     *the_node;
   Chain_Node     *next_node;
   Chain_Node     *previous_node;
@@ -73,9 +75,9 @@
   previous_node = the_node->previous;
 
   if ( !_Chain_Is_empty( &the_thread->Wait.Block2n ) ) {
-    new_first_node   = the_thread->Wait.Block2n.first;
+    new_first_node   = _Chain_First( &the_thread->Wait.Block2n );
     new_first_thread = (Thread_Control *) new_first_node;
-    last_node        = the_thread->Wait.Block2n.last;
+    last_node        = _Chain_Last( &the_thread->Wait.Block2n );
     new_second_node  = new_first_node->next;
 
     previous_node->next      = new_first_node;
@@ -85,12 +87,13 @@
 
     if ( !_Chain_Has_only_one_node( &the_thread->Wait.Block2n ) ) {
                                         /* > two threads on 2-n */
-      new_second_node->previous =
-                _Chain_Head( &new_first_thread->Wait.Block2n );
-      new_first_thread->Wait.Block2n.first = new_second_node;
+      head = _Chain_Head( &new_first_thread->Wait.Block2n );
+      tail = _Chain_Tail( &new_first_thread->Wait.Block2n );
 
-      new_first_thread->Wait.Block2n.last = last_node;
-      last_node->next = _Chain_Tail( &new_first_thread->Wait.Block2n );
+      new_second_node->previous = head;
+      head->next = new_second_node;
+      tail->previous = last_node;
+      last_node->next = tail;
     }
   } else {
     previous_node->next = next_node;

diff -u rtems/cpukit/score/src/threadqfirstfifo.c:1.6 rtems/cpukit/score/src/threadqfirstfifo.c:1.7
--- rtems/cpukit/score/src/threadqfirstfifo.c:1.6	Tue Jan 22 12:28:53 2008
+++ rtems/cpukit/score/src/threadqfirstfifo.c	Thu Nov 25 03:27:06 2010
@@ -44,7 +44,7 @@
 )
 {
   if ( !_Chain_Is_empty( &the_thread_queue->Queues.Fifo ) )
-    return (Thread_Control *) the_thread_queue->Queues.Fifo.first;
+    return (Thread_Control *) _Chain_First( &the_thread_queue->Queues.Fifo );
 
   return NULL;
 }

diff -u rtems/cpukit/score/src/threadqfirstpriority.c:1.6 rtems/cpukit/score/src/threadqfirstpriority.c:1.7
--- rtems/cpukit/score/src/threadqfirstpriority.c:1.6	Tue Jan 22 12:28:53 2008
+++ rtems/cpukit/score/src/threadqfirstpriority.c	Thu Nov 25 03:27:06 2010
@@ -49,8 +49,9 @@
        index < TASK_QUEUE_DATA_NUMBER_OF_PRIORITY_HEADERS ;
        index++ ) {
     if ( !_Chain_Is_empty( &the_thread_queue->Queues.Priority[ index ] ) )
-      return (Thread_Control *)
-        the_thread_queue->Queues.Priority[ index ].first;
+      return (Thread_Control *) _Chain_First(
+        &the_thread_queue->Queues.Priority[ index ]
+      );
   }
   return NULL;
 }

diff -u rtems/cpukit/score/src/threadyieldprocessor.c:1.6 rtems/cpukit/score/src/threadyieldprocessor.c:1.7
--- rtems/cpukit/score/src/threadyieldprocessor.c:1.6	Fri Jul 30 13:53:06 2010
+++ rtems/cpukit/score/src/threadyieldprocessor.c	Thu Nov 25 03:27:06 2010
@@ -66,7 +66,7 @@
       _ISR_Flash( level );
 
       if ( _Thread_Is_heir( executing ) )
-        _Thread_Heir = (Thread_Control *) ready->first;
+        _Thread_Heir = (Thread_Control *) _Chain_First( ready );
       _Thread_Dispatch_necessary = true;
     }
     else if ( !_Thread_Is_heir( executing ) )

diff -u rtems/cpukit/score/src/userextthreadbegin.c:1.4 rtems/cpukit/score/src/userextthreadbegin.c:1.5
--- rtems/cpukit/score/src/userextthreadbegin.c:1.4	Mon Oct 12 07:16:22 2009
+++ rtems/cpukit/score/src/userextthreadbegin.c	Thu Nov 25 03:27:06 2010
@@ -31,7 +31,7 @@
   Chain_Node              *the_node;
   User_extensions_Control *the_extension;
 
-  for ( the_node = _User_extensions_List.first ;
+  for ( the_node = _Chain_First( &_User_extensions_List );
         !_Chain_Is_tail( &_User_extensions_List, the_node ) ;
         the_node = the_node->next ) {
 
@@ -49,7 +49,7 @@
   Chain_Node              *the_node;
   User_extensions_Control *the_extension;
 
-  for ( the_node = _User_extensions_List.last ;
+  for ( the_node = _Chain_Last( &_User_extensions_List );
         !_Chain_Is_head( &_User_extensions_List, the_node ) ;
         the_node = the_node->previous ) {
 
@@ -69,7 +69,7 @@
   Chain_Node              *the_node;
   User_extensions_Control *the_extension;
 
-  for ( the_node = _User_extensions_List.last ;
+  for ( the_node = _Chain_Last( &_User_extensions_List );
         !_Chain_Is_head( &_User_extensions_List, the_node ) ;
         the_node = the_node->previous ) {
 

diff -u rtems/cpukit/score/src/userextthreadcreate.c:1.4 rtems/cpukit/score/src/userextthreadcreate.c:1.5
--- rtems/cpukit/score/src/userextthreadcreate.c:1.4	Fri Sep 25 12:51:46 2009
+++ rtems/cpukit/score/src/userextthreadcreate.c	Thu Nov 25 03:27:06 2010
@@ -32,7 +32,7 @@
   User_extensions_Control *the_extension;
   bool                     status;
 
-  for ( the_node = _User_extensions_List.first ;
+  for ( the_node = _Chain_First( &_User_extensions_List );
         !_Chain_Is_tail( &_User_extensions_List, the_node ) ;
         the_node = the_node->next ) {
 

diff -u rtems/cpukit/score/src/userextthreaddelete.c:1.2 rtems/cpukit/score/src/userextthreaddelete.c:1.3
--- rtems/cpukit/score/src/userextthreaddelete.c:1.2	Fri Sep 25 12:51:46 2009
+++ rtems/cpukit/score/src/userextthreaddelete.c	Thu Nov 25 03:27:06 2010
@@ -31,7 +31,7 @@
   Chain_Node              *the_node;
   User_extensions_Control *the_extension;
 
-  for ( the_node = _User_extensions_List.last ;
+  for ( the_node = _Chain_Last( &_User_extensions_List );
         !_Chain_Is_head( &_User_extensions_List, the_node ) ;
         the_node = the_node->previous ) {
 

diff -u rtems/cpukit/score/src/userextthreadrestart.c:1.2 rtems/cpukit/score/src/userextthreadrestart.c:1.3
--- rtems/cpukit/score/src/userextthreadrestart.c:1.2	Fri Sep 25 12:51:46 2009
+++ rtems/cpukit/score/src/userextthreadrestart.c	Thu Nov 25 03:27:06 2010
@@ -31,7 +31,7 @@
   Chain_Node              *the_node;
   User_extensions_Control *the_extension;
 
-  for ( the_node = _User_extensions_List.first ;
+  for ( the_node = _Chain_First( &_User_extensions_List );
         !_Chain_Is_tail( &_User_extensions_List, the_node ) ;
         the_node = the_node->next ) {
 

diff -u rtems/cpukit/score/src/userextthreadstart.c:1.2 rtems/cpukit/score/src/userextthreadstart.c:1.3
--- rtems/cpukit/score/src/userextthreadstart.c:1.2	Fri Sep 25 12:51:46 2009
+++ rtems/cpukit/score/src/userextthreadstart.c	Thu Nov 25 03:27:06 2010
@@ -31,7 +31,7 @@
   Chain_Node              *the_node;
   User_extensions_Control *the_extension;
 
-  for ( the_node = _User_extensions_List.first ;
+  for ( the_node = _Chain_First( &_User_extensions_List );
         !_Chain_Is_tail( &_User_extensions_List, the_node ) ;
         the_node = the_node->next ) {
 

diff -u rtems/cpukit/score/src/userextthreadswitch.c:1.3 rtems/cpukit/score/src/userextthreadswitch.c:1.4
--- rtems/cpukit/score/src/userextthreadswitch.c:1.3	Sun Nov 29 07:51:52 2009
+++ rtems/cpukit/score/src/userextthreadswitch.c	Thu Nov 25 03:27:06 2010
@@ -32,7 +32,7 @@
   Chain_Node                     *the_node;
   User_extensions_Switch_control *the_extension_switch;
 
-  for ( the_node = _User_extensions_Switches_list.first ;
+  for ( the_node = _Chain_First( &_User_extensions_Switches_list );
         !_Chain_Is_tail( &_User_extensions_Switches_list, the_node ) ;
         the_node = the_node->next ) {
 

diff -u rtems/cpukit/score/src/watchdogreportchain.c:1.1 rtems/cpukit/score/src/watchdogreportchain.c:1.2
--- rtems/cpukit/score/src/watchdogreportchain.c:1.1	Wed Nov 26 10:33:30 2008
+++ rtems/cpukit/score/src/watchdogreportchain.c	Thu Nov 25 03:27:06 2010
@@ -34,7 +34,7 @@
   _ISR_Disable( level );
     printk( "Watchdog Chain: %s %p\n", name, header );
     if ( !_Chain_Is_empty( header ) ) {
-      for ( node = header->first ;
+      for ( node = _Chain_First( header ) ;
             node != _Chain_Tail(header) ;
             node = node->next )
       {



--

Generated by Deluxe Loginfo [http://www.codewiz.org/projects/index.html#loginfo] 2.122 by Bernardo Innocenti <bernie at develer.com>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.rtems.org/pipermail/vc/attachments/20101125/1f0c89bc/attachment.html>


More information about the vc mailing list